Order, lattices, ordered algebraic structures Fixed point theorems Theorem
Bourbaki–Witt theorem
Builds on Partial orderChainSupremumZorn's lemma
Statement
Let be a nonempty partially ordered set in which every chain has a supremum. Let be a map with for every . Then has a fixed point: there is with .
Remarks
The map need not be monotone; the hypothesis says that is inflationary. Proof idea: fix and let be the smallest subset of that contains , is closed under , and contains the supremum of each of its nonempty chains. A careful induction shows that is a chain, so it has a supremum , and . Then , so and . The proof uses no form of the axiom of choice. Combined with the axiom of choice, the theorem shows that such a poset has a maximal element. Otherwise a choice of some for each would be an inflationary map with no fixed point. This is a standard step in the proof of Zorn's lemma from the axiom of choice. The hypothesis is needed: on the chain , where every chain has a supremum, the map swapping and has no fixed point. The completeness hypothesis is needed too: on , the inflationary map has no fixed point, and the chain has no supremum.
Going deeper
For a student
The theorem is a choice-free fixed-point principle for chain-complete posets. It is a standard route to Zorn's lemma from the axiom of choice, and it is used to build objects by transfinite recursion without naming ordinals. Unlike the Knaster–Tarski theorem, it does not need monotonicity, but it says nothing about least fixed points.
Reading path
To understand this page from the ground up, read these 33 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Chain concept
- Element definition
- Partial order concept
- Proposition concept
- Supremum concept
- Set definition
- Disjunction definition
- Implication definition
- Predicate definition
- Family of sets definition
- Ordered pair definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Union of a family of sets definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Function definition
- Preorder definition
- Choice function definition
- Partial order definition
- Axiom of choice statement
- Maximal element definition
- Total order definition
- Upper bound definition
- Chain definition
- Zorn's lemma statement
- Bourbaki–Witt theorem statement
Further reading
About this page
| Tag | 9EABA9ZDZS |
|---|---|
| URI | m2://9EABA9ZDZS |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 06A06, 47H10, 03E25 |
| Status | This copy of the site has no build data. Run m2 status 9EABA9ZDZS. |
| About | Partial order |
| Uses | Partial order, Chain, Supremum, Zorn's lemma |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.