Part of a series on statistics
Probability theory
Probability Axioms Determinism System Indeterminism Randomness
Probability space Sample space Event Collectively exhaustive events Elementary event Mutual exclusivity Outcome Singleton Experiment Bernoulli trial Probability distribution Bernoulli distribution Binomial distribution Exponential distribution Normal distribution Pareto distribution Poisson distribution Probability measure Random variable Bernoulli process Continuous or discrete Expected value Variance Markov chain Observed value Random walk Stochastic process
Complementary event Joint probability Marginal probability Conditional probability
Independence Conditional independence Law of total probability Law of large numbers Bayes' theorem Boole's inequality
Venn diagram Tree diagram
v t e

In probability theory, a probability space or a probability triple ${\displaystyle (\Omega ,{\mathcal {F}},P)}$ is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models the throwing of a die.

A probability space consists of three elements:^[1][2]

1. A sample space, ${\displaystyle \Omega }$, which is the set of all possible outcomes.
2. An event space, which is a set of events, ${\displaystyle {\mathcal {F}}}$, an event being a set of outcomes in the sample space.
3. A probability function, ${\displaystyle P}$, which assigns, to each event in the event space, a probability, which is a number between 0 and 1 (inclusive).

In order to provide a model of probability, these elements must satisfy probability axioms.

In the example of the throw of a standard die,

1. The sample space ${\displaystyle \Omega }$ is typically the set ${\displaystyle \{1,2,3,4,5,6\}}$ where each element in the set is a label which represents the outcome of the die landing on that label. For example, ${\displaystyle 1}$ represents the outcome that the die lands on 1.
2. The event space ${\displaystyle {\mathcal {F}}}$ could be the set of all subsets of the sample space, which would then contain simple events such as ${\displaystyle \{5\}}$ ("the die lands on 5"), as well as complex events such as ${\displaystyle \{2,4,6\}}$ ("the die lands on an even number").
3. The probability function ${\displaystyle P}$ would then map each event to the number of outcomes in that event divided by 6 – so for example, ${\displaystyle \{5\}}$ would be mapped to ${\displaystyle 1/6}$, and ${\displaystyle \{2,4,6\}}$ would be mapped to ${\displaystyle 3/6=1/2}$.

When an experiment is conducted, it results in exactly one outcome ${\displaystyle \omega }$ from the sample space ${\displaystyle \Omega }$. All the events in the event space ${\displaystyle {\mathcal {F}}}$ that contain the selected outcome ${\displaystyle \omega }$ are said to "have occurred". The probability function ${\displaystyle P}$ must be so defined that if the experiment were repeated arbitrarily many times, the number of occurrences of each event as a fraction of the total number of experiments, will most likely tend towards the probability assigned to that event.

The Soviet mathematician Andrey Kolmogorov introduced the notion of a probability space and the axioms of probability in the 1930s. In modern probability theory, there are alternative approaches for axiomatization, such as the algebra of random variables.

A probability space is a mathematical triplet ${\displaystyle (\Omega ,{\mathcal {F}},P)}$ that presents a model for a particular class of real-world situations. As with other models, its author ultimately defines which elements ${\displaystyle \Omega }$, ${\displaystyle {\mathcal {F}}}$, and ${\displaystyle P}$ will contain.

