Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 6.5.10
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 by Lemma 6.5.6a since . 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 it follows again from Lemma 6.5.6a that . Similarly we have so that by the same lemma . Hence so that is a nonzero natural number. In particular so that is also a natural number and . We then have that 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 then it is a limit ordinal, so assume that . Then consider any so that . Also consider any so that is also an ordinal number by Lemma 6.2.8 and moreover that . It then follows from Exercise 6.5.7a that . Hence we have that so that since 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 is the next limit ordinal after (i.e. there are no limit ordinals between them) so it has to be that since otherwise would be a limit ordinal between and . But since for all ordinals it cannot be that . Thus it must be that so that so that . 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 so that by Definition 6.5.6c we have that since is a limit ordinal. Now since means that so that by the definition of , clearly is an upper bound of so that . 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 and where and . Then clearly so that by Exercise 6.5.7b since clearly .
( ) Suppose that for some ordinal . Then the result that is a limit ordinal follows immediately from Lemma ?? since is a limit ordinal. □