Exercise WO.2

(a)
Let J and E be well-ordered sets; let h : J E. Show that the following statements are equivalent:
(i)
h is order preserving and its image is E or a section of E.
(ii)
h(α) = smallest [E h(Sα)] for all α.

[Hint: Show that each of these conditions implies that h(Sα) is a section of E; conclude that it must be the section by h(α).]

(b)
If E is a well-ordered set, show that no section of E has the order type of E, nor do two different sections of E have the same order type. [Hint: Given J, there is a most one order preserving map of J into E whose image is E or a section of E.]

Answers

(a)

Proof. First, for any α J and β E, let Sα denote the section of J by α, and Tβ denote the section of E by β. To avoid ambiguity, also suppose that < is the well-order on J and is the well-order on E. We show that each of these conditions is equivalent to the condition that h(Sα) = Th(α) for every α J. Call this condition (iii). This of course also shows that the conditions are equivalent to each other.

First, we show that (i) implies (iii). So suppose that h is order preserving and its image is E or a section of E. Consider any α J and any y h(Sα) so that there is an x Sα where y = h(x). Then x < α and y = h(x) h(α) since h preserves order. Therefore y Th(α) so that h(Sα) Th(α) since y was arbitrary. Now consider y Th(α) so that y h(α). Since also clearly y E (since Th(α) E), y is in the image of h if its image is all of E. If the image of h is some section of E, say Tβ, then clearly h(α) Tβ since h(α) is obviously in the image of h. Hence we have y h(α) β so that y Tβ and hence in the image of h. Since y is in the image of h in either case, there is an x J such that y = h(x). Then h(x) = y h(α) so that x < α since h preserves order. Hence x Sα so that y h(Sα) since y = h(x). This shows that Th(α) h(Sα) since y was arbitrary. Therefore h(Sα) = Th(α) so that condition (iii) is true since α was arbitrary.

Next, we show that (iii) implies (i). So suppose that h(Sα) = Th(α) for all α J. First, it is easy to see that h preserves order since, if x,y J where x < y, then we have that x Sy so that clearly h(x) h(Sy) = Th(y), and hence h(x) < h(y). To show that the image of h, i.e. h(J), is either E or a section of E, consider the set E h(J).

Case: E h(J) = . Then clearly for any y E we must have that y h(J) since otherwise it would be that y E h(J). Thus E h(J) since y was arbitrary. Also clearly h(J) E since E is the range of h. This shows that h(J) = E.

Case: E h(J). Then clearly E h(J) is a nonempty subset of E so that it has a smallest element β since E is well-ordered, noting that clearly βh(J). We claim that h(J) = Tβ. So consider any y h(J) so that there is an x J where y = h(x). Suppose for a moment that β y. Now it cannot be that β = y since y h(J) but βh(J), and so β y. But then β Ty = Th(x) = h(Sx) since x J. Then β is in the image of h since clearly h(Sx) h(J). As this contradicts the fact that βh(J), it must be that y β so that y Tβ. This shows that h(J) Tβ since y was arbitrary. Suppose now that y Tβ so that y β. Since β is the smallest element of E h(J), it follows that yE h(J). Since clearly y E (since Tβ E), it must be that y h(J). This shows that Tβ h(J) since y was arbitrary. Hence we have shown that h(J) = Tβ.

Therefore in every case either the image of h is E or a section of E as desired. This completes the proof of (i).

Now we show that (ii) implies (iii). So suppose that h(α) is the smallest element of E h(Sα) for every α J. First, we show that h is injective. So consider any x,y J where xy. We can assume without loss of generality that x < y so that x Sy and hence h(x) h(Sy). However, since we have that h(y) is the smallest element of E h(Sy), clearly h(y)h(Sy). Therefore we have that h(x)h(y) so that h is injective.

Now consider any α J so that clearly h(α) is the smallest element of E h(Sα). Suppose that y h(Sα) so that there is an x Sα where y = h(x), and therefore x < α. Consider the possibility that h(α) h(x) = y. It cannot be that h(α) = h(x) = y since xα and h is injective, so it must be that h(α) h(x). It then follows that h(α)E h(Sx) since h(x) is the smallest element of E h(Sx). Thus h(α) h(Sx) since clearly h(α) E. It then follows from the fact that h is injective that α Sx so that we have α < x < α, which is clearly a contradiction. So it must be that y = h(x) h(α) so that y Th(α). This shows that h(Sα) Th(α) since y was arbitrary.

Now suppose that y Th(α) so that y h(α). Since h(α) is the smallest element of E h(Sα), it follows that yE h(Sα). Since clearly y E, it must be that y h(Sα). This shows that Th(α) h(Sα) since y was arbitrary, and hence h(Sα) = Th(α), which shows (iii) since α was arbitrary.

Lastly, we show that (iii) implies (ii). So suppose that h(Sα) = Th(α) for every α J and consider any such α. Clearly we have that h(α) E but h(α)Th(α) = h(Sα) so that h(α) E h(Sα). Suppose for the moment that h(α) is not the smallest element of E h(Sα) so that there is a β E h(Sα) where β h(α). Then β Th(α) so that it must be that βE Th(α) = E h(Sα) since h(Sα) = Th(α). Clearly, this is a contradiction so it must be that h(α) really is the smallest element of E h(Sα), which shows (ii) since α was arbitrary. □

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