Exercise 10.6

Let SΩ be the minimal uncountable well-ordered set.

(a)
Show that SΩ has no largest element.
(b)
Show that for every α SΩ, the subset {xα < x} is uncountable.
(c)
Let X0 be the subset of SΩ consisting of all elements x such that x has no immediate predecessor. Show that X0 is uncountable.

Answers

Lemma 1. If A is an uncountable set and B A is countable then A B is uncountable.

Proof. If we let C = A B, then clearly A = C B. If C were countable then A = C B would be countable by Theorem 7.5 since B is also countable. Since we know that A is uncountable it, therefore, must be that C = A B is uncountable as well. □

Main Problem.

It is assumed in the following that < is the well-order on SΩ.

(a)

Proof. Suppose to the contrary that SΩ does have a largest element α. Then, for any x SΩ, we have that x α. Hence either x {y SΩy < α} = Sα or x = α. Therefore SΩ = Sα {α} since clearly both Sα and {α} are both subsets of SΩ. Now since Sα is a section of SΩ, it is countable. Since {α} is also clearly countable, it follows from Theorem 7.5 that their union Sα {α} = SΩ is countable. But this contradicts the fact that SΩ is uncountable! Hence it has to be that SΩ has no largest element as desired. □

(b)

Proof. Consider any α SΩ. Let Tα = {x SΩα < x} so that we must show that Tα is uncountable. Let S¯α = Sα {α} so that clearly we have that S¯α = {x SΩx α}. It is then easy to show that Tα = SΩ S¯α. Now, since Sα is a section of SΩ, it is countable so that clearly S¯α = Sα {α} is also countable by Theorem 7.5. Then, since SΩ itself is uncountable, it follows that Tα = SΩ S¯α is also uncountable by Lemma 1 . □

(c)

Proof. First, we show that X0 is not bounded above. Assume the contrary so that α SΩ is an upper bound of X0. It then follows that the set Tα = {x SΩα < x} is such that every element of Tα has an immediate predecessor since otherwise there would be a β Tα where β X0 so that α would not be an upper bound of X0 since then α < β.

Now, we know from part (a) that SΩ has no largest element so it follows from Exercise 10.2 that every element of SΩ has an immediate successor. Since Tα SΩ it follows that each element x Tα has an immediate successor y. Moreover, we then have that α < x < y so that y Tα also. Hence every element of Tα has an immediate successor in Tα.

Now, we know that Tα is uncountable by part (b) so that it has a smallest element β since it is then a nonempty subset of the well-ordered SΩ. We derive a contradiction by showing that Tα has the same order type as + and is thus countable. We do this by defining an increasing bijection f : + Tα. First, set f(1) = β and then set f(n) to the immediate successor of f(n 1) for n > 1, which was shown to exist above. Then the function f uniquely exists by the principle of recursive definition. Clearly we have that f(n + 1) > f(n) for all n + since f(n + 1) is the immediate successor of f(n). Hence f is increasing and therefore also injective.

To show that f is surjective suppose the contrary so that the set Tα f(+) is non-empty. Since clearly, this is a subset of the well-ordered SΩ, it has a smallest element y. Now, we know that f(1) = β so that yβ, and in fact β < y since β is the smallest element of Tα. Since y Tα we know that it has an immediate predecessor x and that α < β x so that x Tα. However, it cannot be that x Tα f(+) since x < y and y is the smallest element of Tα f(+). Thus x f(+) so that there is an n + where f(n) = x. But then f(n + 1) = y since y is the immediate successor of x. As this contradicts the fact that yf(+), it must be that f is in fact surjective!

Therefore we have shown that f is a bijection from + to Tα so that Tα is countable. But we know from part (b) that Tα is uncountable. As mentioned above, this is a contradiction so it must be that indeed X0 is not bounded above. From this, it immediately follows from the contrapositive of Theorem 10.3 that X0 must be uncountable. □

It is interesting to note that SΩ corresponds to the ordinal number ω1, which is the first uncountable ordinal, and the set X0 of part (c) corresponds to the set of limit ordinals in ω1. All of the curious properties deduced here for SΩ apply to ω1 too, assuming we allow the choice axiom.

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