Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.2: the 2-matching inequality ∑i,j∈Hxij+∑k∑i,j∈Tkxij≤∣H∣+12(s−1)\sum_{i,j \in H} x_{ij} + \sum_k \sum_{i,j \in T_k} x_{ij} \le |H| + \tfrac{1}{2}(s-1)∑i,j∈H​xij​+∑k​∑i,j∈Tk​​xij​≤∣H∣+21​(s−1) holds for every tour

Proved
SupplyChainTheory.two_matching_inequality

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

operations-researchpolyhedral-combinatoricstraveling-salesmanvalid-inequalities

Theorem 10.2. For any handle H⊆NH \subseteq NH⊆N and teeth T1,…,Ts⊆NT_1, \dots, T_s \subseteq NT1​,…,Ts​⊆N such that each TkT_kTk​ contains exactly one node in HHH and one node not in HHH, the teeth are pairwise disjoint, and s≥3s \ge 3s≥3 is odd, the 2-matching (blossom) inequality

∑i,j∈Hxij+∑k=1s∑i,j∈Tkxij  ≤  ∣H∣+12(s−1)\sum_{i,j \in H} x_{ij} + \sum_{k=1}^s \sum_{i,j \in T_k} x_{ij} \;\le\; |H| + \tfrac{1}{2}(s-1)i,j∈H∑​xij​+k=1∑s​i,j∈Tk​∑​xij​≤∣H∣+21​(s−1)

is valid for every tour through NNN, where xij=1x_{ij} = 1xij​=1 when the tour uses edge {i,j}\{i, j\}{i,j}. The book's proof counts degrees: if the left side reached ∣H∣+12(s+1)|H| + \frac{1}{2}(s+1)∣H∣+21​(s+1), the nodes of HHH would have total degree at least 2∣H∣+12|H| + 12∣H∣+1, so some node would have degree greater than 222. Here the count is over the edge set of a tour on n≥3n \ge 3n≥3 nodes, and 12(s−1)\tfrac{1}{2}(s-1)21​(s−1) is the exact natural number since sss is odd.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem two_matching_inequality {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) :
    edgesWithin τ H + ∑ k, edgesWithin τ (T k) ≤ H.card + (s - 1) / 2 := 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. 413-414, Sect. 10.3.3, Theorem 10.2, Eq. (10.15), and its proof; after Hong (1972)
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