Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 12, after Eq. (25) — ϑ(G) = α(G) for every bipartite graph G

Proved
BicliqueSDP.Chain.theta_eq_alpha_bipartite

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

bicliquesgraph-theorylovasz-thetap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(V1∪V2,E)G=(V_1\cup V_2,E)G=(V1​∪V2​,E) be a bipartite graph and α(G)\alpha(G)α(G) the maximum of ∣A∣+∣B∣|A|+|B|∣A∣+∣B∣ over its bipartite biindependent pairs (A,B)(A,B)(A,B), that is, its stability number. Then the theta number of GGG, viewed as a graph on V=V1∪V2V=V_1\cup V_2V=V1​∪V2​, equals its stability number:

ϑ(G)=α(G).\vartheta(G)=\alpha(G).ϑ(G)=α(G).

The proof of Proposition 1.2 uses this to turn the bounds 4h1(G)≤ϑ(G)4h_1(G)\le\vartheta(G)4h1​(G)≤ϑ(G) and g1(G)≤h1(G) ϑ(G)g_1(G)\le h_1(G)\,\vartheta(G)g1​(G)≤h1​(G)ϑ(G) into bounds in terms of α(G)\alpha(G)α(G).

Formalization Note The paper states this more generally for perfect graphs, citing Grötschel, Lovász and Schrijver; only the bipartite clause, which the paper uses, is formalized. ϑ\varthetaϑ is evaluated on bipGraph E, and α(G)\alpha(G)α(G) is the paper's maximum over biindependent pairs.

Preamble
import Mathlib
import Definitions.Def_BicliqueSDP_Chain_Model
Formal statement
namespace BicliqueSDP.Chain

/-- p. 12, after Eq. (25): `ϑ(G) = α(G)` if `G` is bipartite. -/
theorem theta_eq_alpha_bipartite {V1 V2 : Type} [Fintype V1] [Fintype V2] [DecidableEq V1]
    [DecidableEq V2] (E : V1 → V2 → Prop) [∀ i j, Decidable (E i j)] :
    theta (bipGraph E) = alpha E := by sorry

end BicliqueSDP.Chain
Source
Laurent, Polak, Vargas, Semidefinite approximations for bicliques and biindependent pairs, arXiv:2302.08886v2, p. 12, the sentence after Eq. (25)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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