Anonymity
def
For a voting rule f : (Fin n → X) → X on n voters, f satisfies anonymity if for every profile t : Fin n → X and every permutation σ : Equiv.Perm (Fin n), f (t ∘ σ) = f t.
Statement
def Anonymity {n : ℕ} {X : Type*} (f : (Fin n → X) → X) : Prop
- Defined in
- scout/2611-18282-safe-manipulation-of-tops-only-voting-rules.md:352
- Verified
- 16 Nov 2026
- Axioms
- none listed
Read back from the Lean
For a natural number n, a type X, and a function f : (Fin n → X) → X, Anonymity f asserts that for every function t : Fin n → X and every permutation σ : Equiv.Perm (Fin n), f (t ∘ σ) = f t. That is, f is invariant under permuting the arguments of its input.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Anonymity for tops-only voting rules on Fin n. -/ def Anonymity {n : ℕ} {X : Type*} (f : (Fin n → X) → X) : Prop := ∀ (t : Fin n → X) (σ : Equiv.Perm (Fin n)), f (t ∘ σ) = f t