Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact-support dual solution from a Krawtchouk witness

Open
QuantumLTF.Majority.exact_support_dual_from_krawtchouk_witness

by stockfish-soup · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

adversary-methodkrawtchouk-polynomialsquantum-query-complexitysection-4

Let 3≤r≤n3\le r\le n3≤r≤n. Suppose pt,qtp_t,q_tpt​,qt​ satisfy the endpoint normalization and complementary-support conditions of the odd-support Krawtchouk construction, their weighted signed cross term is zero, and their binomial energy is at most TTT. Then the rank-one Gram matrices obtained from their intersection Krawtchouk transform form a feasible dual adversary solution for exact supports of size rrr, with objective at most TTT.

The proof combines feasibility of the intersection transform, corrected scalar Parseval, and counting Boolean query strings by their intersection size with a fixed support.

Preamble
import Mathlib
import Definitions.Def_QuantumLTF_Majority_AdversaryModel
Formal statement
namespace QuantumLTF.Majority

open QAlgorithms

theorem exact_support_dual_from_krawtchouk_witness : ∀ n r : ℕ, 3 ≤ r → r ≤ n → ∀ p q : Fin (r+1) → ℝ, p 0 * q 0 = 1/2 → (∀ t : Fin (r+1), 1 ≤ (t : ℕ) → (t : ℕ) < r → (p t = 0 ↔ q t ≠ 0)) → (∑ t : Fin (r+1), (r.choose t : ℝ) * ((-1 : ℝ) ^ (t : ℕ) * p t * q t)) = 0 → ∀ T : ℝ, (∑ t : Fin (r+1), (r.choose t : ℝ) * (p t^2 + q t^2)) ≤ T → ∃ X : Qubits n → Matrix (ExactSupports n r) (ExactSupports n r) ℝ, DualFeasible (fun A : ExactSupports n r => A.1) X ∧ DualCostAtMost X T := by sorry

end QuantumLTF.Majority
Source
Krivcenko, Nguyen, de Wolf, arXiv:2609.40331v3, Section 4.2: rank-one Krawtchouk adversary matrices, feasibility, and objective calculation leading to Lemmas 4.1–4.3.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me