← All Posts
Math · Probability & Statistics · Axioms of Probability· Part 1 of 7

Axioms of Probability — Series Overview

Combinatorial analysis told us how to count outcomes. To turn counts into probabilities we need a precise, axiomatic foundation. Without one, words like “likely”, “chance”, and “random” mean different things to different people, and proofs become impossible. The axiomatic approach — first nailed down by Kolmogorov in 1933 — gives us three short rules from which every classical probability theorem in this book follows.

This series rebuilds Chapter 2 of Ross's A First Course in Probability. We will define sample spaces and events, state the three axioms, prove the “simple propositions” that every probability problem implicitly uses, build the classical equally-likely-outcomes model, then push the theory into limits and finally into subjective belief.

What This Series Covers

Each post stands alone but builds on the one before it. We move from set-theoretic vocabulary, to the three rules of probability, to the consequences of those rules, to the classical model, to limits, and finally to interpretation.

Prerequisites

Notation Cheat Sheet

SymbolReads asMeans
$S$"sample space"Set of all possible outcomes of the experiment.
$E,F,A,B$"events"Subsets of $S$. We say $E$ “occurs” if the realised outcome lies in $E$.
$E^c$ or $\bar E$"complement of E"$S \setminus E$ — the event that $E$ does not occur.
$E \cup F$"E or F"Outcomes in $E$, in $F$, or in both.
$E \cap F$ or $EF$"E and F"Outcomes in both $E$ and $F$.
$E \cap F = \emptyset$"mutually exclusive"$E$ and $F$ cannot both occur.
$P(E)$"probability of E"A number in $[0,1]$ assigned to event $E$ obeying the three axioms.

Why Bother With Axioms?

If you only ever work with finite, equally-likely sample spaces, you can get a long way with the schoolbook formula $P(E) = |E|/|S|$. The trouble starts the moment any of these happens:

The axiomatic approach treats $P$ as a function on subsets of $S$ that obeys three rules. Whether outcomes are equally likely, whether $S$ is finite or infinite, whether $P$ comes from physics, data, or belief — everything afterwards is a theorem.

The big idea. Probability is a measure: a function that assigns a non-negative number to each event so that the total over all outcomes is $1$ and so that disjoint events add up. Everything in this chapter is a consequence of those three properties.

Visual Preview

Here's the kind of step-by-step animation you'll see throughout the series. We start with the sample space of rolling two dice, highlight an event $E = \{\text{sum} = 7\}$, and read off its probability $|E|/|S|$ — a direct application of axiom 2 plus the equally-likely model.

▶ Visual: Probability of “sum equals 7” on two fair dice

Step through the $6 \times 6 = 36$ outcomes of two dice, highlight the diagonal where the sum is $7$, and read off the probability.

How to Use This Series

Read the posts in order if probability is new to you. If you have seen the material before, skim the “Why It Works” sections — that is where the axiomatic intuition lives. Each post ends with worked examples and practice problems drawn from Ross.

Whenever a formula tempts you to memorise it, run the animation, draw the Venn diagram, and convince yourself by hand. Probability rewards careful definitions far more than clever computation.