Skip to content
Part IA Easter Term

Sample Spaces and Events

Experiments and Outcomes

Probability theory provides mathematical tools for reasoning about uncertain events. The starting point is the notion of an experiment: a process that produces an outcome.

Examples:

  • Rolling a die: outcome is which face lands uppermost
  • Flipping a coin three times: outcome is a sequence like HTH
  • Measuring the time until a component fails: outcome is a non-negative real number

Sample Space

The sample space Ω\Omega (or SS) is the set of all possible outcomes of an experiment.

Discrete Sample Spaces

A sample space is discrete if it is finite or countably infinite.

Example (coin flip): Ω={H,T}\Omega = \{H, T\}

Example (two dice): Ω={(i,j):i,j{1,2,3,4,5,6}}\Omega = \{(i,j) : i,j \in \{1,2,3,4,5,6\}\} has 36 outcomes.

Example (coin flips until heads): Ω={1,2,3,}\Omega = \{1, 2, 3, \ldots\} is countably infinite.

Continuous Sample Spaces

A sample space is continuous if outcomes can take any value in an interval.

Example (time to failure): Ω=[0,)\Omega = [0, \infty)

Example (temperature): Ω=R\Omega = \mathbb{R} or some bounded interval.

Events

An event is a subset of the sample space: a collection of outcomes. We say an event EE occurs if the actual outcome of the experiment is in EE.

Example (single die):

  • Event “rolling an even number”: E={2,4,6}E = \{2, 4, 6\}
  • Event “rolling at least 5”: F={5,6}F = \{5, 6\}

Example (two dice):

  • Event “sum equals 7”: E={(1,6),(2,5),(3,4),(4,3),(5,2),(6,1)}E = \{(1,6), (2,5), (3,4), (4,3), (5,2), (6,1)\}
  • Event “both dice show the same”: F={(1,1),(2,2),(3,3),(4,4),(5,5),(6,6)}F = \{(1,1), (2,2), (3,3), (4,4), (5,5), (6,6)\}

Special Events

  • The entire sample space Ω\Omega is the certain event: it always occurs.
  • The empty set \emptyset is the impossible event: it never occurs.
  • An elementary event (or atomic event) contains exactly one outcome: {x}\{x\} for some xΩx \in \Omega.

Event Operations

Since events are sets, we can combine them using set operations:

OperationNotationMeaning
UnionEFE \cup FEE or FF (or both) occurs
IntersectionEFE \cap F or EFEFBoth EE and FF occur
ComplementEcE^c or Eˉ\bar{E}EE does not occur
DifferenceEFE - F or EFE \setminus FEE occurs but FF does not

Venn diagram for set operations

Mutually Exclusive Events

Events EE and FF are mutually exclusive (or disjoint) if they cannot both occur: EF=E \cap F = \emptyset.

Example (single die): The events “roll an even number” {2,4,6}\{2,4,6\} and “roll a 3” {3}\{3\} are mutually exclusive. But “roll an even number” and “roll at most 4” {1,2,3,4}\{1,2,3,4\} are not mutually exclusive: both occur if we roll 2 or 4.

The Event Space

The collection of all events forms a sigma-algebra (or σ\sigma-algebra), denoted F\mathcal{F}. This is a collection of subsets of Ω\Omega satisfying:

  1. ΩF\Omega \in \mathcal{F}
  2. If EFE \in \mathcal{F}, then EcFE^c \in \mathcal{F} (closed under complements)
  3. If E1,E2,FE_1, E_2, \ldots \in \mathcal{F}, then i=1EiF\bigcup_{i=1}^{\infty} E_i \in \mathcal{F} (closed under countable unions)

For finite sample spaces, F\mathcal{F} is typically the power set P(Ω)\mathcal{P}(\Omega): all possible subsets.

Why sigma-algebras? They ensure we can assign probabilities consistently. If we can talk about the probability of EE and of FF, we should also be able to talk about the probability of EcE^c and EFE \cup F.

De Morgan’s Laws

For any events EE and FF:

(EF)c=EcFc(E \cup F)^c = E^c \cap F^c (EF)c=EcFc(E \cap F)^c = E^c \cup F^c

Intuition: For EFE \cup F to not occur, both EE and FF must not occur. For EFE \cap F to not occur, either EE or FF must not occur.

Partition

A partition of Ω\Omega is a collection of mutually exclusive events F1,F2,,FnF_1, F_2, \ldots, F_n whose union is Ω\Omega:

FiFj= for ijF_i \cap F_j = \emptyset \text{ for } i \neq j i=1nFi=Ω\bigcup_{i=1}^{n} F_i = \Omega

Partitions are crucial for the Law of Total Probability.

Example (single die): {1},{2},{3},{4},{5},{6}\{1\}, \{2\}, \{3\}, \{4\}, \{5\}, \{6\} partitions the sample space.

Example (blood type): F1=type A,F2=type B,F3=type AB,F4=type OF_1 = \text{type A}, F_2 = \text{type B}, F_3 = \text{type AB}, F_4 = \text{type O} partitions by blood type.

Summary

ConceptDefinition
Sample space Ω\OmegaSet of all possible outcomes
Event EESubset of the sample space
Elementary eventEvent containing one outcome
Mutually exclusiveEF=E \cap F = \emptyset
PartitionMutually exclusive events that cover Ω\Omega