In a finite nonempty directed set, repeatedly take an internal common upper bound of the element reached so far and the next element. The final member is above every element of the directed set and is therefore its greatest element and least upper bound.
A real number is the supremum of a nonempty set if every satisfies and no smaller real number is an upper bound. Equivalently, for every there is with . A greatest element, or maximum, additionally belongs to .
Let and suppose . Fix . The approximation property gives at least one element of in . If there were only finitely many, they would have a largest value . Every other element of is at most , so would be an upper bound for the whole set. This contradicts the definition of the supremum. Therefore there are infinitely many such elements, the accumulation below an unattained supremum.
For a counterexample when the supremum is attained, take . Its supremum and greatest element are both zero, while every interval contains no elements of .
The inductive definition of ordinal addition is
for a limit ordinal .
The synthetic definition takes the order type of the disjoint union of a copy of followed by a copy of : every point of the first copy precedes every point of the second, and each copy retains its original total order.
Fix and use transfinite induction on . The synthetic sum with the empty order is . Appending a greatest element produces the successor ordinal rule. At a limit ordinal , the second copy is the union of its initial segments of types , so the whole order has type
. Thus the synthetic operation satisfies the inductive recursion; uniqueness in transfinite recursion proves the definitions equivalent.
Take the natural numbers including zero with their usual total order:
A nonempty subset with an upper bound is contained in the finite set . It therefore has a greatest element, which is its least upper bound. The empty subset has least upper bound . Thus is a bounded-complete partially ordered set.
But is a directed set, since is above any two members. It has no upper bound in : for any proposed bound , the member is larger. It therefore has no least upper bound. Hence
An upper bound of is an element with for every . It need not belong to . A maximum, or greatest element, is an with that same property. A least upper bound is an upper bound satisfying for every upper bound .
A maximum belongs to ; a least upper bound need not. In a partially ordered set, an existing maximum is automatically the least upper bound, and the antisymmetric relation condition makes each unique.
Write each member as . Every member is strictly below , so is an upper bound. If , the Archimedean property supplies with ; then . Thus no smaller number is an upper bound, proving . Since , there is no greatest element. Equivalently, each member is followed by a larger member because .
Take two increasing countable chains sharing a least element and a greatest element , with interiors and and no comparisons between branches. Each entire interior chain has as its least upper bound. A directed set meeting both interiors must contain . Otherwise it lies within one branch, where it has either a greatest member or least upper bound . This proves that the partially ordered set is a directed-complete partial order.
The only element way-below is . Indeed, an element way-below must be below , but every positive fails the way-below relation when tested against : its least upper bound is , yet it has no member above . Nonempty directed sets always contain an element above , so . Thus the elements way-below have least upper bound , and this is not a continuous poset.
Zorn's lemma 2026-10-14
Let be a nonempty partially ordered set. If every chain in a partial order has an upper bound in , then has a maximal element. The hypothesis means
The upper bound may depend on and need not belong to . A least upper bound is not required. The conclusion asserts that some satisfies ; it does not assert a greatest element, which would satisfy for every .[ref]
Here a chain in a partial order may be the empty set. Every member of is an upper bound of the empty chain in a partial order, so including it in the hypothesis already forces to be nonempty. If “chain” means only nonempty chains in a partial order, the separate nonempty- assumption is essential: the empty poset otherwise satisfies the hypothesis vacuously and has no maximal element. These are two equivalent conventions for the theorem.
The strength of Zorn's lemma is that compatible partial constructions can have a completed, unextendible member without an explicit procedure for finding it. The next examples separate the upper bound calculation from the reason a maximal element has the desired property. All chains in a partial order must be covered, including uncountable ones, rather than just increasing sequences. The condition is sufficient, not necessary: a poset can have a maximal element and still have an unbounded chain in a partial order elsewhere.
Consider the following finite set of subsets, ordered by subset containment:
Every nonempty chain in a partial order has a greatest element within that chain in a partial order, hence an upper bound in . For the empty chain in a partial order, choose . Thus the hypothesis of Zorn's lemma holds. The two maximal elements are and : neither is a proper subset of another member of . There is no greatest element, because it would have to contain both, and no member of contains .
Figure 1.
A finite inclusion poset with two maximal elements and no greatest element
. Lines show immediate upward inclusions; following upward paths gives all other strict comparisons. The blue path is a chain, and the orange nodes are the two maximal elements. Details.
For the chain in a partial order , the member is already an upper bound, although it is not a maximal element of . Both orange members are also upper bounds for . A chain in a partial order need not have a unique upper bound, and the upper bound used to check the hypothesis need not be the eventual maximal element.
The restriction to chains in a partial order matters. The subset has no upper bound in , but its two members are incomparable, so it is not a chain in a partial order. Requiring every subset of to have an upper bound would be much stronger: taking that subset to be itself would force a greatest element.