Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.5, p. 17 — the second contraction saves an even amount ≥ 2 (inequality (6)), and another edge drops when it is 2

Proved
CircletTSP.Facet.proposition_4_5

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

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

Let nnn be a positive multiple of 444, d=n/2d=n/2d=n/2, labels 1,…,n1,\dots,n1,…,n. Let j≠kj\ne kj=k be labels outside {1,2,d+1,d+2}\{1,2,d+1,d+2\}{1,2,d+1,d+2}, and consider contracting {j,d+2},{d+2,2},{2,1},{1,d+1},{d+1,k}\{j,d+2\},\{d+2,2\},\{2,1\},\{1,d+1\},\{d+1,k\}{j,d+2},{d+2,2},{2,1},{1,d+1},{d+1,k} into {j′,k′}\{j',k'\}{j′,k′}. Write

Δ=cj,d+2+cd+2,2+c2,1+c1,d+1+cd+1,k−cj′,k′′.\Delta=c_{j,d+2}+c_{d+2,2}+c_{2,1}+c_{1,d+1}+c_{d+1,k}-c'_{j',k'} .Δ=cj,d+2​+cd+2,2​+c2,1​+c1,d+1​+cd+1,k​−cj′,k′′​.

Then:

  1. Δ≥2\Delta\ge 2Δ≥2 (inequality (6)) and Δ\DeltaΔ is even;
  2. if Δ=2\Delta=2Δ=2, then every Hamiltonian cycle on KnK_nKn​ containing these five edges also contains an edge {s,t}\{s,t\}{s,t} with s,t∉{1,2,d+1,d+2}s,t\notin\{1,2,d+1,d+2\}s,t∈/{1,2,d+1,d+2} and cs′,t′′=cs,t−2c'_{s',t'}=c_{s,t}-2cs′,t′′​=cs,t​−2.

In either case the contracted Hamiltonian cycle (structure A at u=1u=1u=1) is at least 444 cheaper than the original.

Formalization Note Costs are integers. The cycle is an ordering π : Equiv.Perm (Fin n); "contains the edge {a,b}\{a,b\}{a,b}" refers to the vertices with labels a,ba,ba,b (vertex v has label v+1v+1v+1). The concluding sentence "In either case …" is the separate item contraction_step.

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

/-- Proposition 4.5 (p. 17): contracting `{j, d + 2}, {d + 2, 2}, {2, 1}, {1, d + 1}, {d + 1, k}`
into `{j', k'}` lowers the cost of these edges by an even amount that is at least `2` (inequality
(6)); and if it is exactly `2`, then every Hamiltonian cycle containing these five edges has
another edge `{s, t}` with `s, t ∉ {1, 2, d + 1, d + 2}` whose cost drops by `2`
(1-based labels, `d = n / 2`). -/
theorem proposition_4_5 (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) (j k : ℕ)
    (hj : j ∈ keptLabels n) (hk : k ∈ keptLabels n) (hjk : j ≠ k) :
    2 ≤ labCost n j (n / 2 + 2) + labCost n (n / 2 + 2) 2 + labCost n 2 1 +
        labCost n 1 (n / 2 + 1) + labCost n (n / 2 + 1) k - conCost n (relabel n j) (relabel n k) ∧
      Even (labCost n j (n / 2 + 2) + labCost n (n / 2 + 2) 2 + labCost n 2 1 +
        labCost n 1 (n / 2 + 1) + labCost n (n / 2 + 1) k -
          conCost n (relabel n j) (relabel n k)) ∧
      ∀ π : Equiv.Perm (Fin n), ChainTwo π j k →
        labCost n j (n / 2 + 2) + labCost n (n / 2 + 2) 2 + labCost n 2 1 +
            labCost n 1 (n / 2 + 1) + labCost n (n / 2 + 1) k -
              conCost n (relabel n j) (relabel n k) = 2 →
          ∃ s ∈ keptLabels n, ∃ t ∈ keptLabels n, HasEdge π s t ∧
            conCost n (relabel n s) (relabel n t) = labCost n s t - 2 := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 17, Proposition 4.5, inequality (6)
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