Convolution semigroups, canonical processes, and Brownian motion

Jordan Bell
June 16, 2015

1 Convolution semigroups, projective families, and canonical processes

Let

E=ℝd

and let ℰ=ℬℝd, the Borel σ-algebra of ℝd, and let 𝒫⁢(E) be the collection of Borel probability measures on ℝd. With the narrow topology, 𝒫⁢(E) is a Polish space. For a nonempty set J, we write

ℰJ=⊗t∈Jℰ,

the product σ-algebra.

Let A:E×E→E be A⁢(x1,x2)=x1+x2. For ν1,ν2∈𝒫⁢(E), the convolution of ν1 and ν2 is the pushforward of the product measure ν1×ν2 by A:

ν1*ν2=A*⁢(ν1×ν2).

The convolution ν1*ν2 is an element of 𝒫⁢(E).

Let

I=ℝ≥0.

A convolution semigroup is a family (νt)t∈I of elements of 𝒫⁢(E) such that for s,t∈I,

νs+t=νs*νt.

From this, it turns out that μ0=δ0. A convolution semigroup is called continuous when the map t↦νt is continuous I→𝒫⁢(E).

For ν∈𝒫⁢(E) and x∈E, and for B∈ℰ,

(ν*δx)⁢(B)=∫E(∫E1B⁢(x1+x2)⁢𝑑δx⁢(x1))⁢𝑑ν⁢(x2)=ν⁢(B-x),

and we define νx∈𝒫⁢(E) by

νx=ν*δx.

For ν∈𝒫⁢(E) and for a Borel measurable function f:E→[0,∞], write

ν⁢f=∫Ef⁢𝑑μ.

For x∈E, using the change of variables formula11 1 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 484, Theorem 13.46. and Fubini’s theorem,

νx⁢f =∫Ef⁢d⁢(ν*δx)
=∫E×Ef∘A⁢d⁢(ν×δx)
=∫E(∫Ef⁢(x1+x2)⁢𝑑δx⁢(x2))⁢𝑑ν⁢(x1)
=∫Ef⁢(x1+x)⁢𝑑ν⁢(x1).

That is, for ν∈𝒫⁢(E), for f:E→[0,∞] Borel measurable, and for x∈E,

νx⁢f=∫Ef⁢𝑑νx=∫Ef⁢(x+y)⁢𝑑ν⁢(y). (1)

For nonempty subsets J and K of I with J⊂K, let

πK,J:EK→EJ

be the projection map. Let 𝒦=𝒦⁢(I) be the collection of finite nonempty subsets of I. Let (Ω,ℱ,P,(Xt)t∈I) be a stochastic process with state space E. For J∈𝒦, with elements t1<…<tn, we define

XJ=Xt1⊗⋯⊗Xtn,

which is measurable ℱ→ℰJ. The joint distribution PJ of the family of random variables (Xt)t∈J is the distribution of XJ, i.e.

PJ=XJ*⁢P.

The family of finite-dimensional distributions of X is the family (PJ)J∈𝒦. For J,K∈𝒦 with J⊂K,

XJ=πK,J∘XK,

from which

(πK,J)*⁢PK=PJ. (2)

Forgetting the stochastic process X, a family of probability measures PJ on ℰJ, for J∈𝒦, is called a projective family when (2) is true. The Kolmogorov extension theorem tells us that if (PJ)J∈𝒦 is a projective family, then there is a unique probability measure PI on ℰI such that for any J∈𝒦,

(πI,J)*⁢PI=PJ. (3)

Then for Ω=EI and ℱ=ℰI, (Ω,ℱ,PI) is a probability space, and for t∈I we define Xt:Ω→E by

Xt⁢(ω)=πI,{t}⁢(ω)=ω⁢(t), (4)

which is measurable ℱ→ℰ, and thus the family (Xt)t∈I is a stochastic process with state space E. For J∈𝒦 it is immediate that

