Monotone class theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In measure theory and probability, the monotone class theorem connects monotone classes and 𝜎-algebras. The theorem says that the smallest monotone class containing an algebra of sets G is precisely the smallest 𝜎-algebra containing G. It is used as a type of transfinite induction to prove many other theorems, such as Fubini's theorem.

Definition of a monotone class

[edit | edit source]

A monotone class is a family (i.e. class) M of sets that is closed under countable monotone unions and also under countable monotone intersections. Explicitly, this means M has the following properties:

  1. if A1,A2,β€¦βˆˆM and A1βŠ†A2βŠ†β‹― then ⋃i=1∞Ai∈M, and
  2. if B1,B2,β€¦βˆˆM and B1βŠ‡B2βŠ‡β‹― then β‹‚i=1∞Bi∈M.

Monotone class theorem for sets

[edit | edit source]

Monotone class theorem for setsβ€”Let G be an algebra of sets and define M(G) to be the smallest monotone class containing G. Then M(G) is precisely the 𝜎-algebra generated by G; that is Οƒ(G)=M(G).

Monotone class theorem for functions

[edit | edit source]

Monotone class theorem for functionsβ€”Let π’œ be a Ο€-system that contains Ξ© and let β„‹ be a collection of functions from Ξ© to ℝ with the following properties:

  1. If Aβˆˆπ’œ then 𝟏Aβˆˆβ„‹ where 𝟏A denotes the indicator function of A.
  2. If f,gβˆˆβ„‹ and cβˆˆβ„ then f+g and cfβˆˆβ„‹.
  3. If fnβˆˆβ„‹ is a sequence of non-negative functions that increase to a bounded function f then fβˆˆβ„‹.

Then β„‹ contains all bounded functions that are measurable with respect to Οƒ(π’œ), which is the 𝜎-algebra generated by π’œ.

Proof

[edit | edit source]

The following argument originates in Rick Durrett's Probability: Theory and Examples.[1]

Proof

The assumption Ξ©βˆˆπ’œ, (2), and (3) imply that 𝒒={A:𝟏Aβˆˆβ„‹} is a πœ†-system. By (1) and the Ο€βˆ’πœ† theorem, Οƒ(π’œ)βŠ†π’’. Statement (2) implies that β„‹ contains all simple functions, and then (3) implies that β„‹ contains all bounded functions measurable with respect to Οƒ(π’œ).

Results and applications

[edit | edit source]

As a corollary, if G is a ring of sets, then the smallest monotone class containing it coincides with the 𝜎-ring of G.

By invoking this theorem, one can use monotone classes to help verify that a certain collection of subsets is a 𝜎-algebra.

The monotone class theorem for functions can be a powerful tool that allows statements about particularly simple classes of functions to be generalized to arbitrary bounded and measurable functions.

See also

[edit | edit source]
  • Dynkin system β€“ Family closed under complements and countable disjoint unions
  • Ο€-πœ† theorem β€“ Family closed under complements and countable disjoint unions
  • Ο€-system β€“ Family of sets closed under intersection
  • Οƒ-algebra β€“ Algebraic structure of set algebra

Citations

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

References

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

fr:Lemme de classe monotone