Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dynkin's π-λ theorem (induction on a generating π-system)

Proved
FamousTheorems.dynkin_pi_lambda

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Dynkin's π-λ theorem (induction principle). Let S\mathcal SS be a π-system (closed under finite intersections) generating the σ-algebra M\mathcal MM on α\alphaα. Let CCC be a property of subsets of α\alphaα that holds for ∅\varnothing∅ and for every member of S\mathcal SS, is preserved by complements of measurable sets, and is preserved by countable disjoint unions of measurable sets. Then CCC holds for every M\mathcal MM-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 sss is closed under nonempty pairwise intersections, and Pairwise (Function.onFun Disjoint f) means the sets fif_ifi​ are pairwise disjoint.

Preamble
import Mathlib
Formal statement
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
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `MeasurableSpace.induction_on_inter`. Proof here reduces to that Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me