Gaussian measures and Bochner’s theorem

Jordan Bell
April 30, 2015

1 Fourier transforms of measures

Let mn be normalized Lebesgue measure on ℝn: d⁢mn⁢(x)=(2⁢π)-n/2⁢d⁢x. If μ is a finite positive Borel measure on ℝn, the Fourier transform of μ is the function μ^:ℝn→ℂ defined by

μ^⁢(ξ)=∫ℝne-i⁢ξ⋅x⁢𝑑μ⁢(x),ξ∈ℝn.

One proves using the dominated convergence theorem that μ^ is continuous. If f∈L1⁢(ℝn), the Fourier transform of f is the function f^:ℝn→ℂ defined by

f^⁢(ξ)=∫ℝne-i⁢ξ⋅x⁢f⁢(x)⁢𝑑mn⁢(x),ξ∈ℝn.

Likewise, using the dominated convergence theorem, f^ is continuous. One proves that if f∈L1⁢(ℝn) and f^∈L1⁢(ℝn) then, for almost all x∈ℝn,

f⁢(x)=∫ℝnei⁢x⋅ξ⁢f^⁢(ξ)⁢𝑑mn⁢(ξ).

As

μ^⁢(0)=∫ℝn𝑑μ⁢(x)=μ⁢(ℝn),

μ is a probability measure if and only if μ^⁢(0)=1. (By a probability measure we mean a positive measure with mass 1.)

If ϕ∈L1⁢(ℝn) and ϕ^∈L1⁢(ℝn), then, inverting the Fourier transform,

⟨ϕ,μ⟩ = ∫ℝnϕ⁢(x)⁢𝑑μ⁢(x)
= ∫ℝn(∫ℝnϕ^⁢(ξ)⁢ei⁢x⋅ξ⁢𝑑mn⁢(ξ))⁢𝑑μ⁢(x)
= ∫ℝnϕ^⁢(ξ)⁢∫ℝnei⁢ξ⋅x⁢𝑑μ⁢(x)⁢𝑑mn⁢(ξ)
= ∫ℝnϕ^⁢(ξ)⁢μ^⁢(-ξ)⁢𝑑mn⁢(ξ)
= ∫ℝnϕ^⁢(-ξ)⁢μ^⁢(ξ)⁢𝑑mn⁢(ξ).
Theorem 1.

If μ and ν are finite Borel measures on ℝn and μ^=ν^, then μ=ν.

Proof.

To prove that μ=ν it suffices to prove that for any ball B in ℝn we have μ⁢(B)=ν⁢(B). Let ϕn∈Cc∞⁢(ℝn)→χB pointwise. On the one hand, by the dominated convergence theorem, ⟨ϕn,μ⟩→μ⁢(B) and ⟨ϕn,ν⟩→ν⁢(B) as n→∞. On the other hand, because μ^=ν^ we have

⟨ϕn,μ⟩=∫ℝnϕ^n⁢(-ξ)⁢μ^⁢(ξ)⁢𝑑mn⁢(ξ)=∫ℝnϕ^n⁢(-ξ)⁢ν^⁢(ξ)⁢𝑑mn⁢(ξ)=⟨ϕn,ν⟩.

Therefore μ⁢(B)=ν⁢(B), and it follows that μ=ν. ∎

2 Gaussian measures

Let λ1,…,λn>0, and let Λ:ℝn→ℝn be the linear map defined by Λ⁢ei=λi⁢ei. Define

d⁢μ⁢(x)=det⁡Λ⁢exp⁡(-12⁢x⋅Λ⁢x)⁢d⁢mn⁢(x),

called a Gaussian measure.

Theorem 2.
μ^⁢(ξ)=exp⁡(-12⁢ξ⋅Λ-1⁢ξ),ξ∈ℝn.
Proof.

We have

