Gaussian measures, Hermite polynomials, and the Ornstein-Uhlenbeck semigroup

Jordan Bell
June 27, 2015

1 Definitions

For a topological space X, we denote by ℬX the Borel σ-algebra of X.

We write ℝ¯=ℝ∪{-∞,∞}. With the order topology, ℝ¯ is a compact metrizable space, and ℝ has the subspace topology inherited from ℝ¯, namely the inclusion map is an embedding ℝ→ℝ¯. It follows that11 1 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 138, Lemma 4.20.

ℬℝ={E∩ℝ:E∈ℬℝ¯}.

If ℱ is a collection of functions X→ℝ¯ on a set X, we define ⋁ℱ:X→ℝ¯ and ⋀ℱ:X→ℝ¯ by

(⋁ℱ)⁢(x)=sup⁡{f⁢(x):f∈ℱ},x∈X

and

(⋀ℱ)⁢(x)=inf⁡{f⁢(x):f∈ℱ},x∈X.

If X is a measurable space and ℱ is a countable collection of measurable functions X→ℝ¯, it is a fact that ⋀ℱ and ⋁ℱ are measurable X→ℝ¯.

2 Kolmogorov’s inequality

Kolmogorov’s inequality is the following.22 2 Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second ed., p. 322, Theorem 10.11.

Theorem 1 (Kolmogorov’s inequality).

Suppose that (Ω,𝒮,P) is a probability space, that X1,…,Xn∈L2⁢(P), that E⁢(X1)=0,…,E⁢(Xn)=0, and that X1,…,Xn are independent. Let

Sk⁢(ω)=∑j=1kXj⁢(ω),ω∈Ω,

for 1≤k≤n. Then for any λ>0,

P⁢({ω∈Ω:⋁k=1n|Sk⁢(ω)|≥λ})≤1λ2⁢∑j=1nV⁢(Xj)=1λ2⁢V⁢(Sn).

3 Gaussian measures on R

For real a and σ>0, one computes that

1σ⁢2⁢π⁢∫ℝexp⁡(-(t-a)22⁢σ2)⁢𝑑t=1. (1)

Suppose that γ is a Borel probability measure on ℝ. If

γ=δa

for some a∈ℝ or has density

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

for some a∈ℝ and some σ>0, with respect to Lebesgue measure on ℝ, we say that γ is a Gaussian measure. We say that δa is a Gaussian measure with mean a and variance 0, and that a Gaussian measure with density p⁢(⋅,a,σ2) has mean a and variance σ2. A Gaussian measure with mean 0 and variance 1 is said to be standard.

One calculates that the characteristic function of a Gaussian measure γ with density p⁢(⋅,a,σ2) is

γ~⁢(y)=∫ℝexp⁡(i⁢y⁢x)⁢𝑑γ⁢(x)=exp⁡(i⁢a⁢y-12⁢σ2⁢y2),y∈ℝ. (2)

The cumulative distribution function of a standard Gaussian measure γ is, for t∈ℝ,

Φ⁢(t)=γ⁢(-∞,t]=∫-∞t𝑑γ⁢(s)=∫-∞tp⁢(s,0,1)⁢𝑑s=∫-∞t12⁢π⁢exp⁡(-s22)⁢𝑑s.

We define Φ⁢(-∞)=0 and also define

Φ⁢(∞)=∫-∞∞12⁢π⁢exp⁡(-s22)⁢𝑑s=1,

using (1).

Φ:ℝ¯→[0,1] is strictly increasing, thus Φ-1:[0,1]→ℝ¯ makes sense, and is itself strictly increasing. Then 1-Φ is strictly decreasing. By (1),

1-Φ⁢(t) =∫-∞∞12⁢π⁢exp⁡(-s22)⁢𝑑s-∫-∞t12⁢π⁢exp⁡(-s22)⁢𝑑s
=∫t∞12⁢π⁢exp⁡(-s22)⁢𝑑s.

The following lemma gives an estimate for 1-Φ⁢(t) that tells us something substantial as t→+∞, beyond the immediate fact that (1-Φ)⁢(∞)=1-Φ⁢(∞)=0.33 3 Vladimir I. Bogachev, Gaussian Measures, p. 2, Lemma 1.1.3.

Lemma 2.

For t>0,

12⁢π⁢(1t-1t3)⁢e-t2/2≤1-Φ⁢(t)≤12⁢π⁢1t⁢e-t2/2.
Proof.

Integrating by parts,

1-Φ⁢(t) =∫t∞12⁢π⁢exp⁡(-s22)⁢𝑑s
=∫t∞1s⁢2⁢π⋅s⁢exp⁡(-s22)⁢𝑑s
=-1s⁢2⁢π⁢exp⁡(-s22)|t∞-∫t∞1s2⁢2⁢π⁢exp⁡(-s22)⁢𝑑s
≤1t⁢2⁢π⁢exp⁡(-t22).

On the other hand, using the above work and again integrating by parts,

1-Φ⁢(t) =1t⁢2⁢π⁢exp⁡(-t22)-∫t∞1s3⁢2⁢π⋅s⁢exp⁡(-s22)⁢𝑑s
=1t⁢2⁢π⁢exp⁡(-t22)+1s3⁢2⁢π⁢exp⁡(-s22)|t∞
+∫t∞3s4⁢2⁢π⁢exp⁡(-s22)⁢𝑑s
≥1t⁢2⁢π⁢exp⁡(-t22)-1t3⁢2⁢π⁢exp⁡(-t22).

∎

The following theorem shows that if the variances of a sequence of independent centered random variables are summable then the sequence of random variables is summable almost surely.44 4 Karl R. Stromberg, Probability for Analysts, p. 58, Theorem 4.6.

Theorem 3.

Suppose that ξj∈L2⁢(Ω,𝒮,P), j≥1, are independent random variables each with mean 0. If ∑j=1∞V⁢(ξj)<∞, then ∑j=1∞ξj converges almost surely.

Proof.

Define Sn:Ω→ℝ by

Sn⁢(ω)=∑j=1nξj⁢(ω),

define Zn:Ω→[0,∞] by

Zn=⋁j=1∞|Sn+j-Sn|,

and define Z:Ω→[0,∞] by

Z=⋀n=1∞Zn.

If Sn⁢(ω) converges and ϵ>0, there is some n such that for all j≥1, |Sn+j⁢(ω)-Sn⁢(ω)|<ϵ and so Zn⁢(ω)≤ϵ and Z⁢(ω)≤ϵ. Therefore, if Sn⁢(ω) converges then Z⁢(ω)=0. On the other hand, if Z⁢(ω)=0 and ϵ>0, there is some n such that Zn⁢(ω)<ϵ, hence |Sn+j⁢(ω)-Sn⁢(ω)|<ϵ for all j≥1. That is, Sn⁢(ω) is a Cauchy sequence in ℝ, and hence converges. Therefore

