The Lindeberg central limit theorem

Jordan Bell
May 29, 2015

1 Convergence in distribution

We denote by 𝒫⁢(ℝd) the collection of Borel probability measures on ℝd. Unless we say otherwise, we use the narrow topology on 𝒫⁢(ℝd): the coarsest topology such that for each f∈Cb⁢(ℝd), the map

μ↦∫ℝdf⁢𝑑μ

is continuous 𝒫⁢(ℝd)→ℂ. Because ℝd is a Polish space it follows that 𝒫⁢(ℝd) is a Polish space.11 1 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 515, Theorem 15.15; http://individual.utoronto.ca/jordanbell/notes/narrow.pdf (In fact, its topology is induced by the Prokhorov metric.22 2 Onno van Gaans, Probability measures on metric spaces, http://www.math.leidenuniv.nl/~vangaans/jancol1.pdf; Bert Fristedt and Lawrence Gray, A Modern Approach to Probability Theory, p. 365, Theorem 25.)

2 Characteristic functions

For μ∈𝒫⁢(ℝd), we define its characteristic function μ~:ℝd→ℂ by

μ~⁢(u)=∫ℝdei⁢u⋅x⁢𝑑μ⁢(x).
Theorem 1.

If μ∈𝒫⁢(ℝ) has finite kth moment, k≥0, then, writing ϕ=μ~:

  1. 1.

    ϕ∈Ck⁢(ℝ).

  2. 2.

    ϕ(k)⁢(v)=(i)k⁢∫ℝxk⁢ei⁢v⁢x⁢𝑑μ⁢(x).

  3. 3.

    ϕ(k) is uniformly continuous.

  4. 4.

    |ϕk⁢(v)|≤∫ℝ|x|k⁢𝑑μ⁢(x).

Proof.

For 0≤l≤k, define fl:ℝ→ℂ by

fl⁢(v)=∫ℝxl⁢ei⁢v⁢x⁢𝑑μ⁢(x).

For h≠0,

|xl⁢ei⁢v⁢x⁢ei⁢h⁢x-1h|≤|xl⋅x|=|x|l+1,

so by the dominated convergence theorem we have for 0≤l≤k-1,

limh→0⁡fl⁢(v+h)-fl⁢(v)h =limh→0⁡∫ℝxl⁢ei⁢v⁢x⁢ei⁢h⁢x-1h⁢𝑑μ⁢(x)
=∫ℝxl⁢ei⁢v⁢x⁢(limh→0⁡ei⁢h⁢x-1h)⁢𝑑μ⁢(x)
=∫ℝi⁢xl+1⁢ei⁢v⁢x⁢𝑑μ⁢(x).

That is,

fl′=i⁢fl+1.

And, by the dominated convergence, for ϵ>0 there is some δ>0 such that if |w|<δ then

∫ℝ|x|k⁢|ei⁢w⁢x-1|⁢𝑑μ⁢(x)<ϵ,

hence if |v-u|<δ then

|fk⁢(v)-fk⁢(u)| =|∫ℝxk⁢ei⁢u⁢x⁢(ei⁢(v-u)⁢x-1)⁢𝑑μ⁢(x)|
≤∫ℝ|x|k⁢|ei⁢(v-u)⁢x-1|⁢𝑑μ⁢(x)
<ϵ,

showing that fk is uniformly continuous. As well,

|fk⁢(v)|≤∫ℝ|x|k⁢𝑑μ⁢(x)

But ϕ=f0, i.e. ϕ(0)=f0, so

ϕ(1)=f0′=i⁢f1,ϕ(2)=(i⁢f1)′=(i)2⁢f2,⋯,ϕ(k)=(i)k⁢fk.

∎

If ϕ∈Ck⁢(ℝ), Taylor’s theorem tells us that for each x∈ℝ,

ϕ⁢(x) =∑l=0k-1ϕ(l)⁢(0)l!⁢xl+∫0x(x-t)k-1(k-1)!⁢ϕ(k)⁢(t)⁢𝑑t
=∑l=0kϕ(l)⁢(0)l!⁢xl+∫0x(x-t)k-1(k-1)!⁢(ϕ(k)⁢(t)-ϕ(k)⁢(0))⁢𝑑t
=∑l=0kϕ(l)⁢(0)l!⁢xl+Rk⁢(x),