μ^⁢(ξ) = ∫ℝne-i⁢ξ⋅x⁢det⁡Λ⁢exp⁡(-12⁢x⋅Λ⁢x)⁢𝑑mn⁢(x)
= ∫ℝde-i⁢ξ1⁢x1-⋯-i⁢ξn⁢xn⁢λ1⁢⋯⁢λn⁢exp⁡(-12⁢λ1⁢x12-⋯-12⁢λn⁢xn2)⁢𝑑mn⁢(x)
= ∏j=1nIj,

where

Ij=∫ℝe-i⁢ξj⁢xj⁢λj⁢exp⁡(-12⁢λj⁢xj2)⁢𝑑m1⁢(xj).

Using

-i⁢ξj⁢xj-12⁢λj⁢xj2=-λj2⁢((xj+i⁢ξjλj)2+ξj2λj2)=-λj2⁢(xj+i⁢ξjλj)2-ξj22⁢λj,

we get, doing contour integration,

Ij = ∫ℝλj⁢exp⁡(-λj2⁢(xj+i⁢ξjλj)2)⁢exp⁡(-ξj22⁢λj)⁢𝑑m1⁢(xj)
= ∫ℝλj⁢exp⁡(-λj⁢xj22)⁢exp⁡(-ξj22⁢λj)⁢𝑑m1⁢(xj)
= ∫ℝλj⁢exp⁡(-yj2)⁢exp⁡(-ξj22⁢λj)⁢2λj⁢𝑑m1⁢(yj)
= exp⁡(-ξj22⁢λj)⁢∫ℝ2⁢exp⁡(-yj2)⁢𝑑m1⁢(yj)
= exp⁡(-ξj22⁢λj)⁢∫ℝ1π⁢exp⁡(-yj2)⁢𝑑yj
= exp⁡(-ξj22⁢λj).

Therefore, as Λ-1⁢ξ=∑j=1nξjλj⁢ej and ξ⋅Λ-1⁢ξ=∑j=1nξj2λj,

μ^⁢(ξ) = ∏j=1nexp⁡(-ξj22⁢λj)
= exp⁡(-12⁢∑j=1nξj2λj)
= exp⁡(-12⁢ξ⋅Λ-1⁢ξ).

∎

From the above theorem we get

μ^⁢(0)=1,

and hence a Gaussian measure is a probability measure.

For h∈ℝn, define Th:ℝn→ℝn by Th⁢(x)=x-h. If E is a Borel subset of ℝn, because χT-h⁢(E)=χE∘Th,

((Th)*⁢μ)⁢(E)=μ⁢(Th-1⁢(E))=μ⁢(T-h⁢(E))=∫ℝnχT-h⁢(E)⁢𝑑μ=∫ℝnχE∘Th⁢𝑑μ.

Then, because Th∘T-h=idℝn,

∫ℝnχE∘Th⁢𝑑μ = ∫ℝnχE∘Th⁢(x)⁢det⁡Λ⁢exp⁡(-12⁢x⋅Λ⁢x)⁢𝑑mn⁢(x)
= ∫ℝnχE⁢(x)⁢det⁡Λ⁢exp⁡(-12⁢(T-h⁢x)⋅(Λ⁢T-h⁢x))⁢d⁢((T-h)*⁢mn)⁢(x)
= ∫ℝnχE⁢(x)⁢det⁡Λ⁢exp⁡(-12⁢(T-h⁢x)⋅(Λ⁢T-h⁢x))⁢𝑑mn⁢(x).

As Λ is self-adjoint Λ⁢x⋅h=x⋅Λ⁢h,

(T-h⁢x)⋅(Λ⁢T-h⁢x) = (x+h)⋅(Λ⁢(x+h))
= (x+h)⋅(Λ⁢x+Λ⁢h)
= x⋅Λ⁢x+x⋅Λ⁢h+h⋅Λ⁢x+h⋅Λ⁢h
= x⋅Λ⁢x+2⁢x⋅Λ⁢h+h⋅Λ⁢h.

Therefore,

