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 defineThis is a Dynkin system. It contains because ; closure under relative complements follows fromand closure under disjoint unions follows by distributing over the union. Since is closed under intersections, . Minimality therefore givesThus whenever and .
Now fix and defineThe 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 letThis is a Dynkin system. It contains . If , thenso it is closed under complements. Countable additivity gives closure under countable disjoint unions.
The hypothesis says . Since is a pi-system, Dynkin lemma yieldsThus the factorization holds for every and every .
Now fix such a and defineThe identical calculation makes a Dynkin system. The first step gives , so a second application of Dynkin lemma givesTherefore the probability factorization holds for everywhich is precisely independence of the two sigma-algebras. This is independence extended from generating pi-systems.
Articles by others on the same topic
There are currently no matching articles.