Partitions of the Sample Space
You'll learn what a partition is and how it divides a sample space into perfect, non-overlapping pieces.
The Core Idea
A partition of a sample space is a special collection of events that satisfies two critical properties simultaneously:
- Mutually Exclusive: No two events in the partition can happen at the same time (they don't overlap)
- Collectively Exhaustive: Together, the events cover every possible outcome in the sample space (nothing is left out)
Think of it like slicing a pizza: a proper partition means every slice is separate (no overlap), and when you put all slices together, you get the complete pizza (nothing missing).
Why Partitions Matter
Partitions are fundamental building blocks in probability. They let you break down complex sample spaces into manageable, well-defined categories. Every single outcome belongs to exactly one event in the partition—no more, no less.
Example: Rolling a Die
Sample space: {1, 2, 3, 4, 5, 6}
Valid partition:
- Event A: {1, 2} (rolling 1 or 2)
- Event B: {3, 4} (rolling 3 or 4)
- Event C: {5, 6} (rolling 5 or 6)
These three events are mutually exclusive (you can't roll a 2 and a 5) and collectively exhaustive (every outcome from 1-6 is included).
Not a partition:
- Event A: {1, 2, 3}
- Event B: {3, 4, 5}
- Event C: {6}
Why? Event A and B share outcome 3 (not mutually exclusive).
Key Takeaway: A partition divides the sample space into non-overlapping pieces that together account for every possible outcome—like perfect puzzle pieces that fit together to complete the picture.