SocialChoice.Voting.topKey
defimported Lean
SocialChoice.Voting.topKey
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in noncomputable def SocialChoice.Voting.topKey [Fintype A] (r : LinearOrder A) (y a : A) : Nat
- Defined in
- EconCSLib, `SocialChoice.Voting.topKey`
- 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.topKey← SocialChoice.Voting.topKey (EconCSLib/SocialChoice/Voting/Decisive.lean:155): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.rank
rank r ais the number of alternatives strictly aboveain ballotr.
- Used by 4
- SocialChoice.Voting.topBallot_topSocialChoice.Voting.topBallot_top
- SocialChoice.Voting.topBallot_preservesSocialChoice.Voting.topBallot_preserves
- SocialChoice.Voting.topBallotSocialChoice.Voting.topBallot
- SocialChoice.Voting.topKey_injectiveSocialChoice.Voting.topKey_injective
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N A : Type*} in noncomputable def SocialChoice.Voting.topKey [Fintype A] (r : LinearOrder A) (y a : A) : Nat := if a = y then 0 else rank r a + 1