Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aggregate the slack across multiple parts

Proved
WilliamsonShmoys.component_bounds_sum_aggregate_parts__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1

by Eyal1990 · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

If at least two parts partition the vertices and each part satisfies the three-unit slack bound, summing the bounds and using the edge-count identity gives the global bound.

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.component_bounds_sum_aggregate_parts__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (N : SimpleGraph V) (dN : DecidableRel N.Adj)
    (C : Finset (Finset V))
    (hcard : 3 <= Fintype.card V)
    (hmany : 2 <= C.card)
    (hsum : (∑ s ∈ C, s.card) = Fintype.card V)
    (hedges : N.edgeFinset.card = ∑ s ∈ C, (N.induce (s : Set V)).edgeFinset.card)
    (hcomponent : ∀ s ∈ C,
      (N.induce (s : Set V)).edgeFinset.card + 3 <= 3 * s.card) :
    N.edgeFinset.card <= 3 * Fintype.card V - 6 := by sorry
Source
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).

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