Kolmogorov's axioms of probability
Statement
A probability space is a triple consisting of a sample space , a -algebra of subsets of (called events), and a function satisfying three axioms: (1) non-negativity: for every ; (2) normalization: ; and (3) countable additivity: for every sequence of pairwise disjoint events ( for ), .
Why is it true?
Kolmogorov's axioms treat probability just like mass or area distributed across the space of possible outcomes : every event has non-negative weight, the total weight of all possibilities is , and the weight of a union of non-overlapping pieces — even countably infinitely many — is simply the sum of their individual weights.
Proof sketch
From the three axioms all standard rules of probability follow immediately: taking and for gives , hence . Finite additivity follows by setting for . Since and are disjoint with , we get , monotonicity when , and continuity of probability along monotone sequences of events via countable additivity.
Stated by
Proved by
Topics that use this theorem
Related theorems
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Andrey Kolmogorov (1933). Grundbegriffe der Wahrscheinlichkeitsrechnung
- Andrey Kolmogorov (1950). Foundations of the Theory of Probability