A new point strictly increases finite subtype cardinality
ProvedWilliamsonShmoys.card_subtype_lt_of_subset_of_newapproximation-algorithmsplanar-graphstreewidth
For predicates on a finite type, if every P-point is a Q-point and there is a Q-point that is not a P-point, then the subtype satisfying Q has strictly larger cardinality.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.card_subtype_lt_of_subset_of_new
{α : Type} [Fintype α] (P Q : α → Prop)
[DecidablePred P] [DecidablePred Q]
(hsubset : ∀ x : α, P x → Q x)
(a : α) (haQ : Q a) (haP : ¬ P a) :
Fintype.card {x : α // P x} < Fintype.card {x : α // Q x} := 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).