Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7 — xc(CUT(n+1))=xc(COR(n))≥2Cn\mathrm{xc}(\mathrm{CUT}(n+1))=\mathrm{xc}(\mathrm{COR}(n))\ge 2^{Cn}xc(CUT(n+1))=xc(COR(n))≥2Cn

Proved
ExtensionComplexity.TSP.xc_cor_lower_bound

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

correlation-polytopecut-polytopeextension-complexitylower-boundp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Theorem 7: there is a constant C>0C>0C>0 such that for all n≥1n\ge 1n≥1,

xc(CUT(n+1))=xc(COR(n)) ≥ 2Cn.\mathrm{xc}(\mathrm{CUT}(n+1))=\mathrm{xc}(\mathrm{COR}(n))\ \ge\ 2^{Cn}.xc(CUT(n+1))=xc(COR(n)) ≥ 2Cn.

In particular, the extension complexity of CUT(n)\mathrm{CUT}(n)CUT(n) is 2Ω(n)2^{\Omega(n)}2Ω(n): there are C′>0C'>0C′>0 and NNN with xc(CUT(n))≥2C′n\mathrm{xc}(\mathrm{CUT}(n))\ge 2^{C'n}xc(CUT(n))≥2C′n for all n≥Nn\ge Nn≥N.

This is the first exponential lower bound on the extension complexity of a polytope associated with an NP-hard problem (max-cut), and it is the base of the reductions to the stable set and TSP polytopes.

Formalization Note The page says "for all nnn". At n=0n=0n=0 both COR(0)\mathrm{COR}(0)COR(0) and CUT(1)\mathrm{CUT}(1)CUT(1) are single points, whose extension complexity is 0<1=2C⋅00<1=2^{C\cdot 0}0<1=2C⋅0, so the printed statement fails there; the hypothesis n≥1n\ge 1n≥1 is added. The second conjunct is the "In particular" sentence, with 2Ω(n)2^{\Omega(n)}2Ω(n) read as ∃C′>0 ∃N ∀n≥N\exists C'>0\,\exists N\,\forall n\ge N∃C′>0∃N∀n≥N.

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

/-- **Theorem 7** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:12): there is a constant
`C > 0` such that for all `n ≥ 1`, `xc(CUT(n+1)) = xc(COR(n)) ≥ 2^{Cn}`. In particular the
extension complexity of `CUT(n)` is `2^{Ω(n)}`. The page says "for all n"; at `n = 0` both
polytopes are single points with `xc = 0 < 2^0`, so `n ≥ 1` is added. -/
theorem xc_cor_lower_bound :
    (∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 1 ≤ n →
      extensionComplexity (cutPolytope (n + 1)) = extensionComplexity (corPolytope n) ∧
        (2 : ℝ) ^ (C * n) ≤ (extensionComplexity (corPolytope n) : ℝ)) ∧
    (∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N,
      (2 : ℝ) ^ (C * n) ≤ (extensionComplexity (cutPolytope 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, Theorem 7
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).

  • Endorsed by iris · Nov 6, 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