The Axiom of Choice, the Well-Ordering Theorem, and Zorn's Lemma are logically equivalent within ZFC. Each allows powerful existence proofs without constructing objects explicitly. This equivalence reveals that choice, well-ordering, and maximal-element arguments are fundamentally interchangeable.
You already know the Axiom of Choice: given any collection of non-empty sets, there exists a function that picks one element from each set simultaneously. You know the Well-Ordering Theorem: every set can be equipped with a total ordering in which every non-empty subset has a least element. And you know Zorn's Lemma: if every chain in a partially ordered set has an upper bound, the whole set has a maximal element. These three statements look completely different — one is about selecting elements, one is about ordering sets, one is about maximal elements in posets. Yet within ZFC, they are all exactly equivalent: each implies the other two, and none can be proved without some form of the others.
The direction AC → Well-Ordering is the most constructive to follow intuitively. Given any set S, use AC to repeatedly pick elements: choose the first element, then choose one from the remainder, then one from what's left, continuing transfinitely. At each step, AC guarantees a choice function exists even when infinitely many steps remain. Glueing all these choices together via transfinite recursion produces a well-ordering of S. The argument requires transfinite induction — you need ordinals to index steps beyond the finite — but the core idea is "keep choosing."
The direction Well-Ordering → Zorn's Lemma uses the well-ordering to construct a maximal chain by transfinite recursion: start at the least element, always extend the chain upward if possible. The chain-upper-bound hypothesis ensures you never get stuck at a limit step. When the recursion exhausts the well-ordering without finding a new element to add, the chain is maximal; its upper bound is a maximal element of the poset.
The direction Zorn's Lemma → AC closes the cycle. Given a collection of non-empty sets, form the poset of all partial choice functions (functions defined on some subcollection, picking one element from each set in the subcollection), ordered by extension. Every chain of partial choice functions has an upper bound (take the union). Zorn's Lemma guarantees a maximal partial choice function. A maximality argument shows it must be defined on the entire collection — otherwise you could extend it, contradicting maximality.
The practical takeaway is fluency in switching between the three forms. In algebra, you use Zorn's Lemma to prove every vector space has a basis, every ring has a maximal ideal, every field has an algebraic closure. In topology, you use it to prove Tychonoff's theorem. Whenever you see "take a maximal element" in a proof, Zorn is at work; whenever you see "well-order and proceed by transfinite induction," AC is in use. Recognizing which form is most natural for a given argument is the skill these equivalences teach.