MajorityCriterion
def
A tops-only voting rule f satisfies the majority criterion if whenever strictly more than n / 2 voters report x as their top, f selects x.
Statement
def MajorityCriterion {n : ℕ} {X : Type*} (f : (Fin n → X) → X) : Prop
- Defined in
- scout/2611-18282-safe-manipulation-of-tops-only-voting-rules.md:646
- Verified
- 16 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given a natural number n, a type X, and a function f : (Fin n → X) → X, MajorityCriterion f asserts that for every function t : Fin n → X and every element x : X, if the cardinality of the set of indices i : Fin n such that t i = x is strictly greater than n / 2 (natural number division), then f t = x.
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
/-- Majority criterion: an alternative reported by a strict majority of voters must win. -/ def MajorityCriterion {n : ℕ} {X : Type*} (f : (Fin n → X) → X) : Prop := open Classical in ∀ (t : Fin n → X) (x : X), n / 2 < Finset.card {i : Fin n | t i = x} → f t = x