AFTD Auto-Formalizing Theoretical Domains

krawtchouk_zero

theoremverifiedimported Lean

Value of the zeroth Krawtchouk polynomial. For all natural numbers $n$ and $x$, the degree-zero binary Krawtchouk polynomial is identically $1$; that is, \[ K_0^{(n)}(x) = 1. \]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
set_option maxHeartbeats 800000 in
theorem krawtchouk_zero (n x : ℕ) : krawtchouk n 0 x = 1
Source
TCSlib, `krawtchouk_zero`
Lean proof
By Frederick Dehmel, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 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…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen scoped BigOperators inset_option maxHeartbeats 800000 intheorem krawtchouk_zero (n x : ℕ) : krawtchouk n 0 x = 1 := by  -- By definition of Krawtchouk polynomials, we know that $K_0^{(n)}(x) = 1$ for all $x$. This follows directly from the definition.  simp [krawtchouk]/-**Lemma 2 (special value at zero)** from the source file.For every `0 ≤ j ≤ n`, `K_j(0) = C(n,j)`. When `x = 0`, only the `i = 0` termsurvives because `C(0, i) = 0` for `i > 0`.-/
See it in the graphDiscuss this resultChallenge it