AFTD Auto-Formalizing Theoretical Domains

plurality_votes

def

Given a preference profile prof assigning a linear order over candidates C to each voter in V, the plurality count of candidate c is the number of voters who rank c at the top.

Statement

noncomputable def plurality_votes {V C : Type*} [Fintype V]
    (prof : V → LinearOrder C) (c : C) : ℕ
Defined in
arXiv:2610.26535, Section 2.2
Verified
01 Nov 2026
Axioms
none listed
Built on 2
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 1
  • regularized_plurality_weightFor finite voter type V, finite candidate type C, a profile prof : V → LinearOrder C, regularization strength ε : ℝ, and candidate c : C,…

Read back from the Lean

Given types V and C with V finite ([Fintype V]), a profile prof : V → LinearOrder C assigning a linear order on C to each voter v : V, and an element c : C, plurality_votes prof c is the number of voters v ∈ V for whom c is the greatest element under the linear order prof v (i.e., IsTop c holds in the 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 number of voters ranking candidate c first in an election profile. -/
noncomputable def plurality_votes {V C : Type*} [Fintype V]
    (prof : V → LinearOrder C) (c : C) : ℕ :=
  open Classical in
  (Finset.univ.filter (fun v => letI := prof v; IsTop c)).card
See it in the graphDiscuss this resultChallenge it