Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.9 — multi-outcome acceptance polynomial

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_2_9

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

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

Fix arbitrary finite query indices and non-null responses, an injective binary response encoding, and an actual complex quantum circuit making qqq XOR queries, with arbitrary finite workspace and a fixed output event. Its constructed canonical response-table polynomial PAP_APA​ is real and multilinear, and

deg⁡PA≤2q,PA((1O(a)=z)a,z)=Pr⁡[AO accepts]\deg P_A\le2q,\qquad P_A((\mathbf1_{O(a)=z})_{a,z})=\Pr[A^O\text{ accepts}]degPA​≤2q,PA​((1O(a)=z​)a,z​)=Pr[AO accepts]

for every response word OOO. Null responses are eliminated, each indicator occurs at most once, and incompatible answers at one query never occur in a canonical table. This is the arbitrary-response statement needed for graph oracles; it does not re-pose the existing Boolean-phase special case.

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
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_2_9 {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) :
    (CanonicalPolynomial E A out).totalDegree ≤ 2*q ∧
    (∀ az, (CanonicalPolynomial E A out).degreeOf az ≤ 1) ∧
    ∀ O : I → Option S,
      MvPolynomial.eval (Indicators O) (CanonicalPolynomial E A out) = Accept E A out O := by sorry

end QuantumBipartiteTesting.Bipartiteness
Source
Chandrima Kayal, Sayantan Sen, Dániel Szabó, STOC 2027 submission #878 (October 2026), Lemma 2.9, PDF = printed page 10. 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