Probability Axioms¶
Basic Notions and Notation¶
Given an event \(A\), which is a subset of the sample space, i.e., \(A\subset\Omega\), we will associate with it a real number \(\mathbf{P}(A)\) to denote the probability that it will occur. The symbol \(\mathbf{P}\) is a probability distribution or probability measure.
Axioms¶
For \(\mathbf{P}\) to be a probability, it must satisfy these axioms:
-
non-negativity
\[\mathbf{P}(A)\geq0\] -
normalization
\[\mathbf{P}(\Omega)=1\] -
(finite) additivity
Given two events, \(A\) and \(B\), if \(A\cap B=\varnothing\), then
\[\mathbf{P}(A\cup B)=\mathbf{P}(A) + \mathbf{P}(B).\]We will strengthen this last axiom below.
Some Consequences of the Axioms¶
- If \(A\cap B=\varnothing\), then
$\(0\leq\mathbf{P}(A)\leq 1\)$
$\(\mathbf{P}(\varnothing)=0\)$
$\(\mathbf{P}(A\cup B)=\mathbf{P}(A)+\mathbf{P}(B).\)$
- In general, if \(A_1, A_2,\ldots, A_k\) are disjoint, then
$\(\mathbf{P}(A_1\cup\ldots\cup A_k)=\sum_{i=1}^{k}\mathbf{P}(A_i).\)$
- If \(A\subset B\), then
$\(\mathbf{P}(A)\leq\mathbf{P}(B).\)$
- If \(A\cap B\neq\varnothing\), then
$\(\mathbf{P}(A\cup B)=\mathbf{P}(A)+\mathbf{P}(B)-\mathbf{P}(A\cap B).\)$
- Union Bound
$\(\mathbf{P}(A\cup B)\leq\mathbf{P}(A)+\mathbf{P}(B)\)$
Uniform Probability Law¶
Assume that the sample space \(\Omega\) consists of \(n\) equally likely elements and event \(A\) consists of \(k\) elements. Then,
Continuous Example¶
Consider all pairs \((x,y)\) such that \(0\leq x,y\leq 1\). We want to know the probability that \(x+y\leq\frac{1}{2}\). The plot below shows the sample space with the shaded region as the event of interest.

Therefore,
This is just the area of the shaded region divided by the area of the square.
Discrete but Infinite Sample Space¶
Consider the sample space \(\{1,2,3,\ldots\}\). However, the elements are not equally likely with the probability given instead by
The first axiom is obviously satisfied. To see that this satisfies the second axiom, we have
Now, we want to know the probability of getting an even integer. We have
Can we use the third axiom to continue our calculation? No. We have a union of infinitely many disjoint sets. To be able to continue, we need to introduce another axiom that will give us additivity for an infinite number of disjoint sets. This will be stated in the next section. For now, we proceed as if we can, i.e.,
Countable Additivity Axiom¶
If \(A_1,A_2,A_3,\ldots\) is an infinite sequence of disjoint events, then
Note that additivity holds only for countable sequences of events.
Bonferroni's Inequality¶
For any events, \(A\) and \(B\),
In general, for \(n\) events \(A_1,\ldots,A_n\),