Sample Space

Definition of Sample Space

Basic Concept

Sample space (denoted S or Ω): set of all possible outcomes of a random experiment. Outcome: single result. Sample space: exhaustive listing of outcomes.

Random Experiment Context

Random experiment: process with uncertain result. Sample space frames all potential outcomes before experiment execution.

Role in Probability

Probability measure defined on sample space to assign likelihoods to events. Events: subsets of sample space.

Types of Sample Spaces

Discrete Sample Space

Finite or countably infinite outcomes. Examples: dice roll (6), coin toss (2), card draw (52).

Continuous Sample Space

Uncountably infinite outcomes, often intervals of real numbers. Examples: measuring time, length, temperature.

Mixed Sample Space

Combination of discrete and continuous outcomes. Examples: sensor readings with discrete status and continuous measurement.

Properties of Sample Space

Exhaustiveness

Contains all possible outcomes; no outcome outside sample space.

Mutual Exclusivity

Outcomes are mutually exclusive; no overlap between distinct outcomes.

Non-emptiness

Sample space always non-empty; at least one outcome present.

Definiteness

Outcomes precisely defined; no ambiguity.

Notation and Terminology

Common Symbols

Sample space: S or Ω. Outcome: ω ∈ S. Event: subset E ⊆ S.

Set Notation

Sample space described by set-builder or explicit listing. Example: S = {1,2,3,4,5,6} for dice.

Event Representation

Events represented as subsets; empty set ∅ is impossible event; S is certain event.

Examples of Sample Spaces

Coin Toss

S = {Heads, Tails}. Two discrete outcomes, simple binary experiment.

Dice Roll

S = {1, 2, 3, 4, 5, 6}. Finite discrete space, outcomes correspond to faces.

Card Draw

S = set of 52 distinct cards in standard deck. Complex finite discrete space.

Measuring Time

S = [0, ∞) real interval. Continuous space representing elapsed time.

Enumeration of Sample Space

Listing Outcomes

Explicit enumeration practical for finite discrete spaces. Example: S = {a,b,c}.

Set-builder Notation

Describes outcomes via properties. Example: S = {x ∈ ℕ : 1 ≤ x ≤ 6} for dice.

Use of Cartesian Product

For compound experiments, sample space is Cartesian product of component spaces.

S = S1 × S2 × ... × SnExample: Toss 2 coinsS1 = {H, T}, S2 = {H, T}S = {(H,H), (H,T), (T,H), (T,T)}

Relation to Events and Probability

Events as Subsets

Event E ⊆ S; probability defined on these subsets.

Probability Function

P: 2^S → [0,1], satisfies axioms (non-negativity, normalization, countable additivity).

Outcome Probabilities

In discrete case, probability assigned to each outcome; total sums to 1.

∑(ω ∈ S) P({ω}) = 1P(E) = ∑(ω ∈ E) P({ω})

Countable vs Uncountable Sample Spaces

Countable Sample Spaces

Finite or countably infinite sets. Probability mass function (pmf) applies.

Uncountable Sample Spaces

Typically intervals in ℝ. Probability density function (pdf) used instead.

Measure-Theoretic Foundation

Sample space endowed with σ-algebra for measure definition; essential for continuous cases.

Applications in Probability Theory

Modeling Random Phenomena

Sample space forms basis for modeling uncertainty in science, engineering, finance.

Statistical Inference

Defines domain of random variables; vital for hypothesis testing, estimation.

Stochastic Processes

Sample space represents possible paths or evolutions over time.

Visualization Techniques

Outcome Trees

Tree diagrams represent sample spaces of sequential experiments.

Venn Diagrams

Used to illustrate events as subsets within sample space.

Probability Spaces

Graphical models depict sample space with assigned probabilities.

Common Misconceptions

Sample Space is Event

Error: confusing sample space (all outcomes) with event (subset).

Ignoring Exhaustiveness

Incorrectly omitting possible outcomes leads to invalid probability models.

Assuming Equal Likelihood

Not all outcomes are equally probable; assumption valid only in specific cases.

Summary

Sample space: foundational set of all possible outcomes in probability. Types: discrete, continuous, mixed. Defines event domain, enables probability assignment. Essential for modeling, analysis, and application in probability and statistics.

"Probability theory begins with the precise definition of the sample space, the universe of elementary outcomes." -- William Feller

References

• Feller, W. "An Introduction to Probability Theory and Its Applications," Vol. 1, Wiley, 1968, pp. 1-50.
• Ross, S.M. "A First Course in Probability," 10th Edition, Pearson, 2019, pp. 10-45.
• Grimmett, G., & Stirzaker, D. "Probability and Random Processes," 3rd Edition, Oxford University Press, 2001, pp. 5-30.
• Billingsley, P. "Probability and Measure," 3rd Edition, Wiley, 1995, pp. 15-60.
• Durrett, R. "Probability: Theory and Examples," 5th Edition, Cambridge University Press, 2019, pp. 20-70.