AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Built on 3
Used by 1

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
See it in the graphDiscuss this resultChallenge it