cdKernel
defimported Lean
For $t \le n$ and real $a, x$, the truncated reproducing kernel is \[ \Phi_{n,t}(a,x) \;=\; \sum_{j=0}^{t} \frac{K_j^{(n)}(a)\,K_j^{(n)}(x)}{\binom{n}{j}}. \]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in set_option maxHeartbeats 800000 in noncomputable def cdKernel (n t : ℕ) (a x : ℝ) : ℝ
- Defined in
- TCSlib, `cdKernel`
- 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.cdKernel← cdKernel (TCSlib/ErrorCorrectingCodes/MRRW.lean:321): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- krawtchoukPolyThe family of real polynomials defined by the three-term recurrence $K_0 = 1$, $K_1 = n - 2X$, and…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in set_option maxHeartbeats 800000 in /-- **Christoffel–Darboux kernel** from Section 3 of the source file. For `t ∈ {0,...,n}` and real parameters `a, x`, the truncated reproducing kernel is `Φ_{n,t}(a,x) = ∑_{j=0}^{t} K_j(a) · K_j(x) / C(n,j)`. -/ noncomputable def cdKernel (n t : ℕ) (a x : ℝ) : ℝ := ∑ j ∈ Finset.range (t + 1), (krawtchoukPoly n j).eval a * (krawtchoukPoly n j).eval x / (Nat.choose n j : ℝ) /- **Proposition 1 (Christoffel–Darboux identity for Krawtchouk)** from the source file. For `0 ≤ t ≤ n-1`, there exists a positive scalar `c > 0` such that `Φ_{n,t}(a,x) = c · (K_t(a) · K_{t+1}(x) - K_{t+1}(a) · K_t(x)) / (a - x)` for all real `a ≠ x`. As noted in Remark 3 of the source file, the precise value of `c` is irrelevant for the Delsarte application because scaling `F` does not change `F(0)/F_0`. -/