Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5 — signing probabilities and forest cancellation

Proved
QuantumBipartiteTesting.Bipartiteness.lemma_3_5

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 a consistent colored multigraph with vvv incident vertices, eee distinct edges and ccc connected components, and fix every edge sign. Then

sno=2−e,syes={2−(v−c),if the signing is balanced,0,otherwise.s_{\rm no}=2^{-e},\qquad s_{\rm yes}=\begin{cases}2^{-(v-c)},&\text{if the signing is balanced},\\0,&\text{otherwise}.\end{cases}sno​=2−e,syes​={2−(v−c),0,​if the signing is balanced,otherwise.​

If FFF is a forest, the two probabilities agree for every signing. The probabilities are the finite averages of actual independent edge bits or vertex bits, rather than values stipulated by this formula. This is the cancellation used in the formal acceptance 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
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset
attribute [local instance] Classical.propDecidable

theorem lemma_3_5 {N colors : ℕ} (F : Finset (ColoredEdge N colors)) (hF : Consistent F)
    (b : ColoredEdge N colors → Bool) :
    SignProbNo F b = (2 : ℝ) ^ (-(F.card : ℤ)) ∧
    SignProbYes F b = (if Balanced F b then
      (2 : ℝ) ^ (-((Vertices F).card : ℤ) + (Components F).card) else 0) ∧
    (Forest F → SignProbYes F b = SignProbNo F b) := by sorry

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