ⓘ Probability axioms


ⓘ Probability axioms

Probabiliti P {\displaystyle P} tina sababaraha kajadian E {\displaystyle E} {\displaystyle P}) is defined with respect to a "universe" or sample space Ω {\displaystyle \Omega } of all possible elementary events in such a way that P {\displaystyle P} must satisfy the Kolmogorov axioms.

Alternatively, a probability can be interpreted as a measure on a σ-algebra of subsets of the sample space, those subsets being the events, such that the méasure of the whole set equals 1. This property is important, since it gives rise to the natural concept of conditional probability. Every set A {\displaystyle A} with non-zero probability defines another probability

P B | A = P B ∩ A P A {\displaystyle PB\vert A={PB\cap A \over PA}}

on the space. This is usually réad as "probability of B {\displaystyle B} given A {\displaystyle A} ". If the conditional probability of B {\displaystyle B} given A {\displaystyle A} is the same as the probability of B {\displaystyle B}, then B {\displaystyle B} and A {\displaystyle A} are said to be independent.

In the case that the sample space is finite or countably infinite, a probability function can also be defined by its values on the elementary events { e 1 }, { e 2 }. {\displaystyle \{e_{1}\},\{e_{2}\}.} where Ω = e 1, e 2. {\displaystyle \Omega ={e_{1},e_{2}.}}.


1. Kolmogorov axioms

The following three axioms are known as the Kolmogorov axioms, after Andrey Kolmogorov who developed them.

First axiom

For any set E {\displaystyle E}, 0 ≤ P E ≤ 1 {\displaystyle 0\leq PE\leq 1}.

That is, the probability of an event set is represented by a réal number between 0 and 1.


1.1. Kolmogorov axioms Second axiom

P Ω = 1 {\displaystyle P\Omega=1}

That is, the probability that some elementary event in the entire sample set will occur is 1. More specifically, there are no elementary events outside the sample set.

This is often overlooked in some mistaken probability calculations; if you cannot precisely define the whole sample set, then the probability of any subset cannot be defined either.


1.2. Kolmogorov axioms Third axiom

Any countable sequence of mutually disjoint events E 1, E 2. {\displaystyle E_{1},E_{2}.} satisfies P E 1 ∪ E 2 ∪ ⋯ = ∑ P E i {\displaystyle PE_{1}\cup E_{2}\cup \cdots=\sum PE_{i}}.

That is, the probability of an event set which is the union of other disjoint subsets is the sum of the probabilities of those subsets. This is called σ-additivity. If there is any overlap among the subsets this relation does not hold.

For an algebraic alternative to Kolmogorovs approach, see algebra of random variables.


2. Lemmas in probability

From the Kolmogorov axioms one can deduce other useful rules for calculating probabilities:

P A ∪ B = P A + P B − P A ∩ B {\displaystyle PA\cup B=PA+PB-PA\cap B}

That is, the probability that A or B will happen is the sum of the probabilities that A will happen and that B will happen, minus the probability that A and B will happen. This can be extended to the inclusion-exclusion principle.

P Ω − E = 1 − P E {\displaystyle P\Omega -E=1-PE}

That is, the probability that any event will not happen is 1 minus the probability that it will.

Using conditional probability as defined above, it also follows immediately that

P A ∩ B = P A ⋅ P B | A {\displaystyle PA\cap B=PA\cdot PB\vert A}

That is, the probability that A and B will happen is the probability that A will happen, times the probability that B will happen given that A happened; this relationship gives Bayes theorem. It then follows that A and B are independent if and only if

P A ∩ B = P A ⋅ P B {\displaystyle PA\cap B=PA\cdot PB}.