Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.1 (Little et al.): after reducing rows by ρi≥0\rho_i \ge 0ρi​≥0 and columns by κj≥0\kappa_j \ge 0κj​≥0 with all reduced entries nonnegative, ∑iρi+∑jκj≤z∗\sum_i \rho_i + \sum_j \kappa_j \le z^*∑i​ρi​+∑j​κj​≤z∗

Proved
SupplyChainTheory.reduced_matrix_bound

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

branch-and-boundlower-boundsoperations-researchtraveling-salesman

Theorem 10.1. Let cij′=cij−ρi−κjc'_{ij} = c_{ij} - \rho_i - \kappa_jcij′​=cij​−ρi​−κj​ for all i≠ji \ne ji=j, where ρi,κj≥0\rho_i, \kappa_j \ge 0ρi​,κj​≥0 are constants such that cij′≥0c'_{ij} \ge 0cij′​≥0 for all i≠ji \ne ji=j. Then h=∑iρi+∑jκjh = \sum_i \rho_i + \sum_j \kappa_jh=∑i​ρi​+∑j​κj​ is a lower bound on the optimal tour length z∗z^*z∗.

Every tour, traversed in one direction, leaves each node once and enters each node once, so its length under c′c'c′ is its length under ccc minus exactly hhh; being nonnegative under c′c'c′, it is at least hhh under ccc. This is the bounding device of Little et al.'s branch-and-bound.

Formalization Note The book applies the reduction to the upper-triangular matrix only (i<ji < ji<j) and asserts the same conclusion. That version is false: node nnn is never a row and node 111 never a column of a triangular entry, so ρn\rho_nρn​ (or κ1\kappa_1κ1​) may be arbitrarily large, and even with the row and column reductions restricted to the entries that exist, a random metric instance violates the bound (see the mission's checks). The statement here is the full-matrix reduction, which is what Little et al. prove and what makes the bookkeeping exact. It needs at least two nodes. With n=1n = 1n=1 the only "tour" is the self-loop c11c_{11}c11​, no entry i≠ji \ne ji=j constrains ρ1\rho_1ρ1​ or κ1\kappa_1κ1​, and the bound fails for large ρ1\rho_1ρ1​.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem reduced_matrix_bound {n : ℕ} (c : Fin n → Fin n → ℝ) (hn : 2 ≤ n) (ρ κ : Fin n → ℝ)
    (hρ : ∀ i, 0 ≤ ρ i) (hκ : ∀ j, 0 ≤ κ j) (hc : ∀ i j, i ≠ j → 0 ≤ reducedCost c ρ κ i j) :
    ∑ i, ρ i + ∑ j, κ j ≤ optTourLength c := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, pp. 408-409, Sect. 10.3.2, Theorem 10.1 and the preceding derivation; after Little, Murty, Sweeney and Karel (1963)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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