« Section 10: Problem 10 Solution

Section 10: Problem 11 Solution

Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
Let and be two sets. Using the well-ordering theorem, prove that either they have the same cardinality, or one has cardinality greater than the other. [Hint: If there is no surjection , apply the preceding exercise.]
If there are injections both ways, then there is a bijection of with and the sets have the same cardinality (Schroeder-Bernstein theorem, proved in exercises of Section 7). Otherwise, there can be an injection one way only, and we need to show that there is one. If there is a surjection from onto , then there is an injection (which is a right inverse for the surjection, which exists due to the axiom of choice, which is equivalent to the well-ordering theorem, see Exercise 5(a) of §9). If there is no surjection , then we can well-order both sets and use Exercise 10 to show that there is an injective function from into (the fact that it is injective follows immediately from the definition ).