Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1, p. 20 — for 4 ∣ n the circlet inequality is valid for STSP(n) and defines a facet of it

Proved
CircletTSP.Facet.theorem_5_1

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

circlet-inequalityfacetp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traveling-salesman-polytope

Let nnn be a positive multiple of 444 and d=n/2d=n/2d=n/2. The circlet inequality

∑i=1dciti ≥ n−2,ci={i,i odd,d−i,i even,\sum_{i=1}^{d} c_i t_i\ \ge\ n-2,\qquad c_i=\begin{cases} i, & i\text{ odd},\\ d-i, & i \text{ even},\end{cases}i=1∑d​ci​ti​ ≥ n−2,ci​={i,d−i,​i odd,i even,​

is facet defining for the symmetric traveling salesman polytope STSP(n)STSP(n)STSP(n):

  1. it is valid: every x∈STSP(n)x\in STSP(n)x∈STSP(n) satisfies it;
  2. the face F={x∈STSP(n): ∑i=1dciti(x)=n−2}F=\{x\in STSP(n):\ \sum_{i=1}^{d} c_i t_i(x)=n-2\}F={x∈STSP(n): ∑i=1d​ci​ti​(x)=n−2} is a facet of STSP(n)STSP(n)STSP(n), i.e. a nonempty face with dim⁡F=dim⁡STSP(n)−1\dim F=\dim STSP(n)-1dimF=dimSTSP(n)−1.

This is the main result of the paper: the circlet inequality, whose coefficients depend only on edge lengths around a circle (a circulant inequality), is not merely valid but one of the inequalities in any minimal linear description of STSP(n)STSP(n)STSP(n).

Formalization Note STSP(n)STSP(n)STSP(n) is the convex hull of the incidence vectors MetricTSP.tourVec π, in ordered-pair coordinates. "Facet" is the published Disjunctive.Polarity.IsFacet: an extreme subset, nonempty, of affine dimension one less than STSP(n)STSP(n)STSP(n). Validity is conjoined explicitly, since IsFacet alone would also hold for the reversed inequality. 0<n0<n0<n is added: 4∣04\mid 04∣0, but STSP(0)STSP(0)STSP(0) is a single point and the facet claim fails there.

Preamble
import Mathlib
import Definitions.Def_Disjunctive_Polarity_Projection
import Definitions.Def_CircletTSP_Facet_Setting
Formal statement
namespace CircletTSP.Facet

/-- Theorem 5.1 (p. 20): for `4 ∣ n`, the circlet inequality `∑_{i=1}^{d} c_i t_i ≥ n - 2` is
facet defining for `STSP(n)`: it is valid on `STSP(n)`, and the points of `STSP(n)` where it
holds with equality form a facet of `STSP(n)`. -/
theorem theorem_5_1 (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) :
    (∀ x ∈ STSP n, (n : ℝ) - 2 ≤ circletForm n x) ∧
      Disjunctive.Polarity.IsFacet (STSP n) (STSP n ∩ {x | circletForm n x = (n : ℝ) - 2}) := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 20, Theorem 5.1 (facet defining as defined on p. 2)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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