Zorn's lemma lets mathematicians finish constructions that never actually end
Suppose you are building something step by step, you have not finished after infinitely many steps, and nothing seems to stop you from continuing. A single statement from set theory, Zorn's lemma, says a finished object must exist anyway. It is how mathematicians prove that every vector space has a basis.
The lemma speaks the language of partially ordered sets, collections where some pairs of elements can be compared as smaller or larger but others may not be comparable at all. A chain is a subset in which every pair is comparable, lined up in order. An upper bound for a chain is an element at least as large as everything in it. Zorn's lemma states that if every chain has an upper bound, then the whole collection contains at least one maximal element, one with nothing strictly above it.
Kazimierz Kuratowski proved it in 1922, and Max Zorn found it independently in 1935, which is why it is sometimes called the Kuratowski-Zorn lemma. Both relied on the axiom of choice, and the connection runs deep: within standard set theory without choice, Zorn's lemma, the axiom of choice and the well-ordering theorem each imply the other two. An older relative, the Hausdorff maximal principle, says every chain sits inside a largest possible chain.
Its value is practical. Without it, a mathematician hunting for a maximal object would suppose none exists and grind through a transfinite induction to reach a contradiction, over and over for each new problem. The lemma packages that argument once, so all that remains is checking its conditions. For a basis, one collects all linearly independent sets of vectors, notes that the union of any chain of them is still independent, and concludes a maximal one exists; if it failed to span the space, adding a missing vector would make it bigger, a contradiction.
The same pattern proves that every nontrivial ring with unity contains a maximal ideal, that every field has an algebraic closure, the Hahn-Banach theorem and Tychonoff's theorem on compact spaces. The lemma can fail for collections too large to be sets: the class of all ordinals has no top element, the Burali-Forti paradox.
Source: Zorn's lemma
