Theorem 5.2, proof — the origin and are vertices of every
ProvedConeLifts.StableSet.stab_extremePointsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytopesstable-set-polytope
Let be any graph on the vertex set . Then the origin and all standard basis vectors of are vertices (extreme points) of the stable set polytope:
They are the incidence vectors of the empty set and of the singletons, which are stable in every graph. These vertices index the rows of the submatrix 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 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.