Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.1, pp. 20–21 — n(n − 3)/2 tight tours with linearly independent incidence vectors

Proved
CircletTSP.Facet.tight_tours

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. There are n(n−3)/2n(n-3)/2n(n−3)/2 Hamiltonian cycles H1,…,Hn(n−3)/2H_1,\dots,H_{n(n-3)/2}H1​,…,Hn(n−3)/2​ on KnK_nKn​ such that

  1. each is tight for Inequality (2): ∑i=1dciti(χHr)=n−2\sum_{i=1}^{d} c_i t_i(\chi_{H_r})=n-2∑i=1d​ci​ti​(χHr​​)=n−2;
  2. their incidence vectors χH1,…,χHn(n−3)/2\chi_{H_1},\dots,\chi_{H_{n(n-3)/2}}χH1​​,…,χHn(n−3)/2​​ are linearly independent.

The paper exhibits n/2n/2n/2 rotations of a tour with two edges of length ddd and, for each k∈{3,…,d}k\in\{3,\dots,d\}k∈{3,…,d}, nnn rotations of a tour with a single edge of cost k−1k-1k−1, for n/2+(n/2−2)n=n(n−3)/2n/2+(n/2-2)n=n(n-3)/2n/2+(n/2−2)n=n(n−3)/2 tours in total. With the dimension of STSP(n)STSP(n)STSP(n) this gives the facet property.

Formalization Note Stated existentially ("we find … tours"); the family is not fixed to the paper's figures. The paper's justification of independence for the first family ("a unique edge of length ddd not used by any of the remaining tours") is inaccurate, since each length-ddd edge lies in two rotations; the conclusion itself is what is stated here. For n=4n=4n=4 the count is 222.

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

/-- Proof of Theorem 5.1 (pp. 20–21): for `4 ∣ n` there are `n(n - 3)/2` Hamiltonian cycles on
which Inequality (2) is tight and whose incidence vectors are linearly independent. -/
theorem tight_tours (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) :
    ∃ τ : Fin (n * (n - 3) / 2) → Equiv.Perm (Fin n),
      (∀ i, circletForm n (MetricTSP.tourVec (τ i)) = (n : ℝ) - 2) ∧
        LinearIndependent ℝ (fun i => MetricTSP.tourVec (τ i)) := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, pp. 20–21, proof of Theorem 5.1
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