Why a π-System That Is Also a λ-System Is a σ-Algebra
At a glance
- 1. Fix the definitions
Work with subsets of a fixed set Ω; a λ-system contains Ω and is closed under complements and countable disjoint unions.
- 2. Get nested differences
Use the λ-system rules to show that A minus B belongs to the class whenever B is contained in A.
- 3. Get finite unions
The π-system intersection rule, together with complements, gives closure under finite unions.
- 4. Disjointify the union
Replace a countable union by disjoint pieces, then apply closure under countable disjoint unions.
Let be a class of subsets of a fixed set . If is both a -system and a -system (also called a Dynkin system), then is a -algebra.
The key is to turn the closure under disjoint countable unions into closure under arbitrary countable unions. The -system property supplies finite intersections, which lets us split an arbitrary union into disjoint pieces.
Definitions and conventions
A -system is a collection such that whenever . A -system on is a collection that:
- contains ;
- contains whenever it contains ;
- contains whenever the sets are pairwise disjoint.
These are standard conventions. Some texts state an equivalent version of the -system rules using nested differences or increasing countable unions.
A -algebra must contain and be closed under complements and all countable unions. Since a -system already has the first two properties, it remains to establish closure under arbitrary countable unions.
Proof
First, the two assumptions give closure under finite unions. For , the -system property puts in . Hence
using complement closure and then intersection closure. Repeating this argument gives closure under every finite union.
We also need differences of nested sets. If and both belong to , then and are disjoint members of . Their union is in by the disjoint-union rule, so its complement is too:
Now take any sequence in . Define
Each preceding union is a finite union of members of , so it belongs to , as does its complement. The -system property therefore gives . By construction, the are pairwise disjoint, and their union is exactly the union of the original sets:
The right side belongs to by the -system rule for countable disjoint unions. Therefore is closed under arbitrary countable unions. Along with containing and being closed under complements, this proves that is a -algebra.
A finite example
Take and partition it into blocks , , and . Let consist of all unions of these blocks. Explicitly,
Intersections of unions of blocks are again unions of blocks, so this is a -system. The complement of any union of blocks is the union of the remaining blocks. Also, any union of pairwise disjoint members is still a union of blocks. Thus it is a -system as well, and consequently a -algebra. The proof above explains why the same conclusion holds even for an infinite collection on an arbitrary space.
Common mistakes
- Using disjoint-union closure before making the sets disjoint. A -system need not be closed under arbitrary unions by definition. The disjointification step is what supplies that result.
- Assuming a -system is closed under unions. It guarantees intersections, not unions. Finite unions follow here only after combining intersection closure with complements.
- Forgetting the ambient space. Complements are relative to the fixed set , which the -system must contain.
- Confusing this result with the - theorem. The result proved here says a class that itself has both properties is a -algebra. The - theorem is a related statement about the smallest -system containing a -system: it contains the -algebra generated by that -system, and in fact equals it.
References
- Measure Theory, Paul R. Halmos
- Probability and Measure, Patrick Billingsley
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.