((Th)*⁢μ)⁢(E) = ∫ℝnχE⁢(x)⁢exp⁡(-12⁢(2⁢x⋅Λ⁢h+h⋅Λ⁢h))⁢𝑑μ⁢(x)
= ∫ℝnχE⁢(x)⁢exp⁡(-x⋅Λ⁢h-12⁢h⋅Λ⁢h)⁢𝑑μ⁢(x).

This shows that the Radon-Nikodym derivative of (Th)*⁢μ with respect to μ is

d⁢(Th)*⁢μd⁢μ⁢(x)=exp⁡(-x⋅Λ⁢h-12⁢h⋅Λ⁢h).

3 Positive-definite functions

We say that a function ϕ:ℝn→ℂ is positive-definite if x1,…,xr∈ℝn and c1,…,cr∈ℂ imply that

∑i,j=1rci⁢cj¯⁢ϕ⁢(xi-xj)≥0;

in particular, the left-hand side is real.

Using r=1, c1=1, we have for any x1∈ℝn that ϕ⁢(x1-x1)≥0, i.e. ϕ⁢(0)≥0. For x∈ℝn, using r=2, x1=x,x2=0 and choosing fitting c1,c2∈ℂ gives

ϕ⁢(-x)=ϕ⁢(x)¯,

and using this with c2=1 and for appropriate c1 gives

|ϕ⁢(x)|≤ϕ⁢(0).

For f,g∈L1⁢(ℝn), the convolution of f and g is the function f*g:ℝn→ℂ defined by

(f*g)⁢(x)=∫ℝnf⁢(y)⁢g⁢(x-y)⁢𝑑mn⁢(y),x∈ℝn,

and ∥f*g∥L1≤∥f∥L1⁢∥g∥L1, a case of Young’s inequality. For f:ℝn→ℂ, we denote by supp⁢f the essential support of f; if f is continuous, then supp⁢f is the closure of the set {x∈ℝn:f⁢(x)≠0}. A fact that we will use later is11 1 Gerald B. Folland, Real Analysis: Modern Techniques and their Applications, second ed., p. 240, Proposition 8.6.

supp⁢(f*g)⊆supp⁢f+supp⁢g¯.

We denote by f* the function defined by f*⁢(x)=f⁢(-x)¯.

Cc⁢(ℝn) is the set of all f∈C⁢(ℝn) for which supp⁢f is a compact set. The set Cc⁢(ℝn) is dense in the Banach space C0⁢(ℝn) and also in the Banach space L1⁢(ℝn); Cc⁢(ℝn) is not a Banach space or even a Fréchet space, and thus does not have a robust structure itself, but is used because it is easier to prove things for it which one then extends in some way to spaces in which the set is dense. The proof of the following theorem follows Folland.22 2 Gerald B. Folland, A Course in Abstract Harmonic Analysis, p. 85, Proposition 3.35.

Theorem 3.

If ϕ:ℝn→ℂ is positive-definite and continuous and f∈Cc⁢(ℝn), then

∫(f**f)⁢ϕ≥0.
Proof.

Write K=supp⁢f, and define F:ℝn×ℝn→ℂ by

F⁢(x,y)=f⁢(x)⁢f⁢(y)¯⁢ϕ⁢(x-y).

F is continuous, and supp⁢F⊆K×K, hence supp⁢F is compact. Thus F∈Cc⁢(ℝn×ℝn); in particular F is uniformly continuous on K×K, and it follows that for each ϵ>0 there is some δ>0 such that if |x-a|<δ and |y-b|<δ then |F⁢(x,y)-F⁢(a,b)|<ϵ. The collection {Bδ⁢(x):x∈K} covers K and hence there are finitely many distinct xi∈K such that the collection {Bδ⁢(xi):i} covers K. Then {Bδ⁢(xi)×Bδ⁢(xj):i,j} covers K×K. Let Ei be pairwise disjoint, measurable, and satisfy xi∈Ei⊆Bδ⁢(xi). The collection {Ei:i,} covers K, so the collection {Ei×Ej:i,j} covers K×K.

Define