XJ=πI,J.

For B∈ℰJ, applying (3) gives

(XJ*⁢PI)⁢(B)=((πI,J)*⁢PI)⁢(B)=PJ⁢(B),

which means that XJ*⁢PI=PJ, namely, (PJ)J∈𝒦 is the family of finite-dimensional distributions of the stochastic process (Xt)t∈I. We call the stochastic process (4) the canonical process associated with the projective family (PJ)J∈K.

Let (νt)t∈I be a convolution semigroup and let μ∈𝒫⁢(E). For J∈𝒦, with elements t1<…<tn, and for B∈ℰJ, define

PJ⁢(B)=∫E∫E⋯⁢∫E1B⁢(x1,…,xn)⁢𝑑νtn-tn-1xn-1⁢(xn)⁢⋯⁢𝑑νt1x0⁢(x1)⁢𝑑μ⁢(x0). (5)

We say that (PJ)J∈𝒦 is the family of measures induced by the convolution semigroup (νt)t∈I. It is proved that (PJ)J∈𝒦 is a projective family. Therefore, from the Kolmogorov extension theorem it follows that there is a unique probability measure Pμ on ℰI such that

(πI,J)*⁢Pμ=PJ. (6)

For Ω=EI and ℱ=ℰI, (Ω,ℱ,Pμ) is a probability space. For t∈I define Xt:Ω→E by

Xt⁢(ω)=πI,{t}⁢(ω)=ω⁢(t).

(Xt)t∈I is a stochastic processes whose family of finite-dimensional distributions is (PJ)J∈𝒦, i.e. for J∈𝒦 with elements t1<⋯<tn and for B∈ℰJ,

((Xt1⊗⋯⊗Xtn)*⁢Pμ)⁢(B)=∫E∫E⋯⁢∫E1B⁢(x1,…,xn)⁢𝑑νtn-tn-1xn-1⁢(xn)⁢⋯⁢𝑑νt1x0⁢(x1)⁢𝑑μ⁢(x0).

Applying this with μ=δx yields

((Xt1⊗⋯⊗Xtn)*⁢Pδx)⁢(B)=∫E⋯⁢∫E1B⁢(x1,…,xn)⁢𝑑νtn-tn-1xn-1⁢(xn)⁢⋯⁢𝑑νt1x⁢(x1),

and thus, for any μ∈𝒫⁢(E),

∫E∫E⋯⁢∫E1B⁢(x1,…,xn)⁢𝑑νtn-tn-1xn-1⁢(xn)⁢⋯⁢𝑑νt1x⁢(x1)⁢𝑑μ⁢(x)=∫E((Xt1⊗⋯⊗Xtn)*⁢Pδx)⁢(B)⁢𝑑μ⁢(x).

That is, for μ∈𝒫⁢(E), for J∈𝒦, and B∈ℰJ,

(XJ*⁢Pμ)⁢(B)=∫E(XJ*⁢Pδx)⁢(B)⁢𝑑μ⁢(x). (7)

For J∈𝒦, At∈ℰ for t∈J, and A=∏t∈JAt×∏t∈I∖JE∈ℱ=ℰI, namely A is a cylinder set, let B=πI,J⁢(A)=∏t∈JAt∈ℰJ,

XJ-1⁢(B)=πI,J-1⁢(B)=A,

so by (7),

Pμ⁢(A)=∫EPδx⁢(A)⁢𝑑μ⁢(x). (8)

Because this is true for all cylinder sets in the product σ-algebra ℰI and ℰI is generated by the collection of cylinder sets, (8) is true for all A∈ℱ.

Let J∈𝒦, with elements t1<⋯<tn, and let σn:En+1→En be

σn⁢(x0,x1,…,xn)=(x0+x1,x0+x1+x2,…,x0+x1+x2+⋯+xn).

For B∈ℰn using (1) we obtain by induction

