AFTD Auto-Formalizing Theoretical Domains

is_condorcet_winning_set

def

With n voters holding strict rankings of m candidates, S is a Condorcet winning set if for every candidate a ∉ S, strictly fewer than n/2 voters rank a above every member of S (equivalently, a strict majority prefers some member of S to a).

Statement

def is_condorcet_winning_set {n m : ℕ} (P : Fin n → Equiv.Perm (Fin m)) (S : Finset (Fin m)) :
    Prop
Defined in
Condorcet winning sets (Social Choice and Welfare 44(3):493-517, 2015), definition of Condorcet winning sets and Condorcet dimension
Verified
06 Oct 2026
Axioms
none listed
Used by 29

Lean source view module on GitHub

/-- A Condorcet winning set in the election where voter `v` ranks candidate `c` at position `P v c` (position 0 is the top): for every candidate `a` outside `S`, strictly fewer than half of the voters rank `a` above every member of `S`. -/
def is_condorcet_winning_set {n m : ℕ} (P : Fin n → Equiv.Perm (Fin m)) (S : Finset (Fin m)) :
    Prop :=
  ∀ a, a ∉ S → 2 * (Finset.univ.filter fun v => ∀ b ∈ S, P v a < P v b).card < n
See it in the graphDiscuss this resultChallenge it