R=∑i,j∫Ei×Ej(F⁢(x,y)-F⁢(xi,xj))⁢𝑑mn⁢(x)⁢𝑑mn⁢(y).

R satisfies

|R| ≤ ∑i,j∫Ei×Ej|F⁢(x,y)-F⁢(xi,xj)|⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)
≤ ∑i,j∫Ei×Ejϵ⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)
= ϵ⁢∑i,jmn⁢(Ei)⁢mn⁢(Ej)
= ϵ⁢mn⁢(K)2.

We obtain

∫K×KF⁢(x,y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y) = ∑i,j∫Ei×EjF⁢(x,y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)
= ∑i,jF⁢(xi,xj)⁢mn⁢(Ei)⁢mn⁢(Ej)+R
= ∑i,jf⁢(xi)⁢f⁢(xj)¯⁢ϕ⁢(xi-xj)⁢mn⁢(Ei)⁢mn⁢(Ej)+R.

Using ci=f⁢(xi)⁢mn⁢(Ei), the fact that ϕ is positive-definite means that the sum is ≥0. Therefore

∫K×KF⁢(x,y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)≥-|R|≥-ϵ⁢mn⁢(K)2.

This is true for all ϵ>0, hence

∫ℝn∫ℝnf⁢(x)⁢f⁢(y)¯⁢ϕ⁢(x-y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)=∫K×KF⁢(x,y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)≥0.

But

∫ℝn(f**f)⁢(x)⁢ϕ⁢(x)⁢𝑑mn⁢(x) = ∫ℝn(∫ℝnf*⁢(y)⁢f⁢(x-y)⁢𝑑mn⁢(y))⁢ϕ⁢(x)⁢𝑑mn⁢(x)
= ∫ℝn∫ℝnf⁢(-y)¯⁢f⁢(x-y)⁢ϕ⁢(x)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)
= ∫ℝn∫ℝnf⁢(-y)¯⁢f⁢(x)⁢ϕ⁢(x+y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y)
= ∫ℝn∫ℝnf⁢(y)¯⁢f⁢(x)⁢ϕ⁢(x-y)⁢𝑑mn⁢(x)⁢𝑑mn⁢(y).

∎

Corollary 4.

If ϕ:ℝn→ℂ is positive-definite and continuous and f∈L1⁢(ℝn), then

∫(f**f)⁢ϕ≥0.
Proof.

Let fn∈Cc⁢(ℝn) converge to f in L1⁢(ℝn) as n→∞; that there is such a sequence is given to us by the fact that Cc⁢(ℝn) is a dense subset of L1⁢(ℝn). Using

fn**fn-f**f = fn**fn-fn**f+fn**f-f**f
= fn**(fn-f)+(fn*-f*)*f
= fn**(fn-f)+(fn-f)**f,

and ∥g*∥L1=∥g∥L1, we get

∥fn**fn-f**f∥L1 ≤ ∥fn**(fn-f)∥L1+∥(fn-f)**f∥L1
≤ ∥fn*∥L1⁢∥fn-f∥L1+∥(fn-f)*∥L1⁢∥f∥L1
= ∥fn∥L1⁢∥fn-f∥L1+∥fn-f∥L1⁢∥f∥L1,

which converges to 0 because ∥fn-f∥L1→0. Therefore, because ϕ is bounded,

∫ℝn(fn**fn)⁢ϕ⁢𝑑mn→∫ℝn(f**f)⁢ϕ⁢𝑑mn.

As ∫ℝn(fn**fn)⁢ϕ⁢𝑑mn≥0 for each n, this implies that ∫ℝn(f**f)⁢ϕ⁢𝑑mn≥0. ∎

It is straightforward to prove that the Fourier transform of a finite positive Borel measure is a positive-definite function; one ends up with the expression

∫ℝn|∑j=1ncj⁢ei⁢ξj⋅x|2⁢𝑑μ⁢(x),

