What is a Sigma-Algebra? I find the name awfully off-putting. I prefer to think of it as simply a smaller version of the entire sample space that only includes events that can be measured or that have any sort of meaningful size.
To be able to have a sigma-algebra you need to have a set. You then proceed to construct a subset by first including the empty set and the entire set; so the subset now has 2 elements.
Formally speaking, a sigma-algebra is a collection of subsets of some larger set that satisfies a bunch of properties – namely, that they can be measured (and in our case, measured using the probability measure).
A collection of subsets of the sample space is called a sigma-algebra on if
- both the entire sample space and the empty set are also in the collection,
- if a subset is in the collection then so is its complement ,
- for all countable collections of subsets , where , the union of any or all of them is also in the collection:
Sigma-algebras form one of the three fundamental parts of what is called a probability space. The other two parts are the entire sample space, , and the probability measure . Essentially we say that a probability space is a triple .
Why are probability spaces set up like this? Why can’t we just have our sample space and perform experiments, cataloging events as we go, assigning probabilities as we see fit? Well, you can. You can just have the sample space and a probability measure , define it on all subsets of the sample space, and you have yourself a genuine finite probability space: . This is a very natural way for anyone to begin their study of probability spaces.
So a -algebra is just a definition of which sets may be considered as events. Elements not in sigma-algebra simply have no defined probability measure. Basically sigma-algebras are the “patch” that lets us avoid some pathological behaviors of mathematics, namely non-measurable sets.
The three requirements of a sigma-algebra can be considered as consequences of what we would like to do with probability:
- Closure under countable unions.
- Closure under countable intersections.
- Closure under complements.
The countable unions and countable intersections components are direct consequences of the non-measurable set issue. Closure under complements is a consequence of the Kolmogorov axioms: if then the complement of that event had better be . So without the closure under complements property you could have undefined complement events (which should always be allowed to happen), or complement events could have negative or greater than 100% probabilities. Also, closure under complements and the Kolmogorov axioms allow us to say things like: