Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.10 — canonical coefficient bounds

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_2_10

by mikedeng1 · Nov 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorygraph-property-testingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

For any actual finite qqq-query circuit and any compatible canonical response table TTT of size kkk, its interpolation coefficient obeys

∣aT∣≤2k.|a_T|\le2^k.∣aT​∣≤2k.

For fixed query and response count constants a,ba,ba,b, there is C(a,b)>0C(a,b)>0C(a,b)>0 such that, whenever N≥2N\ge2N≥2, the query set has at most aNaNaN elements and the non-null response set has at most bNbNbN elements,

∑T∣aT∣≤exp⁡(C(a,b)qlog⁡N).\sum_T|a_T|\le\exp(C(a,b)q\log N).T∑​∣aT​∣≤exp(C(a,b)qlogN).

All encodings, circuits, workspace sizes and query counts are quantified after the constant. This includes the source's degree-three signed graph oracle, with a linear number of queries and responses, and bounds the amplification of monomial expectation errors.

Differences from the source:

  • encoding: finite quantum query circuits with binary encoded outcomes and arbitrary workspace → published QueryAlg, arbitrary finite complex registers, injective null-zero bit encoding, unitary XOR oracle, input-independent output event; reason: every finite workspace is represented up to a basis bijection; unused answer bit strings and dummy vertex queries are retained
  • encoding: O(N) response and query counts in the lemma and page-30 proof → fixed constants a,b bound both cardinalities; C depends only on a,b; N>=2; reason: expands the source asymptotic convention and excludes only small sizes where log N does not express that convention
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_2_10 :
    (∀ (I S : Type) [Fintype I] [Fintype S] [DecidableEq I] [DecidableEq S],
      ∀ k w q : ℕ, ∀ E : Encoding S k, ∀ A : Algorithm I k w q,
      ∀ out : (I × Bits k) × Fin w → Bool, ∀ T : ResponseTable I S,
        |CanonicalCoeff E A out T| ≤ (2 : ℝ) ^ T.val.card) ∧
    (∀ a b : ℕ, ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, 2 ≤ N →
      ∀ (I S : Type) [Fintype I] [Fintype S] [DecidableEq I] [DecidableEq S],
      Fintype.card I ≤ a*N → Fintype.card S ≤ b*N →
      ∀ k w q : ℕ, ∀ E : Encoding S k, ∀ A : Algorithm I k w q,
      ∀ out : (I × Bits k) × Fin w → Bool,
        (∑ T : ResponseTable I S, |CanonicalCoeff E A out T|) ≤ Real.exp (C*q*Real.log N)) := by sorry

end QuantumBipartiteTesting.Bipartiteness
Source
Chandrima Kayal, Sayantan Sen, Dániel Szabó, STOC 2027 submission #878 (October 2026), Lemma 2.10, PDF = printed page 11. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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