which is finite and nonnegative because μ is finite and positive respectively. We have established already that the Fourier transform of a finite positive Borel measure μ on ℝn is continuous and satisfies μ^⁢(0)=1. Bochner’s theorem is the statement that a function with these three properties is indeed the Fourier transform of a finite positive Borel measure. Our proof of the following theorem follows Folland.33 3 Gerald B. Folland, A Course in Abstract Harmonic Analysis, p. 95, Theorem 4.18.

Theorem 5 (Bochner).

If ϕ:ℝn→ℂ is positive-definite, continuous, and satisfies ϕ⁢(0)=1, then there is some Borel probability measure μ on ℝn such that ϕ=μ^.

Proof.

Let {ψU} be an approximate identity. That is, for each neighborhood U of 0, ψU is a function such that supp⁢ψU is compact and contained in U, ψ≥0, ψU⁢(-x)=ψU⁢(x), and ∫ℝnψU⁢𝑑mn=1. For every f∈L1⁢(ℝn), an approximate identity satisfies ∥f*ψU-f∥L1→0 as U→{0}.44 4 Gerald B. Folland, A Course in Abstract Harmonic Analysis, p. 53, Proposition 2.42.

We have ψU*=ψ-U, so

supp⁢(ψU**ψU)⊆supp⁢ψ-U+supp⁢ψU¯=supp⁢ψ-U+supp⁢ψU⊆-U+U,

and as always, ∫ℝnf*g⁢𝑑mn=∫ℝnf⁢𝑑mn⁢∫ℝng⁢𝑑mn. Therefore {ψU**ψU} is an approximate identity:

For f,g∈L1⁢(ℝn), define

⟨f,g⟩ϕ=∫ℝn(g**f)⁢ϕ⁢𝑑mn.

One checks that this is a positive Hermitian form; positive means that ⟨f,f⟩ϕ≥0 for all f∈L1⁢(ℝn), and this is given to us by Corollary 4. Using the Cauchy-Schwarz inequality,55 5 Jean Dieudonne, Foundations of Modern Analysis, 1969, p. 117, Theorem 6.2.1.

|⟨f,g⟩ϕ|2≤⟨f,f⟩ϕ⁢⟨g,g⟩ϕ.

