Exercise 6.5.10

An ordinal α is a limit ordinal if and only if α = ω β for some β .

Answers

Lemma 1. If α is an ordinal then α < α + ω and α + ω is the next limit ordinal after α , i.e. every ordinal β such that α < β < α + ω is a successor ordinal.

Proof. Consider any ordinal α . First we note that clearly α = α + 0 < α + ω by Lemma 6.5.6a since 0 < ω . It also clearly follows from Lemma ?? that α + ω is a limit ordinal.

Now suppose that β is any ordinal such that α < β < α + ω . Since α < β there is a unique ordinal γ such that α + γ = β by Lemma 6.5.5. Now, since α + 0 = α < β = α + γ it follows again from Lemma 6.5.6a that 0 < γ . Similarly we have α + γ = β < α + ω so that by the same lemma γ < ω . Hence 0 < γ < ω so that γ is a nonzero natural number. In particular γ 1 so that n = γ 1 is also a natural number and γ = n + 1 . We then have that β = α + γ = α + ( n + 1 ) = ( α + n ) + 1 so that clearly β is a successor ordinal. □

Main Problem.

Proof. ( ) Suppose to the contrary that not every limit ordinal is equal to ω β for some β . Then let α be a limit ordinal such that α ω γ for every ordinal γ . Now let β be the set of ordinals δ such that ω δ < α , noting that it could potentially be the empty set. We claim that β is an ordinal number and that moreover it is a limit ordinal.

Clearly if β = = 0 then it is a limit ordinal, so assume that β . Then consider any δ β so that ω δ < α . Also consider any x δ so that x is also an ordinal number by Lemma 6.2.8 and moreover that x < δ . It then follows from Exercise 6.5.7a that ω x < ω δ < α . Hence we have that x β so that δ β since x was arbitrary. Since δ was also arbitrary this shows that β is transitive. Also since β is nonempty set of ordinals it follows from Theorem 6.2.6d that β is well-ordered. Thus by definition β is an ordinal number.

Now consider any δ < β so that δ β so that ω δ < α . By Lemma 1 we have that ω δ + ω = ω ( δ + 1 ) is the next limit ordinal after ω δ (i.e. there are no limit ordinals between them) so it has to be that ω ( δ + 1 ) α since otherwise α would be a limit ordinal between ω δ and ω ( δ + 1 ) . But since α ω γ for all ordinals γ it cannot be that α = ω ( δ + 1 ) . Thus it must be that ω ( δ + 1 ) < α so that δ + 1 β so that δ + 1 < β . This shows that β is a limit ordinal by Lemma ??.

Now we claim that ω β = α , which is of course is a contradiction that proves the desired result. To see this let A = { ω δ δ < β } so that by Definition 6.5.6c we have that ω β = sup A since β is a limit ordinal. Now since δ < β means that δ β so that ω δ < α by the definition of β , clearly α is an upper bound of A so that ω β = sup A α . However, if it were the case that ω β < α then we would have by definition that β β which contradicts Lemma 6.2.7 since we have shown that β is an ordinal. Thus the only possibility is that ω β = α , which gives rise to the contradiction.

Moreover, we can show that β is unique. To see this, consider β 1 and β 2 where α = ω β 1 and α = ω β 2 . Then clearly ω β 1 = ω β 2 so that β 1 = β 2 by Exercise 6.5.7b since clearly ω 0 .

( ) Suppose that α = ω β for some ordinal β . Then the result that α is a limit ordinal follows immediately from Lemma ?? since ω is a limit ordinal. □

User profile picture
2024-07-15 11:42
Comments