Homepage › Solution manuals › Karel Hrbáček › Introduction to Set Theory › Exercise 8.2.4
Exercise 8.2.4
Let . Prove that is a -algebra.
Answers
Proof. For any we have
□Proof. Consider any so that and . Then it has to be that also since otherwise it would not be that . Hence , which shows the result since was arbitrary. □
Main Problem.
Proof. We must show that the above definition of satisfies the three parts of the definition of a -algebra:
For (a) clearly so that , and so that . Hence as well.
For (b) suppose that and . Then either or . If then by Lemma 1 we have
since . Therefore so that . On the other hand, if , then obviously by definition.
Lastly, regarding (c), suppose that is a system of sets where each is in . Thus or for each natural .
Now we show that . First, if for all natural , then it follows from Theorem 8.1.7 that , which of course uses the Axiom of Choice. If, on the other hand, there is a natural such that , then it has to be that since . Then, since clearly , it follows from Lemma 2 that so that clearly . Thus in all cases we have that either or so that .
Lastly we show that as well. If it is the case for all natural , then clearly we have that , again by Theorem 8.1.7. It also follows from Exercise 2.3.11 that so that we have . Now, on the other hand, if there is a natural such that , then it has to be that since . Since clearly , we then have . Hence in either case we have that or so that by definition.
We have therefore shown parts (a), (b), and (c) so that is a -algebra as desired. □