AFTD Auto-Formalizing Theoretical Domains

krawtchouk_sporadic_zero_five_five_three_five

theoremverified

The binary Krawtchouk polynomial P_4^8 evaluated at 3 equals 0, verifying that the quadruple (m, n, k, ℓ) = (5, 5, 3, 5) satisfies the integral zero condition with m - 1 = 4 and k + ℓ = 8.

Statement

theorem krawtchouk_sporadic_zero_five_five_three_five : krawtchouk 8 4 3 = 0
Source
arXiv:2611.08518 Sec. 1
Verified
09 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • krawtchoukFor naturals $n$, $j$, $x$, \[ K_j^{(n)}(x) \;=\; \sum_{i=0}^{j} (-1)^i \binom{x}{i}\binom{n-x}{j-i}, \] where the subtraction $n-x$ is…
Used by 1

Read back from the Lean

The Krawtchouk polynomial with parameters $n = 8$ and $j = 4$, evaluated at $x = 3$, equals $0$ (in $\mathbb{R}$).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof proceeds by direct computation. Unfolding the definition of the binary Krawtchouk polynomial P₄⁸(3) expresses it as a sum of five terms. After unrolling the summation into an explicit arithmetic expression, numerical evaluation of the binomial coefficients shows that the alternating sum cancels out to 0.

  1. The goal is expressed using the explicit summation formula for the Krawtchouk polynomial.

    Unfolding the definition of `krawtchouk` replaces P₄⁸(3) with the finite sum ∑_{i=0}^4 (-1)^i * (3 choose i) * ((8 - 3) choose (4 - i)).

    line 3

      unfold krawtchouk
  2. The summation is expanded into an explicit sum of its five individual terms.

    Repeatedly applying `Finset.sum_range_succ` extracts each term from i = 4 down to i = 0 one by one. Then `Finset.sum_range_zero` evaluates the remaining empty sum over `range 0` to 0.

    lines 4–5

    uses Finset.sum_range_succ, Finset.sum_range_zero

      repeat rw [Finset.sum_range_succ]
      rw [Finset.sum_range_zero]
  3. The alternating sum evaluates to 0, establishing the theorem. automation

    Evaluating the binomial coefficients gives 1 · 1 · 5 = 5 for i = 0, -1 · 3 · 10 = -30 for i = 1, 1 · 3 · 10 = 30 for i = 2, -1 · 1 · 5 = -5 for i = 3, and 1 · 0 · 1 = 0 for i = 4. The resulting sum 5 - 30 + 30 - 5 + 0 equals 0, which `norm_num` simplifies and verifies automatically.

    line 6

    uses Nat.choose

      norm_num [Nat.choose]
Finset.sum_range_succ
A sum over the range {0, ..., n} equals the sum over {0, ..., n - 1} plus the summand evaluated at n.
Finset.sum_range_zero
A sum over an empty range of natural numbers (range 0) equals 0.
Nat.choose
The binomial coefficient function n choose k, which counts the number of k-element subsets of an n-element set.

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

/-- The binary Krawtchouk polynomial P_4^8 evaluated at 3 equals 0. -/theorem krawtchouk_sporadic_zero_five_five_three_five : krawtchouk 8 4 3 = 0 := by  unfold krawtchouk  repeat rw [Finset.sum_range_succ]  rw [Finset.sum_range_zero]  norm_num [Nat.choose]
See it in the graphDiscuss this resultChallenge it