Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 5.2, proof — the origin and e1,…,ene_1, \dots, e_ne1​,…,en​ are vertices of every STAB(G)\mathrm{STAB}(G)STAB(G)

Proved
ConeLifts.StableSet.stab_extremePoints

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytopesstable-set-polytope

Let GGG be any graph on the vertex set {1,…,n}\{1,\dots,n\}{1,…,n}. Then the origin and all standard basis vectors e1,…,ene_1, \dots, e_ne1​,…,en​ of Rn\mathbb R^nRn are vertices (extreme points) of the stable set polytope:

0∈ext STAB(G),ei∈ext STAB(G)(i=1,…,n).0 \in \mathrm{ext}\,\mathrm{STAB}(G), \qquad e_i \in \mathrm{ext}\,\mathrm{STAB}(G) \quad (i = 1,\dots,n).0∈extSTAB(G),ei​∈extSTAB(G)(i=1,…,n).

They are the incidence vectors of the empty set and of the singletons, which are stable in every graph. These n+1n+1n+1 vertices index the rows of the submatrix S′S'S′ of the slack matrix used in the proof of Theorem 5.2.

Formalization Note A vertex is an element of Set.extremePoints ℝ (stab G), and eie_iei​ is EuclideanSpace.single i 1.

Preamble
import Mathlib
import Definitions.Def_ConeLifts_StableSet_stab
Formal statement
namespace ConeLifts.StableSet

/-- **Theorem 5.2, proof** (Gouveia, Parrilo & Thomas, arXiv:1111.3164v2, p. 19): the origin and
all standard basis vectors `e₁, …, eₙ` are vertices of `STAB(G)`, for every graph `G` on
`{1, …, n}` — "the empty set and all singleton vertices are stable in any graph". A vertex of the
polytope is an extreme point (`Set.extremePoints ℝ`); `eᵢ` is `EuclideanSpace.single i 1`. -/
theorem stab_extremePoints {n : ℕ} (G : SimpleGraph (Fin n)) :
    (0 : EuclideanSpace ℝ (Fin n)) ∈ Set.extremePoints ℝ (stab G) ∧
      ∀ i : Fin n, EuclideanSpace.single i (1 : ℝ) ∈ Set.extremePoints ℝ (stab G) := by sorry

end ConeLifts.StableSet
Source
Gouveia, Parrilo & Thomas, Lifts of Convex Sets and Cone Factorizations, arXiv:1111.3164v2, p. 19, Theorem 5.2 (proof)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me