SocialChoice.Voting.permuteCandidates
defimported Lean
Relabel candidates by applying the inverse permutation to each ballot.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in noncomputable def SocialChoice.Voting.permuteCandidates [Fintype N] [Fintype A] (P : Profile N A) (σ : Equiv.Perm A) : Profile N A
- Defined in
- EconCSLib, `SocialChoice.Voting.permuteCandidates`
- 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.permuteCandidates← SocialChoice.Voting.permuteCandidates (EconCSLib/SocialChoice/Voting/Basic.lean:196): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- SocialChoice.Voting.BallotPrefers_ballotFromInjectiveSocialChoice.Voting.BallotPrefers_ballotFromInjective
- SocialChoice.Voting.ProfileA voting profile assigns each voter a strict linear order over alternatives.
- SocialChoice.Voting.relabelBallotRelabel a linear order along a permutation of alternatives.
- Used by 1
- SocialChoice.Voting.NeutralityNeutrality: relabeling candidates relabels the winner set.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in /-- Relabel candidates by applying the inverse permutation to each ballot. -/ noncomputable def SocialChoice.Voting.permuteCandidates [Fintype N] [Fintype A] (P : Profile N A) (σ : Equiv.Perm A) : Profile N A where pref := fun i => relabelBallot (P.pref i) σ.symm