Maximal extension in a finite partial order
ProvedWilliamsonShmoys.finite_partialOrder_maximal_extensionIn a finite partially ordered type, every element satisfying a property has a maximal extension among elements satisfying that property.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_partialOrder_maximal_extension
{α : Type} [Finite α] [PartialOrder α]
(P : α → Prop) (a : α) (ha : P a) :
∃ b : α, a ≤ b ∧ P b ∧
∀ c : α, P c → b ≤ c → b = c := 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).