{ω∈Ω:Sn⁢(ω) converges}={ω∈Ω:Z⁢(ω)=0}. (3)

Let ϵ>0. For any n and k, using Kolmogorov’s inequality with Xj=ξn+j for j=1,…,k,

P(⋁j=1k|Sn+j-Sn|≥ϵ)≤1ϵ2∑j=1kV(Xj)≤1ϵ2∑j=n+1∞V(ξj).

Because this is true for each k, it follows that

P(Zn≥ϵ)≤1ϵ2∑j=n+1∞V(ξj),

hence, for each n,

P(Z≥ϵ)≤P(Zn≥ϵ)≤1ϵ2∑j=n+1∞V(ξj).

Because ∑j=1∞V⁢(ξj)<∞, ∑j=n+1∞V⁢(ξj)→0 as n→∞, so

P(Z≥ϵ)=0.

Because this is true for all ϵ>0, we get P(Z>0)=0, i.e. P(Z=0)=1. By (3), this means that Sn converges almost surely. ∎

The following theorem gives conditions under which the converse of the above theorem holds.55 5 Karl R. Stromberg, Probability for Analysts, p. 59, Theorem 4.7.

Theorem 4.

Suppose that ξj∈L2⁢(Ω,𝒮,P), j≥1, are independent random variables each with mean 0, and let Sn=∑j=1nξj. If

P(⋁n=1∞|Sn|<∞)>0 (4)

and there is some β∈[0,∞) such that ⋁j=1∞|ξj|≤β almost surely, then

∑j=1∞V⁢(ξj)<∞.
Proof.

By (4), there is some α∈[0,∞) such that P⁢(A)>0, for

A={ω∈Ω:⋁n=1∞|Sn⁢(ω)|≤α}.

For p≥1, let

Ap={ω∈Ω:⋁n=1p|Sn⁢(ω)|≤α},

which satisfies Ap↓A as p→∞. For each p, the random variables χAp⁢Sp and ξp+1 are independent and the random variables χAp and ξp+12 are independent, whence

E⁢(χAp⁢Sp+12) =E⁢(χAp⁢(Sp+ξp+1)⁢(Sp+ξp+1))
=E⁢(χAp⁢Sp2+2⁢χAp⁢Sp⁢ξp+1+χAp⁢ξp+12)
=E⁢(χAp⁢Sp2)+2⁢E⁢(χAp⁢Sp)⁢E⁢(ξp+1)+E⁢(χAp)⁢E⁢(ξp+12)
=E⁢(χAp⁢Sp2)+P⁢(Ap)⁢V⁢(ξp+1)
≥E⁢(χAp⁢Sp2)+P⁢(A)⁢V⁢(ξp+1).

Set Bp=Ap∖Ap+1. For ω∈Ap, |Sp⁢(ω)|≤α, and for almost all ω∈Ω, |ξp+1⁢(ω)|≤β, so for almost all ω∈Bp,

|Sp+1(ω)|≤|Sp(ω)|+|ξp+1(ω)≤α+β,

hence

P⁢(A)⁢V⁢(ξp+1) ≤E⁢((χBp+χAp+1)⁢Sp+12)-E⁢(χAp⁢Sp2)
=E⁢(χBp⁢Sp+12)+E⁢(χAp+1⁢Sp+12)-E⁢(χAp⁢Sp2)
≤P⁢(Bp)⁢(α+β)2+E⁢(χAp+1⁢Sp+12)-E⁢(χAp⁢Sp2).

Adding the inequalities for p=1,2,…,n-1, because Bp are pairwise disjoint,

P⁢(A)⁢∑p=1n-1V⁢(ξp+1) =(α+β)2⁢∑p=1n-1P⁢(Bp)+E⁢(χAn⁢Sn2)-E⁢(χA1⁢S12)
≤(α+β)2+E⁢(χAn⁢Sn2)
≤(α+β)2+α2.

Because this is true for all n and P⁢(A)>0,

∑p=1∞V⁢(ξp+1)<∞,

and with V⁢(ξ1)<∞ this completes the proof. ∎

4 Rn

If μ is a finite Borel measure on ℝn, we define the characteristic function of μ by

μ~⁢(y)=∫ℝnei⁢⟨y,x⟩⁢𝑑μ⁢(x),y∈ℝn.

A Borel probability measure γ on ℝn is said to be Gaussian if for each f∈(ℝn)*, the pushforward measure f*⁢γ on ℝ is a Gaussian measure on ℝ, where

(f*⁢γ)⁢(E)=γ⁢(f-1⁢(E))

for E a Borel set in ℝ.

We now give a characterization of Gaussian measures on ℝn and their densities.66 6 Vladimir I. Bogachev, Gaussian Measures, p. 3, Proposition 1.2.2; Michel Simonnet, Measures and Probabilities, p. 303, Theorem 14.5. In the following theorem, the vector a∈ℝn is called the mean of γ and the linear transformation K∈ℒ⁢(ℝn) is called the covariance operator of γ. When a=0∈ℝn and K=idℝn, we say that γ is standard.

Theorem 5.

A Borel probability measure γ on ℝn is Gaussian if and only if there is some a∈ℝn and some positive semidefinite K∈ℒ⁢(ℝn) such that

γ~⁢(y)=exp⁡(i⁢⟨y,a⟩-12⁢⟨K⁢y,y⟩),y∈ℝn. (5)

If γ is a Gaussian measure whose covariance operator K is positive definite, then the density of γ with respect to Lebesgue measure on ℝn is

x↦1(2⁢π)n⁢det⁡K⁢exp⁡(-12⁢⟨K-1⁢(x-a),x-a⟩),x∈ℝn.
Proof.

Suppose that (5) is satisfied. Let f∈(ℝn)*, i.e. a linear map ℝn→ℝ, and put ν=f*⁢γ. Using the change of variables formula, the characteristic function of ν is

ν~⁢(t)=∫ℝei⁢t⁢s⁢𝑑ν⁢(s)=∫ℝnei⁢t⁢f⁢(x)⁢𝑑γ⁢(x),t∈ℝ.

Let v be the unique element of ℝn such that f⁢(x)=⟨v,x⟩ for all x∈ℝn. Then

ν~⁢(t)=∫ℝnei⁢⟨t⁢v,x⟩⁢𝑑γ⁢(x)=γ~⁢(t⁢v).

so by (5),

ν~⁢(t)=exp⁡(i⁢⟨t⁢v,a⟩-12⁢⟨K⁢t⁢v,t⁢v⟩)=exp⁡(i⁢f⁢(a)⁢t-12⁢⟨K⁢v,v⟩⁢t2).

