Pi-lambda theorem (source code)

= Pi-lambda theorem
{title2=$\pi$-$\lambda$ theorem}

A <pi-system> is a family of sets closed under finite intersections. A <Dynkin system> contains the whole space, is closed under complements and under countable disjoint unions. The <pi-lambda theorem> states that a <Dynkin system> containing a <pi-system> $\mathcal P$ also contains the <sigma-algebra> $\sigma(\mathcal P)$.

A proof shows that the smallest <Dynkin system> containing $\mathcal P$ is closed under intersections. First fix $A\in\mathcal P$ and consider the sets $B$ for which $A\cap B$ belongs to that smallest <Dynkin system>. The Dynkin properties and the intersection property of $\mathcal P$ extend this from $B\in\mathcal P$ to every generated Dynkin set. Repeat with $A$ ranging over those generated sets. Closure under intersections plus the Dynkin properties makes a <sigma-algebra>, proving the result.

For <finite measure>[finite measures] $\mu,\nu$ with the same total mass, agreement on a generating <pi-system> implies agreement on the whole <sigma-algebra>: the agreement class is a <Dynkin system>. Equal total mass, or an assumption that the generating <pi-system> contains the whole space and the measures agree there, is necessary. In particular it is automatic for <probability measure>[probability measures]. This theorem proves <independence> extension from generating <events> and uniqueness of <probability law>[probability laws] specified on simple sets such as <intervals> or rectangles.