Talk:Monotone class theorem
![]() | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
Made the page. --Steffen Grønneberg 14:16, 12 April 2006 (UTC)
how about a proof?
and the fact that it also coincides with sigma-ring?
Another two Monotone Class Theorems?
[edit]1st: In Durret's book (1995), (1.4) of chapter 5. It involves a vector space of real valued functions on big omega.
- 2nd: <a href="http://www.math.cmu.edu/~gbrunick/mct.pdf">Here</a> is another version.Jackzhp 17:42, 8 April 2007 (UTC)
Definition of Monotone Class
[edit]The definition of a monotone class in the first reference (Probability Essentials by Jacod and Protter) is different from the one given in this article. Namely, in the book a monotone class is closed under monotone ( increasing) limits, and also under differences. Even if the two definitions are equivalent, this makes some parts of the proof "not so plain" to verify. I'm specifically referring to the part concerning the fact that is closed under differences. --Trefoilknot (talk) 19:18, 24 February 2014 (UTC)
This is true and should be corrected. It seems that what Jacod and Protter call a monotone class is what is usually called a Dynkin class or a Dynkin system. A Dynkin system is not, in general, the same as a monotone class. The proof found in the article is actually the proof of what is usually called Dynkin's Lemma. The two are related, but not the same. Isdatmaths (talk) 13:39, 3 July 2014 (UTC)
I agree with this remarks and I was at first a little confused by the proof. I am editing it out untile someone can provide a real proof for this theorem :-) — Preceding unsigned comment added by 93.35.62.191 (talk) 15:06, 17 March 2015 (UTC)