• The sample space ${\displaystyle \Omega }$ is the set of all possible outcomes. An outcome is the result of a single execution of the model. Outcomes may be states of nature, possibilities, experimental results and the like. Every instance of the real-world situation (or run of the experiment) must produce exactly one outcome. If outcomes of different runs of an experiment differ in any way that matters, they are distinct outcomes. Which differences matter depends on the kind of analysis we want to do. This leads to different choices of sample space.
• The σ-algebra ${\displaystyle {\mathcal {F}}}$ is a collection of all the events we would like to consider. This collection may or may not include each of the elementary events. Here, an "event" is a set of zero or more outcomes; that is, a subset of the sample space. An event is considered to have "happened" during an experiment when the outcome of the latter is an element of the event. Since the same outcome may be a member of many events, it is possible for many events to have happened given a single outcome. For example, when the trial consists of throwing two dice, the set of all outcomes with a sum of 7 pips may constitute an event, whereas outcomes with an odd number of pips may constitute another event. If the outcome is the element of the elementary event of two pips on the first die and five on the second, then both of the events, "7 pips" and "odd number of pips", are said to have happened.
• The probability measure ${\displaystyle P}$ is a set function returning an event's probability. A probability is a real number between zero (impossible events have probability zero, though probability-zero events are not necessarily impossible) and one (the event happens almost surely, with almost total certainty). Thus ${\displaystyle P}$ is a function ${\displaystyle P:{\mathcal {F}}\to [0,1].}$ The probability measure function must satisfy two simple requirements: First, the probability of a countable union of mutually exclusive events must be equal to the countable sum of the probabilities of each of these events. For example, the probability of the union of the mutually exclusive events ${\displaystyle {\text{Head}}}$ and ${\displaystyle {\text{Tail}}}$ in the random experiment of one coin toss, ${\displaystyle P({\text{Head}}\cup {\text{Tail}})}$, is the sum of probability for ${\displaystyle {\text{Head}}}$ and the probability for ${\displaystyle {\text{Tail}}}$, ${\displaystyle P({\text{Head}})+P({\text{Tail}})}$. Second, the probability of the sample space ${\displaystyle \Omega }$ must be equal to 1 (which accounts for the fact that, given an execution of the model, some outcome must occur). In the previous example the probability of the set of outcomes ${\displaystyle P(\{{\text{Head}},{\text{Tail}}\})}$ must be equal to one, because it is entirely certain that the outcome will be either ${\displaystyle {\text{Head}}}$ or ${\displaystyle {\text{Tail}}}$ (the model neglects any other possibility) in a single coin toss.

Not every subset of the sample space ${\displaystyle \Omega }$ must necessarily be considered an event: some of the subsets are simply not of interest, others cannot be "measured". This is not so obvious in a case like a coin toss. In a different example, one could consider javelin throw lengths, where the events typically are intervals like "between 60 and 65 meters" and unions of such intervals, but not sets like the "irrational numbers between 60 and 65 meters".

In short, a probability space is a measure space such that the measure of the whole space is equal to one.

The expanded definition is the following: a probability space is a triple ${\displaystyle (\Omega ,{\mathcal {F}},P)}$ consisting of:

• the sample space ${\displaystyle \Omega }$ – an arbitrary non-empty set,
• the σ-algebra ${\displaystyle {\mathcal {F}}\subseteq 2^{\Omega }}$ (also called σ-field) – a set of subsets of ${\displaystyle \Omega }$, called events, such that:
  • ${\displaystyle {\mathcal {F}}}$ contains the sample space: ${\displaystyle \Omega \in {\mathcal {F}}}$,
  • ${\displaystyle {\mathcal {F}}}$ is closed under complements: if ${\displaystyle A\in {\mathcal {F}}}$, then also ${\displaystyle (\Omega \setminus A)\in {\mathcal {F}}}$,
  • ${\displaystyle {\mathcal {F}}}$ is closed under countable unions: if ${\displaystyle A_{i}\in {\mathcal {F}}}$ for ${\displaystyle i=1,2,\dots }$, then also ${\textstyle (\bigcup _{i=1}^{\infty }A_{i})\in {\mathcal {F}}}$
    • The corollary from the previous two properties and De Morgan's law is that ${\displaystyle {\mathcal {F}}}$ is also closed under countable intersections: if ${\displaystyle A_{i}\in {\mathcal {F}}}$ for ${\displaystyle i=1,2,\dots }$, then also ${\textstyle (\bigcap _{i=1}^{\infty }A_{i})\in {\mathcal {F}}}$
• the probability measure ${\displaystyle P:{\mathcal {F}}\to [0,1]}$ – a function on ${\displaystyle {\mathcal {F}}}$ such that:
  • P is countably additive (also called σ-additive): if ${\displaystyle \{A_{i}\}_{i=1}^{\infty }\subseteq {\mathcal {F}}}$ is a countable collection of pairwise disjoint sets, then ${\textstyle P(\bigcup _{i=1}^{\infty }A_{i})=\sum _{i=1}^{\infty }P(A_{i}),}$
  • the measure of the entire sample space is equal to one: ${\displaystyle P(\Omega )=1}$.

