Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.11 — uniform grid overflow bound

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_11

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 are an absolute constant c>0c>0c>0 and a size threshold N0N_0N0​ such that, for every N≥N0N\ge N_0N≥N0​ and every integer pair (M,ℓ)∈GN(M,\ell)\in\mathcal G_N(M,ℓ)∈GN​, the sampling parameters are valid and

Pr⁡[some block overflows]≤exp⁡(−cN1/3).\Pr[\text{some block overflows}]\le\exp(-cN^{1/3}).Pr[some block overflows]≤exp(−cN1/3).

Overflow is computed from the NNN independent uniform block assignments, with capacity M/ℓM/\ellM/ℓ. The same constant and threshold work simultaneously over the entire grid. This controls the effect of conditioning on successful sampling.

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: the grid is eventually contained in the valid sampling domain → validity is explicitly concluded together with the overflow bound; reason: page 17 establishes M>=1.09N for large N, while positivity and divisibility are grid conditions; no extra validity hypothesis is added
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_3_11 : ∃ c : ℝ, 0 < c ∧ ∃ N₀ : ℕ,
    ∀ N ≥ N₀, ∀ M l : ℕ, Grid N M l →
      ValidParameters N M l ∧ OverflowProbability N M l ≤ Real.exp (-c * (N : ℝ) ^ (1/3 : ℝ)) := by sorry

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