Probability space
Part of a series on statistics 
Probability theory 

In probability theory, a probability space or a probability triple [math]\displaystyle{ (\Omega, \mathcal{F}, P) }[/math] 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]}
 A sample space, [math]\displaystyle{ \Omega }[/math], which is the set of all possible outcomes.
 An event space, which is a set of events, [math]\displaystyle{ \mathcal{F} }[/math], an event being a set of outcomes in the sample space.
 A probability function, [math]\displaystyle{ P }[/math], which assigns each event in the event space a probability, which is a number between 0 and 1.
In order to provide a sensible model of probability, these elements must satisfy a number of axioms, detailed in this article.
In the example of the throw of a standard die, we would take the sample space to be [math]\displaystyle{ \{1, 2, 3, 4, 5, 6\} }[/math]. For the event space, we could simply use the set of all subsets of the sample space, which would then contain simple events such as [math]\displaystyle{ \{5\} }[/math] ("the die lands on 5"), as well as complex events such as [math]\displaystyle{ \{2, 4, 6\} }[/math] ("the die lands on an even number"). Finally, for the probability function, we would map each event to the number of outcomes in that event divided by 6 – so for example, [math]\displaystyle{ \{5\} }[/math] would be mapped to [math]\displaystyle{ 1/6 }[/math], and [math]\displaystyle{ \{2, 4, 6\} }[/math] would be mapped to [math]\displaystyle{ 3/6 = 1/2 }[/math].
When an experiment is conducted, we imagine that "nature" "selects" a single outcome, [math]\displaystyle{ \omega }[/math], from the sample space [math]\displaystyle{ \Omega }[/math]. All the events in the event space [math]\displaystyle{ \mathcal{F} }[/math] that contain the selected outcome [math]\displaystyle{ \omega }[/math] are said to "have occurred". This "selection" happens in such a way that if the experiment were repeated many times, the number of occurrences of each event, as a fraction of the total number of experiments, would most likely tend towards the probability assigned to that event by the probability function [math]\displaystyle{ P }[/math].
The Soviet mathematician Andrey Kolmogorov introduced the notion of probability space, together with other axioms of probability, in the 1930s. In modern probability theory there are a number of alternative approaches for axiomatization – for example, algebra of random variables.
Introduction
A probability space is a mathematical triplet [math]\displaystyle{ (\Omega, \mathcal{F}, P) }[/math] that presents a model for a particular class of realworld situations. As with other models, its author ultimately defines which elements [math]\displaystyle{ \Omega }[/math], [math]\displaystyle{ \mathcal{F} }[/math], and [math]\displaystyle{ P }[/math] will contain.
 The sample space [math]\displaystyle{ \Omega }[/math] 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 realworld 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 [math]\displaystyle{ \mathcal{F} }[/math] 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 [math]\displaystyle{ P }[/math] is a set function returning an event's probability. A probability is a real number between zero (impossible events have probability zero, though probabilityzero events are not necessarily impossible) and one (the event happens almost surely, with almost total certainty). Thus [math]\displaystyle{ P }[/math] is a function [math]\displaystyle{ P : \mathcal{F} \to [0,1]. }[/math] 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 [math]\displaystyle{ \text{Head} }[/math] and [math]\displaystyle{ \text{Tail} }[/math] in the random experiment of one coin toss, [math]\displaystyle{ P(\text{Head}\cup\text{Tail}) }[/math], is the sum of probability for [math]\displaystyle{ \text{Head} }[/math] and the probability for [math]\displaystyle{ \text{Tail} }[/math], [math]\displaystyle{ P(\text{Head}) + P(\text{Tail}) }[/math]. Second, the probability of the sample space [math]\displaystyle{ \Omega }[/math] 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 [math]\displaystyle{ P(\{\text{Head},\text{Tail}\}) }[/math] must be equal to one, because it is entirely certain that the outcome will be either [math]\displaystyle{ \text{Head} }[/math] or [math]\displaystyle{ \text{Tail} }[/math] (the model neglects any other possibility) in a single coin toss.
