Sigma algebra: Difference between revisions
Jump to navigation
Jump to search
imported>Michael Hardy |
imported>Aleksander Stos (→Example: this was false (replaced by a trivial example)) |
||
Line 9: | Line 9: | ||
# 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> | ||
==Example== | == Example == | ||
The power set itself is a σ algebra. | |||
The | |||
== See also == | == See also == |
Revision as of 14:27, 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
The power set itself is a σ algebra.