Solution: Intersection of Sigma-Algebras
Part 1: G∩H is a σ-algebra
Let K=G∩H. Verify each axiom.
Axiom 1. Ω∈G (because
G is a
σ-algebra) and
Ω∈H similarly. Hence
Ω∈G∩H=K.
Axiom 2. Suppose
A∈K. Then
A∈G, so
Ac∈G. Also
A∈H, so
Ac∈H. Combining:
Ac∈G∩H=K.
Axiom 3. Suppose
A1,A2,…∈K. Then each
An∈G, so
⋃nAn∈G. Each
An∈H, so
⋃nAn∈H. Hence
⋃nAn∈K.
All three axioms hold, so K is a σ-algebra. □
Remark. The same proof shows that the intersection of
any family of
σ-algebras (even an uncountable family) is a
σ-algebra — this is exactly what makes the definition
σ(C)=⋂{F:C⊆F} sensible.
Part 2: G∪H can fail
Take Ω={1,2,3,4} and:
G={∅,{1,2},{3,4},Ω}
H={∅,{1,3},{2,4},Ω}
Each is a σ-algebra on Ω (direct check: closed under complements — {1,2}c={3,4} — and unions).
G∪H={∅,{1,2},{3,4},{1,3},{2,4},Ω}
Check axiom 3. The union
{1,2}∪{1,3}={1,2,3} is not in
G∪H. So
G∪H is not a σ-algebra — the failing axiom is closure under unions, and
{1,2,3} is the missing set. (Several other unions also fail to land in
G∪H; any one of them suffices as a witness.)
Part 3: the generated σ-algebra
To compute σ(G∪H), close the collection under unions, intersections, and complements:
- Intersections: {1,2}∩{1,3}={1}, {1,2}∩{2,4}={2}, {3,4}∩{1,3}={3}, {3,4}∩{2,4}={4}.
So every singleton {1},{2},{3},{4} is in σ(G∪H). As in the previous exercise, isolating all singletons on a finite Ω forces the generated σ-algebra to be the full power set:
σ(G∪H)=2Ω(all 16 subsets).
Interpretation. G answers the question "is the outcome in
{1,2}?" — it tells you a coarse binary split of
Ω.
H answers the orthogonal question "is the outcome in
{1,3}?". Individually, each gives a two-way partition.
Together they give the four-way partition into singletons — complete information.
This is the discrete version of what happens continuously: two independent sources of information (e.g. the path of
Wt(1) and the path of
Wt(2)) generate
σ-algebras whose
union needs closure to become a valid
σ-algebra — the join
σ(Ft(1)∪Ft(2)) captures the combined information.
Takeaways
- Intersections preserve the σ-algebra property, unions do not. This asymmetry is the reason the "smallest σ-algebra containing C" is defined via intersection but information combination requires the generated σ-algebra.
- Combining information is not set-union. Two observers with different information pool their knowledge via the join σ(G∪H), not the raw union.
- Orthogonal binary partitions can generate the full power set. Two well-chosen two-element binary splits of a four-point space already contain all the information.