Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.15: the optimal 1-tree is a lower bound, z(T^∗)≤z∗z(\hat T^*) \le z^*z(T^∗)≤z∗

Proved
SupplyChainTheory.one_tree_lower_bound

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

held-karplower-boundsoperations-researchspanning-treestraveling-salesman

Lemma 10.15. Let T^∗\hat T^*T^∗ be an optimal 1-tree for a TSP instance on n≥3n \ge 3n≥3 nodes, a spanning tree on the nodes other than the root plus two edges incident to the root, of least total length. Then z(T^∗)≤z∗z(\hat T^*) \le z^*z(T^∗)≤z∗.

Every tour is a 1-tree: removing the root leaves a spanning path on the other nodes, and the root has degree two. So the minimum 1-tree is a relaxation of the TSP, one that is easy to compute (an MST on the other nodes plus the two shortest edges at the root) and that improves on the MST bound by one edge.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem one_tree_lower_bound {n : ℕ} (c : Fin n → Fin n → ℝ) (hc : IsMetric c) (hn : 3 ≤ n)
    (r : Fin n) : opt1TreeLength c r ≤ 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. 442, Sect. 10.6.1, Lemma 10.15; after Held and Karp (1970)
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