Discrete probability theory needs only at most countable sample spaces ${\displaystyle \Omega }$. Probabilities can be ascribed to points of ${\displaystyle \Omega }$ by the probability mass function ${\displaystyle p:\Omega \to [0,1]}$ such that ${\textstyle \sum _{\omega \in \Omega }p(\omega )=1}$. All subsets of ${\displaystyle \Omega }$ can be treated as events (thus, ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ is the power set). The probability measure takes the simple form

$${\displaystyle P(A)=\sum _{\omega \in A}p(\omega )\quad {\text{for all }}A\subseteq \Omega .}$$

⁎

The greatest σ-algebra ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ describes the complete information. In general, a σ-algebra ${\displaystyle {\mathcal {F}}\subseteq 2^{\Omega }}$ corresponds to a finite or countable partition ${\displaystyle \Omega =B_{1}\cup B_{2}\cup \dots }$, the general form of an event ${\displaystyle A\in {\mathcal {F}}}$ being ${\displaystyle A=B_{k_{1}}\cup B_{k_{2}}\cup \dots }$. See also the examples.

The case ${\displaystyle p(\omega )=0}$ is permitted by the definition, but rarely used, since such ${\displaystyle \omega }$ can safely be excluded from the sample space.

If Ω is uncountable, still, it may happen that P(ω) ≠ 0 for some ω; such ω are called atoms. They are an at most countable (maybe empty) set, whose probability is the sum of probabilities of all atoms. If this sum is equal to 1 then all other points can safely be excluded from the sample space, returning us to the discrete case. Otherwise, if the sum of probabilities of all atoms is between 0 and 1, then the probability space decomposes into a discrete (atomic) part (maybe empty) and a non-atomic part.

If P(ω) = 0 for all ω ∈ Ω (in this case, Ω must be uncountable, because otherwise P(Ω) = 1 could not be satisfied), then equation (⁎) fails: the probability of a set is not necessarily the sum over the probabilities of its elements, as summation is only defined for countable numbers of elements. This makes the probability space theory much more technical. A formulation stronger than summation, measure theory is applicable. Initially the probabilities are ascribed to some "generator" sets (see the examples). Then a limiting procedure allows assigning probabilities to sets that are limits of sequences of generator sets, or limits of limits, and so on. All these sets are the σ-algebra ${\displaystyle {\mathcal {F}}}$. For technical details see Carathéodory's extension theorem. Sets belonging to ${\displaystyle {\mathcal {F}}}$ are called measurable. In general they are much more complicated than generator sets, but much better than non-measurable sets.

A probability space ${\displaystyle (\Omega ,\;{\mathcal {F}},\;P)}$ is said to be a complete probability space if for all ${\displaystyle B\in {\mathcal {F}}}$ with ${\displaystyle P(B)=0}$ and all ${\displaystyle A\;\subset \;B}$ one has ${\displaystyle A\in {\mathcal {F}}}$. Often, the study of probability spaces is restricted to complete probability spaces.

If the experiment consists of just one flip of a fair coin, then the outcome is either heads or tails: ${\displaystyle \Omega =\{{\text{H}},{\text{T}}\}}$. The σ-algebra ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ contains ${\displaystyle 2^{2}=4}$ events, namely: ${\displaystyle \{{\text{H}}\}}$ ("heads"), ${\displaystyle \{{\text{T}}\}}$ ("tails"), ${\displaystyle \{\}}$ ("neither heads nor tails"), and ${\displaystyle \{{\text{H}},{\text{T}}\}}$ ("either heads or tails"); in other words, ${\displaystyle {\mathcal {F}}=\{\{\},\{{\text{H}}\},\{{\text{T}}\},\{{\text{H}},{\text{T}}\}\}}$. There is a fifty percent chance of tossing heads and fifty percent for tails, so the probability measure in this example is ${\displaystyle P(\{\})=0}$, ${\displaystyle P(\{{\text{H}}\})=0.5}$, ${\displaystyle P(\{{\text{T}}\})=0.5}$, ${\displaystyle P(\{{\text{H}},{\text{T}}\})=1}$.

The fair coin is tossed three times. There are 8 possible outcomes: Ω = {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT} (here "HTH" for example means that first time the coin landed heads, the second time tails, and the last time heads again). The complete information is described by the σ-algebra ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ of 2⁸ = 256 events, where each of the events is a subset of Ω.