∫E∫E⋯⁢∫E1B⁢(x1,…,xn-1,xn)⁢𝑑νtn-tn-1xn-1⁢(xn)⁢⋯⁢𝑑νt1x0⁢(x1)⁢𝑑μ⁢(x0)=∫E∫E⋯⁢∫E1B⁢(x1,…,xn-1,xn+xn-1)⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt1x0⁢(x1)⁢𝑑μ⁢(x0)=⋯=∫E∫E⋯⁢∫E1B∘σn⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt1⁢(x1)⁢𝑑μ⁢(x0).

Thus, with PJ the probability measure on ℰJ defined in (5),

∫EJ1B⁢𝑑PJ=PJ⁢(B)=∫E∫E⋯⁢∫E1B∘σn⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt1⁢(x1)⁢𝑑μ⁢(x0).

For f:En→[0,∞] a Borel measurable function, there is a sequence of measurable simple functions pointwise increasing to f, and applying the monotone convergence theorem yields

∫Enf⁢𝑑PJ=∫E∫E⋯⁢∫Ef∘σn⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt1⁢(x1)⁢𝑑μ⁢(x0). (9)

2 Increments

Let (Ω,ℱ,P,(Xt)t∈I) be a stochastic process with state space E. X is said to have stationary increments if there is a family (νt)t∈I of probability measures on ℰ such that for all s,t∈I with s≤t,

P*⁢(Xt-Xs)=νt-s.

In particular, for s=t this implies that P*⁢(0)=ν0, hence ν0=δ0.

A stochastic process is said to have independent increments if for any J∈𝒦, with elements 0=t0<t1<⋯<tn, the random variables

Xt0,Xt1-Xt0,…,Xtn-Xtn-1

are independent.

We now prove that the canonical process associated with the projective family of probability measures induced by a convolution semigroup and any initial distribution has stationary and independent increments.22 2 Heinz Bauer, Probability Theory, p. 321, Theorem 37.2.

Theorem 1.

Let (νt)t∈I be a convolution semigroup, let (PJ)J∈𝒦 be the family of measures induced by this convolution semigroup, let μ∈𝒫⁢(E), and let (Ω,ℱ,Pμ,(Xt)t∈I), Ω=EI and ℱ=ℰI, be the associated canonical process. X has stationary increments,

(Xt-Xs)*⁢Pμ=νt-s,s≤t, (10)

and has independent increments.

Proof.

ν0=δ0, so (10) is immediate when s=t. When s<t, let

Y=Xs⊗Xt=X{s,t}=πI,{s,t},

which is measurable ℱ→ℰ⊗ℰ, and let q:E×E→E be (x1,x2)↦x2-x1, which is continuous and hence Borel measurable. Then q∘Y is measurable ℱ→ℰ, and for B∈ℰ,

(q∘Y)-1⁢(B) ={ω∈Ω:(q∘Y)⁢(ω)∈B}
={ω∈Ω:Xt⁢(ω)-Xs⁢(ω)∈B}
=(Xt-Xs)-1⁢(B),

and thus

(q∘Y)*⁢Pμ=(Xt-Xs)*⁢Pμ. (11)

Now, according to (6),

Y*⁢Pμ=(πI,{s,t})*⁢Pμ=P{s,t}.

Therefore, using that x2-x1∈B if and only if x2∈x1+B and also using νt-sx1⁢(x1+B)=νt-s⁢(B),

(Xt-Xs)*⁢Pμ⁢(B) =(q∘Y)*⁢Pμ⁢(B)
=Y*⁢Pμ⁢(q-1⁢(B))
=P{s,t}*⁢(q-1⁢(B))
=∫E∫E∫E1q-1⁢(B)⁢(x1,x2)⁢𝑑νt-sx1⁢(x2)⁢𝑑νsx⁢(x1)⁢𝑑μ⁢(x)
=∫E∫E∫E1x1+B⁢(x2)⁢𝑑νt-sx1⁢(x2)⁢𝑑νsx⁢(x1)⁢𝑑μ⁢(x)
=νt-s⁢(B)⁢∫E∫E𝑑νsx⁢(x1)⁢𝑑μ⁢(x)
=νt-s⁢(B)⁢∫Eνsx⁢(E)⁢𝑑μ⁢(x)
=νt-s⁢(B)⁢∫E𝑑μ⁢(x)
=νt-s⁢(B),

