OX FO R D G R A D U AT E T E X T S I N M AT H E M AT I C S
Series Editors R. COHEN S.K. DONALDSON S. HILDEBRANDT T . J . LY O N S M . J . TAY L O R
OX FO R D G R A D U AT E T E X T S I N M AT H E M AT I C S
Books in the series 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.
Keith Hannabuss: An introduction to quantum theory Reinhold Meise and Dietmar Vogt: Introduction to functional analysis James G. Oxley: Matroid theory N.J. Hitchin, G.B. Segal, and R.S. Ward: Integrable systems: twistors, loop groups, and Riemann surfaces Wulf Rossmann: Lie groups: An introduction through linear groups Qing Liu: Algebraic geometry and arithmetic curves Martin R. Bridson and Simon M. Salamon (eds): Invitations to geometry and topology Shmuel Kantorovitz: Introduction to modern analysis Terry Lawson: Topology: A geometric approach Meinolf Geck: An introduction to algebraic geometry and algebraic groups Alastair Fletcher and Vladimir Markovic: Quasiconformal maps and Teichmiiller theory Dominic Joyce: Riemannian holonomy groups and calibrated geometry Fernando Villegas: Experimental Number Theory P´ eter Medvegyev: Stochastic Integration Theory
Stochastic Integration Theory P´eter Medvegyev
1
3 Great Clarendon Street, Oxford OX2 6DP Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Shanghai Taipei Toronto With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan Poland Portugal Singapore South Korea Switzerland Thailand Turkey Ukraine Vietnam Oxford is a registered trade mark of Oxford University Press in the UK and in certain other countries Published in the United States by Oxford University Press Inc., New York c P´ eter Medvegyev, 2007 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2007 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above You must not circulate this book in any other binding or cover and you must impose the same condition on any acquirer British Library Cataloguing in Publication Data Data available Library of Congress Cataloging in Publication Data Data available Typeset by Newgen Imaging Systems (P) Ltd., Chennai, India Printed in Great Britain on acid-free paper by Biddles Ltd., King’s Lynn, Norfolk ISBN 978–0–19–921525–6 1 3 5 7 9 10 8 6 4 2
To the memory of my father
This page intentionally left blank
Contents Preface
xiii
1 Stochastic processes 1.1
1.2
1.3
1.4
1
Random functions
1
1.1.1 Trajectories of stochastic processes
2
1.1.2 Jumps of stochastic processes
3
1.1.3 When are stochastic processes equal?
6
Measurability of Stochastic Processes
7
1.2.1 Filtration, adapted, and progressively measurable processes
8
1.2.2 Stopping times
13
1.2.3 Stopped variables, σ-algebras, and truncated processes
19
1.2.4 Predictable processes
23
Martingales
29
1.3.1 Doob’s inequalities
30
1.3.2 The energy equality
35
1.3.3 The quadratic variation of discrete time martingales
37
1.3.4 The downcrossings inequality
42
1.3.5 Regularization of martingales
46
1.3.6 The Optional Sampling Theorem
49
1.3.7 Application: elementary properties of L´evy processes
58
1.3.8 Application: the first passage times of the Wiener processes
80
1.3.9 Some remarks on the usual assumptions
91
Localization
92
1.4.1 Stability under truncation
93
1.4.2 Local martingales
94 vii
viii CONTENTS 1.4.3 Convergence of local martingales: uniform convergence on compacts in probability
104
1.4.4 Locally bounded processes
106
2 Stochastic Integration with Locally Square-Integrable Martingales 2.1
2.2 2.3
2.4
108
The Itˆo–Stieltjes Integrals
109
2.1.1 Itˆ o–Stieltjes integrals when the integrators have finite variation
111
2.1.2 Itˆ o–Stieltjes integrals when the integrators are locally square-integrable martingales
117
2.1.3 Itˆ o–Stieltjes integrals when the integrators are semimartingales
124
2.1.4 Properties of the Itˆ o–Stieltjes integral
126
2.1.5 The integral process
126
2.1.6 Integration by parts and the existence of the quadratic variation
128
2.1.7 The Kunita–Watanabe inequality
134
The Quadratic Variation of Continuous Local Martingales
138
Integration when Integrators are Continuous Semimartingales
146
2.3.1 The space of square-integrable continuous local martingales
147
2.3.2 Integration with respect to continuous local martingales
151
2.3.3 Integration with respect to semimartingales
162
2.3.4 The Dominated Convergence Theorem for stochastic integrals
162
2.3.5 Stochastic integration and the Itˆ o–Stieltjes integral
164
Integration when Integrators are Locally Square-Integrable Martingales
167
2.4.1 The quadratic variation of locally square-integrable martingales
167
2.4.2 Integration when the integrators are locally square-integrable martingales
171
2.4.3 Stochastic integration when the integrators are semimartingales
176
CONTENTS
3 The Structure of Local Martingales 3.1
ix 179
Predictable Projection
182
3.1.1 Predictable stopping times
182
3.1.2 Decomposition of thin sets
188
3.1.3 The extended conditional expectation
190
3.1.4 Definition of the predictable projection
192
3.1.5 The uniqueness of the predictable projection, the predictable section theorem
194
3.1.6 Properties of the predictable projection
201
3.1.7 Predictable projection of local martingales
204
3.1.8 Existence of the predictable projection
206
Predictable Compensators
207
3.2.1 Predictable Radon–Nikodym Theorem
207
3.2.2 Predictable Compensator of locally integrable processes
213
3.2.3 Properties of the Predictable Compensator
217
3.3
The Fundamental Theorem of Local Martingales
219
3.4
Quadratic Variation
222
3.2
4 General Theory of Stochastic Integration 4.1
4.2
4.3
4.4
225
Purely Discontinuous Local Martingales
225
4.1.1 Orthogonality of local martingales
227
4.1.2 Decomposition of local martingales
232
4.1.3 Decomposition of semimartingales
234
Purely Discontinuous Local Martingales and Compensated Jumps
235
4.2.1 Construction of purely discontinuous local martingales
240
4.2.2 Quadratic variation of purely discontinuous local martingales
244
Stochastic Integration With Respect To Local Martingales
246
4.3.1 Definition of stochastic integration
248
4.3.2 Properties of stochastic integration
250
Stochastic Integration With Respect To Semimartingales
254
4.4.1 Integration with respect to special semimartingales
257
x
CONTENTS
4.5
4.4.2 Linearity of the stochastic integral
261
4.4.3 The associativity rule
262
4.4.4 Change of measure
264
The Proof of Davis’ Inequality
277
4.5.1 Discrete-time Davis’ inequality
279
4.5.2 Burkholder’s inequality
287
5 Some Other Theorems 5.1
292
The Doob–Meyer Decomposition
292
5.1.1 The proof of the theorem
292
5.1.2 Dellacherie’s formulas and the natural processes
299
5.1.3 The sub- super- and the quasi-martingales are semimartingales
303
5.2
Semimartingales as Good Integrators
308
5.3
Integration of Adapted Product Measurable Processes
314
5.4
Theorem of Fubini for Stochastic Integrals
319
5.5
Martingale Representation
328
6 Itˆ o’s Formula
351
6.1
Itˆ o’s Formula for Continuous Semimartingales
353
6.2
Some Applications of the Formula
359
6.2.1 Zeros of Wiener processes
359
6.2.2 Continuous L´evy processes
366
6.2.3 L´evy’s characterization of Wiener processes
368
6.2.4 Integral representation theorems for Wiener processes
373
6.2.5 Bessel processes
375
Change of Measure for Continuous Semimartingales
377
6.3.1 Locally absolutely continuous change of measure
377
6.3.2 Semimartingales and change of measure
378
6.3.3 Change of measure for continuous semimartingales
380
6.3.4 Girsanov’s formula for Wiener processes
382
6.3.5 Kazamaki–Novikov criteria
386
6.3
CONTENTS
6.4
6.5
Itˆ o’s Formula for Non-Continuous Semimartingales
394
6.4.1 Itˆ o’s formula for processes with finite variation
398
6.4.2 The proof of Itˆ o’s formula
401
6.4.3 Exponential semimartingales
411
Itˆ o’s Formula For Convex Functions
417
6.5.1 Derivative of convex functions
418
6.5.2 Definition of local times
422
6.5.3 Meyer–Itˆ o formula
429
6.5.4 Local times of continuous semimartingales
438
6.5.5 Local time of Wiener processes
445
6.5.6 Ray–Knight theorem
450
6.5.7 Theorem of Dvoretzky Erd˝ os and Kakutani
457
7 Processes with Independent Increments 7.1
xi
460
L´evy processes
460
7.1.1 Poisson processes
461
7.1.2 Compound Poisson processes generated by the jumps
464
7.1.3 Spectral measure of L´evy processes
472
7.1.4 Decomposition of L´evy processes
480
7.1.5 L´evy–Khintchine formula for L´evy processes
486
7.1.6 Construction of L´evy processes
489
7.1.7 Uniqueness of the representation
491
Predictable Compensators of Random Measures
496
7.2.1 Measurable random measures
497
7.2.2 Existence of predictable compensator
501
7.3
Characteristics of Semimartingales
508
7.4
L´evy–Khintchine Formula for Semimartingales with Independent Increments
513
7.4.1 Examples: probability of jumps of processes with independent increments
513
7.4.2 Predictable cumulants
518
7.4.3 Semimartingales with independent increments
523
7.2
xii CONTENTS
7.5
7.4.4 Characteristics of semimartingales with independent increments
530
7.4.5 The proof of the formula
534
Decomposition of Processes with Independent Increments
538
Appendix
547
A
Results from Measure Theory
547
A.1 The Monotone Class Theorem
547
A.2 Projection and the Measurable Selection Theorems
550
A.3 Cram´er’s Theorem
551
A.4 Interpretation of Stopped σ-algebras
555
B
C
Wiener Processes
559
B.1 Basic Properties
559
B.2 Existence of Wiener Processes
567
B.3 Quadratic Variation of Wiener Processes
571
Poisson processes
579
Notes and Comments
594
References
597
Index
603
Preface I started to write this book a few years ago mainly because I wanted to understand the theory of stochastic integration. Stochastic integration theory is a very popular topic. The main reason for this is that the theory provides the necessary mathematical background for derivative pricing theory. Of course, many books purport to explain the theory of stochastic integration. Most of them concentrate on the case of Brownian motion, and a few of them discuss the general case. Though the first type of book is quite readable, somehow they disguise the main ideas of the general theory. On the other hand, the books concentrating on the general theory were, for me, of a bit sketchy. I very often had quite serious problems trying to decode what the ideas of the authors were, and it took me a long time, sometimes days and weeks, to understand some basic ideas of the theory. I was nearly always able to understand the main arguments but, looking back, I think some simple notes and hints could have made my suffering shorter. The theory of stochastic integration is full of non-trivial technical details. Perhaps from a student’s point of view the best way to study and to understand measure theory and the basic principles of modern mathematical analysis is to study probability theory. Unfortunately, this is not true for the general theory of stochastic integration. The reason for this is very simple: the general theory of stochastic integration contains too much measure theory. Perhaps the best way to understand the limits of measure theory is to study the general theory of stochastic integration. I think this beautiful theory pushes modern mathematics to its very limits. On the other hand, despite many technical details there are just a very few simple issues which make up the backbone of stochastic analysis. 1. The first one is, of course, martingales and local martingales. The basic concept of stochastic analysis is random noise. But what is the right mathematical model for the random noise? Perhaps the most natural idea would be the random walk, that is processes with stationary and independent increments: the so called L´evy processes, with mean value zero. But, unfortunately, this class of processes has some very unpleasant properties. Perhaps the biggest problem is that the sum of two L´evy process is not a L´evy process again. Modern mathematics is very much built on the idea of linearity. If there is not some very fundamental and very clear reason for it, then every reasonable class of mathematical objects should be closed under linear combinations. The concept of random noise comes xiii
xiv
PREFACE
very much from applications. One of the main goals of mathematics is to build safe theoretical tools and, like other scientific instruments, mathematical tools should be both simple and safe, similar to computer tools. Most computer users never read the footnotes in computer manuals, they just have a general feeling about the limits of the software. It is the responsibility of the writer of the software to make the software work in a plausible way. If the behaviour of the software is not reasonable, then its use becomes dangerous, e.g. you could easily lose your files, or delete or modify something and make the computer behave unpredictably, etc. Likewise, if an applied mathematical theory cannot guarantee that the basic objects of the theory behave reasonably, then the theory is badly written, and as one can easily make hidden errors in it, its usage is dangerous. In our case, if the theory cannot guarantee that the sum of two random noises is again a random noise, then the theory is very dangerous from the point of view of sound applications. The main reason for introducing martingales is that from the intuitive point of view they are very close to the idea of a random walk, but if we fix the amount of observable information they form a linear space. The issue of local martingales is a bit more tricky. Of course local martingales and not just real martingales form the class of random noise. Without doubt, local martingales make life for a stochastic analyst very difficult. From an intuitive, applied point of view, local martingales and martingales are very close and that is why it is easy to make mistakes. Therefore, in most cases the mathematical proofs have to be very detailed and cautious. On the other hand the local martingales form a large and stable class, so the resulting theory is very stable and simple to use. As in elementary algebra, most of the problems come from the fact that one cannot divide by zero. In stochastic analysis most of the problems come from the fact that not every local martingale is a martingale and therefore one can take expected values only with care. Is there some intuitive idea why one should introduce local martingales? Perhaps, yes. First of all one should realize that not really martingales, but uniformly integrable martingales, are the objects of the theory. If we observe a martingale up to a fixed, finite moment of time we get a uniformly integrable martingale, but most of the natural moments of time are special random variables. The measurement of the time-line is, in some sense, very arbitrary. Traditionally we measure it with respect to some physical, astronomical movements. For some processes this coordinate system is rather arbitrary. It is more natural, for example, to say ‘after lunch I called my friend’ than to say ‘I called my friend at twenty-three past and sometimes at twentytwo past one depending on the amount of food my wife gave me’. Of course the moment of time after lunch is a random variable with respect to the coordinate system generated by the relative position of the earth and the sun, but as a basis for observing my general habits this random time, ‘after lunch’, is the natural point of orientation. So, in some ways, it is very natural to say that a process is a random noise if one can define a sequence of random moments, so-called stopping times, τ 0 < τ 1 < . . . such that if we observe the random noise up to τ k the truncated processes are uniformly integrable martingales, which is exactly the definition of local martingales. The idea that local martingales are the good
PREFACE
xv
mathematical models for random noise comes from the fact that sometimes we want to perturb the measurement of the time-line in an order-preserving way, and we want the class of ‘random noise processes’ to be invariant under these transformations. 2. The second-most important concept is quadratic variation. One can think of stochastic analysis as the mathematical theory of quadratic variation. In classical analysis one can define an integral only when the integrator has bounded variation. Even in this case, one can define two different concepts of integration. One is the Lebesgue–Stieltjes type of integration and the other is the Riemann– Stieltjes concept of integration. If the integrand is continuous, then the two concepts are equal. It is easy to see, that if the integrand is left-continuous and in the Riemann–Stieltjes type integrals one may choose only the starting point of the sub-intervals of the partitions as test-point, then for these type of approximating sums the integrals of Riemann–Stieltjes type will converge and they are equal to the Lebesgue–Stieltjes integrals. One may ask whether one can extend this trick to some more general class of integrators. The answer is yes. It turns out that the same concept works if the integrators are local martingales. There is just one new element: the convergence of the integrating sums holds only in probability. If the integrators are local martingales or if they have finite variation then for this integral, the so-called integration by parts formula is valid. In this formula, the most notable factor is the quadratic co-variation [X, Y ] (t). If, for example, X is continuous and Y has finite variation then [X, Y ] (t) = 0 but generally [X, Y ] (t) = 0. As the stochastic integrals are defined only by convergence in probability the random variable [X, Y ] (t) is defined only up to a measure-zero set. This implies that the trajectories of the process t → [X, Y ] (t) are undefined. One can exert quite a lot of effort to show that there is a right-continuous process with limits from the left, denoted by [X, Y ] such that for every t the value of [X, Y ] at time t is a version of the random variable [X, Y ] (t). The key observation in the proof of this famous theorem is that XY −[X, Y ] is a local martingale and it is the only process for which this property holds and the jump-process of the process [X, Y ] is the process ∆X∆Y . The integration by parts formula is the prototype of Itˆ o’s formula, which is the main analytical tool of stochastic analysis. Perhaps it is not without interest to emphasize that the main difficulty in proving this famous formula, in the general case of discontinuous processes, is to establish the existence of the quadratic variation. It is worth mentioning that it is relatively easy to show the existence of the quadratic variation for the so-called locally square-integrable martingales. It is nearly trivial to show the existence of the quadratic variation when the trajectories of the process have finite variation. Hence, it is not so difficult to prove the existence of [X] [X, X] if process X has a decomposition X = V + H where the trajectories of V have finite variation and H is a so-called locally square-integrable martingale. The main problem is that we do not know that every local martingale has this decomposition! To
xvi PREFACE prove that this decomposition exists one should show the Fundamental Theorem of Local Martingales, which is perhaps the most demanding result of the theory. 3. The third most important concept of the theory is predictability. There are many interrelated objects in the theory modified by the adjective predictable. Perhaps the simplest and most intuitive one is the concept of predictable stopping time. Stopping times describe the occurrence of random events. The occurrence of a random event is predictable, if there is a sequence of other events which announces the predictable event. That is, a stopping time τ is predictable if there is a sequence of stopping times (τ n ) with τ n τ and τ n < τ whenever τ > 0. This definition is very intuitive and appealing. If τ is a predictable stopping time, then one can say that the event [τ , ∞) {(t, ω) : τ (ω) ≤ t} ⊆ R+ × Ω is also predictable. The σ-algebra generated by these type of predictable random intervals is called the σ-algebra of predictable events. One should agree that this definition of predictability is in some sense very close to the intuitive idea of predictability. Quite naturally, a stochastic process is called predictable if it is measurable with respect to the σ-algebra of the predictable events. It is an important and often useful observation that the set of predictable events is the same as the σ-algebra generated by the left-continuous adapted processes. Recall that a process is called adapted when its value for every moment of time is measurable with respect to the σ-algebra representing the amount of information available at that time. The values of left-continuous processes are at least infinitesimally predictable. One of the most surprising facts of stochastic integration theory is that in the general case the integrands of stochastic integrals should be predictable. Although it looks like a very deep mathematical observation, one should also admit that this is a very natural result. The best interpretation of stochastic integrals is that they are the net results of continuous-time trading or gaming processes. Everybody knows that in a casino one should play a trading strategy only if one decides about the stakes before the random events generating the gains occur. This means that the playing strategy should be predictable. An important concept related to predictability is the concept of the predictable compensator. If one has a risky stochastic process X, one can ask whether there is a compensator P for the risk of process X. The compensator should be ‘simpler’ than the process itself. Generally it is assumed that P is monotone or at least it has finite variation. The compensator P should be predictable and one should assume that X − P is a totally random process, that is X − P is a local martingale. This is of course a very general setup, but it appears in most of the applications of stochastic analysis. For a process X there are many compensators, that is there are many processes Y such that X − Y is a local martingale. Perhaps the simplest one is X itself. But it is very important that the predictable
PREFACE
xvii
compensator of X, if it exists and if it has finite variation, is in fact unique. The reason for this is that every predictable local martingale is continuous, and if the trajectories of a continuous local martingale have finite variation then the local martingale is constant. 4. Stochastic integration theory is built on probability theory. Therefore every object of the theory is well-defined only almost surely and this means that stochastic integrals are also defined almost surely. In classical integration theory, one first defines the integral over some fixed set and then defines the integral function. In stochastic integration theory this approach does not work as it is entirely non-trivial how one can construct the integral process from the almost surely defined separate integrals. Therefore, in stochastic integration theory one immediately defines the integral processes, so stochastic integrals are processes and not random variables. 5. There are basically two types of local martingales: continuous and purely discontinuous ones. The canonical examples of continuous local martingales are the Wiener processes, and the simplest purely discontinuous local martingales are the compensated Poisson processes. Every local martingale which has trajectories with finite variation is purely discontinuous, but there are purely discontinuous local martingales with infinite variation. Every local martingale has a unique decomposition L = L (0) + Lc + Ld , where Lc is a continuous local martingale and Ld is a purely discontinuous local martingale. A very important property of purely discontinuous local martingales is that they are sums of their continuously compensated single jumps. Si , by definition, is a single jump if there is a stopping time τ such that every trajectory of Si is constant before and after the random jump-time τ . The single jumps obviously have trajectories with finite variation, and as the compensators Pi , by definition, also have finite variation, the compensated single jumps Li Si − Pi also have trajectories with finite variation. Of course this does not imply that the trajectories of L, as infinite sums, should also have finite variation. If L is a purely discontinuous local martingale and L = i Li where Li are continuously compensated single jumps, then one can think about the stochastic integral with respect to L as the sum of the stochastic integrals with respect to Li . Every Li has finite variation so, in this case, the stochastic integral, as a pathwise integral, is well-defined and if the integrand is predictable then the integral is a local martingale. Of course one should restrict the class of integrands as one has to guarantee the convergence of the sum of the already defined integrals. If the integrand is predictable then the stochastic integral with respect to a purely discontinuous local martingale is a sum of local martingales. Therefore it is also a local martingale. 6. The stochastic integral with respect to continuous local martingales is a bit more tricky. The fundamental property of stochastic integrals with respect to local martingales is that the resulting process is also a local martingale. The intuition behind this observation is that the basic interpretation of stochastic integration is that it is the cumulative gain of an investment process into a randomly changing price process. Every moment of time we decide about the size
xviii PREFACE of our investment, this is the integrand, and our short term gains are the product of our investment and the change of the random price-integrator. Our total gain is the sum of the short term gains. If we can choose our strategy only in a predictable way it is quite natural to assume that our cumulative gain process will be also totally random. That is, if the investment strategy is predictable and the random integrator price process is a local martingale, then the net, cumulative gain process is also a local martingale. How much is the quadratic variation of the resulting gain process? If H • L denotes the integral of H with respect to the local martingale L then one should guarantee the very natural identity [H • L] = H 2 • [L], where the right-hand side expression H 2 • [L] denotes the classical pathwise integral of H 2 with respect to the increasing process [L]. The identity is really very natural as [L] describes the ‘volatility’ of L along the timeline, and if in every moment of time we have H pieces of L then our short term 2 change will be (H∆L) ≈ H 2 ·∆ [L]. So our aggregated ‘volatility’ is 2 in ‘volatility’ 2 H ∆ [L] H •L. It is a very nice observation that there is just one continuous local martingale, denoted by H • L, for which [H • L, N ] = H • [L, N ] holds for every continuous local martingale N . The stochastic integral with respect to a local martingale L is the sum of two integrals: the integral H • Lc with respect to the continuous and the integral H • Ld with respect to the purely discontinuous part of L. 7. As there are local martingales which have finite variation, one can ask whether the new and the classical definitions are the same or not? The answer is that if the integrand is predictable the two concepts of integration are not different. This allows us to further generalize the concept of stochastic integration. We say that process S is a semimartingale if S = L + V where L is a local martingale and V is adapted and has finite variation. One can define the integral with respect to S as the sum of the integrals with respect L and with respect to V . A fundamental problem is that in the discontinuous case, as we have local martingales with finite variation, the decomposition is not unique. But as for processes with finite variation the two concepts of integration coincide, this definition of stochastic integral with respect to semimartingales is well-defined. In the first chapter of the book we introduce the basic definitions and some of the elementary theorems of martingale theory. In the second chapter we give an elementary introduction to stochastic integration theory. Our introduction is built on the concept of Itˆ o–Stieltjes integration. In the third chapter we shall discuss the structure of local martingales and in Chapter Four we shall discuss the general theory of stochastic integration. In Chapter Six we prove Itˆ o’s formula. In Chapter Seven we apply the general theory to the classical theory of processes with independent increments. Finally it is a pleasure to thank to those who have helped me to write this book. In particular I would like to thank the efforts of Tam´ as Badics from University of Pannonia and Petrus Potgieter from University of South Africa. They read most of the book and without their help perhaps I would not have been able
PREFACE
xix
to finish the book. I wish to thank Istv´ an Dancs and J´ anos Sz´az from Corvinus University for support and help. I would like to express my gratitude to the Magyar K¨ ulkereskedelmi Bank for their support. Budapest, 2006
[email protected] medvegyev.uni-corvinus.hu
This page intentionally left blank
1 STOCHASTIC PROCESSES
In this chapter we first discuss the basic definitions of the theory of stochastic processes. Then we discuss the simplest properties of martingales, the Martingale Convergence Theorem and the Optional Sampling Theorem. In the last section of the chapter we introduce the concept of localization.
1.1
Random functions
Let us fix a probability space (Ω, A, P). As in probability theory we refer to the set of real-valued (Ω, A)-measurable functions as random variables. We assume that the space (Ω, A, P) is complete, that is all subsets of measure zero sets are also measurable. This assumption is not a serious restriction but it is a bit surprising that we need it. We shall need this assumption many times, for example when we prove that the hitting times1 of Borel measurable sets are stopping times2 . When we prove this we shall use the so-called Projection Theorem3 which is valid only when the space (Ω, A, P) is complete. We shall also use the Measurable Selection Theorem4 several times, which is again valid only when the measure space is complete. Let us remark that all applications of the completeness assumption are connected to the Predictable Projection Theorem, which is the main tool in the discussion of discontinuous semimartingales. In the theory of stochastic processes, random variables very often have infinite value. Hence the image space of the measurable functions is not R but the set of extended real numbers R [−∞, ∞]. The most important examples of random variables with infinite value are stopping times. Stopping times give the random time of the occurrence of observable events. If for a certain outcome ω the event never occurs, it is reasonable to say that the value of the stopping time for this ω is +∞. 1 See:
Definition 1.26, page 15. Definition 1.21, page 13. 3 See: Theorem A.12, page 550. 4 See: Theorem A.13, page 551. 2 See:
1
2
STOCHASTIC PROCESSES
1.1.1
Trajectories of stochastic processes
In the most general sense stochastic processes are such functions X(t, ω) that for any fixed parameter t the mappings ω → X(t, ω) are random variables on (Ω, A, P). The set of possible time parameters Θ is some subset of the extended real numbers. In the theory of continuous-time stochastic processes Θ is an interval, generally Θ = R+ [0, ∞), but sometimes Θ = [0, ∞] and Θ = (0, ∞) is also possible. If we do not say explicitly what the domain of the definition of the stochastic process is, then Θ is R+ . It is very important to append some remarks to this definition. In probability theory the random variables are equivalence classes, which means that the random variables X(t) are defined up to measure zero sets. This means that in general X(t, ω) is meaningless for a fixed ω. If the possible values of the time parameter t are countable then we can select from the equivalence classes X(t) one element, and fix a measure zero set, and outside of this set the expressions X(t, ω) are meaningful. But this is impossible if Θ is not countable5 . Therefore, we shall always assume that X(t) is a function already carefully selected from its equivalence class. To put it in another way: when one defines a stochastic process, one should fix the space of possible trajectories and the stochastic processes are function-valued random variables which are defined on the space (Ω, A, P). Definition 1.1 Let us fix the probability space (Ω, A, P) and the set of possible time parameters6 Θ. The function X defined on Θ × Ω is a stochastic process over Θ × Ω if for every t ∈ Θ it is measurable on (Ω, A, P) in its second variable. Definition 1.2 If we fix an outcome ω ∈ Ω then the function t → X(t, ω) defined over Θ is the trajectory or realization of X corresponding to the outcome ω. If all 7 the trajectories of the process X have a certain property then we say that the process itself has this property. For example, if all the trajectories of X are continuous then we say that X is continuous, if all the trajectories of X have finite variation then we say that X has finite variation, etc. Recall that in probability theory the role of the space (Ω, A, P) is a bit problematic. All the relevant questions of probability theory are related to the joint distributions of random variables and the whole theory is independent of the specific space carrying the random variables having these joint distributions. 5 This is what the author prefers to call the revenge of the zero sets. This is very serious and it will make our life quite difficult. The routine solution to this challenge is that all the processes which we are going to discuss have some sort of continuity property. In fact, we shall nearly always assume that the trajectories of the stochastic processes are regular, that is at every point all the trajectories have limits from both sides and they are either right- or left-continuous. As we want to guarantee that the martingales have proper trajectories we shall need the so-called usual assumptions. 6 In most of the applications Θ is the time parameter. Sometimes the natural interpretation of Θ is not the time but some spatial parameter. See: Example 1.126, page 90. In continuous ‘time’ theory of stochastic processes Θ is an interval in the half-line R+ . 7 Not almost all trajectories. See: Definition 1.8, page 6, Example 1.11, page 8.
RANDOM FUNCTIONS
3
Of course it is not sufficient to define the distributions alone. For instance, it is very important to clarify the relation between the lognormal and the normal distribution, and we can do it only when we refer directly to random variables. Hence, somehow, we should assume that there is a measure space carrying the random variables with the given distributions: if ξ has normal distribution then exp(ξ) has lognormal distribution. This is a very simple and very important relation which is not directly evident from the density functions. The existence of a space (Ω, A, P) enables us to use the power of measure theory in probability theory, but the specific structure of (Ω, A, P) is highly irrelevant. The space (Ω, A, P) contains the ‘causes’, but we see only the ξ (ω) ‘consequences’. We never observe the outcome ω. We can see only its consequence ξ(ω). As the space (Ω, A, P) is irrelevant one can define it in a ‘canonical way’. In probability theory, generally, Ω R, A B (R) and P is the measure generated by the distribution function of ξ or in the multidimensional case Ω Rn and A B (Rn ). In both cases Ω is the space of all possible realizations. Similarly in the theory of stochastic processes the only entities which one can observe are the trajectories. Sometimes it is convenient if Ω is the space of possible trajectories. In this case we say that Ω is given in its canonical form. It is worth emphasizing that in probability theory there is no advantage at all in using any specific representation. In the theory of stochastic processes the relevant questions are related to time and all the information about the time should be somehow coded in Ω. Hence, it is very plausible if we assume that the elements of Ω are not just abstract objects which somehow describe the information about the timing of certain events, but are also functions over the set of possible time values. That is, in the theory of stochastic processes, the canonical model is not just one of the possible representation: it is very often the right model to discuss certain problems. 1.1.2
Jumps of stochastic processes
Of course, the theory of stochastic processes is an application of mathematical analysis. Hence the basic mathematical tool of the theory of stochastic processes is measure theory. To put it another way, perhaps one of the most powerful applications of measure theory is the theory of stochastic processes. But measure theory is deeply sequential, related on a fundamental level to countable objects. We can apply measure theory to continuous-time stochastic processes only if we restrict the trajectories of the stochastic processes to ‘countably determined functions’. Definition 1.3 Let I ⊆ R be an interval and let Y be an arbitrary topological space. We say that the function f : I → Y is regular if at any point t ∈ I, where it is meaningful, f has left-limits f (t−) f− (t) lim f (s) ∈ Y st
4
STOCHASTIC PROCESSES
and right-limits f (t+) f+ (t) lim f (s) ∈ Y. st
We say that f is right-regular if it is regular and it is right-continuous. We say that f is left-regular if it is regular and it is left-continuous. If f is a real-valued function, that is if Y R in the above definition, then the existence of limits means that the function has finite limits. As, in this book, stochastic processes are mainly real-valued stochastic processes, to make the terminology as simple as possible we shall always assume that regular processes have finite limits. If the process X is regular and if t is an interior point of Θ then as the limits are finite it is meaningful to define the jump ∆X(t) X(t+) − X(t−) of X at t. It is not too important, but a bit confusing, that somehow one should fix the definition of jumps of the regular processes at the endpoints of the time interval Θ. If Θ = R+ then what is the jump of the function χΘ at t = 0? Is it zero or one? Definition 1.4 We do not know anything about X before t = 0 so by definition we shall assume that X(0−) X(0). Therefore for any right-regular process on R+ ∆X(0) X(0+) − X(0−) = 0.
(1.1)
In a similar way, if, for example, Θ [0, 1) and X χΘ , then X is rightregular and does not have a jump at t = 1. Observe that in both examples the trajectories were continuous functions on Θ so it is a bit strange to say that the jump process of a continuous process is not zero8 . It is not entirely irrelevant how we define the jump process at t = 0. If we consider process F χR+ as a distribution function of a measure then how much is the integral [0,1] 1dF ? We shall assume that the 1 distribution functions are right-regular and not leftregular. By definition9 0 1dF is the integral over (0, 1] and as F is right-regular 8 One can take another approach. In general: what is the value of an undefined variable? If X is the value process of a game and τ is some exit strategy, then what is the value of the game if we never exit from the game, that is if τ = ∞? It is quite reasonable to say that in this case the value of the game is zero. Starting from this example one can say that once a variable is undefined then we shall assume that its value is zero. If one uses this approach then X (0−) 0 and ∆X (0) = X (0+). b 9 In measure theory one can very often find the convention a f dµ [a,b) f dµ. We shall assume that the integrator processes are right- and not left-continuous, so we shall use the convention ab f dµ (a,b] f dµ.
RANDOM FUNCTIONS
the measure of (0, 1] is F (1) − F (0) = 0 so convention one can think that
1 0
5
1dF = 0. According to our
1dF = F (1) − F (0−) = F (1) − F (0) = 1 − 1 0. [0,1]
On the other hand one can correctly argue that
1dF
[0,1]
χ([0, 1])dF = 1. R
To avoid these type of problems we shall never include the set {t = 0} in the domain of integration. The regular functions have many interesting properties. We shall very often use the next propositions: Proposition 1.5 Let f be a real-valued regular function defined on a finite and closed interval [a, b]. For any c > 0 the number of the jumps in [a, b] bigger in absolute value then c is finite. The number of the jumps of f are at most countable. Proof. The second part of the proposition is an easy consequence of the first part. Assume that there is an infinite number of points (tn ) in [a, b] for which |∆f (tn )| ≥ c. As [a, b] is compact, one can assume that tn → t∗ . Obviously we can assume that for an infinite number of points tn ≤ t∗ or t∗ ≤ tn . Hence we can assume that tn t∗ . But f has a left-limit at t∗ so if x, y < t∗ are close enough to t∗ then |f (x) − f (y)| ≤ c/4. If tn is close enough to t∗ and x < tn < y are close enough to tn and to t∗ then c ≤ |f (tn +) − f (tn −)| ≤ ≤ |f (tn +) − f (y)| + |f (y) − f (x)| + |f (x) − f (tn −)| ≤
3 c, 4
which is impossible. Proposition 1.6 If a function f is real valued and regular then it is bounded on any compact interval. Proof. Fix a finite closed interval [a, b]. If f were not bounded on [a, b] then there would be a sequence (tn ) for which |f (tn )| ≥ n. As [a, b] is compact one could assume, that tn → t∗ . We could also assume that e.g. tn t∗ and therefore f (tn ) → f (t∗ −) ∈ R which is impossible.
6
STOCHASTIC PROCESSES
Proposition 1.7 Let f be a real valued regular function defined on a finite and closed interval [a, b]. If the jumps of f are smaller than c then for any ε > 0 there is a δ such that |f (t ) − f (t )| < c + ε
whenever
|t − t | ≤ δ.
Proof. If such a δ were not available then for some δ n 0 for all n there would be tn , tn such that |tn − tn | ≤ δ n and |f (tn ) − f (tn )| ≥ c + ε.
(1.2)
As [a, b] is compact, one could assume that tn → t∗ and tn → t∗ for some t∗ . Notice that except for a finite number of indexes (tn ) and (tn ) are on different sides of t∗ , since if, for instance, for an infinite number of indexes tn , tn ≥ t∗ then for some subsequences tnk t∗ and tnk t∗ and as the trajectories of f are regular limk→∞ f (tnk ) = limk→∞ f (tnk ) which contradicts (1.2). So we can assume that tn t∗ and tn t∗ . Using again the regularity of f, one has |∆f (t∗ )| ≥ c + ε which contradicts the assumption |∆f | ≤ c. 1.1.3
When are stochastic processes equal?
A stochastic process X has three natural ‘facets’. The first one is the process itself, which is the two-dimensional ‘view’. We shall refer to this as X(t, ω) or just as X. With the first notation we want to emphasize that X is a function of two variables. For instance, the different concepts of measurability, like predictability or progressive measurability, characterize X as a function of two variables. We shall often use the notations X(t) or sometimes Xt , which denote the random variable ω → X(t, ω), that is the random variable belonging to moment t. Similarly we shall use the symbols X(ω), or Xω as well, which refer to the trajectory belonging to ω, that is X(ω) is the ‘facet’ t → X(t, ω) of X. Definition 1.8 Let X and Y be two stochastic processes on the probability space (Ω, A, P). 1. The process X is a modification of the process Y if for all t ∈ Θ the variables X(t) and Y (t) are almost surely equal, that is for all t ∈ Θ P (X(t) = Y (t)) P ({ω : X(t, ω) = Y (t, ω)}) = 1. By this definition, the set of outcomes ω where X(t, ω) = Y (t, ω), can depend on t ∈ Θ. 2. The processes X and Y are indistinguishable if there is a set N ⊆ Ω which has probability zero, and whenever ω ∈ / N then X (ω) = Y (ω) , that is X(t, ω) = Y (t, ω) for all t ∈ Θ and ω ∈ / N.
MEASURABILITY OF STOCHASTIC PROCESSES
7
Proposition 1.9 Assume that the realizations of X and Y are almost surely continuous from the left or they are almost surely continuous from the right. If X is a modification of Y then X and Y are indistinguishable. Proof. Let N0 be the set of outcomes where X and Y are not left-continuous or right-continuous. Let (rk ) be the set of rational points10 in Θ and let Nk {X(rk ) = Y (rk )} {ω : X(rk , ω) = Y (rk , ω)} . X is a modification of Y hence P(Nk ) = 0 for all k. Therefore if N ∪∞ k=0 Nk then P(N ) = 0. If ω ∈ / N then X(rk , ω) = Y (rk , ω) for all k, hence as the trajectories X(ω) and Y (ω) are continuous from the same side X(t, ω) = Y (t, ω) for all t ∈ Θ. Therefore outside N obviously X(ω) = Y (ω), that is X and Y are indistinguishable. Example 1.10 With modification one can change the topological properties of trajectories.
In the definition of stochastic processes one should always fix the analytic properties like continuity, regularity, differentiability etc. of the trajectories. It is not a great surprise that with modification one can dramatically change these properties. For example, let (Ω, A, P) ([0, 1] , B, λ) and Y (t, ω) ≡ 0. The trajectories of Y are continuous. If χQ is the characteristic function of the rational numbers, and X(t, ω) χQ (t + ω) then for all ω the trajectories of X are never continuous but X is a modification of Y . From the example it is also obvious that it is possible for X to be a modification of Y but for X and Y not to be indistinguishable. If X and Y are stochastic processes then, unless we explicitly say otherwise, X = Y means that X and Y are indistinguishable.
1.2
Measurability of Stochastic Processes
As we have already mentioned, the theory of stochastic processes is an application of measure theory. On the one hand this remark is almost unnecessary as measure theory is the cornerstone of every serious application of mathematical analysis. On the other hand it is absolutely critical how one defines the class of 10 Recall that Θ is an interval in R. If X and Y are left-continuous then left-continuity is meaningless in the left endpoint of Θ, so if Θ has a left endpoint then we assume that this left endpoint is part of (rk ). Similarly when X and Y are right-continuous and Θ has right endpoint then we assume that this endpoint is in (rk ).
8
STOCHASTIC PROCESSES
measurable functions which one can use in stochastic analysis. Every stochastic process is a function of two variables, so it is obvious to assume that every process is product measurable. Example 1.11 An almost surely continuous process is not necessarily product measurable.
Let (Ω, A, P) ([0, 1] , B, λ) and let E be a subset of [0, 1] which is not Lebesgue measurable. The process 0 if ω = 0 X(t, ω) χE (t) if ω = 0 is almost surely continuous. X is not product measurable as by Fubini’s theorem the product measurability implies partial measurability but if ω = 0 then t → X(t, ω) is not measurable. Although the example is trivial it is not without any interest. Processes X and Y are considered to be equal if they are indistinguishable. So in theory it can happen that X is product measurable and X = Y but Y is not product measurable. To avoid these type of measurability problems we should for example, assume that the different objects of stochastic analysis, like martingales, local martingales, or semimartingales etc. are right-regular and not just almost surely right-regular. Every trajectory of a Wiener processes should be continuous, but it can happen that it starts only almost surely from zero. 1.2.1
Filtration, adapted, and progressively measurable processes
A fundamental property of time is its ‘irreversibility’. This property of time is expressed with the introduction of the filtration. Definition 1.12 Let us fix a probability space (Ω, A, P). For every t ∈ Θ let us select a σ-algebra Ft ⊆ A in such a way that whenever s < t then Fs ⊆ Ft . The correspondence t → Ft is called a filtration and we shall denote this correspondence by F. The quadruplet (Ω, A, P, F) is called a stochastic basis. With the filtration F one can define the σ-algebras Ft+ ∩s>t Ft ,
Ft− σ (∪s
F∞ σ (Ft : t ∈ Θ) .
1. The filtration F is right-continuous, if Ft = Ft+ for all t. 2. The filtration F is left-continuous, if Ft = Ft− for all t. 3. We say that the filtration F satisfies the usual conditions if F is rightcontinuous and Ft contains for all t all the measure zero sets of (Ω, A, P). 4. We say that the stochastic basis (Ω, A, P, F) satisfies the usual conditions, if (Ω, A, P) is complete and the filtration F satisfies the usual conditions.
MEASURABILITY OF STOCHASTIC PROCESSES
9
It is obvious from the introduced terminology, that generally we shall assume that the filtration and the stochastic basis satisfy the usual conditions. The usual interpretation of the σ-algebra Ft is that it contains the events which occurred up to time t, that is Ft contains the information which is available at moment t. As Ft is the information at moment t one can interpret Ft− as the information available before t and Ft+ is the information available just after11 t. A quite natural question is how one can define a filtration F. Let X be a stochastic process, that is let X be a function of two variables. Assume that X is product measurable. In this case X(t) is A-measurable for all t. Let us define the σ-algebras FtX ⊆ A generated by the sets {X(t1 ) ∈ I1 , . . . , X(tn ) ∈ In }
(1.3)
where t1 , . . . , tn ≤ t are arbitrary elements in Θ and I1 , . . . , In are arbitrary intervals. Obviously if s < t then FsX ⊆ FtX , hence F X is really a filtration. F X is called the filtration generated by X. Example 1.13 If w is the canonical Wiener process then F w , the filtration generated by w, is not right-continuous.
Let w be the canonical Wiener process. By definition this means that the set of trajectories of w is the space Ω {f : f ∈ C (R+ ) and f (0) = 0} . Let F be the set of outcomes ω ∈ Ω for which there is an ε > 0 that on the interval [0, ε] the trajectory w (ω) is zero. Obviously F = ∪n Fn , where Fn is the set of outcomes ω, for which w (ω) is zero on the interval [0, 1/n]. Fn is measurable as it is equal to the set 1 w (rn ) = 0, rn ∈ 0, ∩Q . n Obviously P(Fn ) = 0, therefore P(F ) = 0. By definition w(0) ≡ 0, therefore / F0w . If t > 0 and 1/n ≤ t, then obviously Fn ∈ F0w = {Ω, ∅}. Hence F ∈ w Ft , therefore ∪1/n≤t Fn ∈ Ftw . On the other hand for every t > 0 evidently ∪1/n≤t Fn = F , since obviously ∪1/n≤t Fn ⊆ F and if ω ∈ F then ω ∈ Fn ⊆ w w , that is F0w = F0+ . ∪1/n≤t Fn for some index n. Hence F ∈ ∩t>0 Ftw = F0+ Let us remark that, as we shall see later, if N is the collection of sets with 11 One can observe that the interpretation of F t− is intuitively quite appealing, but the interpretation of Ft+ looks a bit unclear. It is intuitively not obvious that what type of information one can get in an infinitesimally short time interval after t or to put it in another way it is not too clear why one can get Ft = Ft+ . Therefore from an intuitive point of view it is not a great surprise that we shall generally assume that Ft = Ft+ .
10
STOCHASTIC PROCESSES
measure-zero in A then the filtration Ft σ (Ftw ∪ N ) is right-continuous, so this extended F satisfies the usual conditions12 . The σ-algebra F0w = {Ω, ∅} is complete, which implies that to make F right-continuous one should add to the σ-algebra Ftw all the null sets from A, or at least the null sets of Ftw for all t and it is not sufficient to complete the σ-algebras Ftw separately. Definition 1.14 We say that process X is adapted to the filtration F if X(t) is measurable with respect to Ft for every t. A set A ⊆ Θ × Ω is adapted if the process χA is adapted. In the following we shall fix a stochastic basis (Ω, A, P, F) and if we do not say otherwise we shall always assume that all stochastic processes are adapted with respect to the filtration F of the stochastic basis. It is easy to see that the set of adapted sets form a σ-algebra. Example 1.15 If Ft ≡ {∅, Ω} for all t then only the deterministic processes are adapted. If Ft ≡ A for all t then every product measurable stochastic process is adapted.
The concept of adapted processes is a dynamic generalization of partial measurability. The dynamic generalization of product measurability is progressive measurability: Definition 1.16 A set A ⊆ Θ×Ω is progressively measurable if for all t ∈ Θ A ∩ ([0, t] × Ω) ∈ Rt B ([0, t]) × Ft , that is for all t the restriction of A to [0, t] × Ω is measurable with respect to the product σ-algebra Rt B ([0, t]) × Ft . The progressively measurable sets form a σ-algebra R. We say that a process X is progressively measurable if it is measurable with respect to R. It is clear from the definition that every progressively measurable process is adapted. Example 1.17 Adapted process which is not progressively measurable.
12 See:
Proposition 1.103, page 67.
MEASURABILITY OF STOCHASTIC PROCESSES
11
Let Ω Θ [0, 1] and let Ft A be the σ-algebra generated by the finite subsets of Ω. If D {t = ω} then the function X χD is obviously adapted. We prove that it is not product measurable. Assume that {X = 1} = D ∈ B (Θ) × A. By the definition of product measurability Y [0, 1/2] × Ω ∈ B (Θ) × A. So if D ∈ B (Θ) × A then Y ∩ D ∈ B (Θ) × A. Therefore by the projection theorem13 [0, 1/2] ∈ A which is impossible. Therefore D ∈ / B (Θ) × A. If Ft A for all t then X is adapted but not progressively measurable. Example 1.18 Every adapted, continuous from the left and every adapted, continuous from the right process is progressively measurable14 .
Assume, for example, that X is adapted and continuous from the right. Fix a t (n) (n) (n) and let 0 = t0 < t1 < . . . < tk = t be a partition of [0, t]. Let us define the processes Xn (s)
X (0)
(n) X tk
if if
s = 0 . (n) (n) s ∈ tk−1 , tk
As X is adapted Xn is measurable with respect to the σ-algebra Rt B ([0, t]) × (n) Ft . If the sequence of partitions (tk ) is infinitesimal, that is if (n) (n) lim max tk − tk−1 = 0
n→∞
k
then as X is right-continuous Xn → X. Therefore the restriction of X to [0, t] is Rt -measurable. Hence X is progressively measurable. Example 1.19 If X is regular then ∆X is progressively measurable.
Like the product measurability, the progressive measurability is also a very mild assumption. It is perhaps the mildest measurability concept one can use in stochastic analysis. The main reason why one should introduce this concept is the following much-used observation: Proposition 1.20 Assume that V is a right-regular, adapted process and assume that every trajectory of V has finite variation on every finite interval [0, t]. 1. If for every ω the trajectories X (ω) are integrable on any finite interval with respect to the measure generated by V (ω) then the parametric 13 If P (N ) = 0 if N is countable otherwise P (N ) = 1, then the probability space (Ω, A, P ) is complete. 14 Specially, if X(t, ω) is measurable in ω and continuous in t then X is product measurable.
12
STOCHASTIC PROCESSES
integral process
t
X (s, ω) V (ds, ω)
Y (t, ω)
(1.4)
0
X (s, ω) V (ds, ω) (0,t]
forms a right-regular process and ∆Y = X · ∆V . 2. If additionally X is progressively measurable then Y is adapted. Proof. The first statement of the proposition is a direct consequence of the Dominated Convergence Theorem. Observe that to prove the second statement one cannot directly apply Fubini’s theorem, but one can easily adapt its usual proof: Let H denote the set of bounded processes for which Y (t) in (1.4) is Ft -measurable. As the measure of finite intervals is finite H is a linear space, it contains the constant process X ≡ 1, and if 0 ≤ Hn ∈ H and Hn H and H is bounded then by the Monotone Convergence Theorem H ∈ H. This implies that H is a λ-system. If C ∈ Ft and s1 , s2 ≤ t, and B (s1 , s2 ] × C then as V is adapted the integral
t
χB dV = χC [V (s2 ) − V (s1 )] 0
is Ft -measurable. These processes form a π-system, hence by the Monotone Class Theorem H contains the processes which are measurable with respect to the σ-algebra generated by the processes χC χ ((s1 , s2 ]). As C ∈ Ft the πsystem generates the σ-algebra of the product measurable sets B ((0, t])×Ft . X is progressively measurable so its restriction to (0, t ] is (B ((0, t]) × Ft )-measurable. Hence the proposition is true if X is bounded. From this the general case follows from the Dominated Convergence Theorem. What is the intuitive idea behind progressive measurability? Generally the filtration F is generated by some process X. Recall that if Z (ξ α )α∈A is a set of random variables and X σ (ξ α : α ∈ A) denotes the σ-algebra generated by them then X = ∪S⊆A XS where the subsets S are arbitrary countable generated subsets of A and for any S set XS denotes the σ-algebra
by the
the countably many variables ξ αi α ∈S of Z, that is XS σ ξ αi : αi ∈ S . By this i structure of the generated σ-algebras, FtX contains all the information one can obtain observing X up to time t countably many times. If a process Y is adapted with respect to F X then Y reflects the information one can obtain from countable many observations of X. But sometimes, like in (1.4), we want information
MEASURABILITY OF STOCHASTIC PROCESSES
13
which depends on uncountable number of observations of the underlying random source. In these cases one needs progressive measurability! 1.2.2
Stopping times
After filtration, stopping time is perhaps the most important concept of the theory of stochastic processes. As stopping times describe the moments when certain random events occur, it is not a great surprise that most of the relevant questions of the theory are somehow related to stopping times. It is important that not every random time is a stopping time. Stopping times are related to events described by the filtration of the stochastic base15 . At every time t one can observe only the events of the probability space (Ω, Ft , P). If τ is a random time then at time t one cannot observe the whole τ . One can observe only the random variable τ ∧ t! By definition τ is a stopping time if τ ∧ t is an (Ω, Ft , P)-random variable for all t. Definition 1.21 Let Ω be the set of outcomes and let F be a filtration on Ω. Let τ : Ω → Θ ∪ {∞}. 1. The function τ is a stopping time if for every t ∈ Θ {τ ≤ t} ∈ Ft . We denote the set of stopping times by Υ. 2. The function τ is a weak stopping time if for every t ∈ Θ {τ < t} ∈ Ft . Example 1.22 Almost-surely zero functions and stopping times.
Assume that the probability space (Ω, A, P) is complete and for every t the σ-algebra Ft contains the measure-zero sets of A. If N ⊆ Ω is a measure-zero set and the function τ ≥ 0 is zero on the complement of N , then τ is stopping time, as for all t {τ ≤ t} ⊆ N ∈ Ft , hence {τ ≤ t} ∈ Ft . In a similar way if σ ≥ 0 is almost surely +∞ then σ is a stopping time. These examples are special cases of the following: If (Ω, A, P, F) satisfies the usual conditions and τ is a stopping time and σ ≥ 0 is almost surely equal to τ then σ is also a stopping time. We shall see several times that in the theory of stochastic processes the time axis is not symmetric. The filtration defines an orientation on the real axis. 15 If we travel from a city to the countryside then the moment when we arrive at the first pub after we leave the city is a stopping time, but the time when we arrive at the last pub before we leave the city is not a stopping time. In a similar way when X is a stochastic process the first time X is zero is a stopping time, but the last time it is zero is not a stopping time. One of the most important random times which is generally not a stopping time is the moment when X reaches its maximum on a certain interval. See: Example 1.110, page 73.
14
STOCHASTIC PROCESSES
An elementary but very import consequence of this orientation is the following proposition: Proposition 1.23 Every stopping time is a weak stopping time. If the filtration F is right-continuous then every weak stopping time is a stopping time. Proof. As the filtration F is increasing, if τ is a stopping time then for all n 1 ∈ Ft−1/n ⊆ Ft . τ ≤t− n Therefore {τ < t} = ∪n
1 τ ≤t− n
∈ Ft .
On the other hand if F is right-continuous that is if Ft+ = Ft then 1 {τ ≤ t} = ∩n τ < t + ∈ ∩n Ft+1/n Ft+ = Ft . n The right-continuity of the filtration is used in the next proposition as well. Proposition 1.24 If τ and σ are stopping times then τ ∧ σ and τ ∨ σ are also stopping times. If (τ n ) is an increasing sequence of stopping times then τ lim τ n n→∞
is a stopping time. If the filtration F is right-continuous and (τ n ) is a decreasing sequence of stopping times then τ lim τ n n→∞
is a stopping time. Proof. If τ and σ are stopping times then {τ ∧ σ ≤ t} = {τ ≤ t} ∪ {σ ≤ t} ∈ Ft , {τ ∨ σ ≤ t} = {τ ≤ t} ∩ {σ ≤ t} ∈ Ft . If τ n τ then for all t {τ ≤ t} = ∩n {τ n ≤ t} ∈ Ft . If τ n τ then for all t c
{τ ≥ t} = ∩n {τ n ≥ t} = ∩n {τ n < t} ∈ Ft
MEASURABILITY OF STOCHASTIC PROCESSES
15
that is {τ < t} = ∪n {τ n < t} ∈ Ft . Hence τ is a weak stopping time. If the filtration F is right-continuous then τ is a stopping time. Corollary 1.25 If the filtration F is right-continuous and (τ n ) is a sequence of stopping times then sup τ n , n
inf τ n n
lim sup τ n , n→∞
lim inf τ n n→∞
are stopping times. The next definition concretizes the abstract definition of stopping times: Definition 1.26 If Γ ⊆ R+ × Ω then the expression τ Γ (ω) inf {t : (t, ω) ∈ Γ}
(1.5)
is called the d´ebut of the set Γ. If B ⊆ Rn and X is a vector valued stochastic process then τ B (ω) inf {t : X(t, ω) ∈ B}
(1.6)
is called the hitting time of set B. If B ⊆ R and X is a stochastic process and if Γ {X ∈ B} then τ Γ = τ B which means that every hitting time is a special d´ebut. Example 1.27 The most important hitting times are the random functions τ a (ω) inf {t : X(t, ω)Ra} where R is one of the relations ≥, >, ≤, <. These type of hitting times are the so-called first passage times.
Theorem 1.28 (Construction of stopping times) If the stochastic base (Ω, A, P, F) satisfies the usual conditions and Γ is progressively measurable then the d´ebut of Γ is a stopping time. Proof. Define the set Γt Γ ∩ [0, t) × Ω. If τ Γ (ω) < t then for some s obviously (s, ω) ∈ Γt . Hence ω ∈ projΩ (Γt ). On the other hand if ω is in projΩ (Γt )
16
STOCHASTIC PROCESSES
then for some s ∈ [0, t) obviously (s, ω) ∈ Γ, hence τ Γ (ω) ≤ s < t that is {τ Γ < t} = projΩ (Γt ) . Γ is progressively measurable, hence Γt (Γ ∩ [0, t] × Ω) ∩ [0, t) × Ω ∈ B ([0, t]) × Ft . Recall that the projections of product measurable sets are not necessarily measurable. By the usual conditions A is complete, and also by the usual conditions Ft contains all the measure-zero sets, hence Ft is also complete and, therefore, by the Projection Theorem16 , the projection of the product measurable set Γt is Ft -measurable, so {τ Γ < t} = projΩ (Γt ) ∈ Ft . As F is right-continuous17 every weak stopping time is a stopping time so τ Γ is a stopping time. Corollary 1.29 If the stochastic base (Ω, A, P, F) satisfies the usual conditions, the process X is progressively measurable and B is a Borel set then the hitting time of B is a stopping time. Let X be a progressively measurable process and let σ be a stopping time. Instead of (1.5) very often we are interested in variables of the type τ inf {t > σ : X(t) ∈ B} . The set Γ {(t, ω) : X(t, ω) ∈ B} ∩ {(t, ω) : t > σ (ω)} is progressively measurable since by the progressive measurability of X the first set in the intersection is progressively measurable, and the characteristic function of the other set is adapted and left-continuous hence it is also progressively measurable. By the theorem above if (Ω, A, P, F) satisfies the usual conditions then the expression τ = τ Γ inf {t : (t, ω) ∈ Γ} is a stopping time. 16 See:
Theorem A.12, page 550. can happen that (s, ω) ∈ Γ for all s > t, but (t, ω) ∈ / Γ. In this case τ Γ (ω) = t, but ω∈ / projΩ (Γ ∩ [0, t) × Ω), therefore in the proof we used the right-continuity of the filtration. 17 It
MEASURABILITY OF STOCHASTIC PROCESSES
17
Corollary 1.30 If the stochastic base (Ω, A, P, F) satisfies the usual conditions, the process X is progressively measurable and B is a Borel set then the hitting times τ 0 0,
τ n+1 inf {t > τ n : X(t) ∈ B}
are stopping times. Example 1.31 If X is not progressively measurable then the hitting times of Borel sets are not necessarily stopping times.
Let X χD be the adapted but not progressively measurable process in Example 1.17. The hitting time of the set B {1} is obviously not a stopping time as / A F1/2 . {τ B ≤ 1/2} = [0, 1/2] ∈ The main advantage of the above construction is its generality. An obvious disadvantage of the just proved theorem is that it builds on the Projection Theorem. Very often we do not need the generality of the above construction and we can construct stopping times without referring to the Projection Theorem. Example 1.32 Construction of stopping times without the Projection Theorem.
1. If the set B is closed and X is a continuous, adapted process then one can easily proof that the hitting time (1.6) is a stopping time. As the trajectories are continuous the sets K(t, ω) X ([0, t] , ω) are compact for every outcome ω. As B is closed K(t, ω) ∩ B = ∅ if and only, if the distance between the two sets is positive. Therefore K(t, ω) ∩ B = ∅ if and only if τ B (ω) > t. As the trajectories are continuous X([0, t] ∩ Q, ω) is dense in the set K(t, ω). As the metric is a continuous function {τ B ≤ t} = {K(t) ∩ B = ∅} = {d (K(t), B) = 0} = = {ω : inf {d(X (s, ω) , B) : s ≤ t, s ∈ Q} = 0} . X(s) is Ft -measurable for a fixed s ≤ t, hence as x → d (x, B) is continuous d(X(s), B) is also Ft -measurable. The infimum of a countable number of measurable functions is measurable, hence {τ B ≤ t} ∈ Ft . 2. We prove that if B is open, the trajectories of X are right-continuous and adapted, and the filtration F is right-continuous then the hitting time (1.6) is a stopping time. It is sufficient to prove that {τ B < t} ∈ Ft for all t. As the trajectories are right-continuous and as B is open X(s, ω) ∈ B, if and only if,
18
STOCHASTIC PROCESSES
there is an ε > 0 such that whenever u ∈ [s, s + ε) then X(u, ω) ∈ B. From this {τ B < t} = ∪s∈Q∩[0,t) {X(s) ∈ B} ∈ Ft . 3. In a similar way one can prove that if X is left-continuous and adapted, F is right-continuous, and B is open, then the hitting time τ B is a stopping time. 4. If the filtration is right-continuous, and X is a right or left-continuous adapted process, then for any number c the first passage time τ inf {t : X(t) > c} is a stopping time. 5. If B is open and the filtration is not right-continuous, then even for continuous processes the hitting time τ B is not necessarily a stopping time18 . If X(t, ω) t · ξ(ω), where ξ is a Gaussian random variable, and Ft is the filtration generated by X, then F0 = {0, Ω} , and the hitting time τ B of the set B {x > 0} is τ B (ω)
0 if ξ(ω) > 0 . ∞ if ξ(ω) ≤ 0
/ F0 , so τ B is not a stopping time. Obviously {τ B ≤ 0} ∈ 6. Finally we show that if σ is an arbitrary stopping time and X is a right-regular, adapted process and c > 0, then the first passage time τ (ω) inf {t > σ : |∆X(t, ω)| ≥ c} is stopping time. Let us fix an outcome ω and let assume that ∞ > tn τ (ω) , where |∆X(tn , ω)| ≥ c. The trajectory X(ω) is right-regular, therefore the jumps which are bigger than c do not have an accumulation point. Hence for all indexes n large enough tn is already constant, that is τ (ω) = tn > σ (ω) , so |∆X(τ (ω))| = |∆X(tn )| ≥ c for some n. This means that |∆X (τ )| ≥ c on the set {τ < ∞} and on the set {σ < ∞} one has τ > σ. Let A(t) ([0, t] ∩ Q) ∪ {t}. We prove that τ (ω) ≤ t if and only if for all n ∈ N one can find a pair qn , pn ∈ A(t) for which σ(ω) < pn < qn < pn +
1 n
18 The reason for this is clear as the event {τ B = t} can contain such outcomes ω that the trajectory will hit the set B just after t therefore one should investigate the events {τ B < t}.
MEASURABILITY OF STOCHASTIC PROCESSES
19
and |X(pn , ω) − X(qn , ω)| ≥ c −
1 . n
(1.7)
One implication is evident, that is if τ (ω) ≤ t, then as the jumps bigger than c do not have accumulation points, |∆X(s, ω)| ≥ c for some σ(ω) < s ≤ t. Hence by the regularity of the trajectories one can construct the necessary sequences. On the other hand, let us assume that the sequences (pn ) , (qn ) exist. Without loss of generality one can assume that (pn ) and (qn ) are convergent. Let σ (ω) ≤ s ≤ t be the common limit point of these sequences. If for an infinite number of indexes pn ≥ s, then in any right neighbourhood of s there is an infinite number of intervals [pn , qn ], on which X changes more then c/2 > 0, which is impossible as X is right-continuous. Similarly, only for a finite number of indexes qn ≤ s as otherwise for an infinite number of indexes pn < qn ≤ s which is impossible as X(ω) is left-continuous. This means that for indexes n big enough σ (ω) < pn ≤ s ≤ qn . Taking the limit in the line (1.7) |∆X(s, ω)| ≥ c and hence τ (ω) ≤ s ≤ t. Using this property one can easily proof that {τ ≤ t} =
n∈N
p,q∈A(t) p
{σ < q}
1 |X (p) − X (q)| ≥ c − n
.
A(t) is countable, X is adapted therefore {τ ≤ t} ∈ Ft , which means that τ is a stopping time. 7. If X is a regular process and c > 0 then the hitting time τ inf {t : |∆X(t)| ≥ c} is a stopping time. 1.2.3
Stopped variables, σ-algebras, and truncated processes
With stopping times one can define stopped variables, truncated processes, and the stopped σ-algebras: Definition 1.33 Let X be a stochastic process, and let τ be a stopping time. 1. By a stopped or truncated process we mean the process X τ (t, ω) X (τ (ω) ∧ t, ω) . 2. We shall call the random variable Xτ (ω) X (τ (ω) , ω)
20
STOCHASTIC PROCESSES
a stopped variable. Instead of Xτ we shall very often use the more readable notation X (τ ). Observe that the definition of stopped variable is not entirely correct as X is generally not defined on the set {τ = ∞} and it is not clear / Θ then one can use the what the definition of Xτ on this set is. If τ (ω) ∈ definition19 Xτ (ω) 0. If one uses the convention that the product of an undefined value with zero is zero, then one can write the definition of the stopped variable Xτ in the following way: Xτ (ω) X (τ (ω) , ω) χ (τ ∈ Θ) (ω) . 3. The stopped σ-algebra Fτ is the set of events A ∈ A for which for all t A ∩ {τ ≤ t} ∈ Ft . 4. Fτ + is the set of events A ∈ A for which A ∩ {τ ≤ t} ∈ Ft+ for all t. One can easily check that Fτ and Fτ + are really σ-algebras. For example, if A ∈ Fτ then Ac ∈ Fτ as for every t Ac ∩ {τ ≤ t} = {τ ≤ t} \ (A ∩ {τ ≤ t}) ∈ Ft , and if An ∈ Fτ then (∪n An ) ∩ {τ ≤ t} = ∪n (An ∩ {τ ≤ t}) ∈ Ft . It is easy to see that if τ ≡ t, then Fτ = Ft and Fτ + = Ft+ , hence the notation is unambiguous. If we assume that the usual conditions are satisfied then of course Fτ = Fτ + hence there are not too many important theorems where the σ-algebra Fτ + plays a role. There are many simple observations related to the stopped processes, variables, and σ-algebras. Their proof is generally one or two lines. Let us show some of them: Proposition 1.34 Let F be a filtration, and let τ and σ be stopping times. 1. τ is Fτ -measurable. 2. If σ ≤ τ then Fσ ⊆ Fτ . 19 If X is the value process of some game and τ is an exit strategy then the present definition of Xτ is quite reasonable.
MEASURABILITY OF STOCHASTIC PROCESSES
21
3. Fσ ∩ Fτ = Fσ∧τ . 4. {σ ≤ τ } , {σ < τ } , {σ = τ } are Fσ∧τ -measurable. Proof. The proofs are simple consequences of the definitions. 1. We prove that {τ ≤ s} ∈ Fτ for all s. Let t be arbitrary. As τ is a stopping time {τ ≤ s} ∩ {τ ≤ t} = {τ ≤ s ∧ t} ∈ Fs∧t ⊆ Ft so {τ ≤ s} ∈ Fτ by the definition of Fτ . Hence τ is Fτ -measurable. 2. If σ ≤ τ then {τ ≤ t} ⊆ {σ ≤ t}. If A ∈ Fσ then A ∩ {τ ≤ t} = (A ∩ {σ ≤ t}) ∩ {τ ≤ t} ∈ Ft , as both sets in the intersection are in Ft . Hence A ∈ Fτ . 3. By the previous property Fτ ∧σ ⊆ Fτ ∩ Fσ . On the other hand if A ∈ Fτ ∩ Fσ then A ∩ {σ ∧ τ ≤ t} = A ∩ ({σ ≤ t} ∪ {τ ≤ t}) = = (A ∩ {σ ≤ t}) ∪ (A ∩ {τ ≤ t}) ∈ Ft . Hence A ∈ Fσ∧τ . 4. It is sufficient to prove that if σ and τ are stopping times then {σ ≤ τ } , {τ ≤ σ} ∈ Fσ . From this by the symmetry {σ ≤ τ } ∈ Fσ ∩ Fτ = Fσ∧τ , and {σ = τ } = {σ ≤ τ } ∩ {τ ≤ σ} ∈ Fσ∧τ and {σ < τ } = {σ ≤ τ } \ {σ = τ } ∈ Fσ∧τ . From the definition of stopping times if r ≤ t then {σ > r > τ } = {σ > r} ∩ {τ < r} = c
= {σ ≤ r} ∩ {τ < r} ∈ Ft . From this c
{σ ≤ τ } ∩ {σ ≤ t} = {σ > τ } ∩ {σ ≤ t} = = ∪r∈Q {σ > r > τ } ∩ {σ ≤ t} = = ∪r∈Q,r≤t {σ > r > τ } ∩ {σ ≤ t} ∈ Ft . Hence by the definition of Fσ one has {σ ≤ τ } ∈ Fσ . On the other hand {τ ≤ σ} ∩ {σ ≤ t} = {σ ≤ t} ∩ {τ ≤ t} ∩ {τ ∧ t ≤ σ ∧ t} ∈ Ft ,
22
STOCHASTIC PROCESSES
since the first two sets, by the definition of stopping times, are in Ft and the two random variables in the third set are Ft -measurable. Hence {τ ≤ σ} ∈ Fσ . Proposition 1.35 If X is progressively measurable and τ is an arbitrary stopping time then the stopped variable Xτ is Fτ -measurable, and the truncated process X τ is progressively measurable. Proof. The first part of the proposition is an easy consequence of the second as, if B is a Borel measurable set and X τ is adapted, then for all s {Xτ ∈ B} ∩ {τ ≤ s} = {X (τ ∧ s) ∈ B} ∩ {τ ≤ s} = = {X τ (s) ∈ B} ∩ {τ ≤ s} ∈ Fs , that is, in this case the stopped variable Xτ is Fτ -measurable. Therefore it is sufficient to prove that if X is progressively measurable then X τ is also progressively measurable. Let Y (t, ω)
1
if t < τ (ω)
0
if t ≥ τ (ω)
.
Y is right-regular. τ is a stopping time so {Y (t) = 0} = {τ ≤ t} ∈ Ft . Hence Y is adapted, therefore it is progressively measurable20 . Obviously if τ (ω) > 0 then21
Z (t, ω)
X (s, ω) Y (ds, ω) = (0,t]
0 if t < τ (ω) . −X (τ (ω) , ω) if t ≥ τ (ω)
As X is progressively measurable Z is adapted22 and also right-regular so it is again progressively measurable. As X τ = XY − Z + X (0) χ (τ = 0) X τ is obviously progressively measurable. Corollary 1.36 If G σ(X(τ ) : X is right-regular and adapted) then G = Fτ . Proof. As every right-regular and adapted process is progressively measurable G ⊆ Fτ . If A ∈ Fτ then the process X(t) χA χ (τ ≤ t) is right-regular and by 20 See:
Example 1.18, page 11. τ (ω) = 0 then Z (ω) = 0. 22 See: Proposition 1.20, page 11. 21 If
MEASURABILITY OF STOCHASTIC PROCESSES
23
the definition of Fτ {X(t) = 1} = A ∩ {τ ≤ t} ∈ Ft . Hence X is adapted. Obviously X (τ ) = χA . Therefore Fτ ⊆ G. 1.2.4
Predictable processes
The class of progressively measurable processes is too large. As we have already remarked, the interesting stochastic processes have regular trajectories. There are two types of regular processes: some of them have left- and some of them have right-continuous trajectories. It is a bit surprising that there is a huge difference between these two classes. But one should recall that the trajectories are not just functions: the time parameter has an obvious orientation: the time line is not symmetric, the time flows from left to right. Definition 1.37 Let (Ω, A, P, F) be a stochastic base, and let us denote by P the σ-algebra of the subsets of Θ × Ω generated by the adapted, continuous processes. The sets in the σ-algebra P are called predictable. A process X is predictable if it is measurable with respect to P. Example 1.38 A deterministic process is predictable if and only if its single trajectory is a Borel-measurable function.
Obviously we call a process X deterministic if it does not depend on the random parameter ω, more exactly a process X is called deterministic if it is a stochastic process on (Ω, {Ω, ∅}). If A {Ω, ∅} then the set of continuous stochastic processes is equivalent to the set of continuous functions, and the σ-algebra generated by the continuous functions is equivalent to the σ-algebra of the Borel measurable sets on Θ. The set of predictable processes is closed for the usual operations of analysis23 . The most important and specific operation related to stochastic processes is the truncation: Proposition 1.39 If τ is an arbitrary stopping time and X is a predictable stochastic process then the truncated process X τ is also predictable. Proof. Let L be the set of bounded stochastic processes X for which X τ is predictable. It is obvious that L is a λ-system. If X is continuous then X τ is also continuous hence the π-system of the bounded continuous processes is in L. From the Monotone Class Theorem it is obvious that L contains the set of bounded predictable processes. If X is an arbitrary predictable process then 23 Algebraic
and lattice type operations, usual limits etc.
24
STOCHASTIC PROCESSES
Xn Xχ (|X| ≤ n) is a predictable bounded process and therefore Xnτ is also predictable. Xnτ → X τ therefore X τ is obviously predictable. To discuss the structure of the predictable processes let us introduce some notation: Definition 1.40 If τ and σ are stopping times then one can define the random intervals {(t, ω) ∈ [0, ∞) × Ω : τ (ω) R1 tR2 σ (ω)} where R1 and R2 are one of the relations < or ≤. One can define four random intervals [σ, τ ] , [σ, τ ) , (σ, τ ] and (σ, τ ) where the meaning of these notations is obvious. One should emphasize that, in the definition of the stochastic intervals, the value of the time parameter t is always finite. Therefore if τ (ω) = ∞ for some ω then (∞, ω) ∈ / [τ , τ ]. In measure theory we are used to the fact that the σ-algebras generated by the different types of intervals are the same. In R or in Rn one can construct every type of interval from any other type of interval with a countable number of set operations. For random intervals this is not true! For example, if we want to construct the semi-closed random interval [0, τ ) with random closed segments [0, σ] then we need a sequence of stopping times (σ n ) for which σ n τ , and σ n < τ . If there is such a sequence24 then of course [0, σ n ] [0, τ ) , that is, in this case [0, τ ) is in the σ-algebra generated by the closed random segments. But for an arbitrary stopping time τ such a sequence does not exist. If τ is a stopping time and c > 0 is a constant, then τ − c is generally not a stopping time! On the other hand if c > 0 then τ + c is always a stopping time, hence as [0, τ ] = ∩n [0, τ + 1/n) the closed random intervals [0, τ ] are in the σ-algebra generated by the intervals [0, σ). This shows again that in the theory of the stochastic processes the time line is not symmetric! Definition 1.41 Y is a predictable simple process if there is a sequence of stopping times 0 = τ0 < τ1 < . . . < τn < . . . such that Y = η 0 χ ({0}) +
η i χ ((τ i , τ i+1 ])
(1.8)
i 24 If for τ there is a sequence of stopping times σ τ , σ ≤ τ and σ < τ on the set n n n {τ > 0} then we shall say that τ is a predictable stopping time. Of course the main problem is that not every stopping time is predictable. See: Definition 3.5, page 182. The simplest examples are the jumps of the Poisson processes. See: Example 3.7, page 183.
MEASURABILITY OF STOCHASTIC PROCESSES
25
where η 0 is F0 -measurable and η i are Fτ i -measurable random variables. If the stopping times (τ i ) are constant then we say that Y is a predictable step processes. Now we are ready to discuss the structure of predictable processes. Proposition 1.42 Let X be a stochastic process on Θ [0, ∞). The following statements are equivalent 25 : 1. X is predictable. 2. X is measurable with respect to the σ-algebra generated by the adapted leftregular processes. 3. X is measurable with respect to the σ-algebra generated by the adapted leftcontinuous processes. 4. X is measurable with respect to the σ-algebra generated by the predictable step processes. 5. X is measurable with respect to the σ-algebra generated by the predictable simple processes. Proof. Let P1 , P2 , P3 , P4 and P5 denote the σ-algebras in the proposition. Obviously it is sufficient to prove that these five σ-algebras are equal. 1. Obviously P1 ⊆ P2 ⊆ P3 . 2. Let X be one of the processes generating P3 , that is let X be a left-continuous, adapted process. As X is adapted Xn (t) X (0) χ({0}) +
k
X
k 2n
k k+1 , χ 2n 2n
is a predictable step process. As X is left-continuous obviously Xn → X so X is P4 -measurable hence P3 ⊆ P4 . 3. Obviously P4 ⊆ P5 . 4. Let F ∈ F0 and let fn be such a continuous functions that fn (0) = 1 and fn is zero on the interval [1/n, ∞). If Xn fn χF then Xn is obviously P1 measurable, therefore the process χF χ({0}) = lim Xn n→∞
25 Let us recall that by definition X (0−) X (0). Therefore if ξ is an arbitrary F -measurable 0 random variable then the process X ξχ ({0}) is adapted and left-regular, so if Z is predictable then Z + X is also predictable. Hence we cannot generate P without the measurable rectangles {0}×F, F ∈ F0 . If one wants to avoid these sets then one should define the predictable processes on the open half line (0, ∞). This is not necessarily a bad idea as the predictable processes are the integrands of stochastic integrals, and we shall always integrate only on the intervals (0, t], so in the applications of the predictable processes the value of the these processes is entirely irrelevant at t = 0.
26
STOCHASTIC PROCESSES
is also P1 -measurable. If η 0 is an F0 -measurable random variable then η 0 is a limit of F0 -measurable step functions therefore the process η 0 χ ({0}) is P1 measurable. This means that the first term in (1.8) is P1 -measurable. Let us now discuss the second kind of term in (1.8). Let τ be an arbitrary stopping time. If 1 if t ≤ τ (ω) 1 − n (t − τ (ω)) if τ (ω) < t < τ (ω) + 1/n Xn (t, ω) 0 if t ≥ τ (ω) + 1/n then Xn has continuous trajectories, and it is easy to see that Xn is adapted. Therefore χ ([0, τ ]) = lim Xn ∈ P1 . n→∞
If σ ≤ τ is another stopping time then χ ((σ, τ ]) = χ ([0, τ ] \ [0, σ]) = χ ([0, τ ]) − χ ([0, σ]) ∈ P1 . If F ∈ Fσ then σ F (ω)
σ (ω) if ω ∈ F ∞ if ω ∈ /F
is also a stopping time as {σ F ≤ t} = {σ ≤ t} ∩ F ∈ Ft . If σ ≤ τ then Fσ ⊆ Fτ , therefore not only σ F but τ F is also a stopping time. χF χ ((σ, τ ]) = χ ((σ F , τ F ]) ∈ P1 . If η is Fσ -measurable, then η is a limit of step functions, hence if η is Fσ measurable and σ ≤ τ then the process ηχ ((σ, τ ]) is P1 -measurable. By the definition of the predictable simple processes every predictable simple process is P1 -measurable. Hence P5 ⊆ P1 . Corollary 1.43 If Θ = [0, ∞) then the random intervals {0} × F, F ∈ F0 and (σ, τ ] generate the σ-algebra of the predictable sets. Corollary 1.44 If Θ = [0, ∞) then the random intervals {0} × F, F ∈ F0 and [0, τ ] generate the σ-algebra of the predictable sets. Definition 1.45 Let T denote the set of measurable rectangles {0} × F,
F ∈ F0
MEASURABILITY OF STOCHASTIC PROCESSES
27
and {(s, t] × F,
F ∈ Fs } .
The sets in T are called predictable rectangles. Corollary 1.46 If Θ = [0, ∞) then the predictable rectangles generate the σ-algebra of predictable sets. It is quite natural to ask what the difference is between the σ-algebras generated by the right-regular and by the left-regular processes. Definition 1.47 The σ-algebra generated by the adapted, right-regular processes is called the σ-algebra of the optional sets. A process is called optional if it is measurable with respect to the σ-algebra of the optional sets. As every continuous process is right-regular so the σ-algebra of the optional sets is never smaller than the σ-algebra of the predictable sets P. Example 1.48 Adapted, right-regular process which is not predictable.
The simplest example of a right-regular process which is not predictable is the Poisson process. Unfortunately, at the present moment it is a bit difficult to prove26 . The next example is ‘elementary’. Let Ω [0, 1] and for all t let Ft
σ (B ([0, t]) ∪ (t, 1]) if t < 1 . B ([0, 1]) if t ≥ 1
If s ≤ t then Fs ⊆ Ft , and hence F is a filtration. It is easy to see that the random function τ (ω) ω is a stopping time. Let A [τ ] [τ , τ ] be the graph 2 of τ , which is the diagonal of the closed rectangle [0, 1] . 1. Let us show that A is optional. It is easy to see that the process Xn χ ([τ , τ + 1/n)) is right-continuous. Xn is adapted as {Xn (t) = 1} =
τ ≤t<τ+
As Xn → χA , A is optional. 26 See:
Example 3.36, page 200, Example 3.56, page 219.
1 n
∈ Ft .
28
STOCHASTIC PROCESSES
2. Now we show that [τ , τ ] is not predictable. We show that if D ⊆ R+ × Ω and D = P ∩ [0, τ ] for some P ∈ P then there is a B ∈ B ([0, 1]) that D = (B × Ω) ∩ [0, τ ] .
(1.9)
Obviously [τ , τ ] = [τ , τ ] ∩ [0, τ ], therefore if P [τ , τ ] ∈ P then for some B ∈ B ([0, 1]) [τ , τ ] = (B × Ω) ∩ [0, τ ] which is impossible and therefore [τ , τ ] cannot be predictable. 3. It remains to show the validity of the decomposition (1.9). Let F ∈ Fs and R (s, t] × F with s < t. There are two possibilities27 . If F ∩ (s, 1] = ∅ then F ⊆ [0, s] , and hence R (s, t] × F ⊆ (s, t] × [0, s] ⊆ {(x, y) : x > y} so, as [0, τ ] = {(t, ω) : t ≤ τ (ω)} {(t, ω) : t ≤ ω} = = {(x, y) : x ≤ y} , obviously R ∩ [0, τ ] = ∅ = (∅ × Ω) ∩ [0, τ ] . By the structure of Fs the interval (s, 1] is an atom of Fs . Hence if F ∩ (s, 1] = ∅, then (s, 1] ⊆ F , hence for some B ∈ B ([0, s]) R (s, t] × F = (s, t] × (B ∪ (s, 1]) . So R ∩ [0, τ ] = (s, t] × (B ∪ (s, 1]) ∩ {(x, y) : x ≤ y} = = ((s, t] × (s, 1]) ∩ {(x, y) : x ≤ y} = = ((s, t] × Ω) ∩ [0, τ ] and therefore in both cases the intersection has representation of type B × Ω. This remains true if we take the rectangles of type {0} × F, F ∈ F0 . As 27 If we draw Ω on the y-axis and we draw on the time line the x-axis then [τ , τ ] is the line y = x, [0, τ ] is the upper triangle. In the following argument F is under the diagonal hence the whole rectangle R is under the diagonal.
MARTINGALES
29
the generation and the restriction of the σ-algebras are interchangeable operations P ∩ [0, τ ] = σ (T ) ∩ [0, τ ] = σ (T ∩ [0, τ ]) = = σ ((B × Ω) ∩ [0, τ ]) = σ (B × Ω) ∩ [0, τ ] = = (B ([0, 1]) × Ω) ∩ [0, τ ] , which is exactly (1.9). 4. As the left-regular χ ([0, τ ]) is adapted and χ ([τ , τ ]) is not predictable, the right-regular, adapted process χ ([0, τ )) = χ ([0, τ ]) − χ ([τ , τ ]) is also not predictable.
1.3
Martingales
In this section we introduce and discuss some important properties of continuoustime martingales. As martingales are stochastic processes one should fix the properties of their trajectories. We shall assume that the trajectories of the martingales are right-regular. The right-continuity of martingales is essential in the proof of the Optional Sampling Theorem, which describes one of the most important properties of martingales. There are a lot of good books on martingales, so we will not try to prove the theorems in their most general form. We shall present only those results from martingale theory which we shall use in the following. The presentation below is a bit redundant. We could have first proved the Downcrossing Inequality and from it we could have directly proved the Martingale Convergence Theorem. But I don’t think that it is a waste of time and paper to show these theorems from different angles. Definition 1.49 Let us fix a filtration F. The adapted process X is a submartingale if 1. the trajectories of X are right-regular, 2. for any time t the expected value of X + (t) is finite28 , a.s.
3. if s < t, then E(X (t) | Fs ) ≥ X(s). 28 Some authors, see: [53], assume that if X is a submartingale then X (t) is integrable for all t. If we need this condition then we shall say that X is an integrable submartingale. The same remark holds for supermartingales as well. Of course martingales are always integrable.
30
STOCHASTIC PROCESSES
We say that X is a supermartingale, if −X is a submartingale. X is a martingale if X is a supermartingale and a submartingale at the same time. This means that 1. the trajectories of X are right-regular, 2. for any time t the expected value of X (t) is finite, a.s. 3. if s < t, then E (X (t) | Fs ) = X (s). The conditional expectation is always a random variable—that is, the conditional expectation E(X(t) | Fs ) is always an equivalence class. As X is a stochastic process X(s) is a function and not an equivalence class. Hence the two sides in the definition can be equal only in almost sure sense. Generally we shall not emphasize this, and we shall use the simpler =, ≥ and ≤ relations. If X is a martingale, and g is a convex function29 on R and E (g(X(t))+ ) < ∞ for all t, then the process Y (t) g (X(t)) is a submartingale as by Jensen’s inequality g (X (s)) = g (E (X (t) | Fs )) ≤ E (g (X (t)) | Fs ) . p
In particular, if X is a martingale, p ≥ 1, and |X (t)| is integrable for all t, then p the process |X| is a submartingale. If X is a submartingale, g is convex and increasing, and Y (t) g(X(t)) is integrable, then Y is a submartingale, as in this case E (g (X (t)) | Fs ) ≥ g (E (X (t) | Fs )) ≥ g (X (s)) . In particular, if X is a submartingale, then X + is also a submartingale. 1.3.1
Doob’s inequalities
The most well-known inequalities of the theory of martingales are Doob’s inequalities. First we prove the discrete-time versions, and then we discuss the continuous-time cases. n
Proposition 1.50 (Doob’s inequalities, discrete-time) Let X (Xk , Fk )k=1 be a non-negative submartingale. 1. If λ ≥ 0, then
λP
max Xk ≥ λ
1≤k≤n
≤ E (Xn ) .
(1.10)
2. If p > 1, then30 p Xk p ≤ max Xk ≤ p − 1 Xn p q Xn p . 1≤k≤n p 29 Convex 30 Of
functions are continuous so g(X) is adapted. course as usual 1/p + 1/q = 1.
(1.11)
MARTINGALES
31
Proof. Let us remark that both inequalities estimate the size of the maximum of the non-negative submartingales. 1. Let λ > 0. A1 {X1 ≥ λ} ,
Ak
max Xi < λ ≤ Xk ,
A
1≤i
max Xk ≥ λ .
1≤k≤n
We show that λP (A) λP
max Xk ≥ λ
≤
1≤k≤n
Xn dP.
(1.12)
A
As Xn ≥ 0
Xn dP ≤
Xn dP = E (Xn ) , Ω
A
therefore from (1.12) inequality (1.10) is obvious. The sets Ak are disjoint and A = ∪k Ak . Observe that Ak ∈ Fk . Hence by the submartingale property, by the definition of the sets Ak and by the definition of the conditional expectation
λP (A) = λ
n
P (Ak ) ≤
k=1
=
n k=1
Ak
n k=1
Xk dP ≤
Ak
n k=1
E (Xn | Fk ) dP =
Ak
Xn dP =
Xn dP. A
2. Let us prove inequality (1.11). Let us introduce the notation Xn∗ max1≤k≤n Xk . As 0 ≤ Xk ≤ Xn∗ , the first inequality is trivial. If Xn∗ p ≥ Xn p = ∞, then the second inequality is also obvious. Let us assume that Xn p < ∞. One cannot exclude that Xn∗ p = ∞, hence we should truncate the variable Xn∗ . Fix a number N, and let η N ∧ Xn∗ . If A (x) {Xn∗ ≥ x} then by (1.12) xP (A (x)) ≤
Xn dP. A(x)
32
STOCHASTIC PROCESSES
As Xn ≥ 0 by Fubini’s theorem and by the Fundamental Theorem of the Calculus ∗ Xn ∧N
η
E (η p ) = E
E
pxp−1 dx 0
pxp−1 dx
N p−1
=E
px
χ (Xn∗
≥ x) dx
E
px
xp−1
xp−1 P (A (x)) dx ≤ 0
Ω
N
xp−2 0
η
0
Ω
Xn xp−2 χA(x) dPdx =
0
xp−2 dxdP =
Xn
N
Xn dPdx = p A(x)
=p
=
N
χA(x) dPdx = p
0
χA(x) dx
0
N
≤p
N p−1
0
=p
=
0
p p−1
Ω
Xn η p−1 dP. Ω
By H¨older’s inequality 1/q E (η p ) ≤ q Xn p η p−1 q = q Xn p E (η p ) . 1/q
Dividing31 both sides by E (η p ) Convergence Theorem
we get ηp ≤ q Xn p . By the Monotone
lim N ∧ Xn∗ p = Xn∗ p ,
N →∞
from which the inequality (1.11) follows. n
Corollary 1.51 If X (Xk , Fk )k=1 is a submartingale, then for arbitrary λ
λP
max Xk ≥ λ
1≤k≤n
≤ max E Xk+ = 1≤k≤n
(1.13)
= E Xn+ ≤ E (|Xn |) .
Proof.
We can assume that λ ≥ 0. As we remarked, if (Xk ) is a submartingale, then Xk+ is a non-negative submartingale. Hence the sequence of expected
values of Xk+ is not decreasing, so
max E Xk+ = E Xn+ .
1≤k≤n 31 If
E (η p ) = 0 then the inequality holds.
MARTINGALES
33
As λ ≥ 0 obviously
P
max Xk ≥ λ
=P
1≤k≤n
max Xk+ ≥ λ ,
1≤k≤n
so (1.13) follows from (1.10). n
Corollary 1.52 If X (Xk , Fk )k=1 is a martingale or a non-negative submartingale, then for any λ ≥ 0 and exponent p ≥ 1
λp P
max |Xk | ≥ λ
1≤k≤n
p
p
≤ max E (|Xk | ) ≤ E (|Xn | ) . 1≤k≤n
(1.14) n
Proof. The function |x| is convex, hence if X is a martingale then (|Xk | , Fk )k=1 is a non-negative submartingale, so we can assume that X is a non-negative submartingale. By Jensen’s inequality and by the definition of submartingales p
E (Xnp ) = E ((E (Xnp | Fk ))) ≥ E ((E (Xn | Fk )) ) ≥ E (Xkp ) , so the first inequality holds. If E (Xkp ) = ∞ for some k, then (1.14) trivially holds. On the half-line R+ the function xp is convex and increasing. If E(Xkp ) < ∞ for all k, then (Xkp ) is a submartingale, therefore we can apply (1.13). As
max |Xk | ≥ λ
1≤k≤n
=
p
max |Xk | ≥ λp
1≤k≤n
from (1.13) the inequality (1.14) is obvious. If Θ is an interval and the process X has right-regular trajectories, then to calculate the supremum of the trajectories it is sufficient to calculate the supremum over the rational numbers in Θ. Hence, if X has right-regular trajectories, then X ∗ supt X (t) is measurable. The submartingales by definition have right-regular trajectories, and, therefore, after applying the just proved Doob’s inequalities for a finite number of rational numbers with the Monotone Convergence Theorem one can easily prove the next continuous-time inequalities: Corollary 1.53 (Doob’s inequalities, continuous-time) Let Θ be an interval. 1. If p ≥ 1 and X is a martingale, or non-negative submartingale, then p λp P sup |X (t)| ≥ λ ≤ sup X (t)p . t∈Θ
t∈Θ
(1.15)
34
STOCHASTIC PROCESSES
2. If p > 1, then sup |X (t)| ≤ t∈Θ
p
p sup X (t)p . p − 1 t∈Θ
(1.16)
3. If Θ is closed and b is the finite or infinite right endpoint of Θ then under the conditions above λP sup X (t) ≥ λ ≤ X + (b)1 , (1.17) t∈Θ
p
λp P sup |X (t)| ≥ λ
≤ X (b)p ,
t∈Θ
sup |X (t)| ≤ t∈Θ
p
p X (b)p . p−1
(1.18)
We shall very often use the following corollary of (1.16): Corollary 1.54 If X is a martingale and p > 1, then X ∗ sup |Xk | ∈ Lp (Ω) t∈Θ
or (X ∗ ) p
p p sup |Xk | = sup |Xk | ∈ L1 (Ω) t∈Θ
t∈Θ
if and only if X is bounded in Lp (Ω). Definition 1.55 If p ≥ 1, then Hp will denote the space of martingales X for which sup |X(t)| < ∞. t
p
Hp also denotes the equivalence classes of these martingales, where two martingales are equivalent whenever they are indistinguishable. Definition 1.56 If X ∈ H2 , then we shall say that X is a square-integrable martingale. If supt |Xn (t) − X(t)|p → 0 then for a subsequence a.s
sup |Xnk (t) − X(t)| → 0, t
MARTINGALES
35
hence if Xn is right-regular for every n, then X is almost surely right-regular. From the definition of the Hp spaces it is trivial that for all p ≥ 1 the Hp martingales are uniformly integrable. From these the next observation is obvious: Proposition 1.57 Hp as a set of equivalence classes with the norm XHp
sup |X (t)| t
(1.19)
p
is a Banach space. If p > 1 then by Corollary 1.54 X ∈ Hp if and only if X is bounded in Lp (Ω). 1.3.2
The energy equality
An important elementary property of martingales is the following: Proposition 1.58 (Energy equality) Let X be a martingale and assume that X (t) is square integrable for all t. If s < t then
2 E (X (t) − X (s)) = E X 2 (t) − E X 2 (s) . Proof. The difference of the two sides is d 2 · E (X (s) · (X (s) − X (t))) . As s < t, by the martingale property dn 2 · E (X (s) χ (|X (s)| ≤ n) · (X (s) − X (t))) = = 2 · E (E (X (s) χ (|X (s)| ≤ n) · (X (s) − X (t)) | Fs )) = = 2 · E (X (s) χ (|X (s)| ≤ n) · E (X (s) − X (t) | Fs )) = = 2 · E (X (s) χ (|X (s)| ≤ n) · 0) = 0. As X (s) , X (t) ∈ L2 (Ω) obviously |X (s) · (X (s) − X (t))| is integrable. Hence one can use the Dominated Convergence Theorem on both sides so d = lim dn = 0. n→∞
Corollary 1.59 If X ∈ H then there is a random variable, denoted by X(∞), such that X(∞) ∈ L2 (Ω, F∞ , P) and 2
a.s.
X(t) = E(X(∞) | Ft )
(1.20)
36
STOCHASTIC PROCESSES
for every t. In L2 (Ω)-convergence lim X(t) = X(∞).
t→∞
Proof. Let tn ∞ be arbitrary. By the energy equality the sequence 2 X(tn )2 is increasing, and by the definition of H2 it is bounded from above. Also by the energy equality if n > m then 2
2
2
X(tn ) − X(tm )2 = X(tn )2 − X(tm )2 , hence (X(tn )) is a Cauchy sequence in L2 (Ω). As L2 (Ω) is complete the sequence (X(tn )) is convergent in L2 (Ω). It is obvious from the construction that the limit X (∞) as an object in L2 (Ω) is unique, that is X (∞) ∈ L2 (Ω) is independent of the sequence (tn ). X is a martingale, so if s ≥ 0 then a.s.
X (t) = E (X (t + s) | Ft ) . In probability spaces L1 -convergence follows from L2 -convergence and as the conditional expectation is continuous in L1 (Ω), if s → ∞ then a.s.
X (t) = E
lim X (t + s) | Ft E (X (∞) | Ft ) .
s→∞
Example 1.60 Wiener processes and the structure of the square-integrable martingales.
Let u < ∞ and let w be a Wiener process on the interval Θ [0, u]. As w has independent increments, for every t ≤ u E (w (u) | Ft ) = E (w (u) − w (t) | Ft ) + E (w (t) | Ft ) = w (t) . / H2 , On the half-line R+ w is not bounded in L2 (Ω) that is, if Θ = R+ then w ∈ and of course the representation (1.20) does not hold. Proposition 1.61 Let X be a martingale and let p ≥ 1. If for some random variable X(∞) Lp (Ω)
X (t) → X(∞), then a.s.
X (t) → X(∞)
MARTINGALES
37
and a.s.
X(t) = E (X(∞) | Ft ) ,
t ≥ 0.
(1.21)
Proof. As the conditional expectation is continuous in L1 (Ω) if s → ∞ then from the relation a.s.
X(t) = E (X(t + s) | Ft ) ,
t≥0
(1.21) follows. For an arbitrary s the increment N (u) X (u + s) − X (s) is a martingale with respect to the filtration Gu Fs+u . Let β(s) sup |X(u + s) − X(∞)| ≤ sup |N (u)| + |X(s) − X(∞)| . u
u≥0
X is right-regular, so it is sufficient to take the supremum over the rational numbers, so β(s) is measurable. sup N (u)p ≤ X (s) − X(∞)p + sup X (u + s) − X (∞)p . u
u
Lp
Let ε > 0 be arbitrary. As X (s) → X (∞) if s is large enough then the right-hand side is less than ε > 0. By Doob’s and by Markov’s inequalities P (β (s) > 2δ) ≤ P (|X(s) − X(∞)| > δ) + P sup |N (u)| > δ ≤ u
≤
X(s)
p − X(∞)p p
δ
+
ε p δ
.
P
Therefore if s → ∞ then β (s) → 0. Every stochastically convergent sequence has a.s. an almost surely convergent subsequence. By the definition of β (s) if β (sk ) → 0 a.s. then X(t) → X(∞). Corollary 1.62 If X ∈ H2 then there is a random variable X(∞) ∈ L2 (Ω) such that X(t) → X(∞), where the convergence holds in L2 (Ω) and almost surely. 1.3.3
The quadratic variation of discrete time martingales
Our goal is to extend the result just proved to spaces Hp , p ≥ 1. The main tool of stochastic analysis is the so-called quadratic variation. Let us first investigate the quadratic variation of discrete-time martingales. Proposition 1.63 (Austin) Let Z denote the set of integers. Let X = (Xn , Fn )n∈Z be a martingale over Z, that is let us assume that Θ = Z. If X
38
STOCHASTIC PROCESSES
is bounded in L1 (Ω) then the ‘quadratic variation’ of X is almost surely finite: ∞
2 a.s.
(Xn+1 − Xn ) < ∞.
(1.22)
n=−∞
Proof. As X is bounded in L1 (Ω) there is a k < ∞ such that Xn 1 ≤ k for all n ∈ Z. Let X ∗ supn |Xn |. |X| is a non-negative submartingale so by Doob’s inequality P (X ∗ ≥ p) ≤
k , p
therefore X ∗ is almost surely finite. Fix a number p and define the continuously and differentiable, convex function f (t)
t2 2p |t| − p2
if |t| ≤ p . if |t| > p
As f is convex the expression g (s1 , s2 ) f (s2 ) − f (s1 ) − (s2 − s1 ) f (s1 ) is non-negative. If |s1 | , |s2 | ≤ p then 2
g (s1 , s2 ) = s22 − s21 − (s2 − s1 ) 2s1 = (s2 − s1 ) . By the definition of f obviously f (t) ≤ 2p |t|. Therefore E (f (Xn )) ≤ 2pE (|Xn |) ≤ 2pk.
(1.23)
By the elementary properties of the conditional expectation E ((Xn+1 − Xn ) f (Xn )) = E (E ((Xn+1 − Xn ) f (Xn )) | Fn ) = = E (f (Xn ) E ((Xn+1 − Xn )) | Fn ) = 0 for all n ∈ Z. From this and from (1.23), using the definition of g, for all n 2pk ≥ E (f (Xn )) ≥ E (f (Xn ) − f (X−n )) = =
n−1 i=−n
E (f (Xi+1 ) − f (Xi )) =
MARTINGALES
=
n−1
39
E (f (Xi+1 ) − f (Xi ) − (Xi+1 − Xi ) f (Xi ))
i=−n
n−1
E (g (Xi+1 , Xi )) .
i=−n
By the Monotone Convergence Theorem 2 ∗ ∗ (Xn+1 − Xn ) χ (X ≤ p) = E g (Xn+1 , Xn ) χ (X ≤ p) ≤ E n∈Z
n∈Z
≤E =
g (Xn+1 , Xn )
=
n∈Z
E (g (Xn+1 , Xn )) ≤ 2pk.
n∈Z
As X ∗ is almost surely finite,
n∈Z
2
(Xn+1 − Xn ) is almost surely convergent.
Corollary 1.64 Let X (Xn , Fn ) be a martingale over the natural numbers N. If X is bounded in L1 (Ω) and (τ n ) is an increasing sequence of stopping times then almost surely ∞
2
(X(τ n+1 ) − X(τ n )) < ∞.
(1.24)
n=1
Proof. For every m let us introduce the bounded stopping times τ m n τ n ∧ m. By the discrete-time version of the Optional Sampling Theorem32
X m X (τ m n ) , Fτ m n n is a martingale, and therefore from the proof of the previous proposition ∞ 2 m 2pk ≥ E X τm χ (X ∗ ≤ p) . n+1 − X (τ n ) n=1
If m → ∞ then by Fatou’s lemma ∞ 2 E (X (τ n+1 ) − X (τ n )) χ (X ∗ ≤ p) ≤ 2pk, n=1
from which (1.24) is obvious. 32 See:
Lemma 1.83, page 49.
40
STOCHASTIC PROCESSES
Corollary 1.65 Let X (Xn , Fn ) be a martingale over the natural numbers N. If X is bounded in L1 (Ω) then there is a variable X∞ such that |X∞ | < ∞ and a.s.
lim Xn = X∞ .
n→∞
Proof. Assume that for some ε > 0 on a set of positive measure A lim sup |Xp − Xq | ≥ 2ε.
(1.25)
p,q→∞
Let τ 0 1, and let τ n+1 inf {m ≥ τ n : |Xm − Xτ n | ≥ ε} . Obviously τ n is a stopping time for all n and the sequence (τ n ) is increasing. On the set A |X(τ n+1 ) − X(τ n )| ≥ ε. By (1.24) almost surely
∞ n=0
2
(X(τ n+1 ) − X(τ n )) < ∞ which is impossible.
Corollary 1.66 If X = (Xn , Fn ) is a non-negative martingale then there exists a finite, non-negative variable X∞ such that X∞ ∈ L1 (Ω) and almost surely Xn → X ∞ . Proof. X is non-negative and the expected value of Xn is the same for all n, a.s. hence X is obviously bounded in L1 (Ω). So Xn → X∞ exists. By Fatou’s lemma
X (0) = E (Xn | F0 ) = lim E (Xn | F0 ) ≥ E lim inf Xn | F0 = n→∞
n→∞
= E (X∞ | F0 ) ≥ 0 and therefore X∞ ∈ L1 (Ω). Corollary 1.67 Assume that Θ = R+ . If X is a uniformly integrable martingale then there is a variable X (∞) ∈ L1 (Ω) such that X (t) → X (∞), where the convergence holds in L1 (Ω) and almost surely. For all t a.s.
X (t) = E (X (∞) | Ft ) .
(1.26)
Proof. Every uniformly integrable set is bounded in L1 , so if tn ∞, then a.s. there is an X(∞) such that X(tn ) → X(∞). By the uniform integrability the convergence holds in L1 (Ω) as well. Obviously X(∞) as an equivalence class is independent of (tn ). The relation (1.26) is an easy consequence of the L1 (Ω)continuity of the conditional expectation.
MARTINGALES
41
Corollary 1.68 Assume that p ≥ 1 and Θ = R+ . If X ∈ Hp then there is a variable X (∞) ∈ Lp (Ω) such that X (t) → X (∞), where the convergence holds in Lp (Ω) and almost surely. For all t a.s.
X (t) = E (X (∞) | Ft ) .
(1.27)
Proof. If the measure is finite and p ≤ q then Lq ⊆ Lp . Hence if p ≥ 1 and X ∈ Hp then X ∈ H1 so, if tn ∞, then there is a variable X(∞) such that a.s. p p X(tn ) → X(∞). As by the definition of Hp spaces |X(t)| ≤ sups |X(s)| ∈ L1 (Ω), so X(∞) ∈ Lp (Ω) and by the Dominated Convergence Theorem the convergence holds in Lp (Ω) as well. Obviously X(∞), as an equivalence class, is independent of (tn ). The relation (1.27) is an easy consequence of the L1 (Ω) continuity of the conditional expectation. Theorem 1.69 (L´ evy’s convergence theorem) If (Fn ) is an increasing sequence of σ-algebras, ξ ∈ L1 (Ω) and F∞ σ (∪n Fn ) , then Xn E (ξ | Fn ) → E (ξ | F∞ ) , where the convergence holds in L1 (Ω) and almost surely. Proof. Let Xn E (ξ | Fn ). As E( |Xn |) E (|E (ξ | Fn )|)) ≤ E (E (|ξ| | Fn ))) = E(|ξ|) < ∞, a.s.
X = (Xn , Fn ) is an L1 (Ω) bounded martingale. Therefore Xn → X∞ . After the proof we shall prove as a separate lemma that the sequence (Xn ) is uniformly L1
integrable, hence Xn → X∞ . If A ∈ Fn , and m ≥ n, then Xm dP = ξdP, A
A
L1
hence as Xm → X∞
X∞ dP = A
ξdP,
A ∈ ∪n Fn .
(1.28)
A
As X∞ and ξ are integrable it is easy to see that the sets A for which (1.28) is true is a λ-system. As (Fn ) is increasing ∪n Fn is obviously a π-system. Therefore by the Monotone Class Theorem (1.28) is true if A ∈ F∞ σ (∪Fn ). X∞ is a.s. obviously F∞ -measurable, hence X∞ = E (ξ | F∞ ).
42
STOCHASTIC PROCESSES
Lemma 1.70 If ξ ∈ L1 , and (Fα )α∈A is an arbitrary set of σ-algebras then the set of random variables Xα E (ξ | Fα ) ,
α∈A
(1.29)
is uniformly integrable. Proof. By Markov’s inequality for every α P (|Xα | ≥ n) ≤
1 1 E (E (|ξ| | Fα )) = E (|ξ|) . n n
Therefore for any δ there is an n0 that if n ≥ n0 , then P (|Xα | ≥ n) < δ. As that is for X ∈ L1 (Ω) the integral function A |ξ| dP is absolutely continuous, arbitrary ε > 0 there is a δ such that if P (A) < δ, then A |ξ| dP < ε. Hence if n is large enough, then
{|Xα |>n}
|Xα | dP ≤
{|Xα |>n}
E (|ξ| | Fα ) dP =
{|Xα |>n}
|ξ| dP < ε,
which means that the set (1.29) is uniformly integrable. 1.3.4
The downcrossings inequality
Let X be an arbitrary adapted stochastic process and let a < b. Let us fix a point of time t, and let S {s0 < s1 < · · · < sm } be a certain finite number of moments in the time interval [0, t). Let33 τ 0 inf {s ∈ S : X (s) > b} ∧ t. With induction define τ 2k+1 inf {s ∈ S : s > τ 2k , X (s) < a} ∧ t, τ 2k inf {s ∈ S : s > τ 2k−1 , X (s) > b} ∧ t. It is easy to check that τ k is a stopping time for all k. It is easy to see that if X is an integrable submartingale then the inequality a.s.
τ 2k ≤ τ 2k+1 < t 33 If
the set after inf is empty, then the infimum is by definition +∞.
MARTINGALES
43
is impossible as in this case X (τ 2k ) > b, X (τ 2k+1 ) < a and by the submartingale property34 b < E(X (τ 2k )) ≤ E(X (τ 2k+1 )) < a, which is impossible. We say that function f downcrosses the interval [a, b] if there are points u < v with f (u) > b and f (v) < a. By definition f has n downcrosses with thresholds a, b on the set S if there are points in S u1 < v1 < u2 < v2 < · · · < un < vn with f (uk ) > b, f (vk ) < a. Let us denote by DSa,b the a < b downcrossings of X in the set S. Obviously DSa,b ≥ n = {τ 2n−1 < t} ∈ Ft , and hence DSa,b is Ft -measurable. We show that χ
DSa,b
≥n ≤
m k=0
+
(X(τ 2k ) − X(τ 2k+1 )) + (X(t) − b) . n(b − a)
(1.30)
Recall that m is the number of points in S. Therefore the maximum number of possible downcrossings is obviously m. If we have more than n downcrossings then in the sum the first n term is bigger than b − a. For every trajectory all but the last non-zero terms of the sum are positive as they are all not smaller than b − a > 0. There are two possibilities: in the last non-zero term either τ 2k+1 < t or τ 2k+1 = t. In the first case X(τ 2k ) − X(τ 2k+1 ) > b − a > 0. In the second case still X (τ 2k ) > b, therefore in this case X (τ 2k ) − X (τ 2k+1 ) > b − X(t). Of course b − X(t) can be negative. This is the reason why we added to the sum + the correction term (X(t) − b) . If b − X(t) < 0 then +
X (τ 2k ) − X (τ 2k+1 ) + (X(t) − b) = X (τ 2k ) − X (τ 2k+1 ) + X(t) − b = = X (τ 2k ) − X (t) + X(t) − b = = X (τ 2k ) − b > 0, 34 See:
Lemma 1.83, page 49.
44
STOCHASTIC PROCESSES
which means that (1.30) always holds. Taking the expectation on both sides P
DSa,b
m k=0
≥n ≤E
+
(X(τ 2k ) − X(τ 2k+1 )) + (X(t) − b) n(b − a)
=
1 E (X(τ 2k ) − X(τ 2k+1 )) + n (b − a) k=0
1 + + E (X(t) − b) . n (b − a) m
=
Now assume that X is an integrable submartingale. As t ≥ τ 2k+1 ≥ τ 2k by the discrete Optional Sampling Theorem35 E (X(τ 2k ) − X(τ 2k+1 )) ≤ 0, so
P DSa,b ≥ n ≤
+ E (X(t) − b) n (b − a)
.
If the number of points of S increases by refining S then the number of downcrossings DSa,b does not decrease. If S is an arbitrary countable set then the number of downcrossings in S is the supremum of the downcrossings of the finite subsets of S. With the Monotone Convergence Theorem we get the following important inequality: Theorem 1.71 (Downcrossing inequality) If X is an integrable submartingale and S is an arbitrary finite or countable subset of the time interval [0, t) then
E ((X(t) − b)+ ) P DSa,b ≥ n ≤ . n (b − a) In particular
P DSa,b = ∞ = 0. There are many important consequences of this inequality. The first one is a generalization of the martingale convergence theorem. Corollary 1.72 (Submartingale convergence theorem) Let X (Xn , Fn ) be a submartingale over the natural numbers N. If X is bounded in L1 (Ω) then 35 See:
Lemma 1.83, page 49.
MARTINGALES
45
there is a variable X∞ ∈ L1 (Ω) such that a.s.
lim Xn = X∞ .
(1.31)
n→∞ a.s.
Proof. If Xn → X∞ then by Fatou’s lemma E (|X∞ |) ≤ lim inf E (|Xn |) ≤ k < ∞ n→∞
and X∞ ∈ L1 (Ω). Let a < b be rational thresholds, and let Sm {1, 2, . . . , m}. As E (|Xm |) ≤ k for all m
P DSa,b ≥n ≤ m
+ E (Xm − b) n (b − a)
≤
k . n(b − a)
If m ∞ then for all n
P DNa,b = ∞ ≤ P DNa,b ≥ n ≤
k , n(b − a)
which implies that P DNa,b = ∞ = 0. The convergence in (1.31) easily follows from the next lemma: Lemma 1.73 Let (cn ) be an arbitrary sequence of real numbers. If for every a < b rational thresholds the number of downcrossings of the sequence (cn ) is finite then the (finite or infinite) limit limn→∞ cn exists. Proof. The lim supn cn and the lim inf n cn extended real numbers always exist. If lim inf cn < a < b < lim sup cn n→∞
n→∞
then the number of the downcrossings of (cn ) is infinite. Definition 1.74 Let ξ ∈ L1 (Ω) and let Xn E (ξ | Fn ) , n ∈ N. Assume that the sequence of σ-algebras (Fn ) is decreasing, that is Fn+1 ⊆ Fn for all n ∈ N. These type of sequences are called reversed martingales. If Y−n Xn for all n ∈ N and G−n Fn then Y = (Yn , Gn ) is martingale over the parameter set Θ = {−1, −2, . . .}. If (Xn , Fn ) is a reversed martingale then one can assume that Xn = E (X0 | Fn ) for all n. If X is a continuous-time martingale and tn t∞ then the sequence (X(tn ), Ftn )n is a reversed martingale.
46
STOCHASTIC PROCESSES
Theorem 1.75 (L´ evy) If (Fn ) is a decreasing sequence of σ-algebras, X0 ∈ L1 (Ω) and F∞ ∩n Fn then Xn E (X0 | Fn ) → E (X0 | F∞ ) , where the convergence holds in L1 (Ω) and almost surely. Proof. As (Xn ) is uniformly integrable36 , it is sufficient to prove that (Xn ) is almost surely convergent. Let a < b be rational thresholds. On the set A
lim inf Xn < a < b < lim sup Xn n→∞
n→∞
the number of downcrossings is infinite. As n → X−n is a martingale on Z, the probability of A is zero. Hence a.s.
lim inf Xn = lim sup Xn . n→∞
1.3.5
n→∞
Regularization of martingales
Recall that, by definition, every continuous-time martingale is right-regular. Let F be an arbitrary filtration, and let ξ ∈ L1 (Ω). In discrete-time the sequence Xn E(ξ | Fn ) is a martingale as for every s < t a.s.
E (X(t) | Fs ) E (E(ξ | Ft ) | Fs ) = E (ξ | Fs ) X(s). In continuous-time X is not necessarily a martingale as the trajectories of X are not necessarily right-regular. Definition 1.76 A stochastic process X has martingale structure if E (X (t)) is finite for every t and a.s.
E (X(t) | Fs ) = X(s) for all s < t. Our goal is to show that if the filtration F satisfies the usual conditions then every stochastic process with martingale structure has a modification which is a 36 See:
Lemma 1.70, page 42.
MARTINGALES
47
martingale. The proof depends on the following simple lemma: Lemma 1.77 If X has a martingale structure then there is an Ω0 ⊆ Ω with P(Ω0 ) = 1, such that for every trajectory X(ω) with ω ∈ Ω0 and for every rational threshold a < b the number of downcrossings over the rational numbers a,b is finite. In particular if ω ∈ Ω0 then for every t ∈ Θ the (finite or infinite) DQ limits lim X(s, ω),
st, s∈Q
lim X(s, ω)
st, s∈Q
exist. Proof. The first part of the lemma is a direct consequence of the downcrossings inequality. If limn X(sn , ω) does not exist for some sn t then for some rational / Ω0 . thresholds a < b the number of downcrossings of (X(sn , ω)) is infinite, so ω ∈ Assume that X has a martingale structure. Let Ω0 ⊆ Ω be the subset in the lemma above. (t, ω) X
0 if ω ∈ / Ω0 . limst,s∈Q X(s, ω) if ω ∈ Ω0
(1.32)
is right-regular. Let t < s, ε > 0. We show that X (s, ω) ≤ X (t, ω) − X (tn , ω) + X (t, ω) − X
(s, ω) . + |X (tn , ω) − X (sn , ω)| + X (sn , ω) − X
As for an arbitrary ω ∈ Ω0 the number of ε/3 downcrossings of X over the Q is finite, so one can assume that in a right neighbourhood (t.t + u) of t for every tn , sn ∈ Q |X (tn , ω) − X (sn , ω)| <
ε . 3
From this, obviously, there is a δ such that if t < s < t + δ, then (s, ω) < ε. X (t, ω) − X have left limits. In a similar way one can prove that in Ω0 the trajectories of X Of course, without further assumptions we do not know that X is a modification of X. Assume that F satisfies the usual conditions. If tn t and tn ∈ Q then
48
STOCHASTIC PROCESSES
by L´evy’s theorem37 a.s. a.s. a.s = lim X(tn ) = lim E (X(t0 ) | Ftn ) = E (X(t0 ) | Ft+ ) . X(t) n→∞
n→∞
As F is right-continuous Ft+ = Ft . As X has a martingale structure a.s. a.s. X(t) = E (X(t0 ) | Ft ) = X(t),
is a modification of X. As F contains the measure-zero sets X and therefore X is F-adapted. This proves the following observation: Theorem 1.78 If X has a martingale structure and the filtration F satisfies the usual conditions then X has a modification which is a martingale. Corollary 1.79 If F satisfies the usual conditions and X is a uniformly inte over Θ [0, ∞] grable martingale over Θ = [0, ∞) then there is a martingale X which is indistinguishable from X over Θ. Proof. From the martingale convergence theorem38 there is an X(∞) ∈ L1 (Ω) a.s. such that X(t) = E(X(∞) | Ft ) for all t. On [0, ∞] X has a martingale structure which is a martingale over [0, ∞]. On [0, ∞) X and so it has a modification X are indistinguishable39 . X are right-regular so X and X From now on if X is a uniformly integrable martingale over Θ R+ then we shall always assume that X is a martingale over [0, ∞]. Example 1.80 One cannot extend the theorem to submartingales.
For arbitrary Ω let Ft A {∅, Ω}. Every function f on R+ is an adapted stochastic process. (Ω, A, P, F) obviously satisfies the usual conditions. If f is increasing then f has a ‘submartingale structure’, but if f is not right-continuous then f is not a submartingale. If f is not right-continuous then it does not have a right-continuous modification. Sometimes one cannot assume that the filtration satisfies the usual conditions. In this case one can use the following proposition: Proposition 1.81 Assume that X has a martingale structure and X is continuous in probability from the right. If F contains the measure-zero sets then X has a modification which is a martingale. 37 See:
Theorem 1.75, page 46. (1.26), page 40. 39 See: Proposition 1.9, page 7. 38 See:
MARTINGALES
49
a.s.
Proof. X is continuous from the right in probability. Therefore X(sn ) → X(t) is the right-regular process in (1.32) then for some sn t. So if X a.s. a.s. = lim X(sn ) = X(t). X(t) n→∞
is a right-regular and adapted modification of X. Therefore X The regularity of the trajectories is an essential condition. Example 1.82 If the trajectories of martingales were not regular then most of the results of the continuous-time martingale theory would not be true.
Let (Ω, A,P) ([0, 1] , B ([0, 1]) , λ) where λ denote the Lebesgue measure. If 2 Ft A B ([0, 1]) and ∆ denote the diagonal of [0, 1] then X χ∆ has a martingale structure, but if a = 1 then 1 = aP sup X (t) ≥ a > sup X + (t) = 0, t∈[0,1]
t∈I
1
that is, without the regularity of the trajectories Doob’s inequality does not hold. Of course Y ≡ 0 is regular modification of X, and for Y Doob’s inequality holds. 1.3.6
The Optional Sampling Theorem
As a first step let us prove the discrete-time version of the Optional Sampling Theorem40 . Lemma 1.83 Let X = (Xn , Fn ) be a discrete-time, integrable submartingale. If τ 1 and τ 2 are stopping times and for some p < ∞ P (τ 1 ≤ τ 2 ) = P (τ 2 ≤ p) = 1, then X(τ 1 ) ≤ E (X(τ 2 ) | Fτ 1 ) and E (X0 ) ≤ E (X(τ 1 )) ≤ E (X(τ 2 )) ≤ E (Xp ) . If X is a martingale then in both lines above equality holds everywhere. 40 The reader should observe that we have already used this lemma several times. Of course the proof of the lemma is independent of the results above.
50
STOCHASTIC PROCESSES
Proof. Let τ 1 ≤ τ 2 ≤ p and ϕk χ (τ 1 < k ≤ τ 2 ) . Observe that {ϕk = 1} = {τ 1 < k, τ 2 ≥ k} = c
= {τ 1 ≤ k − 1} ∩ {τ 2 ≤ k − 1} ∈ Fk−1 . By the assumptions Xk is integrable for all k, so Xk − Xk−1 is also integrable, therefore the conditional expectation of the variable Xk − Xk−1 with respect to the σ-algebra Fk−1 exists. ϕk is bounded, hence p E (η) E ϕk [Xk − Xk−1 ] = k=1
=
p
E (E (ϕk [Xk − Xk−1 ] | Fk−1 )) =
k=1
=
p
E (ϕk E (Xk − Xk−1 | Fk−1 )) ≥ 0.
k=1
If τ 1 (ω) = τ 2 (ω) for some outcome ω, then ϕk (ω) = 0 for all k, hence η (ω) 0. If τ 1 (ω) < τ 2 (ω), then η (ω) X (τ 1 (ω) + 1) − X (τ 1 (ω)) + X (τ 1 (ω) + 2) − X (τ 1 (ω) + 1) + . . . + X (τ 2 (ω)) − X (τ 2 (ω) − 1) , which is X (τ 2 (ω)) − X (τ 1 (ω)). Therefore E (η) = E (X (τ 2 ) − X (τ 1 )) ≥ 0. Xk is integrable for all k, therefore E (X (τ 1 )) and E (X (τ 2 )) are finite. By the finiteness of these expected values E (X (τ 2 ) − X (τ 1 )) = E (X (τ 2 )) − E (X (τ 1 )) , hence E (X (τ 2 )) ≥ E (X (τ 1 )) . Let A ∈ Fτ 1 ⊆ Fτ 2 , and let us define the variables τ k (ω) if ω ∈ A . τ ∗k (ω) p + 1 if ω ∈ /A
(1.33)
MARTINGALES
51
τ ∗1 and τ ∗2 are stopping times since if n ≤ p, then {τ ∗k ≤ n} = A ∩ {τ k ≤ n} = A ∩ {τ k ≤ n} ∈ Fn . By (1.33) E (X
(τ ∗2 ))
=
X (τ 2 ) dP+ Ac
A
X (p + 1) dP ≥ E (X (τ ∗1 )) =
X (τ 1 ) dP+
=
X (p + 1) dP. Ac
A
As Xp+1 is integrable one can cancel inequality so
Ac
X (p + 1) dP from both sides of the
X (τ 2 ) dP ≥
A
X (τ 1 ) dP. A
X (τ 1 ) is Fτ 1 -measurable and therefore E (X (τ 2 ) | Fτ 1 ) ≥ X (τ 1 ) . To prove the continuous-time version of the Optional Sampling Theorem we need some technical lemmas: Lemma 1.84 If τ is a stopping time, then there is a sequence of stopping times (τ n ) such that τ n has finite number of values41 , τ < τ n for all n and τn τ. (n)
Proof. Divide the interval [0, n) into n2n equal parts. Ik Let τ n (ω)
k/2n +∞
if otherwise
[(k − 1) /2n , k/2n ).
ω ∈ τ −1 (Ik ) (n)
.
(n)
Obviously τ < τ n . At every step the subintervals Ik are divided equally, and (n) (n) the value of τ n on τ −1 (Ik ) is always the right endpoint of the interval Ik . Therefore τ n τ . τ is a stopping time, hence, using that, every stopping time is a weak stopping time τ 41 τ
n (ω)
−1
(n) Ik
= +∞ is possible.
=
k τ< n 2
k−1 ∩ τ< 2n
c ∈ Fk/2n .
52
STOCHASTIC PROCESSES
Therefore
i τn ≤ n 2
=
k τn = n 2
k≤i
=
(n) τ −1 Ik ∈ Fi/2n . k≤i
The possible values of τ n are among the dyadic numbers i/2n and therefore τ n is a stopping time. Lemma 1.85 If (τ n ) is a sequence of stopping times and τ n τ then Fτ n + Fτ + . If τ n > τ and τ n τ then Fτ n Fτ + . Proof. Recall that by definition A ∈ Fρ+ if A ∩ {ρ ≤ t} ∈ Ft+ for every t. If A ∈ Fρ+ , then A ∩ {ρ < t} =
n
1 A∩ ρ≤t− n
∈ ∪n F(t−1/n)+ ⊆ Ft .
1. Let A ∈ Fρ+ and let ρ ≤ σ. A ∩ {σ ≤ t} = A ∩ {ρ ≤ t} ∩ {σ ≤ t} ∈ Ft+ as A ∩ {ρ ≤ t} ∈ Ft+ and {σ ≤ t} ∈ Ft . From this it is easy to see that Fτ + ⊆ ∩n Fτ n + . If A ∈ ∩n Fτ n + , then as τ n τ A ∩ {τ < t} = A
(∪n {τ n < t}) =
(A ∩ {τ n < t}) ∈ Ft .
n
So A ∩ {τ ≤ t} =
n
1 A∩ τ
∈
Ft+1/n = Ft+
n
that is A ∈ Fτ + . 2. If A ∈ Fρ+ and ρ < σ then as {σ ≤ t} ∈ Ft A ∩ {σ ≤ t} = A ∩ {ρ < t} ∩ {σ ≤ t} ∈ Ft , so A ∈ Fσ . From this it is easy to see that if τ < τ n then Fτ + ⊆ ∩n Fτ n . On the other hand ∩n Fτ n ⊆ ∩n Fτ n + = Fτ + and so if τ < τ n then ∩n Fτ n = Fτ + .
MARTINGALES
53
Theorem 1.86 (Optional Sampling Theorem for martingales) Let X be a martingale, and let τ 1 ≤ τ 2 be stopping times. If X is uniformly integrable, or if τ 1 and τ 2 are bounded then a.s.
X (τ 1 ) = E (X (τ 2 ) | Fτ 1 + ) .
(1.34)
Proof. Let τ be a bounded stopping time and let τ (n) τ , τ (n) > τ be a finitevalued approximating sequence42 . As τ is bounded there is an N large enough that τ (n) ≤ N . By the first lemma X(τ (n) ) = E (X(N ) | Fτ (n) ) .
(1.35)
As τ (n) > τ , by the last lemma ∩n Fτ (n) = Fτ + . So by the definition of the conditional expectation (1.35) means that X(τ (n) )dP = X(N )dP, A ∈ Fτ + . A
A
X(N ) is integrable therefore the sequence X(τ (n) ) is uniformly integrable43
by (1.35). By the right-continuity of the martingales X (τ ) = limn→∞ X τ (n) , so if A ∈ Fτ + then (n) X(N )dP = lim X(τ )dP = lim X(τ (n) )dP = n→∞
A
=
A
A n→∞
X(τ )dP. A
As X (τ ) is Fτ -measurable and Fτ ⊆ Fτ + , X (τ ) = E (X (N ) | Fτ + ) . If X is uniformly integrable then one can assume that X is a martingale on [0, ∞]. There is a continuous bijective time transformation f between the intervals [0, ∞] and [0, 1]. During this transformation the properties of X and τ do not change, but f (τ ) will be bounded, so using the same argument as above one can prove that X (τ ) = E (X (∞) | Fτ + ) . Finally if τ 1 ≤ τ 2 , then as Fτ 1 + ⊆ Fτ 2 + E (X (τ 2 ) | Fτ 1 + ) = E (E (X (N ) | Fτ 2 + ) | Fτ 1 + ) = = E (X (N ) | Fτ 1 + ) = X (τ 1 ) , where if X is uniformly integrable, then N ∞. 42 See: 43 See:
Lemma 1.84, page 51. Lemma 1.70, page 42.
54
STOCHASTIC PROCESSES
Corollary 1.87 If X is a non-negative martingale and τ 1 ≤ τ 2 , then X(τ 1 ) ≥ E (X(τ 2 ) | Fτ 1 + ) .
(1.36)
Proof. First of all let us remark, that as X is a non-negative martingale X(∞) is meaningful 44 , and if n ∞ then X (τ ∧ n) → X (τ ) for every stopping time τ . Let G σ ∪n F(τ ∧n)+ . Obviously G ⊆ Fτ + . Let A ∈ Fτ + . A ∩ {τ ≤ n} ∩ {τ ∧ n ≤ t} = A ∩ {τ ≤ t ∧ n} ∈ Ft+ , therefore A ∩ {τ ≤ n} ∈ F(τ ∧n)+ . So A ∩ {τ < ∞} ∈ G. Also A ∩ {τ > n} ∩ {τ ∧ n ≤ t} = A ∩ {t ≥ τ > n} ∈ Ft+ so A ∩ {τ > n} ∈ F(τ ∧n)+ . Hence A ∩ {τ = ∞} = A ∩ (∩n {τ > n}) ∈ G, therefore G = Fτ + . Let n1 ≤ n2 . By the Optional Sampling Theorem
X(τ 1 ∧ n1 ) = E X(τ 2 ∧ n2 ) | F(τ 1 ∧n1 )+ . X(τ 2 ∧ n2 ) ∈ L1 (Ω) and therefore by L´evy’s theorem X(τ 1 ) = E (X(τ 2 ∧ n2 ) | Fτ 1 + ) . By Fatou’s lemma X(τ 1 ) = lim E (X(τ 2 ∧ n2 ) | Fτ 1 + ) ≥ E n2 →∞
lim X(τ 2 ∧ n2 ) | Fτ 1 +
n2 →∞
=
= E (X(τ 2 ) | Fτ 1 + ) .
Proposition 1.88 (Optional Sampling Theorem for submartingales) Let τ 1 ≤ τ 2 bounded stopping times. If X is an integrable submartingale then X (τ 1 ) and X (τ 2 ) are integrable and X (τ 1 ) ≤ E (X (τ 2 ) | Fτ 1 ) .
(1.37)
The inequality also holds if τ 1 ≤ τ 2 are arbitrary stopping times and X can be extended as an integrable submartingale to [0, ∞]. Proof. The proof of the proposition is nearly the same as the proof in the martingale case. Again it is sufficient to prove the inequality in the bounded 44 See:
Corollary 1.66, page 40.
MARTINGALES (n)
55
(n)
case. Assume that τ 1 ≤ τ 2 ≤ K and let (τ 1 )n and (τ 2 )n be the finite-valued (n) (n) approximating sequences of τ 1 and τ 2 . By the construction τ 1 ≤ τ 2 , so by the first lemma of the subsection (n) (n) X(τ 1 )dP ≤ X(τ 2 )dP, F ∈ Fτ 1 + . F
F
(n)
By the right-continuity of submartingales X(τ k ) → X(τ k ) and therefore one should prove that the convergence holds in L1 (Ω), that is, one should prove the (n) uniform integrability of the sequences (X(τ k )). Since in this case one can take the limits under the integral signs therefore X(τ 1 )dP ≤ X(τ 2 )dP, F ∈ Fτ 1 + . F
F
As X(τ 1 ) is Fτ 1 + -measurable by the definition of the conditional expectation X (τ 1 ) = E (X (τ 1 ) | Fτ 1 ) ≤ E (X (τ 2 ) | Fτ 1 + ) . This means that (1.37) holds. Let us prove that the sequence uniformly integrable.
(n) X(τ k ) is
1. As X is submartingale, X + is also submartingale, therefore from the finite Optional Sampling Theorem
(n) ≤ E X + (K) | Fτ (n) . 0 ≤ X+ τ k k
The right-hand side is uniformly integrable45 , so the left-hand side is also uniformly integrable. (n)
2. Let Xn X(τ k ). By the finite Optional Sampling Theorem (Xn ) is obviously an integrable reversed submartingale. Let n > m. As (Xn ) is a reversed submartingale 0≤ Xn− dP = − Xn dP = Xn dP − E(Xn ) ≤ {Xn− ≥N } {Xn− ≥N } {Xn−
m and as Xn is a reversed submartingale E (X (0)) ≤ E(Xn ) ≤ E(Xm ) ≤ E(X (K)). 45 See:
Lemma 1.70, page 42.
56
STOCHASTIC PROCESSES
X is an integrable submartingale, so E(X (0)) is finite. Hence the sequence (E(Xn )) is convergent. If m is large enough then 0 ≤ E(Xm ) − E(Xn ) ≤ ε/2. Xm is integrable so the integral function A Xm dP is absolutely continuous. Therefore it is sufficient to prove that for an arbitrary δ there is an N such that for all n
P Xn− ≥ N ≤ δ. By Markov’s inequality
E(Xn− ) Xn 1 E(|Xn |) ≤ = . P Xn− ≥ N ≤ N N N But since (Xn+ ) is also a reversed submartingale
Xn 1 = E Xn+ − Xn− = E Xn+ + Xn+ − Xn =
= 2E Xn+ − E (Xn ) ≤ 2E X + (K) − E (Xn ) ≤
≤ 2E X + (K) − E (X (0)) L. Hence for all n
L →0 P Xn− ≥ N ≤ N and therefore (Xn ) is uniformly integrable. Example 1.89 The right-regularity and the assumption of uniform integrability of the martingales are important.
Let P be a Poisson process with parameter λ, and let π (t) P (t) − λt be the so-called compensated Poisson process. Recall that the Poisson processes are, by definition, right-continuous, so it is easy to see that π is a martingale. Let τ denote the time of the first jump of P . If N > 0, then σ τ ∧ N is a bounded stopping time. If π were not right but left-continuous then one could not apply the Optional Sampling Theorem: if P were left-continuous then P (σ) = 0, and E (π (0)) = 0 = E (−λσ) = E (P (σ) − λσ) = E (π (σ)) . Let w be a Wiener process and let τ a inf {t : w(t) = a}
MARTINGALES
57
be the first passage time of an a = 0. As w is not uniformly integrable and τ a is unbounded, one cannot apply the Optional Sampling Theorem: almost surely46 a.s. τ a < ∞, hence w (τ a ) = a. Therefore E (w (τ a )) = E (a) = a = 0 = E (w (0)) .
Example 1.90 The exponential martingales of Wiener processes are not uniformly integrable.
Let w be a Wiener process. If the so-called exponential martingale X (t) exp (w (t) − t/2) were uniformly integrable, then for every stopping time one could apply the Optional Sampling Theorem. X is a non-negative martingale, therefore there is47 a random variable X (∞) such that almost surely X(t) → X(∞). For almost all trajectories of w the set {w = 0} is unbounded48 , therefore w(σ n ) = 0 for some sequence σ n ∞. Therefore σ
σn
a.s. n X (∞) = lim X (σ n ) lim exp w (σ n ) − = lim exp − = 0. n→∞ n→∞ n→∞ 2 2 a.s.
Since X(0) = 1, X(∞) = 0 and X is continuous, if a < 1 then almost surely τ a inf {t : X(t) = a} < ∞. a.s.
That is X (τ a ) = a. So if a < 1, then E (X (0)) = 1 > a = E (X (τ a )) . Hence X is not uniformly integrable. Proposition 1.91 (Martingales and conservation of the expected value) Let X be an adapted and right-regular process. X is a martingale if and only if X(τ ) ∈ L1 (Ω)
and
E (X(τ )) = E (X(0))
for all bounded stopping times τ . This property holds for every stopping time τ if and only if X is a uniformly integrable martingale. 46 See:
Proposition B.7, page 564. Corollary 1.66, page 40. 48 See: Corollary B.8, page 565. 47 See:
58
STOCHASTIC PROCESSES
Proof. If X is a martingale, or uniformly integrable martingale, then by the Optional Sampling Theorem the proposition holds. Let s < t and let A ∈ Fs . It is easy to check that τ = tχAc + sχA
(1.38)
is a bounded stopping time. By the assumption of the proposition E (X(0)) = E (X(τ )) = E (X(t)χAc ) + E (X(s)χA ) . As τ ≡ t is also a stopping time, E (X(0)) = E (X(t)) = E (X(t)χAc ) + E (X(t)χA ) . Comparing the two equations E (X(s)χA ) = E (X(t)χA ) , that is E (X(s) | Fs ) = E (X(t) | Fs ) . As X is adapted, X(s) is Fs -measurable so X(s) = E (X(t) | Fs ). If one can apply the property E (X(τ )) = E (X(0)) for every stopping time τ then one can apply it for the stopping time τ ≡ ∞ as well. Hence X (∞) exists and in (1.38) t = ∞ is possible, hence X(s) = E (X(∞) | Fs ) , so X is uniformly integrable49 . Corollary 1.92 (Conservation of the martingale property under truncation) If X is a martingale and τ is a stopping time then the truncated process X τ is also a martingale. Proof. If X is right-regular then the truncated process X τ is also right-regular. By Proposition 1.35 X τ is adapted. Let φ be a bounded stopping time. As υ φ ∧ τ is a bounded stopping time by Proposition 1.91 E (X τ (φ)) = E (X(υ)) = E (X(0)) = E (X τ (0)) and therefore X τ is a martingale. 1.3.7
Application: elementary properties of L´ evy processes
L´evy processes are natural generalizations of Wiener and Poisson processes. Let us fix a stochastic base space (Ω, A, P, F) and assume that Θ = [0, ∞). Definition 1.93 Let X be an adapted stochastic process. X is a process with independent increments with respect to the filtration F if 49 See:
Lemma 1.70, page 42 .
MARTINGALES
59
1. X (0) = 0, 2. X is right-regular, 3. whenever s < t then the increment X (t) − X (s) is independent of the σ-algebra Fs . A process X with independent increments is a L´evy process, if it has stationary or homogeneous increments that is for every t and for every h > 0 the distribution of the increment X(t + h) − X(t) is the same as the distribution of X(h) − X(0). By definition every L´evy process and every process with independent increments has right-regular trajectories. This topological assumption is very important as it is not implied by the other assumptions: Example 1.94 Not every process starting from zero and having stationary and independent increments is a L´evy process.
Let Ω be arbitrary and A = Ft = {∅, Ω} and let (xα )α be a Hamel basis of R over the rational numbers. For every t let X(t) be the sum of the coordinates of t in the Hamel basis. Obviously X(t + s) = X(t) + X(s) so X has stationary and independent increments. But as X is highly discontinuous50 it does not have a modification which is a L´evy process. Example 1.95 The sum of two L´evy processes is not necessarily a L´evy process51 .
We show that even the sum of two Wiener processes is not a Wiener process. The present counter example is very important as it shows that, although the L´evy processes are the canonical and most important examples of semimartingales, they are not the right objects from the point of view of the theory. The sum of two semimartingales52 is a semimartingale and the same is true for martingales or for local martingales. But it is not true for L´evy processes! 1. Let Ω be the set of two-dimensional continuous functions R+ → R2 with the property f (0) = (0, 0). Let P1 be a measure on the Borel σ-algebra of Ω for which the canonical stochastic process X (ω, t) = ω (t) is a two-dimensional Wiener process with correlation coefficient 1. In the same way let P2 be the measure on Ω under which X is a Wiener process with correlation coefficient −1. Let P (P1 + P2 )/2. It is easy to see that the coordinate processes w1 (t) and 50 The
image space of X is the rational numbers! example depends on results which we shall prove later. So the reader can skip the example at the first reading. 52 We shall introduce the definitions of semimartingales and local martingales later. 51 The
60
STOCHASTIC PROCESSES
w2 (t) are Wiener processes. On the other hand, a simple calculation shows that the distribution of Z w1 + w2 is not Gaussian. Z is continuous and every continuous L´evy process is a linear combination of a Wiener process and a linear trend53 , therefore, as Z is not a Gaussian process it cannot be a L´evy process. 2. The next example is bit more technical, but very similar: Let w be a Wiener t process with respect to some filtration F. Let X (t) 0 sign (w) dw, where the integral, of course, is an Itˆ o integral. The quadratic variation of X is
t
2
(sign (w)) d [w] =
[X] (t) = 0
t
1ds = t 0
so by L´evy’s characterization theorem54 the continuous local martingale X is also a Wiener process55 with respect to F. If Z w + X = 1 • w + sign (w (s)) • w = (1 + sign (w (s))) • w then Z is a continuous martingale with respect to F with zero expected value. [Z] (t) =
t
2
(1 + sign (w)) d [w] = 0
t
2
(1 + sign (w (s))) ds 0
so Z is not a Wiener process. As in the first example, every continuous L´evy process is a linear combination of a Wiener process and a linear trend, therefore, as Z is not a Wiener process it cannot be a L´evy process. During the proof of the next proposition, we shall need the next very useful simple observation: Lemma 1.96 ξ 1 and ξ 2 are independent vector-valued random variables if and only if ϕ = ϕ 1 · ϕ2 , where ϕ1 is the Fourier transform of ξ 1 and ϕ2 is the Fourier transform of ξ 2 and ϕ is the Fourier transform of the joint distribution of (ξ 1 , ξ 2 ). Proof. If ξ 1 and ξ 2 are independent then the decomposition obviously holds. The other implication is an easy consequence of the Monotone Class Theorem: 53 See:
Theorem 6.11, page 367. Theorem 6.13, page 368. 55 See: Example 6.14, page 370. 54 See:
MARTINGALES
61
fix a vector v and let L be the set of bounded functions u for which E (u (ξ 1 ) · exp (i (v, ξ 2 ))) = E (u (ξ 1 )) · E (exp (i (v, ξ 2 ))) . L is obviously a λ-system. Under the conditions of the lemma L contains the π-system of the functions u (x) = exp (i (u, x)) , so it contains the characteristic functions of the sets of the σ-algebra generated by these exponential functions. Therefore it is easy to see that for every Borel measurable set B E (χB (ξ 1 ) · exp (i (v, ξ 2 ))) = P (ξ 1 ∈ B) · E (exp (i (v, ξ 2 ))) . Now let L be the set of bounded functions v for which E (χB (ξ 1 ) · v (ξ 2 )) = P (ξ 1 ∈ B) · E (v (ξ 2 )) . With the same argument as above, by the Monotone Class Theorem for any Borel measurable set D, one can choose v = χD . So P (ξ 1 ∈ B, ξ 2 ∈ D) = E (χB (ξ 1 ) · χD (ξ 2 )) = P (ξ 1 ∈ B) · P (ξ 2 ∈ D) therefore, by independent.
definition,
the
random
vectors
ξ1
and
ξ2
are
Proposition 1.97 For an adapted process X the increments are independent if and only if the σ-algebra Gt generated by the increments X (u) − X (v) ,
u≥v≥t
is independent of Ft for every t. Proof. To make the notation as simple as possible let X (t0 ) denote an arbitrary Ft0 -measurable random variable. Let 0 = t−1 ≤ t = t0 ≤ t1 ≤ t2 ≤ . . . ≤ tn . We show that if X has independent increments then the random variables X(t0 ), X(t1 ) − X(t0 ), X(t2 ) − X(t1 ), . . . , X(tn ) − X(tn−1 )
(1.39)
are independent. To prove this one should prove that the Fourier transform of the joint distribution of the variables in (1.39) is the product of the Fourier
62
STOCHASTIC PROCESSES
transforms of the distributions of these increments: n uj [X(tj ) − X(tj−1 )] = ϕ(u) E exp i
j=0
= E E exp i
= E exp i
= E exp i
= E exp i
= E exp i
n j=0
n−1
uj ∆X(tj ) E (exp (iun ∆X(tn ))) =
uj ∆X(tj ) ϕtn ,tn−1 (un ) =
j=0 n−1
uj ∆X(tj ) | Ftn−1 =
j=0 n−1
uj ∆X(tj ) E exp (iun ∆X(tn )) | Ftn−1 =
j=0 n−1
uj ∆X(tj ) ϕtn ,tn−1 (un ) = · · · =
j=0
=
n !
ϕtj ,tj−1 (uj ).
j=0
Of course this means that the σ-algebra generated by a finite number of increments is independent of Ft for any t. As the union of σ-algebras generated by finite number of increments is a π-system, with the uniqueness of the extension of the probability measures from π-systems one can prove that the σ-algebra generated by the increments is independent of Ft . Let us denote by ϕt the Fourier transform of X(t). As X has stationary and independent increments, for every u ϕt+s (u) E (exp (iuX(t + s))) = = E (exp (iu (X(t + s) − X (t))) exp (iuX(t))) = = E (exp (iu (X(t + s) − X (t)))) · E (exp (iuX(t))) = = E (exp (iuX(s))) · E (exp (iuX(t))) ϕt (u) · ϕs (u), therefore ϕt+s (u) = |ϕt (u)| · |ϕs (u)| .
(1.40)
MARTINGALES
63
As |ϕt (u)| ≤ 1 for all u and as |ϕ0 (u)| = 1 from Cauchy’s functional equation |ϕt (u)| = exp (t · c(u)) . This implies that ϕt (u) is never zero. Let h > 0. ϕt (u) − ϕt+h (u) = |ϕt (u)| 1 − ϕt+h (u) ≤ ϕt (u) ≤ |1 − ϕh (u)| . X is right-continuous so if h 0 then by the Dominated Convergence Theorem, using that X (0) = 0 lim ϕh (u) = ϕ0 (u) = 1.
h0
So ϕt (u) is right-continuous. If t > 0 then ϕt (u) − ϕt−h (u) = ϕt−h (u) 1 − ϕt (u) ≤ ϕt−h (u) ≤ |1 − ϕh (u)| → 0, so ϕt (u) is also left-continuous. Hence ϕt (u) is continuous in t. Therefore E(exp(iu∆X(t))) = lim E(exp(iu(X(t) − X(t − h)))) = h0
= lim
h0
ϕt (u) = 1, ϕt−h (u)
so ∆X(t) = 0 almost surely. a.s.
a.s.
Hence for some subsequence X (tnk ) → X (t). This implies that X (t−) = X (t). Therefore one can make the next important observation:
Proposition 1.98 If X is a L´evy process then ϕt (u) = 0 for every u and the probability of a jump at time t is zero for every t. This implies that every L´evy process is continuous in probability. We shall need the following generalization: Proposition 1.99 If X is a process with independent increments and X is continuous in probability then ϕt (u) ϕ(u, t) E (exp (iuX (t))) is never zero.
64
STOCHASTIC PROCESSES
Proof. Let us fix the parameter u. As X is continuous in probability ϕ(u, t) is continuous in t. Let t0 (u) inf {t : ϕ (u, t) = 0} . One should prove that t0 (u) = ∞. By definition X (0) = 0 therefore ϕ (u, 0) = 1 and as ϕ (u, t) is continuous in t obviously t0 (u) > 0. Let h (u, s, t) E (exp (iu (X (t) − X (s)))) . X has independent increments, so if s < t then ϕ (u, t) = ϕ (u, s) h (u, s, t) .
(1.41)
By the right-regularity of X ϕ (u, t0 (u)) = 0. As X (t) has limits from the left if t0 (u) < ∞ then ϕ (u, t0 (u) −) is well-defined. We show that it is not zero. By (1.41) if s < t0 (u) < ∞ then ϕ (u, t0 (u) −) = ϕ (u, s) h (u, s, t0 (u) −) . ϕ (u, s) = 0 by the definition of t0 (u), so if ϕ (u, t0 (u) −) = 0 then h (u, s, t0 (u) −) = 0 for every s < t0 (u). 0=
lim h (u, s, t0 (u) −) =
st0 (u)
=
lim E (exp (iuX (t0 (u) −) − iuX (s))) =
st0 (u)
= E (exp (0)) = 1, which is impossible. Therefore 0 = ϕ (u, t0 (u)) = ϕ (u, t0 (u) −) = 0, which is impossible since ϕ is continuous. Let us recall the following simple observation: Proposition 1.100 Let ψ be a complex-valued, continuous curve defined on R. If ψ (t) = 0 for every t then it has a logarithm that is there is a continuous curve φ with the property that ψ = exp (φ). If φ1 (t0 ) = φ2 (t0 ) for some point t0 and ψ = exp (φ1 ) = exp (φ2 ) for some continuous curves φ1 and φ2 then φ1 = φ2 .
MARTINGALES
65
Proof. The proposition and its proof is quite well-known, so we just sketch it: 1. ψ = 0, so if ψ = exp (φ1 ) = exp (φ2 ) then 1=
ψ exp (φ1 ) = = exp (φ1 − φ2 ) . ψ exp (φ2 )
Hence for all t φ1 (t) = φ2 (t) + 2πin (t) , where n (t) is a continuous integer-valued function. As n (t0 ) = 0 obviously n ≡ 0, so φ1 = φ2 . 2. The complex series ln (1 + z) =
∞
n+1
(−1)
n=1
zn n
is convergent if |z| < 1. On the real line exp (ln (1 + z)) = 1 + z.
(1.42)
As ln (1 + z) is analytic (1.42) holds for every |z| < 1. To simplify notation as much as possible let us assume that t0 = 0 and ϕ (t0 ) = 1 and let us assume that we are looking for a curve with φ (t0 ) = 0. From (1.42) there is an r > 0 that ψ (t) ln (ϕ (t)) is well-defined for |t| < r. 3. Let a be the infimum and let b be the supremum of the endpoints of closed intervals where one can define a φ. If an a and bn b and φ is defined on [an , bn ] then by the first point of the proof φ (t) is well-defined on (a, b). Let assume that b < ∞. As ψ (b) = 0 we can define the curve θ (t) ψ (b + t) /ψ (b). Applying the part of the proposition just proved for some r > 0 ψ (t) = exp ( (t)) , ψ (b)
|b − t| < r,
with (b) = 0. Let t ∈ (b − r, b). As the range of the complex exponential function is C\ {0} there is a z ∈ C with ψ (b) = exp (z). exp (φ (t)) = ψ (b) exp ( (t)) = exp (z + (t)) . Hence φ (t) = z + (t) + 2nπi. With z + (t) + 2nπi one can easily continue φ to (a, b + r). This contradiction shows that one can define φ for the whole R.
66
STOCHASTIC PROCESSES
ϕ1 (u) E (exp (iuX (1))) is non-zero and by the Dominated Convergence Theorem it is obviously continuous in u. By the observation just proved ϕ1 (u) = exp (log ϕ1 (u)) exp(φ(u)), where by definition φ(0) = 0. From this by (1.40) ϕn (u) = exp(nφ(u)) and ϕ1/n (u) = exp(n−1 φ(u)) for every n ∈ N. Hence if r is a rational number then ϕr (u) = exp(rφ(u)). By the just proved continuity in t t ∈ R+ .
ϕt (u) = exp (tφ(u)) ,
(1.43)
L´evy processes are not martingales but we can use martingale theory to investigate their properties. The key tool is the so-called exponential martingale of X. Let us define the process Zt (u, ω) Z (t, u, ω)
exp (iuX(t, ω)) . ϕt (u)
(1.44)
ϕt (u) is continuous in t for every fixed u, and therefore Zt (u, ω) is a right-regular stochastic process. Let t > s. E (Zt (u) | Fs ) E =E =
exp (iuX (t)) | Fs ϕt (u)
=
exp (iu (X (t) − X (s))) exp (iuX (s)) | Fs ϕt−s (u) ϕs (u)
exp (iuX (s)) E (exp (iu (X (t) − X (s)))) = ϕs (u) ϕt−s (u)
= Zs (u)
E (exp (iuX (t − s))) = ϕt−s (u)
= Zs (u) · 1 Zs (u) , therefore Zt (u) is a martingale in t for any fixed u. Definition 1.101 Zt (u) is called the exponential martingale of X. Example 1.102 The exponential martingale of a Wiener process. If w is a Wiener process then Zt (u, ω)
exp (iuw(t)) u2 = exp iuw(t) + t . exp(−tu2 /2) 2
=
MARTINGALES
67
If instead of the Fourier transform we normalize with the Laplace transform, then56 exp (uw(t)) u2 = exp uw(t) − t . exp(tu2 /2) 2
Let X be a L´evy process and assume that the filtration is generated by X. Denote this filtration by F X . Obviously F X does not necessarily contain the measure-zero sets57 , so F X does not satisfy the usual conditions. Let N denotes the collection of measure-zero sets and let us introduce the so-called augmented filtration: Ft σ (σ (X (s) : s ≤ t) ∪ N ) .
(1.45)
It is a bit surprising, but for every L´evy process the augmented filtration satisfies the usual conditions. That is, for L´evy processes the augmented filtration F is always right-continuous58 : Proposition 1.103 If X is a L´evy process then (1.45) is right-continuous that is Ft = Ft+ . Proof. Let us take the exponential martingale of X. If t < w < s then exp (iuX (w)) Zw (u) = E (Zs (u) | Fw ) E ϕw (u)
exp (iuX (s)) | Fw , ϕs (u)
therefore Zw (u) ϕs (u) exp (iuX (w))
ϕs (u) = E (exp (iuX (s)) | Fw ) . ϕw (u)
If w t then from the continuity of ϕt and from the right-continuity of X, with L´evy’s theorem59 exp (iuX (t))
ϕs (u) a.s. = E (exp (iuX (s)) | Ft+ ) . ϕt (u)
As exp (iuX (t)) is Ft -measurable, and Zt (u) is a martingale exp (iuX (t)) 56 See:
Example 1.118, page 82. Example 1.13, page 9. 58 See: Example 1.13, page 9. 59 See: Theorem 1.75, page 46. 57 See:
ϕs (u) a.s. = E (exp (iuX (s)) | Ft ) . ϕt (u)
68
STOCHASTIC PROCESSES
Therefore a.s.
E (exp (iuX (s)) | Ft ) = E (exp (iuX (s)) | Ft+ ) .
(1.46)
This equality can be extended to multidimensional trigonometric polynomials. For example, if t < w ≤ s1 ≤ s2 and η u1 X (s1 ) + u2 X (s2 ) then, as X(s2 ) − X (s1 ) is independent of Fs1 : E (exp (iη) | Fw ) = E (exp (iu1 X (s1 )) · exp (iu2 X (s2 )) | Fw ) = = E (exp (i(u1 + u2 )X (s1 )) · E (exp (iu2 (X(s2 ) − X (s1 ))) | Fs1 ) | Fw ) = = E (exp (i(u1 + u2 )X (s1 )) · E (exp (iu2 (X(s2 ) − X (s1 )))) | Fw ) =
= E exp (i (u1 + u2 ) X (s1 )) · ϕs2 −s1 (u2 ) | Fw = = ϕs2 −s1 (u2 ) · E (exp (i (u1 + u2 ) X (s1 )) | Fw ) = = ϕs2 −s1 (u2 ) · ϕs1 (u1 + u2 ) · Zw (u1 + u2 ) . If w t then by the right-continuity of Zs and by L´evy’s theorem60 a.s.
E (exp (iη) | Ft+ ) = ϕs2 −s1 (u2 ) · ϕs1 (u1 + u2 ) · Zt (u1 + u2 ) . On the other hand with the same calculation if w = t a.s.
E (exp (iη) | Ft ) = ϕs2 −s1 (u2 ) · ϕs1 (u1 + u2 ) · Zt (u1 + u2 ) . Therefore a.s.
E (exp (iη) | Ft ) = E (exp (iη) | Ft+ ) . That is if sk > t then
E exp i
uk X(sk )
| Ft+
a.s.
= E exp i
k
uk X(sk )
| Ft
.
(1.47)
k
If sk ≤ t then equation (1.47) trivially holds. Hence if L is the set of bounded functions f for which a.s.
E (f (X (s1 ) , . . . , X (sn )) | Ft+ ) = E (f (X (s1 ) , . . . , X (sn )) | Ft ) then L contains the π-system of the trigonometric polynomials. L is trivially a λsystem, therefore, by the Monotone Class Theorem, L contains the characteristic functions of the sets of the σ-algebra generated by the trigonometric polynomials. 60 See:
Theorem 1.75, page 46.
MARTINGALES
69
That is if B ∈ B (Rn ) then one can write in place of f the characteristic functions χB . Collection Z of sets A for which a.s.
E (χA | Ft+ ) = E (χA | Ft ) is also a λ-system which contains the sets of the π-system n
∪n σ ((X (sk ))k=1 , sk ≥ 0) . Again, by the Monotone Class Theorem, Z contains the σ-algebra 0 = σ (X (s) : s ≥ 0) . F∞
0 If A ∈ Ft+ ∩n Ft+1/n then A ∈ F∞ σ F∞ ∪ N . Therefore there is an a.s. 0 ∈ F0 ⊆ Z ∈ F∞ A , with χA = χA. As A ∞ a.s.
a.s. a.s. χA = E (χA | Ft+ ) = E χA | Ft+ = E χA | Ft . Hence up to a measure-zero set χA is almost surely equal to an Ft -measurable function E χA | Ft . As Ft contains all the measure-zero set χA is Ft measurable, that is A ∈ Ft . In a similar way one can prove the next proposition: Proposition 1.104 If X is a process with independent increments and X is continuous in probability then (1.45) is right-continuous, that is Ft = Ft+ . Example 1.105 One cannot drop the condition of independent increments. If ζ ∼ = N (0, 1) and X (t, ω) tζ (ω) then the trajectories of X are continuous and X has stationary increments. If F is the augmented filtration, then F0 = σ (N ), and if t > 0, then Ft = σ (σ (X) , N ), hence Ft is not right-continuous. Example 1.106 The augmentation is important: if w is a Wiener process then Ftw σ (w (s) : s ≤ t) is not necessarily right-continuous61 .
From now on we shall assume that the filtration of every L´evy process satisfies the usual assumptions. 61 See:
Example 1.13, page 9.
70
STOCHASTIC PROCESSES
Proposition 1.107 If the process X is left-continuous then the filtration FtX σ (X (s) : s ≤ t) is left-continuous. This remains true for the augmented filtration.
X X Proof. Let Ft− σ ∪s
Corollary 1.108 The augmented filtration of a Wiener process is continuous. A crucial property of L´evy processes is the so-called strong Markov property: Proposition 1.109 (Strong Markov property for L´ evy processes) Let τ < ∞ be a stopping time and let X be a L´evy process. 1. If X ∗ (t, ω) X (τ (ω) + t, ω) − X (τ (ω) , ω) ,
t ≥ 0,
then X ∗ is a L´evy process with respect to the filtration62 Ft∗ Fτ +t . 2. The distributions of X and X ∗ are the same63 . 3. In particular the set {X ∗ (t) : t ≥ 0} is independent of the stopped σ-algebra F0∗ = Fτ . Proof. Since X is right-regular, X is progressively measurable, so X ∗ is obviously Ft∗ -adapted. 1. For every u (1.44) is a martingale. If τ is a bounded stopping time then by the Optional Sampling Theorem E (Z (τ + t) | Fτ ) = Z (τ ) . −1
Z (τ ) is Fτ -measurable and as Z = 0 and as τ is bounded Z (τ ) E
Zτ +t | Fτ Zτ
is bounded so
= 1.
(1.48)
62 Observe that if t ≥ 0 then σ τ + t is a stopping time. Obviously F ∗ F τ +t Fσ is the t stopped σ-algebra. 63 That is the infinite dimensional distribution of {X (t) : t ≥ 0} and {X ∗ (t) : t ≥ 0} are equal.
MARTINGALES
71
By (1.40) for every ω ϕτ (ω) (u) ϕτ (ω) (u) 1 = = . ϕτ (ω)+t (u) ϕτ (ω) (u) ϕt (u) ϕt (u) So for every A ∈ Fτ using (1.48) by the definition of the conditional expectation ϕt (u) P (A) = ϕt (u)
1dP = ϕt (u) A
A
exp(iu(X(τ + t) − X(τ ))) dP = ϕt (u)
=
Zτ +t dP = Zτ
A
= ϕt (u)
(1.49)
exp (iuX ∗ (t)) dP.
A
If τ is arbitrary and τ n n ∧ τ then, as τ < ∞, for every outcome X (τ n + t) − X (τ n ) → X (τ + t) − X (τ ) X ∗ (t) .
(1.50)
If A ∈ Fτ then for every t ≥ 0 A ∩ {τ ≤ n} ∩ {τ n ≤ t} ∈ Ft ,
(1.51)
since if t ≤ n then {τ n ≤ t} = {τ ≤ t} ⊆ {τ ≤ n} , and if t > n then {τ n ≤ t} = {τ ≤ n}. From (1.51) by the definition of the stopped σ-algebra An A ∩ {τ ≤ n} ∈ Fτ n . As τ n is bounded, by (1.49) exp (iu (X(τ n + t) − X(τ n ))) dP = P (An ) ϕt (u) . An
(1.52)
72
STOCHASTIC PROCESSES
From (1.50) and by the Dominated Convergence Theorem
exp (iuX ∗ (t)) dP =
A
lim χ (τ ≤ n) exp (iu (X (τ n + t) − X (τ n ))) dP =
=
A n→∞
χ (τ ≤ n) exp (iu (X (τ n + t) − X (τ n ))) dP =
= lim
n→∞
A
exp (iu (X (τ n + t) − X (τ n ))) dP =
= lim
n→∞
An
= lim P (An ) ϕt (u) = P (A) ϕt (u) = P (A) n→∞
exp (iuX(t)) dP. Ω
2. If A Ω then the equation above means that the Fourier transform of X ∗ (t) is ϕt . That is, the distribution of X ∗ (t) and X (t) is the same. Let L be the set of bounded functions f for which for all A ∈ Fτ
f (X ∗ (t)) dP = P (A)
f (X ∗ (t)) dP.
Ω
A
Obviously L is a λ-system, and L contains the π-system of the trigonometric polynomials x → exp (iux) ,
u ∈ R.
By the Monotone Class Theorem, L contains the functions f χB with B ∈ B (R). Therefore for every A ∈ Fτ and B ∈ B(R)
χB (X ∗ (t)) dP = P (A ∩ {X ∗ (t) ∈ B}) =
A
= P (A)
χB (X ∗ (t)) dP = P (A) · P (X ∗ (t) ∈ B) .
Ω
So X ∗ (t) is independent of Fτ . 3. One should prove that X ∗ has stationary and independent increments. If σ τ + t and X ∗∗ (h) X (σ + h) − X (σ) ,
MARTINGALES
73
then using the part of the proposition already proved for the stopping time σ X ∗ (t + h) − X ∗ (t) (X (τ + t + h) − X (τ )) − (X (τ + t) − X (τ )) = = X (σ + h) − X (σ) = X ∗∗ (h) ∼ = X(h), which is independent of t and therefore X ∗ has stationary increments. Also by the already proved part of the proposition X ∗ (t + h) − X ∗ (t) = X ∗∗ (h) is independent of Fσ Ft∗ . Obviously X ∗ (0) = 0 and X ∗ is right-regular therefore X ∗ is a process with independent increments. 4. Now we prove that X and X ∗ have the same distribution. Let 0 = t0 < t1 < . . . < tn be arbitrary. As we proved X ∗ (tk ) − X ∗ (tk−1 ) ∼ = X ∗ (tk − tk−1 ) ∼ = X (tk − tk−1 ) ∼ = ∼ X (tk ) − X (tk − 1) . = As the increments are independent (X ∗ (tk ) − X ∗ (tk−1 ))k=1 has the same disn n tribution as (X (tk ) − X (tk−1 ))k=1 . This implies that (X (tk ))k=1 has the same n distribution as (X ∗ (tk ))k=1 . Which, by the Monotone Class Theorem, implies that X ∗ and X has the same distribution. n
5. As we proved X ∗ is a process with independent increments so Ft∗ is independent of the σ-algebra Gt∗ generated by the increments64 X ∗ (u) − X ∗ (v) ,
u ≥ v ≥ t.
So as a special case the set {X ∗ (t) : t ≥ 0} is independent of F0∗ = Fτ . Example 1.110 Random times which are not stopping times.
Let a > 0 and let w be a Wiener process. 1. Let γ a sup {0 ≤ s ≤ a : w (s) = 0} = inf {s ≥ 0 : w (a − s) = 0} . 64 See:
Proposition 1.97, page 61.
74
STOCHASTIC PROCESSES
Obviously γ a is Fa -measurable, so it is a random time. As P (w (a) = 0) = 0 almost surely γ a < a. Assume that γ a is a stopping time. In this case by the strong Markov property w∗ (t) w (t + γ a ) − w (γ a ) is also a Wiener process. It is easy to see that if w∗ is a Wiener process then w (t) tw∗ (1/t) is also a Wiener process65 . As every one-dimensional Wiener process almost surely returns to the origin66 , with the strong Markov property it is easy to prove that w returns to the origin almost surely after any time t. This means that there is a sequence tn 0 with tn > 0 that almost surely w∗ (tn ) = 0. But this is impossible as almost surely w∗ does not have a zero on the interval (0, a − γ a ]. 2. Let β a max {w (s) : 0 ≤ s ≤ a} , ρa inf {0 ≤ s ≤ a : w (s) = β a } . We show that ρa is not a stopping time. As P (w (a) − w (a/2) < 0) = 1/2 P (ρa < a) > 0. If ρa were a stopping time, then by the strong Markov property w∗ (t) w (t + ρa ) − w (ρa ) would be a Wiener process. But this is impossible as with positive probability the interval (0, a − ρa ] is not empty and on this interval w∗ cannot have a positive value. An important consequence of the strong Markov property is the following: Proposition 1.111 If the size of the jumps of a L´evy process X are smaller than a constant c > 0, that is |∆X| ≤ c then on any interval [0, t] the moments of X are uniformly bounded. That is for each m there is a constant K (m, t), that E (|X m (s)|) ≤ K (m, t) ,
s ∈ [0, t] .
Proof. One may assume that the stopping time67 τ 1 inf {t : |X (t)| > c} 65 See:
Corollary B.10, page 566. Corollary B.8, page 565. 67 Recall that F satisfies the usual assumptions. See: Example 1.32, page 17. 66 See:
MARTINGALES
75
is finite, as by the zero-one law the set of outcomes ω where τ 1 (ω) = ∞ has probability 0 or 1. If with probability one τ 1 (ω) = ∞ then X is uniformly bounded, hence in this case the proposition holds. Then define the stopping time τ 2 inf {t : |X ∗ (t)| > c} + τ 1 inf {t : |X (t + τ 1 ) − X (τ 1 )| > c} + τ 1 . In a similar way let us define τ 3 etc. By the strong Markov property the variables {X ∗ (t) : t ≥ 0} are independent of the σ-algebra Fτ 1 . The variable τ 2 − τ 1 inf {t ≥ 0 : |X ∗ (t)| > c} is measurable with respect to the σ-algebra generated by the variables {X ∗ (t) : t ≥ 0} hence τ 2 − τ 1 is independent of Fτ 1 . In general τ n − τ n−1 is independent of Fτ n−1 . Also by the strong Markov property for all n the distribution of τ n − τ n−1 is the same as the distribution of τ 1 . Therefore if τ 0 0, then using the independence of variables (τ k − τ k−1 )
E (exp (−τ n )) = E exp −
n
(τ k − τ k−1 )
n
= (E (exp (−τ 1 ))) q n ,
k=1
where 0 < q ≤ 1. If q = 1 then almost surely τ 1 = 0, which by the rightcontinuity implies that |X (0)| ≥ c > 0, which, by the definition of L´evy processes, is not the case, so q < 1. As the jumps are smaller than c |X (τ 1 )| ≤ |X (τ 1 −)| + |∆X (τ 1 )| ≤ ≤ |X (τ 1 −)| + c ≤ 2c. In a same way it is easy to see that in general sup |X τ n (t)| = sup |{X (t) : t ∈ [0, τ n ]}| ≤ 2nc. t
Therefore by Markov’s inequality P (|X (t)| > 2nc) ≤ P (τ n < t) = P (exp (−τ n ) > exp (−t)) ≤ ≤
E (exp (−τ n )) ≤ exp (t) q n . exp (−t)
As q < 1 L(m)
∞ n=0
m
[2 (n + 1) c] q n < ∞,
76
STOCHASTIC PROCESSES
so m
E (|X (t)| ) ≤
∞
m
[2 (n + 1) c] · P (|X (t)| > 2nc) ≤
n=0
≤ exp (t)
∞
m
[2 (n + 1) c] q n exp (t) L (m) ,
n=0
from which the proposition is evident. One can generalize these observations. Proposition 1.112 (Strong Markov property for processes with independent increments) Let X be a process with independent increments and assume that X is continuous in probability. Let D ([0, ∞)) denote the space of right-regular functions over [0, ∞) and let H be the σ-algebra over D ([0, ∞)) generated by the coordinate functionals. If f is a non-negative H-measurable functional68 over D ([0, ∞)), then for every stopping time τ < ∞ E (f (X ∗ ) | Fτ ) = E (f (Xs∗ )) |s=τ where Xs∗ (t) X (s + t) − X (s) . Proof. Let ϕ (u, t) be the Fourier transform of X (t). As X is continuous in probability ϕ (u, t) = 0 and Z (u, t)
exp (iuX (t)) ϕ (u, t)
is a martingale69 . Let τ be a bounded stopping time. By the Optional Sampling Theorem E (Z (u, τ + s) | Fτ ) = Z (u, τ ) . ϕ (u, τ + t) is Fτ -measurable. Therefore E (exp (iuX ∗ (t)) | Fτ ) E (exp (iu (X (τ + t) − X (τ ))) | Fτ ) =
(1.53)
ϕ (u, s + t) ϕ (u, τ + t) = |s=τ = ϕ (u, τ ) ϕ (u, s)
68 It is easy to see that f (X) = g (X (t ) , X (t ) , . . .) where g is an R∞ → R Borel mea1 2 surable function and (tk ) is a countable sequence in R+ . The canonical example is f (X) sups≤t |X (s)|. 69 See:
Proposition 1.99, page 63.
MARTINGALES
=
77
ϕ (u, s) E (exp (iu (X (t + s) − X (s)))) |s=τ = ϕ (u, s) = E (exp (iu (Xs∗ (t)))) |s=τ .
If τ is not bounded then τ n τ ∧ n is a bounded stopping time. Let h (s) E (exp (iu (X (s + t) − X (s)))) As τ < ∞ X (τ n + t) − X (τ n ) → X (τ + t) − X (τ ) So by the Dominated Convergence Theorem h (τ n ) → h (τ ). If A ∈ Fτ then A ∩ {τ ≤ n} ∈ Fτ n therefore
χ (τ ≤ n) exp (iu (X (τ n + t) − X (τ n ))) =
A
χ (τ ≤ n) h (τ n ) dP. A
By the Dominated Convergence Theorem one can take the limit n → ∞. Hence in (1.53) we can drop the condition that τ is bounded. With the Monotone Class Theorem one can prove that for any Borel measurable set B E (χB (X ∗ (t)) | Fτ ) = E (χB (Xs∗ (t))) |s=τ In the usual way, using multi-dimensional trigonometric polynomials and the Monotone Class Theorem several times, one can extend the relation to every H-measurable and bounded function. Finally one can prove the proposition with the Monotone Convergence Theorem. Corollary 1.113 Under the same conditions as above E (f (X ∗ ) | τ = s) = E (f (Xs∗ )) . Let us remark, that if X is a L´evy process then the distribution of Xs∗ is the same as the distribution of X for every s so E (f (X ∗ ) | Fτ ) = E (f (X))
78
STOCHASTIC PROCESSES
for every τ < ∞. If f (X) exp (i
E exp i
n
n k=1
∗
| Fτ
uk X (tk )
uk X (tk )) then
= E exp i
k=1
n
uk X (tk )
.
k=1
The right-hand side is deterministic which implies that (X ∗ (t1 ), X ∗ (t2 ), . . . X ∗ (tn )) is independent of Fτ and has the same distribution as (X(t1 ), X(t2 ), . . . , X(tn )). Proposition 1.114 If X is a process with independent increments and X is continuous in probability, and the jumps of X are bounded by some constant c, then all the moments of X are uniformly bounded on any finite interval, that is, for every t E (|X m (s)|) ≤ K (m, t) < ∞,
s ∈ [0, t] .
Proof. Let us fix a t. X has right-regular trajectories so on any finite interval the trajectories are bounded. Therefore sups≤2t |X (s)| < ∞. Hence if b is sufficiently large then P
sup |X (s)| >
s≤2t
b 2
< q < 1.
Let τ inf {s : |X (s)| > a} ∧ 2t. By the definition of τ {τ < t} ⊆
sup |X(s)| > a ⊆ {τ ≤ t}. s≤t
If for some ω. ω∈
sup |X(s)| > a \{τ < t} s≤t
then sup |X(s, ω)| ≤ a s
but X(t, ω) > a, so process X has a jump at (t, ω), which by the stochastic continuity of X has probability zero. As the size of the jumps is bounded
MARTINGALES
79
by the right-continuity sup |X(s)| ≤ sup |X(s−)| + sup |∆X(s)| ≤ a + c. s≤τ
s≤τ
s≤τ
We show that this implies that
sup |X(s)| > a + b + c ⊆ sup |X(s)| > a, sup |X(τ + s) − X(τ )| > b . s≤t
s≤t
s≤t
If sup |X(s)| > a + b + c s≤t
then obviously sups≤t |X(s)| > a, hence τ ≤ t, so if sups≤t |X(τ +s)−X(τ )| ≤ b, then sup |X(s)| ≤ sup |X(s)| + sup |X(τ + s) − X(τ )| ≤ a + b + c. s≤t
s≤τ
s≤t
Which is impossible. If u ≤ t, then sup |X(u + s) − X(u)| ≤ 2 sup |X(s)|. s≤t
s≤2t
Therefore if u ≤ t, then b sup |X(u + s) − X(u)| > b ⊆ sup |X(s)| > . 2 s≤t s≤2t Let F be the distribution function of τ . By the just proved strong Markov property
P sup |X (s)| > a + b + c ≤ s≤t
≤ P sup |X (s)| > a, sup |X (τ + s) − X (τ )| > b s≤t
=
s≤t
= P τ < t, sup |X (τ + s) − X (τ )| > b =
s≤t
P sup |X ((τ + s)) − X (τ )| > b | τ = u dF (u) =
= [0,t)
s≤t
= [0,t)
P sup |X (u + s) − X (u)| > b dF (u) ≤ s≤t
80
STOCHASTIC PROCESSES
≤P
sup |X (s)| >
s≤2t
b 2
· P (τ < t) =
= q · P (τ < t) ≤ q · P sup |X (s)| > a . s≤t
From this for an arbitrary n
P sup |X (s)| > n (b + c) ≤ q n . s≤t
Hence ∞ m m m E (|X (t)| ) ≤ E sup |X (s)| (n (b + c)) q n−1 < ∞. ≤ s≤t
n=1
We shall return to L´evy processes in section 7.1. If the reader is interested only in L´evy processes then they can continue the reading there. 1.3.8
Application: the first passage times of the Wiener processes
In this subsection we present some applications of the Optional Sampling Theorem. Let w be a Wiener process. We shall discuss some properties of the first passage times τ a inf {t : w (t) = a} .
(1.54)
The set {a} is closed and w is continuous, hence τ a is a stopping time70 . Recall that71 almost surely lim sup w (t) = ∞, t→∞
lim inf w (t) = −∞. t→∞
(1.55)
Therefore as w is continuous τ a is almost surely finite. Example 1.115 The martingale convergence theorem does not hold in L1 (Ω).
Let w be a Wiener process and let X w + 1. Let τ be the first passage time of zero for X, that is let τ inf {t : X (t) = 0} = τ −1 inf {t : w (t) = −1} . 70 See: 71 See:
Example 1.32, page 17. Proposition B.7, page 564.
MARTINGALES
81
As X is martingale X τ is a non-negative martingale. By the martingale convergence theorem for non-negative martingales 72 if t ∞ then X τ (t) is almost surely convergent. As we remarked, τ is almost surely finite therefore obviously X τ (∞) = 0. By the Optional Sampling Theorem X τ (t)1 = X(τ ∧ t)1 = E (X(τ ∧ t)) = E (X(0)) = 1 for any t. Hence the convergence does not hold in L1 (Ω). Example 1.116 If a < 0 < b and τ a and τ b are the respective first passage times of some Wiener process w, then P (τ a < τ b ) =
b , b−a
P (τ b < τ a ) =
−a . b−a
By (1.55) with probability one, the trajectories of w are unbounded. Therefore as w starts from the origin the trajectories of w finally leave the interval [a, b]. So P (τ a < τ b ) + P (τ b < τ a ) = 1. If τ τ a ∧ τ b then wτ is a bounded martingale. Hence one can use the Optional Sampling Theorem. Obviously wττ is either a or b, hence E (wττ ) = aP (τ a < τ b ) + bP (τ b < τ a ) = E (wτ (0)) = 0. We have two equations with two unknowns. Solving this system of linear equations, one can easily deduce the formulas above. Example 1.117 Let a < 0 < b and let τ a and τ b be the respective first passage times of some Wiener process w. If τ τ a ∧ τ b , then E (τ ) = |ab|.
With direct calculation it is easy to see that the process w2 (t)−t is a martingale. From this it is easy to show that the process X (t) (w(t) − a) (b − w(t)) + t is also a martingale. By the Optional Sampling Theorem |ab| = −ab = E (X (0)) = E (X (τ ∧ n)) = = E (w (τ ∧ n) − a) (b − w (τ ∧ n)) + E (τ ∧ n) . 72 See:
Corollary 1.66, page 40.
82
STOCHASTIC PROCESSES
If n ∞ then by the Monotone and by the Dominated Convergence Theorems the limit of the right-hand side is E (τ ). Example 1.118 Let w be a Wiener process. The Laplace transform of the first passage time τ a is √ L (s) E (exp (−sτ a )) = exp − |a| 2s ,
s ≥ 0.
(1.56)
Let a > 0. For every u the process X (t) exp u · w (t) − t · u2 /2 is a martingale73 . So the truncated process X τ a is also a martingale. If u ≥ 0, then
0≤X
τa
u2 t (t) ≤ exp ua − 2
≤ exp (au) ,
hence X τ a is a bounded martingale. Every bounded martingale is uniformly integrable, therefore one can apply the Optional Sampling Theorem. So
u2 τ a E Xττaa = E exp ua − = E (X τ a (0)) = 1. 2 Hence
u2 τ a E exp − 2 If u
√
= exp (−ua) .
2s ≥ 0 then √
L (s) E (exp (−sτ a )) = exp −a 2s .
If a < 0 then repeating the calculations for the Wiener process −w √
L (s) = exp − |a| 2s .
Example 1.119 The Laplace transform of the first passage time of the reflected Wiener process |w| is (s) E (exp (−s L τ a )) =
73 See:
(1.44), page 66.
1 √ , cosh a 2s
s ≥ 0.
(1.57)
MARTINGALES
83
By definition τ a inf {t : |w (t)| = a} . Let 2 u t exp (uw (t)) + exp (−uw (t)) exp − X (t) 2 2 2 u t cosh (uw (t)) exp − . 2 X is the sum of two martingales, hence it is a martingale. X τ a ≤ cosh (ua), therefore one can again apply the Optional Sampling Theorem. 2
τa u τa E Xτ a = E cosh (ua) exp − = 1, 2 therefore
E exp If u
√
−u2 τa 2
=
1 . cosh (ua)
2s then E (exp (−s τ a )) =
1
√ . cosh a 2s
Example 1.120 The density function of the distribution of the first passage time τ a of a Wiener process is −1/2 a2 f (x) = |a| 2πx3 . exp − 2x
(1.58)
By the uniqueness of the Laplace transform √ it is sufficient to prove that the Laplace transform of (1.58) is exp − |a| 2s . By the definition of the Laplace transform ∞ exp (−sx) f (x) dx, s ≥ 0. L (s) 0
If F denotes the distribution function of (1.58) then F (x)
x
f (t) dt = 2 0
a
∞
√
2 1 u du, exp − 2x 2πx
(1.59)
84
STOCHASTIC PROCESSES
since if we substitute t xa2 /u2 , then 2 au3 u √ exp − xa2 (−2) u−3 du = 3 2πx3 2x a ∞ 2 ∞ 1 u √ =2 exp − du. 2x 2πx a
a
F (x) =
Integrating by parts and using that F (0) = 0, if s > 0 then L (s) = [exp (−sx) F
∞ (x)]0
∞
s exp (−sx) F (x) dx =
+ 0
∞
=s
exp (−sx) F (x) dx. 0
By (1.59)
∞
L (s) = 2s
exp (−sx) 0
a
∞
2 1 u √ dudx. exp − 2x 2πx
Fix s and let us take L (s) as a function of a. Let us denote this function by g (a). We show that if a > 0 then g (a) satisfies the differential equation d2 g (a) = 2sg (a) . da2
(1.60)
The integrand is non-negative, so by Fubini’s theorem one can change the order of the integration, so
∞
∞
g (a) = 2s a
0
exp (−sx) √
2 u 1 dxdu. exp − 2x 2πx
As 0
∞
√
1 1 exp (−sx) dx = √ Γ 2πx 2πs
1 <∞ 2
√ 1/ 2πx exp (−sx) is integrable, and dominates the integrand. Hence the inner integral is a continuous function of u. Using this, one can differentiate with respect the integral sign g (a) = −2s
0
∞
exp (−sx) √
2 1 a dx. exp − 2x 2πx
MARTINGALES
85
We can differentiate under the integral sign as on the interval a ∈ (b, c) exp (−sx) √
2 b exp − 3 2x 2πx c
is integrable and dominates the partial derivatives ∂ ∂a
exp(−sx) √
2 2 a a 1 −a = exp(−sx) √ . exp − exp − 2x 2x 2πx 2πx3
Hence g (a) = 2s
∞
exp (−sx) √
0
= 2s
∞
2 a exp − dx = 3 2x 2πx a
exp (−sx) f (x) dx = 2s · L (s) 2s · g (a) .
0
The characteristic polynomial of this second-order linear differential equation is √ λ2 −2s = 0, which has the roots λ1,2 = ± 2s. So the general solution of equation (1.60) is √
√
A exp a 2s + B exp −a 2s . As L (0) = A + B = 1 and L (∞) = 0 √
L (s) = exp −a 2s .
Example 1.121 The Fourier transform of τ a is ϕ (t) = exp −a |t| (1 − i · sgn t) .
√ The formula exp −a 2s has an analytic extension to the half plane Re (z) > 0. If s > 0 and z s + it then 1 1 z 1 log z = exp ln (|z|) exp i arg = exp 2 2 2 |z| " arctan (t/s) arctan (t/s) 4 = s2 + t2 cos + i sin . 2 2
z
1/2
86
STOCHASTIC PROCESSES
The complex Laplace transform is continuous so ϕ (t) = L (−it) = #
$
√ " arctan −t arctan −t 4 s s 2 2 + i sin = = lim exp −a 2 s + t cos s0 2 2
"
π
π = = exp −a 2 |t| cos − sgnt + i sin − sgnt 4 4 "
= exp −a |t| (1 − i · sgnt) .
Example 1.122 The maximum process of a Wiener process. Let w be a Wiener process, and let us introduce the maximum process S (t) sup w (s) = max w (s) . s≤t
s≤t
We show that for every a ≥ 0 and t ≥ 0 P (S (t) ≥ a) = P (τ a ≤ t) = 2 · P (w (t) ≥ a) = P (|w (t)| ≥ a) .
(1.61)
The first and last equality are trivial. We prove the second one: recall that the density function of the distribution of τ a is 2 d 1 d a P (τ a ≤ t) F (t) f (t) = a √ . exp − 3 dt dt 2t 2πt √ w (t) ∼ = N 0, t , so a = U (t) 2 · P (w (t) ≥ a) = 2 1 − Φ √ t 2 = √ 2π
u2 exp − du. √ 2 a/ t
∞
Differentiating with respect to t 2 a a d U (t) = √ exp − t−3/2 , dt 2t 2π
MARTINGALES
87
hence the derivatives of P (τ a ≤ t) and 2 · P (w (t) ≥ a) with respect to t are the same. The two functions are equal if t = 0, therefore 2 · P (w (t) ≥ a) = P (τ a ≤ t) for every t.
Example 1.123 The density function of S (t) sups≤t w (s) is f (x) = √
x2 2 exp − , 2t 2πt
x > 0.
√ By (1.61) P (S (t) ≥ x) = 2 1 − Φ x/ t . Differentiating we get the formula. Example 1.124 If w is a Wiener process then
π E sup |w (s)| = , 2 s≤1
2 E sup w (s) = . π s≤1
Let S (t) sup |w (s)| = max |w (s)| , s≤t
s≤t
τ a inf {t : |w (t)| = a} . If x > 0, then74 s s
P S (t) ≤ x = P max xw 2 ≤ x = P max w 2 ≤ 1 = s≤t s≤t x x t = P max2 |w (s)| ≤ 1 = P τ1 ≥ 2 = x s≤t/x 1 x =P √ ≤ √ . τ1 t If σ > 0, then %
74 Recall
2 π
0
∞
x2 exp − 2 2σ
dx = σ.
that s → xw s/x2 is also a Wiener process.
88
STOCHASTIC PROCESSES
The expected value depends only on the distribution, so by Fubini’s theorem and by (1.57) % 2
2 ∞ τ1 x 1 dx = exp − E S (1) = E √ =E π 0 2 τ1 % ∞ 2 2 τ1 x E exp − = dx = π 0 2 % ∞ % ∞ 2 1 2 exp (x) dx = 2 dx = = π 0 cosh x π 0 exp (2x) + 1 % ∞ % % 2 1 2 π π · = . =2 dy = 2 π 1 y2 + 1 π 4 2
In a similar way, if S denotes the supremum of w then E (S (1)) = E %
1 √ τ1
%
=E
2 π
∞
0
x2 τ 1 exp − 2
dx
=
2 x τ1 E exp − dx = 2 0 % ∞ % 2 2 . exp (−x) dx = = π 0 π
=
2 π
∞
One can prove the last relation with (1.61) as well: % E (S (1)) = E (|w (1)|) =
2 π
0
∞
x2 x exp − 2
%
dx =
2 π
Example 1.125 The intersection of a two-dimensional Wiener process with a line has Cauchy distribution.
Let w1 and w2 be independent Wiener processes, and let us consider the line75 L {x = a} where a > 0. The two-dimensional process w (t) (w1 (t) , w2 (t)) meets L the first time at τ a inf {t : w1 (t) = a} . 75 The Wiener processes are invariant under rotation so the result is true for an arbitrary line. One can generalize the result to an arbitrary dimension. In the general case, we are investigating the distribution of the intersection of the Wiener processes with hyperplanes.
MARTINGALES
89
What is the distribution of the y coordinate that is what is the distribution of w2 (τ a )?
1. For an arbitrary u the process t → u−1 w1 u2 t is also a Wiener process, hence the distribution of its maximum process is the same as the distribution of the maximum process of w1 . Let us denote this maximum process by S1 . √ 1 P (τ a ≥ x) = P (S1 (x) ≤ a) = P xS1 √ 2x ≤ a = ( x) 2
√ a = P xS1 (1) ≤ a = P ≥x . S12 (1) w intersects L at w2 (τ a ). τ a is σ (w1 )-measurable, and as w1 and w2 are independent, that is the σ-algebras σ (w2 ) and σ (w1 ) are independent, τ a is independent of w2 . We show that √ w2 (τ a ) ∼ = τ a · w2 (1)
(1.62)
√ that is, the distribution of w2 (τ a ) is the same as the distribution of τ a · w2 (1). Using the independence of τ a and w2 √
P (w2 (τ a ) ≤ x | τ a = t) = P (w2 (t) ≤ x) = P tw2 (1) ≤ x , and √
√ tw2 (1) ≤ x . P ( τ a w2 (1) ≤ x | τ a = t) = P Integrating both equations by the distribution of τ a we get (1.62). Hence √ a a w2 (τ a ) ∼ · w2 (1) ∼ · w2 (1) . = τ a · w2 (1) ∼ = = S1 |w1 (1)| w1 (1) and w2 (1) are independent with distribution N (0, 1). Therefore w2 (τ a ) has a Cauchy distribution. 2. One can also prove the relation with Fourier transforms. Let us calculate the
Fourier transform of w2 (τ a )! The Fourier transform of N (0, 1) is exp −t2 /2 . By the independence of τ a and w2 and by (1.56) ϕ (t) E (exp (itw2 (τ a ))) = ∞ E (exp (itw2 (τ a )) | τ a = u) dG (u) = = 0
=
∞
E (exp (itw2 (u))) dG (u) = 0
90
STOCHASTIC PROCESSES
t2 = exp − u dG (u) = 2 0 2 2 t t = E exp − τ a L = 2 2 √
= exp −a t2 = exp (−a |t|) ,
∞
which is the Fourier transform of a Cauchy distribution. Example 1.126 The process of first passage times of Wiener processes.
Let w be a Wiener process and let us define the hitting times τ a inf {t : w (t) = a} ,
σ a inf {t : w (t) > a} .
w is continuous, the set {x > a} is open, hence σ a is a weak stopping time. As the augmented filtration of w is right-continuous σ a is a stopping time76 . w has continuous trajectories so obviously τ a ≤ σ a . As the trajectories of w can contain ‘peaks and flat segments’ it can happen that for some outcomes τ a is strictly smaller than σ a . As we shall immediately see almost surely τ a = σ a . One can define the stochastic processes T (a, ω) τ a (ω),
S(a, ω) σ a (ω)
with a ∈ R+ . It is easy to see that T and S have strictly increasing trajectories. If an a then w(τ an ) = an a, hence obviously τ an τ a , so T is leftcontinuous. On the other hand, it is easy to see that if an a, then σ an σ a , hence S is right-continuous. It is also easy to see, that T (a+, ω) = S(a, ω) and S(a−, ω) = T (a, ω) for all ω. Obviously τ a and σ a are almost surely finite. By the strong Markov property of w w∗ (t) w(τ a + t) − w(τ a ) is also a Wiener process. {τ a < σ a } is in the set {w∗ (t) ≤ 0 on some interval [0, r] , r ∈ Q} . As w∗ is a Wiener process it is not difficult to prove77 that if r > 0 then P (w∗ (t) ≤ 0, ∀t ∈ [0, r]) = 0. 76 See: 77 See:
Example 1.32, page 17. Corollary B.12, page 566.
MARTINGALES
91
Hence P (τ a = σ a ) = P (τ a < σ a ) = 0 for every a. Therefore S is a right-continuous modification of T . Obviously if b > a and τ ∗b−a is the first passage time of w∗ to b − a then τ b − τ a = τ ∗b−a . By the strong Markov property τ ∗b−a is independent of Fτ a . Therefore T (b) − T (a) is independent of Fτ a . In general, one can easily prove that T and therefore S have independent increments with respect to the filtration Ga Fτ a . Obviously S(0) = 0, hence S is a L´evy process with respect to the filtration G. 1.3.9
Some remarks on the usual assumptions
The usual assumptions are crucial conditions of stochastic analysis. Without them very few statements of the theory would hold. The most important objects of stochastic analysis are related to stopping times, as these objects express the timing of events. The main tool of stochastic analysis is measure theory. In measure theory, objects are defined up to measure-zero sets. From a technical point of view, of course it is not a great surprise that we want to guarantee that every random time, which is almost surely equal to a stopping time, should also be a stopping time. The definition of a stopping time is very natural: at time t one can observe only τ ∧ t so we should assume τ ∧ t to be Ft -measurable for every t. Hence if τ and τ are almost surely equal and they differ on a set N , then every subset of N should be also Ft -measurable. This implies that one should add all the measure-zero sets and all their subsets to the filtration78 . The right-continuity of the filtration is more problematic; it assumes that somehow we can foresee the events of the near future. At first sight is seems natural; in our usual experience we always have some knowledge about the near future. Our basic experience is speed and momentum, and these objects are by definition the derivatives of the trajectories. By definition, differentiability means that the right-derivative is equal to the left-derivative and the left-derivative depends on the past and the present. So in our differentiable world we always know the right-derivative, hence—infinitesimally—we can always see the future. But in stochastic analysis we are interested in objects which are non-differentiable. Recall that for a continuous process the hitting time of a closed set is a stopping time79 . At the moment that we hit a closed set we know that we are in the set. But what about the hitting times80 of open sets? We hit an open set at its boundary and when we hit it we are generally still outside the set. Recall that the hitting time of an open set is a stopping time only when the filtration is right-continuous81 . That is, when we hit the boundary of an open set—by the 78 See:
Example 6.37, page 386. Example 1.32, page 17. 80 See: Definion 1.26, page 15. 81 See: Example 1.32, page 17. 79 See:
92
STOCHASTIC PROCESSES
right-continuity of the filtration—we can ask for some extra information about the future which tells us whether we shall really enter the set or not. This is, of course, a very strong assumption. If we want to go to a restaurant and we are at the door, we know that we shall enter the restaurant. But a Wiener process can easily turn back at the door. One of the most surprising statements of the theory is that the augmented filtration of a L´evy process is right-continuous. This is true not only for L´evy processes, but under more general conditions82 . It is important to understand the reason behind this phenomena. The probability that a one-dimensional Wiener process hits the boundary of an open set without actually entering the set itself has zero83 probability! And in general the rightcontinuity of an augmented filtration means that all the events which need some insight into the future84 have zero probability. We cannot see the future, we are just ignoring the irrelevant information!
1.4
Localization
Localization is one of the most frequently used concepts of mathematical analysis. For example, if f is a continuous function on R, then of course generally f is not integrable on the whole real line. But this is not a problem at all. We can x still talk about the integral function F (x) 0 f (t)dt of f . The functions of Calculus are not integrable, they are just locally integrable. In the real analysis we say that a certain property holds locally if it holds on every compact subset of the underlying topological space85 . In the real line it is enough to ask that the property holds on any closed, bounded interval, in particular for any t the property should hold on any interval [0, t]. Very often, like in the case of local integrability, it is sufficient to ask that the property should hold on some intervals [0, tn ] where tn ∞. In stochastic analysis we should choose the upper bounds tn in a measurable way with respect to the underlying filtration. This explains the next definition: Definition 1.127 Let X be a family of processes. We say that process X is locally in X if there is a sequence of stopping times (τ n ) for which almost surely86 τ n ∞, and the truncated processes X τ n belong to X for every n. The sequence (τ n ) is called the localizing sequence of X. Xloc denotes the set of processes locally belonging to X . A specific problem of the definition above, is that with localization one cannot modify the value of the variable X(0), since every truncated process X τ n at the 82 This is true e.g. for so called Feller processes, which form an important subclass of the Markov processes. 83 See: Example 1.126, page 90, Corollary B.12, page 566. But see: Example 6.10, page 364. 84 Like sudden jumps of the Poisson processes. 85 Generally the topological space is locally compact. 86 Almost surely and not everywhere! See: Proposition 1.130, page 94.
LOCALIZATION
93
time t = 0 has the same value X(0). To overcome this problem some authors87 instead of using X τ n use the process X τ n χ (τ n > 0) in the definition of the localization or instead of X they localize the process X − X(0). In most cases it does not matter how we define the localization. First of all we shall use the localization procedure to define the different classes of local martingales. From the point of view of stochastic analysis, one can always assume that every local martingale is zero at time t = 0, as our final goal is to investigate the class of semimartingale, and the semimartingales have the representation X(0) + L + V, where L is a local martingale, zero at time t = 0. Just to fix the ideas we shall later explicitly concretize the definitions in the cases of local martingales and locally bounded processes. In both cases we localize the processes X − X(0). 1.4.1
Stability under truncation
It is quite natural to ask for which type of processes X one has (Xloc )loc = Xloc . Definition 1.128 We say that space of processes X is closed or stable under truncation or closed under stopping if whenever X ∈ X then X τ ∈ X for arbitrary stopping time τ . It is an important consequence of
this property that if X is closed under trun(k) cation and Xk ∈ Xloc and τ n are the localizing sequences of the processes (k)
Xk , then τ n ∧m k=1 τ n for any finite m is a common localizing sequence of the first m processes. That is, if X is closed under the truncation, then for a finite number of processes we can always assume that they have a common localizing sequence. From the definition it is clear that if X is closed under the truncation, then Xloc is also closed under the truncation as, if (τ n ) is a localizing sequence of X and τ is an arbitrary stopping time, then (τ n ) is obviously a localizing sequence of the truncated process X τ . Example 1.129 M, the space of uniformly integrable martingales, H2 , the space of the square-integrable martingales and K, the set of bounded processes are closed under truncation. It is obvious from the definition that K is closed under truncation. By the Optional Sampling Theorem if M ∈ M, then M τ ∈ M. As 2 2 τ ≤E sup |X (t)| <∞ E sup |X (t)| t≥0
H2 is also closed under truncation.
87 See:
e.g. [78].
t≥0
94
STOCHASTIC PROCESSES
Proposition 1.130 If the filtration F is right-continuous and if X is closed under truncation, then (Xloc )loc = Xloc . Proof. τ n ≡ ∞ is a localizing sequence, therefore Xloc ⊆ (Xloc )loc . Let X ∈ (Xloc )loc and let (τ n ) be a localizing sequence with X τ n ∈ Xloc . As Xloc is closed under truncation X τ n ∧n ∈ Xloc for an arbitrary n, so one can assume that τ n σ is bounded. Let σ k be such a stopping time that (X τ k ) k = X τ k ∧σk ∈ X , and −k P (σ k ≤ τ k ) ≤ 2 . Let us define the sequence ρn τ n ∧ inf σ k . k≥n
Obviously
inf σ k < t = ∪k≥n {σ k < t} ∈ Ft
k≥n
so inf k≥n σ k is a weak stopping time. The filtration F is right-continuous, hence inf k≥n σ k is a stopping time and therefore ρn is a stopping time. The sequence (ρn ) is increasing and P (ρn < τ n ) ≤
∞ k=n
≤
∞
P (σ k < τ n ) ≤
∞
P (σ k ≤ τ k )
k=n
2−k = 2−n+1 → 0.
k=n
Almost surely τ n ∞ and therefore outside of a measure-zero set ρn ∞, that is (ρn ) is a localizing sequence88 of X ∈ (Xloc )loc so X ∈ Xloc . 1.4.2
Local martingales
Let us specify the definition of localization to local martingales. Definition 1.131 Let us denote by M the set of uniformly integrable martingales. Process X is a local martingale if X − X(0) ∈ Mloc , that is a process X a.s.
is a local martingale if there is a sequence of stopping times (τ n ), τ n ∞ such that X τ n − X(0) ∈ M for all n. Let us denote89 by L the set of local martingales which are zero at time t = 0. X is a local martingale, if there is an L ∈ L such that X = X(0) + L. 88 Let 89 See:
us observe that (ρn ) converges to infinity just almost surely. Definition 3.1, page 179.
LOCALIZATION
95
Example 1.132 Every martingale is a local martingale.
If M is a martingale, then M (0) is integrable. The process X ≡ M (0) is a martingale, so without loss of generality one can assume that M (0) = 0. If M is a martingale and τ n n, then (τ n ) is a localizing sequence and M τ n (t) = M (t ∧ n) = E (M (n) | Ft ) , therefore the set (M τ n (t))t≥0 is uniformly integrable90 for all n. Example 1.133 Local martingale which is not a martingale. Let (Ω, A,P) ([0, 1] , B ([0, 1]) , λ) , where λ denotes the Lebesgue measure. If Ft A and ξ is not integrable, then the constant process X(t) ξ is not a martingale, but as X − X(0) ≡ 0 by the definition of local martingales X is a local martingale.
Proposition 1.134 If X and Y are local martingales and ξ and η are F0 -measurable random variables then Z ξX + ηY is also a local martingale. Proof. If L ∈ L and ζ is an arbitrary F0 -measurable variable then ζ + L is a local martingale, therefore one can assume that X, Y ∈ L. Let (τ n ) be the localizing sequence of X and (σ n ) be the localizing sequence of Y . As ξ and η are F0 -measurable the variables αn
∞ if |ξ| ≤ n , βn 0 if |ξ| > n
∞ 0
if |η| ≤ n if |η| > n
are stopping times. Obviously ρn τ n ∧ σ n ∧ α n ∧ β n is a stopping time and ρn ∞ so (ρn ) is a localizing sequence. ρn
Z ρn (ξX + ηY )
= χ (|ξ| ≤ n) ξX ρn + χ (|η| ≤ n) ηY ρn .
(1.63)
As X ρn , Y ρn ∈ M and as χ (|ξ| ≤ n) ξ and χ (|η| ≤ n) η are bounded F0 measurable variables, obviously Z ρn ∈ M and therefore Z is a local martingale. Let us observe that in line (1.63) we used that X, Y ∈ L that is X(0) = Y (0) = 0. If in the definition of local martingales one had used the simpler X ∈ Mloc definition, then in this proposition one should have assumed the ξ and η to be bounded. 90 See:
Lemma 1.70, page 42.
96
STOCHASTIC PROCESSES
One can observe that in the definition of local martingales we used the class of uniformly integrable martingales and not the class of martingales. If Lτ n is a martingale for some τ n , then Lτ n ∧n ∈ M, so the class of local martingales is the same as the class of ‘locally uniformly integrable martingales’. Very often we prove different theorems first for uniformly integrable martingales and then with localization we extend the proofs to local martingales. In most cases one should use the same method if one wants to extend the result from uniformly integrable martingales just to martingales. An important subclass of local martingales is the space of locally squareintegrable martingales: 2 Definition 1.135 X is a locally square-integrable martingale if X−X(0) ∈ Hloc .
Example 1.136 Every martingale which has square-integrable values is a locally square-integrable martingale. By definition a martingale X is square-integrable in ω if X(t) ∈ L2 (Ω) for every t. In this case X(0) ∈ L2 (Ω), therefore for all t X(t) − X(0) ∈ L2 (Ω), so again one can assume that X(0) = 0. If τ n n then (τ n ) is a localizing sequence. By Doob’s inequality
sup |X τ n (t)| = sup |X (t)| ≤ 2 · X (n) < ∞, 2
t≤n
t 2
2
2 so X τ n ∈ H2 and therefore X ∈ Hloc .
Example 1.137 Every continuous local martingale is locally square-integrable91 .
Let X be a continuous local martingale and let (τ n ) be a localizing sequence of X. As X is continuous σ n inf {t : |X(t)| ≥ n} is a stopping time. If ρn τ n ∧σ n then ρn ∞ and |X ρn | ≤ n by the continuity of X, so X ρn is a bounded, hence it is a square-integrable martingale. Therefore 2 . M ∈ Hloc 2 Example 1.138 Martingales which are not in Hloc .
91 One can easily generalize this example. If the jumps of X are bounded then X is in H2 . loc See: Proposition 1.152, page 107.
LOCALIZATION
97
Let us denote by σ (N ) the σ-algebra generated by the measure-zero sets. Let Ft
σ (N ) if t < 1 , A if t ≥ 1
and let ξ ∈ L1 (Ω), but ξ ∈ / L2 (Ω). Let us also assume that E (ξ) = 0. F satisfies a.s. the usual conditions, hence X (t) E (ξ | Ft ) is martingale. X (0) = 0, hence 2 / Hloc as, if the not only X ∈ Mloc , but also X ∈ L. On the other hand X ∈ stopping time τ is not almost surely constant, then almost surely τ ≥ 1, hence / L2 (Ω). for all t ≥ 1 X τ (t) = ξ ∈ It is a quite natural, but wrong, guess that local martingales are badly integrable martingales. The local martingales are far more mysterious objects. Example 1.139 Integrable local martingale which is not a martingale.
Let Ω C [0, ∞) , that is let Ω be the set of continuous functions defined on the half-line R+ . Let X be the canonical coordinate process, that is if ω ∈ Ω, then let X (t, ω) ω (t), and let the filtration F be the filtration generated by X. Let P be the probability measure defined on Ω for which X is a Wiener process starting from point 1. Let τ 0 inf {t : X(t) = 0} . Let us define the measure Q(t) on the σ-algebra Ft with the Radon–Nikodym derivative dQ (t) X (t ∧ τ 0 ) = X (t) χ (t < τ 0 ) + X (τ 0 ) χ (t ≥ τ 0 ) = dP = X (t) χ (t < τ 0 ) . As the truncated martingales are martingales, X τ 0 is a martingale under the measure P. Hence E (X (t ∧ τ 0 ) | Fs ) = X (s ∧ τ 0 ) . The measures (Q (t))t≥0 are consistent: if s < t and F ∈ Fs ⊆ Ft , then
F
dQ (s) dP dP
F
dQ (t) dP = Q (t) (F ) . dP
Q (s) (F ) =
X (s ∧ τ 0 ) dP = F
X (t ∧ τ 0 ) dP F
98
STOCHASTIC PROCESSES
In particular
X (t ∧ τ 0 ) dP =
Q (t) (Ω) Ω
X (0) dP = 1, Ω
so Q (t) is a probability measure for every t. The space C [0, ∞) is a Kolmogorov type measure space, so on the Borel sets of C [0, ∞) there is a probability measure Q, which, restricted to Ft is Q (t). {τ 0 ≤ t} ∈ Ft for every t so Q (τ 0 ≤ t) = Q (t) (τ 0 ≤ t)
Ω
χ (τ 0 ≤ t) X (τ 0 ∧ t) dP =
= Ω
χ (τ 0 ≤ t) X (τ 0 ) dP = 0, a.s.
so Q (τ 0 = ∞) = 1, that is X is almost surely never zero under Q. Hence X > 0 under Q, so under Q the process Y 1/X is almost surely well-defined. 1. As a first step let us show that Y is not a martingale under Q. To show this it is sufficient to prove that the Q-expected value of Y is decreasing to zero. As P(τ 0 < ∞) if t ∞ EQ (Y (t))
Y (t) dQ =
Ω
= Ω
Ω
1 dQ (t) = X (t)
1 χ (t < τ 0 ) X (t) dP = X (t)
χ (t < τ 0 ) dP = P (t < τ 0 ) → 0.
= Ω
2. Now we prove that Y is a local martingale under Q. Let ε > 0 and let τ ε inf {t : X(t) = ε} . X is continuous, therefore if ε 0 then τ ε (ω) τ 0 (ω) for every outcome ω. Since Q(τ 0 = ∞) = 1 obviously Q-almost surely92 τ ε ∞. Let us show, that under Q the truncated process Y τ ε is a martingale. Almost surely 0 < Y τ ε ≤ 1/ε hence Y τ ε is almost surely bounded, hence it is uniformly integrable. One should 92 Let us recall that by the definition of the localizing sequence, it is sufficient if the localizing sequence converges just almost surely to infinity.
LOCALIZATION
99
only prove that Y τ ε is a martingale under Q. If s < t and F ∈ Fs , then as τ ε < τ 0
Y
τε
(t) dQ
F
F
1 dQ (t) = X (t ∧ τ ε )
(1.64)
1 X (t ∧ τ 0 ) dP = F X (t ∧ τ ε ) χ (t < τ ε ) χ (t ≥ τ ε ) + X (t) χ (t < τ 0 ) dP = = X (t) X (τ ε ) F X (t) = χ (τ 0 > t ≥ τ ε ) dP = χ (t < τ ε ) + ε F 1 = ε + (X τ 0 (t) − ε) χ (t ≥ τ ε ) dP. ε F =
Let us prove that M (t) (X τ 0 (t) − ε) χ (t ≥ τ ε ) is a martingale under P. If σ is a bounded stopping time, then as τ ε < τ 0 by the elementary properties of the conditional expectation93 and by the Optional Sampling Theorem E (M (σ)) E ((X τ 0 (σ) − ε) χ (σ ≥ τ ε )) = = E (E ((X τ 0 (σ) − ε) χ (σ ≥ τ ε ) | Fσ∧τ ε )) = = E (E (X τ 0 (σ) − ε | Fσ∧τ ε ) χ (σ ≥ τ ε )) = = E (E (X (τ 0 ∧ σ) − ε | Fσ∧τ ε ) χ (σ ≥ τ ε )) = = E ((X (σ ∧ τ ε ) − ε) χ (σ ≥ τ ε )) = = E ((X (τ ε ) − ε) χ (σ ≥ τ ε )) = 0, which means that M is really a martingale94 . As M is a martingale under P in the last integral of (1.64) one can substitute s on the place of t, so calculating backwards 1 1 τε dQ = dQ Y (t) dQ X (t ∧ τ ) X (s ∧ τ ε) ε F F F Y τ ε (s) dQ, F
that is Y τ ε is a martingale under Q. Therefore τ 1/n localizes Y under Q. 93 See: 94 See:
Proposition 1.34, page 20. Proposition 1.91, page 57.
100
STOCHASTIC PROCESSES
Example 1.140 L2 (Ω) bounded local martingale, which is not a martingale
95
.
Let w be a standard Wiener process in R3 , and let X(t) w(t)+u where u = 0 is a fixed vector. By the elementary properties of Wiener processes96 if t → ∞ then R (t) X (t)2 → ∞.
(1.65)
With direct calculation it is easy to check that on R3 \ {0} the function g (x)
1 1 =" 2 x2 x1 + x22 + x23
is harmonic, that is97 ∆g
∂2 ∂2 ∂2 g + g + g = 0. ∂x21 ∂x22 ∂x23
Hence by Itˆo’s formula98 M 1/R is a local martingale. The density function of the X (t) is
1 2 ft (x) √ 3 exp − x − u2 . 2t 2πt 1
If t ≥ 1 then ft is uniformly bounded so if t ≥ 1 then obviously
E M 2 (t) =
R3
≤
R3
1
2 ft
x2 1
(x) dλ3 (x) ≤
2 dλ3
(x) .
x2
Evidently the last integral can diverge only around x = 0. I
x≤1
1
2 dλ3 (x) =
x2
k
G(k)
1
2 dλ3
x2
(x)
95 We shall use several results which we shall prove later, so one can skip this example during the first reading. 96 See: Proposition B.7, page 564, Corollary 6.9, page 363. 97 Now ∆ denotes the Laplace operator. 98 See: Theorem 6.2, page 353. As n = 3 almost surely X(t) = 0 hence we can use the formula. See: Theorem 6.7, page 359.
LOCALIZATION
101
where G (k) =
1 2k+1
1 < x2 ≤ k 2
.
As 2k G (k) = G (0) using the transformation T (x) 2k x 1 1 3k dλ (x) = 3 2 2 2 dλ (x) = k G(0) x2 G(k) 2 x2 1 k =2 2 dλ3 (x) . G(k) x2 Hence I=
∞
2−k
k=0
G(0)
1
2 dλ3
x2
(x) < ∞.
2 It is easy to show that E
2 M (t) is continuous in t. Therefore it is bounded on [0, t]. Hence E M (t) is bounded on R+ . By (1.65) M (t) → 0. M is bounded in L1
L2 (Ω) therefore it is uniformly integrable, so M (t) → 0. If M were a martingale then 0 = M (t) = E (M (∞) | Ft ) = E (0 | Ft ) = 0, which is impossible. As the uniformly integrable local martingales are not necessarily martingales even the next, nearly trivial observation is very useful: Proposition 1.141 Every non-negative local martingale is a supermartingale. Proof: Let M = M (0) + L be a non-negative local martingale. Observe that by the definition of supermartingales, M (t) ≥ 0 is not necessarily integrable so one cannot assume that M (0) is integrable. As L ∈ L there is a localizing sequence (τ n ) that Lρn ∈ M for all n. If t > s, then as M ≥ 0, by Fatou’s lemma
E (M (t) | Fs ) = E lim inf M τ n (t) | Fs ≤ lim inf E (M τ n (t) | Fs ) = n→∞
n→∞
τn
= M (0) + lim inf E (L n→∞
(t) | Fs ) =
= M (0) + lim inf Lτ n (s) = M (s) . n→∞
Corollary 1.142 If M ∈ L and M ≥ 0 then M = 0. Proof: As M is a supermartingale 0 ≤ E (M (t)) ≤ E (M (0)) = 0 for all t ≥ 0, a.s. so M (t) = 0.
102
STOCHASTIC PROCESSES
The most striking and puzzling feature of local martingales is that even uniform integrability is not sufficient to guarantee that local martingales are proper martingales. The reason for it is the following: If Γ is a set of stopping times, then the uniform integrability of the family (X (t))t∈Θ does not guarantee the uniform integrability of the stopped family (X (τ ))τ ∈Γ . This cannot happen if the local martingale belongs to the so-called class D. Definition 1.143 Process X belongs to the Dirichlet–Doob class99 , shortly X is in class D, if the set {X (τ ) : τ < ∞ is an arbitrary finite-valued stopping time} is uniformly integrable. We shall also denote by D the set of processes in class D. Proposition 1.144 Let L be a local martingale. L is in class D if and only if L ∈ M that is if L is a uniformly integrable martingale. Proof: Recall that we constructed a non-negative L2 (Ω)-bounded local martingales which is not a proper martingale. 1. Let L ∈ D and let L be a local martingale. As τ = 0 is a stopping time, by the definition of D, L(0) is integrable, so one can assume that L ∈ L. If (τ n ) is a localizing sequence of L then L (τ n ∧ s) = Lτ n (s) = E (Lτ n (t) | Fs ) = = E (L (τ n ∧ t) | Fs ) . τ n ∞, hence the sequences (L (τ n ∧ s))n and (L (τ n ∧ t))n converge to L (s) and L (t). By uniform integrability the convergence L (τ n ∧ t) → L(t) holds in L1 (Ω) as well. By the L1 -continuity of the conditional expectation L (s) = E (L (t) | Fs ) , hence L is a martingale100 . Obviously the set {L(t)}t ⊆ {L(τ )}τ is uniformly integrable so L ∈ M. 2. The reverse implication is obvious: If L is a uniformly integrable martingale then by the Optional Sampling Theorem L (τ ) = E (L (∞) | Fτ ) for every stopping time τ , hence the family (L (τ ))τ is uniformly integrable101 . 99 In [77] on page 244 class D is called Dirchlet class. [74] on page 107 remarks that class D is for Doob’s class and the definition was introduced by P.A. Meyer in 1963. 100 Observe that it is enough to asssume that {L (τ )} is uniformly integrable for the set of τ bounded stopping times τ . 101 See: Lemma, 1.70, page 42.
LOCALIZATION
103
Corollary 1.145 If a process X is dominated by an integrable variable then X ∈ D, hence if X is a local martingale and X is dominated by an integrable variable102 then X ∈ M. Example 1.146 Let us assume that L has independent increments. If X exp (L) then X is a local martingale if and only if X is a martingale.
One should only prove that if X is a local martingale, then X is a martingale. By the definition of processes with independent increments, L(0) = 0, hence X(0) = 1. X is a non-negative local martingale, so it is a supermartingale103 . If m(t) denotes the expected value of X(t) then by the supermartingale property 1 ≥ m (t) > 0. Let us prove that M (t) X (t) /m (t) is a martingale. As L has independent increments, if t > s, then m (t) E (X(t)) = E (X(s)) E (exp (L(t) − L(s))) m(s)E (exp (L(t) − L(s))) . From this E (M (t) | Fs ) E =E
exp (L (t)) | Fs m (t)
=
exp (L (t) − L (s) + L (s)) | Fs m (t)
=
=
exp (L (s)) E (exp (L (t) − L (s)) | Fs ) = m (t)
=
exp (L (s)) E (exp (L (t) − L (s))) = m (t)
=
exp (L (s)) M (s) , m (s)
hence M is martingale. For arbitrary T < ∞ on the interval [0, T ] M is uniformly integrable, that is, M is in class D. As on interval [0, T ] 0 ≤ X = M m ≤ M, hence X is also in class D. Therefore X ∈ D and X is a local martingale on [0, T ]. This means that X is a martingale on [0, T ] for every T , hence X is a martingale on R+ . 102 See: 103 See:
Davis’ inequality. Theorem 4.62, page 277. Proposition 1.141, page 101.
104
STOCHASTIC PROCESSES
If a process has independent increments and the expected value of the process is zero, then it is obviously a martingale. Therefore martingales are the generalization of random walks. From an intuitive point of view one can also think about local martingales as generalized random walks as we shall later prove the next — somewhat striking— theorem: Theorem 1.147 Assume that the stochastic base satisfies the usual conditions. If a local martingale has independent increments then it is a true martingale104 . 1.4.3
Convergence of local martingales: uniform convergence on compacts in probability
Let X be an arbitrary space. In Xloc it is very natural to define the topology with localization; Xm → X, if X and the elements of the sequence (Xm ) have a common localizing sequence (τ n ) and for every n in the topology of X τn lim Xm = Xτn.
m→∞
p Let us assume105 that (Xm ) and X are in Hloc . In Hp one should define the topology with the norm
. XHp sup |X (s)| s p
If τ n ∞ and t < ∞, then for every δ > 0 one can find an n, that P (τ n ≤ t) < δ. Let ε > 0 be arbitrary. If A
sup |Xm (s) − X (s)| > ε , s≤t
then P (A) = P ((τ n ≤ t) ∩ A) + P ((τ n > t) ∩ A) ≤ ≤ P (τ n ≤ t) + P ((τ n > t) ∩ A) ≤ δ + P ((τ n > t) ∩ A) ≤ τn τn ≤ δ + P sup |Xm (s) − X (s)| > ε ≤ ≤δ+P
s≤t
τn sup |Xm s
(s) − X
τn
(s)| > ε .
104 Of course the main point is that a local martingale with independent increments has finite expected value. See: Theorem 7.97, page 545. 105 It is an important consequence of the Fundamental Theorem of Local Martingales that 1 . See Corollary 3.59, page 221. every local martingale is in Hloc
LOCALIZATION
105
By Markov’s inequality the stochastic convergence follows from the convergence τn in Lp (Ω). Therefore if limm→∞ Xm = X τ n in Hp then τn lim P sup |Xm (s) − X τ n (s)| > ε = 0.
m→∞
s
This implies that for every ε > 0 and for every t lim P sup |Xm (s) − X (s)| > ε = 0.
m→∞
s≤t
Hence one should expect that the next definition is very useful106 : Definition 1.148 We say that the sequence of stochastic processes (Xn ) converges uniformly on compacts in probability to process X if for arbitrary107 t<∞ P
sup |Xn (s) − X (s)| → 0. s≤t
ucp
We shall denote this type of convergence by → . Every stochastically convergent sequence has an almost surely convergent subucp ucp sequence. Hence if Xn → X∞ and Xn → Y∞ , then for every t < ∞ for some subsequence a.s.
sup |Xnk (s) − X (s)| → 0, s≤t
and a.s.
sup |Xnk (s) − Y (s)| → 0 s≤t
therefore X∞ and Y∞ are indistinguishable. One can also easily prove the next observations: ucp
Proposition 1.149 If for all n the processes Xn are right-regular and Xn → X∞ then X∞ is indistinguishable from a process which has right-regular trajectoucp ries. If Xn is continuous for all n and Xn → X∞ then X∞ is indistinguishable from a process which has continuous trajectories. 106 Later, as a consequence of the Fundamental Theorem of Local Martingales, we shall prove 1 , see: Corollary 3.59, page 221, so the natural topology that every local martingale is in Hloc for the space of local martingales is the uniform convergence on compacts in probability. 107 If X and X has regular trajectories then the supremums are measurable. n
106
STOCHASTIC PROCESSES
1.4.4
Locally bounded processes
One can use localization to define the class of locally bounded processes: Definition 1.150 Denote by K the set of bounded process. X ∈ K if and only if there is a real number k such that |X(t, ω)| ≤ k for all (t, ω). A process X is locally bounded if X − X(0) ∈ Kloc . As we have seen108 every regular function is bounded on every compact interval. Let us consider the stopping times τ a inf {t : |X (t)| > a} . If X is right-regular then |X (τ a )| ≥ a, but as X can reach the level a with a jump, it can happen that for certain outcomes |X (τ a )| > a. For right-continuous processes one can only use the estimation |X (τ a )| ≤ a + |∆X (τ a )| . As the jump |∆X (τ a )| can be arbitrarily large X is not necessarily bounded on the random interval [0, τ a ] {(t, ω) : 0 ≤ t ≤ τ a (ω) < ∞} .
(1.66)
On the other hand, let us assume that X is left-continuous. If τ a (ω) > 0 and |X(τ a (ω)), ω| > a for some outcome ω then by the left-continuity one can decrease the value of τ a (ω), which by definition is impossible. Hence |X (τ a )| ≤ a on the set {τ a > 0}. This means that if X is left-continuous and X(0) = 0 then X is bounded on the random interval (1.66). These observations are the core of the next two propositions: Proposition 1.151 If the filtration is right-continuous then every left-regular process is locally bounded. Proof: Let X be left-regular. The process X − X(0) is also left-regular so one can assume that X(0) = 0. Define the random times τ n inf {t : |X(t)| > n} . The filtration is right-continuous, X is left-regular so τ n is a stopping time109 . As X(0) = 0, if τ n (ω) = 0 then |X (τ n )| ≤ n. If τ n (ω) > 0 then |X (τ n (ω), ω)| > n is impossible as in this case, by the left-continuity of X one could decrease τ n (ω). 108 See: 109 See:
Proposition 1.6, page 5. Example 1.32, page 17.
LOCALIZATION
107
Hence the truncated process X τ n is bounded. Let us show that τ n ∞, that is, let us show that the sequence (τ n ) is a localizing sequence. Obviously (τ n ) is never decreasing. If for some outcome ω the sequence (τ n (ω)) were bounded then one would find a bounded sequence (tn ) for which |X(tn , ω)| > n. Let (tnk )k be a monotone, convergent subsequence of (tn ). If tnk → t∗ , then |X(tn , ω)| → ∞, which is impossible as X has finite left and right limits. Proposition 1.152 If the filtration is right-continuous and the jumps of the right-regular process X are bounded then X is locally bounded. Proof: We can again assume that X(0) = 0. Assume that |∆X| ≤ a. As in the previous proposition if τ n inf {t : |X(t)| > n} then (τ n ) is a localizing sequence, |X(τ n −)| ≤ n, therefore |X τ n | ≤ n + |∆X(τ n )| ≤ n + a.
Example 1.153 In the previous propositions one cannot drop the condition of regularity.
The process X(t)
1/t 0
if t > 0 if t = 0
is continuous from the left but not regular, and it is obviously not locally bounded. The 1/ (1 − t) if t < 1 X(t) 0 if t ≥ 1 is continuous from the right but it is also not locally bounded.
2 STOCHASTIC INTEGRATION WITH LOCALLY SQUARE-INTEGRABLE MARTINGALES In this chapter we shall present a relatively simple introduction to stochastic integration theory. Our main simplifying assumption is that we assume that the integrators are locally square-integrable martingales. Every continuous process is 2 contains the continuous local martingales. locally bounded, hence the space Hloc In most of the applications the integrator is continuous, therefore in this chapter we shall mainly concentrate on the continuous case. As we shall see, the slightly 2 more general case, when the integrator is in Hloc is nearly the same as the continuous one. The central concept of this chapter is the quadratic variation [X]. We shall show that if X is a continuous local martingale then [X] is continuous, increasing and X 2 − [X] is also a local martingale. It is a crucial observation that in the continuous case these properties characterize the quadratic variation. When the integrator X is discontinuous then the quadratic variation [X] is also discontinuous. As in the continuous case, X 2 − [X] is still a local martingale, but this property does not characterize the quadratic variation for local martingales in general. The jump process of the quadratic variation ∆ [X] satisfies 2 the identity ∆ [X] = (∆X) , and [X] is the only right-continuous, increasing 2 process for which X 2 − [X] is a local martingale and the identity ∆ [X] = (∆X) holds. When the integrators are continuous one can define the stochastic integral for progressively measurable integrands. The main difference between the 2 case is that in the discontinuous case we should take continuous and the Hloc into account the jumps of the integral. Because of this extra burden in the discontinuous case one can define the stochastic integral only when the integrands are predictable. In the first part of the chapter we shall introduce the so-called Itˆ o–Stieltjes integral. We shall use the existence theorem of the Itˆ o–Stieltjes integral to prove the existence of the quadratic variation. After this, we present the construction 108
ˆ THE ITO–STIELTJES INTEGRALS
109
of stochastic integral when the integrators are continuous local martingales. At the end of the chapter we briefly discuss the difference between the continuous 2 and the Hloc case. In the present chapter we assume that the filtration is right-continuous and if N ∈ A has probability zero, then N ∈ Fs for all s. But we shall not need the assumption that (Ω, A, P) is complete.
2.1
The Itˆ o–Stieltjes Integrals
In this section we introduce the simplest concept of stochastic integration, which I prefer to call Itˆ o–Stieltjes integration. Every integral is basically a limit of certain approximating sums. The meaning of the integral is generally obvious for the finite approximations and by definition the integral operator extends the meaning of the finite sums to some more complicated infinite objects. In stochastic integration theory we have two stochastic processes: the integrator X and the integrand Y . As in elementary analysis, let us fix an interval [a, b] and let (n)
∆n : a = t0
(n)
< t1
< · · · < t(n) mn = b
(2.1)
be a partition of [a, b]. For a fixed partition ∆n let us define the finite approximating sum Sn
mn
(n) (n) (n) X tk − X tk−1 , Y τk
k=1 (n)
where the test points τ k have been chosen in some way from the time subin(n) (n) tervals [tk−1 , tk ]. If the integrator X is the price of some risky asset then (n)
(n)
(n)
(n)
X(tk ) − X(tk−1 ) is the change of the price during the time interval [tk−1 , tk ] (n)
and if Y (τ k ) is the number of assets one holds during this time period then Sn is the net change of the value of the portfolio during the whole time period [a, b]. If (n) (n) lim max tk − tk−1 = 0 n→∞
k
then the sequence of partitions (∆n ) is called infinitesimal. In this section we b say that the integral a Y dX exists if for any infinitesimal sequence of partitions of [a, b] the sequence of approximating sums (Sn ) is convergent and the limit is independent of the partition (∆n ). The main problem is the following: under which conditions and in which sense does the limit limn→∞ Sn exist? Generally we can only guarantee that the approximating sequence (Sn ) is convergent in probability and for the existence of the integral we should assume that the test (n) points τ k have been chosen in a very restricted way. That is, we should assume,
110
STOCHASTIC INTEGRATION (n)
(n)
that τ k = tk−1 . This type of integral we shall call the Itˆ o–Stieltjes integral of Y against X. Perhaps the most important and most unusual point in the theory is (n) that we should restrict the choice of the test points τ k . The simplest example showing why it is necessary follows: Example 2.1 Let w be a Wiener process. Try to define the integral
b
wdw!
a
Consider the approximating sums Sn
(n) (n) (n) w(tk ) w(tk ) − w(tk−1 ) ,
k
and In
(n) (n) (n) w(tk−1 ) w(tk ) − w(tk−1 ) .
k (n)
In the first case τ k
(n)
tk
(n)
and in the second case τ k
Sn − In =
(n)
tk−1 . Obviously
2 (n) (n) w(tk ) − w(tk−1 ) ,
k
which is the approximating sum for the quadratic variation of the Wiener process. As we will prove1 if n → ∞ then in L2 (Ω)-norm lim (Sn − In ) = b − a = 0,
n→∞
that is the limit of the approximating sums is dependent on the choice of the test (n) points τ k . As the interpretation of the stochastic integral is basically the net (n) (n) gain of some gambling process, it is quite reasonable to choose τ k as tk−1 as one should decide about the size of a portfolio before the prices change, since it is quite unrealistic to assume that one can decide about the size of an investment after the new prices have already been announced. It is very simple to see that 1 In = 2 =
w
2
(n) (tk )
−w
2
(n) (tk−1 )
k
−
(n) w(tk )
k
2 1 (n) 1 2 (n) w(tk ) − w(tk−1 ) , w (b) − w2 (a) − 2 2 k
1 See:
−
Example 2.27, page 129, Theorem B.17, page 571.
2
(n) w(tk−1 )
=
ˆ THE ITO–STIELTJES INTEGRALS
111
hence lim In =
n→∞
=
1 & 2 'b 1 w (t) a − (b − a) = 2 2 1 1 2 w (b) − w2 (a) − (b − a) , 2 2
and similarly lim Sn =
n→∞
=
2.1.1
1 & 2 'b 1 w (t) a − (b − a) + (b − a) = 2 2 1 1 2 w (b) − w2 (a) + (b − a) . 2 2
Itˆ o–Stieltjes integrals when the integrators have finite variation
Integration theory is quite simple when the trajectories of the integrator X have finite variation on any finite interval. As a point of departure it is worth recalling a classical theorem from elementary analysis. The following simple proposition is well-known and it is just a parametrized version of one of the most important existence theorems of the calculus. Proposition 2.2 (Existence of Riemann–Stieltjes integrals) Let us fix a finite time interval [a, b]. If the trajectories of the integrator X have finite variation and the integrand Y is continuous, then for all outcomes ω the limit of the integrating sums Sn
mn
(n) (n) (n) Y (τ k ) X(tk ) − X(tk−1 ) ,
(2.2)
k=1
exists and it is independent of the choice of the infinitesimal sequence of partitions ( (n) (n) (n) (2.1) and of the choice of the test points τ k ∈ tk−1 , tk . Proof. As the trajectories Y (ω) are continuous on [a, b] they are uniformly continuous and therefore for any ε > 0 there is a δ (ω) > 0, such that if |t − t | < δ (ω) , then2 |Y (t , ω) − Y (t , ω)| <
ε . Var (X (ω) , a, b)
(2.3)
2 We can assume that Var (X (ω) , a, b) > 0, otherwise X (ω) is constant on [a, b] and the integral trivially exists.
112
STOCHASTIC INTEGRATION
If all partitions of [a, b] are finer than δ (ω) /2, that is, if for all n δ (ω) (n) (n) max tk − tk−1 < k 2 then by (2.3) 0 ≤ |Si − Sj |
(i) (i) (i) (j) (j) (j) Y (τ k ) X(tk ) − X(tk−1 ) − Y (τ l ) X(tl ) − X(tl−1 ) k
l
(i) (j) Y (θr ) − Y (θr ) (X(sr ) − X(sr−1 )) ≤ r
(j) ≤ max Y (θ(i) ) − Y (θ ) |X(sr ) − X(sr−1 )| ≤ r r r
r
(j) ≤ max Y (θ(i) r ) − Y (θ r ) Var (X, a, b) ≤ ε, r
(i)
(j)
where (sr ) is any partition containing the points (tk ) and (tl ) and the (i) (j) θ(i) and θ(j) are the original test points τ k and τ k corresponding to r r [sr−1 , sr ] respectively. So for any ω, (Sn (ω)) is a Cauchy sequence. so for all ω the limit b
Y dX a
(ω) lim Sn (ω) n→∞
exists. If (Sp ) and (Sq ) are two different approximating sequences generated by different infinitesimal sequences of partitions of [a, b] or they belong to different choices of test points and In
Sp Sq
if n = 2p if n = 2q − 1
then by the argument just presented (In ) also has a limit, which is of course the common limit of (Sp ) and (Sq ). Hence the limit does not depend on the (n) infinitesimal sequence of partitions (tk ) and does not depend on the way of (n) choosing the test points (τ k ). Definition 2.3 If the value of the integral is independent of the choice of test (n) points (τ k ) then the integral is called the Riemann–Stieltjes integral of Y against b X. Of course the integral is denoted by a Y dX.
ˆ THE ITO–STIELTJES INTEGRALS
113
Example 2.4 IfY and X have common points of discontinuity then the Riemann– b Stieltjes integral a Y dX does not exist.
If Y (t)
0 if t ≤ 0 1 if t > 0
and X (t)
0 if t < 0 1 if t ≥ 0
1 (n) then the Riemann–Stieltjes integral −1 XdY does not exist. If τ k ≤ 0 for the subinterval containing t = 0 then Sn = 0, otherwise Sn = 1. Observe that (n) if the test point τ k is the left endpoint of the subinterval, then Sn = 0, hence the so-called Itˆo–Stieltjes integral3 is zero. Our goal is to extend the integral to discontinuous integrands. As a first step, we extend the integral to regular integrands. As we saw in the previous (n) example even for left-regular integrands we cannot choose the test points τ k arbitrarily. (n)
Definition 2.5 If the value of the test point τ k is always the left endpoint (n) (n) (n) (n) of the subinterval [tk−1 , tk ], that is if τ k = tk−1 for all k, then the integral is called the Itˆ o–Stieltjes integral of Y against X. Of course the Itˆo–Stieltjes b integrals are also denoted by a Y dX. Example 2.6 If f is a simple predictable jump that is f (t)
c1 c2
if if
t ≤ t0 t > t0
then for any regular function g the Itˆ o–Stieltjes integral is a
b
f dg = c1 (g (t0 +) − g (a)) + c2 (g (b) − g (t0 +)) .
If f is a simple jump that is c1 f (t) c3 c 2
if if if
t < t0 t = t0 t > t0
then for any right-regular function g the Itˆ o–Stieltjes integral is again (2.4). 3 See
the definition below.
(2.4)
114
STOCHASTIC INTEGRATION
If t0 = b then by definition g(t0 +) = g(b+) = g(b) so in this case (2.4) is (n) obvious. Let (tk ) be an infinitesimal sequence of partitions. By the definition of the integral Sn
(n) (n) (n) f (tk−1 ) g(tk ) − g(tk−1 ) =
k
(n) (n) = c1 g(tj ) − g(a) + c2 g(b) − g(tj ) , (n)
(n)
(n)
where t0 ∈ [tj−1 , tj ). If n → ∞, then tj t0 + and as g is regular the limit limn Sn exists and it is equal to the formula given. Assume that g is right-regular. (n) (n) If t0 = tj−1 then the approximating sums do not change. If t0 = tj−1 then
(n) Sn = c1 (g (t0 ) − g (a)) + c3 g(t0 ) − g(tj ) +
(n) + c2 g(b) − g(tj ) . (n)
g is right-continuous at t0 so g (t0 ) − g(tj ) → 0, hence the limit is again the same as in the previous case. One can easily generalize the example above4 : Lemma 2.7 If every trajectory of the integrand Y is a finite number of jumps and X is a right-continuous process, then for arbitrary a < b the Itˆ o– b Stieltjes integral a Y dX exists and the approximating sums converge for every outcome ω. Example 2.8 If f is a simple spike, that is if f (t)
c 0
if if
t = t0 , t = t0
then for any right-continuous integrator the Itˆ o–Stieltjes integral of f is zero.
The approximating sum is Sn = 4 Let
0 (n)
(n)
c · g(tj+1 ) − g(tj )
(n)
if t0 = tj
(n)
if t0 = tj
us observe that the Itˆ o–Stieltjes integral is, trivially, additive.
.
ˆ THE ITO–STIELTJES INTEGRALS
115
In the first case of course limn Sn = 0, in the second case as g is right-continuous lim Sn = c lim
n→∞
n→∞
(n) (n) (n) g(tj+1 ) − g(tj ) = c lim g(tj+1 ) − g(t0 ) = 0. n→∞
Observe that if g has bounded variation, then g defines a signed measure on R. b The Lebesgue–Stieltjes integral is a f dg = f (t0 )∆g(t0 ) which is different from the Itˆo–Stieltjes integral. Later5 we shall show that for left-regular processes the Lebesgue–Stieltjes and the Itˆ o–Stieltjes integrals are equal but, as in this case f is not left-regular, the theorem is not applicable6 . We shall very often use the following simple observation: Proposition 2.9 (The existence of the Itˆ o–Stieltjes integral) If the integrator X is right-continuous7 and it has finite variation and the integrand Y is b regular then for any time interval [a, b] the Itˆ o–Stieltjes integral a Y dX exists and for all outcome ω the approximating sequences In (ω)
(n) (n) (n) Y (tk−1 , ω) X(tk , ω) − X(tk−1 , ω)
k
are convergent. Proof. The proof is similar to the proof of the existence of Riemann–Stieltjes integrals. Fix an outcome ω and let (In ) be the sequence of the approximating sums. Fix an ε > 0 and an outcome ω. By the regularity of Y (ω) there are only a finite number of jumps bigger than8 c Let J
ε . 4 · Var (X) (a, b, ω)
∆Y · χ (|∆Y | ≥ c) and Z Y − J. (J)
1. Let us denote by (In ) the approximating sums formed with J. As Y is regular the number of ‘big jumps’ on every trajectory is finite. X is right-continuous, b hence by the previous lemma the integral a J (ω) dX (ω) exists for any ω. Hence if i and j are big enough, then ε (J) (J) Ii (ω) − Ij (ω) ≤ . 2 5 It is an easy consequence of the Dominated Convergence Theorem. See: Theorem 2.88, page 174. See also the properties of the stochastic integral on page 434. 6 Recall that the Riemann–Stieltjes integral b f dg does not exist. a 7 If X is not right-continuous then we should assume that Y is left-regular. 8 See: Proposition 1.5, page 5. We can assume that Var (X (ω) , a, b) > 0 otherwise X (ω) is constant on [a, b] and the proposition is trivially satisfied.
116
STOCHASTIC INTEGRATION
2. Finally let us define the approximating sums In(Z)
(n) (n) (n) Z(tk−1 , ω)X (tk , ω) − X(tk−1 , ω) .
k
The jumps of Z are smaller than c and Z is regular, hence9 there is a δ(ω) such that if |s − t| ≤ δ(ω) then |Z(s, ω) − Z(t, ω)| ≤ 2c. (n) (n) If maxk tk − tk−1 ≤ δ(ω)/2 for all n ≥ N then as in the case of the ordinary Riemann–Stieltjes integral ε (Z) (Z) Ii (ω) − Ij (ω) ≤ 2c · Var (X (ω) , a, b) ≤ . 2 3. Adding up the two inequalities above if i and j are sufficiently large then (J) (J) |Ii (ω) − Ij (ω)| ≤ Ii (ω) − Ij (ω) + (Z) (Z) + Ii (ω) − Ij (ω) ≤ ε.
(2.5)
This means that (In (ω)) is a Cauchy sequence for any ω. The rest of the proof is the same as the last part of the proof of the previous proposition. Example 2.10 The Itˆ o–Stieltjes and the Lebesgue–Stieltjes integrals are not equal.
One should emphasize that as X has bounded variation one can also define the pathwise Lebesgue–Stieltjes integral of Y with respect to the measures generated by the trajectories of X. If Y is left-continuous then Y = lim
n→∞
(n) (n) (n) Y tk−1 χ tk−1 , tk
k
so by the Dominated Convergence Theorem the two integrals are equal. But in general the Itˆ o–Stieltjes and the Lebesgue–Stieltjes integrals are not equal. If Y (t) = X (t) 9 See:
Proposition 1.7, page 6.
0 if t < 1/2 1 if t ≥ 1/2
ˆ THE ITO–STIELTJES INTEGRALS
117
then the measure generated by X is the Dirac measure δ 1/2 so the Lebesgue– Stieltjes integral over (0, 1] is one, while the Itˆ o–Stieltjes integral is zero10 . 2.1.2
Itˆ o–Stieltjes integrals when the integrators are locally square-integrable martingales
Perhaps the most important stochastic processes are the Wiener processes. As the trajectories of Wiener processes almost surely do not have finite variation11 , we cannot apply the previous construction when the integrator is a Wiener process. Theorem 2.11 (Fisk) Let L be a continuous local martingale. If the trajectories of L have finite variation then for almost all outcomes ω the trajectories of L are constant functions. Proof. Consider the local martingale M L − L (0). It is sufficient to prove that M = 0. Let V Var (M ) and let (ρn ) be a localizing sequence of M . As the variation of a continuous function is continuous υ n (ω) inf {t : |M (t, ω)| ≥ n} and κn (ω) inf {t : V (t, ω) ≥ n} are stopping times. Hence τ n υ n ∧ κn ∧ ρn is also a stopping time. Obviously τ n ∞, hence if M τ n = 0 for all n then M is zero on [0, τ n ] for all n and therefore M will be zero on ∪n [0, τ n ] = R+ × Ω, so M = 0. As the trajectories of M τ n and V τ n are bounded one can assume that M and V Var (M ) are (n) bounded. Let (tk ) be an arbitrary infinitesimal sequence of partitions of [0, t]. By the energy identity12 if u > v then
2 E (M (u) − M (v)) = E M 2 (u) − M 2 (v) , (2.6) hence as M (0) = 0
E M 2 (t) = E M 2 (t) − E M 2 (0) =
(n) (n) 2 2 =E M tk − M tk−1 = k
=E
k
10 See:
Example 2.6, page 113. Theorem B.17, page 571. 12 See: Proposition 1.58, page 35. 11 See:
M
(n) tk
−M
(n) tk−1
2
.
118
STOCHASTIC INTEGRATION
V is bounded hence V Var (M ) ≤ c.
E M 2 (t) ≤
(n)
(n) (n) (n) ≤E − M tk−1 · max M tk − M tk−1 ≤ M tk
k
k
(n) (n) ≤ E V (t) · max M tk − M tk−1 k
(n) (n) ≤ c · E max M tk − M tk−1 . k
The trajectories of M are continuous hence they are uniformly continuous on [0, t] so
(n) (n) − M tk−1 = 0. lim max M tk
n→∞
k
On the other hand
(n) (n) max M tk − M tk−1 ≤ V (t) ≤ c, k
so we can use the Dominated Convergence Theorem:
(n) (n) lim E max M tk − M tk−1 = 0.
n→∞
k
a.s.
Hence M (t) = 0 for every t. The trajectories of M are continuous and therefore13 for almost all outcomes ω one has that M (t, ω) = 0 for all t. This means that when the integrators are continuous local martingales we need another approach. First we prove two very simple lemmata: Lemma 2.12 Let (Mk , Fk ) be a discrete-time martingale and let (Nk ) be an F (Fk ) adapted process. If the variables Nk−1 · (Mk − Mk−1 ) are integrable then the sequence Z0 0,
Zn
n k=1
13 See:
Proposition 1.9, page 7.
Nk−1 · (Mk − Mk−1 )
ˆ THE ITO–STIELTJES INTEGRALS
119
is an F-martingale. Specifically, if N is uniformly bounded and M is an arbitrary discrete-time martingale then Z is a martingale. Proof. By the assumptions Nk−1 ·(Mk − Mk−1 ) is integrable, hence if k −1 ≥ m then E (Nk−1 (Mk − Mk−1 ) | Fm ) = E (E (Nk−1 (Mk − Mk−1 ) | Fk−1 ) | Fm ) = = E (Nk−1 E (Mk − Mk−1 | Fk−1 ) | Fm ) = = E (Nk−1 · 0 | Fm ) = 0, from which the lemma is evident. Lemma 2.13 Let (Mk , Fk ) be a discrete-time L2 (Ω)-valued martingale. If |Nk | ≤ c is an F-adapted sequence and Z0 0,
Zn
n
Nk−1 · (Mk − Mk−1 )
k=1
then ) 2 2 Zn 2 ≤ c Mn 2 − M0 2 . Proof. By the previous lemma (Zn ) is a martingale, so by the energy equality 2
Zn 2 =
n
2
Nk−1 (Mk − Mk−1 )2 .
k=1
Using the energy equality again 2
Zn 2 ≤ c2
n
2
Mk − Mk−1 2 =
k=1
= c2
n
2 2 Mk 2 − Mk−1 2 =
k=1
2 2 = c2 Mn 2 − M0 2 . First we prove the existence of the integral for continuous integrands. Proposition 2.14 (Existence of Itˆ o–Stieltjes integrals for continuous integrands) If X ∈ H2 and Y is adapted and continuous on a finite interval
120
STOCHASTIC INTEGRATION
[a, b] then the Itˆ o –Stieltjes integral In
b a
Y dX exists and the approximating sums
(n) (n) (n) Y (tk−1 ) X(tk ) − X(tk−1 )
k
converge in probability. Proof. The proof is similar to the proof of the existence of the integral when the integrator has finite variation. 1. The basic, but not entirely correct trick is that as Y is continuous it is uniformly continuous, hence if In and Im are two approximating sums of the integral then by the previous lemma In − Im 2
(n) (n) (n) (m) (m) (m) Y (tk−1 ) X(tk )−X(tk−1 ) − Y (tk−1 ) X(tk )−X(tk−1 ) = k k 2
= Y (tk−1 ) − Y (tk−1 ) X(tk ) − X(tk−1 ) ≤ k 2 ) 2 2 ≤c X (b)2 − X (a)2 . Of course the main problem with this estimation is that one cannot guarantee that for any fixed partition Y (tk−1 , ω) − Y (tk−1 , ω) ≤ c
(2.7) (n)
(m)
for every ω. What one can show is that if the partitions (tk ) and (tk ) are sufficiently fine then outside of an event with small probability the estimation (2.7) is valid. That is the reason why one can prove only that the integrating sums converge in probability and not in L2 (Ω). 2. To show the correct proof fix an α and a β and let * + βα2 +
. c, 2 2 2 X (b)2 − X (a)2 For every δ > 0 let us define the modulus of continuity of Y : Mδ (ω, u) sup {|Y (t, ω) − Y (s, ω)| : |t − s| ≤ δ, t, s ∈ [a, u]} . As Y is continuous one can calculate the supremum when s and t are rational numbers so Mδ is adapted and as Y is continuous obviously Mδ is also continuous.
ˆ THE ITO–STIELTJES INTEGRALS
121
Y is continuous, so every trajectory of Y is uniformly continuous on [a, b], hence for every ω lim Mδ (ω, b) = 0.
δ0
This means that if δ is sufficiently small then P(Mδ (b) ≥ c) ≤
β . 2
Fix this δ and let us define the stopping time τ inf {u : Mδ (u) ≥ c} ∧ b. As τ is a stopping time, Z Y τ is adapted and if |x − y| ≤ δ then |Z (x) − Z (y)| ≤ c. Let In(Z)
(n) (n) (n) Z(tk−1 ) X(tk ) − X(tk−1 ) .
k
(i) (j) If the partitions tk and tk are finer than δ/2 then by the previous lemma 2
βα2 (Z) (Z) 2 2 . Ii − Ij ≤ c2 X (b)2 − X (a)2 = 2 2 Let A {Mδ (b) ≥ c}. It is easy to see that Z = Y on Ac . By Chebyshev’s inequality P (|Ii − Ij | > α) = = P ({|Ii − Ij | > α} ∩ A) + P ({|Ii − Ij | > α} ∩ Ac ) ≤ ≤ P (A) + P ({|Ii − Ij | > α} ∩ Ac ) =
(Z) (Z) = P (A) + P Ii − Ij > α ∩ Ac ≤ 2 (Z) (Z)
− I I i j β β (Z) (Z) 2 ≤ ≤ + P Ii − Ij > α ≤ + 2 2 2 α
2 2 c2 X (b)2 − X (a)2 β β β ≤ + = + = β. 2 2 α 2 2 Hence (In ) is convergent in probability. Now we generalize the theorem for regular integrands.
122
STOCHASTIC INTEGRATION
Proposition 2.15 (The existence of the Itˆ o–Stieltjes integral for H2 integrators) If on a finite interval [a, b] the adapted stochastic process Y is b regular and X ∈ H2 then the Itˆ o–Stieltjes integral a Y dX exists and the Itˆ o-type approximating sums converge in probability. Proof. The proof is similar to the proof of the existence of the integral when the integrator has finite variation. Let (In ) be an approximating sequence of the b integral a Y dX. Fix an ε and a β. * + + c,
Let again J
βε2 2
2
48 X (b)2 − X (a)2
∆Y χ (|∆Y | ≥ c) , Z Y − J.
1. As the trajectories of Y are regular for any ω the trajectory Y (ω) has a finite number of jumps which are larger than c. X ∈ H2 and by definition X b is right-continuous, hence the integral a JdX exists. As it converges for every outcome ω it converges stochastically as well, so if i and j are big enough, then ε β (J) (J) P Ii − Ij > ≤ . 2 3 2. The jumps of Z are smaller than c. As in the continuous case14 if δ > 0 is small enough then there is a stopping time τ such that P (τ < b) P (A) ≤
β 3
and if |x − y| ≤ δ then |Z (x) − Z (y)| ≤ 2c on the random interval [a, τ ]. If (i) V Z τ then |V (x) − V (y)| ≤ 2c whenever |x − y| ≤ δ. If the partitions (tk ) (j) and (tk ) are finer than δ/2 then again as in the continuous case 2
(V ) (V ) 2 2 2 Ii − Ij ≤ (2c) X (b)2 − X (a)2 . 2
By Chebyshev’s inequality
ε (2c)2 X (b)22 − X (a)22 β (V ) (V ) P Ii − Ij > ≤ = . 2 2 3 (ε/2) 14 See:
Proposition 1.7, page 6.
ˆ THE ITO–STIELTJES INTEGRALS
123
3. If i and j are big enough, then ε
ε
(Z) (J) (J) (Z) P (|Ii − Ij | > ε) ≤ P Ii − Ij > + P Ii − Ij > ≤ 2 2 ≤
ε
β (Z) (Z) + P Ii − Ij > ≤ 3 2
≤
ε
β (Z) (Z) ≤ + P (A) + P Ac ∩ Ii − Ij > 2 3
≤
ε
2β (V ) (V ) + P Ii − Ij > ≤ β. 3 2
This means that (In ) is a Cauchy sequence in probability and hence it converges in probability. Corollary 2.16 Let Y be an adapted, regular process on a finite interval [a, b]. b 2 If X ∈ Hloc then the Itˆ o–Stieltjes integral a Y dX exists and the approximating sums converge in probability. 2 and let (τ n ) be a localizing sequence of X. As Proof. Assume that X ∈ Hloc τ n ∞ for any β > 0 if s is big enough then P (τ s ≤ b) < β/2. Let
In
(n) (n) (n) Y (tk−1 ) X(tk ) − X(tk−1 ) ,
k
Sn
(n) (n) (n) Y (tk−1 ) X τ s (tk ) − X τ s (tk−1 ) .
k
For any α > 0 P (|In − Im | > α) ≤ P (τ s ≤ b) + P (|In − Im | > α, τ s ≥ b) ≤ ≤
β + P (|In − Im | > α, τ s ≥ b) ≤ 2
≤
β + P (|Sn − Sm | > α) . 2
As X τ s ∈ H2 by the previous proposition P (|Sn − Sm | > α) → 0. Hence (In ) is a stochastic Cauchy sequence, so it is convergent in probability.
124 2.1.3
STOCHASTIC INTEGRATION
Itˆ o–Stieltjes integrals when the integrators are semimartingales
As we can integrate with respect to processes with finite variation and with respect to locally square-integrable martingales, the next definition is very natural: Definition 2.17 An adapted process X is called a semimartingale if X has a decomposition X = X (0) + V + H
(2.8)
2 where V is a right-continuous, adapted process with finite variation and H ∈ Hloc and V (0) = H (0) = 0.
It is important to emphasize that at the moment we do not know too much about the class of semimartingales. As there are martingales which are not locally square-integrable it is not even evident from the definition that every martingale is a semimartingale. Later we shall prove that every local martingale is a semimartingale in the above sense15 . We shall later also prove that every integrable sub- and supermartingale is a semimartingale16 . Therefore the class of semimartingales is a very broad one. Every continuous local martingale is locally square-integrable 17 , therefore in the continuous case we can use the following definition: Definition 2.18 An adapted continuous stochastic process X is called a continuous semimartingale if X has a decomposition (2.8) where H is a continuous local martingale and V is a continuous, adapted process with finite variation. Proposition 2.19 If X is a continuous semimartingale then the decomposition (2.8) is unique. Proof. If X = X (0)+H1 +V1 and X = X (0)+H2 +V2 then H1 −H2 = V2 −V1 is a continuous local martingale having finite variation. Hence by Fisk’s theorem18 H1 − H2 = V1 − V2 = 0. Example 2.20 For discontinuous semimartingales the decomposition (2.8) necessarily unique.
is not
15 This is the so called Fundamental Theorem of Local Martingales. See: Theorem 3.57, page 220. 16 This is a direct consequence of the so called Doob–Meyer decomposition. See: Proposition 5.11, page 303. 17 See: Example 1.137, page 96. 18 See: Theorem 2.11, page 117.
ˆ THE ITO–STIELTJES INTEGRALS
125
The simplest example is the compensated Poisson process. If π is a Poisson process with parameter λ then the compensated Poisson process X (t) π (t) − 2 λt is in Hloc and the trajectories of X on any finite interval have finite variation. So H X, V 0 and H 0, V X are both proper decompositions of X. Almost surely convergent sequences are convergent in probability, therefore one can easily prove the following theorem: Theorem 2.21 (Existence of Itˆ o–Stieltjes integrals) If X is a semimartingale and Y is a regular and adapted process then for any finite interval [a, b] the b Itˆ o–Stieltjes integral a Y dX exists and it is convergent in probability. The value of the integral is independent of the value of the jumps of Y , that is for any regular Y
b
Y dX =
b
b
a
Y− dX =
Y+ dX.
a
a
Proof. We have already proved the first part of the theorem. Let (In ) be the b sequence of the approximating sums for a Y dX and let (Sn ) be the sequence of approximating sums when the integrand is Y− . We need to prove that In − Sn =
(
(n)
P (n) (n) (n) X tk − X tk−1 → 0. Y tk−1 − Y− tk−1
(2.9)
k
Observe that the situation is very similar to that in the proof of Theorem 2.15. We can separate the big jumps and the small jumps and apply the same argument as above19 . Example 2.22 Wiener integrals.
The simplest case of stochastic integration is the so-called Wiener integral: the integrator is a Wiener process w, the integrand is a deterministic function f . If f is regular, then f , as a stochastic process, is adapted and regular, hence by the b above theorem the expression a f (s) dw (s) is meaningful. The increments of a Wiener process are independent. As the sum of independent normally distributed variables is again normally distributed
(n) f (ti−1 )
(n) w(ti )
−
i 19 See:
(n) w(ti−1 )
∼ =N
0,
i
Example 2.8, page 114.
f
2
(n) ti−1
(n) ti
−
(n) ti−1
.
126
STOCHASTIC INTEGRATION
Stochastic convergence implies convergence in distribution, hence
b
f dw ∼ = N 0,
a
b 2
f (t)dt ,
a
where N (µ, σ 2 ) denotes the normal distribution with expected value µ and variance σ 2 . 2.1.4
Properties of the Itˆ o–Stieltjes integral
The next properties of the Itˆ o–Stieltjes integral are obvious: Proposition 2.23 If X1 , X2 and X are semimartingales, Y1 , Y2 and Y are adapted regular processes, α and β are constants then b b a.s. b 1. α a Y1 dX + β a Y2 dX = a (αY1 + βY2 ) dX, b b b a.s 2. a Y d (αX1 + βX2 ) = α a Y dX1 + β a Y dX2 . b b a.s. c 3. If a < c < b, then a Y dX = a Y dX + c Y dX. 4. If Y1 χA is an equivalent modification of Y2 χA for some A ⊆ Ω then the b b integrals a Y1 dX and a Y2 dX are almost surely equal on A. Since the approximating sums are convergent in probability it is important to note that the Itˆ o–Stieltjes integral is defined only as an equivalence class. In the following we shall not distinguish between functions and equivalence classes so a.s. when it is not important to emphasize this difference instead of = we shall use the simpler sign =. 2.1.5
The integral process
Let us briefly investigate the integral process (Y • X) (t)
t
Y dX. a
We have defined the stochastic integral only for fixed time intervals. On every time interval the definition determines the value of the stochastic integral up to a measure-zero set, hence the properties of the integral process t → (Y • X) (t) are unclear. It is not a stochastic process, just an indexed set of random variables! When does it have a version which is a martingale? Assume that X ∈ H2 and that Y is adapted. Assume also that Y is uniformly bounded that is |Y | ≤ c for some constant c. As the filtration F is right-continuous, the right-regular process
ˆ THE ITO–STIELTJES INTEGRALS
127
Y+ is also adapted. As we have seen20 for every t ∈ [a, b]
2 (n) (n) (n) 2 ≤ Y+ tk−1 ∧ t X tk ∧ t − X tk−1 ∧ t In (t)2 E k
≤ c2 E X 2 (b) − E X 2 (a) K, hence the sequence In (t)
(n) (n) (n) Y+ tk−1 ∧ t X tk ∧ t − X tk−1 ∧ t
k
is bounded in L2 (Ω) so the sequence of the approximating sums is uniformly integrable hence not only p
In (t) → (Y • X) (t) but also L1
In (t) → (Y • X) (t) . It is easy to see21 that if s < t then E (In (t) | Fs ) = In (s) . L1
As In (t) → operator
t a
Y dX using the L1 (Ω)-continuity of the conditional expectation
t
Y dX | Fs
E
s
Y dX.
=
a
a
Observe that In (t) is right-regular so In (t) is a martingale for every n. As Im −In is a martingale by Doob’s inequality, for any λ > 0
λP sup |In (t) − Im (t)| ≥ λ t
≤ In (b) − Im (b)1 .
(In (b)) is convergent in L1 (Ω) so P
sup |In (t) − Im (t)| → 0, t
20 See: 21 See:
Lemma 2.13, page 119. Lemma 2.12, page 118.
128
STOCHASTIC INTEGRATION
hence for a subsequence a.s.
sup |Ink (t) − Imk (t)| → 0,
(2.10)
t
so except for a measure-zero set the continuity-type properties of trajectories of (In ) are preserved, so we get the following proposition: Proposition 2.24 If Y is an adapted, regular, and uniformly bounded process, X ∈ H2 then the integral process (Y • X) (t)
t
Y dX,
t≥a
a
has a version which is a martingale. If (In ) is the sequence of approximating sums then for every t P
sup |In (s) − (X • M ) (s)| → 0.
(2.11)
a≤s≤t
If X is continuous and bounded then Y • X has a continuous version. Let us emphasize that in the argument above the set of exceptional points N in (2.10) is in Fb . Of course we should define the integral process on N as well, and of course we should guarantee that the integral process is adapted. We can do this only when we assume that for all s ≤ b, N ∈ Fs . This assumption is part of the usual conditions. Observe that in the continuous case we do not explicitly use the right-continuity of the filtration. On the other hand, this is a very uninteresting remark since, in most cases22 , if we add the measure-zero sets to the filtration then the augmented filtration is right-continuous. 2.1.6
Integration by parts and the existence of the quadratic variation
One of the most important concepts of stochastic analysis is the quadratic variation. The main reason to introduce the Itˆ o–Stieltjes integral is that from the existence theorem of the Itˆo–Stieltjes integral one can easily deduce the existence of the quadratic variation of semimartingales. Definition 2.25 Let U and V be stochastic processes on [a, b]. If for every
(n) of [a, b] the sequence infinitesimal sequence of partitions tk Qn
(n)
(n) (n) (n) U tk − U tk−1 V tk − V tk−1 k
22 E.g.
if the filtration is generated by a L´evy process. See: Proposition 1.103, page 67.
ˆ THE ITO–STIELTJES INTEGRALS
129
is convergent in probability then the limit limn→∞ Qn is called the quadratic co-variation of U and V . The quadratic co-variation of U and V on [a, b] is b b b denoted by [U, V ]a . If V = U then [U, U ]a [U ]a is called the quadratic variation of U . Of course in stochastic convergence b
[U ]a lim
n→∞
2 (n)
(n) U tk − U tk−1 . k
Example 2.26 If the trajectories of X are continuous and the trajectories of V have a.s. finite variation then [X, V ]ba = 0 for any interval [a, b].
By the continuity assumption, the trajectories of X are uniformly continuous on (n) (n) the compact interval [a, b]. Hence if maxk tk − tk−1 → 0 then for every ω (n) (n) lim max X(tk , ω) − X(tk−1 , ω) → 0.
n→∞
k
Therefore, as Var(V, a, b) < ∞
(n) (n) (n) (n) X(tk ) − X(tk−1 ) V (tk ) − V (tk−1 ) ≤ |Qn | k (n) (n) ≤ max X(tk ) − X(tk−1 ) Var(V, a, b) → 0. k
a.s.
Example 2.27 If w is a Wiener process23 then [w]t0 = t. If π is a Poisson process a.s. then [π]t0 = π (t).
If π is a Poisson process then for any ω the number of the jumps on any finite interval [0, t] is finite, so for any ω one can assume that every subinterval contains just one jump, hence Qn (t, ω) is the number of jumps of the trajectory π (ω) during the time interval [0, t]. So evidently Qn (t, ω) = π (t, ω). Proposition 2.28 (Integration By Parts Formula) If M and N are semimartingales then: b
1. For any finite interval [a, b] the quadratic co-variation [M, N ]a exists. 2. The following integration by parts formula holds: (M N ) (b) − (M N ) (a) =
M− dN + a
23 See:
Theorem B.17, page 571.
b
a
b
b
N− dM + [M, N ]a .
(2.12)
130
STOCHASTIC INTEGRATION
Proof. By definition semimartingales are right-regular processes so the processes (n) M− and N− are well-defined left-regular processes. For any partition (tk ) of [a, b] let us define the approximating sums
(n) (n) (n) (n) M tk−1 ∆N tk N tk−1 ∆M tk + +
k
k
+
(n)
∆M tk
(n)
∆N tk
.
k
With elementary calculation for all k (n)
(n)
(n)
(n)
M (tk )N (tk ) − M (tk−1 )(N tk−1 ) =
(n) (n) (n) = M tk−1 N (tk ) − N (tk−1 ) +
(n) (n) (n) + N tk−1 M (tk ) − M (tk−1 ) +
(n) (n) (n) (n) + M (tk ) − M (tk−1 ) N (tk ) − N (tk−1 ) . Adding up by k, on the left side one gets a telescopic sum which adds up to M (b) N (b) − M (a) N (a) , which is the expression on the left-hand side of (2.12). The integrating sums on the right-hand side converge to the Itˆ o–Stieltjes integrals
b
M dN = a
b
M− dN a
and
b
b
N dM = a
N− dM a
b
so [M, N ]a exits and the formula (2.12) holds. Example 2.29 The jumps of independent Poisson processes.
Let N1 and N2 be two Poisson processes with respect to the same filtration24 F. For s ≥ 0 let Ui (s, t) 24 That
exp (−sNi (t)) , E (exp (−sNi (t)))
i = 1, 2
is N1 and N2 are counting L´evy processes with respect to the same filtration.
ˆ THE ITO–STIELTJES INTEGRALS
131
be the exponential martingales defined by the Laplace transforms of the Poisson processes. By the Integration By Parts Formula
t
U1 (s1 , t) U2 (s2 , t) − 1 =
U1 (s1 , r−) U2 (s2 , dr) + 0
+
t
U2 (s2 , r−) U1 (s1 , dr) + 0
+ [U1 (s1 ) , U2 (s2 )] (t) . It is easy to see that U1 and U2 are bounded martingales, with respect to F for any s ≥ 0 on any finite interval [0, t]. As they are also F-adapted the stochastic integrals are martingales25 . Therefore the expected value of the stochastic integrals are zero. So E (U1 (s1 , t) U2 (s2 , t)) − 1 = E ([U1 (s1 ) , U2 (s2 )] (t)) . By the definition of U1 and U2
2 2 ! E exp − si Ni (t) = E (exp (−si Ni (t))) i=1
i=1
if and only if E ([U1 (s1 ) , U2 (s2 )] (t)) = 0.
(2.13)
That is N1 (t) and N2 (t) are independent if and only if (2.8) holds26 . As Laplace transform is continuous in time ∆Ui (s, r) =
exp (−sNi (r)) − exp (−sNi (r−)) ≤0 E (exp (−sNi (r)))
it is easy to see that [U1 (s1 ) , U2 (s2 )] (t) =
∆U1 (s1 , r) ∆U2 (s2 , r) ≥ 0.
r≤t
Therefore its expected value is zero if and only if it is almost surely zero. Hence N1 (t) and N2 (t) are independent if and only if with probability one N1 and N2 do not have common jumps on the interval [0, t]. 25 See: 26 One
Proposition 2.24, page 128. can easily modify the proof of Lemma 1.96 on page 60.
132
STOCHASTIC INTEGRATION
The next property of the quadratic co-variation is obvious: Proposition 2.30 If M, N and U are arbitrary semimartingales, ξ and η are F0 -measurable random variables then for any interval [a, b] b a.s.
b
b
[ξM + ηN, U ]a = ξ [M, U ]a + η [N, U ]a . Specifically [M + N ] = [M ] + 2 [M, N ] + [N ] .
a.s.
Example 2.31 If X = X (0)+L+V is a continuous semimartingale then [X]ba = [L]ba for any interval [a, b], where L is the continuous local martingale part of X . b a.s.
As V and L are continuous and the trajectories of V have finite variation [V ]a = a.s. 0 and [V, L] = 0. By the additivity: b a.s.
b
b a.s.
[X]a [X (0) + L + V ]a = [L + V ]a = a.s.
b
b a.s.
b
b
= [L]a + 2 [L, V ]a + [V ]a = [L]a .
Example 2.32 Assume that F is a deterministic, right-regular function with finite variation. If w is a Wiener process then
t
w (s) dF (s) ∼ =N
0,
0
0
t
(F (t) − F (s))2 ds .
w is continuous and F has finite variation therefore [w, F ] = 0. By the integration by parts formula w (t) F (t) =
t
t
wdF +
F− dw,
0
0
hence
t
t
wdF = w (t) F (t) − 0
F− dw = 0
t
F (t) dw −
= 0
t
F− dw = 0
t
(F (t) − F (s−)) dw (s) .
= 0
ˆ THE ITO–STIELTJES INTEGRALS
133
The last integral is a Wiener integral, so 0
t
wdF ∼ =N
t 2 0, (F (t) − F (s−)) ds = 0
t 2 (F (t) − F (s)) ds . = N 0, 0
As we have remarked, if X has finite variation and Y is continuous then27 [X, Y ] = 0. Hence in this case the integration by parts formula is XY − X (0) Y (0) = Y • X + X− • Y. For this formula we do not in fact need the continuity of Y . Observe that as X has finite variation every trajectory of X defines a measure on R+ . Let Y be an arbitrary semimartingale, and let ∆Y denote the jumps of Y . We show, that in this case [Y, X] = ∆Y • X, where the integral is the Lebesgue–Stieltjes integral defined by the trajectories of X. If U ∆Y χ(|∆Y | ≥ ε) are the jumps of Y which are bigger than ε then as the number of such jumps on every finite interval is finite [Y, X] = [Y − U, X] + [U, X] = = [Y − U, X] + ∆Y χ(|∆Y | ≥ ε)∆X = = [Y − U, X] + ∆Y χ(|∆Y | ≥ ε) • X. The jumps of the regular process Z Y − U are smaller than ε, hence if the partition of the interval [a, b] is fine enough, then28 (n) (n) Z(tk , ω) − Z(tk−1 , ω) ≤ 2ε for any ω. Therefore if n → ∞
(n) (n) (n) (n) Z(tk ) − Z(tk−1 ) X(tk ) − X(tk−1 ) ≤ 2εVar (X, a, b) → 0. k
As X has finite variation and the integral is a Lebesgue–Stieltjes integral one can use the Dominated Convergence Theorem. From this theorem for every 27 See: 28 See:
Example 2.26, page 129. Proposition 1.7, page 6.
134
STOCHASTIC INTEGRATION
trajectory ∆Y χ(|∆Y | ≥ ε) • X → ∆Y • X =
∆Y ∆X,
assuming of course that for every trajectory, on every finite interval, |∆Y | is integrable. But this has to be true as the trajectories of Y are regular so on every finite interval every trajectory of Y will be bounded29 . Proposition 2.33 If X is right-continuous and has finite variation, Y is an arbitrary semimartingale then [X, Y ] = ∆Y ∆X = ∆Y • X (2.14) therefore30 XY − X (0) Y (0) = Y− • X + X− • Y + [X, Y ] = = Y− • X + X− • Y + ∆Y • X = = Y • X + X− • Y where the integral with respect to X is a Lebesgue–Stieltjes integral and the integral with respect to Y is an Itˆ o–Stieltjes integral. 2.1.7
The Kunita–Watanabe inequality
In the construction of the stochastic integral below we shall use the following simple inequality: Proposition 2.34 (Kunita–Watanabe inequality) If X, Y are product measurable processes, and M, N are semimartingales, a ≤ b ≤ ∞ and V Var ([M, N ]) then b b b a.s. |XY | dV ≤ X 2 d [M ] Y 2 d [N ]. (2.15) a
a
a
Remark first that the meaning of the proposition is not really clear as it is not clear what is the meaning of [M ], [N ] and [M, N ]. So far we have defined the quadratic variation only for fixed time intervals, and the quadratic variation for every time interval is defined as a limit in stochastic convergence, and hence the quadratic variation on any interval is defined just up to a measure-zero set. If t X is a semimartingale then for every t one can define [X] (t) [X]0 , but this [X] is not a stochastic process since for a fixed ω and t the value of [X] (t, ω) 29 See:
Proposition 1.6, page 5. that the Lebesgue–Stieltjes integral Y •X exists: The trajectories of Y are regular, hence they are bounded on every finite interval. 30 Observe
ˆ THE ITO–STIELTJES INTEGRALS
135
is undefined. Of course, if t is restricted to the set of the rational numbers then we can collect the corresponding measure-zero sets in just one measurezero set, but it is unclear how one can extend this process to the irrational values of t as at the moment we have not proved any continuity property of the quadratic variation. Observe, that we do not know anything about integral processes. In particular we do not know when they will be martingales. If the integral process is a semimartingale then, by definition, it has a right-continuous version, so by (2.12) the quadratic variation also has a right-continuous version. One of the goals of the later developments will be to provide a right-continuous version for the quadratic variation process or, which is the same, to prove some martingale-type properties for the stochastic integral. So, to prove the inequality up to the end of the section we assume that there are processes [M ], [N ] and [M, N ] which are right-continuous, and that for any t they provide a version of the related quadratic variation. In this case [M ] (ω) , [N ] (ω) and Var ([M, N ] , ω) are increasing, right-continuous functions for every ω, hence they define a measure and for every ω the integrals in (2.15) are defined as Lebesgue–Stieltjes integrals. Proof. It is sufficient to prove the proposition for finite a and b. One can prove the case b = ∞ by the Monotone Convergence Theorem. Also by the Monotone Convergence Theorem one can assume that X any Y are bounded. We should b prove the inequality when on the left-hand side we have a XY d [M, N ] since to prove (2.15) one can replace Y by Y Y · sgn (XY )
dV . d [M, N ]
1. First assume that X = 1 and Y = 1. In this case, the inequality is ) ) b a.s. b b N ] ≤ [M ] [M, a a [N ]a .
(2.16)
Fix a u and a v. The proof of (2.16) is nearly the same as the proof of the classical Cauchy–Schwarz inequality. It is easy to see that for all rational numbers r a.s.
v a.s.
v
v
v
0 ≤ [M + rN ]u = [M, M ]u + 2r · [M, N ]u + r2 · [N, N ]u Ar2 + Br + C. Hence there is a measure-zero set Z such that on the complement of Z the inequality above is true for all rational, and therefore all real, r. Hence, as in a.s.
the proof of the Cauchy–Schwarz inequality B 2 − 4AC ≤ 0 so (2.16) holds with a = u and b = v. Unifying the measure-zero sets one can easily prove (2.16) for
136
STOCHASTIC INTEGRATION
every rational numbers u and v. By the assumption above the quadratic variation is right-continuous, so the relation (2.16) holds for every real a = u and b = v. 2. Let (tk ) be a partition of [a, b] and assume that X and Y are constant on every subinterval (tk−1 , tk ]. We are integrating by trajectory so b t XY d [M, N ] ≤ |X (tk ) Y (tk )| [M, N ]tk+1 ≤ k a k ) ) t t ≤ |X (tk ) Y (tk )| [M ]tk+1 [N ]tk+1 . k k k
Using the Cauchy–Schwarz inequality we can continue % b % 2 t t XY d [M, N ] ≤ |X (tk )| [M ]tk+1 Y 2 (tk ) [N ]tk+1 = k k a k k b b = X 2 d [M ] Y 2 d [N ]. a
a
3. Using standard measure theory one can easily prove31 that if µ is a finite, regular measure on the real line, and g is a bounded Borel measurable function, then there is a sequence of step functions sn
ci χ
(n)
(n)
ti , ti+1
i
that sn → g almost surely in µ. As µ is finite and g is bounded sn → g in L2 (µ). 4. We prove that Kunita–Watanabe inequality holds for every outcome where (2.16) holds for every real a and b. Fix the process Y and an outcome ω, and consider the set of processes X for which the inequality (2.16) holds for this ω. Let sn → X (ω) be a set of step functions. By (2.16) the measure generated by [M, N ] (ω) is absolutely continuous with respect to the measure generated by [M ] (ω). Hence sn → X (ω) almost surely in [M, N ] (ω). Therefore by the Dominated Convergence theorem, using that X and Y are bounded, a and b are finite and that the convergence holds almost everywhere in [M, N ] (ω) and in L2 ([M ] (ω)) b b b XY d [M, N ] ≤ X 2 d [M ] Y 2 d [N ] a a a 31 Use Lusin’s theorem [80], page 56, and the uniform continuity of continuous functions on compact sets.
ˆ THE ITO–STIELTJES INTEGRALS
137
for outcome ω. If X is product measurable then by Fubini’s theorem every trajectory of X is Borel measurable. Hence if X is product measurable then inequality (2.15) holds for almost all outcome ω. 5. Now we fix X and repeat the argument for Y . Corollary 2.35 If q, p ≥ 1 and 1/p + 1/q then E 0
∞
∞ |XY | d [M, N ] ≤ X 2 d [M ] 0
p
- ∞ Y 2 d [N ] . 0 q
Proof. By H¨ older’s inequality and by (2.15) E
∞
-
|XY | d [M, N ] ≤
-
∞
X 2 d [M ]
E
0
0
Y 2 d [N ]
≤
0
- ∞ X 2 d [M ] 0
≤
∞
p
- ∞ Y 2 d [N ] . 0 q
Corollary 2.36 If M and N are semimartingales then |[M, N ]| ≤
" [M ] [N ]
(2.17)
and 1/2
[M + N ]
1/2
≤ [M ]
1/2
+ [N ]
and [M + N ] ≤ 2 ([M ] + [N ]) . Proof. The first inequality is just the Kunita–Watanabe inequality when X = Y = 1. [M + N ] = [M ] + 2 [M, N ] + [N ] ≤ " ≤ [M ] + 2 [M ] [N ] + [N ] =
2 1/2 1/2 = [M ] + [N ]
138
STOCHASTIC INTEGRATION
from which the second inequality is obvious. In a similar way " [M + N ] ≤ [M ] + 2 [M ] [N ] + [N ] ≤ ≤ [M ] + ([M ] + [N ]) + [N ] = = 2 ([M ] + [N ]) .
2.2
The Quadratic Variation of Continuous Local Martingales
The following proposition is the starting point in our construction of the stochastic integral process. Proposition 2.37 (Simple Doob–Meyer decomposition) If M is a uniformly bounded, continuous martingale, then: 1. 2. 3. 4.
t
The quadratic variation P (t) [M ] (t) [M ]0 exists. [M ] has a version which is increasing and continuous. For this version M 2 − [M ] is a martingale. [M ] is indistinguishable from any increasing, continuous process P for which P (0) = 0 and M 2 − P is a martingale. (n)
If (tk ) is an infinitesimal sequence of partitions of [0, t] then p
sup |Qn (s) − [M ] (s)| → 0
(2.18)
s≤t
for any t, where Qn (s)
2 (n) (n) . M tk ∧ s − M tk−1 ∧ s
k
Proof. By the Integration By Parts Formula for any t M 2 (t) − M 2 (0) = 2
t
M dM + [M ] (t) = 2 · (M • M ) (t) + [M ] (t) . 0
As M is continuous and uniformly bounded the integral process M • M has a version which is a continuous martingale32 , therefore as M 2 is continuous [M ] M 2 − M 2 (0) − 2 · M • M is continuous, and by Proposition 2.24 M 2 − [M ] = M 2 (0) + 2 · (M • M ) 32 See:
Proposition 2.24, page 128.
THE QUADRATIC VARIATION OF CONTINUOUS LOCAL MARTINGALES
139
t
is a martingale. [M ] (t) is a version of the quadratic variation [M ]0 for any t. p a.s. [M ]0 ≤
q
[M ]0 . Taking the union the For any rational numbers p ≤ q we have measure-zero sets and using the continuity of [M ] we can construct a version which is increasing. If P is another continuous, increasing process for which P (0) = 0 and M 2 − P is a martingale, then N P − [M ] is also a continuous martingale and N (0) = 0. As N is the difference of two increasing processes the trajectories of N have finite variation. By Fisk’s theorem33 N = 0, so P is indistinguishable from [M ]. The convergence (2.18) is a simple consequence of (2.11). First we extend the proposition to continuous local martingales. In order to do it we need the following rule: Proposition 2.38 Under the assumptions of the previous proposition if τ is an τ arbitrary stopping time then [M τ ] = [M ] . τ
2 Proof. As (M τ ) = M 2 τ
τ 2 τ τ (M τ ) − [M ] = M 2 − [M ] = M 2 − [M ] .
τ Stopped martingales are martingales hence M 2 − [M ] is a martinτ gale. [M ] is increasing, so by the uniqueness of the quadratic variation τ [M τ ] = [M ] . Proposition 2.39 If M is a continuous local martingale then there is one and only one continuous, increasing process [M ] such that: 1. [M ] (0) = 0 and 2. M 2 − [M ] is a continuous local martingale.
(n) For any t if tk is an infinitesimal sequence of partitions of [0, t] then p
sup |Qn (s) − [M ] (s)| → 0
(2.19)
s≤t
where Qn (s)
2 (n) (n) . M tk ∧ s − M tk−1 ∧ s
k
Proof. Let M be a continuous local martingale and let (σ n ) be a localizing sequence of M . As M is continuous the hitting times υ n inf {t : |M (t)| ≥ n} 33 See:
Theorem 2.11, page 117.
140
STOCHASTIC INTEGRATION
are stopping times. Stopped martingales are martingales, so if instead of σ n we take the localizing sequence τ n σ n ∧ υ n then the processes Mn M τ n are bounded martingales. 1. As Mn is a bounded, continuous martingale [Mn ] is an increasing processes and Mn2 − [Mn ] is a continuous martingale. By the previous proposition τn
[Mn+1 ]
& τn ' = [Mn ] , = Mn+1
hence [Mn ] = [Mn+1 ] on the interval [0, τ n ]. As τ n ∞ one can define the process [M ] as the ‘union’ of the processes [Mn ], that is [M ] (t, ω) [Mn ] (t, ω) ,
t ≤ τ n (ω) .
Evidently [M ] is continuous, increasing and [M ] (0) = 0. Of course
τ n 2 τ M 2 − [M ] = (M τ n ) − [M ] n Mn2 − [Mn ] ,
which is a martingale, hence M 2 − [M ] is a local martingale. 2. Assume that A (0) = 0 and M 2 − A is a continuous local martingale for some continuous, increasing process A.
Z M 2 − [M ] − M 2 − A = A − [M ] is a continuous local martingale and Z, as the difference of two increasing processes, has finite variation. So by Fisk’s theorem Z is constant. As Z(0) = A (0) − [M ] (0) = 0, obviously Z ≡ 0. (n)
3. Finally, let us prove (2.19). Fix ε, δ, t > 0 and (tk )k . Let Qn be (m) the approximating sum for [M ] and let Qn be the approximating sum for [Mm ]. A sup |Qn (s) − [M ] (s)| > ε , s≤t
(m)
A
(m) sup Qn (s) − [Mm ] (s) > ε . s≤t
As τ m ∞, for m large enough P (τ m ≤ t) ≤ δ/2 and P A(m) ≤ δ/2. Obviously P (A) = P (A ∩ (τ m ≤ t)) + P (A ∩ (τ m > t)) ≤ ≤ P ((τ m ≤ t)) + P (A ∩ (τ m > t)) ≤
THE QUADRATIC VARIATION OF CONTINUOUS LOCAL MARTINGALES
141
δ + P (A ∩ (τ m > t)) = 2
δ
δ δ δ = + P A(m) ∩ (τ m > t) ≤ + P A(m) ≤ + , 2 2 2 2 ≤
hence (2.19) holds. Proposition 2.40 If M and N are continuous local martingales then [M, N ] is the only continuous process with finite variation on finite intervals for which: 1. [M, N ] (0) = 0 and 2. M N − [M, N ] is a continuous local martingale. (n)
For any infinitesimal sequence of partitions (tk ) of [0, t] p
sup |Qn (s) − [M, N ] (s)| → 0 s≤t
where Qn (s)
(M (tk ∧ s) − M (tk−1 ∧ s)) (N (tk ∧ s) − N (tk−1 ∧ s)) .
(2.20)
k
Proof. From Fisk’s theorem the uniqueness of [M, N ] is again trivial, as M N −A and M N − B are continuous local martingales for some A and B, then A − B is a continuous local martingale with finite variation, so A − B is a constant. As A (0) = B (0) = 0 obviously A = B. MN =
1 2 2 (M + N ) − (M − N ) , 4
so it is easy to see that Proposition 2.39 can be applied to [M, N ]
1 ([M + N ] − [M − N ]) 4
(2.21)
in order to show that M N − [M, N ] is a continuous local martingale and that (2.21) holds. Definition 2.41 If for some process X there is a process P such that X − P is a local martingale, then we say that P is a compensator of X. If P is continuous then we say that P is a continuous compensator of X. If P is predictable then we say that P is a predictable compensator of X etc. So far we have proved that if M is a continuous local martingale then [M ] is the only increasing, continuous compensator of M 2 . It is important to emphasize that this property of [M ] holds only for continuous local martingales.
142
STOCHASTIC INTEGRATION
Example 2.42 Quadratic variation of the compensated Poisson processes.
Let π be a Poisson process with parameter λ. The increments of π are independent and the expected value of π (t) is λt, hence the compensated process ν (t) π (t) − λt is a martingale. We show that ν 2 (t) − λt is also a martingale, that is: λt is a continuous, increasing compensator for ν 2 .
2 E ν 2 (t) − λt | Fs = ν (s) + 2ν (s) E (ν (t) − ν (s) | Fs ) +
2 + E (ν (t) − ν (s)) | Fs − λt. The increments of π are independent, hence the conditional expectation is a real expectation. Given that the increments are stationary 2ν (s) E (ν (t) − ν (s) | Fs ) = 2ν (s) E (ν (t − s)) = 0
2 2 E (ν (t) − ν (s)) | Fs = E (ν (t − s)) = λ (t − s) , hence
E ν 2 (t) − λt | Fs = ν 2 (s) + λ (t − s) − λt = = ν 2 (s) − λs. (ν)
If we partition the interval [0, t] then if Qn is the sequence of the approximating (π) sum for [ν] and Qn is for [π] , then (π) Q(ν) n = Qn − 2λ
+ λ2
(n)
(n) (n) (n) π tk − π tk−1 tk − tk−1 + k (n)
(n)
tk − tk−1
2 .
k
(n) (n) (π) It is easy to see that if maxk tk − tk−1 → 0 then the limit of Qn is the process π. The limits of the other expressions are zero. Hence [ν] = π. Proposition 2.43 If M, N and U are continuous local martingales; ξ and η are F0 -measurable random variables then [ξM + ηN, U ] = ξ [M, U ] + η [N, U ] . Proof. M U − [M, U ] and N U − [N, U ] are local martingales hence (M + N ) U − ([M, U ] + [N, U ]) is also a local martingale, and by the uniqueness property of
THE QUADRATIC VARIATION OF CONTINUOUS LOCAL MARTINGALES
143
the quadratic co-variation [M + N, U ] = [M, U ] + [N, U ] . In a similar way: M U − [M, U ] is a local martingale, ξ is F0 -measurable, hence ξ (M U − [M, U ]) is also a local martingale, hence again by the uniqueness property of the quadratic co-variation [ξM, N ] = ξ [M, N ]. Proposition 2.44 If M and N are continuous local martingales then [M, N ] = [M − M (0) , N − N (0)] = [M − M (0) , N ] . Proof. Obviously [M − M (0) , N ] = [M, N ] − [M (0) , N ]. As M (0) is F0 measurable M (0) N is a continuous local martingale. Hence [M (0) , N ] = 0. Proposition 2.45 (Stopping rule for quadratic variation) Let τ be an arbitrary stopping time. τ
1. If M is a continuous local martingale then [M τ ] = [M ] . τ 2. If M and N are continuous local martingales then [M τ , N τ ] = [M, N ] = τ [M , N ]. Proof. [M τ ] is the only continuous, increasing process A for which A (0) = 0 2 and (M τ ) − A is a continuous local martingale. M 2 − [M ] is a continuous local martingale, hence
τ τ τ 2 τ M 2 − [M ] = M 2 − [M ] = (M τ ) − [M ] τ
is a continuous local martingale, hence by the uniqueness [M ] = [M τ ]. From (2.21) and from the first part of the proof [M τ , N τ ] =
1 τ τ ([(M + N ) ] − [(M − N ) ]) = 4 1 τ τ τ ([M + N ] − [M − N ] ) = [M, N ] . 4
If U and V are martingales and τ is a stopping time, then for any bounded stopping time σ by the Optional Sampling Theorem E ((U τ · (V − V τ )) (σ)) = E (U (τ ∧ σ) · E (V (σ) − V (τ ∧ σ) | Fτ ∧σ )) = = E (U (τ ∧ σ) · 0) = 0,
144
STOCHASTIC INTEGRATION
hence U τ (V − V τ ) is a martingale. From this it is easy to prove with localization that M τ (N − N τ ) is a local martingale, hence τ
τ
M τ N − [M, N ] = M τ N − M τ N τ + M τ N τ − [M, N ] = τ
τ
= M τ (N − N τ ) + ((M N ) − [M, N ] ) is also a local martingale. From the uniqueness of the quadratic co-variation τ
[M τ , N ] = [M, N ] = [M τ , N τ ] .
Example 2.46 If M and N are independent and they are continuous local martingales with respect to their own filtration then [M, N ] = 0.
Let F M and F N be the filtrations generated by M and N . Let Fs be the σ-algebra generated by the sets A ∩ B,
A ∈ FsM , B ∈ FsN .
We shall prove that if M and N are independent martingales then M N is a martingale under the filtration F. As M and N are martingales, M (t) and N (t) are integrable. M (t) and N (t) are independent for any t. Hence the product M (t) N (t) is also integrable. If F A ∩ B, A ∈ FsM and B ∈ FsN then E (M N (t) χF ) = E (M (t) χA N (t) χB ) = E (M (t) χA ) E (N (t) χB ) = = E (M (s) χA ) E (N (s) χB ) = E (M N (s) χF ) , which by the uniqueness of the extension of finite measures can be extended for every F ∈ Fs . Hence M N is an F-martingale so [M, N ] = 0. The quadratic co-variation is independent of the filtration34 so [M, N ] = 0 under the original filtration. If M and N are local martingales with respect to their own filtration, then the localized processes are independent martingales. Hence if τ (τ n ) is a common localizing sequence then [M, N ] n = [M τ n , N τ n ] = 0. Hence [M, N ] = 0. Proposition 2.47 Let M be a continuous local martingale. M is indistinguishable from a constant if and only if the quadratic variation [M ] is zero. 34 Here we directly used the definition of the quadratic variation as the limit of the approximating sums.
THE QUADRATIC VARIATION OF CONTINUOUS LOCAL MARTINGALES
145
Proof. If M is a constant then M 2 is also a constant, hence M 2 is a local martingale35 so [M ] = 0. On the other hand if [M ] = 0 then M 2 − [M ] = M 2 is a local martingale. The proposition follows from the next proposition. Proposition 2.48 M and M 2 are continuous local martingales, if and only if M is a constant. Proof. If M is constant then M and M 2 are local martingales. On the other hand 2
(M − M (0)) = M 2 − 2 · M · M (0) + M 2 (0) . Since M and M 2 are local martingales and M (0) is F0 -measurable, 2 (M − M (0)) is also a local martingale. Let (τ n ) be a localizing sequence for 2 (M − M (0)) . By the martingale property
2 2 E (M τ n (t) − M τ n (0)) = E (M τ n (0) − M τ n (0)) = 0, hence for any t a.s.
M (t ∧ τ n ) = M (0) . Therefore for any t a.s.
M (t) = lim M (t ∧ τ n ) = M (0) . n→∞
The local martingales are right-regular therefore M is indistinguishable from M (0). Corollary 2.49 Let a ≤ b < ∞. A continuous local martingale M is constant on [a, b] if and only if [M ] is constant on [a, b]. Proof. If τ n ∞ then a process X is constant on an interval [a, b] if and only τ if X τ n is constant on [a, b] for all n. Using this fact and that [M τ n ] = [M ] n one can assume that M is a martingale. 1. Define the stochastic process N (t) M (t + a) − M (a) . N is trivially a martingale for the filtration Gt Ft+a , t ≥ 0. N 2 (t) − ([M ] (t + a) − [M ] (a)) = M 2 (t + a) − ([M ] (t + a) − [M ] (a)) − − 2M (t + a) M (a) + M 2 (a) . 35 See:
Definition 1.131, page 94.
146
STOCHASTIC INTEGRATION
Obviously M 2 (t + a) − ([M ] (t + a) − [M ] (a)) is a G-martingale. M (t + a) is also a G-martingale hence M (t + a) M (a) + M 2 (a) is obviously a G-local martingale, hence by the uniqueness of the quadratic variation [N ] (t) = [M ] (t + a) − [M ] (a) . 2. M is constant on the interval [a, b] if and only if N is zero on the interval [0, b − a]. As we proved N is constant on [0, b − a] if and only if [N ] = 0 on [0, b − a]. Hence M is constant on [a, b] if and only if [M ] is constant on [a, b]. We summarize the statements above in the following proposition: Proposition 2.50 [M, N ] is a symmetric bilinear form and [M ] ≥ 0. [M ] = 0 if and only if M is constant. This is also true on any half-line [a, ∞) if instead of [M, N ] we use the increments [M, N ] − [M, N ] (a).
2.3
Integration when Integrators are Continuous Semimartingales
In this section we introduce a simple construction of the stochastic integral when the integrator X is a continuous semimartingale and the integrand Y is progressively measurable36 . Every continuous semimartingale has a unique decomposition of type X = X (0) + L + V , where V is continuous and has finite variation and L is a continuous local martingale. The integration with respect to V is a simple measure theoretic exercise: V (ω) generates a σ-finite measure on R+ for every ω. Every progressively measurable process is product measurable, hence all trajectories Y (ω) are measurable. For every ω and for every t one can define the pathwise integral (Y • V ) (t, ω)
t
Y (s, ω) V (ds, ω) , 0
where the integrals are simple Lebesgue integrals37 The main problem is how to define the stochastic integral with respect to the local martingale part L! 36 See: 37 See:
[78] Proposition 1.20, page 11.
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
2.3.1
147
The space of square-integrable continuous local martingales
Recall the definition and some elementary properties of square-integrable martingales: Definition 2.51 As before H2 is the space of L2 (Ω) bounded martingales38 on R+ . Let G 2 Hc2 denote the space of L2 (Ω)-bounded, continuous martingales. . / H02 M ∈ H2 : M (0) = 0 ,
. / G02 M ∈ G 2 : M (0) = 0 .
The elements of H2 , G 2 , H02 and G02 are equivalence classes: M1 and M2 are in the same equivalence class if they are indistinguishable. Proposition 2.52 M ∈ H2 if and only if sup M 2 (t) ∈ L1 (Ω). t
H2 , ·H2 is a Hilbert space where M H2 M (∞)2 = lim M (t)2 . t→∞
the set of continuous square-integrable martingales G 2 is a closed subspace of H2 . Proof. The first statement follows from Doob’s inequality39 . The relation M (∞)2 = lim M (t)2 t→∞
is obviously true as M (t) converges40 to M (∞) in L2 (Ω), and the norm is a continuous function. In order to show that G 2 is closed, let (Mn ) be a sequence of H2
continuous square-integrable martingales and assume that Mn → M . By Doob’s inequality41 E
2 2 sup |Mn (t) − M (t)| ≤ 4 Mn (∞) − M (∞)2 t
2
4 Mn − M H2 → 0. 38 That is if M is a martingale then M ∈ H2 , that is M is square-integrable, if and only if supt M (t) 2 < ∞. 39 See: Corollary 1.54, page 34. 40 See: Corollary 1.59, page 35. 41 See: (1.18) line, page 34.
148
STOCHASTIC INTEGRATION
From the L2 -convergence one has a subsequence for which a.s.
sup |Mnk (t) − M (t)| → 0, t
hence Mnk (t, ω) → M (t, ω) uniformly in t for almost all ω. Hence M (t, ω) is continuous in t for almost all ω. So the trajectories of M are almost surely continuous, therefore G 2 is closed. Our direct goal is to prove that if M is a square-integrable martingale and M (0) = 0 then
2 2 M H2 M (∞)2 = E M 2 (∞) = E ([M ] (∞)) . To do this one should prove that M 2 − [M ] is not only a local martingale but it is a uniformly integrable martingale. Proposition 2.53 (Characterization of square-integrable martingales) Let M be a continuous local martingale. The following statements are equivalent: 1. M is square integrable, 2. M (0) ∈ L2 (Ω) and E ([M ] (∞)) < ∞. In both cases M 2 − [M ] is a uniformly integrable martingale. Proof. The proof of the equivalence of the statements is the following: 1. Let (τ n ) be a localizing sequence of the local martingale M 2 − [M ] and let 2 σ n τ n ∧ n. By the martingale property of (M τ n ) − [M τ n ]
E M 2 (σ n ) − [M ] (σ n ) = E M 2 (0) .
(2.22)
As M is square-integrable M 2 (σ n ) ≤ sup M 2 (t) ∈ L1 (Ω) , t
so by the Dominated Convergence Theorem
lim E M 2 (σ n ) = E lim M 2 (σ n ) = E M 2 (∞) < ∞.
n→∞
n→∞
[M ] is increasing therefore by the Monotone Convergence Theorem and by (2.22)
E ([M ] (∞)) = lim E ([M ] (σ n )) = lim (E M 2 (σ n ) − E M 2 (0) < ∞, n→∞
n→∞
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
149
that is [M ] (∞) ∈ L1 (Ω) and 1. implies 2. For every stopping time τ 2 M − [M ] (τ ) ≤ sup M 2 (t) + sup [M ] (t) = t
t
= sup M (t) + [M ] (∞) ∈ L1 (Ω) , 2
t
.
/
hence the set M 2 (τ ) − [M ] (τ ) τ is dominated by an integrable variable and therefore it is uniformly integrable. By this M 2 −[M ] is a class D local martingale hence it is a uniformly integrable martingale42 . 2. Let τ be an arbitrary stopping time. Let (σ n ) be a localizing sequence of M . One can assume that M σn − M (0) is bounded43 . Let N M τ ∧σn − M (0). By the definition of the quadratic variation N 2 (t) = 2
t
N− dN + [N ] (t) . 0
o–Stieltjes integral defines a martingale44 . So As N− is bounded the Itˆ
E N 2 (t) = E ([N ] (t)) = E ([M τ ∧σn ] (t)) ≤ E ([M ] (∞)) . Applying Fatou’s lemma
2 E (M − M (0)) (τ ) ≤ E ([M ] (∞)) .
(2.23)
By the second assumption of 2. the expected value on the right-hand side is finite so the set of variables S of type (M − M (0)) (τ ) is bounded in L2 (Ω). Hence S is a uniformly integrable set and therefore M − M (0) is a class D local martingale and hence it is a martingale45 . By (2.23) M − M (0) is trivially bounded in L2 (Ω), that is M − M (0) ∈ G 2 . As M (0) ∈ L2 (Ω) by the first assumption of 2. obviously M ∈ G 2 . Corollary 2.54 If M ∈ G 2 and σ ≤ τ are stopping times then
E M 2 (τ ) − M 2 (σ) | Fσ = E ([M ] (τ ) − [M ] (σ) | Fσ ) =
2 = E (M (τ ) − M (σ)) | Fσ , specifically
E M 2 (τ ) − E M 2 (0) = E ([M ] (τ )) . 42 See:
(2.24)
Proposition 1.144, page 102. σn the general case when M is not necessarily continuous one can assume that M− −M (0) is bounded. 44 See: Proposition 2.24, page 128. 45 See: Proposition 1.144, page 102. 43 In
150
STOCHASTIC INTEGRATION
Proof. By the previous proposition M 2 − [M ] is a uniformly integrable martingale, hence if σ ≤ τ then by the Optional Sampling Theorem
E M 2 (τ ) − [M ] (τ ) | Fσ = M 2 (σ) − [M ] (σ) from which the first equation follows. M is also uniformly integrable hence again by the Optional Sampling Theorem M (σ) = E (M (τ ) | Fσ ) .
2 E (M (τ ) − M (σ)) | Fσ =
= E M 2 (τ ) + M 2 (σ) − 2M (σ) M (τ ) | Fσ =
2 = E M 2 (τ ) + M 2 (σ) − 2M (σ) | Fσ =
= E M 2 (τ ) − M 2 (σ) | Fσ . Let M be a semimartingale. Let us define ∞ χC d [M ] αM (C) E 0
where the integral with respect [M ] is the pathwise Lebesgue–Stieltjes integral generated by the increasing, right-regular46 process [M ]. It is not entirely trivial that αM is well-defined, that is the expression under the expected value is measurable. By the Monotone Convergence Theorem ∞ n χC d [M ] = E lim χC d [M ] . E n→∞
0
0
n
As 0 χC d [M ] is measurable47 for every n the parametric integral under the expected value is measurable. Obviously αM is a measure on B (R+ ) × A. Example 2.55 If M ∈ G 2 and τ is a stopping time then αM ([0, τ ]) = E M 2 (τ ) − E M 2 (0) . If M ∈ G02 then E (M 2 (∞)) = E ([M ] (∞))
[M ] (∞) = αM (R+ × Ω).
M H2
2
46 Of
course tacitly we again assume that [M ] has a right-regular version. Proposition 1.20, page 11.
47 See:
(2.25)
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
151
If τ is an arbitrary random time then ∞ αM ([0, τ ]) E χ ([0, τ ]) d [M ] = E ([M ] (τ ) − [M ] (0)) = 0
= E ([M ] (τ )) . By (2.24) for every stopping time
E ([M ] (τ )) = E M 2 (τ ) − E M 2 (0) , hence αM ([0, τ ]) = E ([M ] (τ )) − E ([M ] (0)) = E ([M ] (τ )) =
= E M 2 (τ ) − E M 2 (0) . If M ∈ G02 then M (0) 0 hence by (2.24)
E M 2 (∞) = E M 2 (∞) − E M 2 (0) = E ([M ] (∞)) . The other relations are consequences of the definitions. Definition 2.56 αM is called the Dol´eans measure48 generated by the quadratic variation of M . 2.3.2
Integration with respect to continuous local martingales
Let us start with the simplest case: Definition 2.57 Let M be a continuous local martingale. Let L2 (M ) denote the space of equivalence classes of square-integrable and progressively measurable functions on the measure space (R+ × Ω, R, αM ) that is let L2 (M ) L2 (R+ × Ω, R, αM ) where R , as before, denote the σ-algebra of progressively measurable sets. Let ·M denote the norm of the Hilbert space L2 (M ): - XM
X 2 dα R+ ×Ω
Example 2.58 The space L2 (w). 48 See:
Definition 5.4, page 295.
M
- E 0
∞
X 2 d [M ]
.
152
STOCHASTIC INTEGRATION
The quadratic variation of a Wiener process on an interval [0, s] is s. Hence t 2 Xw = E 0 X 2 (s) ds on the interval [0, t]. If t < ∞ then w ∈ L2 (w) , since by Fubini’s theorem 2 ww
t
E
2
w (s) ds
t
=
0
E w (s) ds =
0
t
sds < ∞.
2
0
The main result of this section is the following: Proposition 2.59 (Stochastic integration and quadratic variation) If M is a continuous local martingale and X ∈ L2 (M ) then there is a unique process in G02 denoted by X • M such that for every N ∈ G 2 [X • M, N ] = X • [M, N ] . If we denote X • M by
t 0
(2.26)
XdM then (2.26) can be written as
t
XdM, N = 0
t
Xd [M, N ] . 0
Proof. We divide the proof into several steps. We prove that X • M exists, and the definition of X • M is correct—that is, the process X • M is unique. 1. The proof of uniqueness is easy. If I1 and I2 are two processes in G02 satisfying (2.26) then [I1 , N ] = [I2 , N ] for all N ∈ G02 . Hence [I1 − I2 , N ] = 0 for all N ∈ G02 . As I1 − I2 ∈ G02 [I1 − I2 , I1 − I2 ] [I1 − I2 ] = 0, hence I1 − I2 is constant49 . As I1 − I2 ∈ G02 , I1 − I2 = 0, so I1 = I2 . 2. Now we prove the existence of X • M . Assume first that N ∈ G02 . By the Kunita–Watanabe inequality50 and by the formula (2.25) E
0
∞
- - ∞ ∞ Xd [M, N ] ≤ X 2 d [M ] d [N ] 0 0 2 2 - ∞
XM = XM 49 See: 50 See:
Proposition 2.47, page 144. Corollary 2.35, page 137.
E "
d [N ]
=
0
E ([N ] (∞)) = XM N H2 .
(2.27)
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
153
∞ Observe that XM N H2 < ∞, hence 0 Xd [M, N ] is almost surely finite. So the right-hand side of (2.26) is well-defined. By the bilinearity of the quadratic co-variation N → E
∞
Xd [M, N ]
0
is a continuous linear functional on the Hilbert space G02 . As every continuous linear functional on a Hilbert space has a scalar product representation there is an X • M ∈ G02 such that for every N ∈ G02 E
∞
Xd [M, N ] = (X • M, N ) E ((X • M ) (∞) N (∞)) .
(2.28)
0
3. The main part of the proof is to show that for X • M the identity (2.26) holds. Define the process S (X • M ) N − X • [M, N ] . To prove (2.26) we show that S is a continuous martingale, hence by the uniqueness of the quadratic co-variation [X • M, N ] = X • [M, N ]! First observe that S is adapted: (X • M ) N is a product of two martingales, that is the product of two adapted processes. t X is progressively measurable, by the definition of L2 (M ), so the integral 0 Xd [M, N ] is also adapted51 . S is continuous as by the construction (X • M ) N is a product of two continuous functions so it is continuous, and since M and N are continuous t the quadratic variation [M, N ] is also continuous. Therefore the integral 0 Xd [M, N ] as a function of t is continuous. Finally to show that S is a martingale one should prove that52 E (S (τ )) = E (S (0)) = 0
(2.29)
for every bounded stopping time τ . By definition X • M is a uniformly integrable martingale. Therefore by the Optional Sampling Theorem (X • M ) (τ ) = E ((X • M ) (∞) | Fτ ) . 51 See: 52 See:
Proposition 1.20, page 11. Proposition 1.91, page 57.
154
STOCHASTIC INTEGRATION
Using that N τ ∈ G02 and (2.28) E (S (τ )) E (X • M ) (τ ) N (τ ) −
τ
0
X [M, N ] =
τ
= E ((X • M ) (τ ) N (τ )) − E
X [M, N ] =
0
= E (E ((X • M ) (∞) | Fτ ) N (τ )) − E = E (E ((X • M ) (∞) N (τ ) | Fτ )) − E = E (X • M (∞) N (τ )) − E
= E (X • M (∞) N (τ )) −
0 ∞
τ
X [M, N ] 0
∞
∞
=
X [M, N ] = τ
0
∞
X [M, N ] = τ
X [M, N τ ] = 0.
0
Therefore (2.29) holds. 4. Finally if N ∈ G 2 then N − N (0) ∈ G02 , hence [X • M, N ] = [X • M, N − N (0)] = = X • [M, N − N (0)] = X • [M, N ] .
Proposition 2.60 (Stopping rule for stochastic integrals) If M is an arbitrary continuous local martingale, X ∈ L2 (M ) and τ is an arbitrary stopping time then τ
X • M τ = (χ ([0, τ ]) X) • M = (X • M ) = X τ • M τ .
(2.30)
Proof. By (2.26) and by the stopping rule for the quadratic variation, if N ∈ G 2 τ
τ
τ
τ
[(X • M ) , N ] = [(X • M ) , N ] = (X • [M, N ]) = X • [M, N ] = = X • [M τ , N ] = [X • M τ , N ] . By the bilinearity of the quadratic variation τ
[(X • M ) − X • M τ , N ] = 0, N ∈ G 2 , τ
from which [(X • M ) − X • M τ ] = 0 that is τ
(X • M ) = X • M τ .
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
155
If X ∈ L2 (M ) then trivially χ ([0, τ ]) X ∈ L2 (M ). For every N ∈ G 2 τ
[X • M τ , N ] = X • [M τ , N ] = X • [M, N ] = = (χ ([0, τ ]) X) • [M, N ] = = [(χ ([0, τ ]) X) • M, N ] , hence again X • M τ = (χ ([0, τ ]) X) • M. Using stopping rule (2.30) we can extend the stochastic integral to the space L2loc (M ). Definition 2.61 Let M be a continuous local martingale. The space L2loc (M ) is the set of progressively measurable processes X for which there is a localizing sequence of stopping times (τ n ) such that
∞
E 0 τn
=E
X 2 d [M τ n ] = E
X d [M ] = E
0
2
∞
τn
X 2 d [M ]
=
0
∞
χ ([0, τ n ]) X d [M ] 2
0
χ ([0, τ n ]) X 2 dαM < ∞. (0,∞)×Ω
Example 2.62 If M is a continuous local martingale and X is locally bounded then X ∈ L2loc (M ).
One can assume that X(0) = 0 as obviously every F0 -measurable constant pro2 . Let (τ n ) be a common localizing cess is in L2loc . As M is continuous M ∈ Hloc τn 2 53 τn sequence of X and M . M ∈ H so [M ] (∞) ∈ L1 (Ω). Therefore E
∞
2
X d [M
τn
] ≤ sup X 2 (t) E ([M τ n ] (∞)) < ∞. t≤τ n
0
Proposition 2.63 If M is a continuous local martingale then for every X ∈ L2loc (M ) there is a process denoted by X • M such that 1. (X • M ) (0) = 0 and X • M is a continuous local martingale, 2. for every continuous local martingale N [X • M, N ] = X • [M, N ] . 53 See:
Proposition 2.53, page 148.
(2.31)
156
STOCHASTIC INTEGRATION
X • M is unambiguously defined by (2.31), that is X • M is the only continuous local martingale for which for every continuous local martingale N (2.31) holds. Proof. M is a continuous local martingale so it is locally bounded hence M ∈ 2 . Assume that L2loc (M Hloc ) and let (τ n ) be such a localizing sequence of
∞X ∈ 2 X for which E 0 X d [M τ n ] < ∞ that is let X ∈ L2 (M τ n ). Consider the integrals In X • M τ n . τn
τn In+1 (X • M τ n+1 )
τn
= X • (M τ n+1 )
= X • M τ n = In ,
hence In+1 and In are equal on [0, τ n ]. One can define the integral process X • M unambiguously if for all n the value of X • M is by definition is In on the interval [0, τ n ]. By the stopping rule for stochastic integrals it is obvious from the construction that X • M is independent of the localizing sequence (τ n ). Obviously (X • M ) (0) = 0 and X • M is continuous. Trivially (X • M )
τn
τn
(X • M τ n )
= X • M τn
τ
and X • M τ n ∈ G02 , hence (X • M ) n is a uniformly integrable martingale so X •M is a local martingale. We should prove (2.31). Let (τ n ) be such a localizing sequence that X ∈ L2 (M τ n ) and N τ n ∈ G 2 . As X ∈ L2 (M τ n ) and N τ n ∈ G 2 by the stopping rule for the quadratic variation54 τn
[X • M, N ]
= [(X • M )
τn
, N τn]
[X • M τ n , N τ n ] = X • [M τ n , N τ n ] = τn
= X • [M, N ]
τn
= (X • [M, N ])
,
hence (2.31) is valid. Let us prove some elementary properties of the stochastic integral. The most important properties are simple consequences of (2.31), the basic properties of the quadratic variation and the analogous properties of the pathwise integration. Proposition 2.64 (Itˆ o’s isometry) If M is a continuous local martingale then the mapping X → X • M is an L2 (M ) → G02 isometry. That is if X ∈ L2 (M ) then
2 2 E (X • M ) (∞) X • M H2 = XM E
2
0
54 See:
Proposition 2.45, page 143.
∞
X d [M ] . 2
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
157
Proof. Using the definition of the norm in H2 and (2.25), by (2.31)
2 2 X • M H2 E (X • M ) (∞) = E ([X • M ] (∞)) E ([X • M, X • M ] (∞)) = ∞ =E Xd [X • M, M ] = E 0
∞
Xd (X • [M ]) .
0
In the right-hand side of the identity [X • M, M ] = X • [M, M ]. The integral is taken pathwise, hence ∞ 2 X • M H2 = E Xd (X • [M ]) = 0
∞
=E 0
2 X 2 d [M ] XM ,
and hence the mapping X → X • M is an isometry. 1
Example 2.65 The standard deviation of
0
√ wdw is 1/ 2.
The integral is meaningful and as on finite intervals w ∈ L2 (w) the integral 1 process w • w is a martingale. Hence the expected value of the integral 0 wdw is zero. By Itˆo’s isometry and by Fubini’s theorem 2 1 1 1
2 wdw w (s) ds = E w2 (s) ds = =E E 0
0
0
1
=
sds = 0
1 . 2
√ Hence the standard deviation is 1/ 2. We can calculate the standard deviation in the following way as well:
2
t
wdw
−
0
wdw 0
is a martingale, hence 2 1 E wdw =E 0
1
wdw
E
0
1
0
w2 d [w] = 0
1
wdw,
0
=E using (2.26) directly.
t
1
1
wdw 0
1 E w2 (s) ds = , 2
=
158
STOCHASTIC INTEGRATION
Proposition 2.66 If M is a continuous local martingale and X ∈ L2loc (M ) then [X • M ] = X 2 • [M ] .
(2.32)
Proof. By simple calculation using (2.31), and that on the right-hand side of (2.31), we have a pathwise integral [X • M ] [X • M, X • M ] = X • [M, X • M ] = = X • (X • [M, M ]) = X 2 • [M ] . Corollary 2.67 If M is a continuous local martingale and X is a progressively measurable process then X ∈ L2loc (M ) if and only if for all t almost surely
t
X 2 d [M ] X 2 • [M ] (t) < ∞.
(2.33)
0
Proof. The quadratic variation [X • M ], like every quadratic variation, is almost surely finite, hence if X ∈ L2loc (M ) then by (2.32), (2.33) holds. On the other hand, assume that (2.33) holds. For all n let us define the stopping times t τ n inf t : X 2 d [M ] ≥ n . 0
As [M ] is continuous, X 2 • [M ] is also continuous, hence
τn
X 2 d [M ] ≤ n,
0
that is X ∈ L2 (M τ n ) , hence X ∈ L2loc (M ) , so the space L2loc (M ) contains all the R-measurable processes, for which (2.33) holds for all t. Corollary 2.68 Assume that M is a local martingale and X ∈ L2loc (M ). If on an interval [a, b] 1. X (t, ω) = 0 for all ω or 2. M (t, ω) = M (a, ω) , then X • M is constant on [a, b]. Proof. The integral X 2 •[M, M ] is a pathwise integral, hence under the assumptions X 2 • [M, M ] is constant on [a, b]. As [X • M ] = X 2 • [M ] , the local martingale X • M is constant on55 [a, b]. 55 See:
Proposition 2.47, page 144.
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
159
Proposition 2.69 (Stopping rule for stochastic integrals) If M is a continuous local martingale, X ∈ L2loc (M ) and τ is an arbitrary stopping time then τ
(X • M ) = χ ([0, τ ]) X • M = X τ • M τ = X • M τ .
(2.34)
Proof. Let τ be an arbitrary stopping time. If X ∈ L2loc (M ) , then as |χ ([0, τ ]) X| ≤ |X| trivially χ ([0, τ ]) X ∈ L2loc (M ). Using the analogous properties of the L2 (M ) integrals τ τn
((X • M ) )
τ
τ
τ
= ((X • M ) n ) (X • M τ n ) = = χ ([0, τ ]) X • M τ n τn
(χ ([0, τ ]) X • M )
.
The proof of the other parts of (2.34) are analogous. Proposition 2.70 (Linearity) X • M is bilinear, that is if α1 and α2 are constants then X • (α1 M1 + α2 M2 ) = α1 (X • M1 ) + α2 (X • M2 ) and (α1 X1 + α2 X2 ) • M = α1 (X1 • M ) + α2 (X2 • M ) when all the expressions are meaningful. In these relations if two integrals are meaningful then the third one is meaningful. Proof. If X ∈ L2loc (M1 ) ∩ L2loc (M2 ) then for all t
t
X 2 d [M1 ] < ∞ 0
t
X 2 d [M2 ] < ∞.
and 0
Obviously, by the Kunita–Watanabe inequality56 [M1 + M2 ] ≤ 2 ([M1 ] + [M2 ]) hence
t
X d [M1 + M2 ] ≤ 2 2
0 56 See:
Corollary 2.36, page 137.
t 2
X d [M2 ] < ∞, 2
X d [M1 ] + 0
t
0
160
STOCHASTIC INTEGRATION
therefore X ∈ L2loc (M1 + M2 ). From the linearity of the pathwise integration and from the bilinearity of the quadratic variation [X • (α1 M1 + α2 M2 ) , N ] = X • [(α1 M1 + α2 M2 ) , N ] = = X • (α1 [M1 , N ] + α2 [M2 , N ]) = = α1 X • [M1 , N ] + α2 X • [M2 , N ] = = [α1 X • M1 + α2 X • M2 , N ] , from which the linearity of the integral in the integrand is evident. The linearity in the integrator is also evident as [(α1 X1 + α2 X2 ) • M, N ] = (α1 X1 + α2 X2 ) • [M, N ] = = α1 X1 • [M, N ] + α2 X2 • [M, N ] = = [α1 X1 • M, N ] + [α2 X2 • M, N ] = = [α1 X1 • M + α2 X2 • M, N ] . The remark about the integrability is evident from the trivial linearity of the space L2loc (M ). Proposition 2.71 (Associativity) If X ∈ L2 (M ) then Y ∈ L2 (X • M ) if and only if XY ∈ L2 (M ). If X ∈ L2loc (M ) then Y ∈ L2loc (X • M ) , if and only if XY ∈ L2loc (M ). In both cases (Y X) • M = Y • (X • M ) .
(2.35)
Proof. Using the construction of the stochastic integral and given that the associativity formula (2.35) is valid for pathwise integration [X • M ] = [X • M, X • M ] = X • [M, X • M ] = = X • (X • [M, M ]) = X 2 • [M, M ] . By the associativity of the pathwise integration for non-negative integrands E
∞
Y d [X • M ] = E 2
0
∞
=E
s
X d [M ] = 2
Y d
0
2
0
∞
Y 2 X 2 d [M ] ,
0
hence Y X ∈ L2 (M ) if and only if Y ∈ L2 (X • M ). If X ∈ L2 (M ) , then by the Kunita–Watanabe inequality for almost all ω the trajectory X (ω) is integrable
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
161
with respect to [M, N ] (ω). If XY ∈ L2 (M ) then using (2.26) again [(Y X) • M, N ] = (Y X) • [M, N ]
t
Y Xd [M, N ] = 0
t
s
Xd [M, N ] Y • (X • [M, N ]) ,
Yd 0
(2.36)
0
Using (2.26) and that Y ∈ L2 (X • M ) , Y • (X • [M, N ]) = Y • [X • M, N ] = [Y • (X • M ) , N ] . Comparing it with line (2.36), [(Y X) • M, N ] = [Y • (X • M ) , N ] . Hence by the uniqueness of the stochastic integral (Y X) • M = Y • (X • M ) . To prove the general case, observe that XY ∈ L2loc (M ) if and only if for some localizing sequence (τ n )
E χ ([0, τ n ]) X 2 Y 2 • [M ] < ∞. As
χ ([0, τ n ]) Y 2 • X 2 • [M ] = χ ([0, τ n ]) Y 2 X 2 • [M ] XY ∈ L2loc (M ) if and only if Y ∈ L2loc (X • M ). Let (τ n ) be a common localizing sequence for M and X • M . If Y ∈ L2loc (X • M ) then evidently τ
Y ∈ L2 ((X • M ) n ) = L2 ((X • M τ n )) . So τn
(Y • (X • M ))
τn
Y • (X • M )
= Y • (X • M τ n ) = τn
= (Y X • M τ n ) ((Y X • M )) from which the associativity is evident.
,
STOCHASTIC INTEGRATION
162 2.3.3
Integration with respect to semimartingales
We can extend again the definition of the stochastic integration to semimartingales: Definition 2.72 Let X = X (0) + L + V be a continuous semimartingale. If for some process Y the integrals Y • L and Y • V are meaningful then the stochastic integral Y • X of Y with respect to X by definition is the sum Y • X Y • L + Y • V. Remember that by Fisk’s theorem the decomposition X = X (0) + L + V is unique, hence the integral is well-defined. Proposition 2.73 The most important properties of the stochastic integral Y •X are the following: 1. Y • X is bilinear, that is Y • (α1 X1 + α2 X2 ) = α1 (Y • X1 ) + α2 (Y • X2 ) and (α1 Y1 + α2 Y2 ) • X = α1 (Y1 • X) + α2 (Y2 • X) assuming that all the expressions are meaningful. If two integrals are meaningful then the third is meaningful. 2. For all locally bounded processes Y, Z Z • (Y • X) = (ZY ) • X. 3. For every stopping time τ τ
(Y • X) = (Y χ ([0, τ ]) • X) = Y • X τ . 4. If the integrator X is a local martingale or if X has bounded variation on finite intervals then the same is true for the integral process Y • X. 5. Y • X is constant on any interval where either Y = 0, or X is constant. 6. [Y • X, Z] = Y • [X, Z] for any continuous semimartingale Z. 2.3.4
The Dominated Convergence Theorem for stochastic integrals
A crucial property of every integral is that under some conditions one can swap the order of taking limit and the integration: Proposition 2.74 (Dominated Convergence Theorem for stochastic integrals) Let X be a continuous semimartingale, and let (Yn ) be a sequence of
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
163
progressively measurable processes. Assume that (Yn (t, ω)) converges to Y∞ (t, ω) in every point (t, ω). If there is an integrable process Y such that57 |Yn | ≤ Y for all n, then Yn • X → Y∞ • X, where the convergence is uniform in probability on every compact interval, that is p
sup |(Yn • X) (s) − (Y∞ • X) (s)| → 0, s≤t
for all t ≥ 0.
Proof. One can prove the proposition separately when X has finite variation and when X is a local martingale. It is sufficient to prove the proposition when Y∞ ≡ 0. 1. First, assume that X has finite variation. In this case the integrability of Y means that for every t
t
|Y | dVar (X) < ∞. 0
As |Yn | ≤ Y , for every ω the trajectory Yn (ω) is also integrable on every interval [0, t]. Applying the classical Dominated Convergence Theorem for every trajectory individually, for all s ≤ t
0
s
t Yn dX ≤ |Yn | dVar (X) → 0. 0
Hence the integral, as a function of the upper bound uniformly converges to zero. Pointwise convergence on a finite measure space implies convergence in measure, so when the integrator has finite variation then the proposition holds. 2. Let X be a local martingale. Y is integrable with respect to X, hence by definition Y ∈ L2loc (X). Let ε, δ > 0 be arbitrary, and let (τ n ) be a localizing sequence of Y . To make the notation simpler, let us denote by σ a τ n for which σ P (τ n < t) ≤ δ/2. By the stopping rule (Yn • X) = Yn • X σ , that is if s ≤ σ (ω) then (Yn • X) (s, ω) = (Yn • X σ ) (s, ω) . If A
sup |Yn • X| (s) > ε , s≤t
Aσ
sup |Yn • X σ | (s) > ε , s≤t
57 The integrability of Y depends on the integrator X. If X is a local martingale, then by definition this means that Y ∈ L2loc (X).
164
STOCHASTIC INTEGRATION
then P (A) = P ((σ < t) ∩ A) + P ((σ ≥ t) ∩ A) ≤ ≤ P (σ < t) + P ((t ≤ σ) ∩ A) ≤
δ + P (Aσ ) . 2
Since Y ∈ L2 (X σ ), obviously Yn ∈ L2 (X σ ). Hence by the classical Dominated Convergence Theorem as Yn → 0 and |Yn | ≤ Y 2
Yn X σ E
∞
Yn2 d [X σ ] = E
0
∞
=E
χ ([0, σ]) Yn2 d [X]
∞
σ
Yn2 d [X]
=
0
→ 0,
0
that is Yn → 0 in L2 (X σ ). By Itˆ o’s isometry the correspondence Z → Z • X σ is H2
an L2 (X σ ) → H2 isometry58 . Hence Yn • X σ → 0. By Doob’s inequality59 E
2 sup |Yn • X | (s) σ
s≤∞
2 ≤ 4E ((Yn • X σ ) (∞)) 2
4 Yn • X σ H2 → 0. By Markov’s inequality, stochastic convergence follows from the L2 (Ω)convergence, hence P (Aσ ) P sup |Yn • X σ | (s) > ε → 0. s≤t
Hence for n large enough P (A) P sup |Yn • X| (s) > ε ≤ δ. s≤t
2.3.5
Stochastic integration and the Itˆ o–Stieltjes integral
As we mentioned, every integral is in some sense the limits of certain approximating sums. From the construction above it is not clear in which sense the integral X • M is a limit of the approximating sums. 58 See: 59 See:
Itˆ o’s isometry, Proposition 2.64, page 156. line (1.17) page 34. Proposition 2.52 page 147.
INTEGRATION WITH CONTINUOUS SEMIMARTINGALES
165
Lemma 2.75 If X is a continuous semimartingale and Y
η i · χ ((τ i , τ i+1 ])
i
is an integrable, non-negative predictable simple process60 then (Y • X) (t) =
η i · (X(τ i+1 ∧ t) − X(τ i ∧ t)) .
i
Proof. If σ ≤ τ are stopping times, then using the linearity and the stopping rule χ ((σ, τ ]) • X = (χ ([0, τ ]) − χ ([0, σ])) • X = τ
σ
= (1 • X) − (1 • X) = X τ − X σ . Hence the formula holds with η ≡ 1. It is easy to check that if F ∈ Fσ ⊆ Fτ then σ (ω) if ω ∈ F τ (ω) if ω ∈ F σ F (ω) , τ F (ω) ∞ if ω ∈ /F ∞ if ω ∈ /F are also stopping times, hence (χF χ ((σ, τ ])) • X = χ ((σ F , τ F ]) • X = X τ F − X σF = χF (X τ − X σ ) , hence the formula is valid if η = χF , F ∈ Fσ . If η is an Fσ -measurable step function, then since the integral is linear one can write η in the place of χF . It is easy to show that for any Fσ -measurable function η the process ηχ ((σ, τ ]) is integrable with respect to X, hence using the Dominated Convergence Theorem one can prove the formula when η is an arbitrary Fσ -measurable function. As Y ≥0 0 ≤ Yn
n
η i χ ((τ i , τ i+1 ]) ≤ Y.
i=1
The general case follows from the Dominated Convergence Theorem and from the linearity of the integral. Corollary 2.76 If X is a continuous semimartingale, τ n ∞ and Y i η i · χ ((τ i , τ i+1 ]) is a predictable simple process then
t
Y dX (Y • X) (t) = 0 60 See:
Definition 1.41, page 24.
i
η i · (X(τ i+1 ∧ t) − X(τ i ∧ t)) .
166
STOCHASTIC INTEGRATION
Proof. As τ n ∞, Y is left-continuous and has right-hand side limits. So Y is locally bounded on [0, ∞) and therefore Y ± are integrable. Proposition 2.77 If X is a continuous semimartingale, Y is a left-continuous, adapted and locally bounded process, then (Y • X) (t) is the Itˆ o–Stieltjes integral for every t. The convergence of the approximating sums is uniform in probability on every compact interval. The partitions of the intervals can be random as well. (n)
Proof. More precisely, let τ k For each t let
(n)
≤ τ k+1 ∞ be a sequence of stopping times.
(n) (n) (n) Y (τ k ) X(τ k+1 ∧ t) − X(τ k ∧ t)
k
be the sequence of Itˆo-type approximating processes. Assume that for each ω (n) (n) lim max τ k+1 (ω) − τ k (ω) = 0.
n→∞
k
Define the locally bounded simple predictable processes Y (n)
(n) (n) (n) χ τ k , τ k+1 . Y τk
k
As we saw
(n) (n) (n) Y (τ k ) X(τ k+1 ∧ t) − X(τ k ∧ t) . Y (n) • X (t) = k
Y is continuous from the left, hence in every point Y (n) → Y . Let K (t) sup |Y (s)| . s
Y is continuous from the left, so one can take the supremum over the rational points only, hence K is progressively If Y is locally bounded then measurable. K is also locally bounded, and as Y (n) ≤ K, by the Dominated Convergence Theorem Y (n) • X → Y • X, where the convergence is uniform in probability on every compact interval.
LOCALLY SQUARE-INTEGRABLE MARTINGALES
2.4
167
Integration when Integrators are Locally Square-Integrable Martingales
So far, we have assumed that the integrator processes are continuous. It is obvious from the construction that during the discussion the continuity of the integrator was rarely explicitly used. In fact the only place where the continuity is used is the construction and the characterization of the quadratic variation process. The main point in the continuous case is that if M is a continuous local martingale then the quadratic variation is continuous, hence by Fisk’s theorem it is the only increasing process P for which M 2 − P is a local martingale. In this section 2 2 . If M ∈ Hloc then we briefly discuss the case when the integrators are in Hloc the quadratic variation is generally not continuous hence one cannot use Fisk’s theorem. On the other hand as we shall show the jumps ∆ [M ] of [M ] are the 2 squares of the jumps of M and [M ] − ∆ [M ] = [M ] − (∆M ) is continuous so [M ] is the only right-continuous, increasing process P for which M 2 − P is a local 2 martingale and ∆P = (∆M ) . If we use this observation then the rest of the construction is nearly the same as for continuous local martingales and hence we 2 very short. can make the discussion of the case Hloc 2.4.1
The quadratic variation of locally square-integrable martingales
Recall that we have defined the quadratic variation only for finite intervals. The 2 first step of the discussion is to construct the quadratic variation process for Hloc local martingales. Proposition 2.78 If M ∈ H2 and M− is uniformly bounded then there is an a.s. t increasing and right-continuous process [M ] such that [M ] (t) = [M ]0 for any t and 2
∆ [M ] = (∆M ) . This version is indistinguishable from any increasing, right-continuous process (n) 2 P for which P (0) = 0, ∆P = (∆M ) and M 2 − P is a martingale. If (tk ) is an infinitesimal sequence of partitions of [0, t], then p
sup |Qn (s) − [M ] (s)| → 0,
(2.37)
s≤t
where Qn (s)
k
2 (n) (n) M (tk ∧ s) − M (tk−1 ∧ s) .
(2.38)
STOCHASTIC INTEGRATION
168
Proof. By the integration by parts formula for any t
t
M 2 (t) − [M ] (t) = M 2 (0) + 2
M− dM = M 2 (0) + 2 (M− • M ) (t) . 0
As M ∈ H2 and M− is uniformly bounded, the integral process M− • M has a version which is a martingale61 and P
sup |In (s) − (M− • M ) (s)| = sup |In (s) − (M • M ) (s)| → 0, s≤t
(2.39)
s≤t
where In (s)
(n) (n) (n) M (tk−1 ∧ s) M (tk ∧ s) − M (tk−1 ∧ s) .
k
As M 2 and M− • M are right-continuous [M ] M 2 − M 2 (0) − 2M− • M t
is also right-continuous. [M ] (t) is a version of the quadratic variation [M ]0 for p a.s.
q
any t. [M ]0 ≤ [M ]0 for rational numbers p ≤ q. Unifying the measure-zero sets and using the right-continuity of [M ] we can construct an increasing version. (2.37) follows from (2.39). By (2.38) there is a subsequence such that a.s.
sup |Qnk (s) − [M ] (s)| → 0. s≤t
From the uniform convergence ∆ [M ] (s) [M ] (s) − [M ] (s−) = lim Qn (s) − lim Qn (s−) = n→∞
n→∞
= lim (Qn (s) − Qn (s−)) = lim (∆Qn (s)) = n→∞ n→∞
2
2 (n) (n) − M (s−) − M tk−1 = lim M (s) − M tk−1 = n→∞
2
2
= (∆M (s)) − 02 = (∆M (s)) . If P is another right-continuous, increasing process for which P (0) = 0, ∆P = 2 (∆M ) and M 2 − P is martingale, then N P − [M ] is a continuous martingale, N (0) = 0 and the trajectories of N have finite variation. By Fisk’s theorem N = 0 so P is indistinguishable from [M ] . 61 See:
Proposition 2.24, page 128.
LOCALLY SQUARE-INTEGRABLE MARTINGALES
169
Proposition 2.79 Under the assumption of the previous proposition, if τ is an τ arbitrary stopping time then [M τ ] = [M ] . τ
2 Proof. As (M τ ) = M 2 τ
τ 2 τ τ (M τ ) − [M ] = M 2 − [M ] = M 2 − [M ] Since stopped martingales are martingales, stopping the martingale M 2 − [M ] τ at τ we get a martingale again. [M ] is increasing and
τ τ τ 2 2 ∆ ([M ] ) = (∆ [M ]) = (∆M ) = ((∆M τ )) τ
so by the uniqueness property of the quadratic variation [M τ ] = [M ] . 2 Proposition 2.80 If M ∈ Hloc then there is one and only one right-continuous 2 increasing process [M ] such that [M ]
(0) = 0, ∆ [M ] = (∆M ) and M 2 − [M ] is (n)
a local martingale. For any t if tk
is an infinitesimal sequence of partitions
of [0, t] then p
sup |Qn (s) − [M ] (s)| → 0 s≤t
where Qn (s)
2 (n) (n) M (tk ∧ s) − M (tk−1 ∧ s) .
k 2 Proof. If M ∈ Hloc then by definition there is a localizing sequence such that τn 2 M ∈ H . As M− is left-regular M− is locally bounded62 , hence we can assume τn is bounded. If Mn M τ n then by the previous proposition that M− & τn ' τ = [Mnτ n ] = [Mn ] [Mn+1 ] n = Mn+1
hence [Mn ] = [Mn+1 ] on the interval [0, τ n ] and [Mn ] is constant on [τ n , ∞). As τ n ∞ one can define the process [M ] as the ‘union’ of processes [Mn ] that is [M ] (t, ω) [Mn ] (t, ω) ,
t ≤ τ n (ω) .
Evidently [M ] is right-continuous, increasing and [M ] (0) = 0 and ∆ [M ] = 2 (∆M ) . Of course
2 τ n 2 τ M − [M ] = (M τ n ) − [M ] n Mn2 − [Mn ] , 62 See:
Proposition 1.151, page 106.
STOCHASTIC INTEGRATION
170
is a martingale, hence M 2 −[M ] is a local martingale. The proof of the uniqueness is the same as above. 2 Corollary 2.81 If M, N ∈ Hloc then there is one and only one right-continuous process with bounded variation [M, N ] such that
1. [M, N ] (0) = 0, 2. ∆ [M, N ] = ∆M ∆N and 3. M N − [M, N ] is a local martingale. (n)
For any t if (tk )k is an infinitesimal sequence of partitions of [0, t] then p
sup |Qn (s) − [M ] (s)| → 0 s≤t
where Qn (s)
(n)
(n)
M (tk ∧ s) − M (tk−1 ∧ s)
(n) (n) N (tk ∧ s) − N (tk−1 ∧ s) .
k
One can easily prove the next propositions with a trivial modification of proofs of the corresponding theorems in the continuous case63 . Proposition 2.82 If M is a local martingale then the quadratic variation [M ] is zero if and only if M is indistinguishable from a constant64 . Proposition 2.83 (Stopping rule for quadratic variation) Let τ be an arbitrary stopping time65 . τ
1. If M is a local martingale then [M τ ] = [M ] . τ 2. If M and N are local martingales then [M τ , N τ ] = [M, N ] = [M, N τ ]. Proposition 2.84 (Characterization of H2 martingales) Let M be a local martingale. The following statements are equivalent: 1. M ∈ H2 . 2. M (0) ∈ L2 (Ω) and E ([M ] (∞)) < ∞. In both cases M 2 − [M ] is a uniformly integrable martingale66 . 63 Let us emphasize that we have not proved yet that for an arbitrary local martingale L the difference L2 − [L] is also a local martingale. To prove this we shall need the Fundamental Theorem of Local Martingales. See: 3.62, page 222. At the moment we have proved only for locally square-integrable martingales that L2 − [L] is a local martingale, so at the moment one can use the results below only for locally square-integrable martingales. 64 See: Proposition 2.47, page 144. 65 See: Proposition 2.45, page 143. 66 See: Proposition 2.53, page 148.
LOCALLY SQUARE-INTEGRABLE MARTINGALES
171
Proposition 2.85 If M ∈ H02 then M H2 2.4.2
" " " " E (M 2 (∞)) = E ([M ] (∞)) [M ] (∞) = αM (R+ × Ω). 2
Integration when the integrators are locally square-integrable martingales
In the discontinuous case, we can define the stochastic integral only when the integrand X is predictable, therefore when M is not continuous then by definition we assume that the members of L2 (M ), and of course the members of L2loc (M ), are predictable. Proposition 2.86 If M ∈ H2 and X ∈ L2 (M ) , then there is a unique process in H02 denoted by X • M such that for every N ∈ H2 [X • M, N ] = X • [M, N ] . If we denote X • M as
t
(2.40)
XdM then (2.40) can be written as
0
t
t XdM, N = Xd [M, N ] .
0
0
Proof. Most of the proof is the same as in the continuous case. 1. One can prove the existence of X • M as in the continuous case. One can also define the process S (X • M ) N − X • [M, N ] . As in the continuous case one can show that S is a martingale. 2. As X • [M, N ] is a pathwise integral it is easy to show67 that the jumps of X • [M, N ] are X · ∆ [M, N ] = X · ∆M ∆N. Using the predictability of the integrands we prove that the jumps of X • M are X∆M , that is ∆ (X • M ) = X · ∆M.
(2.41)
From this the jumps of (X • M ) N are (X∆M ) ∆N . By the characterization of the quadratic co-variation this implies that [X • M, N ] = X • [M, N ] . That is if N ∈ H02 then (2.40) holds! 67 See:
Proposition 1.20, page 11.
172
STOCHASTIC INTEGRATION
3. So let us prove (2.41)! Assume that M ∈ H2 . First let X ξχ ((a, b]) , where the ξ is bounded and Fa -measurable. Observe that X is left-regular, hence it is predictable. We prove that X • M = ξ M b − M a . E
∞
Xd [M, N ] E ξ
0
∞
χ ((a, b]) d [M, N ] =
0
= E (ξ ([M, N ] (b) − [M, N ] (a))) =
b a = E ξ [M, N ] (∞) − [M, N ] (∞) =
& ' = E ξ M b − M a , N (∞) . As M b − M a ∈ H2 if N ∈ H2
& ' M b − M a N − M b − M a, N
is uniformly integrable. As ξ is bounded and Fa -measurable & '
ξ M b − M a N − ξ M b − M a, N is also uniformly integrable. Hence '
& E ξ M b − M a , N (∞) = E ξ M b − M a (∞) N (∞)
(ξ M b − M a , N ). By the definition of the integral for all N ∈ H2
(ξ M − M b
a
, N) = E
∞
Xd [M, N ] = (X • M, N ) .
0
This means that, as we said,
X • M = ξ Mb − Ma .
∞ 4. The mapping X → E 0 Xd [M, N ] is linear, the mapping X → X • M is obviously also linear, hence if X
n i=1
ξ i χ ((ti , ti+1 ]) ,
(2.42)
LOCALLY SQUARE-INTEGRABLE MARTINGALES
173
where the ξ i are bounded and Fti -measurable then (X • M ) (t) =
n
ξ i (M (t ∧ ti+1 ) − M (t ∧ ti )) =
i=1
= (X • M ) (t) . For processes (2.42) relations (2.40) and the jump condition (2.41) obviously hold. As elements of L2 (M ) are predictable the bounded predictable step processes68 are dense in L2 (M ). Let X ∈ L2 (M ) and let Xn → X where (Xn ) are step processes. By Doob’s inequality and by (2.27) and (2.28) 2
sup |(Xn • M ) (t) − (X • M ) (t)|
E
t
≤
2
≤ 4 (Xn − X) • M (∞)2 = = 4 ((Xn − X) • M, (Xn − X) • M ) = ∞ (Xn − X) d [M, (Xn − X) • M ] ≤ = 4E 0
≤ 4 Xn − XM (Xn − X) • M H2 ≤ ≤ 4 Xn − XM (Xn • M H2 + X • M H2 ) . (2.40) holds for step processes so Xn • M H2 =
"
- E ([Xn • M ] (∞)) = E
∞
0
Xn2 d [M ] Xn M
is a bounded sequence. As Xn − XM → 0 E
2 sup |(Xn • M ) (t) − (X • M ) (t)| → 0. t
Hence for a subsequence (Xnk • M ) almost surely sup |(Xnk • M ) (t) − (X • M ) (t)| → 0. t
Therefore for the jumps almost surely ∆ (Xnk • M ) → ∆ (X • M ) . 68 See:
Proposition 1.42, page 25.
174
STOCHASTIC INTEGRATION
As we have proved ∆ (Xnk • M ) = Xnk ∆M, therefore ∆ (Xnk • M ) = Xnk ∆M → X∆M. This means that if M ∈ H2 then ∆ (X • M ) = X∆M, hence the proposition holds. 2 We can extend the stochastic integral X • M to processes M ∈ Hloc and X ∈ 2 Lloc (M ) exactly as we did it for continuous local martingales. It is easy to 2 and (τ n ) show that if X is locally bounded then X ∈ L2loc (M ). If M ∈ Hloc is a localizing sequence of M then, as in the continuous case, one can prove that τn
X • M τ n = X • (M τ n+1 )
τn
= (X • M τ n+1 )
so one can ‘paste together’ X • M . Let us observe that τn
∆ (X • M )
= ∆ (X • M τ n ) = X∆M τ n
which implies that ∆ (X • M ) = X∆M . Using that the members of L2 (M ) are predictable we showed that ∆ (X • M ) = X∆M. With localization one can easily prove the following important observation: 2 and X ∈ L2loc (M ) then ∆ (X • M ) = X∆M . Corollary 2.87 If M ∈ Hloc
Let us summarize the properties of the stochastic integration when the integrator 2 is in Hloc . The proofs of these properties are direct modifications of the proofs of the corresponding properties presented in the continuous case. Theorem 2.88 (Properties of stochastic integration) If the integrators are 2 then stochastic integration has the following properties: in Hloc 1. 2. 3. 4.
We defined the stochastic integral only for predictable integrands. 2 2 If M ∈ Hloc and X ∈ L2loc (M ) then (X • M ) (0) = 0 and X • M ∈ Hloc . 2 If M ∈ Hloc and X is locally bounded and predictable then X • M exists. Observe that when M is continuous then X ∈ L2loc (M ) if and only if X 2 • [M ] < ∞. In the general case this characterization is not true. 2 5. If M ∈ Hloc then X → X • M is an L2 (M ) → H02 isometry. 2 6. If M, N ∈ Hloc and X ∈ L2loc (M ) then [X • M, N ] = X • [M, N ]. 2 7. Assume that M ∈ Hloc and X ∈ L2loc (M ). If on an interval [a, b] one has X (t, ω) = 0 or M (t, ω) = M (a, ω) for all ω then X • M is constant on [a, b].
LOCALLY SQUARE-INTEGRABLE MARTINGALES
175
2 8. If M ∈ Hloc , X ∈ L2loc (M ) and τ is an arbitrary stopping time then τ
(X • M ) = χ ([0, τ ]) X • M = X τ • M τ = X • M τ . 9. X • M is bilinear. 2 10. Assume that M ∈ Hloc . If X ∈ L2 (M ) then Y ∈ L2 (X • M ) if and only 2 if XY ∈ L (M ). If X ∈ L2loc (M ) then Y ∈ L2loc (X • M ) , if and only if XY ∈ L2loc (M ). In both cases (Y X) • M = Y • (X • M ) . 2 11. If M ∈ Hloc and X ∈ L2loc (M ) then ∆ (X • M ) = X∆M . 2 12. If M ∈ Hloc and (Xn ) is a sequence of predictable processes, Xn → X∞ in every point and there is an X ∈ L2loc (M ) such that |Xn | ≤ X then Xn • M → X∞ • M, where the convergence is uniform on every compact interval in probability, that is p
sup |(Xn • M ) (s) − (X∞ • M ) (s)| → 0, s≤t
2 , τ n ∞ and X 13. If M ∈ Hloc process then X • M exists and
t
XdM (X • M ) (t) = 0
i
for every t ≥ 0.
ξ i χ ((τ i , τ i+1 ]) is a predictable simple
ξ i (M (τ i+1 ∧ t) − M (τ i ∧ t)) .
i
2 14. If M ∈ Hloc , X is left-regular then (X • M ) (t) is an Itˆ o–Stieltjes integral for every t where the convergence of the approximating sums is uniform in probability on every compact interval. The approximating partitions can be random as well69 . 2 it is possible that the trajectories of M have finite Remark that if M ∈ Hloc variation on finite intervals70 . In this case we potentially might have two different definitions for the stochastic integral. Fortunately this not the case.
Proposition 2.89 Let us assume that for some process M we can define two different concepts of integration. Assume that 1. both concepts of integration is linear over the bounded processes, 2. for both concepts of integration bounded predictable processes are integrable, 69 If
X is not left-regular then the property does not hold. See: Example 2.8, page 114. Example 2.20, page 124.
70 See:
STOCHASTIC INTEGRATION
176
3. the integral of the bounded simple processes X
n
ξ i χ ((ti , ti+1 ])
i=1
is (X • M ) (t) =
n
ξ i (M (ti+1 ∧ t) − M (ti ∧ t)) ,
i=1
4. in both cases the Theorem on Dominated Convergence is true. If for some predictable process X both integrals exist then they are indistinguishable. Proof. Let us denote by L the set of bounded processes where the two concepts of integration coincide. L is obviously a linear space and 1 ∈ L. By the dominated convergence property it is obvious that L is a λ-system. The set of bounded elementary processes is a π-system, hence by the Monotone Class Theorem L contains all the bounded predictable processes71 . If X predictable then for all n the integrals of Xn Xχ (|X| ≤ n) are equal. If X is integrable for both concepts then by the Dominated Convergence Theorem the two integrals should be equal. 2.4.3
Stochastic integration when the integrators are semimartingales
The decomposition of continuous semimartingales is unique. In the discontinuous case this is not true. Hence we need the following new definition: Definition 2.90 Let X be a semimartingale. We say that the predictable process Y is integrable with respect to X if there is a decomposition X = X (0) + H + V
(2.43)
2 where H ∈ Hloc and V has finite variation and the integrals Y • H and Y • V exist. In this case
Y • X Y • H + Y • V. The next example is very important. 71 See:
Proposition 1.42, page 25.
LOCALLY SQUARE-INTEGRABLE MARTINGALES
177
Example 2.91 If the integrand is not locally bounded then it is possible that for some decomposition of a semimartingale the two integrals in the above definition exist but for some other decomposition they do not exist.
If X Poisson process with parameter λ, then X has two different decompositions. One can write
X (t) = (X (t) − λt) + λt H (t) + V (t) ,
where H is the compensated Poisson process and we can decompose X as
X =0+X =H +V
where H = 0 and V X has finite variation. Let τ be the time of the first jump of X, and let Y (t, ω) χ (0, τ (ω)] /t. Y is predictable as it is the limit of the predictable processes Yn χ (1/n, τ ] /t, but not locally bounded. If we use the decomposition X = X + 0 then Y • 0 = 0, Y • X = 1/τ , hence the integral exists. t s On the other hand if V (t) = λt then for all ω 0 Y dV = λ 0 Y dt is ∞, hence in the other decomposition the integral does not exist. If Y is locally bounded and X is a semimartingale then obviously for any decomposition (2.43) of X the integrals Y • H and Y • V exist. If we restrict the set of possible integrands to locally bounded processes then the stochastic integration with respect to semimartingales is very simple. One can easily show that the integral has all the usual properties of the stochastic integration72 . If Y is integrable then there is a decomposition (2.43) that Y • H and Y • V exist. If |Yn | ≤ Y then Yn • H and Yn • V exist for every n. For stochastic integration with respect 2 integrator and for the classical pathwise integration the Dominated to a Hloc Convergence Theorem holds. For bounded predictable processes the stochastic integral exists for any decomposition of the semimartingale integrand and it is linear for any fixed decomposition over the bounded integrands. Therefore, by Proposition 2.89, if for two different decompositions of a semimartingale the integral exists for some predictable process, then the two possible integrals are equal. Hence for predictable processes the definition of the integral is independent of the decomposition of the semimartingale. Every left-regular process is locally bounded, hence one can easily prove the following very important observation: 72 See:
Theorem 2.88, page 174,
178
STOCHASTIC INTEGRATION
Proposition 2.92 (Existence of quadratic variation) If X and Y are arbitrary semimartingales then the quadratic co-variation [X, Y ] has a rightcontinuous version and XY − X (0) Y (0) = X− • Y + Y− • X + [X, Y ] where the integrals are stochastic integrals. The jumps of the quadratic covariation are ∆ [X, Y ] = ∆X∆Y . Proof. It is sufficient to prove the relation ∆ [X, Y ] = ∆X∆Y . From the formula for the jumps of stochastic integrals ∆ [X, Y ] = ∆ (XY ) − X− ∆Y − Y− ∆X = = XY − X− Y− − X− ∆Y − Y− ∆X = = XY − X− (Y− + ∆Y ) − Y− (∆X + X− ) + Y− X− = = XY − X− Y − Y− X + Y− X− = = (X − X− ) (Y − Y− ) = ∆X∆Y. Recall that we have defined semimartingales as the sums of locally squareintegrable martingales and processes with finite variation. At this stage there are three things we do not know about semimartingales. 1. We have not proved that the local martingales are semimartingales73 . 2. We also have not proved that if M is a local martingale then M 2 − [M ] is a local martingale. 3. Let X be a semimartingale and let us assume that Y1 • X and Y2 • X exist. Can we prove the existence of (Y1 + Y2 ) • X? At the moment of course not: If Y1 and Y2 are not locally bounded then it is possible that Y1 • X exists in one decomposition and Y2 • X exists in some different decomposition of X. These are serious problems, to overcome them in the next chapters will take a concerted effort!
73 To prove that every local martingale is semimartingale one needs the Fundamental Theorem of Local Martingales. See: Theorem 3.57, page 220.
3 THE STRUCTURE OF LOCAL MARTINGALES The main result of this chapter is the theorem which we shall call the Fundamental Theorem of Local Martingales, which states that every local martingale can be decomposed as the sum of a locally bounded local martingale and a local martingale which has locally integrable variation1 . The Fundamental Theorem of Local Martingales has many important consequences. Perhaps the most important one is that for any local martingale L the quadratic variation process [L] exists and the difference L2 − [L] is a local martingale. From now on we assume that the space (X, A, P) is complete, that is if N ⊆ A ∈ A and P (A) = 0 then N ∈ A. We also assume that the filtration F satisfies the usual conditions. Of course the usual conditions is not a big surprise, but it is remarkable that we need the completeness of the base space (X, A, P). The reader can take this fact as an indicator of the forthcoming measure-theoretic difficulties. Let us introduce some useful notation. Definition 3.1 Fix a stochastic base (Ω, A, P, F). 1. L will denote the set of local martingales L for which L (0) = 0. 2. V will denote the set of right-regular, adapted processes V which have finite variation on every finite interval and for which V (0) = 0. 3. A will denote the set of processes A ∈ V, for which E (Var (A) (∞)) < ∞. A is called the space of processes with integrable variation2 . 1 See:
Definition 3.1 below. careful reader would notice that the symbol A denotes two objects. A is the set of possible events in the probability space (Ω, A, P) and A is also the set of processes with integrable variation. In the theory of stochastic processes the events of (Ω, A, P) play a very minor role, so generally A will denote the set of processes with integrable variation. Nevertheless we apologize for this inconvenience. 2 The
179
180
THE STRUCTURE OF LOCAL MARTINGALES
4. If X ∈ Aloc that is there is a localizing sequence (τ n ) that X τ n ∈ A for all n then we shall say that X has locally integrable variation. 5. V + will denote the processes in V which have increasing trajectories. 6. A+ will denote the processes in A which have increasing trajectories. 7. The adapted process S is a semimartingale if it has a decomposition S = S (0) + L + V
(3.1)
where V ∈ V and L ∈ L. S will denote the set of semimartingales3 . 8. A semimartingale S is a special semimartingale if there is a decomposition (3.1) where V is predictable. Sp will denote the space of special semimartingales. Observe that we have changed the definition of semimartingales4 . An important message of the Fundamental Theorem is that the present definition is the same as the old one. The sequence of jumps of a Poisson process does not have an accumulation point, hence every compound Poisson process is in V. Example 3.2 If X is a compound Poisson process then the distribution of the jumps of X has finite expected value if and only if X ∈ Aloc .
Let (τ n ) be the jump-times of X and let (ξ n ) be the size of the jumps. If for the common distribution of the jumps the expected value m E (|ξ n |) is finite then n E (Var (X τ n ) (∞)) = E |ξ k | = nm < ∞, k=1
hence X ∈ Aloc . On the other hand assume that X ∈ Aloc , but m = ∞. Let (σ n ) be an A-localizing sequence of X. Define the stopping times ρn σ n ∧ τ 1 . ρn ≤ τ 1 , hence Fρn ⊆ Fτ 1 so ρn is Fτ 1 -measurable. P (τ 1 < ∞) = 1, hence if n is large enough then P (ρn = τ 1 ) > 0. The compound Poisson processes are L´evy processes, hence by the strong Markov property of L´evy processes ξ 1 = ∆X (τ 1 ) is independent of Fτ 1 . Hence ∞ > E (Var (X σn ) (∞)) ≥ E (Var (X ρn ) (∞)) = E (|ξ 1 | χ (τ 1 = ρn )) = = E (|ξ 1 |) P (τ 1 = ρn ) = ∞, which is impossible. Of course, in the argument we did not use the fact that the distributions of the jumps were the same. If (τ n ) is a strictly increasing sequence 3 The 4 See:
decomposition is not necessarily unique. Definition 2.17, page 124.
THE STRUCTURE OF LOCAL MARTINGALES
181
of stopping times and at each τ k we have a jump ξ k , which is independent of Fτ k then E (|ξ k |) is finite for all k if and only if the process X (t) k ξ k χ (τ k ≤ t) is in Aloc . Example 3.3 If L ∈ L and L∗ (t) sups≤t |L (s)| then L∗ ∈ A+ loc . Since L is right-continuous sup |L (s)| = s≤t
sup |L (s)| ,
s≤t,s∈Q
hence L∗ is adapted, and increasing. As L is right-continuous, L∗ is also rightcontinuous. Let (τ n ) be a localizing sequence of L. Let σ n inf {t : |L (t)| > n} ∧ τ n . Since L is right-continuous, σ n is a stopping time5 for all n. If σ ∞ (ω) sup σ n (ω) < ∞ n
for some outcome ω then |L (σ ∞ (ω) −)| = ∞ which is impossible as for every outcome L has finite limits from the left. Therefore obviously σ n ∞. σn
(L∗ )
σn
(t) ≤ (L∗ )
(∞) = L∗ (σ n ) ≤ L∗ (σ n −) + |∆L∗ (σ n )| ≤
≤ n + |L (σ n )| = n + |Lτ n (σ n )| . Lτ n ∈ M therefore by the Optional Sampling Theorem |Lτ n (σ n )| is integrable, hence (L∗ )σn ∈ A+ and so L∗ ∈ A+ loc .
Proposition 3.4 If V ∈ V ∩ L then V ∈ Aloc . Proof. Let (τ n ) be a localizing sequence of a V ∈ L. σ n inf {t : Var (V ) (t) > n} ∧ τ n . V is right-continuous and adapted, hence Var (V ) is also right-continuous and adapted. The filtration is right-continuous hence σ n is a stopping time and by the right-regularity of Var (V ) again σ n ∞. If ∆V denotes the jumps of V , 5 See:
Example 1.32, page 17.
182
THE STRUCTURE OF LOCAL MARTINGALES
then Var (V ) (σ n ) = Var (V ) (σ n −) + ∆Var (V ) (σ n ) = = Var (V ) (σ n −) + |∆V (σ n )| ≤ ≤ n + |V (σ n )| + |V (σ n −)| ≤ 2n + |V (σ n )| . V τ n is a uniformly integrable martingale, hence V (σ n ) is integrable so Var (V ) (σ n ) is also integrable, hence by the definition of A obviously V ∈ Aloc .
3.1
Predictable Projection
Our main tool in analysing the structure of local martingales is the so-called predictable projection. It is very natural to ask that how ‘far’ are the predictable processes from the other classes of measurable processes. If X is a product measurable process, then with the predictable projection one can find a predictable process denoted by p X which is in some sense ‘close’ to X. This closeness means that for every so-called predictable stopping time τ the expected value of the stopped variables X(τ ) and (p X) (τ ) are equal. If X is the gain process of some game and τ is an exit strategy, then the stopped variable X(τ ) is the value of the game if one plays the exit strategy τ . If a stopping time is ‘predictable’ then somehow we can foresee, predict it. As X(τ ) and (p X) (τ ) have the same expected value for predictable exit rules it will be irrelevant, on average, whether we play the game X or the predictable game p X. So, as an interpretation one can say that p X is the predictable part6 of X. If L is a local martingale then the ‘unpredictable’ part of L are the jumps ∆L of L. The most important examples of the predictable projection are the rules p L = L− and p (∆L) = 0. This means that one cannot ‘predict’ the size of the jumps of a local martingale7 . 3.1.1
Predictable stopping times
Let us first define when a stopping time is predictable. Definition 3.5 We say that a stopping time σ announces τ if σ (ω) ≤ τ (ω) for all outcomes ω and σ (ω) < τ (ω) whenever τ (ω) > 0. We say that the stopping time τ is predictable if there is a sequence of stopping times (σ n ) such that σ n τ and σ n announces τ for all n. The sequence (σ n ) is called the announcing or predicting sequence of τ . 6 More exactly, of course, p X by definition is the predictable part of X, since p X is mathematically well-defined, but the expression ‘predictable part’ is not a mathematical concept. 7 It is very natural to ask how one can predict the jumps of stock prices. As in mathematical finance we assume that the stock prices are basically driven by some local martingale, the answer is that nobody can predict the jumps of the price processes. So the humble relation p (ΛL) = 0 just mentioned has extraordinarily important theoretical and applied implications.
PREDICTABLE PROJECTION
183
Definition 3.6 We say that a stopping time σ is totally inaccessible if P (τ = σ < ∞) = 0 for every predictable stopping time τ . Example 3.7 The jump-times of Poisson processes are totally inaccessible8 .
Let N be a Poisson process with parameter λ > 0. Let τ be the time of the first jump of N that is let τ inf {t : N (t) = 1} . Obviously τ is a stopping time and almost surely 0 < τ < ∞. It is well-known9 that τ has an exponential distribution with parameter λ. We show that τ is not predictable. Suppose (τ n ) to be an announcing sequence of τ . τ n < τ < ∞, so trivially N (τ n ) = 0 a.s. and by the strong Markov property of L´evy processes N (n) (t) N (t + τ n ) − N (τ n ) = N (t + τ n ) is also a Poisson process with parameter λ. If σ n is the time of the first jump of N (n) , then σ n = τ − τ n , and σ n also has an exponential distribution with parameter λ. 1 = P (τ n τ ) = P (σ n 0) , which is impossible since the convergence of distributions follows from the almost sure convergence. In the same way one can prove that no part of τ is predictable, that there is no predictable stopping time ρ for which on a set B with positive probability ρ = τ : Assume that there is such a ρ and let (ρn ) be a sequence announcing ρ. For the stopping times τ n ρn ∧ τ N (n) (t) N (t + τ n ) − N (τ n ) is again a Poisson process with parameter λ. Again, if σ n denotes the time of the first jump of N (n) then σ n has exponential distribution with parameter λ. (σ n ) is almost surely convergent, hence it converges in distribution, which is impossible since if σ ∞ is the limit of (σ n ) then σ ∞ must be zero on B where B has positive probability. 8 See: 9 See:
Example 7.5, page 465 and Example 7.75, page 517. page 461.
184
THE STRUCTURE OF LOCAL MARTINGALES
Example 3.8 If w is a Wiener process then for all a the first passage time τ a inf {t: w (t) = a} is a predictable stopping time.
By the continuity of the trajectories of w the sequence announces τ .
τ a−1/n
obviously
Proposition 3.9 If τ and σ are predictable stopping times then τ ∧ σ and τ ∨ σ are predictable stopping times. If τ n τ and τ n are predictable stopping times then τ is a predictable stopping time. Proof. If (τ n ) announces τ and (σ n ) announces σ then (τ n ∧ σ n ) will be an announcing sequence for τ ∧ σ and (τ n ∨ σ n ) will be an announcing sequence for (n) τ ∨ σ. If (τ k ) announces τ n , then obviously σ n max τ (k) : k = 1, . . . , n n announces τ and (k) σ n ≤ max τ n+1 : k = 1, . . . , n ≤ σ n+1 . For any ε > 0 and for any outcome ω, there is an N , depending on the outcome,
(N ) such that for any outcome τ n (ω) ≥ τ (ω) − ε for every n ≥ N (ω). τ k (N )
announces τ N hence τ k
≥ τ N − ε for all k ≥ M ≥ N.
(k) (M ) (N ) σ M max τ M : k = 1, . . . , M ≥ τ M ≥ τ M ≥ τ N − ε ≥ τ − 2ε so σ n τ . Example 3.10 If the stopping times τ n are predictable and τ n τ then τ is not necessarily predictable.
Let τ be an arbitrary non-predictable stopping time. Obviously τ n τ + 1/n is a predictable stopping time for every n and τ n τ . a.s.
Proposition 3.11 If τ = 0 then τ is a predictable stopping time. If τ is a a.s. predictable stopping time and σ = τ then σ is also a predictable stopping time. Proof. (Ω, A, P) is complete and the filtration contains the measure-zero sets a.s.
{τ ≤ t} = {τ = 0} ∈ Ft
PREDICTABLE PROJECTION
185
for any t. Hence τ is a stopping time. As τ is announced by τn
τ − 1/n 0
if τ > 1/n if τ ≤ 1/n
τ is predictable. To prove the second statement let (τ n ) be an announcing sequence of τ . By the usual conditions τn if τ =σ if τ = σ and σ > 1/n σ n σ − 1/n 0 otherwise then (σ n ) is an announcing sequence for σ. Definition 3.12 If τ is a predictable stopping time and (τ n ) is an announcing sequence of τ then let Fτ − σ (∪n Fτ n ) . Of course one should now prove that the definition of Fτ − is independent of the announcing sequence (τ n ). Proposition 3.13 If τ is a predictable stopping time then Fτ − = σ (F0 , {A ∩ {t < τ } , A ∈ Ft }) ,
(3.2)
hence the definition of Fτ − is independent of the announcing sequence (τ n ). Proof. For an arbitrary stopping time ρ let Fρ σ (F0 , {A ∩ {t < ρ} , A ∈ Ft }) . Assume that (τ n ) announces τ . 1. We show that if σ announces τ then Fσ ⊆ Fτ , hence σ (∪n Fτ n ) Fτ − ⊆ Fτ . Since σ announces τ , for every A A = (∪r∈Q A ∩ {σ < r < τ }) ∪ (A ∩ {τ = 0}) . If A ∈ Fσ then B A ∩ {σ < r} ∈ Fr , hence by the definition of Fτ A ∩ {σ < r < τ } B ∩ {r < τ } ∈ Fτ .
186
THE STRUCTURE OF LOCAL MARTINGALES
As σ ≤ τ A ∩ {τ = 0} = A ∩ {σ = 0} ∩ {τ = 0} . As τ is a stopping time {τ = 0} ∈ F0 . A ∈ Fσ so A ∩ {σ = 0} ∈ F0 , hence again by the definition of Fτ A ∩ {τ = 0} = A ∩ {σ = 0} ∩ {τ = 0} ∈ Fτ , so Fσ ⊆ Fτ . 2. We show that Fσ ⊆ Fσ for every stopping time σ. If A ∈ Ft for some t then for all possible u {t < σ} ∩ A ∩ {σ ≤ u} = A ∩ {t < σ ≤ u} ∈ Fu , hence {t < σ} ∩ A ∈ Fσ . 0 ≤ σ. Therefore F0 ⊆ Fσ , so by the definition of Fσ obviously Fσ ⊆ Fσ . 3. Let A ∈ Ft . Since τ n τ and as Fτ ⊆ Fτ n
n
A ∩ {t < τ } = ∪n (A ∩ {t < τ n }) ∈ ∪n Fτ n ⊆ σ (∪n Fτ n ) Fτ − . Trivially F0 ⊆ Fτ n ⊆ Fτ − . Hence Fτ ⊆ Fτ − . So Fτ − = Fτ . That is the proposition holds. Proposition 3.14 If τ is predictable then τ is measurable with respect to Fτ − . Proof. If (τ n ) announces τ then τ n is measurable with respect to Fτ n ⊆ Fτ − for all n. τ n τ and therefore τ is also measurable with respect to Fτ − . Proposition 3.15 If X is a predictable process and τ is a predictable stopping time, then the stopped variable Xτ X (τ ) χ (τ < ∞) is measurable with respect to Fτ − . Proof. If X is left-continuous and adapted then it is progressively measurable. Hence if (τ n ) announces τ then Xτ n χ (τ n < ∞) X (τ n ) is measurable10 with respect to Fτ n ⊆ Fτ − . As X is left-continuous Xτ n → Xτ . Hence Xτ is measurable with respect to Fτ − . The set of bounded processes X for which the proposition holds is a λ-system. The left-continuous, adapted processes form a π-system and the predictable processes are measurable with 10 See:
Proposition 1.35, page 22.
PREDICTABLE PROJECTION
187
respect to the σ-algebra generated by the adapted left-continuous processes11 . Hence by the Monotone Class Theorem one can prove the Fτ − -measurability of Xτ in the usual way for every predictable process X. Proposition 3.16 If τ is a predictable stopping time and B ∈ Fτ − then τ B (ω)
τ (ω) if ω ∈ B ∞ if ω ∈ /B
is also a predictable stopping time. Proof. Let B be the collection of such sets B that the proposition holds both for B and for B c . As the maximum and the minimum of a finite number of predictable stopping times are again predictable stopping times, B is an algebra. As the limit of an increasing sequence of predictable stopping times is again a predictable stopping time B is a σ-algebra. Let (τ n ) be an announcing sequence of τ . Fix a C ∈ Fτ n . If m ≥ n then Fτ n ⊆ Fτ m and therefore (m)
τC
τ m (ω) if ω ∈ C ∞ if ω ∈ /C (m)
is again a stopping time. Hence τ C ∧ m is also a stopping time, and (m) announces τ C . Hence τ C is predictable. By the definition of τC ∧ m m≥n
Fτ − , using the fact that B is a σ-algebra, Fτ − σ (∪Fτ n ) ⊆ B, hence the proposition holds. Proposition 3.17 If δ and ρ are predictable stopping times then {ρ = δ} , {ρ ≤ δ} , {δ ≤ ρ} , {δ < ρ} , {ρ < δ} ∈ Fρ− . Proof. It is enough to prove that c
{ρ ≤ δ} , {δ ≤ ρ} = {ρ < δ} ∈ Fρ− . If (ρn ) announces ρ and (δ n ) announces δ, then12 {ρ ≤ δ} = ∩n {ρn ≤ δ} =
c c = (∪n {ρn ≤ δ} ) ∈ σ ∪n Fρn Fρ− ,
{ρ < δ} = (∪n {ρ ≤ δ n }) \ {ρ = δ = 0} =
= (∪n ∩m {ρm ≤ δ n }) \ {ρ = δ = 0} ∈ σ ∪Fρm Fρ− .
11 See: 12 See:
Proposition 1.42, page 25. Proposition 1.34, page 20.
188
THE STRUCTURE OF LOCAL MARTINGALES
3.1.2
Decomposition of thin sets
Assume that the trajectories of some process X are regular. This implies that for every outcome ω the set {t : ∆X (t, ω) = 0} is at most countable and the jumps, which are larger than a given c > 0 cannot have an accumulation point. If τ 0 = 0,
τ n+1 = inf {t > τ n : |∆X| ≥ c}
then the union of the graphs of the stopping times13 (τ n ) covers the set {|∆X| ≥ c}. This implies that the set {∆X = 0} can be covered by the graphs of at most a countable number of stopping times. Definition 3.18 A set A ⊆ R+ × Ω is called thin if A ⊆ ∪n [ρn ] where (ρn ) is a sequence of stopping times. If [ρn ] ∩ [ρm ] = ∅ for all m = n then we say that (ρn ) is an exhausting sequence of A. Proposition 3.19 (Accessible and inaccessible part of stopping times) For every stopping time τ there are, at most, countably many, predictable stopping times (σ k ) and a set X ∈ Fτ , for which τ X is totally inaccessible and the graph of τ X c is covered by the disjoint union of the graphs of the predictable stopping times (σ k ). (0) Proof. If τ is totally inaccessible
(0) then thereis nothing to prove. If τ τ is not totally inaccessible then P τ = σ 1 < ∞ > 0 for some predictable stopping time σ 1 . Let B1 τ (0) = σ 1 < ∞ = {τ = σ 1 < ∞} .
Let us delete from τ the set B1 : As14 B1 ∈ Fτ (0) = Fτ τ (ω) if ω ∈ / B1 (0) (1) τ (ω) τ B c (ω) 1 ∞ if ω ∈ B1 is a stopping time. If τ (1) is totally inaccessible then we stop. If τ (1) is not totally (1) inaccessible then P τ = σ 2 < ∞ > 0 for some predictable stopping time σ 2 . Let c B2 τ (1) = σ 2 < ∞ = {τ = σ 2 < ∞} ∩ {τ = σ 1 < ∞} ∈ Fτ etc. The only problem is that we should finish the process in at most countably many steps. Let
bn sup P τ (n) = σ < ∞, σ is predictable 13 See: 14 See:
Example 1.32, page 17. Proposition 1.34, page 20.
PREDICTABLE PROJECTION
189
and for any n let σ n+1 be such a predictable stopping time that
b n P (Bn+1 ) P τ (n) = σ n+1 < ∞ ≥ . 2 If bn = 0 then as above Bn+1 τ (n) = σ n+1 < ∞ = {τ = σ n+1 < ∞} \ (∪nk=1 Bk ) ∈ Fτ and
τ
(n+1)
(ω) =
(n) τ Bc n+1
(ω)
τ (ω) ∞
if ω ∈ / ∪n+1 k=1 Bk if
ω ∈ ∪n+1 k=1 Bk
.
As the sets Bn are disjoint ∞ n=1
bn ≤ 2
∞
P (Bn ) = P (∪n Bn ) < ∞.
n=1
Therefore bn → 0. Bn ∈ Fτ for every n so X Ω \ (∪n Bn ) ∈ Fτ . Let σ be a predictable stopping time. For an arbitrary n
P (τ X = σ < ∞) ≤ P τ (n) = σ < ∞ ≤ bn → 0, so P (τ X = σ < ∞) = 0. That is τ (ω) if ω ∈ / ∪n Bn . τ X (ω) ∞ if ω ∈ ∪n Bn is totally inaccessible. Definition 3.20 A stopping time σ is called accessible if there is a sequence of predictable stopping times (τ n ) such that P (∪n {σ = τ n < ∞}) = P (σ < ∞) . Corollary 3.21 If τ is a stopping time then there are disjoint events X, Y ∈ Fτ a.s. such that X ∪ Y = {τ < ∞} and τ X is totally inaccessible and τ Y is accessible and a.s.
τ = τX ∧ τY . Proposition 3.22 Every thin set X has an exhausting sequence. We may assume that the members of the exhausting sequence are either predictable or totally inaccessible.
190
THE STRUCTURE OF LOCAL MARTINGALES
Proof. By the previous proposition every stopping time can be covered by a countable number of predictable and one totally inaccessible stopping time. Hence one can cover the set X with the sets ∪n [σ n ] and ∪m [τ m ] where σ n is totally inaccessible for all n and τ m is predictable for all m. We show that one can find such a sequence of stopping times which are either predictable or totally inaccessible and the graphs of the stopping times being disjoint. As σ n is predictable and τ m is totally inaccessible {τ m = σ n < ∞} has zero measure, so it is sufficient to make the sequences (τ n ) and (σ m ) disjoint15 . 1. One can easily make the sequence (σ n ) disjoint. σ 2 } ∈ Fσ2 , σ 2 (ω)
Since16 {σ 1 =
σ 2 (ω) if ω ∈ / {σ 1 = σ 2 } ∞ if ω ∈ {σ 1 = σ 2 }
is also a totally inaccessible stopping time and σ 1 and σ 2 have disjoint graphs. 2. To do the same with the sequence (τ n ) it is sufficient to observe that if τ 1 and τ 2 are predictable stopping times then17 {τ 1 = τ 2 } ∈ Fτ 2 − , hence18 τ 2
(ω)
τ 2 (ω) if ω ∈ / {τ 1 = τ 2 } ∞ if ω ∈ {τ 1 = τ 2 }
is a predictable stopping time. 3.1.3
The extended conditional expectation
In this subsection we introduce a generalization of the conditional expectation. Let us first recall the definition of the conditional expectation: Definition 3.23 (Conditional expectation) Let η be an arbitrary random variable and let F be a σ-algebra. We say that the random variable ξ is the conditional expectation of η with respect to the σ-algebra F if 1. ξ is F-measurable and 2. F ξ dP = F η dP for any F ∈ F. The usual notation of the conditional expectation is E(η | F). 15 Observe that we have used the completeness of (Ω, A, P) implicitly as we tacitly assumed that if a function is almost surely zero, then it is a predictable stopping time. 16 See: Proposition 1.34, page 20. 17 See: Proposition 3.17, page 187. 18 See: Proposition 3.16, page 187.
PREDICTABLE PROJECTION
191
Let us recall that if η ≥ 0 then almost surely E(η | F) ≥ 0, but it is possible that E(η | F) has infinite values. The following theorem is well-known and it is a direct consequence of the Radon–Nikodym theorem: Theorem 3.24 Let F be an arbitrary σ-algebra. 1. If η is non-negative then E(η | F) exists. 2. If η is quasi-integrable19 then E(η | F) exists and E(η | F) = E(η + | F)− E(η − | F). 3. E(η | F) is unique up to a measure-zero set. Definition 3.25 (Generalized conditional expectation) Let η be an arbitrary random variable and let F be a σ-algebra. If the conditional expectations E (η + | F) and E (η − | F) are finite then by definition the generalized conditional expectation of η with respect to the σ-algebra F will be the difference
E η+ | F − E η− | F . We shall also denote the generalized conditional expectation by E (η | F). One can easily reformulate most of the properties of the conditional expectation for the generalized conditional expectation: Proposition 3.26 The generalized conditional expectation has the following properties: 1. The generalized conditional expectation E (ξ | F) exists if and only if the a.s. conditional expectation of |ξ| is almost surely finite that is E (|ξ| | F) < ∞. 2. The generalized conditional expectation E (ξ | F) is unique up to a measurezero set. a.s. 3. If ξ is F-measurable then E (ξ | F) = ξ. 4. If the variables ξ and η have generalized conditional expectation then for arbitrary numbers a and b the variable aξ + bη also has generalized conditional expectation and a.s.
E (aξ + bη | F) = aE (ξ | F) + bE (η | F) . 5. If the generalized conditional expectation E (ξ | F) exists and η is F-measurable then the generalized conditional expectation E (ηξ | F) also exists and a.s.
E (ηξ | F) = ηE (ξ | F) . 19 That is the expectation E(η) E(η + )−E(η − ) exists. Recall that by definition the integral E(η) exists if the difference E(η + ) − E(η − ) is not of the form ∞ − ∞. See: [71].
192
THE STRUCTURE OF LOCAL MARTINGALES
6. If G ⊆ F and the generalized conditional expectation E (ξ | G) exits then the generalized conditional expectation E (ξ | F) also exists and a.s.
E (E (ξ | G) | F) = E (ξ | G) , a.s.
E (E (ξ | F) | G) = E (ξ | G) . Recall that the difference E (η + | F) − E (η − | F) is not necessarily meaningful for every η. To make the definition of the predictable projection as simple as possible we introduce the operator xy
x−y ∞
if x, y ≥ 0 are not both infinite, . otherwise.
Definition 3.27 (Extended conditional expectation) Let η be an arbitrary random variable and let F be an arbitrary σ-algebra. 0 (η | F) is by definition 1. The extended conditional expectation E
0 (η | F) E η + | F E η − | F . E
(3.3)
0 (η | F) is well-defined if 2. We say that the extended conditional expectation E except on a measure-zero set one need not use the convention ∞ ∞ ∞. 0 (η | F) is F-measurable, but it is different from the conLet us remark that E ditional expectation and from the generalized conditional expectation. Observe 0 (η | F) is finite if and only if E 0 (η | F) is the generalized conditional that E expectation. Observe also that in general the extended conditional expectation 0 is not linear. operator E 3.1.4
Definition of the predictable projection
Using the extended conditional expectation, let us define the predictable projection. Before the definition let us discuss the next, very important example. Example 3.28 The predictable projection of a local martingale.
Let L ∈ L be a local martingale and let L be the net gain of some game. Let τ < ∞ be some exit strategy from L. Let assume that we want to predict, foresee, at least infinitesimally, the value of L (τ ). Of course we should assume that τ is a predictable stopping time otherwise there is no hope to predict the value of L (τ ). If (τ n ) announces τ and L is a uniformly integrable martingale then at τ n our reasonable prediction of L (τ ) is E (L (τ ) | Fτ n ) = L (τ n ). By L´evy’s
PREDICTABLE PROJECTION
193
theorem lim E (L (τ ) | Fτ n ) = E (L (τ ) | Fτ − )
n→∞
which is obviously lim L (τ n ) = L (τ −) .
n→∞
If L is a local martingale and (σ m ) is localizing L then lim Lσm (τ −) = L (τ −)
m→∞
is a reasonable infinitesimal prediction of L (τ ). Therefore we have got that the ‘predictable part’ of L is L− . Which is not a great surprise after all. Perhaps it is more interesting to study the limit of the estimating formula E (Lσm (τ ) | Fτ − ). c
Lσm (τ ) = L (τ ) χ ({τ > σ m } ) + L (σ m ) χ (τ > σ m ) . Obviously20 {τ > σ m } = ∪n {τ n > σ m } ∈ σ (∪n Fτ n ) = Fτ − therefore
σm (τ ) | Fτ − − E L− (τ ) | Fτ − =
= χ (τ ≤ σ m ) E L+ (τ ) | Fτ − +
+ χ (τ > σ m ) E L+ (σ m ) | Fτ − −
− χ (τ ≤ σ m ) E L− (τ ) | Fτ − −
− χ (τ > σ m ) E L− (σ m ) | Fτ − .
E (Lσm (τ ) | Fτ − ) E
L+
σ m
If m → ∞ then as τ < ∞ the limit is almost surely
E L+ (τ ) | Fτ − − E L− (τ ) | Fτ − . Almost surely
χ (τ ≤ σ m ) E L+ (τ ) | Fτ − = E χ (τ ≤ σ m ) L+ (τ ) | Fτ − < ∞ for all m and almost surely ∪m {τ ≤ σ m } = Ω. Therefore from the calculation it is clear that almost surely E (L± (τ ) | Fτ − ) < ∞. Hence
L− (τ ) = E L+ (τ ) | Fτ − − E L− (τ ) | Fτ − E (L (τ ) | Fτ − ) where E denotes the extended conditional expectation with respect to Fτ − . 20 See:
Proposition 1.34, page 20.
THE STRUCTURE OF LOCAL MARTINGALES
194
Definition 3.29 (Predictable projection) We say that the predictable process p X is the predictable projection of a process X if p
a.s. 0 X (τ ) = E (X (τ ) | Fτ − )
on the set {τ < ∞}
(3.4)
that is21 0 (X (τ ) | Fτ − ) a.s. 0 (X (τ ) χ (τ < ∞) | Fτ − ) a.s. χ (τ < ∞) E = E = p X (τ ) χ (τ < ∞) for every predictable stopping time τ . 1. p X is well-defined if for every predictable stopping time τ the extended conditional expectation in (3.4) is well defined. 2. p X is finite if for every predictable stopping time τ the extended conditional expectation in (3.4) is a.s. finite. In this case the definition of the predictable projection is the following: for every predictable stopping time τ on the set {τ < ∞} p
a.s. 0 X (τ ) = E (X (τ ) | Fτ − ) = E (X (τ ) | Fτ − ) =
= E X + (τ ) | Fτ − − E X − (τ ) | Fτ − ,
where E denotes the generalized conditional expectation. Example 3.30 For non-negative processes, if the predictable projection exists then it is well-defined; for bounded processes, if it exists then it is finite.
3.1.5
The uniqueness of the predictable projection, the predictable section theorem
Our direct goal in this subsection is to prove the next observation22 : Theorem 3.31 (Uniqueness of the predictable projection) If X1 ≥ X2 and p X1 is a predictable projection of X1 and p X2 is a predictable projection of X2 then p X1 (ω) ≥ p X2 (ω) for almost all outcomes ω. Specifically, if (p X)1 and (p X)2 are both predictable projections of some process X then (p X)1 and (p X)2 are indistinguishable. Before we start to prove the theorem, let us remark that from the definition of the predictable projection it is obvious that the result of the operation p X is unique up to modification. But stochastic processes are not just indexed sets of random 21 See:
Proposition 3.14, page 186. Observe that X (τ ) can have a meaning even on {τ = ∞}. moment we do not know when the predictable projection exists. Later we shall prove that every product measurable process has a predictable projection. See: Proposition 3.44, page 206. 22 At
PREDICTABLE PROJECTION
195
variables, they are functions of two variables! The main point of the theorem is that we can select from every equivalence class p X (t) a representative in such a way that the resulting process, as a function of two variables, is predictable. From this it is not really surprising that the proof of the theorem depends on some deep and difficult properties of measurable sets. The theorem is an easy and direct consequence of the next result: Proposition 3.32 If B ⊆ R+ × Ω is a predictable set and P (projΩ B) > 0 then there is a predictable stopping time σ such that [σ] = Graph (σ) {(σ (ω) , ω) : σ (ω) < ∞} ⊆ B, and 0 < P (σ < ∞). Proof of the Theorem: If the Theorem were not true then the projection on Ω of the set B {(t, ω) :
p
X1 (t, ω) < p X2 (t, ω)}
would have positive probability. The set B is predictable, since p X1 and p X2 are predictable by definition. Hence, by the proposition above, there is a predictable stopping time σ such that with positive probability the graph of σ is in B. It is easy to see that the extended conditional expectation is a monotone operation. Hence as X1 ≥ X2 by the definition of the predictable projection on the set {σ < ∞} p
a.s.
a.s. 0 0 (X2 (σ) | Fσ− ) a.s. X1 (σ) = E (X1 (σ) | Fσ− ) ≥ E = p X2 (σ)
which is impossible as on a set of size P (σ < ∞) > 0 p
X1 (σ) < p X2 (σ) .
If (p X)1 and (p X)2 are two different predictable projections of some X then for almost all outcomes (p X)1 (ω) ≥ (p X)2 (ω) and (p X)2 (ω) ≥ (p X)1 (ω). Hence the trajectories of (p X)1 and (p X)2 are equal almost surely. Proposition 3.32 is a direct consequence of the next important ‘technical’ theorem. This theorem is the ‘hard part’ of the whole stochastic analysis, and during the proof of it we shall use the completeness of (Ω, A, P) several times. Theorem 3.33 (Predictable Section Theorem) If B ⊆ R+ × Ω is a predictable set then for every ε > 0 there is a predictable stopping time σ such that [σ] = Graph (σ) {(t, ω) : t = σ (ω) < ∞} ⊆ B, and P (projΩ B) ≤ P (σ < ∞) + ε.
196
THE STRUCTURE OF LOCAL MARTINGALES
Proof. The proof of the theorem contains several steps. 1. Observe that if τ is an arbitrary stopping time then the process χ ([0, τ ]) is adapted and left-continuous. Recall that the random intervals of type [0, τ ] together with the products {0}×F, F ∈ F0 , generate the predictable sets23 P. As c (τ , ∞) = [0, τ ] , the random intervals (τ , ∞) together with the sets {0} × F, F ∈ F0 , also generate the predictable sets. If σ is a predictable stopping time and (σ n ) announces σ then [σ, ∞) = ∩n (σ n , ∞). Hence if σ is a predictable stopping time then the random interval [σ, ∞) is a predictable set. For an arbitrary stopping time τ (τ , ∞) = ∪n [τ + 1/n, ∞) . τ + 1/n is trivially a predictable stopping time, hence the intervals [σ, ∞), where σ is a predictable stopping time, together with the sets {0}×F, F ∈ F0 , generate the predictable sets P. Let I denote the set of random intervals [σ, τ ), where σ and τ are predictable stopping times. Using that the minima and the maxima of predictable stopping times are predictable stopping times, it is easy to see that I is a semi-algebra. Observe that if F ∈ F0 then 0 if ω ∈ F σ (ω) ∞ if ω ∈ /F is a predictable stopping time. If τ 0 then {0} × F = [σ, τ ] = ∩n [σ, τ + 1/n) that is {0} × F ∈ σ(I). This implies that P = σ(I). 2. Since (Ω, A, P) is complete, by the Measurable Selection Theorem24 there exists a measurable function f : Ω → [0, ∞] such that Graph (f ) ⊆ B
and
{f < ∞} = projΩ B.
On the product σ-algebra (R+ × Ω, B (R+ ) × A) let us define the set-function µ (E) P (projΩ (E ∩ Graph (f ))) . Since f is measurable the set Graph (f ) is product measurable. Hence the set after the operator projΩ is product measurable. As (Ω, A, P) is complete, by the Projection Theorem25 projΩ (E ∩ Graph (f )) ∈ A. 23 See:
Corollary 1.44, page 26. Theorem A.13, page 551. 25 See: Theorem A.12, page 550. 24 See:
PREDICTABLE PROJECTION
197
This implies that the definition of µ is correct. One should prove that µ is a measure. To show this it is sufficient to observe that if E1 ∩ E2 = ∅ then26 projΩ (E1 ∩ Graph (f ))
projΩ (E2 ∩ Graph (f )) = ∅.
(3.5)
3. Consider the algebra H generated by I. As we have remarked P = σ (H). By the assumption of the theorem B ∈ P and, as P = σ (H), of course B ∈ σ (H). Obviously µ is a finite measure. Hence from the uniqueness of the extension of finite measures from an algebra to the generated σ-algebra and from the construction of the extended measure, µ (B) µ∗ (B) , there is a C ⊆ B, where C = ∩n Hn , Hn ∈ H such that P (projΩ B) µ (B) ≤ µ (C) + ε. Therefore it is sufficient to prove that there is a predictable stopping time σ for which almost surely Graph (σ) ⊆ C. 4. Consider the d´ebut of C: τ C (ω) inf {t : (t, ω) ∈ C} . Random intervals are progressively measurable and therefore C is progressively measurable. Hence τ C is a stopping time27 . We should show that τ C is a predictable stopping time and for almost all ω if τ C (ω) < ∞ then (τ C (ω) , ω) ∈ C. 5. Assume first that C [σ, ρ) ∈ I. If D {σ < ρ} then τ C (ω) = σ D (ω)
σ (ω) if ω ∈ D = ∞ if ω ∈ /D
σ (ω) if σ (ω) < ρ (ω) . ∞ if ρ (ω) ≤ σ (ω)
Obviously τ C (ω) < ∞ if and only if (τ C (ω) , ω) ∈ C. By the definition of I the stopping times σ and ρ are predictable. Therefore28 D {σ < ρ} ∈ Fσ− . As σ is predictable σ D is also a predictable stopping time. Therefore if C ∈ I the theorem holds. 26 If the intersection were not empty and x was in the intersection then (x, y) ∈ Graph (f ) if and only if y = f (x) so (x, f (x)) ∈ E1 ∩ E2 = ∅. The σ-additivity of µ is obvious as for an arbitrary mapping F (∪n An ) = ∪n F (An ). 27 See: Theorem 1.28, page 15. 28 See: Proposition 3.17, page 187.
198
THE STRUCTURE OF LOCAL MARTINGALES
6. Assume that the theorem is true for C1 , C2 , . . . , Cn and let C ∪ni=1 Ci . Obviously τ C = min τ Ci ∈ C. i
As the minimum of a finite number of predictable stopping times is a predictable stopping time, the theorem holds for C as well. This means that the theorem is valid if C ∈ H. 7. If C1 , C2 , . . . , Cn ∈ H and C ∩ni=1 Ci then τ C = max τ Ci ∈ C i
and, as the maximum of a finite number of predictable stopping times is a predictable stopping time, the theorem holds again. 8. Finally let Cn C and let assume that τ Cn is predictable and [τ Cn ] ⊆ Cn for all n. Let τ ess sup {σ : σ ≤ τ C , σ is a predictable stopping time} . By the usual construction of the essential supremum, given that the increasing limit of predictable stopping times is again a predictable stopping time, one can easily prove that τ is a predictable stopping time. Let Dn Cn ∩ [τ , ∞) and let τ Dn be the d´ebut of Dn . Obviously τ Dn = τ C n ∨ τ . τ is predictable, hence τ Dn is also predictable. As [τ Cn ] ⊆ Cn it is obvious that [τ Dn ] ⊆ Dn . As τ ≤ τ C C ⊆ Cn ∩ [τ C , ∞) ⊆ Cn ∩ [τ , ∞) Dn ⊆ Cn C. Hence C = ∩n Dn . Obviously τ Cn ≤ τ C so τ ≤ τ C n ∨ τ = τ Dn ≤ τ C . So, by the definition of τ a.s.
τ = τ Dn
for all n.
As [τ Dn ] ⊆ Dn if τ (ω) < ∞ then {(τ (ω) , ω)} ∈ ∩n Dn = C, a.s.
(3.6) a.s.
for almost all ω. This implies that τ ≥ τ C , so τ = τ C . The filtration is complete and τ is predictable so τ C is a predictable stopping time. By (3.6) (τ C (ω) , ω) ∈ C if τ C (ω) < ∞ for almost all ω.
PREDICTABLE PROJECTION
199
Corollary 3.34 A random variable τ is a predictable stopping time if and only if [τ ] [τ , τ ] = Graph (τ ) is a predictable set. Proof. If τ is a predictable stopping time and (τ n ) announces τ then Graph (τ ) = (∩n (τ n , τ ]) ∪ ({0} × {τ = 0}) , hence Graph (τ ) is a predictable set. 1. On the other hand let us assume that Graph (τ ) is predictable. Applying the predictable section theorem for Graph (τ ) one can find a predictable stopping time σ n for all n such that τ = σ n for the finite values of τ outside an event with probability smaller than 1/n. If τ n mink≤n σ k then τ n is a predictable stopping time and except on a measure-zero set τ n τ . Almost surely zero functions are stopping times, hence τ is a stopping time. But we should prove that τ is a predictable stopping time29 . (n)
2. Let (τ k ) be a finite announcing sequence for τ n . If d denotes the metric generating the topology of [0, ∞] then we can assume that for all k
(n) P d τ k , τ n > 2−k < 2−(k+n) . (n)
Introduce the stopping times ρk inf n τ k . Obviously ρk ≤ ρk+1 for every k (n) and ρk ≤ τ k ≤ τ n announces τ for every k. Let ρ limk ρk . If for some ω and for some k
(n) d τ k (ω) , τ (ω) ≤ 2−k , for all n then d (ρk (ω) , τ (ω)) ≤ 2−k . Therefore d (ρ (ω) , τ (ω)) ≤ 2−k . Therefore
(n)
P d (ρ, τ ) > 2−k ≤ P d τ k , τ > 2−k . n
If τ n is finite then τ n = τ , so
(n) (n) d τ k , τ > 2−k ⊆ d τ k , τ n > 2−k , 29 Remember that in general if τ τ and τ are predictable stopping times for all n then n n τ is not necessarily a predictable stopping time.
200
THE STRUCTURE OF LOCAL MARTINGALES
hence
(n)
P d τ k , τ n > 2−k ≤ 2−k . P d (ρ, τ ) > 2−k ≤ n a.s.
Therefore τ = ρ so τ is a predictable stopping time30 . We shall often use the following observation: Proposition 3.35 Every right-regular, predictable process is locally bounded. Proof. To simplify the notation we assume, that X (0) = 0. τ n inf {t : |X (t)| > n} , is a stopping time. X is regular, hence on every finite time-interval every trajectory of X is bounded so τ n ∞. Observe that X can have a jump at time τ n , so X is not necessarily bounded on the interval [0, τ n ]. As X is right-continuous |X (τ n )| ≥ n. Hence [τ n , τ n ] {(t, ω) : t = τ n (ω)} = [0, τ n ] ∩ {(t, ω) : |X (t, ω)| ≥ n} . X is predictable hence the set {|X| ≥ n} is predictable. So the graph of τ n is predictable. Hence by the just proved corollary τ n is a predictable stopping time. (n) (n) (n) If (σ m ) announces τ n then |X σm | ≤ n. For any n let us choose such a σ n σ m for which
P τ n − σ n ≥ 2−n ≤ 2−n . By the Borel–Cantelli lemma, outside of a measure-zero set, for all ω there exists an n0 (ω) such that if n ≥ n0 (ω) then σ n < τ n < σ n + 2−n . a.s.
This implies that σ n → ∞. If ρm max1≤k≤m σ k then almost surely ρm ∞. It is easy to see that X ρm is bounded for all m, so X is locally bounded. Example 3.36 The Poisson processes are not predictable
30 See: 31 See:
Proposition 3.11, page 184. Example 3.56, page 219.
31
.
PREDICTABLE PROJECTION
201
Let X be a Poisson process. Recall32 that τ 1 = inf {t : X (t) = 1} is not predictable, so [τ 1 ] is not a predictable set. As [τ 1 ] = [0, τ 1 ] ∩ {X ≥ 1} and [0, τ 1 ] is predictable {X ≥ 1} is not predictable. So X is not a predictable process. 3.1.6
Properties of the predictable projection
Later we shall prove that every product measurable process has a predictable projection. During the proof of the existence we shall need some properties of the operation, so we first summarize them. Proposition 3.37 (Properties of the predictable projection) Up to indistinguishability the predictable projection has the following properties: 1. If Y is predictable then p Y exists and p Y = Y . 2. If Y is a finite-valued predictable process and X has a finite predictable projection p X, then (Y X) also has a finite valued predictable projection p (Y X) and p
(Y · X) = Y · (p X) .
(3.7)
The identity (3.7) also holds if Y is non-negative and predictable, X is nonnegative and p X exists, or when Y is non-negative, predictable and finite, and p X exists. 3. The correspondence X → p X is increasing, that is if 0 ≤ X ≤ Y and p X and p Y are meaningful then 0 ≤ p X ≤ p Y . 4. If processes X and Y have finite predictable projection, then X + Y also has finite predictable projection and p
(X + Y ) = p X + p Y.
The additivity property also holds when X and Y are non-negative. 5. The correspondence X → p X is homogeneous, that is, if process X has a predictable projection and a is an arbitrary real number, then aX also has a predictable projection. If a ≥ 0 then p (aX) = a (p X). 6. The predictable projection satisfies the Monotone Convergence Theorem, that is, if 0 ≤ Xn X∞ and the processes Xn have predictable projections then the process X∞ also has a predictable projection and p
Xn (t, ω) p X∞ (t, ω)
for all t and for almost all ω. 32 See:
Example 3.7, page 183.
(3.8)
202
THE STRUCTURE OF LOCAL MARTINGALES σ
7. If σ is an arbitrary stopping time then p (X σ ) = (p X) on the random interval [0, σ]. 8. The predictable projection is localizable. If (σ n ) is a localizing sequence, p (X σn ) exists for all n and p (X σn ) = Y σn on the random intervals [0, σ n ], then p X exists and p X = Y . If p (X σn ) is well-defined or finite for all n then p X is also well-defined or finite. Proof. The proof is built on the analogous properties of the conditional expectation and on the uniqueness of the predictable projection. 1. If Y is predictable then Y + (τ ) and Y − (τ ) are Fτ − -measurable33 . If p Y exists then for every predictable stopping time τ , on the set {τ < ∞} p
0 (Y (τ ) | Fτ − ) E Y + (τ ) | Fτ − E Y − (τ ) | Fτ − = Y (τ ) = E = Y + (τ ) Y − (τ ) = Y (τ ) .
As the predictable projection is unique, p Y and Y are indistinguishable. Reading the line above in reverse order one can see that p Y exists. 2. If Y is predictable, then the stopped variable Yτ is Fτ − -measurable34 for every predictable stopping time τ . By the first assumption p X is finite hence on the set {τ < ∞} p
0 (X (τ ) | Fτ − ) = E (X (τ ) | Fτ − ) . X (τ ) = E
Multiplying the equation by Y (τ ) and using the analogous properties of the generalized conditional expectation Y (τ ) (p X (τ )) = Y (τ ) E (X (τ ) | Fτ − ) = E (Y (τ ) X (τ ) | Fτ − ) . As the predictable projection is unique, (p X) Y = p (XY ). If X and Y are non-negative, one can use the same argument, but instead of the generalized conditional expectation one should use the similar properties of the conditional expectation. To prove the last property it is sufficient to remark that if Y is non-negative and finite we can multiply the relation p
0 (X (τ ) | Fτ − ) = E X + (τ ) | Fτ − E X − (τ ) | Fτ − X (τ ) = E
by Y . 3. We have already proved this property35 . 33 See:
Proposition 3.15, page 186. Proposition 3.15, page 186. 35 See: Theorem 3.31, page 194. 34 See:
PREDICTABLE PROJECTION
203
4. By the definition of the predictable projection, for an arbitrary predictable stopping time τ since on the set {τ < ∞} p
a.s. 0 X (τ ) = E (X (τ ) | Fτ − ) ,
p
a.s. 0 Y (τ ) = E (Y (τ ) | Fτ − )
by the assumptions, predictable projections are finite or non-negative one 0 Using the additivity of the generalized conditional can write E instead of E. expectation (p X (τ ) + p Y (τ )) χ (τ < ∞) = = (E (X (τ ) | Fτ − ) + E (Y (τ ) | Fτ − )) χ (τ < ∞) = = (E (X (τ ) χ (τ < ∞) | Fτ − ) + E (Y (τ ) χ (τ < ∞) | Fτ − )) = = E ((X (τ ) + Y (τ )) χ (τ < ∞) | Fτ − ) = 0 (X (τ ) + Y (τ ) | Fτ − ) χ (τ < ∞) , =E hence p (X + Y ) exists and p (X + Y ) = p X + p Y . 5. The proof is analogous. 6. Assume that 0 ≤ Xn X∞ , and that p Xn exists for all n. For an arbitrary predictable stopping time τ on the set {τ < ∞} p
a.s.
Xn (τ ) = E (Xn (τ ) | Fτ − ) .
The limit Z lim inf n→∞ p Xn is predictable. By the monotonicity of the predictable projection limn→∞ p Xn (τ ) Z (τ ) exists for every trajectory except on a measure-zero set. The Monotone Convergence Theorem is true for the conditional expectation, hence if n → ∞, then a.s.
Z (τ ) = lim inf p Xn (τ ) = lim n→∞
=E
n→∞
p
a.s.
Xn (τ ) = lim E (Xn (τ ) | Fτ − ) = n→∞
lim Xn (τ ) | Fτ − E (X∞ (τ ) | Fτ − ) ,
n→∞
a.s.
so Z (τ ) = E (X∞ (τ ) | Fτ − ) , hence Z is the predictable projection of X∞ . σ 7. First of all let us remark that in general the relation p (X σ ) = (p X) is not σ true. As we shall prove36 , if L ∈ L then p L = L− and obviously (L− ) = (Lσ )− . To prove the property let us notice that χ ([0, σ]) is a predictable process so by 36 See:
Proposition 3.39, page 205.
204
THE STRUCTURE OF LOCAL MARTINGALES
the second property of the predictable projection just proved χ ([0, σ]) ·
p
(X σ ) =
p
(χ ([0, σ]) · X σ ) =
=
p
(χ ([0, σ]) · X) = σ
= χ ([0, σ]) · p X = χ ([0, σ]) · ( p X) . σ
that is p (X σ ) = ( p X) on the random interval [0, σ]. 8. Let τ be an arbitrary predictable stopping time. If (τ k ) announces τ then {τ ≤ σ n } = ∩k {τ k ≤ σ n } ∈ σ (∪k Fτ k ) ⊆ Fτ − . In a similar way as above 0 (X (τ ) | Fτ − ) = χ (τ ≤ σ n ) · E
(3.9)
0 (X (τ ) | Fτ − ) = = χ (τ ≤ σ n ) · E 2
0 (χ (τ ≤ σ n ) X (τ ) | Fτ − ) = = χ (τ ≤ σ n ) · E 0 (χ (τ ≤ σ n ) X σn (τ ) | Fτ − ) = = χ (τ ≤ σ n ) · E 0 (X σn (τ ) | Fτ − ) = = χ (τ ≤ σ n ) · E = χ (τ ≤ σ n ) · (p (X σn )) (τ ) = = χ (τ ≤ σ n ) · Y σn (τ ) . 0 (X (τ ) | Fτ − ) a.s. = Y (τ ) on the set {τ < ∞}. As σ n ∞, obviously E Y is a limit of predictable processes so it is predictable, hence the first part of the property holds. The second part of the property follows from (3.9). 3.1.7
Predictable projection of local martingales
Let us first prove some interesting results. Proposition 3.38 (Predictable Optional Sampling) If X is a uniformly integrable martingale and τ is a predictable stopping time then a.s.
X (τ −) = E (X (τ ) | Fτ − ) = E (X (∞) | Fτ − ) . Proof. If (τ n ) announces τ then by the Optional Sampling Theorem a.s.
X (τ n ) = E (X (τ ) | Fτ n ) = E (X (∞) | Fτ n ) .
(3.10)
PREDICTABLE PROJECTION
205
By the uniform integrability X (∞) ∈ L1 (Ω). Hence X (τ ) ∈ L1 (Ω). Every martingale has left-limits so lim X(τ n ) = X(τ −).
n→∞
As Fτ n Fτ − by L´evy’s martingale convergence theorem37 lim E (X (∞) | Fτ n ) = E (X (τ ) | Fτ − ) = E (X (∞) | Fτ − ) .
n→∞
Therefore (3.10) holds. Proposition 3.39 If L is a local martingale then L has a finite predictable projection p L and p
L (t) = L− (t) L (t−) .
Proof. L− is left-continuous therefore it is predictable. If L is a uniformly integrable martingale and τ is a predictable stopping time then by (3.10) a.s.
L− (τ ) = L (τ −) = E (L (τ ) | Fτ − ) that is by the definition of the predictable projection p L = L− . The general case is evident from the last property of the predictable projection. Corollary 3.40 A local martingale is predictable if and only if it is continuous. Proof. If L is continuous then L is predictable. The reverse implication follows from L+ = L = p L = L− . Corollary 3.41 If X is a special semimartingale then there is just one decomposition of the kind X = X (0) + V + L, V ∈ V, L ∈ L where V is predictable. This decomposition is called the canonical decomposition of X. Proof. If V1 + L1 = V2 + L2 then M V1 − V2 = L2 − L1 is a predictable local martingale, hence M is a continuous local martingale. On the other hand the a.s. trajectories of M have finite variation, so by Fisk’s theorem38 M = 0. The most important example of the predictable projection is the following. 37 See: 38 See:
Theorem 1.69, page 41. Theorem 2.11, page 117.
206
THE STRUCTURE OF LOCAL MARTINGALES
Corollary 3.42 If L is a local martingale and ∆L is the jump process of L then p
(∆L) = 0.
Proof. It is evident from the additivity of the predictable projection: p
(∆L) =
p
(L − L− ) = p L −
p
(L− ) =
= L− − L− = 0. 3.1.8
Existence of the predictable projection
Now we are ready to discuss the question of the existence of the predictable projection. Corollary 3.43 Let η be an integrable random variable and let M (t) E (η | Ft ) be the martingale generated by the random variable η. If X ≡ η then X has a predictable projection and p X = M− . Proof. As the usual conditions hold M (t) E (η | Ft ) has a right-regular version, hence M is a uniformly integrable martingale. If τ is a predictable stopping time then by the Predictable Optional Sampling Theorem on the set {τ < ∞} M (τ −) = E (M (∞) | Fτ − ) = = E (η | Fτ − ) E (X (τ ) | Fτ − ) , that is, X has a predictable projection and p X = M− . Proposition 3.44 (Existence of the predictable projection) Every product-measurable process X has a predictable projection. Proof. If η is an integrable random variable then as we have seen X ≡ η has a predictable projection. If I ∈ B (R+ ) then χI is predictable, hence p
(χI · X) = χI · p X,
that is, the processes of type X χI · η also have predictable projection. The processes of type χI · η form a π-system, which generate the set of productmeasurable processes. Denote by H the set of bounded processes X which have predictable projection. Observe that by the properties of the predictable projection, H is a λ-system: 1. The constant process 1 is predictable, hence trivially 1 ∈ H. 2. By the linearity of the predictable projection among the bounded processes H is a linear space. 3. By the Monotone Convergence Theorem for the predictable projection, H is a monotone class.
PREDICTABLE COMPENSATORS
207
By the Monotone Class Theorem H contains the set of processes generated by the π-system of the processes χI · η that is H contains the product-measurable bounded process. Again by the Monotone Convergence Theorem every nonnegative product-measurable process has a predictable projection. If X is a product-measurable process then the process p
X pX + pX −
satisfies (3.4) and therefore X has a predictable projection.
3.2
Predictable Compensators
Assume that X is some non-negative increasing process. That is assume that X describes some ‘unpredictable’ cumulative losses39 . Although the losses are ‘unpredictable’ one can still ask whether they are ‘insurable’, that is, whether there is an insurance contract which compensates for the losses of X. Under compensation we mean that there is some payments process P for which the net risk X − P is a local martingale40 . Of course, since the process X is ‘risky’, one cannot forecast the jumps of X, so to make the insurance contract fair one should pay the price of the compensator ‘before’ the jumps, so we are looking for a ‘predictable’ payment process P . The main result of this section is that if a rightcontinuous, increasing process X has locally integrable variation, then X has an increasing, right-continuous and locally integrable predictable compensator. This theorem is the ‘home edition’ of the ‘professional’ Doob–Meyer decomposition41 . 3.2.1
Predictable Radon–Nikodym Theorem
Before the proof of the existence of the compensator, we introduce some tools which we shall use during the proof. Let V ∈ V + . Since V is right-continuous and increasing, every trajectory V (ω) generates a σ-finite measure µ (ω) on R+ . Let us denote by G the set of possible events42 in Ω. If the process Y is measurable with respect to the product σ-algebra G B (R+ )×G then the trajectories Y (ω) are B (R+ )-measurable. Hence if Y (ω) ≥ 0 then the integrals 0
∞
Y (s, ω) dµ (s, ω)
∞
Y (s, ω) dV (s, ω)
(3.11)
0
are meaningful. Of course the value of the integral depends on ω. Let Y χ(s,t] χF for some F ∈ G. V is adapted hence V (s, ω), as a function of ω, is 39 Of
course in this paragraph we use the word ‘predictable’ in a colloquial sense. Definition 2.41, page 141. 41 See: Theorem 5.1, page 292. 42 Recall that symbol A is ambiguous. It denotes the set of events and the set of processes with integrable variation. To avoid confusion in the present subsection we shall use the symbol G for the events of Ω. 40 See:
208
THE STRUCTURE OF LOCAL MARTINGALES
G-measurable for all s and therefore the integral ∞ Y (s, ω) dV (s, ω) = χF · (V (t, ω) − V (s, ω)) 0
is also G-measurable. With the Monotone Class Theorem it is now easy to prove that (3.11) is G-measurable43 for every non-negative product-measurable processes Y . Hence the expression ∞ ∞ E Y dV Y (s, ω) dV (s, ω) dP (ω) 0
Ω
0
is meaningful for all non-negative product-measurable Y . Definition 3.45 For V ∈ V + let us define ∞ ∞ χB dV E χB (s, ω) dV (s, ω) , µV (B) E 0
B ∈ G.
0
If V ∈ A+ , It is easy to see that µV is a measure on the product σ-algebra G. + that is if V ∈ V and E (V (∞)) < ∞ then µV is finite. If V ∈ A+ loc then µV is σ-finite. Definition 3.46 If µ is a measure on the product σ-algebra G and for some V ∈ V+ µV (B) = µ (B) ,
B ∈ G
then we say that measure µ is generated by V . Definition 3.47 We say that the product-measurable set N is evanescent if its characteristic function is indistinguishable from the characteristic function of the empty set, that is outside an event with zero probability the trajectories of χN are zero44 . We say that Definition 3.48 Let µ be a measure on the product σ-algebra45 G. µ is absolutely continuous if µ (N ) = 0 for every evanescent set N . Proposition 3.49 (Generalized Radon–Nikodym Theorem) Let µ be a measure on G). (R+ × Ω, B(R+ ) × G) (Ω, 43 Observe that we cannot directly apply the classical Radon–Nikodym theorem. The present argument is exactly that which one should use during the proof of the Radon–Nikodym theorem. 44 It is contained in R × N for some N with P (N ) = 0. + 45 Recall that G denotes the set of events in Ω.
PREDICTABLE COMPENSATORS
209
There exists an A ∈ A+ loc for which µ (B) = µA (B) E
∞
χB dA ,
whenever B ∈ G
0
if and only if 1. µ ([0]) µ({0} × Ω) = 0. 2. µ ([0, t] × F ) is σ-finite for every t. 3. µ is absolutely continuous. If A, B ∈ V are two processes representing µ then A and B are indistinguishable. Proof. It is easy to see that the conditions are necessary. For example, if B is evanescent then, by definition, outside an event of zero probability the trajectories of χB are zero so, trivially, µA (B) = 0. Let us prove the sufficiency of the conditions. Let us define the measures ρt (H) µ ([0, t] × H) = µ ([0] × H) + µ ((0, t] × H) = = µ ((0, t] × H) ,
H ∈ G.
By the third assumption ρt is absolutely continuous with respect to P for every t. Hence the classical Radon–Nikodym derivative dρt /dP exists for all t. By the second condition dρt /dP is finite. Let At be a non-negative version of the a.s.
a.s.
derivative. Trivially A0 = 0 and if s ≤ t then As ≤ At . By this monotonicity a.s.
if tn t∞ then Atn A∗ . By the second assumption and by the Dominated Convergence Theorem µ ([0, t∞ ] × F ) = lim µ ([0, tn ] × F ) = n→∞ Atn dP = lim Atn dP A∗ dP. = lim n→∞
F
F n→∞
F
a.s.
Hence by the uniqueness of the Radon–Nikodym derivative A∗ = At∞ . Of course we have the usual problem: since the variables At are defined up to a measure-zero set we can unambiguously define the process t → At only on the rational numbers. To define A for all real numbers t ≥ 0 we use the definition At inf {Ar : t < r, r ∈ Q} . Since the filtration is right-continuous, At will be G-measurable for all t and it is easy to see that the trajectories of A are increasing and right-continuous. From the first condition it is obvious that A0 = 0 is possible, that is A ∈ V + . By the argument above At is a version of dρt /dP for all t. The processes of type χ ([0, t] × H) form a π-system generating the σ-algebra of product measurable
210
THE STRUCTURE OF LOCAL MARTINGALES
This π-system is contained in the λ-system of bounded functions for sets G. which ∞ f dA = f dµ f dµ. E R+ ×Ω
0
Ω
By the Monotone Class Theorem and by the Monotone Convergence Theorem for every B ∈ G ∞ χB dA = χB dµ = µ (B) . E R+ ×Ω
0
As µ is σ-finite, for every A there is just one µ associated with A. From the construction it is clear, that if B ∈ V + is another right-continuous representation of µ then B is a modification of A. As both A and B are right-continuous they are indistinguishable. The main non-trivial question is the following: when is the generalized Radon– Nikodym derivative A predictable? To answer the question we need the following simple observation: Lemma 3.50 Let F ⊆ G be two σ-algebras and let ξ ∈ L1 (Ω, G, P). Assume that F contains the measure-zero sets of G. If for all F ∈ G E (ξ · χF ) = E (ξ · E (χF | F))
(3.12)
then ξ is F-measurable. Proof. We prove that a.s 0 ξ E (ξ | F) = ξ.
If F ∈ G and h χF then by (3.12) E (ξ · h) E (ξ · χF ) = E (ξ · E (χF | F)) = = E (E (ξ · E (χF | F) | F)) = = E (E (ξ | F) · E (χF | F))
ξ · χF | F = E 0 ξ · E (χF | F) = E E 0
=E 0 ξ · χF E 0 ξ·h . As ξ ∈ L1 (Ω) by the usual simple density argument, using that every h ∈ L∞ (Ω, G, P) is almost surely a uniform limit of step functions the equation
E (ξ · h) = E 0 ξ·h
PREDICTABLE COMPENSATORS
211
can be extended to all h ∈ L∞ (Ω, G, P). Therefore if h sign(ξ − 0 ξ) then
E ξ − 0 ξ = E ξ − 0 ξ sign ξ − 0 ξ = 0. a.s. ξ. By the definition of the conditional expectation 0 ξ is Hence, as we said ξ = 0 F-measurable. F contains all the measure-zero sets of G and therefore ξ is also F-measurable.
Proposition 3.51 Assume that the measure µV is generated by a process V ∈ V + . Assume also that whenever p
X = pY
then
∞
X dV
E
µV (X) = µV (Y ) E
0
∞
Y dV
.
0
Then V is predictable. Proof. We divide the proof into several steps. 1. First we prove that V (τ ) is Fτ − -measurable for every predictable stopping time τ . By the lemma it is sufficient to prove that E (χH · V (τ )) = E (E (χH | Fτ − ) · V (τ )) ,
whenever H ∈ G,
which is the same as µV (χH · χ ([0, τ ])) = µV (E (χH | Fτ − ) · χ ([0, τ ])) . To prove this equation one should prove, by the assumption of the proposition, that the predictable projections of the two associated processes in the argument of µV are indistinguishable: p
(χH · χ ([0, τ ])) =
p
(E (χH | Fτ − ) · χ ([0, τ ])) .
Let M (t) E (χH | Ft ). By the Predictable Optional Sampling Theorem
τ (t) = M ((τ ∧ t) −) = E M (∞) | F(τ ∧t)− = M−
= E χH | F(τ ∧t)− = E E (χH | Fτ − ) | F(t∧τ )−
p
(E (χH | Fτ − )) (t ∧ τ ) ,
that is τ
τ = (p (E (χH | Fτ − ))) . M−
(3.13)
212
THE STRUCTURE OF LOCAL MARTINGALES
χ ([0, τ ]) is predictable and46 p
(χH · χ ([0, τ ])) =
p
p
(χH ) = M− hence47
(χH ) · χ ([0, τ ]) = M− · χ ([0, τ ]) = τ
τ · χ ([0, τ ]) = (p (E (χH | Fτ − ))) · χ ([0, τ ]) = = M−
=
p
(E (χH | Fτ − )) · χ ([0, τ ]) =
=
p
(E (χH | Fτ − ) · χ ([0, τ ])) ,
which is what we wanted in (3.13). Therefore V (τ ) is Fτ − -measurable. 2. Since V (τ ) is Fτ − -measurable, from the definition of the predictable projection on {τ < ∞} p
a.s.
a.s.
V (τ ) = E (V (τ ) | Fτ − ) = V (τ )
(3.14)
for every predictable stopping time τ . 3. As a special case we get that p V is a modification of V . As a next step V are indistinguishable. Let V = V c + V d , where V c is we prove that V and p d ∆V is the jump part of V . As V c and V d are noncontinuous and V negative and as the predictable projection for non-negative processes is additive:
p V = p V c + V d = p (V c ) + p V d = V c + p V d . Since V is regular, the jumps of V form a thin set and as V is right-regular one may write Vd = ∆V = ∆V (σ k ) χ ([σ k , ∞)) , k
where the σ k are either predictable or totally inaccessible48 . The terms in the sum are non-negative so by the Monotone Convergence Theorem for the predictable projection49
d p p V = (∆V (σ k ) χ ([σ k , ∞))) . k
If σ k is predictable, then χ ([σ k , ∞)) is predictable and by (3.14) in the previous point of the proof50 p
(∆V (σ k ) · χ ([σ k , ∞))) =
p
(∆V (σ k )) · χ ([σ k , ∞)) =
=
p
((V − V− ) (σ k )) · χ ([σ k , ∞)) =
= ∆V (σ k ) · χ ([σ k , ∞)) 46 See:
Corollary 3.43, page 206. (3.7), page 201. 48 See: Proposition 3.19, page 188. 49 See: (3.8), page 201. 50 See: (3.7), page 201. 47 See:
PREDICTABLE COMPENSATORS
213
almost surely. If σ k is totally inaccessible, then ∞ E (∆V (σ k )) = χ ([σ k ]) dV dP µV (χ ([σ k ])) . Ω
0 a.s.
Since σ k is totally inaccessible χ ([σ k ]) (τ ) = 0 for any predictable stopping time τ . So p χ ([σ k ]) = 0 = p 0. Hence by the assumption of the proposition E (∆V (σ k )) = 0. a.s.
As V is increasing, V (σ k ) = V (σ k −) , that is if σ k is totally inaccessible, then a.s. ∆V (σ k ) = 0. From this it is now obvious that V and the predictable process p V are indistinguishable. 4. As a final step it will be sufficient to prove that if X is a product measurable and indistinguishable from the zero process, then X is predictable. Let P (N ) = 0 and let X (ω) = 0 if ω ∈ / N . Let us first assume that X = χC , where C (t1 , t2 ] × A with A ⊆ N . As Ft is complete t if ω ∈ A σ t (ω) 0 if ω ∈ /A is a stopping time for all t. This implies that C {(t, ω) : t1 < t ≤ t2 , ω ∈ A} = = {(t, ω) : σ t1 (ω) < t ≤ σ t2 (ω)} (σ t1 , σ t2 ] ∈ P. From this, using that X is product measurable, the predictability of X is already immediate. 3.2.2
Predictable Compensator of locally integrable processes
Now we are ready to prove the ‘home edition’ of the Doob–Meyer decomposition: Theorem 3.52 (Existence of Predictable Compensators) If A ∈ A+ loc then which is unique up to indistinguishability there is a predictable process Ap ∈ A+ loc and which satisfies each of the following three equivalent properties51 : 1. A − Ap ∈ L. 51 The interpretation of these equivalent properties is the following. If A is a process of some cumulative losses then Ap is the cumulative insurance fee which one would have to pay to an insurance company to cover the risk in A. A − Ap ∈ L means that to make the contract fair the net gain of the insurance company should contain no systematic trend. By the second condition, whatever stopping strategy one of the parties follows, on average nobody gains. By the third condition, if H is the number of insurance contracts then on average the net payouts of the company is the same as the amount of fees paid by the clients. Of course one can decide about the number of contracts and about the size of the fee before the losses represented by A occur, so H and Ap should be predictable.
214
THE STRUCTURE OF LOCAL MARTINGALES
2. E (A (τ )) = E (Ap (τ )) for any stopping time52 τ . 3. For all non-negative, predictable processes H E
∞
HdA
=E
∞
H dA
0
p
,
(3.15)
0
where the integrals on both sides are are pathwise Lebesgue–Stieltjes integrals. Proof. We divide the proof into several steps. 1. First we prove that the three conditions above are equivalent. Let A−Ap ∈ L and let (τ n ) be a joint localizing sequence of A, Ap and A−Ap . As the spaces A+ loc τ and L are closed under stopping one can find such a sequence. (A − Ap ) n ∈ M, hence by the Optional Sampling Theorem E (A (τ ∧ τ n )) = E (Ap (τ ∧ τ n )) . A and Ap are increasing processes by the definition of A+ loc , hence by the Monotone Convergence Theorem E (A (τ )) = E (Ap (τ )) . ∞ If H χ ([0, τ ]) and X ∈ V + arbitrary, then 0 HdX = X (τ ) , hence if H χ ([0, τ ]) then from the second condition the third one follows. If H is the characteristic function of some set {0} × F, F ∈ F0 then (3.15) obviously holds. The σ-algebra generated by the intervals [0, τ ] and by the sets {0} × F is the set of predictable processes, hence the general case follows from the Monotone Class Theorem and from the Monotone Convergence Theorem, since the processes of type χ ([0, τ ]) form a π-system53 , and the set of processes H satisfying (3.15) is trivially a λ-system. We can reverse the last argument so if the third condition holds, then E (A (θ)) = E
∞
χ ([0, θ]) dA 0
=E
∞
χ ([0, θ]) dA
p
= E (Ap (θ))
0
for any stopping time θ. Of course, it can happen that both expected values are infinite. If (τ n ) is a joint localizing sequence for A and Ap , then E (Aτ ∧τ n ) = E (Apτ ∧τ n ) for every stopping time τ , where by the localization the two expected τ values are finite. Hence (A − Ap ) n ∈ M, that is A − Ap is a local martingale. 52 Observe that since A and Ap are increasing A (∞) and Ap (∞) are well-defined although they can be +∞. 53 χ ([0, τ ]) χ ([0, σ]) = χ ([0, σ ∧ τ ]) and σ ∧ τ is also stopping time.
PREDICTABLE COMPENSATORS
215
2. We prove that Ap is unique. If Ap1 , Ap2 ∈ Aloc are predictable processes and A−Api are local martingales for indexes i = 1, 2, then Ap1 −Ap2 ∈ V is a predictable local martingale. As every predictable local martingale is continuous54 Ap1 −Ap2 ∈ V is a continuous local martingale. Hence by Fisk’s theorem55 Ap1 −Ap2 = Ap1 (0)− Ap2 (0) = 0. 3. Finally we prove the existence of Ap . Let µA be the measure generated by
∞ A, that is if X is a product measurable set then let µA (X) E 0 χ (X) dA . On the product measurable sets let us define the set function µ (X) µA ( χ (X)) E p
∞
p
χ (X) dA .
0
Observe that since p χ (X) is well-defined the set function µ is also well-defined. If X1 and X2 are disjoint then by the additivity of the predictable projection
∞
µ (X1 ∪ X2 ) µA (p χ (X1 ∪ X2 )) E
p
χ (X1 ∪ X2 ) dA
=
0
∞
=E
p
(χ (X1 ) + χ (X2 )) dA
=
0
=E
∞
p
∞
χ (X1 ) dA + E
0
p
χ (X2 ) dA
0
µA (p χ (X1 )) + µA (p χ (X2 )) µ (X1 ) + µ (X2 ) , so µ is additive. It is clear from the Monotone Convergence Theorem for the predictable projection that µ is σ-additive. Hence µ is a measure. A ∈ A+ loc therefore µA , hence µ is σ-finite. If X is evanescent, it is predictable56 , hence µ (X) µA (p χ (X)) = µA (χ (X)) E
∞
χ (X) dA 0
∞
0 dA
=E
= 0.
0
Hence µ is absolutely continuous. Therefore by the generalized Radon–Nikodym theorem there is an Ap ∈ A+ loc for which µ = µAp . That is for all predictable 54 See:
Corollary 3.40, page 205. Theorem 2.11. page 117. 56 See: step 4 in the proof of Proposition 3.51, page 211. 55 See:
216
THE STRUCTURE OF LOCAL MARTINGALES
sets X
∞
E
χ (X) dA
µ (X) = µAp (X) E
0
∞
χ (X) dA
p
.
0
From Proposition 3.51 it is clear that Ap is predictable. Hence Ap is the increasing, predictable compensator of A. Corollary 3.53 If A ∈ Aloc then there is a predictable process Ap ∈ Aloc for which A − Ap is a local martingale. If Ap1 and Ap2 are two such processes then Ap1 and Ap2 are indistinguishable. Proof. As A ∈ Aloc ⊆ V the process Var (A) is well-defined and Var (A) ∈ + A+ loc . By Jordan’s decomposition B (A + Var (A)) /2 ∈ Aloc and C + p p p (Var (A) − A) /2 ∈ Aloc . The process A B − C is predictable and A − Ap ∈ L. The proof of the uniqueness of Ap is the same as in the previous statement. Let us remark, that the condition A ∈ Aloc is in some sense necessary. If A ∈ V and there is an Ap ∈ V such that A − Ap ∈ L, then A − Ap ∈ L ∩ V, hence57 A − Ap ∈ Aloc . As Ap is predictable and right-regular it is locally bounded58 , so A ∈ Aloc . Example 3.54 Predictable compensator of compound Poisson processes.
Let X be a compound Poisson process. Assume that the expected value of the distribution of the jumps M is finite. If N is the Poisson process with parameter λ describing the number of the jumps of X then
E (X (t)) =
∞
E (X (t) | N (t) = k) P (N (t) = k) =
k=0
=
∞ k=0
k
kM
(λt) exp (−λt) = λtM. k!
X has independent increments, so it is very easy to see that X (t) − λM t is a martingale59 . The process λM t is continuous, hence it is predictable, so X p (t) = λM t. If the distribution of the jumps does not have an expected value then X ∈ / Aloc , hence X does not have a compensator. 57 See:
Proposition 3.4, page 181. Proposition 3.35, page 200. 59 Every process with independent increments and zero expected value is martingale. 58 See:
PREDICTABLE COMPENSATORS
3.2.3
217
Properties of the Predictable Compensator
Let us summarize the most important properties of Ap . Let us remark that if A ∈ Aloc and H is locally bounded then the frequently used condition H • A ∈ Aloc holds. 1. 2. 3. 4.
If A ∈ Aloc and A is predictable then 60 Ap = A. If A ∈ Aloc then A is a local martingale if and only if Ap = 0. p p (A + B) = Ap + B p , (cA) = cAp . If A ∈ A then Ap ∈ A and A − Ap ∈ M. p
p
± + Let A± 12 (A ± Var (A)). Ap (A+ ) − (A− ) . Obviously A
±∈ pA . By + ± p ± definition (A ) ∈ Aloc . But as for τ = ∞ E (A (τ )) = E (A ) (τ ) so p (A± ) ∈ A+ . Hence if A ∈ A then Ap ∈ A. Therefore A − Ap is in A. Hence A − Ap is a class D local martingale so A − Ap ∈ M. p τ 5. If A ∈ Aloc and τ is a stopping time then (Aτ ) = (Ap ) . p p τ τ p τ A−A ∈ L, hence (A − A ) = A −(A ) ∈ L. Truncated predictable processes p p τ are predictable61 hence, as (Aτ ) is unique, (Aτ ) = (Ap ) . 6. If A ∈ Aloc then
∆ (Ap ) =
p
(∆A) .
(3.16)
∆ (Ap ) Ap − Ap− is predictable hence62 p
(∆ (Ap )) = ∆ (Ap ) .
If L ∈ L then p (∆L) = 0 and as p (∆L) is a finite predictable projection by the linearity of the predictable projection63 0=
p
(∆L) =
p
(∆ (A − Ap )) =
=
p
(∆A) −
p
(∆ (Ap )) =
p
p
(∆A − ∆ (Ap )) =
(∆A) − ∆ (Ap ) ,
which is exactly (3.16). 7. If H is predictable, A ∈ Aloc and (H • A) (t) p
(H • A) = H • Ap .
t 0
HdA ∈ Aloc then (3.17)
The predictable compensator by definition is member of the space Aloc , hence under the present conditions H • Ap ∈ Aloc . 60 0
∈ L. Proposition 1.39, page 23. 62 See: Proposition 3.37, page 201. 63 See: Corollary 3.42, page 206. 61 See:
218
THE STRUCTURE OF LOCAL MARTINGALES
Let B − C be the Jordan decomposition of the integrator A. By the definition of the integral with respect to a signed measure H + • B ∈ A+ loc . The integrator + is predictable and if H χ ([0, τ ]), then the integral process B p ∈ A+ loc
H •B +
p
t
(t)
H + dB p = B p (τ ∧ t) − B p (0) = 0 p
τ
= B (τ ∧ t) = (B p ) (t) is predictable. The processes of type χ ([0, τ ]) form a π-system which generates the predictable sets. The set of bounded processes H for which H • B p is predictable is a λ-system. By the Monotone Class Theorem H • B p is predictable for every bounded predictable process H. By the Monotone Convergence Theorem H + • B p is predictable for every predictable, non-negative process H + . By + + p (3.15) if H + • B ∈ A+ loc , then H • B ∈ Aloc . If G is a non-negative, predictable process then by (3.15) ∞ ∞
E Gd H + • B GH + dB = =E 0
0
∞
=E
+
GH dB
p
=
0
=E
∞
Gd H + • B p ,
0
hence as H + • B p ∈ A+ loc and the process is predictable
H+ • B
p
= H + • Bp.
The general case is evident from the definition of the integration with respect to signed measure and from the additivity of the compensator operator64 . 8. If H predictable, A ∈ Aloc and H • A ∈ Aloc then the integral process H • (A − Ap ) is a local martingale. Indeed p
p
(H • (A − Ap )) = H • (A − Ap ) = p
= H • (Ap − (Ap ) ) = = H • 0 = 0. hence by 2. above H • (A − Ap ) ∈ L. us remark that by this property if H and A ∈ Aloc are predictable and 0t HdA ∈ Aloc , t then the integral process 0 HdA is predictable. For example, if A ∈ Aloc , H is locally bounded and A and H are predictable then the integral process 0t HdA is predictable. 64 Let
THE FUNDAMENTAL THEOREM OF LOCAL MARTINGALES
219
9. If H is predictable, V ∈ V ∩ L and H • V ∈ Aloc then the integral process H • V is a local martingale65 . By the assumptions66 V ∈ Aloc . By 7. and using that V ∈ L and hence V p = 0 p
(H • V ) = H • V p = H • 0 = 0, hence by 2. H • V ∈ L. Example 3.55 If the integrand is not predictable and the integrator is a discontinuous local martingale then it is possible that the stochastic integral is not a local martingale.
In the theory of stochastic integration it is very important, that if the integrand is predictable and locally bounded and the integrator is a local martingale then the integral is also a local martingale. By 9. it holds if the integrator is in V ∩ L. If the integrand is not predictable then the integral process is not necessarily a local martingale67 . Let L (t) π (t) − t be a compensated Poisson process. Let us denote by τ the time of the first jump of X. If H −χ (t < τ ) then the trajectories of H are right-regular. The process
t
χ (s < τ ) d (π (s) − s) = t ∧ τ
(H • L) (t) = − 0
is not a local martingale: The trajectories are continuous and increasing, hence if it is a local martingale then by Fisk’s theorem it is a constant, which is impossible as τ has an exponential distribution. Example 3.56 Right-regular, adapted process which is not predictable.
In the previous example χ (t < τ ) = χ ([0, τ )) is right-continuous and adapted, but it cannot be predictable by Property 8.
3.3
The Fundamental Theorem of Local Martingales
In the previous chapter we defined the semimartingales as processes X = X (0)+ 2 . In this chapter we said that X was a H + V where V ∈ V and H ∈ Hloc semimartingale if X = X (0) + L + V, where V ∈ V and L ∈ L. Now we are ready to prove that the two definitions are equivalent. 65 See:
Example 3.55, page 219. Proposition 3.4, page 181. 67 Intuitive if in a game one should not decide before the jumps of the gain process, then it is possible to make a systematic profit from the jumps. 66 See:
220
THE STRUCTURE OF LOCAL MARTINGALES
Theorem 3.57 (Fundamental Theorem of Local Martingales) Every local martingale L has a decomposition L = L (0) + L + L ,
L , L ∈ L,
2 where L ∈ Aloc and L is locally bounded, hence L ∈ Hloc .
Proof. To make the notation simple let us assume that L (0) = 0. Fix a b > 0 and let (ρn ) be a localizing sequence of L. The trajectories of L are regular, hence the number of jumps which have absolute value larger than b, the number of the ‘big jumps’, is finite on every finite interval. Hence one can define the process A consisting of the ‘big jumps’ of L: A
∆Lχ (|∆L| > b) .
Evidently the trajectories of A have finite variation on every finite interval. In the definition of A the jumps at t are in A (t), hence A is right-regular and adapted. Therefore A ∈ V. Let us introduce the stopping times τ n inf {t : Var (A) (t) > n} ∧ inf {t : |L (t)| > n} ∧ ρn . Obviously Var (A) (τ n ) ≤ n + |∆L (τ n )| ≤ ≤ n + |L (τ n )| + |L (τ n −)| ≤ ≤ 2n + |L (τ n )| . As Lρn is a uniformly integrable martingale L (τ n ) is integrable. Hence Var (A) (τ n ) is integrable, so A ∈ Aloc . As A ∈ Aloc we can take the compensator Ap of A. Let us define L A − Ap ∈ Aloc and let L L − L . By the definition of Ap the processes L and L are local martingales. We are going to show that the process U L − A is locally bounded. As U is right-continuous σ n inf {t : |U (t)| > n} , is a stopping time. By the definition of σ n obviously |U (σ n −)| ≤ n. The size of the jumps of U are bounded by b, so |U (σ n )| ≤ |U (σ n −)| + |∆U (σ n )| ≤ n + b,
THE FUNDAMENTAL THEOREM OF LOCAL MARTINGALES
221
hence U is really locally bounded. Ap is right-continuous and predictable, hence it is locally bounded68 , so L L − (A − Ap ) = U − Ap is also locally bounded. Example 3.58 The decomposition is not unique.
Let ξ be an integrable but not square-integrable random variable. If {∅, Ω} if t < 1 Ft A if t ≥ 1 then L (t) E (ξ | Ft ) =
E (ξ) if t < 1 ξ if t ≥ 1
2 . If ξ is symmetric then L ∈ L. If η is a martingale, which is not in Hloc ξχ (|ξ| ≤ 1) then
L (t) E (η | Ft )
E (η) = 0 if t < 1 η if t ≥ 1
is in L and it is bounded and L L − L has integrable variation. Observe that L 0, L L is also a good decomposition which shows that the decomposition is not unique. Corollary 3.59 Every local martingale L has an H1 -localization. Proof. Let L = L (0) + L + L be a decomposition guaranteed by the Funda1 . L ∈ Aloc ∩ L, and if mental Theorem. L is locally bounded, hence L ∈ Hloc (τ n ) is a localizing sequence then as τn
(L ) ≤ Var (L )τ n (∞) ∈ L1 (Ω) , 1 . trivially L ∈ Hloc
Corollary 3.60 If X is a local martingale and Y is a locally bounded predictable process, then the stochastic integral Y • X is well-defined and Y • X ∈ L. If Y is left-regular, then for any t the random variable (Y • X) (t) is the Itˆ o–Stieltjes t integral 0 Y dX of Y with respect to X. 68 See:
Proposition 3.35, page 200.
222
THE STRUCTURE OF LOCAL MARTINGALES
Proof. By the Fundamental Theorem X is a semimartingale in the sense of the previous chapter. Y is locally bounded hence Y • X is well-defined69 . One should only prove the relation Y • X ∈ L. If X = X(0) + V + H, where H ∈ 2 2 then Y • H ∈ Hloc ⊆ L. V ∈ L ∩ V, hence by the last property of the Hloc predictable compensator Y • V ∈ L. By definition Y • X = Y • H + Y • V so Y • X ∈ L.
3.4
Quadratic Variation
Perhaps the most important consequence of the Fundamental Theorem is the following: Corollary 3.61 If X and Y are arbitrary semimartingales70 then [X, Y ] exits and XY − X (0) Y (0) = X− • Y + Y− • X + [X, Y ] .
(3.18)
The jump process of the quadratic co-variation [X, Y ] is ∆ [X, Y ] = ∆X∆Y.
(3.19)
If X and Y are local martingales then XY − [X, Y ] is a local martingale and [X, Y ] is the only process from V for which XY − X (0) Y (0) − [X, Y ] is a local martingale and ∆ [X, Y ] = ∆X∆Y . Proof. By the Fundamental Theorem X and Y are semimartingales in the sense of the previous chapter. Recall that if X and Y are semimartingales in the sense of the previous chapter then the stochastic integrals X− • Y and Y− • X exist and (3.18) and (3.19) hold71 . If X and Y are local martingales then, as X− and Y− are locally bounded, X− • Y and Y− • X are local martingales. If XY − X (0) Y (0) − A ∈ L for some process A ∈ V and ∆ [X, Y ] = ∆A then [X, Y ] − A ∈ L ∩ V is continuous so by Fisk’s theorem [X, Y ] − A is constant. Theorem 3.62 (Fundamental Properties of the Quadratic Variation) If L is a local martingale then: 1. the quadratic variation [L] exits, 2. L2 − [L] is a local martingale, 3. it is a right-regular increasing process with 1/2
[L] 69 See
the discussion in 2.4.3. course by the new definition. 71 See: Proposition 2.92, page 178 70 Of
∈ A+ loc .
(3.20)
QUADRATIC VARIATION
223
Proof. Let (τ n ) be a localizing sequence of L. The existence and the rightregularity of [L] is obvious from the previous statements. For every n σ n inf {t : [L] (t) > n} ∧ inf {t : |L| (t) > n} ∧ τ n is a stopping time. As [L] and |L| are right-regular obviously σ n ∞. As L has limit from the left " " √ 1/2 [L] (σ n ) ≤ n + ∆ [L] (σ n ) ≤ n + ∆ [L] (σ n ) = √ = n + |∆L| (σ n ) ≤ √ ≤ n + |L (σ n )| + |L (σ n −)| ≤ √ ≤ n + |L (σ n )| + n. By the Optional Sampling Theorem the right-hand side is integrable hence 1/2 [L] ∈ A+ loc . Example 3.63 Process with finite quadratic variation which is not a semimartingale.
Let X be the right-regular step process over [0, 1) with X (1 − 1/n) ∞ n ∞ (−1) /n. Obviously Var (X) = n=1 1/n = ∞, but [X] = n=1 1/n2 < ∞. As every deterministic semimartingale has finite variation72 X cannot be a semimartingale. Proposition 3.64 (characterization of the locally square-integrable martingales) Let L ∈ L. The following statements are equivalent: 2 . 1. L ∈ Hloc + 2. [L] ∈ Aloc . 2 3. There is a predictable process in A+ loc , denoted by L, for which L − L is a local martingale. 2 4. sups≤t |L (s)| ∈ A+ loc .
Proof. We show that each statement implies the following one: 1. L (0) = 0, therefore L ∈ H2 if and only if E ([L] (∞)) is finite73 , hence L ∈ 2 if and only if there is a localizing sequence (τ n ) for which E ([Lτ n ] (∞)) < ∞ Hloc for all n. 2. By the elementary properties of the quadratic variation L2 − [L] ∈ L. As p p [L] ∈ A+ loc one can define L [L] and of course [L] − [L] [L] − L ∈ L. Hence L2 − L is a local martingale. 72 See: 73 See:
Theorem 7.83, page 524. Step 4. of the proof. Proposition 2.84, page 170.
224
THE STRUCTURE OF LOCAL MARTINGALES
3. By 3. in the proposition L2 − L ∈ L hence74 Y (t) sups≤t L2 − L + + ∈ A+ loc . L ∈ Aloc and it is increasing so Z (t) sups≤t |L| ∈ Aloc . Obviously 2 sups≤t |L (s)| ≤ Y (t) + Z (t) so 4. follows from 3. 2
4. If (τ n ) is a localizing sequence of U (t) sups≤t |L (s)| then
2 E Lτ n (t) ≤ E (U (τ n )) < ∞, 2 . hence L ∈ Hloc p
2 Corollary 3.65 If H ∈ Hloc then H = [H] . 2 then there is a predictable process with finite Corollary 3.66 If M, N ∈ Hloc variation on finite intervals denoted by M, N such that M N −M, N is a local martingale. p
M, N = [M, N ] . 2 Proof. As M + N, M − N ∈ Hloc
M, N =
1 (M + N − M − N ) . 4
2 Definition 3.67 If M, N ∈ Hloc then M, N is called the predictable quadratic 2 then M M, M is called the co-variation of M and N . If M ∈ Hloc predictable quadratic variation of M .
74 See:
Example 3.3, page 181.
4 GENERAL THEORY OF STOCHASTIC INTEGRATION In this chapter we discuss the general theory of stochastic integration. We shall assume that the integrators are semimartingales, but we shall not assume that the integrands are locally bounded. In the first part of the chapter we shall prove that every local martingale is the sum of a continuous and a purely discontinuous local martingale1 . One can think about purely discontinuous local martingales as sums of continuously compensated single jumps2 . The quadratic variation of a purely discontinuous local martingale is the sum of the squares of the jumps of the local martingale3 . This decomposition is unique, that is for every local martingale L there is just one continuous Lc ∈ L and one purely discontinuous local martingale Ld ∈ L for which L = L (0) + Lc + Ld . In the second part of the chapter we shall present the integration theory for general local martingales. Our starting point is the decomposition L = L (0) + Lc + Ld . By the second, chapter the integral is well-defined when the integrator is a continuous local martingale, so we need to present the integration theory only when the integrator is purely discontinuous.
4.1
Purely Discontinuous Local Martingales
d If some process V has finite variation then for every outcome the process V ∆V is absolutely convergent. Therefore it is finite, so one can easily define the decomposition
V = V − ∆V + ∆V V c + V d where V c is a continuous process with finite variation and V d is a pure jump process also with finite variation. The trajectories of local martingales are 1 See:
Definition 4.5, page 228. Proposition 4.30, page 243. 3 See: Theorem 4.33, page 244. 2 See:
225
226
GENERAL THEORY OF STOCHASTIC INTEGRATION
right-regular, hence one can easily define the jump process ∆L of a local martingale L. Unfortunately if L is a local martingale then the process
∆L (s) ∆L (t) s≤t
formed from the jumps of L is not necessarily finite4 and, which is more important, generally it is not a local martingale. For example, if L is a compensated Poisson process then the A ∆L is increasing. Hence it is not a local martingale. In which sense can one define the continuous and the discontinuous part of a local martingale? Assume that a sequence of stopping times (σ n ) covers the jumps of L. First let us define the process A1 ∆L (σ 1 ) χ ([σ 1 , ∞)) . A1 is the ‘first’ jump of L. Obviously5 1/2
|A1 | ≤ [L]
∈ Aloc .
Let L1 A1 − Ap1 be the compensated first jump of L. As we know ∆Ap1 = (∆A1 ). Arguing a bit heuristically6 as p (∆L) = 0 the jumps of the local martingales are unpredictable, hence p (∆A1 ) = 0 so ∆Ap1 = 0, that is Ap1 is continuous. Let L1 L − L1 . As L and L1 are local martingales L1 is also a local martingale. Since Ap1 is continuous we have deleted from L just the ‘first’ jump of L. Then let
p
A2 ∆L(σ 2 )χ ([σ 2 , ∞)) and L2 A2 − Ap2 , L2 L1 − L2 , etc. Of courseat the moment we do not know whether the sum of the compensated jumps n Ln is convergent or not. If Ld n Ln exists then it is reasonable to call Lc L − Ld the continuous part of L, and Ld the discontinuous part of L. If U is an arbitrary continuous local martingale then as the trajectories of Ln An − Apn have finite variation [U, Ln ] = 0 for all n. Hence by the integration by parts formula7 U Ln ∈ L. Assume that the compensators Apn are continuous and
(∆L (s))2 is finite as [L] < ∞. In some sense this is the executive summary of the theory of discontinuous local martingales. See also: (1.22) on page 38. 5 See: Proposition 3.62, page 222. 6 See: Proposition 4.28, page 240. 7 See: Corollary 3.61, page 222, Corollary 3.60, page 221. 4 But
PURELY DISCONTINUOUS LOCAL MARTINGALES
227
the jump times [σ i ] and [σ j ] are disjoint if i = j. In this case8 ' & [Li , Lj ] Ai − Api , Aj − Apj = [Ai , Aj ] = 0. Definition 4.1 (Strong orthogonality) We say that the local martingales M and N are strongly orthogonal if [M, N ] = 0. 4.1.1
Orthogonality of local martingales
Recall that if . / N, M ∈ H02 X ∈ H2 : X (0) = 0 and M and N are strongly orthogonal then N M = N M − [N, M ] is a uniformly integrable martingale9 . Therefore (N, M )H2 E (N (∞) M (∞)) = E (N (0) M (0)) = 0. This means that if N, M ∈ H02 and [N, M ] = 0 then N and M are orthogonal in the Hilbert space H02 . In view of these observations the next definition looks very promising: Definition 4.2 (Orthogonality) We say that the local martingales M and N are orthogonal if the product M N is a local martingale. Example 4.3 It is possible for some local martingales10 M and N to be orthogonal nevertheless [N, M ] = 0.
Let π be a Poisson process and let (τ n ) be the sequence of stopping times describing the jumps. Let (ξ n ) be a sequence of independent and identically distributed random variables which are independent of (τ n ). If E(ξ n ) = 0 for all n then the compound Poisson process M (t)
ξ n χ(τ n ≤ t)
n
is a martingale. If (η n ) is a similar sequence then N (t)
η n χ(τ n ≤ t)
n 8 See:
Example 2.26, page 129. Proposition 2.84, page 170. 10 Observe that M and N in the example are purely discontinuous. 9 See:
228
GENERAL THEORY OF STOCHASTIC INTEGRATION
is also a martingale. If the sequences (ξ n ) and (η n ) are independent and ζ n ξ n η n then E(ζ n ) E(η n ξ n ) = E(η n )E(ξ n ) = 0 therefore the compound Poisson process M N (t) =
n
ξ n η n χ(τ n ≤ t)
ζ n χ(τ n ≤ t)
n
is also a martingale so M and N are orthogonal. Obviously [M, N ] = M N = 0. Proposition 4.4 The local martingale L is orthogonal to itself if and only if up to indistinguishability L is a constant11 . Proof. By Proposition 2.48, L and L2 are local martingales if and only if L is a constant. Definition 4.5 A local martingale L is purely discontinuous if L (0) = 0, and L is orthogonal to every continuous local martingale. It is obvious from the definition that the purely discontinuous local martingales form a linear subspace of the local martingales. We show that in some sense it is the ‘orthocomplement’ of the subspace of the continuous local martingales. Corollary 4.6 If L is a continuous, purely discontinuous local martingale then L = 0. Proof. By the assumption of the proposition L is orthogonal to itself, hence L is constant. For every purely discontinuous local martingale by definition L (0) = 0, so L ≡ 0. Corollary 4.7 If M and N are purely discontinuous local martingales and ∆M = ∆N then M and N are indistinguishable Proof. L M − N is a purely discontinuous, continuous local martingale. Therefore L = 0. Proposition 4.8 Local martingales M and N are orthogonal if and only if [M, N ] is a local martingale. Proof. As M N −[M, N ] is always a local martingale12 M N is a local martingale if and only if [M, N ] ∈ L. 11 Of
course L is constant by time, that is L (t) = L (0) for all t. Corollary 3.61, page 222.
12 See:
PURELY DISCONTINUOUS LOCAL MARTINGALES
229
2 Example 4.9 Orthogonality in Hloc .
2 Recall13 that if M, N ∈ Hloc then [M, N ] ∈ Aloc and in this case one can p define the predictable quadratic co-variation M, N [M, N ] . If M and N are orthogonal then
M, N = (M, N − [M, N ]) + [M, N ] ∈ L. Hence M, N ∈ V ∩ L. As M, N is a predictable local martingale it is continuous14 , so by Fisk’s theorem p
M, N = M, N = 0. On the other hand if M, N = 0 then p
[M, N ] = [M, N ] − M, N = [M, N ] − [M, N ] ∈ L 2 so M and N are orthogonal. Hence we proved that if N, M ∈ Hloc then M and N are orthogonal if and only if M, N = 0.
Corollary 4.10 If M is continuous and N is purely discontinuous then [N, M ] = 0. N ∈ L is a purely discontinuous local martingale if and only if [M, N ] = 0 for every continuous local martingale M . Therefore N ∈ L is a purely discontinuous local martingale if and only if N is strongly orthogonal to every continuous local martingale M . Proof. As M is continuous ∆ [N, M ] = ∆M ∆N = 0. As M and N are orthogonal [N, M ] is a continuous local martingale which has finite variation so by Fisk’s theorem it is zero. The rest follows from this. Theorem 4.11 (Generalized Fisk’s theorem) If L ∈ V ∩ L then L is purely discontinuous. Proof. If L ∈ V then [M, L] = 0 for every continuous local martingale M . Hence 0 = [M, L] ∈ L, which means that M and L are strongly orthogonal. Therefore L is purely discontinuous. Example 4.12 If A ∈ Aloc , then L A − Ap ∈ L ∩ V is a purely discontinuous local martingale.
13 See: 14 See:
Corollary 3.66, page 224. Corollary 3.40, page 205.
230
GENERAL THEORY OF STOCHASTIC INTEGRATION
Proposition 4.13 (Orthogonality and localization) The orthogonality of local martingales has the following properties: 1. If τ and σ are stopping times, M and N are orthogonal local martingales, then the stopped processes M τ and N σ are also orthogonal. 2. If M and N are local martingales and (τ n ) is a localizing sequence of N, then M and N are orthogonal if and only if M and the stopped processes N τ n are orthogonal for all n. Proof. If N and M are orthogonal, then [M, N ] is a local martingale. σ∧τ [M τ , N σ ] = [M, N ] is also a local martingale, hence M τ and N σ are orthogτ τn are orthogonal, then [M, N τ n ] = [M, N ] n ∈ L for all n. onal. If M and N Obviously Lloc = L so [M, N ] ∈ L. Hence M and N are orthogonal. Every continuous local martingale is locally bounded hence: Corollary 4.14 If M is a local martingale then M is purely discontinuous if and only if one of the next statements holds: 1. M is orthogonal to every square-integrable continuous martingale. 2. M is orthogonal to every bounded continuous martingale. Recall that the space of square-integrable martingales H2 , is a Hilbert space with the scalar product (M, N ) (M, N )H2 E (M (∞) , N (∞)) ,
M, N ∈ H2 .
By Doob’s inequality if M ∈ H2 , then supt |M (t)| ∈ L2 (Ω) , hence |M N (t)| ≤ sup |M (t)| sup |N (t)| ∈ L1 (Ω) , t
t
so M N is in class D as it is dominated by an integrable variable. Proposition 4.15 (H2 -orthogonality) If M ∈ H2 and N ∈ H02 , then the following statements are equivalent: 1. M and N as local martingales are orthogonal. 2. [M, N ] is a uniformly integrable martingale. 3. (M τ , N )H2 = 0 that is M τ and N as elements of the Hilbert space H2 , are orthogonal for every stopping time τ . Proof. Recall that by definition N ∈ H02 , if N ∈ H2 and N (0) = 0.
PURELY DISCONTINUOUS LOCAL MARTINGALES
231
1. By the Kunita–Watanabe inequality15 " |[M, N ]| ≤ [M ] [N ]. As M, N ∈ H2 both16 [M ] = [M − M (0)] , [N ] ∈ A+ , therefore [M, N ] ∈ A, so [M, N ] has integrable variation. Hence it is a uniformly integrable local martingale, that is [M, N ] is a uniformly integrable martingale. 2. Assume that [M, N ] is a uniformly integrable martingale. In this case τ [M τ , N ] = [M, N ] is also a uniformly integrable martingale, so it is sufficient to prove, that if M ∈ H2 , N ∈ H02 and [M, N ] is a uniformly integrable martingale then (M, N )H2 = 0. As M, N ∈ H2 |M N (t)| ≤ sup |M (s)| sup |N (s)| ∈ L1 (Ω). s
s
This implies that M N −[M, N ] is a uniformly integrable martingale. As N (0) = 0 (M, N )H2 E (M N (∞)) = E (M N (∞)) − E ([M, N ] (0)) = = E (M N (∞)) − E ([M, N ] (∞)) = = E ((M N − [M, N ]) (∞)) = = E ((M N − [M, N ]) (0)) = E (M (0) N (0)) = 0, hence (M, N )H2 = 0. 3. Assume that the third condition holds. If τ is an arbitrary stopping time then by the Optional Sampling Theorem E (M (τ ) N (τ )) = E (M (τ ) E (N (∞) | Fτ )) = = E (E (M (τ ) N (∞) | Fτ )) = = E (M (τ ) N (∞)) = E (M τ (∞) N (∞)) = = (M τ , N )H2 = 0 hence M N is a martingale. Example 4.16 The assumption in the third property about all possible stoppings of M is important.
From the proof it is obvious that if M, N ∈ H02 are orthogonal as local martingales, then they are always orthogonal in the Hilbert space H02 . The reverse is not true. It is possible that M, N ∈ H02 , they are orthogonal in Hilbert space 15 See: 16 See:
(2.17), page 137. Proposition 2.84, page 170.
232
GENERAL THEORY OF STOCHASTIC INTEGRATION
sense, but they are not orthogonal as local martingales. Perhaps the simplest counterexample is the following: Let M ∈ H02 and let ξ be an F0 -measurable random variable with P(ξ = 1) = P(ξ = −1) = 1/2. Let us assume that ξ is independent of M . As ξ is F0 -measurable N ξM is also in H02 . Since ξ and M are independent (M, N )H2 E(M (∞)N (∞)) E(ξM 2 (∞)) = E(ξ)E(M 2 (∞)) = 0, hence M and N are orthogonal in H02 . On the other hand, unless M = 0, M N is not a martingale. As ξ is F0 -measurable E(M N (t) | F0 ) = ξE(M 2 (t) | F0 ) = 0 = M N (0). 4.1.2
Decomposition of local martingales
If Hc2 denotes the continuous elements of H2 then by Doob’s inequality Hc2 is a closed subspace of H2 . It is not too surprising that the following proposition holds: Proposition 4.17 If Hd2 denotes the set of purely discontinuous elements of H2 then Hd2 is the orthogonal complement of Hc2 . Proof. Let N ∈ Hd2 and M ∈ Hc2 . By the definition of purely discontinuous local martingales N (0) = 0. M and N are orthogonal local martingales hence by the previous proposition (M, N )H2 = 0. On the other hand let us assume that N ∈ H2 is orthogonal to the subspace Hc2 . The constant process M (t) N (0) is a continuous martingale, hence
E N 2 (0) = E (M (∞) N (0)) = E (M (∞) E (N (∞) | F0 )) = = E (M (∞) N (∞)) (M, N )H2 = 0, hence N (0) = 0. If M ∈ Hc2 , then M τ ∈ Hc2 for any stopping time τ , hence (M τ , N ) = 0. Again by the previous proposition N and M are orthogonal local martingales. By Corollary 4.14 N is purely discontinuous. Corollary 4.18 Every M ∈ H2 has a unique decomposition M = M (0) + M c + M d ,
where
M c ∈ Hc2 , M d ∈ Hd2 .
(4.1)
Theorem 4.19 (Continuous and purely discontinuous parts of local martingales) Every local martingale L has a decomposition L = L (0) + Lc + Ld ,
Lc , Ld ∈ L,
PURELY DISCONTINUOUS LOCAL MARTINGALES
233
where Lc is continuous, and Ld is purely discontinuous. If L = L (0) + Lc1 + Ld1 and L = L (0) + Lc2 + Ld2 are two such decompositions then Lc1 , Lc2 and also Ld1 , Ld2 are indistinguishable. Proof. If Lci , Ldi , i = 1, 2 are two decompositions of L then Lc1 − Lc2 = Ld2 − Ld1 , which means that Lc1 − Lc2 is purely discontinuous and continuous. Hence17 Lc1 − Lc2 = 0, so Ld2 − Ld1 = 0 as well. 1. Let us take the decomposition L = L (0) + L + L of the Fundamental 2 . L ∈ V, hence by the generalized Fisk’s theorem18 L is Theorem. L ∈ Hloc 2 purely discontinuous. We may therefore assume that L ∈ Hloc . 2 c 2. Let (τ n ) be a H -localizing sequence of L, and let Lk and Ldk be the (4.1) decomposition of Lτ k in H2 . Of course τ k+1 τ k
Lτ k = ((L)
)
τ k c τ k d τ k
= Lck+1 + Ldk+1 = Lk+1 + Lk+1 .
τ
Obviously Lck+1 k ∈ Hc2 . Ldk+1 is orthogonal to every continuous local marτ
tingale, hence Ldk+1 k is also orthogonal to every continuous local martin
τ gale19 , hence Ldk+1 k is purely discontinuous. As the decomposition (4.1) is unique
Ldk+1
τ k
= Ldk ,
Lck+1
τ k
= Lck ,
so τk
(Lc )
Lck
and
Ld
τ k
Ldk .
unambiguously defines the local martingales Lc and Ld 3. Lc is trivially a continuous local martingale. We show that Ld is purely discontinuous. To prove it, it is sufficient show that Ld is orthogonal to
d to τn τn 20 2 ∈ Hd2 , hence Ld and U are every continuous martingale U ∈ H . L d 21 orthogonal. Hence U and L are also orthogonal . Example 4.20 Purely discontinuous local martingale22 which is not in V. 17 See: 18 See: 19 See: 20 See: 21 See: 22 See:
Corollary 4.6, page 228. Corollary 4.11, page 229. Proposition 4.13, page 229. Corollary 4.14, page 230. Corollary 4.14, page 230. Example 7.35, page 484.
234
GENERAL THEORY OF STOCHASTIC INTEGRATION
Let (Ni ) be a sequence of independent Poisson processes with λ = 1. For any t the compensated Poisson processes Mi (t) Ni (t) − λt = Ni (t) − t on the finite time horizon [0, t] are in H02 . As they are independent they almost surely do not have common jumps23 . Obviously [Mi , Mj ] = ∆Mi ∆Mj , therefore if i = j then M i and Mj are orthogonal local martingales so they are orthogonal in H02 . As i 1/i2 < ∞ the sequence M
∞ 1 i=1
i
Mi
is convergent in the Hilbert space H02 . Every Mi is in V so they are purely discontinuous. Therefore M is also purely discontinuous. The variables Ni (t) − t are independent, they have zero expected value. So for any t the sequence Rn
n Ni (t) − t i=1
i
is a discrete-time martingale. Obviously (Rn ) is bounded in L2 (Ω) so by the Martingale Convergence Theorem it is convergent almost surely. As i 1/i = ∞ obviously Var (M ) (t) ≥
∆M (s) =
s≤t
4.1.3
∞ Ni (t) i=1
i
= ∞.
Decomposition of semimartingales
The decomposition theorem just proved can be transferred to semimartingales. Theorem 4.21 (Continuous part of semimartingales) If S ∈ S then there is a continuous local martingale Lc for which for any decomposition of S S = S (0) + V + L,
V ∈ V, L ∈ L
Lc is the continuous part of L. If Lc1 and Lc2 are two such local martingales then Lc1 and Lc2 are indistinguishable. Proof. One should prove only the uniqueness of Lc , the other part of the theorem is trivial. If S (0) + V1 + Lc1 + Ld1 = S (0) + V2 + Lc2 + Ld2 23 See:
Proposition 7.13, page 471.
LOCAL MARTINGALES AND COMPENSATED JUMPS
235
then Lc1 − Lc2 = V2 − V1 + Ld2 − Ld1 .
(4.2)
V2 − V1 ∈ V ∩ L, hence V2 − V1 is purely discontinuous24 , hence the right side of (4.2) is purely discontinuous, the left side is continuous, hence Lc1 − Lc2 = 0. Example 4.22 If S is a semimartingale then the continuous part of S as a ‘true semimartingale’, is not ‘well-defined’.
Let us take our usual counter-example, the Poisson process. If π is a Poisson process and π(t) = λt + (π(t) − λt) then the continuous part of the local martingale part L(t) (π(t) − λt) is zero. If π(t) = π(t) + 0 then the continuous part of the local martingale part L = 0 is again zero. In the first case the continuous part of the finite variation part V (t) = λt ∈ V is λt, but in the second case the continuous part of the finite variation part π ∈ V is zero. What is the continuous part of the semimartingale π? In Itˆ o’s formula25 we shall use the notation S c . Let us fix the definition of S c in the following way: Definition 4.23 If S is a semimartingale then S c denote the continuous part of the local martingale part of S. Example 4.24 If S π is a Poisson process then π c = 0.
4.2
Purely Discontinuous Local Martingales and Compensated Jumps
During the construction of stochastic integrals with respect to local martingales, we shall need the next inequality: Theorem 4.25 (Davis’ inequality) There are positive constants c and C such that for every local martingale L ∈ L and for any stopping time τ c·E 24 See:
"
"
[L] (τ ) ≤ E sup |L (t)| ≤ C · E [L] (τ ) . t≤τ
Theorem 4.11, page 229. precisely: In Itˆ o’s formula one uses only the quadratic variation of the continuous part of the semimartingales, which is independent of the decomposition. See: Corollary 4.36, page 246. 25 More
236
GENERAL THEORY OF STOCHASTIC INTEGRATION
The proof of the inequality is a lengthy calculation which we shall present at the end of this chapter as a separate section. The most important application of Davis’ inequality is the following theorem. Theorem 4.26 (Convergence of strongly orthogonal series) Let us assume that (Ln ) ⊆ L and if i = j then Li and Lj are strongly orthogonal, that is i = j.
[Li , Lj ] = 0,
"∞ + If n=1 [Ln ] ∈ Aloc then there is an L ∈ L such that on every compact interval in the topology of uniform convergence in probability L=
∞
Ln .
n=1
"∞ + then L is a uniformly integrable martingale and the If n=1 [Ln ] ∈ A convergence holds in the topology of uniform convergence in L1 (Ω) that is m lim E sup L (t) − Ln (t) = 0. m→∞ t
n=1
"∞
+ Proof. First let us assume that n=1 [Ln ] ∈ A . By Davis’ inequality and by the assumption [Li , Lj ] = 0 if m > n then
* m $ +# m + E sup Li (t) ≤ C · E , Li (∞) = t
i=n
i=n
* +m + = C · E , [Li ] (∞) . i=n
As
"∞ n=1
[Ln ] ∈ A+ by the Dominated Convergence Theorem * +m + [Li ] (∞) = 0, lim E ,
n,m→∞
i=n
which implies that m lim E sup Li (t) = 0. n,m→∞ t
i=n
LOCAL MARTINGALES AND COMPENSATED JUMPS
237
m As L1 (Ω) is complete supt | i=1 Li (t)| is convergent in L1 (Ω). From the convergence in L1 (Ω) one has a subsequence which is almost surely convergent, therefore there is a process L such that for almost all ω n k lim sup Li (t, ω) − L (t, ω) = 0. k→∞ t i=1
L is obviously right-regular and of course L1 (Ω), that is
n i=1
Li converges to L uniformly in
n lim E sup Li (t) − L (t) = 0. n→∞ t
i=1
Again by Davis’ inequality
1/2 E sup |Li (t)| ≤ C · E [Li ] (∞) < ∞, t
hence Li is a class D local martingale hence it is a martingale. From the ∞ convergence in L1 (Ω) it follows that L i=1 Li is also a martingale. n n Li (t) + E sup L − Li (t) < ∞ E sup |L (t)| ≤ E sup t t t
i=1
i=1
hence the limit L is in D that is L a uniformly integrable martingale. "∞ + Now let us assume that n=1 [Ln ] ∈ Aloc . In this case there is a localizing sequence (τ k ) for which * * * τ k +∞ +∞ +∞ + + + τ τ , [Lnk ] = , [Ln ] k = , [Ln ] ∈ A+ . n=1
n=1
n=1
" Observe that (τ k ) is a common localizing sequence for all Ln , that is [Lτnk ] ∈ A for all n. Observe also, that by Davis’ inequality Lτnk ∈ M for every n and k. By the first part of the proof forevery k there is an L(k) ∈ M such that
(k+1) ∞ τk τk (k) . Obviously L = L(k) , so one can define an L ∈ L for n=1 Ln = L τk (k) which L = L . Let us fix an ε and a δ. As τ k ∞ for every t < ∞ there is
238
GENERAL THEORY OF STOCHASTIC INTEGRATION
an n such that P (τ k ≤ t) ≤ δ/2 whenever k ≥ n. In the usual way, for k ≥ n n Lk (s) > ε ≤ P sup L(s) − s≤t k=1 n Lk (s) > ε, τ k > t . ≤ P (τ k ≤ t) + P sup L(s) − s≤t
k=1
The first probability is smaller than δ/2, the second probability is n τk τk P sup L (s) − Lk (s) > ε, τ k > t s≤t
k=1
which is smaller than n τk τk P sup L (s) − Lk (s) > ε . s
k=1
As Lτnk → Lτ k uniformly in L1 (Ω), by Markov’s inequality n τk τk Lk (s) > ε → 0, P sup L (s) − s
k=1
from which one can easily show that for n large enough n P sup L(s) − Lk (s) > ε < δ, s≤t
k=1
n ucp that is k=1 Lk → L, which means that on every compact interval in the topology of uniform convergence in probability
lim
n→∞
n
Lk
k=1
∞
Lk = L.
k=1
Theorem 4.27 (Parseval’s identity) Under the conditions of the theorem above for every t # lim
n→∞
L−
n k=1
$ Lk (t) = 0
(4.3)
LOCAL MARTINGALES AND COMPENSATED JUMPS
239
and a.s.
[L] (t) =
∞
[Lk ] (t)
(4.4)
k=1
where in both cases the convergence holds in probability. Proof. By Davis’ inequality * $ +# n m + 1 Lk (t) ≤ · E sup L (s) − Ln (s) . E , L − c s≤t n=1 k=1
If
"∞ n=1
[Ln ] ∈ A+ then by the theorem just proved m Ln (s) = 0. lim E sup L (s) − m→∞ s≤t
n=1
in probability, By Markov’s" inequality convergence in L1 (Ω) implies convergence "∞ ∞ + [L ] ∈ A then (4.3) holds. Let [L ] ∈ A+ therefore if n n n=1 n=1 loc and "∞ let (τ k ) be a localizing sequence of [L ]. Let us fix an ε and a δ. As n n=1 τ k ∞ for every t < ∞ there is a q such that P (τ k ≤ t) ≤ δ/2 whenever k ≥ q. In the usual way, for k ≥ q n P sup L(s) − Lk (s) > ε ≤ s≤t k=1 n Lk (s) > ε, τ k > t . ≤ P (τ k ≤ t) + P sup L(s) − s≤t
k=1
Obviously n Lk (s) > ε, τ k > t = P sup L(s) − s≤t k=1 n τk τk Lk (s) > ε, τ k > t ≤ = P sup L (s) − s≤t k=1 n τk τk Lk (s) > ε . ≤ P sup L (s) − s≤t
k=1
240
GENERAL THEORY OF STOCHASTIC INTEGRATION
By the stopping rule of the quadratic variation * * * τ k +∞ +∞ +∞ + + + τ τ , [Lnk ] = , [Ln ] k = , [Ln ] ∈ A+ , n=1
n=1
n=1
so by the first part of the proof if n is large enough n δ δ Lk (s) > ε ≤ + P sup L(s) − 2 2 s≤t k=1
that is (4.3) holds in the general case. By Kunita–Watanabe inequality26 *# $ * $ +# + n n + " + , [L] (t) − , Lk (t) ≤ Lk (t). L− k=1 k=1 This implies that # [L] (t) = lim
n→∞
∞
n
$ Lk (t) = lim
k=1
n→∞
n
[Lk ] (t)
k=1
[Lk ] (t)
k=1
where convergences hold in probability. 4.2.1
Construction of purely discontinuous local martingales
The cornerstone of the construction of the general stochastic integral is the next proposition: Proposition 4.28 Let H be a progressively measurable process. There is one and only one purely discontinuous local martingale L ∈ L for which ∆L = H if and only if 1. the set {H = 0} is thin, 2. p H = 0 and " 3. H 2 ∈ A+ loc . Proof. By the definition of the thin sets, for every ω there exists just a countable of points where the trajectory H (ω) is not zero. Hence the sum
number 2 H 2 (t) s≤t H (s) is meaningful. Observe that from the condition " + H 2 ∈ Aloc it implicitly follows that H (0) = 0. 26 See:
Corollary 2.36, page 137.
LOCAL MARTINGALES AND COMPENSATED JUMPS
241
1. The uniqueness of L is obvious, as if purely discontinuous local martingales have the same jumps then they are indistinguishable27 . 2 2. If H ∆L for some L ∈ L then p H p (∆L) = 0, and as (∆L) = ∆ [L] and [L] is increasing
H2 =
2
(∆L) ≤
2
c
(∆L) + [L] =
= [L] . " H 2 ∈ A+ [L] ∈ A+ loc obviously loc , so the conditions are necessary. " + 2 3. Let us assume that H ∈ Aloc and let us assume that the sequence of stopping times (ρm ) exhausting29 for the thin set {H = 0}. We can assume that ρm is either totally inaccessible or predictable. For every stopping time ρm let us define a simple jump processes which jumps at ρm and for which the value of the jump is H (ρm ):
Since28
"
Nm H (ρm ) χ ([ρm , ∞)) . It is worth emphasizing that it is possible that ∪m [ρm ] = {H = 0}. That is, the inclusion {H = 0} ⊆ ∪m [ρm ] can be proper, but ∪m {∆Nm = 0} = {H = 0} . Nm is right-regular, H is progressively measurable, hence the stopped variables " H 2 ∈ A+ H (ρm ) are Fρm -measurable and so Nm is adapted. As loc |Nm | ≤
)
H 2 ∈ A+ loc
for every m, hence Nm has locally integrable variation, so it has a compensator p . Nm p 4. We show that Nm is continuous. If ρm is predictable then the graph [ρm ] of ρm is a predictable set30 so using property 6. of the predictable 27 See:
Corollary 4.7, page 228. (3.20) line, page 222. 29 See: Proposition 3.22, page 189. 30 See: Corollary 3.34, page 199. 28 See:
242
GENERAL THEORY OF STOCHASTIC INTEGRATION
compensator31 up to indistinguishability p ∆ (Nm )=
p
(∆Nm )
p
(H (ρm ) χ ([ρm ])) =
p
(Hχ ([ρm ])) =
= (p H) χ ([ρm ]) = 0 · χ ([ρm ]) = 0. p Hence Nm is continuous. Let ρm be totally inaccessible. As above
p ∆ (Nm )=
p
(∆Nm ) =
p
(Hχ ([ρm ])) .
ρm is totally inaccessible and therefore P (ρm = σ) = 0 for every predictable stopping time σ, hence if σ is predictable then p
0 (Hχ ([ρ ]) (σ) | Fσ− ) = (Hχ ([ρm ])) (σ) E m 0 (0 | Fσ− ) = 0. =E
p By the definition of the predictable projection ∆ (Nm ) = 0. p 5. Let Lm Nm − Nm ∈ L be the compensated jumps. As the compensators are continuous and have finite variation if i = j then [Li , Lj ] = [Ni , Nj ] = 0, and
)
[Lk ] =
)
[Nk ] =
)
H 2 ∈ A+ loc .
Hence32 there is an L ∈ L for which L = k Lk . As the convergence is uniform in probability there is a sequence for which the convergence is almost surely uniform. Hence up to indistinguishability ∆L = ∆
Lk = ∆Lk = H.
Observe that in the last step we have used the fact that {H = 0} = ∪m {∆Nm = 0} = ∪m {∆Lm = 0} . 6. Let us prove that L is purely discontinuous. Let M be a continuous local martingale. Obviously [Lk , M ] = 0. Therefore by the inequality of Kunita and 31 See: 32 See:
page 217. Theorem 4.26, page 236.
LOCAL MARTINGALES AND COMPENSATED JUMPS
243
Watanabe33 and by (4.3) # $ # $ n n Lk + M, Lk = |[M, L]| ≤ M, L − k=1 k=1 * # $ $ +# n n " + , = M, L − Lk ≤ [M ] Lk → 0 L− k=1
k=1
which implies that [M, L] = 0, that is M and L are orthogonal. Hence L is purely discontinuous. Definition 4.29 The following definitions are useful: 1. We say that process X is a single jump if there is a stopping time ρ and an Fρ -measurable random variable ξ such that X = ξχ ([ρ, ∞)). 2. We say that process X is a compensated single jump if there is a single jump Y for which X = Y − Y p . 3. We say that the X is a continuously compensated single jump if Y p in 2. is continuous. Proposition 4.30 (The structure of purely discontinuous local martingales) If L ∈ L is a purely discontinuous local martingale then in the topology of uniform convergence in probability on compact intervals L
∞
Lk ,
k=1
where for all k: 1. Lk ∈ L is a continuously compensated single jump, 2. the jumps of Lk are jumps of L. 3. If i = j then [Li , Lj ] = 0 that is Li and Lj are strongly orthogonal, 2
4. [Lk ] = (∆L (ρk )) χ ([ρk , ∞)), where ρk denotes the stopping time of Lk . & ' 5. If i = j then the graphs [ρi ] and ρj are disjoint. " If [L] ∈ A+ then the convergence holds in the topology of uniform convergence in L1 (Ω). Proof. It is sufficient to remark, that if L ∈ L is purely discontinuous then the jump process of L satisfies the conditions of the above proposition34 . 33 See: 34 See:
Corollary 2.36, page 137. Proposition 4.28, page 240.
244
GENERAL THEORY OF STOCHASTIC INTEGRATION
4.2.2
Quadratic variation of purely discontinuous local martingales
In this subsection we return to the investigation of the quadratic variation. Definition 4.31 We say that M is a pure quadratic jump process if [M ] =
2
(∆M ) .
(4.5)
Example 4.32 Every V ∈ V is a pure quadratic jump process35 .
By (2.14) [V, V ] =
∆V ∆V =
2
(∆V ) .
Theorem 4.33 (Quadratic variation of purely discontinuous local martingales) A local martingale L ∈ L is a pure quadratic jump process if and only if it is purely discontinuous. Proof. Let L ∈ L. 1. If L is purely discontinuous, then by the structure of purely discontinuous local martingales36 L = k Lk , where [Lk , Lj ] =
0 if k = j . 2 (∆L (ρk )) χ ([ρk , ∞)) if k = j
By Parseval’s identity (4.4) for every t
a.s
[L] (t) =
∞
[Lk ] (t) =
2
(∆L) (s) .
s≤t
k=1
As both sides of the equation are right-regular [L] and indistinguishable. 2. If L is a pure quadratic jump process, then [L] = 35 See: 36 See:
Proposition 2.33, page 134. Proposition 4.30, page 243.
2
(∆L) .
s≤t
2
(∆L)
are
LOCAL MARTINGALES AND COMPENSATED JUMPS
245
Let L = Lc + Ld be the decomposition of L ∈ L. As Lc is continuous37 ' ' & ' & & [L] = Lc + Ld = [Lc ] + 2 Lc , Ld + Ld = & ' = [Lc ] + Ld . By the part of the theorem already proved 2 2 & d' 2 ∆Ld = ∆Ld + ∆Lc = (∆L) . L = Hence [Lc ] = 0, therefore Lc = 0 and so L = Ld . Corollary 4.34 If X is a purely discontinuous local martingale then for every local martingale Y [X, Y ] =
∆X∆Y.
(4.6)
Proof. Obviously & ' ' & [X, Y ] = X, Y c + Y d = [X, Y c ] + X, Y d . By the definition of the orthogonality [X, Y c ] is a local martingale. ∆ [X, Y c ] = ∆X∆Y c = 0, hence [X, Y c ] is continuous. [X, Y c ] ∈ V ∩ L so by Fisk’s theorem [X, Y c ] = 0. As the purely discontinuous local martingales form a linear space & ' 1 & ' & ' X +Yd − X −Yd = X, Y d = 4 2 2
1 ∆X + ∆Y d − ∆X − ∆Y d = = 4
∆X∆Y. ∆X ∆Y d + ∆Y c = = ∆X∆Y d =
Proposition 4.35 (Quadratic variation of semimartingales) For every semimartingale X [X] = [X c ] +
2
(∆X) ,
(4.7)
where, as before38 , X c denotes the continuous part of the local martingale part of X. More generally if X and Y are semimartingales then [X, Y ] = [X c , Y c ] + 37 See: 38 See:
Corollary 4.10, page 229. Definition 4.23, page 235.
∆X∆Y.
(4.8)
246
GENERAL THEORY OF STOCHASTIC INTEGRATION
Proof. Recall39 that every semimartingale X has a decomposition, X = X (0) + X c + H + V, where X c is a continuous local martingale, V ∈ V and H is a purely discontinuous local martingale. By simple calculation [X] = [X c ] + [V ] + [H] + + 2 [X c , H] + 2 [X c , V ] + 2 [H, V ] . As X c is continuous and V has finite variation so [X c , V ] = 0. H is purely discontinuous and X c is continuous, hence by (4.6) [X c , H] = 0. Therefore [X] = [X c ] + [V ] + [H] + 2 [H, V ] . Every process with finite variation is a pure quadratic jump process so [V ] =
2
(∆V ) .
H is purely discontinuous, hence it is also a pure quadratic jump process, so [H] =
2
(∆H) .
As V has finite variation so by (2.14) [H, V ] =
∆H∆V.
Therefore [V ] + [H] + 2 [H, V ] =
2
(∆H + ∆V ) =
2
(∆X) ,
so (4.7) holds. The proof of the general case is similar. c
Corollary 4.36 If X is a semimartingale then [X c ] = [X] . More generally if c X and Y are semimartingales then [X c , Y c ] = [X, Y ] .
4.3
Stochastic Integration With Respect To Local Martingales
Recall that so far we have defined the stochastic integral with respect to local martingales only when the integrator Y was locally square-integrable. In fact, in this case the construction of the stochastic integral is nearly the same as the construction when the integrator is a continuous local martingale. The only 39 See:
Theorem 4.19, page 232.
STOCHASTIC INTEGRATION WITH RESPECT TO LOCAL MARTINGALES
247
2 difference is that when Y ∈ Hloc then one can integrate only predictable processes and one has to consider the condition for the jumps of the integral ∆ (X • Y ) = 2 then a predictable process X is integrable X∆Y as well. Recall that if Y ∈ Hloc if and only if
/ . X ∈ L2loc (Y ) Z : Z 2 • [Y ] ∈ A+ loc . 2 In this case X • Y ∈ Hloc . Observe that the condition X ∈ L2loc (Y ) is very 2 if and only if40 [M ] ∈ A+ natural. If M is a local martingale then M ∈ Hloc loc . 2 2 As [X • Y ] = X • [Y ] , obviously X • Y ∈ Hloc if and only if X ∈ L2loc (Y ). As ∆ (X • Y ) = X∆Y , if Y is continuous then X • Y is also continuous. Let Y = Y (0) + Y c + Y d be the decomposition of Y into continuous and purely discontinuous local martingales. As [Y ] ∈ A+ loc and as
& ' [Y ] = [Y c ] + Y d
(4.9)
& ' c d it is obvious that [Y c ] , Y d ∈ A+ loc . This immediately implies that Y and Y are 2 2 2 c in Hloc . From (4.9) loc (Y ) if and only if X ∈ Lloc (Y ) it is also clear that X ∈ L d c d 2 and X ∈ Lloc Y . This implies that X • Y and X • Y exist and obviously X • Y = X • Y c + X • Y d. By the construction X • Y c is continuous. Observe that X • Y d is a purely discontinuous local martingale as for any continuous local martingale L ' & ' & X • Y d , L = X • Y d , L = X • 0 = 0, that is X • Y d is strongly orthogonal to every continuous local martingale. The goal of this section is to extend the integration to the case when the integrator is an arbitrary local martingale. To do this one should define the stochastic integral for every purely discontinuous local martingale. Extending the integration to purely discontinuous local martingales from the integration procedure we expect the following properties: 1. If L ∈ L is purely discontinuous then X • L ∈ L should be also purely discontinuous. 2. Purely discontinuous local martingales are uniquely determined by their jumps41 , hence it is sufficient to prescribe the jumps of X • L: it is very natural to ask that the formula ∆ (X • L) = X∆L should hold. 40 See: 41 See:
Proposition 3.64, page 223. Corollary 4.7, page 228.
248
GENERAL THEORY OF STOCHASTIC INTEGRATION 1/2
3. We have proved42 [L] ∈ A+ therefore if loc for any local martingale L, " X ) • L is a purely discontinuous local martingale then the expression [X • L] = 2 (X∆L) should have locally integrable variation. 4. If L ∈ L then p (∆L) = 0. By the jump condition, if X is predictable then p
(∆ (X • L)) =
p
(X · ∆L) = X · (p (∆L)) = X · 0 = 0
from which one can expect that one can guarantee only for predictable integrands X that X • L ∈ L and ∆ (X • L) = X∆L. 4.3.1
Definition of stochastic integration
Assume, that L ∈ L is a purely discontinuous local martingale. As L is a local martingale p (∆L) is finite and p (∆L) = 0. If H is a predictable real valued process then as p (∆L) is finite43 p
(H∆L) = H (p (∆L)) = 0,
hence if )
2
H 2 (∆L) ∈ A+ loc ,
then there is one and only one purely discontinuous local martingale44 , denoted by H • L, for which ∆ (H • L) = H∆L. If one expects the properties H∆L = ∆ (H • L)
and
d
(H • L) = H • Ld
from the stochastic integral H • L then this definition is the only possible one for H • L. Definition 4.37 If L is a purely discontinuous local martingale then H • L is the stochastic integral of H with respect to L. Definition 4.38 If L = L " (0) + Lc + Ld is a local martingale and H is a predictable process for which H 2 • [L] ∈ A+ loc then H • L H • Lc + H • Ld . H • L is the stochastic integral of H with respect to L. 42 See:
(3.20), page 222. Proposition 3.37. page 201. 44 See: Proposition 4.28, page 240. 43 See:
STOCHASTIC INTEGRATION WITH RESPECT TO LOCAL MARTINGALES
249
Example 4.39 If X ∈ V is predictable45 and L is a local martingale then ∆X • L = ∆X∆L.
1. The trajectories of L are right-regular, therefore they are bounded on finite intervals46 . As X ∈ V obviously ∆L • X exists and ∆X∆L = ∆L • X. X is predictable and right-regular, therefore it is locally bounded47 . As Var (X) is also predictable and it is also right-regular it is also locally bounded. 2. |∆X| ≤ Var (X), which implies that ∆X • L is well-defined. Let L = L (0) + Lc + Ld be the decomposition of L. For any local martingale N ∆X • [Lc , N ] = 0 hence ∆X • Lc = 0. Therefore one can assume that L is purely discontinuous. ) ) 2 2 |∆X∆L| ≤ ∆X∆L ≤ (∆X) (∆L) ≤ " " ≤ [X] [L] < ∞. Obviously ∆ ( ∆X∆L) = ∆X∆L. As ∆X∆L has finite variation, so if it is a local martingale thenit is a purely discontinuous local martingale. Therefore we should prove that ∆X∆L is a local martingale. Hence we should prove that ∆L • X is a local martingale. 3. With localization one can assume that X and Var (X) are bounded. As X and Var (X) are bounded ) " 2 |∆L| • Var (X) = |∆X| |∆L| ≤ (∆X) [L] ≤ " " ≤ sup |X| · Var (X) [L] ∈ A+ loc . Hence with further localization we can assume that ∆L•X ∈ A. If τ is a stopping time then E ((∆L • X) (τ )) = E ((∆L • X τ ) (∞)) . As X τ is also predictable48 one should prove that if ∆L • X ∈ A and X is predictable, then E ((∆L • X) (∞)) = 0. By Dellacherie’s formula49 , using that 45 If
X is not predictable then ∆X is also not predictable so ∆X • L is undefined. Proposition 1.6, page 5. 47 See: Proposition 3.35, page 200. 48 See: Proposition 1.39, page 23. 49 See: Proposition 5.9, page 301. 46 See:
250
GENERAL THEORY OF STOCHASTIC INTEGRATION
L is a local martingale hence p (∆L) = 0, E ((∆L • X) (∞)) = E ((p (∆L) • X) (∞)) = 0. That is ∆L • X = ∆X∆L is a local martingale. 4.3.2
Properties of stochastic integration
Let us discuss the properties of stochastic integration with respect to local martingales: " H 2 • [L] ∈ A+ 1. If loc then the definition is meaningful and H • L ∈ L. Specifically every locally bounded predictable process is integrable 50 . For any local martingale L 2 (∆L) . (4.10) [L] = [Lc ] + The integral H 2 • [Lc ] is finite, hence the integral H • Lc exists51 . By (4.10) ) ) ) 2 2 H 2 • [Ld ] = H 2 • (∆L) = (H∆L) ∈ Aloc , hence H • Ld is also meaningful. Both integrals are local martingales, hence the also a local martingale. The second observation sum H • L H • Lc + H • Ld is" easily follows from the relation [L] ∈ A+ loc . 2. H∆L = ∆ (H • L). c
d
3. (H • L) = H • Lc and (H • L) = H • Ld . 4. [H • L] = H 2 • [L]. c 2 [H • L] = [(H • L) ] + (∆ (H • L)) = & ' 2 = H 2 • [Lc ] + (H∆L) = H 2 • [Lc ] + H 2 • Ld = = H 2 • [L] . 5. H • L is the only process in L for which [H • L, N ] = H • [L, N ] holds for every N ∈ L. By the inequality of Kunita and Watanabe " " |H| • Var ([L, N ]) ≤ H 2 • [L] [N ] [M ] ∈ A+ loc for any local martingale M , hence the present construction of H • L is maximal in H, that is if one wants to extend the definition of the stochastic integral to a broader class of integrands H, then H • L will not necessarily be a local martingale. 51 See: Corollary 2.67, page 158. 50
STOCHASTIC INTEGRATION WITH RESPECT TO LOCAL MARTINGALES
251
hence the integral H • [L, N ] is meaningful. Therefore ( c d [H • L, N ] = [(H • L) , N c ] + (H • L) , N d = = [H • Lc , N c ] + H∆L∆N ' & = H • [Lc , N c ] + H • Ld , N d =
' & = H • [Lc , N c ] + Ld , N d = = H • [L, N ] . If H • [L, N ] = [Y, N ] for some local martingale Y , then [Y − H • L, N ] = 0. Hence if N Y − H • L then [Y − H • L] = 0. Y − H • L is a local martingale therefore52 Y − H • L = 0. 6. If τ is an arbitrary stopping time, and H • L exists then τ
H • Lτ = (H • L) = (χ ([0, τ ]) H) • L. If
" H 2 • [L] ∈ Aloc , then trivially " " H 2 • [Lτ ] = χ ([0, τ ]) H 2 • [L] ∈ Aloc
so the integrals above exists. By the stopping rule of the quadratic variation if N ∈L τ
τ
τ
τ
[(H • L) , N ] = [(H • L) , N ] = (H • [L, N ]) = H • [L, N ] = = H • [Lτ , N ] = [H • Lτ , N ] , hence by the bilinearity of the quadratic variation τ
[(H • L) − H • Lτ , N ] = 0, N ∈ L, from which τ
(H • L) = H • Lτ . For arbitrary N ∈ L τ
[H • Lτ , N ] = H • [Lτ , N ] = H • [L, N ] = = (χ ([0, τ ]) H) • [L, N ] = = [(χ ([0, τ ]) H) • L, N ] , hence again H • Lτ = (χ ([0, τ ]) H) • L from Property 5. 52 See:
Proposition 2.82, page 170.
252
GENERAL THEORY OF STOCHASTIC INTEGRATION
7. The integral is linear in the integrand. By elementary calculation ) ) ) 2 (H1 + H2 ) • [L] ≤ H12 • [L] + H22 • [L], hence if H1 • L and H2 • L exist then the integral (H1 + H2 ) • L also exists. When the integrator is continuous the integral is linear. The linearity of the purely discontinuous part is a simple consequence of the relation. (H1 + H2 ) ∆L = H1 ∆L + H2 ∆L. The proof of the homogeneity is analogous. 8. The integral is linear in the integrator. By the inequality of Kunita and Watanabe53 [L1 + L2 ] ≤ 2 ([L1 ] + [L2 ]) , hence if the integrals H • L1 and H • L2 exist then H • (L1 + L2 ) also exists. The decomposition of the local martingales into continuous and purely discontinuous c d martingales is unique so (L1 + L2 ) = Lc1 + Lc2 , and (L1 + L2 ) = Ld1 + Ld2 . For continuous local martingales we have already proved the linearity, the linearity of the purely discontinuous part is evident from the relation ∆ (L1 + L2 ) = ∆L1 + ∆L2 . 9. If H i ξ i χ ((τ i , τ i+1 ]) is an adapted simple process then (H • L) (t) =
ξ i (L (τ i+1 ∧ t) − L (τ i ∧ t)) .
(4.11)
i
By the linearity it is sufficient to calculate the integral just for one jump. For the continuous part we have already deduced the formula. For the discontinuous part it is sufficient to remark that if ξ i is Fτ i -measurable and L is a purely discontinuous local martingale then ξ i (L (τ i+1 ∧ t) − L (τ i ∧ t)) is a purely discontinuous local martingale54 , with jumps ξ i χ ((τ i , τ i+1 ]) ∆L. 10. Assume that the integral H • L exists. The integral K • (H • L) exists if and only if the integral (KH) • L exists. In this case (KH) • L = K • (H • L) . Let us remark that as the integrals are pathwise integrals with respect to processes with finite variation ) " 2 K 2 • (H 2 • [L]) = (KH) • [L]. 53 See: 54 The
Corollary 2.36, page 137. space of purely discontinuous local martingales is closed under stopping.
STOCHASTIC INTEGRATION WITH RESPECT TO LOCAL MARTINGALES
253
K • (H • L) exists if and only if ) " " 2 K 2 • [H • L] = K 2 • (H 2 • [L]) = (KH) • [L] ∈ A+ loc , from which the first part is evident. If N is an arbitrary local martingale then [K • (H • L) , N ] = K • [H • L, N ] = KH • [L, N ] = = [KH • L, N ] , from which the second part is evident. 11. If τ is an arbitrary stopping time then τ
H • Lτ = (χ ([0, τ ]) H) • L = (H • L) . If N is an arbitrary local martingale, then τ
[H • Lτ , N ] = H • [Lτ , N ] = H • [L, N ] = = Hχ ([0, τ ]) • [L, N ] = = [Hχ ([0, τ ]) • L, N ] = τ
τ
= (H • [L, N ]) = [H • L, N ] = τ
= [(H • L) , N ] , from which the property is evident. 12. The Dominated Convergence Theorem is valid, that is if (Hn ) is a sequence of predictable processes, Hn → H∞ and there is a predictable process H, for which the integral H • L exists and |Hn | ≤ H then the integrals Hn • L also exist and Hn • L → H∞ • L, where the convergence is uniform in probability on the compact time-intervals. As Hn2 • [L] ≤ H 2 • [L] for all n ≤ ∞ the integrals Hn • L exist. By Davis’ inequality, for every stopping time τ %
2 τ E sup |((Hn − H∞ ) • L ) (t)| ≤ C · E (Hn − H∞ ) • [L] (∞) .
τ
t
"
τ H 2 • [L] m (∞) < ∞, hence by There is a localizing sequence (τ m ), that E the classical Dominated Convergence Theorem E
) 2 τ (Hn − H∞ ) • [L] m (∞) → 0
254
GENERAL THEORY OF STOCHASTIC INTEGRATION
hence L
sup |((Hn − H∞ ) • Lτ m ) (t)| →1 0, t
from which as in the continuous case55 one can guarantee on every compact interval the uniform convergence in probability. 13. The definition of the integral is unambiguous that is if L ∈ V ∩ L then the two possible concepts of integration give the same result. It is trivial from Proposition 2.89. 14. If X is left-continuous and locally bounded then (X • L) (t) is an Itˆ o– Stieltjes integral for every t where the convergence of the approximating sums is uniform in probability on every compact interval. The approximating partitions can be random as well. The proof is the same as in the continuous case56 .
4.4
Stochastic Integration With Respect To Semimartingales
Recall the definition of stochastic integration with respect to semimartingales: Definition 4.40 If semimartingale X has a decomposition X = X (0) + L + V,
V ∈ V, L ∈ L
for which the integrals H • L and H • V exist then H • X H • L + H • V. By Proposition 2.89 the next statement is trivial57 : Proposition 4.41 For predictable integrands the definition is unambiguous, that is the integral is independent of the decomposition of the integrator. Proposition 4.42 If X and Y are arbitrary semimartingales and the integrals U • X and V • Y exist, then [U • X, V • Y ] = U V • [X, Y ] . Proof. Let XL + XV , and YL + YV be the decomposition of X and Y . [U • X, V • Y ] = [U • XL , V • YL ] + [U • XL , V • YV ] + + [U • XV , V • YL ] + [U • XV , V • YV ] . 55 See:
Proposition 2.74. page 162. Proposition 2.77, page 166. 57 See: Subsection 2.4.3, page 176. 56 See:
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
255
For integrals with respect to local martingales [U • XL , V • YL ] = U V • [XL , YL ] . In the three other expressions one factor has finite variation, hence the quadratic variation is the sum of the products of the jumps58 . For example [U • XL , V • YV ] =
∆ (U • XL ) ∆ (V • YV ) =
(U ∆XL ) (V ∆YV ) .
On the other hand for the same reason U V • [XL , YV ] = U V •
∆XL ∆YV
=
U V ∆XL ∆YV ,
hence [U • XL , V • YV ] = U V • [XL , YV ] . One can finish the proof with the same calculation for the other tags. Observe that the existence of the integral H • X means that for some decomposition X = X (0) + L + V one can define the integral and the existence of the integral does not mean that in every decomposition of X the two integrals are meaningful. Observe also that with the definition we extended the class of integrable processes even for local martingales. It is possible that the integral H • L as an integral with respect to the local martingale L does not exist, but L has a decomposition L = L (0) + M + V, M ∈ L, V ∈ V for which H is integrable with respect to M and V . Of course in this general case we cannot guarantee that59 H • L ∈ L. Example 4.43 If the integrand is not locally bounded then the stochastic integral with respect to a local martingales is not necessarily a local martingale.
Let M be a compound Poisson process, where P (ξ k = ±1) = 1/2 for the jumps ξ k . M is a martingale and the trajectories of M are not continuous. Let τ 1 be the time of the first jump of M and let X (t, ω) 58 See: 59 See:
line (2.14), page 134. Example 4.43, page 255.
1 · χ ((0, τ 1 (ω)]) . t
256
GENERAL THEORY OF STOCHASTIC INTEGRATION
X is predictable but it is not locally bounded. As the trajectories of M have finite variation the pathwise stochastic integral 1 χ ((0, τ 1 (ω)]) dM (s, ω) = L (t, ω) (X • M ) (t, ω) = (0,t] s 0 if t < τ 1 (ω) = ξ 1 (ω) /τ 1 (ω) if τ 1 (ω) ≤ t is meaningful. We prove that L is not a local martingale. If (ρk ) would be a localization of L then Lρ1 was a uniformly integrable martingale. Hence for the stopping time σ ρ1 ∧ t E (L (σ)) E (L (ρ1 ∧ t)) = E (Lρ1 (t)) = E (L (0)) = 0. Therefore it is sufficient to prove that for any finite stopping time σ = 0 E (|L (σ)|) = ∞.
(4.12)
Let σ be a finite stopping time with respect to the filtration F generated by M . 1 1 E (|L (σ)|) = χ (τ 1 ≤ σ) dP ≥ χ (τ 1 ≤ σ ∧ τ 1 ) dP. τ τ Ω 1 Ω 1 Hence to prove (4.12) one can assume that σ ≤ τ 1 . In this case σ is Fτ 1 measurable. Hence it is independent of the variables (ξ n ). So one can assume that σ is a stopping time for the filtration generated by the point process part of M . By the formula of the representation of stopping times of point processes60 σ = ϕ0 χ (σ < τ 1 ) +
∞
χ (τ n ≤ σ < τ n+1 ) ϕn (τ 0 , . . . , τ n )
n=1
∞
χ (τ n ≤ σ < τ n+1 ) ϕn (τ 0 , . . . , τ n ) =
n=0
= ϕ0 χ (σ < τ 1 ) + χ (σ ≥ τ 1 ) ϕ1 (τ 1 ) . From this {τ 1 ≤ ϕ0 } ⊆ {τ 1 ≤ σ}. If ϕ0 > 0 then using that τ 1 has an exponential distribution 1 1 E (|L (σ)|) = χ (τ 1 ≤ σ) dP ≥ χ (τ 1 ≤ ϕ0 ) dP = τ τ Ω 1 Ω 1 ϕ0 1 = λ exp (−λx) dx = ∞. x 0 60 See:
Proposition C.6, page 581.
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
257
σ = 0 and F0 = {∅, Ω}, therefore {σ ≤ 0} = ∅. Hence σ > 0, so if ϕ0 = 0 then σ ≥ τ 1 . Hence again 1 1 χ (τ 1 ≤ σ) dP = dP = ∞. E (|L (σ)|) = Ω τ1 Ω τ1 By the definition of the integral it is clear that if a process H is integrable with respect to semimartingales X1 and X2 then H is integrable with respect to aX1 + bX2 for every constants a, b and H • (aX1 + bX2 ) = a (H • X1 ) + b (H • X2 ) . Observe that by the above definitions the other additivity of the integral, that is the relation (H1 + H2 ) • X = H1 • X + H2 • X is not clear. Our direct goal in the following two subsections is to prove this additivity property of the integral. 4.4.1
Integration with respect to special semimartingales
Recall that by definition S is a special semimartingale if it has a decomposition S = S (0) + V + L,
V ∈ V, L ∈ L
(4.13)
where V is predictable. Theorem 4.44 (Characterization of special semimartingales) Let S be a semimartingale. The next statements are equivalent: 1. S is a special semimartingale, i.e. there is a decomposition (4.13) where V is predictable. 2. There is a decomposition (4.13), where V ∈ Aloc . 3. For all decompositions (4.13) V ∈ Aloc . 4. S ∗ (t) sups≤t |S (s) − S (0)| ∈ A+ loc . Proof. We prove the equivalence of the statements backwards. 1. Let us assume that the last statement holds, and let S = S (0) + V + L be a decomposition of S. Let L∗ (t) sups≤t |L (s)|. L∗ is in61 A+ loc , hence from the assumption of the fourth statement V ∗ (t) sup |V (s)| ≤ S ∗ (t) + L∗ (t) ∈ A+ loc . s≤t
61 See:
Example 3.3, page 181.
258
GENERAL THEORY OF STOCHASTIC INTEGRATION
The process Var (V )− is increasing and continuous from the left, hence it is locally bounded, hence Var (A)− ∈ A+ loc . As Var (V ) ≤ Var (V )− + ∆ (Var (V )) ≤ Var (V )− + 2V ∗ Var (V ) ∈ A+ loc , hence the third condition holds. 2. From the third condition the second one follows trivially. 3. If V ∈ Aloc in the decomposition S = S (0)+V +L, then V p , the predictable compensator of V , exists. V − V p is a local martingale, hence S = S (0) + V p + (V − V p + L) is a decomposition where V p ∈ V is predictable, so S is a special semimartingale. 4. Let us assume that S (0) = 0 so S = V + L. If V ∗ (t) sups≤t |V (s)|, then as V ∗ ≤ Var (V ) S ∗ ≤ V ∗ + L∗ ≤ Var (V ) + L∗ . L∗ ∈ A+ loc , so it is sufficient to prove that if V ∈ V is predictable then Var (V ) ∈ A+ loc . It is sufficient to prove that Var (V ) is locally bounded. V is continuous from the right, hence when one calculates Var (V ) it suffices to use the partitions with dyadic rationals and hence if V is predictable then Var (V ) is also predictable. Var (V ) is right-continuous and predictable hence it is locally bounded62 . Example 4.45 X ∈ V is a special semimartingale if and only if X ∈ Aloc . A compound Poisson process is a special semimartingale if and only if the expected value of the distribution of the jumps is finite.
The first remark is evident from the theorem. Recall, that a compound Poisson process has locally integrable variation if and only if the distribution of the jumps has finite expected value63 . Example 4.46 If a semimartingale S is locally bounded then S is a special semimartingale.
Example 4.47 If a semimartingale S has bounded jumps then S is a special semimartingale64 .
62 See:
Proposition 3.35, page 200. Example 3.2, page 180. 64 See: Proposition 1.152, page 107. 63 See:
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
259
Example 4.48 Decomposition of continuous semimartingales.
Recall that by definition S is a continuous semimartingale if S has a decomposition S = S (0) + V + L, where V ∈ V, L ∈ L and V and L are continuous65 . Let S now be a semimartingale and let us assume that S is continuous. As S is continuous it is locally bounded, so S is a special semimartingale. By the just proved proposition S has a decomposition S (0) + V + L, where V ∈ V is predictable and L ∈ L. As S is continuous L is also predictable, hence it is continuous66 . This implies that V is also continuous. This means that S is a continuous semimartingale. The stochastic integral X • Y is always a semimartingale. One can ask: when is it a special semimartingale? Theorem 4.49 (Integration with respect to special semimartingales) Let X be a special semimartingale. Assume that for a predictable process H the integral H • X exists. Let X X (0) + A + L be the canonical decomposition of X. H • X is a special semimartingale if and only if the integrals H • A and H • L exist and H • L is a local martingale. In this case the canonical decomposition of H • X is exactly H • A + H • L. Proof. Let us first remark that if U and W are predictable and W ∈ V and the integral U • W exists then it is predictable. This is obviously true if U χ ((s, t]) χF ,
F ∈ Fs
as67
U • W = χF W t − W s = (χF χ ((s, ∞))) W t − W s . The general case follows from the Monotone Class Theorem. Assume that the integral68 Z H •X H •V +H •M exists and it is a special semimartingale. Let Z B + N be the canonical decomposition of Z. B ∈ Aloc and B is predictable. χ (|H| ≤ n) is bounded and predictable, hence the integral χ (|H| ≤ n) • Z χ (|H| ≤ n) • B + χ (|H| ≤ n) • N 65 See:
Definition 2.18, page 124. 3.40, page 205. 67 See: Proposition 1.39, page 23. 68 With some decomposition X = X (0) + V + M. 66 See:
260
GENERAL THEORY OF STOCHASTIC INTEGRATION
exists. χ (|H| ≤ n) is bounded, B ∈ Aloc hence χ (|H| ≤ n) • B ∈ Aloc . As χ (|H| ≤ n) and B are predictable χ (|H| ≤ n) • B is also predictable. Let Hn Hχ (|H| ≤ n). Hn is bounded and predictable hence the integral Hn • X Hn • A + Hn • L is meaningful. Hn • A ∈ Aloc and Hn • A is predictable and Hn • L ∈ L so Hn • X is a special semimartingale and Hn • A + Hn • L its canonical decomposition. By the associativity rule of the integration with respect to local martingales and processes with finite variation, and by the linearity in the integrator χ (|H| ≤ n) • Z χ (|H| ≤ n) • (H • X) χ (|H| ≤ n) • (H • V + H • M ) = = χ (|H| ≤ n) • (H • V ) + χ (|H| ≤ n) • (H • M ) = = (χ (|H| ≤ n) H) • V + (χ (|H| ≤ n) H) • M (χ (|H| ≤ n) H) • X Hn • X = Hn • A + Hn • L. The canonical decomposition of special semimartingales is unique, hence χ (|H| ≤ n) • B = Hn • A,
χ (|H| ≤ n) • N = Hn • L.
As we have seen χ (|H| ≤ n) H 2 • [L] Hn2 • [L] = [Hn • L] = [χ (|H| ≤ n) • N ] = = χ (|H| ≤ n) • [N ] ≤ [N ] . " " [N ] ∈ A+ H 2 • [L] ∈ A+ loc , so by the Monotone Convergence Theorem loc and therefore the integral H • L ∈ L exists, and by the Dominated Convergence Theorem N = H • L. Similarly, H • A exists, it is in Aloc and H • A = B. If H and A are predictable then H • A is predictable hence the other implication is evident. Corollary 4.50 Let L be a local martingale and let us assume that the integral H • L exists. H • L is a local martingale if and only if sups≤t |(H • L) (s)| is locally integrable, that is sup |(H • L) (s)| ∈ A+ loc . s≤t
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
261
Proof. As sups≤t |M (s)| is locally integrable69 for every local martingale M ∈ L one should only prove that if sups≤t |(H • L) (s)| is locally integrable then H • L is a local martingale. X L is a special semimartingale with canonical decomposition X = L + 0. Hence H • L is a local martingale if and only if Y H • L is a special semimartingale. But as Y (0) = 0, the process Y is a special semimartingale70 if and only if sups≤t |Y (s)| ∈ A+ loc . 4.4.2
Linearity of the stochastic integral
The most important property of every integral is the linearity in the integrand. Now we are ready to prove this important property: Theorem 4.51 (Additivity of stochastic integration) Let X be an arbitrary semimartingale. If H1 and H2 are predictable processes and the integrals H1 • X and H2 • X exist, then for arbitrary constants a and b the integral (aH1 + bH2 ) • X exists and (aH1 + bH2 ) • X = a (H1 • X) + b (H2 • X) .
(4.14)
Proof. Let B {|∆X| > 1, |∆ (H1 • X)| > 1, |∆ (H2 • X)| > 1} be the set of the ‘big jumps’. Observe that ∆ (Hi • X) ∆ (Hi • Vi + Hi • Li ) = = ∆ (Hi • Vi ) + ∆ (Hi • Li ) = = Hi ∆Vi + Hi ∆Li = Hi ∆X, so B = {|∆X| > 1, |H1 ∆X| > 1, |H2 ∆X| > 1} . Obviously for an arbitrary ω the section B (ω) does not have an accumulation point. Let us separate the ‘big jumps’ from X. That is let X
∆XχB ,
X X − X.
∈ V and the integrals Hk • X Observe that, by the simple structure of B, X are simple sums, so they exist. By the construction of the stochastic integral 69 See: 70 See:
Example 3.3, page 181. Theorem 4.44, page 257.
262
GENERAL THEORY OF STOCHASTIC INTEGRATION
Hk • X also exists71 . As the jumps of the X are bounded, X is a special semimartingale72 .
= ∆ Hk • X = Hk ∆X = Hk ∆ X − X = Hk ∆XχB c , hence the jumps of Hk • X are also bounded and therefore the processes Hk • X are also special semimartingales. Let X = X (0) + A + L be the canonical decomposition of X. By the previous theorem integrals Hk • A and Hk • L also exist. The integration with respect to local martingales and with respect to processes with finite variation is additive, hence (H1 + H2 ) • A = H1 • A + H2 • A, (H1 + H2 ) • L = H1 • L + H2 • L, which of course means that the integrals on the left-hand side exist. The integrals are ordinary sums, hence Hk • X = H1 • X + H2 • X. (H1 + H2 ) • X Adding up these three lines above and using that the integral is additive in the integrator we get (4.14). The homogeneity of the integral is obvious by the definition of the integral. 4.4.3
The associativity rule
Like additivity, the associativity rule is also not directly evident from the definition of the stochastic integral. Theorem 4.52 (Associativity rule) Let X be an arbitrary semimartingale and let us assume that the integral H • X exists. The integral K • (H • X) exists if and only if the integral (KH) • X exists. In this case K • (H • X) = (KH) • X. • L ≤ H 2 • [L] and Var V ≤ Var (V )! 72 See: Example 4.47, page 258. 71 H 2
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
263
Proof. Assume that K is integrable with respect to the semimartingale Y H • X. Let B be again the set of the ‘big jumps’, that is B {|∆X| > 1, |∆Y | > 1, |∆ (K • Y )| > 1} . As in the previous subsection for every ω the section B (ω) is a discrete set. Let us define the processes X Y
χB ∆X,
X X − X,
χB ∆Y,
Y Y − Y .
Using the formula for the jumps of the integrals and the additivity of the integral in the integrator = H • X. Y Y − Y = H • X − H • X As the jumps of X are bounded, X is a special semimartingale. Let X = X (0) + A + L be the canonical decomposition of X. By the same reason Y is also a special semimartingale and as we saw above the canonical decomposition of Y is Y = H • X = H • A + H • L. The integral K • Y on any finite interval is a finite sum, hence if K • Y exists then K • Y also exists.
∆ K • Y = K∆Y = K∆Y χB c . The jumps of K • Y are bounded so K • Y is also a special semimartingale. Therefore the integrals K • (H • A) and K • (H • L) exist and K • (H • L) is a local martingale. By the associativity rule for local martingales and for processes with finite variation K • (H • A) = (KH) • A, K • (H • L) = (KH) • L.
264
GENERAL THEORY OF STOCHASTIC INTEGRATION
Adding up the corresponding lines K • Y = K • Y + K • Y =
= = K • (H • A + H • L) + K • H • X
= = (KH) • A + (HL) • L + (KH) • X = (KH) • X. = (KH) • X + (KH) • X The proof of the reverse implication is similar. Assume that the integrals Y H • X and (KH) • X exist, and let B {|∆X| > 1, |∆Y | > 1, |∆ ((KH) • X)| > 1} . In this case H •X =H •A+H •L (KH) • X = (KH) • A + (KH) • L = = K • (H • A) + K • (H • L) , is again a simple sum, therefore where of course the integrals exist. (KH) • X = (KH) • X = (KH) • X + (KH) • X
= = K • (H • A) + K • (H • L) + K • H • X
= =K • H •A+H •L+H •X
=K • H • A+L+X = K • (H • X) .
4.4.4
Change of measure
In this subsection we discuss the behaviour of the stochastic integral when we change the measure on the underlying probability space. Definition 4.53 Let P and Q be two probability measures on a measure space (Ω, A). Let us fix a filtration F. If Q is absolutely continuous with respect to P on the measure space (Ω, Ft ) for every t then we say that Q is locally absolutely continuous with respect to P. In this case we shall use the loc
notation Q P.
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
265
loc
If Q P then one can define the Radon–Nikodym derivatives Λ (t)
dQ (t) dP (t)
where Q (t) is the restriction of Q and P (t) is the restriction of P to Ft . If s < t and F ∈ Fs then dQ (t) Λ (t) dP dP = Q (t) (F ) = F dP (t) F dQ (s) dP Λ (s) dP. = Q (s) (F ) = F dP (s) F If filtration F satisfies the usual conditions then process Λ has a modification which is a martingale. As Λ (t) is defined up to a set with measure-zero one can assume that the Radon–Nikodym process Λ is a martingale. loc
Lemma 4.54 If Q P and σ is a bounded stopping time then Λ (σ) is the Radon–Nikodym derivative dQ/dP on the σ-algebra Fσ . If Λ is uniformly integrable then this is true for any stopping time σ. Proof. If σ is a bounded stopping time and σ ≤ t then by the Optional Sampling Theorem, since Λ is a martingale Λ (σ) = E (Λ (t) | Fσ ) . That is if F ∈ Fσ ⊆ Ft then Λ (σ) dP = Λ (t) dP = Q (t) (F ) = Q (F ) . F
F
As Λ is not always a uniformly integrable martingale73 the lemma is not valid a.s. for arbitrary stopping time σ. Since Λ is non-negative Λ (t) → Λ (∞) , where Λ (∞) ≥ 0 is an integrable74 variable. By Fatou’s lemma Λ (t) = E (Λ (N ) | Ft ) = lim inf E (Λ (N ) | Ft ) ≥ N →∞
≥ E lim inf Λ (N ) | Ft = E (Λ (∞) | Ft ) . N →∞
Hence the extended process is a non-negative, integrable supermartingale on [0, ∞]. By the Optional Sampling Theorem for Submartingales75 if σ ≤ τ are 73 See:
Example 6.34, page 384. Corollary 1.66, page 40. 75 See: Proposition 1.88, page 54. 74 See:
266
GENERAL THEORY OF STOCHASTIC INTEGRATION
arbitrary stopping times then Λ (σ) ≥ E (Λ (τ ) | Fσ ) .
(4.15)
Let us introduce the stopping time τ inf {t : Λ (t) = 0} . Let L be a local martingale and let U ∆L (τ ) χ ([τ , ∞)) . As L is a local martingale U ∈ Aloc . So U has a compensator U p . With this notation we have the following theorem: loc
Proposition 4.55 Let Q P. If Λ (t)
dQ (t) dP (t)
then Λ−1 is meaningful and right-regular76 under Q. If L is a local martingale under measure P then the integral Λ−1 • [L, Λ] has finite variation on compact intervals under Q and 0 L − Λ−1 • [L, Λ] + U p L is a local martingale77 under measure Q. Proof. We divide the proof into several steps. 1. First we show that Λ > 0 almost surely under Q. Let τ inf {t : Λ (t) = 0} . Λ is right-continuous so if τ (ω) < ∞ then Λ (τ (ω) , ω) = 0. If 0 ≤ q ∈ Q then τ + q ≥ τ . Hence by (4.15) Λ (τ ) χ (τ < ∞) ≥ χ (τ < ∞) · E (Λ (τ + q) | Fτ ) = = E (Λ (τ + q) χ (τ < ∞) | Fτ ) . Taking expected value 0 ≥ E (Λ (τ + q) χ (τ < ∞)) ≥ 0. 76 That
a.s.
is Λ−1 is almost surely finite and right-regular with respect to Q, that is Λ > 0 a.s with respect to Q. In this case Λ−1 = Λ under Q. See: (4.18). 77 More precisely L is indistinguishable from a local martingale under Q.
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
267
a.s.
Hence Λ (τ + q) = 0 on the set {τ < ∞} for any q ∈ Q. As Λ is right-continuous, outside a set with P-measure-zero if τ (ω) ≤ t < ∞ then Λ (t, ω) = 0. Q (t) ({Λ (t) = 0}) = {Λ(t)=0}
dQ (t) dP = dP
Λ (t) dP = 0, {Λ(t)=0}
so Λ (t) > 0 almost surely with respect to Q (t). Q (Λ (t) = 0 for some t) = Q (τ < ∞) = Q (∪n Λ (n) = 0) ≤ ≤
∞
Q (Λ (n) = 0) =
n=1
∞
Q (n) (Λ (n) = 0) = 0.
n=1
Hence Λ−1 is meaningful and Λ−1 > 0 almost surely under Q. We prove that Λ− is also almost surely positive with respect to Q. Let ρ inf {t : Λ− (t) = 0} , 1 ρn inf t : Λ (t) ≤ . n As Λ is right-regular Λ (ρn ) ≤ 1/n. Obviously on the set {ρ < ∞} lim Λ (ρn ) = Λ (ρ−) = 0.
n→∞
By (4.15) for any positive rational number q
Λ (ρn ) χ (ρn < ∞) ≥ E Λ (ρn + q) χ (ρn < ∞) | Fρn . Taking expected value 1 ≥ E (Λ (ρn + q) χ (ρn < ∞)) ≥ 0. n By Fatou’s lemma E (Λ ((ρ + q) −) χ (ρ < ∞)) = 0. Hence for every q ≥ 0 a.s
Λ ((ρ + q) −) χ (ρ < ∞) = 0.
(4.16)
268
GENERAL THEORY OF STOCHASTIC INTEGRATION
Hence outside a set with P-measure-zero if ρ (ω) ≤ t < ∞ then Λ− (t, ω) = 0. Hence if ρ (ω) < t < ∞ then Λ (t, ω) = 0. Therefore τ (ω) ≤ ρ (ω). Q (t) ({Λ− (t) = 0}) ≤ Q (t) ({ρ ≤ t}) = ≤
{ρ≤t}
Λ (t) dP ≤
Λ (t) dP = 0. {τ ≤t}
With the same argument as above one can easily prove that Q (Λ− (t) = 0 for some t) = 0. If for some ω the trajectory Λ (ω) and Λ− (ω) are positive then as Λ (ω) is right-regular Λ−1 (ω) is also right-regular. Therefore it is bounded on any finite interval78 . Hence if V ∈ V then Λ−1 • V is well-defined and Λ−1 • V ∈ V under Q. 2. Assume that for some right-regular, adapted process N the product N Λ is a local martingale under P. We show that N is a local martingale under Q. Let σ σ be a stopping time and let us assume that the truncated process (ΛN ) is a 79 martingale under P. If F ∈ Fσ∧t , and r ≥ t, then
N σ (t) dQ =
F
N σ (t) Λσ (t) dP = F
σ
=
σ
N σ (r) dQ.
N (r) Λ (r) dP = F
F
Hence N σ is a martingale under Q with respect to the filtration (Fσ∧t )t . We show that it is a martingale under Q with respect to the filtration F. Let ρ be a bounded stopping time under F. We show that τ ρ ∧ σ is a stopping time under (Fσ∧t )t . One should show that {ρ ∧ σ ≤ t} ∈ Fσ∧t . By definition this means that {ρ ∧ σ ≤ t} ∩ {σ ∧ t ≤ r} ∈ Fr . If t ≤ r then this is true as ρ ∧ σ and σ ∧ t are stopping times. If t > r then the set above is {σ ≤ r} ∈ Fr . By the Optional Sampling Theorem, using that τ ρ ∧ σ is a stopping time under (Fσ∧t )t and N σ is a Q-martingale under this filtration N σ (0) dQ = N σ (τ ) dQ = N σ (ρ) dQ. Ω 78 See: 79 See:
Proposition 1.6, page 5. Lemma 4.54, page 265.
Ω
Ω
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
269
This implies that N σ is a martingale under Q. Hence N is a local martingale under Q. 0 (0) = 0. Integrating by 3. To simplify the notation let L (0) = 0, from which L parts LΛ = L− • Λ + Λ− • L + [L, Λ] .
(4.17)
Λ and L are local martingales under P so the stochastic integrals on the righthand side are local martingales under P. Let
a
a−1 0
if a > 0 . if a = 0
(4.18)
and let A Λ • [L, Λ] .
(4.19)
A is almost surely finite under Q as Λ > 0 and Λ− are almost surely finite under Q. But we are now defining A under P and with positive probability Λ can be unbounded on some finite intervals under P. Hence we do not know that A is well-defined under P. To solve this problem let us observe that (ρn ) in (4.16) is 0 So it is sufficient to prove a localizing sequence under Q and one can localize L. ρ ρ 0 n that (L n ) = (L) is a local martingale under Q for every n. For Lρn (4.19) is well-defined. So one can assume that A is finite. Again integrating by parts, noting that Λ is right-continuous ΛA = A− • Λ + Λ− • A + [A, Λ] = = A− • Λ + Λ− • A + ∆A∆Λ = = A− • Λ + Λ− • A + ∆Λ • A = = A− • Λ + Λ • A = = A− • Λ + ΛΛ • [L, Λ] = = A− • Λ + χ (Λ > 0) • [L, Λ] . Finally80 p ΛU p = U− • Λ + Λ− • U p + [U p , Λ] = p = U− • Λ + Λ− • U p + ∆U p ∆Λ = p = U− • Λ + Λ− • U p + ∆U p • Λ = 80 See:
Example 4.39, page 249.
270
GENERAL THEORY OF STOCHASTIC INTEGRATION
= U p • Λ + Λ− • U p = = U p • Λ + Λ − • U p ± Λ− • U = = U p • Λ + Λ− • (U − U p ) + Λ− • U The stochastic integrals with respect to local martingales are local martingales, the sum of local martingales is a local martingale so 0 ΛL − ΛA + ΛU p = ΛL = local martingale + [L, Λ] − χ (Λ > 0) • [L, Λ] + Λ− • U. Observe that the last line is χ (Λ = 0) • [L, Λ] + Λ− • U = = χ (t ≥ τ ) • [L, Λ] + Λ− (τ ) ∆L (τ ) χ (t ≥ τ ) = = χ (t ≥ τ ) ∆L (τ ) ∆Λ (τ ) + Λ− (τ ) ∆L (τ ) χ (t ≥ τ ) = 0 0 is a local where we have used that [L, Λ] is constant81 on {t ≥ τ }. Hence ΛL 0 martingale under P. So by the second part of the proof L is a local martingale under Q. loc
loc
loc
Corollary 4.56 Let Q P and let P Q that is let assume that Q ∼ P. If Λ (t)
dQ (t) dP (t)
then Λ > 0. If L is a local martingale under measure P then the integral Λ−1 • [L, Λ] has finite variation on compact intervals under Q and 0 L − Λ−1 • [L, Λ] L is a local martingale under the measure Q. loc
Corollary 4.57 Let Q P. If Λ (t)
dQ (t) dP (t)
and L is a continuous local martingale under measure P then the integral Λ−1 • [L, Λ] has finite variation on compact intervals under measure Q and 0 L − Λ−1 • [L, Λ] L is a local martingale under the measure Q. 81 See:
Corollary 2.49, page 145.
STOCHASTIC INTEGRATION WITH RESPECT TO SEMIMARTINGALES
271
loc
If V ∈ V under P and Q P then obviously V ∈ V under Q. Hence the proof of the following observation is trivial: loc
Corollary 4.58 If X is a semimartingale under P and Q P then X is a semimartingale under Q. Let V ∈ V and assume that the integral H • V exists under measure P. By definition this means that the pathwise integrals (H • V ) (ω) exist almost surely loc
under P. If Q P then the integral H • V exists under the measure Q as well, and the value of the two processes are almost surely the same under Q. It is not too surprising that it is true for any semimartingale. Proposition 4.59 Let X be an arbitrary semimartingale and let H be a predictable process. Assume that the integral H • X exists under measure P. If loc
Q P then the integral H • X exists under measure Q as well, and the two integral processes are indistinguishable under measure Q. Proof. By the remark above it is obviously sufficient to prove the proposition if X ∈ L under P. It is also sufficient to prove that for every T > 0 the two integrals exist on the interval [0, T ] and they are almost surely equal. 1. Let X = X c + X d be the decomposition of X into continuous and purely discontinuous local martingales. As the time horizon is finite, Λ is a uniformly integrable martingale. Recall that if L is a local martingale under the measure P then L − Λ−1 • [L, Λ] + U p L
(4.20)
is a local martingale under measure Q and if L is continuous then U p can be dropped. X − Λ−1 • [X, Λ] + U p = X & ' = X c + X d − Λ−1 • X c + X d , Λ + U p = & '
= X c − Λ−1 • [X c , Λ] + X d − Λ−1 • X d , Λ + U p . By (4.20) the processes 1c X c − Λ−1 • [X c , Λ] X
1d X d − Λ−1 • &X d , Λ' + U p and X
are local martingales under measure Q. X c is continuous, hence the quadratic 1c is continuous. If W and V co-variation [X c , Λ] is also continuous82 . Hence X 82 See:
line (3.19), page 222.
272
GENERAL THEORY OF STOCHASTIC INTEGRATION
are pure quadratic jump processes then [W + V ] = [W ] + 2 [W, V ] + [V ] = 2 2 = (∆W ) + 2 ∆W ∆V + (∆V ) = 2 = (∆ (W + V )) hence W +V is also a pure quadratic jump process. Processes with finite variation 1d is a pure quadratic jump process are pure quadratic jump processes83 , hence X under P. Under the change of measure the quadratic variation does not change, 1d is a purely 1d is a pure quadratic jump process under Q. Hence X hence X exists discontinuous local martingale under Q. We want to show that H • X under Q. This means that H • X exist on (0, t] for every t. To prove this one 1d exist under Q. 1c and H • X need only prove that the integrals H • X c 1 is a continuous local martingale, hence H•X 1c exists under Q if and only 2. X (
1c <∞ =1. H•X exists under P therefore P H 2 • [X c ] <∞ =1. if Q H 2 • X As Λ−1 • [X c , Λ] is continuous by quick calculation 1c ] [X c − Λ−1 • [X c , Λ]] = [X c ] . [X Therefore
(
1c < ∞ = P H 2 • [X c ] < ∞ = 1, P H2 • X 1c ]=∞) = 0. Q P on Ft so Q((H 2 • [X 1c ])(t)=∞)=0 for every that is P(H 2 • [X 2 c c 1 1 t, that is Q((H • [X ]) = ∞) = 0. So H • X exists under Q. 1d is purely discontinuous, hence H • X 1d exists under Q if and only if 3. X % Z
( 1d ∈ A+ H2 • X loc
under measure Q. Z is obviously increasing, so we need only prove that Z ∈ A+ loc . 4. Let us prove the following general observation: if Λ is a non-negative martingale, τ is an arbitrary stopping time and Λ ≤ c on [0, τ ) then E (χ (τ > 0) Λ (τ )) ≤ c. 83 See: