AFTD Auto-Formalizing Theoretical Domains

regularized_plurality_weight

def

For finite voter type V, finite candidate type C, a profile prof : V → LinearOrder C, regularization strength ε : ℝ, and candidate c : C, regularized_plurality_weight prof ε c is ((plurality_votes prof c : ℝ) / (Fintype.card V : ℝ) + ε) / (1 + (Fintype.card C : ℝ) * ε).

Statement

noncomputable def regularized_plurality_weight {V C : Type*} [Fintype V] [Fintype C]
    (prof : V → LinearOrder C) (ε : ℝ) (c : C) : ℝ
Defined in
arXiv:2610.26535, Definition 4(1)
Verified
01 Nov 2026
Axioms
none listed
Built on 1
  • plurality_votesGiven a preference profile prof assigning a linear order over candidates C to each voter in V, the plurality count of candidate c is the…
Used by 2

Read back from the Lean

regularized_plurality_weight defines a real number for finite types V (voters) and C (candidates), a profile prof : V → LinearOrder C associating each voter with a linear order on C, a real parameter ε, and a candidate c : C. It computes the ratio: $$\frac{\frac{\text{plurality\_votes}(\mathrm{prof}, c)}{|V|} + \varepsilon}{1 + |C| \cdot \varepsilon}$$ where $\text{plurality\_votes}(\mathrm{prof}, c)$ is the number of voters $v \in V$ for whom $c$ is the maximum (top) element of $C$ under the linear order $\mathrm{prof}(v)$, $|V|$ is Fintype.card V, and $|C|$ is Fintype.card C.

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 regularized plurality weight of candidate c with regularization strength epsilon. -/
noncomputable def regularized_plurality_weight {V C : Type*} [Fintype V] [Fintype C]
    (prof : V → LinearOrder C) (ε : ℝ) (c : C) : ℝ :=
  ((plurality_votes prof c : ℝ) / (Fintype.card V : ℝ) + ε) / (1 + (Fintype.card C : ℝ) * ε)
See it in the graphDiscuss this resultChallenge it