which shows that

(Xt-Xs)*⁢Pμ=νt-s,

and thus that X has stationary increments.

Let 0=t0<t1<⋯<tn, let J={t0,t1,…,tn}∈𝒦, write Xt-1=0, and let

Y0=Xt0-Xt-1,Y1=Xt1-Xt0,…,Yn=Xtn-Xtn-1.

For the random variables Y0,…,Yn to be independent means for their joint distribution to be equal to the product of the distributions of each, i.e. to prove that X has independent increments, writing

Z=Y0⊗⋯⊗Yn=τn∘(Xt0⊗⋯⊗Xtn)=τn∘XJ=τn∘πI,J,

with τn:En+1→En defined by

τn⁢(x0,x1,…,xn)=(x0,x1-x0,…,xn-xn-1),

we have to prove that

Z*⁢Pμ=∏j=0nYj*⁢Pμ.

To prove this, it suffices (because the collection of cylinder sets generates the product σ-algebra) to prove that for any A0,…,An∈ℰ and for A=∏j=0nAj∈ℰn+1,

(Z*⁢Pμ)⁢(A)=(∏j=0nYj*⁢Pμ)⁢(A),

i.e. that

(Z*⁢Pμ)⁢(A)=∏j=0n(Yj*⁢Pμ)⁢(Aj).

We now prove this. Using the change of variables theorem and (6),

(Z*⁢Pμ)⁢(A) =∫En+11A⁢d⁢(Z*⁢Pμ)
=∫Ω1A∘Z⁢𝑑Pμ
=∫Ω1A∘τn∘(Xt0⊗⋯⊗Xtn)⁢𝑑Pμ
=∫EJ1A∘τn⁢d⁢(XJ*⁢Pμ)
=∫EJ1A∘τn⁢𝑑PJ.

Then applying (9) with f=1A∘τn,

∫EJ1A∘τn⁢𝑑PJ=∫E∫E⋯⁢∫E1A∘τn∘σn+1⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt0⁢(x0)⁢𝑑μ⁢(x-1)=∫E∫E⋯⁢∫E1A⁢(x-1+x0,x1,…,xn)⁢𝑑νtn-tn-1⁢(xn)⁢⋯⁢𝑑νt0⁢(x0)⁢𝑑μ⁢(x-1)=∫E∫E⋯⁢∫E1A0⁢(x-1+x0)⁢1A1⁢(x1)⁢⋯⁢1An⁢(xn)d⁢νtn-tn-1⁢(xn)⁢⋯⁢d⁢νt0⁢(x0)⁢d⁢μ⁢(x-1)=∏j=1nνtj-tj-1⁢(Aj)⁢∫E∫E1A0⁢(x-1+x0)⁢𝑑νt0⁢(x0)⁢𝑑μ⁢(x-1),

and because t0=0 and ν0=δ0,

∫E∫E1A0⁢(x-1+x0)⁢𝑑νt0⁢(x0)⁢𝑑μ⁢(x-1) =∫E∫E1A0⁢(x-1+x0)⁢𝑑δ0⁢(x0)⁢𝑑μ⁢(x-1)
=∫E1A0⁢(x-1)⁢𝑑μ⁢(x-1)
=μ⁢(A0),

and therefore

(Z*⁢Pμ)⁢(A)=μ⁢(A0)⋅∏j=1nνtj-tj-1⁢(Aj).

But we have already proved that (10), which tells us that for each j,

