Sigma algebra: Difference between revisions
Jump to navigation
Jump to search
imported>Michael Hardy (math notation cleanups. I suspect this article will remain an unsatisfactory stub for a long time unless someone among us gets really energetic.) |
imported>Hendra I. Nurdin |
||
Line 4: | Line 4: | ||
==Formal definition== | ==Formal definition== | ||
Given a set <math>\Omega</math> | Given a set <math>\Omega</math>, let <math>P = 2^\Omega</math> be its power set, i.e. set of all subsets of <math>\Omega</math>. | ||
Then a subset ''F'' ⊆ ''P'' (i.e., ''F'' is a collection of subset of <math>\Omega</math>) is a sigma algebra if it satisfies all the following conditions or axioms: | |||
# <math>\varnothing\in\Omega.</math> | # <math>\varnothing\in\Omega.</math> | ||
# If <math>A\in F </math> then <math> A^c \in F</math> | # If <math>A\in F </math> then <math> A^c \in F</math> |
Revision as of 16:47, 20 December 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 . Then a subset F ⊆ P (i.e., F is a collection of subset of ) is a sigma algebra if it satisfies all the following conditions or axioms:
- If then
- If for then
Examples
- For any set S, the power set 2S itself is a σ algebra.
- The set of all Borel subsets of the real line is a sigma-algebra.
- Given the set = {Red, Yellow, Green}, the subset F = {{}, {Green}, {Red, Yellow}, {Red, Yellow, Green}} of is a σ algebra.