Probability Foundations
View .md

Sample Space and Outcomes

Every probability model starts with a sample space β€” a description of all possible things that may happen during an experiment.


The Experiment

In probability theory, an experiment is any process that produces uncertain outcomes:

  • Flipping a coin
  • Rolling a die
  • Drawing cards from a deck
  • Measuring the time until a light bulb fails

Sample Space (Ξ©)

The sample space Ξ© is the set of all possible outcomes of an experiment.

We sometimes write it as a list β€” for example, a coin flip has Ξ© = {Heads, Tails}. But formally it’s a set, and for continuous sample spaces (like all points in a square), we can’t list them at all.


Requirements for a Valid Sample Space

A valid sample space must satisfy two requirements:

Requirement Meaning
Mutually Exclusive No two outcomes can occur simultaneously. If one happens, the others cannot.
Collectively Exhaustive Every possible result is included. Nothing is forgotten.

Discrete vs. Continuous Sample Spaces

Sample spaces come in two fundamental types:

Discrete Sample Spaces

The outcomes can be counted (finite or infinite).

Type Example Sample Space
Finite Coin flip Ξ© = {Heads, Tails} β€” 2 outcomes
Finite Two coin flips Ξ© = {HH, HT, TH, TT} β€” 4 outcomes
Countably Infinite Wait until first heads Ξ© = {1, 2, 3, 4, …} β€” infinite but countable

For discrete spaces, you can often list or enumerate the outcomes.

Continuous Sample Spaces

The outcomes are uncountably infinite β€” there are infinitely many outcomes, and they cannot be arranged in a list.

Experiment Sample Space
Time until light bulb fails Ξ© = [0, ∞) β€” all non-negative real numbers
Dart thrown at unit square Ξ© = {(x, y) : 0 ≀ x ≀ 1, 0 ≀ y ≀ 1}

For continuous spaces, an outcome is a point in a region. You cannot list the points β€” you describe the region.


The Dart Example (Continuous)

Experiment: Throw a dart at a square target. You’re skilled enough that the dart always lands inside the square.

Sample Space: All points (x, y) where x and y are real numbers between 0 and 1.

Ξ© = {(x, y) : 0 ≀ x ≀ 1, 0 ≀ y ≀ 1}

This is a continuous sample space:

  • There are infinitely many points in the square
  • Each point is a possible outcome
  • You cannot list them all
  • Any single point has probability zero (a point has zero area)

To assign probabilities, we look at events (subsets with positive area), not individual outcomes.


Examples of Sample Spaces

Experiment Sample Space Type
Coin flip Ξ© = {Heads, Tails} Discrete (finite)
Die roll (6-sided) Ξ© = {1, 2, 3, 4, 5, 6} Discrete (finite)
Two coin flips Ξ© = {HH, HT, TH, TT} Discrete (finite)
Wait until first heads Ξ© = {1, 2, 3, …} Discrete (infinite)
Dart in unit square Ξ© = {(x,y) : 0≀x,y≀1} Continuous
Time until bulb fails Ω = [0, ∞) Continuous

Choosing the Right Sample Space

Sometimes you have freedom in how detailed to make your sample space.

Example: Flipping a coin, you could use:

  • Ω₁ = {Heads, Tails}
  • Ξ©β‚‚ = {Heads, Tails-and-raining, Tails-and-not-raining}

Both are valid! Choose the level of detail that captures what matters for your model. Irrelevant details (like weather) are usually excluded.


Outcomes

An outcome is a single element of the sample space β€” one complete result of the experiment.

Properties of Outcomes

  • Distinguishable β€” Each outcome is unique and identifiable
  • Atomic β€” Cannot be broken down further within this model
  • Complete β€” Describes the entire experiment, not just one stage

Outcomes vs. Results

For multi-stage experiments, we distinguish:

  • Result = what happens at each stage
  • Outcome = the overall result at the end of the complete experiment

Example: Flip a coin twice

  • First flip result: Heads
  • Second flip result: Tails
  • Outcome: (Heads, Tails) or β€œHT”

The outcome HT is different from TH β€” order matters when tracking everything that happens.


Sequential Description (Tree Diagram)

For multi-stage experiments, a tree diagram helps visualize all possible outcomes.

Example: Flip a coin twice

Each path from root to leaf represents one outcome:

Path Outcome
Start β†’ H β†’ H HH (Heads, then Heads)
Start β†’ H β†’ T HT (Heads, then Tails)
Start β†’ T β†’ H TH (Tails, then Heads)
Start β†’ T β†’ T TT (Tails, then Tails)

The tree has 4 leaves = 4 possible outcomes.


Key Terms

ExperimentA process that produces uncertain outcomes
Sample Space (Ξ©)The set of all possible outcomes
OutcomeA single element of the sample space (complete result)
ResultWhat happens at one stage of a multi-stage experiment
Discrete Sample SpaceOutcomes can be counted (finite or countably infinite)
Continuous Sample SpaceOutcomes are uncountably infinite (points in a region)
Mutually ExclusiveOutcomes that cannot occur together
Collectively ExhaustiveCovering all possibilities