Ma · Mathematics

Why a π-System That Is Also a λ-System Is a σ-Algebra

Published By the 9to5Science editorial team

At a glance

  1. 1. Fix the definitions

    Work with subsets of a fixed set Ω; a λ-system contains Ω and is closed under complements and countable disjoint unions.

  2. 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. 3. Get finite unions

    The π-system intersection rule, together with complements, gives closure under finite unions.

  4. 4. Disjointify the union

    Replace a countable union by disjoint pieces, then apply closure under countable disjoint unions.

Let C\mathcal{C} be a class of subsets of a fixed set Ω\Omega. If C\mathcal{C} is both a π\pi-system and a λ\lambda-system (also called a Dynkin system), then C\mathcal{C} is a σ\sigma-algebra.

The key is to turn the closure under disjoint countable unions into closure under arbitrary countable unions. The π\pi-system property supplies finite intersections, which lets us split an arbitrary union into disjoint pieces.

Definitions and conventions

A π\pi-system is a collection C\mathcal{C} such that A∩B∈CA\cap B\in\mathcal{C} whenever A,B∈CA,B\in\mathcal{C}. A λ\lambda-system on Ω\Omega is a collection that:

  • contains Ω\Omega;
  • contains Ac=Ω∖AA^c=\Omega\setminus A whenever it contains AA;
  • contains ⋃n=1∞An\bigcup_{n=1}^{\infty} A_n whenever the sets An∈CA_n\in\mathcal{C} are pairwise disjoint.

These are standard conventions. Some texts state an equivalent version of the λ\lambda-system rules using nested differences or increasing countable unions.

A σ\sigma-algebra must contain Ω\Omega and be closed under complements and all countable unions. Since a λ\lambda-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 A,B∈CA,B\in\mathcal{C}, the π\pi-system property puts A∩BA\cap B in C\mathcal{C}. Hence

A∪B=(Ac∩Bc)c∈C,A\cup B=(A^c\cap B^c)^c\in\mathcal{C},

using complement closure and then intersection closure. Repeating this argument gives closure under every finite union.

We also need differences of nested sets. If B⊆AB\subseteq A and both belong to C\mathcal{C}, then AcA^c and BB are disjoint members of C\mathcal{C}. Their union is in C\mathcal{C} by the disjoint-union rule, so its complement is too:

(Ac∪B)c=A∖B∈C.(A^c\cup B)^c=A\setminus B\in\mathcal{C}.

Now take any sequence A1,A2,…A_1,A_2,\ldots in C\mathcal{C}. Define

B1=A1,Bn=An∖⋃k=1n−1Ak(n≥2).B_1=A_1,\qquad B_n=A_n\setminus\bigcup_{k=1}^{n-1}A_k\quad(n\ge 2).

Each preceding union is a finite union of members of C\mathcal{C}, so it belongs to C\mathcal{C}, as does its complement. The π\pi-system property therefore gives Bn=An∩(⋃k=1n−1Ak)c∈CB_n=A_n\cap\left(\bigcup_{k=1}^{n-1}A_k\right)^c\in\mathcal{C}. By construction, the BnB_n are pairwise disjoint, and their union is exactly the union of the original sets:

⋃n=1∞An=⋃n=1∞Bn.\bigcup_{n=1}^{\infty}A_n=\bigcup_{n=1}^{\infty}B_n.

The right side belongs to C\mathcal{C} by the λ\lambda-system rule for countable disjoint unions. Therefore C\mathcal{C} is closed under arbitrary countable unions. Along with containing Ω\Omega and being closed under complements, this proves that C\mathcal{C} is a σ\sigma-algebra.

A finite example

Take Ω={1,2,3,4}\Omega=\{1,2,3,4\} and partition it into blocks P1={1,2}P_1=\{1,2\}, P2={3}P_2=\{3\}, and P3={4}P_3=\{4\}. Let C\mathcal{C} consist of all unions of these blocks. Explicitly,

C={∅,{1,2},{3},{4},{1,2,3},{1,2,4},{3,4},Ω}.\mathcal{C}=\{\varnothing,\{1,2\},\{3\},\{4\},\{1,2,3\},\{1,2,4\},\{3,4\},\Omega\}.

Intersections of unions of blocks are again unions of blocks, so this is a π\pi-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 λ\lambda-system as well, and consequently a σ\sigma-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 λ\lambda-system need not be closed under arbitrary unions by definition. The disjointification step is what supplies that result.
  • Assuming a π\pi-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 Ω\Omega, which the λ\lambda-system must contain.
  • Confusing this result with the π\pi-λ\lambda theorem. The result proved here says a class that itself has both properties is a σ\sigma-algebra. The π\pi-λ\lambda theorem is a related statement about the smallest λ\lambda-system containing a π\pi-system: it contains the σ\sigma-algebra generated by that π\pi-system, and in fact equals it.

References

  1. Measure Theory, Paul R. Halmos
  2. Probability and Measure, Patrick Billingsley

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.