Wrapping (graphics)

2010-09-26T15:18:05Z

78.234.56.78: Undid revision 387002332 by 78.234.56.78 (talk)

In [[mathematics]], the '''Kolmogorov extension theorem''' or '''Daniell-Kolmogorov extension theorem''' (also known as '''Kolmogorov existence theorem''' or '''Kolmogorov consistency theorem''') is a [[theorem]] that guarantees that a suitably "consistent" collection of [[finite-dimensional distribution]]s will define a [[stochastic process]]. It is credited to the [[Soviet Union|Soviet]] [[mathematician]] [[Andrey Kolmogorov|Andrey Nikolaevich Kolmogorov]]<ref>{{cite book | author=Øksendal, Bernt | title=Stochastic Differential Equations: An Introduction with Applications | publisher=Springer, Berlin | year=2003 | isbn=3-540-04758-1}}</ref> and also to [[United Kingdom|British]] mathematician [[Percy John Daniell]] who discovered it independently in the slightly different setting of integration theory. <ref>J. Aldrich, But you have to remember PJ Daniell of Sheffield, Electronic Journal for History of Probability and Statistics, Vol. 3, number 2, 2007 </ref>

==Statement of the theorem==

Let <math>T</math> denote some [[Interval (mathematics)|interval]] (thought of as "[[time]]"), and let <math>n \in \mathbb{N}</math>. For each <math>k \in \mathbb{N}</math> and finite [[sequence]] of times <math>t_{1}, \dots, t_{k} \in T</math>, let <math>\nu_{t_{1} \dots t_{k}}</math> be a [[probability measure]] on <math>(\mathbb{R}^{n})^{k}</math>. Suppose that these measures satisfy two consistency conditions:

1. for all [[permutation]]s <math>\pi</math> of <math>\{ 1, \dots, k \}</math> and measurable sets <math>F_{i} \subseteq \mathbb{R}^{n}</math>,
:<math>\nu_{t_{\pi (1)} \dots t_{\pi (k)}} \left( F_{\pi (1)} \times \dots \times F_{ \pi(k)} \right) = \nu_{t_{1} \dots t_{k}} \left( F_{1} \times \dots \times F_{k} \right);</math>

2. for all measurable sets <math>F_{i} \subseteq \mathbb{R}^{n}</math>,<math>m \in \mathbb{N}</math>
:<math>\nu_{t_{1} \dots t_{k}} \left( F_{1} \times \dots \times F_{k} \right) = \nu_{t_{1} \dots t_{k} t_{k + 1}, \dots , t_{k+m}} \left( F_{1} \times \dots \times F_{k} \times \mathbb{R}^{n} \times \dots \times \mathbb{R}^{n} \right).</math>
Then there exists a [[probability space]] <math>(\Omega, \mathcal{F}, \mathbb{P})</math> and a stochastic process <math>X : T \times \Omega \to \mathbb{R}^{n}</math> such that
:<math>\nu_{t_{1} \dots t_{k}} \left( F_{1} \times \dots \times F_{k} \right) = \mathbb{P} \left( X_{t_{1}} \in F_{1}, \dots, X_{t_{k}} \in F_{k} \right)</math>
for all <math>t_{i} \in T</math>, <math>k \in \mathbb{N}</math> and measurable sets <math>F_{i} \subseteq \mathbb{R}^{n}</math>, i.e. <math>X</math> has <math>\nu_{t_{1} \dots t_{k}}</math> as its finite-dimensional distributions relative to times <math>t_{1} \dots t_{k}</math>.

In fact, it is always possible to take as the underlying probability space <math>\Omega = (\mathbb{R}^n)^T</math> and to take for <math>X</math> the canonical process <math>X\colon (t,Y) \mapsto Y_t</math>. Therefore, an alternative way of stating Kolomogorov's extension theorem is that, provided that the above consistency conditions hold, there exists a (unique) measure <math>\nu</math> on <math>(\mathbb{R}^n)^T</math> with marginals <math>\nu_{t_{1} \dots t_{k}}</math> for any finite collection of times <math>t_{1} \dots t_{k}</math>. The remarkable feature of Kolmogorov's extension theorem is that it does not require <math>T</math> to be countable, but the price to pay
for this level of generality is that the measure <math>\nu</math> is only defined on the product [[σ-algebra]] of <math>(\mathbb{R}^n)^T</math>, which is not very rich.

==Explanation of the conditions==

The two conditions required by the theorem are trivially satisfied by any stochastic process. For example, consider a real-valued discrete-time stochastic process <math>X</math>. Then the probability <math>\mathbb{P}(X_1 >0, X_2<0)</math> can be computed either as <math>\nu_{1,2}( \mathbb{R}_+ , \mathbb{R}_-)</math> or as <math>\nu_{2,1}( \mathbb{R}_- , \mathbb{R}_+)</math>. Hence, for the finite-dimensional distributions to be consistent, it must hold that
<math>\nu_{1,2}( \mathbb{R}_+ , \mathbb{R}_-) = \nu_{2,1}( \mathbb{R}_- , \mathbb{R}_+)</math>.
The first condition generalises this obvious statement to hold for any number of time points <math>t_i</math>, and any control sets <math>F_i</math>.

Continuing the example, the second condition implies that <math>\mathbb{P}(X_1>0) = \mathbb{P}(X_1>0, X_2 \in \mathbb{R})</math>. Also this is a trivial statement that must be satisfied for any consistent family of finite-dimensional distributions.

==Implications of the theorem==

Since the two conditions are trivially satisfied for any stochastic process, the powerful statement of the theorem is that no other conditions are required: For any reasonable (i.e., consistent) family of finite-dimensional distributions, there exists a stochastic process with these distributions.

The measure-theoretic approach to stochastic processes starts with a probability space and defines a stochastic process as a family of functions on this probability space. However, in many applications the starting point is really the finite-dimensional distributions ("statistics") of the stochastic process. The theorem says that provided the finite-dimensional distributions satisfy the obvious consistency requirements, one can always identify a probability space to match the purpose. In many situations, this means that one does not have to be explicit about what the probability space is. Many texts on stochastic processes do, indeed, assume a probability space but never state explicitly what it is.

==References==

{{reflist}}

==External links==

Aldrich, J. (2007) [http://www.emis.de/journals/JEHPS/Decembre2007/Aldrich.pdf "But you have to remember P.J.Daniell of Sheffield"] [http://www.emis.de/journals/JEHPS/indexang.html Electronic Journ@l for History of Probability and Statistics] December 2007.

[[Category:Stochastic processes]]
[[Category:Probability theorems]]

formulasearchengine - User contributions [en]

Wrapping (graphics)