2026-08-28·by Sijie Wang#idea#math

zorns-lemma

Parent: order-theory

Zorn's lemma

In a partially ordered set where every chain (totally-ordered subset) has an upper bound, there exists a maximal element.

The equivalence (over ZF)

Zorn's lemma ⟺ the Axiom of Choice ⟺ the Well-ordering theorem (every set can be well-ordered).

How it's used

The recipe for a non-constructive existence proof:

  1. Form the poset of partial solutions, ordered by extension.
  2. Show any chain has an upper bound — usually the union of the chain is itself a partial solution.
  3. Zorn gives a maximal partial solution.
  4. Argue a maximal one must be complete/total (else you could extend it, contradicting maximality).

Classic uses: every vector space has a basis; every proper ideal sits inside a maximal ideal; every field has an algebraic closure; Hahn–Banach; ultrafilters exist; Tychonoff (arbitrary products of compact spaces are compact).

Not a constructive fixed point

Distinguish from the choice-free order theorems in the neighborhood: Knaster–Tarski (complete lattice), Kleene (CPO, climb from ), and Bourbaki–Witt (chain-complete + inflationary map) all give fixed/maximal points without choice. Zorn is the one that needs AC — it's the non-constructive existence tool. (Bourbaki–Witt is often the lemma used to prove Zorn.)

about this entry

One of sijie's wiki entries. The AI on this site is grounded in the same corpus and answers in sijie's voice, with citations back to entries like this one — answering costs sijie money, so it waits behind a code: enter an access code →