SocialChoice.Voting.Neutrality
defimported Lean
Neutrality: relabeling candidates relabels the winner set.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in variable [Fintype N] [Fintype A] in def SocialChoice.Voting.Neutrality (f : VotingRule N A) : Prop
- Defined in
- EconCSLib, `SocialChoice.Voting.Neutrality`
- 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.Neutrality← SocialChoice.Voting.Neutrality (EconCSLib/SocialChoice/Voting/Basic.lean:294): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.permuteCandidatesRelabel candidates by applying the inverse permutation to each ballot.
- SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
- SocialChoice.Voting.permuteWinnersCandidate renaming on winner sets.
- SocialChoice.Voting.VotingRuleA set-valued voting rule on fixed finite voter and candidate types.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in variable [Fintype N] [Fintype A] in /-- Neutrality: relabeling candidates relabels the winner set. -/ def SocialChoice.Voting.Neutrality (f : VotingRule N A) : Prop := ∀ (P : Profile N A) (σ : Equiv.Perm A), permuteWinners σ (f P) = f (permuteCandidates P σ)