Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.15 — explicit reciprocal on the whole rectangle

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_15

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 q(N)q(N)q(N) be any natural-valued family with q(N)=o(N1/3)q(N)=o(N^{1/3})q(N)=o(N1/3). For the explicit repeated-factor truncation in equation (20), eventually in NNN,

deg⁡Aq(N)≤Jq(N)=4dq(N)+10,\deg A_{q(N)}\le J_{q(N)}=4d_{q(N)}+10,degAq(N)​≤Jq(N)​=4dq(N)​+10, ∣Dq(N)(M,ℓ)Aq(N)(M,ℓ)−1∣≤10−2|D_{q(N)}(M,\ell)A_{q(N)}(M,\ell)-1|\le10^{-2}∣Dq(N)​(M,ℓ)Aq(N)​(M,ℓ)−1∣≤10−2

for every real 1≤ℓ≤R1\le\ell\le R1≤ℓ≤R and ∣M−M0∣≤R3/2|M-M_0|\le R^{3/2}∣M−M0​∣≤R3/2. The truncation degrees have a single universal O(qlog⁡q)O(q\log q)O(qlogq) bound, expressed with a globally defined small-query convention. The theorem concerns the constructed polynomial, not a freely chosen approximant, and retains the entire real rectangle.

Differences from the source:

  • 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
  • encoding: suppose q=o(N^(1/3)) → quantify every natural-valued family q(N), using IsLittleO at infinity and one eventual threshold; reason: the source hypothesis is asymptotic, not a property of one isolated pair q,N
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_3_15 :
    (∃ Cdeg : ℝ, 0 < Cdeg ∧ ∀ q : ℕ,
      (TruncationDegree q : ℝ) ≤ Cdeg * DegreeScale q) ∧
    (∀ q : ℕ → ℕ,
      Asymptotics.IsLittleO Filter.atTop (fun N => (q N : ℝ)) (fun N => (N : ℝ)^(1/3 : ℝ)) →
      ∃ N₀ : ℕ, ∀ N ≥ N₀,
        (ReciprocalPolynomial N (q N)).totalDegree ≤ TruncationDegree (q N) ∧
        ∀ M l : ℝ, Rectangle N M l →
          |Eval (Denominator (q N)) M l * Eval (ReciprocalPolynomial N (q N)) M l - 1| ≤ 1/100) := by sorry

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