Sigma algebra: Difference between revisions
Jump to navigation
Jump to search
imported>Michael Hardy (→Formal definition: typo) |
imported>Michael Hardy |
||
Line 6: | Line 6: | ||
Let ''F'' ⊆ ''P'' such that all the following conditions are satisfied: | Let ''F'' ⊆ ''P'' such that all the following conditions are satisfied: | ||
# <math>\varnothing\in\Omega.</math> | # <math>\varnothing\in\Omega.</math> | ||
# If <math>A\in F </math> then < | # If <math>A\in F </math> then <math> A^c \in F</math> | ||
# If <math>G_i \in F</math> for <math>i = 1,2,3,\dots</math> then <math>\bigcup_{i =1}^{\infty} G_{i} \in F </math> | # If <math>G_i \in F</math> for <math>i = 1,2,3,\dots</math> then <math>\bigcup_{i =1}^{\infty} G_{i} \in F </math> | ||
Revision as of 09:51, 10 July 2007
In mathematics, a sigma algebra is a formal mathematical structure intended among other things to provide a rigid basis for axiomatic probability theory.
Formal definition
Given a set Let be its power set, i.e. set of all subsets of . Let F ⊆ P such that all the following conditions are satisfied:
- If then
- If for then
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:
- The empty set is in F.
- The original set is in F.
- For any set in F, you'll find it's complement in F as well.
- 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 .