AFTD Auto-Formalizing Theoretical Domains

coalition_dominated_candidates

def

For finite candidate type C with decidable equality, voter type V, an election profile prof : V → LinearOrder C, a candidate a : C, and a finite set of voters S : Finset V, coalition_dominated_candidates prof a S is the Finset of candidates c in C such that there exists some voter v in S for whom (prof v).le c a.

Statement

def coalition_dominated_candidates {V C : Type*} [Fintype C] [DecidableEq C]
    (prof : V → LinearOrder C) (a : C) (S : Finset V) : Finset C
Defined in
arXiv:2610.26535, Section 2.2
Verified
01 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

Given types V and C (with C finite and having decidable equality), a profile prof : V → LinearOrder C assigning a linear order on C to each voter in V, a candidate a : C, and a finite coalition of voters S : Finset V, coalition_dominated_candidates prof a S is the finite set of candidates c : C such that there exists some voter v ∈ S for whom c ≤ a according to the linear order prof v.

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

/-- The set of candidates ranked weakly below candidate a by at least one voter in coalition S. -/
def coalition_dominated_candidates {V C : Type*} [Fintype C] [DecidableEq C]
    (prof : V → LinearOrder C) (a : C) (S : Finset V) : Finset C :=
  S.biUnion (fun v => Finset.univ.filter (fun c => (prof v).le c a))
See it in the graphDiscuss this resultChallenge it