This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
R be a convex function. Suppose that f(il) C / . Then i f o / e L ' f f l , ^ ; ! ) and it holds (2.39) In particular, when /x(fi) — 1, i.e. when fi is a probability measure, we have
o at zero. This result is known as "weak equals strong" in semigroup theory. Our proof will be a sketch of the very polished proof of this result in K.-J. Engel and R. Nagel [97], p.40, and it covers a much more general situation. We need some preparation. Let X be a Banach space. Then it is known that the weak closure of a convex set equals its strong closure, compare W. Rudin [307], Theorem 3.12. Further, a result of M. Krein and V. Smulian states that the closed convex hull conv K of a weakly compact set K C X is weakly compact, compare N. Dunford and J.T. Schwartz [91], p.434. Finally, as it is proved in K.-J. Engel and R. Nagel [97], Proposition 1.5.3, a semigroup (Tt)t>0 on a Banach space is strongly continuous if and only if there exist S > 0 and M > 1, and a dense subset Y (£)>£ ^ ^™> a n < i m addition by i > 1 — (2n)% o is indeed a convolution semigroup of probability measures on R". Obviously we have (3.207) fc=0
for all t £ [0,8]
66
Chapter 3 Feller Processes
and limTiu = u
for all u &Y.
t|0
Theorem 3.2.18. Let (Tt)t>0 be a semigroup on a Banach space (X,\\-\\x). The strong continuity of (Tt)t>o(at 0) is equivalent to its weak continuity (at 0), i. e. the continuity of the mapping tv-Ku',
(3.64)
Ttu >
for all u G X and u>' G X*.
Proof. Of course we need only to prove that the weak continuity implies the strong continuity. By the uniform boundedness principle we may deduce from (3.64) that (T t ) t > 0 is pointwise and hence uniformly bounded on compact intervals I C M.+ . Therefore, by the remarks made preceeding the proof we need to show that Y := {ueX; is dense in (X, \\-\\x). ur : X* -> K (or C)
lim ||Tfu - u\\x = 0} For this, take u £ X and r > 0 and define ur on X* by
1 fr < w', ur > := - / < w', Tsu > ds, w' e X*. t Jo
Clearly, ur is bounded and linear, hence ur € X**. Since the set {Tsu; s G [0, r]} is the continuous image of [0, r] when taking in X the weak topology, it follows that this set is weakly compact. Now we apply the Krein-Smulian theorem stated above to deduce that conv {Tsu;s G [0,r]} is also weakly compact. Further note that ur is the limit of Riemann sums with respect to the weak-*-topology a(X**,X*) on X*. Hence it follows that ur G conv {Tsu; s € [0,r]}. Having in mind the definition of ur it is clear that Z :— {ur ; r > 0 and u G X}
3.2 Semigroups of Kernels, Transition Functions and Canonical Processes
67
is weakly dense in X. But for ur G Z we find llTttir-UrHjr 1 ft+r 1 /"r sup - / < w', Tsu > ds / < w', Tsu > ds |M| X .<1 r It r JO ( 1 ft+T 1 /"* l\ < sup - / <w' , Tsu >ds + < w' , Tsu > ds\ \\w\\x.
=
^
0<s
where \\-\\x x a s usual denotes the operator norm. The above estimate implies ||Tiu r — Urllx -^ 0 as i —» 0, hence Z CY, which yields that Y is weakly and therefore strongly dense (see again the remarks made above) and the theorem • is proved. Corollary 3.2.19. For a Feller semigroup (Tt)t>o with kernels (pt)t>o being all Markovian (3.62) holds. Finally we give a criterion for a (semigroup of) (sub-)Markovian kernel(s) in order that the corresponding (semigroup of) operator (s) maps bounded measurable functions into continuous functions. For this it is worth to recall some results for convolution operators. In Lemma 1.4.8.19 together with Lemma 1.4.8.20 it was shown that for u H-> U * \i to map J5b(K") into C&(IRn) it is necessary and sufficient that fi admits a density with respect to the Lebesgue measure A^™). Thus when longing for semigroups (Pt)t>o associated with sub-Markovian kernels (pt)t>o having the property that each pt maps Bb(E) into Cb(E) it is reasonable to assume that each pt(x,dy) has a density with respect to a fixed, i.e. t and x independent, reference measure. We will denote such a density by pt(x,y), in fact we will use the notations pt{x,dy),pt(x, (x,y) as well as p pt(x,A) if no confusion is possible. Suppose that on (E, B) a Borel measure \i is given and assume that Pt(x,dy)
=pt(x,y)ij,(dy)
and hence Pt is given by (Ptu)(x) = J
u(y)pt(x,y)fj,(dy).
68
Chapter 3 Feller Processes
Our problem is to find conditions on pt(x, y) which imply that Pt maps Bb(Mn) into Cb(M.n). Clearly, Lemma 1.2.3.22 gives an option if the constants x >-* c are integrable with respect to /z. But already in the case E = M.n,B = B^ and /J, = \(n^ this does not hold. We suppose that E is a locally compact metric space with Borel cr-field B. Further, the reference measure JJ, is assumed to be a regular Borel measure on B. In this case fi(C) < oo for every compact set C C E, and CQ{E) C Ll{E; /J.) is dense with respect to the norm ||-|| L i. Now we are in a position to prove a useful condition for a (Feller) semigroup to be a strong Feller semigroup. Lemma 3.2.20. Let E be a locally compact metric space with Borel a-field B and let \x be a regular Borel measure on B with full support. Further let (Pt)t>o be a semigroup of sub-Markovian kernels from {E,B) into itself and assume that the corresponding semigroup (Pt)t>o maps CQ(E) into Cb(E), i.e. Tt : Co(E) —> Cb(E) for each t > 0. / / in addition each kernel pt(x,dy) has a density with respect to n, i.e. Pt(x, dy) = pt(x, y)n(dy),
(3.65)
satisfying the estimate Pt{x,y)
,0
(3.66)
and if
lim
sup Pt(z,fl£(6>))=0
(3.67)
fl-+oox6Bs(x0)
holds for each fixed 5 > 0 where £o £ E is a fixed point, then the semigroup (Pt)t>o maps Bb(E) into Cb{E). Proof. The fact that TtBb{E) C Bb(E) is trivial. Fix t0 > 0 and u G Bb{E). We want to prove that for each XQ £ E the function
zi-> (Ttou)(x) := / u{y)pto(x,y)fi{dy) is continuous at XQ. For e > 0 and 5 > 0 choose R > 0 such that sup p t o (x, BCR(£O)) < 4 x€B6(x0) lMlco
3.2 Semigroups of Kernels, Transition Functions and Canonical Processes
69
and take R > 0 such that Bc~(x0) C B%(£0). Next define
U£(y) := XBaMivMy). It follows that \Ttau(x)-Ttou(x)\ = I u{y)Pto{x,y)iJ,(dy) - I u{y)pto{x0,y)fj,(dy) ^ / uii(y)Pto(x,y)n(dy) - / + IMIoo(Pto(z,-B|(zo))
u^(y)pto(xo,y)n(dy)
+pto(x0,Bc~(x0)).
For a; G Bs(x0) it follows by (3.67) that \Hoo(Pto(x,Bc~(x0))+Pt0(xo,Bcn(x0)) h\L(Pto(x,BcR(Z0))+pto(xo,BcR(Z0)))
<
Next we prove that x^
I
un(y)pt(x,y)n(dy)
is continuous. Since uR 6 L^EjS,//) and CQ{E) is dense in Ll{E,B,ii) we may approximate uR by a sequence (
IJ
^
- /
\uR.(y) -
< cto I \ujiiy) -
70
Chapter 3 Feller Processes
i.e. x H-> /
uR{y)pto(x,y)ii(dy)
is the uniform limit of continuous functions and therefore continuous. Thus, if s > 0 is given, we may find 6 > 0 such that / u^{y)ptQ(x,y)n{dy)
- I uR(y)pto(xo,y)lJ.(dy)
< |
for all x € B$(xo) implying the lemma.
•
Remark 3.2.21. A. We adapted the proof of Lemma 3.2.20 from the proof of a similar result of W. Hoh [155], Theorem 8.9, and we will come more closer to his results later on. B. The condition (3.66) should be seen in the light of the considerations in Section II.3.6, especially formula (II.3.436). Thus in many situations we are interested if condition (3.66) is fulfilled. Let us explore the meaning of (3.62) for the corresponding canonical process ((Xt)t>o, Px)xeEProm the construction it is clear that (3.68)
PZt(dy)=Pt(x,dy)
and therefore if ((Xt)t>0, Px) E is related to a Feller semigroup (Xt)t>o by then for all u e C^E) Tt = Pt\Cx{E), \Pt+,u[x) - Ptu(x)\ = \Pt(Psu(x)
- u(x))\ -» 0 as s -* 0,
i.e. P £ t ^ —> Pxt vaguely (and when all pt(x,A) weakly) as s —> 0. But we are longing for more, namely for \imPx{\Xt+s-Xt\>£}
s—0
are Markovian kernels even
= 0,
(3.69)
that is the stochastic continuity of the process. For t = 0we have indeed Px{\Xt - x\ > e] =
{TsXBHx))(x)=Ps{x,Bce(x))
and (3.62) implies (3.69). In order to prove the general case we need a deeper understanding of the process ({Xt)t>o,Px)xeE-
3.3 A First Encounter with Sample Paths and Cadlag-Functions
71
The stochastic continuity of the process will play a major role when studying path properties, i.e. (3.69) is not just a further nice property, it will become critical. In preparing further continuity results for processes we supply an additional result for Feller semigroups, compare for example K. L. Chung [75], p.49. Lemma 3.2.22. Let (Tt)t>o be a Feller semigroup on C0O(E), where E is a locally compact metric space. Then the mapping (x, t, u) H-> Ttu(x) is continuous from E xR+ x C^E) into R. Proof. Let t £ K+, s > 0, x, y € E and tt,v£ C^E). It follows that \Tt+su(x) - Ttv{y)\ < \Tt+su(x) - Tt+Su(v)\ + \Tt+su(y) - Ttu(y)\ + \Ttu(y) - Ttv(y)\. Now, for x —> y it follows that Tt+Su(x) —> Tt+Su(y). Further, since Tt+tu{v) - Ttu(y) = Tt(Tsu{y) - u{y)) and \\Tt\\ < oo we conclude that Tt+Su(y) —* Ttu(y) as s —» 0. Finally, observe \Ttu(y)-Ttv(y)\<\\Tt\\\\u-v\\oo implying that Ttu(y) —* Ttv(y) as u —> v in Coo(E). The standard modification • for the case s < 0 but £ + s > 0 yields now the lemma.
3.3
A First Encounter with Sample Paths and Cadlag-Functions
Let (Q,A,P, (Xt)t>o) be a stochastic process with Polish state space (E,B). For each u> 6 Q, we can consider the mapping X.(u) : M+ -> £ t«Xt(u)
(3.70)
which is called a path or sample path of the process. If (fi, A, P, (Xt)t>o) is the canonical process associated with a semigroup of Markovian kernels and D, = i?!0-00) and Xt(w) = w(£), then P is a probability measure on the space of all mappings from [0, oo) to E and every such a mapping is a path of the canonical process, i.e. P is a probability measure on the
72
Chapter 3 Feller Processes
space of all sample paths! However, the examples of stochastic processes arising in modelling suggest that the paths of a given interesting process are typically more specific: Brownian motion should have at least continuous paths, the paths of a Poisson process should be piecewise constant with positive jumps, etc Thus we should expect that P is concentrated on a certain subset of _g[o,oo) determined by the process. In fact, we shall aim to find a subset of fit0-00) such that the typical path of (X t ) t > 0 belongs P—almost surely to this subset. In a next step we even might be interested to substitute Cl = E^0'00^ for given process by the set of all typical paths. However the finite dimensional distributions of a given process should not change after such a substitution. This leads us to some important definitions. Definition 3.3.1. A. Let (il, A, P, (Xt)t>0) and (Q',A',P', (Xt')t>o) be two stochastic processes with the same state space (E, B) and the same family of finite dimensional distributions. Then we call (Xt)t>o a version of (X't)t>oB. Suppose that (Q, A, P, (Xt)t>o) and (ft, A, P, (lt)t>o) a r e two stochastic processes with state space (E,B). If for all t > 0 P(Xt = Yt) = l
(3.71)
holds the we call (Xt)t>o a modification of (Yt)t>oC. Two processes (Cl, A, P, (Xt)t>o) and (ft, A, P, (Yt)t>o) with state space (E, B) are called indistinguishable if there is a P-null-set N C fi such that Xt(u>) = Yt(u>) holds for all ui e Nc and all t > 0. If (Xt)t>o is a stochastic process with Polish state space (E, B) then we may ask whether a path of (Xt)t>o has certain regularity properties, i.e. t —> Xt(uj) could be continuous, or right continuous, have left limits, be of bounded variation etc. Of course we are interested in the case where almost all paths of a given process have such a property. Definition 3.3.2. Let (Xt)t>o be a stochastic process with Polish space as state space. A. The process (X t )t>o is called (almost surely) continuous if its paths are (almost surely) continuous. B. The process (Xt)t>o is called (almost surely) right continuous if (almost surely) its paths are right continuous. C. We call (Xt)t>o a cadlag process if almost surely all paths of (Xt)t>o are continuous from the right and have limits from the left. As a first result let us prove
3.3 A First Encounter with Sample Paths and Cadlag-Functions
73
Theorem 3.3.3. Let (ft, A, P, (Xt)t>o) and (ft, A, P, (Yt)t>0) be modifications of each other and suppose that they are both almost surely right continuous. Then they are indistinguishable. Proof. Let jVx be a null set such that on N^ the paths of (Xt)t>o are right continuous and let Ny be a null set such that on NY the paths of (Yt)t>0 are right continuous. Put Nt := {u> £ ft; Xt(u) ^ Yt(uj)} and set N = UteQ+ ^*By assumption N is a null-set and so is M := Nx U Ny U N. Thus it holds Xt{w) = Yt{w) for all t G Q+ and w G Mc. For t G [0, oo) n Q c take a sequence (*n)n£N, tn G Q+, such that tn [ t. Since for w G Mc we have Xtn{ui) = Ytri(cu) for all n G N the right continuity yields Xt{w) = lim Xtn(w) = lim Ytn(w) n—KX>
n—»oo
=Yt(u)
for these u> and the theorem is proved.
•
It will turn out that all the processes we are interested in are cadlag processes. Therefore we need to investigate the space of all cadlag functions in detail. For our purposes it is sufficient to restrict ourselves to the case E = K n . We start with Definition 3.3.4. A function u : [0, oo) —> Mn is called a cadlag function if for all to G [0, oo) the function is continuous from the right and has for all to G (0, oo) left limits. The space of all cadlag functions is denoted by D n ([0,oo)). Lemma 3.3.5. Let u : [0, oo) —> W1 be a function for which
u(t+) := limu(s),t > 0, and u(t—) := limu(s),i > 0, sit
sTt
exist. Then there exists a countable set T C (0, oo) such that for all t G F c it holds u(t-) = u(t) = u(t+). Further, for each finite T > 0 the set F n D [0, T] is finite where
Tn := {t G (0, oo); maxflu(t-) - u{t)\, \u{t-) - u{t+)\, \u{t) - u(t+)\) > i } . Proof. Since F = \Jn&n Tn it is sufficient to prove that F n D [0, T] is for each T > 0 finite. Suppose that F n n [0,T] has a limit point t. Then either u(t+) or u(t—) would not exist implying the finiteness of F n n [0, T]. O
74
Chapter 3 Feller Processes
Lemma 3.3.6. Let I C [0, oo) be a dense set and u : I —» Mn be a function. Suppose that for each t > 0 (3.72)
v(t) :=limu(t) sit s€/
exists. Then v is on [0, oo) continuous from the right. If for each t > 0
v~(t) :=limu(s)
(3.73)
sit s€l
exists then v~ is continuous from the left on (0, oo). If for all t > 0 both v and v~ exist then it holds v~(t) = v(t—). Proof. Suppose that (3.72) exists for all t > 0. Fix to > 0 and given e > 0 then there exists 6 > 0 such that
\v(t0) - u(r)\ <e for all r Gill (t0, t0 + S) and therefore \v(t0) - v(s)\ = lim \v(t0) - u(r)\ < e r[s rel
for all s G (to, t0+ 5) and the right continuity of v is proved. The left continuity of v~ is proved analogously. To see the last statement, recall that \v~(to) — v(to—)\ = |limu(s) - lim (limu(r))| r€/
sel
= | lim u(s) - lim(limu(r))| sfto sel
sTto rls sei rei
=0 since for s £ I we have u(s) — limu(r).
•
rei
Definition 3.3.7. A. A function u : [0,oo) —> M" is said to have a jump discontinuity at t 0 £ [0, oo) if u(t—) and u(t+) exist and u(t+) ^ u ( i - ) . B. We say that u : [0, oo) —> R" has no discontinuity of second kind in [Ti, T2] C [0,00) if for all t € [Ti,T 2 ] the function u has right limits and for all t £ ( T i , ^ ] its
3.3 A First Encounter with Sample Paths and Cadlag-Functions
75
left limits exist. C. The function u : [0, oo) —> M™ is said to have at least m G NU {oo} e-oscillations, e > 0, in [Ti,T2\ C [0,oo) if there are points
Ti
< ...
such that
|u(t f c _i)-«(t f c )|>e
(3.74)
holds for k — 1,... , m. Lemma 3.3.8. A function u : [0, oo) —> R has no discontinuities of second kind in [Ti,T2] C [0,oo) if and only if for every e > 0 the number of its e-oscillations is finite on [T\,T2\Proof. Suppose first that the number of e-oscillations in [7\, T2] is infinite for some e > 0. Then there exists to 6 P i , T2] and a sequence ( i ^ e N j tv G p i , T2], > e. This implies such that either tv j. to or tv j to and \u{tv — u(tv-i)\ that either u(t0—) or u(to+) will not exist. Conversely, suppose without loss of generality that u(to-),to € (Ti,!^] does not exist. Then there exists a sequence (tv)u&i,tv ] to,tu G [Ti,T2] such that sup |u(tM) — u(tv)\ > e implying that there are infinitely many e-oscillations.
•
Corollary 3.3.9. Let u € Dn([0,00]). Then on every compact interval I C [0,00) the function is bounded, i.e. \u(t)\ < M for all t S / , and u has at most finitely many jump discontinuities with jumps larger than e > 0. In particular u has at most countable many jump discontinuities of size larger than e > 0 on [0,oo). From now on we denote typical elements of D n ([0,oo)) by u> since later on D n ([0,00)) will become the probability space we consider the stochastic processes on we are going to construct. On J9 n ([0,oo)) we need a topology. The cr-field generated by this topology should make all projections Xt : Ai([0,00)) —> W1 , w —> Xt(u>) — u>(t) measurable, but in addition it should be a separable (preferable metric) topology since measure theoretical considerations require to involve only countable many operations. Such a topology was introduced by A. V. Skorohod [334], see also [335]. Let us try to understand what we should require from such a topology. First of all, limits of cadlag functions should be cadlag functions. Thus locally (at least) the convergence should be of uniform type. However, even intuitively,
76
Chapter 3 Feller Processes
the sup-norm will not satisfy our requirements. For this consider the following example. Let u := X[o,2)c £ -Di ([0, oo)) and have a look at the two sequences Uv = X[o,2+i)c a n ( i ^i2' = X[o,2-i)c e ^i([0,oo)). For large v both, Jp and wl should be seen to be "near" to w. But clearly for all v we have sup \cj(t) - 4^(t)\ = sup \w(t)-tjW(t)\ = l. te[l,3]
t€[l,3]
But if we run u>l and wj, with different velocities than w, i.e. if we consider t ^ uP (riP(t)) and t >-> wi 2 ) (^ 2 ) (t)) where ^ ( i ) = ^ t and ffc (t) = gyHi^i respectively, then we have in fact o> = u>£, o ?^,' = w j oi/i and as f —> oo we find that rj\}'(t) —> £ as well as r]l2'(t) —»t. Of course, when w has several jump discontinuities or wi,^ is a more general cadlag function we can not find a time change as above. But the example shows us a way how to construct an appropriate metric: For wi,o»2 S -Dn([0,oo)) consider locally the s u p - n o r m of \u>i(t) — w2{r]{t))\ where \r](t) — t\ is small. (Since elements of D n ([0,oo)) are in general unbounded, it should be in addition helpful to make the metric finite by taking a sup with 1 — but this is technical only.) A Skorohod metric on Dn(j0,oo)) is constructed along this line by following the presentation St. Ethier and Th. Kurtz [98]. We say that r) : [0, oo) -> [0,oo) belongs to the class L if rj is a strictly increasing surjective Lipschitz continuous function such that
|M|L:= sup l o g ^ - f 0 s>t>0
(3.75)
S—t
holds. Since r\ is a Lipschitz function rj'(t) exists almost everywhere, hence ||rj|| L is indeed finite. In addition for // e L it follows that 77(0) = 0, lim r](t) = 00 t->o and ||T7||L = H??"1!^- For wi,w 2 £ £>n([0,00)) and rj e L we set g(u!i,iO2,ri,u)
: = s u p | w i ( £ A w ) — u2(r)(t) Au)\ A l , i t > 0,
(3.76)
t>o and define
(
(
f°°
\\
dD(cJi,uj2) := inf max | M | L , / e u£»(u;i,ct;2,?7,u)du . (3.77) r)GL V V Jo )} In order to prove that do is a metric we need some preparations. For two sequences (u;^)i/eN and (w£2)),,eN in Dn([0,00)) it holds lim <1D{UV ,Uv ) = 0 V—>OO
3.3 A First Encounter with Sample Paths and Cadlag-Functions
77
if and only if there exists a sequence (rju)U£N, "HV € L, such that lim \\rjv \\L = 0, and for all e > 0 and uo > 0
V—>OO
lim A ( 1 ' { n e [ 0 , « ( ) ] ; J ( 4 1 ) 1 u ( 3 » ^ , U ) > 6 } = 0
(3.78)
holds which follows just from (3.76) and (3.77). In addition, since for rj e L esssupi > O\r/(t) - 1| < 1 - e^"*- < \\r)\\L,
(3.79)
we deduce from lim | M | L = 0
(3.80)
V—>OO
that for all T > 0 lim sup \qv{t)-t\
i/-»ooO
=0.
(3.81)
Now we may prove Lemma 3.3.10. By dp a metric, called the Skorohod metric, is given on Dn([0,oo)). Proof. For wi,o;2 £ ^ ( [ 0 , oo)) it follows that for all rj € L and u > 0 sup |u;i(£ A M ) - u>2 (??(£) A u)\ A 1 t>o = sup|u;i(77~1(t) A M ) - W 2 (^ A u)| A 1, t>o i.e. Q{uj\,uj2,r],u) = ^ ( w i , ^ , ^ 1 , ? * ) which together with \\r)\\L — \\f]~1\iiL implies that dD{w\,wi) = di?(w2,wi). Next suppose that 2- Thus we have proved that dD(wi,ui2) = 0 implies u>i = u>2, clearly u>\ = 0J2 implies that do{^1,1^2) = 0. Finally we prove the triangle inequality for do- For this let Wi,a>2,
78
Chapter 3 Feller Processes
u > 0. It follows that sup|wi(t Au) - wz{r)2{m{t)) A 1 ")| A l t>o < sup \u>i(t A u) — a>2(?7i(£) A M)| A 1 t>o + sup IW2 (»7i (*) A u) - w 3 (% (m (*)) A u) I A 1 t>o
v
C3 8 2 ) •
;
= sup \w\(t AM) - W2(»7i(t) AM)| A 1 t>o + sup |a>2(i A u ) - w3(r?2(i) A M)| A 1, t>o i.e. e(wi,w3,772O77i,M) < e(wi,u;2,»7i. u ) + e(w2,W3,»72,")-
However % ° ^?i € i and
U^oTnll^lML + hilL
(3.83)
and we obtain dp(^1,^3) < dr>(wi, W2) + d(tJ2-u>3) proving the lemma.
D
Definition 3.3.11. The topology induced on 2?n([0,00)) by do is called the Skorohod topology and (D n ([0,00)),dp) is called the Skorohod space. Theorem 3.3.12. The Skorohod space (Z)n([0, 00), dp) is a complete separable metric space and its topology is weaker than the locally uniform topology. Moreover the projections Xt : Dn(j0,00)) —> K " , u >-> X t (w) = w(i) are measurable with respect to the Borel a-field A — Aon on D n ([0,oo)).
This theorem as important as it is for our purposes has a rather lengthy, technical proof which is for example provided in St. Ethier and Th. Kurtz [98], Chapter 3, but this proof gives almost no new insights. Therefore we omit the proof and refer to [98]. In [206] J. Jacod and A. Shiryaev discussed in a long Chapter, Chapter VI, the Skorohod topology (with a slightly different but equivalent definition of do) and provided all proofs. After stating the main theorem they made the following comments: "... we strongly advise the reader to skip the proof, which sheds very little light on the significance of this topology." However, we want to provide two criterions for convergence in £>n([0,00)) once again taken from [98].
3.3 A First Encounter with Sample Paths and Cadlag-Functions Proposition 3.3.13. Let ( W ^ ) ^ M LJ G -Dn([0, oo)). Equivalent to
79
be a sequence in J9 n ([0,oo)) and
lim dD{ujv,w) = 0
(3.84)
I/—>OO
is t/ie existence of a sequence (fji/Ji/gm,^ € L, such that lim ||r?v||L = 0 and lim p{ujv,uj,r)v,u) = 0 /or aH u G Cu,
(3.85)
where Cu denotes the points of continuity of UJ . Proof. The sufficiency of (3.85) for (3.84) to hold is a consequence of Corollary 3.3.9. Now suppose that (3.84) holds and let u G Cu. Prom (3.78) we deduce that there is a sequence (77,,),,6N,??I/ G L, and (u^gp^Uj, £ (u, oo) such that lim H^ll^ = 0 and V—>OO
lim sup \wv(t A Uv) - oj(rjv(t) A u)\ A 1 = 0.
v—»oo t > 0
(3.86)
Observe that sup \jJv(f A u) — oj(r\v(f) A u)\ A 1 t>o < sup \wv{t A u) — cj(r]v(t A u) A uv)\ A 1 t>o + sup \u)(r)v(t A u) A uu) - u{r]u{t) A u)| A 1 t>o
< sup \wv{t Auv) — u(r]u(t) Auv)\ A 1 0
(3.87)
M<S<77^(«)Vli
V(
sup
|w(t/v(u)-«,,)-w(s)|M)
for each i^ e N. Note that the second term in the last estimate is obtained by considering the two cases t < u and t > u separately. But now (3.86) and = 0. • (3.81) and the continuity of w at u yield lim p^v,^,^^) v—too
Proposition 3.3.14. Let (iv,,),,^ be a sequence in Dn(j0,oo)) UJ G .D n ([0,oo)). Then {uJu)uen converges to UJ, i.e. lim dD{uv,u) V —»OO
= 0,
and (3.88)
80
Chapter 3 Feller Processes
if and only if there is a sequence (r)v)veH, r\v G L, such that lim ||7?^||L = 0 and lim sup \uv{t) - u(r]u(t))\ = 0.
v—»oo
(3.89)
u—>ooO
Proof. If (3.88) holds then there exists a sequence (rfv)v^,r]v £ £, and a sequence (uv)V£n, "»- G (0, oo) such that lim \\r}v 11^ = 0 and p(uju, u), r}u, uv) —> 0 K—>0O
as v —> oo. In particular it follows that
lim sup \u}v{t A uv) — uj{r}u{t) A uv)\ = 0.
(3.90)
V—>CXD t > 0
Given T > 0, we find for v sufficiently large that uv > TVrjv{T) and therefore (3.90) implies the second statement of (3.89). Conversely, if (3.89) holds then by (3.87) for every point u € Cu it follows that lim sup \uv{t A M ) - u}(Vv(t) A u)\ A 1 = 0
v—>oo t > 0
for u,, > ??y(w) Vu,i/eN, which implies (3.88).
(3.91)
•
Remark 3.3.15. Note that (3.90) tells that at points of continuity of LJ the sequences converging to u> in Dn(j0, oo)) converge also pointwise. It is not difficult to see that the results we proved for cadlag functions CJ : [0, oo) —> W1 will hold when W1 is substituted by a suitable metric space E, compare [98]. In particular we may take the one-point-compactification R^ ofM". When discussing in Chapter 4 the martingale problem for pseudo-differential operators with negative definite symbols we have to continue our discussion of (.Dn([0,oo)),dp)- Especially we will examine compact subsets and weak convergence of measures on Aon the Borel cr-field generated by P n ([0, oo)). But before, we want to show that the paths of the canonical process associated with a Feller semigroup are almost surely cadlag paths. For this we need a deeper understanding of these processes, especially we have to discuss the Markov property.
3.4
Markov Processes and Feller Processes
We want to study how the semigroup property of a semigroup of (sub-) Markovian kernels is reflected in properties of the corresponding canonical
3.4 Markov Processes and Feller Processes
81
process. For the following however we do not need to work with a canonical process, thus we start with a stochastic process (Xt)t>o on a probability space (SI, A, P) with an arbitrary (sometimes Polish) state space (E, B). In addition we assume that a filtration (Tt)t>o in A is given and that (Xt)t>o is adapted. Definition 3.4.1. Let (Xt)t>o be a stochastic process on (Cl,A, P) with state space (E,B) and suppose that [Xt)t>o is adapted to the filtration (Tt)t>o- We call (Xt)t>o a Markov process with respect to (J~t)t>o if P(Xt e B\Ta) = P(Xt e B\Xa) P-a.s.
(3.92)
for all 0 < s < t and all B e B . Remark 3.4.2. A. Property (3.92) is often called the elementary Markov property. B. Obviously (3.92) is equivalent to E(X{Xt{»)£B}\fs) = E(x{Xt(.U)€B}W(Xl)) [= E(x{xtlu)eB}\Xt)}.
(3.93)
{
To proceed further we need Lemma 3.4.3. Let {Xt)t>o be a stochastic process as in Definition 3.4.1. Then (Xt)t>o is a Markov process with respect to the canonical filtration i^rt)t>o if and only if for every B e B and any finite choice of numbers 0 < s\ < ... < sn < t we have P(Xt e B\a(XSl,.. .,XSn)) = P(Xt e B\XSn).
(3.94)
Proof. Suppose that (Xt)t>0 has the elementary Markov property with respect to (J^)t>o. For B e B and 0 < si < ... < sn < t we find P(Xt e B\F°Sn) = P(Xt e B\XSn) P-a.s. or with A := {u> € H; Xt{u) e B} we have E(XA\^n)
= E(XA\XSJ
P-z.s.
Further it follows that E{E(XA\^n)\o-(XSl,...,XsJ)
=
E{E(XA\XSn)\a(XSl,...,Xan)) (3.95)
82
Chapter 3 Feller Processes
and using the properties of conditional expectations we arrive at E(E(XA\^n)HXSl,..
.,XaJ)
= E(XA\
,...,
XaJ)
as well as E(E(XA\X.J\*(XSI,...,X.J)=E(XA\X.J
which yields P(Xt G
B\
. .,X.J)
= P(Xt G B\XSn),
(3.96)
i.e. (3.94). Conversely suppose that (3.94) holds. We have to prove that P(Xt G B\T°S) = P(Xt G B\X.) P-a.s. for all B G B and 0 < s < t. This is equivalent to show that a version Y of P(Xt G B\XS) is also a version of P(Xt G B\T°S). Clearly F is cr(Xs) measurable, hence ^ - m e a s u r a b l e and therefore we have to prove that / YAP = P({Xt EB}DQ)
(3.97)
JQ
holds for all Q G J*. Prom (3.94) it follows that (3.97) holds for all Q G cr{XSl,..., XSn) with any choice of (finitely many) 0 < s\ < ... < sn. The family £ of all these sets forms a D-stable generator of J7® and fi G £. We may interpret (3.97) as an equality of finite measures on A which on £ coincide, i.e. they have to coincide on cr(£) = J7® which proves the second part • of the lemma. Now we can prove that canonical processes have the elementary Markov property. be a stochastic process with Polish Theorem 3.4.4. Let (Q,A,P^,(Xt)t>o) state space (E, B) and finite dimensional distributions deriving from a normal semigroup of Markovian kernels {pt(','))t>0 o,nd initial distribution /i. Then (Xt)t>o is a Markov process with respect to the canonical filtration {^)t>oIn addition for B G B and 0 < s < t P(Xt G B\7?) = Pt-s{Xs,B) holds where pt~s(Xs,B) LJ^Pt_s(Xs(uj),B).
P-a.s.
(3.98)
is the random variable (3.99)
3.4 Markov Processes and Feller Processes
83
Proof. Clearly, pt-a(Xa,B) is always cr(Xs )-measurable, hence it is J^-measurable. Therefore it remains to prove that for all Q e f s ° / pt-s(XsH,B)dP = P({Xt sB}nQ)
(3.100)
JQ
holds. As in Lemma 3.4.3 it is sufficient to prove (3.100) for the fl-stable generator consisting of all Q € a(XSl,... ,XSn),0 < s\ < ... < sn < s. In addition, by Lemma 3.4.3, we only have to prove P{Xt
€ B\a(XSl,...,XSn))=
Pt.Sn(XSn,B)
P-a.s.
(3.101)
for 0 < S\ < ... < sn < t, s = sn. Once (3.101) is proved we arrive at P{Xt€B\X,n)=pt-,JX.n,B) and further for 0 < s < t P(Xt£B\J*)=pt_s(Xs,B), i.e. the elementary Markov property. Since the random variable Y := Pt-sn (XSn, B) is cr(XSl,..., XSn)-measurable we have to show / YdP - P({Xt £B}DQ)
(3.102)
JQ
for Q £ a(XSl,... ,XSn). Without loss of generality we may take Q = {XSl G J3i} n . . . n {XSn e Bn} where Bj G B since these sets form a Pi-stable generator of cr(XSl,..., XSn). Now we find
I YdP = J{XQY)dP = J
XB^XI)
= J{XB, oXSl)--•••
(XBn o XSn)YdP
XBn(xn)pt-3n{xn,B)Pj{dx),
where J = {s\,..., sn} and dx = d ( x l 5 . . . , xn). Here Pj is the joint distribution of the random variables XSl,..., XSn. Now we use the fact that the finite dimensional distributions of the process originate from a Markovian semigroup
84
Chapter 3 Feller Processes
of kernels, i.e. we find /
YdP
JQ
= / • • • / XBI (ZI) ••• Xs n (x n )p t - Sri {xn,B)pSn-Sn^1
(z n _i, dxn)
•••Psi(xo,dxi)n(dxo) = 11 J JBX =PH{BI
••• I
pt-Srl{xn,B)---pSl(xQ,dxi)n(dx0)
JBn x...xB
n
xB),
where H = { s j , . . . ,sn,t} and P# denotes the joint distribution of XS1,..., XSn, Xt. But the special structure of Q yields finally PH{BX x...xBnxB)
= P{XSl G B i , . . . , X , B = P({xt
€Bn,XteB)
eB}nQ)
proving the theorem.
D Corollary 3.4.5. Every canonical process constructed by starting with a Feller semigroup (T t ) t > 0 on Coo(Mn) and a given initial distribution fi e Mi(M.n) is a Markov process with respect to the canonical filtration. Proof. If all operators Tt are conservative, i.e. Til = 1, then nothing is to prove since the associated family of kernels are Markovian kernels. In the sub-Markovian case we first have to consider the canonical process with state space (R^, /?£) and then recall the definition of the extension of Tt to Sfc(R^), • compare Section 1.4.8. The next step is to consider instead of one (canonical) process associated with a semigroup of Markovian kernels and an initial distribution p. the family of all processes (Q,A,PX, (Xt)t>o)xeE, Px = PEx, compare (3.59). Lemma 3.4.6. Let (Cl,A, Px, (Xt)t>o) xeE be the family of canonical processes an ^ associated with the normal Markovian semigroup of kernels (pt(-,m))t>0 initial distributions £x,x G E, where (E,B) is the Polish state space. Then a Markov kernel from (E, B) to (fl, A) is given by (x,A)>-+ PX(A).
(3.103)
3.4 Markov Processes and Feller Processes
85
Proof. By construction A H-> PX(A) is for each x £ E a probability measure on fi. On the other hand, for 0 < ty < ... < tn and B\.... Bn G B we have P I (I tl eB 1 ,...,\eB n ) = / • • • / Ptn-tn-1{Xn-l,fan)---PtAx,&x) JB!
JBn
P
= ti ((• • " Ptn-1-tn^2{Ptn-tn^1XBn)XBn_1)
• • • XB1){x),
proving the measurability of x >—> Px(Xt1 £ B,..., Xtn £ Bn) which however is sufficient to get the measurability of x H-> PX(A) for all A 6 A by the construction of A. • Note that the kernel (x, A) — i > PX{A) allows us to define an operator on x Bb(n) b y F M fY(w)P (duj). Let us return to the family (fl,A, Px, (Xt)t>o)x€E of canonical processes. We have x Pt(x,B)=P (XteB)
(3.104)
and therefore by Theorem 3.4.4 Px(Xs+t € B\J*) = pt(X.,B) Px-a.s. for s,t > 0,x e E and B € B. If we denote by PX"(A), variable
(3.105) A £ A, the random
OJ^PX'^\A),
note Xa{w) e E, by (3.104) and (3.105) we arrive at Px(Xa+teB\J*)=Px-{XteB)
Px-a.s.
(3.106)
and in addition PX(XO = x) = l.
(3.107)
For the following general definitions we make us free from the assumption of dealing with canonical processes. Definition 3.4.7. Let (E,B) be a measurable space. We call a universal Markov process with state space (E,B) if (Sl,A,Px, (Xt)t>o)xeE the following conditions hold:
86
Chapter 3 Feller Processes i) (£l,A,Px,(Xt)t>o) space (E,B);
is for each x € E a stochastic process with state
ii) for every A £ A the function x i-> PX(A) is S-measurable; iii) PX(XO = x) = l for all x G E; iv) for all s, t > 0, x G £ and B G B it holds P x ( X s + t G B | ^ J ) = Px°(Xt
e S ) P x -a.s.
(3.108)
The last property, i.e. (3.108) is called the universal Markov property with respect to the canonical filtration. Remark 3.4.8. A. It is clear that if (p., A, Px, (Xt)t>o)xeE is a universal x Markov process then for each x € E the process (Q, A, P , (Xt)t>o) ls a Markov process with respect to the canonical filtration {J~t)t>o, i-e. Px(Xt G B\J*) = Px(Xt G B\Xt) Px-a.s. for t > s. Indeed we have Px'(Xt
G B) = Px(Xs+t
and since PXs(Xt Px'{Xt
G B\T°S) = £ * ( X B o X s + t | J ^ ) P ' - a . s ,
G -B) is
EB)= Ex(Px'(Xt x
E {E (XBoXs+t\^)\Xs)
= = =
G B)\XS) x
x
E (XBoXs+t\Xs) x
P (Xs+t<EB\Xs)
implying Px{Xs+t
G B\J*) = Px(Xs+t
G B|X,).
B. Of course we may replace in Definition 3.4.7 the canonical nitration {J^)t>o by any filtration {Ft)t>o provided J^ C Tt, i.e. (Xt)t>o is adapted to (.F)t>oIn this case we write {Xt,ft)t>o, or (il,A,Px, (Xt)t>o, (^t)t>o) x€E Summing up, we have proved
3.4 Markov Processes and Feller Processes
87
Theorem 3.4.9. Let (pt)t>o be a normal semigroup of Markovian kernels on a Polish state space (E,B). Then there exists a universal Markov process (Q,,A,PX, (Xt)t>o)xeE with state space (E,B) such that for all t > 0,x G E and B e B we have Pt(x,B)
= Px(XteB).
(3.109)
Note that (3.109) is equivalent to (PtXB)(x)=Ex(XB°Xt) and by the standard procedure we arrive at (Ptu)(x)=E*(uoXt)
(3.110)
for all u £ Bb(E). Corollary 3.4.10. Let {Tt)t>o be a conservative Feller semigroup on Coo(Kn). Then the family of canonical processes (il, A, Px, (Xt)t>o)xeWLn form a universal Markov process. For a general Feller semigroup a universal Markov process is obtained by (Q,A,Px,(Xt)t>o)xem.^In case of Corollary 3.4.10 it follows from (3.110) for u G Coo(M") (Ttu)(x) = Ex{uoXt).
(3.111)
Thus we have a simple, natural relation between a Feller semigroup and its associated universal Markov process. Remark 3.4.11. It is possible to prove that every universal Markov process originates from a Markovian semigroup of kernels, compare H. Bauer [30], §42. But this part of the general theory is of little interest for us and therefore we omit any further discussion. Our next more ambitious aim is to construct cadlag modifications of certain canonical processes. This requires some preparations which are partly also needed in different context. Let (E, B) be a measurable space and T C B a sub-cr-field. By B(E, T) we denote the space of all J--measurable functions on E, but as before we write B(E) for B(E,B). The proof of the following lemma is partly taken from K. L. Chung [75].
88
Chapter 3 Feller Processes
Lemma 3.4.12. Let (Q,A,Px,{Xt)t>o,(Tt)t>o)xSE be a universal Markov process with locally compact Polish state space (E,B). The Markov property Px(Xs+t
E B\FS) = Px°{Xt G B) Px-a.s.
(3.112)
is equivalent to each of the following conditions: E»{Y\Tt) = E"(Y\Xt)
for allY G Bb(E,a(Xs,s
e [t,oo)));
for all u G Bb(E) and s > t;
E»(u(Xs)\ft)
= E»(u{Xs)\Xt)
E^{u{Xs)\Tt)
= E"(u(JC s )|X t ) /or oil u e C o (£) ond s > t.
(3.113) (3.114)
and (3.115)
ifere E^ denotes the expectation with respect to P^jfi being any initial distribution. Proof. Since for every u S Bb(E),u > 0, there is a sequence (•uJ/),,eN, uv G Co(E) and u,, > 0, which increases pointwise to u, i.e. uu \ u as u —> oo, (3.114) follows from (3.115) first for u > 0 by monotone convergence, and for general u by considering the decomposition u = u+ — u~. Next we will prove that (3.114) implies (3.113). Let Y:=Ul(XSl)---Ul/(XsJ
(3.116)
where t < Si < . . . < sv and Uj G Bb(E), 1 < j < v. For v = 1 the statement (3.113) is just (3.114). Now suppose that (3.114) implies (3.113) if Y is of form (3.116) for some v - 1. It follows for v G N that
E»(j[Uj(XSi)\Ft)
.3 = 1
J=l
Now,
^K(X S J|^_J = ^K(x s j|x ai/ _j = 5 ( ^ - J
3.4 Markov Processes and Feller Processes
89
for some g e Bb(E), compare Definition 2.5.12, and we may consider instead of uv-\ the function (u^_i • g)(X3v_1). The induction hypothesis implies now
-2
=E"(j[ui(Xtj){uv-l-9){Xtv_1)\Ft) 1/-2
=^(II
^AX.i){uv.x-g){Xtv_1)\Xt)
=^(^(f[ Uj (X s ,)|^ s _ 1 )|X t ) =E'i(j[uj(XSj)\Xt). J=I
Thus we have proved that (3.114) implies (3.113) for all Y of type (3.116), v e N. Now taking Uj = XB, we conclude by using a monotone class argument that (3.113) holds for all XA,A e a(Xs,s G [*,oo)). From this we deduce first by using monotone approximation that (3.113) holds for all e [t, oo)) and then by decomposing u = u+ - u~ it u > 0, u e B(E,a(Xs,s follows that (3.114) implies (3.113). Thus the equivalence of (3.113), (3.114) and (3.115) is established. Now taking in (3.114) the characteristic function XB ,B £ B, we arrive at the elementary Markov property P»(Xa
e B\Ft)
= P"{XS
g B\Xt)
,t<s,
for every inital distribution \i which in our case implies (3.112) by Theorem 3.4.4 and its consequences.
•
Definition 3.4.13. Let ((Xt)t>0, Px, (^Ft)t>o)xeE be a universal Markov process with corresponding semigroup of operators (Pt)t>o- Further let u : E —> M. be a measurable function, u > 0. For a > 0 we call u a-supermedian with respect to (Xt)t>o if e~atPtu < u
(3.117)
90
Chapter 3 Feller Processes
holds for all t > 0. If u is a-supermedian and u = lime-at Ptu,
(3.118)
UO
then u is called a-excessive with respect to (Xt)t>0. Lemma 3.4.14. Let u be a-supermedian with respect to the universal Markov process ((Xt)t>a,Px,{Jrt)t>o)xeE and suppose that for each t > 0 the random variable u(Xt) is integrable with respect to every measure Px. Then (e~atu{Xt),!Ft)t>Q is a supermartingale. Proof. We use the Markov property in the form (3.112) (in its obvious extension to integrable functions) to find for s > 0, t > 0 that u(Xs) > e-atP?u{Xs) = =
e-atEx°(u{Xt))
e-atE»(u(X3+t)\Fs),
or e-asu(Xs) >
E^(e-^s+^u{Xs+t)\Ts)
proving the lemma.
•
With every strongly continuous contraction semigroup (Tt)t>o on a Banach space X we associate its resolvent, compare Section 1.4.1, by
Rxu= f Jo
e-XtTtudt=(\-A)-1.
Now, if (Pt)t>o is the semigroup of operators associated with a universal Markov process with state space (E,8) and if u e P>b(E), then Uxu:= f Jo
e-XtPtudt,X>0,
makes sense. In addition the resolvent equation Ux-Ull = ((Ji- \)VXU» holds and we have
(3.119)
3.4 Markov Processes and Feller Processes
91
for u € Bb(E). Moreover, if E — R n and (•Pt|coo(Kn))t>0 *s a Feller semigroup {Tt)t>o, then J/A|COO(R") = ^ A , where (J?A)A>O denotes the resolvent associated with (Tt)t>o. It is convenient to call the family (U\)\>0 the family of X-potential operators associated with the process {Xt)t>obe a universal Markov Proposition 3.4.15. Let ({Xt)t>Q,Px,{Jrt)t>o)xeE process, a > 0, and u e Bb(E),u > 0. Then Uau is a-excessive with respect to (Xt)t>o and {z~atUau(Xt),Tt)t>Q is a supermartingale. Proof. First we observe that
e-atPt(Uau) = e-at
[Xe-asPt+suds
Jo e-asPsuds<
/ e-asPsuds = Uau, Jo
thus Uau is a-supermedian and since />OO
OO
/
e- Q S wds= / Jo
e-asPsuds,
it follows that Uau is a-excessive. Finally, since Uau is bounded we may apply Lemma 3.4.14 to Uau instead of u to find that (e" Qt f/ Q u,^ r t)t>o is a supermartingale. • (Ft)t>o)xpE Definition 3.4.16. A universal Markov process ((Xt)t>o,Px, with locally compact Polish state space (E,B) is called a Feller process if (Tt)t>o,Tt := Pt\c^{E) is a Feller semigroup. In order to prove that Feller processes admit cadlag-modifications we need Lemma 3.4.17. Let (D,,A, P) be a probability space and let (E,B) be a locally compact Polish space. Two random variables X,Y : Q —> E are almost surely equal if and only if E(u{X)v(Y))
= E{u{X)v{X))
(3.120)
holds for all u, v S Cb(E). Proof. Clearly, X = Y a.e. implies (3.120). Now, suppose that (3.120) holds. By a monotone class argument we derive that E(u(X, Y)) = E(u(X, X))
(3.121)
92
Chapter 3 Feller Processes
holds for all UJ G B(E x E),w > 0. Since X{{x,y)eExE;x^y} Borel function on E x E we find
is a non-negative
P(X ^Y) = P(X ^ X) = 0 and the lemma is proved.
•
Remark 3.4.18. Clearly, the above lemma remains valid if Cb(E) is substituted by Coo(E). Now we can prove Theorem 3.4.19. A Feller process ((Xt)t>o,Px)x£Rn tion.
has a cddldg modifica-
The proof of Theorem 3.4.19 requires two results on supermartingales, Theorem 2.6.9 and Theorem 2.6.11, which we recollect here for convenience. The first theorem states that if (Xt)t>o is a supermartingale on (p., A, P, (^rt)t>o) then for almost all w G O the following two limits exist
lim Xr{w),t > 0 and lim Xr(u),t > 0. rtt
rit
rGQ+
r€Q+
The second theorem states that a right-continuous supermartingale has almost surely cadlg paths. Now, following D. Revuz and M. Yor [299] we give the Proof of Theorem 3.4.19. Let {UV)VQ^,UV € Coo(R™) and uv > 0, be a sequence which separates points, i.e. for x,y £ Rn,x ^ y, there exists VQ such thatu t , 0 (x) 7^ uUa(y). Since foru G Coo(Rn) wehaveC/ Q u = Rau it follows that for v G N the family (aUauu)a>o converges uniformly to uu as a —> oo, hence H := {Uauv;a G N and v e N} is a countable set of functions in Coo(Rn) which also separates points. Using the fact that {e~atUauv)t>o is a supermartingale with respect to (JFt)t>o and all Px as well as all P^ — j Pxfi(dx), the first result mentioned above, i.e. Theorem 2.6.9, yields that for every h G H the limits lim h(Xr(cj)) exist almost surely. Since H separates points rit r£Q+
it follows that for all w G Q\Af, P(M) = 0, P = P M for some initial distribution .122) Xt{w) := lim Xr{w) rit re®+
(3
3.4 Markov Processes and Feller Processes
93
exists. For u> £ Af we just define
Xt{uj) := 0 for t > 0. For u, v e Coo(Rn) we find for any initial distribution pt using the Markov property
E»{u{Xt)v{Xt)) = lim E»{u{Xt)v{Xs)) sit
SGQ+
= lim E»(u{Xt)Ex*{v{Xs-t))) seQ +
- lim E»(u{Xt){T3_tv){Xt)) sit
seQ+
= E»(u{Xt)v{Xt)), where we used that lim ||Ts_tw — v ^ = 0 since (Tt)t>o is a Feller semigroup. Thus Lemma 3.4.17 implies for each t that Xt = Xt a.s. Since (Xt)t>o is right continuous we have constructed a right continuous modification of (Xt)t>o- It follows further from the second theorem mentioned above, i.e. Theorem 2.6.11, that for every h G H the process (h(Xt))t>Q has almost surely cadlag paths because it is a right continuous supermartingale. Again we may use the fact that H separates points to conclude that (Xt)t>o has almost surely cadlag paths, i.e. we have constructed a cadlag modification of (Xt)t>o• Corollary 3.4.20. Let (Xt)t>0 be the canonical universal Markov process with respect to the canonicalfiltrationassociated with a (conservative) Feller semigroup (Tt)t>0,Tt : Coo(R") -+ Coo(Kn). Then it admits a cadlag modification. Remark 3.4.21. Using Remark 2.6.2.C and Theorem 2.6.13 we may also deduce that Corollary 3.4.20 holds for the nitrations (Jf+)t>o as well as the augmentation of (J^+)t>oRemark 3.4.22. A very detailed, clear and complete proof that every Feller process admits a cadlag modification with respect to a complete and right continuous nitration is given in the forthcoming book [323] of R. Schilling. We may give Corollary 3.4.20 a different, very important interpretation. Let (Tt)t>o be (for simplicity) a conservative Feller semigroup on Coo(Rn).
94
Chapter 3 Feller Processes
Further let fi be an initial distribution. The Kolmogorov construction yields a canonical process ((R")[o>°°), (BW)[o,oo) )PM) (Xt)t>o), where Xt{w) = w(t) is a projection. Since this process has a cadlag modification we might try to prove that P M |p n gives a probability measure on Z?nn(jB(n))[0>o°). The problem is that in general T>n is not measurable. Definition 3.4.23. Let (E,B) be a Polish space and {Pj)j^u(i) be a projective family of probability measures over E. We call a set Q. C E1 essential with respect to {Pj)j£U(i) if there exists a stochastic process with state space E, parameter set / , finite-dimensional distributions (Pj)jsn(i) a n d path-set Q. The next theorem due to J. L. Doob [88] gives a characterization of essential sets. Our formulation is taken from H. Bauer [30] where the reader may also find a proof. Theorem 3.4.24. Let E be a Polish space and [PJ)J^H(I) be a protective family over E. Denote by P the protective limit of {Pj)jen(i) and ^he outer measure determined by P is denoted by P*. Then a set Cl C E1 is essential with respect to (Pj)jeH(i) if and onMi if P*{h) = 1. Proof. See [30], p.328.
(3.123) •
Note that (the proof of) Theorem 3.4.24 yields that
(fi, n n B1, P, (Xt)t>o), P(fi n Q) = P(Q), is an equivalent process to the canonical process {E1 ,BI, P, (Xt)t>o) • Thus we find that to a given (conservative) Feller semigroup on Coo(K") there exists a process equivalent to the associated canonical process given by
(vn,vnn(Bny,P,(xt)t>0), in fact we may replace I ^ n ^ " ) 7 by a{Xt,t £ [0,oo)). This process leads again to a universal Markov process, in fact a Feller process, and all considerations made so far do hold (essentially) also for this process. Thus, determining a universal Markov process associated with a Feller semigroup (T t ) t >o on Coo(Rn) can be reformulated:
3.4 Markov Processes and Feller Processes
95
On the measurable space (Vn,Vn n (S(n))[°>°°)) find probability measures P ,x£Rn, such that for u G Coo(Kn) x
Ex{u(Xt))=(Ttu)(x) holds. We will come back to these considerations when discussing the martingale problem for pseudo-differential operators with negative definite symbols, see Chapter 4. Finally in this section we will prove that Feller processes are stochastically continuous. The proof of the following theorem is taken from K. L. Chung [75]. Theorem 3.4.25. Every Feller process ((Xt)t>o, Px)x€&n continuous, i.e.
is stochastically (3.124)
\imP(\Xs~Xt\>e)=0.
s->t
Proof. Take u,v € Coo(R") and for t, r > 0 we find using as before the Markov property E»{u(Xt)v(Xt+r) = E»(u(Xt)Ex*{v(Xr))) =
E»(u(Xt)(Trv)(Xt)).
Again, the fact that (T t ) t >o is a Feller semigroup implies for r J. 0 that lim E» (u(Xt)v{Xt+r)) = E" (u(Xt)v{Xt)).
(3.125)
rlO
As in the proof of Lemma 3.4.17 we may extend (3.125) to hold for all LO G C o o (M n x]R"), i.e. (3.126)
WmE»(uj{XuXt+r)) =E(w(Xt,Xt)) r|0
for all u) G Coo(M" x l " ) . Taking now for w a sequence approximating the function (x, y) H-> \X — y\, then (3.126) implies the L1 -convergence of Xt+r to Xt, hence the stochastic convergence. Next let t > 0 and 0 < r < t. For each x G M" it follows with u, v as above that Ex(u(Xt_r)v(Xt))
=
Ex(u(Xt_r)EXt-r(v(Xr)))
= Ex{u(Xt-r){Trv){Xt-r))
= Tt-r(uTrv)(x).
96
Chapter 3 Feller Processes
Now, as r —> 0 it follows that
lim Tt-T{uTvv){x)
= Tt{uv){x) = Ex
(u(Xt)v(Xt)),
thus lim Ex(u(Xt-r)v(Xt))
r—>0
=
Ex(u(Xt)v(Xt))
and with the same argument as before we arrive first at lim Ex(cj{Xt-r,Xt))
1—>0
= Ex(uj{Xt,Xt))
, w £ C ^ R " x Rn),
and then we get lim E*(w(Xt-r,Xt))
r—»0
= E"(u>(Xt,Xt))
(3.127)
for all w G Coo(K" xR"). Thus we find that X t _ r -> X t stochastically implying the theorem. • Remark 3.4.26. The reader might have noticed that in some of the results in this section we need to assume that the underlying Feller semigroup is conservative. But all results continue to hold for an arbitrary Feller semigroup when passing from the state space M"(or E) to the state space R^(or E&).
3.5
The Shift Operator and the Strong Markov Property
Let (p., A, Px, (Xt)t>o, (^7t)t>o) eKn De a universal Markov process. We want to give a different formulation (and interpretation) of the Markov property. Assume for a moment that the process under consideration is a canonical process, i.e. Q, = (K")!0'00). Then w € f i i s a mapping w : [0, oo) -> Mn and for each s > 0 we may consider the new mapping UJS : [0, oo) —> K", t H-> w{t + s). Since the random variables Xt are the projections Xt : £1 —> R n ,t >—> u(t) we find Xt+s(Lj) = w(t + s)=Xt(ujs),
(3.128)
i.e. shifting the argument of w by s is compatible with a shift of the "time" parameter by s. Back in the general case we give
3.5 The Shift Operator and the Strong Markov Property
97
Definition 3.5.1. Let (Q,A, Px, (Xt)t>o, (^)t>o)xeRn be a universal Markov process with state space (M.n,B^). A family 6S : Cl —> Q,s > 0 of measurable transformations is called a family of shift operators (with respect to the process (Xt)t>o) if for all w G ft and s, t > 0 it holds (3.129)
Xt+,(w)=Xt(0t(u>)).
Thus in case of a canonical process a shift operator is given by (3.128), but (3.128) yields also an example of a shift operator in case of the cadlag modification of a canonical Feller process with state space K n . This follows from the choice of the a-field AonT>n. Let (6s)s>o be a family of shift operators with respect to (Xt)t>o- From (3.129) we derive for r, s, t > 0 Xt+s+r(cj)
= Xt+s{6T{u))
=
Xt{0.(Or(w)))
as well as Xt+s+r{u) =
Xt(9s+r(v))
which gives 6s+t = 8so6r
for all r, s > 0.
(3.130)
P r o p o s i t i o n 3.5.2. Let (9s)s>o be a family of shift operators with respect to the universal Markov process (Q,,A,Px,(Xt)t>o,(^'t)t>o)xeRnThen the (universal) Markov property Px(Xs+t
G B\TS) = Px°(Xt
G B)
= Px(Xt+seB\Xs)=pt(Xs,B)
Px-a.s.,B£B(n\
(3 131) V ' '
is equivalent to P^iej^F)^)
= ^(B-^F^Xs)
Px-a.s.
,F&A.
(3.132)
Proof. The sets of all F such that (3.132) holds form a n-stable Dynkin system and therefore it is sufficient to prove (3.132) for cylinder sets of the form F = {u G fi;-Xto(w) G Bo,.. .,Xtn(w)
G Bn}
where 0 = t 0 < *i < • • • < tm and Bt G B ( n ) . In this case (3.132) reads as Px(Xs€B0,...,Xs+tmeBm\fs) = P*(XS G Bo,...,
Xs+tm G Bm\Xs)
Px-a.s.
(3 133)
'
98
Chapter 3 Feller Processes
We are going to prove (3.133) by induction. For m — 0 nothing is to prove. Suppose (3.133) holds for m - 1. Then for all ip G B b (M n m ) we have almost surely
Ex(
(3.134)
Now, (3.131) implies that PX(XS £ Bo,... ,Xs+tm_1 G Bm-i,Xs+tm =
EX(X{Xs£B0,...,X3+tm_1£Bm-1}PX(Xs+tm
G
Bm\Ts)
€ 5m|Xs+tm_1)|/'s).
(3.135)
By Lemma 2.5.14 there exists a measurable function g : R n —> [0,1] such that P*(X J + t r a G B
m
|X,
K
J = 5 ( X s + t m _ J P*-a.s.
Taking (p(x0,... , x m _ i ) = XB 0 (^O) • • • • • X f l m - i ^ m - O s K - i ) . w e m a Y a PP!y (3.134) to substitute in the last line of (3.135) J-a by <J(XS) which shows that (3.131) implies (3.132). The converse is trivial, compare (3.133). • Recall that for any filtration (Jri)t>o we have defined J 7 ^ = a{Tt,t > 0). Proposition 3.5.3. Let (n,A,Px,(Xt)t>o,(^t)t>o), x G K n , be a universal Markov process and fi an initial distribution. Moreover let Z be a J^-measurable bounded random variable. Then x i-> EX(Z) is measurable and
E>1{Z)= f Ex(Z)n{&x)
(3.136)
holds. Proof. This follows immediately from (3.51) and (3.54), resp., together with the required measurability properties. • Now we may reformulate the universal Markov property. Theorem 3.5.4. Let (fl,A,Px, (Xt)t>o, (^t)t>o) xeRn be a universal Markov process, (0s)s>o a family of shift operators with respect to (Xt)t>o, and Z any T^-measurable non-negative or bounded random variable. For every initial distribution /J, and all t > 0 E'l{Zo9t\J^) holds P^-a.s.
= EXt(Z)
(3.137)
3.5 The Shift Operator and the Strong Markov Property
99
Remark 3.5.5. If Z = X{xseB},B G B(n\ then (3.137) implies (3.131), i.e. (3.137) is equivalent to the universal Markov property. Proof of Theorem 3.5.4. By the definition of the conditional expectation we have to prove for every ^-measurable non-negative or bounded random variable the equality E" ((Z o 9t)Y) = E* (EXt (Z)Y).
(3.138)
Now, as argued several times before, it is sufficient to prove (3.138) for all random variables Y of the form Y = Ylj=i fj(Xtj), where fj is a positive Borel measurable function and tj < t, and Z is of the form Z = YliLi 9i(^u) with gi being positive and Borel measurable, £j < t. This however can be reduced as done repeatedly before to a statement for the transition functions • and the theorem is proved. Our next aim is to extend the Markov property to stopping times. For this we give Definition 3.5.6. Let (Q, A, PM) be a probability space with nitration (Tt)t>o and (Xt)t>o an adapted stochastic process with state space (M.n,Bn). Further let fi be a probability measure on (Rn,Bn). We call (Q, A, P*, {Xt)t>0, (Tt)t>o) a strong Markov process (with initial distribution /i) if i) for all B e B^ (3.139)
P»{X0 eB) = n(B), ii) for all (^)-stopping time a and alH > 0, B G S ( n ) P»{Xa+t e B\Fa+) = P»{Xa+t G B\XO)
(3.140)
holds P^-a.s. on {a < oo}. Recall, compare (2.135), that ?„+ := {A£A;AD{a
£ Tt+ for allt > 0}.
(3.141)
Next we generalize the concept of a strong Markov process to that of a universal strong Markov process: Definition 3.5.7. We (^,A,Px,(Xt)t>o,(J7t)t>o)xeRn strong Markov process if
call
a family of stochastic processes with state space (Rn,B(-n)) a universal
100
Chapter 3 Feller Processes
i) for all B G A the mapping x i-> PX{B) is universal measurable; ii) for all i 6 K " w e have PX{XO = x) = 1; iii) for all x G R n , i > 0, £ G B ( n ) and every ^-stopping time cr it follows P ^ + t G B|J>+) = P*(XCT+t G B\Xa) Px-&.s. on a < oo. (3.142) Remark 3.5.8. Since non-negative constants are stopping times, it is clear that every universal strong Markov process is also a universal Markov process. However the converse is not true. Remark 3.5.9. It is now an advanced exercise in measure theory to prove several equivalent conditions to (3.142). For example we have Px{Xa+t
G B\F.+) = (PtXB)(X
(3.143)
or Ex(u(Xa+t)\Ta+)
= (Ptu){Xa)
(3.144)
where these equalities hold P x -a.s. on {a < oo}. In addition, if a family of shift operators (#5)s>o exists on Q then we may define flff:{ff
Oa(u))(t) = ds(u)(t) on {cr = s}.
(3.145)
In particular, for cr(u>) < oo we find Xa{u)+t(u>)
(3.146)
= Xt(0a(u>)).
Now it is possible to prove as an extension of (3.137) E^{Zo9(r\^l7+)
= EX"{Z)
P M -a.s. on {a < oo}
(3.147)
for every ^"oo-measurable, non-negative or bounded random variable Z. For proofs of these statements we refer to K. L. Chung [75] or D. Revuz and M. Yor [299], some material is also contained in I. Karatzas and St. Shreve [216]. Let (fl, A, Px, (Xt)t>o, (Ft)t>o) be the cadlag modification of a given Feller process. For a probability measure [i on B^ we denote by T^ the completion of T^ with respect to P M , where P»{A) =
fPx{A)fi{dx).
3.5 The Shift Operator and the Strong Markov Property
101
Further, (^T)t>o is the filtration obtained by adding to each T® the PM-nullsets .A/"" of .F&, i.e. J* = a(J*>,M"). Finally we put
^i:=n^r
and
(3-148)
^oc-fi^
where the intersections are taken over all probability measures fx on B^n\ Elements of T^ &re called universally measurable sets. Theorem 3.5.10. The filtrations (Ft)t>o and (^t)t>o o,re complete and rightcontinuous, i.e. they satisfy the usual conditionsProof. Both nitrations are complete by construction and the right-continuity of (J~t)t>o will imply the right-continuity of (!Ft)t>o- Thus it is sufficient to prove for every J^-measurable, non-negative random variable Z that E^{Z\flt) = E»(Z\F?+)
P"-a.s.
(3.149)
holds. As before we may reduce this to random variables of the form z =Y17=ifj(xtj) where ft e C^QR") and h < t2 < . . . < tm,m G N. Moreover, for every t we have PM-a.s.
E»(Z\f?) = E»{Z\F°). Now, for t e K take /c e N such that tk-i < t < ife. Then for /i sufficiently large we find fc-i
£?"(^|^+fc) = I I fi(*tt)gh{Xt+h)
^-a-s.
where 9h(x) = I Ptk-t-h(x,dxk)fk(xk) •••
Ptk+1-tk(xk,dxk+i)fk+1(xk+1)
Ptm-tm-i(xm-i,dxm)fm{xm).
Here pt(a;, A) denotes of course the transition function of the Feller process (Xt)t>o under consideration. Since (Xt)t>0 is right-continuous, Xt+h tends to X t for h —> 0 and therefore we find by Proposition 2.6.12, JB"(Z|^+)=limJB"(Z|^;h)
fc-i
102
Chapter 3 Feller Processes
which proves the theorem.
•
Of course, we now want to consider (Xt)t>o as a stochastic process adapted to the nitration (Ft)t>o and (Jrt)t>o> respectively, and this causes some measurability problems. We follow in our presentation mainly the monograph [299] of D. Revuz and M. Yor. We assume that (Xt)t>o admits a family of shift operators (#s)s>oLemma 3.5.11. Let Z be a bounded T^-measurable random variable. Then x H-» EX{Z) is universal measurable and we have
E»(Z) = jE*(Z)n(dx). Proof. For every probability measure fi on B^ we find two .T^-measurable random variables Z\ and Z2 such that Z\ < Z < Z2 and E^(Z2 - Z\) = 0 and therefore EX{Z1) < EX{Z)
<EX{Z2)
for every x G K™. Since x H-> Ex{Zi),i = 1,2, is S(n)-6(^-measurable and
J(EX(Z2) - E^Z^^dx)
= E»{Z2 - Zx) = 0
it follows that x — i > EX(Z) is B^-B^the lemma is proved.
measurable and since [i was arbitrary •
Lemma 3.5.12. A. For every t > 0 the random variable Xt is Tt- B^measurable. B. For every t > 0 and h > 0 we have 0^l{Tt) C Ft+h, in particular 0s is measurable. Proof. Part A follows from [299], Proposition 0.3.2. Further we know that Oh is ^-^Y^-measurable and the assertion will follow from [299], Proposition 0.3.2. if for every initial distribution v there is an initial distribution /U such that 6h{Pv) = PM. For this define fx := Xh(Pv) and use the Markov property in the form of (3.137) to find for A £ F^ that
Pv{6h &A) = EV{EX*{XA)) = JpY(A)v(dy) which proves the lemma.
= P»(A) •
3.5 The Shift Operator and the Strong Markov Property
103
Now we can prove that (Xt)t>o is also a universal Markov process with respect to the new filtration (ft)t>oTheorem 3.5.13. Let (Xt)t>o be a Feller process with respect to (.Fto)t>o and state space (lRn, B^). Then for every Too -measurable non-negative or bounded random variable Z, every t > 0 and every initial distribution /z E"(Z o 9t\Tt) = EXt(Z)
P^-a.s.
(3.150)
on {Xt < oo}. In particular ((Xt)t>o, {F)t>o) is a universal Markov process. Proof. (Compare D. Revuz and M. Yor [299]/ Note that {Xt < oo} denotes the set { w e f i ^ i f w J ^ K ^ I 1 1 } , i.e. for a conservative Feller semigroup {Xt < oo} — £1 for t < oo. From Lemma 3.5.11 and Lemma 3.5.12 it follows that u> — i > EXt^(Z) is always .Ft-measurable and it remains to prove for all A&Tt = E»(XAEXt(Z)).
E»(XAZo6t)
(3.151)
Without loss of generality let Z be bounded. The definition of .Foo implies the existence of an J 7 ^- measurable random variable Z' such that and P ^ r ) = 0 with v = XtiPi1). It follows that {Z ^ Z1} C r , T G ^ 1 {Z o 6t + Z o 6t} C ^ - ^ r ) and P'1(9t1(T)) = PV(T) = 0. Now the Markov property with respect to {^t)t>o yields
P^r1?))
= E»{Ex>{xr)) = j PY{T)u{Ay) = P»(T),
and since E'1(EXt(-)) E"(EXt{\Z
= Ev{-) we find
- Z'\)) = EV{\Z - Z'\) = 0,
or EXt(Z) = EXt(Z'), P^-a.s. Thus we may substitute in (3.151) Z by Z' and then we may use the Markov property with respect to (Ff)t>o• Let r be a ^-stopping time, (Jrt)t>o as in (3.148). On {r = oo} we define XT = A e M^.Then XT is j'v-measurable. For the shift operator we set 0T{w) = et(u)
for
T(W) = t
(3.152)
T(W) = oo,
(3.153)
and eT{w) = A
for
where A G ft denotes the path t i-> A G M^. With these definitions we find Xto0T = XT+t and therefore 0 " 1 (.?£,) C o{XT+t ;t>0).
104
Chapter 3 Feller Processes
Theorem 3.5.14. Let ((Xt)t>o, (^rt)t>o) be the cadlag modification of a Feller process with state space (M n ,S ( n ) ) and the filtration is constructed as in (3.148). Then for every Too-measurable, non-negative or bounded random variable Z, every Tt- stopping time r and every initial distribution \x it holds = EX*(Z)
E»{ZoOT\fT)
P»-a.s. on {XT + oo},
(3.154)
i.e. since {Tt)t>o is right continuous, ((Xt)t>o, (^t)t>o) is a universal strong Markov process. Proof. Suppose r takes its values only in a countable set D. Then it follows
o eT\TT) = J2 x{r=d}X{xd^A}^(z
X{XT*A}E»(Z
o od\rd)
deD
Y,X{r=d}X{Xd¥:A}EX*{Z)
=
deD where we used Theorem 3.5.13, i.e. the fact that ((Xt)t>o, (Tt)t>o) is a universal Markov process. Hence, in this special case (3.154) holds. To prove the general case define by [2 n r] + 1 Tn-=V—^ , neN, a sequence of ^-stopping times having values in a countable set and which decreases to T. For fi G Coo(Mn), / , > 0, i = 1,..., k and t\ < ... < tk we put g{x) = j pti(z,dzi)/i(zi) / Pt2-ti(a:i,da;2)/(a;2) •••J
Ptk-t^{xk-i,dxk)f{xk).
Since (Xt)t>o is a Feller process we have g £ Coc(Mn) and g > 0, and due to the construction k
£"(n/iW°^i^)=^»)3= 1
The right-continuity of the paths and Proposition 2.6.12 yields now by a monotone class argument the assertion for all Z > 0, Z being .F^-measurable. It remains to show (3.154) for all Z > 0 which are .Foo-measurable. If we substitute P» by P»
~ ^
[A)
_ p»(An{xTn}) ~
P»(XT ^ A)
'
3.5 The Shift Operator and the Strong Markov Property
105
then the conditional expectations with respect to J-T are the same for P M and P» and we may therefore assume XT ^ A a.s. We now write once again P^ instead of P». Let v(A) = P»(XT e A), i.e. v — X T (P M ). By the definition of J7^ there are two T%^-measurable random variables Z' and Z" such that Z1 < Z < Z" and PV(Z" - Z' > 0) = 0. The first part of the proof yields P»{Z" oeT-Z'o9T>0)
= E^ (Ex- (Z" - Z' > 0)) = 0.
Since /x was arbitrary we derive that Z o 9T is ^"oo-measurable, hence E»(Z o 6T\FT) is well defined and it follows that E^iZ' o 9T\TT) = Ex- (Z) = E*(Z" o 6T\fT) proving the theorem.
n The main lines of the above proof had been once again borrowed from D. Revuz and M. Yor [299]. In Chapter 6 we will relate potential theoretical considerations to probabilistic ones. It is convenient to add already here some preparatory material. We start with Blumenthal's 0-1-law. Theorem 3.5.15. Let (Xt)t>o be the cadlag modification of a Feller process with respect to a right-continuous and complete filtration (Jrt)t>o o/nd state space ( R n , S ( n ) ) . For x G R™ and V € T%x it holds either PX(T) = 0 or PX{T) = 1. Proof. If T G cr(Xo), then PX(T) = 0 or PX{T) - 1 since PX{XO = x) = 1. But FQX — o-(Xo,Af€x) proving the theorem. • Corollary 3.5.16. / / r is an {T^*)-stopping PX(T = 0) = 1 or PX(T > 0) = 1. Now let i C I
n
time then it holds either
be a set. We define
aA •= inf{t > 0 ; Xt £ A}
(3.155)
aA := inf{t > 0 ; Xt e A}
(3.156)
and
106
Chapter 3 Feller Processes
where (Xt)t>o ls as in Theorem 3.5.15. We call DA the entry time of (Xt)t>o into A and TA is called the (first) hitting time of (X t ) t >o of the set A. As usual we use the convention inf 0 = +oo. For s > 0 we find s + aAo0a
= s + inf{t > 0 ; Xt+S e A} = inf{t > s ; Xt e A},
hence (3.157)
s + &Ao0s = &A on {&A > s}, and further we have \im(s + &Ao6s)
(3.158)
= <JA-
By analogous arguments we find t + aAo0t=aA
(3.159)
on {aA > t}.
It holds Theorem 3.5.17. Let A S B^n\
Then &A and a A are J-t-stopping times.
For a proof we refer to D. Revuz and M. Yor [299], p.90, but compare also Section 5.2, especially Theorem 5.2.15. Proposition 3.5.18. Let (Xt)t>o be as in Theorem 3.5.15 and for x £ K" set ox := inf{t > 0; Xt 7^ x}. Then there exists a = a{x) £ [0, oo] such that Px{ax>t)=e~at
(3.160)
Proof. By definition ax is the first hitting time of the Borel set {x}° hence it is an (.F^-stopping time. Further, by (3.158) we have on {ax > t} the equality ox — t + ax o 6t • Thus we find Px(ax =
>t + s)= PX{{(TX >t}D{ax>t
+ a})
x
E (X{ax>t}X{*x>s}°9t)
and the Markov property yields Px(ax
>t + s)=
Ex(X{ax>t}EXt(x{ax>s}),
where we used that Xt ^ A on {ax > t}. In fact, on {ax > i) we have Xt = x almost surely and therefore Px{ax
>t + s)= Px{o-X > t)Px(ax
> s).
The continuity of s t—> Px(crx > s) implies now the proposition.
•
3.5 The Shift Operator and the Strong Markov Property
107
With arguments similar to those used in the proof of Theorem 3.5.14 one shows, compare [299], p.98, Lemma 3.5.19. For every t > 0 and every Tt-stopping time r a Tt-stopping time is given by r + t and in addition ^~1(^rt) C TT+t holds. We use Lemma 3.5.19 in order to prove Lemma 3.5.20. For two Tt-stopping times a and r a further Tt-stopping time is given by a + r o Qa. Proof. Since (Tt)t>o is right-continuous it is sufficient to prove that for every * > 0 it holds {ex + T O Ba < t} £ Tt. Since {a + T o 6a < t} = (J {a < t - q} n {r o 6a < q} qSQ
and since by Lemma 3.5.19 we have {T o6a < q} £ F^+q the lemma is proved once we observe that
{a < t - q} n {r o 6a < q} = {a + q < t} ("1 {r o 9a < q}. D If for example r = TA = inf {i > 0; Xt £ A} and cr = TB = inf {t > 0; Xt G B} then TA + TB ° 8TA is the first time the process hits the set B after it has hit the set A. Let T be a ^-stopping time. We associate with T the kernel
Pr{x,A)=E?{XA°XT) and for a non-negative Borel function u we define PTu(x):=Ex(u(XT)).
(3.161)
Proposition 3.5.21. A. For two Tt-stopping times a and r we have PaoPT
= Pa+ro9a.
(3.162)
B. If T is an (Ft)-stopping time, then Yt := XT+t is again a universal Markov process with respect to the new filtration (!FT+t)t>o and it has the same transition function as (Xt)t>o-
108
Chapter 3 Feller Processes
Proof. A. Take u e B(Rn), u > 0, to find P
Ex(Ex'(u(XT)))
and the strong Markov property gives Pa(PTu)(x) = E*{X{XB^}E?(U{XT) =E*(x{x^A}u(XT)o6<7).
o ea\Ta))
However, u(XT) o 6a = u(Xa+TOga) and u(XT) o 9a = 0 for {Xa = A}, and part A is proved. B. Let u > 0 be a Borel function on Kn and let fi be any initial distribution. First we find on {XT+t ^ A} E"(u(X T+t+ ,)|:F T+t ) - E»{u{Xs) o eT+t\TT+t) =
Psu(XT+t),
and by our definition this equality extends to {XT+t = ^ } proving part B.
•
Remark 3.5.22. Note that if (Xt)t>o is a canonical process then (Yi)t>o of Proposition 3.5.21.B is in general not a canonical version of (Xt)t>o-
3.6
The Martingale Problem for Feller Processes: First Remarks
Given a (conservative) Feller semigroup (Tt)t>o o n Coo^") with generator (A,D(A)). In this section we will first associate certain martingales with (A,D(A)) using the Feller process (Xt)t>o corresponding to (Tt)t>o- Then we will take a converse point of view: We will try to construct the process (Xt)t>o associating a family of martingales to (^4, D(A)), i.e. by solving the martingale problem. We need some auxiliary results and for simplicity we restrict all of our considerations to processes with state space (R n ,B^ n '). Definition 3.6.1. Let (il,A,P,(Xt)t>o) be a stochastic process with state space (K n ,S' n ') and {Ft)t>o be a filtration in A. We call (Xt)t>o progressively •measurable with respect to (Pt)t>o if for all t > 0 the mapping X.(-) : [0,t] xQ^Rn (t,w)^X t (w) is B^([0,t]) ® Tt-B^cesses are adapted.
measurable. Clearly, progressively measurable pro-
3.6 The Martingale Problem for Feller Processes
109
Of importance is now Proposition 3.6.2. Let (Xt)t>o be a right-continuous stochastic process adapted to the filtration (J7t)t>o- Then (Xt)t>0 is progressively measurable with respect to (^t)t>oProof. For t > Q,v > l,k = 0 , 1 , . . . , 2 " - 1, and 0 < s < t we define for fc*
It follows that (S,LJ) •-> X{SV)(UJ),0 < s < t,w € ft, is BW([0,t]) ® Ft-B(n) -measurable. Since {Xt)t>o is right-continuous it follows for (s,w) 6 [0,i] x ft that lim X^u){w) = X s (w) implying the 5 (1 '([0,t]) ® J^-'B(™)-measurability of the limit mapping X(-).
D
Corollary 3.6.3. Let (Tt)t>o be a (conservative) Feller semigroup on Coo(Mn). Let cadlag modification of the associated Feller process is progressively measurable with respect to the canonical filtration {T^)t>o as well as to each of the filtration (T^)t>o and (^rt)f>o from (3.148). Corollary 3.6.4. Let (Xt)t>o be a stochastic process with state space (M", B^) which is progressively measurable with respect to the filtration (!Ft)t>o and let Then (u(Xt))t>0 is (!Ft)t>a progressively measurable and in u e Bb(Rn). addition (/ 0 u(Xs)ds)t>0 is {Tt)t>o-adapted. Proof. The first statement is trivial, the second one follows by approximating the integral. • A central observation is now Theorem 3.6.5. Let {Tt)t>o be a (conservative) Feller semigroup on Coo(Mn) with generator (A,D{A)). Further let ((Xt)t>o,(^t)t>o) be a cadlag modification of the associated Feller process. For every u G D(A) and every initial distribution p. Ml := u(Xt) - u(X0) - [ {Au)(Xs)ds, ./o
t > 0,
(3.163)
110
Chapter 3 Feller Processes
is an (J-f)t>o martingale with respect to PM. In particular, ifu is ^4-harmonic, i.e. Au = 0, then (u(Xt))t>o is an {J-^)t>o martingale with respect to P^. Proof. Since for u G D(A) we have Au € Coo(R™) and since (-Xt)t>0 is progressively measurable the integral in (3.163) is well denned. Moreover we find for u < s < t Ei*(M?\J*)
= E"(u(Xt) - u(X0) - y V«)(*r)dr|J?) = u(Xs) - u(X0) -
[S(Au)(Xr)dr Jo
+ E»(u(Xt) - u(Xs) - J
(Au)(Xr)dr\J*)
= Ms" + E» (u{Xt) - u(Xs) - J (^«)(X r )dr|^). Thus we have to prove that E»(u(Xt) - u{Xs) - j (Au)(Xr)dr|J?) = 0. The Markov property yields E»(u(Xt) - u(X.) - J
(Au)(Xr)dr\J*)
= Ex» (u(Xt_s) - u(X0) - J
(Au)(Xr)dr),
but for every y G R" and u G D(A) we have E» (u(Xt_s) - u(X0) - J
\Au)(Xr)dr)
pt — S
= Tt-,u(y) - u(y) - / Jo
TT{Au){x)dr - 0
by Lemma 1.4.1.14.C proving the theorem.
•
Remark 3.6.6. Note that nothing will change in the above proof if {!F^)t>o is substituted by any filtration (^t)t>o turning (Xt)t>o into a Markov process (with cadlag paths).
3.6 The Martingale Problem for Feller Processes
111
It is noteworth that we may use martingales in order to characterize elements in D(A). Proposition 3.6.7. Suppose that (Xt)t>o is as in Theorem 3.6.5 and suppose that toue Coo(Rn) there exists g G Coo(Mn) such that
(u(Xt) - u(X0) - f g(Xr)dr) j
\
/t>o
0
is a (Tt)t>o martingale with respect to every Px,x G W1. Then u G D(A) and Au = g. Proof. For x £ Rn we have Ttu(x) - u(x) = f Tsg(x)ds Jo and therefore sup -(Ttu(x) - u(x)) - g{x)
x€R n
l
1 /"*
= sup - / (Tsg(x) - g{x))ds x€R" I JO
< -1 f \\T,g - ffl^ ds —» 0 Jo
as t —* 0
proving the proposition.
•
Remark 3.6.8. Note that the last results allow us to extend the definition of a generator of a Feller semigroup: We may call u G B(Rn) to belong to De(A), the extended domain of A, if there exists g G B(Rn) such that almost surely /„* \g(Xr)\dr < oo for t > 0, and (u(Xt) - u(X0) - / \ Jo
g(Xs)ds) >t>0
is a right-continuous (or cadlag) (^rt)t>o-martingale with respect to every ,x t K . Our aim is to use the expression M" in (3.163) in order to construct "many" martingales, sufficiently many to recover the Feller process associated with the Feller semigroup generated by (A, D(A)). Given a generator
112
Chapter 3 Feller Processes
(A,D(A)) of a (conservative) Feller semigroup (Tt)t>o on CooQR"). The process which we want to construct out of the martingales (M")t>o should be a Hence it will have a cadlag Feller process (fl,A,Px,(Xt)t>o,(^t)t>o)xeRnmodification. Therefore we may try to reduce the problem by assuming that fi = £>n([0, oo)) equipped with the Skorohod topology and the associated Borel-cr-field A = Avn which makes the projections Xt : r>n([0,oo)) —> M™, LJ i-> w{t) measurable, compare Theorem 3.3.12. As filtration we may start with the canonical filtration. Now we face two problems: 1. For a given initial distribution \x on B^ find a probability measure P^ on (T>n([0, oo)), Avn) such that under P^ a martingale (M") t > 0 is given on (T>n([0, oo)), Az>n, PM) for every u e -D(^4) (or u out of a "nice" subset oiD(A)). 2. Use the family of martingales constructed in this manner, i.e. the measures PM, in order to obtain a Feller process, more precisely, try to prove that ((Xt)t>o, Px)xeRn is a Feller process. Let us give some precise definitions. Definition 3.6.9. Let A : D(A) -> Bb(E.n) , D(A) C Bb(Rn), be a linear operator. A probability measure P on 2?n([0,oo)) is called a solution to the T>n-martingale problem for the operator [A, D(A)) if for every u G D(A) (Mnt>o := (u(Xt) - ( (Au)(Xs)ds) \ Jo ' t>o
(3.164)
is a martingale on (P n ([0,oo)),^r» n ,P, (^)t>o)- We call the Pn-martingale problem well posed if for every initial distribution /x £ M\ (R™) there is a unique solution PM to the Pn-martingale problem for (A,D(A)) which satisfies (XO)PM
= M,
(3-165)
i.e. /x is the initial distribution of the process (Xt)t>o defined on (X» n ([0 l oo)) > ^ B ,P"). Let us make explicite that by (M^)t>o a martingale under P is given, i.e. we have for u € D(A) and s
P-a.s.
(3.166)
3.6 The Martingale Problem for Feller Processes
113
where E stands for the (conditional) expectation with respect to P. Clearly (3.166) is equivalent to m
m
E(M? H hv{X.v)) = E(M? I ] KiXsS)
(3-167)
or
0 = E((u(Xt) - u{Xs) - / (Au)(Xr)dr) JJ hv(X.u)) m
= E((u(Xt) - u(Xs)) J ] hv{X,S)
(3-168)
E((Au)(Xr)l[hu(XSL,))dr for all m G N, 0 < si < ... < sm < s
i \B) —
pl^F)
'
(3.169)
•
(3 170)
and M
2 {
' "=
E(XFE(XB
\Xr))
PT(F)
-
With Yt := Xr+t it follows that
if (r0 e r) = P?(Y0 e r) = P"(xr G T\F).
(3.171)
114
Chapter 3 Feller Processes
Furthermore, for 0 < h < t2 < • • • < tm < tm+1,u G D(A) and hv £ Bb(Rn), v = 1 , . . . , m, we define
r,(Y.) := (u(Ytm+1) - u(YtJ - / By (3.168) we have E(rj(Xr+.)\J^)
MMy,) =
(Au)(yr)dr) ]\ K(YU).
(3.172)
= 0 implying
(3.I73)
EiM^ml,0
and (3.147) implying that (Yt)t>o is a solution for the Dn-martingale problem for [A, D(A)) on (X> n ([0,oo)),Ai,^,(J?)t>o) and on (2?n([0,oo)), An,P%, (J$)t>o). By the uniqueness assumption we find for all u € D(A) and t > 0 El(u{Yt))=E2(u{Yt)), or E{XFE{u{XT+t)\J*)) = E(xF^(«(^r+t)|X r )).
(3.175)
But F, P(^) > 0, was arbitrary, thus we arrive at E(u(Xr+t)\f?)
= E(u(Xr+t)\Xr)
P"-a.s.
(3.176)
which proves the theorem. • We will need some extensions of the results of Theorem 3.6.10, but these we will discuss a bit later. Let us indicate how to get existence results. Suppose that for a given kernel fi(x, dx) on K n x B^ a bounded operator is given by A : Coo(Rn) -> Coo(R") u i-> Au(x) — I (u(y) - u(x))fi(x, dy)
(3.177)
which extends onto Bb(Rn). As a bounded operator, A generates a strongly continuous semigroup (T t ) t > 0 on Coo(Kn) • Since for u(x0) = supw(a;) > 0 it follows that Au(x0) = /
(u(y)-u(x0))fi(xo,dy)<0,
3.7 Levy Processes and Translation Invariant Feller Semigroups
115
i.e. A satisfies the positive maximum principle, we conclude that (Tt)t>o is a Feller semigroup. Hence the £>n-martingale problem for A is solvable, compare Theorem 3.6.5. If now (A, D(A)) is any (densely defined) operator on Coo(Mn) satisfying the positive maximum principle, we may try, having in mind the structure result for such operators, i.e. Courrege's theorem, Theorem 1.4.5.21, to approximate in some sence A by a sequence of operators of type (3.177). Then we will get a sequence of corresponding probability measures on (Pn([0, oo)), Aj)n) and there might be hope that this sequence converges to a solution to the Pn-martingale problem for A. We will come back to all these problems, but now it is time to discuss classes of examples.
3.7
Levy Processes and Translation Invariant Feller Semigroups
To understand the importance of Levy processes for our theory let us recall some basic ideas from the theory of second order elliptic differential operators and the associated (elliptic) diffusion processes. The proto-type of all second order elliptic differential operators is the Laplacian — A n — — X^=i J^? with symbol a(-A)(x,£) — |£|2. A second order differential operator
L(x,D):=-Y,aki(x)——-+J2bj(x) ax
k,l=l
kOXi
+ c(x)
j = 1
is called elliptic if its principal symbol <rpr (L(x, D)) (x, £) = satisfies the ellipticity condition apr{x,0
J2l,i=iakl(x)^i
> Ao(z)|£|2 , Xo(x) > 0.
(3.178)
Let us restrict our considerations to uniformly elliptic operators with bounded coefficients. Then we find Ao|£|2 < apr(L(x,D))(x,0
< X1\^\2
(3.179)
for all l e i * and ^ £ l " with 0 < Ao, Ai € R. If we don't want to use the principal symbol, but the full symbol n
n
k,i=i
j=i
116
Chapter 3 Feller Processes
then we may consider instead of (3.179) Ao|C|2 < a(L(x,D))(x,£) < X^]2
(3.180)
for all x £ R™ and all £ € -Bg(O), where g > 0 is sufficiently large. Thus we compare the symbol of a second order elliptic differential operator with the symbol of the Laplacian, and typical results for L(x,D) are thought to be related to analogous results for the Laplacian. An example for this philosophy are the Aronson estimates, compare II.2.442. These estimates have of course the interpretation as estimates for the transition functions of the diffusion (Xt)t>o associated with L(x,D), i.e. they give information on the finite-dimensional distributions of (Xt)t>o by comparing them with those of Brownian motion. Hence they provide us with almost all what we really want to know about (Xt)t>oThe theory of pseudo-differential operators q(x,D) with negative definite symbols q(x, £) as developed in Volume II often relies on the estimates
W(0
(3-181)
which are supposed to hold for all x £ M",£ G Bg(Q),g > 0 large. Therefore the stochastic process associated with the operator —t})(D) should have for the process generated by —q(x, D) the same role as Brownian motion for elliptic diffusions, i.e. diffusion processes generated by second order elliptic differential operators. As we will see later in this paragraph the above philosophy is not working as smoothly as we have just indicated. This is best seen by discussing examples. Therefore, partly this section serves also to provide concrete examples for case studies. The processes associated with a continuous negative definite function are Levy processes which we are going to introduce in this section. Let ip : R™ - > C b e a continuous negative definite function and suppose for simplicity that V'(O) = 0, i.e. the constant in the Levy-Khinchin representation of ip vanishes, compare Theorem 1.3.7.7. By (nt)t>o we denote the corresponding convolution semigroup, i.e. we have
faiS) = (27r)-^e-t^).
(3.182)
According to Example 3.2.7 by pt(x,B):=fit(B-x)
(3.183)
3.7 Levy Processes and Translation Invariant Feller Semigroups
117
we obtain a semigroup of Markovian kernels and by Example 1.4.13 the family (Tt)t>0 define on Coo(»") by Ttu{x) = f u(x- y)iH(dy)
(3.184)
JUL"
is a (conservative) Feller semigroup. Thus we may associate with ip a (universal) Feller process (fi, A, Px, (Xt)t>o, (Ft)t>o)xeRn where the filtration is rightcontinuous and complete. Moreover almost surely all paths X.(tj) : [0, oo) —> M.n can be assumed to be cadlag. In addition for every initial distribution /i £ Mi(R n ), the Markov process ((Xt)t>o, -PM) is stochastically continuous, P" = fP*IM(dx). We want to explore some properties of the processes ((Xt)t>o, PM) and for this we need a few definitions. Definition 3.7.1. Let ((Xt)t>o,Pfl) be a stochastic process with state space (M n ,$("'). A. We say that (Xt)t>o has independent increments if for all 0 < s < t the random variable Xt — Xs is independent of Ts. B. The process (Xt)t>o is said to have stationary increments if for all 0 < s < t it follows that (3-185)
PZt-x.=P£t..-
Theorem 3.7.2. The process ({Xt)t>o,P^) constructed from the Feller process associated with the continuous negative definite junction ijj and the initial distribution /J, has stationary and independent increments. Proof. Denote by (/j,t)t>o the convolution semigroup of probability measures associated with ip by (3.182). First we prove p
xt-x3
= IH-, for 0 < s < t,
(3.186)
which will imply that the increments of ((X t ) t > 0 ,P M ) are stationary. Note that for t = s we have Xt-Xt ~ ^0 -
£
0,
i.e. in this case (3.186) holds. Thus suppose that s < t and put Y := Xs ® Xt, so Y is the product (mapping) of Xs and Xt, and further set q : W1 x W1 —> M™, (^1)^2) — • > %2 — x\. With these definitions we have pM
_ pM
118
Chapter 3 Feller Processes
For Q := q~x{B), B £ B^n\ we find P»{Xt -XseB)
= P"( g o Y e B) = P»(Y e Q)
and the construction of PM yields with (3.183) P^iXt - Xa G B) = / / /
XQ(xi,X2)pt-s{xi,dx2)ps(x,dx1)fj,(dx)
= ///
Xx1+B{x2)pt-s(xi,dx2)ps{x,dx1)fi(dx)
=
pt-s{xi,xi
+ B)ps(x,dxi)[i(dx)
=IH-.(B) JPs(x,Rn)fi(dx)
= fit-s(B),
where we used that Pt-.(x1,x1+B)=Pt-.(0,B)
= txt-s{B)
holds as well as the fact that ps(x,Wl) = 1 and fx is a probability measure. Thus (3.186) is shown for s < t and therefore the stationarity of the increments. Next we prove that the increments are independent. For this take to = 0
are independent. According to Theorem 3.1.4 we have to show that for Z = Yo <8> Y1 (2>... ® Ym m DM _ / O \ pM
3=0
holds, i.e. for Bo,...,
Bm e B^ we shall prove m
Pg(B0 x...xBm)
= H P% (Bj). j=0
(3.187)
3.7 Levy Processes and Translation Invariant Feller Semigroups
119
With Xt_1 = 0 we find using the transformation theorem
Pg(B0 x...xBm)
=J
XB0*...xBmdP$0^9Ym o (y 0 ® • • • ® Ym)dP"
= JxB0x...xBm . m J
j=o 771
/
j=0
From the construction of P M we find for P/J
t
,, the joint distribution of
and « e B t ( ( i " ) m + 1 ) that
Xt0,...,Xtm,
/ u{x0, x i , . . . , x m )P{ to> ... )tm }(d(x 0 , • • . , z m ) ) = / • • • / u ( i 0 , a;o + x i , . . . , x0 + ... + xm)fitm-tm-i
(dxm)...
x /xt2_tl(da;2)Mt1-to(da;i)At(da;o) implying with /xto = /J.O = e0
/
m
TT
f
t m }(d(a;o,...,a; m )) = / X B o ( ^ ) J I x B j f e -Zj-i)-P{t 0 = / / • • • XBoiX-x + X0)YlxBj(Xj)lJ,trn-tm-1{dxm) • • • Uti-toidX!) JJ x
J
j=1
^to(dx0)n{dx-1),
and further m
P^(Bo x ... x Bm) = /x(B0) I ]
IH.-U.ABJ).
Now, P^(5 (3.186) yields 0 x ... x^.^ABj) Bm) = M(5O)=I P^(Bj), ] Fv|, ( S J)-or m
(3-188)
120
Chapter 3 Feller Processes
Finally we have to observe that YQ = Xt0 = XQ and that
PP0(B0) = jPo(x,B0)Kdx)
= fi(B0)
which together with (3.188) implies (3.187) and therefore the theorem.
•
Having Theorem 3.7.2 in mind we give Definition 3.7.3. A stochastic process (Ci,A,P, (Xt)t>0, (Tt)t>o) with state space (R n ,S' n ') is called Levy process (or process with stationary and independent increments) if i) (Xt)t>o is .^-adapted; ii) (Xt)t>o has independent increments; iii) (Xt)t>o has stationary increments; iv) (Xt)t>o is stochastically continuous; Corollary 3.7.4. The process ((Xt)t>o,PM) constructed from the Feller process associated with the continuous negative definite function tp and the initial distribution fi is a Levy process. Let [(Xt)t>o, P) be a Levy process with state space (Mn, B^). By stochastic continuity it follows that Pxt —> Pxs vaguely as t —* s, i.e. for all u e C0(Mn) we have / u dPxt
—> / u dPXs
as t —> s.
Therefore Pxt-x0 converges vaguely to Px.-xQ as t —> s. Thus for a given Levy process with state space (M.n,B^) a family of probability measures (Mt)t>o o n &^ is denned by Hf-=Pxt-x0,
(3-189)
and this family is vaguely continuous, i.e. /xt —» ns vaguely as t —> s. In addition we have Mo = Pxo-Xo = ^o = £o,
(3-190)
3.7 Levy Processes and Translation Invariant Feller Semigroups
121
and lim^t = £0 (vague limit). (3.191) t-»o Further, since Xs+t — Xt and Xt — XQ are independent random variables we find, compare Theorem 2.4.11. Ma+t = Pxs+t-X0
= Pxs+t-Xt+Xt-XQ
= Pxa+t-Xt * Pxt-X0
and the stationarity of the increments yields Px3+t-xt
= Pxs-x0
= Ms,
and we arrive at (3.192)
Hs+t = ns*Ht for all t, s > 0. Hence we have proved
Corollary 3.7.5. Let (Xt)t>o be a Levy process with state space (M",S' n ^). Then the family (Pxt-xo)t>o is a convolution semigroup on Rn. The next theorem identifies a given Levy process with the (canonical) process generated by the convolution semigroup (/Ut)t>o,Att = Pxt-x0Theorem 3.7.6. Let (fi,«4, P, (Xt)t>o, {Ft)t>o) be a Levy process with state space (]Rn,Z?(n)) and denote by (/Ut)t>0)Mt = Pxt-xQ the corresponding convolution semigroup. Then the finite dimensional distributions of (Xt)t>o coincide with those of the canonical process (Xt)t>o associated with (/J.t)t>o o,nd the initial distribution /x := Px0, i.e. (Xt)t>o and (Xt)t>o are versions of each others. Proof. Let to = 0 < t\ < ... < tm and denote by Qto,...,tm the joint distribution of the random variables Xto,.. .,Xtm. Further let T : ( R " ) m + 1 -> (K n ) m + 1 be the mapping T(xo,..., xm) = (XQ, X0 - xi,..., xm - xm-i). For a Borel measurable function u : ( R " ) m + 1 —> [0, oo] it follows now
y udQto,...,*™ = Juo (Xt0 ® ... ® Xtm) dP
= fuoT-1oT{Xt0®...®Xtm)&P =
JuoT-\Xt0,Xtl-Xt0,...,Xtm-Xtm_1)dP
122
Chapter 3 Feller Processes
where r is the joint distribution of t h e increments Xto, Xtl —Xto,..., Since r = /j,
Xtm
-tm-i-
/ udQt O i ..., t m = / • • • / u(a; 0) a;o + a ; i , . . . , x o + a;i + • • • + z m ) x
lHm-tm-i
( d a ; m ) . . . /z tl (dzi)/i(d:ro).
On t h e other h a n d we have
/ u d P £ o ] t m } = / • • • / u ( a ; _ i + x 0 , . . . , a;_i + a;0 + ... + x m ) x
^^-tm-iidxm)...
fito(dx0)fJ.(dx-1)
= / • • • / u(a;_i,a;_i + x i , . . . , a ; _ i + x i + . . . + z m ) x
fJ'tm-tm-i (daj m )... / i t l (da;i)/i(da;_i)
where Pf^ t , is defined accordingly to (3.44), compare also Corollary 3.2.12, and the last line follows since fio = /xto = eo- Thus we have proved for all u as above
/«d&o tm =
JudP{totm}
implying Pxt0®...®xtm = ?{t0
(3.193)
tmY
In order to establish the theorem we still have to consider the case For this take B € (B^)m and t0 = 0. By (3.193) we 0
... x
XR"XB(XO,XO
tm} (R"
x B)
+ xi,... ,x0 + xi + ... + xm)
(J>tm-tm-i(dXm)..-HtAdxi)lJ-(dxo)
= / • • • / XB(XO,XO + xi,... ,x0 + xi... + xm) x IMm-tm-i(dxm)
•••
fJ,tl(^xi)n(dx0)
=K t^w proving the theorem.
•
3.7 Levy Processes and Translation Invariant Feller Semigroups
123
In the following, when discussing Levy processes we also assume that they have cadlag paths (almost surely) and if necessary we assume that the underlying nitration is right-continuous and complete. This is of course best justified by our previous results on Feller processes and Theorem 3.7.2 and Theorem 3.7.6. Let (Xt)t>o be a Levy process with state space (M.n,B^) and associated convolution semigroup (nt)t>o,^t '•= Pxt-Xo- We know that (/J.t)t>o is completely characterized by a continuous negative definite function ip : M" —• C , ip(0) = 0, since we assume the process to be conservative. We are longing for a probabilistic interpretation of I/J and start with Definition 3.7.7. Let Y be a n-dimensional random variable on the probability space (Q,A,P). Its characteristic function Ay : Rn —> C is denned by Ay(O := E(eiY<).
(3.194)
Denoting as usual by Py the distribution of Y under P, the transformation theorem yields
M 0 = fe^xPY(dx),
(3.195)
i.e. XY(O = (27r)*(iV)A(O =
(2TT^F-1(PY)(O,
(3.196)
and therefore Ay shares the properties of Fourier transforms of probability measures. In particular, Ay is a positive definite function on R" bounded by 1. Remark 3.7.8. Of course it would be more straightforward to define Ay as the Fourier transform of PY but we would run into some trouble with different definitions of the Fourier transform in probability theory and analysis. Now, let (Xt)t>o be a Levy process with state space (M n ,S (n) ) and denote by (Mt)t>o the convolution semigroup \it := Pxt-x0- Each random variable Xt — XQ> has a characteristic function and we find using (1.3.112), i.e.
MZ) = (2*)-*e-*«\
124
Chapter 3 Feller Processes
that
= f eix^t(dx)
=
(2TT)-S/I(-0
= e- t t / ) ( - ? ) =
e'*^.
The continuous negative definite function i[i is called the characteristic exponent of the Levy process (Xt)t>o- On the other hand, the continuous negative definite function ip is the negative symbol of the pseudo differential operator generating the Feller semigroup associated with (/xt)t>o> i-e-
-i/>(D)u(x) := -(27r)t f extends from
CQ°(R")
e te -«V(O^)d^
to the generator of the Feller semigroup
Ttu(x)= f u(x-y)lH(dy) = (2w)-i f ete*e-^«>u(£)d£Definition 3.7.9. Let (Xt)t>0 be Levy process with state space (M™,S'™') and corresponding convolution semigroup {/J.t)t>o,^t = Pxt-x0, We call the continuous negative definite function ip ]ut(O = (2n)~^e~t^'^. the symbol of the Levy process (Xt)t>oRemark 3.7.10. Due to the tradition of different definitions of the Fourier transformation we have to distinguish for a given Levy process - the symbol of its generator which is —ip; - the characteristic exponent which is ip. - the symbol which is ip. In order to avoid confusions we will use in the following the notion symbol of the process and almost never that of the characteristic exponent. Every continuous negative definite function ij) has a Levy-Khintchin representation, compare Theorem 1.3.7.7 and (1.3.184),
V(0 =c + i(d-Q + q(0 + /
( l - e-te>« - 7 ^ 4 ) «/(<**),
^R"\{0} V
l
+ \x\ J
where the Levy measure v satisfies / ( | x | 2 A l)^(d:r) < oo. We call (c,d,q,v) the Levy quadruple characterising ip, and if V'(O) — 0> i-e- c = 0, then we
3.7 Levy Processes and Translation Invariant Feller Semigroups
125
call (d, q, v) the Levy triple characterising ip. Let us remind the reader on Remark 1.3.7.10: in the Levy triple (or quadruple) of ip the items d and u are not independent of each other and they depend on the choice of the cut-off function in the Levy-Khinchin formula. If (Xt)t>o is a Levy process associated with the negative definite function tj) the term Levy quadruple or triple is also attached to {Xt)t>oUsing the calculation done in discussing Example 1.4.1.12. we find a probabilistic expression for ifi V(0 = - l i m ^ -1(3.197) t-»o t Let (Xt)t>o be a Levy process with state space (IRn, £?("') and symbol tp. Further let / be a Bernstein function. We know that / o ip is once again a continuous negative definite function. Hence it is the symbol of a Levy We call (X/) t > 0 the Levy process process (X{)t>o with state space (E.n,B^). subordinate to {Xt)t>o by the Bernstein function / , or equivalently by the corresponding convolution semigroup (r]t)t>o, compare Theorem 1.3.9.7. We are longing for a probabilistic interpretation of (X/) t > 0 . For this we need to discuss more carefully paths properties and path-wise decompositions for Levy processes, see Section 3.8, which requires some knowledge of certain special classes of Levy processes. The remaining part of this section is therefore (and because of some reasons already mentioned above) devoted to examples of Levy processes. We start our investigation of special Levy processes with the Poisson process. Clearly, there are a plenty of ways to introduce the Poisson process and there is a universe of literature about the Poisson process. We have chosen a way which gives emphasis to the point important for our purpose namely to understand the role of the symbol when studying the process. The Poisson semigroup on M with jumps of size A > 0 and intensity v > 0 is given, compare Table 1.3.9.19, by M* = Z ^ e fc=0
jfei
6xk
'
( 3 - 198 )
and the corresponding negative definite function ip is given by V>(0 = 1/(1 - e " a ? ) -
(3.199)
By our general theory we know that there exists a Feller process associated with (/Zi)t>o and we may work with its cadlag version as well as with a complete
126
Chapter 3 Feller Processes
and right-continuous nitration. This process we call the Poisson process with intensity v and jumps of size A. Thus the Poisson process has stationary and independent increments and is stochastically continuous. We want to give a different characterization of the Poisson process and need some preparations. Let (fi, A, P) be a probability space and (7t)t>o be a filtration in A which is complete and right-continuous. In addition let (Tk)k>o be a strictly increasing sequence of non-negative random times, Tfc : fi —> [0, oo] with To = 0 almost surely, i.e. we have Tfc(w) < Tfc+i(a>) almost surely. Definition 3.7.11. We call the stochastic process (Nt)t>o denned on (fi, A, P) by Nt(u) := J2 AX{t>rfc(w)}, A > 0,
(3.200)
fc>i
the counting process associated with the sequence (Tk)ken and A. With T(w) := sup Tfc (u) < oo being the explosion time of (Nt)t>o we define [TfcH.oo) := {{t,u);Nt(u>) > k}, [Tk(u),Tk+1(u;)) := {(t,u);Nt(w) = k}
(3.201) (3.202)
and [T(w), oo) := {(t,w); Nt(u>) = oo}.
(3.203)
If T = oo almost surely we call (Nt)t>o a counting process without explosion. The increments of (iVt)t>o are given by Nt-Ns
= ^2\X{3
and Nt~^Na counts the numbers of random times falling into (s,i\. Thus v — E{ *~^ t - 1 ) gives the expected number of jumps in a time interval of length 1. It is easy to see that a counting process (Nt)t>o is adapted to a filtration (J7t)t>o if and only if the defining sequence of random times (Tk)ken0 is adapted. Now we can prove T h e o r e m 3.7.12. The Poisson process (Xt)t>o with symbol given by (3.199) (and therefore the characteristic exponent is ijj(£) = v(l — e%x^)) and with initial
3.7 Levy Processes and Translation Invariant Feller Semigroups
127
distribution e0 is a counting process without explosion and jumps of size A. In addition it holds E{Xt) = Xvt, V(Xt) = X2vt.
(3.204)
Proof. Since (3.204) follows from (3.198) we need to establish the path properties of (Xt)t>o which we already assume to be a cadlag process. Prom (3.198) we find that P(Xt = Xk) = ^ e " " * and therefore for every countable set Q C [0, oo) it follows that P(Xt e AN0; t G Q) = 1. Thus, if Q is dense in [0, oo) the cadlag property implies that almost surely (Xt)t>o takes only values in ANo- In addition, since Pxt+s-xt = Pxs and since Xs > 0 a.s., it follows that the paths of (Xt)t>o are almost surely nondecreasing functions. Hence we have established that {Xt)t>o has (a version with) values in ANo and only positive jumps. It remains to prove that almost surely these jumps have the size A > 0 and that there are only finitely many jumps in finite time. As usual we denote by Xt- the left limit of Xt. We are going to show that P ( sup (Xt - Xt-) < A) = 1. 0
For the cadlag version of any Levy process we have always P(\Xt - Xt.\ > 0) = 0 for all t > 0, i.e. there are almost surely no fixed jumps. Thus for t G Q+ we first observe that P(Xt - Xt- > 0) = 0 and it follows that sup (Xt — Xt-) = lim
0
max (Xk_ — Xk^x) a.s., m m
irnooKKm
and further P( max ( I , - Xk-i)
< A) = P(Xx. < \)m = e~» (l + -)m -» 1
as m —» oo which proves the theorem.
•
128
Chapter 3 Feller Processes For (Xt)t>o as in Theorem 3.7.12 the following times are stopping times To
= 0 , n := inf{i > 0 ; Xt - Xt- = A},
Tfc+i := inf{£ > Tfe ; Xt - Xt- = A} and we have
fc>l For smooth functions, for example u € <S(R), we may calculate the generator and find of the Feller semigroup (Tt)t>0 , Ttu{x) = Ex(u(Xt)), Au(x) =
-(2TT)-5
I eixt{v{l
= v(u(x — A) -
- e - iAf ))i2(C)dC
(3.205)
u(x)),
i.e. A is a difference operator. Our next aim is to find an analog to a Poisson process when the state space is R n . It turns out that the first idea to consider instead of (3.199) the continuous negative definite function
1>(£) = v(l - e- iA '«), A e (R+)n,Z e Rn, is not very successful. Instead we suggest to consider a convolution semigroup (nt)t>o on R™ satisfying MO = (27r)-t e -"'( 1 -( 2 -) t v(«))
(3.206)
where v > 0 and
3.7 Levy Processes and Translation Invariant Feller Semigroups
129
Recall Theorem 2.4.11 which together with the convolution theorem yields that for independent random variables Y j , . . . , Ym we have
(PYl+...+Ym)A =
((2^)mPYl.....Pym.
Thus we may interpret ((2?r) ?<£>(£)) as the Fourier transform of the distribution of the sum Sk = Y\ 4- ... + Yk of independent random variables with the same distribution, namely a. Now, let (Yi)ieN be independent random variables on some probability space (fl,A,P) with the same distribution a and let us suppose that c({0}) = 0. We set Sk := Ylt=o ^ where YQ = 0. Further let {Nt)t>o be a Poisson process with intensity v and jumps of size 1 defined on (fi, A, P) and independent of ODieN- Consider the process (3.208)
Xt = SNt. For B € B^
the independence of (Yj)/eN and (Nt)t>o yields oo
P(Xt €B) = P(SNt € B) = Y; P(Nt = k)P(Sk G B) k=0
which gives
k=0
Thus we arrive at Theorem 3.7.13. Let (Yi)iG^ be a sequence of independent random variables with values in 1™ defined on the probability space (Cl, A, P) with identical distribution a,
130
^
Chapter 3 Feller Processes
It is easy to determine the Levy-Khinchine formula for the continuous negative definite function
£_>,,(l-(27r)MO). In fact, since we have 1/(1 - ( 2 T T ) M O ) = v(v(Rn) - (27r)*(Fa)(O) = / (I - e-™*)v
(l-e-ix<)ua{dx),
=[
n
JU \{0}
where we used for the last line that cr({0}) = 0, it follows with 1 + \x 2 l 2 /x(da:) := va(dx), \x compare (1.3.183), that ^(l-(27r)^(O) =i(d • 0 + f kn\{0}\
=**•*)+[ JK"\{O}
(l- e~ix< -
lX
''*•' W ( d a : ) l + \x\2) K '
(3.209)
l
V
(l-e-<-^) -±^^x), l + | a ; / \x\ 2
2
where i/ij . , . f Xj 1 + |x| 2 ^—7:(T(Ax) = I f-pr—;—p3—H(dx). 2 7H-\{0} i + M A"\{o> i + M 2 l^l2
, /" d,- = /
When we denote by (X\3 )t>o the j t h coordinate process and by yfe component of 1^, a straightforward calculation yields E(X^) and
=
(2n)ntu^=0
the j t h
3.7 Levy Processes and Translation Invariant Feller Semigroups provided &
£=0
131
exists. In this case we find
E{X{ts)) = tuE{Y^)
= t f xjt/
note that ua is the Levy measure associated with the continuous negative definite function v(l - (2w)%ip(-). The process (X[ )t>o changes only by jumps X\3 — X\_ which are distributed by prj (a), i.e. the image of a under jrrj, and the expected number of jumps in a unit interval is v. Thus we have here a first indication that the Levy measure contains information on the structure, more precisely, on the jumps, of the paths of a Levy process. We will return to this point in Section 3.8. Let (Tt)t>o be the operator semigroup, say on Coo(]Rn), associated with the compound Poisson process discussed in Theorem 3.7.13. For its generator A we find on S(Rn) -Au(x) = (2TT)-? / eixiv(l = (2TT)-2
/
eixt f
r
JM"\{O}
or Au(x)
(1 - e-iv*)vo(dy)u(Z) d£
= (27r)-*/" f. JK"\{0} 7R"
= /
(2TT)I
elxS{l-e-iyS)u{t)dZv(T{dy)
{u{x) - u(x - y)) v{dy),
= / (u(x -y)JR"\{0}
u(x)) i/a(dy)
(3.210)
which for a(dy) = £\{dy) reduces to (3.205). The compound Poisson process has the interpretation of a time-changed process: From (Sk)k>i we pass to (Xt)t>o = (<5Vt)t>o- We will now turn to a new interpretation of subordination in the sense of Bochner, compare 1.3.9 and 1.4.3, in the context of Levy processes and time-changed processes. For this let (rjt)t>o be a convolution semigroup on R with supp r\t C [0, oo) for all t > 0. We denote by / the corresponding Bernstein function, see Theorem 1.3.9.7, i.e. f}t(y) = (27r)-ie-*^i»>
132
Chapter 3 Feller Processes
or
where C denotes the Laplace transform. Denote the cadlag version of the Levy process associated with (rjt)t>o and which is starting at 0 G M by (5t)t>o- It follows for t > s > 0 that P(St -SseA)
= P(St-t eA) = TH-a(A)
implying that (St)t>o is an almost surely increasing process obtaining its values only in [0, oo). Conversely, if (St)t>o is a Levy process with almost surely increasing paths starting at 0 G K, then we find for the corresponding convolution semigroup (rjt)t>o on K that Tfc((-oo,0)) = P(St G (-oo,0)) = 0, i.e. supp rjt C [0,oo). Definition 3.7.15. A Levy process with state space M and almost surely increasing paths starting at 0 G K is called a subordinator. Next let {Xt)t>o be a Levy process with state space R" associated with the convolution semigroup (/it)t>o a n d the continuous negative definite function V> : K n -» C, i.e.
ft(fl = (2W)-*c-**tt). In addition let us assume that (St)t>o and (X t )t>o are defined on the same probability space and that they are independent. Definition 3.7.16. Let (Xt)t>o and (<St)t>o t"e a s above. The stochastic process Yt{w) := XSt{u){v)
(3-211)
is said to be the process obtained from (Xt)t>o by subordination with respect to (St)t>o, or shortly the subordinate process. L e m m a 3.7.17. Let (Yt)t>o be the process subordinate to (Xt)t>o by (St)t>oThen it holds P(Yt G B) = [ Hs(B)rit(ds). Jo+
(3.212)
3.7 Levy Processes and Translation Invariant Feller Semigroups
133
Proof. The independence of (X t ) t >o and (St)t>o implies P(Yt GB)= P(XSt G B) /•oo
= /
Jo
P(XS e B\St = s)ds
= I™ P(XS £ B)r)t(ds) Jo = [ Jo
n.(B)TH(d3).
n
From Proposition 1.3.9.10 or more easily from Remark 1.3.9.11 we find from (3.212) that
(3.213)
P(Yt€B)=rf(B), i.e. we have
Theorem 3.7.18. Let (Xt)t>o and (St)t>o be as in Definition 3.7.16. The subordinate process (Yt)t>o is a Levy process corresponding to the convolution semigroup (fJ-{)t>o- The generator of the corresponding Feller or Lp-subMarkovian semigroup restricted to S(R") is given by Au(x) = - ( 2 T T ) - * /
e te «/(tf(O)«(Od£.
(3.214)
compare 1.4-3 or 11.2.9. Remark 3.7.19. Let {St)t>o be a subordinator with associated Bernstein function / , ,oo
(1 - e-xs)v{ds)
(3.215) ./o and let (Xt)t>o be a Levy process with state space R" associated with the convolution semigroup (fit)t>o , Mt(£) = (2ir)~^e~t^\ The Levy measure of the continuous negative definite function / o ip is given by f(x)=a + bx+
/•OO
af =b(i+ / ntv{dt) (3.216) Jo where /J, is the Levy measure associated with tjj and the integral is understood in a vague sense (compare Remark 1.3.9.11). For a proof of this result we refer to Chr. Berg and G. Forst [35], p.175, or K. Sato [310], p.l98ff.
134
Chapter 3
Feller Processes
We want to discuss one class of subordinate Levy processes in more detail, namely certain subordinate Brownian motions. By definition Brownian motion is the Markov process associated with the Brownian semigroup, i.e. the convolution semigroup associated with the continuous negative definite function £ l~^ l£|2- If wefixthe initial distribution we obtain a Levy process. The corresponding continuous negative definite function is of course again the function £ H~> l£|2> £ € ^™- The subordinate processes we are interested in are those subordinate to Brownian motion which do not have a killing or a diffusion part, i.e. according to Theorem 1.3.9.26 the continuous negative definite function associated with such a process is of the form 1>(t)= [
n
JR \{0}
(I - cos(y • O)m(\y\2)dy
(3.217)
where m(r) = [ e" r V(ds) Jo+ and v is a measure on (0,oo) such that J^s~^u(ds) < oo and 1 fx s~%~ v(ds) < oo. The corresponding Bernstein function / is then given by /(r) = /"°°(1 - e- rs )(47r S )t$(^)(d s ),
(3.218)
where ${v) is the image measure of v with respect to the mapping SH->$(S) = -L.
If (Tt)t>o denotes the operator semigroup on CooQR") or Lp(Mn) associated with such a Levy process we find on 5(R") for its generator A -Au(x) = (2TT)-? /
eix«V(O«(Od£
= (2TT)-* /
efa« /
= (2TT)-» /
(f
f = /
u(x + y) + u(x-y)\
VR"\{0}
( \u{x) V
(1 - cos(y • 0)m(\y\2) dy u{£) d£ efa«(l - cos(y • O)u(O^) m(\y\2)dy 0
I
L
. 2> )m(\yY)dy,
J
3.7 Levy Processes and Translation Invariant Feller Semigroups
135
or, using the symmetry of m(|-| 2 ),
Au(x) = /
n
(u(x + y) - u(x))m(\y\2)dy.
JR \{0}
In case where {r]f)t>o is the one-sided stable semigroup of order a € (0,1) we find
(3.219) i.e. ( j
~
Trfr(l-a)
r «+f
-^^a+f-
Thus on 5(M") we find
The corresponding stochastic processes are called symmetric stable processes (of order a). For a = \, i.e. £ H-> |£|, the corresponding process is of course the Cauchy process (Xt)t>o- Most important for us is the observation that the Cauchy process has no expectation since S(l*,l)=r(^)/i>w'W2)!ifldI
=
oo.
(3.220,
The Cauchy process is the Levy process with symbol £ i-> |£|. We are going to discuss now in detail a one-dimensional Levy process, the Meixner process, < Ai holds for some having a symbol £ i-> V ' M ( 0 such that A0 < 1+ |^jS| 0 < Ao < Ai, but which has many different properties than the Cauchy process, for example it has finite expectation. Thus already in the realm of Levy processes partly our philosophy that processes with comparable symbols have comparable properties break down, while of course other parts of this philosophy work very well, compare for example the following Proposition 3.7.21. In the following discussion of the Meixner process we rely mostly on the paper [52] by B. Bottcher and our joint paper [54]. However we emphasize that the original sources are B. Grigelionis' paper [131], W. Schoutens [325] and W. Schoutens and J. Teugels [326].
136
Chapter 3 Feller Processes
Definition 3.7.20. A real-valued Levy process with symbol
Vv*,a,b(0 = - i m £ + 2 6 ( l o g c o s h ( ° * ~ l b J - l o g c o s f - J J , £ e R, (3.221) where m e t , 5 > 0,a > 0 and — IT < b < •n is called a Meixner process. A Meixner process (X™1 'a' ) t > 0 has a density with respect to the Lebesgue measure A ^ given by (3.222) and for its finite expectation we find E(Xm,5,a,bj
= aSt t a n
I
+ mt)
(3.223)
and its variance is given by Var(X--) . ^
^
.
(3.224)
Further we find ReVw,a,&(0 = <^log(cosh(^) - sin 2 (^)) - 25 log cos (^) and
Im ipm,s,a,b(O = -m^ + 25arctan^-tanf-Jtanh^-r-JJ. Moreover it follows that
ReW<W>(£)>yl£l
(3-225)
for £ G R, |C| > ^ , as well as for some c0 > 0 |Im VmAa,6(01 < CO (1 + R e VmAa,b(0) , £ G »•
(3-226)
In addition it follows that |V- m Aa,6(0l
(3.227)
3.7 Levy Processes and Translation Invariant Feller Semigroups
137
implying with suitable constants 0 < Ao < Ai that Ao
<
l
+ -
(3228)
holds. Hence (X(m' '"' )t>o has a symbol comparable with the symbol of the Cauchy process, but (Xtm'(5'a'b)t>o has a finite expectation contrary to the Cauchy process. Therefore it does not make sense to try to get a pointwise comparison of corresponding transition functions: we will lose the integrability in case of the Meixner process! As a direct consequence of (3.226) and (3.227) we find by an application of Example 1.3.7.32 Proposition 3.7.21. The Meixner process (X™'S'a'b)t>o is associated with the non-symmetric Dirichlet form given on S(M.n) by
(3-229)
£(u,v) = [ 1>m,s,a,b(£)v(£)W)#-
Its domain D{£) is the classical Sobolev space H?(M.), hence (£,D(£)) is regular, and on //^(R) we have
£(u, v) =d f ^P-v(x)dx + \f JR
$ (u(x) - u(y)) (v(x) - v(y))
&X
I JR JR
Seb^)
, ,
•; r7-IMEVI (x — y)smh K a '
ydx
(3.230)
Remark 3.7.22. A. Prom (3.228) we derived that D{£) = H*(R) and in fact we have that £\(u, v) = £(u, v) + (u, v)0 is on H* (R) equivalent to the Dirichlet form (£C,H*(R)) associated with the Cauchy process in the sense that Xo£i(u,u) < £i{u,u) < \i£i(u,u) holds for all u G H* (W). Hence here our philosophy works very fine. B. We refer to 1.4.7, especially pp 417-18, where we discussed a representation of the drift part in (3.230) on ifi(R) with the help of fractional derivative, compare also [198].
138
Chapter 3 Feller Processes
Remark 3.7.23. A further Levy process of considerable interest, see 0 . Barndorff-Nielsen [22] and 0 . Barndorff-Nielsen and S. Levendorskii [25], is the normal inverse Gaussian process which has the symbol "0NIG(O
= -«m£ + 5(^a? ~(b + iO2 - Va2 - 62),£ e R,
(3.231)
where 0 < \b) < a, 5 > 0 and m £ R. Again as in the case of ipm,6,a,b the symbol V'NIG is comparable with the symbol of the Cauchy process but it has a finite expectation. Moreover its transition function has the density Pt{x)
=
£ ew^+Kx-mt)
V
V
^ t >)t
(3 232)
where
which differs much from (3.222). Thus we face the situation that |£|~V>NiG(£)~tfw,«,6(0
(3.233)
but one should not long for a pointwise comparison of the corresponding transition densities. Our final example of a Levy process is the most important Markov process of all — Brownian motion. As already mentioned the n-dimensional Brownian motion is the Levy process with symbol |£|2,£ £ M.n. Instead of listening some of the many known properties of Brownian motion or to give credit to its importance by quoting some results, we refer to A. N. Borodin's and P. Salminen's "Handbook of Brownian Motion" [51]. Within our considerations Brownian motion is an outsider: it has continuous paths and its analysis is related to an elliptic differential operator, i.e. to a local operator, namely the Laplacian. Again, we do not intend to make a lot of remarks to the interplay of second order elliptic differential operators and diffusion processes, here are just three references: R. Bass [27], L. C. G. Rogers and D. Williams [301]-[302], and D. Stroock and S. Varadhan [351]. However we want to supply a nice short proof due to R. Schilling [312] of the fact that Brownian motion has almost surely continuous paths using as assumption that it is already known that Brownian motion is a cadlag process. The latter fact follows indeed from our previous considerations.
3.7 Levy Processes and Translation Invariant Feller Semigroups
139
In the following let (Xt)t>o be a stochastic process on some probability space (fi, A, P) with state space (E™, B^). In addition we assume that it has almost surely cadlag paths, i.e. there exists a set M € A such that P(Af) = 0 and for all w £ Afc the mapping t *—> Xt(oj) is a cadlag function. For a partition II = {to,ti,... / C [0, oo) and (3 > 0 we define
,tk},to
< £i < . . . < £ & , of an interval
k
var^((X t ) t >o,/,n)( W ) = ^T\Xtj(uj) - Xti_x{u>)f.
(3.234)
Further we set J{t,u>) := Xt{uj) - Xt-{u)
:= Xt{uj) - limX s (w),
(3.235)
i.e. J(t,u) gives the size of a jump of the path s H-> XS(UJ) at time t. Let ( I I ^ g N , 11^ = {*o J*I '•••>*j(i/)}i ^ e a sequence of partitions of / . If II,, C Uu+i and if the meshes, mesh(IIy) := max (t^ — tj2\), of the par\<3
titions tend to zero as v —> oo, then we say that the sequence of partitions (IIJ / )^ € N becomes dense in I. Lemma 3.7.24. Let {Xt)t>o be a cadlag process with state space (M",S^"^) as above. For allT > 0 and for any sequence of partitions of[0,T] which becomes dense in [0, T], we have for almost all w 6 Q. Y \J{t,w)f t
< liminf var /3 ((X t )t>o, [0,T\,Hv){u). "-*°°
(3.236)
Proof. A cadlag function is bounded on bounded intervals and the number of jumps on [0, T] with size larger than e > 0 is finite, compare Section 3.3. Thus for w € Q,\Af,P(Af) = 0, there exists only a finite number N = N(u) = NT,e{u>) of jumps of 11-> Xt{u>) larger than e, i.e. \J(t,u/)\ > e. These jumps occur at (random) times T\{UJ) < ... < TJV(W). Fix w e fi\A/" and choose i/ such large that Tj{u>) is contained in the interval (im]_ 1 ,im]] or
140
Chapter 3 Feller Processes
[ O , ^ ] . Now it follows that
V
| J(t, uj)f = V liminf X&) (LJ) - X&) (UJ) < lim V XM - XW) 1/-.00 r—f
Xm
i
tm
< liminf var / j((Jf t ) t >o,
i-i
[0,T\,Uv).
Since the right-hand side is independent of e, the lemma follows as e —> 0.
•
Theorem 3.7.25. Let (Xt)t>0 be a cddldg process with state space (M.n,B^) as above. In addition assume that E(\Xt - Xsf)
< co|t - s\1+a
(3.237)
holds for all s,t > 0 and some constants a,/3,co > 0. Then almost all sample paths 11—> Xt(u>) are continuous. Proof. Let T > 0 be fixed an choose a sequence of partitions (Tl^)uS^, !!„ = {t^,... ,t|rj)}, of [0,T] that becomes dense. Applying Lemma 3.7.24 and Fatou's lemma we find
E(y2\J(t,-f) t
< sfliminfvar^((Xt)t>o,[O,r],nv)) "-00
< liminf £(vai7j(pr t )t>o, [0,T],n y ))
l{v)
^coliminfVl^-^
1+
< coliminf^eshCn,))" VftJ^ - &\) < coTliminf^esh^))11 = 0. V—»OO
3.8 A Summary of Some Path Properties of Levy Processes
141
Thus for T > 0 exists AfT e A, P{MT) = 0, such that for w e U\AfT the path t >-> Xt(w) has no jumps in [0,T]. Therefore, if {Tk)ke® is a sequence, Tfc > Tfe-i > 0, such that lim Tk — oo, we find for the set No = WkLi-^n k—»oo
that P(A/o) = 0 and for w € N§ the path 11-> X4(w) is continuous.
D
Now we can prove Corollary 3.7.26. An n-dimensional Brownian motion (Xt)t>o has almost surely continuous paths. Proof. The result will follow from Theorem 3.7.25 once we have proved £(|Xt-Xs|4)
(3.238)
But for 0 < s < t we have
[ |x|4Pxt-xs(dx)
E(\Xt~Xs\4)=
- / \x\4PXt_a(dx)
= f MVt-s(dz) =
1
f
(47r(i-s)) J^
=,
(t
" s)2 .(t-^k-^d,
(47T(t - S))
=
C l
2
•/
2
| t - S| ,
and the corollary is proved.
3.8
| a ,(2
w I n \x\Ae~'^r^dx 2
•
A Summary of Some Path Properties of Levy Processes
The analysis of the sample paths of a stochastic process is one of the core subjects in the field, and a lot of results are known for Levy processes. Our main interest in this monograph is to deduce from a certain comparison of a negative definite symbol q(x,£) with a fixed continuous negative definite function ip a comparison of properties of the process (-X't)t>o having q(x, £) as
142
Chapter 3 Feller Processes
its symbol (see (1.03)) with properties of the Levy process (Yt)t>o associated with ip. Since there are several good monographs and surveys dealing with paths properties of Levy processes we decided not to rework these results in detail, but to give a summarizing discussion, pointing out the concepts and results but not providing all proofs. Certainly we will give very precise references. Our topic is the Levy-Ito decomposition of the sample paths of a Levy process. This will give us also a deeper probabilistic understanding of the Levy-Khinchin formula, compare 1.3.7, especially Theorem 1.3.7.7. We follow in our presentation the monograph of K. Sato [310], but refer also to the notes. We need a few conventions to start with: We set No := No U {oo} = N U {0} U {co}, and we say that a random variable X is Poisson distributed with mean 0 (with mean +oo) if X = 0 almost surely (if X = +oo almost surely). Definition 3.8.1. Let (£l°,A°,P°) be a fixed probability space and (S,5,
G S, is a Poisson-distributed random variable with mean
ii) if Bi,... ,Bk S <S are mutually disjoint, then the random variables iV(Bi)(.),..., N{Bk){-) are independent; iii) for every w g 0° a measure on S is given by N(-)(w) : 5 ^ I
+
,BM
N(B)(LJ).
If {N(B); B 6 S} is a Poisson random measure we use often the notation N(B,w) instead of N(B)(u), and consequently we will write N(dx,uj) for N(dx)(u)). The existence of a Poisson random measure is granted by the following proposition, compare K. Sato [310], Proposition 19.4, for a proof. Proposition 3.8.2. For any cr-finite measure space (S,5,cr) there exists on some probability space (fi°,.4 0 ,P 0 ) a Poisson random measure on £ with intensity measure a.
3.8 A Summary of Some Path Properties of Levy Processes
143
Further we have, following K. Sato [310], Proposition 19.5, Proposition 3.8.3. Let (E, <S, a) be a finite measure space and {N{B); B £ <S} be a Poisson random measure with intensity measure a and underlying probability space (Q,°,A°,P0). For a measurable function u : £ —» R" we define the mapping Y : ft0 -> Rn by (3.239)
Y(w) := [ u(x)N(dx,u). JT.
Then Y is a random variable, i.e. it is measurable, and we have i) the random variable Y is compound Poisson distributed with characteristic function Ay : K™ —> C given by A y (O=exp(/ 1 ( e i «^-l)a(da ; ) N ) )f
{
= exp (j yt-x _ l)au(dx)\ ,
(3-240)
where au is the image measure of a under u; ii) ifue
L2(E,a) then E(\Y\2) < oo and E{Y)=
(3.241)
f u(x)a{dx)
as well as Var(r) = E(\Y - E{Y)\2) = f \u(x)\2a(dx); Hi) for mutually disjoint sets B\,..., Yi{w):=
f u(x)N(dx,u;),l
B\. £ S the random variables =
l,...,k,
JBi
are independent. For 0 < f l < f c < o o w e write AO)b := A(a, b] := {x € Kn; a < \x\ < b} and AaiOO := A(a,oo) := {x e l ° ; a < |a:| < oo},
(3.242)
144
Chapter 3 Feller Processes
which yields A0,oo = K n \{0}. In addition we set H := (0,oo) x R"\{0} = (0,oo) x A0]OO. The Borel cr-field of H is denoted by B(H); a typical point h G H has components s and x, i.e. h = (s,x). If Q is a mesasure on B{H) we write for the corresponding integrals
f f(h)g(dh)= f
J(0,oo)xA 0 ] 0 0
JH
f(s,x)g(d(s,x)).
Following K. Sato [310], p.120, we state now Theorem 3.8.4 (Levy-Ito-Decomposition). Let (Xi)t>o be a Levy process on the probability space (fl, A, P) with state space M n and Levy triple (Q, d, v). On B(H) we define the measure v by v((0, t]xB) = tu(B) , B G B(n).
(3.243)
Further let QQ C fl,P(flo) = 1, be a set such that for all a; G f2o the paths t H-» Xt(uj) are cddlag functions. For C G B(H) we define (3.244) Then it holds i) by {J{C); C G B(H)} a Poisson random measure with intensity measure v is given, ii) for some set fii C £l,P{Vl{) — 1, we may define for all LJ G fii and t G [0, oo)
X}(u>) := lim / {xJ(d(s,x),w) -oy ( o,*]x A ( e ,i) + /
J(0,t]xA(l,oo)
-
xv(d(s,x))} (3>245)
xJ(d(s,x),Lj)
and the limit is uniform with respect to t on bounded intervals. Furthermore (Xt)t>Q is a Levy process with state space M.n and Levy triple (0,0,1/)/
3.8 A Summary of Some Path Properties of Levy Processes
145
Hi) for u> € Qi we define X?{LJ)
:= Xt(w) -
X](LO)
(3.246)
and there exists a set 0.2 C fi, P{0.2) = I, such that for all w £ f22 the path t i-> X?(UJ) are continuous. The process (X?)t>o is a Levy process with state space Rn and Levy triple (Q, d, 0); iv) the two processes (Xf)t>o and (X^)t>o are independent. Thus we have decomposed the Levy process (Xt)t>o into the sum of two independent processes (X})t>o and (Xf)t>o '•
(3.247)
Xt = Xl + X},
where one process is a pure jump process and the other has continuous paths. Remark 3.8.5. A. A proof of Theorem 3.8.4 is given in K. Sato [310], §20. B. Since the Levy triple (Q,,d,v) is in general not unique, compare Remark 3.7.10, the decomposition (3.247) is not unique either. But of course, once (Q, d, v) is fixed, then it is unique with respect to this Levy triple. Definition 3.8.6. A. Let (Xt)t>o be a Levy process with state space R™ and decomposition (3.247). We call (X^)t>o its jump part (with respect to the given Levy triple (Q,d, v)) and (X?)t>o its continuous part (with respect to the given Levy triple (Q, d,v)). B. The limit lim /
e-»0 7(0,t]xA(e,l]
{xJ(d(s,x),w) - xV(d(s,x))}
is called the compensated sum of jumps. If the Levy measure v of the process (Xt)t>o satisfies the additional condition r .<1|a;|j/(da;) < 00, then we may decompose (Xt)t>o a bit differently and will have a unique decomposition into jump and continuous part. Again we quote K. Sato [310], p.121. Theorem 3.8.7. Suppose that {Xt)t>o is a Levy process with state space R n and for its Levy measure v we assume
/ J\x\
IzKdz) < 00.
(3.248)
146
Chapter 3 Feller Processes
Further let ^ i and J{B,w) be defined as in Theorem 3.8.4. Then there exists a set fl3 c fii,P(fi3) = 1 such that X?{u)=
I
xJ(d(s,x),uj)
(3.249)
is defined for all t > 0 and {Xf)t>o is a Levy process with state space Mn and characteristic exponent f (e-ix^
(3.250)
- l)u(dx).
In addition for ui £ $72 n O3, JI2 as in Theorem 3.8.4, the process
Xfa) := Xt(w) - X?(u) has continuous paths, i.e. t *—» X^(w) is continuous for to E fiinf)3. Moreover the two processes (Xf)t>o and (Xt4)t>o are independent.
3.9
The Symbol of a Feller Process
When we combine Example 3.2.8 with the considerations preceeding Corollary 3.2.13, see p. 59-60, we find that every Feller semigroup (T"t)t>o on Coo(]R") gives rise to a Feller process {{Xt)t>o, Px)xemri• (In c a s e of non-conservative semigroups we have first to work in the one-point compa