Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (25), p. 12 — las₁(G) = ϑ(G) for every graph G

Proved
BicliqueSDP.Chain.eq_25

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

graph-theorylovasz-thetap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let G=(V,E)G=(V,E)G=(V,E) be any finite graph. The first Lasserre bound

las1(G)=max⁡{Tr(X):(1diag(X)Tdiag(X)X)⪰0, Xij=0 for {i,j}∈E}\mathrm{las}_1(G)=\max\Bigl\{\mathrm{Tr}(X):\begin{pmatrix}1&\mathrm{diag}(X)^{\mathsf T}\\ \mathrm{diag}(X)&X\end{pmatrix}\succeq0,\ X_{ij}=0\text{ for }\{i,j\}\in E\Bigr\}las1​(G)=max{Tr(X):(1diag(X)​diag(X)TX​)⪰0, Xij​=0 for {i,j}∈E}

and Lovász's theta number

ϑ(G)=max⁡{⟨J,X⟩:X⪰0, Tr(X)=1, Xij=0 for {i,j}∈E}\vartheta(G)=\max\{\langle J,X\rangle: X\succeq0,\ \mathrm{Tr}(X)=1,\ X_{ij}=0\text{ for }\{i,j\}\in E\}ϑ(G)=max{⟨J,X⟩:X⪰0, Tr(X)=1, Xij​=0 for {i,j}∈E}

coincide:

las1(G)=ϑ(G).\mathrm{las}_1(G)=\vartheta(G).las1​(G)=ϑ(G).

The paper calls this well known and refers to Grötschel, Lovász and Schrijver; it is used in §3.3 to pass between the two formulations of ϑ\varthetaϑ in the proofs of h1(G)≤14α(G)h_1(G)\le\frac14\alpha(G)h1​(G)≤41​α(G) and g1(G)≤α(G)h1(G)g_1(G)\le\alpha(G)h_1(G)g1​(G)≤α(G)h1​(G).

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

/-- Eq. (25) (p. 12): for every finite graph `G`, `las₁(G) = ϑ(G)`. -/
theorem eq_25 {V : Type} [Fintype V] (G : SimpleGraph V) : las1 G = theta G := by sorry

end BicliqueSDP.Chain
Source
Laurent, Polak, Vargas, Semidefinite approximations for bicliques and biindependent pairs, arXiv:2302.08886v2, p. 12, 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