The Bochner-Minlos theorem

Jordan Bell
May 13, 2014

1 Introduction

We take ℕ to be the set of positive integers. If A is a set and n∈ℕ, we typically deal with the product An as the set of functions {1,…,n}→A.

In this note I am following and greatly expanding the proof of the Bochner-Minlos theorem given by Barry Simon, Functional Integration and Quantum Physics, p. 11, Theorem 2.2.

2 The Kolmogorov extension theorem

If X is a topological space, and for m≥n the maps πm,n:Xm→Xn are defined by

(πm,n⁢(x))⁢(j)=x⁢(j),j∈{1,…,n},

then the spaces Xn and maps πm,n constitute a projective system, and its limit in the category of topological spaces is Xℕ with the maps πn:Xℕ→Xn, where Xℕ has the initial topology for the family {πn:n∈ℕ} (namely, the product topology). We say that a function f:Xℕ→ℝ depends on only finitely many coordinates if there is some n and some function g:Xn→ℝ such that f=g∘πn. We denote by Cfin⁢(Xℕ) the set of all continuous functions Xℕ→ℝ that depend on only finitely many coordinates.

If (X,τX) is a noncompact locally compact Hausdorff space, write X˙=X∪{∞}, and let τ be the collection of all subsets U of X˙ such that either (i) U∈τX or (ii) ∞∈U and X∖U is compact in (X,τX). One proves11 1 Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second ed., p. 132, Proposition 4.36. that (X˙,τ) is a compact Hausdorff space and that the inclusion map ι:X→X˙ is a homeomorphism X→ι⁢(X), where ι⁢(X) has the subspace topology inherited from X˙. Also, if f∈C⁢(X) then there is some F∈C⁢(X˙) whose restriction to X equals f if and only if there is some g∈C0⁢(X) and some constant c such that f=g+c, in which case

