Cardinalities of a disjoint cover sum to the whole
ProvedWilliamsonShmoys.partition_cardinality_sum__p2m_2f886b64_45e5_4692_a31b_5084b02f539f_a1approximation-algorithmsplanar-graphstreewidth
For a finite disjoint cover, summing the cardinalities of the subsets equals the cardinality of the covered type. Empty members, if present, contribute zero.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.partition_cardinality_sum__p2m_2f886b64_45e5_4692_a31b_5084b02f539f_a1 {V : Type} [Fintype V] (parts : Finset (Finset V)) (hcover : ∀ v, ∃ C, C ∈ parts ∧ v ∈ C) (hdisjoint : ∀ C, C ∈ parts → ∀ D, D ∈ parts → C ≠ D → Disjoint C D) : (∑ C ∈ parts, Fintype.card {x : V // x ∈ C}) = 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).