Donsker's theorem

Donsker's invariance principle for simple random walk on ${\displaystyle \mathbb {Z} }$.

In probability theory, Donsker's theorem (also known as Donsker's invariance principle, or the functional central limit theorem), named after Monroe D. Donsker, is a functional extension of the central limit theorem.

Let ${\displaystyle X_{1},X_{2},X_{3},\ldots }$ be a sequence of independent and identically distributed (i.i.d.) random variables with mean 0 and variance 1. Let ${\displaystyle S_{n}:=\sum _{i=1}^{n}X_{i}}$. The stochastic process ${\displaystyle S:=(S_{n})_{n\in \mathbb {N} }}$ is known as a random walk. Define the diffusively rescaled random walk (partial-sum process) by

${\displaystyle W^{(n)}(t):={\frac {S_{\lfloor nt\rfloor }}{\sqrt {n}}},\qquad t\in [0,1].}$

The central limit theorem asserts that ${\displaystyle W^{(n)}(1)}$ converges in distribution to a standard Gaussian random variable ${\displaystyle W(1)}$ as ${\displaystyle n\to \infty }$. Donsker's invariance principle^[1][2] extends this convergence to the whole function ${\displaystyle W^{(n)}:=(W^{(n)}(t))_{t\in [0,1]}}$. More precisely, in its modern form, Donsker's invariance principle states that: As random variables taking values in the Skorokhod space ${\displaystyle {\mathcal {D}}[0,1]}$, the random function ${\displaystyle W^{(n)}}$ converges in distribution to a standard Brownian motion ${\displaystyle W:=(W(t))_{t\in [0,1]}}$ as ${\displaystyle n\to \infty .}$

History[]

Let F_n be the empirical distribution function of the sequence of i.i.d. random variables ${\displaystyle X_{1},X_{2},X_{3},\ldots }$ with distribution function F. Define the centered and scaled version of F_n by

${\displaystyle G_{n}(x)={\sqrt {n}}(F_{n}(x)-F(x))}$

indexed by x ∈ R. By the classical central limit theorem, for fixed x, the random variable G_n(x) converges in distribution to a Gaussian (normal) random variable G(x) with zero mean and variance F(x)(1 − F(x)) as the sample size n grows.

Theorem (Donsker, Skorokhod, Kolmogorov) The sequence of G_n(x), as random elements of the Skorokhod space ${\displaystyle {\mathcal {D}}(-\infty ,\infty )}$, converges in distribution to a Gaussian process G with zero mean and covariance given by

${\displaystyle \operatorname {cov} [G(s),G(t)]=E[G(s)G(t)]=\min\{F(s),F(t)\}-F(s)}$${\displaystyle {F}(t).}$

The process G(x) can be written as B(F(x)) where B is a standard Brownian bridge on the unit interval.

Kolmogorov (1933) showed that when F is continuous, the supremum ${\displaystyle \scriptstyle \sup _{t}G_{n}(t)}$ and supremum of absolute value, ${\displaystyle \scriptstyle \sup _{t}|G_{n}(t)|}$ converges in distribution to the laws of the same functionals of the Brownian bridge B(t), see the Kolmogorov–Smirnov test. In 1949 Doob asked whether the convergence in distribution held for more general functionals, thus formulating a problem of weak convergence of random functions in a suitable function space.^[3]

In 1952 Donsker stated and proved (not quite correctly)^[4] a general extension for the Doob–Kolmogorov heuristic approach. In the original paper, Donsker proved that the convergence in law of G_n to the Brownian bridge holds for Uniform[0,1] distributions with respect to uniform convergence in t over the interval [0,1].^[2]

However Donsker's formulation was not quite correct because of the problem of measurability of the functionals of discontinuous processes. In 1956 Skorokhod and Kolmogorov defined a separable metric d, called the Skorokhod metric, on the space of càdlàg functions on [0,1], such that convergence for d to a continuous function is equivalent to convergence for the sup norm, and showed that G_n converges in law in ${\displaystyle {\mathcal {D}}[0,1]}$ to the Brownian bridge.

Later Dudley reformulated Donsker's result to avoid the problem of measurability and the need of the Skorokhod metric. One can prove^[4] that there exist X_i, iid uniform in [0,1] and a sequence of sample-continuous Brownian bridges B_n, such that

${\displaystyle \|G_{n}-B_{n}\|_{\infty }}$

is measurable and converges in probability to 0. An improved version of this result, providing more detail on the rate of convergence, is the Komlós–Major–Tusnády approximation.

See also[]

• Glivenko–Cantelli theorem
• Kolmogorov–Smirnov test

References[]