Yj*⁢Pμ=(Xtj-Xtj-1)*⁢Pμ=νtj-tj-1,

and thus

(Z*⁢Pμ)⁢(A)=μ⁢(A0)⋅∏j=1n(Yj*⁢Pμ)⁢(Aj).

But Y0*⁢Pμ=X0*⁢Pμ and from (7) we have

(X0*⁢Pμ)⁢(A0)=∫E(X0*⁢Pδx)⁢(A0)⁢𝑑μ⁢(x)=∫E(π0*⁢Pδx)⁢(A0)⁢𝑑μ⁢(x),

and, from (5),

(π0*⁢Pδx)⁢(A0) =∫E∫E1A0⁢(x0)⁢𝑑ν0y⁢(x0)⁢𝑑δx⁢(y)
=∫E∫E1A0⁢(x0)⁢𝑑δy⁢(x0)⁢𝑑δx⁢(y)
=∫E1A0⁢(y)⁢𝑑δx⁢(y)
=1A0⁢(x),

thus

(X0*⁢Pμ)⁢(A0)=∫E1A0⁢(x)⁢𝑑μ⁢(x)=μ⁢(A0).

Therefore

(Z*⁢Pμ)⁢(A)=(X0*⁢Pμ)⁢(A0)⋅∏j=1n(Yj*⁢Pμ)⁢(Aj)=∏j=0n(Yj*⁢Pμ)⁢(Aj),

which completes the proof that X has independent increments. ∎

3 The Brownian convolution semigroup and Brownian motion

For a∈ℝ and σ>0, let γa,σ2 be the Gaussian measure on ℝ, the probability measure on ℝ whose density with respect to Lebesgue measure is

p⁢(x,a,σ2)=12⁢π⁢σ2⁢exp⁡(-(x-a)22⁢σ2).

For σ=0, let

γa,0=δa.

Define for t∈I,

νt=∏k=1dγ0,t,

which is an element of 𝒫⁢(E). For s,t∈I, we calculate

νs*μt=(∏k=1dγ0,s)*(∏k=1dγ0,t)=∏k=1d(γ0,s*γ0,t)=∏k=1dγ0,s+t=νs+t,

showing that (νt)t∈I is a convolution semigroup. It is proved using Lévy’s continuity theorem that t↦νt is continuous I→𝒫⁢(E), showing that (νt)t∈I is a continuous convolution semigroup.

We first prove a lemma (which is made explicit in Isserlis’s theorem) about the moments of random variables with Gaussian distributions.33 3 Heinz Bauer, Probability Theory, p. 341, Lemma 40.2.

Lemma 2.

If Z:Ω→E is a random variable with Gaussian distribution ντ, τ>0, then for each n there is some Cn>0 such that

E⁢(|Z|2⁢n)=Cn⁢τn.

In particular, C2=d and C4=d⁢(d+2).

Proof.

That Z has distribution ντ means that

Z*⁢P=ντ=∏j=1dγ0,τ.

Write Z=Z1⊗⋯⊗Zd, each of which has distribution γ0,τ, and Z*⁢P=∏j=1dZj*⁢P, which means that Z1,…,Zd independent. Let Uj=τ-1/2⁢Zj for j=1,…,d, and then U1,…,Ud are independent random variables each with distribution γ0,1. Then using the multinomial formula,

E⁢(|Z|2⁢n) =E⁢((Z12+⋯+Zd2)n)
=τn⋅E⁢((U12+⋯+Ud2)n)
=τn⋅E⁢(∑k1+⋯+kd=nn!k1!⁢⋯⁢kd!⁢∏1≤i≤dUj2⁢ki)
=τn⋅∑k1+⋯+kd=nn!k1!⁢⋯⁢kd!⁢E⁢(∏1≤i≤dUj2⁢ki).

For n=2, since E⁢(Ui⁢Uj)=E⁢(Ui)⁢E⁢(Uj)=0 for i≠j,

