Exercise WO.3

Let J and E be well-ordered sets; suppose there is an order preserving map k : J E. Using Exercises 1 and 2, show that J has the order type of E or a section of E. [Hint: Choose e0 E. Define h : J E by the recursion formula

h(α) = smallest [E h(Sα)] if h(Sα)E,

and h(α) = e0 otherwise. Show that h(α) k(α) for all α; conclude that h(Sα)E for all α.]

Answers

Proof. First, if E = then it must be that J = as well so that they vacuously have the same order type. Otherwise, following the hint, choose e0 E and define h : J E by

h(α) = smallest [E h(Sα)] if h(Sα)E,

and h(α) = e0 otherwise, noting that this function is uniquely defined by the general principle of recursive definition (Exercise WO.1). We show that h(α) k(α) for all α J using transfinite induction (see Lemma 10.10.1). So consider α J and assume that h(x) k(x) for all x Sα. Since k preserves order we have that h(x) k(x) < k(α) when x < α. In particular, this means that h(x)k(α) for all x Sα so that k(α) E h(Sα). Hence E h(Sα) is not empty so that h(Sα)E. Thus h(α) is the smallest element of E h(Sα) and so h(α) k(α) since k(α) E h(Sα). This completes the induction.

Therefore, for any α J and any x < α we have h(x) k(x) < k(α) since k preserves order so that h(x)k(α). As in the induction step above, it follows that h(Sα)E. Hence, since α was arbitrary,

h(α) = smallest [E h(Sα)]

for all α J. It then follows from Exercise WO.2 part (a) that h is order-preserving and maps J onto E or a section of E. This clearly shows that J has the order type of E or a section of E as desired. □

User profile picture
2019-12-01 00:00
Comments