Sigma algebra: Difference between revisions
Jump to navigation
Jump to search
imported>Ragnar Schroder (Rephrasing, adding text, changing layout.) |
imported>Ragnar Schroder m (Rephrasing.) |
||
Line 2: | Line 2: | ||
==Formal definition== | ==Formal definition== | ||
Line 17: | Line 18: | ||
*A7={Red, Yellow, Green} (the whole set \Omega) | *A7={Red, Yellow, Green} (the whole set \Omega) | ||
Let F | Let F={A0, A1, A4, A5, A7}, a subset of <math>2^\Omega</math>. | ||
Notice that the following is satisfied: | Notice that the following is satisfied: |
Revision as of 11:32, 27 June 2007
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
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 \Omega)
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 .