Cardinality sum for the partition
ProvedWilliamsonShmoys.component_bounds_sum_partition_cardinality__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1approximation-algorithmsplanar-graphstreewidth
The sum of the sizes of the nonempty parts equals the size of the partitioned finite vertex type, by unique coverage.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.component_bounds_sum_partition_cardinality__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1
{V : Type} [Fintype V] [LinearOrder V]
(C : Finset (Finset V))
(hpartition : ∀ v : V, ∃! s : Finset V, s ∈ C ∧ v ∈ s)
(hnonempty : ∀ s ∈ C, s.Nonempty) :
(∑ s ∈ C, s.card) = Fintype.card V := by sorrySource
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).