Proposition 3.10 — formal gap numerator factor
ProvedQuantumBipartiteTesting.Bipartiteness.proposition_3_10complexity-theorygraph-property-testingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
For every actual -query signed-graph circuit, there is a real bivariate polynomial , with a universal degree bound, such that
The equality holds for every real parameter pair away from and the denominator poles. All circuit data are fixed before the parameter pair, and the formal gap is computed from the explicit canonical polynomial and partition functional. This states the factorization as a conclusion rather than a supplied hardness certificate.
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: degree O(q log q) → a positive universal multiple of 1 + q log(q+2); reason: the two rates agree as q tends to infinity; the globally defined expression also retains q=0 and q=1 without artificial hypotheses
- reading: formal expectation described both by (A.2)–(A.4) and by arbitrary output on overflow → the algebraic partition functional (A.2)–(A.4), followed by signing probabilities and linear extension; reason: these descriptions disagree at N=M=4,l=2: a one-edge moment is 1/2 algebraically versus 1/8 with empty output on overflow; the feasible law stays conditional and its comparison remains a theorem
- reading: Definition 3.6 gives structural matching/response consistency and calls it equivalent to positive sampling probability → consistency is the structural condition, without a parameter-dependent positivity certificate; reason: a three-vertex two-color path is structurally consistent but cannot fit any block when N=M=4,l=2; retaining the structural definition preserves the full algebraic pattern domain
- encoding: identities of rational functions → real evaluations with l nonzero and D_q nonzero; grid nonvanishing is concluded eventually in the small-query range; reason: division at a pole is undefined in the source; Lean totalized division is never used to certify an identity there
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset
theorem proposition_3_10 : ∃ Cdeg : ℝ, 0 < Cdeg ∧
∀ N k w q : ℕ, ∀ E : Encoding (Fin N × Bool) k,
∀ A : Algorithm (Address N 3) k w q,
∀ out : (Address N 3 × Bits k) × Fin w → Bool,
∃ H : Bivariate, (H.totalDegree : ℝ) ≤ Cdeg * DegreeScale q ∧
∀ M l : ℝ, l ≠ 0 → Eval (Denominator q) M l ≠ 0 →
FormalGap E A out M l = l * Eval H M l / Eval (Denominator q) M l := by sorry
end QuantumBipartiteTesting.Bipartiteness
Source
Chandrima Kayal, Sayantan Sen, Dániel Szabó, STOC 2027 submission #878 (October 2026), Proposition 3.10, PDF = printed page 16. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.