Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 17, after Proposition 4.5 — contracting a Figure 7 sequence gives a tour on n − 4 vertices at least 4 cheaper

Proved
CircletTSP.Facet.contraction_step

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

circlet-inequalitycontractionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥8n\ge 8n≥8 be a multiple of 444, d=n/2d=n/2d=n/2, labels 1,…,n1,\dots,n1,…,n. Let HHH be a Hamiltonian cycle on KnK_nKn​ that contains one of the two edge sequences of Figure 7,

{j,1},{1,2},{2,d+2},{d+2,d+1},{d+1,k}or{j,d+2},{d+2,2},{2,1},{1,d+1},{d+1,k},\{j,1\},\{1,2\},\{2,d+2\},\{d+2,d+1\},\{d+1,k\}\quad\text{or}\quad \{j,d+2\},\{d+2,2\},\{2,1\},\{1,d+1\},\{d+1,k\},{j,1},{1,2},{2,d+2},{d+2,d+1},{d+1,k}or{j,d+2},{d+2,2},{2,1},{1,d+1},{d+1,k},

with j,k∉{1,2,d+1,d+2}j,k\notin\{1,2,d+1,d+2\}j,k∈/{1,2,d+1,d+2}. Let H′H'H′ be obtained by contraction: delete 1,2,d+1,d+21,2,d+1,d+21,2,d+1,d+2, replace the five edges by {j′,k′}\{j',k'\}{j′,k′}, and relabel every other vertex sss as s′s's′. Then H′H'H′ is a Hamiltonian cycle on Kn−4K_{n-4}Kn−4​ and

∑i=1d−2ci′ ti(χH′)+4 ≤ ∑i=1dci ti(χH).\sum_{i=1}^{d-2} c'_i\, t_i(\chi_{H'})+4\ \le\ \sum_{i=1}^{d} c_i\, t_i(\chi_H).i=1∑d−2​ci′​ti​(χH′​)+4 ≤ i=1∑d​ci​ti​(χH​).

By Claims 4.1 and 4.2, every structure A, B1, B2 can be brought to one of these two sequences, so this is the statement that a tour with any of the structures of Figure 4 contracts to a tour on four fewer vertices that is at least 444 cheaper, which completes the proof of Lemma 3.4.

Formalization Note n≥8n\ge 8n≥8 is not printed in this sentence; the proof of Theorem 3.1 derives it from Claim 3.2 ("By Claim 3.2, n≥8n\ge 8n≥8", p. 10), and for n=4n=4n=4 there is no tour on 000 vertices. The contracted cycle is given explicitly as the vector contract n (tourVec π) j k on Fin (n - 4) and the statement asserts that it is the incidence vector of some ordering, so the conclusion is about the specific contracted tour, not merely some cheap tour.

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

/-- The contraction step (p. 17, after Proposition 4.5): if a Hamiltonian cycle on `n ≥ 8`
vertices contains one of the two edge sequences of Figure 7, `{j, 1}, {1, 2}, {2, d + 2},
{d + 2, d + 1}, {d + 1, k}` or `{j, d + 2}, {d + 2, 2}, {2, 1}, {1, d + 1}, {d + 1, k}`
(1-based labels, `d = n / 2`), then contracting it (p. 14) yields a Hamiltonian cycle on
`n - 4` vertices whose circlet cost is at least `4` smaller. -/
theorem contraction_step (n : ℕ) (hn : 8 ≤ n) (h4 : 4 ∣ n) (π : Equiv.Perm (Fin n)) (j k : ℕ)
    (hj : j ∈ keptLabels n) (hk : k ∈ keptLabels n) (hchain : ChainOne π j k ∨ ChainTwo π j k) :
    (∃ σ : Equiv.Perm (Fin (n - 4)),
      MetricTSP.tourVec σ = contract n (MetricTSP.tourVec π) j k) ∧
    circletForm (n - 4) (contract n (MetricTSP.tourVec π) j k) + 4 ≤
      circletForm n (MetricTSP.tourVec π) := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 17 (paragraph after Proposition 4.5) with the contraction of p. 14
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