Martingales, Lévy’s continuity theorem, and the martingale central limit theorem

Jordan Bell
May 29, 2015

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

inf⁡∅=∞,

and for m>n, we take

∑k=mn=0.

(Defined rightly, these are not merely convenient ad hoc definitions.)

2 Conditional expectation

Let (Ω,𝒜,P) be a probability space and let ℬ be a sub-σ-algebra of 𝒜. For each f∈L1⁢(Ω,𝒜,P), there is some g:Ω→ℝ such that (i) g is ℬ-measurable and (ii) for each B∈ℬ, ∫Bg⁢𝑑P=∫Bf⁢𝑑P, and if h:Ω→ℝ satisfies (i) and (ii) then h⁢(ω)=g⁢(ω) 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 g:Ω→ℝ satisfying (i) and (ii) by E⁢(f|ℬ), called the conditional expectation of f with respect to B. In other words, E⁢(f|ℬ) is the unique element of L1⁢(Ω,ℬ,P) such that for each B∈ℬ,

∫BE⁢(f|ℬ)⁢𝑑P=∫Bf⁢𝑑P.

The map f↦E⁢(f|ℬ) satisfies the following:

  1. 1.

    f↦E⁢(f|ℬ) is positive linear operator L1⁢(Ω,𝒜,P)→L1⁢(Ω,ℬ,P) with norm 1.

  2. 2.

    If f∈L1⁢(Ω,𝒜,P) and g∈L∞⁢(Ω,ℬ,P), then for almost all ω∈Ω,

    E⁢(g⁢f|ℬ)⁢(ω)=g⁢(ω)⁢E⁢(f|ℬ)⁢(ω).
  3. 3.

    If 𝒞 is a sub-σ-algebra of ℬ, then for almost all ω∈Ω,

    E⁢(E⁢(f|ℬ)|𝒞)⁢(ω)=E⁢(f|𝒞)⁢(ω).
  4. 4.

    If f∈L1⁢(Ω,ℬ,P) then for almost all ω∈Ω,

    E⁢(f|ℬ)⁢(ω)=f⁢(ω).
  5. 5.

    If f∈L1⁢(Ω,𝒜,P), then for almost all ω∈Ω,

    |E(f|ℬ)(ω)|≤E(|f||ℬ)(ω).
  6. 6.

    If f∈L1⁢(Ω,𝒜,P) is independent of ℬ, then for almost all ω∈Ω,

    E⁢(f|ℬ)⁢(ω)=E⁢(f).

3 Filtrations

A filtration of a σ-algebra 𝒜 is a sequence ℱn, n≥1, of sub-σ-algebras of 𝒜 such that ℱm⊂ℱn if m≤n. We set ℱ0={∅,Ω}.

A sequence of random variables ξn:(Ω,𝒜,P)→ℝ is said to be adapted to the filtration Fn if for each n, ξn is ℱn-measurable.

Let ξn:(Ω,𝒜,P)→ℝ, n≥1, be a sequence of random variables. The natural filtration of A corresponding to ξn is

ℱn=σ⁢(ξ1,…,ξn).

It is apparent that ℱn is a filtration and that the sequence ξn is adapted to ℱn.

4 Martingales

Let ℱn be a filtration of a σ-algebra 𝒜 and let ξn:(Ω,𝒜,P)→ℝ be a sequence of random variables. We say that ξn is a martingale with respect to Fn if (i) the sequence ξn is adapted to the filtration ℱn, (ii) for each n, ξn∈L1⁢(P), and (iii) for each n, for almost all ω∈Ω,

E⁢(ξn+1|ℱn)⁢(ω)=ξn⁢(ω).

In particular,

E⁢(ξ1)=E⁢(ξ2)=⋯,

i.e.

E⁢(ξm)=E⁢(ξn),m≤n.

We say that ξn is a submartingale with respect to Fn if (i) and (ii) above are true, and if for each n, for almost all ω∈Ω,

E⁢(ξn+1|ℱn)⁢(ω)≥ξn⁢(ω).

In particular,

E⁢(ξ1)≤E⁢(ξ2)≤⋯,

i.e.

E⁢(ξm)≤E⁢(ξn),m≤n.

We say that ξn is a supermartingale with respect to Fn if (i) and (ii) above are true, and if for each n, for almost all ω∈Ω,

ξn⁢(ω)≥E⁢(ξn+1|ℱn)⁢(ω).

In particular,

E⁢(ξ1)≥E⁢(ξ2)≥⋯,

i.e.

E⁢(ξm)≥E⁢(ξn),m≤n.

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 ℱn be a filtration of a σ-algebra 𝒜. A stopping time with respect to Fn is a function τ:Ω→{1,2,…}∪{∞} such that for each n≥1,

{ω∈Ω:τ⁢(ω)=n}∈ℱn.

It is straightforward to check that a function τ:Ω→{1,2,…}∪{∞} is a stopping time with respect to ℱn if and only if for each n≥1,

{ω∈Ω:τ⁢(ω)≤n}∈ℱn.

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 ξn be a sequence of random variables adapted to a filtration Fn and let B∈BR. Then

τ⁢(ω)=inf⁡{n≥1:ξn⁢(ω)∈B}

is a stopping time with respect to Fn.

Proof.

Let n≥1. Then

