Axiomatic probability
The classical definition P(A)=∣A∣/∣S∣ works only when outcomes are equally likely. For general probability , biased coins, weighted dice, real-world experiments , we need a more flexible framework. That framework is axiomatic probability, formulated by Kolmogorov in 1933.
The axioms
A probability on a sample space S is a function P that assigns to each event (subset of S) a real number, satisfying:
Axiom 1 (Non-negativity). P(A)≥0 for every event A.
Axiom 2 (Normalisation). P(S)=1.
Axiom 3 (Additivity). If A1,A2,… are pairwise mutually exclusive events, then
P(A1∪A2∪…)=P(A1)+P(A2)+…
For finite sums this is the finite additivity form: P(A∪B)=P(A)+P(B) when A∩B=∅.
That's it. Three axioms, and every property of probability flows from them.
(C1) P(∅)=0.
Proof: S=S∪∅ with S∩∅=∅. By Axiom 3: P(S)=P(S)+P(∅). By Axiom 2: 1=1+P(∅). So P(∅)=0.
(C2) Complement. P(A′)=1−P(A).
Proof: S=A∪A′, A∩A′=∅. By Axiom 3: P(S)=P(A)+P(A′). By Axiom 2: 1=P(A)+P(A′).
(C3) Monotonicity. A⊆B⇒P(A)≤P(B).
Proof: B=A∪(B−A) with disjoint pieces, so P(B)=P(A)+P(B−A)≥P(A).
(C4) 0≤P(A)≤1.
By Axiom 1 and C3 (with B=S).
(C5) Inclusion-Exclusion. P(A∪B)=P(A)+P(B)−P(A∩B).
This is the general addition rule, valid for any A,B (not just mutually exclusive ones).
Assigning probabilities
To define a probability on a finite sample space S={s1,s2,…,sn}, just choose non-negative weights p1,p2,…,pn with ∑pi=1. Then P(si)=pi, and for any event A, P(A)=∑si∈Api.
For equally likely outcomes, pi=1/n , recovering the classical formula.
Worked examples
Example 1. A coin is biased so that P(H)=0.6. Find P(T) and P(∅).
P(T)=1−0.6=0.4. P(∅)=0.
Example 2. Three events A,B,C have probabilities P(A)=0.3,P(B)=0.4,P(C)=0.5 with A and B mutually exclusive, A and C mutually exclusive, but B∩C has probability 0.2. Find P(A∪B∪C).
P(A∪B)=0.3+0.4=0.7. A∪B is disjoint from A∩C=∅... actually we need to compute P(A∪B∪C) using inclusion-exclusion. Using:
P(A∪B∪C)=P(A)+P(B)+P(C)−P(A∩B)−P(A∩C)−P(B∩C)+P(A∩B∩C).
Given P(A∩B)=P(A∩C)=0 and P(B∩C)=0.2 and P(A∩B∩C)=0:
P(A∪B∪C)=0.3+0.4+0.5−0−0−0.2+0=1.0.
Example 3. P(A)=0.5,P(B)=0.3,P(A∩B)=0.2. Find P(A∪B) and P(A′∩B′).
P(A∪B)=0.5+0.3−0.2=0.6. P(A′∩B′)=P((A∪B)′)=1−0.6=0.4.
Example 4. Is P(A)=0.7,P(B)=0.5,P(A∪B)=1.1 a valid probability assignment?
P(A∪B) must be ≤1. But 1.1>1. Not valid.
Example 5. A die is loaded so that the probability of each face is proportional to the face value. Find P(even).
Let P(i)=c⋅i for i=1,…,6. Sum =c(1+2+⋯+6)=21c=1⇒c=1/21.
P(even)=P(2)+P(4)+P(6)=(2+4+6)/21=12/21=4/7.
Try it yourself
- Valid? P(A)=0.4,P(B)=0.3,A∩B=∅,P(A∪B)=0.7.
- Valid? P(A)=0.6,P(A′)=0.5.
- If P(A)=1/3,P(B)=1/4,P(A∩B)=1/6, find P(A∪B).
- If A⊂B and P(A)=0.3,P(B)=0.7, find P(B−A).
- P(A∪B)=0.8,P(A)=0.5, P(A∩B)=0.2. Find P(B).
- A bag has 4 red, 3 green, 2 blue. A ball is drawn. Probability of red? Of not blue?
- A coin has P(H)=p. Find P(T), P(at least one head in two tosses).
- Three events have P(A)=0.4,P(B)=0.3,P(C)=0.2,P(A∩B)=0.1,P(B∩C)=0.05,P(A∩C)=0.06,P(A∩B∩C)=0.02. Find P(A∪B∪C).
- If P(A)=0.5 and P(B)=0.4, find the maximum and minimum of P(A∩B).
- Show P(A)+P(B)−1≤P(A∩B)≤min(P(A),P(B)).
- A fair die is rolled. Find P(even or prime).
- If P(A)=0.4,P(A∪B)=0.7, A and B are mutually exclusive, find P(B).
Pitfalls / Tricks
- P(∅)=0, but the converse is not true , events with positive probability can have zero-probability subsets in continuous settings (Class XII).
- Probabilities are always in [0,1].
- Always check that the assignments you compute satisfy Axiom 2: P(S)=1.
- Insight. The axioms are the minimum required for a consistent theory. From them, everything else follows by algebra.