Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9 (ii) — if FFF is a face of QQQ then xc(Q)≥xc(F)\mathrm{xc}(Q)\ge\mathrm{xc}(F)xc(Q)≥xc(F)

Proved
ExtensionComplexity.TSP.xc_face_mono

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

extension-complexityfacemonotonicityp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Q,F⊆RκQ,F\subseteq\mathbb R^{\kappa}Q,F⊆Rκ be polytopes. Lemma 9 (ii): if FFF is a face of QQQ (either QQQ itself or the intersection of QQQ with a valid hyperplane), then

xc(Q) ≥ xc(F).\mathrm{xc}(Q)\ \ge\ \mathrm{xc}(F).xc(Q) ≥ xc(F).

A face is never harder to describe than the whole polytope. Together with part (i) it reduces lower bounds for TSP(q)\mathrm{TSP}(q)TSP(q) and STAB(Hn)\mathrm{STAB}(H_n)STAB(Hn​) to the lower bound for COR(n)\mathrm{COR}(n)COR(n).

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

/-- **Lemma 9 (ii)** (Fiorini et al., J. ACM 62(2) (2015), Art. 17, p. 17:13): let `Q` and `F` be
polytopes. If `F` is a face of `Q`, then `xc(Q) ≥ xc(F)`. -/
theorem xc_face_mono {κ : Type*} [Fintype κ] (Q F : Set (κ → ℝ)) (hQ : IsPolytope Q)
    (hF : IsPolytope F) (hface : IsFace Q F) :
    extensionComplexity F ≤ extensionComplexity Q := 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:13, Lemma 9 (ii)
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