The Bourbaki–Witt theorem
ProvedFamousTheorems.bourbaki_wittThe Bourbaki–Witt theorem. Let be a nonempty chain-complete partial order, i.e. every chain has a supremum. Every inflationary map , meaning for all , has a fixed point.
Unlike Knaster–Tarski, no monotonicity is assumed, and the proof (by the tower of iterates from a starting point) uses no choice. It gives a choice-free route from the Hausdorff maximality principle to Zorn's lemma and to theorems on maximal elements.
Formalization note. Mathlib's ChainCompletePartialOrder.nonempty_fixedPoints_of_inflationary; Function.fixedPoints f is the set of fixed points.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem bourbaki_witt {α : Type*} [ChainCompletePartialOrder α] {f : α → α} [Nonempty α] (le_map : ∀ x, x ≤ f x) :
(Function.fixedPoints f).Nonempty := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `ChainCompletePartialOrder.nonempty_fixedPoints_of_inflationary`. Proof here reduces to that Mathlib result.