# Pi-system

A **π-system** is a collection \( \mathcal{P} \) of subsets of a set \( \Omega \) that is closed under finite intersections: if \( A, B \in \mathcal{P} \), then \( A \cap B \in \mathcal{P} \).<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup> The notion is a workhorse of measure-theoretic probability, because many natural generating families of sets are π-systems, and Dynkin's π-λ theorem converts statements checked on a π-system into statements about the whole σ-algebra it generates.<sup>[2](https://jjdavidson.github.io/notes/measure-theory/pi-lambda.html)</sup>

| Key fact | Detail |
|---|---|
| Definition | \( \mathcal{P} \subseteq 2^{\Omega} \) is a π-system if \( A \cap B \in \mathcal{P} \) whenever \( A, B \in \mathcal{P} \); closure is required only for finite intersections<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup> |
| Need not contain Ω | A π-system on \( \Omega \) does not necessarily contain the whole set \( \Omega \) itself<sup>[3](https://ericwb.me/prob_book/mt/intro/set_theory.html)</sup> |
| Standard examples | The rays \( (-\infty, x] \) on \( \mathbb{R} \); the sets \( A_S = \{\omega : \omega_k = 1 \text{ for all } k \in S\} \) on \( \{0,1\}^{\mathbb{N}} \) for finite \( S \); the closed sets of a topological space<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup> |
| Companion notion | A λ-system contains \( \Omega \) and is closed under complements and countable unions of disjoint sets<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup> |
| Dynkin's π-λ theorem | If \( \Pi \) is a π-system, \( \Lambda \) a λ-system, and \( \Pi \subseteq \Lambda \), then \( \sigma(\Pi) \subseteq \Lambda \)<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup> |
| Uniqueness use | Two probability measures that agree on a π-system \( \mathcal{P} \) agree on all of \( \sigma(\mathcal{P}) \)<sup>[5](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)</sup> |
| Independence use | Independent π-systems generate independent σ-fields<sup>[6](https://math.uchicago.edu/~linus/6710fa19.pdf)</sup> |

## Definition and basic examples

The defining condition is deliberately weak. A σ-algebra must contain \( \Omega \), be closed under complements, and be closed under countable unions; a π-system asks only for closure under finite intersections, and it need not contain \( \Omega \) itself.<sup>[3](https://ericwb.me/prob_book/mt/intro/set_theory.html)</sup> This weakness is what makes the class easy to verify in applications.

Several standard families are π-systems.<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup>

- On \( \Omega = \mathbb{R} \), the collection \( \mathcal{P} = \{(-\infty, x] : x \in \mathbb{R}\} \) is a π-system, since \( (-\infty, x] \cap (-\infty, y] = (-\infty, \min\{x, y\}] \). This π-system generates the Borel σ-algebra \( \mathcal{B}_{\mathbb{R}} \).<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup><sup> • </sup><sup>[5](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)</sup>
- On \( \Omega = \{0,1\}^{\mathbb{N}} \), the sets \( A_S = \{\omega \in \Omega : \omega_k = 1 \text{ for all } k \in S\} \), indexed by finite \( S \subseteq \mathbb{N} \), satisfy \( A_S \cap A_T = A_{S \cup T} \).<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup>
- In any topological space \( X \), the collection of closed sets is a π-system, because intersections of closed sets are closed.<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup>
- On a product space \( \Omega^I \), the cylinder sets, which fix the coordinates \( \omega_{i_a} \) in finitely many measurable sets \( B_a \), form a π-system, and the product σ-algebra equals \( \sigma(\Pi) \) for this \( \Pi \).<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup>

An algebra of sets is a π-system with two extra properties, \( \Omega \in \mathcal{A} \) and closure under complements; every algebra is then also closed under finite unions.<sup>[1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)</sup>

## Relation to λ-systems and σ-algebras

The π-system is one of two weakenings of the σ-algebra notion used together in Dynkin's method. A **λ-system** (also called a Dynkin system) on \( \Omega \) is a collection \( \Lambda \subseteq 2^{\Omega} \) with \( \Omega \in \Lambda \) that is closed under complements and under countable unions of disjoint sets.<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup> Equivalent formulations replace the disjoint-union rule with closure under proper differences \( B \setminus A \) for \( A \subseteq B \) and under limits of increasing sequences \( A_n \uparrow A \).<sup>[7](https://pi.math.cornell.edu/~jerison/math6710/notes.pdf)</sup>

The two notions split the σ-algebra axioms into complementary halves. A class of sets is a σ-field if and only if it is both a π-system and a λ-system: the π-system supplies finite intersections, and the λ-system supplies complements and disjoint countable unions, which combine to give arbitrary countable unions by writing \( \bigcup_k A_k = \bigcup_k B_k \) with disjoint pieces \( B_k = A_k \cap \bigcap_{j<k} A_j^c \).<sup>[8](https://orenbochman.github.io/notes-bayes/C99/L10.html)</sup>

Intersections of λ-systems are λ-systems, so for any collection \( \mathcal{A} \) there is a smallest λ-system \( \ell(\mathcal{A}) \) containing it, defined as the intersection of all λ-systems containing \( \mathcal{A} \).<sup>[7](https://pi.math.cornell.edu/~jerison/math6710/notes.pdf)</sup><sup> • </sup><sup>[8](https://orenbochman.github.io/notes-bayes/C99/L10.html)</sup>

## Dynkin's π-λ theorem

**Dynkin's π-λ theorem** states that if \( \mathcal{P} \) is a π-system, \( \mathcal{L} \) is a λ-system, and \( \mathcal{P} \subseteq \mathcal{L} \), then \( \sigma(\mathcal{P}) \subseteq \mathcal{L} \).<sup>[7](https://pi.math.cornell.edu/~jerison/math6710/notes.pdf)</sup><sup> • </sup><sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup> Equivalently, the smallest λ-system \( \lambda(\mathcal{P}) \) generated by a π-system is already a σ-algebra, so \( \sigma(\mathcal{P}) \subseteq \lambda(\mathcal{P}) \), and the reverse inclusion is automatic.<sup>[9](https://personal.math.vt.edu/daymv/class_homepages/6105Notes.pdf)</sup>

The proof shows that \( \lambda(\mathcal{P}) \) is itself a π-system. For each \( A \in \mathcal{P} \) one considers the auxiliary class \( \mathcal{G}_A = \{B : A \cap B \in \lambda(\mathcal{P})\} \), verifies that it is a λ-system containing \( \mathcal{P} \), and concludes \( \lambda(\mathcal{P}) \subseteq \mathcal{G}_A \). Repeating the argument with the roles reversed shows \( A \cap B \in \lambda(\mathcal{P}) \) for all \( A, B \in \lambda(\mathcal{P}) \), so \( \lambda(\mathcal{P}) \) is a π-system and hence a σ-field.<sup>[9](https://personal.math.vt.edu/daymv/class_homepages/6105Notes.pdf)</sup> The π-system hypothesis is what makes the first step work: closure under intersections is exactly what is needed to show \( \mathcal{P} \subseteq \mathcal{G}_A \).<sup>[7](https://pi.math.cornell.edu/~jerison/math6710/notes.pdf)</sup>

The theorem is attributed to <underlined [Eugene Dynkin](https://www.edgepedia.org/eugene-dynkin) (1924–2014), a Soviet and American mathematician; a related result of Dynkin on necessary and sufficient statistics appeared in Uspekhi Mat. Nauk in 1951.<sup>[10](https://djalil.chafai.net/docs/M2/m2-profun-course-2021-2022.pdf)</sup><sup> • </sup><sup>[11](https://www.mathnet.ru/php/archive.phtml?jrnid=rm&option_lang=eng&paperid=6820&wshow=paper)</sup>

## Uniqueness of measures

The most common application is an equality principle: once two measures agree on a generating π-system, they agree on the whole generated σ-algebra.<sup>[2](https://jjdavidson.github.io/notes/measure-theory/pi-lambda.html)</sup> For probability measures the statement is immediate from the theorem. If \( P \) and \( Q \) are probability measures on \( \sigma(\mathcal{P}) \) with \( P = Q \) on \( \mathcal{P} \), the class \( \mathcal{L} = \{A \in \sigma(\mathcal{P}) : P(A) = Q(A)\} \) is a λ-system containing \( \mathcal{P} \), so \( \sigma(\mathcal{P}) \subseteq \mathcal{L} \).<sup>[5](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)</sup> The same argument works for any two finite measures with the same total mass.<sup>[5](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)</sup>

For general measures the class \( \mathcal{L} \) need not be a λ-system, because subtraction of infinite values fails, but a σ-finite version holds: if \( \mu \) and \( \nu \) are measures on \( \sigma(\mathcal{P}) \) that are σ-finite on \( \mathcal{P} \), meaning \( \Omega = \bigcup_n P_n \) with \( P_n \in \mathcal{P} \) and \( \mu(P_n), \nu(P_n) < \infty \), and \( \mu = \nu \) on \( \mathcal{P} \), then \( \mu = \nu \) on \( \sigma(\mathcal{P}) \).<sup>[9](https://personal.math.vt.edu/daymv/class_homepages/6105Notes.pdf)</sup>

Two standard consequences follow.

- A probability measure on \( (\mathbb{R}, \mathcal{B}_{\mathbb{R}}) \) is uniquely determined by its cumulative distribution function \( F(x) = P((-\infty, x]) \), because \( \{(-\infty, x] : x \in \mathbb{R}\} \) is a π-system generating \( \mathcal{B}_{\mathbb{R}} \). The result generalizes to \( \mathbb{R}^n \) with rectangles \( (-\infty, x_1] \times \cdots \times (-\infty, x_n] \).<sup>[5](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)</sup>
- On a product space \( (\Omega^I, \mathcal{F}^I) \), a probability measure is uniquely determined by its values on cylinder sets, which is the uniqueness clause of the Carathéodory and Kolmogorov extension theorems.<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup>

## Independence of generated σ-fields

A second family of applications concerns independence. If \( \mathcal{A}_1, \ldots, \mathcal{A}_n \subseteq \mathcal{F} \) are π-systems that are independent as collections of events, then the generated σ-fields \( \sigma(\mathcal{A}_1), \ldots, \sigma(\mathcal{A}_n) \) are independent.<sup>[6](https://math.uchicago.edu/~linus/6710fa19.pdf)</sup> The proof fixes \( A_2, \ldots, A_n \), sets \( F = A_2 \cap \cdots \cap A_n \), and applies the π-λ theorem to the class \( \mathcal{L} = \{A : P(A \cap F) = P(A)P(F)\} \), which is a λ-system containing \( \mathcal{A}_1 \); the argument is iterated coordinate by coordinate.<sup>[6](https://math.uchicago.edu/~linus/6710fa19.pdf)</sup><sup> • </sup><sup>[12](https://youyuanwu.github.io/misc-docs/math/11-probability/03-independence.html)</sup>

This yields the familiar criterion for random variables: real-valued \( X_1, \ldots, X_n \) are independent if and only if \( P(X_1 \le x_1, \ldots, X_n \le x_n) = \prod_{i=1}^n P(X_i \le x_i) \) for all \( x_1, \ldots, x_n \in \mathbb{R} \), because for each variable the sets \( \{X_i \le x\} \) form a π-system generating \( \sigma(X_i) \).<sup>[6](https://math.uchicago.edu/~linus/6710fa19.pdf)</sup> The same technique shows that independence is preserved by measurable functions \( g_i \), since \( \sigma(g_i(X_i)) \subseteq \sigma(X_i) \).<sup>[12](https://youyuanwu.github.io/misc-docs/math/11-probability/03-independence.html)</sup>

## How the theorem is used in practice

The working pattern is to prove a property for all sets of a σ-algebra \( \mathcal{F} = \sigma(\mathcal{A}) \) by checking it only on a small class. One defines \( \mathcal{L} = \{A \in \mathcal{F} : \text{property (X) holds for } A\} \). If the class \( \mathcal{A} \) on which the property is known is a π-system, it suffices to verify that \( \mathcal{L} \) is a λ-system, not that it is a σ-field, and whether \( \mathcal{L} \) is a λ-system depends only on the property, not on \( \mathcal{A} \).<sup>[9](https://personal.math.vt.edu/daymv/class_homepages/6105Notes.pdf)</sup> The NEU Probabilistic Programming Lab describes the same idea as a probability-friendly induction principle on σ-algebras: instead of proving closure under arbitrary countable unions, which does not match countable additivity, one proves closure under complements and disjoint countable unions.<sup>[13](https://neuppl.khoury.northeastern.edu/blog/2023/pi-lambda/)</sup>

The [monotone class theorem](https://www.edgepedia.org/monotone-class-theorem) is the analogous tool for functions: with a π-system \( \Pi \) containing \( \Omega \), a class of functions \( \mathcal{H} \) closed under linear combinations, containing indicators of \( \Pi \)-sets, and closed under bounded increasing pointwise limits, contains all bounded \( \sigma(\Pi) \)-measurable functions.<sup>[4](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)</sup>

## References

1. [Omer Tamuz, Lecture Notes on Probability, Caltech MA 144A, Section 2.1](https://www.tamuz.caltech.edu/teaching/ma144a/lectures.pdf)
2. [Jonathan Davidson, π-λ Theorem, lecture notes](https://jjdavidson.github.io/notes/measure-theory/pi-lambda.html)
3. [Eric Wofsey, Measure Theoretic Probability Theory, Section 2.1: Set Theory](https://ericwb.me/prob_book/mt/intro/set_theory.html)
4. [Matthew Kunisky, Lecture Notes: Probability Theory II, Section 5.2](https://www.kunisky.com/static/teaching/2026spring-prob2/prob2-notes-2026.pdf)
5. [Bruce Driver, Probability Lecture Notes, Section 6.8: The π−λ theorem, UCSD](https://mathweb.ucsd.edu/~bdriver/280_18-19_prob/Lecture_Notes/Older%20Versions/2018-19-Lecture%20Notes.v20.pdf)
6. [Linus Seten, Math 6710 Probability Theory I, University of Chicago, Section 4.10](https://math.uchicago.edu/~linus/6710fa19.pdf)
7. [Daniel Jerison, Probability Theory 1 Lecture Notes, Cornell Math 6710](https://pi.math.cornell.edu/~jerison/math6710/notes.pdf)
8. [Oren Bochman, Bayesian Statistics L10: Dynkin's π-λ Theorem](https://orenbochman.github.io/notes-bayes/C99/L10.html)
9. [Robert Kohn and colleagues, Math 6105 course notes, Virginia Tech](https://personal.math.vt.edu/daymv/class_homepages/6105Notes.pdf)
10. [Djalil Chafaï, A review of probability theory foundations](https://djalil.chafai.net/docs/M2/m2-profun-course-2021-2022.pdf)
11. [E. B. Dynkin, "Necessary and sufficient statistics for a family of probability distributions", Uspekhi Mat. Nauk 6:1(41) (1951), 68–90](https://www.mathnet.ru/php/archive.phtml?jrnid=rm&option_lang=eng&paperid=6820&wshow=paper)
12. [Youyuan Wu, Independence, probability notes](https://youyuanwu.github.io/misc-docs/math/11-probability/03-independence.html)
13. [John Li, The pi-lambda theorem and induction, NEU Probabilistic Programming Lab (2023)](https://neuppl.khoury.northeastern.edu/blog/2023/pi-lambda/)

---
*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Statistics and probability › Probability theory › Random variables › Exchangeability, independence, and Gaussian structure › Independence of random variables and events*

*Initially written Sep 17, 2026 · Reviewed: Sep 30, 2026; Oct 15, 2026 · Edited: Sep 30, 2026; Oct 15, 2026; Oct 21, 2026 · Last review: Oct 15, 2026*

*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*

License: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license