plurality_regularization_threshold
def
For numbers of voters n and candidates m, plurality_regularization_threshold n m is 1 / ((m - 2 : ℝ) * n - 2 * m).
Statement
noncomputable def plurality_regularization_threshold (n m : ℕ) : ℝ
- Defined in
- OP-799
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 1
- plurality_regularization_threshold_posFor any number of candidates m ≥ 3 and number of voters n ≥ max(8, m), the plurality regularization threshold…
Read back from the Lean
A definition of a function plurality_regularization_threshold that takes two natural numbers $n$ and $m$ and returns the real number
$$\frac{1}{(m - 2)n - 2m}$$
where $m$ and $n$ are coerced to real numbers and all operations (subtraction, multiplication, and division) are performed in $\mathbb{R}$.
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 exact regularization threshold 1 / ((m - 2) * n - 2 * m) for n voters and m candidates. -/ noncomputable def plurality_regularization_threshold (n m : ℕ) : ℝ := 1 / ((m - 2 : ℝ) * n - 2 * m)