{ω∈Ω:τ(ω)=n} =(⋂k=1n-1{ω∈Ω:ξk⁢(ω)∉B})∩{ω∈Ω:ξn⁢(ω)∈B}
=(⋂k=1n-1Akc)∩An,

where

Ak={ω∈Ω:ξk⁢(ω)∈B}.

Because the sequence ξk is adapated to the filtration ℱk, Akc∈ℱk and An∈ℱn, and because ℱk is a filtration, the right-hand side of the above belongs to ℱn. ∎

If ξn is a sequence of random variables adapted to a filtration ℱn and a stopping time τ with respect to ℱn, for n≥1 we define ξτ∧n:Ω→ℝ by

ξτ∧n⁢(ω)=ξτ⁢(ω)∧n⁢(ω),ω∈Ω.

ξτ∧n is called the sequence ξn stopped at τ.33 3 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 55, Exercise 3.10.

Lemma 2.

ξτ∧n:(Ω,𝒜,P)→ℝ is a sequence of random variables adapted to the filtration Fn.

Proof.

Let n≥1 and let B∈ℬℝ. Because

{ω:ξτ∧n⁢(ω)∈B,τ⁢(ω)>n}={ω:ξn⁢(ω)∈B,τ⁢(ω)>n}

and for any k,

{ω:ξτ∧n⁢(ω)∈B,τ⁢(ω)=k}={ω:ξk∈B,τ⁢(ω)=k},

we get

{ω:ξτ∧n⁢(ω)∈B}={ω:ξn⁢(ω)∈B,τ⁢(ω)>n}∪⋃k=1n{ω:ξk⁢(ω)∈B,τ⁢(ω)=k}.

But

{ξn∈B,τ>n}={ξn∈B}∩{τ>n}∈ℱn

and

{ξk∈B,τ=k}={ξk∈B}∩{τ=k}∈ℱk,

and therefore

{ξτ∧n∈B}∈ℱn.

In particular, {ξτ∧n∈B}∈𝒜, namely, ξτ∧n is a random variable, and the above shows that this sequence is adapted to the filtration ℱn. ∎

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 Fn be a filtration of a σ-algebra A and let τ be a stopping time with respect to Fn.

  1. 1.

    If ξn is a submartingale with respect to ℱn then so is ξτ∧n.

  2. 2.

    If ξn is a supermartingale with respect to ℱn then so is ξτ∧n.

  3. 3.

    If ξn is a martingale with respect to ℱn then so is ξτ∧n.

Proof.

For n≥1, define

