Set Theory/Systems of sets

From testwiki
Jump to navigation Jump to search

In this chapter, we would like to study, for a given set Ω, subsets of the power set 𝒫(Ω). We consider in particular those subsets of 𝒫(Ω) that are closed under certain operations.

Template:Definition

Template:Definition

Template:Definition

Note that being a σ-algebra is a stronger requirement than being a Dynkin system: A σ-algebra is closed under all countable intersections, whereas a Dynkin system is only closed under intersections of countable ascending chains.

Template:Definition

Template:Definition

Template:Theorem

Template:Proof

Exercises

  1. Let Ω be a set, and let Σ𝒫(Ω). Prove that Σ is a λ-system if and only if
    1. Σ
    2. A,BΣABΣ
    3. A1,A2,ΣA1A2A3nAnΣ.
  2. Let Ω be a set, and let 𝒫(Ω). Prove that is a σ-algebra if and only if
    1. A,BAB
    2. An for all n implies nAn.

Template:BookCat