This implies that ν is a Gaussian measure on ℝ with mean f⁢(a) and variance ⟨K⁢v,v⟩: if ⟨K⁢v,v⟩=0 then ν=δf⁢(a), and if ⟨K⁢v,v⟩>0 then ν has density

1⟨K⁢v,v⟩⁢2⁢π⁢exp⁡(-(s-f⁢(a))22⁢⟨K⁢v,v⟩),s∈ℝ,

with respect to Lebesgue measure on ℝ. That is, for any f∈(ℝn)*, the pushforward measure f*⁢γ is a Gaussian measure on ℝ, which is what it means for γ to be a Gaussian measure on ℝn.

Suppose that γ is Gaussian and let f∈(ℝn)*. Then the pushforward measure f*⁢γ is a Gaussian measure on ℝ. Let a⁢(f) be the mean of f*⁢γ and let σ2⁢(f) be the variance of f*⁢γ, and let vf be the unique element of ℝn such that f⁢(x)=⟨x,vf⟩ for all x∈ℝn. Using the change of variables formula,

a⁢(f)=∫ℝt⁢d⁢(f*⁢γ)⁢(t)=∫ℝnf⁢(x)⁢𝑑γ⁢(x)

and

σ2⁢(f) =∫ℝ(t-a⁢(f))2⁢d⁢(f*⁢γ)⁢(t)
=∫ℝn(f⁢(x)-a⁢(f))2⁢𝑑γ⁢(x)
=∫ℝn(f⁢(x)2-2⁢f⁢(x)⁢a⁢(f)+a⁢(f)2)⁢𝑑γ⁢(x).

Because f↦a⁢(f) is linear (ℝn)*→ℝ, there is a unique a∈ℝn=(ℝn)** such that

a⁢(f)=⟨vf,a⟩,f∈(ℝn)*.

For f,g∈(ℝn)*,

σ2⁢(f+g) =∫ℝn(f(x)2+2f(x)g(x)+g(x)2
-2⁢f⁢(x)⁢a⁢(f)-2⁢f⁢(x)⁢a⁢(g)-2⁢g⁢(x)⁢a⁢(f)-2⁢g⁢(x)⁢a⁢(g)
+a(f)2+2a(f)a(g)+a(g)2)dγ(x),

so

σ2⁢(f+g)-σ2⁢(f)-σ2⁢(g) =∫ℝn(2f(x)g(x)-2f(x)a(g)-2g(x)a(f)
+2a(f)a(g))dγ(x).

B⁢(f,g)=12⁢(σ2⁢(f+g)-σ2⁢(f)-σ2⁢(g)) is a symmetric bilinear form on ℝn, and

B⁢(f,f)=2⁢∫ℝn(f⁢(x)-a⁢(f))2⁢𝑑γ⁢(x)≥0,

namely, B is positive semidefinite. It follows that there is a unique positive semidefinite K∈ℒ⁢(ℝn) such that B⁢(f,g)=⟨K⁢vf,vg⟩ for all f,g∈(ℝn)*. For y∈ℝn and for vf=y, using the change of variables formula, using the fact that f*⁢γ is a Gaussian measure on ℝ with mean

a⁢(f)=⟨vf,a⟩=⟨y,a⟩

and variance

σ2⁢(f)=B⁢(f,f)=⟨K⁢vf,vf⟩=⟨K⁢y,y⟩

and using (2),

γ~⁢(y) =∫ℝnei⁢f⁢(x)⁢𝑑γ⁢(x)
=∫ℝei⁢t⁢d⁢(f*⁢γ)⁢(t)
=exp⁡(i⁢⟨y,a⟩⋅1-12⁢⟨K⁢y,y⟩⋅12)
=exp⁡(i⁢⟨y,a⟩-12⁢⟨K⁢y,y⟩),

which shows that (5) is satisfied.

Suppose that γ is a Gaussian measure and further that the covariance operator K is positive definite. By the spectral theorem, there is an orthonormal basis {e1,…,en} for ℝn such that ⟨K⁢ej,ej⟩>0 for each 1≤j≤n. Write ⟨K⁢ej,ej⟩=σj2, and for y∈ℝn set yj=⟨y,ej⟩, with which y=y1⁢e1+⋯+yn⁢en and then

⟨K⁢y,y⟩ =⟨y1⁢K⁢e1+⋯+yn⁢K⁢en,y1⁢e1+⋯+yn⁢en⟩
=⟨y1⁢σ12⁢e1+⋯+yn⁢σn2⁢en,y1⁢e1+⋯+yn⁢en⟩
=σ12⁢y12+⋯+σn2⁢yn2.

And

⟨y,a⟩=⟨y1⁢e1+⋯+yn⁢en,a1⁢e1+⋯+an⁢en⟩=a1⁢y1+⋯+an⁢yn.

Let γj be the Gaussian measure on ℝ with mean aj and variance σj2. Because σj2>0, the measure γj has density p⁢(⋅,aj,σj2) with respect to Lebesgue measure on ℝ, and thus

γ~⁢(y) =exp⁡(i⁢⟨y,a⟩-12⁢⟨K⁢y,y⟩)
=exp⁡(i⁢∑j=1naj⁢yj-12⁢∑j=1nσj2⁢yj2)
=∏j=1nexp⁡(i⁢aj⁢yj-12⁢σj2⁢yj2)
=∏j=1nγj~⁢(yj)
=∏j=1n∫ℝexp⁡(i⁢yj⁢t)⁢𝑑γj⁢(t)
=∏j=1n∫ℝexp⁡(i⁢yj⁢t)⁢p⁢(t,aj,σj2)⁢𝑑t
=∫ℝn∏j=1nexp⁡(i⁢yj⁢xj)⁢p⁢(xj,aj,σj2)⁢d⁢x
=∫ℝnei⁢⟨y,x⟩⁢∏j=1np⁢(xj,aj,σj2)⁢d⁢x.

This implies that γ has density

x↦∏j=1np⁢(xj,aj,σj2),x∈ℝn,

with respect to Lebesgue measure on ℝn. Moreover,

⟨K-1⁢(x-a),x-a⟩ =⟨∑j=1nσj-2⁢(xj-aj)⁢ej,∑j=1n(xj-aj)⁢ej⟩
=∑j=1n(xj-aj)2σj2,

so we have, as det⁡K=∏j=1nσj2,

∏j=1np⁢(xj,aj,σj2) =∏j=1n1σj⁢2⁢π⁢exp⁡(-(xj-aj)22⁢σj2)
=1(2⁢π)n⁢det⁡K⁢exp⁡(-12⁢⟨K-1⁢(x-a),x-a⟩).

∎

