Monotone class theorem

From The Right Wiki
Jump to navigationJump 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

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 A1A2 then i=1AiM, and
  2. if B1,B2,M and B1B2 then i=1BiM.

Monotone class theorem for sets

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

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 1A where 1A 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

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

Proof

The assumption Ω𝒜, (2), and (3) imply that 𝒢={A:1A} 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

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

  • 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

  1. ā†‘ Durrett, Rick (2010). Probability: Theory and Examples (4th ed.). Cambridge University Press. p. 276. ISBN 978-0521765398.

References

fr:Lemme de classe monotone