Dynkin system


Let Ω be a set, and 𝒫⁢(Ω) be the power setMathworldPlanetmath of Ω. A Dynkin system on Ω is a set 𝒟⊂𝒫⁢(Ω) such that

  1. 1.

    Ω∈𝒟

  2. 2.

    A,B∈𝒟⁢ and ⁢A⊂B⇒B∖A∈𝒟

  3. 3.

    An∈𝒟,An⊂An+1,n≥1⇒⋃k=1∞Ak∈𝒟.

Let F⊂𝒫⁢(Ω), and consider

Γ={X:X⊂𝒫⁢(Ω)⁢ is a Dynkin system and ⁢F⊂X}. (1)

We define the intersectionMathworldPlanetmath of all the Dynkin systems containing F as

𝒟⁢(F):=⋂X∈ΓX (2)

One can easily verify that 𝒟⁢(F) is itself a Dynkin system and that it contains F. We call 𝒟⁢(F) the Dynkin system generated by F. It is the “smallest” Dynkin system containing F.

A Dynkin system which is also π-system (http://planetmath.org/PiSystem) is a σ-algebra (http://planetmath.org/SigmaAlgebra).

Title Dynkin system
Canonical name DynkinSystem
Date of creation 2013-03-22 12:21:19
Last modified on 2013-03-22 12:21:19
Owner mathwizard (128)
Last modified by mathwizard (128)
Numerical id 9
Author mathwizard (128)
Entry type Definition
Classification msc 03E20
Classification msc 28A60
Related topic DynkinsLemma