and Rk⁢(x) satisfies

|Rk⁢(x)|≤(sup0≤u≤1⁡|ϕ(k)⁢(u⁢x)-ϕ(k)⁢(0)|)⋅|x|kk!.

Define θk:ℝ→ℂ by θk⁢(0)=0 and for x≠0

θk⁢(x)=k!xk⋅Rk⁢(x),

with which, for all x∈ℝ,

ϕ⁢(x)=∑l=0kϕ(l)⁢(0)l!⁢xl+1k!⁢θk⁢(x)⁢xk.

Because Rk is continuous on ℝ, θk is continuous at each x≠0. Moreover,

|θk⁢(x)|≤sup0≤u≤1⁡|ϕ(k)⁢(u⁢x)-ϕ(k)⁢(0)|,

and as ϕ(k) is continuous it follows that θk is continuous at 0. Thus θk is continuous on ℝ.

Lemma 2.

If μ∈𝒫⁢(ℝ) have finite kth moment, k≥0, and for 0≤l≤k,

Ml=∫ℝxl⁢𝑑μ⁢(x),

then there is a continuous function θ:ℝ→ℂ for which

μ~⁢(x)=∑l=0k(i)l⁢Mll!⁢xl+1k!⁢θ⁢(x)⁢xk.

The function θ satisfies

|θ⁢(x)|≤sup0≤u≤1⁡|μ~(k)⁢(u⁢x)-μ~(k)⁢(0)|.
Proof.

From Theorem 1, μ~∈Ck⁢(ℝ) and

μ~(l)⁢(0)=(i)l⁢∫ℝxl⁢𝑑μ⁢(x)=(i)l⁢Ml.

Thus from what we worked out above with Taylor’s theorem,

μ~⁢(x)=∑l=0k(i)l⁢Mll!⁢xl+1k!⁢θk⁢(x)⁢xk,

for which

|θk⁢(x)|≤sup0≤u≤1⁡|μ~(k)⁢(u⁢x)-μ~(k)⁢(0)|.

∎

For a∈ℝ and σ>0, let

p⁢(t,a,σ2)=1σ⁢2⁢π⁢exp⁡(-(t-a)22⁢σ2),t∈ℝ.

Let γa,σ2 be the measure on ℝ whose density with respect to Lebesgue measure is p⁢(⋅,a,σ2). We call γa,σ2 a Gaussian measure. We calculate that the first moment of γa,σ2 is a and that its second moment is σ2. We also calculate that

γ~a,σ2⁢(x)=exp⁡(i⁢a⁢x-12⁢σ2⁢x2).

Lévy’s continuity theorem is the following.33 3 http://individual.utoronto.ca/jordanbell/notes/martingaleCLT.pdf, p. 19, Theorem 15.

Theorem 3 (Lévy’s continuity theorem).

Let μn be a sequence in 𝒫⁢(ℝd).

  1. 1.

    If μ∈𝒫⁢(ℝd) and μn→μ, then for each μ~n converges to μ~ pointwise.

  2. 2.

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

3 The Lindeberg condition, the Lyapunov condition, the Feller condition, and asymptotic negligibility

Let (Ω,ℱ,P) be a probability and let Xn, n≥1, be independent L2 random variables. We specify when we impose other hypotheses on them; in particular, we specfify if we suppose them to be identically distributed or to belong to Lp for p>2.

For a random variable X, write

σ⁢(X)=Var⁢(X)=E⁢(|X-E⁢(X)|2).

Write

σn=σ⁢(Xn),

and, using that the Xn are independent,

sn=σ⁢(∑j=1nXj)=(∑j=1nσj2)1/2

and

ηn=E⁢(Xn).

For n≥1 and ϵ>0, define

Ln⁢(ϵ) =1sn2∑j=1nE((Xj-ηj)2||Xj-ηj|≥ϵsn)
=1sn2⁢∑j=1n∫|x-ηj|≥ϵ⁢sn(x-ηj)2⁢d⁢(Xj*⁢P)⁢(x).

We say that the sequence Xn satisfies the Lindeberg condition if for each ϵ>0,

limn→∞⁡Ln⁢(ϵ)=0.

For example, if the sequence Xn is identically distributed, then sn2=n⁢σ12, so

