Lemma 4.7 — constant filtered adversary norm
OpenQuantumLTF.Majority.lemma_4_7adversary-methodmatrix-normssection-4
For every Boolean query , the Hadamard-filtered adversary matrix satisfies with a universal constant.
Preamble
import Mathlib import Definitions.Def_QAlgorithms_Defs_Circuit import Definitions.Def_QuantumLTF_Majority_AdversaryModel
Formal statement
namespace QuantumLTF.Majority
open QAlgorithms
theorem lemma_4_7 : ∃ C : ℝ, 0<C ∧ ∀ {n m : ℕ} (U : Finset (Fin n)), U.card=2*m → ∀ S : Qubits n, specNorm (fun A B : {A : Finset (Fin n) // A⊆U ∧ A.card=m} => (lowerAdversary U A B * queryDifference (fun A => A.1) S A B : ℂ)) ≤ C := by sorry
end QuantumLTF.MajoritySource
Krivcenko, Nguyen, de Wolf, STOC 2027 submission #347, Lemma 4.7, p.49 and Appendix C.3 (PDF pp.50, 91–93).