Axiomatic approach to probability

Before the twentieth century, probability meant two different recipes: count favourable outcomes over total outcomes, or repeat an experiment and watch the relative frequency settle down. Both work, but neither tells you why they agree, or what to do when outcomes are not equally likely. The axiomatic approach, due to Andrei Kolmogorov, fixes this by treating probability as a function PP on events that must obey just three rules — non-negativity, P(S)=1P(S)=1, and additivity over mutually exclusive events. Everything else you already use — P(A′)=1−P(A)P(A')=1-P(A), the addition rule, even the familiar m/nm/n formula — turns out to be a logical consequence of these three axioms, not a separate assumption. This article derives that machinery and applies it to cards and coins.

The core insight

A probability function PP on events of a sample space SS is any assignment satisfying P(A)≥0P(A)\ge 0, P(S)=1P(S)=1, and additivity over mutually exclusive events, and every familiar probability rule — including P(A)=m/nP(A)=m/n for equally likely outcomes — follows logically from these three axioms alone.

The core idea

The three axioms. Let SS be the sample space of a random experiment with a finite number of outcomes. A rule assigning a real number P(A)P(A) to every event (subset) A⊆SA\subseteq S is a probability function if:

P(A)≥0 for every event A,P(S)=1P(A) \ge 0 \text{ for every event } A, \qquad P(S) = 1

and, for pairwise mutually exclusive events A1,A2,…,AnA_1, A_2, \dots, A_n (so Ai∩Aj=∅A_i \cap A_j = \varnothing for i≠ji \ne j),

P(A1∪A2∪⋯∪An)=P(A1)+P(A2)+⋯+P(An)P(A_1 \cup A_2 \cup \cdots \cup A_n) = P(A_1) + P(A_2) + \cdots + P(A_n)

where: P(A)P(A) is the probability assigned to event AA, SS is the whole sample space (the "sure event"), and mutually exclusive means the events share no outcome.

Two immediate consequences. Since S∪∅=SS \cup \varnothing = S with S∩∅=∅S \cap \varnothing = \varnothing, additivity gives P(S)=P(S)+P(∅)P(S) = P(S) + P(\varnothing), so P(∅)=0P(\varnothing) = 0 — the impossible event always has probability zero. Since A∪A′=SA \cup A' = S with A∩A′=∅A \cap A' = \varnothing, the same reasoning gives the complement rule, P(A′)=1−P(A)P(A') = 1 - P(A).

Equally likely outcomes recovered. If S={ω1,…,ωn}S = \{\omega_1, \dots, \omega_n\} and every simple event {ωi}\{\omega_i\} is assigned the same probability pp, axioms two and three force np=1np = 1, so p=1/np = 1/n. For any event AA built from mm of these outcomes, additivity gives the classical formula students already know, now derived rather than assumed:

P(A)=mn=number of outcomes favourable to Atotal number of outcomes in SP(A) = \frac{m}{n} = \frac{\text{number of outcomes favourable to } A}{\text{total number of outcomes in } S}

Monotonicity and bounds. If A⊆BA \subseteq B, writing B=A∪(B∖A)B = A \cup (B \setminus A) as a disjoint union and applying additivity shows P(A)≤P(B)P(A) \le P(B); combined with axiom one, every event satisfies 0≤P(A)≤10 \le P(A) \le 1. The figure below shows how two overlapping events split the sample space into three disjoint pieces — the geometric picture behind the addition rule derived next.

Figure
A Venn diagram of two overlapping events A and B inside a rectangle for the sample space S, with the overlap region A intersect B shaded darker than the two outer crescents
S A B A n B P(A u B) = P(A) + P(B) minus P(A n B)
Derivation AThe general addition rule

The goal is to derive, from the three axioms alone, the addition rule P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B) that applies to any two events, even when they overlap — the tool needed whenever "or" connects two events that can happen together, such as drawing a card that is a king or a heart.

Step 1. Split A∪BA \cup B into disjoint pieces. Write A∪BA \cup B as the union of three sets that share no outcomes with each other: the part of AA outside BB (call it A∖BA \setminus B), the part of BB outside AA (call it B∖AB \setminus A), and the overlap A∩BA \cap B. So A∪B=(A∖B)∪(A∩B)∪(B∖A)A \cup B = (A\setminus B) \cup (A\cap B) \cup (B\setminus A), and these three pieces are pairwise mutually exclusive by construction.

Step 2. Apply axiom three (additivity) to this disjoint decomposition:

P(A∪B)=P(A∖B)+P(A∩B)+P(B∖A)P(A \cup B) = P(A\setminus B) + P(A\cap B) + P(B\setminus A)

Step 3. Express AA and BB themselves as disjoint unions in the same way: A=(A∖B)∪(A∩B)A = (A\setminus B) \cup (A\cap B), so P(A)=P(A∖B)+P(A∩B)P(A) = P(A\setminus B) + P(A\cap B), which rearranges to P(A∖B)=P(A)−P(A∩B)P(A\setminus B) = P(A) - P(A\cap B). Similarly P(B∖A)=P(B)−P(A∩B)P(B\setminus A) = P(B) - P(A\cap B).

Step 4. Substitute both back into Step 2:

P(A∪B)=[P(A)−P(A∩B)]+P(A∩B)+[P(B)−P(A∩B)]=P(A)+P(B)−P(A∩B)P(A \cup B) = \big[P(A) - P(A\cap B)\big] + P(A\cap B) + \big[P(B) - P(A\cap B)\big] = P(A) + P(B) - P(A\cap B)

When AA and BB are mutually exclusive, P(A∩B)=P(∅)=0P(A\cap B) = P(\varnothing) = 0, and the formula collapses back to axiom three exactly — confirming the general rule is consistent with, not a replacement for, the original axiom.

Worked example

A card is drawn at random from a well-shuffled deck of 52 playing cards. Let AA = "the card is a king" and BB = "the card is a heart". Find P(A∪B)P(A \cup B), and verify the complement rule using AA.

Step 1. Total outcomes: SS has n=52n = 52 equally likely outcomes, so by the equally-likely formula each simple event has probability 1/521/52.

Step 2. Individual probabilities: 4 kings give P(A)=4/52=1/13P(A) = 4/52 = 1/13; 13 hearts give P(B)=13/52=1/4P(B) = 13/52 = 1/4; the single "king of hearts" gives P(A∩B)=1/52P(A \cap B) = 1/52.

Step 3. Apply the derived addition rule (the events overlap, since one card is both a king and a heart):

P(A∪B)=452+1352−152=1652=413P(A \cup B) = \frac{4}{52} + \frac{13}{52} - \frac{1}{52} = \frac{16}{52} = \frac{4}{13}

Step 4. Complement check on AA: A′A' = "not a king" has 52−4=4852 - 4 = 48 outcomes, so P(A′)=48/52=12/13P(A') = 48/52 = 12/13, and indeed P(A)+P(A′)=1/13+12/13=1P(A) + P(A') = 1/13 + 12/13 = 1, confirming the complement rule.

The probability of drawing a king or a heart is 4/13\mathbf{4/13}, and P(A)+P(A′)=1P(A) + P(A') = 1 checks out exactly.

Competitive stretch

Three coins are tossed together; sample space S={HHH,HHT,HTH,THH,HTT,THT,TTH,TTT}S = \{HHH, HHT, HTH, THH, HTT, THT, TTH, TTT\}, n=8n = 8, each outcome equally likely with probability 1/81/8. For event CC = "at least two heads" = {HHH,HHT,HTH,THH}\{HHH, HHT, HTH, THH\}, P(C)=4/8=1/2P(C) = 4/8 = 1/2; its complement C′C' = "at most one head" also has 4 outcomes, so P(C′)=1/2P(C') = 1/2, again giving P(C)+P(C′)=1P(C) + P(C') = 1 — the same axiom-derived rule holding regardless of how the sample space is built.

Common traps

  • Applying P(A∪B)=P(A)+P(B)P(A \cup B) = P(A) + P(B) (axiom three) even when AA and BB are not mutually exclusive — the −P(A∩B)-P(A \cap B) correction is mandatory whenever the events can occur together.
  • Using P(A)=m/nP(A) = m/n when outcomes in SS are not equally likely; the shortcut needs that assumption, though the axioms themselves hold regardless.
  • Treating P(∅)=0P(\varnothing) = 0 as a separate assumption rather than a derived consequence of the three axioms.
  • Confusing P(A′)P(A') with P(A∩B′)P(A \cap B') or similar — the complement rule P(A′)=1−P(A)P(A') = 1 - P(A) only ever concerns the complement of one event with respect to SS.

Ask the tutor: if you want to see the addition rule derivation redone for three overlapping events instead of two, or want a fresh worked example with dice instead of cards, ask the AI tutor to walk through it step by step.

Why do we need three axioms instead of just using P(A) = favourable/total everywhere?

Because P(A)=m/nP(A) = m/n only works when every outcome in the sample space is equally likely, and many real experiments — a biased coin, a weighted die, weather forecasts — do not have equally likely outcomes. The three axioms are general enough to cover every valid probability assignment, equally likely or not, and the m/nm/n formula then falls out as a special case once you additionally assume equal likelihood. The axioms are the foundation; m/nm/n is one convenient consequence built on top.

Do I need to memorise the addition rule derivation, or just the final formula?

For most exam questions, knowing and correctly applying P(A∪B)=P(A)+P(B)−P(A∩B)P(A \cup B) = P(A) + P(B) - P(A \cap B) is enough. But examiners sometimes ask you to derive or justify it from the axioms, especially in higher-order questions, so understanding the disjoint-splitting argument (Steps 1 to 4 above) is worth keeping in your toolkit rather than treating the formula as a black box.

Is the axiomatic approach a totally different way of computing probability than the classical approach I learned before?

No — it is a stricter foundation underneath the same calculations. The axiomatic approach does not give you a new computational recipe; instead it proves that the classical (m/nm/n) and empirical (relative frequency) methods you already use are both consistent with, and derivable from, the same three underlying rules. In practice, for CBSE Class 11 problems, you will still compute probabilities the same way — the axioms explain why those methods are valid.

Before this

Where this leads