τ2⋅∑k1+⋯+kd=22k1!⁢⋯⁢kd!⁢E⁢(∏1≤i≤dUi2⁢ki)=τ2⋅∑j=1dE⁢(Uj2)=τ2⋅∑j=1d1=d⁢τ2,

showing that C2=d. ∎

A stochastic process (Ω,ℱ,P,(Xt)t∈I) with state space E is called a d-dimensional Brownian motion when:

  1. 1.

    For s≤t,

    (Xt-Xs)*⁢P=νt-s,

    and thus X has stationary increments.

  2. 2.

    X has independent increments.

  3. 3.

    For almost all ω∈Ω, the path t↦Xt⁢(ω) is continuous I→E.

We call X0*⁢P the initial distribution of the Brownian motion. When X0*⁢P=δx for some x∈E, we say that x is the starting point of the Brownian motion. We now prove that for any Borel probability measure on ℰ, in particular δx, there is a d-dimensional Brownian motion which has this as its initial distribution.44 4 Heinz Bauer, Probability Theory, p. 342, Theorem 40.3.

Theorem 3 (Brownian motion).

For any μ∈𝒫⁢(E), there is a d-dimensional Brownian motion with initial distribution μ.

Proof.

Let (PJ)J∈𝒦 be the family of measures induced by the Brownian convolution semigroup

νt=∏k=1dγ0,t,t∈I,

and let (Ω,ℱ,Pμ,(Xt)t∈I), Ω=EI and ℱ=ℰI, be the associated canonical process. Theorem 10 tells us that X has stationary increments,

(Xt-Xs)*⁢Pμ=νt-s,s≤t, (12)

and has independent increments. For τ=t-s>0, by (12) and Lemma 2,

E⁢(|Xt-Xs|4)=d⁢(d+2)⁢τ2=d⁢(d+2)⁢|t-s|2.

Because E⁢(|Xt-Xt|4)=E⁢(0)=0, we have that for any s,t∈I,

E⁢(|Xt-Xs|4)=d⁢(d+2)⁢|t-s|2.

The initial distribution of X is X0*⁢Pμ=μ. For α=4,β=1,c=d⁢(d+2), the Kolmogorov continuity theorem tells us that there is a continuous modification B of X. That is, there is a stochastic process (Bt)t∈I such that for each ω∈Ω, the path t↦Bt⁢(ω) is continuous I→E, namely, B is a continuous stochastic process, and for each t∈I,

P(Xt=Bt)=1,

namely, B is a modification of X. Because B is a modification of X, B has the same finite-dimensional distributions as X, from which it follows that B satisfies (12) and has independent increments. For A∈ℰ, because B is a modification of X,

(B0*Pμ)(A)=Pμ(B0∈A)=Pμ(X0∈A)=(X0*Pμ)(A),

thus B0*⁢Pμ=X0*⁢Pμ=μ, namely, B has initial distribution μ. Therefore, B is a Brownian motion (indeed, all the paths of B are continuous, not merely almost all of them) that has initial distribution μ, proving the claim. ∎

For μ∈𝒫⁢(E), let (Ω,ℱ,Pμ,(Bt)t∈I) be the d-dimensional Brownian motion with initial distribution μ constructed in Theorem 3; we are not merely speaking about some d-dimensional Brownian motion but about this construction, for which Ω=EI, all whose paths are continuous rather than merely almost all whose paths are continuous. For a measurable space (A,𝒜) and topological spaces X and Y, a function f:X×A→Y is called a Carathéodory function if for each x∈X, the map a↦f⁢(x,a) is measurable 𝒜→ℬY, and for each a∈A, the map x↦f⁢(x,a) is continuous X→Y. It is a fact55 5 Charalambos D. Aliprantis and Kim C. Border, Infinite Dimensional Analysis: A Hitchhiker’s Guide, third ed., p. 153, Lemma 4.51. that if X is a separable metrizable space and Y is a metrizable space, then any Carathéodory function f:X×A→Y is measurable ℬX⊗𝒜→ℬY, namely it is jointly measurable. B:I×Ω→E is a Carathéodory function. I=ℝ≥0, with the subspace topology inherited from ℝ, is a separable metrizable space, and E=ℝd is a metrizable space, and therefore the d-dimensional Brownian motion B is jointly measurable.

