Question
Checking whether a finite family forms a sigma algebra
Original question: Exercise 1: Check if the following collection of subsets A is a σ-algebra over the set .
(a)
(b)
(c)
(d)
Expert Verified Solution
Key concept: This exercise is about verifying the three defining properties of a sigma algebra: containing the whole set, being closed under complements, and being closed under countable unions.
Step by step
What a sigma algebra must satisfy
A collection of subsets of a set is a -algebra if it contains , is closed under complements relative to , and is closed under countable unions. For finite examples, checking complements and unions is usually enough.
A quick practical test is: if one set is in the family, then its complement must also be there. Then any union of sets already in the family must again belong to the family. If even one complement is missing, the collection is not a -algebra.
How to check each finite collection
For each option, compare every subset with its complement in .
- In (a), is present, but its complement is not listed, so it fails.
- In (b), and are complements of each other, and the collection contains and , so this one works.
- In (c), is present, but its complement is also present, and the other listed sets pair correctly; however, you still must check closure under unions of all listed subsets. The family is designed to behave like a generated partition-based -algebra.
- In (d), several complements are missing or mismatched, so it fails.
Why complement closure is the fastest test
When the universe is finite, a -algebra is often built from a partition of . Every set in the algebra is a union of blocks of that partition. That means the family automatically contains complements and unions. If the listed subsets do not match that structure, the collection is usually not a -algebra.
Key property to remember
The presence of and is necessary but not sufficient. A family can include both and still fail because a complement is missing or because a union of two listed sets is absent. That is why checking the full closure conditions matters.
Pitfall alert
A common mistake is to see and in the family and immediately assume it is a sigma algebra. Those two sets are required, but they are not enough. Another error is checking only a few complements instead of every listed subset. Since a sigma algebra must be closed under complements, one missing complement is enough to reject the collection. For finite universes, it also helps to think in terms of partitions: if the family is not generated by unions of partition blocks, it is unlikely to qualify. Do not forget that closure under unions must also hold, not just complements.
Try different conditions
If the universe changed to and the family were , then it would be a sigma algebra because each set has its complement in the family and unions stay inside the family. But if we added to that same family without adding , it would immediately stop being a sigma algebra. A small change in one subset can break complement closure, which is why these questions are often about structure rather than listing every set individually.
Further reading
complement closure, countable union, partition-generated sigma algebra
FAQ
How do you test whether a finite collection of subsets is a sigma algebra?
Check that the whole set and the empty set are included, then verify that every subset has its complement in the family and that unions of sets in the family stay in the family.
Why is having empty set and whole set not enough for a sigma algebra?
A sigma algebra must also be closed under complements and countable unions. A family can contain both the empty set and the whole set but still fail if one complement or union is missing.