SocialChoice.Voting.BottomRank
defimported Lean
Candidate a is bottom-ranked by voter i.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in def SocialChoice.Voting.BottomRank [Fintype N] [Fintype A] (P : Profile N A) (i : N) (a : A) : Prop
- Defined in
- EconCSLib, `SocialChoice.Voting.BottomRank`
- 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.BottomRank← SocialChoice.Voting.BottomRank (EconCSLib/SocialChoice/Voting/Basic.lean:135): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.PrefersVoter
istrictly prefersatobin profileP. - SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in /-- Candidate `a` is bottom-ranked by voter `i`. -/ def SocialChoice.Voting.BottomRank [Fintype N] [Fintype A] (P : Profile N A) (i : N) (a : A) : Prop := ∀ b : A, b ≠ a → Prefers P i b a