The Law of Total Probability
What You'll Learn
You'll learn how to compute the probability of an event by breaking the sample space into simpler, non-overlapping pieces and summing the probabilities across those pieces.
The Core Idea
Imagine you want to know the probability that it rains today, but the weather depends heavily on what season it is. Instead of computing P(rain) directly, you could break it down by season: find P(rain | spring), P(rain | summer), P(rain | fall), and P(rain | winter), weight each by how likely that season is, then add them up.
This is the Law of Total Probability: when you have a partition of the sample space—a collection of mutually exclusive events that cover everything—you can compute the probability of any event by summing its conditional probabilities over each piece of the partition, weighted by the probability of each piece.
The Formula
If B₁, B₂, ..., Bₙ form a partition of the sample space (mutually exclusive and exhaustive), then for any event A:
P(A) = P(A | B₁)·P(B₁) + P(A | B₂)·P(B₂) + ... + P(A | Bₙ)·P(Bₙ)
Each term P(A | Bᵢ)·P(Bᵢ) is just the multiplication rule giving P(A ∩ Bᵢ), and since the Bᵢ are disjoint, these intersections don't overlap—we're just adding up all the ways A can happen.
Why It's Useful
This law lets you "divide and conquer" probability problems. When computing P(A) directly is hard, but computing P(A | condition) is easier, you partition by those conditions and piece the answer together.
Key Takeaway: The Law of Total Probability decomposes a probability into conditional pieces over a partition, making complex problems tractable by breaking the sample space into manageable chunks.