Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3 — random-sign frustration bound

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_3

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 FFF be any finite colored multigraph on NNN vertices, with mmm distinct colored edges, and assign independent uniform signs to those edges. For every 0<τ<1/20<\tau<1/20<τ<1/2,

Pr⁡[fr⁡(F,b)≤τm]≤2N−(1−h2(τ))m,\Pr[\operatorname{fr}(F,b)\le\tau m]\le2^{N-(1-h_2(\tau))m},Pr[fr(F,b)≤τm]≤2N−(1−h2​(τ))m,

where h2h_2h2​ is binary entropy in base two. There is a positive absolute constant ccc such that, for every such graph with m≥1.3Nm\ge1.3Nm≥1.3N,

Pr⁡[fr⁡(F,b)≤m/50]≤2−cN.\Pr[\operatorname{fr}(F,b)\le m/50]\le2^{-cN}.Pr[fr(F,b)≤m/50]≤2−cN.

The constants are independent of the graph and its color count. This is the farness estimate for random signed constraints.

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
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset

theorem lemma_3_3 :
    (∀ N colors : ℕ, ∀ F : Finset (ColoredEdge N colors), Consistent F →
      ∀ τ : ℝ, 0 < τ → τ < 1/2 →
        FrustrationTail F (τ * F.card) ≤
          (2 : ℝ) ^ ((N : ℝ) - (1 - BinaryEntropy τ) * F.card)) ∧
    (∃ c : ℝ, 0 < c ∧ ∀ N colors : ℕ, ∀ F : Finset (ColoredEdge N colors),
      Consistent F → (13/10 : ℝ) * N ≤ F.card →
        FrustrationTail F ((F.card : ℝ)/50) ≤ (2 : ℝ) ^ (-c*N)) := by sorry

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