Wiener measure and Donsker’s theorem
1 Relatively compact sets of Borel probability measures on C[0,1]
Let , let be the Borel -algebra of , and let be the collection of Borel probability measures on . We assign the narrow topology, the coarsest topology on such that for each the map is continuous.
For and we define
For , as , and for , is continuous. We shall use the following characterization of a relatively compact subset of , which is proved using the Arzelà-Ascoli theorem.
Lemma 1.
Let be a subset of . is compact if and only if
and
We shall use Prokhorov’s theorem:11 1 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 47, Chapter II, Theorem 6.7. for a Polish space and for , is compact if and only if for each there is a compact subset of such that for all . Namely, a subset of is relatively compact if and only if it is tight. We use Prokhorov’s theorem to prove a characterization of relatively compact subsets of , which we then use to prove the characterization in Theorem 3.22 2 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 213, Chapter VII, Lemma 2.2.
Lemma 2.
Let be a subset of . is compact if and only if for each there is some and a function satisfying as and such that for all ,
where
Proof.
Suppose that satisfies the above conditions. Because is continuous, is closed. For , suppose that is a sequence in tending to some . Because is continuous, , and because for each , we get and hence , showing that is closed. Therefore is closed, i.e. . The set satisfies
and
thus by Lemma 1, is compact. For ,
and because is compact, this means that is tight, so by Prokhorov’s theorem, is relatively compact.
Now suppose that is relatively compact and let . By Prokhorov’s theorem, there is a compact set in such that for all . Define
Because is compact, by Lemma 1 we get that and as . For ,
showing that satisfies the conditions of the theorem. ∎
We now prove the characterization of relatively compact subsets of that we shall use in our proof of Donsker’s theorem.33 3 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 214, Chapter VII, Theorem 2.2.
Theorem 3 (Relatively compact sets in ).
Let be a subset of . is compact if and only if the following conditions are satisfied:
-
1.
For each there is some such that
-
2.
For each and there is some such that
Proof.
Suppose that is compact and let . By Lemma 2, there is some and a function satisfying as and
For , there is some with . Then for ,
Now suppose that the conditions of the theorem hold. For each and there is some such that
where
Let
for which
For , then for each we have , which means that , and therefore
Thus for , if then
which shows as . Then because
applying Lemma 1 we get that is compact. The map is continuous, so the set is closed, and therefore the set is closed. Because is compact and for all , it follows from by Prokhorov’s theorem that is relatively compact. ∎
2 Wiener measure
For , , define by
which is continuous. We state the following results, which we will use later.44 4 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 212, Chapter VII, Theorem 2.1.
Theorem 4 (The Borel -algebra of ).
is equal to the -algebra generated by .
Two elements and of are equal if and only if for any and any , the pushforward measures
are equal.
Let be a stochastic process with state space and sample space . For , let and let : for ,
is a Borel probability measure on and is called a finite-dimensional distribution of the stochastic process.
The Kolmogorov continuity theorem55 5 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 216, Chapter VII, Theorem 3.1 tells us that if there are such that for all ,
then there is a unique such that for all and for all ,
We now define and prove the existence of Wiener measure.66 6 K. R. Parthasarathy, Probability Measures on Metric Spaces, p. 218, Chapter VII, Theorem 3.2.
Theorem 5 (Wiener measure).
There is a unique Borel probability measure on satisfying:
-
1.
.
-
2.
For the random variables
are independent .
-
3.
If , the random variable is normal with mean and variance .
Proof.
There is a stochastic process with state space and some sample space , such that (i) , (ii) has independent increments, and (iii) for , is a normal random variable with mean and variance . (Namely, Brownian motion with starting point .) Because has mean and variance , we calculate (cf. Isserlis’s theorem)
Thus using the Kolmogorov continuity theorem with , , , there is a unique such that for all ,
i.e. for ,
For and , with defined by ,
Hence, because are independent,
which means that the random variables are independent.
If and , and for defined by ,
which implies that , and because is a normal random variable with mean and variance , so is .
Finally,
∎
is a probability space, and the stochastic process is a Brownian motion.
3 Interpolation and continuous stochastic processes
Let be a continuous stochastic process with state space and sample space . To say that the stochastic process is continuous means that for each the map is continuous . Define by
For and a Borel set in ,
and because is measurable this belongs to . But by Theorem 4, is generated by the collection . Now, for and for a nonempty collection of subsets of ,77 7 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 140, Lemma 4.23.
Therefore , which means that is measurable. This means that a continuous stochastic proess with index set induces a random variable with state space . Then the pushforward measure of by is a Borel probability measure on . We shall end up constructing a sequence of pushforward measures from a sequence of continuous stochastic processes, that converge in to Wiener measure .
Let be a sequence of independent identically distributed random variables on a sample space with and , and let and
Then and . For let
Thus, for and ,
For each , the map is piecewise linear, equal to when , and in particular it is continuous. For , define
(1) |
For ,
For each , is a continuous stochastic process on the sample space , and we denote by the pushforward measure of by .
4 Donsker’s theorem
Lemma 6.
If and are random variables with state space such that in distribution and in distribution, then in distribution.
If are random variables with state space that converge in distribution to some random variable and are real numbers that converge to some real number , then in distribution.
For , let be the Gaussian measure on with mean and variance . The characteristic function of is, for ,
and . One checks that for .
In following theorem and in what follows, is the piecewise linear stochastic process defined in (1). We prove that a sequence of finite-dimensional distributions converge to a Gaussian measure.88 8 Bert Fristedt and Lawrence Gray, A Modern Approach to Probability Theory, p. 368, §19.1, Lemma 1.
Theorem 7.
For , the random vectors
converge in distribution to as .
Proof.
For and let
and for and let
with which
Because ,
Furthermore,
and because this tends to as . Likewise, as .
For ,
By the central limit theorem,
in distribution as . But
as , and , so by Lemma 6,
in distribution as .
For sufficiently large , depending on ,
Check that in probability and that in probability, and hence these random vectors converge to in distribution as . The random variables are independent, and therefore their joint distribution is equal to the product of their distributions. Now, if and as , , then for ,
as , and therefore by Lévy’s continuity theorem, as . This means that the joint distribution of converges to
as . Because in distribution as and in distribution as , applying Lemma 6 we get that
in distribution as , completing the proof. ∎
Let and let . As , the above lemma tells us that
in distribution as . Define by
The function is continuous and satisfies
Then by the continuous mapping theorem,
(2) |
in distribution as .99 9 Allan Gut, Probability: A Graduate Course, second ed., p. 245, Chapter 5, Theorem 10.4.
We prove a result that we use to prove the next lemma, and that lemma is used in the proof of Donsker’s theorem.1010 10 Ioannis Karatzas and Steven E. Shreve, Brownian Motion and Stochastic Calculus, second ed., p. 68, Lemma 4.18.
Lemma 8.
For ,
Proof.
For each , by the central limit theorem,
in distribution as , where . Because as , by Lemma 6 we then get that
in distribution as . Now let , and there is a sequence in such that pointwise as . For each , writing , using the change of variables formula,
Therefore, by the continuous mapping theorem,
Because pointwise as , using the monotone convergence theorem and then using Chebyshev’s inequality,
We have established that for each ,
(3) |
Define
For , it is a fact that
If and then
But by Chebyshev’s inequality and the fact that the random variables are independent with mean and variance ,
so
Therefore,
so
Now using (3) with ,
hence
Dividing both sides by and then taking we obtain the claim. ∎
We prove one more result that we use to prove Donsker’s theorem.1111 11 Ioannis Karatzas and Steven E. Shreve, Brownian Motion and Stochastic Calculus, second ed., p. 69, Lemma 4.19.
Lemma 9.
For and ,
Proof.
For , let , so . Then
so for all it is the case that . Suppose that is such that there are and satisfying
and then let , which satisfies and
Because , either
or
We separate the first case into the cases
and
and we separate the second case into the cases
and
and
It follows that1212 12 This should be worked out more carefully. In Karatzas and Shreve, there is where I have .
For ,
so
Lemma 8 tells us
and because ,
proving the claim. ∎
In the following, denotes the pushforward measure of by , for defined in (1). We now prove Donsker’s theorem.1313 13 Ioannis Karatzas and Steven E. Shreve, Brownian Motion and Stochastic Calculus, second ed., p. 70, Theorem 4.20.
Theorem 10 (Donsker’s theorem).
.