Exercise WO.8

Using Exercises 1-4, construct an uncountable well-ordered set, as follows. Let A be the collection of all pairs (A,<), where A is a subset of + and < is a well-ordering of A. (We allow A to be empty.) Define (A,<) (A,< ) if (A,<) and (A,< ) have the same order type. It is trivial to show that this is an equivalence relation. Let [(A,<)] denote the equivalence class of (A,<); let E denote the collection of these equivalence classes. Define

[(A,<)] [(A,< )]

if (A,<) has the order type of a section of (A,< ).

(a)
Show that the relation is well defined and is a simple order on E. Note that the equivalence class [(, )] is the smallest element of E.
(b)
Show that if α = [(A,<)] is an element of E, then (A,<) has the same order type as the section Sα(E) of E by α. [Hint: Define a map f : A E by setting f(x) = [(Sx(A),restriction  <)] for each x A.]
(c)
Conclude that E is well-ordered by .
(d)
Show that E is uncountable. [Hint: If h : E + is a bijection, then h gives rise to a well-ordering of +.]

Answers

(a)

Proof. First, to show that is well defined, suppose that [(A,<)] [(A,< )] and that (B,) [(A,<)] and (B,) [(A,< )]. Then (A,<) has the same order type as a section of (A,< ) so that there is an order-preserving map h from A onto a section of A. We also then have that (B,) has the same order type as (A,<) since they are in the same equivalence class. Thus there is an order-preserving bijection f : B A. Likewise, there is an order-preserving bijection from g : B A. It is then trivial to show that g1 h f is a bijection from B onto a section of B that preserves order. Hence (B,) has the same order type as a section of (B,). Since (B,) and (B,) were arbitrary elements in their respective equivalence classes, this shows that is well defined such that it does not matter which representatives we use from the equivalence classes.

Now consider any equivalence class [(A,<)] in E. Then clearly it cannot be that [(A,<)] [(A,<)] since this would mean that A has the same order type as a section of itself, which would contradict what was shown in Exercise WO.2 part (b). Thus is nonreflexive.

Next consider two distinct equivalence classes [(A,<)] and [(A,< )]. Then it cannot be that (A,<) and (A,< ) have the same order type, for then they would be the same equivalence class. Then, by EExercise WO.4 part (a), it must be that either (A,<) has the same order type as a section of (A,< ) or vice-versa. Clearly then, in the former case [(A,<)] [(A,< )], and in the latter case [(A,< )] [(A,<)]. This shows that has the comparability property.

Lastly, suppose that [(A,<)] [(A,< )] and [(A,< )] [(A′′,< ′′)]. Then (A,<) has the same order type as section of (A,< ) so that there is an order-preserving bijection f from A onto a section of A Likewise, there is an order-preserving bijection g from A onto a section of A′′. It is then trivial to show that f g is an order-preserving bijection from A onto a section of A′′. It then clearly follows that [(A,<)] [(A′′,< ′′)], which shows that is transitive.

Hence we have shown that satisfies all the requirements of a simple order. □

(b)

Proof. Following the hint, define the map f : A E by setting

f(x) = [(Sx(A),restriction  <)]

for any x A, noting that clearly Sx(A) is well-ordered by the restricted < so that the equivalence class is valid and in E.

Consider any x and y in A where x < y. Then clearly x Sy(A) but xSx(A) (since it is not true that x < x) so that Sx(A) and Sy(A) are distinct sets. We also clearly have that Sx(A) = Sx(Sy(A)) so that Sx(A) has the same order type (the identity function is the required order-preserving map) as a section of Sy(A). Hence

f(x) = [(Sx(A),restriction  <)] [(Sy(A),restriction  <)] = f(y)

so that f preserves order since x and y were arbitrary.

Now we show that f is onto Sα(E). So consider any equivalence class [(B,)] in Sα(E) and hence

[(B,)] α = [(A,<)]

so that by definition (B,) has the same order type as some section Sx(A). Hence [(B,)] and [(Sx(A),restriction  <)] are the same equivalence class! Therefore

f(x) = [(Sx(A),restriction  <)] = [(B,)],

which of course shows the desired property since [(B,)] was arbitrary.

This shows that f is an order-preserving map from A onto Sα(E) so that they have the same order type. □

(c)

Proof. Consider any nonempty subset D E. Thus there is an α = [(A,<)] D. If α is the smallest element of D then we are done, so assume that this is not the case so that there is a β D where β α. Now, it was shown in part (b) that (A,<) has the same order type as the section Sα(E) so this section must be well-ordered since A is. Also we have that β Sα(E) since β α. Thus β D Sα(E) so that D Sα(E) is a nonempty subset of Sα(E) so has a smallest element γ since Sα(E) is well-ordered. In particular, we of course have that γ β, where we use to denote or equal to.

We claim that γ must be the smallest element of D. If not, then there is a δ D where δ γ. Of course, we also then have that δ γ β α and hence δ Sα(E). Therefore δ D Sα(E), but since δ γ this contradicts the definition of γ as the smallest element of D Sα(E). So it must be that in fact, γ is the smallest element of D, which shows that E is well-ordered by since D was an arbitrary subset. □

(d)

Proof. Following the hint, suppose that E is countable so that there is a bijection h : E +. This of course gives rise to a well-ordering < of h(E) = + by simply ordering its elements according to its bijection with E, which was shown to be well-ordered in part (c). Then we have that (+,<) is an element of A since + is a subset of itself. Thus the equivalence class α = [(+,<)] is an element of E. But we know from part (b) that (+,<) then has the same order type as the section Sα(E). Since we also know that (+,<) has the same order type as E itself, it follows that E has the same order type as its section Sα(E) This was shown not to be possible in EExercise WO.2 (b) so that a contradiction has been reached. So it must be that in fact, E is uncountable as desired □

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