Because ℝ is a second-countable topological space, the Borel σ-algebra ℬℝn is equal to the product σ-algebra ⊗j=1nℬℝ. The density of the standard Gaussian measure γn with respect to Lebesgue measure on ℝn is, by Theorem 5,

x↦1(2⁢π)n⁢exp⁡(-12⁢⟨x,x⟩),x∈ℝn.

It follows that γn is equal to the product measure ∏j=1nγ1, and thus that the probability space (ℝn,ℬℝn,γn) is equal to the product ∏j=1n(ℝ,ℬℝ,γ1).

For f1,…,fn∈L2⁢(γ1), we define f1⊗⋯⊗fn∈L2⁢(γn), called the tensor product of f1,…,fn, by

(f1⊗⋯⊗fn)⁢(x)=∏j=1nfj⁢(xj),x=(x1,…,xn)∈ℝn.

It is straightforward to check that for f1,…,fn,g1,…,gn∈L2⁢(γ1),

⟨f1⊗⋯⊗fn,g1⊗⋯⊗gn⟩L2⁢(γn)=∏j=1n⟨fj,gj⟩L2⁢(γ1).

One proves that the linear span of the collection of all tensor products is dense in L2⁢(γn), and that {vk:k≥0} is an orthonormal basis for L2⁢(γ1), then

{vk1⊗⋯⊗vkn:(k1,…,kn)∈ℤ≥0n} (6)

is an orthonormal basis for L2⁢(γn).

We will later use the following statement about centered Gaussian measures.77 7 Vladimir I. Bogachev, Gaussian Measures, p. 5, Lemma 1.2.5.

Theorem 6.

Let γ be a Gaussian measure on ℝn with mean 0 and let θ∈ℝ. Then the pushforward of the product measure γ×γ on ℝn×ℝn under the mapping (u,v)↦u⁢sin⁡θ+v⁢cos⁡θ, ℝn×ℝn→ℝn, is equal to γ.

Proof.

Let μ be the pushforward of γ×γ under the above mapping. and let K∈ℒ⁢(ℝn) be the covariance operator of γ. For y∈ℝn, using the change of variables formula,

∫ℝnexp⁡(i⁢⟨y,x⟩)⁢𝑑μ⁢(x) =∫ℝn×ℝnexp⁡(i⁢⟨y,u⁢sin⁡θ+v⁢cos⁡θ⟩)⁢d⁢(γ×γ)⁢(u,v)
=(∫ℝnexp⁡(i⁢⟨y⁢sin⁡θ,u⟩)⁢𝑑γ⁢(u))
⋅(∫ℝnexp⁡(i⁢⟨y⁢cos⁡θ,v⟩)⁢𝑑γ⁢(v))
=γ~⁢(y⁢sin⁡θ)⁢γ~⁢(y⁢cos⁡θ).

By Theorem 5,

γ~⁢(y⁢sin⁡θ)⁢γ~⁢(y⁢cos⁡θ) =exp⁡(-12⁢⟨K⁢y⁢sin⁡θ,y⁢sin⁡θ⟩)⁢exp⁡(-12⁢⟨K⁢y⁢cos⁡θ,y⁢cos⁡θ⟩)
=exp⁡(-12⁢sin2⁡(θ)⁢⟨K⁢y,y⟩-12⁢cos2⁡(θ)⁢⟨K⁢y,y⟩)
=exp⁡(-12⁢⟨K⁢y,y⟩).

Thus, the characteristic function of μ is

μ~⁢(y)=exp⁡(-12⁢⟨K⁢y,y⟩),y∈ℝn,

which implies that μ is equal to the Gaussian measure with mean 0 and covariance operator K, i.e., μ=γ. ∎

5 Hermite polynomials

For k≥0, we define the Hermite polynomial Hk by

Hk⁢(t)=(-1)kk!⁢exp⁡(t22)⁢dkd⁢tk⁢exp⁡(-t22),t∈ℝ.

It is apparent that Hk⁢(t) is a polynomial of degree k.

Theorem 7.

For real λ and t,

exp⁡(λ⁢t-12⁢λ2)=∑k=0∞1k!⁢Hk⁢(t)⁢λk.
Proof.

For u∈ℂ, let g⁢(u)=exp⁡(-12⁢u2). For t∈ℝ,

g⁢(u) =∑k=0∞g(k)⁢(t)k!⁢(u-t)k
=∑k=0∞k!(-1)k⁢exp⁡(-t22)⁢Hk⁢(t)⁢1k!⁢(u-t)k
=exp⁡(-t22)⁢∑k=0∞(-1)kk!⁢Hk⁢(t)⁢(u-t)k.

Therefore, for real λ and t,

exp⁡(λ⁢t-12⁢λ2) =exp⁡(12⁢t2-12⁢(λ-t)2)
=exp⁡(12⁢t2)⁢g⁢(λ-t)
=exp⁡(12⁢t2)⁢g⁢(t-λ)
=exp⁡(12⁢t2)⁢exp⁡(-t22)⁢∑k=0∞(-1)kk!⁢Hk⁢(t)⁢(-λ)k
=∑k=0∞1k!⁢Hk⁢(t)⁢λk.

∎

Theorem 8.

Let γ1 be the standard Gaussian measure on ℝ, with density p⁢(t,0,1)=12⁢π⁢exp⁡(-t22). Then

{Hk:k≥0}

is an orthonormal basis for L2⁢(γ1).

Proof.

For λ,μ∈ℝ, on the one hand, using (1) with a=λ+μ and σ=1,

∫ℝexp⁡(λ⁢t-12⁢λ2)⁢exp⁡(μ⁢t-12⁢μ2)⁢𝑑γ1⁢(t)=eλ⁢μ⁢∫ℝ12⁢π⁢exp⁡(-12⁢(t-(λ+μ))2)⁢𝑑t=eλ⁢μ.

On the other hand, using Theorem 7,

∫ℝexp⁡(λ⁢t-12⁢λ2)⁢exp⁡(μ⁢t-12⁢μ2)⁢𝑑γ1⁢(t)=∫ℝ(∑k=0∞1k!⁢Hk⁢(t)⁢λk)⁢(∑l=0∞1l!⁢Hl⁢(t)⁢μl)⁢𝑑γ1⁢(t)=∫ℝ∑k,l≥01k!⁢l!⁢λk⁢μl⁢Hk⁢(t)⁢Hl⁢(t)⁢d⁢γ1⁢(t)=∑k,l≥01k!⁢l!⁢λk⁢μl⁢⟨Hk,Hl⟩L2⁢(γ1).

Therefore

∑k,l≥01k!⁢l!⁢λk⁢μl⁢⟨Hk,Hl⟩L2⁢(γ1)=∑k=0∞1k!⁢λk⁢μk.

