Finite maximality from a strictly increasing measure
ProvedWilliamsonShmoys.finite_maximal_of_strict_nat_measure__p2m_5b41b99b_00ea_48ee_b254_cd4945e2b482_a1approximation-algorithmsplanar-graphstreewidth
In a finite partially ordered type, if a natural-valued measure strictly increases on every proper comparable pair, every nonempty predicate has a maximal element within that predicate. Choose an element maximizing the measure among predicate-satisfying elements.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_maximal_of_strict_nat_measure__p2m_5b41b99b_00ea_48ee_b254_cd4945e2b482_a1
{α : Type} [Fintype α] [PartialOrder α]
(P : α → Prop) (μ : α → ℕ)
(hstrict : ∀ ⦃a b : α⦄, a ≤ b → a ≠ b → μ a < μ b)
(hne : ∃ a, P a) :
∃ a, P a ∧ ∀ b, P b → 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).