Martingales, Lévy’s continuity theorem, and the martingale central limit theorem
1 Introduction
In this note, any statement we make about filtrations and martingales is about filtrations and martingales indexed by the positive integers, rather than the nonnegative real numbers.
We take
and for , we take
(Defined rightly, these are not merely convenient ad hoc definitions.)
2 Conditional expectation
Let be a probability space and let be a sub--algebra of . For each , there is some such that (i) is -measurable and (ii) for each , , and if satisfies (i) and (ii) then for almost all .11 1 Manfred Einsiedler and Thomas Ward, Ergodic Theory: with a view towards Number Theory, p. 121, Theorem 5.1. We denote some satisfying (i) and (ii) by , called the conditional expectation of with respect to . In other words, is the unique element of such that for each ,
The map satisfies the following:
-
1.
is positive linear operator with norm .
-
2.
If and , then for almost all ,
-
3.
If is a sub--algebra of , then for almost all ,
-
4.
If then for almost all ,
-
5.
If , then for almost all ,
-
6.
If is independent of , then for almost all ,
3 Filtrations
A filtration of a -algebra is a sequence , , of sub--algebras of such that if . We set .
A sequence of random variables is said to be adapted to the filtration if for each , is -measurable.
Let , , be a sequence of random variables. The natural filtration of corresponding to is
It is apparent that is a filtration and that the sequence is adapted to .
4 Martingales
Let be a filtration of a -algebra and let be a sequence of random variables. We say that is a martingale with respect to if (i) the sequence is adapted to the filtration , (ii) for each , , and (iii) for each , for almost all ,
In particular,
i.e.
We say that is a submartingale with respect to if (i) and (ii) above are true, and if for each , for almost all ,
In particular,
i.e.
We say that is a supermartingale with respect to if (i) and (ii) above are true, and if for each , for almost all ,
In particular,
i.e.
If we speak about a martingale without specifying a filtration, we mean a martingale with respect to the natural filtration corresponding to the sequence of random variables.
5 Stopping times
Let be a filtration of a -algebra . A stopping time with respect to is a function such that for each ,
It is straightforward to check that a function is a stopping time with respect to if and only if for each ,
The following lemma shows that the time of first entry into a Borel subset of of a sequence of random variables adapted to a filtration is a stopping time.22 2 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 55, Exercise 3.9.
Lemma 1.
Let be a sequence of random variables adapted to a filtration and let . Then
is a stopping time with respect to .
Proof.
Let . Then
where
Because the sequence is adapated to the filtration , and , and because is a filtration, the right-hand side of the above belongs to . ∎
If is a sequence of random variables adapted to a filtration and a stopping time with respect to , for we define by
is called the sequence stopped at .33 3 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 55, Exercise 3.10.
Lemma 2.
is a sequence of random variables adapted to the filtration .
Proof.
Let and let . Because
and for any ,
we get
But
and
and therefore
In particular, , namely, is a random variable, and the above shows that this sequence is adapted to the filtration . ∎
We now prove that a stopped martingale is itself a martingale with respect to the same filtration.44 4 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 56, Proposition 3.2.
Theorem 3.
Let be a filtration of a -algebra and let be a stopping time with respect to .
-
1.
If is a submartingale with respect to then so is .
-
2.
If is a supermartingale with respect to then so is .
-
3.
If is a martingale with respect to then so is .
Proof.
For , define
we remark that if and only if and if and only if . For , (i) if then
(ii) if then
(iii) if and then
and (iv) if and then
Therefore .
Set , and we check that
It is apparent from this expression that if is adapted to then is adapted to , and that if each belongs to then each belongs to . As each of is -measurable and is bounded,
(1) |
Suppose that is a submartingale. By (1),
which shows that is a submartingale; the statement that means that for almost all . ∎
We now prove the optional stopping theorem.55 5 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 58, Theorem 3.1.
Theorem 4 (Optional stopping theorem).
Let be a filtration of a -algebra , let be a martingale with respect to , and let be a stopping time with respect to . Suppose that:
-
1.
For almost all , .
-
2.
.
-
3.
as .
Then
Proof.
Suppose that is a sequence of independent random variables each with the Rademacher distribution:
Let and let . Because
we have, as is -measurable and belongs to and as is independent of the -algebra ,
Therefore, is a martingale with respect to .
Let be a positive integer and let
Namely, is the time of first entry in the Borel subset of , hence by Lemma 1 is a stopping time with respect to the filtration . With some work,66 6 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 59, Example 3.7. one shows that (i) as , (ii) , and (iii) as . Then we can apply the optional stopping theorem to the martingale : we get that
Hence
But , so , hence
6 Maximal inequalities
We now prove Doob’s maximal inequality.77 7 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 68, Proposition 4.1.
Theorem 5 (Doob’s maximal inequality).
Suppose that is a filtration of a -algebra , that is a submartingale with respect to , and that for each , . Then for each and ,
Proof.
Define , which is -measurable, and define by
if there is some for which , and otherwise. For ,
and for ,
showing that is a stopping time with respect to the filtration .
For ,
hence, because is a stopping time with respect to the filtration and because is a submartingale with respect to this filtration,
from which we have that the sequence is a submartingale with respect to the filtration . Therefore
and so . Because , this yields
We have
If then , and if then and so . Therefore
Therefore
But , hence
which proves the claim. ∎
The following is Doob’s maximal inequality, which we prove using Doob’s maximal inequality.88 8 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 68, Theorem 4.1.
Theorem 6 (Doob’s maximal inequality).
Suppose that is a filtration of a -algebra and that is a submartingale with respect to such that for each , and . Then for each ,
Proof.
Define . It is a fact that if and then
Using this, Doob’s maximal inequality, Fubini’s theorem, and the Cauchy-Schwarz inequality,
If the claim is immediate. Otherwise, we divide this inequality by and obtain
and so
proving the claim. ∎
7 Upcrossings
Suppose that is a sequence of random variables that is adapted to a filtration and let be real numbers. Define
and by induction for ,
and
where . For each , and are each stopping times with respect to the filtration . For we define
For , we write
namely, the negative part of .
We now prove the upcrossings inequality.
Theorem 7 (Upcrossings inequality).
If , , is a supermartingale with respect to a filtration and , then for each ,
Proof.
For and , and writing , for which , we have
Because , we have
One proves that99 9 I am not this “one”. I have not sorted out why this inequality is true. In every proof of the upcrossings inequality I have seen there are pictures and things like this are asserted to be obvious. I am not satisfied with that reasoning; one should not have to interpret an inequality visually to prove it.
Thus
Using that is a supermartingale, for each ,
Therefore
∎
8 Doob’s martingale convergence theorem
We now use the uprossings inequality to prove Doob’s martingale convergence theorem.1010 10 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 71, Theorem 4.2.
Theorem 8 (Doob’s martingale convergence theorem).
Suppose that , , is a supermartingale with respect to a filtration and that
Then there is some such that for almost all ,
and with .
Proof.
For any and , the upcrossings inequality tells us that
For each , the sequence is nondecreasing, so by the monotone convergence theorem,
This implies that
Let
This is an intersection of countably many sets each with measure , so .
Let
If , then there are , , such that
It follows from this . Thus , so , and because we get .
We define by
which is Borel measurable. Furthermore, since almost everywhere, by Fatou’s lemma we obtain
∎
9 Uniform integrability
Let be a random variable. It is a fact1111 11 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 73, Exercise 4.3. that if and only if for each there is some such that
(One’s instinct might be to try to use the Cauchy-Schwarz inequality to prove this. This doesn’t work.) Thus, if is a sequence in then for each there are such that, for each ,
A sequence of random variables is said to be uniformly integrable if for each there is some such that, for each ,
If a sequence is uniformly integrable, then there is some such that for each ,
and so
The following lemma states that the conditional expectations of an integrable random variable with respect to a filtration is a uniformly integrable martingale with respect to that filtration.1212 12 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 75, Exercise 4.5.
Lemma 9.
Suppose that and that is a filtration of . Then is a martingale with respect to and is uniformly integrable.
We now prove that a uniformly integrable supermartingale converges in .1313 13 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 76, Theorem 4.3.
Theorem 10.
Suppose that is a supermartingale with respect to a filtration , and that the sequence is uniformly integrable. Then there is some such that in .
Proof.
Because the sequence is uniformly integrable, there is some such that for each ,
Thus, because is a supermartingale, Doob’s martingale convergence theorem tells us that there is some such that for almost all ,
Because is uniformly integrable and converges almost surely to , the Vitali convergence theorem1414 14 V. I. Bogachev, Measure Theory, volume I, p. 268, Theorem 4.5.4; http://individual.utoronto.ca/jordanbell/notes/L0.pdf, p. 8, Theorem 9. tells us that in . ∎
The above theorem shows in particular that a uniformly integrable martingale converges to some limit in . The following theorem shows that the terms of the sequence are equal to the conditional expectations of this limit with respect to the natural filtration.1515 15 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 77, Theorem 4.4.
Theorem 11.
Suppose that a sequence of random variables is uniformly integrable and is a martingale with respect to its natural filtration
Then there is some such that in and such that for each , for almost all ,
Proof.
By Theorem 10, there is some such that in . The hypothesis that the sequence is a martingale with respect to tells us that for that for and for any ,
and so for ,
Thus
But as . Since does not appear in the left-hand side, we have
and thus
But is the unique element of such that for each ,
and because satisfies this, we get that in , i.e., for almost all ,
proving the claim. ∎
10 Lévy’s continuity theorem
For a metrizable topological space , we denote by the set of Borel probability measures on . The narrow topology on is the coarsest topology such that for each , the map
is continuous .
A subset of is called tight if for each there is a compact subset of such that if then , i.e. . (An element of is called tight when is a tight subset of .)
For a Borel probability measure on , we define its characteristic function by
is bounded by and is uniformly continuous. Because ,
Lemma 12.
Let . For ,
in particular, the right-hand side of this inequality is real.
Proof.
Using Fubini’s theorem and the fact that all real , ,
∎
The following lemma gives a condition on the characteristic functions of a sequence of Borel probability measures on under which the sequence is tight.1616 16 Krishna B. Athreya and Soumendra N. Lahiri, Measure Theory and Probability Theory, p. 329, Lemma 10.3.3.
Lemma 13.
Suppose that and that converges pointwise to a function that is continuous at . Then the sequence is tight.
Proof.
Write . Because , for each , by the dominated convergence theorem we have
On the other hand, that is continuous at implies that for any there is some such that when , , and hence for ,
thus
Let . There is some for which
Then there is some such that when ,
whence
Lemma 12 then says
Furthermore, any Borel probability measure on a Polish space is tight (Ulam’s theorem).1717 17 Alexander S. Kechris, Classical Descriptive Set Theory, p. 107, Theorem 17.11. Thus, for each , there is a compact set for which . Let
which is a compact set, and for any ,
showing that the sequence is tight. ∎
For metrizable spaces , let and let be the projection map. We establish that if is a subset of such that for each the family of th marginals of is tight, then itself is tight.1818 18 Luigi Ambrosio, Nicola Gigli, and Giuseppe Savare, Gradient Flows: In Metric Spaces and in the Space of Probability Measures, p. 119, Lemma 5.2.2; V. I. Bogachev, Measure Theory, volume II, p. 94, Lemma 7.6.6.
Lemma 14.
Let be metrizable topological spaces, let , and let . Suppose that for each ,
is a tight set in . Then is a tight set in .
Proof.
For , write . Let and take . Because is tight, there is a compact subset of such that for all ,
Let
Then for any ,
which shows that is tight. ∎
We now prove Lévy’s continuity theorem, which we shall use to prove the martingale central limit theorem.1919 19 cf. Jean Jacod and Philip Protter, Probability Essentials, second ed., p. 167, Theorem 19.1.
Theorem 15 (Lévy’s continuity theorem).
Suppose that , .
-
1.
If and narrowly, then for any ,
-
2.
If there is some to which converges pointwise and is continuous at , then there is some such that and such that narrowly.
Proof.
Suppose that narrowly. For each , the function is continuous and is bounded, so
Suppose that converges pointwise to and that is continuous at . For , let be the projection map and define by taking the th entry of to be and the other entries to be . Fix and write , and for we calculate
so . By hypothesis, converges pointwise to . Because is continuous at , the function is continuous at . Then Lemma 13 tells us that the sequence is tight. That is, for each , the set
is tight in . Thus Lemma 14 tells us that the set
is tight in .
Prokhorov’s theorem2020 20 V. I. Bogachev, Measure Theory, volume II, p. 202, Theorem 8.6.2. states that if is a Polish space, then a subset of is tight if and only if each sequence of elements of has a subsequence that converges narrowly to some element of . Thus, there is a subsequence of and some such that converges narrowly to . By the first part of the theorem, we get that converges pointwise to . But by hypothesis converges pointwise to , so .
Finally we prove that narrowly. Let be a subsequence of . Because is tight, Prokhorov’s theorem tells us that there is a subsequence of that converges narrowly to some . By the first part of the theorem, converges pointwise to . By hypothesis converges pointwise to , so . Then . That is, any subsequence of itself has a subsequence that converges narrowly to , which implies that the sequence converges narrowly to . (For a sequence in a topological space and , if and only if each subsequence of has a subsequence that converges to .) ∎
11 Martingale central limit theorem
Let be the standard Gaussian measure on : has density
with respect to Lebesgue measure on .
We now prove the martingale central limit theorem.2121 21 Jean Jacod and Philip Protter, Probability Essentials, second ed., p. 235, Theorem 27.7.
Theorem 16 (Martingale central limit theorem).
Suppose is a sequence in satisfying the following, with :
-
1.
.
-
2.
.
-
3.
There is some for which .
Then converges in distribution to some random variable with , where
Proof.
For positive integers and , define
For each , by Taylor’s theorem there is some between and such that
Because is a positive operator and , we have, by the last hypothesis of the theorem,
(3) |
we use this inequality later in the proof. Now, using that and ,
For ,
which we write as
Now using (3) we get
Let and let be large enough so that . For , multiplying the above inequality by yields
(4) |
Now, because ,
Using this with (4) gives
But if , , and , then . As
and , we therefore get that
as .
Let and let . We have just established that pointwise. The function is continuous at , so Lévy’s continuity theorem tells us that there is a Borel probability measure on such that and such that converges narrowly to . But is the characteristic function of , so we have that converges narrowly to .
∎