« Supplementary Exercises*: Well-Ordering: Problem 2 Solution

Supplementary Exercises*: Well-Ordering: Problem 4 Solution »

Supplementary Exercises*: Well-Ordering: Problem 3 Solution

Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, the_0rems, 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 well-ordered sets; suppose there is an order-preserving map . Using Exercises 1 and 2, show that has the order type of or a section of . [Hint: Choose . Define by the recursion formula and otherwise. Show that for all ; conclude that for all .]
Note that we cannot directly apply Exercise 2, as there is a condition in (a)(i) of that exercise that requires to map onto or a section of . And this assumption is not given for . In fact, this is exactly what we want from an order preserving map from into , so, we construct another order preserving function satisfying this condition, as suggested in the hint.
First, we need to formally show that is well-defined. This is pretty much straightforward using Exercise 1. For any and define if , or otherwise. Then is well-defined, and it uniquely defines satisfying the recursive formula.
Second, we use the existence of the order-preserving function to show that a) must be bounded above by , b) no section is mapped by onto , and c) using Exercise 2, is an order-preserving function that maps onto or its section.
a) Let be the subset of such that the inequality holds. If then for every , , so is an element that is greater than all elements in , but is the smallest element that is greater than all elements in provided there is at least one such element, and there is one, namely, , hence, . By transfinite induction, .
b) If for some , , then there is some such that . Contradiction. Therefore, for all .
c) Now, since for all , is defined by the expression 2(a)(ii), and by Exercise 2(a), is an order preserving function mapping onto or its section. Since is order preserving, it is injective, so is an order preserving bijection from onto or its section.