Extension to Three or More Events
What you'll learn: You'll learn how to calculate the probability of the union of three or more events using the inclusion-exclusion principle.
The Challenge with Multiple Events
When you worked with two events, the general addition rule was straightforward: P(A ∪ B) = P(A) + P(B) − P(A ∩ B)
But what happens when you need P(A ∪ B ∪ C) or even more events? Simply adding their individual probabilities would severely overcount the overlapping regions.
The Inclusion-Exclusion Principle
The inclusion-exclusion principle systematically handles overcounting by alternating between adding and subtracting intersection probabilities.
For three events A, B, and C:
P(A ∪ B ∪ C) = P(A) + P(B) + P(C)
− P(A ∩ B) − P(A ∩ C) − P(B ∩ C)
+ P(A ∩ B ∩ C)
The pattern: add individual probabilities, subtract pairwise intersections (which were counted twice), then add back the triple intersection (which was subtracted too many times).
The General Pattern
For n events, you:
- Add all single-event probabilities
- Subtract all pairwise intersection probabilities
- Add all triple intersection probabilities
- Subtract all quadruple intersections
- Continue alternating signs...
- End with ± the intersection of all n events
Think of it like filling a complicated Venn diagram: you paint each circle, erase the overlaps you double-painted, restore the triple-overlaps you over-erased, and so on.
Example
If P(A) = 0.5, P(B) = 0.4, P(C) = 0.3, P(A ∩ B) = 0.2, P(A ∩ C) = 0.15, P(B ∩ C) = 0.1, and P(A ∩ B ∩ C) = 0.05:
P(A ∪ B ∪ C) = 0.5 + 0.4 + 0.3 − 0.2 − 0.15 − 0.1 + 0.05 = 0.8
Key Takeaway: The inclusion-exclusion principle extends probability unions to any number of events by alternating between adding individual/odd-sized intersections and subtracting even-sized intersections.