Difference between revisions of "Dynkin system"

From Maths
Jump to: navigation, search
m
m
Line 5: Line 5:
 
===[[Dynkin system/Definition 2|Second Definition]]===
 
===[[Dynkin system/Definition 2|Second Definition]]===
 
{{:Dynkin system/Definition 2}}
 
{{:Dynkin system/Definition 2}}
 
+
==Proof of equivalence of definitions==
 +
{{Todo|Do this}}
 
==Immediate results==
 
==Immediate results==
 
{{Begin Inline Theorem}}
 
{{Begin Inline Theorem}}

Revision as of 23:27, 2 August 2015

Note: a Dynkin system is also called a "d-system"[1] and the page d-system just redirects here.

Definition

First Definition

Given a set X and a family of subsets of X, which we shall denote DP(X) is a Dynkin system[2] if:

  • XD
  • For any DD we have DcD
  • For any (Dn)n=1D is a sequence of pairwise disjoint sets we have n=1DnD

Second Definition

Given a set X and a family of subsets of X we denote DP(X) is a Dynkin system[3] on X if:

  • XD
  • A,BD[BAABD]
  • Given a sequence (An)n=1D that is increasing[Note 1] and has limn(An)=A we have AD

Proof of equivalence of definitions


TODO: Do this


Immediate results

[Expand]

  • D

See also

Notes

  1. Jump up Recall this means AnAn+1

References

  1. Jump up Probability and Stochastics - Erhan Cinlar
  2. Jump up Measures, Integrals and Martingales - René L. Schilling
  3. Jump up Probability and Stochastics - Erhan Cinlar