Maximal element of a finite subset of a partial order
ProvedWilliamsonShmoys.planar_drawing_on_maximal_extension_repair2_finite_maximalapproximation-algorithmsplanar-graphstreewidth
Every nonempty finite subset of a partial order contains an element maximal within that subset.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_on_maximal_extension_repair2_finite_maximal
{α : Type} [PartialOrder α]
(s : Set α) (hne : s.Nonempty) (hfin : s.Finite) :
∃ a ∈ s, ∀ b ∈ s, a ≤ b → b ≤ a := 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).