A finite partial order has a maximal element above each element
Provedfinite_partial_order_has_maximal_above__p2m_b64ec28e_2554_405c_95cb_8078e84c56ed_a1approximation-algorithmsplanar-graphstreewidth
In a finite partially ordered type, every element lies below a maximal element.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem finite_partial_order_has_maximal_above__p2m_b64ec28e_2554_405c_95cb_8078e84c56ed_a1
{α : Type} [PartialOrder α] [Finite α] (a : α) :
∃ b : α, a ≤ b ∧ ∀ c : α, b ≤ c → c = b := 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).