The Kolmogorov-Chentsov theorem says that if a stochastic process (Xt)t∈I with state space E satisfies, for α,β,c>0,

E⁢(|Xs-Xs|α)≤c⁢|t-s|1+β,s,t∈I,

and almost every path of X is continuous, then for almost every ω∈Ω, for every 0<γ<βα the map t↦Xt⁢(ω) is locally γ-Hölder continuous: for each t0∈I there is some 0<ϵt0<1 and some Ct0 such that

|Xt⁢(ω)-Xs⁢(ω)|≤Ct0⁢|t-s|γ,|s-t0|<ϵt0,|t-t0|<ϵt0.

For μ∈𝒫⁢(E), let (Ω,ℱ,Pμ,(Bt)t∈I) be the d-dimensional Brownian motion with initial distribution μ formed in Theorem 3. For s≤t, (Bt-Bs)*⁢Pμ=νt-s, and thus Lemma 2 tells us that for each n≥1 there is some Cn with which E⁢(|Bt-Bs|2⁢n)=Cn⁢(t-s)n for all s<t. Then E⁢(|Bt-Bs|2⁢n)≤Cn⁢|t-s|n for all s,t∈I. For n>1 and for αn=2⁢n and βn=n-1,

βnαn=n-12⁢n=12-12⁢n,

and for n>2, take some βn-1αn-1<γn<βnαn. Let Nn be the set of those ω∈Ω for which t↦Bt⁢(ω) is not locally γn-Hölder continuous. Then the Kolmogorov-Chentsov theorem yields Pμ⁢(Nn)=0. Let N=⋃n>2Nn, which is a Pμ-null set. For ω∈Ω∖N and for any 0<γ<12, there is some γn satisfying γ≤γn<12, and hence the map t↦Bt⁢(ω) is locally γn-Hölder continuous, which implies that this map is locally γ-Hölder continuous. We summarize what we have just said in the following theorem.

Theorem 4.

Let μ∈𝒫⁢(E) and let (Ω,ℱ,Pμ,(Bt)t∈I) be the d-dimensional Brownian motion with initial distribution μ formed in Theorem 3. For almost all ω∈Ω, for all 0<γ<12, the map t↦Bt⁢(ω) is locally γ-Hölder continuous.

4 Lévy processes

A stochastic process (Xt)t∈I with state space E is called a Lévy process66 6 See David Applebaum, Lévy Processes and Stochastic Calculus, p. 39, §1.3. if (i) X0=0 almost surely, (ii) X has stationary and independent increments, and (iii) for any a>0,

limt↓0P(|Xt|≥ϵ)=0.

Because X0=0 almost surely and X has stationary increments, (iii) yields for any t∈I,

lims→tP(|Xs-Xs|≥ϵ)=0. (13)

In any case, (13) is sufficient for (iii) to be true. Moreover, (iii) means that Xs→Xt in the topology of convergence in probability as s→t, and if Xs→Xt almost surely then Xs→Xt in the topology of convergence in probability; this is proved using Egorov’s theorem. Thus, a d-dimensioanl Brownian motion with starting point 0 is a Lévy process; we do not merely assert that the Brownian motion formed in Theorem 3 is a Lévy process. There is much that can be said generally about Lévy processes, and thus the fact that any d-dimensional Brownian motion with starting point 0 is a Lévy process lets us work in a more general setting in which some results may be more naturally proved: if we work merely with a Lévy process we know less about the process and thus have less open moves.