Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3, p. 13 — h₁(G) = min{λ : λI + Z − C ⪰ 0, Z ∈ S_G}, the minimum attained

Proved
BicliqueSDP.Chain.lemma_3_3

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

bicliquesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sdp-dualitysemidefinite-programming

Let G=(V=V1∪V2,E)G=(V=V_1\cup V_2,E)G=(V=V1​∪V2​,E) be a bipartite graph, C=12(0JJ0)C=\frac12\begin{pmatrix}0&J\\J&0\end{pmatrix}C=21​(0J​J0​), and SGS_GSG​ the set of symmetric matrices indexed by VVV that vanish outside the edges of GGG (including the diagonal). Then the semidefinite program (33) defining h1(G)h_1(G)h1​(G) and the program (32) have the same value, and the minimum in (32) is attained:

h1(G)=min⁡λ∈R, Z∈S∣V∣{λ:λI+Z−C⪰0, Z∈SG}=max⁡X∈S∣V∣{⟨C,X⟩:X⪰0, Tr(X)=1, Xij=0 for {i,j}∈E}.h_1(G)=\min_{\lambda\in\mathbb R,\,Z\in\mathcal S^{|V|}}\{\lambda:\lambda I+Z-C\succeq0,\ Z\in S_G\}=\max_{X\in\mathcal S^{|V|}}\{\langle C,X\rangle:X\succeq0,\ \mathrm{Tr}(X)=1,\ X_{ij}=0\text{ for }\{i,j\}\in E\}.h1​(G)=λ∈R,Z∈S∣V∣min​{λ:λI+Z−C⪰0, Z∈SG​}=X∈S∣V∣max​{⟨C,X⟩:X⪰0, Tr(X)=1, Xij​=0 for {i,j}∈E}.

This is the strong duality used in §3.3: the dual formulation gives the lower bound 12g(G)≤h1(G)\frac12\sqrt{g(G)}\le h_1(G)21​g(G)​≤h1​(G) and a dual optimal solution, which yields relations (40)–(41).

Formalization Note In the paper the left-hand side is the Lasserre bound of order one (30). The mission defines h1(G)h_1(G)h1​(G) directly by (33) = (9), so the statement is the equality of the values of (32) and (33), together with the existence of a matrix Z∈SGZ\in S_GZ∈SG​ with h1(G)I+Z−C⪰0h_1(G)I+Z-C\succeq0h1​(G)I+Z−C⪰0 (the paper writes "min"). The minimum is a real infimum, sInf.

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

/-- Lemma 3.3 (p. 13): the value of the dual program (32) equals `h₁(G)` as defined by (33) = (9),
and the minimum in (32) is attained. -/
theorem lemma_3_3 {V1 V2 : Type} [Fintype V1] [Fintype V2] [DecidableEq V1] [DecidableEq V2]
    (E : V1 → V2 → Prop) :
    h1Dual E = h1 E ∧ ∃ Z, H1DualFeasible E (h1 E) Z := by sorry

end BicliqueSDP.Chain
Source
Laurent, Polak, Vargas, Semidefinite approximations for bicliques and biindependent pairs, arXiv:2302.08886v2, p. 13, Lemma 3.3, programs (32) and (33)
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