Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Kolmogorov construction of the canonical Gaussian process

Statement

Assume the Axiom of Choice. There is a probability measure on the cylinder sigma-algebra of R[0,) under which the coordinate process Xt(x)=x(t) is centered Gaussian and E[XsXt]=min(s,t)(s,t0). This construction alone asserts neither continuous sample paths nor that the coordinate process is Brownian motion.

Facts & Assumptions

Given: The Axiom of Choice and the Brownian Gaussian finite-dimensional laws.

[F1]

The centered Gaussian laws with covariance min(ti,tj) are well-defined and consistent under finite coordinate restriction. Consistency of Brownian finite-dimensional laws

[F2]

Assume AC. A consistent family on arbitrary standard-Borel coordinate spaces has a unique extension to the cylinder sigma-algebra. Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces

[F3]

Under that extension measure, the coordinate process realizes precisely the prescribed finite-dimensional distributions. The canonical coordinate process realizes consistent finite-dimensional laws

[F4]

A process is Gaussian exactly when every finite evaluation vector has a possibly singular multivariate normal law. Gaussian process

Proof

technique · direct
1.1

By [F5], the usual real line is complete and has the countable dense subset Q, hence is Polish; its Borel measurable space is therefore standard Borel via the identity presentation. This verifies, rather than merely assumes, the coordinate-space hypothesis of [F2].

F2F5
2.1

For every finite F[0,), use [F1] to put on RF the centered Gaussian law with covariance (min(s,t))s,tF; step 1.1 and [F2] give a probability P on the cylinder sigma-algebra of R[0,) with exactly those marginals. The empty marginal has mass one on the singleton empty product.

step 1.1F1F2
3.1

Let Xt(x)=x(t). By [F3], every finite evaluation vector of X has the prescribed centered Gaussian law. Thus [F4] makes X Gaussian, and its one- and two-coordinate marginals give E[Xt]=0 and E[XsXt]=min(s,t), including X0=0 almost surely because its variance is zero.

step 2.1F3F4
4.1

The conclusion of [F2] is only a measure on the cylinder sigma-algebra realizing finite-coordinate laws; neither [F2] nor [F3] supplies a common full-measure set on which tXt(x) is continuous. Consequently step 3.1 does not establish the path-continuity clause needed for Brownian motion. AC is used in [F1]–[F2] and the Gaussian interface [F4], including the choices inside arbitrary-index Kolmogorov extension; no stronger regularity is inferred from it.

step 3.1F1F2F3F4

Source notes

Durrett, Section 7.1, Theorem 7.1.1 and the discussion immediately after it (printed pp. 355–356), separates the finite-dimensional Kolmogorov construction from the subsequent continuity theorem. Sousi, Section 6.2, makes the same separation before Theorem 6.4.

Depends on

Used by

Dependency tree · two levels

70 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources