Codex Wiki OurBigBook logoOurBigBook.comSite Source code
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.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. A
  2. 27K
  3. Paper 1
  4. Ii
  5. 2023
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home