Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 19 (Naddef–Rinaldi, Theorem 3.7) — dim STSP(n) = |E| − |V| = n(n − 3)/2

Proved
CircletTSP.Facet.stsp_dim

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytope-dimensiontraveling-salesman-polytope

For n≥3n\ge 3n≥3, the symmetric traveling salesman polytope has dimension

dim⁡STSP(n)=∣E∣−∣V∣=n(n−3)2.\dim STSP(n)=|E|-|V|=\frac{n(n-3)}{2}.dimSTSP(n)=∣E∣−∣V∣=2n(n−3)​.

The paper cites this from Naddef and Rinaldi (Theorem 3.7) to reduce the facet property of a valid inequality to exhibiting n(n−3)/2n(n-3)/2n(n−3)/2 tight Hamiltonian cycles with linearly independent incidence vectors.

Formalization Note The dimension is that of the affine hull (Disjunctive.Polarity.PolyDim, the finrank of the vector span). STSP(n)STSP(n)STSP(n) sits in ordered-pair coordinates Fin n → Fin n → ℝ; the embedding of RE\mathbb R^ERE as symmetric zero-diagonal arrays is linear and injective, so the dimension is the one in RE\mathbb R^ERE. This is a cited classical result, not a theorem of the paper, and is stated for all n≥3n\ge 3n≥3.

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

/-- The dimension of the symmetric TSP polytope (p. 19, cited from Naddef and Rinaldi,
Theorem 3.7): for `n ≥ 3`, `dim STSP(n) = |E| - |V| = n(n - 3)/2`. -/
theorem stsp_dim (n : ℕ) (hn : 3 ≤ n) :
    Disjunctive.Polarity.PolyDim (STSP n) = ((n * (n - 3) / 2 : ℕ) : ℤ) := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 19, citing Naddef and Rinaldi [28], Theorem 3.7
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