Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark, p. 326 — an itinerary with t tours of at most p cities each requires tp ≥ n

Proved
MillerTuckerZemlin.Formulation.itinerary_tours_mul_p_ge

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

combinatoricsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1traveling-salesman

Let III be a legitimate itinerary of problem (1) of Miller, Tucker and Zemlin: ttt tours from the base city 000, together visiting each of the cities 1,…,n1,\dots,n1,…,n exactly once, each tour visiting at most ppp cities. Then

tp ≥ n.tp\ \ge\ n .tp ≥ n.

This is the paper's remark that, for fixed ttt, problem (1) has a solution only if tp≥ntp\ge ntp≥n; for t=1t=1t=1, p≥np\ge np≥n it is the standard traveling salesman problem.

Formalization Note ttt is the number of tours of the itinerary, i.e. the length of the list.

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

theorem itinerary_tours_mul_p_ge (n p : ℕ) (I : Itinerary n) (hI : IsItinerary n p I) :
    n ≤ I.length * p := by sorry

end MillerTuckerZemlin.Formulation
Source
Miller, Tucker, Zemlin, Integer Programming Formulation of Traveling Salesman Problems, J. ACM 7(4) (1960), p. 326, remark after (1), "Note that if t is fixed, then for the problem to have a solution we must have tp ≧ n"
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