αn⁢(ω)={1τ⁢(ω)≥n0τ⁢(ω)<n;

we remark that τ⁢(ω)≥n if and only if τ⁢(ω)>n-1 and τ⁢(ω)<n if and only if τ⁢(ω)≤n-1. For B∈ℬℝ, (i) if 0,1∉B then

{ω∈Ω:αn⁢(ω)∈B}=∅∈ℱn-1,

(ii) if 0,1∈B then

{ω∈Ω:αn⁢(ω)∈B}=Ω∈ℱn-1,

(iii) if 0∈B and 1∉B then

{ω∈Ω:αn⁢(ω)∈B}={ω∈Ω:αn⁢(ω)=0}={ω∈Ω:τ⁢(ω)≤n-1}∈ℱn-1,

and (iv) if 1∈B and 0∉B then

{ω∈Ω:αn⁢(ω)∈B}={ω∈Ω:αn⁢(ω)=1}={ω∈Ω:τ⁢(ω)>n-1}∈ℱn-1,

Therefore {αn∈B}∈ℱn-1.

Set ξ0=0, and we check that

ξτ∧n=∑k=1nαk⁢(ξk-ξk-1).

It is apparent from this expression that if ξn is adapted to ℱn then ξτ∧n is adapted to ℱn, and that if each ξn belongs to L1⁢(P) then each ξτ∧n belongs to L1⁢(P). As each of α1,…,αn+1 is ℱn-measurable and is bounded,

E⁢(ξτ∧(n+1)|ℱn)=∑k=1n+1E⁢(αk⁢(ξk-ξk-1)|ℱn)=∑k=1n+1αk⁢E⁢(ξk-ξk-1|ℱn). (1)

Suppose that ξn is a submartingale. By (1),

E⁢(ξτ∧(n+1)|ℱn) =∑k=1nαk⁢(ξk-ξk-1)+αn+1⁢E⁢(ξn+1|ℱn)-αn+1⁢ξn
≥ξτ∧n+αn+1⁢ξn-αn+1⁢ξn
=ξτ∧n,

which shows that ξτ∧n is a submartingale; the statement that E⁢(ξτ∧(n+1)|ℱn)≥ξτ∧n means that E⁢(ξτ∧(n+1)|ℱn)⁢(ω)≥ξτ∧n⁢(ω) 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 Fn be a filtration of a σ-algebra A, let ξn be a martingale with respect to Fn, and let τ be a stopping time with respect to Fn. Suppose that:

  1. 1.

    For almost all ω∈Ω, τ⁢(ω)<∞.

  2. 2.

    ξτ∈L1⁢(Ω,𝒜,P).

  3. 3.

    E⁢(ξn⁢1{τ>n})→0 as n→∞.

Then

E⁢(ξτ)=E⁢(ξ1).
Proof.

For each n, Ω={τ≤n}∪{τ>n}, and therefore

ξτ=ξτ∧n+ξτ⁢1{τ>n}-ξn⁢1{τ>n}=ξτ∧n+∑k=n+1∞ξk⁢1{τ=k}-ξn⁢1{τ>n}.

Theorem 3 tells us that ξτ∧n is a martingale with respect to to ℱn, and hence

E⁢(ξτ∧n)=E⁢(ξτ∧1)=E⁢(ξ1),

so

E⁢(ξτ)=E⁢(ξ1)+∑k=n+1∞E⁢(ξk⁢1{τ=k})-E⁢(ξn⁢1{τ>n}). (2)

But as ξτ∈L1⁢(P),

∫Ω(ξτ)⁢(ω)⁢𝑑P⁢(ω)=∑k=1∞∫{τ=k}ξk⁢(ω)⁢𝑑P⁢(ω)=∑k=1∞E⁢(ξk⁢1{τ=k}),

and the fact that this series converges means that ∑k=n+1∞E⁢(ξk⁢1{τ=k})→0. With the hypothesis E⁢(ξn⁢1{τ>n})→0, as n→∞ we have

E⁢(ξ1)+∑k=n+1∞E⁢(ξk⁢1{τ=k})-E⁢(ξn⁢1{τ>n})→E⁢(ξ1).

But (2) is true for each n, so we get E⁢(ξτ)=E⁢(ξ1), proving the claim. ∎

Suppose that ηn is a sequence of independent random variables each with the Rademacher distribution:

P(ηn=1)=12,P(ηn=-1)=12.

Let ξn=∑k=1nηk and let ℱn=σ⁢(η1,…,ηn). Because

ξn+12=(ξn+ηn+1)2=ηn+12+2⁢ηn+1⁢ξn+ξn2,

we have, as ξn is ℱn-measurable and belongs to L∞⁢(P) and as ηn+1 is independent of the σ-algebra ℱn,

E⁢(ξn+12-(n+1)|ℱn) =E⁢(ηn+12+2⁢ηn+1⁢ξn+ξn2-(n+1)|ℱn)
=E⁢(ηn+12)+2⁢ξn⁢E⁢(ηn+1)+ξn2-(n+1)
=1+0+ξn2-(n+1)
=ξn2-n.

Therefore, ξn2-n is a martingale with respect to ℱn.

Let K be a positive integer and let

τ=inf⁡{n≥1:|ξn|=K}.

Namely, τ is the time of first entry in the Borel subset {-K,K} of ℝ, hence by Lemma 1 is a stopping time with respect to the filtration ℱn. With some work,66 6 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 59, Example 3.7. one shows that (i) P(τ>2Kn)→0 as n→∞, (ii) E⁢(|ξτ2-τ|)<∞, and (iii) E⁢((ξn2-n)⁢1{τ>n})→0 as n→∞. Then we can apply the optional stopping theorem to the martingale ξn2-n: we get that

E⁢(ξτ2-τ)=E⁢(ξ12-1)=E⁢(ξ12)-1=E⁢(η12)-1=0.

Hence

E⁢(τ)=E⁢(ξτ2).

But |ξτ|=K, so ξτ2=K2, hence

E⁢(τ)=E⁢(K2)=K2.

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 Fn is a filtration of a σ-algebra A, that ξn is a submartingale with respect to Fn, and that for each n, ξn≥0. Then for each n≥1 and λ>0,

λP(max1≤k≤nξk≥λ)≤E(ξn1{max1≤k≤nξk≥λ}).
Proof.

Define ζn⁢(ω)=max1≤k≤n⁡ξk⁢(ω), which is ℱn-measurable, and define τ:Ω→{1,…,n} by

τ⁢(ω)=min⁡{1≤k≤n:ξk⁢(ω)≥λ}

if there is some 1≤k≤n for which ξk⁢(ω)≥λ, and τ⁢(ω)=n otherwise. For 1≤k≤n,

{τ=k}=(⋂j=1k-1{ξk<λ})∩{ξk≥λ}∈ℱk,

and for k>n,

{τ=k}=∅∈ℱk,

showing that τ is a stopping time with respect to the filtration ℱk.

For k≥1,

ξk+1-ξτ∧(k+1) =∑j=1k1{τ=j}⁢(ξk+1-ξτ∧(k+1))=∑j=1k1{τ=j}⁢(ξk+1-ξj),

hence, because τ is a stopping time with respect to the filtration ℱk and because ξk is a submartingale with respect to this filtration,

E⁢(ξk+1-ξτ∧(k+1)|ℱk) =∑j=1k1{τ=j}⁢E⁢((ξk+1-ξj)|ℱk)
=∑j=1k1{τ=j}⁢(E⁢(ξk+1|ℱk)-ξj)
≥∑j=1k1{τ=j}⁢(ξk-ξj)
=∑j=1k-11{τ=j}⁢(ξk-ξj)
=ξk-ξτ∧k,

from which we have that the sequence ξk-ξτ∧k is a submartingale with respect to the filtration ℱk. Therefore

E⁢(ξk-ξτ∧k)≥E⁢(ξ1-ξτ∧1)=E⁢(ξ1)-E⁢(ξτ∧1)=E⁢(ξ1)-E⁢(ξ1)=0,

and so E⁢(ξτ∧k)≤E⁢(ξk). Because τ∧n=τ, this yields

E⁢(ξτ)≤E⁢(ξn).

We have

E⁢(ξτ)=E⁢(ξτ⁢1{ζn≥λ})+E⁢(ξτ⁢1{ζn<λ}).

If ω∈{ζn≥λ} then (ξτ)⁢(ω)≥λ, and if ω∈{ζn<λ} then τ⁢(ω)=n and so (ξτ)⁢(ω)=ξn⁢(ω). Therefore

E(ξτ)≥E(λ⋅1{ζn≥λ})+E(ξn1{ζn<λ})=λP(ζn≥λ)+E(ξn1{ζn<λ}).

Therefore

λP(ζn≥λ)+E(ξn1{ζn<λ})≤E(ξn).

But ξn=ξn⁢1ζn<λ+ξn⁢1ζn≥λ, hence

λP(ζn≥λ)≤E(ξn1{ζn≥λ}),

which proves the claim. ∎

The following is Doob’s L2 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 L2 maximal inequality).