From this, we get that if k≠l then 1k!⁢l!⁢⟨Hk,Hl⟩L2⁢(γ1)=0, i.e.

⟨Hk,Hl⟩L2⁢(γ1)=0.

If k=l, then 1k!⁢l!⁢⟨Hk,Hl⟩L2⁢(γ1)=1k!, i.e.

⟨Hk,Hk⟩L2⁢(γ1)=1.

Therefore, {Hk:k≥0} is an orthonormal set in L2⁢(γ1).

Suppose that f∈L2⁢(γ1) satisfies ⟨f,Hk⟩L2⁢(γ1)=0 for each k≥0. Because Hk⁢(t) is a polynomial of degree k, for each k≥0 we have

span⁢{H0,H1,H2,…,Hk}=span⁢{1,t,t2,…,tk}.

Hence for each k≥0, ⟨f,tk⟩L2⁢(γ1)=0. One then proves that span⁢{1,t,t2,…} is dense in L2⁢(γ1), from which it follows that the linear span of the Hermite polynomials is dense in L2⁢(γ1) and thus that they are an orthonormal basis. ∎

Lemma 9.

For k≥1,

Hk′⁢(t)=k⁢Hk-1⁢(t),Hk′⁢(t)=t⁢Hk⁢(t)-k+1⁢Hk+1⁢(t).
Proof.

Theorem 7 says

exp⁡(λ⁢t-12⁢λ2)=∑k=0∞1k!⁢Hk⁢(t)⁢λk.

On the one hand,

dd⁢t⁢exp⁡(λ⁢t-12⁢λ2) =λ⁢exp⁡(λ⁢t-12⁢λ2)
=∑k=0∞1k!⁢Hk⁢(t)⁢λk+1
=∑k=1∞1(k-1)!⁢Hk-1⁢(t)⁢λk.

On the other hand,

dd⁢t⁢exp⁡(λ⁢t-12⁢λ2)=∑k=0∞1k!⁢Hk′⁢(t)⁢λk.

Therefore, H0′⁢(t)=0, and for k≥1,

1(k-1)!⁢Hk-1⁢(t)=1k!⁢Hk′⁢(t),

i.e.,

Hk′⁢(t)=k⁢Hk-1⁢(t).

∎

For α=(k1,…,kn)∈ℤ≥0n, we define the Hermite polynomial Hα by

Hα⁢(x)=Hk1⁢(x1)⁢⋯⁢Hkn⁢(xn),x=(x1,…,xn)∈ℝn.

Because the collection of all Hermite polynomials Hk is an orthonormal basis for the Hilbert space L2⁢(γ1), following (6) we have that the collection of all Hermite polynomials Hα is an orthonormal basis for the Hilbert space L2⁢(γn).

Theorem 10.

For γn the standard Gaussian measure on ℝn, with mean 0∈ℝn and covariance operator idℝn, the collection

{Hα:α∈ℤ≥0n}

is an orthonormal basis for L2⁢(γn).

For α=(k1,…,kn)∈ℤ≥0n, write |α|=k1+⋯+kn. For k≥0, we define

𝒳k=span⁢{Hα:|α|=k},

which is a subspace of L2⁢(γn) of dimension

(k+n-1k).

As 𝒳k is a finite dimensional subspace of L2⁢(γn), it is closed. L2⁢(γn) is equal to the orthogonal direct sum of the 𝒳k:

L2⁢(γn)=⊕k=0∞𝒳k.

Let

Ik:L2⁢(γn)→𝒳k

be the orthogonal projection onto 𝒳k.

6 Ornstein-Uhlenbeck semigroup

Let γ be a Gaussian measure on ℝn with mean 0 and covariance operator K. For t≥0, we define Mt:ℝn×ℝn→ℝn by

Mt⁢(u,v)=e-t⁢u+1-e-2⁢t⁢v,(x,y)∈ℝn×ℝn.

By Theorem 6, Mt*⁢(γ×γ)=γ. Therefore, for p≥1 and f∈Lp⁢(γ), using the change of variables formula,

∫ℝn|f⁢(x)|p⁢𝑑γ⁢(x)=∫ℝn×ℝn|f⁢(Mt⁢(u,v))|p⁢d⁢(γ×γ)⁢(u,v).

Applying Fubini’s theorem, the function

u↦∫ℝn|f⁢(Mt⁢(u,v))|p⁢𝑑γ⁢(v)=∫ℝn|f⁢(e-t⁢u+1-e-2⁢t⁢v)|p⁢𝑑γ⁢(v)

belongs to L1⁢(γ). We define the Ornstein-Uhlenbeck semigroup {Tt:t≥0} on Lp⁢(γ), p≥1, by

Tt⁢(f)⁢(u)=∫ℝnf⁢(Mt⁢(u,v))⁢𝑑γ⁢(v)=∫ℝnf⁢(e-t⁢u+1-e-2⁢t⁢v)⁢𝑑γ⁢(v),

for u∈ℝn.

Theorem 11.

Let γ be a Gaussian measure on ℝn with mean 0. If f∈L1⁢(γ), then

∫ℝn(Tt⁢f)⁢(x)⁢𝑑γ⁢(x)=∫ℝnf⁢(x)⁢𝑑γ⁢(x).
Proof.

Using Fubini’s theorem, then the change of variables formula, then Theorem 6,

∫ℝn(Tt⁢f)⁢(u)⁢𝑑γ⁢(u) =∫ℝn(∫ℝnf⁢(Mt⁢(u,v))⁢𝑑γ⁢(v))⁢𝑑γ⁢(u)
=∫ℝn×ℝnf⁢(Mt⁢(u,v))⁢d⁢(γ×γ)⁢(u,v)
=∫ℝnf⁢(x)⁢d⁢(Mt*⁢(γ×γ))⁢(x)
=∫ℝnf⁢(x)⁢𝑑γ⁢(x).

∎

Theorem 12.

Let γ be a Gaussian measure on ℝn with mean 0. For p≥1 and t≥0, Tt is a bounded linear operator Lp⁢(γ)→Lp⁢(γ) with operator norm 1.

Proof.

For f∈Lp⁢(γ), using Jensen’s inequality and then Theorem 11,

∥Tt⁢f∥Lp⁢(γ)p =∫ℝn|∫ℝnf⁢(Mt⁢(u,v))⁢𝑑γ⁢(v)|p⁢𝑑γ⁢(u)
≤∫ℝn(∫ℝn|f⁢(Mt⁢(u,v))|p⁢𝑑γ⁢(v))⁢𝑑γ⁢(u)
=∫ℝnTt⁢(|f|p)⁢(u)⁢𝑑γ⁢(u)
=∫ℝn|f|p⁢(u)⁢𝑑γ⁢(u)
=∥f∥Lp⁢(γ)p,

