wild_partition_event_mass_279_certificate
The exact rational sum of weighted per-position seal-event masses at n=279 and a=323/279 is at most 701/10000, and a*(1-701/10000)^2 is at least one. This is an arithmetic certificate, not a bound on the wild number.
Statement
theorem wild_partition_event_mass_279_certificate :
(∑ h ∈ Finset.range 47,
(3 * h : ℚ) * (Nat.choose 93 h : ℚ) *
(Nat.choose 139 (3 * h / 2) : ℚ) / (Nat.choose 279 (3 * h) : ℚ) *
(323 / 279 : ℚ) ^ (3 * h)) ≤ 701 / 10000 ∧
(323 / 279 : ℚ) * (1 - 701 / 10000) ^ 2 ≥ 1- Source
- Arithmetic helper for the proposed OP-306 permutation-local-lemma proof; arXiv:2610.22142, Section 3.3.2 (seals), and experiments 4503 and 4505. The term h=0 is zero; h=1..46 represents the smaller side of every possible seal cut in 93 triple blocks.
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- wild_number_complete_graph_279_min_proper_coloring_eqNew case of OP-306: every minimum proper edge colouring of K_279 has wild number 186 = floor(4*ceil(279/2)/3). The lower bound is the…
The proof, explained
The certificate establishes two rational arithmetic inequalities: an upper bound on a finite sum of 47 weighted partition-event masses, and a lower bound showing that the scaling factor a = 323/279 compensates for this event mass. The proof splits the conjunction into the two claims; the finite sum is verified by rewriting binomial coefficients in terms of descending factorials and evaluating the sum via kernel computation, while the second inequality is evaluated directly by rational arithmetic normalization.
The proof reduces to two independent goals: the upper bound on the finite sum and the lower bound on the algebraic expression.
We apply `constructor` to split the conjunction into its left conjunct (the weighted sum inequality) and right conjunct (the scalar inequality).
constructorThe weighted combinatorial sum over 0 ≤ h < 47 is at most 701/10000. automation
We rewrite every binomial coefficient `n.choose k` into descending factorials divided by factorials (`Nat.descFactorial n k / k.factorial`) using `Nat.choose_eq_descFactorial_div_factorial`, which allows efficient arithmetic evaluation. Lean's kernel then evaluates the 47-term rational sum directly and decides that it is at most 701/10000.
uses
Nat.choose_eq_descFactorial_div_factorial· simp only [Nat.choose_eq_descFactorial_div_factorial] decide +kernel
(323 / 279) * (1 - 701 / 10000)^2 ≥ 1. automation
This is a purely numerical inequality of rational numbers. Computing the left-hand side yields (323 / 279) * (9299 / 10000)^2 = 27930262523 / 27900000000, which is strictly greater than 1; `norm_num` closes the goal by direct rational calculation.
· norm_num
Nat.choose_eq_descFactorial_div_factorial- For any natural numbers n and k, the binomial coefficient n choose k equals the descending factorial n(n - 1)...(n - k + 1) divided by k!
- The finite sum of 47 rational terms is certified by Lean's computational kernel (`decide +kernel`) after converting binomial coefficients into descending factorials, rather than through symbolic algebraic bounds.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem wild_partition_event_mass_279_certificate : (∑ h ∈ Finset.range 47, (3 * h : ℚ) * (Nat.choose 93 h : ℚ) * (Nat.choose 139 (3 * h / 2) : ℚ) / (Nat.choose 279 (3 * h) : ℚ) * (323 / 279 : ℚ) ^ (3 * h)) ≤ 701 / 10000 ∧ (323 / 279 : ℚ) * (1 - 701 / 10000) ^ 2 ≥ 1 := by constructor · simp only [Nat.choose_eq_descFactorial_div_factorial] decide +kernel · norm_num