Suppose that Fn is a filtration of a σ-algebra A and that ξn is a submartingale with respect to Fn such that for each n≥1, ξn≥0 and ξn∈L2⁢(P). Then for each n≥1,

E⁢(|max1≤k≤n⁡ξk|2)≤4⁢E⁢(ξn2).
Proof.

Define ζn⁢(ω)=max1≤k≤n⁡ξk⁢(ω). It is a fact that if η∈L2⁢(P) and η≥0 then

E(η2)=2∫0∞tP(η≥t)dt.

Using this, Doob’s maximal inequality, Fubini’s theorem, and the Cauchy-Schwarz inequality,

E⁢(ζn2) =2∫0∞tP(ζn>t)dt
≤2∫0∞E(ξn1{ζn≥t}dt
=2⁢∫0∞(∫{ζn≥t}ξn⁢(ω)⁢𝑑P⁢(ω))⁢𝑑t
=2⁢∫Ω(∫0ζn⁢(ω)𝑑t)⁢ξn⁢(ω)⁢𝑑P⁢(ω)
=2⁢∫Ωζn⁢(ω)⁢ξn⁢(ω)⁢𝑑P⁢(ω)
≤2⁢(E⁢(ζn2))1/2⁢(E⁢(ξn2))1/2.

If E⁢(ζn2)=0 the claim is immediate. Otherwise, we divide this inequality by (E⁢(ζn2))1/2 and obtain

(E⁢(ζn2))1/2≤2⁢(E⁢(ξn2))1/2,

and so

E⁢(ζn2)≤4⁢E⁢(ξn2),

proving the claim. ∎

7 Upcrossings

Suppose that ξn is a sequence of random variables that is adapted to a filtration ℱn and let a<b be real numbers. Define

τ0=0,

and by induction for m≥1,

σm⁢(ω)=inf⁡{k≥τm-1⁢(ω):ξk⁢(ω)≤a}

and

τm⁢(ω)=inf⁡{k≥σm⁢(ω):ξk⁢(ω)≥b},

where inf⁡∅=∞. For each m, τm and σm are each stopping times with respect to the filtration ℱk. For n≥0 we define

Un⁢[a,b]⁢(ω)=sup⁡{m≥0:τm⁢(ω)≤n}.

For x∈ℝ, we write

x-=max⁡{0,-x}=-min⁡{0,x}.

namely, the negative part of x.

We now prove the upcrossings inequality.

Theorem 7 (Upcrossings inequality).

If ξn, n≥1, is a supermartingale with respect to a filtration Fn and a<b, then for each n≥1,

(b-a)⁢E⁢(Un⁢[a,b])≤E⁢((ξn-a)-).
Proof.

For n≥1 and ω∈Ω, and writing N=Un⁢[a,b]⁢(ω), for which N≤n, we have

∑m=1n(ξτm∧n⁢(ω)-ξσm∧n⁢(ω))=∑m=1N(ξτm∧n⁢(ω)-ξσm∧n⁢(ω))+ξτN+1∧n⁢(ω)-ξσN+1∧n⁢(ω)+∑m=N+2n(ξτm∧n⁢(ω)-ξσm∧n⁢(ω))=∑m=1N(ξτm⁢(ω)-ξσm⁢(ω))+ξn⁢(ω)-ξσN+1∧n⁢(ω)+∑m=N+1n(ξn⁢(ω)-ξn⁢(ω))=∑m=1N(ξτm⁢(ω)-ξσm⁢(ω))+1{σN+1≤n}⁢(ω)⁢(ξn⁢(ω)-ξσN+1⁢(ω))≥∑m=1N(b-a)+1{σN+1≤n}⁢(ω)⁢(ξn⁢(ω)-ξσN+1⁢(ω)).

Because ξσN+1⁢(ω)≤a, we have

(b-a)⁢N≤1{σN+1≤n}⁢(ω)⁢(a-ξn⁢(ω))+∑m=1n(ξτm∧n⁢(ω)-ξσm∧n⁢(ω)).

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.

1{σN+1≤n}⁢(ω)⁢(a-ξn⁢(ω))≤min⁡{0,a-ξn⁢(ω)}=(ξn⁢(ω)-a)-.

Thus

(b-a)⁢E⁢(Un⁢[a,b])≤E⁢((ξn-a)-)+∑m=1nE⁢(ξτm∧n-ξσm∧n).

Using that ξn is a supermartingale, for each 1≤m≤n,

E⁢(ξτm∧n-ξσm∧n) ≤0.

Therefore

(b-a)⁢E⁢(Un⁢[a,b])≤E⁢((ξn-a)-).

∎

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 ξn, n≥1, is a supermartingale with respect to a filtration Fn and that

M=supn⁡E⁢(|ξn|)<∞.

Then there is some ξ∈L1⁢(Ω,A,P) such that for almost all ω∈Ω,

limn→∞⁡ξn⁢(ω)=ξ⁢(ω)

and with E⁢(|ξ|)≤M.

Proof.

For any a<b and n≥1, the upcrossings inequality tells us that

E⁢(Un⁢[a,b])≤E(ξn-a)-)b-a≤E⁢(|ξn-a|)b-a≤E⁢(|ξn|+|a|)b-a≤M+|a|b-a.