Not every subset of the sample space [math]\displaystyle{ \Omega }[/math] 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".
Definition
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 [math]\displaystyle{ (\Omega,\mathcal{F},P) }[/math] consisting of:
 the sample space [math]\displaystyle{ \Omega }[/math] – an arbitrary nonempty set,
 the σalgebra [math]\displaystyle{ \mathcal{F} \subseteq 2^\Omega }[/math] (also called σfield) – a set of subsets of [math]\displaystyle{ \Omega }[/math], called events, such that:
 [math]\displaystyle{ \mathcal{F} }[/math] contains the sample space: [math]\displaystyle{ \Omega \in \mathcal{F} }[/math],
 [math]\displaystyle{ \mathcal{F} }[/math] is closed under complements: if [math]\displaystyle{ A\in\mathcal{F} }[/math], then also [math]\displaystyle{ (\Omega\setminus A)\in\mathcal{F} }[/math],
 [math]\displaystyle{ \mathcal{F} }[/math] is closed under countable unions: if [math]\displaystyle{ A_i\in\mathcal{F} }[/math] for [math]\displaystyle{ i=1,2,\dots }[/math], then also [math]\displaystyle{ (\bigcup_{i=1}^\infty A_i)\in\mathcal{F} }[/math]
 The corollary from the previous two properties and De Morgan's law is that [math]\displaystyle{ \mathcal{F} }[/math] is also closed under countable intersections: if [math]\displaystyle{ A_i\in\mathcal{F} }[/math] for [math]\displaystyle{ i = 1,2,\dots }[/math], then also [math]\displaystyle{ (\bigcap_{i=1}^\infty A_i)\in\mathcal{F} }[/math]
 the probability measure [math]\displaystyle{ P:\mathcal{F}\to[0,1] }[/math] – a function on [math]\displaystyle{ \mathcal{F} }[/math] such that:
 P is countably additive (also called σadditive): if [math]\displaystyle{ \{A_i\}_{i=1}^\infty \subseteq \mathcal{F} }[/math] is a countable collection of pairwise disjoint sets, then [math]\displaystyle{ P(\bigcup_{i=1}^\infty A_i)=\sum_{i=1}^\infty P(A_i), }[/math]
 the measure of the entire sample space is equal to one: [math]\displaystyle{ P(\Omega)=1 }[/math].
Discrete case
Discrete probability theory needs only at most countable sample spaces [math]\displaystyle{ \Omega }[/math]. Probabilities can be ascribed to points of [math]\displaystyle{ \Omega }[/math] by the probability mass function [math]\displaystyle{ p:\Omega\to[0,1] }[/math] such that [math]\displaystyle{ \sum_{\omega\in\Omega} p(\omega)=1 }[/math]. All subsets of [math]\displaystyle{ \Omega }[/math] can be treated as events (thus, [math]\displaystyle{ \mathcal{F}=2^\Omega }[/math] is the power set). The probability measure takes the simple form
[math]\displaystyle{ P(A) = \sum_{\omega\in A} p(\omega) \quad \text{for all } A \subseteq \Omega. }[/math] 