i.e. ∥Tt⁢f∥Lp⁢(μ)≤∥f∥Lp⁢(μ). This shows that the operator norm of Tt is ≤1. But, as γ is a probability measure,

Tt⁢1=∫ℝn1⁢𝑑γ⁢(v)=1,

so Tt has operator norm 1. ∎

For a Banach space E, we denote by ℬ⁢(E) the set of bounded linear operators E→E. The strong operator topology on E is the coarsest topology on E such that for each x∈E, the map A↦A⁢x is continuous ℬ⁢(E)→𝔼. To say that a map Q:[0,∞)→ℬ⁢(E) is strongly continuous means that for each t∈[0,∞), Q⁢(s)→Qt in the strong operator topology as s→t, i.e., for each x∈E, Q⁢(s)⁢x→Q⁢(t)⁢x in E.

A one-parameter semigroup in B⁢(E) is a map Q:[0,∞)→ℬ⁢(E) such that (i) Q⁢(0)=idE and (ii) for s,t≥0, Q⁢(s+t)=Q⁢(s)∘Q⁢(t). For a one-parameter semigroup to be strongly continuous, one proves that it is equivalent that Q⁢(t)→idE in the strong operator topology as t↓0, i.e. for each x∈E, Q⁢(t)⁢x→x.88 8 Walter Rudin, Functional Analysis, second ed., p. 376, Theorem 13.35.

We now establish that the {Tt:t≥0} is indeed a one-parameter semigroup and that it is strongly continuous.99 9 Vladimir I. Bogachev, Gaussian Measures, p. 10, Theorem 1.4.1.

Theorem 13.

Suppose μ is a Gaussian measure on ℝn with mean 0 and let p≥1. Then {Tt:t≥0} is a strongly continuous one-parameter semigroup in ℬ⁢(Lp⁢(γ)).

Proof.

For f∈Lp⁢(γ), because γ is a probability measure,

T0⁢(f)⁢(u)=∫ℝnf⁢(u)⁢𝑑γ⁢(v)=f⁢(u),

hence T0=idLp⁢(μ). For s,t≥0, define P:ℝn×ℝn→ℝn by

P⁢(u,v)=e-s⁢1-e-2⁢t1-e-2⁢t-2⁢s⁢u+1-e-2⁢s1-e-2⁢t-2⁢s⁢v.

By Theorem 6, P*⁢(γ×γ)=γ, whence

(Tt⁢(Ts⁢f))⁢(x)=∫ℝn(Ts⁢f)⁢(e-t⁢x+1-e-2⁢t⁢y)⁢𝑑γ⁢(y)=∫ℝn(∫ℝnf⁢(e-s⁢(e-t⁢x+1-e-2⁢t⁢y)+1-e-2⁢s⁢w)⁢𝑑γ⁢(w))⁢𝑑γ⁢(y)=∫ℝn×ℝnf⁢(e-s-t⁢x+1-e-2⁢t-2⁢s⁢P⁢(y,w))⁢d⁢(γ×γ)⁢(y,w)=∫ℝn×ℝn(f∘Ms+t)⁢(x,P⁢(y,w))⁢d⁢(γ×γ)⁢(y,w)=∫ℝn(f∘Ms+t)⁢(x,z)⁢𝑑γ⁢(z)=Ts+t⁢(f)⁢(x),

hence Tt∘Ts=Ts+t. This establishes that {Tt:t≥0} is a semigroup.

For f∈Cb⁢(ℝn), u∈ℝn, and v∈ℝn, as t↓0 we have

f⁢(e-t⁢u+1-e-2⁢t⁢v)-f⁢(u)→0,

thus by the dominated convergence theorem, since

|f⁢(e-t⁢u+1-e-2⁢t⁢v)-f⁢(u)|≤2⁢∥f∥∞

and γ is a probability measure, we have

∫ℝn(f⁢(e-t⁢u+1-e-2⁢t⁢v)-f⁢(u))⁢𝑑γ⁢(v)→0,

and hence

(Tt⁢f-T0⁢f)⁢(u) =∫ℝnf⁢(e-t⁢u+1-e-2⁢t⁢v)⁢𝑑γ⁢(v)-∫ℝnf⁢(u)⁢𝑑γ⁢(v)
=∫ℝn(f⁢(e-t⁢u+1-e-2⁢t⁢v)-f⁢(u))⁢𝑑γ⁢(v)
→0.

Because this is true for each u∈ℝn and

|(Tt⁢f-T0⁢f)⁢(u)|≤∫ℝn2⁢∥f∥∞⁢𝑑γ⁢(v)=2⁢∥f∥∞,

by the dominated convergence theorem we then have

∥Tt⁢f-T0⁢f∥Lp⁢(γ)→0. (7)

Now let f∈Lp⁢(γ). There is a sequence fj∈Cb⁢(ℝn) satisfying ∥fj-f∥Lp⁢(γ)→0, with ∥fj∥Lp⁢(γ)≤2⁢∥f∥Lp⁢(γ) for all j. For any t≥0,

∥Tt⁢f-T0⁢f∥Lp⁢(γ) ≤∥Tt⁢f-Tt⁢fj∥Lp⁢(γ)+∥Tt⁢fj-T0⁢fj∥Lp⁢(γ)+∥T0⁢fj-T0⁢f∥Lp⁢(γ)
=∥Tt⁢(f-fj)∥Lp⁢(γ)+∥Tt⁢f-T0⁢fj∥Lp⁢(γ)+∥fj-f∥Lp⁢(γ)
≤∥f-fj∥Lp⁢(γ)+∥Tt⁢f-T0⁢fj∥Lp⁢(γ)+∥fj-f∥Lp⁢(γ).

Let ϵ>0 and let j be so large that ∥f-fj∥Lp⁢(γ)<ϵ. Because fj∈Cb⁢(ℝn), by (7) there is some δ>0 such that when 0<t<δ, ∥Tt⁢fj-fj∥Lp⁢(γ)<ϵ. Then when 0<t<δ,

∥Tt⁢f-T0⁢f∥Lp⁢(γ)≤ϵ+ϵ+ϵ,

which shows that for each f∈Lp⁢(γ), ∥Tt⁢f-T0⁢f∥Lp⁢(γ) as t↓0, which suffices to establish that {Tt:t≥0} is strongly continuous [0,∞)→ℬ⁢(Lp⁢(γ)). ∎

For t>0, we define Lt∈ℬ⁢(Lp⁢(γ)) by

Lt⁢f=1t⁢(Tt⁢f-f),f∈Lp⁢(γ).

