Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relations (40)–(41), p. 16 — at an optimal X of (33), Σ_{j∈V₂} X_ij = 2h₁(G)X_ii (i ∈ V₁) and symmetrically

Proved
BicliqueSDP.Chain.relations_40_41

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

bicliquescomplementary-slacknessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programming

Let G=(V1∪V2,E)G=(V_1\cup V_2,E)G=(V1​∪V2​,E) be a bipartite graph and let XXX be an optimal solution of the program (33) defining h1(G)h_1(G)h1​(G): X⪰0X\succeq0X⪰0, Tr(X)=1\mathrm{Tr}(X)=1Tr(X)=1, Xij=0X_{ij}=0Xij​=0 for {i,j}∈E\{i,j\}\in E{i,j}∈E, and ⟨C,X⟩=h1(G)\langle C,X\rangle=h_1(G)⟨C,X⟩=h1​(G). Write h=h1(G)h=h_1(G)h=h1​(G). Then

∑j∈V2Xij=2h Xii(i∈V1),∑i∈V1Xji=2h Xjj(j∈V2).\sum_{j\in V_2}X_{ij}=2h\,X_{ii}\quad(i\in V_1),\qquad \sum_{i\in V_1}X_{ji}=2h\,X_{jj}\quad(j\in V_2).j∈V2​∑​Xij​=2hXii​(i∈V1​),i∈V1​∑​Xji​=2hXjj​(j∈V2​).

In the paper's Gram notation X=(yiTyj)X=(y_i^{\mathsf T}y_j)X=(yiT​yj​), y′=∑i∈V1yiy'=\sum_{i\in V_1}y_iy′=∑i∈V1​​yi​, y′′=∑i∈V2yiy''=\sum_{i\in V_2}y_iy′′=∑i∈V2​​yi​, these read yiTy′′=2h∥yi∥2y_i^{\mathsf T}y''=2h\|y_i\|^2yiT​y′′=2h∥yi​∥2 for i∈V1i\in V_1i∈V1​ (40) and yjTy′=2h∥yj∥2y_j^{\mathsf T}y'=2h\|y_j\|^2yjT​y′=2h∥yj​∥2 for j∈V2j\in V_2j∈V2​ (41). They are the first step of the proof of h1(G)≤12g1(G)h_1(G)\le\frac12\sqrt{g_1(G)}h1​(G)≤21​g1​(G)​.

Formalization Note The relations are stated for the matrix XXX rather than for a Gram factorisation: yiTy′′=∑j∈V2Xijy_i^{\mathsf T}y''=\sum_{j\in V_2}X_{ij}yiT​y′′=∑j∈V2​​Xij​ and ∥yi∥2=Xii\|y_i\|^2=X_{ii}∥yi​∥2=Xii​. Optimality of XXX is the paper's hypothesis ("Let X be an optimal solution for the formulation (33)").

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

/-- Relations (40)–(41) (p. 16), in matrix form: an optimal solution `X` of (33) satisfies
`∑_{j ∈ V₂} X_ij = 2 h₁(G) X_ii` for `i ∈ V₁` and `∑_{i ∈ V₁} X_ji = 2 h₁(G) X_jj` for `j ∈ V₂`. -/
theorem relations_40_41 {V1 V2 : Type} [Fintype V1] [Fintype V2] [DecidableEq V1] [DecidableEq V2]
    (E : V1 → V2 → Prop) (X : Matrix (V1 ⊕ V2) (V1 ⊕ V2) ℝ) (hX : H1Feasible E X)
    (hopt : frob Cmat X = h1 E) :
    (∀ i : V1, ∑ j : V2, X (Sum.inl i) (Sum.inr j) = 2 * h1 E * X (Sum.inl i) (Sum.inl i)) ∧
    (∀ j : V2, ∑ i : V1, X (Sum.inr j) (Sum.inl i) = 2 * h1 E * X (Sum.inr j) (Sum.inr j)) := by sorry

end BicliqueSDP.Chain
Source
Laurent, Polak, Vargas, Semidefinite approximations for bicliques and biindependent pairs, arXiv:2302.08886v2, p. 16, relations (40) and (41) in the proof of h₁(G) ≤ ½√g₁(G)
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