Alice knows the outcome of the second toss only. Thus her incomplete information is described by the partition Ω = A₁ ⊔ A₂ = {HHH, HHT, THH, THT} ⊔ {HTH, HTT, TTH, TTT}, where ⊔ is the disjoint union, and the corresponding σ-algebra ${\displaystyle {\mathcal {F}}_{\text{Alice}}=\{\{\},A_{1},A_{2},\Omega \}}$. Bryan knows only the total number of tails. His partition contains four parts: Ω = B₀ ⊔ B₁ ⊔ B₂ ⊔ B₃ = {HHH} ⊔ {HHT, HTH, THH} ⊔ {TTH, THT, HTT} ⊔ {TTT}; accordingly, his σ-algebra ${\displaystyle {\mathcal {F}}_{\text{Bryan}}}$ contains 2⁴ = 16 events.

The two σ-algebras are incomparable: neither ${\displaystyle {\mathcal {F}}_{\text{Alice}}\subseteq {\mathcal {F}}_{\text{Bryan}}}$ nor ${\displaystyle {\mathcal {F}}_{\text{Bryan}}\subseteq {\mathcal {F}}_{\text{Alice}}}$; both are sub-σ-algebras of 2^Ω.

If 100 voters are to be drawn randomly from among all voters in California and asked whom they will vote for governor, then the set of all sequences of 100 Californian voters would be the sample space Ω. We assume that sampling without replacement is used: only sequences of 100 different voters are allowed. For simplicity an ordered sample is considered, that is a sequence (Alice, Bryan) is different from (Bryan, Alice). We also take for granted that each potential voter knows exactly his/her future choice, that is he/she does not choose randomly.

Alice knows only whether or not Arnold Schwarzenegger has received at least 60 votes. Her incomplete information is described by the σ-algebra ${\displaystyle {\mathcal {F}}_{\text{Alice}}}$ that contains: (1) the set of all sequences in Ω where at least 60 people vote for Schwarzenegger; (2) the set of all sequences where fewer than 60 vote for Schwarzenegger; (3) the whole sample space Ω; and (4) the empty set ∅.

Bryan knows the exact number of voters who are going to vote for Schwarzenegger. His incomplete information is described by the corresponding partition Ω = B₀ ⊔ B₁ ⊔ ⋯ ⊔ B₁₀₀ and the σ-algebra ${\displaystyle {\mathcal {F}}_{\text{Bryan}}}$ consists of 2¹⁰¹ events.

In this case, Alice's σ-algebra is a subset of Bryan's: ${\displaystyle {\mathcal {F}}_{\text{Alice}}\subset {\mathcal {F}}_{\text{Bryan}}}$. Bryan's σ-algebra is in turn a subset of the much larger "complete information" σ-algebra 2^Ω consisting of 2^{n(n−1)⋯(n−99)} events, where n is the number of all potential voters in California.

A number between 0 and 1 is chosen at random, uniformly. Here Ω = [0,1], ${\displaystyle {\mathcal {F}}}$ is the σ-algebra of Borel sets on Ω, and P is the Lebesgue measure on [0,1].

In this case, the open intervals of the form (a,b), where 0 < a < b < 1, could be taken as the generator sets. Each such set can be ascribed the probability of P((a,b)) = (b − a), which generates the Lebesgue measure on [0,1], and the Borel σ-algebra on Ω.

A fair coin is tossed endlessly. Here one can take Ω = {0,1}^∞, the set of all infinite sequences of numbers 0 and 1. Cylinder sets {(x₁, x₂, ...) ∈ Ω : x₁ = a₁, ..., x_n = a_n} may be used as the generator sets. Each such set describes an event in which the first n tosses have resulted in a fixed sequence (a₁, ..., a_n), and the rest of the sequence may be arbitrary. Each such event can be naturally given the probability of 2⁻ⁿ.

These two non-atomic examples are closely related: a sequence (x₁, x₂, ...) ∈ {0,1}^∞ leads to the number 2⁻¹x₁ + 2⁻²x₂ + ⋯ ∈ [0,1]. This is not a one-to-one correspondence between {0,1}^∞ and [0,1] however: it is an isomorphism modulo zero, which allows for treating the two probability spaces as two forms of the same probability space. In fact, all non-pathological non-atomic probability spaces are the same in this sense. They are so-called standard probability spaces. Basic applications of probability spaces are insensitive to standardness. However, non-discrete conditioning is easy and natural on standard probability spaces, otherwise it becomes obscure.