We define 𝒟⁢(L) to be the set of those f∈Lp⁢(γ) such that Lt⁢f converges to some element of Lp⁢(γ) as t↓0, and we define L:𝒟⁢(L)→Lp⁢(γ). This is the infinitesimal generator of the semigroup {Tt:t≥0}, and the infinitesimal generator L of the Ornstein-Uhlenbeck semigroup is called the Ornstein-Uhlenbeck operator. Because the Ornstein-Uhlenbeck semigroup is strongly continuous, we get the following.1010 10 Walter Rudin, Functional Analysis, second ed., p. 376, Theorem 13.35.

Theorem 14.

Suppose μ is a Gaussian measure on ℝn with mean 0, let p≥1, and let L be the infinitesimal generator of the Ornstein-Uhlenbeck semigroup {Tt:t≥0}. Then:

  1. 1.

    𝒟⁢(L) is a dense linear subspace of Lp⁢(γ) and L:𝒟⁢(L)→Lp⁢(γ) is a closed operator.

  2. 2.

    For each f∈𝒟⁢(L) and for each t≥0,

    dd⁢t⁢(Tt⁢f)=(L∘Tt)⁢f=(Tt∘L)⁢f.
  3. 3.

    For f∈Lp⁢(γ) and K a compact subset of [0,∞), (exp(tLϵ)f→Ttf as ϵ↓0 uniformly for t∈K.

  4. 4.

    For λ∈ℂ with Re⁢λ>0, R⁢(λ):Lp⁢(γ)→Lp⁢(γ) defined by

    R⁢(λ)⁢f=∫0∞e-λ⁢t⁢Tt⁢f⁢𝑑t,f∈Lp⁢(γ),

    belongs to ℬ⁢(Lp⁢(γ)), the range of R⁢(λ) is equal to 𝒟⁢(L), and

    ((λ⁢I-L)∘R⁢(λ))⁢f=f,f∈Lp⁢(γ),(R⁢(λ)∘(λ⁢I-L))⁢f=𝒟⁢(L),

    where I is the identity operator on Lp⁢(γ).

We remind ourselves that if H is a Hilbert space with inner product ⟨⋅,⋅⟩, an element A of ℬ⁢(H) is said to be a positive operator when ⟨A⁢x,x⟩≥0 for all x∈H. We prove that each Tt is a positive operator on the Hilbert space L2⁢(γ).1111 11 Vladimir I. Bogachev, Gaussian Measures, p. 10, Theorem 1.4.1.

Theorem 15.

Suppose μ is a Gaussian measure on ℝn with mean 0. For each t≥0, Tt∈ℬ⁢(L2⁢(μ)) is a positive operator.

Proof.

For t≥0, define Nt:ℝn×ℝn→ℝn×ℝn by

Ot⁢(x,y)=(e-t⁢x+1-e-2⁢t⁢y,-1-e-2⁢t⁢x+e-t⁢y),(x,y)∈ℝn×ℝn,

whose transpose is the linear operator Nt*:ℝn×ℝn→ℝn×ℝn defined by

Ot*⁢(u,v)=(e-t⁢u-1-e-2⁢t⁢v,1-e-2⁢t⁢u+e-t⁢v),(u,v)∈ℝn×ℝn.

For (x,y)∈ℝn×ℝn, we calculate

∫ℝn×ℝnei⁢⟨(x,y),(u,v)⟩⁢d⁢(Ot*⁢(γ×γ))⁢(u,v)=∫ℝn×ℝnei⁢⟨(x,y),Ot⁢(u,v)⟩⁢d⁢(γ×γ)⁢(u,v)=∫ℝn×ℝnei⁢⟨Ot*⁢(x,y),(u,v)⟩⁢d⁢(γ×γ)⁢(u,v)=γ×γ~⁢(Ot*⁢(x,y))=γ×γ~⁢(e-t⁢x-1-e-2⁢t⁢y,1-e-2⁢t⁢x+e-t⁢y)=γ~⁢(e-t⁢x-1-e-2⁢t⁢y)⁢γ~⁢(1-e-2⁢t⁢x+e-t⁢y)=exp⁡(-12⁢⟨K⁢(e-t⁢x-1-e-2⁢t⁢y),e-t⁢x-1-e-2⁢t⁢y⟩)⋅exp⁡(-12⁢⟨K⁢(1-e-2⁢t⁢x+e-t⁢y),1-e-2⁢t⁢x+e-t⁢y⟩)=exp⁡(-12⁢⟨K⁢x,x⟩-12⁢⟨K⁢y,y⟩)=γ~⁢(x)⁢γ~⁢(y)=γ×γ~⁢(x,y),

which shows that Ot*⁢(γ×γ) and γ×γ have equal characteristic functions and hence are themselves equal.

For f,g∈L2⁢(γ) and t≥0,

⟨Tt⁢f,g⟩L2⁢(γ) =∫ℝn(Tt⁢f)⁢(x)⁢g⁢(x)⁢𝑑μ⁢(x)
=∫ℝn×ℝnf⁢(e-t⁢x+1-e-2⁢t⁢y)⁢g⁢(x)⁢d⁢(γ×γ)⁢(x,y)
=∫ℝn×ℝn(f∘π1∘Ot)⁢(x,y)⁢(g∘π1∘Ot-1∘Ot)⁢(x,y)⁢d⁢(γ×γ)⁢(x,y)
=∫ℝn×ℝn(f∘π1)⁢(u,v)⁢(g∘π1∘Ot-1)⁢(u,v)⁢d⁢(Ot*⁢(γ×γ))⁢(u,v)
=∫ℝn×ℝn(f∘π1)⁢(u,v)⁢(g∘π1∘Ot-1)⁢(u,v)⁢d⁢(γ×γ)⁢(u,v)
=∫ℝn×ℝnf⁢(u)⁢g⁢(e-t⁢u-1-e-2⁢t⁢v)⁢d⁢(γ×γ)⁢(u,v)
=∫ℝnf⁢(u)⁢(∫ℝng⁢(Mt⁢(u,-v))⁢𝑑γ⁢(v))⁢𝑑γ⁢(u)
=∫ℝnf⁢(u)⁢(∫ℝng⁢(Mt⁢(u,v))⁢𝑑γ⁢(v))⁢𝑑γ⁢(u)
=∫ℝnf⁢(u)⁢(Tt⁢g)⁢(u)⁢𝑑γ⁢(u)
=⟨f,Tt⁢g⟩L2⁢(γ),

which establishes that Tt is a self-adjoint operator on L2⁢(γ).

Furthermore, using that Tt=Tt/2∘Tt/2 and that Tt/2 is self-adjoint,

⟨Tt⁢f,f⟩L2⁢(γ)=⟨Tt/2⁢Tt/2⁢f,f⟩L2⁢(γ)=⟨Tt/2⁢f,Tt/2*⁢f⟩L2⁢(γ)=⟨Tt/2⁢f,Tt/2⁢f⟩L2⁢(γ),

which is ≥0, which establishes that Tt is a positive operator on L2⁢(γ). ∎

We now write the Ornstein-Uhlenbeck semigroup using the orthogonal projections Ik:L2⁢(γn)→𝒳k, where γn is the standard Gaussian measure on ℝn.1212 12 Vladimir I. Bogachev, Gaussian Measures, p. 11, Theorem 1.4.4.

Theorem 16.

For each t≥0 and f∈L2⁢(γn),

Tt⁢f=∑k=0∞e-k⁢t⁢Ik⁢(f).
Proof.

Define St:L2⁢(γn)→L2⁢(γn) by St⁢f=∑k=0∞e-k⁢t⁢Ik⁢(f), which satisfies, using that the subspaces 𝒳k are pairwise orthogonal,

∥St⁢f∥L2⁢(γn)2=∑k=0∞e-k⁢t⁢∥Ik⁢(f)∥L2⁢(γn)2≤∑k=0∞∥Ik⁢(f)∥L2⁢(γn)2=∥f∥L2⁢(γn)2,

so St∈ℬ⁢(L2⁢(γn)). To prove that Tt=St, it suffices to prove that Tt⁢Hα=St⁢Hα for each Hermite polynomial, which are an orthonormal basis for L2⁢(γn). For α=(k1,…,kn) with k=|α|=k1+⋯+kn,

St⁢Hα=e-k⁢t⁢Hα,

and

(Tt⁢Hα)⁢(x) =∫ℝnHα⁢(e-t⁢x+1-e-2⁢t⁢y)⁢𝑑γn⁢(y)
=∫ℝn∏j=1nHkj⁢(e-t⁢xj+1-e-2⁢t⁢yj)⁢d⁢γn⁢(y)
=∏j=1n∫ℝHkj⁢(e-t⁢xj+1-e-2⁢t⁢yj)⁢𝑑γ1⁢(yj).

To prove that Tt⁢Hα=e-k⁢t⁢Hα, it thus suffices to prove that for any t, for any kj, and for any xj,

∫ℝHkj⁢(e-t⁢xj+1-e-2⁢t⁢yj)⁢𝑑γ1⁢(yj)=e-kj⁢t⁢Hkj⁢(xj). (8)

For kj=0, as H0=1 and γ1 is a probability measure, (8) is true. Suppose that (8) is true for ≤kj. That is, for each 0≤h≤kj, Tt⁢Hh=e-h⁢t⁢Hh. For any l, because the Hermite polynomial Hl is a polynomial of degree l, one checks that Tt⁢Hl⁢(xj) is a polynomial of degree l: using the binomial formula,

∫ℝ(e-t⁢xj+1-e-2⁢t⁢yj)l⁢exp⁡(-yj22)⁢𝑑γ1⁢(yj)

is a polynomial in xj of degree l. Hence Tt⁢Hl a linear combination of H0,H1,…,Hl. For 0≤h≤kj,

⟨Tt⁢Hkj+1,Hh⟩L2⁢(γ1)=⟨Hkj+1,Tt⁢Hh⟩L2⁢(γ1)=⟨Hkj+1,e-h⁢t⁢Hh⟩L2⁢(γ1)=0.

Therefore there is some c∈ℝ such that Tt⁢Hkj+1=c⁢Hkj+1. Then check that c=e-(kj+1)⁢t. ∎

We now give an explicit expression for the domain 𝒟⁢(L) of the Ornstein-Uhlenbeck operator L and for L applied to an element of its domain.1313 13 Vladimir I. Bogachev, Gaussian Measures, p. 12, Proposition 1.4.5.

Theorem 17.
𝒟⁢(L)={f∈L2⁢(γn):∑k=0∞k2⁢∥Ik⁢(f)∥L2⁢(γn)2<∞}.

For f∈𝒟⁢(L),

L⁢f=-∑k=0∞k⁢If⁢(f).
Proof.

Let f∈𝒟⁢(L), i.e. Tt⁢f-ft→L⁢f in L2⁢(γn) as t↓0. For any k≥0, using Theorem 16,

Ik⁢L⁢f =Ik⁢(limt↓0⁡Tt⁢f-ft)
=limt↓0⁡Ik⁢Tt⁢f-Ik⁢ft
=limt↓0⁡Tt⁢Ik⁢f-Ik⁢ft
=limt↓0⁡e-k⁢t⁢Ik⁢f-Ik⁢ft
=(limt↓0⁡e-k⁢t-1t)⁢Ik⁢f
=(e-k⁢t)′|t=0⁢Ik⁢f
=-k⁢Ik⁢f.

Using this,

∑k=0∞k2⁢∥Ik⁢f∥L2⁢(γn)2 =∑k=0∞∥Ik⁢L⁢f∥L2⁢(γn)2
=∥∑k=0∞Ik⁢L⁢f∥L2⁢(γn)2
=∥L⁢f∥L2⁢(γn)2
<∞.

Moreover,

L⁢f=L⁢(∑k=0∞Ik⁢f)=∑k=0∞L⁢Ik⁢f=∑k=0∞Ik⁢L⁢f=∑k=0∞-k⁢If.

Let f∈L2⁢(γn) satisfy

∑k=0∞k2⁢∥Ik⁢f∥L2⁢(γn)2<∞.

For t>0,

∥Tt⁢f-ft+∑k=0∞k⁢Ik⁢f∥L2⁢(γn)2 =∥∑k=0∞(e-k⁢t⁢Ik⁢f-Ik⁢ft+k⁢Ik⁢f)∥L2⁢(γn)2
=∑k=0∞|e-k⁢t-1t+k|2⁢∥Ik⁢f∥L2⁢(γn)2.

For t>0 and k≥0,

|t-1⁢(e-k⁢t-1)|≤k,

and thus

∑k=0∞|e-k⁢t-1t+k|2⁢∥Ik⁢f∥L2⁢(γn)2≤∑k=0∞(2⁢k)2⁢∥Ik⁢f∥L2⁢(γn)2<∞.

For each k≥0, as t↓0,

e-k⁢t-1t+k→0,

thus as t↓0,

∑k=0∞|e-k⁢t-1t+k|2⁢∥Ik⁢f∥L2⁢(γn)2→0

and hence

∥Tt⁢f-ft+∑k=0∞k⁢Ik⁢f∥L2⁢(γn)2→0.

This means that Tt⁢f-ft converges in L2⁢(γn) to -∑k=0∞k⁢Ik⁢f as t↓0, and since Tt⁢f-ft converges, f∈𝒟⁢(L). ∎