Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 6.1.8
Exercise 6.1.8
The sets and , ordered lexicographically, are nonisomorphic well-ordered sets. (See the remark following Theorem 4.7 in Chapter 4.)
Answers
Proof. Let be the lexicographic ordering of and be the lexicographic ordering of .
First we define by
for . Clearly each .
Now consider any . If is even then for some so set . Then clearly . On the other hand if is even then for some so set . Then clearly . This shows that is surjective.
Now consider any and in where .
Case: . Then since it has to be that , and since it has to be that and . From this it follows that
Case: . Then since it has to be that . Then and since also we have
Hence in all cases so that is increasing and therefore injective and isomorphic. Therefore is isomorphic to .
Now we define by
for . Clearly since we have that for all .
Now consider any . If then and . On the other hand if for some then and . Therefore is surjective.
Now consider any and in where .
Case: . Then since it has to be that . If then
On the other hand if then
Case: . Then since it has to be that . Moreover since it has to be that and so that
Hence in all cases so that is increasing and therefore injective and an isomorphism. Therefore is isomorphic to .
Now, since we have that and so are distinct ordinals. Therefore by the remarks following Theorem 6.2.10 and are not isomorphic. If and were isomorphic with as the isomorphism then would be an isomorphism from to , which is impossible. So it must be that and are not isomorphic. □