Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the equivalence, p. 328 — no tour of a feasible x visits more than p cities

Proved
MillerTuckerZemlin.Formulation.no_tour_longer_than_p

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

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

Let p≥1p\ge 1p≥1 and let (x,u)(x,u)(x,u) be feasible for problem (2) of Miller, Tucker and Zemlin. Then no tour of xxx visits more than ppp cities: there are no cities r1,…,rp+1r_1,\dots,r_{p+1}r1​,…,rp+1​, all different from the base city 000, with

x0r1=xr1r2=⋯=xrprp+1=1.x_{0r_1}=x_{r_1r_2}=\cdots=x_{r_pr_{p+1}}=1 .x0r1​​=xr1​r2​​=⋯=xrp​rp+1​​=1.

Together with the absence of subtours avoiding 000, this is the half of the equivalence that shows a feasible solution of (2) describes an itinerary of (1) with at most ppp cities per tour.

Formalization Note The cities r1,…,rp+1r_1,\dots,r_{p+1}r1​,…,rp+1​ are a map from {0,…,p}\{0,\dots,p\}{0,…,p} to the cities (index shifted down by one). The hypothesis p≥1p\ge1p≥1 is not on the page: for p=0p=0p=0 the claim is false (with n=1n=1n=1, x01=x10=1x_{01}=x_{10}=1x01​=x10​=1 is feasible, there being no uuu-constraint, and x01=1x_{01}=1x01​=1 is a tour of 1>01>01>0 cities). The paper's step urp+1−ur1+p xrp+1r1≤p−1u_{r_{p+1}}-u_{r_1}+p\,x_{r_{p+1}r_1}\le p-1urp+1​​−ur1​​+pxrp+1​r1​​≤p−1 needs rp+1≠r1r_{p+1}\ne r_1rp+1​=r1​, which the paper leaves implicit.

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

theorem no_tour_longer_than_p (n p : ℕ) (hp : 1 ≤ p) (x : Fin (n + 1) → Fin (n + 1) → ℕ)
    (u : Fin (n + 1) → ℝ) (hx : Feasible n p x u) (r : Fin (p + 1) → Fin (n + 1))
    (hr : ∀ k, r k ≠ 0) (h0 : x 0 (r 0) = 1) :
    ¬ ∀ k : Fin p, x (r k.castSucc) (r k.succ) = 1 := 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, "It remains to observe that no tour is of length greater than p"
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