Set Theory/Systems of sets
In this chapter, we would like to study, for a given set , subsets of the power set . We consider in particular those subsets of that are closed under certain operations.
Note that being a -algebra is a stronger requirement than being a Dynkin system: A -algebra is closed under all countable intersections, whereas a Dynkin system is only closed under intersections of countable ascending chains.
Exercises
- Let be a set, and let . Prove that is a -system if and only if
- .
- Let be a set, and let . Prove that is a -algebra if and only if
- for all implies .