Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the equivalence, p. 327 — under the correspondence the objective of (2) is the distance travelled in (1)

Proved
MillerTuckerZemlin.Formulation.objective_eq_itineraryLength

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

formulationinteger-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1traveling-salesman

Let III be a legitimate itinerary of problem (1) of Miller, Tucker and Zemlin with at most ppp cities per tour, let aij(I)a_{ij}(I)aij​(I) be the number of times III travels from city iii to city jjj, and let dij∈Rd_{ij}\in\mathbb Rdij​∈R (0≤i,j≤n0\le i,j\le n0≤i,j≤n) be arbitrary distances. Then

∑∑0≤i≠j≤ndij aij(I)  =  ∑(i,j) travelled by Idij,\sum\sum_{0\le i\ne j\le n} d_{ij}\,a_{ij}(I)\;=\;\sum_{(i,j)\ \text{travelled by } I} d_{ij},∑0≤i=j≤n∑​dij​aij​(I)=(i,j) travelled by I∑​dij​,

the right-hand side summing over all arcs of all tours of III with multiplicity. That is, under the correspondence x=a(I)x=a(I)x=a(I) the form minimized in (2) is the total distance travelled by the salesman in (1).

Formalization Note No sign, symmetry or triangle condition is placed on ddd, as on the page. The diagonal diid_{ii}dii​ appears on neither side: a legitimate itinerary never travels an arc (i,i)(i,i)(i,i).

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

theorem objective_eq_itineraryLength (n p : ℕ) (d : Fin (n + 1) → Fin (n + 1) → ℝ)
    (I : Itinerary n) (hI : IsItinerary n p I) :
    objective d (arcCount I) = itineraryLength d I := by sorry

end MillerTuckerZemlin.Formulation
Source
Miller, Tucker, Zemlin, Integer Programming Formulation of Traveling Salesman Problems, J. ACM 7(4) (1960), p. 327, proof of the equivalence, "Under this correspondence the form to be minimized in (2) is the total distance to be traveled by the salesman in (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