Probability Axioms
You'll learn the three fundamental rules that give probability its mathematical structure.
What Are Probability Axioms?
In 1933, mathematician Andrey Kolmogorov established three simple axioms that formally define how probability works. These axioms are the foundation of all probability theory, including its applications in computer science (random algorithms, machine learning, data analysis). Think of them as the "rules of the game" that any valid probability measure must follow.
The Three Axioms
Given a sample space S (all possible outcomes) and an event A (a subset of outcomes):
Axiom 1: Non-Negativity
P(A) ≥ 0 for any event A.
Probabilities cannot be negative. The chance of rolling a 6 on a die might be zero or positive, but never -0.3.
Axiom 2: Certainty
P(S) = 1
The probability that something in the sample space happens is 1 (100%). When you flip a coin, you're certain to get heads or tails (assuming it lands).
Axiom 3: Additivity
If events A and B are mutually exclusive (cannot both happen), then: P(A ∪ B) = P(A) + P(B)
The probability of rolling a 2 or a 5 on a die equals P(2) + P(5) = 1/6 + 1/6 = 1/3, because these outcomes cannot occur simultaneously.
Why They Matter
These three axioms might seem obvious, but they're powerful: every other probability rule you'll learn (conditional probability, independence, Bayes' theorem) derives from these foundations. They ensure consistency across all probability calculations.
Key Takeaway: Kolmogorov's three axioms—non-negativity, certainty, and additivity of disjoint events—form the complete mathematical foundation of probability theory.