( ) 
The greatest σalgebra [math]\displaystyle{ \mathcal{F}=2^\Omega }[/math] describes the complete information. In general, a σalgebra [math]\displaystyle{ \mathcal{F}\subseteq2^\Omega }[/math] corresponds to a finite or countable partition [math]\displaystyle{ \Omega=B_1\cup B_2\cup\dots }[/math], the general form of an event [math]\displaystyle{ A\in\mathcal{F} }[/math] being [math]\displaystyle{ A=B_{k_1}\cup B_{k_2}\cup\dots }[/math]. See also the examples.
The case [math]\displaystyle{ p(\omega)=0 }[/math] is permitted by the definition, but rarely used, since such [math]\displaystyle{ \omega }[/math] can safely be excluded from the sample space.
General case
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 nonatomic part.
Nonatomic case
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 [math]\displaystyle{ \mathcal{F} }[/math]. For technical details see Carathéodory's extension theorem. Sets belonging to [math]\displaystyle{ \mathcal{F} }[/math] are called measurable. In general they are much more complicated than generator sets, but much better than nonmeasurable sets.
Complete probability space
A probability space [math]\displaystyle{ (\Omega,\; \mathcal{F},\; P) }[/math] is said to be a complete probability space if for all [math]\displaystyle{ B \in \mathcal{F} }[/math] with [math]\displaystyle{ P(B) = 0 }[/math] and all [math]\displaystyle{ A\; \subset \;B }[/math] one has [math]\displaystyle{ A \in \mathcal{F} }[/math]. Often, the study of probability spaces is restricted to complete probability spaces.
Examples
Discrete examples
Example 1
If the experiment consists of just one flip of a fair coin, then the outcome is either heads or tails: [math]\displaystyle{ \Omega = \{\text{H}, \text{T}\} }[/math]. The σalgebra [math]\displaystyle{ \mathcal{F} = 2^{\Omega} }[/math] contains [math]\displaystyle{ 2^2 = 4 }[/math] events, namely: [math]\displaystyle{ \{\text{H}\} }[/math] ("heads"), [math]\displaystyle{ \{\text{T}\} }[/math] ("tails"), [math]\displaystyle{ \{\} }[/math] ("neither heads nor tails"), and [math]\displaystyle{ \{\text{H}, \text{T}\} }[/math] ("either heads or tails"); in other words, [math]\displaystyle{ \mathcal{F} = \{\{\}, \{\text{H}\}, \{\text{T}\}, \{\text{H}, \text{T}\}\} }[/math]. There is a fifty percent chance of tossing heads and fifty percent for tails, so the probability measure in this example is [math]\displaystyle{ P(\{\}) = 0 }[/math], [math]\displaystyle{ P(\{\text{H}\}) = 0.5 }[/math], [math]\displaystyle{ P(\{\text{T}\}) = 0.5 }[/math], [math]\displaystyle{ P(\{\text{H}, \text{T}\}) = 1 }[/math].
Example 2
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 [math]\displaystyle{ \mathcal{F} = 2^\Omega }[/math] of 2^{8} = 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_{1} ⊔ A_{2} = {HHH, HHT, THH, THT} ⊔ {HTH, HTT, TTH, TTT}, where ⊔ is the disjoint union, and the corresponding σalgebra [math]\displaystyle{ \mathcal{F}_\text{Alice} = \{\{\}, A_1, A_2, \Omega\} }[/math]. Bryan knows only the total number of tails. His partition contains four parts: Ω = B_{0} ⊔ B_{1} ⊔ B_{2} ⊔ B_{3} = {HHH} ⊔ {HHT, HTH, THH} ⊔ {TTH, THT, HTT} ⊔ {TTT}; accordingly, his σalgebra [math]\displaystyle{ \mathcal{F}_\text{Bryan} }[/math] contains 2^{4} = 16 events.
The two σalgebras are incomparable: neither [math]\displaystyle{ \mathcal{F}_\text{Alice} \subseteq \mathcal{F}_\text{Bryan} }[/math] nor [math]\displaystyle{ \mathcal{F}_\text{Bryan} \subseteq \mathcal{F}_\text{Alice} }[/math]; both are subσalgebras of 2^{Ω}.
Example 3
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 [math]\displaystyle{ \mathcal{F}_\text{Alice} }[/math] 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_{0} ⊔ B_{1} ⊔ ⋯ ⊔ B_{100} and the σalgebra [math]\displaystyle{ \mathcal{F}_\text{Bryan} }[/math] consists of 2^{101} events.
In this case, Alice's σalgebra is a subset of Bryan's: [math]\displaystyle{ \mathcal{F}_\text{Alice} \subset \mathcal{F}_\text{Bryan} }[/math]. 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.
Nonatomic examples
Example 4
A number between 0 and 1 is chosen at random, uniformly. Here Ω = [0,1], [math]\displaystyle{ \mathcal{F} }[/math] 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 Ω.
Example 5
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_{1}, x_{2}, ...) ∈ Ω : x_{1} = a_{1}, ..., 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_{1}, ..., a_{n}), and the rest of the sequence may be arbitrary. Each such event can be naturally given the probability of 2^{−n}.
These two nonatomic examples are closely related: a sequence (x_{1}, x_{2}, ...) ∈ {0,1}^{∞} leads to the number 2^{−1}x_{1} + 2^{−2}x_{2} + ⋯ ∈ [0,1]. This is not a onetoone 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 nonpathological nonatomic probability spaces are the same in this sense. They are socalled standard probability spaces. Basic applications of probability spaces are insensitive to standardness. However, nondiscrete conditioning is easy and natural on standard probability spaces, otherwise it becomes obscure.
Related concepts
Probability distribution
Any probability distribution defines a probability measure.
Random variables
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 [math]\displaystyle{ \Pr(\{\omega \in \Omega: X(\omega) \in A\}) }[/math].
Defining the events in terms of the sample space
If Ω is countable, we almost always define [math]\displaystyle{ \mathcal{F} }[/math] as the power set of Ω, i.e. [math]\displaystyle{ \mathcal{F} = 2^\Omega }[/math] which is trivially a σalgebra and the biggest one we can create using Ω. We can therefore omit [math]\displaystyle{ \mathcal{F} }[/math] and just write (Ω,P) to define the probability space.
On the other hand, if Ω is uncountable and we use [math]\displaystyle{ \mathcal{F} = 2^\Omega }[/math] we get into trouble defining our probability measure P because [math]\displaystyle{ \mathcal{F} }[/math] 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 [math]\displaystyle{ \mathcal{F} }[/math], for example the Borel algebra of Ω, which is the smallest σalgebra that makes all open sets measurable.
Conditional probability
Kolmogorov's definition of probability spaces gives rise to the natural concept of conditional probability. Every set A with nonzero probability (that is, P(A) > 0) defines another probability measure [math]\displaystyle{ P(B \mid A) = {P(B \cap A) \over P(A)} }[/math] 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.
Independence
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.
Mutual exclusivity
Two events, A and B are said to be mutually exclusive or disjoint if the occurrence of one implies the nonoccurrence 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".
See also
 Space (mathematics)
 Measure space
 Fuzzy measure theory
 Filtered probability space
 Talagrand's concentration inequality
References
Bibliography
 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 measuretheoretic 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 measuretheoretic probability, Cambridge Univ. Press.
 Gut, Allan (2005). Probability: A Graduate Course. Springer. ISBN 0387228330.
External links
 Hazewinkel, Michiel, ed. (2001), "Probability space", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 9781556080104, https://www.encyclopediaofmath.org/index.php?title=P/p074960
 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". http://mathworld.wolfram.com/ProbabilitySpace.html.
Original source: https://en.wikipedia.org/wiki/Probability space.
Read more 