Lemma 4.2 — two-channel Krawtchouk Parseval identity
ProvedQuantumLTF.Majority.lemma_4_2_two_channeladversary-methodkrawtchouk-polynomialsquantum-algorithmssection-4
Let denote the binary Krawtchouk polynomial of degree on the Hamming slice of dimension . For two real coefficient families and , retain their transforms as two orthogonal channels,
Then the weighted Krawtchouk Parseval identity is
Keeping the two channels separate removes the spurious cross term in the earlier scalar formalization and gives the norm identity used to bound the dual-adversary objective.
Preamble
import Mathlib import Definitions.Def_QuantumLTF_Majority_AdversaryModel
Formal statement
namespace QuantumLTF.Majority theorem lemma_4_2_two_channel : ∀ k : ℕ, ∀ p q : Fin (k+1) → ℝ, let P : Fin (k+1) → ℝ := fun a => ∑ t : Fin (k+1), (krawtchouk k t a : ℝ) * p t; let Q : Fin (k+1) → ℝ := fun a => ∑ t : Fin (k+1), (krawtchouk k t a : ℝ) * ((-1 : ℝ) ^ (t : ℕ) * q t); (1/(2:ℝ)^k) * ∑ a : Fin (k+1), (k.choose a : ℝ) * (P a^2 + Q a^2) = ∑ t : Fin (k+1), (k.choose t : ℝ) * (p t^2+q t^2) := by sorry end QuantumLTF.Majority
Source
Krivcenko, Nguyen, de Wolf, STOC 2027 submission #347, Section 4.2, Krawtchouk orthogonality/Parseval calculation leading to Lemma 4.2; corrected formal encoding preserves the direct-sum channels in the Gram-vector construction.