Ln⁢(ϵ) =1n⁢σ12⁢∑j=1n∫|x-η1|≥ϵ⁢n1/2⁢σ1(x-η1)2⁢d⁢(X1*⁢P)⁢(x)
=1σ12⁢∫|x-η1|≥ϵ⁢n1/2⁢σ1(x-η1)2⁢d⁢(X1*⁢P).

But if μ is a Borel probability measure on ℝ and f∈L1⁢(μ) and Kn is a sequence of compact sets that exhaust ℝ, then44 4 V. I. Bogachev, Measure Theory, volume I, p. 125, Proposition 2.6.2.

∫ℝ∖Kn|f|⁢𝑑μ→0,n→∞.

Hence Ln⁢(ϵ)→0 as n→∞, showing that Xn satisfies the Lindeberg condition.

We say that the sequence Xn satisfies the Lyapunov condition if there is some δ>0 such that the Xn are L2+δ and

limn→∞⁡1sn2+δ⁢∑j=1nE⁢(|Xj-ηj|2+δ)=0.

In this case, for ϵ>0, then |x-η|≥ϵ⁢sn implies |x-η|2+δ≥|x-η|2⁢(ϵ⁢sn)δ and hence

Ln⁢(ϵ) ≤1sn2⁢∑j=1n∫|x-ηj|≥ϵ⁢sn|x-ηj|2+δ(ϵ⁢sn)δ⁢d⁢(Xj*⁢P)⁢(x)
=1ϵ⁢sn2+δ⁢∑j=1n∫|x-ηj|≥ϵ⁢sn|x-ηj|2+δ⁢d⁢(Xj*⁢P)⁢(x)
=1ϵ⁢sn2+δ⁢∑j=1n∫|Xj-ηj|≥ϵ⁢sn|Xj-ηj|2+δ⁢𝑑P
≤1ϵ⁢sn2+δ⁢∑j=1nE⁢(|Xj-ηj|2+δ)
→0.

This is true for each ϵ>0, showing that if Xn satisfies the Lyapunov condition then it satisfies the Lindeberg condition.

For example, if Xn are identically distributed and L2+δ, then

1sn2+δ⁢∑j=1nE⁢(|Xj-ηj|2+δ)=1nδ/2⁢σ12+δ⁢E⁢(|Xj-ηj|2+δ)→0,

showing that Xn satisfies the Lyapunov condition.

Another example: Suppose that the sequence Xn is bounded by M almost surely and that sn→∞. |Xn|≤M almost surely implies that

|ηn|=|E⁢(Xn)|≤E⁢(|Xn|)≤E⁢(M)=M.

Therefore |Xn-ηn|≤|Xn|+|ηn|≤2⁢M almost surely. Let δ>0. Then, as sn2=n⁢σ12,

1sn2+δ⁢∑j=1nE⁢(|Xj-ηj|2+δ) ≤1sn2+δ⁢∑j=1NE⁢(|Xj-ηj|2)⁢(2⁢M)δ
=(2⁢M)δsnδ
→0,

showing that Xn satisfies the Lyapunov condition.

We say that a sequence of random variables Xn satisfies the Feller condition when

limn→∞⁡max1≤j≤n⁡σjsn=0,

where σj=σ⁢(Xj)=Var⁢(Xj) and

sn=(∑j=1nσj2)1/2.

We prove that if a sequence satisfies the Lindeberg condition then it satisfies the Feller condition.55 5 Heinz Bauer, Probability Theory, p. 235, Lemma 28.2.

Lemma 4.

If a sequence of random variables Xn satisfies the Lindeberg condition, then it satisfies the Feller condition.

Proof.

Let ϵ>0¿ For n≥1 and 1≤k≤n, we calculate

σk2 =∫ℝ(x-ηk)2⁢d⁢(Xk*⁢P)⁢(x)
=∫|x-ηk|<ϵ⁢sn(x-ηk)2⁢d⁢(Xk*⁢P)⁢(x)+∫|x-ηk|≥ϵ⁢sn(x-ηk)2⁢d⁢(Xk*⁢P)⁢(x)
≤(ϵ⁢sn)2+∑j=1n∫|x-ηj|≥ϵ⁢sn(x-ηj)2⁢d⁢(Xj*⁢P)⁢(x)
=ϵ2⁢sn2+sn2⁢Ln⁢(ϵ).

