Math 2.0

Probability theory and stochastic processes Independence Theorem

Kolmogorov extension theorem

Builds on Probability measurePolish spaceProduct sigma-algebraPushforward measure

Statement

Let TT be a nonempty index set, and for each t∈Tt \in T let EtE_t be a Polish space with its Borel σ-algebra. For J⊆TJ \subseteq T let EJ=∏t∈JEtE_J = \prod_{t \in J} E_t with the product σ-algebra, and for K⊆JK \subseteq J let πKJ ⁣:EJ→EK\pi^J_K \colon E_J \to E_K be the restriction of coordinates. For each finite nonempty J⊆TJ \subseteq T let μJ\mu_J be a probability measure on EJE_J. Assume the family is consistent: for all finite nonempty K⊆J⊆TK \subseteq J \subseteq T, the pushforward of μJ\mu_J under πKJ\pi^J_K equals μK\mu_K. Then there is a unique probability measure μ\mu on ETE_T such that, for every finite nonempty J⊆TJ \subseteq T, the pushforward of μ\mu under πJT\pi^T_J equals μJ\mu_J.

Remarks

The measure μ\mu is first defined on cylinder sets, where consistency makes it well defined and finitely additive. The key step is countable additivity on the algebra of cylinder sets. It uses inner regularity: each μJ\mu_J is approximated from inside by compact sets, and a decreasing sequence of nonempty compact cylinders has nonempty intersection. Carathéodory's extension theorem then extends μ\mu to the product σ-algebra, and uniqueness holds because cylinder sets form a π-system.

Example: let T=[0,∞)T = [0, \infty), Et=ℝE_t = \R, and let μJ\mu_J be the centred Gaussian measure on ℝJ\R^J with covariance min⁡(s,t)\min(s, t) for s,t∈Js, t \in J. These measures are consistent, so there is a stochastic process (Xt)t≥0(X_t)_{t \ge 0} with these finite-dimensional laws. This is the first step in the construction of Brownian motion; the continuity of paths needs a further argument.

A topological assumption on the factors is needed. For arbitrary measurable spaces in place of Polish spaces, consistent families exist that have no extension. No such assumption is needed when the μJ\mu_J are products, as for the infinite product measure. It is not needed either when they are built from kernels, as in the Ionescu-Tulcea theorem.

Going deeper

For a student

The theorem is the standard existence result for stochastic processes with prescribed finite-dimensional distributions: Gaussian processes, Markov processes from transition functions, and sequences of independent variables. The resulting σ-algebra only contains events that depend on countably many coordinates. So for uncountable TT, sets such as "the path is continuous" are not measurable, and one has to pass to a modification, for instance with the Kolmogorov continuity theorem.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Polish space concept
  2. Probability measure concept
  3. Product sigma-algebra concept
  4. Pushforward measure concept
  5. Kolmogorov extension theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Kolmogorov_extension_theorem
About this page
TagWR4X7MMTH2
URIm2://WR4X7MMTH2
Kindstatement, theorem
WritingW0 stub
MSC60G05, 28A35, 60A10
StatusThis copy of the site has no build data. Run m2 status WR4X7MMTH2.
AboutProbability measure, Stochastic process
UsesProbability measure, Polish space, Product sigma-algebra, Pushforward measure
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.