SocialChoice.Voting.relabelBallot
defimported Lean
Relabel a linear order along a permutation of alternatives.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in variable {N A : Type*} in noncomputable def SocialChoice.Voting.relabelBallot (r : LinearOrder A) (σ : Equiv.Perm A) : LinearOrder A
- Defined in
- EconCSLib, `SocialChoice.Voting.relabelBallot`
- 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.relabelBallot← SocialChoice.Voting.relabelBallot (EconCSLib/SocialChoice/Voting/Basic.lean:185): 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.permuteCandidatesRelabel candidates by applying the inverse permutation to each ballot.
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 a linear order along a permutation of alternatives. -/ noncomputable def SocialChoice.Voting.relabelBallot (r : LinearOrder A) (σ : Equiv.Perm A) : LinearOrder A := by classical exact ballotFromInjective r σ σ.injective