Sigma algebra

From Citizendium
Revision as of 14:29, 27 June 2007 by imported>Ragnar Schroder (→‎Example: added forgotten <math> tag)
Jump to navigation Jump to search

A sigma algebra is an advanced mathematical concept. It refers to a formal mathematical structure intended among other things to provide a rigid basis for axiomatic probability theory.

Formal definition

Given a set . Let P=2^ be it's power set, i.e. set of all subsets of . Let F ⊆ P such that all the following conditions are satisfied:

  1. Ø ∈ .
  2. A ∈ F => ∈ F
  1. G ⊆ F => ∈ F


Example

Given the set ={Red,Yellow,Green}

The power set is {A0,A1,A2,A3,A4,A5,A6,A7}, with

  • A0={} (The empty set}
  • A1={Green}
  • A2={Yellow}
  • A3={Yellow, Green}
  • A4={Red}
  • A5={Red, Green}
  • A6={Red, Yellow}
  • A7={Red, Yellow, Green} (the whole set )

Let F={A0, A1, A4, A5, A7}, a subset of .

Notice that the following is satisfied:

  1. The empty set is in F.
  2. The original set is in F.
  3. For any set in F, you'll find it's complement in F as well.
  4. For any subset of F, the union of the sets therein will also be in F. For example, the union of all elements in the subset {A0,A1,A4} of F is A0 U A1 U A4 = A5.

Thus F is a sigma algebra over .

See also

References

External links