AFTD Auto-Formalizing Theoretical Domains

wild_partition_position_mass_279_certificate

theoremverified

For n=279 and a=323/279: the sum over block counts h=1..46 of 279*C(92,h-1)*(3h)!*C(139,floor(3h/2))*a^(3h)/(279)_(3h) is at most 701/10000 (the local-lemma event mass through one position). Arithmetic certificate.

Statement

theorem wild_partition_position_mass_279_certificate :
    ∑ m ∈ Finset.range 93, ((Nat.choose 92 m : ℕ) : ℚ) *
      (if m + 1 ≤ 46 then (279 : ℚ) * (((3 * (m + 1)).factorial * Nat.choose 139 (3 * (m + 1) / 2) : ℕ) : ℚ) *
        ((323 / 279 : ℚ) ^ (3 * (m + 1)) / ((Nat.descFactorial 279 (3 * (m + 1)) : ℕ) : ℚ)) else 0)
        ≤ 701 / 10000
Source
arXiv:2610.22142 (Wild number for spanning trees in complete and complete bipartite graphs), Section 6, Conjecture
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

The proof, explained

The theorem bounds an explicit finite sum of rational numbers—the local-lemma event mass certificate for n = 279—by 701/10000. The proof first re-expresses the binomial coefficients in terms of descending factorials and factorials, and then verifies the resulting closed rational inequality by direct kernel evaluation.

  1. The binomial coefficients in the summation are rewritten in terms of descending factorials and standard factorials.

    Rewriting with `Nat.choose_eq_descFactorial_div_factorial` converts every occurrence of `Nat.choose n k` into `Nat.descFactorial n k / Nat.factorial k`, putting the expression into an arithmetic form suited for kernel computation.

    line 6

    uses Nat.choose_eq_descFactorial_div_factorial

      simp only [Nat.choose_eq_descFactorial_div_factorial]
  2. The finite rational sum is at most 701/10000. automation

    The goal is now a closed inequality of rational numbers involving a finite sum over 93 terms. The `decide +kernel` tactic evaluates the rational arithmetic expression in the Lean kernel, verifying that the inequality holds.

    line 7

      decide +kernel
Nat.choose_eq_descFactorial_div_factorial
The binomial coefficient C(n, k) equals the falling factorial (descending factorial) of n of length k divided by k!.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem wild_partition_position_mass_279_certificate :    ∑ m ∈ Finset.range 93, ((Nat.choose 92 m : ℕ) : ℚ) *      (if m + 1 ≤ 46 then (279 : ℚ) * (((3 * (m + 1)).factorial * Nat.choose 139 (3 * (m + 1) / 2) : ℕ) : ℚ) *        ((323 / 279 : ℚ) ^ (3 * (m + 1)) / ((Nat.descFactorial 279 (3 * (m + 1)) : ℕ) : ℚ)) else 0)        ≤ 701 / 10000 := by  simp only [Nat.choose_eq_descFactorial_div_factorial]  decide +kernel
See it in the graphDiscuss this resultChallenge it