Hence

max1≤k≤n(σksn)2≤ϵ2+Ln(ϵ),

and so, because the Xn satisfy the Lindeberg condition,

lim supn→∞max1≤k≤n(σksn)2≤ϵ2.

This is true for all ϵ>0, which yields

limn→∞max1≤k≤n(σksn)2=0,

namely, that the Xn satisfy the Feller condition. ∎

We do not use the following idea of an asymptotically negligible family of random variables elsewhere, and merely take this as an excsuse to write out what it means. A family of random variables Xn,j, n≥1, 1≤j≤kn, is called asymptotically negligible66 6 Heinz Bauer, Probability Theory, p. 225, §27.2. if for each ϵ>0,

limn→∞max1≤j≤knP(|Xn,j|≥ϵ)=0.

A sequence of random variables Xn converging in probability to 0 is equivalent to it being asymptotically negligible, with kn=1 for each n.

For example, suppose that Xn,j are L2 random variables each with E⁢(Xn,j)=0 and that they satisfy

limn→∞⁡max1≤j≤kn⁡Var⁢(Xn,j)=0.

For ϵ>0, by Chebyshev’s inequality,

P(|Xn,j|≥ϵ)≤1ϵ2E(|Xn,j|2)=1ϵ2Var(Xn,j),

whence

limn→∞max1≤j≤knP(|Xn,j|≥ϵ)≤lim supn→∞max1≤j≤kn1ϵ2Var(Xn,j)=0,

and so the random variables Xn,j are asymptotically negligible.

Another example: Suppose that random variables Xn,j are identically distributed, with μ=Xn,j*⁢P. For ϵ>0,

P(|Xn,jn|≥ϵ)=P(|Xn,j|≥nϵ)=μ(An),

where An={x∈ℝ:|x|≥n⁢ϵ}. As An↓∅, limn→∞⁡μ⁢(An)=0. Hence the random variables Xn,jn are asymptotic negligible.

The following is a statement about the characteristic functions of an asymptotically negligible family of random variables.77 7 Heinz Bauer, Probability Theory, p. 227, Lemma 27.3.

Lemma 5.

Suppose that a family Xn,j, n≥1, 1≤j≤kn, of random variables is asymptotically negligible, and write μn,j=Xn,j*⁢P and ϕn,j=μ~n,j. For each x∈ℝ,

limn→∞⁡max1≤j≤kn⁡|ϕn,j⁢(x)-1|=0.
Proof.

For any real t, |ei⁢t-1|≤|t|. For x∈ℝ, ϵ>0, n≥1, and 1≤j≤kn,

|ϕn,j⁢(x)-1| =|∫ℝ(ei⁢x⁢y-1)⁢𝑑μn,j⁢(y)|
≤∫|y|<ϵ|ei⁢x⁢y-1|⁢𝑑μn,j⁢(y)+∫|y|≥ϵ|ei⁢x⁢y-1|⁢𝑑μn,j⁢(y)
≤∫|y|<ϵ|x⁢y|⁢𝑑μn,j⁢(y)+∫|y|≥ϵ2⁢𝑑μn,j⁢(y)
≤ϵ|x|+2P(|Xn,j|≥ϵ).

Hence

max1≤j≤kn|ϕn,j(x)-1|≤ϵ|x|+2max1≤j≤knP(|Xn,j|≥ϵ).

Using that the family Xn,j is asymptotically negligible,

lim supn→∞⁡max1≤j≤kn⁡|ϕn,j⁢(x)-1|≤2⁢ϵ⁢|x|.

But this is true for all ϵ>0, so

lim supn→∞⁡max1≤j≤kn⁡|ϕn,j⁢(x)-1|=0,

proving the claim. ∎

4 The Lindeberg central limit theorem

We now prove the Lindeberg central limit theorem.88 8 Heinz Bauer, Probability Theory, p. 235, Theorem 28.3.

Theorem 6 (Lindeberg central limit theorem).

If Xn is a sequence of independent L2 random variables that satisfy the Lindeberg condition, then

Sn*⁢P→γ1,

where

