Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — STAB(Hn)\mathrm{STAB}(H_n)STAB(Hn​), ∣V(Hn)∣=O(n2)|V(H_n)|=O(n^2)∣V(Hn​)∣=O(n2), has a face that is an extension of COR(n)\mathrm{COR}(n)COR(n)

Proved
ExtensionComplexity.TSP.stab_face_extends_cor

by mikedeng1 · 1 vote · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

correlation-polytopeextensionp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stable-set-polytope

For a graph G=(V,E)G=(V,E)G=(V,E) the stable set polytope STAB(G)⊆RV\mathrm{STAB}(G)\subseteq\mathbb R^VSTAB(G)⊆RV is the convex hull of the characteristic vectors of the stable sets of GGG. Lemma 8: for each nnn there exists a graph HnH_nHn​ with O(n2)O(n^2)O(n2) vertices such that STAB(Hn)\mathrm{STAB}(H_n)STAB(Hn​) contains a face that is an extension of COR(n)\mathrm{COR}(n)COR(n). Precisely, there is a constant ccc such that for every nnn there are m≤c n2m\le c\,n^2m≤cn2, a graph HHH on mmm vertices and a face FFF of STAB(H)\mathrm{STAB}(H)STAB(H) with a linear map π\piπ satisfying π(F)=COR(n)\pi(F)=\mathrm{COR}(n)π(F)=COR(n).

With Lemma 9 this transfers the lower bound of Theorem 7 to stable set polytopes (Theorem 10).

Formalization Note The stable set polytope is the published definition ChvatalPolytopes.Shared.stablePolytope (convex hull of incidence vectors of independent sets, in RV\mathbb R^VRV). O(n2)O(n^2)O(n2) is a constant ccc independent of nnn with m≤c n2m\le c\,n^2m≤cn2. The statement is for all nnn including n=0n=0n=0, where it holds with the empty graph.

Preamble
import Mathlib
import Definitions.Def_ExtensionComplexity_TSP_Polytope
import Definitions.Def_ExtensionComplexity_TSP_CutCor
import Definitions.Def_ChvatalPolytopes_Shared_StablePolytope
Formal statement
namespace ExtensionComplexity.TSP

/-- **Lemma 8** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:12): for each `n` there is a
graph `H_n` with `O(n²)` vertices such that `STAB(H_n)` contains a face that is an extension of
`COR(n)`. `O(n²)` is a constant `c` with at most `c·n²` vertices, uniform in `n`. -/
theorem stab_face_extends_cor :
    ∃ c : ℕ, ∀ n : ℕ, ∃ m : ℕ, m ≤ c * n ^ 2 ∧ ∃ H : SimpleGraph (Fin m),
      ∃ F : Set (Fin m → ℝ), IsFace (ChvatalPolytopes.Shared.stablePolytope H) F ∧
        IsExtension F (corPolytope n) := by sorry

end ExtensionComplexity.TSP
Source
Fiorini, Massar, Pokutta, Tiwary, de Wolf, Exponential lower bounds for polytopes in combinatorial optimization, J. ACM 62(2) (2015), Art. 17, p. 17:12, Lemma 8 (STAB(G): p. 17:12, §3.3)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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