Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.8 — full cycle-rank divisibility

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_8

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

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

There is a positive absolute degree constant such that, for every consistent three-colored pattern FFF with at most 2q2q2q edges, there is a real bivariate polynomial BFB_FBF​ of degree O(qlog⁡q)O(q\log q)O(qlogq) satisfying

WF(M,ℓ)=ℓβ(F)BF(M,ℓ)Dq(M,ℓ),β(F)=e(F)−v(F)+c(F).W_F(M,\ell)=\frac{\ell^{\beta(F)}B_F(M,\ell)}{D_q(M,\ell)},\qquad\beta(F)=e(F)-v(F)+c(F).WF​(M,ℓ)=Dq​(M,ℓ)ℓβ(F)BF​(M,ℓ)​,β(F)=e(F)−v(F)+c(F).

The equality is an identity away from ℓ=0\ell=0ℓ=0 and the poles of DqD_qDq​. The full integer cycle-rank exponent is retained, including patterns with differently colored parallel edges and the empty pattern. This is the divisibility statement used to isolate a factor of ℓ\ellℓ in the formal gap.

Differences from the source:

  • encoding: vertices [N], distinct undirected edges and color-labeled parallel edges → Fin N; oriented unordered pairs; color included in each edge identifier; reason: bijections relabel vertices; differently colored parallel constraints remain distinct
  • 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 lemma_3_8 : ∃ Cdeg : ℝ, 0 < Cdeg ∧
    ∀ N q : ℕ, ∀ F : Finset (ColoredEdge N), Consistent F → F.card ≤ 2*q →
    ∃ B : Bivariate, (B.totalDegree : ℝ) ≤ Cdeg * DegreeScale q ∧
      ∀ M l : ℝ, l ≠ 0 → Eval (Denominator q) M l ≠ 0 →
        TopologyMoment F M l = l ^ CycleRank F * Eval B 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), Lemma 3.8, PDF = printed page 16. 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