SocialChoice.Voting.copeland_isTotal
theoremverifiedformalizationimported Lean
SocialChoice.Voting.copeland_isTotal
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in open Finset in open scoped BigOperators in variable {N A : Type*} in theorem SocialChoice.Voting.copeland_isTotal [Fintype N] [Fintype A] [Nonempty A] : IsTotal (N := N) (A := A) copeland
- Formalizes
- EconCSLib, `SocialChoice.Voting.copeland_isTotal`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.Voting.copeland_isTotal← SocialChoice.Voting.copeland_isTotal (EconCSLib/SocialChoice/Voting/VotingRules.lean:265): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
- SocialChoice.Voting.copelandCopeland winners.
- SocialChoice.Voting.IsTotalA voting rule is total if it always returns at least one winner.
- SocialChoice.Voting.copelandScoreCopeland score: pairwise majority wins minus pairwise majority losses.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Classical inopen Finset inopen scoped BigOperators invariable {N A : Type*} intheorem SocialChoice.Voting.copeland_isTotal [Fintype N] [Fintype A] [Nonempty A] : IsTotal (N := N) (A := A) copeland := by intro P classical have hA : (Finset.univ : Finset A).Nonempty := Finset.univ_nonempty let scoreSet : Finset Int := Finset.univ.image (fun a => copelandScore P a) have hScore : scoreSet.Nonempty := hA.image _ let maxScore : Int := scoreSet.max' hScore have hmem : maxScore ∈ scoreSet := Finset.max'_mem scoreSet hScore rcases Finset.mem_image.mp hmem with ⟨a, _, ha⟩ refine ⟨a, ?_⟩ simp [copeland, hA, scoreSet, maxScore, ha]