Probability space
≈ 10 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In probability theory, a probability space or a probability triple (\Omega, \mathcal{F}, P) is a mathematical construct that provides a formal model of a random process or experiment. A probability space consists of three elements: # A sample space, \Omega , which is the set of all possible outcomes of a random process under consideration. # An event space, \mathcal{F} , which is a set of events, where an event is a subset of outcomes in the sample space. # A probability function, 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. For example, one can define a probability space which models the throwing of a : # The sample space \Omega is typically the set \{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, 1 represents the outcome that the die lands on 1. # The event space \mathcal{F} could be the set of all subsets of the sample space, which would then contain simple events such as \{5\} ("the die lands on 5"), as well as complex events such as \{2, 4, 6\} ("the die lands on an even number").…
In probability theory, a probability space or a probability triple (\Omega, \mathcal{F}, P) is a mathematical construct that provides a formal model of a random process or experiment. A probability space consists of three elements: A sample space, \Omega , which is the set of all possible outcomes of a random process under consideration. An event space, \mathcal{F} , which is a set of events, where an event is a subset of outcomes in the sample space. A probability function, 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. For example, one can define a probability space which models the throwing of a : The sample space \Omega is typically the set \{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, 1 represents the outcome that the die lands on 1. The event space \mathcal{F} could be the set of all subsets of the sample space, which would then contain simple events such as \{5\} ("the die lands on 5"), as well as complex events such as \{2, 4, 6\} ("the die lands on an even number"). The probability function P would then map each event to the number of outcomes in that event divided by 6 – so for example, \{5\} would be mapped to 1/6 , and \{2, 4, 6\} would be mapped to 3/6 = 1/2 . When an experiment is conducted, it results in exactly one outcome \omega from the sample space \Omega . All the events in the event space \mathcal{F} that contain the selected outcome \omega are said to "have occurred". The probability function 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. \mathcal{F} is closed under countable unions: if A_i\in\mathcal{F} for i=1,2,\dots , then also (\bigcup_{i=1}^\infty A_i)\in\mathcal{F} The corollary from the previous two properties and De Morgan's law is that \mathcal{F} is also closed under countable intersections: if A_i\in\mathcal{F} for i = 1,2,\dots , then also (\bigcap_{i=1}^\infty A_i)\in\mathcal{F} the probability measure P:\mathcal{F}\to[0,1] – a function on \mathcal{F} such that: P is countably additive (also called σ-additive): if \{A_i\}_{i=1}^\infty \subseteq \mathcal{F} is a countable collection of pairwise disjoint sets, then 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: P(\Omega)=1 . For a countable sample space \Omega , probabilities can be ascribed to elements of \Omega by a discrete probability distribution p:\Omega\to[0,1] such that \sum_{\omega\in\Omega} p(\omega)=1, whereby all subsets of \Omega can be treated as events (thus, \mathcal{F}=2^\Omega is the power set) and the probability measure has the form The greatest σ-algebra \mathcal{F}=2^\Omega describes the complete information. In general, a σ-algebra \mathcal{F}\subseteq2^\Omega corresponds to a finite or countable partition \Omega=B_1\cup B_2\cup\dots , the general form of an event A\in\mathcal{F} being A=B_{k_1}\cup B_{k_2}\cup\dots . The case p(\omega)=0 is permitted by the definition, but rarely used, since such \omega can safely be excluded from the sample space. A probability space (\Omega,\; \mathcal{F},\; P) is said to be a complete probability space if for all B \in \mathcal{F} with P(B) = 0 and all A\; \subset \;B one has 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: \Omega = \{\text{H}, \text{T}\} . The σ-algebra \mathcal{F} = 2^{\Omega} contains 2^2 = 4 events, namely: \{\text{H}\} ("heads"), \{\text{T}\} ("tails"), \{\} ("neither heads nor tails"), and \{\text{H}, \text{T}\} ("either heads or tails"); in other words, \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 P(\{\}) = 0 , P(\{\text{H}\}) = 0.5 , P(\{\text{T}\}) = 0.5 , P(\{\text{H}, \text{T}\}) = 1 . The fair coin is tossed three times. There are 8 possible outcomes: (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 \mathcal{F} = 2^\Omega of 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 , where ⊔ is the disjoint union, and the corresponding σ-algebra \mathcal{F}_\text{Alice} = \{\{\}, A_1, A_2, \Omega\} . Bryan knows only the total number of tails. His partition contains four parts: ; accordingly, his σ-algebra \mathcal{F}_\text{Bryan} contains 2 4 = 16 events. The two σ-algebras are incomparable: neither \mathcal{F}_\text{Alice} \subseteq \mathcal{F}_\text{Bryan} nor \mathcal{F}_\text{Bryan} \subseteq \mathcal{F}_\text{Alice} ; both are sub-σ-algebras of 2 Ω . A number between 0 and 1 is chosen at random, uniformly. Here Ω = [0,1], \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 , where , could be taken as the generator sets. Each such set can be ascribed the probability of , 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 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 , and the rest of the sequence may be arbitrary. Each such event can be naturally given the probability of 2 −n . These two non-atomic examples are closely related: a sequence leads to the number . 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. If Ω is countable, we almost always define \mathcal{F} as the power set of Ω, i.e. \mathcal{F} = 2^\Omega which is trivially a σ-algebra and the biggest one we can create using Ω. We can therefore omit \mathcal{F} and just write (Ω,P) to define the probability space. On the other hand, if Ω is uncountable and we use \mathcal{F} = 2^\Omega we get into trouble defining our probability measure P because \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 \mathcal{F} , for example the Borel algebra of Ω, which is the smallest σ-algebra that makes all open sets measurable. 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 such that , the function defined by for all events is itself a probability measure.
External links
Animation demonstrating probability space of dice Virtual Laboratories in Probability and Statistics (principal author Kyle Siegrist), especially, Probability Spaces Citizendium Complete probability space
Text derived from https://en.wikipedia.org/w/index.php?oldid=1358928898 under CC BY-SA 4.0; modifications have been made.