Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11 — TSP(q)\mathrm{TSP}(q)TSP(q), q=O(n2)q=O(n^2)q=O(n2), has a face that is an extension of COR(n)\mathrm{COR}(n)COR(n)

Proved
ExtensionComplexity.TSP.tsp_face_extends_cor

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

correlation-polytopep2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1reductiontsp-polytope

Lemma 11: for each nnn there exists a positive integer q=O(n2)q=O(n^2)q=O(n2) such that TSP(q)\mathrm{TSP}(q)TSP(q) 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 n≥1n\ge 1n≥1 there are an integer qqq with 0<q≤c n20<q\le c\,n^20<q≤cn2, a face FFF of TSP(q)\mathrm{TSP}(q)TSP(q) and a linear map π:REq→Rn×n\pi:\mathbb R^{E_q}\to\mathbb R^{n\times n}π:REq​→Rn×n with π(F)=COR(n)\pi(F)=\mathrm{COR}(n)π(F)=COR(n).

With Lemma 9 and Theorem 7 this gives xc(TSP(q))≥xc(COR(n))≥2Cn\mathrm{xc}(\mathrm{TSP}(q))\ge\mathrm{xc}(\mathrm{COR}(n))\ge 2^{Cn}xc(TSP(q))≥xc(COR(n))≥2Cn with q=O(n2)q=O(n^2)q=O(n2), which is the main theorem.

Formalization Note O(n2)O(n^2)O(n2) is a constant ccc independent of nnn with q≤c n2q\le c\,n^2q≤cn2. The hypothesis n≥1n\ge 1n≥1 is added: at n=0n=0n=0 no positive q≤c⋅02q\le c\cdot 0^2q≤c⋅02 exists. The explicit value of qqq in the paper's proof is not part of the statement.

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

/-- **Lemma 11** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:14): for each `n` there is a
positive integer `q = O(n²)` such that `TSP(q)` contains a face that is an extension of `COR(n)`.
`O(n²)` is a constant `c` with `q ≤ c·n²`, uniform in `n`; `n ≥ 1` is added because a positive
`q ≤ c·0²` cannot exist. -/
theorem tsp_face_extends_cor :
    ∃ c : ℕ, ∀ n : ℕ, 1 ≤ n → ∃ q : ℕ, 0 < q ∧ q ≤ c * n ^ 2 ∧
      ∃ F : Set (Edge q → ℝ), IsFace (tspPolytope q) 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:14, Lemma 11
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