Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.14 — reciprocal of bounded affine factors

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_14

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

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

Let z1,…,zdz_1,\dots,z_dz1​,…,zd​ be arbitrary real affine bivariate polynomials, let C>0C>0C>0, and let R\mathcal RR be any real region on which every ∣zi∣≤1/4|z_i|\le1/4∣zi​∣≤1/4. Set D=C∏i(1−zi)D=C\prod_i(1-z_i)D=C∏i​(1−zi​). Then there is one real polynomial AAA satisfying

deg⁡A≤4d+10,∣D(M,ℓ)A(M,ℓ)−1∣≤10−2\deg A\le4d+10,\qquad |D(M,\ell)A(M,\ell)-1|\le10^{-2}degA≤4d+10,∣D(M,ℓ)A(M,ℓ)−1∣≤10−2

throughout R\mathcal RR. The region need not be an integer grid, bounded, closed or nonempty. The number ddd counts factors and is unrelated to graph degree. This gives the uniform reciprocal estimate used by the explicit construction.

Differences from the source:

  • encoding: a given polynomial D_q=C product_i(1-z_i) → the product polynomial is written directly inside the conclusion; reason: substituting the source equality recovers exactly its statement, without an unrelated free denominator
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_3_14 (d : ℕ) (z : Fin d → Bivariate)
    (haffine : ∀ i, (z i).totalDegree ≤ 1) (C : ℝ) (hC : 0 < C) (region : Set (ℝ × ℝ))
    (hz : ∀ x ∈ region, ∀ i, |Eval (z i) x.1 x.2| ≤ 1/4) :
    ∃ A : Bivariate, A.totalDegree ≤ 4*d+10 ∧
      ∀ x ∈ region, |Eval (MvPolynomial.C C * ∏ i, (1-z i)) x.1 x.2 * Eval A x.1 x.2 - 1| ≤ 1/100 := by sorry

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