Sigma algebra: Difference between revisions
Jump to navigation
Jump to search
imported>Ragnar Schroder (Initial stub) |
imported>Ragnar Schroder (Initial stub) |
||
Line 15: | Line 15: | ||
*A7={Red, Yellow, Green} (the whole set \Omega) | *A7={Red, Yellow, Green} (the whole set \Omega) | ||
Let F be a subset of | Let F be a subset of 2^\Omega: F={A0, A1, A4, A5, A7}. | ||
Notice that the following is satisfied: | Notice that the following is satisfied: | ||
Line 21: | Line 21: | ||
#The original set <math>\Omega</math> is in F. | #The original set <math>\Omega</math> is in F. | ||
#For any set in F, you'll find it's [[complimentary set|complement]] there also. | #For any set in F, you'll find it's [[complimentary set|complement]] there also. | ||
#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 | #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 <math>\union</math> A | ||
Revision as of 11:12, 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.
Examples
Given the set ={Red,Yellow,Green}
The power set will be {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 be a subset of 2^\Omega: F={A0, A1, A4, A5, A7}.
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 there also.
- 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 Failed to parse (unknown function "\union"): {\displaystyle \union} A