AFTD Auto-Formalizing Theoretical Domains

wild_partition_vertex_mass_279_certificate

theoremverified

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

Statement

theorem wild_partition_vertex_mass_279_certificate :
    ∑ m ∈ Finset.range 94, ((Nat.choose 93 m : ℕ) : ℚ) *
      (if 1 ≤ m ∧ m ≤ 46 then ((((3 * m).factorial * (if (3 * m) % 2 = 1 then Nat.choose 139 (3 * m / 2) else 0)
        + 278 * ((3 * m).factorial * Nat.choose 138 (3 * m / 2 - 1)) : ℕ) : ℚ)) *
        ((323 / 279 : ℚ) ^ (3 * m) / ((Nat.descFactorial 279 (3 * m) : ℕ) : ℚ)) 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 asserts an explicit numerical upper bound of 701/10000 on a finite rational sum representing a local-lemma event mass for n = 279. The proof first expresses all binomial coefficients in terms of falling factorials and ordinary factorials. Because the resulting expression contains no free variables, the inequality is then verified directly by kernel computation.

  1. The binomial coefficients in the sum are rewritten in terms of falling factorials and factorials.

    Using Nat.choose_eq_descFactorial_div_factorial, each binomial coefficient C(n, k) in the summand is replaced by the falling factorial (n)_k divided by k!. This puts the expression into a form amenable to kernel computation.

    line 6

    uses Nat.choose_eq_descFactorial_div_factorial

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

    Because the sum is taken over the finite range m ∈ {0, ..., 93} and contains only explicit rational and natural-number arithmetic, the proposition is decidable. The kernel evaluates the finite sum and checks that the rational result is at most 701/10000.

    line 7

      decide +kernel
Nat.choose_eq_descFactorial_div_factorial
The binomial coefficient C(n, k) is equal to the falling factorial (n)_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_vertex_mass_279_certificate :    ∑ m ∈ Finset.range 94, ((Nat.choose 93 m : ℕ) : ℚ) *      (if 1 ≤ m ∧ m ≤ 46 then ((((3 * m).factorial * (if (3 * m) % 2 = 1 then Nat.choose 139 (3 * m / 2) else 0)        + 278 * ((3 * m).factorial * Nat.choose 138 (3 * m / 2 - 1)) : ℕ) : ℚ)) *        ((323 / 279 : ℚ) ^ (3 * m) / ((Nat.descFactorial 279 (3 * m) : ℕ) : ℚ)) else 0) ≤ 701 / 10000 := by  simp only [Nat.choose_eq_descFactorial_div_factorial]  decide +kernel
See it in the graphDiscuss this resultChallenge it