Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3, p. 15 — lengths and costs of the surviving edges after contraction

Proved
CircletTSP.Facet.proposition_4_3

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, and use the labels 1,…,n1,\dots,n1,…,n. Let {s,t}\{s,t\}{s,t} be an edge 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 let s′,t′s',t's′,t′ be the labels after contraction. Then

ℓs′,t′′={ℓs,t,3≤s,t≤d  or  d+3≤s,t≤n,ℓs,t−2,otherwise.\ell'_{s',t'}=\begin{cases}\ell_{s,t}, & 3\le s,t\le d \ \text{ or } \ d+3\le s,t\le n,\\ \ell_{s,t}-2, & \text{otherwise.}\end{cases}ℓs′,t′′​={ℓs,t​,ℓs,t​−2,​3≤s,t≤d  or  d+3≤s,t≤n,otherwise.​

Moreover

cs′,t′′={cs,t,(s,t≤d or d+3≤s,t) and s̸≡2t,cs,t,(s≤d, d+3≤t or t≤d, d+3≤s) and s≡2t,cs,t−2,else.c'_{s',t'}=\begin{cases} c_{s,t}, & (s,t\le d \text{ or } d+3\le s,t) \text{ and } s\not\equiv_2 t,\\ c_{s,t}, & (s\le d,\ d+3\le t \text{ or } t\le d,\ d+3\le s) \text{ and } s\equiv_2 t,\\ c_{s,t}-2, & \text{else.}\end{cases}cs′,t′′​=⎩⎨⎧​cs,t​,cs,t​,cs,t​−2,​(s,t≤d or d+3≤s,t) and s≡2​t,(s≤d, d+3≤t or t≤d, d+3≤s) and s≡2​t,else.​

In particular cs′,t′′≤cs,tc'_{s',t'}\le c_{s,t}cs′,t′′​≤cs,t​: every such edge gets cheaper or keeps its cost after the contraction.

This controls the cost of all edges of a Hamiltonian cycle that the contraction of §4 leaves in place.

Formalization Note Labels are natural numbers in {1,…,n}∖{1,2,d+1,d+2}\{1,\dots,n\}\setminus\{1,2,d+1,d+2\}{1,…,n}∖{1,2,d+1,d+2} (keptLabels n), with s≠ts\ne ts=t; lengths and costs are integers, so ℓs,t−2\ell_{s,t}-2ℓs,t​−2 and cs,t−2c_{s,t}-2cs,t​−2 are not truncated. 0<n0<n0<n is added for uniformity (for n=4n=4n=4 there are no such labels).

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

/-- Proposition 4.3 (p. 15): for an edge `{s, t}` with `s, t ∉ {1, 2, d + 1, d + 2}`
(1-based labels, `d = n / 2`), the contracted length `ℓ'_{s',t'}` equals `ℓ_{s,t}` when
`s, t` lie in the same group `{3, …, d}` or `{d + 3, …, n}` and `ℓ_{s,t} - 2` otherwise; the
contracted cost `c'_{s',t'}` equals `c_{s,t}` or `c_{s,t} - 2` according to the printed cases;
in particular the cost never increases. -/
theorem proposition_4_3 (n : ℕ) (hn : 0 < n) (h4 : 4 ∣ n) (s t : ℕ)
    (hs : s ∈ keptLabels n) (ht : t ∈ keptLabels n) (hst : s ≠ t) :
    conLen n (relabel n s) (relabel n t) =
        (if (3 ≤ s ∧ s ≤ n / 2 ∧ 3 ≤ t ∧ t ≤ n / 2) ∨
            (n / 2 + 3 ≤ s ∧ s ≤ n ∧ n / 2 + 3 ≤ t ∧ t ≤ n)
          then labLen n s t else labLen n s t - 2) ∧
      conCost n (relabel n s) (relabel n t) =
        (if ((s ≤ n / 2 ∧ t ≤ n / 2) ∨ (n / 2 + 3 ≤ s ∧ n / 2 + 3 ≤ t)) ∧ s % 2 ≠ t % 2 then
            labCost n s t
          else if ((s ≤ n / 2 ∧ n / 2 + 3 ≤ t) ∨ (t ≤ n / 2 ∧ n / 2 + 3 ≤ s)) ∧
              s % 2 = t % 2 then
            labCost n s t
          else labCost n s t - 2) ∧
      conCost n (relabel n s) (relabel n t) ≤ labCost n s t := by sorry

end CircletTSP.Facet
Source
Gutekunst, Williamson, The Circlet Inequalities, arXiv:2012.12363v1, p. 15, Proposition 4.3
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