We have laid out the tools that we will use. Let f∈L1⁢(ℝn). ψU*f→f in L1 as U→{0}, and as ϕ is bounded this gives ∫ℝn(ψU**f)⁢ϕ⁢𝑑mn→∫ℝnf⁢ϕ⁢𝑑mn as U→{0}. Because {ψU**ψU} is an approximate identity, ∫ℝn(ψU**ψU)⁢ϕ⁢𝑑mn→ϕ⁢(0) as U→{0}. That is, we have ⟨f,ψU⟩ϕ→∫ℝnf⁢ϕ⁢𝑑mn and ⟨ψU,ψU⟩ϕ→ϕ(0 as U→{0}, and as ϕ⁢(0)=1, the above statemtn of the Cauchy-Schwarz inequality produces

|∫ℝnf⁢ϕ⁢𝑑mn|2≤∫ℝn(f**f)⁢ϕ⁢𝑑mn. (1)

With h=f**f, the inequality (1) reads

|∫ℝnf⁢ϕ⁢𝑑mn|2≤∫ℝnh⁢ϕ⁢𝑑mn.

Defining h(1)=h, h(2)=h*h, h(3)=h*h*h, etc., applying (1) to h gives, because h*=h,

|∫ℝnh⁢ϕ⁢𝑑mn|2≤∫ℝnh(2)⁢ϕ⁢𝑑mn.

Then applying (1) to h(2), which satisfies (h(2))*=h(2),

|∫ℝnh(2)⁢ϕ⁢𝑑mn|2≤∫ℝnh(4)⁢ϕ⁢𝑑mn.

Thus, for any m≥0 we have

|∫ℝnf⁢ϕ⁢𝑑mn| ≤ |∫ℝnh(2m)⁢ϕ⁢𝑑mn|2-(m+1)
≤ ∥h(2m)∥L12-(m+1)
= (∥h(2m)∥L12-m)1/2,

since ∥ϕ∥∞=ϕ⁢(0)=1.

With convolution as multiplication, L1⁢(ℝn) is a commutative Banach algebra, and the Gelfand transform is an algebra homomorphism L1⁢(ℝn)→C0⁢(ℝn) that satisfies66 6 Gerald B. Folland, A Course in Abstract Harmonic Analysis, p. 15, Theorem 1.30. Namely, this is the Gelfand-Naimark theorem.

∥g^∥∞=limk→∞⁡∥g(k)∥L11/k,g∈L1⁢(ℝn);

for L1⁢(ℝn), the Gelfand transform is the Fourier transform. Write the Fourier transform as ℱ:L1⁢(ℝn)→C0⁢(ℝn). Stating that the Gelfand transform is a homomorphism means that ℱ⁢(g1*g2)=ℱ⁢(g1)⁢ℱ⁢(g2), because multiplication in the Banach algebra C0⁢(ℝn) is pointwise multiplication. Then, since a subsequence of a convergent sequence converges to the same limit,

limm→∞⁡(∥h(2m)∥L12-m)1/2=(∥h^∥∞)1/2.

But

h^=ℱ⁢(f**f)=ℱ⁢(f*)⁢ℱ⁢(f)=ℱ⁢(f)¯⁢ℱ⁢(f)=|ℱ⁢(f)|2,

so

(∥h^∥∞)1/2=(∥|f^|2∥∞)1/2=∥f^∥∞.

Putting things together, we have that for any f∈L1⁢(ℝn),

|∫ℝnf⁢ϕ⁢𝑑mn|≤∥f^∥∞.

Therefore f^↦∫ℝnf⁢ϕ⁢𝑑mn is a bounded linear functional ℱ⁢(L1⁢(ℝn))→ℂ, of norm ≤1. Using ϕ⁢(0)=1, one proves that this functional has norm 1. (If we could apply this inequality to ℱ⁢(δ) the two sides would be equal, thus to prove that the operator norm is 1, one applies the inequality to a sequence of functions that converge weakly to δ.) We take as known that ℱ⁢(L1⁢(ℝn)) is dense in the Banach space C0⁢(ℝn), so there is a bounded linear functional Φ:C0⁢(ℝn)→ℂ whose restriction to ℱ⁢(L1⁢(ℝn)) is equal to f^↦∫ℝnf⁢ϕ⁢𝑑mn, and ∥Φ∥=1.

Using the Riesz-Markov theorem,77 7 Walter Rudin, Real and Complex Analysis, third ed., p. 130, Theorem 6.19. there is a regular complex Borel measure μ on ℝn such that

Φ⁢(g)=∫ℝng⁢𝑑μ,g∈C0⁢(ℝn),

and ∥μ∥=∥Φ∥; ∥μ∥ is the total variation norm of μ, ∥μ∥=|μ|⁢(ℝn). Then for f∈L1⁢(ℝn) we have

∫ℝnf⁢ϕ⁢𝑑mn = Φ⁢(f^)
= ∫ℝnf^⁢𝑑μ
= ∫ℝn(∫ℝne-i⁢ξ⋅x⁢f⁢(x)⁢𝑑mn⁢(x))⁢𝑑μ⁢(ξ)
= ∫ℝnf⁢(x)⁢(∫ℝne-i⁢x⋅ξ⁢𝑑μ⁢(ξ))⁢𝑑mn⁢(x)
= ∫ℝnf⁢(x)⁢μ^⁢(x)⁢𝑑mn⁢(x).

That this is true for all f∈L1⁢(ℝn) implies that ϕ=μ^. As μ⁢(ℝn)=μ^⁢(0)=ϕ⁢(0)=1 and ∥μ∥=∥Φ∥=1 we have μ⁢(ℝn)=∥μ∥, and this implies that μ is positive measure, hence, as μ⁢(ℝn)=1, a probability measure.

∎