Probability axioms

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

Alternatively, a probability can be interpreted as a measure on a &sigma;-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 with non-zero probability defines another probability

: P(B \vert A) = {P(B \cap A) \over P(A)}

on the space.  This is usually réad as "probability of B given A".  If the conditional probability of B given A is the same as the probability of B, then B and 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\}, ... where \Omega = {e_1, e_2, ...}.

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

### First axiom 
: For any set E, 0 \leq P(E) \leq 1.

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

### Second axiom 
: 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.

### Third axiom 
: Any countable sequence of mutually disjoint events E_1, E_2, ... satisfies P(E_1 \cup E_2 \cup \cdots) = \sum P(E_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 &sigma;-additivity.  If there is any overlap among the subsets this relation does not hold.

For an algebraic alternative to Kolmogorov's approach, see algebra of random variables.

## Lemmas in probability 
From the Kolmogorov axioms one can deduce other useful rules for calculating probabilities:

: P(A \cup B) = P(A) + P(B) - P(A \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(\Omega - E) = 1 - P(E)

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 \cap B) = P(A) \cdot P(B \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 \cap B) = P(A) \cdot P(B).

## See also 
* frequency probability
* personal probability
* pilihan probabiliti
* statistical regularity