Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 10.3: ∑i∈H,j∉Hxij+∑k∑i∈Tk,j∉Tkxij≥3s+1\sum_{i \in H, j \notin H} x_{ij} + \sum_k \sum_{i \in T_k, j \notin T_k} x_{ij} \ge 3s + 1∑i∈H,j∈/H​xij​+∑k​∑i∈Tk​,j∈/Tk​​xij​≥3s+1 for every tour

Proved
SupplyChainTheory.two_matching_cut_form

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

operations-researchpolyhedral-combinatoricstraveling-salesmanvalid-inequalities

Proposition 10.3. For any handle HHH and teeth T1,…,TsT_1, \dots, T_sT1​,…,Ts​ satisfying the conditions of Theorem 10.2, every tour through NNN satisfies

∑i∈H, j∉Hxij+∑k=1s∑i∈Tk, j∉Tkxij  ≥  3s+1,\sum_{i \in H,\ j \notin H} x_{ij} + \sum_{k=1}^s \sum_{i \in T_k,\ j \notin T_k} x_{ij} \;\ge\; 3s + 1,i∈H, j∈/H∑​xij​+k=1∑s​i∈Tk​, j∈/Tk​∑​xij​≥3s+1,

the number of tour edges leaving the handle plus the numbers leaving each tooth is at least 3s+13s + 13s+1. The book's proof: a tooth whose two nodes are joined by a tour edge has two edges leaving it, any other tooth four; each such joined tooth contributes an edge leaving HHH; and the number of edges leaving HHH is even while sss is odd, which forces one extra edge when every tooth is joined.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem two_matching_cut_form {n s : ℕ} (hn : 3 ≤ n) (τ : Equiv.Perm (Fin n))
    (H : Finset (Fin n)) (T : Fin s → Finset (Fin n)) (hcomb : IsComb H T)
    (hteeth : ∀ k, (T k).card = 2) :
    3 * s + 1 ≤ edgesLeaving τ H + ∑ k, edgesLeaving τ (T k) := 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. 414-415, Sect. 10.3.3, Proposition 10.3, Eq. (10.16)-(10.19), and its proof
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