Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Allowance sum for multiple nonempty parts

Proved
WilliamsonShmoys_partition_allowance_sum_large_family__p2m_fd88c45a_7ea7_48a7_9749_c5d6b2241812_a5

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

approximation-algorithmsplanar-graphstreewidth

For at least two nonempty parts whose cardinalities sum to |V|, with |V| at least three, the sum of the specified singleton, pair, and larger-part allowances is at most 3|V|−6.

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys_partition_allowance_sum_large_family__p2m_fd88c45a_7ea7_48a7_9749_c5d6b2241812_a5 {V : Type} [Fintype V] (parts : Finset (Finset V)) (hnonempty : ∀ s ∈ parts, s.Nonempty) (hparts : 2 ≤ parts.card) (hsum : ∑ s ∈ parts, s.card = Fintype.card V) (hcard : 3 ≤ Fintype.card V) : (let f : Finset V → Nat := fun s => if Fintype.card s ≤ 1 then 0 else if Fintype.card s = 2 then 1 else 3 * Fintype.card s - 6; ∑ s ∈ parts, f s ≤ 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