A random variable X is a measurable function X: Ω → S from the sample space Ω to another measurable space S called the state space.

If A ⊂ S, the notation Pr(X ∈ A) is a commonly used shorthand for ${\displaystyle P(\{\omega \in \Omega :X(\omega )\in A\})}$.

If Ω is countable, we almost always define ${\displaystyle {\mathcal {F}}}$ as the power set of Ω, i.e. ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ which is trivially a σ-algebra and the biggest one we can create using Ω. We can therefore omit ${\displaystyle {\mathcal {F}}}$ and just write (Ω,P) to define the probability space.

On the other hand, if Ω is uncountable and we use ${\displaystyle {\mathcal {F}}=2^{\Omega }}$ we get into trouble defining our probability measure P because ${\displaystyle {\mathcal {F}}}$ is too "large", i.e. there will often be sets to which it will be impossible to assign a unique measure. In this case, we have to use a smaller σ-algebra ${\displaystyle {\mathcal {F}}}$, for example the Borel algebra of Ω, which is the smallest σ-algebra that makes all open sets measurable.

Kolmogorov's definition of probability spaces gives rise to the natural concept of conditional probability. Every set A with non-zero probability (that is, P(A) > 0) defines another probability measure $${\displaystyle P(B\mid A)={P(B\cap A) \over P(A)}}$$ on the space. This is usually pronounced as the "probability of B given A".

For any event A such that P(A) > 0, the function Q defined by Q(B) = P(B | A) for all events B is itself a probability measure.

Two events, A and B are said to be independent if P(A ∩ B) = P(A) P(B).

Two random variables, X and Y, are said to be independent if any event defined in terms of X is independent of any event defined in terms of Y. Formally, they generate independent σ-algebras, where two σ-algebras G and H, which are subsets of F are said to be independent if any element of G is independent of any element of H.

Two events, A and B are said to be mutually exclusive or disjoint if the occurrence of one implies the non-occurrence of the other, i.e., their intersection is empty. This is a stronger condition than the probability of their intersection being zero.

If A and B are disjoint events, then P(A ∪ B) = P(A) + P(B). This extends to a (finite or countably infinite) sequence of events. However, the probability of the union of an uncountable set of events is not the sum of their probabilities. For example, if Z is a normally distributed random variable, then P(Z = x) is 0 for any x, but P(Z ∈ R) = 1.

The event A ∩ B is referred to as "A and B", and the event A ∪ B as "A or B".

• Space (mathematics)
• Measure space
• Fuzzy measure theory
• Filtered probability space
• Talagrand's concentration inequality

• Pierre Simon de Laplace (1812) Analytical Theory of Probability

The first major treatise blending calculus with probability theory, originally in French: Théorie Analytique des Probabilités.

• Andrei Nikolajevich Kolmogorov (1950) Foundations of the Theory of Probability

The modern measure-theoretic foundation of probability theory; the original German version (Grundbegriffe der Wahrscheinlichkeitrechnung) appeared in 1933.

• Harold Jeffreys (1939) The Theory of Probability

An empiricist, Bayesian approach to the foundations of probability theory.

• Edward Nelson (1987) Radically Elementary Probability Theory

Foundations of probability theory based on nonstandard analysis. Downloadable. http://www.math.princeton.edu/~nelson/books.html

• Patrick Billingsley: Probability and Measure, John Wiley and Sons, New York, Toronto, London, 1979.
• Henk Tijms (2004) Understanding Probability

A lively introduction to probability theory for the beginner, Cambridge Univ. Press.

• David Williams (1991) Probability with martingales

An undergraduate introduction to measure-theoretic probability, Cambridge Univ. Press.

• Gut, Allan (2005). Probability: A Graduate Course. Springer. ISBN 0-387-22833-0.

• Sazonov, V.V. (2001) [1994], "Probability space", Encyclopedia of Mathematics, EMS Press
• Animation demonstrating probability space of dice
• Virtual Laboratories in Probability and Statistics (principal author Kyle Siegrist), especially, Probability Spaces
• Citizendium
• Complete probability space
• Weisstein, Eric W. "Probability space". MathWorld.