Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10 — graphs GnG_nGn​ on nnn vertices with xc(STAB(Gn))=2Ω(n)\mathrm{xc}(\mathrm{STAB}(G_n))=2^{\Omega(\sqrt n)}xc(STAB(Gn​))=2Ω(n​)

Proved
ExtensionComplexity.TSP.xc_stab_lower_bound

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

extension-complexitylower-boundp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stable-set-polytope

Theorem 10: for all nnn one can construct a graph GnG_nGn​ with nnn vertices such that the extension complexity of the stable set polytope STAB(Gn)\mathrm{STAB}(G_n)STAB(Gn​) is 2Ω(n)2^{\Omega(\sqrt n)}2Ω(n​). That is, there are C>0C>0C>0 and NNN such that for every n≥Nn\ge Nn≥N there is a graph GGG on nnn vertices with

xc(STAB(G)) ≥ 2Cn.\mathrm{xc}(\mathrm{STAB}(G))\ \ge\ 2^{C\sqrt n}.xc(STAB(G)) ≥ 2Cn​.

The worst-case extension complexity of stable set polytopes is therefore superpolynomial, in contrast with perfect graphs, whose stable set polytopes have compact semidefinite descriptions.

Formalization Note "One can construct" is stated as existence of the graph. 2Ω(n)2^{\Omega(\sqrt n)}2Ω(n​) is read as ∃C>0 ∃N ∀n≥N\exists C>0\,\exists N\,\forall n\ge N∃C>0∃N∀n≥N, with a real power. The stable set polytope is the published definition ChvatalPolytopes.Shared.stablePolytope.

Preamble
import Mathlib
import Definitions.Def_ExtensionComplexity_TSP_extensionComplexity
import Definitions.Def_ChvatalPolytopes_Shared_StablePolytope
Formal statement
namespace ExtensionComplexity.TSP

/-- **Theorem 10** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:14): for all `n` there is a
graph `G_n` with `n` vertices whose stable set polytope has extension complexity `2^{Ω(√n)}`:
there are `C > 0` and `N` such that every `n ≥ N` admits a graph `G` on `n` vertices with
`xc(STAB(G)) ≥ 2^{C√n}`. "One can construct" is stated as existence. -/
theorem xc_stab_lower_bound :
    ∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N, ∃ G : SimpleGraph (Fin n),
      (2 : ℝ) ^ (C * Real.sqrt n) ≤
        (extensionComplexity (ChvatalPolytopes.Shared.stablePolytope G) : ℝ) := 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:14, Theorem 10
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