Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2017/ii/paper-3/14h/solution

Zorn lemma states that a partially ordered set in which every chain in a partially ordered set has an upper bound has a maximal element. Include the empty chain in a partially ordered set, so the hypotheses imply that the set is nonempty. Suppose there were no maximal element. Every chain in a partially ordered set has an upper bound , and some ; therefore the set of elements strictly above every member of is nonempty. The axiom of choice selects one such element for each chain in a partially ordered set (and an element of when is empty).
By Hartogs theorem, there is an ordinal which does not inject into . Transfinite recursion defines for all : previous elements form a strictly increasing chain in a partially ordered set, including at limit ordinal stages. All are distinct, giving the forbidden injection. This proves Zorn lemma; the choice of is the use of the axiom of choice.
Apply Zorn lemma to linearly independent subsets of over , ordered by inclusion. A union along a chain in a partially ordered set is linearly independent because each finite linear relation occurs in one member of that chain in a partially ordered set. A maximal independent set spans , since a vector outside its span could be adjoined. Thus has a Hamel basis over .
For a finite basis, the Steinitz exchange lemma proves equality of basis sizes. This also rules out an infinite basis when a finite spanning set exists: write each member of the finite spanning set using finitely many elements of another basis; their finite union spans, and independence leaves no other basis elements. If a basis is infinite with cardinality , the finite-support description of every vector and countability of give
Here infinite cardinal arithmetic uses the axiom of choice. Thus any infinite basis has cardinality , proving all bases have the same cardinality. The zero space has its unique empty basis.

New to topics? Read the docs here!