Theorems · Inductive type · measure theory
MeasurableSpace.DynkinSystem
Type u_4 → Type u_4
A Dynkin system is a collection of subsets of a type α that contains the empty set,
is closed under complementation and under countable union of pairwise disjoint sets.
The disjointness condition is the only difference with σ-algebras.
The main purpose of Dynkin systems is to provide a powerful induction rule for σ-algebras
generated by a collection of sets which is stable under intersection.
A Dynkin system is also known as a "λ-system" or a "d-system".
- Defined in
- Mathlib.MeasureTheory.PiSystem
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by31
Results whose statement or proof uses this declaration.
- MeasurableSpace.DynkinSystem.Hasstatement and proof · cited by 17
- MeasurableSpace.DynkinSystem.generatestatement · cited by 5
- MeasurableSpace.DynkinSystem.has_complstatement and proof · cited by 4
- MeasurableSpace.DynkinSystem.ofMeasurableSpacestatement · cited by 4
- MeasurableSpace.DynkinSystem.generate_lestatement and proof · cited by 3
- MeasurableSpace.DynkinSystem.has_emptystatement and proof · cited by 3
- MeasurableSpace.DynkinSystem.extstatement and proof · cited by 2
- MeasurableSpace.DynkinSystem.has_iUnionstatement and proof · cited by 2
- MeasurableSpace.DynkinSystem.toMeasurableSpacestatement and proof · cited by 2
- MeasurableSpace.DynkinSystem.mk.injstatement · cited by 1
- MeasurableSpace.DynkinSystem.mk.noConfusionstatement · cited by 1
- MeasurableSpace.DynkinSystem.generateFrom_eqproof · cited by 1