Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the equivalence, p. 328 — along a path of m arcs avoiding city 0 the potentials u rise by at least m

Proved
MillerTuckerZemlin.Formulation.potential_path_bound

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

integer-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1subtour-eliminationtraveling-salesman

Let (x,u)(x,u)(x,u) be feasible for problem (2) of Miller, Tucker and Zemlin, with parameter p≥0p\ge 0p≥0. Let r0,r1,…,rmr_0,r_1,\dots,r_mr0​,r1​,…,rm​ (m≥0m\ge 0m≥0) be cities, none equal to the base city 000, such that xrkrk+1=1x_{r_kr_{k+1}}=1xrk​rk+1​​=1 for k=0,…,m−1k=0,\dots,m-1k=0,…,m−1. Then

ur0−urm≤−m.u_{r_0}-u_{r_m}\le -m .ur0​​−urm​​≤−m.

For a single arc (m=1m=1m=1) this is the paper's inequality uri−uri+1≤−1u_{r_i}-u_{r_{i+1}}\le -1uri​​−uri+1​​≤−1, obtained from uri−uri+1+p xriri+1≤p−1u_{r_i}-u_{r_{i+1}}+p\,x_{r_ir_{i+1}}\le p-1uri​​−uri+1​​+pxri​ri+1​​≤p−1; for general mmm it is the summed form the paper uses twice ("Summing from i=ji=ji=j to k−1k-1k−1" and "Then, as before, ur1−urp+1≤−pu_{r_1}-u_{r_{p+1}}\le -pur1​​−urp+1​​≤−p"). The uiu_iui​ thus act as node potentials that strictly increase along every arc between non-base cities.

Formalization Note The path is a map rrr from {0,…,m}\{0,\dots,m\}{0,…,m} to the cities. Consecutive cities of the path are automatically distinct, since xii=0x_{ii}=0xii​=0 in the encoding of (2). The page states the summed bound as ≤j+1−k\le j+1-k≤j+1−k; the exact sum is j−kj-kj−k, which is what is stated here (−m-m−m for a path of mmm arcs). No hypothesis p≥1p\ge1p≥1 is needed.

Preamble
import Mathlib
import Definitions.Def_MillerTuckerZemlin_Formulation_Model
Formal statement
namespace MillerTuckerZemlin.Formulation

theorem potential_path_bound (n p : ℕ) (x : Fin (n + 1) → Fin (n + 1) → ℕ) (u : Fin (n + 1) → ℝ)
    (hx : Feasible n p x u) (m : ℕ) (r : Fin (m + 1) → Fin (n + 1))
    (hr : ∀ k, r k ≠ 0) (hpath : ∀ k : Fin m, x (r k.castSucc) (r k.succ) = 1) :
    u (r 0) - u (r (Fin.last m)) ≤ -(m : ℝ) := by sorry

end MillerTuckerZemlin.Formulation
Source
Miller, Tucker, Zemlin, Integer Programming Formulation of Traveling Salesman Problems, J. ACM 7(4) (1960), p. 328, proof of the equivalence, "Since none of the r's are zero we have" and "Summing from i = j to k − 1"
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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