Course contentsShow
← Mathematics
Lesson 2780 of 3,12155. Probability — FoundationsFree lesson

Partitions of the Sample Space

Introduce partitions as collections of mutually exclusive events whose union is the entire sample space.

Partitions of the Sample Space

What You'll Learn

You'll learn how to divide a sample space into non-overlapping pieces that together account for every possible outcome.

The Core Idea

A partition of a sample space is a special collection of events that satisfies two crucial properties:

  1. Mutually exclusive: No two events in the partition can happen at the same time (their intersections are all empty)
  2. Exhaustive: Together, these events cover the entire sample space (their union is the whole sample space)

Think of it like slicing a pizza: the slices don't overlap, and together they make up the whole pizza. Every outcome in your random experiment must fall into exactly one "slice" of the partition.

Plain English Explanation

Imagine rolling a standard six-sided die. Here's a partition of that sample space:

  • Event A₁ = {1, 2} (rolling 1 or 2)
  • Event A₂ = {3, 4} (rolling 3 or 4)
  • Event A₃ = {5, 6} (rolling 5 or 6)

Notice that:

  • These events are mutually exclusive (you can't roll both a 2 and a 5 simultaneously)
  • Together they cover everything: A₁ ∪ A₂ ∪ A₃ = {1, 2, 3, 4, 5, 6} = the entire sample space

Another valid partition would be "even outcomes" {2, 4, 6} and "odd outcomes" {1, 3, 5}.

Not a partition: {1, 2, 3} and {4, 5} would fail because they don't include 6—not exhaustive!

Partitions are powerful organizational tools in probability because they let you break complex problems into simpler, non-overlapping cases that you can analyze separately.

Key Takeaway: A partition divides the sample space into mutually exclusive events whose union equals the entire sample space—every outcome belongs to exactly one piece of the partition.