A nonempty finite partial order has a maximal element

Proved

exists_maximal_element_finite__p2m_8824e35c_b427_4577_adf2_2966f46879ec_a1

by Eyal1990 · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

Every nonempty predicate on a finite partial order contains an element with no strictly larger element in that predicate.

Preamble

import Mathlib

set_option autoImplicit false

Formal statement

theorem exists_maximal_element_finite__p2m_8824e35c_b427_4577_adf2_2966f46879ec_a1
    {α : Type} [Fintype α] [PartialOrder α] (p : α → Prop)
    (hne : ∃ a, p a) :
    ∃ a, p a ∧ ∀ b, p b → a ≤ b → b = a := by sorry

Source

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).

View graph