Questions: Axiom of Choice and Equivalence with Well-Ordering and Zorn's Lemma

Question 1

A mathematician wants to prove that every vector space has a basis. Which of the following tools is most naturally suited to this proof?

• A. The Axiom of Extensionality, because bases are defined by set equality
• B. Zorn's Lemma, applied to the poset of linearly independent sets ordered by inclusion
• C. The Well-Ordering Theorem, applied directly to the vector space elements
• D. The Axiom of Pairing, to construct basis elements one at a time

Answer: (B)

The standard proof uses Zorn's Lemma. Form the poset of all linearly independent subsets of the vector space, ordered by inclusion. Every chain (totally ordered family of linearly independent sets) has an upper bound — take the union, which is still linearly independent. Zorn's Lemma then guarantees a maximal linearly independent set, and a maximality argument shows this must span the whole space (a basis). This is the prototypical 'take a maximal element' application. While AC or the Well-Ordering Theorem could be used (they're all equivalent), Zorn's Lemma is the cleanest formulation for poset-based maximality arguments like this one.

Question 2

In the proof that Zorn's Lemma implies the Axiom of Choice, what poset is constructed?

• A. The poset of all well-orderings of the given collection of sets, ordered by length
• B. The poset of all partial choice functions on the collection, ordered by extension
• C. The poset of all singleton subsets of the collection, ordered by inclusion
• D. The poset of all total orderings of the collection, ordered by consistency

Answer: (B)

The proof constructs the poset of all partial choice functions — functions defined on some subcollection that pick one element from each set in that subcollection — ordered by extension (f ≤ g when g extends f to more sets). Every chain of partial choice functions has an upper bound (take the union, which is still a valid partial choice function). Zorn's Lemma then gives a maximal partial choice function. A maximality argument finishes the proof: if this maximal function were undefined on some set in the collection, you could extend it by picking one element from that set, contradicting maximality. So it must be defined on the entire collection — it is a full choice function.

Question 3

The Axiom of Choice, the Well-Ordering Theorem, and Zorn's Lemma are most provable from the other axioms of ZFC without assuming any of them.

• T. True
• F. False

Answer: False

All three are equivalent to each other within ZFC — meaning each implies the other two — but none can be proved from the remaining ZFC axioms alone. The independence of AC from ZFC was established by Gödel (AC is consistent with ZFC) and Cohen (its negation is also consistent with ZFC). This means you can do set theory in which AC holds or in which it fails; neither leads to contradiction. Mathematicians who work without AC (constructivists, for instance) must avoid all three equivalent forms, including Zorn's Lemma and the Well-Ordering Theorem.

Question 4

Because AC, Well-Ordering, and Zorn's Lemma are most equivalent, a proof using Zorn's Lemma is more constructive — it shows how to build the maximal element — than a proof using AC directly.

• T. True
• F. False

Answer: False

All three forms are equally non-constructive. Zorn's Lemma proves that a maximal element exists but provides no algorithm for finding it. The Axiom of Choice proves that a choice function exists but does not exhibit the choices. The Well-Ordering Theorem proves every set can be well-ordered but does not describe the ordering. This non-constructiveness is the source of philosophical controversy: many results in algebra and topology depend on these tools for mere existence guarantees, with no way to exhibit the object explicitly. Constructive mathematics rejects all three forms for precisely this reason.

Question 5

Why does the equivalence of AC, the Well-Ordering Theorem, and Zorn's Lemma matter for mathematical practice, rather than just being a curiosity about logical relations?

Model answer: Because each form is most natural for different proof contexts. Zorn's Lemma fits naturally when the argument involves taking a maximal element in a poset (bases, maximal ideals, algebraic closures). The Well-Ordering Theorem fits naturally when you want to use transfinite induction — well-order the set and proceed step by step. AC fits naturally when you need to make simultaneous choices from many sets. Knowing they are equivalent lets you choose whichever formulation makes the proof most transparent, while recognizing that all three invoke the same non-constructive choice principle.

The practical fluency is: recognize 'take a maximal element' as Zorn, 'proceed by transfinite induction over a well-ordering' as AC/WO, and 'choose one element from each of infinitely many sets' as AC. All three appear throughout graduate mathematics — in algebra (basis existence, maximal ideals), analysis (Hahn-Banach theorem), topology (Tychonoff's theorem), and set theory itself. Knowing they are interchangeable lets you translate between proof strategies and recognize when you are making a choice-theoretic assumption.