AFTD Auto-Formalizing Theoretical Domains

rank_score_veto_core_hall_condition

def

For natural numbers m, n1, and n2, a hypothesis hm : 2 ≤ m, and a scoring function s : Fin m → ℚ, rank_score_veto_core_hall_condition m hm s n1 n2 is the proposition asserting that (n2 : ℚ) / (n1 + n2 : ℚ) ≤ ((n1 : ℚ) * (scoring_norm_one s - scoring_last m hm s) + (n2 : ℚ) * (scoring_norm_one s - 1)) / ((n1 + n2 : ℚ) * scoring_norm_one s).

Statement

def rank_score_veto_core_hall_condition (m : ℕ) (hm : 2 ≤ m) (s : Fin m → ℚ) (n₁ n₂ : ℕ) : Prop
Defined in
arXiv:2610.26535 Lemma 5
Verified
22 Oct 2026
Axioms
none listed
Built on 2
  • scoring_norm_oneThe 1-norm of a scoring vector s in Q^m is the sum of its entries.
  • scoring_lastGiven a natural number m with 2 ≤ m and a scoring vector s : Fin m → ℚ, scoring_last m hm s is the value of s at the last index m - 1.
Used by 1

Read back from the Lean

rank_score_veto_core_hall_condition m hm s n₁ n₂ is the proposition (parameterized by a natural number m, a proof hm : 2 ≤ m, a score vector s : Fin m → ℚ, and natural numbers n₁ and n₂) asserting that: (n₂ : ℚ) / (n₁ + n₂ : ℚ) ≤ ((n₁ : ℚ) * (scoring_norm_one s - scoring_last m hm s) + (n₂ : ℚ) * (scoring_norm_one s - 1)) / ((n₁ + n₂ : ℚ) * scoring_norm_one s) where scoring_norm_one s is the sum ∑ i : Fin m, s i, and scoring_last m hm s is s evaluated at the index m - 1 (as an element of Fin 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 fractional matching inequality for candidate b1 in the 1D voter configuration. -/
def rank_score_veto_core_hall_condition (m : ℕ) (hm : 2 ≤ m) (s : Fin m → ℚ) (n₁ n₂ : ℕ) : Prop :=
  (n₂ : ℚ) / (n₁ + n₂ : ℚ) ≤
    ((n₁ : ℚ) * (scoring_norm_one s - scoring_last m hm s) + (n₂ : ℚ) * (scoring_norm_one s - 1)) /
      ((n₁ + n₂ : ℚ) * scoring_norm_one s)
See it in the graphDiscuss this resultChallenge it