AFTD Auto-Formalizing Theoretical Domains

plurality_regularization_threshold_pos

lemmaverified

For any number of candidates m ≥ 3 and number of voters n ≥ max(8, m), the plurality regularization threshold plurality_regularization_threshold n m = 1 / ((m - 2)n - 2m) is strictly positive.

Statement

theorem plurality_regularization_threshold_pos (m n : ℕ) (hm : 3 ≤ m) (hn : max 8 m ≤ n) : 0 < plurality_regularization_threshold n m
Source
folklore
Verified
01 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1

Read back from the Lean

For any natural numbers $m$ and $n$, if $3 \le m$ and $\max(8, m) \le n$, then $0 < \text{plurality\_regularization\_threshold}(n, m)$.

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 plurality regularization threshold is strictly positive for m ≥ 3 and n ≥ max(8, m). -/
theorem plurality_regularization_threshold_pos (m n : ℕ) (hm : 3 ≤ m) (hn : max 8 m ≤ n) : 0 < plurality_regularization_threshold n m := by
  unfold plurality_regularization_threshold
  rw [one_div_pos]
  have hmR : (3 : ℝ) ≤ m := by exact_mod_cast hm
  have hn8 : 8 ≤ n := le_of_max_le_left hn
  have hnR : (8 : ℝ) ≤ n := by exact_mod_cast hn8
  nlinarith
See it in the graphDiscuss this resultChallenge it