Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.16: under cij′=cij+λi+λjc'_{ij} = c_{ij} + \lambda_i + \lambda_jcij′​=cij​+λi​+λj​, tours gain 2∑iλi2\sum_i\lambda_i2∑i​λi​, optimal tours stay optimal, and a 1-tree gains ∑idiλi\sum_i d_i \lambda_i∑i​di​λi​

Proved
SupplyChainTheory.revised_cost_identities

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

held-karpoperations-researchspanning-treestraveling-salesman

Lemma 10.16. Let λ∈Rn\lambda \in \mathbb{R}^nλ∈Rn and cij′=cij+λi+λjc'_{ij} = c_{ij} + \lambda_i + \lambda_jcij′​=cij​+λi​+λj​ (10.31).

(a) If Γ\GammaΓ is a TSP tour, then z′(Γ)=z(Γ)+2∑iλiz'(\Gamma) = z(\Gamma) + 2\sum_i \lambda_iz′(Γ)=z(Γ)+2∑i​λi​.

(b) If Γ∗\Gamma^*Γ∗ is an optimal tour under ccc, then it is also optimal under c′c'c′.

(c) For any 1-tree T^\hat TT^, z′(T^)=z(T^)+∑idi(T^)λiz'(\hat T) = z(\hat T) + \sum_i d_i(\hat T)\lambda_iz′(T^)=z(T^)+∑i​di​(T^)λi​, where di(T^)d_i(\hat T)di​(T^) is the degree of node iii in T^\hat TT^.

The book omits the proof (Problem 10.15). Every node has degree two in a tour, which gives (a) and hence (b), while a 1-tree's degrees vary, which is why the revision can raise the optimal 1-tree length relative to the tour length and tighten the bound.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem revised_cost_identities {n : ℕ} (c : Fin n → Fin n → ℝ) (hc : IsMetric c) (hn : 3 ≤ n)
    (lam : Fin n → ℝ) :
    (∀ τ : Equiv.Perm (Fin n), tourLength (revisedCost c lam) τ = tourLength c τ + 2 * ∑ i, lam i)
      ∧ (∀ τ : Equiv.Perm (Fin n), IsMinOn (tourLength c) Set.univ τ →
          IsMinOn (tourLength (revisedCost c lam)) Set.univ τ)
      ∧ ∀ (r : Fin n) (G : SimpleGraph (Fin n)), Is1Tree r G →
          graphWeight (revisedCost c lam) G = graphWeight c G + ∑ i, G.degree i * lam i := 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, p. 446, Sect. 10.6.1, Lemma 10.16, Eq. (10.31)-(10.32): 'Proof. Omitted; see Problem 10.15'
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