Dynkin lemma, also called the pi-lambda theorem, states that if a Dynkin system contains a pi-system , then
Let be the smallest Dynkin system containing . It is enough to prove that is a sigma-algebra, because then
First fix and define
This is a Dynkin system. It contains because ; closure under relative complements follows from
and closure under disjoint unions follows by distributing over the union. Since is closed under intersections, . Minimality therefore gives
Thus whenever and .
Now fix and define
The same argument shows that is a Dynkin system, and the preceding paragraph shows that it contains . Hence . We have proved that is itself a pi-system.
A Dynkin system that is also a pi-system is a sigma-algebra: it is closed under arbitrary finite intersections, hence finite unions by complements, and any countable union can be disjointified before using closure under disjoint unions. Therefore , proving the lemma.
Fix and let
This is a Dynkin system. It contains . If , then
so it is closed under complements. Countable additivity gives closure under countable disjoint unions.
The hypothesis says . Since is a pi-system, Dynkin lemma yields
Thus the factorization holds for every and every .
Now fix such a and define
The identical calculation makes a Dynkin system. The first step gives , so a second application of Dynkin lemma gives
Therefore the probability factorization holds for every
which is precisely independence of the two sigma-algebras. This is independence extended from generating pi-systems.

Articles by others on the same topic (0)

There are currently no matching articles.