Weighted orthogonality of binary Krawtchouk polynomials
ProvedQuantumLTF.Majority.krawtchouk_weighted_orthogonalitykrawtchouk-polynomialsorthogonal-polynomialsquantum-algorithmssection-4
For the binary Krawtchouk polynomials on the Hamming cube of dimension , the binomially weighted inner product satisfies
Thus the Krawtchouk transform is orthogonal after weighting its input and output coordinates by the binomial coefficients. This identity is the reusable harmonic-analysis step behind the corrected two-channel Parseval formula in Section 4.
Preamble
import Mathlib import Definitions.Def_QuantumLTF_Majority_AdversaryModel
Formal statement
namespace QuantumLTF.Majority theorem krawtchouk_weighted_orthogonality : ∀ k : ℕ, ∀ t u : Fin (k+1), ∑ a : Fin (k+1), (k.choose a : ℝ) * (krawtchouk k t a : ℝ) * (krawtchouk k u a : ℝ) = if t = u then (2:ℝ)^k * (k.choose t : ℝ) else 0 := by sorry end QuantumLTF.Majority
Source
Standard binary Krawtchouk orthogonality; Krivcenko, Nguyen, de Wolf, STOC 2027 submission #347, Section 4.2, orthogonality calculation used in Lemma 4.2.