For each ω∈Ω, the sequence Un⁢[a,b]⁢(ω)∈[0,∞) is nondecreasing, so by the monotone convergence theorem,

E⁢(limn→∞⁡Un⁢[a,b])=limn→∞⁡E⁢(Un⁢[a,b])≤M+|a|b-a.

This implies that

P(ω∈Ω:limn→∞Un[a,b](ω)<∞)=1.

Let

A=⋂a,b∈ℚ,a<b{ω∈Ω:limn→∞⁡Un⁢[a,b]⁢(ω)<∞}.

This is an intersection of countably many sets each with measure 1, so P⁢(A)=1.

Let

B={ω∈Ω:lim infn⁡ξn⁢(ω)<lim supn⁡ξn⁢(ω)}.

If ω∈B, then there are a,b∈ℚ, a<b, such that

lim infn⁡ξn⁢(ω)<a<b<lim supn⁡ξn⁢(ω).

It follows from this limn→∞⁡Un⁢[a,b]⁢(ω)=∞. Thus ω∉A, so B∩A=∅, and because P⁢(A)=1 we get P⁢(B)=0.

We define ξ:Ω→ℝ by

ξ⁢(ω)={limn→∞⁡ξn⁢(ω)ω∉B0ω∈B,

which is Borel measurable. Furthermore, since |ξ|=lim infn⁡|ξn| almost everywhere, by Fatou’s lemma we obtain

E⁢(|ξ|) =E⁢(lim infn⁡|ξn|)
≤lim infn⁡E⁢(|ξn|)
≤supn⁡E⁢(|ξn|)
=M.

∎

9 Uniform integrability

Let ξ:(Ω,𝒜,P)→ℝ 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 ξ∈L1 if and only if for each ϵ>0 there is some M such that

∫{|ξ|>M}|ξ|⁢𝑑P<ϵ.

(One’s instinct might be to try to use the Cauchy-Schwarz inequality to prove this. This doesn’t work.) Thus, if ξn is a sequence in L1⁢(Ω,𝒜,P) then for each ϵ>0 there are Mn such that, for each n,

∫{|ξn|>Mn}|ξn|⁢𝑑P<ϵ.

A sequence of random variables ξn is said to be uniformly integrable if for each ϵ>0 there is some M such that, for each n,

∫{|ξn|>M}|ξn|⁢𝑑P<ϵ.

If a sequence ξn is uniformly integrable, then there is some M such that for each n,

∫{|ξn|>M}|ξn|⁢𝑑P<1,

and so

E⁢(|ξn|)=∫{|ξn|≤M}|ξn|⁢𝑑P+∫{|ξn|>M}|ξn|⁢𝑑P<∫{|ξn|≤M}M⁢𝑑P+1≤M+1.

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 ξ∈L1⁢(Ω,A,P) and that Fn is a filtration of A. Then E⁢(ξ|Fn) is a martingale with respect to Fn and is uniformly integrable.

We now prove that a uniformly integrable supermartingale converges in L1.1313 13 Zdzisław Brzeźniak and Tomasz Zastawniak, Basic Stochastic Processes, p. 76, Theorem 4.3.

Theorem 10.

Suppose that ξn is a supermartingale with respect to a filtration Fn, and that the sequence ξn is uniformly integrable. Then there is some ξ∈L1⁢(Ω,A,P) such that ξn→ξ in L1.

Proof.

Because the sequence ξn is uniformly integrable, there is some M such that for each n≥1,

E⁢(|ξn|)≤M+1.

Thus, because ξn is a supermartingale, Doob’s martingale convergence theorem tells us that there is some ξ∈L1⁢(Ω,𝒜,P) such that for almost all ω∈Ω,

limn→∞⁡ξn⁢(ω)=ξ⁢(ω).

Because ξn 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 ξn→ξ in L1. ∎

The above theorem shows in particular that a uniformly integrable martingale converges to some limit in L1. 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 ξn is uniformly integrable and is a martingale with respect to its natural filtration

ℱn=σ⁢(ξ1,…,ξn).

Then there is some ξ∈L1⁢(Ω,A,P) such that ξn→ξ in L1 and such that for each n≥1, for almost all ω∈Ω,

ξn⁢(ω)=E⁢(ξ|ℱn)⁢(ω).
Proof.

By Theorem 10, there is some ξ∈L1⁢(Ω,𝒜,P) such that ξn→ξ in L1. The hypothesis that the sequence ξn is a martingale with respect to ℱn tells us that for that for n≥1 and for any m≥n,

E⁢(ξm|ℱn)=ξn,

and so for A∈ℱn,

∫Aξm⁢𝑑P=∫AE⁢(ξm|ℱn)⁢𝑑P=∫Aξn⁢𝑑P.

Thus

|∫A(ξn-ξ)⁢𝑑P| =|∫A(ξm-ξ)⁢𝑑P|
≤∫A|ξm-ξ|⁢𝑑P
≤E⁢(|ξm-ξ|).

But E⁢(|ξm-ξ|)→0 as m→∞. Since m does not appear in the left-hand side, we have

|∫A(ξn-ξ)⁢𝑑P|=0,

and thus

∫Aξn⁢𝑑P=∫Aξ⁢𝑑P.

But E⁢(f|ℱn) is the unique element of L1⁢(Ω,ℱn,P) such that for each A∈ℱn,

∫AE⁢(f|ℱn)⁢𝑑P=∫Af⁢𝑑P,

and because ξn satisfies this, we get that ξn=E⁢(f|ℱn) in L1, i.e., for almost all ω∈Ω,

ξn⁢(ω)=E⁢(f|ℱn)⁢(ω),

proving the claim. ∎

10 Lévy’s continuity theorem

For a metrizable topological space X, we denote by 𝒫⁢(X) the set of Borel probability measures on X. The narrow topology on P⁢(X) is the coarsest topology such that for each f∈Cb⁢(X), the map

μ↦∫Xf⁢𝑑μ

is continuous 𝒫⁢(X)→ℂ.

A subset ℋ of 𝒫⁢(X) is called tight if for each ϵ>0 there is a compact subset Kϵ of X such that if μ∈ℋ then μ⁢(X∖Kϵ)<ϵ, i.e. μ⁢(Kϵ)>1-ϵ. (An element μ of 𝒫⁢(X) is called tight when {μ} is a tight subset of 𝒫⁢(X).)

For a Borel probability measure μ on ℝd, we define its characteristic function μ~:ℝd→ℂ by

μ~⁢(u)=∫ℝdei⁢x⋅u⁢𝑑μ⁢(x),u∈ℝd.

μ~ is bounded by 1 and is uniformly continuous. Because μ⁢(ℝd)=1,

μ~⁢(0)=1.
Lemma 12.

Let μ∈P⁢(R). For δ>0,

μ⁢({x∈ℝ:|x|≥2δ})≤1δ⁢∫-δδ(1-μ~⁢(u))⁢𝑑u;

in particular, the right-hand side of this inequality is real.

Proof.

Using Fubini’s theorem and the fact that all real t, 1-sin⁡tt≥0,

∫-δδ(1-μ~⁢(u))⁢𝑑u =∫-δδ(∫ℝ(1-ei⁢x⁢u)⁢𝑑μ⁢(x))⁢𝑑u
=∫ℝ(∫-δδ1-ei⁢u⁢x⁢d⁢u)⁢𝑑μ⁢(x)
=∫ℝ(u-ei⁢u⁢xi⁢x)-δδ⁢𝑑μ⁢(x)
=∫ℝ(2⁢δ-ei⁢δ⁢xi⁢x+e-i⁢δ⁢xi⁢x)⁢𝑑μ⁢(x)
=2⁢δ⁢∫ℝ(1-sin⁡(δ⁢x)δ⁢x)⁢𝑑μ⁢(x)
≥2⁢δ⁢∫|δ⁢x|≥2(1-sin⁡(δ⁢x)δ⁢x)⁢𝑑μ⁢(x)
≥2⁢δ⁢∫|δ⁢x|≥2(1-1|δ⁢x|)⁢𝑑μ⁢(x)
≥2⁢δ⁢∫|δ⁢x|≥212⁢𝑑μ⁢(x)
=δ⁢μ⁢({x∈ℝ:|δ⁢x|≥2}).

∎

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 μn∈P⁢(R) and that μ~n converges pointwise to a function ϕ:R→C that is continuous at 0. Then the sequence μn is tight.

Proof.

Write ϕn=μ~n. Because |ϕn|≤1, for each δ>0, by the dominated convergence theorem we have

1δ⁢∫-δδ(1-ϕn⁢(t))⁢𝑑t→1δ⁢∫-δδ(1-ϕ⁢(t))⁢𝑑t.

On the other hand, that ϕ is continuous at 0 implies that for any ϵ>0 there is some η>0 such that when |t|<η, |ϕ⁢(t)-1|<ϵ, and hence for δ<η,

1δ⁢∫-δδ(1-ϕ⁢(t))⁢𝑑t≤2⁢sup|t|≤δ⁡|1-ϕ⁢(t)|≤2⁢ϵ,

thus

1δ⁢∫-δδ(1-ϕ⁢(t))⁢𝑑t→0,δ→0.

Let ϵ>0. There is some δ>0 for which

|1δ⁢∫-δδ(1-ϕ⁢(t))⁢𝑑t|<ϵ.

Then there is some nδ such that when n≥nδ,

|1δ⁢∫-δδ(1-ϕn⁢(t))⁢𝑑t-1δ⁢∫-δδ(1-ϕ⁢(t))⁢𝑑t|<ϵ,

whence

|1δ⁢∫-δδ(1-ϕn⁢(t))⁢𝑑t|<2⁢ϵ.

Lemma 12 then says

μn⁢({x∈ℝ:|x|≥2δ})≤1δ⁢∫-δδ(1-ϕn⁢(t))⁢𝑑t<2⁢ϵ.

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 1≤n<nδ, there is a compact set Kn for which μn⁢(ℝ∖Kn)<ϵ. Let

Kϵ=K1∪⋯∪Knδ-1∪{x∈ℝ:|x|≤2δ},

which is a compact set, and for any n≥1,

μn⁢(ℝ∖Kϵ)<2⁢ϵ,

showing that the sequence μn is tight. ∎

For metrizable spaces X1,…,Xd, let X=∏i=1dXi and let πi:X→Xi be the projection map. We establish that if ℋ is a subset of 𝒫⁢(X) such that for each 1≤i≤d the family of ith 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 X1,…,Xd be metrizable topological spaces, let X=∏i=1dXi, and let H⊂P⁢(X). Suppose that for each 1≤i≤d,

ℋi={πi*⁢μ:μ∈ℋ}

is a tight set in P⁢(Xi). Then H is a tight set in P⁢(X).

Proof.

For μ∈ℋ, write μi=πi*⁢μ. Let ϵ>0 and take 1≤i≤d. Because ℋi is tight, there is a compact subset Ki of Xi such that for all μi∈ℋi,

μi⁢(Xi∖Ki)<ϵd.

Let

K=∏i=1dKi=⋂i=1dπi-1⁢(Ki).

Then for any μ∈ℋ,

μ⁢(X∖K) =μ⁢(X∖⋂i=1dπi-1⁢(Ki))
=μ⁢(⋃i=1dπi-1⁢(Ki)c)
=μ⁢(⋃i=1dπi-1⁢(Xi∖Ki))
≤∑i=1dμ⁢(πi-1⁢(Xi∖Ki))
=∑i=1dμi⁢(Xi∖Ki)
<∑i=1dϵd
=ϵ,

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 μn∈P⁢(Rd), n≥1.

  1. 1.

    If μ∈𝒫⁢(ℝd) and μn→μ narrowly, then for any u∈ℝd,

    μ~n⁢(u)→μ~⁢(u),n→∞.
  2. 2.

    If there is some ϕ:ℝd→ℂ to which μ~n converges pointwise and ϕ is continuous at 0, then there is some μ∈𝒫⁢(ℝd) such that ϕ=μ~ and such that μn→μ narrowly.

Proof.

Suppose that μn→μ narrowly. For each u∈ℝd, the function x↦ei⁢x⋅u is continuous ℝd→ℂ and is bounded, so

μ~n⁢(u)=∫ℝdei⁢x⋅u⁢𝑑μn⁢(x)→∫ℝdei⁢x⋅u⁢𝑑μ⁢(x)=μ~⁢(u).

Suppose that μ~n converges pointwise to ϕ and that ϕ is continuous at 0. For 1≤i≤d, let πi:ℝd→ℝ be the projection map and define ιi:ℝ→ℝd by taking the ith entry of ιi⁢(t) to be t and the other entries to be 0. Fix 1≤i≤d and write νn=πi*⁢μn∈𝒫⁢(ℝ), and for t∈ℝ we calculate

ν~n⁢(t) =∫ℝei⁢s⁢t⁢𝑑νn⁢(s)
=∫ℝdei⁢πi⁢(x)⁢t⁢𝑑μn⁢(x)
=∫ℝdei⁢x⋅ιi⁢(t)⁢𝑑μn⁢(x)
=μ~n⁢(ιi⁢(t)),

so ν~n=μ~n∘ιi. By hypothesis, ν~n converges pointwise to ϕ∘ιi. Because ϕ is continuous at 0∈ℝd, the function ϕ∘ιi is continuous at 0∈ℝ. Then Lemma 13 tells us that the sequence νn is tight. That is, for each 1≤i≤d, the set

{πi*⁢μn:n≥1}

is tight in 𝒫⁢(ℝ). Thus Lemma 14 tells us that the set

{μn:n≥1}

is tight in 𝒫⁢(ℝd).

Prokhorov’s theorem2020 20 V. I. Bogachev, Measure Theory, volume II, p. 202, Theorem 8.6.2. states that if X is a Polish space, then a subset ℋ of 𝒫⁢(X) is tight if and only if each sequence of elements of ℋ has a subsequence that converges narrowly to some element of 𝒫⁢(X). Thus, there is a subsequence μa⁢(n) of μn and some μ∈𝒫⁢(ℝd) such that μa⁢(n) converges narrowly to μ. By the first part of the theorem, we get that μ~a⁢(n) converges pointwise to μ~. But by hypothesis μ~n converges pointwise to ϕ, so ϕ=μ~.

Finally we prove that μn→μ narrowly. Let μb⁢(n) be a subsequence of μn. Because {μn:n≥1} is tight, Prokhorov’s theorem tells us that there is a subsequence μc⁢(n) of μb⁢(n) that converges narrowly to some λ∈𝒫⁢(ℝd). By the first part of the theorem, μ~c⁢(n) converges pointwise to λ~. By hypothesis μ~c⁢(n) converges pointwise to ϕ, so λ~=ϕ=μ~. Then λ=μ. That is, any subsequence of μn itself has a subsequence that converges narrowly to μ, which implies that the sequence μn converges narrowly to μ. (For a sequence xn in a topological space X and x∈X, xn→x if and only if each subsequence of xn has a subsequence that converges to x.) ∎

11 Martingale central limit theorem

Let γd be the standard Gaussian measure on Rd: γd has density

1(2⁢π)d⁢e-12⁢|x|2

with respect to Lebesgue measure on ℝd.

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 Xj is a sequence in L3⁢(Ω,A,P) satisfying the following, with Fk=σ⁢(X1,…,Xk):

  1. 1.

    E⁢(Xj|ℱj-1)=0.

  2. 2.

    E⁢(Xj2|ℱj-1)=1.

  3. 3.

    There is some K for which E⁢(|Xj|3|ℱj-1)≤K.

Then Snn converges in distribution to some random variable Z:Ω→R with Z*⁢P=γ1, where

Sn=∑j=1nXj.
Proof.

For positive integers n and j, define

ϕn,j⁢(u)=E⁢(ei⁢u⁢1n⁢Xj|ℱj-1).

For each ω∈Ω, by Taylor’s theorem there is some ξn,j⁢(ω) between 0 and Xj⁢(ω) such that

ei⁢u⁢1n⁢Xj⁢(ω)=1+i⁢u⁢1n⁢Xj⁢(ω)-u22⁢n⁢Xj⁢(ω)2-i⁢u36⁢n3/2⁢ξn,j⁢(ω)3.

Because f↦E⁢(f|ℱj-1) is a positive operator and |ξn,j|3≤|Xj|3, we have, by the last hypothesis of the theorem,

E⁢(|ξn,j|3|ℱj-1)≤E⁢(|Xj|3|ℱj-1)≤K (3)

we use this inequality later in the proof. Now, using that E⁢(Xj|ℱj-1)=0 and E⁢(Xj2|ℱj-1)=1,

ϕn,j⁢(u) =1+i⁢u⁢1n⁢E⁢(Xj|ℱj-1)-u22⁢n⁢E⁢(Xj2|ℱj-1)-i⁢u36⁢n3/2⁢E⁢(ξn,j3|ℱj-1)
=1-u22⁢n-i⁢u36⁢n3/2⁢E⁢(ξn,j3|ℱj-1).

For p≥1,

E⁢(ei⁢u⁢1n⁢Sp) =E⁢(ei⁢u⁢1n⁢Sp-1⁢ei⁢u⁢1n⁢Xp)
=E⁢(E⁢(ei⁢u⁢1n⁢Sp-1⁢ei⁢u⁢1n⁢Xp|ℱp-1))
=E⁢(ei⁢u⁢1n⁢Sp-1⁢E⁢(ei⁢u⁢1n⁢Xp|ℱp-1))
=E⁢(ei⁢u⁢1n⁢Sp-1⁢ϕn,p⁢(u))
=E⁢(ei⁢u⁢1n⁢Sp-1⁢(1-u22⁢n-i⁢u36⁢n3/2⁢E⁢(ξn,p3|ℱp-1))),

which we write as

E⁢(ei⁢un⁢Sp-(1-u22⁢n)⁢ei⁢un⁢Sp-1)=-E⁢(ei⁢un⁢Sp-1⁢i⁢u36⁢n3/2⁢E⁢(ξn,p3|ℱp-1)).

Now using (3) we get

|E⁢(ei⁢un⁢Sp-(1-u22⁢n)⁢ei⁢un⁢Sp-1)|≤E(|ei⁢un⁢Sp-1i⁢u36⁢n3/2E(ξn,p3|ℱp-1)|)=E(|u|36⁢n3/2|E(ξn,p3|ℱp-1)|)≤|u|36⁢n3/2⋅K.

Let u∈ℝ and let n=n⁢(u) be large enough so that 0≤1-u22⁢n≤1. For 1≤p≤n, multiplying the above inequality by (1-u22⁢n)n-p yields

|(1-u22⁢n)n-pE(ei⁢u⁢1n⁢Sp)-(1-u22⁢n)n-p+1E(ei⁢u⁢1n⁢Sp-1|≤K|u|36⁢n3/2. (4)

Now, because ∑p=1n(ap-ap-1)=an-a0,

∑p=1n((1-u22⁢n)n-p⁢E⁢(ei⁢u⁢1n⁢Sp)-(1-u22⁢n)n-(p-1)⁢E⁢(ei⁢u⁢1n⁢Sp-1))=E⁢(ei⁢u⁢1n⁢Sn)-(1-u22⁢n)n⁢E⁢(ei⁢u⁢1n⁢S0)=E⁢(ei⁢u⁢1n⁢Sn)-(1-u22⁢n)n.

Using this with (4) gives

|E⁢(ei⁢u⁢1n⁢Sn)-(1-u22⁢n)n|≤n⋅K⁢|u|36⁢n3/2=K⁢|u|36⁢n1/2.

But if |an-bn|≤cn, cn→0, and bn→b, then an→b. As

limn→∞⁡(1-u22⁢n)n=e-u22

and K⁢|u|36⁢n1/2→0, we therefore get that

E⁢(ei⁢u⁢1n⁢Sn)→e-u22

as n→∞.

Let μn=(Snn)*⁢P and let ϕ⁢(u)=e-u22. We have just established that μ~n→ϕ pointwise. The function ϕ is continuous at 0, so Lévy’s continuity theorem tells us that there is a Borel probability measure μ on ℝ such that ϕ=μ~ and such that μn converges narrowly to μ. But ϕ⁢(u)=e-u22 is the characteristic function of γ1, so we have that μn converges narrowly to γ1.

∎