A Dynkin system on contains , is closed under complements relative to , and is closed under countable disjoint unions. Unlike a sigma-algebra, it need not be closed under intersections of arbitrary members.
An equivalent axiom list is: contain , contain whenever are members, and be closed under increasing countable unions. For the forward direction, , using a disjoint union. For the reverse direction, differences from give complements; finite disjoint unions follow by two differences, and increasing partial unions give the countable disjoint-union axiom.
For example, on , take the empty set, , and every two-element subset. This is a Dynkin system: a disjoint union of two nonempty proper members is . It is not a sigma-algebra, since two intersecting pairs can have a singleton intersection. The Dynkin lemma says that adjoining intersection closure through a generating pi-system forces the full generated sigma-algebra.
Every Dynkin system containing a pi-system also contains the sigma-algebra . Equivalently, the Dynkin system generated by a pi-system equals the sigma-algebra it generates.

Ancestors (7)

  1. Sigma-algebra
  2. Measure theory
  3. Real analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7. Home

Synonyms (1)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

A Dynkin system (also known as a π-system or a Dynkin π-system) is a collection of sets that satisfies certain properties, making it useful in measure theory and probability. Specifically, a collection \( \mathcal{D} \) of subsets of a given set \( X \) is called a Dynkin system if it satisfies the following properties: 1. **Contains the entire set**: \( X \in \mathcal{D} \).