F⁢(x)={f⁢(x)x∈Xcx=∞.

We call X˙ the one-point compactification of X. For example, one checks that the one-point compactification of ℝn is homeomorphic to Sn.

Theorem 1 (Kolmogorov).

Suppose that for each n∈ℕ, μn is a Borel probability measure on ℝn, and that for any n and any Borel set A in ℝn we have

μn+1⁢(A×ℝ)=μn⁢(A);

equivalently, πm,n*⁢μm=μn for m≥n. There is then a Borel probability measure μ on ℝℕ such that for any n and any Borel set A in ℝn,

μ⁢({x∈ℝℕ:πn⁢(x)∈A})=μn⁢(A);

equivalently, πn*⁢μ=μn.

Proof.

Let X=ℝ˙, the one-point compactification of ℝ, and let Xℕ have the product topology, with which it is a compact Hausdorff space. For each n, if A is a Borel set in Xn, we define νn⁢(A)=μn⁢(A∩ℝn). This is a Borel measure on Xn. If g∈C⁢(Xn), m≥n, and h=g∘πm,n, then

∫Xmh⁢𝑑νm=∫Xmg∘πm,n⁢𝑑νm=∫Xng⁢d⁢(πm,n*⁢νm)=∫Xng⁢𝑑νn.

We define L:Cfin⁢(Xℕ)→ℝ in the following way. For f∈Cfin⁢(Xℕ), there is some n and some g∈C⁢(Xn) such that f=g∘πn. We define

L⁢(f)=∫Xng⁢𝑑νn.

If h∈C⁢(Xm) and f=h∘πm with m≥n, then h=g∘πm,n, giving

∫Xmh⁢𝑑νm=∫Xmg⁢𝑑νn,

so the definition of L⁢(f) makes sense.

It is straightforward to check that Cfin⁢(Xℕ) is an algebra over ℝ. The algebra Cfin⁢(Xℕ) separates points in Xℕ, and the constant map x↦1 belongs to Cfin⁢(Xℕ); the latter fact tells us that there is no x∈Xℕ such that f⁢(x)=0 for all f∈Cfin⁢(Xℕ). Therefore, the Stone-Weierstrass theorem22 2 Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, second ed., p. 141, Corollary 4.50. tells us that Cfin⁢(Xℕ) is dense in the Banach algebra C⁢(Xℕ).

If f∈Cfin⁢(Xℕ) and f=g∘πn, then ∥f∥∞=∥g∥∞, which is finite because Xn is compact. Because each νn is a probability measure,

|L⁢(f)|=|∫Xng⁢𝑑νn|≤∥g∥∞=∥f∥∞,

showing that L:Cfin⁢(Xℕ)→ℝ is a bounded linear map, with ∥L∥=1. Because Cfin⁢(Xℕ) is dense in C⁢(Xℕ), there is a bounded linear map Λ:C⁢(Xℕ)→ℝ whose restriction to Cfin⁢(Xℕ) is equal to L, and that satisfies ∥Λ∥=∥L∥=1. Moreover, if f∈Cfin⁢(Xℕ) satisfies f≥0, then it is apparent that L⁢(f)≥0; we say that L is a positive linear functional. The fact that L is a positive linear functional implies that Λ is too. Because Λ:C⁢(Xℕ)→ℝ is a positive linear functional with ∥Λ∥=1, by the Riesz-Markov theorem33 3 Walter Rudin, Real and Complex Analysis, third ed., p. 40, Theorem 2.14. there is a Borel probability measure ν on Xℕ such that

Λ⁢f=∫Xℕf⁢𝑑ν,f∈C⁢(Xℕ).

If A is a Borel set in ℝℕ with the product topology, define μ⁢(A)=ν⁢(A). μ is a Borel probability measure on ℝℕ.

Now that we have in our hands a Borel probability measure μ on ℝℕ it remains to verify that it does what we want it to do. ∎

3 Sequence spaces

For x,y∈ℝℕ and m∈ℤ, we define

⟨x,y⟩m=∑j=1∞j2⁢m⁢x⁢(j)⁢y⁢(j),

and ∥x∥m=⟨x,x⟩m1/2. We define 𝔖m to be the set of all those x∈ℝℕ for which ∥x∥m<∞, and we take as granted that for each m, 𝔖m is a Hilbert space. For m≥n, let ιm,n:𝔖m→𝔖n be the inclusion map. As

∥ιm,n⁢x∥n2 = ∑j=1∞j2⁢n⁢(ιm,n⁢x)⁢(j)2
= ∑j=1∞j2⁢m⁢j2⁢(n-m)⁢x⁢(j)2
≤ ∑j=1∞j2⁢m⁢x⁢(j)2,

the map ιm,n is a bounded operator. In fact, if m>n we now demonstrate that ιm,n is a Hilbert-Schmidt operator, and so compact, which is the conclusion of Rellich’s theorem. For i∈ℕ, define ei∈ℝℕ by

ei⁢(j)=j-m⁢δi,j.

These ei are an orthonormal basis for 𝔖m, and

∑i=1∞∥ιm,n⁢ei∥n2 = ∑i=1∞∑j=1∞j2⁢n⁢(ιm,n⁢ei)⁢(j)2
= ∑i=1∞∑j=1∞j2⁢n⁢(j-m⁢δi,j)2
= ∑i=1∞i2⁢n⁢i-2⁢m
= ∑i=1∞i2⁢(n-m).

Because m>n, this last expression is <∞. This shows that ιm,n:𝔖m→𝔖n is a Hilbert-Schmidt operator.

For x∈𝔖m and λ∈𝔖-m, define

⟨x,λ⟩=∑j=1∞x⁢(j)⁢λ⁢(j), (1)

and using the Cauchy-Schwarz inequality,

|⟨x,λ⟩| ≤ ∑j=1∞|x⁢(j)|⁢|λ⁢(j)|
= ∑j=1∞jm⁢|x⁢(j)|⁢j-m⁢|λ⁢(j)|
≤ (∑j=1∞j2⁢m⁢|x⁢(j)|2)1/2⁢(∑j=1∞j-2⁢m⁢|λ⁢(j)|2)1/2
= ∥x∥m⁢∥λ∥-m.

𝔖-m is thus the dual space of the Banach space 𝔖m. That is, as a vector space 𝔖m*=𝔖-m, but we shall be interested in 𝔖m* with the weak-* topology with which it is a locally convex space, rather than with the norm topology with which it is a Banach space.

Since ιm,n:𝔖m→𝔖n is a bounded linear map for m≥n, the spaces 𝔖m and the maps ιm,n are a projective system of Banach spaces, and this projective system has a limit 𝔖 in the category of locally convex spaces. This limit 𝔖 is a Fréchet space. The duals 𝔖m* with the weak-* topology are locally convex spaces and constitute a direct system with the maps (ιm,n)*:𝔖n*→𝔖m*, where (ιm,n)*⁢(λ)=λ∘ιm,n for λ∈𝔖n*. This direct system has a colimit in the category of locally convex spaces which is equal to 𝔖* with the weak-* topology.44 4 Paul Garrett, http://www.math.umn.edu/~garrett/m/fun/notes_2012-13/04_blevi_sobolev.pdf, p. 15. As sets,

𝔖=⋂m∈ℤ𝔖m,𝔖*=⋃m∈ℤ𝔖m*=⋃m∈ℤ𝔖m.

We also denote by ⟨⋅,⋅⟩ the dual pairing of 𝔖 and 𝔖*: for x∈𝔖 and λ∈𝔖*,

λ⁢(x)=⟨x,λ⟩=∑j=1∞x⁢(j)⁢λ⁢(j).

For any λ∈𝔖*, there is some m for which λ∈𝔖m*=𝔖-m. But if x∈𝔖 then x∈𝔖m, and so this dual pairing coincides with (1).

4 Positive-definite functions

If X is a vector space and Φ:X→ℂ is a function, we say that Φ is positive-definite if for any positive integer r and for any x1,…,xr∈X and c1,…,cr∈ℂ, we have

∑j,k=1rcj⁢ck¯⁢Φ⁢(xj-xk)≥0.

If Φ is positive-definite, one proves that Φ⁢(0)≥0, Φ⁢(-x)=Φ⁢(x)¯, and |Φ⁢(x)|≤Φ⁢(0).

If μ is a probability measure on (𝔖*,Cyl⁢(𝔖*)), we define the Fourier transform of μ to be the function μ^:𝔖→ℂ defined by

μ^⁢(x)=(ℱ⁢μ)⁢(x)=∫𝔖*exp⁡(-i⁢Lx)⁢𝑑μ,x∈𝔖;

because Lx:𝔖*→ℝ and μ is a probability measure, this integral is finite. Using the dominated convergence theorem, one checks that μ^:𝔖→ℂ is continuous. It is apparent that μ^⁢(0)=1. If x1,…,xr∈𝔖 and c1,…,cr∈ℂ, then

∑j,k=1rcj⁢ck¯⁢μ^⁢(xj-xk) = ∑j,k=1rcj⁢ck¯⁢∫𝔖*exp⁡(-i⁢λ⁢(xj-xk))⁢𝑑μ⁢(λ)
= ∫𝔖*∑j,k=1rcj⁢exp⁡(-i⁢λ⁢xj)⁢ck⁢exp⁡(-i⁢λ⁢xk)¯⁢d⁢μ⁢(λ)
= ∫𝔖*(∑j=1rcj⁢exp⁡(-i⁢λ⁢xj))⁢(∑k=1rck⁢exp⁡(-i⁢λ⁢xk))¯⁢𝑑μ⁢(λ)
= ∫𝔖*|∑j=1rcj⁢exp⁡(-i⁢λ⁢xj)|2⁢𝑑μ⁢(λ)
≥ 0,

so μ^:𝔖→ℂ is positive-definite.

5 Cylinder sigma-algebras

𝔖* is a topological space and so has a Borel σ-algebra. We shall now define a σ-algebra on 𝔖*, called the cylinder σ-algebra of S* and denoted Cyl⁢(𝔖*), that is strictly contained in the Borel σ-algebra of 𝔖*. For x∈𝔖, define Lx:𝔖*→ℝ by Lx⁢(λ)=λ⁢(x)=⟨x,λ⟩. We define Cyl⁢(𝔖*) to be the coarsest σ-algebra such that for each x∈𝔖, the map Lx:𝔖*→ℝ is measurable, where ℝ has the Borel σ-algebra. Since each Lx is continuous, Lx is measurable with respect to the Borel σ-algebra on 𝔖*, so Cyl⁢(𝔖*) is contained in the Borel σ-algebra of 𝔖*; it is not obvious that the cylinder σ-algebra is strictly contained in the Borel σ-algebra. Unless we say otherwise, when we speak of measurable functions on 𝔖* or measures on 𝔖* we mean with respect to the cylinder σ-algebra.

6 Minlos’s theorem

In the following theorem we obtain a Borel probability measure μ on ℝℕ with the product topology. We denote by 𝔅 the Borel σ-algebra of ℝℕ. The collection 𝔅0={B∩𝔖:B∈𝔅} is a σ-algebra on 𝔖. We assert that 𝔅0⊆Cyl⁢(𝔖), and that Cyl⁢(𝔖) does not contain the Borel σ-algbera of 𝔖, and thus that the restriction of μ to 𝔖 is not a Borel measure.

Theorem 2 (Minlos).

If Φ:𝔖→ℂ is positive-definite, continuous, and Φ⁢(0)=1, then there is some probability measure μ on (𝔖*,Cyl⁢(𝔖*)) such that Φ=μ^.

Proof.

For M≥N, define πM,N:ℝM→ℝN by

(πM,N⁢x)⁢(j)=x⁢(j),j∈{1,…,N}.

The Banach spaces ℝN and the maps πM,N constitute a projective system in the category of locally convex spaces, with the limit ℝℕ, which is thus a Fréchet space, with the maps πN:ℝℕ→ℝN,

(πN⁢x)⁢(j)=x⁢(j),j∈{1,…,N}.

The dual maps πM,N*:(ℝN)*→(ℝM)* are defined for λ∈(ℝN)* by

(πM,N*)⁢(λ)=λ∘πM,N.

(ℝN)*=ℝN and the maps πM,N* constitute a direct system, and their colimit in the category of locally convex spaces is denoted

ℝ∞=⊕N∈ℕℝ.

ℝ∞=(ℝℕ)*, and the maps πN*:(ℝN)*→ℝ∞ satisfy

πN*⁢(λ)=λ∘πN.

The function ΦN=Φ∘πN*:(ℝN)*→ℂ satisfies, for λ1,…,λr∈(ℝN)* and c1,…,cr∈ℂ,

∑j,k=1rcj⁢ck¯⁢(Φ∘πN*)⁢(λj-λk)=∑j,k=1rcj⁢ck¯⁢Φ⁢(λj∘πN-λk∘πN)≥0,

because λ1∘πN,…,λr∘πN∈𝔖 and Φ:𝔖→ℂ is positive-definite. Furthermore, (Φ∘πN*)⁢(0)=Φ⁢(0)=1, and ΦN=Φ∘πN* is a composition of continuous functions so is itself continuous. Therefore, for each N∈ℕ we have by Bochner’s theorem that there is one and only Borel probability measure μN on ℝN that satisfies ΦN=μ^N. If M≥N, for ξ∈(ℝN)*=ℝN we have

ℱ⁢(πM,N*⁢μM)⁢(ξ) = ∫ℝNe-i⁢ξ⋅x⁢d⁢(πM,N*⁢μM)⁢(x)
= ∫ℝMe-i⁢ξ⋅πM,N⁢(x)⁢𝑑μM⁢(x)
= ∫ℝMe-i⁢πM,N*⁢(ξ)⋅x⁢𝑑μM⁢(x)
= μ^M⁢(πM,N*⁢(ξ))
= ΦM⁢(πM,N*⁢(ξ))
= (ΦM∘πM,N*)⁢(ξ)
= ΦN⁢(ξ)
= μ^N⁢(ξ).

Since ℱ⁢(πM,N*⁢μM)=ℱ⁢(μN), it follows that πM,N*⁢μM=μN. Therefore, the Borel probability measures μN satisfy the conditions of the Kolmogorov extension theorem, and so there is some Borel probability measure μ on ℝℕ such that πN*⁢μ=μN. Now that we have our hands on the measure μ, one must prove that μ^=Φ.

Supposing that we have proved μ^=Φ, we now prove that μ⁢(𝔖*)=1. Let ϵ>0. Φ:𝔖→ℂ is continuous at 0 and Φ⁢(0)=1, and as 𝔖 has the locally convex topology induced by the family of seminorms ∥⋅∥m, there is some m∈ℤ and some δ>0 such that ∥y∥m≤δ implies that |Φ⁢(y)-1|≤ϵ. Suppose that y∈𝔖. On the one hand, if ∥y∥m2≤δ2, then

1-Re⁢Φ⁢(y)≤|Re⁢Φ⁢(y)-1|≤|Φ⁢(y)-1|≤ϵ.

On the other hand, if ∥y∥m2>δ2, using |Φ⁢(y)|≤Φ⁢(0)=1 and so |Re⁢Φ⁢(y)|≤|Φ⁢(y)|≤1, we get

Re⁢Φ⁢(y)≥-1>1-2⁢δ-2⁢∥y∥m2.

Therefore, for any y∈𝔖,

Re⁢Φ⁢(y)≥1-ϵ-2⁢δ-2⁢∥y∥m2.

Then, for y∈ℝN we have

Re⁢Φ⁢(πN*⁢(y))≥1-ϵ-2⁢δ-2⁢∥πN*⁢(y)∥m2. (2)

Let α>0, let qk=k-2⁢m-2, and let σα,N be the measure on ℝN with

d⁢σα,N⁢(y)=∏k=1N(2⁢π⁢α⁢qk)-1/2⁢exp⁡(-yk22⁢α⁢qk)⁢d⁢yk.

Using ∫ℝexp⁡(-x2)⁢𝑑x=π, it is straightforward to check that σα,N is a probability measure on ℝN. Furthermore, we calculate, using respectively ∫ℝx⁢exp⁡(-x2)⁢𝑑x=0, ∫ℝexp⁡(-x2)⁢𝑑x=π, and ∫ℝx2⁢exp⁡(-x2)⁢𝑑x=π2,

∫ℝNyi⁢yj⁢𝑑σα,N⁢(y) = δi,j⁢∫ℝ⋯⁢∫ℝyj2⁢∏k=1N(2⁢π⁢α⁢qk)-1/2⁢exp⁡(-yk22⁢α⁢qk)⁢d⁢yk
= δi,j⁢(∏k≠j∫ℝ(2⁢π⁢α⁢qk)-1/2⁢exp⁡(-yk22⁢α⁢qk)⁢𝑑yk)
⋅∫ℝyj2(2παqj)-1/2exp(-yj22⁢α⁢qj)dyj
= δi,j⁢∫ℝyj2⁢(2⁢π⁢α⁢qj)-1/2⁢exp⁡(-yj22⁢α⁢qj)⁢𝑑yj
= δi,j⁢α⁢qj.

and for x∈ℝN, taking as known the Fourier transform of a Gaussian function,

∫ℝNe-i⁢x⋅y⁢𝑑σα,N⁢(y) = ∏k=1N∫ℝe-i⁢xk⁢yk⁢(2⁢π⁢α⁢qk)-1/2⁢exp⁡(-yk22⁢α⁢qk)⁢𝑑yk
= ∏k=1Nexp⁡(-α⁢qk⁢xk22)
= exp⁡(-α2⁢∑k=1Nqk⁢xk2).

Then, using Φ=μ^, the integral of the left-hand side of (2) over ℝN with respect to σα,N is

Re⁢∫ℝNΦ⁢(πN*⁢(y))⁢𝑑σα,N⁢(y) = Re⁢∫ℝN∫ℝℕexp⁡(-i⁢⟨πN*⁢(y),x⟩)⁢𝑑μ⁢(x)⁢𝑑σα,N⁢(y)
= Re⁢∫ℝℕ∫ℝNexp⁡(-i⁢y⋅πN⁢(x))⁢𝑑σα,N⁢(y)⁢𝑑μ⁢(x)
= Re⁢∫ℝℕexp⁡(-α2⁢∑k=1Nqk⁢xk2)⁢𝑑μ⁢(x)
= ∫ℝℕexp⁡(-α2⁢∑k=1Nqk⁢xk2)⁢𝑑μ⁢(x).

The integral of the right-hand side of (2) over ℝN with respect to σα,N is

∫ℝN(1-ϵ-2⁢δ-2⁢∥πN*⁢(y)∥m2)⁢𝑑σα,N⁢(y) = 1-ϵ-2⁢δ-2⁢∫ℝN∑k=1Nk2⁢m⁢yk2⁢d⁢σα,N⁢(y)
= 1-ϵ-2⁢δ-2⁢∑k=1Nk2⁢m⁢α⁢qk2
= 1-ϵ-2⁢δ-2⁢α⁢∑k=1Nk-2.

Combining these, (2) is

∫ℝℕexp⁡(-α2⁢∑k=1Nqk⁢xk2)⁢𝑑μ⁢(x)≥1-ϵ-2⁢δ-2⁢α⁢∑k=1Nk-2.

Taking N→∞,

∫ℝℕexp⁡(-α2⁢∑k=1∞qk⁢xk2)⁢𝑑μ⁢(x)≥1-ϵ-2⁢δ-2⁢α⋅ζ⁢(2). (3)

But

limα→0+⁡exp⁡(-α2⁢∑k=1Nqk⁢xk2) = limα→0+⁡exp⁡(-α2⁢∑k=1Nk2⁢(-m-1)⁢xk2)
= {1x∈𝔖-m-10x∉𝔖-m-1,

so taking α→0+, (3) yields

∫ℝℕχ𝔖-m-1⁢(x)⁢𝑑μ⁢(x)≥1-ϵ,

i.e. μ⁢(𝔖-m-1)≥1-ϵ, and μ⁢(𝔖*)≥μ⁢(𝔖-m-1). That is, we have proved that for any ϵ>0 there is some m∈ℤ such that

μ⁢(𝔖*)≥μ⁢(𝔖-m-1)≥1-ϵ,

which shows that μ⁢(𝔖*)=1, i.e. that μ is a probability measure. ∎

7 References

There don’t seem to be many detailed presentations of the Bochner-Minlos theorem, or Minlos’s theorem, in the literature. Cf. Sazonov’s theorem. Doing some searching through books, the following look like they have enough details so that they are not worse than nothing, which is more than can always be said:

  • •

    Helge Holden, Bernt Øksendal, Jan Ubøe and Tusheng Zhang, Stochastic Partial Differential Equations: A Modeling, White Noise Functional Approach, second ed., Appendix A, pp. 257ff.

  • •

    Takeyuki Hida, Brownian Motion, pp. 116ff., §3.2

  • •

    I. M. Gelfand and N. Ya. Vilenkin, Generalized Functions. Volume 4: Applications of Harmonic Analysis

  • •

    V. I. Bogachev, Measure Theory, vol. II, p. 124, Theorem 7.13.7

  • •

    A. V. Skorokhod, Basic Principles and Applications of Probability Theory, p. 51, §2.4.4

  • •

    N. Bourbaki, Integration II: Chapters 7–9, p. IX.100, §6, Theorem 4