Sn=1sn⁢∑j=1n(Xj-ηj)=∑j=1n(Xj-E⁢(Xj))σ⁢(X1+⋯+Xn).
Proof.

The sequence Yn=Xn-E⁢(Xn) are independent L2 random variables that satisfy the Lindeberg condition and σ⁢(Yn)=σ⁢(Xn). Proving the claim for the sequence Yn will prove the claim for the sequence Xn, and thus it suffices to prove the claim when E⁢(Xn)=0, i.e. ηn=0.

For n≥1 and 1≤j≤n, let

μn,j=(Xjsn)*⁢P  and  τn,j=σjsn.

The first moment of μn,j is

∫ℝx⁢d⁢((Xjsn)*⁢P)⁢(x)=∫ΩXjsn⁢𝑑P=1sn⁢E⁢(Xj)=0,

and the second moment of μn,j is

∫ℝx2⁢d⁢((Xjsn)*⁢P)⁢(x)=∫Ω(Xjsn)2⁢𝑑P=1sn2⁢E⁢(Xj2)=σj2sn2=τn,j2,

for which

∑j=1nτn,j2=1sn2⁢∑j=1nσj2=1.

For μ∈𝒫⁢(ℝ) with first moment ∫ℝx⁢𝑑μ⁢(x)=0 and second moment ∫ℝx2⁢𝑑μ⁢(x)=σ2<∞, Lemma 2 tells us that

μ~⁢(x)=M0+i⁢M1⁢x-M22⁢x2+12⁢θ2⁢(x)⁢x2=1-σ22⁢x2+12⁢θ⁢(x)⁢x2,

with

|θ⁢(x)|≤sup0≤u≤1⁡|μ~′′⁢(u⁢x)-μ~′′⁢(0)|.

But by Lemma 1,

μ~′′⁢(u⁢x)=-∫ℝy2⁢ei⁢u⁢x⁢y⁢𝑑μ⁢(y),

so

|θ⁢(x)| ≤sup0≤u≤1⁡|∫ℝy2⁢(-ei⁢u⁢x⁢y+1)⁢𝑑μ⁢(y)|
≤sup0≤u≤1⁡∫ℝy2⁢|ei⁢u⁢x⁢y-1|⁢𝑑μ⁢(y).

For 0≤u≤1, |ei⁢u⁢x⁢y-1|≤|u⁢x⁢y|≤|x⁢y|, so for x∈ℝ and ϵ>0, with δ=min⁡{ϵ,ϵ|x|}, when |y|<δ and 0≤u≤1 we have |ei⁢u⁢x⁢y-1|<ϵ. Thus

|θ⁢(x)| ≤sup0≤u≤1⁡∫|y|<δy2⁢|ei⁢u⁢x⁢y-1|⁢𝑑μ⁢(y)+sup0≤u≤1⁡∫|y|≥δy2⁢|ei⁢u⁢x⁢y-1|⁢𝑑μ⁢(y)
≤ϵ⁢∫|y|<δy2⁢𝑑μ⁢(y)+2⁢∫|y|≥δy2⁢𝑑μ⁢(y)
≤ϵ⁢σ2+2⁢∫|y|≥δy2⁢𝑑μ⁢(y).

Let x∈ℝ and ϵ>0, and take δ=min⁡{ϵ,ϵ|x|}. On the one hand, for n≥1 and 1≤j≤n, because the first moment of μn,j is 0 and its second moment is τn,j2,

μ~n,j⁢(x)=1-τn,j22⁢x2+12⁢θn,j⁢(x)⁢x2,

with, from the above,

|θn,j⁢(x)|≤ϵ⁢τn,j2+2⁢∫|y|≥δy2⁢𝑑μn,j⁢(y).

On the other hand, the first moment of the Gaussian measure γ0,τn,j2 is 0 and its second moment is τn,j2. Its characteristic function is

γ~0,τn,j2⁢(x)=exp⁡(-τn,j22⁢x2)=1-τn,j22⁢x2+12⁢ψn,j⁢(x)⁢x2,

with, from the above,

|ψn,j⁢(x)|≤ϵ⁢τn,j2+2⁢∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(x).

In particular, for all x∈ℝ,

μ~n,j⁢(x)-γ~0,τn,j2⁢(x)=x22⁢(θn,j⁢(x)-ψn,j⁢(x)).

