Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 5.1.9
Exercise 5.1.9
Every countable set is Dedekind infinite.
Answers
Lemma 1. If sets and are equipotent (i.e. ) and is Dedekind infinite then is also Dedekind infinite.
Proof. Since and are equipotent there is a bijective so that is also bijective. Also since is Dedekind infinite there is a such that there is a bijective so that is also bijective. So since there is a such that . So let . Clearly since it follows that since . Now define by
for . Since is a function this implies that
Now suppose for a moment that there is an such that . Then
which is impossible since but . Hence there is no such so that really is a map from to (as opposed to to ).
Now, since , , and are all injective it follows from Exercise 2.3.5 that is injective as well. Then consider any and let , noting that exists since . Then we have
so that is surjective since was arbitrary. Hence is a bijective map from to , and since this means that is Dedekind infinite. □
Proof. Let so that clearly is proper subset of . Then we define the map by
for . Consider any where . Then clearly
so that is injective. Now consider any so that clearly , noting that since we have so that . Hence . This shows that is surjective. Hence is a bijection from onto a proper subset so that by definition is Dedekind infinite. □
Main Problem.