Math 2.0

Probability theory and stochastic processes Limit theorems Theorem

Donsker's theorem

Builds on Independent and identically distributed random variablesConvergence in distributionWiener processContinuous functionRandom walk

Statement

Let X1,X2,…X_1, X_2, \dots be i.i.d. real random variables with E[X1]=0E[X_1] = 0 and σ2=E[X12]∈(0,∞)\sigma^2 = E[X_1^2] \in (0, \infty). Let S0=0S_0 = 0 and Sk=X1+⋯+XkS_k = X_1 + \cdots + X_k. For n≥1n \ge 1 and t∈[0,1]t \in [0, 1], let Wn(t)=1σn(S⌊nt⌋+(nt−⌊nt⌋) X⌊nt⌋+1),W_n(t) = \frac{1}{\sigma \sqrt{n}} \left( S_{\floor{nt}} + (nt - \floor{nt}) \, X_{\floor{nt} + 1} \right), the linear interpolation of the rescaled random walk. Let C[0,1]C[0, 1] be the space of continuous functions on [0,1][0, 1] with the supremum norm. Then WnW_n converges in distribution, as random elements of C[0,1]C[0, 1], to a standard Wiener process (W(t))t∈[0,1](W(t))_{t \in [0, 1]}.

Remarks

The proof has two steps. The central limit theorem, applied to the independent increments, gives the convergence of the finite-dimensional distributions of WnW_n to those of WW. A maximal inequality then shows that the laws of the WnW_n are tight in C[0,1]C[0, 1], and tightness together with convergence of finite-dimensional distributions gives weak convergence.

Example: the supremum map f↦max⁡t∈[0,1]f(t)f \mapsto \max_{t \in [0, 1]} f(t) is continuous on C[0,1]C[0, 1]. By the continuous mapping theorem, max⁡k≤nSk/(σn)\max_{k \le n} S_k / (\sigma \sqrt{n}) converges in distribution to max⁡t≤1W(t)\max_{t \le 1} W(t). By the reflection principle, this limit has the law of ∣W(1)∣\abs{W(1)}. So the limit does not depend on the law of X1X_1, which is why the result is called an invariance principle.

A second form of the theorem concerns the empirical process. If U1,U2,…U_1, U_2, \dots are i.i.d. uniform on [0,1][0, 1] with empirical distribution function FnF_n, then n(Fn(t)−t)\sqrt{n}(F_n(t) - t) converges in distribution to a Brownian bridge, in a suitable space of functions with jumps.

Going deeper

For a student

Donsker's theorem is the functional form of the central limit theorem. With the continuous mapping theorem, it gives the limit laws of functionals of random walks, computed once for Brownian motion. Examples are the maximum, the time spent above zero and the time of the last zero. In statistics, the empirical-process form gives the limit law of the Kolmogorov–Smirnov statistic nsup⁡x∣Fn(x)−F(x)∣\sqrt{n} \sup_x \abs{F_n(x) - F(x)} for a continuous FF.

Reading path

To understand this page from the ground up, read these 6 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. Continuous function concept
  2. Convergence in distribution concept
  3. Independent and identically distributed random variables concept
  4. Random walk concept
  5. Wiener process concept
  6. Donsker's theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Donsker%27s_theorem
About this page
Tag818832PMSV
URIm2://818832PMSV
Kindstatement, theorem
WritingW0 stub
MSC60F17
StatusThis copy of the site has no build data. Run m2 status 818832PMSV.
AboutWiener process, Random walk
UsesIndependent and identically distributed random variables, Convergence in distribution, Wiener process, Continuous function, Random walk
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

Used by