For k≥1 and for al,bl∈ℂ, 1≤l≤k,

∏l=1kal-∏l=1kbl=∑l=1kb1⁢⋯⁢bl-1⁢(al-bl)⁢al+1⁢⋯⁢ak.

If further |al|≤1, |bl|≤1, then

|∏l=1kal-∏l=1kbl|≤∑l=1k|al-bl|. (1)

Because the Xn are independent, the distribution of

Sn=∑j=1nXjsn

is the convolution of the distributions of the summands:

μn,1*⋯*μn,n,

whose characteristic function is

ϕn=∏j=1nμ~n,j,

since the characteristic function of a convolution of measures is the product of the characteristic functions of the measures. Using ∑j=1nτn,j2=1 and (1), for x∈ℝ we have

|ϕn⁢(x)-e-x22| =|∏j=1nμ~n,j⁢(x)-∏j=1ne-12⁢τn,j2⁢x2|
≤∑j=1n|μ~n,j⁢(x)-e-12⁢τn,j2⁢x2|
=∑j=1n|μ~n,j⁢(x)-γ~0,τn,j2⁢(x)|
=x22⁢∑j=1n|θn,j⁢(x)-ψn,j⁢(x)|.

Therefore, for x∈ℝ, ϵ>0, and δ=min⁡{ϵ,ϵ|x|},

|ϕn⁢(x)-e-x22|≤x22⁢∑j=1n(ϵ⁢τn,j2+2⁢∫|y|≥δy2⁢𝑑μn,j⁢(y)+ϵ⁢τn,j2+2⁢∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(y))=ϵ⁢x2+x2⁢∑j=1n∫|y|≥δy2⁢𝑑μn,j⁢(y)+x2⁢∑j=1n∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(y).

We calculate

Ln⁢(δ) =1sn2⁢∑j=1n∫|y|≥δ⁢sny2⁢d⁢(Xj*⁢P)⁢(y)
=1sn2⁢∑j=1n∫|Xj|≥δ⁢snXj2⁢𝑑P
=∑j=1n∫|Xjsn|≥δ(Xjsn)2⁢𝑑P
=∑j=1n∫|y|≥δy2⁢d⁢((Xjsn)*⁢P)⁢(y)
=∑j=1n∫|y|≥δy2⁢𝑑μn,j⁢(y).

Hence, the fact that the Xn satisfy the Lindeberg condition yields

lim supn→∞⁡|ϕn⁢(x)-e-x22|≤ϵ⁢x2+x2⁢lim supn→∞⁡∑j=1n∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(y). (2)

Write

αn=max1≤j≤n⁡τn,j=max1≤j≤n⁡σjsn.

We calculate

∑j=1n∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(y) =∑j=1n∫|y|≥δy2⁢1τn,j⁢2⁢π⁢exp⁡(-y22⁢τn,j2)⁢𝑑y
=∑j=1nτn,j2⁢∫|u|≥δ/τn,ju2⁢𝑑γ0,1⁢(u)
≤∑j=1nτn,j2⁢∫|u|≥δ/αnu2⁢𝑑γ0,1⁢(u)
=∫|u|≥δ/αnu2⁢𝑑γ0,1⁢(u).

Because the sequence Xn satisfies the Lindeberg condition, by Lemma 4 it satisfies the Feller condition, which means that αn→0 as n→∞. Because αn→0 as n→∞, δ/αn→∞ as n→∞, hence

∫|u|≥δ/αnu2⁢𝑑γ0,1⁢(u)→0

as n→∞. Thus we get

∑j=1n∫|y|≥δy2⁢𝑑γ0,τn,j2⁢(y)→0

as n→∞. Using this with (2) yields

lim supn→∞⁡|ϕn⁢(x)-e-x22|≤ϵ⁢x2.

This is true for all ϵ>0, so

limn→∞⁡|ϕn⁢(x)-e-x22|=0,

namely, ϕn (the characteristic function of Sn*⁢P) converges pointwise to e-x22. Moreover, e-x22 is indeed continuous at 0, and e-x22=γ~0,1⁢(x). Therefore, Lévy’s continuity theorem (Theorem 3) tells us that Sn*⁢P converges narrowly to γ0,1, which is the claim. ∎