Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.17 (Held-Karp bound): z∗≥z(T^∗)+∑iλi(di(T^∗)−2)z^* \ge z(\hat T^*) + \sum_i \lambda_i (d_i(\hat T^*) - 2)z∗≥z(T^∗)+∑i​λi​(di​(T^∗)−2) for every λ\lambdaλ

Proved
SupplyChainTheory.held_karp_bound

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

held-karplagrangian-relaxationlower-boundsoperations-researchtraveling-salesman

Theorem 10.17. For any λ∈Rn\lambda \in \mathbb{R}^nλ∈Rn,

z∗  ≥  z(T^∗)+∑i∈Nλi(di(T^∗)−2),z^* \;\ge\; z(\hat T^*) + \sum_{i \in N} \lambda_i\big(d_i(\hat T^*) - 2\big),z∗≥z(T^∗)+i∈N∑​λi​(di​(T^∗)−2),

where T^∗\hat T^*T^∗ is an optimal 1-tree under the revised distances cij′=cij+λi+λjc'_{ij} = c_{ij} + \lambda_i + \lambda_jcij′​=cij​+λi​+λj​ of (10.31) and di(T^∗)d_i(\hat T^*)di​(T^∗) its node degrees. The right-hand side is the Held-Karp lower bound zHK(λ)z_{HK}(\lambda)zHK​(λ); it follows from Lemma 10.15 applied to c′c'c′ and both parts of Lemma 10.16. Maximizing it over λ\lambdaλ by subgradient steps (10.34) gives the strongest bounds in practice for the TSP, and the bound is the Lagrangian relaxation of the degree constraints.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem held_karp_bound {n : ℕ} (c : Fin n → Fin n → ℝ) (hc : IsMetric c) (hn : 3 ≤ n)
    (lam : Fin n → ℝ) (r : Fin n) (G : SimpleGraph (Fin n)) (hG : Is1Tree r G)
    (hopt : ∀ G' : SimpleGraph (Fin n), Is1Tree r G' →
      graphWeight (revisedCost c lam) G ≤ graphWeight (revisedCost c lam) G') :
    graphWeight c G + ∑ i, lam i * ((G.degree i : ℝ) - 2) ≤ 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, p. 446, Sect. 10.6.1, Theorem 10.17, Eq. (10.33), and its proof; after Held and Karp (1970, 1971)
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