SocialChoice.Voting.finThreeRankOrder
defimported Lean
SocialChoice.Voting.finThreeRankOrder
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 noncomputable def SocialChoice.Voting.finThreeRankOrder (r : Fin 3 → Nat) (hr : Function.Injective r) : LinearOrder (Fin 3)
- Defined in
- EconCSLib, `SocialChoice.Voting.finThreeRankOrder`
- 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.finThreeRankOrder← SocialChoice.Voting.finThreeRankOrder (EconCSLib/SocialChoice/Voting/VotingRules.lean:280): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.ballotFromInjectivePull a linear order back along an injective map, using the supplied codomain order explicitly rather than relying on ambient typeclass…
- Used by 1
- SocialChoice.Voting.condorcetCycleProfileThe standard Condorcet cycle profile: voter 0 ranks
0 > 1 > 2, voter 1 ranks1 > 2 > 0, and voter 2 ranks2 > 0 > 1.
- SocialChoice.Voting.condorcetCycleProfileThe standard Condorcet cycle profile: voter 0 ranks
Lean source view module on GitHub
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 noncomputable def SocialChoice.Voting.finThreeRankOrder (r : Fin 3 → Nat) (hr : Function.Injective r) : LinearOrder (Fin 3) := ballotFromInjective (inferInstance : LinearOrder Nat) r hr