Dynkin's π-λ theorem (induction on a generating π-system)
ProvedFamousTheorems.dynkin_pi_lambdaDynkin's π-λ theorem (induction principle). Let be a π-system (closed under finite intersections) generating the σ-algebra on . Let be a property of subsets of that holds for and for every member of , is preserved by complements of measurable sets, and is preserved by countable disjoint unions of measurable sets. Then holds for every -measurable set.
In other words, the λ-system (Dynkin system) generated by a π-system is the σ-algebra it generates. The theorem is the standard tool for proving that two measures agreeing on a π-system agree on the generated σ-algebra. It is also used for uniqueness of product measures and for independence arguments in probability.
Formalization note. Mathlib's MeasurableSpace.induction_on_inter, which is stated for a property that may also depend on the measurability proof. Here it is used with a property of the set alone. IsPiSystem s means is closed under nonempty pairwise intersections, and Pairwise (Function.onFun Disjoint f) means the sets are pairwise disjoint.
import Mathlib
namespace FamousTheorems
theorem dynkin_pi_lambda {α : Type*} {m : MeasurableSpace α} {C : Set α → Prop} {s : Set (Set α)}
(h_eq : m = MeasurableSpace.generateFrom s) (h_inter : IsPiSystem s) (h_empty : C ∅)
(h_basic : ∀ t ∈ s, C t) (h_compl : ∀ t, MeasurableSet t → C t → C tᶜ)
(h_union : ∀ f : ℕ → Set α, Pairwise (Function.onFun Disjoint f) → (∀ i, MeasurableSet (f i)) →
(∀ i, C (f i)) → C (⋃ i, f i)) :
∀ t, MeasurableSet t → C t := by sorry
end FamousTheorems