Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12 — the extension complexity of the TSP polytope TSP(n)\mathrm{TSP}(n)TSP(n) is 2Ω(n)2^{\Omega(\sqrt n)}2Ω(n​)

Proved
ExtensionComplexity.TSP.xc_tsp_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-v1tsp-polytope

Let TSP(n)⊆REn\mathrm{TSP}(n)\subseteq\mathbb R^{E_n}TSP(n)⊆REn​ be the convex hull of the characteristic vectors of the tours (Hamiltonian cycles) of the complete graph KnK_nKn​, and xc\mathrm{xc}xc the extension complexity, the minimum number of inequalities in a linear system E=x+F=y=g=E^{=}x+F^{=}y=g^{=}E=x+F=y=g=, E≤x+F≤y≤g≤E^{\le}x+F^{\le}y\le g^{\le}E≤x+F≤y≤g≤ whose projection onto the xxx-variables is the polytope. Theorem 12: the extension complexity of TSP(n)\mathrm{TSP}(n)TSP(n) is 2Ω(n)2^{\Omega(\sqrt n)}2Ω(n​); that is, there are C>0C>0C>0 and NNN such that

xc(TSP(n)) ≥ 2Cnfor all n≥N.\mathrm{xc}(\mathrm{TSP}(n))\ \ge\ 2^{C\sqrt n}\qquad\text{for all } n\ge N.xc(TSP(n)) ≥ 2Cn​for all n≥N.

This answers Yannakakis's question of 1988/1991: no linear program of subexponential size, symmetric or not, projects onto the TSP polytope.

Formalization Note 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 2Cn2^{C\sqrt n}2Cn​ a real power. The extension complexity is a natural number (the least size of an EF), so the bound cannot hold vacuously through an infinite value.

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

/-- **Theorem 12** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:16): the extension complexity
of the TSP polytope `TSP(n)` is `2^{Ω(√n)}`: there are `C > 0` and `N` with
`xc(TSP(n)) ≥ 2^{C√n}` for every `n ≥ N`. -/
theorem xc_tsp_lower_bound :
    ∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, ∀ n ≥ N,
      (2 : ℝ) ^ (C * Real.sqrt n) ≤ (extensionComplexity (tspPolytope 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:16, Theorem 12
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