Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of the equivalence, p. 327 — the constraints of (2) force x_ij ∈ {0, 1}

Proved
MillerTuckerZemlin.Formulation.feasible_x_le_one

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

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

Let n,p≥0n,p\ge 0n,p≥0 and let (x,u)(x,u)(x,u) be feasible for problem (2) of Miller, Tucker and Zemlin: the xijx_{ij}xij​ (0≤i≠j≤n0\le i\ne j\le n0≤i=j≤n) are non-negative integers with every column j=1,…,nj=1,\dots,nj=1,…,n and every row i=1,…,ni=1,\dots,ni=1,…,n summing to 111, and ui−uj+p xij≤p−1u_i-u_j+p\,x_{ij}\le p-1ui​−uj​+pxij​≤p−1 for 1≤i≠j≤n1\le i\ne j\le n1≤i=j≤n. Then

xij∈{0,1}for all 0≤i≠j≤n.x_{ij}\in\{0,1\}\qquad\text{for all } 0\le i\ne j\le n .xij​∈{0,1}for all 0≤i=j≤n.

This is the paper's remark "the constraints require that xij=0x_{ij}=0xij​=0 or 111", which makes the reading "the salesman proceeds from city iii to city jjj if and only if xij=1x_{ij}=1xij​=1" possible.

Formalization Note The statement is xij≤1x_{ij}\le 1xij​≤1 for all i,ji,ji,j in {0,…,n}\{0,\dots,n\}{0,…,n}; together with xij∈Nx_{ij}\in\mathbb Nxij​∈N this is xij∈{0,1}x_{ij}\in\{0,1\}xij​∈{0,1}. On the diagonal, xii=0x_{ii}=0xii​=0 is part of the encoding of (2) (there is no variable xiix_{ii}xii​).

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

theorem feasible_x_le_one (n p : ℕ) (x : Fin (n + 1) → Fin (n + 1) → ℕ) (u : Fin (n + 1) → ℝ)
    (hx : Feasible n p x u) : ∀ i j : Fin (n + 1), x i j ≤ 1 := 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, "Note that the constraints require that x_ij = 0 or 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