Proof of Theorem 5.1, pp. 20–21 — n(n − 3)/2 tight tours with linearly independent incidence vectors
ProvedCircletTSP.Facet.tight_tourscirclet-inequalityfacetp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traveling-salesman-polytope
Let be a positive multiple of . There are Hamiltonian cycles on such that
- each is tight for Inequality (2): ;
- their incidence vectors are linearly independent.
The paper exhibits rotations of a tour with two edges of length and, for each , rotations of a tour with a single edge of cost , for tours in total. With the dimension of 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 not used by any of the remaining tours") is inaccurate, since each length- edge lies in two rotations; the conclusion itself is what is stated here. For the count is .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.