A nonempty upward cone in a finite partial order has a maximal member
Provedexists_maximal_element_of_finite__p2m_30ea4785_5bd8_46ba_aa70_67a6b8ccdea6_a1approximation-algorithmsplanar-graphstreewidth
For any predicate on a finite partially ordered type, if it holds at a, then some element satisfying it and lying above a is maximal among such elements.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem exists_maximal_element_of_finite__p2m_30ea4785_5bd8_46ba_aa70_67a6b8ccdea6_a1
{α : Type} [Fintype α] [PartialOrder α]
(P : α → Prop) (a : α) (ha : P a) :
∃ m : α, P m ∧ a ≤ m ∧ ∀ k : α, m ≤ k → P k → k = m := 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).