Weighted Parseval identity for the Krawtchouk transform
ProvedQuantumLTF.Majority.krawtchouk_parsevaladversary-methodfourier-analysiskrawtchouk-polynomialssection-4
For arbitrary real coefficients , the binary Krawtchouk transform satisfies
This is the weighted Parseval identity obtained directly from Krawtchouk orthogonality. It is reusable for both scalar and direct-sum adversary constructions.
Preamble
import Mathlib import Definitions.Def_QuantumLTF_Majority_AdversaryModel
Formal statement
namespace QuantumLTF.Majority theorem krawtchouk_parseval : ∀ k : ℕ, ∀ r : Fin (k+1) → ℝ, (1/(2:ℝ)^k) * ∑ a : Fin (k+1), (k.choose a : ℝ) * (∑ t : Fin (k+1), (krawtchouk k t a : ℝ) * r t)^2 = ∑ t : Fin (k+1), (k.choose t : ℝ) * r t^2 := by sorry end QuantumLTF.Majority
Source
Standard consequence of weighted binary Krawtchouk orthogonality; used in Krivcenko, Nguyen, de Wolf, arXiv:2609.40331v3, Section 4.2.