Discovering Evolution Equations with Applications Volume 2-Stochastic Equations
© 2011 by Taylor & Francis Group, LLC ...
22 downloads
933 Views
3MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Discovering Evolution Equations with Applications Volume 2-Stochastic Equations
© 2011 by Taylor & Francis Group, LLC C9211_FM.indd 1
5/3/11 9:03 AM
CHAPMAN & HALL/CRC APPLIED MATHEMATICS AND NONLINEAR SCIENCE SERIES Series Editor Goong Chen
Published Titles Advanced Differential Quadrature Methods, Zhi Zong and Yingyan Zhang Computing with hp-ADAPTIVE FINITE ELEMENTS, Volume 1, One and Two Dimensional Elliptic and Maxwell Problems, Leszek Demkowicz Computing with hp-ADAPTIVE FINITE ELEMENTS, Volume 2, Frontiers: Three Dimensional Elliptic and Maxwell Problems with Applications, Leszek Demkowicz, Jason Kurtz, David Pardo, Maciej Paszy´nski, Waldemar Rachowicz, and Adam Zdunek CRC Standard Curves and Surfaces with Mathematica®: Second Edition, David H. von Seggern Discovering Evolution Equations with Applications: Volume 1-Deterministic Equations, Mark A. McKibben Discovering Evolution Equations with Applications: Volume 2-Stochastic Equations, Mark A. McKibben Exact Solutions and Invariant Subspaces of Nonlinear Partial Differential Equations in Mechanics and Physics, Victor A. Galaktionov and Sergey R. Svirshchevskii Fourier Series in Several Variables with Applications to Partial Differential Equations, Victor L. Shapiro Geometric Sturmian Theory of Nonlinear Parabolic Equations and Applications, Victor A. Galaktionov Green’s Functions and Linear Differential Equations: Theory, Applications, and Computation, Prem K. Kythe Introduction to Fuzzy Systems, Guanrong Chen and Trung Tat Pham Introduction to non-Kerr Law Optical Solitons, Anjan Biswas and Swapan Konar Introduction to Partial Differential Equations with MATLAB®, Matthew P. Coleman Introduction to Quantum Control and Dynamics, Domenico D’Alessandro Mathematical Methods in Physics and Engineering with Mathematica, Ferdinand F. Cap Mathematical Theory of Quantum Computation, Goong Chen and Zijian Diao Mathematics of Quantum Computation and Quantum Technology, Goong Chen, Louis Kauffman, and Samuel J. Lomonaco Mixed Boundary Value Problems, Dean G. Duffy Multi-Resolution Methods for Modeling and Control of Dynamical Systems, Puneet Singla and John L. Junkins Optimal Estimation of Dynamic Systems, John L. Crassidis and John L. Junkins Quantum Computing Devices: Principles, Designs, and Analysis, Goong Chen, David A. Church, Berthold-Georg Englert, Carsten Henkel, Bernd Rohwedder, Marlan O. Scully, and M. Suhail Zubairy A Shock-Fitting Primer, Manuel D. Salas Stochastic Partial Differential Equations, Pao-Liu Chow
© 2011 by Taylor & Francis Group, LLC C9211_FM.indd 2
5/3/11 9:03 AM
CHAPMAN & HALL/CRC APPLIED MATHEMATICS AND NONLINEAR SCIENCE SERIES
Discovering Evolution Equations with Applications Volume 2-Stochastic Equations
Mark A. McKibben Goucher College Baltimore, Maryland
© 2011 by Taylor & Francis Group, LLC C9211_FM.indd 3
5/3/11 9:03 AM
CRC Press Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487-2742 © 2011 by Taylor & Francis Group, LLC CRC Press is an imprint of Taylor & Francis Group, an Informa business No claim to original U.S. Government works Printed in the United States of America on acid-free paper Version Date: 20110429 International Standard Book Number: 978-1-4200-9211-0 (Hardback) This book contains information obtained from authentic and highly regarded sources. Reasonable efforts have been made to publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or the consequences of their use. The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to copyright holders if permission to publish in this form has not been obtained. If any copyright material has not been acknowledged please write and let us know so we may rectify in any future reprint. Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers. For permission to photocopy or use material electronically from this work, please access www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Visit the Taylor & Francis Web site at http://www.taylorandfrancis.com and the CRC Press Web site at http://www.crcpress.com
© 2011 by Taylor & Francis Group, LLC C9211_FM.indd 4
5/3/11 9:03 AM
Dedicated to my mother, Pat.
© 2011 by Taylor & Francis Group, LLC
Contents
Preface 1
A Basic Analysis Toolbox 1.1 Some Basic Mathematical Shorthand . . . . . . . . . . . 1.2 Set Algebra . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Functions . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 The Space (R, |·|) . . . . . . . . . . . . . . . . . . . . . 1.4.1 Order Properties . . . . . . . . . . . . . . . . . . 1.4.2 Absolute Value . . . . . . . . . . . . . . . . . . . 1.4.3 Completeness Property of (R, | · |) . . . . . . . . . 1.4.4 Topology of R . . . . . . . . . . . . . . . . . . . 1.5 Sequences in (R, |·|) . . . . . . . . . . . . . . . . . . . . 1.5.1 Sequences and Subsequences . . . . . . . . . . . 1.5.2 Limit Theorems . . . . . . . . . . . . . . . . . . . 1.5.3 Cauchy Sequences . . . . . . . . . . . . . . . . . 1.5.4 A Brief Look atInfinite Series . . . . . . . . . . . 1.6 The Spaces RN , k·kRN and MN (R), k·kMN (R) . . . . N 1.6.1 The Space R , k·kRN . . .. . . . . . . . . . . N 1.6.2 The Space M (R), k·kMN (R) . . . . . . . . . . 1.7 Abstract Spaces . . . . . . . . . . . . . . . . . . . . . . . 1.7.1 Banach Spaces . . . . . . . . . . . . . . . . . . . 1.7.2 Hilbert Spaces . . . . . . . . . . . . . . . . . . . 1.8 Elementary Calculus in Abstract Spaces . . . . . . . . . . 1.8.1 Limits . . . . . . . . . . . . . . . . . . . . . . . . 1.8.2 Continuity . . . . . . . . . . . . . . . . . . . . . 1.8.3 The Derivative . . . . . . . . . . . . . . . . . . . 1.9 Some Elementary ODEs . . . . . . . . . . . . . . . . . . 1.9.1 Separation of Variables . . . . . . . . . . . . . . . 1.9.2 First-Order Linear ODEs . . . . . . . . . . . . . . 1.9.3 Higher-Order Linear ODEs . . . . . . . . . . . . . 1.10 A Handful of Integral Inequalities . . . . . . . . . . . . . 1.11 Fixed-Point Theory . . . . . . . . . . . . . . . . . . . . . 1.12 Guidance for Selected Exercises . . . . . . . . . . . . . . 1.12.1 Level 1: A Nudge in a Right Direction . . . . . . . 1.12.2 Level 2: An Additional Thrust in a Right Direction
xiii . . . . . . . . . . . . . .
1 1 2 3 5 5 6 7 9 12 12 12 19 21 24
. . . . .
25
. . . . . . . . . . . . . . . . .
30 32 33 38 42 42 44 47 48 48 49 50 51 53 56 56 62
. . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . .
vii © 2011 by Taylor & Francis Group, LLC
viii 2
3
The Bare-Bone Essentials of Probability Theory 2.1 Formalizing Randomness . . . . . . . . . . . . . . . . . . 2.2 R-Valued Random Variables . . . . . . . . . . . . . . . . 2.2.1 Some Useful Statistics for Random Variables . . . 2.2.2 Some Common Random Variables . . . . . . . . . 2.3 Introducing the Space L2 (Ω; R) . . . . . . . . . . . . . . 2.4 RN -Valued Random Variables . . . . . . . . . . . . . . . 2.5 Conditional Probability and Independence . . . . . . . . 2.6 Conditional Expectation — A Very Quick Description . . 2.7 Stochastic Processes . . . . . . . . . . . . . . . . . . . . 2.8 Martingales . . . . . . . . . . . . . . . . . . . . . . . . . 2.9 The Wiener Process . . . . . . . . . . . . . . . . . . . . 2.9.1 A Common Simulation of Brownian Motion . . . 2.9.2 The Wiener Process . . . . . . . . . . . . . . . . 2.9.3 Modeling with the Wiener Process . . . . . . . . . 2.10 Summary of Standing Assumptions . . . . . . . . . . . . 2.11 Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . 2.12 Guidance for Selected Exercises . . . . . . . . . . . . . . 2.12.1 Level 1: A Nudge in a Right Direction . . . . . . . 2.12.2 Level 2: An Additional Thrust in a Right Direction
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
69 69 75 79 82 83 87 91 95 97 104 105 106 108 110 112 113 114 114 116
Linear Homogenous Stochastic Evolution Equations in R 3.1 Random Homogenous Stochastic Differential Equations . . . . . 3.2 Introducing the Lebesgue and Ito ´ Integrals . . . . . . . . . . . . 3.2.1 The Lebesgue Integral for R-Valued Stochastic Processes . 3.2.2 The Ito ´ Integral for R-Valued Stochastic Processes . . . . 3.2.3 The Ito ´ Formula in R . . . . . . . . . . . . . . . . . . . . 3.2.4 Some Crucial Estimates . . . . . . . . . . . . . . . . . . 3.3 The Cauchy Problem — Formulation . . . . . . . . . . . . . . . 3.4 Existence and Uniqueness of a Strong Solution . . . . . . . . . . 3.5 Continuous Dependence on Initial Data . . . . . . . . . . . . . . 3.6 Statistical Properties of the Strong Solution . . . . . . . . . . . . 3.6.1 Mean and Variance . . . . . . . . . . . . . . . . . . . . . 3.6.2 Moment Estimates . . . . . . . . . . . . . . . . . . . . . 3.6.3 Continuity in the pth Moment . . . . . . . . . . . . . . . 3.6.4 The Distribution of a Strong Solution . . . . . . . . . . . 3.6.5 Markov Property . . . . . . . . . . . . . . . . . . . . . . 3.7 Some Convergence Results . . . . . . . . . . . . . . . . . . . . . 3.8 A Brief Look at Stability . . . . . . . . . . . . . . . . . . . . . . 3.9 A Classical Example . . . . . . . . . . . . . . . . . . . . . . . . 3.10 Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . . . . 3.11 Guidance for Selected Exercises . . . . . . . . . . . . . . . . . . 3.11.1 Level 1: A Nudge in a Right Direction . . . . . . . . . . . 3.11.2 Level 2: An Additional Thrust in a Right Direction . . . .
. . . . . . . . . . . . . . . . . . . . . .
119 119 122 122 127 132 136 140 142 152 153 154 156 157 157 158 158 162 165 166 166 166 168
© 2011 by Taylor & Francis Group, LLC
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
ix 4
5
6
Homogenous Linear Stochastic Evolution Equations in RN 4.1 Motivation by Models . . . . . . . . . . . . . . . . . . . . . . . 4.2 Deterministic Linear Evolution Equations in RN . . . . . . . . . 4.2.1 The Matrix Exponential . . . . . . . . . . . . . . . . . . 4.2.2 The Homogenous Cauchy Problem . . . . . . . . . . . . 4.3 Exploring Two Models . . . . . . . . . . . . . . . . . . . . . . . 4.4 The Lebesgue and Ito ´ Integrals in RN . . . . . . . . . . . . . . . 4.4.1 The Lebesgue Integral for RN -Valued Stochastic Processes 4.4.2 The Ito ´ Integral for RN -Valued Stochastic Processes . . . 4.4.3 Some Crucial Estimates . . . . . . . . . . . . . . . . . . 4.4.4 The Multivariable Itó Formula — Revisited . . . . . . . . 4.5 The Cauchy Problem — Formulation . . . . . . . . . . . . . . . 4.6 Existence and Uniqueness of a Strong Solution . . . . . . . . . . 4.7 Continuous Dependence on Initial Data . . . . . . . . . . . . . . 4.8 Statistical Properties of the Strong Solution . . . . . . . . . . . . 4.9 Some Convergence Results . . . . . . . . . . . . . . . . . . . . . 4.10 Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . . . . 4.11 Guidance for Selected Exercises . . . . . . . . . . . . . . . . . . 4.11.1 Level 1: A Nudge in a Right Direction . . . . . . . . . . . 4.11.2 Level 2: An Additional Thrust in a Right Direction . . . .
. . . . . . . . . . . . . . . . . . .
171 171 179 179 181 182 183 183 185 188 189 191 193 195 196 196 197 199 199 200
Abstract Homogenous Linear Stochastic Evolution Equations 5.1 Linear Operators . . . . . . . . . . . . . . . . . . . . . . . . . . 5.1.1 Bounded versus Unbounded Operators . . . . . . . . . . 5.1.2 Invertible Operators . . . . . . . . . . . . . . . . . . . . 5.1.3 Closed Operators . . . . . . . . . . . . . . . . . . . . . . 5.1.4 Densely Defined Operators . . . . . . . . . . . . . . . . . 5.2 Linear Semigroup Theory — Some Highlights . . . . . . . . . . 5.3 Probability Theory in the Hilbert Space Setting . . . . . . . . . . 5.4 Random Homogenous Linear SPDEs . . . . . . . . . . . . . . . 5.5 Bochner and Itó Integrals . . . . . . . . . . . . . . . . . . . . . 5.5.1 The Bochner Integral for H -Valued Stochastic Processes 5.5.2 The Ito ´ Integral for H -Valued Stochastic Processes . . . 5.6 The Cauchy Problem — Formulation . . . . . . . . . . . . . . . 5.7 The Basic Theory . . . . . . . . . . . . . . . . . . . . . . . . . . 5.8 Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.9 Guidance for Selected Exercises . . . . . . . . . . . . . . . . . . 5.9.1 Level 1: A Nudge in a Right Direction . . . . . . . . . . . 5.9.2 Level 2: An Additional Thrust in a Right Direction . . . .
. . . . . . . . . . . . . . . . .
201 201 201 205 206 208 208 216 218 227 227 229 233 235 241 242 242 243
Nonhomogenous Linear Stochastic Evolution Equations 6.1 Finite-Dimensional Setting . . . . . . . . . . . . . . . . . . . 6.1.1 Motivation by Models . . . . . . . . . . . . . . . . . 6.2 Nonhomogenous Linear SDEs in R . . . . . . . . . . . . . . 6.2.1 The Cauchy Problem — Existence/Uniqueness Theory
. . . .
245 245 245 249 249
© 2011 by Taylor & Francis Group, LLC
. . . .
. . . .
x 6.2.2 Continuous Dependence Estimates . . . . . . . . . 6.2.3 Statistical Properties of the Solution . . . . . . . . 6.2.4 Convergence Results . . . . . . . . . . . . . . . . 6.2.5 Approximation by a Deterministic IVP . . . . . . Nonhomogenous Linear SDEs in RN . . . . . . . . . . . Abstract Nonhomogenous Linear SEEs . . . . . . . . . . 6.4.1 Motivation by Models . . . . . . . . . . . . . . . 6.4.2 The Cauchy Problem . . . . . . . . . . . . . . . . Introducing Some New Models . . . . . . . . . . . . . . Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . Guidance for Selected Exercises . . . . . . . . . . . . . . 6.7.1 Level 1: A Nudge in a Right Direction . . . . . . . 6.7.2 Level 2: An Additional Thrust in a Right Direction
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
254 256 263 266 267 270 270 271 272 277 278 278 279
Semi-Linear Stochastic Evolution Equations 7.1 Motivation by Models . . . . . . . . . . . . . . . . . . . 7.1.1 Some Models Revisited . . . . . . . . . . . . . . 7.1.2 Introducing Two New Models . . . . . . . . . . . 7.2 Some Essential Preliminary Considerations . . . . . . . . 7.3 Growth Conditions . . . . . . . . . . . . . . . . . . . . . 7.4 The Cauchy Problem . . . . . . . . . . . . . . . . . . . 7.4.1 Problem Formulation . . . . . . . . . . . . . . . 7.4.2 Existence and Uniqueness Results . . . . . . . . . 7.4.3 Continuous Dependence Estimates . . . . . . . . 7.4.4 pth Moment Continuity . . . . . . . . . . . . . . . 7.4.5 Convergence of Yosida Approximations . . . . . 7.4.6 Convergence of Induced Probability Measures . . 7.4.7 Zeroth-Order Approximation . . . . . . . . . . . . 7.5 Models Revisited . . . . . . . . . . . . . . . . . . . . . . 7.6 Theory for Non-Lipschitz-Type Forcing Terms . . . . . . 7.7 Looking Ahead . . . . . . . . . . . . . . . . . . . . . . . 7.8 Guidance for Selected Exercises . . . . . . . . . . . . . . 7.8.1 Level 1: A Nudge in a Right Direction . . . . . . . 7.8.2 Level 2: An Additional Thrust in a Right Direction
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
281 281 281 283 286 287 291 291 292 294 298 300 303 307 311 321 329 331 331 332
Functional Stochastic Evolution Equations 8.1 Motivation by Models . . . . . . . . . 8.2 Functionals . . . . . . . . . . . . . . . 8.3 The Cauchy Problem . . . . . . . . . . 8.3.1 Problem Formulation . . . . . . 8.3.2 Existence Results . . . . . . . . 8.3.3 Convergence Results . . . . . . 8.3.4 Zeroth-Order Approximation . 8.4 Models — New and Old . . . . . . . . 8.5 Looking Ahead . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
335 335 339 346 346 347 353 358 361 379
6.3 6.4
6.5 6.6 6.7
7
8
© 2011 by Taylor & Francis Group, LLC
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
xi 8.6
9
Guidance for Selected Exercises . . . . . . . . . . . . . . . . . . . 380 8.6.1 Level 1: A Nudge in a Right Direction . . . . . . . . . . . . 380 8.6.2 Level 2: An Additional Thrust in a Right Direction . . . . . 381
Sobolev-Type Stochastic Evolution Equations 9.1 Motivation by Models . . . . . . . . . . . . . . . . . . . 9.2 The Abstract Framework . . . . . . . . . . . . . . . . . . 9.3 Semi-Linear Sobolev Stochastic Equations . . . . . . . . 9.4 Functional Sobolev SEEs . . . . . . . . . . . . . . . . . . 9.5 Guidance for Selected Exercises . . . . . . . . . . . . . . 9.5.1 Level 1: A Nudge in a Right Direction . . . . . . . 9.5.2 Level 2: An Additional Thrust in a Right Direction
10 Beyond Volume 2 10.1 Fully Nonlinear SEEs . . . 10.2 Time-Dependent SEEs . . . 10.3 Quasi-Linear SEEs . . . . . 10.4 McKean-Vlasov SEEs . . . 10.5 Even More Classes of SEEs
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
. . . . . . .
383 383 386 388 393 396 396 397
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
401 401 404 406 407 407
Bibliography
409
Index
437
© 2011 by Taylor & Francis Group, LLC
Preface
The mathematical modeling of complex phenomena that evolve over time relies heavily on the analysis of a variety of systems of ordinary and partial differential equations. Such models are developed in very disparate areas of study, ranging from the physical and natural sciences and population ecology to economics, neural networks, and infectious disease epidemiology. Despite the eclectic nature of the fields in which these models are formulated, various groups of them share enough common characteristics that make it possible to study them within a unified theoretical framework. Such study is an area of functional analysis commonly referred to as the theory of evolution equations. In the absence of “noise,” the evolution equations are said to be deterministic. If noise is taken into account in these models, by way of perturbations of the operators involved or via a Wiener process, then the evolution equations become stochastic in nature. The development of the general theory is similar to the deterministic case, but a considerable amount of additional machinery is needed in order to rigorously handle the addition of noise, and questions regarding the nature of the solutions (which are now viewed as stochastic processes rather than deterministic mappings) need to be addressed due to the probabilistic nature of the equations. One thread of development in this vast field is the study of evolution equations that can be written in an abstract form analogous to a system of finite-dimensional linear ordinary differential equations. The ability to represent the solution of such a finite-dimensional system by a variation of parameters formula involving the matrix exponential prompts one, by analogy, to identify the entity that plays the role of the matrix exponential in a more abstract setting. Depending on the class of equations, this entity can be interpreted as a linear C0 -semigroup, a nonlinear semigroup, a (co)sine family, etc. A general theory is then developed in each situation and applied, to the extent possible, to all models within its parlance. The literature for the theory of evolution equations is massive. Numerous monographs and journal articles have been written, the total sum of which covers a practically insurmountable amount of ground. While there exist five-volume magna opi that provide excellent accounts of the big picture of aspects of the field (for instance, [105, 107, 418]), most books written on evolution equations tend to either provide a thorough treatment of a particular class of equations in tremendous depth for a beginner or focus on presenting an assimilation of materials devoted to a very particular timely research direction (see [11, 37, 38, 46, 47, 65, 90, 108, 131, 132, 133, 149, 159, 174, 178, 192, 206, 250, 252, 253, 290, 300, 305, 328, 329, 341, 365, 375, 381, 396, 407, 419]). The natural practice in such mathematics texts, given that they are written for readers trained in advanced mathematics, is to pay little attention to
xiii © 2011 by Taylor & Francis Group, LLC
xiv preliminary material or behind-the-scenes detail. Needless to say, initiating study in this field can be daunting for beginners. This begs the question, “How do newcomers obtain an overview of the field, in a reasonable amount of time, that prepares them to enter and initially navigate the research realm?” This is what prompted me to embark on writing the current volume. The purpose of this volume is to provide an engaging, accessible account of a rudimentary core of theoretical results that should be understood by anyone studying stochastic evolution equations in a way that gradually builds the reader’s intuition. To accomplish this task, I have opted to write the book using a so-called discovery approach, the ultimate goal of which is to engage you, the reader, in the actual mathematical enterprise of studying stochastic evolution equations. Some characteristics of this approach that you will encounter in the text are mentioned below.
What are the “discovery approach” features of the text? I have tried to extract the essence of my approaches to teaching this material to newcomers to the field and conducting my own research, and incorporate these features into the actual prose of the text. For one, I pose questions of all types throughout the development of the material, from verifying details and illustrating theorems with examples to posing (and proving) conjectures of actual results and analyzing broad strokes that occur within the development of the theory itself. At times, the writing takes the form of a conversation with you, by way of providing motivation for a definition, or setting the stage for the next step of a theoretical development, or prefacing an important theorem with a plain-English explanation of it. I sometimes pose rhetorical questions to you as a lead-in to a subsequent section of the text. The inclusion of such discussion facilitates “seeing the big picture” of a theoretical development that I have found naturally connects its various stages. You are not left guessing why certain results are being developed or why a certain path is being followed. As a result, the exposition in the text, at times, may lack the “polished style” of a mathematical monograph, and the language used will be colloquial English rather than the standard mathematical language that you would encounter in a journal article. But, this style has the benefit of encouraging you to not simply passively read the text, but rather work through it, which is essential to obtaining a meaningful grasp of the material. I deliberately begin each chapter with a discussion of models, many of which are studied in several chapters and modified along the way to motivate the particular theory to be developed in a given chapter. The intent is to illustrate how taking into account natural additional complexity gives rise to more complicated initial-boundary value problems that, in turn, are formulated using more general abstract evolution equations. This connectivity among different fields and the centrality of the theory of evolution equations to their study are illustrated on the cover of the text. The driving force of the discussion is the substantive collection of more than 500 questions and exercises dispersed throughout the text. I have inserted questions of all types directly into the development of the chapters with the intention of having you pause and either process what has just been presented or react to a rhetorical
© 2011 by Taylor & Francis Group, LLC
xv question posed. You might be asked to supply details in an argument, verify a definition or theorem using a particular example, create a counterexample to show why an extension of a theorem from one setting to another fails, or conjecture and prove a result of your own based on previous material, etc. The questions, in essence, constitute much of the behind-the-scenes detail that goes into actually formulating the theory. In the spirit of the conversational nature of the text, I have included a section entitled Guidance for Selected Exercises at the end of the first nine chapters that provides two layers of hints for selected exercises. Layer one, labeled as “A Small Nudge in a Right Direction” is intended to help you get started if you are stumped. The idea is that you will re-attempt the exercise using the hint. If you find this hint insufficient, the second layer of hints, labeled as “An Additional Thrust in a Right Direction” provides a more substantive suggestion as to how to proceed. In addition to this batch of exercises, you will encounter more questions or directives enclosed in parentheses throughout all parts of the text. The purpose of these less formal, yet equally important questions is to alert you to when details are being omitted or to call your attention to a specific portion of a proof to which I want you to pay close attention. You will likely view the occurrence of these questions to be, at times, disruptive. And, this is exactly the point of including them! The tendency is to gloss over details when working through material as technical as this, but doing so too often will create gaps in understanding. It is my hope that the inclusion of the combination of the two layers of hints for the formal exercises and this frequent questioning will reduce any reluctance you might have in working through the text. Finally, most chapters conclude with a section in which some of the models used to motivate the chapter are revisited, but are now modified in order to account for an additional complexity. The impetus is to direct your thinking toward what awaits you in the next chapter. This short, but natural, section is meant to serve as a connective link between chapters.
For whom is this book accessible? It is my hope that anybody possessing a basic familiarity with the real numbers and at least an exposure to the most elementary of differential equations, be it a student, engineer, scientist, or mathematician specializing in a different area, can work through this text to gain an initial understanding of stochastic evolution equations, how they are used in practice, and more than twenty different areas of study to which the theory applies. Indeed, while the level of the mathematics discussed in the text is conventionally viewed as a topic that a graduate student would encounter after studying stochastic and functional analysis, all of the underlying tools of stochastic and functional analysis necessary to intelligently work through the text are included, chapter by chapter as they arise. This, coupled with the conversational style in which the text is written, should make the material naturally accessible to a broad audience.
© 2011 by Taylor & Francis Group, LLC
xvi What material does this text cover, in broad strokes? The present volume consists of ten chapters. The text opens with two substantive chapters devoted to creating basic real and stochastic analysis “toolboxes,” the purpose of which is to arm you with the bare essentials of real and stochastic analysis needed to work through the rest of the book. If you are familiar with the topics in the chapter, I suggest you peruse the chapter to get a feel for the notation and terminology prior to moving on. Chapter 3 is devoted to the development of the theory for homogenous onedimensional stochastic ODEs, while Chapter 4 immediately extends this theory to systems of homogenous linear stochastic ordinary differential equations. These chapters act as a springboard into the development of its abstract counterpart in a more general separable Hilbert space. The discussion proceeds to the case of linear homogenous abstract stochastic evolution equations in Chapter 5, and subsequently in the next two chapters to the nonhomogenous and semi-linear cases. The case in which the forcing term is a functional (acting from one function space to another) is addressed in Chapter 8, followed by a discussion of Sobolev-type stochastic evolution equations in Chapter 9. These latter two chapters have been recent active research areas. Finally, the last chapter is devoted to a brief discussion of several different directions involving accessible topics of active research. For each class of equations, a core of theoretical results concerning the following main topics is developed: the existence and uniqueness of solutions (in a variety of senses) under various growth assumptions, continuous dependence upon initial data and parameters, convergence results of various kinds, and elementary stability results (in a variety of senses). A substantive collection of mathematical models arising in areas such as heat conduction, advection, fluid flow through fissured rocks, transverse vibrations in extensible beams, thermodynamics, population ecology, pharmacokinetics, spatial pattern formation, pheromone transport, neural networks, and infectious disease epidemiology are developed in stages throughout the text. In fact, the reason for studying the class of abstract equations of a given chapter is motivated by first considering modified versions of the model(s) discussed in the previous chapter, and subsequently formulating the batch of newly created initial-boundary value problems in the form of the abstract equation to be studied in that chapter. In order to get the most out of this text, I strongly encourage you to read it alongside of volume 1 [295] and to make deliberate step-by-step comparisons of the theory in the deterministic and stochastic settings. About the book cover You might very well be wondering about the significance of the text cover. Would you believe that it embodies the main driving force behind the text? Indeed, the initialvalue problem in the middle from which all arrows emanate serves as a theoretical central hub that mathematically binds the models depicted by the illustrations on the cover, to name just a few. Each of the eight pictures illustrates a scenario described
© 2011 by Taylor & Francis Group, LLC
xvii by a mathematical model (involving partial differential equations) that is studied in this text. As you work through the text, you will discover that all of these models can be written abstractly in the form of the initial-value problem positioned in the middle of the cover. So, despite the disparate nature of the fields in which these models arise, they can all be treated under the same theoretical umbrella. This is the power of the abstract theory developed in this text. Reading from left to right, and top to bottom, the fields depicted in the pictures are as follows: air pollution, infectious disease epidemiology, neural networks, chemical kinetics, combustion, population dynamics, spatial pattern formation, and soil mechanics. Acknowledgments Writing this text has been one of the most positive and fulfilling experiences of my professional career thus far. I found various stages of writing this book to be truly energizing and uplifting, while others required me to plumb the very depths of my patience and perseverance. I truly realize that a project like this would have never come to fruition without the constant support, encouragement, and good humor of many colleagues, students, friends, and family. While it is virtually impossible to acknowledge each and every individual who has, in some way, influenced me in a manner that helped either to steer me toward writing this book or to navigate murky (and at times very choppy) waters during the writing phase, I would like to acknowledge several at this time. First and foremost, there are two notable women who have been indelible sources of encouragement, energy, and support for as long as they have been in my life. My wife, to whom the first volume is dedicated, prompted me for years to write this book. And, once I actually took her advice and began the process, she never abandoned my urgent and recurrent needs for technological help, editorial expertise, or idea-sounding, and has never begrudged me for the momentary lack of patience, uttering of angst-provoked witty remarks, or necessary “idea jotting” at 3 am. And my mother, to whom this second volume is dedicated, and who has supported all of my scholastic and professional endeavors for as long as I can remember. She relentlessly encourages me to temper hard work with balance; she always seems to know when to provide a good-humored story to lighten a stressed mood and when to politely remind me to “take a break!” This book would never have materialized if it were not for both of you; your unwavering support of my endeavors is a significant driving force! Next, I am extremely lucky to have had two outstanding mentors during my college years. My first exposure to college-level mathematics, by way of analysis, took place nearly two decades ago in a one-on-one tutorial with Dr. David Keck. His unbridled enthusiasm for teaching and learning mathematics and well-timed witty humor have been infectious. Achieving the depth of his passion and honing my skills to mirror his innate ability to teach mathematics are goals to which I will continue to aspire for the duration of my academic career. And, my dissertation advisor, Dr. Sergiu Aizicovici, who took me under his wing as a graduate student and introduced
© 2011 by Taylor & Francis Group, LLC
xviii me to various facets of the study of evolution equations and the world of mathematical research. His abilities to make the area come to life, to help a newcomer navigate the practically insurmountable literature with ease, and to tolerate and provide meaningful answers to even the most rudimentary of questions (which I admittedly asked quite often!) in a way that honed my intuition surrounding the subject matter are among the many reasons why I chose to pursue this area of research. You both have left indelible imprints on my development as a mathematician and educator. Many people have been kind enough to provide honest feedback during various stages of this project. My colleagues Dr. Robert Lewand, Dr. Scott Sibley, Dr. Bernadette Tutinas, Dr. Cynthia Young, and Dr. Jill Zimmerman all provided valuable comments on portions of the prospectus that undoubtedly led to a stronger proposal. My colleagues Dr. Micah Webster and Dr. David Keck provided valuable feedback on their impression of the probability theory chapter, which led to improved transition to subsequent chapters of the text. My students Shana Lieberman, Jennifer Jordan, and Jordan Yoder endured various portions of the manuscript by way of independent study. I am proud to report that all three of them survived the experience (and seemed to enjoy it) and identified their fair share of errors in the early versions of the text! My colleague Dr. Tom Kelliher provided invaluable TEX help during early stages of the project; thank you for helping such a TEX neophyte! A special thanks to my wife, Jodi, for reading the prospectus and manuscript, and who will never let me live down the fact that she found a mathematical error in the prospectus. I would like to thank the entire Taylor & Francis team. To my editor, Bob Stern, thank you for approaching me about writing this text and for patiently guiding me through the process from beginning to end. To my project coordinator, Jessica Vakili, who answered my production, stylistic, and marketing questions in a very helpful and timely manner. To my project editor, Karen Simon, for keeping the publication of this book on track. To Kevin Craig for designing the awesome cover of this book. And to Shashi Kumar, who helped me to overcome various LATEX issues throughout the typesetting process. And, last but not least, I would like to thank you, the reader, for embarking on this journey with me through an amazingly rich field of mathematics. I hope your study is as fulfilling as mine has been thus far.
Mark A. McKibben
© 2011 by Taylor & Francis Group, LLC
Chapter 1 A Basic Analysis Toolbox
Overview The purpose of this chapter is to provide you with a succinct, hands-on introduction to elementary analysis that focuses on notation, main definitions and results, and the techniques with which you should be comfortable prior to working through this text. Additional topics will be introduced throughout the text whenever needed. Little is assumed beyond a working knowledge of the properties of real numbers, the “freshmen calculus,” and a tolerance for mathematical rigor. Keep in mind that the presentation is not intended to be a complete exposition of real analysis. You are encouraged to refer to texts devoted to more comprehensive treatments of analysis (see [17, 67, 196, 197, 234, 236, 250, 301, 353, 357, 372]).
1.1
Some Basic Mathematical Shorthand
Symbolism is used heftily in mathematical exposition. Careful usage of some basic notation can streamline the verbiage. Some of the common symbols used are as follows. Let P and Q be statements. (If the statement P changes depending on the value of some parameter x, we denote this dependence by writing P(x).) 1.) The statement “not P,” called the negation of P, is denoted by “¬P.” 2.) The statement “P or Q” is denoted by “P ∨ Q,” while the statement “P and Q” is denoted by “P ∧ Q.” 3.) The statement “If P, then Q” is called an implication, and is denoted by “P =⇒ Q” (read “P implies Q”). Here, P is called the hypothesis and Q is the conclusion. 4.) The statement “P if, and only if, Q” is denoted by “P iff Q” or “P ⇐⇒ Q.” Precisely, this means “(P =⇒ Q) ∧ (Q =⇒ P).” 5.) The statement “Q =⇒ P” is the converse of “P =⇒ Q.” 6.) The statement “¬Q =⇒ ¬P” is the contrapositive of “P =⇒ Q.” These two statements are equivalent. 7.) The symbol “∃” is an existential quantifier and is read as “there exists” or “there is at least one.”
1 © 2011 by Taylor & Francis Group, LLC
2
Volume 2: Stochastic Equations
8.) The symbol “∀” is a universal quantifier and is read as “for every” or “for any.” Exercise 1.1.1. Let P, Q, R, and S be statements. i.) Form the negation of “P ∧ (Q ∧ R).” ii.) Form the negation of “∃ x such that P(x) holds.” iii.) Form the negation of “∀x, P(x) holds.” iv.) Form the contrapositive of “(P ∧ Q) =⇒ (¬R ∨ S).” Remark. Implication is a transitive relation in the sense that ((P =⇒ Q) ∧ (Q =⇒ R)) =⇒ (P =⇒ R) . For instance, a sequence of algebraic manipulations used to solve an equation is technically such a string of implications from which we conclude that the values of the variable obtained in the last step are the solutions of the original equation. Mathematical proofs are comprised of strings of implications, albeit of a somewhat more sophisticated nature.
1.2
Set Algebra
Informally, a set can be thought of as a collection of objects (e.g., real numbers, vectors, matrices, functions, other sets, etc.); the contents of a set are referred to as its elements. We usually label sets using uppercase letters and their elements by lowercase letters. Three sets that arise often and for whom specific notation will be reserved are N = {1, 2, 3, ...}
Q = the set of all rational numbers R = the set of all real numbers If P is a certain property and A is the set of all objects having property P, we write A = {x : x has P} or A = {x|x has P} . A set with no elements is empty, denoted by Ø. If A is not empty and a is an element of A, we denote this fact by “a ∈ A.” If a is not an element of A, a fact denoted by “a ∈ / A, ” where is it located? This prompts us to prescribe a universal set U that contains all possible objects of interest in our discussion. The following definition provides an algebra of sets. Definition 1.2.1. Let A and B be sets. i.) A is a subset of B, written A ⊂ B, whenever x ∈ A =⇒ x ∈ B . ii.) A equals B, written A = B, whenever (A ⊂ B) ∧ (B ⊂ A). iii.) The complement of A relative to B, written B \ A, is the set {x|x ∈ B ∧ x ∈ / A}.
© 2011 by Taylor & Francis Group, LLC
3
A Basic Analysis Toolbox e Specifically, the complement relative to U is denoted by A. iv.) The union of A and B is the set A ∪ B = {x|x ∈ A ∨ x ∈ B} . v.) The intersection of A and B is the set A ∩ B = {x|x ∈ A ∧ x ∈ B} . vi.) A × B = {(a, b)|a ∈ A ∧ b ∈ B} .
Proving set equality requires that we show two implications. Use this fact when appropriate to complete the following exercises. Exercise 1.2.1. Let A, B, and C be sets. Prove the following: e i.) A ⊂ B iff Be ⊂ A ii.) A = (A ∩ B)∪ (A \ B) iii.) A ∩ (B ∪C) = (A ∩ B) ∪ (A ∩C)and A ∪ (B ∩C) = (A ∪ B) ∩ (A ∪C) ^ ^ e ∪ Be and (A e ∩ Be iv.) (A ∩ B) = A ∪ B) = A Exercise 1.2.2. Explain how you would prove A 6= B.
Exercise 1.2.3. Formulate an extension of Def. 1.2.1(iv) through (vi) that works for any finite number of sets. It is often necessary to consider the union or intersection of more than two sets, possibly infinitely many. So, we need a succinct notation for unions and intersections of an arbitrary number of sets. Let Γ 6= Ø. (We think of the members of Γ as labels.) Suppose to each γ ∈ Γ, we associate a set Aγ . The collection of all these sets, namely A = Aγ |γ ∈ Γ , is a family of sets indexed by Γ. We define [
γ ∈Γ
\
If Γ = N, we write
S∞
γ ∈Γ
n=1
Aγ = x| ∃γ ∈ Γ such that x ∈ Aγ , Aγ = x| ∀γ ∈ Γ, x ∈ Aγ .
and
T∞
n=1
in place of
S
γ ∈Γ
and
T
γ ∈Γ ,
(1.1)
(1.2) respectively.
Exercise 1.2.4. Let A be a set and Aγ |γ ∈ Γ a family of sets indexed by Γ. Prove S S T T i.) A∩ γ ∈Γ Aγ = γ ∈Γ A ∩ Aγ and A ∪ γ ∈Γ Aγ = γ ∈Γ A ∪ Aγ ∼ T S fγ and Tγ ∈Γ Aγ ∼ = Sγ ∈Γ A fγ ii.) γ ∈Γ Aγ = γ ∈Γ A S S T T iii.) A × γ ∈Γ Aγ = γ ∈Γ A × Aγ and A × γ ∈Γ Aγ = γ ∈Γ A × Aγ S T iv.) γ ∈Γ Aγ ⊂ Aγ0 ⊂ γ ∈Γ Aγ , ∀γ0 ∈ Γ.
1.3
Functions
The concept of a function is central to the study of mathematics.
© 2011 by Taylor & Francis Group, LLC
4
Volume 2: Stochastic Equations
Definition 1.3.1. Let A and B be sets. i.) A subset f ⊂ A × B satisfying a.) ∀x ∈ A,∃y ∈ B such that (x, y) ∈ f , b.) (x, y1 ) ∈ f ∧ (x, y2 ) ∈ f =⇒ y1 = y2 , is called a function from A into B. We say f is B-valued, denoted by f : A → B. ii.) The set A is called the domain of f , denoted dom( f ). iii.) The range of f , denoted by rng( f ), is given by rng( f ) = { f (x)|x ∈ A}. Remarks. 1. Notation: When defining a function using an explicit formula, say y = f (x), the notation x 7→ f (x) is often used to denote the function. Also, we indicate the general dependence on a variable using a dot, say f (·). If the function depends on two independent variables, we distinguish between them by using a different number of dots for each, say f (·, ··). 2. The term mapping is used synonymously with the term function. 3. rng( f ) ⊂ B. Exercise 1.3.1. Precisely define what it means for two functions f and g to be equal. The following classification plays a role in determining if a function is invertible. Definition 1.3.2. f : A → B is called i.) one-to-one if f (x1 ) = f (x2 ) =⇒ x1 = x2 , ∀x1 , x2 ∈ A; ii.) onto whenever rng( f ) = B. We sometimes wish to apply functions in succession in the following sense. Definition 1.3.3. Suppose that f : dom( f ) → A and g : dom(g) → B with rng(g) ⊂ dom( f ). The composition of f with g, denoted f ◦ g, is the function f ◦ g : dom(g) → A defined by ( f ◦ g)(x) = f (g(x)). Exercise 1.3.2. Show that, in general, f ◦ g 6= g ◦ f . Exercise 1.3.3. Let f : dom( f ) → A and g : dom(g) → B be such that f ◦ g is defined. Prove i.) If f and g are onto, then f ◦ g is onto. ii.) If f and g are one-to-one, then f ◦ g is one-to-one. At times, we need to compute the functional values for all members of a subset of the domain, or perhaps determine the subset of the domain whose collection of functional values is a prescribed subset of the range. These notions are made precise below. Definition 1.3.4. Let f : A → B. i.) For X ⊂ A, the image of X under f is the set f (X) = { f (x)|x ∈ X}. ii.) For Y ⊂ B, the pre-image of Y under f is the set f −1 (Y ) = {x ∈ A | ∃y ∈ Y such thaty = f (x)} .
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
5
The following related properties are useful. Proposition 1.3.5. Suppose f : A → B is a function, X, X1 , X2 , and Xγ , γ ∈ Γ, are all subsets of A and Y,Y1 ,Y2 , and Yγ , γ ∈ Γ, are all subsets of B. Then, i.) a.) X1 ⊂ X2 =⇒ f (X1 ) ⊂ f (X2 ) b.) Y1 ⊂ Y =⇒ f −1S(Y1 ) ⊂ f −1 (Y2 ) S 2 ii.) a.) f γ ∈Γ Xγ = γ ∈Γ f Xγ S S b.) f −1 γ ∈Γ Yγ = γ ∈Γ f −1 Yγ T T iii.) a.) f γ ∈Γ Xγ ⊂ γ ∈Γ f Xγ T T b.) f −1 γ ∈Γ Yγ = γ ∈Γ f −1 Yγ iv.) a.) X ⊂ f −1 ( f(X))) b.) f f −1 (Y ) ⊂ Y Exercise 1.3.4. i.) Prove Prop. 1.3.5. ii.) Impose conditions on f that would yield equality in Prop. 1.3.5(iv)(a) and (b).
We often consider functions whose domains and ranges are subsets of R. For such functions, the notion of monotonicity is often a useful characterization. Definition 1.3.6. Let f : dom( f ) ⊂ R → R and suppose that ∅ 6= S ⊂ dom( f ). We say that f is i.) nondecreasing on S whenever x1 , x2 ∈ S with x1 < x2 =⇒ f (x1 ) ≤ f (x2 ); ii.) nonincreasing on S whenever x1 , x2 ∈ S with x1 < x2 =⇒ f (x1 ) ≥ f (x2 ). Remark. The prefix “non” in both parts of Def. 1.3.6 is removed when the inequality is strict. The arithmetic operations of real-valued functions are defined in the natural way. For such functions, consider the following exercise. Exercise 1.3.5. Suppose that f : dom( f ) ⊂ R → R and g : dom(g) ⊂ R → R are nondecreasing (resp. nonincreasing) functions on their domains. i.) Which of the functions f + g, f − g, f · g, and gf , if any, are nondecreasing (resp. nonincreasing) on their domains? ii.) Assuming that f ◦ g is defined, must it be nondecreasing (resp. nonincreasing) on its domain?
1.4 1.4.1
The Space (R, |·|) Order Properties
The basic arithmetic and order features of the real number system are likely familiar, even if you have not worked through its formal construction. For our purposes, we
© 2011 by Taylor & Francis Group, LLC
6
Volume 2: Stochastic Equations
shall begin with a set R equipped with two operations, addition and multiplication, satisfying these algebraic properties: (i) addition and multiplication are both commutative and associative, (ii) multiplication distributes over addition, (iii) adding zero to any real number yields the same real number, (iv) multiplying a real number by 1 yields the same real number, (v) every real number has a unique additive inverse, and (vi) every nonzero real number has a unique multiplicative inverse. Moreover, R equipped with the natural “<” ordering is an ordered field and obeys the following properties. Proposition 1.4.1. (Order Features of R) For all x, y, z ∈ R, the following are true: i.) Exactly one of the relationships x = y, x < y, or y < x holds; ii.) x < y =⇒ x + z < y + z; iii.) (x < y) ∧ (y < z) =⇒ x < z; iv.) (x < y) ∧ ( c > 0) =⇒ cx < cy; v.) (x < y) ∧ (c < 0) =⇒ cx > cy; vi.) (0 < x < y) ∧ (0 < w < z) =⇒ 0 < xw < yz. The following is an immediate consequence of these properties and is often the underlying principle used when verifying an inequality. Proposition 1.4.2. If x, y ∈ R are such that x < y + ε , ∀ε > 0, then x ≤ y. Proof. Suppose not; that is, y < x. Observe that for ε = x−y 2 > 0, y + ε = (Why?) This is a contradiction. Hence, it must be the case that x ≤ y.
x+y 2
< x.
Remark. The above argument is a very simple example of a proof by contradiction. The strategy is to assume that the conclusion is false and then use this additional hypothesis to obtain an obviously false statement or a contradiction of another hypothesis in the claim. More information about elementary proof techniques can be found in [372]. Exercise 1.4.1. 2 2 i.) Let x, y > 0. Prove that xy ≤ x +y 2 . ii.) Show that if 0 < x < y, then xn < yn , ∀n ∈ N.
1.4.2
Absolute Value
The above is a heuristic description of the familiar algebraic structure of R. When equipped with a distance-measuring artifice, a deeper topological structure of R can be defined and studied. This is done with the help of the absolute value function.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
7
Definition 1.4.3. For any x ∈ R, the absolute value of x, denoted |x|, is defined by ( x, x ≥ 0, |x| = −x, x < 0. This can be viewed as a measurement of distance between real numbers within the context of a number line. For instance, the solution set of the equation “|x − 2| = 3” is the set of real numbers x that are “3 units away from 2,” namely {−1, 5}. Exercise 1.4.2. Determine the solution set for the following equations: i.) |x − 3| = 0 ii.) |x + 6| = 2. Proposition 1.4.4. These properties hold for all x, y, z ∈ R and a ≥ 0: i.) −|x| = min{−x, x} ≤ x ≤ max{−x, x} = |x| ii.) |x| ≥ 0, ∀x ∈ R iii.) √ |x| = 0 iff x = 0 iv.) x2 = |x| v.) |xy| = |x| |y| vi.) |x| ≤ a iff −a ≤ x ≤ a vii.) |x + y| ≤ |x| + |y| viii.) |x − y| ≤ |x − z| + |z − y| ix.) | |x| − |y| | ≤ |x − y| x.) |x − y| < ε , ∀ε > 0 =⇒ x = y Exercise 1.4.3. Prove Prop. 1.4.4. Exercise 1.4.4. Let n ∈ N and x1 , x2 , . . . , xn ,y1 , y2 , . . . ,yn ∈ R. Prove: i.) (Cauchy-Schwarz) ∑ni=1 xi yi ≤ ∑ni=1 x2i ∑ni=1 y2i 1/2 1/2 1/2 ii.) (Minkowski) ∑ni=1 (xi + yi )2 ≤ ∑ni=1 x2i + ∑ni=1 y2i iii.) |∑ni=1 xi |M ≤ (∑ni=1 |xi |)M ≤ nM−1 ∑ni=1 |xi |M , ∀M ∈ N
1.4.3
Completeness Property of (R, | · |)
It turns out that R has a fundamental and essential property referred to as completeness, without which the study of analysis could not proceed. We introduce some terminology needed to state certain fundamental properties of R. Definition 1.4.5. Let ∅ 6= S ⊂ R. i.) S is bounded above if ∃u ∈ R such that x ≤ u, ∀x ∈ S; ii.) u ∈ R is an upper bound of S (ub(S)) if x ≤ u, ∀x ∈ S; iii.) u0 ∈ R is the maximum of S (max(S)) if u0 is an ub(S) and u0 ∈ S; iv.) u0 ∈ R is the supremum of S (sup(S)) if u0 is an ub(S) and u0 ≤ u, for any other u =ub(S).
© 2011 by Taylor & Francis Group, LLC
8
Volume 2: Stochastic Equations
The following analogous terms can be defined by reversing the inequality signs in Def. 1.4.5: bounded below, lower bound of S (lb(S)), minimum of S (min(S)), and infimum of S (inf(S)). Exercise 1.4.5. Formulate precise definitions of the above terms. Exercise 1.4.6. Let ∅ 6= S ⊂ R. i.) How would you prove that sup(S)= ∞? ii.) Repeat (i) for inf(S)= −∞. Definition 1.4.6. A set ∅ 6= S ⊂ R is bounded if ∃M > 0 such that |x| ≤ M, ∀x ∈ S. It can be formally shown that R possesses the so-called completeness property. The importance of this concept in the present and more abstract settings cannot be overemphasized. We state it in the form of a theorem to highlight its importance. Consult [17, 234] for a proof. Theorem 1.4.7. If ∅ 6= S ⊂ R is bounded above, then ∃u ∈ R such that u =sup(S). We say R is complete. Remark. The duality between the statements concerning sup and inf leads to the formulation of the following alternate statement of the completeness property: I f ∅ 6= T ⊂ R is bounded below, then ∃ v ∈ R such that v = inf(S).
(1.3)
Exercise 1.4.7. Prove that (1.3) is equivalent to Thrm 1.4.7. Proposition 1.4.8. (Properties of inf and sup) Let ∅ 6= S, T ⊂ R. i.) Assume ∃ sup(S). Then, ∀ε > 0, ∃x ∈ S such that sup(S) − ε < x ≤ sup(S). ii.) If S ⊂ T and ∃sup(T ), then ∃sup(S) and sup(S) ≤ sup(T ). iii.) Let S + T = {s + t|s ∈ S ∧ t ∈ T } . If S and T are bounded above, then ∃sup(S + T ) and it equals sup(S) + sup(T ). iv.) Let c ∈ R and define cS = {cs|s ∈ S} . If S is bounded, then ∃sup(cS) given by ( c · sup(S), i f c ≥ 0, sup(cS) = (1.4) c · inf(S), i f c < 0. v.) Let ∅ 6= S, T ⊂ (0, ∞) and define S · T = {s · t|s ∈ S ∧ t ∈ T } . If S and T are bounded above, then ∃sup(S · T ) and it equals sup(S) · sup(T ). Proof. We prove (iii) and leave the others for you to verify as an exercise. Because S and T are nonempty, S + T 6= Ø. Further, because s + t ≤ sup(S) + sup(T ), ∀s ∈ S, t ∈ T,
(1.5)
it follows that sup(S) + sup(T ) is an upper bound of (S + T ). (Why?) Hence, ∃sup(S + T ) and sup(S + T ) ≤ sup(S) + sup(T ). (1.6)
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
9
To establish the reverse inequality, let ε > 0. By Prop. 1.4.8, ∃s0 ∈ S and t0 ∈ T such that ε ε sup(S) − < s0 and sup(T ) − < t0 . (1.7) 2 2 Consequently, sup(S) + sup(T ) − ε < s0 + t0 ≤ sup(S + T ). (1.8) Thus, we conclude from Prop. 1.4.2 that sup(S) + sup(T ) ≤ sup(S + T ).
(1.9)
Claim (iii) now follows from (1.6) and (1.9). (Why?) Exercise 1.4.8. i.) Prove the remaining parts of Prop. 1.4.8. ii.) Formulate statements analogous to those in Prop. 1.4.8 for infs. Indicate the changes that must be implemented in the proofs. Remark. Prop 1.4.8(i) indicates that we can get “arbitrarily close” to sup(S) with elements of S. This is especially useful in convergence arguments.
1.4.4
Topology of R
You have worked with open and closed intervals in calculus, but what do the terms open and closed mean? Is there any significant difference between them? The notion of an open set is central to the construction of a so-called topology on R. Interestingly, many of the theorems from calculus are formulated on closed, bounded intervals for very good reason. As we proceed with our analysis of R, you will see that many of these results are consequences of some fairly deep topological properties of R which, in turn, follow from the completeness property. Definition 1.4.9. Let S ⊂ R. i.) x is an interior point (int pt) of S if ∃ε > 0 such that (x − ε , x + ε ) ⊂ S. ii.) x is a limit point (lim pt) of S if ∀ε > 0, (x − ε , x + ε ) ∩ S is infinite. iii.) x is a boundary point (bdry pt) of S if ∀ε > 0, (x − ε , x + ε ) ∩ S 6= Ø and (x − ε , x + ε ) ∩ Se 6= Ø.
iv.) The boundary of S is the set ∂ S = {x ∈ R|x is a bdry pt of S} . v.) The interior of S is the set int(S) = {x ∈ R|x is an int pt of S} . vi.) The derived set of S is the set S′ = {x ∈ R|x is a lim pt of S} . vii.) The closure of S is the set clR (S) = S ∪ S′. viii.) S is open if every point of S is an int pt of S. ix.) S is closed if S contains all of its lim pts.
Illustrating these concepts using a number line can facilitate your understanding of them. Do so when completing the following exercise.
© 2011 by Taylor & Francis Group, LLC
10
Volume 2: Stochastic Equations
Exercise 1.4.9. For each of these sets S, compute int(S), S′ , and clR (S). Also, determine if S is open, closed, both, or neither. i.) [1, 5] ii.) Q iii.) n1 |n ∈ N iv.) R v.) Ø It is not difficult to establish the following duality between a set and its complement. It is often a useful tool when proving statements about open and closed sets. Proposition 1.4.10. Let S ⊂ R. S is open iff Se is closed.
Exercise 1.4.10. Verify the following properties of open and closed sets. T i.) Let n ∈ N. If G1 , . . . , Gn is a finite collection of open sets, then nk=1 Gk is open. S ii.) Let n ∈ N. If F1 , . . . , Fn is a finite collection of closed sets, then nk=1 Fk is closed. S iii.) Let Γ 6= Ø. If Gγ is open, ∀γ ∈ Γ, then Tγ ∈Γ Gγ is open. iv.) Let Γ 6= Ø. If Fγ is closed, ∀γ ∈ Γ, then γ ∈Γ Fγ is closed. v.) If S ⊂ T, then int(S) ⊂ int(T ). vi.) If S ⊂ T, then clR (S) ⊂ clR (T ). Exercise 1.4.11. Let Ø 6= S ⊂ R. Prove the following: i.) If S is bounded above, then sup(S) ∈ clR (S). ii.) If S is bounded above and closed, then max(S) ∈ S. iii.) Formulate results analogous to (i) and (ii) assuming that S is bounded below. Intuitively, S′ is the set of points to which elements of S become arbitarily close. It is natural to ask if there are proper subsets of R that sprawl widely enough through R as to be sufficiently near every real number. Precisely, consider sets of the following type. Definition 1.4.11. A set Ø 6= S ⊂ R is dense in R if clR (S) = R. Exercise 1.4.12. Identify two different subsets of R that are dense in R. By way of motivation for the first major consequence of completeness, consider the following exercise. Exercise 1.4.13. Provide examples, if possible, of sets S ⊂ R illustrating the following scenarios. i.) S is bounded, but S′ = Ø. ii.) S is infinite, but S′ = Ø. iii.) S is bounded and infinite, but S′ = Ø.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
11
As you discovered in Exercise 1.4.13, the combination of bounded and infinite for a set S of real numbers implies the existence of a limit point of S. This is a consequence of the following theorem due to Bolzano and Weierstrass. Theorem 1.4.12. (Bolzano-Weierstrass) If S is a bounded, infinite subset of R, then S′ 6= Ø. Outline of Proof: Let T = {x ∈ R|S ∩ (x, ∞) is infinite} . Then, T 6= Ø. (Why?) T is bounded above. (Why?)
(1.10) (1.11)
∃sup(T ); call it t. (Why?) ∀ε > 0, S ∩ (t − ε , ∞) is infinite. (Why?)
(1.12) (1.13)
∀ε > 0, S ∩ [t + ε , ∞) is finite. (Why?) ∀ε > 0, S ∩ (t − ε ,t + ε ) is infinite. (Why?)
t ∈ S′ . (Why?)
This completes the proof.
(1.14) (1.15) (1.16)
Exercise 1.4.14. Provide the details in the proof of Thrm. 1.4.12. Where was completeness used? Another important concept is that of compactness. Some authors define this notion more generally using open covers (see [17]). Definition 1.4.13. A set S ⊂ R is compact if every infinite subset of S has a limit point in S. Remark. The “in S” portion of Def. 1.4.13 is crucial, and it distinguishes between the sets (0, 1) and [0, 1], for instance. (Why?) This is evident in Thrm. 1.4.14. Exercise 1.4.15. Try to determine if the following subsets of R are compact. i.) Any finite set. ii.) n1 |n ∈ N versus 1n |n ∈ N ∪ {0} iii.) Q iv.) Q ∩ [0, 1] v.) N vi.) R vii.) (0, 1) versus [0, 1] Both the completeness property and finite dimensionality of R enter into the proof of the following characterization theorem for compact subsets of R. The proof can be found in [17]. Theorem 1.4.14. (Heine-Borel) A set S ⊂ R is compact iff S is closed and bounded. Exercise 1.4.16. Revisit Exer. 1.4.15 in light of Thrm. 1.4.14.
© 2011 by Taylor & Francis Group, LLC
12
1.5
Volume 2: Stochastic Equations
Sequences in (R, |·|)
Sequences play a prominent role in analysis, especially in the development of numerical schemes used for approximation purposes.
1.5.1
Sequences and Subsequences
Definition 1.5.1. A sequence in R is a function x : N → R. We often write xn for x(n), n ∈ N, called the nth -term of the sequence, and denote the sequence itself by {xn } or by enumerating the range as x1 , x2 , x3 , . . .. The notions of monotonicity and boundedness given in Defs. 1.3.6 and 1.4.6 apply in particular to sequences. We formulate them in this specific setting for later reference. Definition 1.5.2. A sequence is called i.) nondecreasing whenever xn ≤ xn+1 , ∀n ∈ N; ii.) increasing whenever xn < xn+1 , ∀n ∈ N; iii.) nonincreasing whenever xn ≥ xn+1 , ∀n ∈ N; iv.) decreasing whenever xn > xn+1 , ∀n ∈ N; v.) monotone if any of (i)–(iv) are satisfied; vi.) bounded above (resp. below) if ∃M ∈ R such that xn ≤ M (resp. xn ≥ M ), ∀n ∈ N; vii.) bounded whenever ∃M > 0 such that |xn | ≤ M, ∀n ∈ N. Exercise 1.5.1. Explain why a nondecreasing (resp. nonincreasing) sequence must be bounded below (resp. above). Definition 1.5.3. If x : N → R is a sequence in R and n : N → N is an increasing sequence in N, then the composition x ⋄ n : N → R is called a subsequence of x in R. Though this is a formal definition of a subsequence, let us examine carefully what this means using more conventional notation. Suppose that the terms of Def. 1.5.3 are represented by {xn } and {nk }, respectively. Because {nk } is increasing, we know that n1 < n2 < n3 < . . .. Then, the official subsequence x ◦ n has values (x ◦ n)(k) = x(n(k)), which, using our notation, can be written as xnk , ∀k ∈ N. Thus, the integers nk are just the indices of those terms of the original sequence that are retained in the subsequence as k increases, and roughly speaking, the remainder of the terms are omitted.
1.5.2
Limit Theorems
We now consider the important notion of convergence. Definition 1.5.4. A sequence {xn } has limit L whenever ∀ε > 0, ∃N ∈ N (N depending in general on ε ) such that n ≥ N =⇒ |xn − L| < ε .
© 2011 by Taylor & Francis Group, LLC
13
A Basic Analysis Toolbox
In such case, we write lim xn = L or xn −→ L and say that {xn } converges (or is n→∞
convergent) to L. Otherwise, we say {xn } diverges.
If we paraphrase Def. 1.5.4, it would read: lim xn = L whenever given any open n→∞
interval (L − ε , L + ε ) around L (that is, no matter how small the positive number ε is), it is the case that xn ∈ (L − ε , L + ε ) for all but possibly finitely many indices n. That is, the “tail” of the sequence ultimately gets into every open interval around L. Also note that, in general, the smaller the ε , the larger the index N must be used (to get deeper into the tail) because ε is an error gauge, namely how far the terms are from the target. We say N must be chosen “sufficiently large” as to ensure the tail behaves in this manner for the given ε . Exercise 1.5.2. i.) Precisely define lim xn 6= L . n→∞
ii.) Prove that xn −→ L iff |xn − L| −→ 0. 2
= 2. Example. As an illustration of Def. 1.5.4, we prove that lim 2nn2+n+5 +1 n→∞
Let ε > 0. We must argue that ∃N ∈ N such that 2 2n + n + 5 n ≥ N =⇒ − 2 < ε . n2 + 1
(1.17)
To this end, note that ∃N ∈ N such that N > 3 and N ε > 2. (Why?) We show this N “works.” Indeed, observe that ∀n ≥ N, 2 2 2n + n + 5 − 2n2 − 2 2n + n + 5 = = n+3 . − 2 (1.18) n2 + 1 n2 + 1 2 n +1 Subsequently, by choice of N, we see that n ≥ N > 3 and for all such n, n+3 2n 2n 2 2 < < = < < ε. n2 + 1 n2 + 1 n2 n N 2
= 2. (Why?) Thus, by definition, it follows that lim 2nn2+n+5 +1 n→∞
(1.19)
Exercise 1.5.3. Use Def. 1.5.4 to prove that lim an = 0, ∀a ∈ R. n→∞
We now discuss the main properties of convergence. We mainly provide outlines of proofs, the details of which you are encouraged to provide. Proposition 1.5.5. If {xn } is a convergent sequence, then its limit is unique. Outline of Proof: Let lim xn = L1 and lim xn = L2 and suppose that, by way of n→∞
n→∞
contradiction, L1 6= L2 . 2| Let ε = |L1 −L . Then, ε > 0. (Why?) 2 ∃N1 ∈ N such that n ≥ N1 =⇒ |xn − L1 | < ε . (Why?)
© 2011 by Taylor & Francis Group, LLC
14
Volume 2: Stochastic Equations ∃N2 ∈ N such that n ≥ N2 =⇒ |xn − L2 | < ε . (Why?) Choose N = max {N1 , N2 } . Then, |xN − L1 | < ε and |xN − L2 | < ε . (Why?) Consequently, 2ε = |L1 − L2 | ≤ |xN − L1 | + |xN − L2 | < 2ε . (Why?) Thus, L1 = L2 . (How?) This completes the proof.
Proposition 1.5.6. If {xn } is a convergent sequence, then it is bounded. Outline of Proof: Assume that lim xn = L . We must produce an M > 0 such that n→∞
|xn | ≤ M, ∀n ∈ N. Using ε = 1 in Def. 1.5.4, we know that ∃N ∈ N such that n ≥ N =⇒ |xn − L| < ε = 1.
(1.20)
Using Prop. 1.4.4(ix) in (1.20) then yields |xn | < |L| + 1, ∀n ≥ N.
(1.21)
(Tell how.) For how many values of n does xn possibly not satisfy (1.21)? How do you use this fact to construct a positive real number M satisfying Def. 1.5.2(vii)? Proposition 1.5.7. (Squeeze Theorem) Let {xn } , {yn } , and {zn } be sequences such that xn ≤ yn ≤ zn , ∀n ∈ N, (1.22) and
lim xn = L = lim zn .
n→∞
n→∞
(1.23)
Then, lim yn = L. n→∞
Outline of Proof: Let ε > 0. From (1.23) we know that ∃N1 ,N2 ∈ N such that |xn − L| < ε , ∀n ≥ N1 and |zn − L| < ε , ∀n ≥ N2 .
(1.24)
−ε < xn − L, ∀n ≥ N1 and zn − L < ε , ∀n ≥ N2 .
(1.25)
Specifically, Choose N = max {N1 , N2 }. Using (1.25) we see that
−ε < xn − L, and zn − L < ε , ∀n ≥ N. (Why?) Using this with (1.22) we can conclude that n ≥ N =⇒ −ε < yn − L < ε . (Why?) Hence, lim yn = L, as desired. n→∞
Remark. The conclusion of Prop. 1.5.7 holds true if we replace (1.22) by ∃N0 ∈ N such that xn ≤ yn ≤ zn , ∀n ≥ N0 .
(1.26)
Suitably modify the way N is chosen in the proof of Prop. 1.5.7 to account for this more general condition. (Tell how.)
© 2011 by Taylor & Francis Group, LLC
15
A Basic Analysis Toolbox Proposition 1.5.8. If lim xn = L, where L 6= 0, then ∃m > 0 and N ∈ N such that n→∞
|xn | > m, ∀n ≥ N. (In words, if a sequence has a nonzero limit, then its terms must be bounded away from zero for sufficiently large indices n.) Outline of Proof: Let ε = |L| 2 .Then, ε > 0. (Why?) ∃N ∈ N such that |xn − L| < ε = |L| 2 , ∀n ≥ N. (Why?) |L| Thus, ||xn | − |L|| < 2 , ∀n ≥ N. (Why?) |L| That is, − |L| 2 < |xn | − |L| < 2 , ∀n ≥ N. (Why?) So, |L| 2 < |xn | , ∀n ≥ N. The conclusion follows by choosing m = |L| 2 . (Why?)
Proposition 1.5.9. Suppose that lim xn = L and lim yn = M. Then, n→∞
n→∞
i.) lim (xn + yn ) = L + M; n→∞ ii.) lim xn yn = LM. n→∞
Outline of Proof: Proof of (i): The strategy is straightforward. Because there are two sequences, we split the given error tolerance ε into two parts of size ε2 each, apply the limit definition to each sequence with the ε2 tolerance, and finally put the two together using the triangle inequality. Let ε > 0. Then, ε2 > 0. We know that
ε ∃N1 ∈ N such that |xn − L| < , ∀n ≥ N1 . (Why?) 2 ε ∃N2 ∈ N such that |yn − M| < , ∀n ≥ N2 . (Why?) 2
(1.27) (1.28)
How do you then select N ∈ N such that (1.27) and (1.28) hold simultaneously for all n ≥ N? For such an N, observe that n ≥ N =⇒ |(xn + yn) − (L + M)| ≤ |xn − L| + |yn − M| < ε .
(1.29)
(Why?) Hence, we conclude that lim (xn + yn) = L + M. n→∞
Proof of (ii): This time the strategy is a bit more involved. We need to show that |xn yn − LM| can be made arbitrarily small for sufficiently large n using the hypotheses that |xn − L| and |yn − M| can each be made arbitrarily small for sufficiently large n. This requires two approximations, viz., making xn close to L while simultaneously making yn close to M. This suggests that we bound |xn yn − LM| above by an expression involving |xn − L| and |yn − M| . To accomplish this, we add and subtract
© 2011 by Taylor & Francis Group, LLC
16
Volume 2: Stochastic Equations
the same middle term in |xn yn − LM| and apply certain absolute value properties. Precisely, observe that |xn yn − LM| = |xn yn − Mxn + Mxn − LM| = |xn (yn − M) + M (xn − L)|
(1.30)
≤ |xn | |yn − M| + |M| |xn − L| .
(This trick is a workhorse throughout the text!) The tack now is to show that both terms on the right-hand side of (1.30) can be made less than ε2 for sufficiently large n. Let ε > 0. Proposition 1.5.6 implies that ∃K > 0 for which |xn | ≤ K, ∀n ∈ N.
(1.31)
Also, because {yn } is convergent to M, ∃N1 ∈ N such that |yn − M| <
ε , ∀n ≥ N1 . 2K
(1.32)
In view of (1.31) and (1.32), we obtain n ≥ N1 =⇒ |xn | |yn − M| ≤ K |yn − M| < K ·
ε ε = . 2K 2
(1.33)
This takes care of the first term in (1.30). Next, because {xn } is convergent to L, ∃N2 ∈ N such that ε |xn − L| < , ∀n ≥ N2 . (1.34) 2 (|M| + 1) Now, argue in a manner similar to (1.33) to conclude that
ε n ≥ N2 =⇒ |M| |xn − L| < . (Tell how.) 2
(1.35)
Choose N ∈ N so that (1.33) and (1.35) hold simultaneously, ∀n ≥ N. Then, use (1.30) through (1.35) to conclude that n ≥ N =⇒ |xn yn − LM| < ε . (How?) Hence, we conclude that lim xn yn = LM. This completes the proof. n→∞
Because we were unfolding the argument in somewhat reverse order for motivation, it would be better now to start with ε > 0 and reorganize the train of the suggested argument into a polished proof. (Do so!) Exercise 1.5.4. Let c ∈ R and assume that lim xn = L and lim yn = M. Prove that n→∞ n→∞ i.) lim cxn = cL, n→∞
ii.) lim (xn − yn ) = L − M. n→∞
The following lemma can be proven easily using induction. (Tell how.)
© 2011 by Taylor & Francis Group, LLC
17
A Basic Analysis Toolbox
Lemma 1.5.10. If {nk } ⊂ N is an increasing sequence, then nk ≥ k, ∀k ∈ N. Proposition 1.5.11. If lim xn = L and xnk is any subsequence of {xn } , then n→∞ lim xnk = L . (In words, all subsequences of a sequence convergent to L also conk→∞
verge to L.) Outline of Proof: Let ε > 0. There exists N ∈ N such that |xn − L| < ε , ∀n ≥ N. Now, fix any K0 ≥ N and use Lemma 1.5.10 to infer that k ≥ K0 =⇒ nk > k ≥ K0 ≥ N =⇒ xnk − L < ε . (Why?)
The conclusion now follows. (Tell how.)
Exercise 1.5.5. Prove that if lim xn = 0 and {yn } is bounded, then lim xn yn = 0. n→∞
n→∞
Exercise 1.5.6. i.) Prove that if lim xn = L, then lim |xn | = |L| . n→∞
n→∞
ii.) Provide an example of a sequence {xn } for which ∃ lim |xn |, but ∄ lim xn . n→∞
n→∞
Exercise 1.5.7. Prove the following: i.) If lim xn = L, then lim xnp = L p , ∀p ∈ N.
n→∞ n→∞ √ √ ii.) If xn > 0, ∀n ∈ N, and lim xn = L, then lim xn = L. n→∞
n→∞
Important connections between sequences and the derived set and closure of a set are provided in the following exercise. Exercise 1.5.8. Let ∅ 6= S ⊂ R. Prove the following: i.) x ∈ S′ iff ∃ {xn } ⊂ S \ {x} such that lim xn = x. n→∞
ii.) x ∈ clR (S) iff ∃ {xn } ⊂ S such that lim xn = x. n→∞
Proposition 1.5.12. If {xn } is a bounded sequence in R, then there exists a convergent subsequence xnk of {xn }. Outline of Proof: Let Rx = {xn |n ∈ N}. We split the proof into two cases.
Case 1: Rx is a finite set, say Rx = {y1 , y2 , . . . , ym }. It cannot be the case that the set x−1 ({yi }) = {n ∈ N|xn = yi } is finite, for every i ∈ Sm −1 {1, 2, . . . , m} because N = i=1 x ({yi }). (Why?) As such, there is at least one i0 ∈ {1, 2, . . . , m} such that x−1 yi0 is infinite. Use this fact to inductively construct a sequence n1 < n2 < . . . in N such that xnk = yi0 , ∀k ∈ N. (Tell how.) Observe that xnk is a convergent subsequence of {xn }. (Why?) Case 2: Rx is infinite.
© 2011 by Taylor & Francis Group, LLC
18
Volume 2: Stochastic Equations
Because {xn } is bounded, it follows from Thrm. 1.4.12 that Rx′ 6= ∅, say L ∈ Rx′ . Use the definition of limit point to inductively construct a subsequence xnk of {xn } such that xnk −→ L. How does this complete the proof? The combination of the hypotheses of monotonicity and boundedness implies convergence, as the next result suggests. Proposition 1.5.13. If {xn } is a nondecreasing sequence that is bounded above, then {xn } converges and lim xn = sup {xn |n ∈ N} . n→∞
Outline of Proof: Because {xn |n ∈ N} is a nonempty subset of R that is bounded above, ∃ sup {xn |n ∈ N}, call it L. (Why?) Let ε > 0. Then, ∃N ∈ N such that L − ε < xN . (Why?) Consequently, n ≥ N =⇒ L − ε < xN ≤ xn ≤ L < L + ε =⇒ |xn − L| < ε . (Why?) This completes the proof.
Exercise 1.5.9. Formulate and prove a result analogous to Prop. 1.5.13 for nonincreasing sequences. Exercise 1.5.10. i.) Let {xk } be a sequence of nonnegative real numbers. For every n ∈ N, define sn = ∑nk=1 xk . Prove n o that the sequence {sn } converges iff it is bounded above. ii.) Prove that
an n!
n
converges, ∀a ∈ R. In fact, lim an! = 0. n→∞
Now that we know about subsequences, it is convenient to introduce a generalization of the notion of the limit of a real-valued sequence. We make the following definition. Definition 1.5.14. Let {xn } ⊂ R be a sequence. i.) We say that lim xn = ∞ whenever ∀r > 0, ∃N ∈ N such that xn > r, ∀n ≥ N. (In n→∞ such case, we write xn → ∞.) ii.) For every n ∈ N, let un = sup {xk : k ≥ n} . We define the limit superior of xn by ! lim xn = inf {un |n ∈ N} = inf
n→∞
n∈N
sup xk . k≥n
iii.) The dual notion of limit inferior, denoted lim xn , is defined analogously with sup n→∞
and inf interchanged in (ii), viz.,
lim xn = sup inf xk .
n→∞
© 2011 by Taylor & Francis Group, LLC
n∈N
k≥n
A Basic Analysis Toolbox
19
Some properties of limit superior (inferior) are gathered below. The proofs are standard and can be found in standard analysis texts (see [234]). Proposition 1.5.15. (Properties of Limit Superior and Inferior) i.) lim xn = p ∈ R iff ∀ε > 0, n→∞ a.) There exist only finitely many n such that xn > p + ε , and b.) There exist infinitely many n such that xn > p − ε ; ii.) lim xn = p ∈ R iff p is the largest limit of any subsequence of {xn }; n→∞
iii.) lim xn = ∞ iff ∀r ∈ R, ∃ infinitely many n such that xn > r; n→∞
iv.) If xn < yn , ∀n ∈ N, then a.) lim xn ≤ lim yn , n→∞ n→∞ b.) lim xn ≤ lim yn ; n→∞
n→∞
v.) lim (−xn ) = − lim xn ; n→∞
n→∞
vi.) lim xn ≤ lim xn ; n→∞
n→∞
vii.) lim xn = p iff lim xn ≤ lim xn = p; n→∞
n→∞
n→∞
viii.) lim xn + lim yn ≤ lim (xn + yn ) ≤ lim (xn + yn ) ≤ lim xn + lim yn ; n→∞ n→∞ n→∞ n→∞ n→∞ n→∞ lim yn , provided the ix.) If xn ≥ 0 and yn ≥ 0, ∀n ∈ N, then lim (xn yn ) ≤ lim xn n→∞ n→∞ n→∞ product on the right is not of the form 0 · ∞.
1.5.3
Cauchy Sequences
Definition 1.5.16. A sequence {xn } is a Cauchy sequence if ∀ε > 0, ∃N ∈ N such that n, m ≥ N =⇒ |xn − xm | < ε . Intuitively, the terms of a Cauchy sequence squeeze together as the index increases. Given any positive error tolerance ε , there is an index past which any two terms of the sequence, no matter how greatly their indices differ, have values within the tolerance of ε of one another. For brevity, we often write “{xn }is Cauchy” instead of “{xn } is a Cauchy sequence.” Exercise 1.5.11. Prove that the following statements are equivalent: (1) {xn } is a Cauchy sequence. (2) ∀ε > 0, ∃N ∈ N such that xN+p − xN+q < ε , ∀p, q ∈ N. (3) ∀ε > 0, ∃N ∈ N such that |x n − xN | < ε , ∀n ≥ N. (4) ∀ε > 0, ∃N ∈ N such that xN+p − xN < ε , ∀p ∈ N. (5) lim (xn+p − xn ) = 0, ∀p ∈ N. n→∞
We could have included the statement “{xn } is a convergent sequence” in the above list and asked which others imply it or are implied by it. Indeed, which of
© 2011 by Taylor & Francis Group, LLC
20
Volume 2: Stochastic Equations
the two statements {xn } is a convergent sequence or {xn } is a Cauchy sequence seems stronger to you? Which implies which, if either? We will revisit this question after the following lemma. Lemma 1.5.17. (Properties of Cauchy Sequences in R) i.) A Cauchy sequence is bounded. ii.) If a Cauchy sequence {xn } has a subsequence xnk that converges to L, then {xn } itself converges to L. Outline of Proof: Proof of (i): Let {xn } be a Cauchy sequence. Then, by Def. 1.5.16, ∃N ∈ N such that n, m ≥ N =⇒ |xn − xm | < 1. In particular, n ≥ N =⇒ |xn − xN | < 1.
Starting with the last statement, argue as in Prop. 1.5.6 that |xn | ≤ M, ∀n ∈ N, where M = max {|x1 | , |x2 | , . . . , |xN−1 | , |xN | + 1}. So, {xn } is bounded. Proof of (ii): Let ε > 0. ∃N1 ∈ N such that n, m ≥ N1 =⇒ |xn − xm | <
ε 2
(1.36)
and ∃N2 ∈ N such that
ε k ≥ N2 =⇒ xnk − L < . (1.37) 2 (Why?) Now, how do you select N so that (1.36) and (1.37) hold simultaneously? Let n > N and choose any k ∈ N such that k ≥ N. Then, n ≥ N1 and nk ≥ N. (Why?) As such, n ≥ N =⇒ |xn − L| = xn − xnk + xnk − L ≤ xn − xnk + xnk − L < ε . (Why?) This completes the proof.
We now shall prove that convergence and Cauchy are equivalent notions in R. Theorem 1.5.18. (Cauchy Criterion in R) {xn }is convergent ⇐⇒ {xn }is a Cauchy sequence.
© 2011 by Taylor & Francis Group, LLC
21
A Basic Analysis Toolbox Outline of Proof: Proof of =⇒): Suppose that lim xn = L and let ε > 0. Then, ∃N ∈ N such that n→∞
ε n ≥ N =⇒ |xn − L| < . 2 Thus, n, m ≥ N =⇒ |xn − xm | ≤ |xn − L| + |xm − L| <
ε ε + = ε . (Why?) 2 2
Thus, {xn }is a Cauchy sequence. Proof of ⇐=): Let {xn }be a Cauchy sequence. Then, {xn } is bounded (Why?) and so contains a convergent subsequence xnk . (Why?) Denote its limit by L. Then, it follows that, in fact, {xn } converges to L, as needed. (Why?) This completes the proof. Remark. The proofs of the results: i.) A bounded sequence has a convergent subsequence, ii.) A bounded monotone sequence converges, iii.) Cauchy Criterion in R, all require the completeness property of R, the first indirectly via BolzanoWeierstrass, which in turn uses it, the second directly, and the third via use of the first. Actually, all three statements are not only consequences of the completeness property of R, but are equivalent to it. In fact, in more general settings in which order is no longer available (cf. Sections 1.6 and 1.7), completeness of the space is defined to be the property that all Cauchy sequences converge in the space. Exercise 1.5.12. For every n ∈ N, define sn = ∑nk=1 1k . Prove that {sn } diverges.
1.5.4
A Brief Look at Infinite Series
Sequences defined by forming partial sums using terms of a second sequence (e.g., see Exer. 1.5.12) often arise in applied analysis. You might recognize them by the name infinite series. We shall provide the bare essentials of this topic below. A thorough treatment can be found in [236]. Definition 1.5.19. Let {an } be a sequence in R. i.) The sequence {sn } defined by sn = ∑nk=1 ak , n ∈ N is the sequence of partial sums of {an } . ii.) The pair ({an } , {sn }) is called an infinite series, denoted by ∑∞ n=1 an or ∑ an . iii.) If lim sn = s, then we say ∑ an converges and has sum s; we write ∑ an = s. n→∞ Otherwise, we say ∑ an diverges. Remarks. 1. The sequence of partial sums can begin with an index n strictly larger than 1.
© 2011 by Taylor & Francis Group, LLC
22
Volume 2: Stochastic Equations
n 2. Suppose ∑∞ k=1 ak = s and sn = ∑k=1 ak . Observe that ∞
∑
sn +
ak = s.
(1.38)
k=n+1
| {z } Tail
Because lim sn = s, it follows that lim ∑∞ k=n+1 ak = 0. (Why?) n→∞
n→∞
Example. (Geometric Series) k Consider the series ∑∞ k=0 cx , where c, x ∈ R. For every n ≥ 0, subtracting the expressions for sn and xsn yields sn = c 1 + x + x2 + . . . + xn (1.39) −xsn = c x + x2 + . . . + xn + xn+1 (1.40) n+1 (1 − x)sn = c 1 − x .
Hence,
sn =
(
c[1−xn+1 ] , 1−x
x 6= 1, c(n + 1), x = 1.
If |x| < 1, then lim xn+1 = 0, so that lim sn = n→∞ n→∞ (Tell why.)
c 1−x .
Otherwise, lim sn does not exist. n→∞
3n Exercise 1.5.13. Let p ∈ N. Determine the values of x for which ∑∞ n=p c(5x + 1) converges, and for such x, determine its sum.
Proposition 1.5.20. ∑ an converges iff {sn } is Cauchy iff ∀ε > 0, ∃N ∈ N such that p n ≥ N =⇒ ∑k=1 an+k < ε .
Outline of Proof: The first equivalence is immediate (Why?) and the second follows from Exer. 1.5.11. (Tell how.) Corollary 1.5.21. (nth -term test) If ∑ an converges, then lim an = 0. n→∞
Outline of Proof: Take p = 1 in Prop. 1.5.20. n! Exercise 1.5.14. Prove that ∑∞ n=1 an diverges, ∀a > 0.
Proposition 1.5.22. (Comparison Test) If an , bn ≥ 0, ∀n ∈ N, and ∃c > 0 and N ∈ N such that an ≤ cbn , ∀n ≥ N, then i.) ∑ bn converges =⇒ ∑ an converges; ii.) ∑ an diverges =⇒∑ bn diverges.
© 2011 by Taylor & Francis Group, LLC
23
A Basic Analysis Toolbox Outline of Proof: Use Prop. 1.5.13 (Tell how.)
5n 5n Example. Consider the series ∑∞ n=1 3n . Because lim 3n/2 = 0, ∃N ∈ N such that n→∞
5n 5n 1 1 n n ≥ N =⇒ n/2 < 1 =⇒ n < n/2 = √ . (1.41) 3 3 3 3 n √1 (Why?) But, ∑∞ is a convergent geometric series. Thus, Prop. 1.5.22 imn=1 3 5n plies that ∑∞ n=1 3n converges.
Definition 1.5.23. A series ∑ an is absolutely convergent if ∑ |an | converges. It can be shown that rearranging the terms of an absolutely convergent series does not affect convergence (see [236]). So, we can regroup terms at will, which is especially useful when groups of terms simplify nicely. Proposition 1.5.24. (Ratio Test) Suppose ∑ an is a series with an 6= 0, ∀n ∈ N. Let an+1 an+1 , r = lim lim and R = n→∞ an n→∞ an
(where R could be ∞). Then, i.) R < 1 =⇒ ∑ an converges absolutely; ii.) r > 1 =⇒ ∑ an diverges; iii.) If r ≤ 1 ≤ R, then the test is inconclusive.
Outline of Proof: We argue as in [234]. Proof of (i): Assume R < 1 and choose x such that R < x < 1. Observe that an+1 an+1 ≤ x, ∀n ≥ N lim = R < x =⇒ ∃N ∈ N such that n→∞ an an =⇒ |an+1 | ≤ |an | x, ∀n ≥ N. Thus, |aN+1 | ≤ |aN | x
|aN+2 | ≤ |aN+1 | x ≤ |aN | x2 |aN+3 | ≤ |aN+2 | x ≤ |aN+1 | x2 ≤ |aN | x3 .. . (Why?) What can be said about the series |aN | x + x2 + x3 + . . . ? © 2011 by Taylor & Francis Group, LLC
(1.42)
24
Volume 2: Stochastic Equations
Use Prop. 1.5.22 to conclude that ∑ |an | converges. Proof of (ii): Next, assume 1 < r. Observe that an+1 = r > 1 =⇒ ∃N ∈ N such that an+1 ≥ 1, ∀n ≥ N lim an n→∞ an =⇒ |an+1 | ≥ |an | ≥ |aN | > 0, ∀n ≥ N.
(1.43)
(Why?) Thus, an 9 0. (So what?) Proof of (iii): For both ∑ 1n and ∑ n12 , r = R = 1, but ∑ 1n diverges and ∑ n12 converges. n
n Exercise 1.5.15. Determine if ∑∞ n=1 n! converges.
Finally, we will need to occasionally multiply two series in the following sense. ∞ Definition 1.5.25. Given two series ∑∞ n=0 an and ∑n=0 bn , define n
cn =
∑ ak bn−k , ∀n ≥ 0.
k=0
∞ ∞ The series ∑∞ n=0 cn is called the Cauchy product of ∑n=0 an and ∑n=0 bn . p To see why this is a natural definition, consider the partial sum ∑n=0 cn and form a grid by writing the terms a0 , . . . , a p as a column and b0 , . . . , b p as a row. Multiply the terms from each row and column pairwise and observe that the sums along the diagonals (formed left to right) coincide with c0 , . . . , c p . (Check this!) The following proposition describes a situation when such a product converges. The proof of this and other related results can be found in [17]. ∞ Proposition 1.5.26. If ∑∞ n=0 an and ∑n=0 bn both converge absolutely, then the ∞ ∞ Cauchy product ∑∞ c converges absolutely and ∑∞ n=0 n n=0 cn = (∑n=0 an ) (∑n=0 bn ).
1.6
The Spaces RN , k·kRN and MN (R), k·kMN (R)
We now introduce two spaces of objects with which you likely have some familiarity, namely vectors and square matrices, as a first step in formulating more abstract spaces. The key observation is that the characteristic properties of R carry over to these spaces, and their verification requires minimal effort. As you work through this section, use your intuition about how vectors in two and three dimensions behave to help you understand the more abstract setting.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
1.6.1
The Space RN , k·kRN
25
Definition 1.6.1. For every N ∈ N, RN = R · · × R} is the set of all ordered N| × ·{z N times
tuples of real numbers. This set is often loosely referred to as N-space.
A typical element of RN (called a vector) is denoted by a boldface letter, say x, representing the ordered N-tuple hx1 , x2 , . . . , xN i. (Here, xk is the kth component of x.) The zero element in RN is the vector 0 = h0, 0, . . . , 0i . | {z } N times
The algebraic operations defined in R can be applied componentwise to define the corresponding operations in RN . Indeed, we have Definition 1.6.2. (Algebraic Operations in RN ) Let x = hx1 , x2 , . . . , xN i and y = hy1 , y2 , . . . , yN i be elements of RN and c ∈ R, i.) x = y if and only if xk = yk , ∀k ∈ {1, . . . , N}, ii.) x + y = hx1 + y1 , x2 + y2 , . . . , xN + yN i, iii.) cx = hcx1 , cx2 , . . . , cxN i.
The usual properties of commutativity, associativity, and distributivity of scalar multiplication over addition carry over to this setting by applying the corresponding property in R componentwise. For instance, because xi + yi = yi + xi , ∀i ∈ {1, . . . , n} , it follows that x + y = hx1 + y1 , x2 + y2 , . . . , xN + yN i = hy1 + x1 , y2 + x2 , . . . , yN + xN i
(1.44)
= y + x.
Exercise 1.6.1. Establish associativity of addition and distributivity of scalar multiplication over addition in RN .
Geometric and Topological Structure From the viewpoint of its geometric structure, what is a natural candidate for a distance-measuring artifice for RN ? There is more than one answer to this question, arguably the most natural of which is the Euclidean distance formula, defined below. Definition 1.6.3. Let x∈ RN . The (Euclidean) norm of x, denoted kxkRN , is defined by s N
kxkRN =
∑ x2k .
k=1
We say that the distance between x and y in RN is given by kx − ykRN . Remarks. 1. When referring to the norm generically or as a function, we write k·kRN .
© 2011 by Taylor & Francis Group, LLC
(1.45)
26
Volume 2: Stochastic Equations
2. There are other “equivalent” ways to define a norm on RN that are more convenient to use in some situations. Indeed, a useful alternative norm is given by kxkRN = max |xi | . 1≤i≤N
(1.46)
By equivalent, we do not mean that the numbers produced by (1.45) and (1.46) are the same for a given x∈ RN . In fact, this is false in a big way! Rather, two norms k·k1 and k·k2 are equivalent if there exist constants 0 < α < β such that
α kxk1 ≤ kxk2 ≤ β kxk1 , ∀x ∈ R.
(1.47)
Suffice it to say that you can choose whichever norm is most convenient to work with within a given series of computations, as long as you don’t decide to use a different one halfway through! By default, we use (1.45) unless otherwise specified. a geometric description of these sets: Exercise 1.6.2. Let ε > 0. Provide i.) A = x ∈ R2 | kxkR2 < ε , ii.) B = y ∈ R3 | ky − h1, 0, 0ikR3 ≥ ε , iii.) C = y ∈ R3 | ky − x0kR3 = 0 , where x0 ∈ R3 is prescribed.
The RN -norm satisfies similar properties as |·| (cf. Prop. 1.4.4), summarized below.
Proposition 1.6.4. Let x, y∈ RN and c ∈ R. Then, i.) kxkRN ≥ 0, ii.) kcxkRN = |c| kxkRN , iii.) kx + ykRN ≤ kxkRN + kykRN , iv.) x = 0 iff kxkRN = 0. Exercise 1.6.3. Prove Prop. 1.6.4 using Def. 1.6.3. Then, redo it using (1.46). Exercise 1.6.4. Let M, p ∈ N. Prove the following string of inequalities:
!p
M p M M
≤ M p−1 ∑ kxi kRp N
∑ xi ≤ ∑ kxi kRN
i=1 N i=1 i=1
(1.48)
R
The space RN , k·kRN has an even richer geometric structure since it can be equipped with a so-called inner product that enables us to define orthonormality (or perpendicularity) and, by extension, the notion of angle in the space. Precisely, we have Definition 1.6.5. Let x, y∈ RN . The inner product of x and y, denoted hx, yiRN , is defined by N
hx, yiRN = ∑ xi yi . i=1
© 2011 by Taylor & Francis Group, LLC
(1.49)
27
A Basic Analysis Toolbox
Note that taking the inner product of any two elements of RN produces a real number. Also, hx, yiRN is often written more compactly as xyT , where yT is the transpose of y (that is, y written as a column vector rather than as a row vector). Some of the properties of this inner product are as follows. Proposition 1.6.6. (Properties of the Inner Product on RN ) Let x, y, z∈ RN and c ∈ R. Then, i.) hcx, yiRN = hx, cyiRN = c hx, yiRN ; ii.) hx + y, ziRN = hx, ziRN + hy, ziRN ; iii.) hx, xiRN ≥ 0; iv.) hx, xiRN = 0 iff x = 0; v.) hx, xiRN = kxk2RN ; vi.) hx, ziRN = hy, ziRN , ∀z ∈ RN =⇒ x = y. Verifying these properties is straightforward and will be argued in a more general setting in Section 1.7. (Try proving them here!) Property (v) is of particular importance because it asserts that an inner product generates a norm. Exercise 1.6.5. Prove Prop. 1.6.6. The following Cauchy-Schwarz inequality is very important. Proposition 1.6.7. (Cauchy-Schwarz Inequality) Let x, y∈ RN . Then, |hx, yiRN | ≤ kxkRN kykRN Outline of Proof: For any y ∈ RN \ {0} , * ! hx, yiRN 0 ≤ x− y, x − kyk2RN
hx, yiRN kyk2RN
(1.50) ! + y
.
RN
(So what?) Why does (1.50) hold for y = 0?
The inner product can be used to formulate a so-called orthonormal basis for RN . Precisely, let e1 = h1, 0, . . . , 0i , e2 = h0, 1, 0, . . . , 0i , . . . , en = h0, . . . , 0, 1i, and observe that kei kRN = 1, ∀i ∈ {1, . . . , N} ,
ei , e j RN = 0, whenever i 6= j.
(1.51) (1.52)
This is useful because it yields the following unique representation for the members of RN involving the inner product.
© 2011 by Taylor & Francis Group, LLC
28
Volume 2: Stochastic Equations
Proposition 1.6.8. For every x ∈ RN , N
x = ∑ hx, ei iRN ei .
(1.53)
i=1
If x = hx1 , x2 , . . . , xN i, then (1.53) is a succinct way of writing x = hx1 , 0, . . . , 0i + h0, x2 , . . . , 0i + h0, 0, . . . , xN i .
(1.54)
(Tell why.) Heuristically, this representation indicates how much to “move” in the direction of each basis vector to arrive at x. For any x0 ∈ R and ε > 0, an open interval centered at x0 with radius ε is defined by (x0 − ε , x0 + ε ) = {x ∈ R| |x − x0 | < ε } . (1.55)
Because k·kRN plays the role of |·| and shares its salient characteristics, it is natural to define an open N-ball centered at x0 with radius ε by BRN (x0 ; ε ) = x ∈ RN | kx − x0kRN < ε . (1.56) Exercise 1.6.6. Interpret (1.56) geometrically in R2 and R3 .
The terminology and results developed for (R, |·|) in Section 1.4 can be extended to RN , k·kRN with the only formal change being to replace |·| by k·kRN . Theorem 1.4.12 also holds, but a different approach is used to prove it because of the lack of ordering in RN . (See [17] for details.) Exercise 1.6.7. Convince yourself of the validity of the generalization of the topological results to RN . Sequences in RN Definition 1.6.9. A function x : N −→ RN is a sequence in RN . The definitions of convergent and Cauchy sequences are essentially the same as in R and all the results carry over without issue, requiring only that we replace |·| by k·kRN . Exercise 1.6.8. Convince yourself that the results from Sections 1.5.1 through 1.5.3 extend to the RN setting. Use the fact that the algebraic operations in RN are performed componentwise to help you complete the following exercise. Exercise 1.6.9. i.) Consider the two real sequences {xm } and {ym } whose mth terms are given by xm =
1 2m , ym = , m ∈ N. m2 4m + 2
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
29
Show that lim hxm , ym i = 0, 12 . m→∞
ii.) Generally, if lim xm = p and lim ym = q, what can you conclude about {hxm , ym i} m→∞
m→∞
in R2 ? iii.) Consider a sequence {h(x1 )m , (x2 )m , . . . , (xN )m i} in RN . Establish a necessary and sufficient condition for this sequence to converge in RN . A strategy similar to the one used in Exer. 1.6.9, coupled with Thrm. 1.5.18, is used to prove the following theorem. Theorem 1.6.10. (Cauchy Criterion in RN ) {xn } converges in RN iff {xn } is a Cauchy sequence in RN . We say RN , k·kRN is complete. Use the properties of sequences in RN to complete the following exercises. N Exercise 1.6.10. Assume
that {xm } is a convergent sequence in R . Prove that
lim kxm kRN = lim xm . (We say that the norm k·kRN is continuous.) m→∞ m→∞ RN
n o
Exercise 1.6.11. Let a ∈ R. Compute sup kxkax N : x ∈ RN \ {0} . RN
R
Exercise 1.6.12. Let δ , ε > 0, a, b ∈ R, and x0 ∈ RN be prescribed. Compute sup {kzkRN : z ∈ A }, where A = {ax + by : x ∈ BRN (x0 ; ε ) ∧ y ∈ BRN (x0 ; δ )} . Exercise 1.6.13. Let x ∈ RN \ {0} , a 6= 0, and p ∈ N. Must the series
x 2m ∑∞ m=p akxk N N converge? If so, can you determine its sum? R R
m/2 1 Exercise 1.6.14. Let x ∈ BR2 0; 31 and p ∈ N. Must the series ∑∞ m=p 2x, 4 x R2 converge? If so, can you determine its sum?
Exercise 1.6.15. Let {cn }be a real sequence and z ∈ RN . Assuming convergence of all series involved, prove that
∞
∞
∑ cn z ≤ ∑ |cn | kzkRN .
n=1 N n=1 R
Exercise 1.6.16. Let R > 0 and ha, b, ci ∈ ∂ BR3 (0; R) and define the function f : R −→ R3 by f(t) = a sin πt , b cos (2t + π ), c . Show that {kf(t)kR3 : t ∈ R}< ∞ .
© 2011 by Taylor & Francis Group, LLC
30
1.6.2
The Space
Volume 2: Stochastic Equations MN (R), k·kMN (R)
A mathematical description of certain scenarios involves considering vectors whose components are themselves vectors. Indeed, consider A = hx1 , x2 , . . . , xN i ,
(1.57)
xi = hxi1 , xi2 , . . . , xiN i , 1 ≤ i ≤ N.
(1.58)
where Viewing xi in column form enables us to express A more elegantly as the N × N matrix x11 x12 · · · x1N x21 x22 · · · x2N A = . . . . . (1.59) . . . . . . . . xN1 xN2 · · · xNN
It is typical to write
A = [xi j ] , where 1 ≤ i, j ≤ N,
(1.60)
and refer to xi j as the i jth entry of A.
Definition 1.6.11. Let N ∈ N \ {1} . MN (R) is the set of all N × N matrices with real entries. The following terminology is standard in this setting. Definition 1.6.12. Let A ∈ MN (R). i.) A is diagonal if xi j = 0, whenever i 6= j; ii.) A is symmetric if xi j = x ji , ∀i, j ∈ {1, . . . , N}; iii.) The trace of A is the real number trace(A) = ∑Ni=1 xii ; iv.) The zero matrix, denoted 0, is the unique member of MN (R) for which xi j = 0, ∀1 ≤ i, j ≤ N. v.) The identity matrix, denoted I, is the unique diagonal matrix in MN (R) for which xii = 1, ∀1 ≤ i ≤ N. vi.) The transpose of A, denoted AT , is the matrix AT = [x ji ]. (That is, the ijth entry of AT is x ji .) We assume a modicum of familiarity with elementary matrix operations and gather some basic ones below. Note that some, but not all, of the operations are performed entry-wise. Definition 1.6.13. (Algebraic Operations in MN (R)) Let A = [ai j ] , B = [bi j ] , and C = [ci j ] be in MN (R) and α ∈ R. i.) A0 = I, ii.) α A = [α ai j ], iii.) A + B= [ai j + bi j ], iv.) AB = ∑Nr=1 air br j . © 2011 by Taylor & Francis Group, LLC
31
A Basic Analysis Toolbox
Exercise 1.6.17. Consider the operations defined in Def. 1.6.13. i.) Does A + B = B + A, ∀A,B ∈ MN (R)? ii.) Does AB = BA, ∀A,B ∈ MN (R)? iii.) Must either (A + B) C = AC + BC or C (A + B) = CA + CB hold, ∀A,B,C ∈ MN (R)? iv.) Does (AB) C = A (BC), ∀A,B,C ∈ MN (R)? We assume familiarity with the basic properties of determinants of square matrices (see [196]). They are used to define invertibility. Proposition 1.6.14. For any A ∈ MN (R) for which det(A) 6= 0, there exists a unique B ∈ MN (R) such that AB = BA = I. We say A is invertible and write B = A−1 . The notion of an eigenvalue arises in the study of stability theory of ordinary differential equations (ODEs). Precisely, we have Definition 1.6.15. Let A ∈ MN (R). i.) A complex number λ0 is an eigenvalue of A if det(A − λ0I) = 0. ii.) An eigenvalue λ0 has multiplicity M if det (A − λ0I) = p(λ ) (λ − λ0)M ; that is, (λ − λ0)M divides evenly into det (A − λ0I). a0 Exercise 1.6.18. Let A = , where a, b 6= 0. 0b i.) Compute the eigenvalues of A. ii.) Compute A−1 and its eigenvalues. iii.) Generalize the computations in (i) and (ii) to the case of a diagonal N × N matrix B whose diagonal entries are all nonzero. Fill in the blank: is an eigenvalue of B−1.
If λ is an eigenvalue of B, then
We can equip MN (R) with various norms in the spirit of those used in RN . Let A ∈ MN (R). Three standard choices for kAkMN are kAkMN
"
N
N
2 = ∑ ∑ ai j i=1 j=1
N
kAkMN =
N
∑ ∑ a i j ,
i=1 j=1
kAkMN = max ai j . 1≤i, j≤N
#1/2
,
(1.61) (1.62) (1.63)
It can be shown that (1.61) through (1.63) are equivalent in a sense similar to (1.47). Exercise 1.6.19. Prove that each of (1.61) through (1.63) satisfies the properties in Prop. 1.6.4, appropriately extended to MN (R).
© 2011 by Taylor & Francis Group, LLC
32
Volume 2: Stochastic Equations
Exercise 1.6.20. Let A, B ∈ MN (R). Prove that kABkMN ≤ kAkMN kBkMN . As in RN , a sequence in MN (R) is an MN (R)-valued function whose domain is N. If lim kAm − AkMN = 0, we say {Am } converges to A in MN (R) and write m→∞
“Am −→ A in MN (R).” The similarity in the definitions of the norms used in RN and MN (R) suggests that checking convergence is performed entry-wise. The same N is true of Cauchy sequences yourself!) By extension of Thrm. in M (R). (Convince 1.6.10, we can argue that MN (R), k·kMN (R) is complete with respect to any of the norms (1.61) through (1.63). (Tell why carefully.) Let A ∈ MN (R) and x ∈ RN . From the definition of matrix multiplication, if we view x as a N × 1 column matrix, then because A is an N × N matrix, we know that Ax is a well-defined N × 1 column matrix that can be identified as a member of RN . As such, the function fA : RN −→ RN given by fA (x) = Ax is well-defined. Such mappings are used frequently in Chapter 2. −t
e
0
Exercise 1.6.21. Prove that x : kxkR2 = 1 ∧ t > 0 is bounded. 0 e−2t R2 Exercise 1.6.22. If (xi j )m is a real Cauchy sequence for each 1 ≤ i, j ≤ 2, must the sequence {Am } , where Am = (xi j )m , be Cauchy in M2 (R)? Prove your claim. Exercise 1.6.23. Let {Am } be a sequence in MN (R). i.) If lim Am = 0, what must be true about each of the N 2 sequences formed using m→∞
the entries of Am ? ii.) If lim Am = I, what must be true about each of the N 2 sequences formed using m→∞
the entries of Am ? iii.) More generally, if lim Am = B, what must be true about each of the N 2 sem→∞
quences formed using the entries of Am ? Exercise 1.6.24. i.) If Am −→ A in MN (R), must Am x −→ Ax in RN , ∀x ∈ RN ? ii.) If xm −→ x in RN , must Axm −→ Ax in RN , ∀A ∈ MN (R)? iii.) If Am −→ A in MN (R) and xm −→ x in RN , must {Am xm } converge in RN ? If so, what is its limit?
1.7
Abstract Spaces
Many other spaces possess the same salient features regarding norms, inner prod N N ucts, and completeness exhibited by R , k·kRN and M (R), k·kMN (R) . At the moment we would need to verify them for each such space that we encountered
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
33
individually, which is inefficient. Rather, it would be beneficial to examine a more abstract structure possessing these characteristics and establish results directly for them. In turn, we would need only to verify that a space arising in an investigation had this basic structure and then invoke all concomitant results immediately. This will save us considerable work in that we will not need to reformulate all properties each time we introduce a new space. This section is devoted to the development of such abstract structures. (See [243] for a thorough treatment.)
1.7.1
Banach Spaces
We begin with the notion of a linear space over R. Definition 1.7.1. A real linear space X is a set equipped with addition and scalar multiplication by real numbers satisfying the following properties: i.) x + y = y + x, ∀x, y ∈ X; ii.) x + (y + z) = (x + y) + z, ∀x, y, z ∈ X; iii.) There exists a unique element 0 ∈ X such that x + 0 = 0 + x, ∀x ∈ X; iv.) For every x ∈ X, there exists a unique element −x ∈ X such that x + (−x) = (−x) + x = 0, ∀x ∈ X; v.) a(bx) = (ab)x, ∀x ∈ X and a, b ∈ R; vi.) a(x + y) = ax + ay, ∀x, y ∈ X and a ∈ R; vii.) (a + b)x = ax + bx, ∀x ∈ X and a, b ∈ R. Restricting attention to a subset Y of elements of a linear space X that possesses the same structure as the larger space leads to the following notion. Definition 1.7.2. Let X be a real linear space. A subset Y ⊂ X, equipped with the same operations as X, is a linear subspace of X if i.) x, y ∈ Y =⇒ x + y ∈ Y , ii.) x ∈ Y =⇒ ax ∈ Y, ∀a ∈ R. Exercise 1.7.1. i.) Verify that (R, |·|) , RN , k·kRN , and MN (R), k·kMN (R) are linear spaces. ii.) Is Y = A ∈ MN (R) : A is diagonal a linear subspace of MN (R)?
We can enhance the structure of a real linear space by introducing a topology so that limit processes can be performed. One way to accomplish this is to equip the space with a norm in the following sense. Definition 1.7.3. Let X be a real linear space. A real-valued function k·kX : X −→ R is a norm on X if ∀x, y ∈ X and a ∈ R, i.) kxkX ≥ 0, ii.) kaxkX = |a| kxkX , iii.) kx + ykX ≤ kxkX + kykX , iv.) x = 0 iff kxkX = 0.
© 2011 by Taylor & Francis Group, LLC
34
Volume 2: Stochastic Equations
We say that the distance between x and y is kx − ykX . We use this to obtain the following richer abstract structure. Definition 1.7.4. A real linear space X equipped with a norm k·kX is called a (real) normed linear space. N We in Sections 1.4 through 1.6 that (R, |·|) , R , k·kRN , know from our work and MN (R), k·kMN (R) are all normed linear spaces. Many of the normed linear spaces that we will encounter are collections of functions satisfying certain properties. Some standard function spaces (aka Sobolev spaces) and typical norms with which they are equipped are listed below. Momentarily, we assume an intuitive understanding of continuity, differentiability, and integrability. These notions will be defined more rigorously in Section 1.8. A detailed technical treatment of Sobolev spaces can be found in [1]. Some Common Function Spaces: Let I ⊂ R and X be a normed linear space. 1.) C (I; X) = { f : I −→ X | f is continuous on I} equipped with the sup norm k f kC = sup k f (t)kX .
(1.64)
t∈I
2.) Cn (I; X) = { f : I −→ X | f is n times continuously differentiable on I} equipped with
i h
k f kCn = sup k f (t)kX + f ′ (t) X + . . . + f (n) (t) . (1.65) 3.) Let 1 ≤ p < ∞.
t∈I L p (I; R)
X
R| f p
= { f : I −→ k f kL p =
ˆ
is integrable on I} equipped with p
I
| f (t)| dt
1
p
.
(1.66)
p 4.) Let 1 ≤ p < ∞. Lloc (I; R) = { f : I −→ R| f p is integrable on compact subsets of I} equipped with (1.66).
5.) H2 (I; R) = f ∈ L2 (I; R)| f ′ , f ′′ exist and f ′′ ∈ L2 (I; R) equipped with k f k H2 =
ˆ
I
2
| f (t)| dt
1 2
.
(1.67)
6.) H10 (a, b; R) = { f : (a, b) −→ R| f ′ exists and f (a) = f (b) = 0} equipped with k f k H1 = 0
ˆ 1 2 2 | f (t)|2 + f ′ (t) dt .
(1.68)
I
n o 7.) Let m ∈ N. W2,m (I; R) = f ∈ L2 (I; R)| f (k) ∈ L2 (I; R), ∀k = 1, . . . , m equipped with ˆ 21 ′ 2 (m) 2 2 k f kW2,m = | f (t)| + f (t) + . . . + f (t) dt . (1.69) I
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
35
Here, f (k) represents the kth -order derivative of f. (Technically, this is a generalized derivative defined in a distributional sense.) The notions of convergent and Cauchy sequences extend to any normed linear space in the same manner as in Section 1.6. For example, we say that an X-valued sequence {xn } converges to x in X if lim kxn − xkX = 0. n→∞
Exercise 1.7.2. i.) Interpret the statement “ lim xn = x in X” for these specific choices of X: n→∞
a.) (1.64) b.) (1.66) c.) (1.69) ii.) Interpret the statement “{xn } is Cauchy in X” for the same choices of X. When working with specific function spaces, knowing when Cauchy sequences in X must converge in X is often crucial. In other words, we need to know if a space is complete in the following sense. Definition 1.7.5. (Completeness) i.) A normed linear space X is complete if every Cauchy sequence in X converges to an element of X. ii.) A complete normed linear space is called a Banach space. We shall routinely work with sequences in C (I; X ), where X is a Banach space. We now focus on the terminology and some particular results for this space. Definition 1.7.6. Suppose that ∅ 6= S ⊂ D ⊂ R and fn , f : D −→ X , n ∈ N. i.) { fn } converges uniformly to f on S whenever ∀ε > 0, ∃N ∈ N such that n ≥ N =⇒ sup k fn (x) − f (x)kX < ε . x∈S
(We write “ fn −→ f uniformly on S.”) ii.) { fn } converges pointwise to f on S whenever lim fn (x) = f (x), ∀x ∈ S. n→∞
iii.) { fn } is uniformly bounded on S whenever ∃M > 0 such that sup sup k fn (x)kX ≤ M. n∈N
x∈S
iv.) ∑∞ k=1 f k (x) converges uniformly to f(x) on S whenever sn −→ f uniformly on S, where sn (x) = ∑nk=1 fk (x). It can be shown that each of the function spaces listed above is complete with respect to the norm provided. Verification of this requires the use of various tools involving the behavior of sequences of functions and integrability. We consider the most straightforward one in the following exercise.
© 2011 by Taylor & Francis Group, LLC
36
Volume 2: Stochastic Equations
Exercise 1.7.3. i.) Prove that C ([a, b] ; R) equipped with the sup norm (1.64) is complete. ii.) How does the argument change if R is replaced by a Banach space X ? Can X be any normed linear space, or must it be complete? Explain. Strong Cautionary Remark! We have seen that a normed linear space can be equipped with different norms. As such, we must bear in mind that completeness is norm dependent. Indeed, equipping the spaces above with norms other than those specified by (1.64) through (1.69) could foresake completeness! For instance, C ([a, b]; R) equipped with (1.67) is NOT complete. (See [160].) The next Cauchy-like condition for checking the uniform convergence of a series of functions follows directly from the completeness of C (I; X ). Proposition 1.7.7. ∑∞ k=1 f k (x) converges uniformly on S iff ∀ε > 0, ∃N ∈ N such that
n+p
(1.70) n ≥ N ∧ p ∈ N =⇒ sup ∑ fk (x) < ε .
x∈S k=n+1 X
The following convergence result is useful in certain fixed-point arguments arising in Chapter 5. Proposition 1.7.8. (Weierstrass M-Test) Let {Mk } ⊂ [0, ∞) such that ∀k ∈ N, sup k fk (x)kX ≤ Mk . x∈S
∞ If ∑∞ k=1 Mk converges, then ∑k=1 f k (x) converges uniformly on S.
Outline of Proof: Let ε > 0. There exists N ∈ N such that n+p
n ≥ N =⇒
∑
Mk < ε .
k=n+1
(Why?) For every n ≥ N and p ∈ N, observe that ∀x ∈ S,
n+p
n+p n+p
∑ fk (x) ≤ ∑ k fk (x)kX ≤ ∑ Mk < ε .
k=n+1
k=n+1 k=n+1 X
Now, use the completeness of C (I; X ) and Prop. 1.7.7. (Tell how.)
Exercise 1.7.4. Prove Props. 1.7.7 and 1.7.8. Exercise 1.7.5. Assume that gn −→ g uniformly on [a, b] and that f is uniformly continuous on [a, b]. Prove that f (gn ) −→ f (g) uniformly on [a, b].
© 2011 by Taylor & Francis Group, LLC
37
A Basic Analysis Toolbox
Remark. Taylor series representations of infinitely differentiable functions are presented in elementary calculus. Some common examples are N
xn ∑ , x ∈ R, N→∞ n=0 n!
ex = lim
(1.71)
N
(−1)n x2n+1 , x ∈ R, n=0 (2n + 1)!
∑ N→∞
sin(x) = lim
(1.72)
N
(−1)n x2n , x ∈ R. n=0 (2n)!
∑ N→∞
cos(x) = lim
(1.73)
It can be shown that the convergence in each case is uniform on all compact subsets of R. The benefit of such a representation is the uniform approximation of the function on the left-hand side by the sequence of nicely behaved polynomials on the right-hand side. Generalizations of these formulae to more abstract settings will be a key tool throughout the text. The basic topological notions of open, closed, bounded, etc. carry over to normed linear spaces in the form of the metric topology defined using the norm k·kX . We use the following notation: BX (x0 ; ε ) = {x ∈ X | kx − x0 kX < ε } , clX (Z ) = closure of Z (in the sense of k·kX ). Exercise 1.7.6. Describe the elements of the ball BC([0,2];R) x2 ; 1 .
(1.74)
Some topological results, like the Bolzano-Weierstrass and Heine-Borel Theorems, do not extend to the general Banach space setting because they rely on intrinsic properties of RN . This will present a minor obstacle in Chapter 5, at which time we will revisit the issue. The need to restrict our attention to a particular subspace of a function space whose elements satisfy some special characteristic arises often. But, can we be certain that we remain in the subspace upon performing limiting operations involving its elements? Put differently, must a subspace of a Banach space be complete? The answer is provided easily by the following exercise.
Exercise 1.7.7. Let Y be the subspace ((0, 2]; |·|) of R. Prove that in Y, but that there does not exist y ∈ Y to which n2 converges.
2 n
is Cauchy
If the subspace had been closed in the topological sense, would it have made a difference? It turns out that it would have indeed, as suggested by: Proposition 1.7.9. A closed subspace Y of a Banach space X is complete.
© 2011 by Taylor & Francis Group, LLC
38
Volume 2: Stochastic Equations
Exercise 1.7.8. Prove Prop. 1.7.9. Exercise 1.7.9. Let (X , k·kX ) and (Y , k·kY ) be real Banach spaces. Prove that (X × Y ; k·k1 ) and (X × Y ; k·k2 ) are also Banach spaces, where k(x, y)k1 = kxkX + kykY , 1/2 k(x, y)k2 = kxk2X + kyk2Y .
1.7.2
(1.75) (1.76)
Hilbert Spaces
Equipping RN with a dot product enhanced its structure by introducing the notion of orthogonality. This prompts us to define the general notion of an inner product on a linear space. Definition 1.7.10. Let X be a real linear space. A real-valued function h·, ··iX : X × X −→ R is an inner product on X if ∀x, y, z ∈ X and a ∈ R, i.) hx, yiX = hy, xiX , ii.) hax, yiX = a hx, yiX , iii.) hx + y, ziX = hx, ziX + hy, ziX , iv.) hx, xiX > 0 iff x 6= 0. The pair (X, h·, ··iX ) is called a (real) inner product space. Some Common Inner Product Spaces: 1.) RN equipped with (1.49). 2.) C ([a, b] ; R) equipped with h f , giC =
ˆ
b
f (t)g(t)dt.
(1.77)
a
3.) L2 (a, b; R) equipped with (1.77). 4.) W2,m (a, b; R) equipped with h f , giW2,k =
ˆ bh a
i f (t)g(t) + f ′ (t)g′ (t) + . . . + f (m) (t)g(m) (t) dt.
(1.78)
Exercise 1.7.10. Verify that (1.77) and (1.78) are inner products. An inner product on X induces a norm on X via the relationship 1/2
hx, xiX = kxkX .
(1.79)
Exercise 1.7.11. Prove that the usual norms in RN , C ([a, b] ; R), and W2,m (a, b; R) can be obtained from their respective inner products (1.49), (1.77), and (1.78). Propositions 1.6.6 and 1.6.7 actually hold for general inner products. We have
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
39
Proposition 1.7.11. Let (X, h·, ··iX ) be an inner product space and suppose k·kX is given by (1.79). Then, ∀x, y ∈ X and a ∈ R, i.) hx, ayiX = a hx, yiX ; ii.) hx, ziX = hy, ziX , ∀z ∈ X =⇒ x = y; iii.) kaxkX = |a| kxkX ; iv.) (Cauchy-Schwarz) |hx, yiX | ≤ kxkX kykX ; v.) (Minkowski) kx + ykX ≤ kxkX + kykX ; vi.) If xn −→ x and yn −→ y in X, then hxn , yn iX −→ hx, yiX . Exercise 1.7.12. Prove Prop. 1.7.11. Exercise 1.7.13. Interpret Prop. 1.7.11(iv) specifically for the space L2 (a, b; R). (This is a special case of the so-called Hölder’s Inequality.) Because inner product spaces come equipped with a norm, it makes sense to further characterize them using completeness. Definition 1.7.12. A Hilbert space is a complete inner product space. Both RN and L2 (a, b; R) equipped with their usual norms are Hilbert spaces, while C ([a, b]; R) equipped with (1.77) is not. Again, the underlying norm plays a crucial role. The notion of a basis encountered in linear algebra can be made precise in the Hilbert space setting and plays a central role in formulating representation formulae for elements of the space. We begin with the following definition. Definition 1.7.13. Let H be a Hilbert space and B = {en |n ∈ K ⊂ N}. i.) The span of B is given by span(B) = {∑n∈K αn en | αn ∈ R, ∀n ∈ K}; ii.) If hen , em iH = 0, then en and em are orthogonal; iii.) The members of B are linearly independent if
∑ αn en = 0 =⇒ αn = 0, ∀n ∈ K;
n∈K
iv.) B is an orthonormal set if a.) ken kH = 1, ∀n ( ∈ K, 0, if n 6= m, b.) hen , em iH = 1, if n = m; v.) B is a complete set if (hx, en iH = 0, ∀n ∈ K) =⇒ (x = 0, ∀x ∈ H ) ; vi.) A complete orthonormal subset of H is a basis for H . The utility of a basis B of a Hilbert space H is that every element of H can be decomposed into a linear combination of the members of B. For general Hilbert spaces, specifically those that are not finite dimensional like RN , the existence of a basis is not guaranteed. There are, however, sufficiency results that indicate when a basis must exist. For instance, consider
© 2011 by Taylor & Francis Group, LLC
40
Volume 2: Stochastic Equations
Definition 1.7.14. An inner product space is separable if it contains a countable dense subset D. Remark. A set D is countable if a one-to-one function f : D → N exists. In such case, the elements of D can be matched in a one-to-one manner with those of N. Intuitively, D has no more elements than N. A thorough treatment of countability can be found in [234]. The proof of the following result can be found in [243]. Theorem 1.7.15. Any separable inner product space has a basis. Example. The set B=
1 √ 2π
cos(nt) sin(nt) √ |n ∈ N ∪ √ |n ∈ N ∪ π π
(1.80)
is an orthonormal, dense subset of L2 (−π , π ; R) equipped with inner product (1.77). (Here, cos(n·) means “cos(nt), −π ≤ t ≤ π .”) Exercise 1.7.14. i.) Prove that k f kL2 = 1, ∀ f ∈ B. ii.) Prove that h f , giL2 = 0, ∀ f 6= g ∈ B. iii.) How would you adapt the set defined in (1.80) for L2 (a, b; R) , where a < b, such that properties (i) and (ii) remain true? Proposition 1.7.16. (Properties of Orthonormal Sets) Let H be an inner product space and Y = {y1 , . . . , yn } an orthonormal set in H . Then, i.) k∑ni=1 yi k2H = ∑ni=1 kyi k2H ; ii.) The elements of Y are linearly independent. iii.) If x ∈ span(Y ), then x = ∑ni=1 hx, yi iH yi ; iv.) If x ∈ H, then hx − ∑ni=1 hx, yi iH yi , yk iH = 0, ∀k ∈ {1, . . . , n} . Exercise 1.7.15. Prove Prop. 1.7.16. The following result is the “big deal!” Theorem 1.7.17. (Representation Theorem for a Hilbert Space) Let H be a Hilbert space and B = {en |n ∈ N} a basis for H . Then, 2 2 ∞ i.) For every
N x ∈ H , ∑k=1 |hx, ek iH | ≤ kxkH ; ii.) lim ∑k=1 hx, ek iH ek − x H = 0, and we write x = ∑∞ k=1 hx, ek iH ek . N→∞
Outline of Proof:
© 2011 by Taylor & Francis Group, LLC
41
A Basic Analysis Toolbox Proof of (i): Observe that ∀N ∈ N,
2
n
0 ≤ ∑ hx, ek iH ek − x
k=1
H * n
=
n
∑ hx, ek iH ek − x, ∑ hx, ek iH ek − x
k=1
k=1
+
H
n
= kxk2H − ∑ |hx, ek iH |2 . k=1
(Why?) Thus, ∑nk=1 |hx, eko iH |2 ≤ kxk2H , ∀n ∈ N. The result then follows because n 2 ∑nk=1 |hx, ek iH | : n ∈ N is an increasing sequence bounded above. (Why and so what?)
Proof of (ii): For each N ∈ N, let SN = ∑Nk=1 hx, ek iH ek . The fact that {SN } is a Cauchy sequence in H follows from Prop. 1.7.16 and part (i) of this theorem. (How?) Moreover, {SN } must converge because H is complete. The fact that the limit is x follows from the completeness of B. (Tell how.) Exercise 1.7.16. Provide the details in the proof of Thrm. 1.7.17(ii). Remark. (Fourier Series) An important application of Thrm. 1.7.17 occurs in the study of Fourier series. A technique often used to solve elementary partial differential equations is the method of separation of variables. This involves identifying a (sufficiently smooth) function with a unique series representation defined using a family of sines and cosines (cf. Section 3.2). To this end, we infer from the example directly following Thrm. 1.7.15 that every f ∈ L2 (−π , π ; R) can be expressed uniquely as ∞
f (t) =
∑ h f (·), en iL2 en
n=1
∞ 1 1 cos(n·) cos(nt) √ + ∑ f (·), √ √ = f (·), √ π π 2π L2 2π n=1 L2 ∞ sin(n·) sin(nt) √ , −π ≤ t ≤ π , + ∑ f (·), √ π π 2 L n=1 where the convergence of the series is in the L2 -sense. For brevity, let ˆ π 1 1 a0 = f (·), √ =√ f (t)dt, 2 π L2 2 π −π ˆ π cos(n·) 1 an = f (·), √ =√ f (t) cos(nt)dt, n ∈ N, π π −π 2 L ˆ π sin(n·) 1 bn = f (·), √ =√ f (t) sin(nt)dt, n ∈ N. π π −π L2
© 2011 by Taylor & Francis Group, LLC
(1.81)
(1.82) (1.83) (1.84)
42
Volume 2: Stochastic Equations
Then, (1.81) can be written as ∞ cos(nt) sin(nt) a0 , −π ≤ t ≤ π . + bn √ f (t) = √ + ∑ an √ π π 2π n=1 The utility of this representation will become apparent in Chapter 3. For additional details on Fourier series, see [121, 301].
1.8
Elementary Calculus in Abstract Spaces
Convergent sequences and their properties play a central role in the development of the notions of limits, continuity, the derivative, and the integral. A heuristic discussion is often what is provided in an elementary calculus course, depicting the process visually by appealing to graphs and using sentences of the form, “As x gets closer to a from left or right, quantity A gets closer to quantity B.” The intuition gained from such an exposition is helpful, but it needs to be formalized for the purposes of our study. The plan of this section is to provide the formal definitions of these notions, together with their properties and important main results. The discussion we provide is a terse outline at best, and you are strongly encouraged to review these topics carefully to fill in the gaps (see [243, 250]). We cut to the chase and consider abstract functions at the onset because the development is very similar to that of real-valued functions. Of course, the drawback is that the graphical illustrations of these concepts that permeate a presentation of the calculus of real-valued functions is not available for general Banach space-valued functions. Nevertheless, retaining the mental association to the visual interpretation of the concepts is advantageous, by way of analogy. Throughout the remainder of this chapter, X and Y are assumed to be real Banach spaces unless otherwise specified.
1.8.1
Limits
We begin with the extension of the notion of convergence (as defined for sequences) to the function setting. Definition 1.8.1. A function f : dom( f ) ⊂ X → Y has limit L (in Y ) at x = a ∈ (dom( f ))′ if for every sequence {xn } ⊂ dom( f ) for which lim kxn − akX = 0, it is n→∞
the case that lim k f (xn ) − LkY = 0. n→∞
We write lim f (x) = L or equivalently, “k f (xn ) − LkY → 0 as x → a.” x→a
Loosely speaking, the interpretation of Def. 1.8.1 for X = Y = R is that as the inputs approach a in any manner possible (i.e., via any sequence in dom( f ) convergent
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
43
to a), the corresponding functional values approach L. The benefit of this particular definition is that the limit rules follow easily from the corresponding sequence properties. Exercise 1.8.1. Formulate and prove extensions of Prop. 1.5.5 - Prop. 1.5.7 and Prop. 1.5.9 to the present function setting. An alternate definition equivalent to Def. 1.8.1, which is often more convenient to work with when involving certain norm estimates in an argument, is as follows: Definition 1.8.2. A function f : dom( f ) ⊂ X → Y has limit L (in Y ) at x = a ∈ (dom( f ))′ if ∀ε > 0, ∃δ > 0 for which x ∈ dom( f ) and 0 < kx − akX < δ =⇒ k f (x) − LkY < ε .
(1.85)
Remark. Interpreting Def. 1.8.2 verbally, we have lim f (x) = L provided that a is x→a a limit point of dom(f ) (so that points of the domain crowd against a) and for any ε > 0, given any open ball BY (L; ε ) around L, there is some sufficiently small socalled “deleted” open ball BX (a; δ ) \ {a} around a such that all members of this ball have images f (x) ∈ BY (L; ε ). That is, ∀ε > 0, ∃δ > 0 such that f (dom( f ) ∩ [BX (a; δ ) \ {a}]) ⊂ BY (L; ε ) .
(1.86)
The special case when X = Y = R shall arise often in our discussion, as will many related situations involving infinity. In particular, we have Definition 1.8.3. Let f : dom( f ) ⊂ R → R. i.) lim f (x) = ∞ means x→a
a.) a ∈ (dom( f ))′ , b.) ∀M > 0, ∃δ > 0 such that x ∈ dom( f ) and 0 < |x − a| < δ =⇒ f (x) > M.
(1.87)
ii.) lim f (x) = L means x→∞
a.) dom( f )∩(M, ∞)6= Ø, ∀M > 0, b.) ∀ε > 0, ∃N > 0 such that x ∈ dom( f ) and x > N =⇒ | f (x) − L| < ε .
(1.88)
Exercise 1.8.2. i.) Interpret the terms in Def. 1.8.3 geometrically. ii.) Formulate analogous definitions when ∞ is replaced by −∞. The notion of one-sided limits for real-valued functions arises occasionally, especially when limits are taken as the inputs approach the endpoints of an interval. Definition 1.8.2 can be naturally modified in such case, with the only changes occurring regarding which inputs near a are considered. (Form such extensions.) We
© 2011 by Taylor & Francis Group, LLC
44
Volume 2: Stochastic Equations
denote the right-limit at a by lim f (x), meaning that all inputs chosen when forming x→a+
sequences that approach a are comprised of values that are greater than or equal to a. Likewise, we denote the left-limit at a by lim f (x). x→a−
1.8.2
Continuity
Understanding the nature of continuous functions is crucial, as much of the work in this text is performed in the space C (I; X). To begin, we need only to slightly modify Defs. 1.8.1 and 1.8.2 to arrive at the following stronger notion of (norm) continuity. Definition 1.8.4. A function f : dom( f ) ⊂ X → Y is continuous at a ∈ dom( f ) if either of these two equivalent statements hold: i.) For every sequence {xn } ⊂ dom( f ) for which lim kxn − akX = 0, it is the case n→∞ that lim k f (xn ) − f (a)kY = 0. We write lim f (xn ) = f lim xn = f (a). n→∞
x→a
n→∞
ii.) ∀ε > 0, ∃δ > 0 for which
x ∈ dom( f ) ∧ kx − akX < δ =⇒ k f (x) − f (a)kY < ε .
(1.89)
We say f is continuous on S ⊂ dom( f ) if f is continuous at every element of S. “Continuity at a” is a strengthening of merely “having a limit at a” because the limit candidate being f (a) requires that a be in the domain of f. It follows from Exer. 1.8.1 that the arithmetic combinations of continuous functions preserve continuity. (Tell how.) Exercise 1.8.3. Prove that f : dom( f ) ⊂ X → R defined by f (x) = kxkX is continuous. More complicated continuous functions can be built by forming compositions of continuous functions, as the following result indicates. Proposition 1.8.5. Let (X , k·kX ), (Y , k·kY ), and (Z , k·kZ ) be Banach spaces and suppose that g : dom(g) ⊂ X → Y and f : dom( f ) ⊂ Y → Z with rng(g) ⊂ dom( f ). If g is continuous at a ∈ dom(g) and f is continuous at g(a) ∈ dom( f ), then f ◦ g is continuous at a. In such case, we write lim f (g (xn )) = f lim g (xn ) = f g lim xn = f (g(a)). n→∞
n→∞
n→∞
Exercise 1.8.4. Prove Prop. 1.8.5 using both formulations of continuity in Def. 1.8.4.
We will frequently consider functions defined on a product space, such as f : X1 × X2 → Y . Interpreting Def. 1.8.4 for such a function requires that we use X1 × X2 as the space X . This raises the question as to what is meant by the phrases “k(x1 , x2 ) − (a, b)kX1 ×X2 < δ ” or “{(xn1 , xn2 )} → (a, b) in X1 × X2 .” One typical product space norm is k(x1 , x2 )kX1 ×X2 = kx1 kX1 + kx2 kX2 .
© 2011 by Taylor & Francis Group, LLC
(1.90)
A Basic Analysis Toolbox
45
Both conditions can be loosely interpreted by focusing on controlling each of the components of the members of the product space. (Make this precise.) Different forms of continuity are used in practice. A weaker form of continuity is to require that the function be continuous in only a selection of the input variables and that such “section continuity” hold uniformly for all values of the remaining variables. For instance, saying that a function f : X1 × X2 → Y is “continuous in X1 uniformly on X2 ” means that for every fixed x2 ∈ X2 , the function g : X1 → Y defined by g (x1 ) = f (x1 , x2 ) satisfies Def. 1.8.4 with X = X1 , and that the choice of x2 ∈ X2 does not affect the estimates or convergence of sequences arising in the continuity calculations involving g. Exercise 1.8.5. i.) Explain what it means for a function f : [a, b] × X × X → X to be continuous on X × X uniformly on [a, b]. ii.) Explain what it means for a mapping Φ : C ([a, b]; X ) → C ([a, b]; X ) to be continuous. iii.) Interpret Def. 1.8.4 for functions of the form f : [a, b] → MN (R). The notion of continuity for real-valued functions can be modified to give meaning to left- and right-sided continuity in a manner similar to one-sided limits. All continuity results also hold for one-sided continuity. A function that possesses both left- and right-limits at x = a, but for which these limits are different, is said to have a jump discontinuity at x = a. Continuous functions enjoy interesting topological properties that lead to some rather strong results concerning boundedness and the existence of fixed-points. We list the essential results below, without proof, for later reference. (See [17, 243] for proofs.) Proposition 1.8.6. (Properties of Continuous Functions) Assume that f : dom( f ) ⊂ X → Y is continuous. i.) For every open set G in Y , f −1 (G) is open in X . ii.) For every compact set K in X , f (K) is compact in Y . iii.) Let Y = R. If K is a compact set in X , then f is bounded on K and ∃x0 , y0 ∈ K such that f (x0 ) = inf { f (x) : x ∈ K} and f (y0 ) = sup { f (x) : x ∈ K} . iv.) (Intermediate-Value Theorem ) Assume dom( f ) = [a, b] and that X = Y = R. If f (a) 6= f (b), then for any z between f (a) and f (b), ∃cz ∈ (a, b) such that f (cz ) = z. v.) If f : X → Y and g : X → Y are continuous and f = g on a set D dense in X , then f = g on X . Exercise 1.8.6. i.) If f : [a, b] → [a, b] is continuous, prove that ∃c ∈ [a, b] such that f (c) = c. ii.) Show that the conclusion of (i) fails if [a, b] is replaced by a half-open, open, or unbounded interval. We now define a concept that is stronger than continuity in the sense that for a given ε > 0, there exists a single δ > 0 that “works” for every point in the set.
© 2011 by Taylor & Francis Group, LLC
46
Volume 2: Stochastic Equations
Precisely, Definition 1.8.7. A function f : S ⊂ dom( f ) ⊂ X → Y is uniformly continuous (UC) on S provided that ∀ε > 0, ∃δ > 0 for which x, y ∈ S ∧ kx − ykX < δ =⇒ k f (x) − f (y)kY < ε . Remark. The critical feature of uniform continuity on S is that the δ depends on the ε only, and not on the actual points x, y ∈ S at which we are located. That is, given any ε > 0, there exists δ > 0 such that k f (x) − f (y)kY < ε , for any pair of points x, y ∈ S with kx − ykX < δ , no matter where they are located in S. In this sense, uniform continuity of f on S is a “global” property, whereas mere continuity at a ∈ S is a “local” property. Example. We claim that f : (0, 1] → R defined by f (x) = 1x is not UC on (0,1]. To see this, let 0 < ε < 1 and suppose that δ is any positive real number. There exists 1 1 n ∈ N such that 2n < δ . Let x0 = 1n and y0 = 2n . Then, x0 and y0 are points of (0,1] such that 1 1 1 |x0 − y0 | = − = < δ, n 2n 2n but | f (x0 ) − f (y0 )| = |n − 2n| = n > ε . Hence, no choice of δ satisfies the definition of uniform continuity and thus, f is not UC on (0,1].
This example illustrates the fact that continuity on S does not imply uniform continuity. However, if S is compact, the implication does hold, as the next result suggests. (See [17] for a proof.) Proposition 1.8.8. Let f : dom( f ) ⊂ X → Y and K a compact subset of dom( f ). If f is continuous on K, then f is UC on K. Exercise 1.8.7. i.) If f : dom( f ) ⊂ R → R be UC on S ⊂ dom( f ). Prove that the image under f of any Cauchy sequence in S is itself a Cauchy sequence. ii.) Prove that if f is UC on a bounded set S ⊂ dom( f ), then f is bounded on S. The notion of absolute continuity, which involves controlling the total displacement of functional values across small intervals, arises in the definition of certain function spaces. Definition 1.8.9. A function f : [a, b] → R is absolutely continuous (AC) on [a, b] if ∀ε > 0, ∃δ > 0 such that for any finite collection {(ai , bi ) : i = 1, . . . , n} of pairwise disjoint open subintervals of [a, b] for which ∑nk=1 |bk − ak | < δ , it is the case that ∑nk=1 | f (bk ) − f (ak )| < ε . It can be shown that the usual arithmetic combinations of AC functions are also AC, and that AC functions are necessarily continuous. (Try showing this!)
© 2011 by Taylor & Francis Group, LLC
47
A Basic Analysis Toolbox
1.8.3
The Derivative
Measuring the rate of change of one quantity with respect to another is central to the formulation and analysis of many mathematical models. The concept is formalized in the real-valued setting via a limiting process of quantities that geometrically resembles slopes of secant lines. We can extend this definition to X -valued functions by making use of the norm on X . This leads to Definition 1.8.10. A function f : (a, b) → X is differentiable at x0 ∈ (a, b) if there exists a member of X , denoted by f ′ (x0 ), such that
f (x0 + h) − f (x0 ) ′
− f (x0 ) (1.91) lim
= 0. h h→0 X
The number f ′ (x0 ) is called the derivative of f at x0 . We say f is differentiable on S if f is differentiable at every element of S.
Exercise 1.8.8. Interpret Def. 1.8.10 using the formulation of limit given in Def. 1.8.2. One-sided derivatives for real-valued functions f : [a, b] → R are naturally defined + using one-sided limits. We write ddx f (x)|x=c to stand for the right-sided derivative − d f (x)|x=c the derivaof f at c, ddx f (x)|x=c for the left-sided derivative of f at c, and dx tive of f at c, when they exist. Exercise 1.8.9. Explain how you would show that
d+ dx
f (x)|x=c = ∞.
The notion of differentiability is more restrictive than continuity, a fact typically illustrated for real-valued functions by examining the behavior of f (x) = |x| at x = 0. Indeed, differentiable functions are necessarily continuous, but not vice versa, in the abstract setting of X -valued functions. Further, if the derivative of a function f is itself differentiable, we say f has a second derivative. Such a function has a “higher degree of regularity” than one that is merely differentiable. The pattern continues with each order of derivative, from which the following string of inclusions is derived, ∀n ∈ N: Cn (I; X ) ⊂ Cn−1 (I; X ) ⊂ . . . ⊂ C1 (I; X ) ⊂ C (I; X ) .
(1.92)
Here, inclusion means that a space further to the left in the string is a closed linear subspace of all those occurring to its right. We shall often work with real-valued differentiable functions. The arithmetic combinations of differentiable functions are again differentiable, although some care must be taken when computing the derivative of a product and composition. The following result provides two especially nice features of real-valued differentiable functions, the first of which is used to establish l’Hopital’s rule (see [17]).
© 2011 by Taylor & Francis Group, LLC
48
Volume 2: Stochastic Equations
Proposition 1.8.11. (Properties of Real-Valued Differentiable Functions) i.) (Mean Value Theorem) If f : [a, b] → R is differentiable on (a, b) and continuous on [a, b], then ∃c ∈ (a, b) for which f (b) − f (a) = f ′ (c)(b − a).
(1.93)
ii.) (Intermediate Value Theorem) If f : I → R is differentiable on [a, b] ⊂ I and f ′ (a) < f ′ (b), then ∀z ∈ ( f ′ (a), f ′ (b)), ∃c ∈ (a, b) such that f ′ (c) = z. Exercise 1.8.10. Assume that f : [a, b] → R is continuous with f ′ (x) = 0, ∀x ∈ [a, b] . Prove that f is constant on [a, b].
Remarks. 1. There are other ways of defining differentiability that are guided by different applications in which such calculations arise. For instance, there are extensions of the notion of a directional derivative, as well a weaker notion of differentiability defined using distributions. These topics are treated in [1]. 2. We shall be interested in bounded domains Ω ⊂ RN with a so-called smooth boundary ∂ Ω. This boundary is necessarily a curve in RN and so, by smooth we mean that each of the N component functions used to define the curve is differentiable in the sense of Def. 1.8.10.
1.9
Some Elementary ODEs
Courses on elementary ordinary differential equations (ODEs) are chock full of techniques used to solve particular types of elementary differential equations. Within this vast toolbox are three particular scenarios that play a role in this text. We recall them informally here, along with some elementary exercises, to refresh your memory.
1.9.1
Separation of Variables
dy An ODE of the form dx = f (x)g(y), where y = y(x), is called separable because symbolically the terms involving y can be gathered on one side of the equality and the terms involving x can be written on the other, thereby resulting in the equiva1 lent equation (expressed in differential form) g(y) dy = f (x)dx. Integrating both sides yields an implicitly defined function H(y) = G(x) +C that satisfies the original ODE on some set and is called the general solution of the ODE. This process can be made formal through the use of appropriate changes of variable.
Exercise 1.9.1. Determine the general solution of these ODEs: dy i.) dx = e2x csc(π y); dy ii.) dx = axn , wheren 6= −1 and a ∈ R \ {0}; N iii.) 1 − y3 dy dx = ∑i=1 ai sin (bi x) , where ai , bi ∈ R and n ∈ N. © 2011 by Taylor & Francis Group, LLC
49
A Basic Analysis Toolbox
1.9.2
First-Order Linear ODEs
A first-order linear ODE is of the form dy + a(x)y = b(x), wherey = y(x). dx
(1.94)
We shall develop the solution of the initial-value problem (IVP) obtained by coupling (1.94) with the initial condition (IC) y (x0 ) = y0
(1.95)
using a simplified version of the so-called variation of parameters method. h Step 1: Solve the related homogenous equation dy dx + a(x)yh = 0. This equation is separable, so integrating both sides over the interval (x0 , x) yields ˆ x dyh a(s)ds = −a(x)dx =⇒ ln |yh (x)| − ln |yh (x0 )| = − | {z } yh x0
y (x) =ln y h(x ) h 0
=⇒ yh (x) = yh (x0 )e
´x − x a(s)ds 0 .
(1.96)
Step 2: Determine C(x) for which y(x) = C(x)yh (x) satisfies (1.94). Substitute this function into (1.94) to obtain d [C(x)yh (x)] + a(x) [C(x)yh (x)] = b(x) dx dC dyh C(x) + yh (x) + a(x)C(x)yh (x) = b(x) dx dx dyh dC C(x) + a(x)yh (x) +yh (x) = b(x) dx dx {z } |
(1.97)
=0 by Step 1
´ h i b(x) dC − x a(s)ds −1 = = b(x) yh (x0 )e x0 dx yh (x) ˆ x ´s x0 a(t)dt C(x) = b(s)y−1 ds + K, h (x0 )e x0
where K is an integration constant. Step 3: Substitute (1.97) into y(x) = C(x)yh (x) and apply (1.95) to find the general solution of the IVP . ˆ x ´ ´s − xx a(s)ds −1 x0 a(t)dt 0 y(x) = yh (x0 )e b(s)yh (x0 )e ds + K x0 ˆ x ´ ´x − x a(t)dt = b(s)e− x a(t)dt ds + Kyh (x0 ) e x0 . (1.98) | {z } x0 Call this K
© 2011 by Taylor & Francis Group, LLC
50
Volume 2: Stochastic Equations
Step 4: Apply the IC (1.95) to determine the solution of the IVP. Now, apply (1.95) to see that y(x0 ) = 0 + K = y0 . Hence, the solution of the IVP is ˆ x ´x ´s − a(t)dt y(x) = y0 e x0 + b(s)e− x a(t)dt ds. (1.99) x0
This formula is called the variation of parameters formula. Exercise 1.9.2. Justify all steps in the derivation of (1.99). Exercise 1.9.3. Solve the IVP: (
1.9.3
dy dx
+ 12 y(x) = e−3x , y(0) = 12 .
Higher-Order Linear ODEs
Higher-order linear ODEs with constant coefficients of the form an x(n) + an−1x(n−1) + . . . + a1x′ + a0x = 0,
(1.100)
where ai ∈ R, an 6= 0, and n ∈ N, arise in Chapters 2 through 5. A more general version of the procedure outlined in Section 1.9.2 can be used to derive the general solution of (1.100) (see [92, 93]). We consider the special case ax′′ (t) + bx′ (t) + cx(t) = 0,
(1.101)
where a 6= 0 and b, c ∈ R. Assuming that the solution of (1.101) is of the form x(t) = emt yields (1.102) emt am2 + bm + c = 0 =⇒ am2 + bm + c = 0. So, the nature of the solution of (1.101) is completely determined by the values of m. There are three distinct cases regarding the nature of the solution using (1.102): Nature of the Roots of (1.102) General Solution of (1.101) m1 6= m2 (real) x(t) = C1 em1t + C2 em2t m1 = m2 (real) x(t) = C1 em1t + C2tem1t m1 , m2 = α ± iβ x(t) = C1 eα t sin(β t) + C2 eα t cos(β t)
Exercise 1.9.4. For what values of m1 and m2 is it guaranteed that i.) lim x(t) = 0, ∀C1 ,C2 ∈ R? t→∞
ii.) x (·) is a bounded function of t for a given C1 ,C2 ∈ R?
The variation of parameters method can be extended to solve higher-order nonhomogenous linear ODEs (that is, when the right-hand side of (1.100) is not identically zero) as well (see [92, 93]).
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
1.10
51
A Handful of Integral Inequalities
Establishing a priori estimates is a crucial step in the proofs of most existence results. Such estimates often take the form of an upper bound of the state process in some function space. We begin with the following classical inequality from which many others are derived, proved as in [94]. Theorem 1.10.1. Gronwall’s Lemma Let t0 ∈ (−∞, T ) , x ∈ C ([t0 , T ] ; R) , K ∈ C ([t0 , T ] ; [0, ∞)) , and M be a real constant. If ˆ t
x(t) ≤ M +
K(s)x(s)ds, t0 ≤ t ≤ T,
t0
then x(t) ≤ Me
´t
t0
K(s)ds
Proof. Define y : [t0 , T ] → R by
y(t) = M +
ˆ
, t0 ≤ t ≤ T.
(1.103)
(1.104)
t
K(s)x(s)ds.
t0
Observe that y ∈ C1 ([t0 , T ] ; R) and satisfies the IVP ( y′ (t) = K(t)x(t), t0 ≤ t ≤ T, y (t0 ) = M.
(1.105)
(Tell why.) By assumption, x(t) ≤ y(t), ∀t0 ≤ t ≤ T . Multiplying both sides of this inequality by K(t) and then substituting into (1.105) yields ( y′ (t) ≤ K(t)y(t), t0 ≤ t ≤ T, (1.106) y (t0 ) = M. As such, y′ (t) − K(t)y(t) ≤ 0, t0 ≤ t ≤ T, −
´t
K(s)ds
so that multiplying both sides by e t0 yields ´t d − t K(s)ds e 0 y(t) ≤ 0, t0 ≤ t ≤ T. dt
(1.107)
(Why?) Consequently, e
´ − tt K(s)ds 0
y(t) ≤ y (t0 ) = M, t0 ≤ t ≤ T,
and so y(t) ≤ Me
´t
t0 K(s)ds
, t0 ≤ t ≤ T.
Because x(t) ≤ y(t), ∀t0 ≤ t ≤ T , the conclusion follows from (1.108).
© 2011 by Taylor & Francis Group, LLC
(1.108)
52
Volume 2: Stochastic Equations
This form of Gronwall’s Lemma applies only for t ≥ t0 , but we might need an estimate that holds for t < t0 . It is not difficult to establish such an estimate, as suggested by the following corollary. Corollary 1.10.2. Let t0 ∈ R, x ∈ C ((−∞,t0 ] ; R) , K ∈ C ((−∞,t0 ] ; [0, ∞)) , and M be a real constant. If ˆ t0 K(s)x(s)ds, −∞ < t ≤ t0 , (1.109) x(t) ≤ M + t
then x(t) ≤ Me
´ t0 t
K(s)ds
, −∞ < t ≤ t0 .
Proof. Let t ∈ (−∞,t0 ] and substitute t = t0 − s into (1.109) to obtain ˆ t0 x(t0 − s) ≤ M + K(τ )x(τ )d τ , s > 0.
(1.110)
(1.111)
t0 −s
Implementing the change of variable τ = t0 − ξ in (1.111) yields ˆ s x(t0 − s) ≤ M + K(t0 − ξ )x(t0 − ξ )d ξ , s > 0.
(1.112)
0
(Tell why.) Now, let x(s) = x(t0 − s) and K(s) = K(t0 − s) in (1.112) to obtain ˆ s x(s) ≤ M + K(ξ )x(ξ )d ξ , s > 0. 0
Applying Thrm. 1.10.1 then yields the estimate x(s) ≤ Me
´s 0
K(ξ )d ξ
, s > 0.
(1.113)
Going back to the original variable then results in (1.110). While these integral inequalities are veritable workhorses in practice, it might not be possible (or feasible) to verify the hypotheses of the lemma. One natural question is what to do if the constant M were allowed to vary with t. In such case, the resulting estimate would depend on the regularity of M. One such result is as follows. Proposition 1.10.3. Let t0 ∈ (−∞, T ) , x ∈ C ([t0 , T ] ; R) , K ∈ C ([t0 , T ] ; [0, ∞)) , and M : [t0 , T ] → [0, ∞). Assume that ˆ t x(t) ≤ M(t) + K(s)x(s)ds, t0 ≤ t ≤ T. (1.114) t0
i.) If M ∈ C ([t0 , T ] ; [0, ∞)) , then ˆ t ´t x(t) ≤ M(t) + M(s)K(s)e s K(τ )d τ ds, t0 ≤ t ≤ T. t0
© 2011 by Taylor & Francis Group, LLC
(1.115)
A Basic Analysis Toolbox ii.) If M ∈ C1 ((t0 , T ) ; [0, ∞)) , then ˆt ´t ´ K(s)ds − s K(τ )d τ x(t) ≤ e t0 M(t0 ) + M ′ (s)e t0 ds , t0 ≤ t ≤ T.
53
(1.116)
t0
A rich source of such inequalities is the text [320]. The following inequality, stated without proof, is useful when imposing more general growth conditions on the forcing term. Proposition 1.10.4. Let w, ψ1 , ψ2 , and ψ3 ∈ C ([0, ∞) ; [0, ∞)) and w0 ≥ 0. If, ∀t > 0, ˆ s ˆ t ˆ t w(t) ≤ w0 + ψ1 (s)w(s)ds + ψ1 (s) ψ2 (τ )w(τ )d τ ds 0 0 0 ˆ s ˆ τ ˆ t ψ1 (s) ψ2 (τ ) ψ3 (θ )w(θ )d θ d τ ds, + (1.117) 0
0
then ∀t > 0,
0
ˆ tn ´s ψ1 (s)e 0 ψ1 (τ )d τ (1+ w(t) ≤ w0 1 + 0 ˆ s ´τ ψ2 (τ )e 0 [ψ2 (θ )+ψ3 (θ )]d θ d τ ds .
(1.118)
0
1.11
Fixed-Point Theory
One of our central strategies involves the use of so-called fixed-point theory. This broad approach is based on a very straightforward strategy whose utility is especially evident in the study of existence theory. We present several useful results. Definition 1.11.1. A mapping Φ : X → X is a contraction if ∃0 < α < 1 such that kΦx − ΦykX ≤ α kx − ykX , ∀x, y ∈ X .
(1.119)
Note that a contraction is automatically uniformly continuous. (Why?) Theorem 1.11.2. Contraction Mapping Principle If Φ : X → X is a contraction, then there exists a unique z⋆ ∈ X such that Φ (z⋆ ) = z⋆ . (We call z⋆ a fixed-point of Φ.) Proof. Let z0 ∈ X and define the sequence {zn : n ∈ N} ⊂ X by zn = Φ (zn−1 ) , n ∈ N.
(1.120)
If z1 = z0 , then we are done. (Why?) If not, then prove inductively that the following two statements hold, ∀m, k ≥ 0. kzm+1 − zm kX ≤ α m kz1 − z0 kX ,
© 2011 by Taylor & Francis Group, LLC
(1.121)
54
Volume 2: Stochastic Equations k−1
kzm+k − zm kX ≤
∑ α n+ j kz1 − z0kX
j=0
≤
αm kz1 − z0 kX . 1−α
(1.122)
Let ε > 0. There exists M ∈ N such that m ≥ M =⇒ α m <
(1 − α )ε . kz1 − z0 kX
(1.123)
As such, (1.122) and (1.123) together imply that m ≥ M =⇒ kzm+k − zm kX < ε , ∀k ≥ 0.
(1.124)
So, {zn : n ∈ N} is a Cauchy sequence in X and hence convergent to some z⋆ ∈ X . The fact that z⋆ is a fixed point of Φ follows from the fact that lim Φ (zn−1 ) = lim zn = z⋆ .
n→∞
n→∞
As for uniqueness, suppose that both x⋆ and y⋆ are fixed-points of Φ and argue that kΦx − ΦykX < kx − ykX . (So what?) Corollary 1.11.3. If Φ : X → X is a mapping for which ∃0 < α < 1 such that for some n0 ∈ N, (1.125) kΦn0 x − Φn0 ykX ≤ α kx − ykX , ∀x, y ∈ X , then Φ has a unique fixed-point in X . Exercise 1.11.1. Prove Cor. 1.11.3 Remark. The above two results are particularly useful when establishing the existence and uniqueness of mild solutions of many classes of stochastic evolution equations. Often, it is beneficial to apply them on a closed subspace of X , specifically a closed ball BX (x0 ; ε ), rather than on the entire space X . The theorems are still applicable because a closed metric subspace of a Banach space is complete. Exercise 1.11.2. Was completeness of X an essential ingredient of Thrm. 1.11.2 and Cor. 1.11.3? Explain. Not every continuous operator Φ : X → X is a contraction. As such, Thrm. 1.11.2 is not always applicable. But, is it necessary for Φ to be a contraction in order for it to have a fixed-point? Even in the one-dimensional case there is no shortage of continuous functions f : R → R that do not have fixed-points. For instance, take f (x) = x − 1. We also know from Exer. 1.8.6(i) that a continuous function f : [a, b] → [a, b] must possess a fixed-point, while continuity is not strong enough to ensure a function g : (a, b) → R has a fixed-point. (Why?) This collection of examples suggests that the structure of the domain and range plays an important role. The following theorem due to Brouwer [160, 243] provides a complete answer for the RN -setting.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
55
Theorem 1.11.4. Brouwer’s Fixed-Point Theorem Let D ⊂ RN be a closed, convex, and bounded set. If Ψ : D → D is continuous, then Ψ has at least one fixed-point in D. This theorem does not hold true in the infinite-dimensional setting because while a closed ball BRN (x0 ; R) in RN must be compact, it need not be in a general Banach space. This fact significantly enters into the proof of Thrm.1.11.4, as well as in the construction of a counterexample that illustrates the falsity of the theorem in an infinite-dimensional space. (For the latter, see [160].) In light of this failure, we must impose more stringent conditions on the nature of the set D in order to obtain the desired extension of Thrm. 1.11.4. This is where the notion of a compact set in a Banach space comes into play. Some of the following notions were introduced in Section 1.4.4 and are recalled here for convenience. Definition 1.11.5. Let (X , k·kX ) be a normed linear space. A set K ⊂ X is called i.) convex if ∀0 ≤ t ≤ 1 and x, y ∈ K , tx + (1 − t)y ∈ K ; ii.) bounded if ∃M > 0 such that kxkX ≤ M, ∀x ∈ K ; iii.) compact if every sequence {xn } ⊂ K contains a subsequence xnk that converges to a member of K ; iv.) precompact if clX (K ) is a compact subset of X . A compact set K ⊂ X must be closed and bounded (Why?), but not conversely, as shown in the following exercise. πx Exercise 1.11.3. Let K = cos 2n b−a : n ∈ N ∧ a ≤ x ≤ b . Show that while K is a closed and bounded subset of L2 (a, b; R), it is not compact in L2 (a, b; R). Verifying precompactness can be a tedious task, depending on the underlying topology of X because the closure is taken in X . The so-called Arzela–Ascoli Theorem offers a method of attack. To state it, we begin with Definition 1.11.6. A set Z ⊂ C ([a, b]; Y ) is equicontinuous at t0 ∈ [a, b] if ∀ε > 0, ∃δ > 0 (depending on ε and t0 ) such that s ∈ [a, b] with |s − t0 | < δ =⇒ kz (t0 ) − z (s)kX < ε , ∀z ∈ Z . Theorem 1.11.7. Arzela-Ascoli in C ([a, b]; Y ) A set Z ⊂ C ([a, b]; Y ) is precompact if and only if the following hold, ∀t ∈ [a, b] : i.){z(t) | z ∈ Z } is precompact in Y . ii.) {z(t) | z ∈ Z }is equicontinuous. Other commonly used fixed-point theorems using the notion of compactness are discussed in [70, 355].
© 2011 by Taylor & Francis Group, LLC
56
1.12 1.12.1
Volume 2: Stochastic Equations
Guidance for Selected Exercises Level 1: A Nudge in a Right Direction
1.1.1 (i) Interpret this verbally. What must happen in order for this NOT to occur? (ii) ∀x, what happens? (iii) ∃x for which what happens? (iv) Apply the definition of contrapositive directly. 1.2.1. (i) What is the contrapositive of “x ∈ A =⇒ x ∈ B”? (ii) Start with x ∈ (A ∩ B) ∪ (A \ B) and use Def. 1.2.1 to show x ∈ A. (Now what?) (iii) Use the approach from (ii). If P, Q, and R are statements, then P ∧ (Q ∨ R) ≡ ? . (iv) Use the hint for Exer. 1.1.1(i). (How?) 1.2.2. Negate Def. 1.2.1(ii). S 1.2.3. (iv) ni=1 Ai = {x| ∃i ∈ {1, . . . n} such that ? } (v) This is similar to (iv), but the quantifier changes. (How?) (vi) This set must be comprised of what kind of elements? 1.2.4. The proofs of all of these statements are similar. Start with an x in the set on the left-hand side and, using the defining characteristics of that set, manipulate the expressions involved to argue that x must belong to the set on the right-hand side. Sometimes, these implications will reverse (thereby resulting in set equality), while for others they will not. 1.3.1. You must have dom( f ) = dom(g), and .... 1.3.2. Many example exist. Try f (x) = 2x and g(x) = x2 . 1.3.3. Argue these in two stages. For (ii), ( f ◦ g)(x1 ) = ( f ◦ g)(x2 ) =⇒ f (g(x1 )) = f (g(x2 )). What must be true about the underlined quantities? (Why? Now what?) 1.3.4. (i) Use the same approach as in Exer. 1.2.4. As an example, we prove (ii)(a): ! y∈ f
[
γ ∈Γ
Xγ
⇐⇒ ∃x ∈
[
Xγ such that y = f (x)
γ ∈Γ
⇐⇒ ∃γ ∈ Γ such that x ∈ Xγ and y = f (x) ⇐⇒ ∃γ ∈ Γ such that y ∈ f Xγ [ ⇐⇒ y ∈ f Xγ γ ∈Γ
(ii) Identify which implications do not reverse. 1.3.5. (i) The arithmetic operation and ordering must work together in order for the arithmetic combination to retain the monotonicity of the functions used to form it. The sign of the output also contributes to the result. (How?)
© 2011 by Taylor & Francis Group, LLC
57
A Basic Analysis Toolbox
(ii) If f and g are nondecreasing, then so is f ◦ g. (Why?) But, something peculiar happens when f and g are nonincreasing? (What?) 1.4.1. (i) Compute (x + y)2 . (So what?) (ii) Use induction with Prop. 1.4.1(vi). 1.4.2. Apply the result: |x − a| = b iff x − a = ±b. 1.4.3. (i) through (vi) are immediate consequences of Def. 1.4.3. (vii) It follows from (i) that − |x| ≤ x ≤ |x| , ∀x ∈ R. (So what?) (viii) Use (vii). (How?) (ix) Use |x| = |(x − y) + y| ≤ |x − y| + |y| . (Now what?) (x) Use Prop. 1.4.2. 1.4.4. (i) Note that ∑ni=1 (α xi − β yi)2 ≥ 0, ∀α , β ∈ R. (Now what?) (ii) Use (i). (iii) Apply Prop. 1.4.4(vii) for the first inequality. 1.4.5. This simply involves reversing the inequalities. 1.4.6. (i) Negate Def. 1.4.5(i). (ii) Repeat (i) for sets bounded below. 1.4.7. Let T be a nonempty set bounded below. Apply Thrm. 1.4.7 to S = −T and then appropriately reverse the inequalities to get back to T. (How?) 1.4.8. Proof of (i): Argue by contradiction. Proof of (iv): Use Prop. 1.4.1(iv) and (v) with Def. 1.4.5. Proof of (v): Why is sup S + sup T + 1 > 0? 1.4.9. A partially completed table is as follows: S int(S) S′ clR (S) Open? Closed? [1, 5] (1, 5) [1, 5] [1, 5] No Yes Q Ø R 1 {0} No n |n ∈ N R R Yes Yes Ø Yes T
T
1.4.10. (i) Let x ∈ ni=1 Gi . Show ∃ε > 0 such that (x − ε , x + ε ) ⊂ ni=1 Gi . (ii) Use Prop. 1.4.10. (iii) Use the same approach as in (i). (iv) Use the same approach as in (ii). (v) ∃ε > 0 such that (x − ε , x + ε ) ⊂ S ⊂ T . (So what?) (vi) Use Def. 1.4.9(vii). 1.4.11. (i) Apply Thrm. 1.4.7 and Prop. 1.4.8(i). (How?) (ii) This follows from (i) because clR (S) = ? . (iii) Implement standard changes involving bounded below and infs. 1.4.12. Think of Exer. 1.4.9. 1.4.13. (i) Any finite set will work. (Why?) (ii) Think of an unbounded set with “gaps.” (iii) Keep trying.... 1.4.14. These all follow from the definitions of T, supT, and limit point. Completeness is used in (1.12). 1.4.15 & 1.4.16. The only compact sets are (i), n1 |n ∈ N ∪ {0} , and [0, 1] . Why © 2011 by Taylor & Francis Group, LLC
58
Volume 2: Stochastic Equations
are they compact? Why are the others not? 1.5.1. If {xn |n ∈ N} is nondecreasing, then x1 is a lb {xn |n ∈ N} . (Why?) Adapt this for nonincreasing sequences. 1.5.2. (i) Negate Def. 1.5.4. (ii) Use Def. 1.5.4 directly. (How?) 1.5.3. Let ε > 0. ∃N ∈ N such that |a| < ε N. (So what?) ε 1.5.4. (i) Let ε > 0. ∃N ∈ N such that n ≥ N =⇒ |xn − L| < |c|+1 . (So what?) (ii) Apply Prop. 1.5.9(i) and Exer. 1.5.4(i). 1.5.5. ∃M > 0 such that |yn | ≤ M, ∀n ∈ N. How do you control |xn yn |? 1.5.6. (i) Use Prop. 1.4.4(ix) with Def. 1.5.4. (ii) Use xn = (−1)n , n ∈ N. 1.5.7. (i) Argue inductively using Prop. 1.5.9(ii). (ii) Proceed in two cases. First, assume L 6= 0. Observe that √ √ √ √ √ xn + L √ x −L √ =√ n √ . xn − L = xn − L √ xn + L xn + L √ Use this with Prop. 1.5.8. (How?) If L = 0, then |xn | < ε 2 =⇒ xn < ε . (Why?) 1.5.8. (i) Proof of (=⇒) : ∀N ∈ N, show that you can choose 1 1 . xN ∈ (S \ {x1 , . . . , xN−1 }) ∩ x − , x + N N
(ii) This is similar to (i), but now you can have a constant sequence. (Why? How does this alter the proof?) 1.5.9. If {xn } is a nonincreasing sequence bounded below, then {xn } converges and lim xn = inf {xn |n ∈ N} . Now, prove it! n→∞ 1.5.10. For both, apply Prop. 1.5.13 or its analogous version developed in Exer. 1.5.9. 1.5.11. The main trick is identifying the indices correctly when verifying each implication. Argue (1) =⇒ (2) =⇒ (3) =⇒ (4) =⇒ (5) =⇒ (1) to show all statements are equivalent. 1.5.12. Consider s2m − s2m−1 , ∀m ∈ N. 1.5.13. Apply the example directly. 1.5.14. Use Exer. 1.5.10(ii). 1.5.15. Apply Prop. 1.5.24. 1.6.1. Argue in a manner similar to (1.44). You will need to use associativity of addition of real numbers and distributivity of multiplication over addition. 1.6.2. Since this norm measures Euclidean distance, you should expect each of these to be related to circles or spheres, somehow. 1.6.3. (i), (ii), and (iv) follow from elementary radical properties. For (iii), apply Exer. 1.4.4(ii). 1.6.4. Argue as in Exer. 1.4.4(iii). 1.6.5. Most of these follow directly using the commutativity, associativity, and distributivity properties of R. For (iv), use Hint 2 for Exer. 1.6.3. And for (vi), use z = x − y.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
59
1.6.6. Revisit Exer. 1.6.2. 1.6.8. The computations go through without incident when replacing |·| by k·kRN . 2 N 1.6.9. kxn − Lk2RN = ∑i=1 ((xi ) n − Li ) → 0 as n → ∞ iff what happens?
1.6.10. Argue that kxm kRN − lim xp
p→∞
N → 0 as m → ∞. R
|a|kxk
1.6.11. kxkax N N = kxk RNN = |a| , ∀x ∈ RN \ {0} . (Why?) R
R
R
1.6.12. kax + bykRN ≤ |a| kxkRN + |b| kykRN ≤ ? . (Now what?)
2
1.6.13. akxkx N ≤ a12 , ∀x ∈ RN \ {0} . (So what?) RN R
1/2 1.6.14. 2x, 41 x R2 = √12 kxkR2 . (Why? So what?)
1.6.15. Argue that ∑ p cn z N ≤ ∑ p |cn | kzk N , ∀p ∈ N. (Now what?) n=1
R
n=1
R
1.6.16. Show that kf(t)kR3 ≤ R2 , ∀t ∈ R. (Now what?) 1.6.17. (i) and (iii) hold; this is easily shown because the corresponding properties in R can be applied entrywise. (ii) rarely holds (Why?). And, (iv) is true, but the bookkeeping is a bit more tedious. (Try showing it.) a−λ 0 1.6.18. (i) Solve for λ : det(A − λ I) = det = 0. 0 b−λ (ii) A−1 is another diagonal matrix. What are its components? (iii) Let B be a diagonal N × N matrix with nonzero entries b11 , b22 , . . . , bNN . The eigenvalues of a diagonal matrix are precisely the diagonal entries. (Now what?) 1.6.19. The only additional hitch with which we must contend is the double sum, but a moment’s thought reveals that this can be expressed as a single sum. (Now what?) 1.6.20. Prove that ! ! N N N N N N N ∑ ∑ ∑ air br j ≤ ∑ ∑ ai j ∑ ∑ bi j . i=1 j=1 r=1 i=1 j=1 i=1 j=1 1.6.21. Observe that
−t 2
−t 2
e x1
e 0 x1
−2t
= e−t x1 2 + e−2t x2 2 .
=
0 e−2t x2 R2 e x2 R2
1.6.22. Yes, naively because this boils down to entrywise calculation. Prove this formally. 1.6.23. Convergence is entrywise for all of these. So what? 1.6.24. (i) kAm x − AxkRN = k(Am − A) xkRN ≤ kAm − AkMN kxkRN . So what? (ii) This is similar to (i). Tell how. (iii) Use (i) and (ii) combined with the triangle inequality. 1.7.1. These properties are known for (R,|·|) and applying them componentwise N N enables you to argue that R , k·kRN and M (R), k·kMN (R) are linear spaces. 1.7.2. For instance, (a) reads: ∀ε > 0, ∃N ∈ N such that n ≥ N =⇒ sup k fn (t) − f (t)kX < ε t∈I
© 2011 by Taylor & Francis Group, LLC
60
Volume 2: Stochastic Equations
1.7.3. Let { fn } ⊂ C ([a, b]; R) be Cauchy. Then, { fn (x)} is Cauchy in R, ∀x ∈ [a, b]. (Why?) Hence, the function f : [a, b] → R given by f (x) = lim fn (x) is well-defined. n→∞ (Why? Now what?) 1.7.4. Prop. 1.7.7: {sn } converges in C iff {sn } is Cauchy in C. (Why?) Now, use a modified version of Exer. 1.5.11 to conclude. Prop. 1.7.8: Define sN = ∑Nk=1 Mk . {sN } is Cauchy in R. (Why? So what?) 1.7.6. This is the set of all z ∈ C ([0, 2]; R) such that sup z(x) − x2 : x ∈ [0, 2] < 1. Interpret this geometrically. 1.7.7. Showing the sequence is Cauchy is easy. Note that lim n2 = 0. So, what is the n→∞ issue? 1.7.8. Let {xn } be Cauchy in Y . Then, {xn } converges in X . (Why?) How do you prove that {xn } actually converges in Y ? 1.7.9. Let {(xn , yn )} be Cauchy in X × Y . Can you conclude that {xn } is Cauchy in X and {yn } is Cauchy in Y ? (How?) 1.7.10. Linearity of the integral is a key tool here. 1.7.11. This follows immediately. 1.7.12. (i) hx, ayi = hay, xi . (Now what?) (ii) The hypothesis implies that hx − y, zi = 0, ∀z ∈ X . Now, choose z appropriately to conclude. (How?) (iii) kaxk2X = hax, axiX . (So what?) (iv) Argue as in Prop. 1.6.7. (v) Apply the hint for (iii) with x + y in place of ax. (vi) |hx ´n , yn i − hxn , yi + hxn , yi − hx, yi| ≤ . . . (Now what?) b 1.7.13. a f (x)g(x)dx ≤ . . . (Now what?) ´π 1.7.14. (i) Compute −π f 2 (x)dx, ∀ f ∈ B, using trigonometric identities as needed. ´π (ii) Compute −π f (x)g(x)dx using a change of variable and trigonometric identity. ´b (iii) First, determine C ∈ R such that a C2 dx = 1. The other basis elements need to be replaced by 2nπ t 2nπ t ⋆ ⋆ ⋆ B = c cos | n ∈ N ∪ c sin |n ∈ N b−a b−a ´b for an appropriate choice of c⋆ ∈ R that ensures a c⋆ f 2 (x)dx = 1, ∀ f ∈ B⋆ . 1.7.15. (i) k∑ni=1 yi k2H = h∑ni=1 yi , ∑ni=1 yi iH (Now what?) (ii) Take the inner product with yi on both sides of α1 y1 + . . . + αn yn = 0. (iii) Take the inner product with yi on both sides of α1 y1 + . . . + αn yn = x. (iv) Simplify using the properties of inner product to get hx, yi i − hx, yi i = 0. (Tell how.) 1.7.16. Proof of (i): Use Prop. 1.5.13. Proof of (ii): Let ε > 0. ∃N ∈ N such that n
m, n ≥ N =⇒
© 2011 by Taylor & Francis Group, LLC
∑ |hx, ek i|2 < ε .
k=m
61
A Basic Analysis Toolbox (So what?) 1.8.1. Prop. 1.5.5: If ∃lim f (x), then it is unique. x→a
Prop. 1.5.6: If ∃lim f (x), then ∃M > 0 and δ > 0 such that x→a
| f (x)| ≤ M, ∀x ∈ dom( f ) ∩ (a − δ , a + δ ). Prop. 1.5.7: If f (x) ≤ g(x) ≤ h(x), for all “appropriate x near a” and ∃lim f (x) = x→a
lim h(x) = L, then ∃lim g(x) = L. (Make precise the phrase in quotes!)
x→a
x→a
Prop. 1.5.9: If ∃lim f (x) = L and lim g(x) = M, then x→a
x→a
(i) ∃lim ( f (x) + g(x)) = L + M; x→a
(ii) ∃lim ( f (x) · g(x)) = L · M. x→a 1.8.2. (i) These are formal ways of defining asymptotes. Which is which? (ii) Certain inequalities will change since the inputs of interest are different. (How?) 1.8.3. Argue as in Exer. 1.6.10. 1.8.4. The proof using Def. 1.8.4(i) is suggested by the string of equalities in the statement of Prop. 1.8.5. Alternatively, using Def. 1.8.4(ii), let ε > 0. Find δ > 0 such that kx − akX < δ =⇒ k f (g(x)) − f (g(a))kX < ε . 1.8.5. (i) Mimic the statement in the paragraph preceding Exer. 1.8.5 with X2 = [a, b] and X1 = X × X . (ii) It is more intuitive to use Def. 1.8.4(i). (Do so.) (iii) Interpret this entrywise as suggested by Exer. 1.6.22. 1.8.6. (i) Consider the function g(x) = f (x) − x. (ii) Align the function so that the fixed-point would occur at one of the endpoints that you are now excluding, or use asymptotes to your advantage. 1.8.7. (i) Let {xn } be a Cauchy sequence in S and ε > 0. Prove that { f (xn )} is a Cauchy sequence in R. (ii) If f is not bounded on S, then ∀n ∈ N, ∃xn ∈ S such that | f (xn )| > n. (Now what?) 1.8.8. For any real sequence {xn } such that xn → 0, . . .. 1.8.9. How do you show that a subset of R is unbounded? Adapt this. 1.8.10. Use Prop. 1.8.11(i) to show that f (x) = f (a), ∀x ∈ [a, b]. 1.9.1. (i) sin (π y) dy = e2x dx . . . Now, integrate. (ii) dy = axn dx . . . Now, integrate. (iii) 1 − y3 dy = ∑ni=1 ai sin (bi x) dx . . . Now, integrate. 1.9.2. Use linearity and additivity of the integral. 1.9.3. Apply (1.99) directly with y0 = 21 , x0 = 0, a(x) = 12 , and b(x) = e−3x . 1.9.4. (i) All exponential terms must go to zero. (ii) Consider the case in which the roots are complex. 1.11.1. Φn0 has a fixed point x⋆ . (Why? So what?) 1.11.2. What is the definition of completeness? How does this help?
© 2011 by Taylor & Francis Group, LLC
62
Volume 2: Stochastic Equations ´b |yn (x) − y(x)|2 dx = n→∞ a in L2 (a, b; R)? Compute
1.11.3. “{yn } converges to y in L2 (a, b; R)”0 means lim 0. does it mean for {yn } to be Cauchy
What
cos 2nπ · 2 , ∀n ∈ N. b−a L (a,b;R)
1.12.2
Level 2: An Additional Thrust in a Right Direction
1.1.1. (i) Use the fact that ¬ (P ∧ Q) is equivalent to (¬P) ∨ (¬Q). Interpret this. (iv) Use (i) and an equivalent form of ¬ (P ∨ Q) similar to (i). 1.2.1. (i) Use the contrapositive for both implications. (ii) For the reverse inclusion, begin with x ∈ A. To which of the two sets on the right-hand side of the equality must x belong? (So what?) (iii) . . . (P ∧ Q) ∨ (P ∧ R) . Similar reasoning applied to P ∨ (Q ∧ R) can be used to verify the related distributive law. (iv) Negate P ∨ Q. 1.2.2. This boils down to arguing that either A is not a subset of B, or vice versa. 1.2.3. T (iv) Fill in the blank with “x ∈ Ai .” (v) ni=1 Ai = {x|x ∈ Ai , ∀i ∈ {1, . . . , n}} (vi) {(x1 , . . . , xn ) | xi ∈ Ai , ∀i ∈ {1, . . . , n}} 1.2.4. As an example, we prove (ii): !∼ x∈
[
γ ∈Γ
Aγ
⇐⇒ x ∈ /
[
Aγ
γ ∈Γ
⇐⇒ ¬ ∃γ ∈ Γ such that x ∈ Aγ ⇐⇒ ∀γ ∈ Γ, x ∈ / Aγ fγ ⇐⇒ ∀γ ∈ Γ, x ∈ A ⇐⇒ x ∈
\
γ ∈Γ
fγ . A
1.3.1. . . . and f (x) = g(x), ∀x ∈ dom( f ) = dom(g). 1.3.3. Continuing, we have g (x1 ) = g (x2 ) =⇒ x1 = x2 , where the facts that f and g are one-to-one were used (in that order). The proof of (i) is similar. 1.3.4. (ii) Try using one-to-one for one of them, and onto for the other. 1.3.5. (i) The sum is the only one for which this holds. The product would have worked if the range were restricted to (0, ∞). (Why?) Why don’t the others work? (ii) If f and g are both nonincreasing, then x1 < x2 =⇒ g(x1 ) > g(x2 ) =⇒ f (g(x1 )) < f (g(x2 )) . (So what?) 1.4.1. (i) Note that (x + y)2 ≥ 0. Expand the left-hand side. (ii) At the inductive step, use (xn < yn ) ∧ (0 < x < y) =⇒ xn x < yn y. (Now what?) 1.4.3. (vii) Apply this to both x and y and add. (Now what?) Alternatively, expand (x + y)2 and apply (i), (v), and (vi).
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox
63
(ix) Apply this to y also and subtract. (Now what?) 1.4.4. (i) Expand the expression and choose α , β appropriately. (How?) (iii) For the second inequality, use Exer. 1.4.1(i) with (a + b)N =
N
∑
k=0
N k
ak bN−k .
1.4.6. (i) Show that ∀M > 0, ∃x ∈ S such that x > M. (ii) Adapt (i) appropriately. 1.4.7. Now, argue similarly to show (1.3)=⇒ Thrm. 1.4.7. 1.4.8. Proof of (i): If the conclusion does not hold, then sup(S) − ε is an ub(S). Why is this a contradiction? ε Proof of (v): Now use Prop. 1.4.8(i) with the number ζ = sup(S)+sup(T )+1 and mimic the argument of Prop. 1.4.8(iii). (Tell how.) Regarding the proofs of the corresponding INF statements, all changes are straightforward and primarily involve inequality reversals and the appropriate modification of Prop. 1.4.8(i). (Supply the details.) 1.4.9. Make certain to supply the details. S int(S) S′ clR (S) Open? Closed? [1, 5] (1, 5) [1, 5] [1, 5] No Yes Q Ø R R No No 1 1 |n ∈ N |n ∈ N ∪{0} Ø {0} No No n n R R R R Yes Yes Ø Ø Ø Ø Yes Yes 1.4.10. (i) For every i ∈ {1, . . . , n} , ∃εi > 0 such that (x − εi , x + εi ) ⊂ Gi . (So what?) T ei is open. Now apply Exer. 1.2.4 (ii) Because Fe1 , . . . , Fen are open, (i) =⇒ ni=1 F (ii). (iii) ∃γ0 ∈ Γ such that x ∈ Gγ0 , and because Gγ0 is open, ∃ε > 0 such that (x − ε , x + ε ) ⊂ Gγ0 . Now, use Exer. 1.2.4 (iv). 1.4.11. (i) Note that ∀ε > 0, (sup(S) − ε , sup(S) + ε ) ∩ S 6= Ø. Also, sup(S) need not be in S, but it must be in S′ ? (Why?) (ii) clR (S) = S e Q \ A, and Q e \ A, where A is any finite subset of 1.4.12. Some possibilities are Q, Q, R. 1.4.13. (ii) N (iii) This is not possible. 1.4.15 & 1.4.16. Compute the closures of these sets and appeal to Thrm. 1.4.14. 1.5.2. (i) ∃ε > 0 such that no matter what N ∈ N is chosen, ∃n ≥ N for which |xn − L| ≥ ε . (ii) |xn − L| = ||xn − L| − 0|. (So what?) ε |c| 1.5.4. (i) |cxn − cL| = |c| |xn − L| < |c|+1 . (So what?) ε 1.5.5. Let ε > 0. ∃N ∈ N such that n ≥ N =⇒ |xn − 0| < M+1 . Now, argue as in Exer. 1.5.4(i).
© 2011 by Taylor & Francis Group, LLC
64
Volume 2: Stochastic Equations
1.5.6. (i) Let ε > 0. ∃N ∈ N such that n ≥ N =⇒ ||xn | − |L|| ≤ |xn − L| < ε . (So what?) 1.5.7. (i) xnp → L p ∧ (xn → L) =⇒ xnp xn → L p L. (Why?) (ii) Let ε > 0. ∃M > 0 and N1 ∈ N √ such that n ≥ N1 =⇒ xn > M. Also, ∃N2 ∈ N such that n ≥ N2 =⇒ |xn − L| < M + L ε . So, x −L 1 n √ √ n ≥ max {N1 , N2 } =⇒ √ |xn − L| < ε . ≤ xn + L M+ L
1.5.8. (i) Proof of (⇐=) : Let ε > 0. ∃N ∈ N such that n ≥ N =⇒ xn ∈ (x − ε , x + ε ). (So what?) 1.5.9. The proof is very similar to the proof of Prop. 1.5.13, but you need to use the fact that ∃N ∈ N such that xN < L + ε . (Now what?) n 1.5.10. The fact that lim an! = 0 readily follows by applying Prop. 1.5.24 in conjuncn→∞ tion with Cor. 1.5.21. (Revisit this when you reach this point.) 1.5.12. Use Thrm. 1.5.18. Find a real number ζ0 for which |s2m − s2m−1 | ≥ ζ0 , ∀m ∈ N. Then, how do you conclude? 1.5.13. This series converges for any x such that |5x + 1|3 < 1. For such x, the sum is c(5x+1)3p . 1−(5x+1)3
1.5.14. If xn > 0 and xn → 0, what can you say about 1.5.21. n n+1 1.5.15. lim (n+1) · nn!n = lim 1 + 1n = e. (So what?) (n+1)! n→∞
n o 1 xn
? Use this with Cor.
n→∞
1.6.1. For instance,
c (x + y) = c hx1 + y1 , x2 + y2, . . . , xN + yN i
= hc (x1 + y1) , c (x2 + y2) , . . . , c (xN + yN )i = hcx1 + cy1 , cx2 + cy2 , . . . , cxN + cyN i = hcx1 , cx2 , . . . , cxN i + hcy1 , cy2 , . . . , cyN i = cx + cy.
1.6.2. (i) Open circle with radius ε centered at (0,0). (ii) Complement of an open sphere with radius ε centered at (1,0,0). (iii) The√ singleton set {x0 } . 1.6.3. Use z2 = |z| and ∑Ni=1 a2i = 0 ⇐⇒ ai = 0, ∀i ∈ {1, . . . , N} . 1.6.4. Adapt the hints provided for Exer. 1.4.4(iii). 1.6.5. For instance, the proof of (ii) is N
hx + y, ziRN = =
N
∑ (xi + yi) zi = ∑ (xi zi + yizi )
i=1 N
i=1
N
∑ xi zi + ∑ yi zi = hx, ziRN + hy, ziRN .
i=1
© 2011 by Taylor & Francis Group, LLC
i=1
A Basic Analysis Toolbox
65
For (vi), expand hx, x − yiRN = hy, x − yiRN to arrive at ∑Ni=1 (xi − yi )2 = 0. (Now what?) 1.6.6. Open circle (or sphere) with radius ε centered at x0 . 1.6.9. (xi )n → Li as n → ∞, ∀i ∈ {1, . . . , N} . 1.6.10. Using Prop. 1.6.4(iii) yields
0 ≤ kxm − L + LkRN − lim xp p→∞ N R
≤ kxm − LkRN + kLkRN − lim xp
p→∞
N → 0. R {z } | =0
1.6.11. What is the supremum of a singleton set? 1.6.12. Continuing, we conclude that η = |a| (kx0 kRN + ε ) + |b| (kx0 kRN + δ ) is an ub(A ). Completeness ensures ∃ sup(A ). In order to prove that η = sup(A ), let 0 < ζ < η . Produce x ∈ BRN (x0 ; ε ) and y ∈ BRN (x0 ; δ ) such that ζ = kax + byk N . R 1.6.13. This is dominated by a geometric series that converges iff |a| > 1. (Why?)
1/2 1.6.14. 2x, 14 x R2 < 1, ∀x ∈ BR2 0; 13 . Use Prop. 1.5.22 to conclude. (How?) 1.6.15. Now, because |cn | kzkRN , ∀n ∈ N, we see that
p
∞
∑ cn z ≤ ∑ |cn | kzkRN , ∀p ∈ N,
n=1 N n=1 R
from which the conclusion follows. (How?) 1.6.16. Thus, R is an ub ({kf(t)kR3 : t ∈ R}) . In fact, R is the sup of this set; this can be shown using the continuity of the components of f(t). 1.6.18. (i) λ = a, b 1 0 (ii) A−1 = a 1 . Compute the eigenvalues in the same manner as in (i). 0 b (iii) The reciprocals of b11 , b22 , . . . , bNN are the eigenvalues of B−1 . 1.6.20. Expand both sides and compare the terms. Replace some terms on the left by larger terms on the right to arrive at the right-hand side provided. 1.6.21. Continuing, we see that ∀t > 0, 2 2 e−t x1 + e−2t x2 = e−2t x21 + e−4t x22 ≤ e−2t x21 + x22 + e−4t x21 + x22 ≤ e−2t + e−4t ≤ 2.
(Note that the upper bound you end with depends on which RN norm you use.) 1.6.22. Let ε > 0. ∀i, j ∈ {1, 2} , ∃Mi j ∈ N such that ε n, m ≥ Mi j =⇒ (xi j )n − (xi j )m < . 4
© 2011 by Taylor & Francis Group, LLC
66
Volume 2: Stochastic Equations
How do you use this to argue that {Am } is a Cauchy sequence in M2 (R)? 1.6.23. If Am → B in MN (R), then ∀i, j ∈ {1, . . . , N} , (ai j )m → bi j as m → ∞. Apply this to all parts of the exercise. 1.6.24. (i) Use the Squeeze Theorem with the inequality to conclude. (ii) kAxm − AxkRN ≤ kAkMN kxm − xkRN . (So what?) (iii) kAm xm − AxkRN ≤ kAm kMN kxm − xkRN + kAm − AkMN kxkRN . (So what?) 1.7.2. (b) reads: ∀ε > 0, ∃N ∈ N such that ˆ n ≥ N =⇒ | fn (t) − f (t)| p dt < ε p . I
(c) is formulated similarly. The modifications for Cauchy are obvious. 1.7.3. Observe that | fn (x) − fm (x)| ≤ k fn − fm kC → 0 as n, m → ∞. Argue that k fn − f kC → 0 as n → ∞. (ii) The space X must be complete; otherwise, f would not be well-defined. The argument remains unchanged.
1.7.4. Prop. 1.7.7: Compute supx∈S sN+p (x) − sN (x) X . (Now what?) n+p Prop. 1.7.8: ∑k=n+1 Mk → 0 as n → ∞. So, ∀ε > 0, ∃N ∈ N such that n ≥ N =⇒ n+p ∑k=n+1 Mk < ε . Now, apply Prop. 1.7.7. 1.7.6. Construct a tube centered at the graph of f (x) = x2 on the interval [0, 2] by translating copies of the graph of f vertically up 1 unit and down 1 unit to form its boundaries. Any continuous function that remains strictly inside this tube is a member this ball. of 1.7.7. n2 does not converge in the space Y . So, Y is not complete. 1.7.8. Use an appropriately modified version of Exer. 1.5.8. (How?) 1.7.9. Yes, and in fact, the completeness of the respective spaces implies that {xn } converges in X and {yn } converges in Y . So, {(xn , yn )} converges in X × Y using either norm. 1.7.10. (i) Now use Def. 1.7.10(ii), then (i). (ii) Choose z = x − y and use Def. 1.7.10(iv). (iii) hax, axiX = a hx, axiX = a hax, xiX = a2 hx, xiX . (Now what?) (v) . . . = kxk2X + 2 |hx, yi| + kyk2X ≤ (kxkX + kykX )2 . (Now what?) (vi) . . . = |hyn − y, xn i + hxn − x, yi| ≤ kyn − ykX kxn kX + kxn − xkX kykX (Now what?) ´ 1/2 ´ 1/2 b b 2 1.7.11. . . . ≤ a f 2 (x)dx . a g (x)dx 1.7.12. (i) Use a double-angle formula. (ii) Use a product-to-sum formula. 1 (iii) Use C = √b−a and use a change of variable to find c⋆ .
1.7.13. (i) Use properties of inner product to arrive at ∑ni=1 ∑nj=1 yi , y j H . (Now what?) (ii) Conclude that αi = 0, ∀i ∈ {1, . . . , n}. (How? So what?) (iii) Now, use hx, yi i = αi in the definition of span(Y ) to conclude.
© 2011 by Taylor & Francis Group, LLC
A Basic Analysis Toolbox 1.7.14. Proof of (ii): To see why the limit is x, use * +
67
∞
x − ∑ hx, ek iH ek , e j k=1
H
= 0, ∀ j ∈ N.
(So what?) 1.8.1. The proofs mirror those of the corresponding results in the sequence setting with δ playing the role of N and the “tail of the sequence” corresponding to the “deleted neighborhood of a.” Keep in mind that if there are several conditions involving different δ neighborhoods of a, then in order to ensure they hold simultaneously, take the MIN of the δ ′ s. (Why?) 1.8.2. (i) Def. 1.8.3(i) means that the graph of f has a vertical asymptote at a, while (ii) implies the existence of a horizontal asymptote. (ii) Alternatively, use |kxkX − kakX | ≤ kx − akX with Def. 1.8.4(ii). 1.8.4. Tackle the implication in two stages. Let ε > 0. First, find δ1 > 0 such that ky − g(a)kX < δ1 =⇒ k f (y) − f (g(a))kX < ε . Then, find δ2 > 0 such that kx − akX < δ2 =⇒ kg(x) − g(a)kX < δ1 . (Now what?) 1.8.6. (i) Show that at least one of these holds: The sign of g(x) changes at some point within the interval [a, b], g(a) = 0, or g(b) = 0. 1.8.7. (i) Use Def. 1.8.7 carefully to link control between the two Cauchysequences. (ii) Because {xn } is bounded, it contains a convergent subsequence xnk . Now use part (i). (How? So what?) 1.8.8. Substitute xn in for h and interpret. 1.8.9. Show that ∀N ∈ N, ∃hn ∈ R such that f (xo +hhnn)− f (x0 ) > N. 1.8.10. Apply the Mean Value Theorem on [a, x] ,∀x ∈ [a, b] . 1.9.1. The integration is standard. Note that the solutions of (i) and (ii) can be solved explicitly for y. ´x 1 1 1.9.3. y(x) = 21 e− 2 x + 0 e−3x e− 2 (s−x) ds. Now, simplify. 1.9.4. (i) m1 and m2 are negative. (ii) α ± iβ = ±iβ , ∀β > 0. 1.11.1. Use Φn0 (Φ (x⋆ )) = Φ (Φn0 (x⋆ )) = Φ (x⋆ ) . (Now what?) 1.11.2. Where was the fact that a Cauchy sequence in a complete space must converge in the space used? n o π· 1.11.3. Does any subsequence of cos 2n : n ∈ N converge in K in b−a L2 (a,b;R) the L2 -sense?
© 2011 by Taylor & Francis Group, LLC
Chapter 2 The Bare-Bone Essentials of Probability Theory
Overview Initial-boundary value problems (IBVPs) involve differential equations whose terms describe certain features (physical, chemical, biological, etc.) of the phenomenon under investigation, as well as initial and boundary conditions that are often determined experimentally. The experiments that yield these parameters or conditions are conducted repeatedly and produce slightly different outcomes due to underlying noise. In deterministic settings, an average of these values is often used as an approximation to the parameter. Doing so effectively removes randomness from the IBVP. Such IBVPs were studied in Volume 1 [295]. The goal of this text is to develop an analogous abstract theory that enables us to study IBVPs without removing randomness from the model. You cannot conduct a meaningful study of stochastic differential equations without having a reasonable understanding of probability theory. What often turns off a newcomer is the hefty dose of measure theory that is typically presented along the way. This chapter constitutes a bare-bones presentation of the necessary notions and theorems of elementary probability theory needed to work through this text — nothing more, nothing less. The discussion is not meant to be rigorous. Rather, it is intended to illustrate the probabilistic ideas very heuristically. A more thorough treatment of the material contained in this chapter can be found in [20, 22, 64, 73, 80, 97, 116, 125, 126, 139, 142, 143, 163, 195, 212, 225, 257, 285, 302, 318, 350 352, 368, 371, 383, 390, 391, 404].
2.1
Formalizing Randomness
You probably have an intuitive understanding of the term randomness. In fact, the previous sentence carries with it an informal quantification of certainty. But, a rigorous mathematical theory cannot be built on intuition alone. We need to develop a more formal framework in which to work so that randomness can be studied pre-
69 © 2011 by Taylor & Francis Group, LLC
70
Volume 2: Stochastic Equations
cisely. Specifically, we need to define a measure that quantifies the likelihood of the occurrence of all conceivable outcomes of an experiment, as well as any event of interest defined using them. We are interested in studying experiments conducted repeatedly under the same conditions, but whose result can change from one trial to another due to some underlying noise. The prototypical familiar examples include tossing a coin or casting a die, recording the outcome, and assigning probabilities to each possible outcome. This is what you encounter in an introductory probability course. To illustrate and motivate the concepts at this early stage, we will first appeal to these elementary examples. Once we have attained comfortable familiarity with the general notions, we will extend the notions to more elaborate settings, and then apply them to the study of more complicated models of interest related to understanding, for instance, the behavior of temperature, population density, or concentration of a chemical or pollutant as time goes on under the influence of some source of randomness. To begin, we gather all possible outcomes of an experiment in a set. Definition 2.1.1. The set of all possible outcomes of an experiment is called the sample space, denoted by Ω. The individual outcomes, called sample points, are denoted by ω . Any subset A of Ω is called an event. Exercise 2.1.1. Consider the experiment of rolling three typical six-sided, differentcolored dice and recording the outcomes as ordered triples of the form (Die 1, Die 2, Die 3). i.) Identify the sample space. ii.) List the outcomes described by each of the following scenarios: a.) An even number appears on all three dice. b.) An even number appears on at least one of the dice. c.) The same number appears on all three dice. d.) The number “7” appears on at least one of the dice. Exercise 2.1.2. Consider the experiment of flipping a fair coin N times and recording the outcomes as ordered N-tuples. i.) Identify the sample space. ii.) Suppose N = 4. List the outcomes described by each of the following scenarios: a.) The four tosses of the coin result in three heads or four tails. b.) The four tosses of the coin results in either no head or no tails. c.) The four tosses of the coin results in an odd number of heads and an odd number of tails. Exercise 2.1.3. Consider the experiment of rolling a four-sided die (the sides of which are numbered 1, 2, 3, 4) until a “4” appears. i.) Systematically describe the sample space. Does it contain only finitely many outcomes? ii.) Now, suppose that you instead record the number of rolls of the die that it takes before a “4” appears. a.) Identify the sample space.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
71
b.) To what outcome of this sample space do the outcomes (1, 4) and (2, 4) obtained when conducting the experiment described in (i) correspond? The scenarios for each of the experiments described in the above exercises can be characterized as subsets of the sample space. For an experiment under consideration, we need to collect all such subsets of Ω “of interest” into a set F . The usual set-theoretic combinations of events (e.g., unions, intersections, complements, etc.) arise naturally and must also belong to F . For practical reasons, however, it is not in our interest to simply include all possible subsets of Ω in F . Rather, we would like to construct F so that it contains the fewest sets possible for which the collection of events with which we are interested can be studied without ambiguity. Consider the following example. Example. Suppose that, in the context of Exer. 2.1.1, we are interested only in the event A = {(1, 1, 1)}. Automatically, A is included in F . But, what other events must be included in order to ensure that F is closed under set-theoretic combinations? For e must belong to F . (What outcomes belong to A?) e The minute we include this one, A event in F , its union and intersection with any other member of F must also be e = Ω and A ∩ A e = ∅ are also members of F . At included. As such, the events A ∪ A n o e this point, you can check directly that F = ∅, A, A,⊗ is closed under set-theoretic combinations. (Do so!) The set F in the above example is sufficient if we are only interested in one event, namely A. If later we decide that we would like to include event B in our study, and B is not one of the four members of F , then we must carefully determine all other events that must be included to ensure that the new set F is closed under set-theoretic combinations; the set F ∪ {B} simply does not work. (Why?) Consider the next example. Example. Suppose now that, in the context of Exer. 2.1.1, we are interested in the following two events: A = {(1, 1, 1)} , B = {(a, b, c) | a, b, and c are all even natural numbers} . We assert that n o e B, B, e ∪ B, e ∩ B, e A ∪ B, A e A e A ∩ B, Ω . F = ∅, A, A,
(2.1)
Exercise 2.1.4. Verify (2.1).
By construction, the sets F in the above two examples contain the fewest events possible. Of course, we could proceed in this manner to construct the set F appropriate for the analysis of any finite collection of events. But, what if we are interested in infinitely many events? While actually constructing the set F as we did above is not
© 2011 by Taylor & Francis Group, LLC
72
Volume 2: Stochastic Equations
be feasible, we impose the same requirement that F be closed under set-theoretic combinations in the sense of the following definition. Definition 2.1.2. Let Ω be a sample space. We say that F is a σ -algebra on Ω if i.) ∅ ∈ F , e ∈ F, ii.) A ∈ F =⇒ A S iii.) {Ai |i ∈ I } ⊂ F , where I is a countable set =⇒ i∈I Ai ∈ F .
Remark. Naturally, you might ask why we did not demand that intersections also belong to F as part of Def. 2.1.2. The reason is that by requiring complements and unions belong to F , intersections are automatically contained in F due to DeMorgan’s laws. Indeed, Ai ∈ F , ∀i ∈ I =⇒
[ i∈I
! ^ [ \ Ai ∈ F =⇒ Ai = Aei ∈ F . i∈I
i∈I
Exercise 2.1.5. Assume that A, B, and C belong to F . Show that the events A ∩ Be ∩C and (A ^ ∪ B ∪C) both belong to F . Note that efficiency, in the sense of containing only those sets that are absolutely necessary in order to study a set of events identified a priori, is not built into the definition of a σ -algebra on Ω. The σ -algebras constructed in the above two examples are illustrations of the following special type of σ -algebra on Ω. Definition 2.1.3. Let Ω be a sample space and consider the collection of events A = {Ai ⊂ ΩT|i ∈ I } . The σ -algebra generated by A , denoted by σ (A ) , is defined by σ (A ) = A ⊂G G , where G is a σ -algebra on Ω.
Remark. By definition, σ (A ) is the smallest σ -algebra on Ω containing A in the sense that if Y is any σ -algebra on Ω containing A , σ (A ) ⊂ Y . Exercise 2.1.6. Prove the above remark. The following σ -algebra on R will be used often in our discussion. Definition 2.1.4. Let G1 = {(a, b] |−∞ < a < b < ∞ } . The Borel class on R is σ (G1 ) . Remarks. 1. The Borel class on R can be formed in different ways, one of which is the σ algebra on R generated by the collection G2 = {(−∞, x] |−∞ < x < ∞ } . 2. The Borel class on RN is σ (GN ) , where GN = {(a1 , b1 ] × . . . × (aN , bN ] |−∞ < ai < bi < ∞, i = 1, . . . , N } . Exercise 2.1.7. Let a ∈ R. i.) Does {a} belong to σ (G1 )?
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
73
ii.) Does (a, b) belong to σ (G1 )? Suppose that for a given experiment, the pair (Ω, F ) has been chosen. The next step is to systematically assign to each event A ∈ F a likelihood (or chance of occurrence), denoted P(A). In an elementary sense, you can think of repeatedly conducting the trials of an experiment and recording the outcome of the ith trial as ωi ∈ Ω. For large values of N, P(A) ≈
number of i ∈ {1, . . . , N} such that ωi ∈ A N
and P(A) equals the limiting value of this expression as N → ∞. Exercise 2.1.8. Based on this interpretation, answer the following questions: i.) Why must P (∅) = 0 and P (Ω) = 1? ii.) Why must 0 ≤ P(A) ≤ 1, ∀A ∈ F ? iii.) If A ∩ B = ∅, explain why P (A ∪ B) = P (A) + P(B). iv.) If A ∩ B 6= ∅, explain how you would modify the formula in (iii). S v.) Explain why it is important for ∞ n=1 An ∈ F in the context of Exer. 2.1.3. Can you formulate equalities comparable to those mentioned in (iii) and (iv) for two sets? We make the notion of the function P precise in the following definition. Definition 2.1.5. A function P : F → [0, 1] for which i.) P (Ω) = 1, S ∞ ii.) P ( ∞ i=1 Ai ) = ∑i=1 P (Ai ) whenever Ai ∈ F and Ai ∩ A j , ∀i 6= j, is a probability measure on (Ω, F ) . We call (Ω, F , P) a probability space and refer to the members of F as (P−)measurable sets. We gather some useful properties of probabilitiy measures below, many of which you encounter in an elementary probability course. Proposition 2.1.6. (Properties of Probability Measures) Let (Ω, F , P) be a probability space and assume that A, Ai (i = 1, 2, . . .) belong to F . Then, e = 1 − P (A); i.) (Complements) P A
ii.) P (∅) = 0; iii.) (Addition Law) P (A ∪ B) = P (A) + P(B) − P (A ∩ B); iv.) (Monotonicity) A ⊂ B =⇒ P (A) ≤ P(B); S v.) (Partition Law) If Ω = Ni=1 Ai and Ai ∩ A j = ∅ whenever i 6= j (that is, the sets A1 , . . . , AN are pairwise disjoint (pwd)), then P(B) = ∑Ni=1 P (B ∩ Ai ) , ∀B ∈ F ; vi.) S (Countable Subadditivity) For any countable collection {Ai : i ∈ I ⊂ N} ⊂ F , P ( i∈I Ai ) ≤ ∑i∈I P (Ai ); S vii.) (Continuity) If Ai ↑ A (i.e., Ai ⊂ Ai+1 , ∀i ∈ N) and ∞ A, then P (Ai ) ↑ i=1 Ai =S P (A) as i → ∞. Similarly, if Ai ↓ A (i.e., Ai ⊃ Ai+1 , ∀i ∈ N) and ∞ i=1 Ai = A, then P (Ai ) ↓ P (A) as i → ∞; viii.) (Subtractivity) P (A \ B) = P(A) − P(B).
© 2011 by Taylor & Francis Group, LLC
74
Volume 2: Stochastic Equations
Proof. We outline the proofs of several parts. e ∪ A = Ω. (How?) i.) Use A e ∅. (How?) ii.) Use (i) and Ω= e ∪ (A ∩ B). (How?) iii.) Use A = A ∩ Be ∪ (A ∩ B) and B = B ∩ A
iv.) Because A ⊂ B, B = A ∪ (B \ A). (So what?) v.) Express B as a finite pairwise disjoint unionof events. (How?) S f f f vi.) i∈I Ai = A1 ∪ A1 ∩ A2 ∪ A1 ∩ A2 ∩ A3 ∪ . . . (Draw a diagram illustrating this. Now what?) S vii.) Assume that Ai ↑ A. Observe that ∞ i=1 Ai can be partitioned by ( D1 = A 1 Di = Ai \ Ai−1 , i = 2, 3, . . . S
S
∞ Observe that ∞ i=1 Di = i=1 Ai and {Di : i ∈ N} are pwd. (Draw a picture.) Then, ! ∞ ∞ N [ P lim Ai = P(A) = P Di = ∑ P (Ai ) = lim ∑ P (Ai ) = i→∞
i=1
= lim P N→∞
N [
Di
i=1
!
i=1
N→∞
i=1
= lim AN . N→∞
viii.) This follows from (iv). (Why?) Exercise 2.1.9. Provide the details in the proof of Prop. 2.1.6. Definition 2.1.7. LetS{Ai : i ∈ N} ⊂ F . T i.) lim sup Ai = S ∞j=1T i≥ j Ai = {ω ∈ Ω : ω ∈ Ai for infinitely many i ∈ N} , ii.) lim inf Ai = ∞j=1 i≥ j Ai = {ω ∈ Ω : ∃N(ω ) ∈ N such that i ≥ N(ω ) =⇒ ω ∈ Ai }.
The following proposition plays an important role in certain convergence arguments. Proposition 2.1.8. (Borel-Cantelli) If {Ai : i ∈ N} ⊂ F is such that ∑∞ i=1 P (Ai ) < ∞, then P (lim sup Ai ) = 0. Remarks. 1. Borel-Cantelli says that the set of outcomes that occur infinitely often in {Ai : i ∈ N} has probability zero. 2. An event with probability zero is called a P-null event. At the other extreme, if P(A) = 1, then we say the event A occurs almost surely, abbreviated as “a.s. [P] .” Exercise 2.1.10. Let {Ai : i ∈ N} ⊂ F . Prove that i.) P (lim sup Ai ) ≥ lim sup P (Ai ) . ii.) P (lim inf Ai ) ≤ lim inf P (Ai ) . In order to avoid theoretical problems, we need to make certain that any subset of a P-null event belongs to our σ -algebra F and is also P-null. This is handled by assuming that the probability space (Ω, F , P) is complete in the following sense.
© 2011 by Taylor & Francis Group, LLC
75
The Bare-Bone Essentials of Probability Theory
Definition 2.1.9. A probability space (Ω, F , P) is complete if for any event A such that A ⊂ B with B ∈ F and P(B) = 0, it is the case that A ∈ F and P(A) = 0. Convention: We henceforth assume without further mention that all probability spaces under consideration in this text are complete.
2.2
R-Valued Random Variables
Consider the experiment of rolling a die (whose faces are labeled 1, 2, 3, and 4) until a 4 appears (cf. Exer. 2.1.3). When conducting this experiment, it can take any number N of rolls in order for a 4 to appear, and we do not know a priori how many such rolls will occur. As such, if it takes N rolls in order for a 4 to appear, then letting 0 act as a place holder, a typical outcome ω is of the form (ω1 , . . . , ωN−1 , 4, 0, 0, . . .) , where ωi ∈ {1, 2, 3} , ∀i ∈ {1, . . . , N − 1} . The collection of all such outcomes constitutes the sample space Ω. Now assume, for simplicity, that F = P (Ω) (the set of all subsets of Ω) and define the function X : Ω → R by X(ω ) = N, where ωN = 4.
(2.2)
This function assigns a numerical value to every outcome in the sample space Ω. Exercise 2.2.1. i.) Compute X −1 ((−∞, N]) , where N ∈ N. ii.) Extend the computation from (i) to X −1 ((−∞, x]) , where x ∈ R. iii.) For what values of x ∈ R is X −1 ((−∞, x]) ∈ F ? Guided by our discussion, defining a distribution function (or probability accumulation function) involving X requires that we consider probabilities of the form P ({ω ∈ Ω : X(ω ) ≤ x}) , where x ∈ R. Doing so requires that ω ∈ Ω : X(ω ) ≤ x | {z }
∈ F , ∀x ∈ R,
i.e., X(ω )∈(−∞,x]
or equivalently, ω ∈ Ω : ω ∈ X −1 ((−∞, x]) = X −1 ((−∞, x]) ∈ F , ∀x ∈ R.
(2.3)
S S T Remark. If (2.3) were true, then because X −1 ( i Ai ) = X −1 (Ai ) and X −1 ( i Ai ) = T
X −1 (Ai ) , it would follow that X −1 (B) ∈ F , for any Borel set B. (Convince yourself.)
© 2011 by Taylor & Francis Group, LLC
76
Volume 2: Stochastic Equations
Exercise 2.2.2. Let a, b ∈ R. Explain how to compute P ({ω ∈ Ω : a ≤ X(ω ) ≤ b}) . We focus our attention on such mappings from Ω into R, defined formally below. Definition 2.2.1. Let (Ω, F , P) be a complete probability space. A function X : Ω → R for which X −1 ((−∞, x]) ∈ F , ∀x ∈ R, is an R-valued random variable.
If the codomain of a random variable of interest is an interval or R itself, it is called continuous. If the codomain is a countable set, then we say the random variable is discrete. Most random variables in practice, and especially in more elaborate settings, are mixed, meaning that the range is comprised of both intervals and discrete points. For simplicity, we restrict our discussion to simple examples. Some natural questions that arise are 1. Which operations on and combinations of random variables defined on (Ω, F , P) produce another random variable defined on (Ω, F , P)? 2. What are some important statistical features of a random variable? 3. Can a calculus be developed for an appropriate collection of random variables? The answer to the first question is addressed by the following proposition, which is easily proved. (Try it!) Proposition 2.2.2. (Combinations of Random Variables) Let X, Y, and {Xn : n ∈ N} be R-valued random variables defined on (Ω, F , P) and let α , β ∈ R. Then, i.) α X ± β Y, XY, inf {Xn : n ∈ N} , lim inf {Xn : n ∈ N} , and lim sup {Xn : n ∈ N} are also R-valued random variables. ii.) If f : R → R is continuous, then f ◦ X is an R-valued random variable.
Remark. We must precisely define lim inf {Xn : n ∈ N} and lim sup {Xn : n ∈ N}. Indeed, {Xn : n ∈ N} is a sequence of real-valued functions, not sets as in Def. 2.1.7. Using Def. 1.5.14, the function lim inf {Xn : n ∈ N} is shorthand notation for the function F : Ω → R given by F(ω ) = lim inf {Xn (ω ) : n ∈ N} , ∀ω ∈ Ω. The function lim sup {Xn : n ∈ N} is defined in a similar fashion. Exercise 2.2.3. Suppose that X is an R-valued random variable defined on (Ω, F , P). i.) Prove that ∀n ∈ N, the function ω 7→ [X(ω )]n is also an R-valued random variable. ii.) Must the function ω 7→ |X(ω )|n be an R-valued random variable, ∀n ∈ N? iii.) More generally than (ii), must the function ω 7→ |X(ω )|γ be an R-valued random variable, ∀γ > 0? iv.) More generally than (iii), must the function ω 7→ |∑ni=1 αi Xi (ω )|γ be an R-valued random variable, ∀γ > 0 and n ∈ N? The notion of a simple function, defined below, and pointwise and uniform limits thereof are important and will arise often in the development of the material.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
77
Definition 2.2.3. i.) Let A ∈ F . The random characteristic function χA : Ω → {0, 1} is defined by ( 0, ω ∈ A, χA (ω ) = 1, ω ∈ Ω \ A. ii.) More generally, let {ck : k = 1, . . . , m} ⊂ R and {Ak : k = 1, . . . , m} ⊂ F be such S that Ak ∩ A j = ∅ whenever k 6= j and Ω = m k=1 Ak . The random variable s : Ω → R m defined by s(ω ) = ∑k=1 ck χAk (ω ) is called a random simple function. Exercise 2.2.4. Explain carefully why a simple function is indeed a random variable. Exercise 2.2.4, together with the results concerning limsup and liminf, begs the question as to what random variables can be constructed using limits of sequences of simple functions. Certainly, such limits must themselves be random variables. (Why?) Such an approximation will have tremendous utility, as you will see. The notion of an “information conduit” is central to our discussion throughout this text; such a conduit is formally built using a sequence of σ -algebras. Plainly speaking, given a sample space Ω, based on the features of our idealized model of the experiment, we identify a collection E of events that we are interested in studying. Then, we form σ (E ) to be the smallest collection of events containing E that must be considered in our discussion (whether directly of interest or not) in order to avoid ambiguity. We now extend this notion using the information gained through the use of a random variable. Suppose that our experiment is modeled abstractly as (Ω, F , P) and that we define a random variable X : Ω → R. We are interested in those events formed using the information provided by the function X. Among the sets of immediate interest are those of the form A(a,b] = {ω ∈ Ω : −∞ < a < X(ω ) ≤ b < ∞} = X −1 (a, b] .
(2.4)
The entire Borel class can be constructed using these sets. (Why?) Using (2.4), we define the σ -algebra generated by X, denoted σ (X), by [ σ (X) ≡ σ A(a,b] : −∞ < a < b < ∞ . (2.5)
Note that σ (X) ⊂ F because we cannot escape the set of events used to model the experiment. The practical importance of σ (X) is that it consists precisely of the collection E of events for which for any possible outcome ω ∈ Ω, the information provided by X is all that you need in order to decide whether or not ω ∈ E . Of course, the downside is that information about the experiment is lost when computing a random variable. For instance, within the context of Exer. 2.1.3, knowing that X(ω ) = 2 simply tell us that ω ∈ {(1, 4, 0, . . .) , (2, 4, 0, . . .) , (3, 4, 0, . . .)}. We cannot deduce which of these three elements actually occurred. As such, while (2.5) is a rich set, it does not contain all the information about our experiment. That said, we can build onto this set to produce an even richer set. Indeed, we can use information provided by another random variable defined on Ω. Precisely, suppose that we
© 2011 by Taylor & Francis Group, LLC
78
Volume 2: Stochastic Equations
are interested in the collection of all events that are completely determined by the information provided by two random variables X1 and X2 . Then, σ ({X1 , X2 }) should be defined by
σ ({X1 , X2 }) = σ
[
i∈{1,2}
{ω ∈ Ω : −∞ < a < Xi (ω ) ≤ b < ∞} .
(2.6)
Clearly, σ (Xi ) ⊂ σ ({X1 , X2 }) , for i = 1, 2. (Why?) As such, we intuitively think of σ ({X1 , X2 }) as carrying more information about the experiment than does σ (Xi ). Later in our discussion, we will encounter to consider more elaborate the need : γ ∈ Γ , where Γ is an uncountable collections of such random variables, say X γ index set. The σ -algebra σ Xγ : γ ∈ Γ is defined as in (2.6) with {1, 2} replaced by Γ. In such case, observe that for Γ = [γ1 , γ2 ], γ1 < s < t ≤ γ2 =⇒ σ Xγ : γ ∈ [γ1 , s] ⊂ σ Xγ : γ ∈ [γ1 ,t] ⊂ F . (2.7) The collection Xγ : γ ∈ [γ1 , s] : s ∈ [γ1 , γ2 ] is an increasing family of sub σ algebras of F called a filtration. This provides an information conduit of sorts. We will revisit this notion later in the chapter. By definition, to every random variable there corresponds a unique distribution function defined as follows. Definition 2.2.4. Let X : Ω → R be a random variable. The function FX : R → [0, 1] defined by (2.8) FX (x) = P ({ω ∈ Ω : X(ω ) ≤ x}) = P X −1 (x)
is the distribution function of X.
Naively, FX can be thought of as an accumulation function. See [212] for a proof of the uniqueness of such a function. Convince yourself of the following properties. Proposition 2.2.5. (Properties of Distribution Functions) Let FX : R → [0, 1] be the distribution function of a random variable X : Ω → R. i.) FX is increasing. ii.) lim FX (x) = 1. x→∞
iii.) lim FX (x) = 0. x→−∞
iv.) FX is right-continuous. v.) P ({ω ∈ Ω : a < X(ω ) ≤ b}) = FX (b) − FX (a). Remark. We write P (a < X ≤ b) in place of P ({ω ∈ Ω : a < X(ω ) ≤ b}) . Exercise 2.2.5. Prove Prop. 2.2.5. A random variable X is defined “uniquely” (i.e., equality with probability one) by its distribution function FX in the sense that FX = FY =⇒ X(ω ) = Y (ω ) a.s. [P] .
© 2011 by Taylor & Francis Group, LLC
(2.9)
The Bare-Bone Essentials of Probability Theory
79
For instance, consider the prototypical example of tossing a coin N times and recording each time whether the coin lands heads or tails side up. Assuming that tosses are mutually independent (naively, this means that the result of any toss has no impact on any of the other tosses) and P (head) = p, for some 0 < p < 1, for all tosses, this experiment is historically referred to as a binomial experiment. (What is the sample space Ω?) Define the random variable X p : Ω → {0, 1, . . . , N} by X p (ω ) = number of heads obtained in N tosses. In such case, X p is a binomial random variable and we write “X p is b(N, p).” It is intuitive that if p 6= q, then X p 6= Xq . More precisely, there is a set A of outcomes for which P(A ) > 0 and X p (ω ) 6= Xq (ω ), ∀ω ∈ A . Exercise 2.2.6. Let N = 2, p = 21 , and q = 14 . Show that X p 6= Xq . Assume that X is a continuous R-valued random variable. The “accumulation function” interpretation of FX suggests that FX (x) = P (X ≤ x) = accumulation of probability up to x.
(2.10)
In some situations, a function fX : R −→ [0, ∞) (called the probability density function of X) can be identified such that ˆ x FX (x) = fX (t)dt. −∞
Typically, it is not feasible, or even possible, to explicitly determine such a function.
2.2.1
Some Useful Statistics for Random Variables
In elementary settings, the mean (or expectation) of a random variable X, denoted by µX or E[X], can be thought of as a sort of weighted average and is computed using the probability density of X. For instance, if X is b (N, p), then the mean of X is N p. However, given that a probability density need not exist, we need a definition that does not rely on it. To this end, we have the following. Definition 2.2.6. The expectation of X, denoted E[X], is defined by ˆ E[X] = X (ω ) dP. Ω
´
The integral Ω X (ω ) dP might seem a bit strange to you, especially if you are not familiar with the Lebesgue integral. After all, what do we mean by an integral with respect to a measure P? We use a “building-block” approach to define such an integral, as follows.
© 2011 by Taylor & Francis Group, LLC
80
Volume 2: Stochastic Equations
´ Definition 2.2.7. “Building Block” Definition of Ω X (ω ) dP i.) Step 1: Characteristic Function Let A ∈ F and c ∈ R, and consider X(ω ) = cχA (ω ). We define ˆ cχA (ω )dP ≡ c [1 · P(A) + 0 · P(Ω \ A)] = cP(A).
(2.11)
Ω
ii.) Step 2: Simple Function Let {Ak : k = 1, . . . , m} ⊂ F be such that Ak ∩ A j = ∅ whenever k 6= j and Ω = Sm m k=1 Ak and let {ck : k = 1, . . . , m} ⊂ R. Consider X(ω ) = ∑k=1 ck χAk (ω ). We define ! ˆ ˆ m
Ω
m
∑ ck χAk (ω )
k=1
m
∑ ck
dP ≡
k=1
Ω
χAk (ω )dP =
∑ ck P (Ak ) .
(2.12)
k=1
iii.) Step 3: General Positive Random Variable Let X : Ω → [0, ∞) be a nonnegative random variable and consider a monotone increasing sequence of random simple functions {sm : m ∈ N} such that lim sm (ω ) = X(ω ), ∀ω ∈ Ω.
m→∞
We define
ˆ
Ω
X (ω ) dP ≡ lim
ˆ
m→∞ Ω
sm (ω )dP.
(2.13)
iv.) Step 4: General Random Variable Let X : Ω → R be a random variable. Using two new random variables X + , X − : Ω → [0, ∞) by X + (ω ) = max (X(ω ), 0) , X − (ω ) = max (−X(ω ), 0) , (2.14) we define
ˆ
Ω
X (ω ) dP ≡
ˆ
Ω
X + (ω ) dP −
ˆ
X − (ω ) dP.
(2.15)
Ω
Remarks. 1. The familiar properties of the integral, such as linearity and monotonicity, also hold for the integral defined in Def. 2.2.7 and are proven easily using the properties of the measure P with the help of the building-block approach. (See [212, 404] for a thorough discussion.) 2. We recover the interpretation´that E[X] is the “average value” of X over Ω by 1 simply noting that E[X] = P(Ω) Ω X (ω ) dP because P(Ω) = 1. This quantity resembles the average value of a real-valued function f over the interval [a, b], which ´b 1 is given by b−a a f (x)dx. The following properties of expectation are useful in all facets of our discussion. Proposition 2.2.8. (Basic Properties of Expectation) Let X, X1 , X2 , . . . be R-valued random variables defined on (Ω, F , P) and {αk : k ∈ N} ⊂ R.
© 2011 by Taylor & Francis Group, LLC
81
The Bare-Bone Essentials of Probability Theory
m i.) (Linearity) E [∑m k=1 αk Xk ] = ∑k=1 αk E [Xk ]. Further, if {Xk : k ∈ N} are non∞ negative random variables for which ∑∞ k=1 E [Xk ] < ∞, then E [∑k=1 αk Xk ] = ∞ ∑k=1 αk E [Xk ]. ii.) (Monotonicity) Y (ω ) ≤ X(ω ), ∀ω ∈ Ω =⇒ E [Y ] ≤ E [X] . iii.) |E[X]| ≤ E [|X|]. iv.) (Jensen’s Inequality) If ϕ : R → R is convex, E [|X|] < ∞, and E [|ϕ (X)|] < ∞, then ϕ (E [X]) ≤ E [ϕ (X)] . 1 p
+ 1q = 1. If E [|X| p ] < ∞
|E[XY ]| ≤ (E [|X| p ]) p (E [|Y |q ]) q .
(2.16)
v.) (Hölder’s Inequality) Let 1 ≤ p ≤ q < ∞ be such that and E [|X|q ] < ∞, then 1
1
1
1
1
vi.) (Minkowski’s Inequality) ∀p > 1, (E [|X + Y | p ]) p ≤ (E [|X| p ]) p + (E [|Y | p ]) p . h i vii.) If E |X|2 = 0, then X = 0 a.s. [P] . viii.) If X(ω ) = Y (ω ) a.s. [P], then E [X] = E [Y ] . Remarks. 1. We have used brackets in the expression E[X] to emphasize that the expectation is an operator with input X. That said, when considering E [|X|] , we shall streamline the notation and henceforth routinely write E |X|. 2. When p = q = 2, (2.16) is often referred to as the Cauchy-Schwarz inequality. 3. Remember, the phrase “X = 0 a.s. [P]” means ∃D ∈ F such that P(D) = 0 and X(ω ) = 0, ∀ω ∈ Ω \ D. 4. Proposition 2.2.8(viii) is similar to the following familiar property of the Riemann ´b integral: If f (x) ≥ 0, ∀x ∈ [a, b], then a f (x)dx = 0 =⇒ f (x) = 0, ∀x ∈ [a, b] . (Interpret this visually.) Establishing estimates involving the expectation of various random quantities will become standard practice in this text. Use the properties in Prop. 2.2.8 to complete the following exercises. Exercise 2.2.7. Let α , β ∈ R and X,Y : Ω → R be random variables. Prove i.) |E [α X + β Y ]| ≤ |α | E |X| + |β | E |Y | ; ii.) (E [α X + β Y ])2 ≤ α 2 E X 2 + 2αβ E [XY ] + β 2 E Y 2 ; h i4 4 3 4 α Y −α 1 3 iii.) E X− · ≤ E |X − α | E |Y − α | , provided β 6= 0. β β β8
Exercise 2.2.8. Suppose that Z : Ω → R is defined by Z(ω ) = 1, ∀ω ∈ Ω. Prove i.) E [Z] = 1; ii.) E [α ] = α , ∀α ∈ R. (That is, the expectation of a constant is the constant.)
Another useful statistic that measures the dispersion of the values X(ω ) around E[X] is called the variance, defined below.
© 2011 by Taylor & Francis Group, LLC
82
Volume 2: Stochastic Equations
Definition 2.2.9. Let X : Ω → R be a random variable. The variance of X, denoted σX2 or Var [X], is defined by Var[X] ≡ E [X − E[X]]2 = E X 2 − (E[X])2 . (2.17) p The standard deviation of X, denoted σX , is given by σX = Var[X]. Exercise 2.2.9. Let α , β ∈ R. Prove that Var [α X + β ] = α 2Var[X].
Other useful statistics (such as skewness and kurtosis) can be defined in terms of E |X| p , for p ∈ N. These quantities arise when establishing important estimates and when studying stability. Definition 2.2.10. Let p ∈ N and X : Ω → R be a random variable. The pth moment of X is given by E |X| p .
A well-known lower bound for the pth moment is provided by Chebyshev’s inequality, a version of which is as follows. Proposition 2.2.11. (Chebyshev’s Inequality) Suppose that X : Ω → [0, ∞) is a random variable. Then, ∀ε , p > 0, E [X p ] ≥ ε p P ({ω ∈ Ω : X(ω ) ≥ ε }) .
(2.18)
Exercise 2.2.10. Let Y : Ω → R be such that E [Y ] < ∞. Prove that ∀α > 0, 1 . α2 At times, we want to compare two random variables X and Y . Two useful statistical measures in this regard are as follows. P ({ω ∈ Ω : |Y (ω ) − E[Y ]| ≥ ασY }) ≤
Definition 2.2.12. Let X,Y : Ω → R be random variables. i.) The correlation of X and Y is defined by r (X,Y ) = E[XY ]. If r (X,Y ) = 0, we say X and Y are orthogonal. ii.) The covariance of X and Y is defined by Cov(X,Y ) = E [(X − E[X])(Y − E[Y ])] . ) iii.) The correlation coefficient of X and Y is defined by ρXY = Cov(X,Y σX ·σY , provided that σX · σY 6= 0.
2.2.2
Some Common Random Variables
We already encountered one prototypical model, namely the binomial random variable. Another commonly-occurring random variable is one that assigns the same probability to each of its outcomes; this is called a uniform random variable. If such a random variable X is discrete, then its sample space must be finite. (Why?) If X is continuous, then there exist α , β ∈ R such that α < β for which the probability density function equals β −1 α at all values within the interval [α , β ] and zero outside this interval. (Why?) For this case, we write “X is u (α , β ) .” The single most commonly occurring continuous random variable is the Gaussian, or normal, random variable, defined as follows.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
83
Definition 2.2.13. A random variable X : Ω → R is Gaussian if its probability density function is given by " # 1 1 X −µ 2 , x ∈ R, (2.19) nµ ,σ (x) = √ exp − 2 σ σ 2π where µ ∈ R and σ > 0. We write “X is n µ , σ 2 .”
It can be shown that E[X] = µ and Var[X] = σ 2 . (See [212, 404].)
Proposition 2.2.14. (Properties of Gaussian Random Variables) µ i.) (Standard Normal) If X is n µ , σ 2 , then Z = X− σ is n(0, 1). ii.) (Linear Transformation of Normal) If X is n µ , σ 2 and α , β ∈ R, then α X + β 2 2 is n α µ + β , β σ .
Exercise 2.2.11. Let N ∈ N and suppose XN : Ω → R is b (N, p) . i.) Compute E [XN ] and Var [XN ] . ii.) Suppose that Y : Ω → R is n(N p, N p(1 − p)). Does the density for Y serve as a good approximation of the density of XN ? What happens to this approximation as N → ∞?
2.3
Introducing the Space L2 (Ω; R)
The collection of all random variables with finite second moment will be especially important in our development of stochastic calculus used in the analysis of stochastic evolution equations. We begin with the following space. Definition 2.3.1. The space L2 (Ω; R) is defined by L2 (Ω; R) = X : Ω → R : X is a random variable with E[X 2 ] < ∞
(2.20)
Naturally, we need to establish the structure of L2 (Ω; R), with an eye pointed toward showing that it is a Hilbert space when equipped with the appropriate inner product. The easiest question to answer is whether or not L2 (Ω; R) is a linear space (in the sense of Def. 1.7.1). Indeed, using earlier exercises in Section 2.2 with the properties of expectation, it is not difficult to conclude that it is. Exercise 2.3.1. Prove that L2 (Ω; R) is a linear space. Next, define h·, ··iL2 : L2 (Ω; R) → R by hX,Y iL2 ≡ E |XY | .
© 2011 by Taylor & Francis Group, LLC
(2.21)
84
Volume 2: Stochastic Equations
Exercise 2.3.2. Prove that (2.21) defines an inner product on L2 (Ω; R). This inner product induces the following norm on L2 (Ω; R): 1 1 2 kXkL2 (Ω;R) ≡ hX, XiL2 2 = E |X|2 .
(2.22)
Exercise 2.3.3. Argue directly that (2.22) defines a norm on L2 (Ω; R). At this point, we conclude that L2 (Ω; R) is an inner product space. But, does it earn the rank of Hilbert space, that is, is it complete with respect to the norm (2.22)? Before answering this question, we must make precise the notions of a convergent sequence and a Cauchy sequence in L2 (Ω; R). Definition 2.3.2. A sequence of R-valued random variables {Xn } is said to be i.) convergent to X in L2 (Ω; R) (or convergent in mean square) if ∀ε > 0, ∃N ∈ N such that n ≥ N =⇒ kXn − Xk2L2 = E |Xn − X|2 < ε .
We write Xn → X in L2 (or equivalently, kXn − XkL2 −→ 0). ii.) Cauchy in L2 (Ω; R) (or Cauchy in mean square) if ∀ε > 0, ∃N ∈ N such that m, n ≥ N =⇒ kXm − Xn k2L2 = E |Xm − Xn |2 < ε .
Many of the following limit properties are standard and can be proven using arguments similar to those used in Section 1.5.2, but with the absolute value replaced by the L2 -norm. (See [212], for instance, for more details.) Proposition 2.3.3. (Limit Theorems for L2 (Ω; R)) Let {Xn } and {Yn } be sequences in L2 (Ω; R) and let {αn } ⊂ R. i.) If {Xn } is convergent in L2 (Ω; R), then {Xn } is bounded in L2 (Ω; R). ii.) For every Z ∈ L2 (Ω; R) , if αn −→ α in R, then αn Z −→ α Z in L2 (Ω; R) . iii.) For every α , β ∈ R, if Xn −→ X and Yn −→ Y in L2 (Ω; R), then (α Xn ± β Yn) −→ α X ± β Y in L2 (Ω; R). iv.) If Xn −→ X in L2 (Ω; R) , then E [Xn ] −→ E[X] in R. v.) If Xn −→ X and Yn −→ Y in L2 (Ω; R), then E [XnYn ] −→ E[XY ] in R. Proof. Linearity and the Cauchy-Schwarz inequality are the primary tools at work here. We shall prove (v) and leave the others for you to complete as an exercise. Let ε > 0. By (i) of this proposition, ∃M > 0 such that kYn kL2 ≤ M, ∀n ∈ N. By assumption, ∃N1 , N2 ∈ N such that n ≥ N1 =⇒ kXn − XkL2 < n ≥ N2 =⇒ kYn − Y kL2 <
© 2011 by Taylor & Francis Group, LLC
ε , 2M
ε . 2 (kXkL2 + 1)
(2.23) (2.24)
The Bare-Bone Essentials of Probability Theory
85
Let N = max {N1 , N2 } . Then, n ≥ N =⇒ |E [XnYn ] − E [XY ]| = |E [XnYn ] − E [XYn ] + E [XYn ] − E [XY ]| = |E [(Xn − X)Yn ] + E [X (Yn − Y )]| ≤ |E [(Xn − X)Yn ]| + |E [X (Yn − Y )]| 1 1 2 2 E |Yn |2 + ≤ E |Xn − X|2 1 1 2 2 E |X|2 E |Yn − Y |2 < ε.
Exercise 2.3.4. Prove the remaining parts of Prop. 2.3.3. Exercise 2.3.5. If ∀i ∈ . . . , N} , (αi )m −→ αi⋆ in R and (Xi )m −→ Xi⋆ in L2 (Ω; R) {1, N as m −→ ∞, must E ∑i=1 (αi )m (Xi )m have a limit in L2 (Ω; R) as m −→ ∞? If so, what is the limit? Prove your assertion. Exercise 2.3.6. Assume that f : R→ R is uniformly continuous. Prove that if {Xn } is Cauchy in L2 (Ω; R), then { f (kXn kL2 )} converges in R. Exercise 2.3.7. Prove that if {Xn } converges in L2 (Ω; R), then {Xn } is Cauchy in L2 (Ω; R). (In fact, this is true in any normed space.) In order to prove that L2 (Ω; R) is a Hilbert space with inner product (2.21), we need to establish the converse of Exer. 2.3.7, namely that every Cauchy sequence in L2 (Ω; R) converges in L2 (Ω; R). The proof of this fact resembles the proof that (R, |·|) is complete. Summarizing, we have Theorem 2.3.4. The space L2 (Ω; R) given by Def. 2.3.1 is a Hilbert space when equipped with the inner product (2.21) and induced norm (2.22). More generally, the space L p (Ω; R) , where p ≥ 1, is defined as in Def. 2.3.1 with the condition E[X 2 ] < ∞ replaced by the E[X p ] < ∞. While this space is not a Hilbert space unless p = 2, it is a Banach space when equipped with the norm 1
kXkL p (Ω;R) ≡ (E |X| p ) p .
(2.25)
There are many other useful notions of convergence in the probabilistic setting. In fact, the richness of the structure enables us to define a wide variety of notions, each useful for different reasons. We mention a few of them below, along with some interpretation, and state, without proof, their interrelationships. (See [212] for a detailed discussion.) Of all of them, convergence in mean will be predominantly used in this text, with an occasional appeal to the other ones.
© 2011 by Taylor & Francis Group, LLC
86
Volume 2: Stochastic Equations
Definition 2.3.5. A sequence of random variables {Xn } is said to be i.) convergent to X in pth moment (p ≥ 1) if E |Xn | p < ∞, ∀n ∈ N, E |X| p < ∞, and ∀ε > 0, ∃N ∈ N such that n ≥ N =⇒ E |Xn − X| p < ε . We write Xn −→ X in L p (Ω; R). ii.) convergent to X almost surely (a.s.) if ∃D ∈ F such that P(D) = 0 and ∀ε > 0, ∃N ∈ N such that ∀ω ∈ Ω \ D, n ≥ N =⇒ |Xn (ω ) − X(ω )| < ε . We write Xn −→ X a.s. [P] . iii.) convergent to X in probability if ∀ε , η > 0, ∃N ∈ N such that n ≥ N =⇒ P ({ω ∈ Ω : |Xn (ω ) − X(ω )| ≥ ε }) < η . We write Xn −→ X in probability. iv.) convergent to X in distribution if the sequence of distribution functions {FXn (x)} converges pointwise (in R) to the distribution function FX at all points of continuity of FX . We write Xn −→ X in distribution. Remarks. 1. Def. 2.3.5(ii) essentially means that the random sequence {Xn } converges pointwise to X at all ω ∈ Ω except for possibly those in a P-null set. The condition can be written alternatively as n o P ω ∈ Ω : lim Xn (ω ) = X(ω ) = 1. n→∞
2. Some of the convergence types are easier to verify in practice than others. As such, it is often helpful to take advantange of the several interrelationships among the different types of convergence notions. Summarizing these relationships, assume that 1 ≤ p ≤ q ≤ ∞. The most straightforward string of relationships is as follows: (i) with p =⇒ (i) with q =⇒ (iii) =⇒ (iv).
(2.26)
Type (ii) can be woven into this string as well, in the sense that (ii) =⇒ (iii) =⇒ (iv).
(2.27)
3. Recall that if lim fn (t) = f (t) and lim fn (t) = g(t), ∀t ∈ Ω, (where all of the funcn→∞
n→∞
tions are real-valued and defined on Ω), then f (t) = g(t), ∀t ∈ Ω, in the deterministic setting. This “uniqueness of limit” must be interpretted a bit more loosely in the probabilistic setting. Precisely, if fn , f , and g are now random variables, then we interpret the uniqueness result as occurring “with probability 1,” meaning that f (t) = g(t) a.s.[P] . As such, the equality need not occur ∀t ∈ Ω, but rather ∃D ∈ F such that P(D) = 0 and f (t) = g(t), ∀t ∈ Ω \ D.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
87
Exercise 2.3.8. Assume that 1 < p ≤ q < ∞. Prove that if Xn −→ X in Lq (Ω; R) , then Xn −→ X in L p (Ω; R). The corresponding “Cauchy variants” of the convergence types in Def. 2.3.5, as well as the existence of a subsequence that satisfies each condition, can be considered and appropriately woven into the interrelationship implications (2.26) and (2.27) to produce a massive implication diagram. (Try it!) Of these, we will need the following. Proposition 2.3.6. If {Xn } is Cauchy in L2 (Ω; R) , then there exists a subsequence Xnk for which ∃Y ∈ L2 (Ω; R) such that lim Xnk (ω ) = Y (ω ) a.s. [P]. k→∞
Before extending our discussion to RN -valued random variables, we state the following fact, which will be useful later in the text. (See [20, 212] for a proof.) Proposition 2.3.7. The mean square limit of a sequence of Gaussian random variables is itself a Gaussian random variable.
2.4
RN -Valued Random Variables
As you work through this section, try to deliberately make connections to the corresponding development in R in Section 2.2 and pay particular attention to the nature of the modifications. Doing so will be helpful when extending the theory of stochastic evolution equations (SEEs) in R to the theory of SEEs in RN . Definition 2.2.1 can be extended in a natural way to the case when the codomain is RN , meaning that we now consider functions of the form X : Ω −→ RN , where X(ω ) = hX1 (ω ), . . . , XN (ω )i , ω ∈ Ω,
(2.28)
where the component functions Xi (i = 1, . . . , N) are random variables in the sense of Def. 2.2.1. In order to make the definition precise, we need the inverse images of the “right sets” to belong to F . For an R-valued random variable X, we required that X −1 (B) ∈ F , ∀B ∈ σ ((a, b] : a, b ∈ R) .
(2.29)
Exercise 2.4.1. Based on (2.29), what would a natural condition be for RN -valued random variables? As it turns out, if we consider Cartesian products of the form R = (a1 , b1 ] × . . . × (aN , bN ] ,
© 2011 by Taylor & Francis Group, LLC
(2.30)
88
Volume 2: Stochastic Equations
where ai , bi ∈ R with ai < bi , ∀i ∈ {1, . . . , N} , then (2.29) translates as X−1 (B) ∈ F , ∀B ∈ σ (G ) ,
(2.31)
where G = {B : B is of the form (2.30)}. Formally, we have
Definition 2.4.1. A function X : Ω −→ RN for which (2.31) holds is an RN -valued random variable (or random vector). We often write X = hX1 , . . . , XN i, where the input ω (as written in (2.28)) has been suppressed. We can also generalize this notion one step further to the case when the codomain is a separable Hilbert space. This will be discussed in Chapter 5. Random vectors arise in practical situations in the same manner that nonrandom vectors do when more than one measurement is needed in order to describe a phenomenon. For instance, the trajectory of an object moving through a region in 3space during a prescribed time interval can be described as a vector-valued function t 7→ hx(t), y(t), z(t)i . If the component functions are viewed as random variables (which is reasonable given that seemingly unpredictable wind gusts and other environmental factors can affect the motion of a moving object), then this function would be a random vector function t 7→ hx(t, ω ), y(t, ω ), z(t, ω )i; and for any fixed time t0 , the vector hx(t0 , ω ), y(t0 , ω ), z(t0 , ω )i is an R3 -valued random variable. The arithmetic operations of vectors in RN and the calculus of RN -valued functions are all performed componentwise, as shown in Section 1.6.1. This suggests a natural extension of the notions developed for R-valued random variables to the present setting. Using this fact, it is not difficult to deduce that the combinations of R-valued random variables stated in Prop. 2.2.2 also hold for RN -valued random variables. (Convince yourself!) Also, the notion of a distribution function of an RN valued random variable X is characterized in terms of its components {Xi }. Precisely, we have Definition 2.4.2. Let X = hX1 , . . . , XN i be an RN -valued random variable. The function FX : RN −→ [0, 1] defined by FX (x1 , . . . , xN ) = P ({ω ∈ Ω : X1 (ω ) ≤ x1 and . . . and XN (ω ) ≤ xN })
(2.32)
is the (joint) distribution function of X. As in the real-valued case, such a random vector X is defined uniquely by its distribution function FX in the sense that FX = FY =⇒ X(ω ) = Y(ω ) a.s. [P] , which further simplifies to Xi (ω ) = Yi (ω ) a.s. [P] , ∀i ∈ {1, . . . , N} . Of course, proving that FX = FY is generally nontrivial, unless you have a very nice representation formula for the distribution function. Naturally, the definition of the expectation of an RN -valued random variable is as follows:
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
89
Definition 2.4.3. Let X = hX1 , . . . , XN i be an RN -valued random variable. i.) The expectation of X, denoted E [X], is the nonrandom constant vector in RN given by E [X] = hE [X1 ] , . . . , E [XN ]i . (2.33)
ii.) The variance of X, denoted Var [X], is the nonrandom constant vector in RN given by Var [X] = hVar [X1 ] , . . . ,Var [XN ]i . (2.34) Exercise 2.4.2. i.) Explain carefully why Def. 2.4.3 is natural. h i ii.) Explain why the relationship Var [X] = E (X − E [X])2 is valid when X is an RN -valued random variable.
Exercise 2.4.3. Assume that X is n 0, σX2 and Y is n 0, σY2 . i.) Compute E [hX,Y i] . ii.) Compute E [hα1 X + β1 , α2Y + β2 i] , where αi , βi ∈ R (i = 1, 2). iii.) Compute E [hX + Y, X − 2Y i] . iv.) Explain why ω 7→ khX(ω ),Y (ω )ikR2 is an R-valued random variable. v.) How does E [khX,Y ikR2 ] compare to kE [hX,Y i]kR2 ? vi.) Try to extract some properties of expectation for R2 -valued random variables from these examples. Do you suspect these properties also apply to RN -valued random variables? (Compare to Prop. 2.2.8.) The following properties are analogous to those established for R-valued random variables (cf. Prop. 2.2.8.) Proposition 2.4.4. (Properties of Expectation for RN -Valued Random Variables) Let X, Y, X1 , . . . , Xm be RN -valued random variables on (Ω, F , P) and {αk : k ∈ N} a sequence in R. m i.) (Linearity) E [∑m k=1 αk Xk ] = ∑k=1 αk E [Xk ]. ii.) kE[X]kRN ≤ E kXkRN . iii.) (Hölder’s Inequality) Let 1 ≤ p ≤ q < ∞ be such that 1p + 1q = 1. If E kXkRp N < ∞ and E kXkqRN < ∞, then 1p q1 q |E [hX, YiRN ]| ≤ E kXkRp N E kXkRN .
(2.35)
h i 1 1 p p iv.) (Minkowski’s Inequality) ∀p > 1, E kX + YkRp N ≤ E kXkRp N + E kYkRp N . n o v.) (Chebyshev’s Inequality) ∀ε , p > 0, E kXkRp N ≥ ε p P ω ∈ Ω : kX(ω )kRp N ≥ ε . h i vi.) If E kXk2RN = 0, then Xi = 0 a.s. [P] , ∀i ∈ {1, . . . , N} .
© 2011 by Taylor & Francis Group, LLC
90
Volume 2: Stochastic Equations
Exercise 2.4.4. Prove Prop. 2.4.4(i) and (v). Exercise 2.4.5. Let α , β ∈ R and X, Y be RN -valued random variables. Prove: i.) kE [α X + β Y]kRN ≤ |α | E kXkRN + |β | E kYkRN . ii.) Derive an estimate for kE [α X + β Y]k2RN . The following two statistical measures constitute an extension of Def. 2.2.12 that applies to RN -valued random variables. Definition 2.4.5. Let X = hX1 , . . . , XN i and Y = hY1 , . . . ,YN i be RN -valued random variables. i.) The correlation of X and Y is the N × N matrix r (X, Y) defined by E [X1Y1 ] · · · E [X1YN ] r (X1 ,Y1 ) · · · r (X1 ,YN ) .. .. .. .. (2.36) r (X, Y) = . = . ··· . . ··· . E [XN Y1 ] · · · E [XN YN ]
r (XN ,Y1 ) · · · r (XN ,YN )
ii.) The covariance of X and Y is the N × N matrix Cov (X, Y) is defined by Cov (X1 ,Y1 ) · · · Cov (X1 ,YN ) .. .. Cov (X, Y) = (2.37) . . ··· . Cov (XN ,Y1 ) · · · Cov (XN ,YN )
A Gaussian R-valued random variable is characterized completely by its mean and variance. This extends in a natural way to an RN -valued Gaussian random variable X, but we must account for all pairwise variances of the components of X because each contributes to its total variance.
− µ and Definition 2.4.6. An RN -valued random variable X is Gaussian with mean → → − covariance matrix Σ , denoted by n µ , Σ , if its probability density is given by −1 T 1 1 → − → − fX (x) = exp − x − µ Σ x − µ . (2.38) N √ 2 (2π ) 2 det ∑ → The standard Gaussian has mean − µ = 0 and Σ is the identity element of MN (R).
Exercise 2.4.6. Prove that if X is the standard Gaussian RN -valued random variable, then its density is the product of N one-dimensional n (0, 1) densities. Proposition 2.4.7. (Properties of an N-Dimensional Gaussian) → → − − i.) If X : Ω −→ RN is n − µ→ X , ΣX , α is a constant m × N matrix, and β is an m × 1 → − → constant vector, then Y = − α X + β is an m-dimensional Gaussian random variable → − → →T Σ . →− − → − − wiht mean − µ→ Y = α µX + β and covariance ΣY = α α X ii.) An RN -valued random variable X = hX1 , . . . , XN i is an N-dimensional Gaussian
© 2011 by Taylor & Francis Group, LLC
91
The Bare-Bone Essentials of Probability Theory
random variable iff ∀k ∈ {1, . . . , N} , there exist real constants ak , (bk )1 , . . . , (bk )m and R-valued n(0, 1) random variables Z1 , . . . , Zn such that ∀k ∈ {1, . . . , N} , m
Xk = ak + ∑ (bk ) j Z j . j=1
(That is, each component of X is itself an R-valued normal random variable.) Finally, the analog of L2 (Ω; R) in this setting is constructed by making the usual change from the R-norm to the RN -norm and making the appropriate computational modifications typical of those introduced in this section. Indeed, we have Theorem 2.4.8. The space L2 Ω; RN given by o n (2.39) L2 Ω; RN = X : Ω → RN : X is a random variable with E kXk2RN < ∞ equipped with the inner product
and induced norm
is a Hilbert space.
hX, YiL2 (Ω;RN ) ≡ E XYT
1 2 kXkL2 (Ω;RN ) ≡ E kXk2RN
(2.40)
(2.41)
Exercise 2.4.7. Formulate and prove an extension of Prop. 2.3.3 for L2 Ω; RN .
All notions of convergence defined in Def. 2.3.5 can be formulated in a natural way for RN -valued random variables by simply replacing the R-norm by the RN norm, and interpretting the result componentwise. (Convince yourself that this is reasonable.) Moreover, all results stated in Section 2.3 extend without issue. We shall revisit these notions again in Chapter 5 when the need for a more general Hilbert space-valued random variable arises.
2.5
Conditional Probability and Independence
The probabilities associated with the events formed using the outcomes of an experiment can change if additional information is provided a priori and taken into account. Indeed, suppose that an event B ∈ F such that P(B) > 0 is known to occur in the sense that any outcome ω ∈ Ω is observed either to belong to B or not to belong to B. This is not as powerful as actually observing the outcome ω itself, but it does provide some information. A natural question to ask is for any A ∈ F , what is the probability of A occurring now, given that we can now use information provided by
© 2011 by Taylor & Francis Group, LLC
92
Volume 2: Stochastic Equations
knowing that B has occurred? Consider the following exercise. Exercise 2.5.1. Consider the experiment of rolling two six-sided balanced dice with faces labeled as 1, 2, 3, 4, 5, and 6. Record the outcome as (Roll 1, Roll 2). i.) What is the sample space Ω? For any ω ∈ Ω, compute P ({ω }). ii.) Now, suppose that it is known a priori that a pair (i.e., the same number occurs on both dice) is NOT rolled. a.) Express this information as a specific event B and compute P(B) . b.) In effect, knowing that B has occurred changes the sample space of our experiment to Ω \ B. Why? c.) Let A = {ω ∈ Ω : ∃i ∈ {1, . . . , 6} such that ω = (1, i)} . Compute P(A) using Ω \ B as the new sample space. How does this compare to P(A∩B) P(B) , where the probabilities are computed using the entire sample space Ω? This suggests the following definition. Definition 2.5.1. Let A, B ∈ F be such that P(B) > 0. The conditional probability . of A given B, denoted P (A|B), is defined as P (A|B) = P(A∩B) P(B) Proposition 2.5.2. If B ∈ F is such that P(B) > 0, then P (·|B) is a probability measure on (Ω, F ). Proof. Certainly, A 7→ P (A|B) is defined on F and is nonnegative, ∀A ∈ F . Also, because Ω ∩ B = B, it follows that P (Ω|B) = 1. (Why?) Assume that {Ai : i ∈ I} is a countable collection of pairwise disjoint events in F . Observe that ! S [ P (( i∈I Ai ) ∩ B) P Ai |B = P(B) i∈I
=
P(
S
i∈I (Ai ∩ B)) (Why?) P(B) ∑ P (Ai ∩ B) = i∈I (Why?) P(B) P (Ai ∩ B) =∑ P(B) i∈I
=
∑ P (Ai |B) , i∈I
as needed. Exercise 2.5.2. Let (Ω, F , P) be a complete probability space and assume that Ω is finite. Let ω0 ∈ Ω and define the event B = {ω0 }. Compute P (A|B) , ∀A ∈ F . Intuitively, two events A and B are “independent” if the knowledge of the event A having occurred does not change the probability of the occurrence of B, and vice
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
93
versa. As such, P (B|A) = P(B) and P (A|B) = P(A). In such case, observe that P (A ∩ B) = P(A|B)P(B) = P(B|A)P(A) = P(A)P(B). This motivates the following definition. Definition 2.5.3. Two events A and B are independent if P (A ∩ B) = P(A)P(B). This notion is sufficient when defining the independence of two specific events A, B ∈ F , but if we want to know if the information “provided by a random variable X1 ” has any influence on the likelihood of another random variable attaining its values, we need to develop a better definition that correctly identifies the meaning of such influence. To this end, we introduce the following notion. Definition 2.5.4. Let A, B ∈ F . The σ -algebras σ ({A}) and σ ({B}) are independent if ∀CA ∈ σ ({A}) and ∀CB ∈ σ ({B}), P (CA ∩CB ) = P (CA ) P (CB ). Clearly, Def. 2.5.4 implies Def. 2.5.3. (Why?) But, a moment’s thought suggests that, in n o fact, the reversenimplicationoalso holds. Indeed, recall that σ ({A}) = e Ω and σ ({B}) = ∅, B, B, e Ω . Verifying that Def. 2.5.3 implies Def. ∅, A, A, 2.5.4 entails verifying that the condition in Def. 2.5.3 holds for all sixteen pairwise combinations of sets in σ ({A}) and σ ({B}). For instance, consider the following exercise. e∩ B = Exercise 2.5.3. Assuming that P (A ∩ B) = P(A)P(B), show that P A e P(A)P(B). The other fifteen combinations are proven in a similar fashion. As such, we conclude that Definitions 2.5.3 and 2.5.4 are equivalent. Good! Exercise 2.5.4. How would you extend Def. 2.5.3 to say that three events A1 , A2 , and A3 are mutually independent? We can generalize Def. 2.5.4 in a natural way to any finite collection of sub σ algebras of F , and they need not be generated by a single event. Precisely, we have Definition 2.5.5. Suppose that {Fi : i = 1, . . . , m} is a collection of σ -algebras on Ω such that Fi ⊂ F , ∀i ∈ {1, . . . , m} . We say that {Fi : i = 1, . . . , m} are independent if ! P
m \
m
Ai
i=1
= ∏ P (Ai ) , ∀Ai ∈ Fi .
(2.42)
i=1
How can we use this to define the independence of two random variables? Well, remember that a random variable is a Borel measurable function and it is completely defined by its action on the Borel sets. Let X1 , X2 : Ω −→ R be random variables and
© 2011 by Taylor & Francis Group, LLC
94
Volume 2: Stochastic Equations
let F1 = X1−1 (B1 ) : B1 ∈ σ (G ) , F2 = X2−1 (B2 ) : B2 ∈ σ (G ) .
Certainly, F1 ⊂ F and F2 ⊂ F . So, by Def. 2.5.5, F1 and F2 are independent iff P ω ∈ Ω : X1−1 (B1 ) ∩ X2−1 (B2 ) = P ω ∈ Ω : ω ∈ X1−1 (B1 ) · P ω ∈ Ω : ω ∈ X2−1 (B2 ) , ∀B1 , B2 ∈ σ (G ). This is equivalent to saying
P ({ω ∈ Ω : X1 (ω ) ∈ B1 and X2 (ω ) ∈ B2 }) =
P ({ω ∈ Ω : X1 (ω ) ∈ B1 }) · P ({ω ∈ Ω : X2 (ω ) ∈ B2 }) ,
(2.43)
∀B1 , B2 ∈ σ (G ). As such, we have the following definition.
Definition 2.5.6. Let X1 , X2 : Ω −→ R be random variables. We say that X1 and X2 are independent if (2.43) holds, ∀B1 , B2 ∈ σ (G ). Independence of random variables is a very important and powerful property in the underlying theory leading up to our study of stochastic evolution equations (SEEs). Two very important properties are stated below. (See [404] for a proof.) Proposition 2.5.7. Assume that X1 , X2 : Ω −→ R are independent random variables. i.) If E |X1 | < ∞ and E |X2 | < ∞, then E [X1 X2 ] = E [X1 ] E [X2 ]. ii.) If E |X1 |2 < ∞ and E |X2 |2 < ∞, then Cov (X1 , X2 ) = 0.
Exercise 2.5.5. Interpret Prop. 2.5.7(ii). Exercise 2.5.6. Prove that if X1 , . . . , Xm are independent R-valued random variables, m then Var (∑m i=1 Xi ) = ∑i=1 Var (Xi ) . Exercise 2.5.7. Assume that for each i ∈ {1, . . . , m} , Xi is n µi , σi2 . Prove that if m 2 {Xi : i = 1, . . . , m} are independent, then X = X1 + . . . + Xm is n ∑m i=1 µi , ∑i=1 σi .
The following result is very powerful and used often in approximation arguments.
Theorem 2.5.8. (Central Limit Theorem) Suppose that {Xi : i ∈ N} are independent R-valued random variables all possessing the same distribution with mean µ and variance σ 2 < ∞. For every n ∈ N, define ∑n X −n µ Zn = i=1σ √i n . Then, lim P ({ω ∈ Ω : Zn (ω ) ≤ x}) = Φ(x), ∀x ∈ R, {z }
n−→∞ |
=FZn (x)
where Φ is the distribution function for the one-dimensional standard Gaussian random variable.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
95
An elementary illustration of Thrm. 2.5.8 is that the sequence of densities of standardized discrete b(N, p) random variables converges to the density for the standard Gaussian (cf. Exer. 2.2.11).
2.6
Conditional Expectation — A Very Quick Description
For a more detailed discussion of the material in this section, refer to [126, 302]. We know that the expectation of X is the average value of X over the set of all possible outcomes and is given by ˆ 1 E [X] = X(ω )dP. (2.44) P(Ω) Ω In the absence of other information, this is the best estimate we have for X(ω ), for any ω ∈ Ω. We saw in our discussion of conditional probability that the probability assignments to the events A ∈ F can change if it is known a priori that an event B with positive probability has occurred. Indeed, such knowledge enables you to shrink the sample space from Ω to B. As such, it stands to reason that such knowledge would affect the expected value of a random variable X : Ω −→ R. Indeed, based on (2.44), it is reasonable to compute the conditional expectation of X given that B has occurred by ˆ 1 E [X|B] = X(ω )dP. (2.45) P(B) B This quantity is just a real number, but it does provide a more informed approximation of X based on the information provided. But, what if the structure of the information known to have occurred is more complicated? For instance, we might know the result of calculating a different random variable Y : Ω −→ R and this knowledge might help to provide a better idea of the expected value of X. For definiteness, suppose that rng(Y ) = {y1 , y2 , y3 } . Then, Ω = Y −1 ({y1 }) ∪Y −1 ({y2 }) ∪Y −1 ({y3 }) ,
(2.46)
and the sets on the right-hand side of (2.46) are pairwise disjoint. (Why?) Now, suppose that conducting the experiment produces the outcome ω0 . We wish to estimate the value of X (ω0 ) . Does the information provided by Y (that is, the partition of Ω that its values induce) help refine the space in such a way as to improve our approximation of X (ω0 )? In short, yes! Here’s why. Note that ω0 ∈ Ω and belongs to precisely one of three sets on the right-hand side of (2.46), and having the information provided by Y a priori enables us to restrict the sample space to one of the pre-images Y −1 ({yi }) (i = 1, 2, 3). Precisely, ∀i ∈ {1, 2, 3} , if ω0 ∈ Y −1 ({yi }), then ˆ 1 X(ω )dP = E X Y −1 ({yi }) . X (ω0 ) ≈ (2.47) P (Y −1 ({yi })) Y −1 ({yi }) © 2011 by Taylor & Francis Group, LLC
96
Volume 2: Stochastic Equations
We summarize this by writing E [X|Y ] . Note that the approximation in (2.47) changes depending on which pre-image Y −1 ({yi }) the outcome ω0 belongs. As such, E [X|Y ] is itself a random variable. Furthermore, it can be shown that it is the “best approximation of X” in the sense that kX − E [X|Y ]kL2 (Ω;R) ≤ kX − ZkL2 (Ω;R) , ∀Z ∈ L2 (Ω; R) . This only provides us with a glimpse into how one goes about defining the notion of conditional expectation. We will not need to compute with E [X|Y ] directly, although it is a powerful computational tool. Rather, for the purposes of our discussion, we shall be content with the following intuitive interpretation of conditional expectation: E [X|A ] is a random variable that provides the best approximation of X based on the information provided by A . Here, A can be a single event, a random variable, or a σ -algebra of events. We consider two extreme scenarios below. Two Extreme Scenarios: 1. The information provided need not improve the approximation. i.) E [X|Ω] (ω ) = E [X], ∀ω ∈ Ω, by (2.45). This is the crudest approximation of X. Note that the right-hand side is a real number independent of ω . ii.) If X and Y are independent, then based on Def. 2.5.6, the information provided by Y cannot improve the approximation of X. As such, our best approximation of X remains E [X]. That is, E[X|Y ] = E[X]. Moreover, because σ (Y ) provides no more information than Y (Why?), it follows that E [X|σ (Y )] = E[X]. iii.) As an extension of (ii), if A is any σ -algebra that provides no information about X, then E [X|A ] = E[X]. 2. The information provided renders the situation deterministic. If the values {(ω , X(ω )) : ω ∈ Ω} can be extracted from the information with which you are provided a priori, then the random variable X is rendered a constant with respect to expectation. Indeed, in such case, the random variable that best approximates X is naturally X itself. This can occur as follows: i.) E [X|σ (X)] (ω ) = X(ω ), ∀ω ∈ Ω. ii.) More generally, if we are trying to approximate an entire collection of random variables, indexed by time, say {X(t; ω ) : t ∈ [0, T ] , ω ∈ Ω} , then ∀t ∈ [0, T ] , " # [ E X(t) σ (X(s)) = X(t). 0≤s≤t A more difficult question is determining the form of the best approximation when the information provided a priori falls somewhere in between these two extremes. Looking ahead, we will need to compute " !# [ E X(t) σ X(τ ) , 0≤τ ≤s where 0 < s < t. We will revisit this in the next section.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
97
We end this section with a list of some commonly used properties of conditional expectation. (Refer to any of the references mentioned at the beginning of this chapter for proofs and a more detailed discussion of conditional expectation.) Proposition 2.6.1. (Properties of Conditional Expectation) Let (Ω, F , P) be a complete probability space and X,Y : Ω −→ R random variables. i.) (Linearity) If α , β ∈ R, then E [α X + β Y |A ] = α E [X|A ] + β E [Y |A ] ii.) E[X] = E [E [X|A ]] iii.) If σ (X) ⊂ A , then E [XY |A ] = X E [Y |A ] iv.) (Jensen) |E [X|A ]| ≤ E [|X||A ]
2.7
Stochastic Processes
For simplicity, the discussion is presented in the real-valued setting. The notions extend to the RN -setting by appealing to the discussion in Section 2.4 and making the natural modifications. The focus of this text is the study of the evolution of the state of phenomena (e.g., concentration of chemicals, temperature of a medium, population density, etc.) whose behavior is governed by an evolution equation into which randomness has somehow been incorporated. In the deterministic setting studied in Volume 1, the solution process of such an equation was a function u : [0, T ] −→ H , where H was an appropriately chosen Hilbert space. (The case when H = R corresponds to the most familiar case of an ordinary differential equation (ODE).) Introducing randomness into the evolution equation, possibly by way of modeling a physical parameter as a random quantity or by incorporating small random fluctuations into an external force acting on the system, will have the immediate effect of rendering each value u(t) as a random variable ω 7→ (u(t)) (ω ) defined on some underlying probability space (Ω, F , P) serving as an abstract framework of our experiment. As such, the study of stochastic evolution equations is quite a bit richer than the study of deterministic evolution equations in that the solution to an SEE is a collection of random variables {u(t; ·) : Ω −→ H |t ∈ [0, T ] } whose properties, both analytical and statistical, we seek to understand. The purpose of this section is to make precise the relevant notions of such collections of random variables and to formulate a calculus for them that naturally extends the operations of L2 (Ω; R). We begin with: Definition 2.7.1. Let (Ω, F , P) be a complete probability space. A (real) stochastic process is a collection of random variables S = {X(t) : Ω −→ R |t ∈ I } , where I ⊂ R. If I is a countable set, the stochastic process is called discrete; otherwise, it is said to be continuous. It is customary, in our evolution equations context, to think of t as time. We will be interested in continuous stochastic processes the vast majority of the time. We will
© 2011 by Taylor & Francis Group, LLC
98
Volume 2: Stochastic Equations
only consider the discrete case when formulating illustrative motivational examples. Notation. For every t ∈ I, X(t) is a random variable on Ω. As such, X(t) assigns a real number to each ω ∈ Ω. We denote the corresponding output by X(t)(ω ). In practice, the dependence on ω is typically suppressed with the understanding that the abbreviated notation X(t) really means X(t)(ω ). However, we shall often study the interplay between stochastic and deterministic evolution equations. As such, using this abbreviated notation can cause no end of confusion unless you are already familiar with the setting. To avoid such confusion, we shall view S as a function from I × Ω into R, meaning S (t, ω ) ≡ X(t)(ω ) ≡ X (t; ω ) ,
(2.48)
where t tells us which random variable in S to use and ω tells us the outcome at which to calculate X(t). While more cumbersome, we will use the last term in (2.48) in place of just X(t) when referring to that particular element of S . When we refer to the stochastic process S as a single entity, we will suppress ω and typically just write X, for brevity. Remarks. 1. For each fixed t0 ∈ I, ω 7→ X (t0 ; ω ) is a random variable on Ω. As such, it has a distribution, expectation, variance, etc. 2. For each fixed ω0 ∈ Ω, the real-valued function t 7→ X (t; ω0 ) is a sample path of the stochastic process S . It represents the function obtained if the outcome ω0 ∈ Ω is chosen initially. It is one of (possibly infinitely) many realizations of the stochastic process S . Exercise 2.7.1. What does it mean for a sample path t 7→ X (t; ω0 ) to be continuous on I? How do we go about studying the nature of a continuous stochastic process? As time moves from t to t + △t, an entire continuum of random variables, each characterized by a massive collection of sample paths, is produced. While it might seem that having the knowledge of a density of X(s), for every s ∈ [t,t + △t] would certainly suffice to completely characterize the stochastic process S on this interval, gaining such knowledge is generally intractable. Moreover, a moment’s thought suggests that we really seek to understand how the properties change (or evolve) over time. We seek a distribution, of sorts, of the stochastic process S . Certainly, this should involve the distribution of the individual random variables X(s), but it should be constructed in a manner that covers all possibilities while remaining manageable. As it turns out, the collection of all finite-dimensional joint distribution functions, defined below, completely characterize the process when coupled with certain smoothness conditions, specified by Kolmogorov’s theorem. (See [142] for a good discussion.) Definition 2.7.2. Let S = {X(t; ω ) |t ∈ I, ω ∈ Ω } , m ∈ N, and {t1 , . . . ,tm } ⊂ I be such that t1 < t2 < . . . < tm . The collection of all joint probability distributions of
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
99
hX (t1 ; ·) , X (t2 ; ·) , . . . , X (tm ; ·)i, taken over all values of m and corresponding sets {t1 , . . . ,tm } ⊂ I, is the collection of finite-dimensional joint distributions of S . Now that a stochastic process can be characterized by at least a somewhat verifiable condition, the next question to ask is how we can determine if two stochastic processes are “equivalent.” Based on the notion of equality of two random variables (which coincides with usual function equality with the exception that inequality can occur on a P-null set), we have the following definition: Definition 2.7.3. Two stochastic processes S = {X(t; ω ) |t ∈ I, ω ∈ Ω } and S ⋆ = {X ⋆ (t; ω ) |t ∈ I, ω ∈ Ω } are equivalent if ∀t ∈ I, P ({ω ∈ Ω : X(t; ω ) 6= X ⋆ (t; ω )}) = 0.
(2.49)
In such case, we say that S is a version of S ⋆ . Exercise 2.7.2. Formulate and interpret Def. 2.7.3 for RN -valued stochastic processes. A small miracle is that if a stochastic process S = {X(t; ω ) |t ∈ I, ω ∈ Ω } is sufficiently smooth (made precise in the theorem to follow), then you can find another stochastic process S ⋆ = {X ⋆ (t; ω ) |t ∈ I, ω ∈ Ω } such that almost all sample paths of S ⋆ are uniformly continuous on I and S ⋆ is a version of S . Of course, the key is verifying the “smoothness condition,” as stated below. Theorem 2.7.4. (Kolmogorov’s Criterion) Let S = {X(t; ω ) |t ∈ [a, b], ω ∈ Ω } be a real stochastic process, where [a, b] ⊂ [0, ∞) . If ∃α , β , η > 0 for which E |X(t + h; ·) − X(t; ·)|α ≤ η h1+β ,
(2.50)
for all h > 0 for which t + h ∈ [a, b], then there exists a stochastic process S ⋆ = {X ⋆ (t; ω ) |t ∈ [a, b], ω ∈ Ω } such that t 7→ X ⋆ (t; ω ) is a continuous function on [a, b], for almost all ω ∈ Ω. Moreover, S ⋆ is equivalent to S . (More succinctly, we say that S has a continuous version.) We impose sufficiently regular conditions on all quantities upon which a stochastic process under investigation depends so that we are always assured of the existence of a continuous version. Showing this, of course, is nontrivial, and we will not be concerned with the details. Rather, we will provide references when appropriate. There are various ways in which to categorize stochastic processes. Some common ones that will arise in our discussion are collected in the following definition. Definition 2.7.5. A stochastic process S = {X(t; ω ) |t ∈ [a, b], ω ∈ Ω } i.) is stationary if hX (t1 ; ·) , . . . , X (tn ; ·)i and hX (t1 + h; ·), . . . , X (tn + h; ·)i have the same joint distribution, for all choices of a ≤ t1 < . . . < tn ≤ b and h > 0 for which a ≤ t1 + h < . . . < tn + h ≤ b. ii.) has stationary increments if for all t, s, h for which t + h and s + h are in [a, b],
© 2011 by Taylor & Francis Group, LLC
100
Volume 2: Stochastic Equations
X(t; ·) − X(s; ·) has the same distribution as X(t + h; ·) − X(s + h; ·). iii.) has independent increments if for all choices of a ≤ t1 < . . . < tn ≤ b, X (t2 ; ·) − X (t1 ; ·) , X (t3 ; ·) − X (t2 ; ·) , . . . , X (tn ; ·) − X (tn−1 ; ·) are mutually independent random variables. iv.) is Gaussian if for all choices of a ≤ t1 < . . . < tn ≤ b and ∀ {b1 , . . . , bn } ⊂ R, ∑ni=1 bi X (ti ; ·) is a Gaussian random variable. (That is, every finite linear combination of random variables in S is Gaussian.) v.) is Markov if given the value X (t0 ; ·), X(u; ·) is independent of X(v; ·), ∀u < t0 < v. (That is, our ability to predict the future behavior of the process given the present state is not enhanced by the knowledge of the past history.) Exercise 2.7.3. i.) Prove that if S has independent increments, then these increments must be orthogonal in L2 (Ω; R) in the sense ( 0, i 6= j, E (X (ti ; ·) − X (ti−1 ; ·)) X (t j ; ·) − X t j−1 ; · = E |X (ti ; ·) − X (ti−1 ; ·)|2 , i = j. (2.51) ii.) Formulate (i) for RN -valued random variables. Each element X(t; ·) belonging to S = {X(t; ω ) |t ∈ [a, b], ω ∈ Ω } is itself a random variable. As such, it has a mean and variance, and the covariance of two members of S can be considered. In general, these values will change with t. In order to denote this fact, we introduce the following notions of the mean, variance, and covariance functions as they apply to stochastic processes. Definition 2.7.6. Let S = {X(t) |t ∈ I } be a real-valued stochastic process. i.) µS : I −→ R is defined by µS (t) = E [X(t; ·)]; ii.) VarS : I −→ R is defined by VarS (t) = Var [X(t; ·)]; iii.) CovS : I × I −→ R is defined by Cov(t, s) = Cov (X(t; ·), X(s; ·)) . Exercise 2.7.4. Interpret Def. 2.7.5(i) for a Gaussian process. While the usual calculus applies to the sample paths because they are simply realvalued (or possibly RN -valued), we still need a calculus that takes into account the dependence on both t and ω . The structure of L2 (Ω; R) has a natural influence here for reasons that will become apparent in upcoming sections. We begin with the most basic notion of a limit of a stochastic process at a particular value of t ∈ I. There are different ways to define this, but the most frequently used definition in this text is as follows. Definition 2.7.7. A stochastic process {X(t; ω ) |t ∈ I, ω ∈ Ω } has a mean square limit at t0 ∈ I if ∃X ⋆ ∈ L2 (Ω; R) such that lim E |X (t0 + h; ·) − X ⋆ |2 = 0 h−→0 | {z } A real−valued function of h © 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
101
(in the usual real-valued sense of Def. 1.8.2). We write X(t; ·) −→ X ⋆ in L2 (Ω; R) as t −→ t0 . Remark. If t0 belongs to the boundary of I (e.g., if I = [a, b], then such a t0 would be either a or b), we interpret Def. 2.7.7 as a one-sided limit. Exercise 2.7.5. i.) Formulate the εδ -form of Def. 2.7.7 (in the spirit of Def. 1.8.2). ii.) Formulate Def. 2.7.7 for RN -valued random variables. Interpret verbally. Exercise 2.7.6. Let {X(t; ω ) |t ∈ I, ω ∈ Ω } and {Y (t; ω ) |t ∈ I, ω ∈ Ω } be realvalued stochastic processes, t0 ∈ I, and α , β ∈ R. Assume that X(t; ·) −→ X ⋆ and Y (t; ·) −→ Y ⋆ in L2 (Ω; R) as t −→ t0 . i.) Prove that α X(t; ·) + β Y (t; ·) −→ α X ⋆ + β Y ⋆ in L2 (Ω; R) as t −→ t0 . ii.) If g : I −→ R is such that lim g(t) = g⋆ (in the sense of Def. 1.8.2), prove that t→t0
g(t)X(t; ·) −→ g⋆ X ⋆ in L2 (Ω; R) as t −→ t0 . iii.) Prove that the real-valued function f : I −→ R defined by f (t) = E |X(t; ·)| is continuous on I. We now consider several notions of continuity for stochastic processes.
Definition 2.7.8. Let S = {X(t; ω ) |t ∈ I, ω ∈ Ω } be a real-valued stochastic process. We say that S is i.) (right) left-continuous at t0 ∈ I if the real-valued function X(t; ω ) is (right) leftcontinuous at t0 a.s. [P] . ii.) continuous in probability at t0 ∈ I if ∀ε > 0, lim P ({ω ∈ Ω : |X (t; ω ) − X (t0 ; ω )| ≥ ε }) = 0.
t−→t0
iii.) almost surely continuous at t0 ∈ I if P ω ∈ Ω : lim |X (t; ω ) − X (t0 ; ω )| = 0 = 1. t−→t0
iv.) L p -continuous at t0 ∈ I (p ≥ 2) if lim E |X (t0 + h) − X (t0 )| p = 0.
h−→0
Exercise 2.7.7. i.) Interpret Def. 2.7.8 verbally. ii.) Formulate Def. 2.7.8 for RN -valued random variables. Interpret verbally. The notion of L p -continuity (called mean square continuity when p = 2) is the one with which we will work most often.
© 2011 by Taylor & Francis Group, LLC
102
Volume 2: Stochastic Equations
Exercise 2.7.8. Suppose that 1 < p < q < ∞. If {X(t; ω ) |t ∈ I, ω ∈ Ω } is L p continuous on I, must it also be Lq -continuous on I? How about conversely? Explain. We also consider the notion of an L2 -derivative as follows. Definition 2.7.9. A real-valued stochastic process {X(t; ω ) |t ∈ I, ω ∈ Ω } is mean square differentiable at t0 ∈ I if ∃X ⋆ ∈ L2 (Ω; R) such that 2 X (t0 + h; ·) − X (t0 ; ·) ⋆ lim E − X = 0. h−→0 h Exercise 2.7.9. Formulate Def. 2.7.9 for RN -valued random variables.
The notion of accumulating information as time goes on when studying the evolution of a phenomenon described by a stochastic process is central to the study of SEEs. We first encountered this notion in Section 2.2. We now make it more formal. We shall state the definition for I = [0, T ] because this is the most common situation that we will encounter. The definition can be easily modified to account for different intervals I ⊂ R. Definition 2.7.10. Let (Ω, F , P) be a complete probability space. i.) A collection of sub σ -algebras {Ft : t ∈ [0, T ]} ⊂ F such that for all 0 ≤ s < t ≤ T, Fs ⊂ Ft ⊂ F , is called a filtration of F . T ii.) {Ft : t ∈ [0, T ]} is right continuous on [0, T ] if Ft = s>t Fs , ∀t ∈ [0, T ]. iii.) A stochastic process {X(t; ω ) |t ∈ [0, T ], ω ∈ Ω } is Ft -adapted if X(t; ·) is Ft measurable, ∀t ∈ [0, T ]. That is, {ω ∈ Ω : X(t; ω ) ≤ x} ∈ Ft , ∀x ∈ R, ∀t ∈ [0, T ]. We need an intuitive understanding of what it means to be Ft -adapted. Begin with t = 0. In a typical model, this corresponds to the time at which we start the experiment, so that X(0; ·) is provided by initial data, or information about the system that is known. There is no randomness inherent to this information. So, saying “X(0; ·) is F0 -measurable” simply means that X(0; ω ) = X0 (ω ) is known and events of the form {ω ∈ Ω : X0 (ω ) ≤ x} are meaningful. As such, occurrence can be determined, without any guessing, at time 0. Said differently, F0 contains all the information necessary to describe X(0; ·). (Why?) Next, suppose that t0 > 0. Saying “X (t0 ; ·) is Ft0 -adapted” means that [
0≤s≤t0
{ω ∈ Ω : X(s; ω ) ≤ x} ⊂ Ft0 , ∀x ∈ R.
(2.52)
(Why?) The left-hand side of (2.52) is comprised of all “basic events” formed using only those random variables X(s; ·) in the stochastic process that correspond to times prior or at time t0 . As such, all the information about the stochastic process needed to describe X (t0 ; ·) and any events formed using the random variables in the set {X(t; ω ) |t ∈ [0,t0 ], ω ∈ Ω } is contained within Ft0 .
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
103
Exercise 2.7.10. What is true about a stochastic process {X(t; ω ) |t ∈ [0, T ], ω ∈ Ω } if X(t; ·) is F0 -measurable, ∀t ∈ [0, T ]? Exercise 2.7.11. When is an event A Ft -measurable? The above discussion naturally leads to the following notion. Definition 2.7.11. We say that {Ft : t ∈ [0, T ]} is the natural filtration for S = {X(t; ω ) |t ∈ [0, T ], ω ∈ Ω } if ∀t ∈ [0, T ], Ft = σ |
|
[
0≤s≤t
σ (X(s; ·))
{z
}
All the information about S up to time t
{z
. }
All events that can be formed using this information
This is the smallest filtration to which S is adapted. When defining a stochastic integral in the next chapter, the following technical measurability notion will be needed. Definition 2.7.12. A stochastic process {X(t; ω ) |t ∈ [0, T ], ω ∈ Ω } equipped with a filtration {Ft : t ∈ [0, T ]} is progressively measurable with respect to this filtration if ∀t ∈ [0, T ], the random variables X(s; ·), 0 ≤ s ≤ t, are measurable functions on the product space B ([0,t]) × Ft , where B ([0,t]) is the collection of Borel sets contained within [0,t]. Remark. The condition in Def. 2.7.12 is imposed to ensure double integrals in the probabilistic setting are well-defined and that the stochastic Fubini Theorem (used for switching the order of integration) will hold. As pointed out in [161], it turns out that any Ft -adapted stochastic process with continuous sample paths is automatically progressively measurable. And, moreover, this is precisely the type of stochastic process that we will encounter in this text. As such, we will not make explicit mention of this assumption of progressive measurable going forward because it is always satisfied. Our study will naturally be restricted to stochastic processes possessing a certain degree of regularity, just as in the deterministic setting. We mention two such spaces in the following theorem. Theorem 2.7.13. Assume that (Ω, F , P) is a complete probability space equipped with a right-continuous filtration {Ft : t ∈ [0, T ]} ⊂ F . Let p, r ≥ 2. i.) The space C ([0, T ] ; L p (Ω; R)) of stochastic processes {X(t; ω ) |t ∈ [0, T ], ω ∈ Ω } that are Ft -adapted, progressively measurable with continuous sample paths, and
© 2011 by Taylor & Francis Group, LLC
104
Volume 2: Stochastic Equations
are such that sup {E |X(t; ·)| p : 0 ≤ t ≤ T } < ∞ is a Banach space when equipped with the norm 1 (2.53) kXkC ≡ sup (E |X(t; ·)| p ) p . 0≤t≤T
ii.) The space Lr ([0, T ] ; L p (Ω; R)) of stochastic processes {X(t; ω ) |t
∈ [0, T ], ω ∈ Ω } that are Ft -adapted, progressively measurable´ with continuous sample paths for T which sup {E |X(t; ·)| p : 0 ≤ t ≤ T } < ∞, and 0 kX(t; ·)krL p dt < ∞ is a Banach space when equipped with the norm kXkLr ≡
ˆ
0
T
kX(t; ·)krL p dt
1r
.
(2.54)
Exercise 2.7.12. Formulate analogous spaces to those in Thrm. 2.7.13 for RN -valued stochastic processes. Exercise 2.7.13. Define precisely the notions of a convergent sequence and a Cauchy sequence for each of the two spaces in Thrm. 2.7.13. Pay particular attention to the form of the expressions involving the norms (2.53) and (2.54).
2.8
Martingales
At the end of Section 2.6, we posed the question !# " [ = E X(t; ·) σ X(τ ; ·) 0≤τ ≤s
? ,
(2.55)
where 0 < s < t. Based upon our very heuristic explanation of conditional expectation, we would expect this to be just X(s; ·), end of story! But, this is not true in general. There are situations in which the best guess is not the value of the random variable at the “largest time” used to provide the a priori information. While this poses an interesting problem in stochastic processes, we will only be interested in those stochastic processes for which you do fill in the blank in (2.55) with X(s). Such processes are defined as follows. Definition 2.8.1. A real-valued stochastic process {X(t; ω ) |t ∈ I, ω ∈ Ω } is a martingale with respect to the natural filtration {Ft : t ∈ I} if i.) X(t; ·) is Ft -adapted, ∀t ∈ I, ii.) E |X(t; ·)| < ∞, ∀t ∈ I, and iii.) (Markov Property) E [X(t; ·)|Fs ] = X(s; ·), ∀0 ≤ s ≤ t. Proposition 2.8.2. Let {X(t; ω ) |t ∈ I, ω ∈ Ω } be a martingale with natural filtration {Ft : t ∈ I}.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
105
i.) There exists M ∈ R such that E [X(t; ·)] = M, ∀t ∈ I. (That is, the expectation of a martingale is constant.) ii.) For every random variable Y for which E |Y | < ∞, {E [Y |Ft ] : t ∈ I} is a martingale. Outline of Proof. (i) It suffices to show that E [X(s; ·)] = E [X(t; ·)] , ∀s,t ∈ I. Use the Markov property with the fact that E [E [X|A ]] = E [X]. (Tell how.) (ii) Verify the three conditions of Def. 2.8.1 directly. Condition (i) holds trivially because we are conditioning with respect to a natural filtration. To verify condition (ii), use Jensen’s inequality together with the fact that E [E [X|A ]] = E [X]. And finally, condition (iii) holds because E [E [Z|Ft ] |Fs ] = E [Z|Fs ] . (Why?) Exercise 2.8.1. Fill in the details in the proof of Prop. 2.8.2. The following special case of Doob’s Martingale Inequality (see [404]) comes in very handy when establishing estimates. Theorem 2.8.3. (Doob’s Martingale Property) If {M(t; ω )|t ∈ [0, T ] , ω ∈ Ω} is a real-valued martingale for which the mapping (t; ω ) 7→ M(t; ω ) is almost surely continuous, then ∀δ > 0, 1 P ω ∈ Ω : sup |M(t; ω )| ≥ δ ≤ 2 E |M(T ; ·)|2 . (2.56) δ 0≤t≤T An analogous result holds for RN -valued random variables by simply replacing |·| by the RN -norm.
2.9
The Wiener Process
Physical parameters (e.g., reaction rates, diffusivity constants, densities) that are measured, external forces that act on a system, etc. are all subject to small random fluctuations, suitably referred to as “noise,” that prevent us from obtaining a 100%accurate deterministic description of them. But, how do we incorporate this vague notion into a rigorous mathematical framework that enables us to study the evolution of phenomena subject to such noise? The model presented in this section, the so-called Wiener process, is a mathematical construct used to simulate the motion first observed by Robert Brown in 1828 while looking through a microscope at a slide containing pollen grains encapsulated in water. Later, in 1905, Einstein studied this phenomenon and posited that the irregular movement was not due to the pollen, but rather to the molecular motion of the surrounding fluid. This motion has become known as Brownian motion.
© 2011 by Taylor & Francis Group, LLC
106
2.9.1
Volume 2: Stochastic Equations
A Common Simulation of Brownian Motion
There are many different ways to simulate Brownian motion (see [161, 235, 302]). One very intuitive approach is to define Brownian motion as the limit (of some sort) of a sequence of random variables arising from a description of random walks taken over successively more refined time steps. To get a feel for this, work through the following discussion. Let S : Ω −→ {−1, 1} be a random variable for which its two possible outcomes are attained with equal probability; that is, 1 P ({ω ∈ Ω : S(ω ) = −1}) = P ({ω ∈ Ω : S(ω ) = 1}) = . 2 Let us interpret this random variable as a model of “taking a single step of size 1 unit by moving either left or right from our current location on the real line.” So, if we begin at location 0 on the real line, one application of S will require that we move either to position −1 or to position 1. Next, from this position, we take another step of size 1 unit, as described by S. Our current location on the real line has no bearing on the likelihood of moving left or right (Why?), so that successive steps are independent and identically distributed. The possible ending locations at this second round are −2, 0, 2. Similiarly, if we take a third step, the possible ending locations are −3, −1, 1, 3. (Why?) Continuing in this manner, label the ith step as Si (ω ) with the understanding that Si (ω ) is nothing more than a copy of S(ω ). Observe that the ending location on the real line after n such steps is given by S1 (ω ) + . . . + Sn (ω ). (Why?) Exercise 2.9.1. i.) Compute a.) E[S] b.) Var [S] ii.) Let n ∈ N. Compute a.) E [S1 + . . . + Sn ] b.) Var [S1 + . . . + Sn ] Now, more generally, suppose that the step size is 0 < ε < 1. Define a new random variable S⋆ : Ω −→ {−ε , ε } by S⋆ (ω ) = ε S(ω ). Exercise 2.9.2. Redo Exercise 2.9.1 for S⋆ . We now apply this process on a fixed interval in a sequence of successively refined steps. Let t > 0 be fixed. (Think of t as having been measured in seconds.) Let k ∈ N and suppose that you take a step of size ε = √1k every 1k seconds. Exercise 2.9.3. Approximately how many such steps are taken during t seconds duration of time?
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
107
The location along the real line at time t is approximately 1 ⌈tk⌉ βk (t; ω ) = √ ∑ Si (ω ). (Why?) k i=1
(2.57)
For simplicity, assume that βk (0; ω ) = 0, ∀k ∈ N. Observe that as k gets larger, more steps of a smaller size are taken. (How would you illustrate this pictorally?) Ultimately, for every t ≥ 0, we are interested in determining lim βk (t; ω ), meaning k→∞
that we would like to identify a stochastic process {β (t; ω ) : t ≥ 0} to which the sequence of stochastic processes {βk (t; ω ) : t ≥ 0} converges (in an appropriate sense) as k −→ ∞ (i.e., as the step size shrinks to 0). We consider the properties of {βk (t; ω ) : t ≥ 0} below.
1. Stationary Increments. Let 0 ≤ s < t. Consider the increment βk (t) − βk (s). Note that 1 ⌈tk⌉ βk (t; ω ) − βk (s; ω ) ≈ √ ∑ Si (ω ). (Why?) (2.58) k i=⌈sk⌉ Let h ∈ R be such that t + h ≥ 0, s + h ≥ 0 and consider
βk (t + h; ω ) − βk (s + h; ω ).
(2.59)
Exercise 2.9.4. i.) How many copies of S(ω ) are used to form the expression (2.58)? ii.) How many copies of S(ω ) are used to form the expression (2.59)? Is this true for all h > 0? iii.) What can you conclude from this? 2. Independent Increments. Suppose that (t1 ,t2 ] ∩ (t3 ,t4 ] = ∅ and that both intervals are contained within [0, ∞). Exercise 2.9.5. Explain why the random variables ω 7→ (βk (t2 ; ω ) − βk (t1 ; ω )) and ω 7→ (βk (t4 ; ω ) − βk (t3 ; ω )) are independent. 3. Limiting Distribution. Exercise 2.9.6. i.) Calculate E [βk (t; ·)] and Var [βk (t; ·)] . ii.) Explain why the distribution of the random variable
ω 7→
⌈tk⌉
∑i=1 Si (ω ) − ⌈tk⌉ p ⌈tk⌉
approaches the distribution of the standard Gaussian random variable as k −→ ∞. iii.) From (ii), conclude that the distribution of ω 7→ βk (t; ω ) approaches the distribution of an n(0,t) random variable.
© 2011 by Taylor & Francis Group, LLC
108
Volume 2: Stochastic Equations
iv.) Let 0 ≤ s < t. What is the distribution of ω 7→ (βk (t; ω ) − βk (s; ω ))? 4. Covariance. Let 0 ≤ s < t. Observe that CovBk (t, s) = Cov (βk (t; ·), βk (s; ·)) = E [βk (t; ·) · βk (s; ·)] = E βk (t; ·) (βk (t; ·) − βk (s; ·)) + βk2(s; ·) (Why?) = E [βk (t; ·)] · E [βk (t; ·) − βk (s; ·)] + Var [βk (t; ·)]
(2.60)
= s (Why?)
Exercise 2.9.7. Fill in the missing details in (2.60). 5. Adaptedness. Let 0 ≤ s < t and define Fs = σ (βk (u; ·) : 0 ≤ u < s) .
(2.61)
Exercise 2.9.8. i.) Compute E [βk (t; ·) − βk (s; ·)|Fs ]. ii.) Explain why βk (t; ·) is Ft -adapted. Exercise 2.9.9. Define a random variable Y : I × Ω −→ R by Y (t; ω ) = σ βk (t; ω ) + µ t. (For this random variable, µ is called the drift.) i.) Compute E [Y (t; ·)] and Var [Y (t; ·)]. ii.) What is the approximate distribution of ω 7→ Y (t; ω )?
2.9.2
The Wiener Process
We would like for the limiting stochastic process (obtained as k → ∞) of the sequence {βk (t; ω ) : t ≥ 0, ω ∈ Ω} to possess the same properties as those established in the previous subsection. The critical ones to include in our definition are (1), (2), and (3) because the others follow naturally from them. (Convince yourself.) We have the following definition. Definition 2.9.1. An R-valued Wiener process (or one-dimensional Brownian motion) is a stochastic process {β (t; ω ) : t ≥ 0, ω ∈ Ω} that satisfies the following properties: i.) β (0; ω ) = 0, ∀ω ∈ Ω, ii.) the increments are stationary and independent, and iii.) β (t; ·) is n(0, σ 2t). Remarks. 1. Going forward, we will suppress the dependence of all Wiener processes on ω ∈ Ω for notational simplicity. We use β (t) and W (t), the latter of which is in recoginition
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
109
of Wiener, interchangeably when referring to a one-dimensional Brownian motion. 2. Unless otherwise stated, we assume σ = 1, for simplicity. Then, {β (t) : t ≥ 0} is a standard Brownian motion. Exercise 2.9.10. 1 Assume that σ > 0 and {β (t) : t ≥ 0} is a Brownian motion. Must σ β (t) : t ≥ 0 be a Brownian motion? Explain.
We summarize the main properties of the Wiener process below. They are extensions from the discussion in the previous subsection. Theorem 2.9.2. (Properties of the Wiener Process) Let {W (t) : t ≥ 0} be an R-valued Wiener process. Then, ∀0 ≤ s < t, i.) {W (t) : t ≥ 0} is Ft -adapted. ii.) {W (t) : t ≥ 0} is a Gaussian process. iii.) Cov(W (t),W (s)) = s. iv.) lim Wt(t) = 0. t→∞
v.) {W (t) : t ≥ 0} is a martingale and E [W (t) − W (s)|Fs ] = 0. vi.) The sample paths of {W (t) : t ≥ 0} a.) are continuous a.s. [P] , b.) are nowhere differentiable, and c.) do not have bounded variation on [0, T ] . Outline of Proof: (i) & (iii): These follow as before. (Tell why.) (ii): Let 0 < t1 < t2 < . . . < tn be given. Observe that ∀k ∈ {1, . . . n} , W (tk ) = [W (tk ) − W (tk−1 )] + [W (tk−1 ) − W (tk−2 )]
(2.62)
+ . . . + W (t1 ) − W (0) . | {z } =0
The right-hand side of (2.62) is comprised of independent random variables (Why?), all of which are normal. (Why?) As such, by Exer. 2.5.7, the right-hand side (taken as a single random-variable) is normal. Thus, W (tk ) is a normal random variable. Hence, hW (t1 ) , . . . ,W (tn )i has a normal joint distribution (Why?). As such, we conclude that {W (t) : t ≥ 0} is Gaussian. (iv): This property can be established using the Strong Law of Large Numbers. (See [285].) (v): We verify the conditions of Def. 2.8.1. Note that conditions (i) and (ii) follow directly from the earlier properties. (Tell how.) To establish (iii), let 0 ≤ s < t and
© 2011 by Taylor & Francis Group, LLC
110
Volume 2: Stochastic Equations
observe that E [W (t)|σ (W (τ )|τ ≤ s)] E [(W (t) − W (s)) + W (s)|σ (W (τ )|τ ≤ s)]
= =
(2.63)
E [(W (t) − W (s)) |σ (W (τ )|τ ≤ s)] + E [W (s)|σ (W (τ )|τ ≤ s)] . (Why?) | {z } | {z } =0
=W (s)
(vi) (a) Technically, we would need to verify that Kolmogorov’s criterion is satisfied. (See [161].) (b) The idea is to show that for every sequence {tn } ⊂ [0, ∞) that converges to 0, W (tn ; ω ) − W (0; ω ) = ∞ = 1. P ω ∈ Ω : lim sup tn − 0 n−→∞
(Why does this suffice? See [302] for a proof.) (c) Said differently, this means that the total amount of “vertical movement” exhibited in the path of a Brownian motion on any interval, no matter how small, is infinite. You can think of this as the amount of vertical change experienced by the path of β (t) as t moves through a given interval [0, T ]. In order to be infinite, it must be the case that there is never any moment of smoothness in the graph, because this would temporarily (on a very small interval) allow the path to stop wiggling so wildly. This observation goes hand in hand with (b) and is the very reason why a different approach must be used when defining the so-called stochastic integral. This discussion awaits us in Chapter 3. Exercise 2.9.11. Prove that {W (t) : t ≥ 0} is continuous in probability at all t0 ≥ 0. Exercise 2.9.12. Let T > 0 and 0 < t1 < t2 < . . . < tn . Show that the finite-dimensional 1 1 joint distributions of {W (t) : t ≥ 0} are such that T 2 W (t1 ) , . . . , T 2 W (tn ) has the
same distribution as (W (T1 ) , . . . ,W (T tn )). We say that the Wiener process is selfsimilar with Hurst parameter 21 . If the parameter is replaced by some H ∈ 12 , 1 , we get a so-called fractional Brownian motion (fBm).
Exercise 2.9.13. Let 0 < t1 < t2 < . . . < tn be given. Show that for all 1 ≤ i, j ≤ n for which i 6= j, i.) E (W (ti ) − W (ti−1 )) W (t j ) − W t j−1 =0 ii.) (Quadratic Variation) E [(W (ti ) − W (ti−1 )) (W (ti ) − W (ti−1 ))] = ti − ti−1
2.9.3
Modeling with the Wiener Process
Disclaimer! The following discussion is purely heuristic and is meant simply to introduce some notions that will be more fully developed in the next chapter. How does a Wiener process mysteriously end up as a term in a mathematical model? Suppose that the phenomenon in which we are interested can be modeled as the
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
111
initial-value problem (IVP) (
dx dt
= α x(t) + f (t), t > 0, x(0) = x0 ,
(2.64)
where α is a real parameter of interest. Given that measurement is subject to error, regardless of how well-calibrated the equipment is, we would like to introduce randomness into the parameter itself, and in so doing, into IVP (2.64). Similarly, it is of interest to account for small random fluctuations in the modeling of the external force f (t) impacting the system. Symbolically, we do this as follows: dW1 (t; ω ) α is replaced by α1 + α2 | {z dt }
(2.65)
A stochastic process
f (t) is replaced by f1 (t) + f2 (t) | {z
dW2 (t; ω ) dt }
(2.66)
A stochastic process
Here, dWidt(t;ω ) stands for white noise, or formally the derivative (of some sort) of a Wiener process. But, this needs to be defined because, after all, we mentioned in Thrm. 2.9.2 that the sample paths of a Wiener process is NOWHERE differentiable! Technically, white noise is a “generalized” derivative in the sense of distributions. This is a delicate topic to treat correctly. (See [1].) For our purposes, this is merely a stepping stone to get to a stochastic IVP, so we will not focus on the theoretical subtleties involved. Rather, from a stricly symbolic viewpoint, we substitute (2.65) and (2.66) into the differential equation portion of IVP (2.64) to obtain the stochastic differential equation: dx dW2 (t; ω ) dW1 (t; ω ) = α1 + α2 x(t) + f1 (t) + f2 (t) dt dt dt dW1 (t; ω ) dW2 (t; ω ) = α1 x(t) + f1 (t) + α2 x(t) + f2 (t) . (2.67) dt dt Now, multiply both sides of (2.67) by dt to obtain the differential dx = (α1 x(t) + f1 (t)) dt + α2 x(t)dW1 (t; ω ) + f2 (t)dW2 (t; ω ).
(2.68)
Doing so yields a stochastic differential equation involving two sources of randomness. Equation (2.68) is said to be in differential form. Going one step further, we integrate both sides of (2.68) over (0,t) to obtain ˆ t x(t) − x0 = (α1 x(s) + f1 (s)) ds (2.69) 0 ˆ t ˆ t + α2 x(s)dW1 (s; ω ) + f2 (s)dW2 (s; ω ). 0
© 2011 by Taylor & Francis Group, LLC
0
112
Volume 2: Stochastic Equations
Of course, performing these operations begs several questions, the most obvious of which is, “What is the precise meaning of the integrals on the right-hand side of (2.69)?” This question will be answered in the next chapter. And, in so doing, both (2.68) and (2.69) will become meaningful. Another observation is that there are two Wiener processes in (2.68). Do they wipe out each other or amplify each other? How must they relate? A moment’s thought suggests that they are introduced into the model via the assessment of very different quantities (e.g., a parameter and an unrelated external forcing term). As such, it is reasonable to assume that they are independent. Indeed, this provides us with a springboard into the following definition. Definition 2.9.3. {W(t) = hW1 (t), . . . ,WM (t)i : t ≥ 0} is an M-dimensional Wiener process if i.) {Wi (t) : t ≥ 0} is a one-dimensional Wiener process, ∀i ∈ {1, . . . , M} , and ii.) Wi (t) and W j (t) are independent whenever i 6= j. We represent such a Wiener process as M
W(t) =
∑ Wk (t)ek ,
(2.70)
k=1
where {ek : k = 1, . . . , M} is an orthonormal basis for RM . Exercise 2.9.14. Convince yourself that the same properties as for one-dimensional Wiener processes hold for M-dimensional Wiener processes, assuming appropriate modifications are made to account for the transition from R to RM . Exercise 2.9.15. Let 0 ≤ s < t. Prove that
t 0 ··· .. 0 . CovW (t, s) = .. .. . . 0 ··· 0 {z |
0 .. . . 0 t }
(2.71)
An M×M matrix
2.10
Summary of Standing Assumptions
We gather a short list of standing assumptions used throughout the text in order to simplify the presentation going forward and to minimize, as much as is reasonable, the technical nature of the statement of the theorems. Some are listed loosely and suggest the nature of an assumption, the specific form of which will change slightly to accomodate a new setting.
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
113
(S.A.1) We always work with a complete probability space (Ω, F , P) equipped with a right-continuous filtration {Ft : t ≥ 0} to which all Wiener processes arising in the discussion are adapted. (S.A.2) We assume, without further comment or justification, that we are able to find a continuous version of any stochastic process under consideration. (Showing this often requires one to verify the Kolmogorov criterion, which can be very technical.) (S.A.3) All functions appearing as part of an integrand (of a Riemann, Lebesgue, Bochner, or stochastic integral) are assumed to be Ft -adapted and progressively measurable in the appropriate space.
2.11
Looking Ahead
Armed with some rudimentary tools of analysis and the essentials of probability theory, we now ask what it means to account for noise in the mathematical modeling of a phenomenon, and in turn how it affects the differential equation(s) duly formed. Indeed, we caught a glimpse of a stochastic differential equation when describing how a Wiener process might end up as a term in a differential equation via “white noise.” In preparation, we consider a more simplistic example of a random ordinary differential equation that can be solved using elementary methods. Assume (S.A. 1) and let a ∈ R and X0 : Ω −→ R be a n µ , σ 2 random variable. Consider the random IVP ( dX(t;ω ) = aX(t; ω ), t > 0, ω ∈ Ω, dt (2.72) X(0; ω ) = X0 (ω ), ω ∈ Ω. For each ω0 ∈ Ω, note that X0 (ω0 ) is simply a real number, so that (2.72) is nothing more than a standard IVP encountered in an elementary differential equations course. Exercise 2.11.1. i.) Solve (2.72) using separation of variables to show that X (t; ω0 ) = eat X0 (ω0 ) .
(2.73)
ii.) Describe the possible behavior of the solution given in (2.73) as t −→ ∞ based on the nature of a.
© 2011 by Taylor & Francis Group, LLC
114
Volume 2: Stochastic Equations
This is fine, but if a different outcome ω1 ∈ Ω occurs instead of ω0 , then the solution given by (2.73) changes to X (t; ω1 ) = eat X0 (ω1 ) . We do not know a priori which outcome ω ∈ Ω occurs, due to the fact that it is chosen randomly. As such, what exactly do we mean by a solution of (2.72)? Moreover, how does the normality assumption imposed on X0 enter into the picture? We will investigate these issues, and much more, in Chapter 3.
2.12 2.12.1
Guidance for Selected Exercises Level 1: A Nudge in a Right Direction
2.1.4. Begin with events A, B, and their complements. Then, use Exer. 1.2.1. (How?) 2.1.7. The answer is “yes” to both (i) and (ii). Express each as a set-theoretic combination of sets knownSto belong to σ (G1 ) . 2.1.10. (i) Let B j = i≥ j Ai . Observe that B j ↓ lim sup Ai as j → ∞. (Why?) So, by Prop. 2.1.6(vii), P (B j ) ↓ P (lim sup Ai ) as j → ∞. Now what? The proof of (ii) is similar. 2.2.5. (i) Assume x ≤ y. FX (y) = P (X ≤ x) + P (x < X ≤ y). (Now what?) (ii) Use Prop. 2.1.6(vii). To what set does {ω ∈ Ω : X(ω ) ≤ x} converge as x → ∞? (iii) This is similar to (ii). To what set does {ω ∈ Ω : X(ω ) ≤ x} converge as x → −∞? (iv) Observe that P X ≤ x + 1n ↓ P (X ≤ x) as n → ∞. (Why?) What can you say about the set FX x + n1 : n ∈ N ? (Now what?) 4 4 14 4 34 h i4 α α 3 α α . (Why? 2.2.8. (iii) E X− · Y− ≤ E X− · E Y− β β β β
Now what?) 2.2.10. Use Prop. 2.2.11 with X = |Y − E[Y ]| , p = 2, and ε = ασY . 2.3.3. (i) Use kYn k2L2 ≤ kYn − Y k2L2 + kY k2L2 . (Now what?) (ii) Note that kαn Z − α Zk2L2 = k(αn − α )Zk2L2 . (Now what?) (iii) Note that k(α Xn ± β Yn ) − (α X ± β Y )k2L2 = kα (Xn − X) ± β (Yn − Y )k2L2 . (Now what?) 1 1 2 (iv) Note that |E [Xn ] − E[X]| = |E [Xn − X]| ≤ E [Xn − X]2 E[1]2 2 . (Now what?) 2.3.6. Use Exer. 1.8.7 and the completeness of R. 2.4.2. (i) Use the fact that the calculus is performed componentwise. (So what?) (ii) Why is X − E [X] an RN - random variable? How about its square? 2.4.4. (i) E [∑m k=1 αk Xk ] = E [α1 hX1,1 , . . . , X1,N i + . . . + αm hXm,1 , . . . , Xm,N i]. Now, combine the vectors. Then what?
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
115
(ii) Use Prop. 2.2.11 with an appropriate choice of random variable. 2.4.5. (i) Use Minkowski’s inequality inside the expectation. Then, use monotonicity. (How?) 1 1 2 2 . (Now what?) 2.4.6. Observe that fX (x) = 1 1 exp − 2 x1 + . . . + xN (2π ) 2 · · · (2π ) 2 {z } | n times
2.4.7. (ii) Convergence of sequences in RN is determined componentwise. T T (iii) E Xn Yn −→ E XY 2.5.1. (ii) We can discard the outcomes contained in B from consideration because we know for certain that they did not occur. In effect, knowing that B has occurred removes a bit of the randomness of the experiment. 2.5.2. There only two possibilities here. What are they? are e 2.5.3. P A ∩ B = P(B \ (A ∩ B)). (Now what?) 2.5.4. You must be able to compute the probabilities of all possible intersections of two and three of the events A1 , A2 , and A3 as the product of the probabilities of the events used to form the intersection. 2.7.1. The definition of continuity of a real-valued function applies to this setting without issue. (Why?) 2.7.2. When are two RN -valued random variables X and Y not equal? (How do you use this?) 2.7.3. (i) If two random variables X and Y are independent, then E [XY ] = 0. (So what?) (ii) You must multiply the two differences in the sense of the RN inner product. Otherwise, the definition is the same. (Tell why.) 2.7.4. Because a Gaussian random variable is characterized by its mean and covariance, the condition in Def. 2.7.5 (i) simplifies to µS (t) = µS (t +h), ∀t, h. (So what?) Also, CovS (t, s) = CovS (t + h, s + h). (So what?) 2.7.10. The stochastic process would actually be deterministic. (Why?) 2.7.11. A should belong to σ ({X(s) |s ∈ [0,t] }). (What does this mean?) 2.8.1. (i) E [X(t)|Fs ] = X(s) =⇒ E [E [X(t)|Fs ]] = E [X(s)]. (So what?) 2.9.1. (i)(a)0 (b)1 (ii)(a) 0 (b)n 2.9.2. (i)(a)0 (b)ε 2 (ii)(a) 0 (b)nε 2 2.9.3. ⌊tk⌋ 2.9.4. (i) & (ii) k(t − s) 2.9.5. Both random variables are constructed using copies of S(ω ) on nonoverlapping intervals. 2.9.6. (i) E [Bk (t); ·] = 0 and Var [Bk (t); ·] = ⌈tk⌉ k ≈ t. (ii) Use the Central Limit Theorem . (How? Why does it apply?) (iii) n(0,t − s) (Why?) 2.9.7. (i) µBk = 0, ∀t, s, k. (ii) Add and subtract Bk (s). (iii) Bk (s) and Bk (t) − Bk (s) are independent. (So what?) Also, what is the definition of Var [Bk (t; ·)]? (iv) E [Bk (s)] = 0 and Var [Bk (s; ·)] = s. (Why?)
© 2011 by Taylor & Francis Group, LLC
116
Volume 2: Stochastic Equations
2.9.8. (i) Bk (t) − Bk (s) is independent of Fs . (So what?) 2.9.9. (i) E [Y (t; ·)] = µ t and Var [Y (t; ·)] = σ 2t. (ii) n(µ t, σ 2t) 2.9.10. Yes. Note that σ1 β (t) is approximately n(0,t). 2.9.11. P (|W (t) − W (s)| > ε ) = P (|W (t − s)| > ε ) = 2P (W (t − s) < −ε ). (Now what?) 2.9.12. Argue each component separately. Observe that W (T ti ) is normal and thus, it is characterized by its mean and variance. (Now what?) 2.9.13 (i) Use the independence of the increments to conclude immediately. (ii) Consult any of the standard references mentioned at the beginning of the chapter.
2.12.2
Level 2: An Additional Thrust in a Right Direction
2.1.4. Exer. 1.2.1. is useful when computing complements of certain unions of sets that must belong to F . S 1 2.1.7. (i) {a} = [(−∞,^ a) ∪ (a, ∞)] and (a, b) = ∞ n=1 a, b − 2n . Verify these. 2.1.10. (i) Because P (B j ) ≥ supi≥ j P (Ai ) (Why?), we see that P (lim sup Ai ) ≥ lim
j→∞
!
sup P (Ai ) i≥ j
= lim sup P (Ai ) .
(Tell how.) 2.2.5. (i) Note that P (x < X ≤ y) ≥ 0. (So what?) (ii) What is P (Ω)? (So what?) (iii) What is P (∅)? (So what?) (iv) The set FX x + n1 : n ∈ N is bounded below. (Why?) Using (i), we conclude that ∃ lim FX x + 1n = inf FX x + 1n : n ∈ N , which equals what? n→∞
2.2.8. (iii) Now, apply Prop. 2.2.8(i). 2.3.3. (i) Now, mimic the argument used in the real-valued case. See Prop. 1.5.6. (ii) & (iii) Now, use the Cauchy-Schwarz inequality. (iv) The right-hand side equals kXn − XkL2 , which we know approaches zero as n → ∞. 2.4.4. (i) ... = E [hα1 X1,1 + . . . + αm Xm,1 , . . . , α1 X1,N + . . . + αm Xm,N i]. Now, apply Def. 2.4.3(i), along with the properties of expectation in the real-valued case on each component. (Tell how.) (ii) Use ω 7→ kX(ω )kRp N as X in Prop. 2.2.11. The result follows immediately. 2.4.6. Now, apply the exponent rule and regroup the terms in order to identify N copies of the n (0, 1) density. 2.5.2. If ω0 ∈ A, then P(A) = 1. Otherwise, P(A) = 0. (Explain this.) 2.5.3. P(B \ (A ∩ B)) = P(B) − P(A)P(B). (Now what?) 2.5.4. A reasonable condition is that P (C1 ∩C2 ∩C3 ) = P (C1 ) P (C2 ) P (C3 ) , ∀Ci ∈ σ (Ai ) . (Why?) 2.7.2. If at least one pair of corresponding components Xi and Yi are not equal random variables, then X is not equal to Y. If, on the other hand, all pairs of corresponding
© 2011 by Taylor & Francis Group, LLC
The Bare-Bone Essentials of Probability Theory
117
components are equal except possibly on a P-null set, then X = Y. 2.7.3. Note that E [XY ] is the inner product on L2 (Ω; R). 2.7.4. This further implies that µS (t) = µS (s), ∀t, s, so that µS (·) is a constant function. What can you say about CovS (·, ··)? 2.8.1. (i) Apply the fact that E [E [X|A ]] = E [X]. ε −→ 0 as t −→ s because the distribution function is con2.9.11. . . . = 2Φ − √t−s
ε −→ −∞. tinuous and − √t−s h 1 i 1 2.9.12. E T 2 W (ti ) = T 2 W (ti ) = 0 h 1 i 1 2 Var T 2 W (ti ) = T 2 Var [W (ti )] = T ti = Var [W (ti )]
© 2011 by Taylor & Francis Group, LLC
Chapter 3 Linear Homogenous Stochastic Evolution Equations in R
Overview We begin our study of stochastic evolution equations with the simplest case of a stochastic ordinary differential equation in R. It is here that you will get the lay of the land, learn about some typical questions that are of interest, and develop the machinery to answer them. Striking similarities and sharp differences from the deterministic setting will become apparent as you work through the chapter. Some standard references used throughout this chapter are [11, 62, 178, 193, 244, 251, 287, 302, 318, 333, 375, 397, 399].
3.1
Random Homogenous Stochastic Differential Equations
Assume (S.A.1). Let a ∈ R and X0 : Ω −→ R be a given random variable, and consider the IVP ( dX dt (t; ω ) = aX(t; ω ), 0 < t < T, ω ∈ Ω, (3.1) X(0; ω ) = X0 (ω ), ω ∈ Ω. For a fixed ω0 ∈ Ω, (3.1) is a typical IVP encountered in an elementary differential equations course. In fact, the separation of variables technique can be used to show that the solution of (3.1) is X (t; ω0 ) = eat X0 (ω0 ) .
(3.2)
This solution trajectory changes depending on the random choice of ω0 . Because we do not know a priori which value of ω0 ∈ Ω occurs, every member of the collection of trajectories (3.3) t 7→ eat X0 (ω ) : ω ∈ Ω contributes to the solution of (3.1). As such, the solution of (3.1) is a stochastic process whose sample paths are t 7→ eat X0 (ω ).
119 © 2011 by Taylor & Francis Group, LLC
120
Volume 2: Stochastic Equations
For every ω ∈ Ω, the sample paths are differentiable with respect to t. (Why?) In fact, the sample paths possess the same analytic properties as the solutions of the deterministic version of (3.1) (i.e., when there is no dependence on ω ). But, the introduction of noise into the IVP by assuming that the initial condition (IC) X0 (ω ) is a random variable enhances the mathematical description of any concrete model that can be written in the form (3.1). For instance, suppose that X0 is b(2, 0.8). Then, there are two possible outputs when X0 is evaluated at a given ω ∈ Ω with probabilities P ({ω ∈ Ω : X0 (ω ) = 0}) = 0.2, P ({ω ∈ Ω : X0 (ω ) = 1}) = 0.8.
(3.4)
Exercise 3.1.1. i.) (3.3) is comprised of how many solution trajectories? ii.) Describe the sample paths from (i). iii.) Explain probabilistically how (3.4) affects the manner in which we interpret the solution process of (3.1). iv.) Compute E [X(t; ·)] and Var [X(t; ·)]. Interpret these quantities. v.) Is {X(t; ·) : t ≥ 0} a Markov process? Explain. vi.) Is {X(t; ·) : t ≥ 0} Gaussian? Explain. Exercise 3.1.2. Suppose now that X0 is b(n, 0.5), for some n ∈ N. i.) (3.3) is comprised of how many solution trajectories? ii.) Describe the sample paths from (i). iii.) What percentage of the time would you expect each trajectory to arise, in the long run? iv.) Compute E [X(t; ·)] and Var [X(t; ·)]. Interpret these quantities. v.) Is {X(t; ·) : t ≥ 0} a Markov process? Explain. vi.) Is {X(t; ·) : t ≥ 0} Gaussian? Explain. vii.) Describe the limiting behavior of the distribution of the solution process as n −→ ∞. Exercise 3.1.3. Suppose now that X0 is n(0, 1). How does the interpretation of the solution trajectories change from the descriptions in Exercises 3.1.1 and 3.1.2? Continuous dependence on the initial data is also of interest, but we need to accurately account for randomness. Consider (3.1) together with the following IVP: ( dY dt (t; ω ) = aY (t; ω ), 0 < t < T, ω ∈ Ω, (3.5) Y (0; ω ) = Y0 (ω ), ω ∈ Ω,
where kX0 − Y0 kL2 (Ω;R) < δ . A crude estimate of the difference between the solution processes of (3.4) and (3.5) in the L2 -sense is provided in the following exercise. Exercise 3.1.4. Prove that sup kX(t; ·) − Y (t; ·)kL2 (Ω;R) < δ eaT .
0≤t≤T
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
121
Continuous dependence can also be formulated as a convergence problem. Specifically, consider sequences {an : n ∈ N} ⊂ R and {(X0 )n : n ∈ N} ⊂ L2 (Ω; R) such that an −→ a in R and (X0 )n −→ X0 in L2 (Ω; R) as n −→ ∞. For each n ∈ N, consider the IVP ( dXn dt (t; ω ) = an Xn (t; ω ), 0 < t < T, ω ∈ Ω, (3.6) Xn (0; ω ) = (X0 )n (ω ), ω ∈ Ω. Exercise 3.1.5. Does there exist an L2 (Ω; R)-limit of the sequence of solution processes {Xn } of (3.6) as n −→ ∞? Prove your assertion. The interval on which IVP (3.1) is considered can be extended to [0, ∞) , and in so doing, asking about the long-term behavior (as t −→ ∞) of the solution process becomes natural. This is a trivial question for the deterministic version of (3.1). (Why?) Exercise 3.1.6. For a fixed ω0 ∈ Ω, what are the possible long-term behaviors of (3.2), depending on the value of a ∈ R? Fixing an ω0 ∈ Ω simplified the situation. When this is not done, the question of long-term behavior of the stochastic version of (3.1) becomes more delicate. Exercise 3.1.7. As a preliminary attack, try to formulate a natural notion of longterm stability in this setting. We now make the transition to incorporating an additional source of noise into the model. Specifically, suppose that we replace the parameter a in (3.1) by a0 + a1
dW , dt
(3.7)
where dW dt is a white noise process. Proceeding as in our heuristic discussion from Section 2.9.3, we substitute (3.7) into (3.1) and subsequently recover the differential form (formally by multiplying both sides by the differential dt), as follows: ( dX dW dt (t; ω ) = a0 + a1 dt X(t; ω ), 0 < t < T, ω ∈ Ω, (3.8) X(0; ω ) = X0 (ω ), ω ∈ Ω, and subsequently ( dX(t; ω ) = a0 X(t; ω )dt + a1 X(t; ω )dW (t), 0 < t < T, ω ∈ Ω, X(0; ω ) = X0 (ω ), ω ∈ Ω.
(3.9)
More generally, we could introduce m independent sources of randomness into (3.1) by replacing the parameter a by m
a0 + ∑ ak k=1
© 2011 by Taylor & Francis Group, LLC
dWk (t) . dt
(3.10)
122
Volume 2: Stochastic Equations
Substituting (3.10) into (3.1) results in the more general stochastic IVP ( dX(t; ω ) = a0 X(t; ω )dt + ∑m k=1 ak X(t; ω )dWk (t), 0 < t < T, ω ∈ Ω, X(0; ω ) = X0 (ω ), ω ∈ Ω.
(3.11)
We shall consider the integrated forms of (3.9) and (3.11), respectively given by ˆ t ˆ t X(t; ω ) = X0 (ω ) + a0 X(s; ω )ds + a1 X(s; ω )dW (s), (3.12) 0 0 ˆ t ˆ t m X(t; ω ) = X0 (ω ) + a0 X(s; ω )ds + ∑ ak X(s; ω )dWk (s), (3.13) 0
k=1 0
where 0 < t < T and ω ∈ Ω. Doing so merely replaces the solvability of one problem (an IVP) by another (a stochastic integral equation). What precisely do we mean by the integrals appearing on the right-hand sides of (3.12) and (3.13)? This question must be answered before going any further.
3.2
Introducing the Lebesgue and Ito´ Integrals
Assume (S.A.1). We must first decide on the set of functions for which the integrals arising in (3.12) and (3.13) are to be defined. To this end, note that the integrands can depend on the solution process X(t; ω ), which belongs to L2 (Ω; R) . Also, for any t ∈ [0, T ] , both integrals are themselves random variables and so it is natural to require that they belong to L2 (Ω; R) . Furthermore, we must make certain that the integrands are Ft -adapted and progressively measurable to ensure that the resulting solution process is Ft -adapted and that Fubini’s Theorem will be applicable, thereby enabling us to reverse the order of integration when necessary. Suppose that the stochastic process u : [0,t] × Ω −→ R satisfies the following conditions:
ω 7→ u(s; ω ) is Fs − adapted,∀s ∈ [0,t], (s; ω ) 7→ u(s; ω ) is progressively measurable on [0,t] × Ω, ˆ t E |u(s; ·)|2 ds < ∞.
(3.14) (3.15) (3.16)
0
The collection of all real-valued stochastic processes satisfying (3.14) through (3.16) shall be denoted by U .
3.2.1
The Lebesgue Integral for R-Valued Stochastic Processes
We have already encountered an integral different from the familiar Riemann integral when defining expectation. There, we integrated with respect to a probability
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
123
´t measure rather than a real variable. The integral 0 u(s; ω )ds arising in (3.12) and (3.13) need not be a Riemann integral, though it might not be apparent as to why. It can be a more general Lebesgue integral. This integral is defined using the same building block approach used in Def. 2.2.7. Step 1: Random Characteristic Function Let c ∈ L2 (Ω; [0, ∞)) and [a, b] ⊂ [0,t]. Define u : [0,t] × Ω −→ [0, ∞) by ( c(ω ), s ∈ [a, b], u(s; ω ) = c(ω )χ[a,b] (s) = 0, s ∈ [0,t] \ [a, b].
(3.17)
Exercise 3.2.1. Why does u (given by (3.17)) belong to U ? For a given ω0 ∈ Ω, (3.17) is just an impulse function that is “on” with height c (ω0 ) whenever the input is in the interval [a, b] , and “off” with height 0 outside of this interval. For such functions, we have the following definition: ˆ t (3.18) u(s; ω )ds ≡ c(ω )(b − a). 0
The next natural step is to consider those elements of U formed using finite combinations of random characteristic functions called random step functions. Step 2: Random Step Functions Let 0 = t0 < t1 < . . . < tm−1 < tm = t and {ci : i = 1, . . . , m} ⊂ L2 (Ω; [0, ∞)) be Fti adapted. Define u : [0,t] × Ω −→ [0, ∞) by m
u(s; ω ) = ∑ ci (ω )χ[ti−1 ,ti ) (s).
(3.19)
i=1
We denote the collection of all random step functions by S. Exercise 3.2.2. Why does u (given by (3.19)) belong to U ? For any u ∈ S, we have the following definition: ˆ t m u(s; ω )ds ≡ ∑ ci (ω ) (ti − ti−1) . 0
(3.20)
i=1
Remark. For a given ω0 ∈ Ω, the picture of u is a typical step function. Pay particular attention to the nature of the intervals [ti−1 ,ti ) , specifically that the left endpoint is included and the right is excluded. How does this show up in the graph? What if the reverse were true? This choice has a significant impact when defining the other integral appearing in (3.12) and (3.13), especially regarding the Ft -adaptedness. In analogy with the Riemann integral, you can loosely think of ti as the sample point in the interval [ti−1 ,ti ) at which we compute the integrand to obtain the height of that
© 2011 by Taylor & Francis Group, LLC
124
Volume 2: Stochastic Equations
particular rectangle. It turns out that the collection of all such step functions is dense in the space consisting of the positive-valued members of U . (See [161].) This can be used to show that ∀u ∈ U , ∃ {um } ⊂ S such that um −→ u in L2 (Ω; [0, ∞)) as m → ∞. Using this fact, the next step in the construction is natural. Step 3: Positive Member of U Assume that u : [0,t] × Ω −→ [0, ∞) belongs to U . There exists a sequence of nonnegative random step functions {um } ⊂ S such that um −→ u in L2 (Ω; [0, ∞)) as m → ∞. We have the following definition: ˆ t ˆ t um (s; ω )ds, (3.21) u(s; ω )ds ≡ lim m−→∞ 0
0
where the limit is taken in the mean square sense. An arbitrary member of U can be written as the difference of two positive members of U . Precisely, let u ∈ U and define u+ : [0,t] × Ω −→ [0, ∞) and u− : [0,t] × Ω −→ [0, ∞) by ( u(s; ω ), if u(s; ω ) ≥ 0, + u (s; ω ) = (3.22) 0, if u(s; ω ) < 0, ( 0, if u(s; ω ) ≥ 0, u− (s; ω ) = (3.23) −u(s; ω ), if u(s; ω ) < 0. Observe that u(s; ω ) = u+ (s; ω ) − u− (s; ω ).
(3.24)
Exercise 3.2.3. Why do u+ and u− belong to U ? Also, why does (3.24) hold? Step 4: Arbitrary Member of U Let u : [0,t] × Ω −→ R belong to U . Then, u can be written in the equivalent form (3.24) and so we have the following definition: ˆ t ˆ t ˆ t + u(s; ω )ds ≡ u (s; ω )ds − u− (s; ω )ds. (3.25) 0
0
0
The integral defined via this construction is a Lebesgue integral. We say u is Lebesgue integrable if the right-hand side of (3.25) is defined. This integral and the one arising when defining expectation are special cases of an “integral with respect to a measure”; refer to [353] for a more thorough discussion of the general case. For the most part in this text, you can think about Lebesgue integrals as if they were Riemann integrals (and quite often, they are Riemann integrals because the integrands are typically continuous). In fact, the properties of the
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
125
Lebesgue integral are similar to those of the Riemann integral. The key to verifying these properties is to appeal to the building block approach to first verify that the property holds for a characteristic function, and then proceed step-by-step through the construction. Proposition 3.2.1. (Properties of the Lebesgue Integral of a Stochastic Process) Assume that u : [0,t] × Ω −→ R and v : [0,t] × Ω −→ R belong to U . Then, for any [a, b] ⊂ [0,t] and ∀ω ∈ Ω, the following hold: ´b ´a i.) a u(s; ω )ds = − b u(s; ω )ds. ii.) (Linearity) ˆ b ˆ b ˆ b u(s; ω )ds + β v(s; ω )ds, ∀α , β ∈ R. [α u(s; ω ) + β v(s; ω )] ds = α a
a
a
´c
´b
´b
iii.) (Additivity) a u(s; ω )ds = a u(s; ω )ds + c u(s; ω )ds, ∀c ∈ [a, b]. iv.) (Monotonicity) a.) If |u(s; ω )| ≤ |v(s; ω )|, for almost all (s; ω ) ∈ [0,t] × Ω, then ˆ b ˆ b |u(s; ω )| ds ≤ |v(s; ω )| ds; a
a
b.) If [c, d] ⊂ [a, b] and u(s; ω ) ≥ 0, for almost all (s; ω ) ∈ [0,t] × Ω, then ˆ d ˆ b u(s; ω )ds ≤ u(s; ω )ds. c
a
v.) (Equality) If u(s; ω ) = v(s; ω ), for almost all (s; ω ) ∈ [0,t] × Ω, then ˆ b ˆ b v(s; ω )ds. u(s; ω )ds = a
a
´b
vi.) If u ∈ C ([0,t] × Ω; R), then a u(s; ω )ds exists and ˆ ˆ b b |u(s; ω )| ds. u(s; ω )ds ≤ a a
(3.26)
More generally, ˆ "ˆ #1/p "ˆ #1/q b b b p q u(s; ω )v(s; ω )ds ≤ u (s; ω )ds v (s; ω )ds , a a a
(3.28)
vii.) (Absolute Continuity) If u ∈ C ([0,t] × Ω; [0, ∞)) , then ∀ε > 0 and ω ∈ Ω, ´ a+δ ∃δ > 0 such that a u(s; ω )ds < ε . viii.) (Hölder’s Inequality) ˆ "ˆ #1/2 "ˆ #1/2 b b b 2 2 u(s; ω )v(s; ω )ds ≤ u (s; ω )ds v (s; ω )ds . (3.27) a a a
© 2011 by Taylor & Francis Group, LLC
126
Volume 2: Stochastic Equations
where 1 ≤ p, q < ∞ are such that ix.) (Minkowski’s Inequality) "ˆ
1 p
+ 1q = 1.
b
2
#1/2
(u(s; ω ) + v(s; ω )) ds a
≤
"ˆ +
b
#1/2
2
u (s; ω )ds a
"ˆ
b
#1/2
2
v (s; ω )ds
a
.
(3.29)
We defined the Lebesgue integral and stated its properties assuming the functions of interest were stochastic processes because that is typically the context in which the integral will arise. Equally as important, though, is the case when the integrand is a deterministic function, say s 7→ ub(s). Such a function can be viewed as the stochastic process u : [0,t] × Ω −→ R defined by u(s; ω ) = ub(s), ∀ω ∈ Ω. This can arise, for instance, when computing the integral of the expectation of a stochastic process. In such a case, it is customary to suppress the dependence on ω in the definition and properties. Exercise 3.2.4. Assume that f , u ∈ C ([a, b]; R) and that g : [a, b] × R → R is a continuous mapping for which there exist positive real numbers M1 and M2 such that |g(s, x)| ≤ M1 |z| + M2 , ∀s ∈ [a, b], z ∈ R. (3.30) ´x i.) Prove that the set f (x) + a g(z, u(z))dz : x ∈ [a, b] is uniformly bounded above and provide an upper bound. ii.) Let N ∈ N. Determine upper bounds for these: N ´x a.) f (x) + a g(z, u(z))dz N ´b ´x b.) a f (x) + a g(z, u(z))dz dx Exercise 3.2.5. i.) Prove Prop. 3.2.1(viii) by appealing to the appropriate Hilbert space property as it specifically applies to L2 (a, b; R). ii.) Prove that if f is Lebesgue integrable on [0, T ] , then ˆ
T
f (x)dx
0
2
≤
√ T
ˆ
0
T
f 2 (x)dx
1/2
.
The following is an important property of Lebesgue integrals that is used frequently in convergence arguments. Proposition 3.2.2. (Lebesgue Dominated Convergence (LDC)) Let { fn } be a sequence of (Lebesgue) integrable real-valued functions defined on [a, b] . Assume that i.) lim fn (x) = f (x), for almost all x ∈ [a, b] , and n→∞
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
127
ii.) there exists a Lebesgue integrable function g : [a, b] → [0, ∞) (called a dominator) for which | fn (x)| ≤ g(x), ∀n ∈ N, for almost allx ∈ [a, b] . (3.31) Then, f is Lebesgue integrable and lim
ˆ
n→∞ a
b
fn (x)dx =
ˆ
b
lim fn (x)dx =
a n→∞
ˆ
b
f (x)dx.
(3.32)
a
n´ o t We now turn our attention to the stochastic process S = 0 u(s; ω )ds : 0 ≤ t ≤ T . ´t Observe that ∀t ∈ [0, T ] , 0 u(s; ω )ds ∈ L2 (Ω; R) h´(Why?), and i (3.14) implies that S t is Ft -adapted. (Why?) The need to compute E 0 u(s; ·)ds arises often. If follows from the definition of expectation E [·] that ˆ t ˆ ˆ t E u(s; ·)ds = u(s; ω )dsdP. (3.33) Ω 0
0
Conditions (3.15) and (3.16) are sufficient to guarantee that Fubini’s Theorem (see [161]) applies, so that the order of integration on the right-hand side of (3.33) can be interchanged, yielding ˆ t ˆ tˆ ˆ t E u(s; ·)ds = u(s; ω )dPds = E [u(s; ·)] ds. (3.34) 0
0
Ω
0
This result is particularly useful because it enables us to transfer the computation of the expectation of an integral to that of its integrand, of which we often have additional knowledge, typically in the form of a priori estimates. Exercise 3.2.6. Verify (3.34) when u is a random characteristic function, and then when u is a random step function.
3.2.2
The Ito´ Integral for R-Valued Stochastic Processes
The integral computed with respect to the Wiener process introduced in (3.9) and (3.11) is treated differently. We will apply essentially the same building block process to formulate a reasonable definition. In so doing, n´ o we must make certain that the t stochastic process 0 u(s; ω )dW (s) : 0 ≤ t ≤ T is Ft -adapted. Merely assuming that u satisfies (3.14) through (3.16) is insufficient because of the presence of the stochastic process {W (t) : 0 ≤ t ≤ T } . Indeed, we must further assume that
σ ({W (u) : 0 ≤ u ≤ s}) ⊂ Fs , ∀0 ≤ s ≤ t.
(3.35)
Which quantity is defined first, {W (u) : 0 ≤ u ≤ T } or {Fs : 0 ≤ s ≤ T }? By convention (S.A.1), the very first thing we do is start with a complete probability space (Ω, F , P) equipped with a filtration. But, this filtration is actually chosen based on
© 2011 by Taylor & Francis Group, LLC
128
Volume 2: Stochastic Equations
the Wiener processes that are to be introduced into the stochastic differential equation being formulated. This is sensible because proceeding in the reverse order would run the risk of a Wiener process that we want to include in the model not being compatible with the filtration, thereby affecting ´ t the well-definedness of the Itó integral. It is natural to expect that the integral 0 u(s; ω )dW (s) would possess some of the same salient characteristics as the Wiener process W (s). It will become apparent that this is indeed the case in the very first stage of the construction of the integral. Also, we shall employ the convention that for any partition arising in the construction of this integral, we will always choose the left endpoint of the subinterval as the sample point. Doing so will result in the so-called Itó integral. While different sample points (e.g., the midpoints or right endpoints of the subintervals) can be used to define meaningful stochastic integrals, the resulting constructions do not generate integrals equivalent to the Itó integral. (See [161, 302].) This is an important departure from the Riemann integral, where the limiting process was independent of the choice of sample point. The various pathological problems and other constructions involved in defining a stochastic integral are very interesting, but we shall not pursue them here because our primary focus is the study of SEEs. ´t We now proceed with the construction of 0 u(s; ω )dW (s). At each stage of the construction, we will consider the properties of the integral. Step 1: Random Characteristic Function Let c ∈ L2 (Ω; R) and [a, b] ⊂ [0,t]. Define u : [0,t] × Ω −→ [0, ∞) by u(s; ω ) = c(ω )χ[a,b] (s), as in (3.17). We define ˆ t (3.36) u(s; ω )dW (s) ≡ c(ω )(W (b) − W (a)). 0
In particular, if u(s; ω ) = c(ω )χ[0,t] (s), then ˆ t u(s; ω )dW (s) ≡ c(ω )(W (t) − W (0)) = c(ω )W (t).
(3.37)
0
So, for a fixed ω0 ∈ Ω, this integral is a (random) constant multiple of a Wiener process. As such, the properties of the integral in this case follow almost exclusively from those of the Wiener process itself. ´t Proposition 3.2.3. (Properties of 0 c(ω )dW (s)) Assume that c, c1 , c2 ∈ L2 (Ω; R) . i.) (Linearity) ∀α , β ∈ R, ˆ t ˆ t ˆ t [α c1 (ω ) + β c2(ω )] dW (s) = α c1 (ω )dW (s) + β c2 (ω )dW (s). 0
0
0
´τ ´t ii.) (Additivity) ∀0 < τ < t, 0 c(ω )dW (s) = 0 c(ω )dW (s) + τ c(ω )dW (s). ´t ´ τi More generally, ∀0 = τ0 < τ1 < . . . < τm = t, 0 c(ω )dW (s) = ∑m i=1 τi−1 c(ω )dW (s). h´ i t iii.) (Zero Expectation) If E |c(·)| < ∞, then E 0 c(·)dW (s) = 0. ´t
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R ´ 2 ´ t t iv.) (Itó Isometry) E 0 c(·)dW (s) = 0 E |c(·)|2 ds.
129
v.) (Stochastic Properties) Define F : [0, T ] × Ω −→ L2 (Ω; R) by ˆ t c(ω )dW (s). F(t; ω ) = 0
a.) F(t; ·) is Ft -adapted, ∀0 ≤ t ≤ T ; b.) {F(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is a real martingale; c.) F(t; ·) has continuous sample paths a.s. [P] ; d.) If c(ω ) = c⋆ , ∀ω ∈ Ω, (i.e., c(·) is deterministic), then F(t; ·) is n(0,t). Proof. (i) ˆ
t
0
[α c1 (ω ) + β c2 (ω )] dW (s) = [α c1 (ω ) + β c2(ω )] W (t) − W (0) {z } | | {z } =0
Constant with respect to s
= α c1 (ω )W (t) + β c2(ω )W (t) ˆ t ˆ t =α c1 (ω )dW (s) + β c2 (ω )dW (s). 0
0
(ii) ˆ
t 0
c(ω )dW (s) = c1 (ω ) [W (t) − W (0)] = c1 (ω ) [W (t) − W (τ ) + W (τ ) − W (0)]
= c1 (ω ) [W (τ ) − W (0)] + c1 (ω ) [W (t) − W (τ )] ˆ τ ˆ t = c(ω )dW (s) + c(ω )dW (s). τ
0
(iii) E
ˆ
0
t
c(·)dW (s) = E [c(·)W (t)] = E [c(·)] E [W (t)] = E [c(·)] (0) = 0.
(iv) ˆ t 2 h i E c(·)dW (s) = E |c(·)W (t)|2 0 = E c2 (·)W 2 (t) = E c2 (·) E W 2 (t) = E c2 (·) t ˆ t = E c2 (·) ds 0 ˆ t = E |c(·)|2 ds. 0
© 2011 by Taylor & Francis Group, LLC
130
Volume 2: Stochastic Equations
(v) (a) For every t ∈ [0, T ] , W (t) is Ft -measurable. Because constant multiples of Ft -measurable functions are themselves Ft -measurable (Why?), we conclude that F(t; ω ) = c(ω )W (t) is Ft -measurable. (b) The fact that F(t; ·) has finite first and second moments follows from the properties of c(·). (Tell how.) The martingale property holds because ∀0 ≤ s ≤ t ≤ T, E [F(t)|Fs ] = E [F(t) − F(s) + F(s)|Fs ]
= E [F(t) − F(s)|Fs ] + E [F(s)|Fs ] = E [c(·) (W (t) − W (s)) |Fs ] + E [c(·)W (s)|Fs ]
= E [c(·) (W (t) − W (s))] + c(ω )W (s) ˆ s c(ω )dW (t) = E [c(·)] E [W (t) − W (s)] + {z } | 0 =0
= 0 + F(s) = F(s).
(c) For a given ω0 ∈ Ω, F (t; ω0 ) = c (ω0 )W (t) is a constant multiple of a stochastic process possessing continuous sample paths a.s. [P] . Hence, F(t; ·) has continuous sample paths a.s. [P] . (d) If c(ω ) = c⋆ , ∀ω ∈ Ω, then F(t; ω ) = c⋆W (t), ∀ω ∈ Ω. Because W (t) is n(0,t), it follows that F(t; ·) is also n(0,t). Exercise 3.2.7. Verify each step in the proof of Prop. 3.2.3. In particular, prove the more general version of the additivity property. Exercise 3.2.8. Prove that {F(t; ·) : 0 ≤ t ≤ T } has orthogonal increments, meaning that ∀0 ≤ t1 < t2 < t3 < t4 ≤ T, E [(F (t4 ; ·) − F (t3 ; ·)) (F (t2 ; ·) − F (t1 ; ·))] = 0. The next natural step in the construction of the Itó integral is to build upon Step 1 by considering random step functions. Step 2: Random Step Functions Assume that u ∈ U is given by (3.19) (with [0, ∞) replaced by R). The following definition is natural: ˆ t m ˆ t u(s; ω )dW (s) ≡ ∑ ci (ω )χ[ti−1 ,ti ) (s)dW (s) 0
=
i=1 0 m ˆ ti
∑
ci (ω )dW (s)
i=1 ti−1 m
=
∑ ci (ω ) (W (ti ) − W (ti−1 ))
i=1
© 2011 by Taylor & Francis Group, LLC
(3.38)
Linear Homogenous Stochastic Evolution Equations in R
131
Using finite combinations of random characteristic functions should not severely impede our effort in verifying that (3.38) satisfies the properties listed in Prop. 3.2.3. Indeed, the nice properties of E [·] and W (·) should render the proofs straightforward. Exercise 3.2.9. (Mini-Project) Verify that the integral defined by (3.38) satisfies the properties listed in Prop. 3.2.3. The next step of the construction is where some more interesting analysis comes into play. For any u ∈ U , we use the density of the step functions in U to construct a sequence of step functions that converges in the L2 -sense to u. Then, the stochastic integral is defined as the L2 -limit of the sequence of integrals of these step functions. (See [161] for details.) Step 3: Arbitrary Member of U Let u : [0,t] × Ω −→ R belong to U and let {un } be a sequence of step functions in U for which ˆ t lim E |un (s; ·) − u(s; ·)|2 ds = 0. (3.39) n−→∞ 0
Then, we define ˆ
0
t
u(s; ω )dW (s) ≡ lim
ˆ
n−→∞ 0
t
un (s; ω )dW (s),
(3.40)
where the limit is taken in the L2 -sense. This is the Itó integral of u with respect to {W (s) : 0 ≤ s ≤ t} and we say u is Itó integrable whenever the limit on the righthand side of (3.40) exists and is finite. Using some powerful convergence results of stochastic analysis, it can be shown that the Itó integral of such functions satisfies all of the properties in Prop. 3.2.3. This completes the construction. Remark. If u(s; ω ) = ub(s), ∀ω ∈ Ω, (i.e., u is deterministic), then ub is automatically Fs -adapted because it is constant with respect to ω and constant functions are measurable. In´ such case, the criterion used to define U (cf. (3.14) through t (3.16)) reduces to 0 |b u(s)|2 ds < ∞. A common instance in which the integrand of a´ stochastic integral is, in fact, deterministic occurs with computations of the type t 2 0 E |u(s; ·)| ds. h´ i t As with the Lebesgue integral, we will need to compute E 0 u(s; ·)dW (s) . Exercise 3.2.10. Verify that ˆ t ˆ t E u(s; ·)dW (s) = E [u(s; ·)] dW (s), 0
(3.41)
0
assuming first that u is a random characteristic function and then when u is a random step function. (In fact, it can be shown that (3.41) holds, ∀u ∈ U .)
© 2011 by Taylor & Francis Group, LLC
132
3.2.3
Volume 2: Stochastic Equations
The Ito´ Formula in R
Now, we are able to consider (3.8) and (3.11), or their equivalent integrated forms (3.12) and (3.13), respectively, more carefully. Definition 3.2.4. Suppose that i.) u1 : [0, T ] −→ R is Ft -measurable and Lebesgue integrable; ii.) u2 : [0, T ] −→ R is Itó integrable; iii.) Y0 ∈ L2 (Ω; R) is an F0 -measurable random variable independent of the Wiener process {W (t) : 0 ≤ t ≤ T } . Then, the stochastic process {Y (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} for which ˆ t ˆ t u1 (s; ω )ds + u2 (s; ω )dW (s), 0 ≤ t ≤ T, (3.42) Y (t; ω ) = Y0 (ω ) + 0
0
or equivalently, ( dY (t; ω ) = u1 (t; ω )dt + u2 (t; ω )dW (t), 0 < t < T, ω ∈ Ω, Y (0; ω ) = Y0 (ω ), ω ∈ Ω,
(3.43)
is called an Itó process. Exercise 3.2.11. Prove that an Itó process {Y (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is Ft -measurable. An important tool in obtaining explicit formulae for the solutions of some elementary SDEs, as well as some crucial a priori estimates, is the ability to compute stochastic differentials of the form d [h(t,Y (t; ω )] , where {Y (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is an Itó process. This suggests the need for a stochastic counterpart of the familiar chain rule for differentiation. We shall present a heuristic discussion that suggests the form of this rule. We begin with the deterministic setting, for comparison purposes. Suppose that x : [0, T ] −→ R is differentiable and that h : [0, T ] × R −→ R has continuous first and second-order partials. We then know from elementary calculus that if H(t) = h(t, x), where x = x(t), then dH ∂ h ∂ h dx = + , dt ∂ t ∂ x dt or in its equivalent differential form, ∂h ∂h dH = dt + dx. ∂t ∂x
(3.44)
(3.45)
By way of motivation for the stochastic chain rule, it is helpful to understand the formulation of (3.45). Recall that the two variable Taylor series for h(t, x) centered
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
133
at (t0 , x0 ) is given by
∂h ∂h (t0 , x0 ) (t − t0 ) + (t0 , x0 ) (x − x0) h(t, x) = h (t0 , x0 ) + ∂t ∂x 2 1 ∂ h ∂ 2h 2 + (t , x ) (t − t ) + 2 (t0 , x0 ) (t − t0 ) (x − x0) 0 0 0 2 ∂ t2 ∂ t∂ x ∂ 2h + 2 (t0 , x0 ) (x − x0)2 + [Higher − order terms] . ∂x Let △x = x (t0 + △t) − x (t0 ) . We compute
dH dt
(3.46)
(t0 ) as follows:
dH H (t0 + △t) − H (t0 ) (t0 ) = lim △t−→0 dt △t h (t0 + △t, x0 + △x) − h (t0 , x0 ) = lim △t−→0 △t 1 ∂h = lim h (t0 , x0 ) + (t0 , x0 ) (t0 + △t − t0 ) △t−→0 △t ∂t ∂h 1 ∂ 2h + (t0 , x0 ) (x0 + △x − x0) + (t0 , x0 ) (t0 + △t − t0 )2 ∂x 2 ∂ t2
(3.47)
∂ 2h (t0 , x0 ) (t0 + △t − t0 ) (x0 + △x − x0) ∂ t∂ x ∂ 2h + 2 (t0 , x0 ) (x0 + △x − x0)2 + [Higher − order terms] − h (t0 , x0 ) ∂x ∂h △t ∂ h △x = lim (t0 , x0 ) + (t0 , x0 ) △t−→0 ∂ t △t ∂ x △t " # 2 2 2 1 ∂ h (△t) ∂ h (△x) (△t) ∂ 2 h (△x)2 + (t0 , x0 ) +2 (t0 , x0 ) + 2 (t0 , x0 ) 2 ∂ t2 △t ∂ t∂ x △t ∂x △t (△x)m (△t)n + [Higher − order terms] , △t +2
where (m + n) ∈ N \ {1} . All partial derivatives are computed at (t0 , x0 ) (and hence are constant with respect to △t). So, by continuity, lim △x = lim [x (t0 + △t) − x (t0 )] = 0.
△t−→0
△t−→0
As such, taking the limit as △t −→ 0 in (3.47) wipes out all terms except the first two, thereby resulting in (3.44). Now, let us consider the stochastic case in which {x(t) : 0 ≤ t ≤ T } is now an Itó process. The basic idea is to consider computations similar to those in (3.46) and (3.47), although the technical details are more complicated. We do not expect the first three terms of the Taylor formula to cause problems, but the fact that
© 2011 by Taylor & Francis Group, LLC
134
Volume 2: Stochastic Equations
{W (t) : 0 ≤ t ≤ T } has quadratic variation, meaning (W (t0 + △t) − W (t0 ))2 (see Exer. 2.9.13 (ii)), creates a new wrinkle with which we must contend. But, in which terms would computing such a difference occur? We must remember that now x(t; ω ) is given by (3.42), which involves an Itó inte´ t +△t gral. Thus, when computing x (t0 + △t; ω )− x (t0 ; ω ), the term t00 u2 (s; ω )dW (s) arises. The most simplistic case is when u2 (s; ω ) = c(ω )χ[0,T ) . Here, ˆ t0 +△t u2 (s; ω )dW (s) = c(ω ) [W (t0 + △t) − W (t0 )] . (3.48) t0
If u2 (s; ω ) is a step function, then this integral is computed as a finite sum of the differences of the form occurring on the right-hand side of (3.48). Consequently, whenever we consider (△x)n , where n ∈ N\{1} , a term involving (W (t0 + △t) − W (t0 ))2 arises. However, when taking the limit as △t −→ 0 in the stochastic version of (3.47), 2 the only second-order that is not wiped out is 12 ∂∂ xh2 (t0 , x0 ) (△x)2 . (Why?) This, coupled with the fact that (△x)m (△t)n lim = 0, △t−→0 △t for all m, n ∈ N for which (m + n) ∈ N \ {1} (except for the combination m = 0, n = 2), is the basis for the following formula:
Proposition 3.2.5. (Itó’s Formula in R) Suppose that {X(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is an Itó process and let h : [0, T ] × R −→ R have continuous first- and second-order partials. Then, the stochastic process H : [0, T ] × Ω −→ R defined by H(t; ω ) = h(t, X(t; ω )) is an Itó process and dH(t; ω ) =
∂h ∂h (t, X(t; ω )) dt + (t, X(t; ω )) dX(t; ω ) ∂ t ∂{zx } |
(3.49)
Familiar part
New part
}| { z 1 ∂ 2h + (t, X(t; ω )) (dX(t; ω ))2 . 2 ∂ x2 (See [161] for a formal proof.)
Remarks. 1. An infinitesimal version of the remarks directly preceding Prop. 3.2.5 is as follows: dtdt = dtdW = dW dt = 0, (dW )(dW ) = dt.
(3.50)
2. Do not inadvertently confuse the term (dX(t; ω ))2 for dt! Remember, we infer from (3.42) that (dX(t; ω ))2 = (u1 dt + u2dW )2 = u21 (dt)2 + 2u1u2 dtdW + u22 (dW )2 =
u22 dt.
© 2011 by Taylor & Francis Group, LLC
(3.51)
Linear Homogenous Stochastic Evolution Equations in R
135
In a completely analogous manner, the following formula can be established using a three-variable Taylor series. Proposition 3.2.6. (Multivariable Itó Formula) Suppose that {Xi (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} , i = 1, . . . , N, are Itó processes (involving the same Wiener process W(t)) and let h : [0, T ] × RN −→ R have continuous first- and second-order partials. Then, the stochastic process {H(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} defined by H(t; ω ) = h(t, X1 (t; ω ), . . . , XN (t; ω )) is an Itó process and dH(t; ω ) =
∂h (t, X1 (t; ω ), . . . , XN (t; ω )) dt + ∂t ∂h (t, X1 (t; ω ), . . . , XN (t; ω )) dX1 (t; ω ) + . . . ∂ X1 ∂h + (t, X1 (t; ω ), . . . , XN (t; ω )) dXN (t; ω ) + ∂ XN
(3.52)
1 N N 1 ∂ 2h ∑ ∑ 2 ∂ Xi ∂ X j (t, X1(t; ω ), . . . , XN (t; ω )) dXi dX j . 2 i=1 j=1 Exercise 3.2.12. Suppose that dX1 = u1 dt + u2dW, dX2 = ub1 dt + ub2dW.
(3.53)
Convince yourself that in the Taylor series computation leading to (3.52), all of the second-order terms not explicitly appearing in (3.52) go to zero as △t −→ 0. Exercise 3.2.13. (Integration by Parts) Define h : [0, T ] × R × R −→ R by h (t, x1 , x2 ) = x1 x2 . i.) Compute all partial derivatives arising in (3.52) for this particular function h. ii.) Apply (3.52) to derive a formula for d (X1 (t; ω )X2 (t; ω )) , for Itó processes {X1 (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} and {X2 (t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω}. Exercise 3.2.14. (Looking Ahead to Linear SDEs) Suppose that {X(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is an Itó process satisfying ( dX(t; ω ) = AX(t; ω )dt + BX(t; ω )dW (t), 0 < t < T, ω ∈ Ω, X(0; ω ) = X0 (ω ), ω ∈ Ω,
(3.54)
where A, B ∈ R. Compute d [ln X(t; ω )] . Exercise 3.2.15. (Looking Ahead to Nonhomogenous Linear SDEs) Suppose that {X(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is an Itó process satisfying ( dX(t; ω ) = AX(t; ω )dt + ε dW (t), 0 < t < T, ω ∈ Ω, X(0; ω ) = X0 (ω ), ω ∈ Ω,
© 2011 by Taylor & Francis Group, LLC
(3.55)
136
Volume 2: Stochastic Equations
where A, ε ∈ R. i.) Compute d e−At X(t; ω ) . ii.) Use the integrated form of the differential in (i) to derive a formula for X(t; ω ).
3.2.4
Some Crucial Estimates
Certain estimates shall occur repeatedly in slightly different forms. We establish two general estimates that can be used as paradigms. Appealing to these results will help to streamline the computations in a given argument. ´T Lemma 3.2.7. Let p > 2 and assume that u ∈ U with E 0 |u(s; ·)| p ds < ∞. Then, ∀0 ≤ t ′ < t ≤ T, p ´ ´ t p t i.) E t ′ u(s; ·)ds ≤ |t − t ′| q t ′ E |u(s; ·)| p ds, where 1p + 1q = 1; ´ p ´t t ii.) E t ′ u(s; ·)dW (s) ≤ ζ (t,t ′ ) t ′ E |u(s; ·)| p ds, where ′
ζ t,t = 2
p
"
p# p p p(p − 1) 2 ′ 2 t2 + t . 2
(3.56)
Proof. (i) Apply Hölder’s inequality and the properties of the integral, and then simplify as follows: p ˆ t p ˆ t 1p ˆ t q1 u p (s; ·)ds E u(s; ·)ds ≤ E 1q ds ′ ′ t′ t | t {z } 1 =(t−t ′ ) q ˆ t p ≤ t − t ′ q E u p (s; ·)ds t′ ˆ t p ≤ t − t ′ q E |u p (s; ·)| ds (3.57) ′ t ˆ t p = t − t ′ q E |u(s; ·)| p ds. t′
(ii) We follow the presentation provided in [203, 204, 285], with some modifications. Step 1: First, assume that t ′ = 0. Let u ∈ U and define y : [0, T ] × Ω → R by ˆ t y(t; ω ) = u(s; ω )dW (s). 0
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
137
We shall apply Prop. 3.2.5 with h(t, y) = |y(t)| p . To this end, we need the following:
∂h =0 ∂t d ∂h = p |y(t; ω )| p−1 |y(t; ω )| = p |y(t; ω )| p−2 y(t; ω ) ∂y dy | {z }
(3.58)
y(t;ω )
= |y(t;ω )|
∂ 2h p−2 p−3 y(t; ω ) = p |y(t; ω )| (1) + p(p − 2) |y(t; ω )| y(t; ω ) ∂ y2 |y(t; ω )| = p |y(t; ω )| p−2 + p(p − 2) |y(t; ω )| p−2 = p(p − 1) |y(t; ω )| p−2 .
Note that d [y(t; ω )] = u(t; ω )dW (t). Hence, by Prop. 3.2.5, we have d [|y(t; ω )| p ] = 0 + p |y(t; ω )| p−2 y(t; ω ) d [y(t; ω )] | {z }
=u(t;ω )dW (t)
1 + p(p − 1) |y(t; ω )| p−2 · 2
(d [y(t; ω )])2 | {z }
(3.59)
=(u(t;ω )dW (t))2 =u2 (t;ω )dt p−2
= p |y(t; ω )| y(t; ω )u(t; ω )dW (t) p(p − 1) + |y(t; ω )| p−2 |u(t; ω )|2 dt. 2 Note that
ˆ
0
t
d [|y(s; ω )| p ] = |y(t; ω )| p − |y(0; ω )| p . | {z }
(3.60)
=0
As such, integrating both sides of (3.59) over (0,t), followed by taking the expectation on both sides, yields ˆ t p p−2 E |y(t; ·)| = E p |y(s; ·)| y(s; ·)u(s; ·)dW (s) | 0 {z } =0
p(p − 1) |y(s; ·)| p−2 |u(s; ·)|2 ds 2 0 ˆ t h i p(p − 1) + E |y(s; ·)| p−2 |u(s; ·)|2 ds. 2 0 +E
ˆ
t
An application of Hölder’s inequality now yields the general estimate 1 1 E [XY ] ≤ (E |X| p⋆ ) p⋆ (E |X|q⋆ ) q⋆ ,
© 2011 by Taylor & Francis Group, LLC
(3.61)
(3.62)
138
Volume 2: Stochastic Equations
where p1⋆ + q1⋆ = 1 and X and Y are random variables for which the right-hand side of (3.62) is defined and finite. We apply this estimate with the following identifications: X(s; ω ) = |y(s; ω )| p−2 , Y (s; ω ) = |u(s; ω )|2 , p⋆ =
p p , q⋆ = . p−2 2
(Note that we use this choice of q⋆ because we inevitably want the term |u(s; ω )| p .) We now continue (3.61) as follows: p p−2 p 2p p 2 p−2 p−2 E |y(t; ·)| ≤ E |y(s; ·)| E |u(s; ·)|2 p
= (E [|y(s; ·)| p ])
p−2 p
2
(E [|u(s; ·)| p ]) p .
(3.63)
Thus, we infer from (3.61) that ˆ p−2 2 p(p − 1) t E |y(t; ·)| p ≤ (E [|y(s; ·)| p ]) p (E [|u(s; ·)| p ]) p ds. 2 0 Observe that
0 ≤ s ≤ t =⇒ E |y(s; ·)| p ≤ E |y(t; ·)| p .
(Why?) As such, we can bound the term (E [|y(s; ·)| p ])
p−2 p
(3.64)
(3.65)
appearing inside the inp−2
tegrand on the right-hand side of (3.64) above by (E [|y(t; ·)| p ]) p , which can be factored out of the integral using linearity. Thus, (3.64) implies that ˆ t p−2 2 p(p − 1) p p p E |y(t; ·)| ≤ (E [|u(s; ·)| p ]) p ds. (3.66) (E [|y(t; ·)| ]) 2 0 Next, note that ∀a, b > 0, a≤a
p−2 p
− p−2 p
b =⇒ a| · a {z
p
2 } ≤ b =⇒ a ≤ b .
2 =a p
(3.67)
Applying (3.67) for each t > 0 in (3.66) yields p
E |y(t; ·)| ≤
p(p − 1) 2
p ˆ 2
0
t
2p (E [|u(s; ·)| ]) ds . p
2 p
(3.68)
Now, apply Hölder’s inequality again, this time on the outside integral rather than on the expectation portion, to obtain ˆ t 0
ˆ t p 2p ˆ t p p−2 p p 2p 2 (E [|u(s; ·)| ]) · 1 ds ≤ (E [|u(s; ·)| ]) ds 1 p−2 ds p
2 p
0
=
ˆ
0
© 2011 by Taylor & Francis Group, LLC
0
t
2p p E [|u(s; ·)| ] ds t.
(3.69)
Linear Homogenous Stochastic Evolution Equations in R
139
Substituting (3.69) into (3.68) then yields E |y(t; ·)| p ≤ =
p(p − 1) 2
p
t p(p − 1) 2
2
ˆ
p ˆ
0
t
2
0
2p ! 2 p E [|u(s; ·)| ] ds t
p
t
E [|u(s; ·)| p ] ds,
(3.70)
as needed. Step 2: Now, assume that 0 < t ′ ≤ t. Use additivity, followed by the inequality (a + b) p ≤ 2 p (a p + b p) and the linearity of expectation, to obtain ˆ p ˆ t p ˆ t′ t E u(s; ·)dW (s) = E u(s; ·)dW (s) − u(s; ·)dW (s) ′ t 0 0 p# " ˆ p ˆ t ′ t p (3.71) ≤ 2 E u(s; ·)dW (s) + u(s; ·)dW (s) 0 0 ˆ ′ p! ˆ t p t = 2 p E u(s; ·)dW (s) + E u(s; ·)dW (s) . 0 0 Now, apply the result of Step 1 to each of the two integrals on the right-hand side of (3.71): " ˆ t p p ˆ t p(p − 1) 2 t p E u(s; ·)dW (s) ≤ 2 E [|u(s; ·)| p ] ds+ ′ 2 t 0 # ′ p ˆ t′ t p(p − 1) 2 p + E [|u(s; ·)| ] ds . (3.72) 2 0
Because |u(s)| p ≥ 0, it follows that E |u(s; ·)| p ≥ 0. (Why?) This fact, coupled with the monotonicity property of the integral, yields ˆ
t′ 0
p
E [|u(s; ·)| ] ds ≤
ˆ
0
t
E [|u(s; ·)| p ] ds.
Using this fact enables us to simplify (3.72) to obtain ˆ t p p ˆ h p i p(p − 1) 2 t p 2p ′ 2 E u(s; ·)dW (s) ≤ 2 t + t E [|u(s; ·)| p ] ds 2 t′ 0 ˆ t ′ = ζ t,t E |u(s; ·)| p ds, t′
as needed. This completes the proof.
© 2011 by Taylor & Francis Group, LLC
140
Volume 2: Stochastic Equations
Remark. We can apply the estimates in Lemma 3.2.7 to a stochastic process of the form (s; ω ) 7→ g (s, X(s; ω )), provided that (s; ω ) 7→ X(s; ω ) is nice enough (e.g., if it is an Itó process).
3.3
The Cauchy Problem — Formulation
Assume (S.A. 1). The focus of our study in the remainder of this chapter will be SDEs of the form ( dX(t; ω ) = aX(t; ω )dt + cX(t; ω )dW (t), 0 < t < T, ω ∈ Ω, (3.73) X(0; ω ) = X0 (ω ), ω ∈ Ω, for a single source of noise and, more generally, ( dX(t; ω ) = aX(t; ω )dt + ∑m k=1 ck X(t; ω )dWk (t), 0 < t < T, ω ∈ Ω, X(0; ω ) = X0 (ω ), ω ∈ Ω,
(3.74)
for multiple sources of noise. We assume that (H3.1) a, c, ck (k = 1, . . . , m) are real constants. (H3.2) {W (t) : 0 ≤ t ≤ T } is a Wiener process, or in the case of (3.74), {{Wk (t) : 0 ≤ t ≤ T } : k = 1, . . . , m} is a collection of independent Wiener processes. (H3.3) X0 is an F0 -measurable random variable in L2 (Ω; R) independent of the Wiener process(es) in (H3.2). Remark. We must assume that
σ (X0 , W (s) : 0 ≤ s ≤ t) ⊂ Ft , ∀0 ≤ t ≤ T,
(3.75)
when dealing with (3.73), and
σ (X0 , W1 (s), . . . ,Wm (s) : 0 ≤ s ≤ t) ⊂ Ft , ∀0 ≤ t ≤ T,
(3.76)
when dealing with (3.74). A “solution” of (3.73) or (3.74), first and foremost, must be an R-valued stochastic process {X(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} , which we shall write succinctly as X : [0, T ] × Ω −→ R. But, what properties must it satisfy? Exercise 3.3.1. Based on your experience with deterministic evolution equations and
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
141
what you learned about stochastic processes in Chapter 2, what properties seem natural to expect a solution of (3.73) or (3.74) to possess? Consider the following integrated forms of (3.73) and (3.74), respectively: ˆt ˆt aX(s; ω )ds + cX(s; ω )dW (s), 0 < t < T (3.77) X(t; ω ) = X0 (ω ) + 0 0 ˆt ˆ t m X(t; ω ) = X0 (ω ) + aX(s; ω )ds + ∑ ck X(s; ω )dWk (s), 0 < t < T (3.78) 0
k=1 0
First, the integrals on the right-hand sides of (3.77) and (3.78) must be defined. This requires X to belong to U . Specifically, X(t; ·) should be Ft -adapted, ∀0 ≤ t ≤ T , ´T and at least 0 E |X(s; ·)|2 ds < ∞. Because U is a Banach space, constant multiples of X also satisfy these properties, so that the integrals appearing in (3.77) and (3.78) are defined. Ultimately, we want to be able to apply the L2 -calculus to quantities involving the solution process X : [0, T ] × Ω −→ R sonthat, for instance, we can o estimate its mo-
ments. As such, we shall require that sup E |X(t; ·)|2 : 0 ≤ t ≤ T < ∞. This implies ´T that 0 E |X(s; ·)|2 ds < ∞. (Why?) Finally, it is reasonable to impose a certain degree of regularity on the solution process. The solution curves with which we dealt in the deterministic setting in Volume 1 were at least continuous, if not differentiable. Given that the worst part of the equation, namely the Wiener process, itself has continuous sample paths a.s. [P], it is not unreasonable to demand the same of the solution process. Taking a step back, the above discussion can be summarized by requiring X to belong to the space C [0, T ] ; L2 (Ω; R) . A version of this condition will always be required for solution processes with which we are interested. It remains to impose a connection between X and the equation (3.77) or (3.78). It is at this point where we will make different choices, depending on the behavior of the data. In this most basic setting, it will become apparent that it is reasonable to require that X(t; ω ) satisfy (3.77) and (3.78) a.s. [P] , ∀0 ≤ t ≤ T . (To what requirement does this translate in the deterministic setting?) Later, we will encounter situations in which this is too restrictive and we will, as a result, weaken our definition of a solution to a milder version. This will occur in Chapter 7. Summarizing, we seek solutions of (3.73) and (3.74) in the following sense: Definition 3.3.1. A stochastic process X : [0, T ] × Ω −→ R is a strong solution of (3.73) (resp. (3.74)) on [0, T ] if X ∈ C [0, T ] ; L2 (Ω; R) and X(t; ω ) satisfies (3.77) (resp. (3.78)) a.s. [P] , ∀0 ≤ t ≤ T .
© 2011 by Taylor & Francis Group, LLC
142
3.4
Volume 2: Stochastic Equations
Existence and Uniqueness of a Strong Solution
We shall state and prove the main result directly for (3.74) and recover (3.73) as a special case. Theorem 3.4.1. If (H3.1) through (H3.3) are satisfied, then (3.74) has a unique strong solution on [0, T ]. Before launching into the proof, it is helpful to recall the strategy used in the deterministic case, and then determine to what extent the approach is applicable in the present setting. To this end, consider the following deterministic homogenous IVP in R: ( U′ (t) = aU(t), 0 ≤ t ≤ T, (3.79) U(0) = U0 , where U0 ∈ R and a ∈ R. The desired solution U(t) = eat U0 is constructed using the iteration scheme described below. We begin with the integrated form of (3.79) given by ˆ t U(t) = U0 + aU(s)ds, 0 ≤ t ≤ T. (3.80) 0
In order to overcome the self-referential nature of (3.80), we replace U(s) on the right-hand side of (3.80) by an approximation of U(s). Presently, the only knowledge about U that we have is its value at t = 0, namely U0 . So, naturally we use U(s) = U0 as the initial approximation. Making this substitution yields the following crude approximation of U(t): ˆ t U(t) ≈ U0 + aU0 ds = U0 + aU0t, 0 ≤ t ≤ T. (3.81) 0
Now, let U1 (t) = U0 + aU0t. In order to improve the approximation, we can replace U(s) on the right-hand side of (3.80) by U1 (s) to obtain ˆ t U(t) ≈ U0 + aU1 (s)ds 0 ˆ t ˆ s = U0 + a U0 + aU0 d τ ds 0 0 ˆ t ˆ t ˆ s = U0 + aU0 ds + a aU0 d τ ds (3.82) 0
0
t2 = U0 + aU0t + a U0 2 2 t = a0t 0 + at + a2 U0 . 2 2
© 2011 by Taylor & Francis Group, LLC
0
Linear Homogenous Stochastic Evolution Equations in R
143
The above sequence of “successively better” approximations can be formally described by the recursive sequence ˆ t Um (t) = U0 + aUm−1 (s)ds, m ∈ N. (3.83) 0
Proceeding as in (3.82) leads to the following explicit formula for Um (t): m k k at U0 . Um (t) = ∑ k! k=0 Moreover, lim
m→∞
at sup Um (t) − e U0 = 0 ,
(3.84)
(3.85)
0≤t≤T
(Why?) which then leads to the desired solution. (Tell how.) The similarity between (3.79) and (3.74) suggests that considering the convergence (in an appropriate sense) of the sequence of stochastic processes recursively defined by X0 (t; ω ) = X0 (ω ), ´ t (3.86) Xn (t; ω ) = X0 (ω ) + 0 aXn−1 (s; ω )ds ´ t m + ∑k=1 0 ck Xn−1 (s; ω )dWk (s), n ∈ N,
for 0 ≤ t ≤ T, might be a viable approach. In fact, the proof of Thrm. 3.4.1 very much resembles the proof in the deterministic case outlined above with appropriate modifications made to account for the probabilistic nature of (3.74), specifically the Itó integral. Proof of Theorem 3.4.1: The proof of this theorem presented below is a blend of the approaches used in [126, 142, 285]. We divide the proof into several subclaims.
Existence of a Strong Solution: Claim 1: Each term of the sequence {Xn } defined in (3.86) is a well-defined martingale. Proof. We must verify the following, ∀n ≥ 0: i.) Both integrals in (3.86) are well-defined, ii.) the mapping t 7→ Xn (t; ω ) is continuous a.s. [P], iii.) Xn (t) is Ft -adapted, ∀t ≥ 0. We proceed inductively, beginning with n = 0. Observe that X0 (t; ω ) = X0 (ω ) belongs to U (Why?) and is a constant random variable with respect to t. Hence, X0 automatically has continuous sample paths a.s. [P]. (Why?) ´ t As such, aX0 and ck X0 (k = 1, . . . ., m) belong to U and so, the mappings t 7→ 0 aX0 (ω )ds and t 7→ ´t 0 ck X0 (ω )dWk (s) (k = 1, . . . ., m) have continuous sample paths a.s. [P] . (Why?) The Ft -adaptedness follows because Xn is an Itó process. (Verify this!)
© 2011 by Taylor & Francis Group, LLC
144
Volume 2: Stochastic Equations
Finally, the martingale property holds trivially because X0 is a constant random variable and the Itó integral (as a function of its upper limit) is a martingale. (Tell why.) This establishes the base case. The inductive step follows easily. (How?) This completes the proof of Claim 1. ♦ Claim 2: The sequence {Xn } is a uniformly bounded subset of C [0, T ] ; L2 (Ω; R) . Proof. We must show that ∃M > 0 such that sup sup E |Xn (t; ·)|2 ≤ M. (3.87) n≥0
0≤t≤T
Exercise 3.4.1. Upon what quantities do you suspect the bound M should depend? Let 0 ≤ t ≤ T and n ∈ N. The idea is to show that ∃ζ1 , ζ2 > 0 (independent of n) such that ˆ E |Xn (t; ·)|2 ≤ ζ1 + ζ2
t
0
E |Xn−1 (s; ·)|2 ds.
(3.88)
If we can establish (3.88), then it follows that ∀K ∈ N, ˆ t 2 sup E |Xn (t; ·)| ≤ ζ1 + ζ2 sup E |Xn−1 (s; ·)|2 ds 0 1≤n≤K
1≤n≤K
≤ ζ1 + ζ2
ˆ t 0
E |X0 |2 + sup E |Xn (s; ·)|2 ds 1≤n≤K ˆ t
≤ ζ1 + T ζ2 kX0 k2L2 + ζ2
(3.89)
sup E |Xn (s; ·)|2 ds.
0 1≤n≤K
Applying Gronwall’s Lemma in (3.89) subsequently yields ∀K ∈ N, sup E |Xn (t; ·)|2 ≤ ζ1 + T ζ2 kX0 k2L2 eζ2 t , 1≤n≤K
so that
sup 0≤t≤T
sup E |Xn (t; ·)|2
1≤n≤K
≤ ζ1 + T ζ2 kX0 k2L2 eζ2 T . | {z }
(3.90)
independent of K
Because the bound on the right-hand side of (3.90) is independent of K, it is a suitable candidate for M in (3.87). Now, we must verify the existence of ζ1 , ζ2 > 0 in (3.88) in order for the above strategy to work. To this end, observe that 2 ˆ t m ˆ t 2 E |Xn (t; ·)| = E X0 (·) + aXn−1(s; ·)ds + ∑ ck Xn−1 (s; ·)dWk (s) 0 k=1 0 " ˆ t 2 ≤ 3 kX0 k2L2 + E aXn−1 (s; ·)ds (3.91) 0
ˆ t 2 # m +m ∑ E ck Xn−1 (s; ·)dWk (s) . k=1
0
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
145
Applying Lemma 3.2.7 then yields ˆ t 2 ˆ t E aXn−1 (s; ·)ds ≤ a2 T E |Xn−1 (s; ·)|2 ds 0
(3.92)
0
ˆ t 2 ˆ t 2 E ck Xn−1 (s; ·)dWk (s) ≤ 8T ck E |Xn−1 (s; ·)|2 ds, k = 1, . . . ., m. (3.93) 0
0
Applying (3.92) and (3.93) in (3.91) yields the inequality !ˆ E |Xn (t; ·)|2 ≤ 3 kX0 k2L2 + 3T
t
m
a2 + 8m ∑ c2k
0
k=1
E |Xn−1 (s; ·)|2 ds,
(3.94)
so that the following are suitable choices for ζ1 , ζ2 :
ζ1 = 3 kX0 k2L2 ,
ζ2 = 3T
m
2
a + 8m ∑
c2k
k=1
!
.
This completes the proof of Claim 2. ♦ Claim 3: There exists ζ > 0 (independent of n) such that ∀n ≥ 0 and ∀0 ≤ t ≤ T , (ζ t)n+1 . (n + 1)!
E |Xn+1 (t; ·) − Xn (t; ·)|2 ≤
(3.95)
Proof. We proceed by induction on n. First, let n = 0. Observe that ˆ 2 t m ˆ t 2 E |X1 (t; ·) − X0(t; ·)| = E aX0 (s; ·)ds + ∑ ck X0 (s; ·)dWk (s) 0 0 k=1 !ˆ t m ≤ 2 ta2 + 8mt ∑ c2k E |X0 (s; ·)|2 ds 0 k=1 | {z } m
≤ 2T
!
=kX0 k2 2 t L
a2 + 8m ∑ c2k kX0 k2L2 t. k=1
2 2 As such, it suffices to choose ζ = 2T a2 + 8m ∑m k=1 ck kX0 kL2 to verify that (3.95) holds for the base case. Next, assume ∃ζ ⋆ > 0 (independent of n) such that ∀0 ≤ t ≤ T , E |Xn (t; ·) − Xn−1(t; ·)|2 ≤
© 2011 by Taylor & Francis Group, LLC
(ζ ⋆t)n . n!
(3.96)
146
Volume 2: Stochastic Equations
Observe that ∀0 ≤ t ≤ T ,
ˆ t E |Xn (t; ·) − Xn−1(t; ·)|2 = E a (Xn (s; ·) − Xn−1(s; ·)) ds 0
2 +∑ ck (Xn (s; ·) − Xn−1 (s; ·)) dWk (s) k=1 0 !ˆ t m ≤ 2 ta2 + 8mt ∑ c2k E |Xn (s; ·) − Xn−1(s; ·)|2 ds m
ˆ
t
0
k=1 m
≤ 2T = 2T
a2 + 8m ∑ c2k k=1 m
2
a + 8m ∑
k=1
2
c2k
!ˆ !
0
t
(ζ ⋆ s)n ds n!
(3.97)
(ζ ⋆ )n t n+1 . (n + 1)!
⋆ Both 2T a2 + 8m ∑m k=1 ck and ζ are less than or equal to ( ! )
ζ ⋆⋆ = max 2T
m
a2 + 8m ∑ c2k , ζ ⋆ . k=1
Hence, we can continue the string of inequalities in (3.97) to conclude that for every 0 ≤ t ≤ T, (ζ ⋆⋆ )n+1 t n+1 E |Xn (t; ·) − Xn−1(t; ·)|2 ≤ , (n + 1)! as needed. This proves Claim 3.♦ Claim 4: There exists a stochastic process X : [0, T ] × Ω −→ R such that P ω ∈ Ω : sup |Xn (t; ω ) − X(t; ω )| −→ 0 as n −→ ∞ = 1.
(3.98)
0≤t≤T
In such a case, we write lim Xn (t; ω ) = X(t; ω ) a.s. [P] . n→∞
Proof. We first outline the basic strategy. Observe that ∀n ∈ N, n−1 Xn (t; ω ) = X0 (ω ) + ∑ X j+1 (t; ω ) − X j (t; ω ) .
(3.99)
j=0
As in the deterministic case, we wish to apply the Weierstrass M-test. Doing so requires that we prove ∞
sup
∑ |Xn+1(t; ω ) − Xn(t; ω )| < ∞, a.s. [P] .
0≤t≤T n=0
© 2011 by Taylor & Francis Group, LLC
(3.100)
Linear Homogenous Stochastic Evolution Equations in R
147
One way to show (3.100) is to prove that the tail of the series is dominated by a convergent geometric series; that is, show ∃N = N(ω ) and 0 < ε < 1 such that ∞
sup
∞
∑ |Xn+1(t; ω ) − Xn(t; ω )| ≤ ∑ ε n < ∞ a.s. [P] .
0≤t≤T n=N
(3.101)
n=N
This reduces to showing that for a given 0 < ε < 1, ∃N = N(ω ) such that n ≥ N =⇒ sup |Xn+1 (t; ω ) − Xn(t; ω )| < ε n a.s. [P] .
(3.102)
0≤t≤T
(Why?) This suggests that the Borel-Cantelli Lemma (cf. Prop. 2.1.8) might be useful. (Why?) We now present the argument. Let 0 < ε < 1. For every n ∈ N ∪ {0} , define the event n (3.103) An = ω ∈ Ω : sup |Xn+1 (t; ω ) − Xn(t; ω )| > ε . 0≤t≤T
We claim that ∃ζ > 0 (independent of n) such that n+1 ζ P (An ) ≤ . (n + 1)!
(3.104)
To see this, recall from Claim 1 that Xn is a martingale, ∀n ∈ N ∪ {0} , so that we can apply Doob’s Martingale Property (cf. Thrm. 2.8.3) to the stochastic process M(t; ω ) = Xn+1 (t; ω ) − Xn(t; ω ) (Why?) to conclude that 1 E |Xn+1 (T ; ·) − Xn (T ; ·)|2 ε 2n 1 ≤ 2n sup E |Xn+1 (t; ·) − Xn(t; ·)|2 ε 0≤t≤T
P (An ) ≤
1 (ζ t)n+1 sup ε 2n 0≤t≤T (n + 1)! n+1 ε 2 ε −2 ζ t ≤ . (n + 1)!
≤
Observe that
n+1 ε 2 ε −2 ζ T −2 ∑ (n + 1)! = ε 2 eε ζ T < ∞. n=0
(3.105)
∞
(3.106)
Hence, the Borel-Cantelli Lemma implies that ∃Ω0 ∈ F and N0 = N0 (ω ) such that P (Ω0 ) = 1 and n ≥ N0 (ω ) =⇒ sup |Xn+1 (t; ω ) − Xn(t; ω )| ≤ ε n , ∀ω ∈ Ω0 . 0≤t≤T
© 2011 by Taylor & Francis Group, LLC
(3.107)
148
Volume 2: Stochastic Equations
As such, ∀ω ∈ Ω0 , N0 −1
∞
∑ |Xn+1(t; ω ) − Xn(t; ω )| = ∑
n=0
n=0
|
∞
|Xn+1 (t; ω ) − Xn (t; ω )| + {z
Bounded because it is a finite sum
}
∑
|Xn+1 (t; ω ) − Xn(t; ω )| . {z }
n=N0 |
|
≤ε n
{z
A convergent geometric series
Hence, taking the supremum over [0, T ] in the above expression enables us to conclude that (3.100) holds, ∀ω ∈ Ω0 . Thus, by the Weierstrass M-test, we conclude that (3.98) holds, where X(t; ω ) is given by ∞ X(t; ω ) = X0 (ω ) + ∑ X j+1 (t; ω ) − X j (t; ω ) ,
(3.108)
j=0
as needed. This proves Claim 4. ♦
Claim 5: The stochastic process X defined by (3.108) belongs to C [0, T ] ; L2 (Ω; R) . Proof. The facts that Xn ∈ C [0, T ] ; L2 (Ω; R) , ∀n ∈ N, and X is the uniform limit of {Xn } together constitute the driving force behind this argument. First, observe that in light of (3.86), every term Xn can be ultimately expressed entirely in terms of a, ck , X0 (ω ), and the integral thereof. All thusly formed portions of this expression for Xn (t; ·) are Ft -adapted martingales with continuous sample paths a.s. [P] . As such, X(t; ·) inherits these properties, being the uniform limit of {Xn } . n o It remains to show that sup E |X(t; ·)|2 : 0 ≤ t ≤ T < ∞. To begin, Claim 3 guar-
antees that ∀t ∈ [0, T ] , {Xn (t; ·)} is a Cauchy sequence in L2 (Ω; R) . (Tell how.) Hence, by the completeness of L2 (Ω; R) , we know that ∀t ∈ [0, T ] , {Xn (t; ·)} is actually a convergent sequence in L2 (Ω; R) . Moreover, we know that {Xn } converges uniformly to X on [0, T ] . Thus, we can apply the LDC (where E(·) is the Lebesgue integral arising in the situation to which the theorem is being applied) to obtain h i h i2 sup E (X(t; ·))2 = sup E lim Xn (t; ·) (Why?) 0≤t≤T
n→∞
0≤t≤T
h
= sup E lim (Xn (t; ·))2 0≤t≤T
= sup 0≤t≤T
n→∞
i
h i lim E (Xn (t; ·))2 (by LDC)
n→∞
≤ M < ∞, (by Claim 1) as needed. This proves Claim 5.♦
Claim 6: The stochastic process X(t; ·) defined by (3.108) satisfies (3.86) a.s. [P] . Proof. Define Z : [0, T ] × Ω → R by ˆ t m ˆ t Z(t; ω ) = X0 (ω ) + aX(s; ω )ds + ∑ ck X(s; ω )dWk (s). (3.109) 0
© 2011 by Taylor & Francis Group, LLC
k=1 0
}
Linear Homogenous Stochastic Evolution Equations in R
149
Claim 5 ensures that (3.109) is a well-defined stochastic process in C [0, T ] ; L2 (Ω; R) . (Why?) We will show that lim sup E |Xn (t; ·) − Z(t; ·)|2 = 0. (3.110) n→∞
0≤t≤T
Indeed, ∀0 ≤ t ≤ T , using Lemma 3.2.7 yields ˆ t sup E |Xn (t; ·) − Z(t; ·)|2 ≤ sup E a (Xn (s; ·) − X(s; ·)) ds 0≤t≤T
0≤t≤T
0
2 +∑ ck (Xn (s; ·) − X(s; ·)) dWk (s) (3.111) k=1 0 !ˆ T m 2 2 ≤ a + 4m ∑ ck E |Xn (s; ·) − X(s; ·)|2 ds. m
ˆ
t
k=1
Let ε > 0. There exists N ∈ N such that n ≥ N =⇒ sup E |Xn (s; ·) − X(s; ·)|2 < 0≤s≤T
0
ε . 2 T a2 + 4m ∑m k=1 ck
(3.112)
Because lim E |Xn (s; ·) − X(s; ·)|2 = 0, ∀s ∈ [0, T ] , we can apply LDC on the rightn→∞ hand side of (3.111). As such, we can use (3.112) in (3.111) to conclude that n ≥ N =⇒ sup E |Xn (t; ·) − Z(t; ·)|2 .
(3.113)
0≤t≤T
This shows (3.110). We have shown that the sequence {Xn } has two L2 (Ω; R)-limits, namely X and Z. The uniqueness of L2 (Ω; R)-limits guarantees that Z(t; ω ) = X(t; ω ), ∀t ∈ [0, T ] , a.s. [P] .
(3.114)
Making this substitution on the left-hand side of (3.109) proves that X(t; ω ) satisfies (3.86) a.s. [P] , as needed. This proves Claim 6. ♦ This completes the existence portion of the proof. ♦ Uniqueness of a Strong Solution: Suppose that two stochastic processes X : [0, T ] × Ω −→ R and X ⋆ : [0, T ] × Ω −→ R satisfy Def. 3.3.1. We must show that P ({ω ∈ Ω : X(t; ω ) = X ⋆ (t; ω ), ∀t ∈ [0, T ]}) = 1.
(3.115)
To this end, we begin by showing that E |X(t; ·) − X ⋆(t; ·)| = 0, ∀t ∈ [0, T ] .
© 2011 by Taylor & Francis Group, LLC
(3.116)
150
Volume 2: Stochastic Equations
Let 0 ≤ t ≤ T . Arguing exactly as in Claim 3 (specifically when establishing (3.97)) yields !ˆ E |X(t; ·) − X ⋆(t; ·)|2 = 2T
t
m
a2 + 8m ∑ c2k k=1
0
E |X(s; ·) − X ⋆ (s; ·)|2 ds. (3.117)
Thus, applying Gronwall’s Lemma yields E |X(t; ·) − X ⋆(t; ·)|2 = 0, ∀t ∈ [0, T ] .
(3.118)
This is close to what we need, but is not yet quite there. (Why?) We can use Prop. 2.2.8 (vii) to infer from (3.118) that |X(t; ω ) − X ⋆(t; ω )| = 0, ∀t ∈ [0, T ] , a.s. [P].
(3.119)
This means that ∀t ∈ [0, T ] , there exists an event Dt ∈ F such that P (Dt ) = 0 and |X(t; ω ) − X ⋆(t; ω )| = 0, ∀ω ∈ Ω \ Dt . Using this information, we must come to the conclusion that P ω ∈ Ω : sup |X(t; ω ) − X ⋆(t; ω )| = 0 = 1.
(3.120)
(3.121)
0≤t≤T
We cannot, however, simply use (3.120) for all 0 ≤ t ≤ T because while P (Dt ) = S 0, ∀t ∈ [0, T ] , it need not be the case that P ( {Dt : 0 ≤ t ≤ T }) = 0. (This can be easily seen, for instance, by noting that while the Lebesgue measure of a singleton S set {x} is zero, it does not follow that the Lebesgue measure of {{x} : 0 ≤ x ≤ 1} is zero. In fact, this union is the interval [0, 1] , which has Lebesgue measure 1.) The problem is that the collection {Dt : 0 ≤ t ≤ T } consists of too many sets. If we could argue that it was sufficient to use only countably many sets from this collection, say {Dt : t ∈ [0, T ] ∩ Q} , then the countable subadditivity of the probability measure (cf. Prop. 2.1.6 (vi)) would imply that [ P {Dt : t ∈ [0, T ] ∩ Q} = 0. (Why?) (3.122) Because both X and X ⋆ both have continuous sample paths a.s. [P] , Prop. 1.8.6 (v) implies that it is sufficient to note that (3.119) holds, ∀t ∈ [0, T ] ∩ Q. Then, using (3.122), we conclude that |X(t; ω ) − X ⋆(t; ω )| = 0, ∀t ∈ [0, T ] ∩ Q, ω ∈ Ω \
[
{Dt : t ∈ [0, T ] ∩ Q} . (3.123)
Consequently, because both X(t; ·) and X ⋆ (t; ·) are continuous and equal on a dense subset of [0, T ] , we conclude from Prop. 1.8.6(v) that (3.123) actually holds for all 0≤t ≤T . This completes the uniqueness portion of the theorem. ♦
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
151
This completes the proof of Thrm. 3.4.1. Summarizing, we have managed to prove the existence and uniqueness of a strong solution of (3.74). We now ask if it is possible to formulate a nice representation formula for this solution. We actually caught a glimpse of this in Exer. 2.11.1. In the absence of the Itó integral, as in (3.1) or its deterministic counterpart, we would apply the separation of variables method to “solve” the IVP. As an illustration, suppose that a 6= 0. We proceed as follows to solve the deterministic version of (3.1): dx(t) = ax(t) dt dx(t) = adt x(t) ˆ t ˆ t ˆ t ˆ t d 1 dx(s) 1 ln (x(s)) ds = ds = dx(s) = ads 0 x(s) ds 0 |ds 0 x(s) 0 {z } =d(ln(x(s)))
ln (x(s))|s=t s=0 = at ln (x(t)) − ln (x(0)) = at
(3.124)
ln (x(t)) = ln (x(0)) + at x(t) = eln(x(0))+at x(t) = eat x0 .
We would like to mimic this process for (3.73). Paying particular´ attention to the t third line in (3.124) suggests that we need to compute the integral 0 d (ln X(s; ω )) . It is here where Itó’s formula comes into play! Indeed, because a strong solution X(t; ·) is an Itó process, Prop. 3.2.5 is applicable. To this end, let h(t, x) = ln x and observe that ∂h ∂ h 1 ∂ 2h 1 = 0, = , =− 2. ∂t ∂ x x ∂ x2 x Hence, applying Itó’s formula (with dtdt = dtdW = dW dt = 0, (dW )2 = dt) yields 1 1 1 d (ln X(t; ·)) = 0dt + dX(t; ·) + − 2 (dX(t; ·))2 X(t; ·) 2 X (t; ·) 1 = [aX(t; ·)dt + cX(t; ·)dW(t)] X(t; ·) 1 − 2 [aX(t; ·)dt + cX(t; ·)dW(t)]2 (3.125) 2X (t; ·) 2 2 1 = adt + cdW − 2 c X (t; ·)dt 2X (t; ·) 1 2 = a − c dt + cdW. 2
© 2011 by Taylor & Francis Group, LLC
152
Volume 2: Stochastic Equations
Integrating both sides of (3.125) over (0, T ) then yields ˆ t ˆ t ˆ t 1 2 cdW (s) d (ln X(s; ·)) ds = a − c ds + 2 0 0 0 1 ln(X(t; ·)) − ln(X(0; ·)) = a − c2 t + cW (t) 2 1 2 ln(X(t; ·)) = ln(X0 (·)) + a − c t + cW (t). 2 As such, the representation formula for a strong solution of (3.73) is 1 2 X(t; ·) = eln(X0 (·))+(a− 2 c )t+cW (t) 1 2
t+cW (t) = eat X0 (·) |e− 2 c {z }.
(3.126)
New term!
Remark. When {W (t) : 0o≤ t ≤ T } is a Brownian motion, the stochastic process n 1 2 e− 2 c t+cW (t) : 0 ≤ t ≤ T is called a geometric Brownian motion. Exercise 3.4.2. Develop the representation formula for a strong solution of (3.74).
3.5
Continuous Dependence on Initial Data
Consider (3.74) and the related IVP ( dY (t; ω ) = aY (t; ω )dt + ∑m k=1 ckY (t; ω )dWk (t), 0 < t < T, ω ∈ Ω, Y (0; ω ) = Y0 (ω ), ω ∈ Ω,
(3.127)
both under hypotheses (H3.1) through (H3.3). If the initial data X 0 (·) and Y0 (·) are “close” in the L2 (Ω; R)-sense, we would like to establish an upper bound for the distance (in the L2 (Ω; R)-norm) between the corresponding strong solutions of (3.74) and (3.127) in terms of kX0 − Y0 kL2 (Ω;R) . Then, we could conclude that the closer the initial data X 0 (·) and Y0 (·) are, the closer the corresponding solutions X(·) and Y (·) are. This is addressed by the following proposition. Proposition 3.5.1. For all 0 ≤ t ≤ T, E |X(t; ·) − Y (t; ·)|2 ≤ 3e3T (a
© 2011 by Taylor & Francis Group, LLC
2 +m
2 2 ∑m k=1 ck )t kX − Y k 2 0 0 L (Ω;R) .
(3.128)
Linear Homogenous Stochastic Evolution Equations in R
153
Proof. Let 0 ≤ t ≤ T. Subtracting the integrated forms of (3.74) and (3.127) yields ˆ t 2 E |X(t; ·) − Y (t; ·)| = E (X0 (·) − Y0 (·)) + a (X(s; ·) − Y (s; ·)) ds 0
2 +∑ ck (X(s; ·) − Y (s; ·)) dWk (s) (3.129) k=1 0 ˆ t 2 2 ≤ 3 kX0 − Y0 kL2 (Ω;R) + a t E |X(s; ·) − Y (s; ·)|2 ds 0 # ˆ m
ˆ
t
m
+m ∑ c2k t k=1
≤
t
0
E |X(s; ·) − Y (s; ·)|2 ds
3 kX0 − Y0 k2L2 (Ω;R) 2
m
+3 a + m ∑
k=1
c2k
! ˆ t T E |X(s; ·) − Y (s; ·)|2 ds. 0
Applying Gronwall’s Lemma in (3.129) results in (3.128), as desired. Exercise 3.5.1. Let 0 < ε < 1. How small would kX0 − Y0 k2L2 (Ω;R) need to be to ensure that kX − Y kC([0,T ];L2 (Ω;R)) < ε ? Exercise 3.5.2. Replace a in (3.127) by a⋆ and assume that ∃δ1 , δ2 > 0 such that |a − a⋆| < δ1 and kX0 − Y0kL2 (Ω;R) < δ2 .
(3.130)
Establish an estimate for E |X(t; ·) − Y (t; ·)|2 as in Prop. 3.5.1. Comment on where the differences occur and additional assumptions, if needed, to overcome them.
3.6
Statistical Properties of the Strong Solution
Recovering the probability density for a solution process X : [0, T ] × Ω → R can generally be difficult. The random variables X(t; ·) comprising the stochastic process change with t, and so do their densities. While understanding the probability density for the stochastic process, as a single entity, is wrought with difficulty, it is more reasonable to obtain information about the statistical properties of the individual random variables ω 7→ X(t; ω ), for each fixed t. The specific properties of interest are defined in Section 2.7; each of these properties tells us something about the density of ω 7→ X(t; ω ). We study these properties for the strong solution of (3.73) and suggest that you do the same for (3.74) as an exercise.
© 2011 by Taylor & Francis Group, LLC
154
3.6.1
Volume 2: Stochastic Equations
Mean and Variance
Let 0 ≤ t ≤ T and consider the integrated form (3.77) of (3.73). We shall derive two deterministic ODEs to which t 7→ µX (t) and t 7→ VarX (t) are solutions. To this end, taking the expectation on both sides of (3.77) yields ˆ t ˆ t µX (t) = E [X0 (·)] + E aX(s; ·)ds + E cX(s; ·)dW (s) 0 0 ˆ t = E [X0 (·)] + E aX(s; ·)ds 0 ˆ t = E [X0 (·)] + aE [X(s; ·)] ds (3.131) 0 ˆt µX (s)ds. = µX (0) + a 0
It follows from (3.131) that t 7→ µX (t) satisfies the deterministic IVP ( d µX (t) = aµX (t), 0 < t < T, dt µX (0) = E [X0 (·)] ,
(3.132)
the unique solution of which is
µX (t) = eat E [X0 (·)] .
(3.133)
(Why?) Exercise 3.6.1. Interpret the meaning of (3.133) in the context of the entire solution process X : [0, T ] × Ω → R. Specifically, what if a < 0? How about if a = 0 ? Alternatively, we can calculate E [X(t; ·)] using the representation formula (3.126). Doing so yields h i 1 2 µX (t) = E [X(t; ·)] = E eat X0 (·) e(− 2 c t+cW (t)) h i 1 2 = eat E X0 (·) e(− 2 c t+cW (t)) . (3.134)
Formulae (3.133) and (3.134) must agree. As such, we must conclude that h i 1 2 E [X0 (·)] = E X0 (·) e(− 2 c t+cW (t)) .
(3.135)
Being skeptical about (3.135) is certainly natural. We must verify that (3.135) is indeed valid. To do so, define ζ : [0, T ] × Ω → R by 1 2 t+cW (t)
ζ (t; ω ) = X0 (ω ) e(− 2 c
© 2011 by Taylor & Francis Group, LLC
).
(3.136)
Linear Homogenous Stochastic Evolution Equations in R
155
Exercise 3.6.2. Prove that ζ : [0, T ] × Ω → R is the unique strong solution of the stochastic IVP ( d ζ (t; ω ) = cζ (t; ω )dW (t), 0 < t < T, ω ∈ Ω, (3.137) ζ (0; ω ) = X0 (ω ), ω ∈ Ω. The integrated form of (3.137) is
ζ (t; ω ) = X0 (ω ) + c
ˆ
0
t
ζ (s; ω )dW (s), 0 ≤ t ≤ T.
(3.138)
Taking the expectation on both sides of (3.138) yields E [ζ (t; ·)] = E [X0 (·)], as desired. (Why?) Next, observe that VarX (t) = E X 2 (t; ·) − (E [X(t; ·)])2 2 = E X 2 (t; ·) − eat E [X0 (·)] .
(3.139)
In order to simplify (3.139), we need a concise expression for X 2 (t; ·). Exercise 3.6.3. i.) Show that d X 2 (t; ·) = 2a + c2 X 2 (t; ·)dt + 2cX 2(t; ·)dW (t).
(3.140)
ii.) Deduce from (i) that
X 2 (t; ·) = X02 (·) + 2a + c2
ˆ
0
t
X 2 (s; ·)ds + 2c
ˆ
0
t
X 2 (s; ·)dW (s).
Taking the expectation on both sides of (3.141) yields ˆ 2 2 t 2 2 E X (t; ·) = E X0 (·) + 2a + c E X (s; ·) ds.
(3.141)
(3.142)
0
(Why?) Similar reasoning that led to (3.132) shows that the deterministic function t 7→ E X 2 (t; ·) satisfies the IVP ( d (E [X 2 (t;·)]) = 2a + c2 E X 2 (t; ·) , 0 < t < T, dt (3.143) E X 2 (0; ·) = E X02 (·) . Hence, we conclude that
2 E X 2 (t; ·) = E X02 (·) e(2a+c )t .
Substituting (3.144) into (3.139) yields the following concise formula: 2 VarX (t) = e2at E X02 (·) ec t − (E [X0 (·)])2 . © 2011 by Taylor & Francis Group, LLC
(3.144)
(3.145)
156
Volume 2: Stochastic Equations
Remark. Note that if c = 0, then (3.73) is no longer driven by a Wiener process and (3.145) simplifies to VarX (t) = Var (X0 (·)) e2at . Exercise 3.6.4. Compute µX (t) and VarX (t) for the strong solution of (3.74). Exercise 3.6.5. Compute the covariance function CovX (t, s) for the strong solutions of (3.73) and (3.74). Simplify the resulting expressions using Itó’s formula.
3.6.2
Moment Estimates
Higher-order moments are useful when studying other statistical properties of a random variable, such as kurtosis and skewness, and are used heavily in stability arguments. There are various ways to proceed. We begin with a result that follows from a straightforward application of Itó’s formula. h i Proposition 3.6.1. Let p ∈ N and X be the strong solution of (3.73). If E X02p(·) < ∞, then h i 2 2p E X 2p (t; ·) ≤ E X0 (·) e p(2a+(2p−1)c )t , 0 ≤ t ≤ T. (3.146)
Proof. An application of Itó’s formula (with h(t, x) = x2p ) yields
1 d X 2p (t; ω ) = 2pX 2p−1(t; ω )d(X(t; ω ))+ (2p(2p − 1)X(t; ω ))2p−2 d X 2 (t; ω ) 2 = p 2a + (2p − 1)c2 X 2p(t; ω )dt + 2pcX 2p(t; ω )dW (t). (3.147)
(Tell why carefully.) Integrating (3.147) over (0,t) yields ˆ t 2p 2p X (t; ω ) = X0 (ω ) + p 2a + (2p − 1)c2 X 2p (s; ω )ds 0 ˆ t 2p + 2pcX (s; ω )dW (s),
(3.148)
0
and subsequently taking the expectation in (3.148) yields h i ˆ t 2p 2p E X (t; ·) = E X0 (·) + p 2a + (2p − 1)c2 E X 2p (s; ·) ds. 0
(Why?) An application of Gronwall’s Lemma finally results in (3.146).
Exercise 3.6.6. Let p ∈ N \ {1} and X be the strong solution of (3.73). If E |X0 (·)| p < ∞, then p
p
E |X(t; ·)| ≤ E |X0 (·)| e
2 2 2 p a− c2 + p 2c t
, 0 ≤ t ≤ T.
(3.149)
Exercise 3.6.7. Establish estimates in the spirit of (3.146) and (3.149) for a strong solution of (3.74).
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
3.6.3
157
Continuity in the pth Moment
We already know that a strong solution X of (3.73) is L2 (Ω; R)-continuous. Now, we extend this to L p (Ω; R)-continuity in the following sense. Proposition 3.6.2. Let p ∈ N \ {1} . If E |X0 (·)| p < ∞, then there exists a continuous function ζ p : [0, T ] × [0, T ] −→ R such that ζ p (τ , τ ′ ) −→ 0 as (τ − τ ′ ) −→ 0 and p E X(τ ; ·) − X(τ ′ ; ·) ≤ ζ p τ , τ ′ . (3.150)
Proof. Let p ∈ N \ {1} and 0 ≤ τ ′ < τ ≤ T. Using (3.77) yields ˆ τ p ˆ τ ′ p E X(τ ; ·) − X(τ ; ·) = E aX(s; ·)ds + cX(s; ·)dW (s) (3.151) τ′ τ′ p ˆ τ p ˆ τ ≤ 2 p−1 E aX(s; ·)ds + E cX(s; ·)dW (s) . τ′
τ′
Applying Lemma 3.2.7 in (3.151) now yields ˆ p τ ′ p p−1 ′ q E X(τ ; ·) − X(τ ; ·) ≤ 2 E |aX(s; ·)| p ds τ −τ +2 p+1T
p 2
τ′
p(p − 1) 2
p ˆ 2
τ
τ′
#
E |bX(s; ·)| p ds (3.152)
p p p(p − 1) ≤ 2 p−1 |a| p τ − τ ′ q +4 |b| p T 2 2 | {z } p
×
ˆ
τ
τ′
≤2T q
E |X(s; ·)| p ds.
p 2
By Exer. 3.6.6, we know that ˆ
τ
τ′
E |X(s; ·)| p ds ≤ τ − τ ′ E |X0 (·)| p e
2 2 2 p a− c2 + p 2c T
.
(3.153)
Using (3.153) in (3.152) shows that E |X(τ ; ·) − X(τ ′ ; ·)| p is dominated by a function of the form ζ p (τ , τ ′ ) = η |τ − τ ′ | , where η is a positive constant. This completes the proof. Exercise 3.6.8. Formulate a result analogous to Prop. 3.6.2 for (3.74).
3.6.4
The Distribution of a Strong Solution
Generally speaking, the strong solutions of (3.73) and (3.74) are not Gaussian even if the initial data ω 7→ X0 (ω ) is Gaussian. However, in the absence of the Itó integral term, if the initial data ω 7→ X0 (ω ) is Gaussian, then we can immediately conclude that the solution process {X(t; ω ) = X0 (ω )eat : 0 ≤ t ≤ T, ω ∈ Ω} is Gaussian.
© 2011 by Taylor & Francis Group, LLC
158
Volume 2: Stochastic Equations
(Why?) In such case, the formulae (3.133) and (3.145) completely characterize the solution process of (3.73). (A similar result holds for (3.74); fill in the details.)
3.6.5
Markov Property
Heuristically speaking, the Markov property can be described verbally as, “When the present is known, the future of a process is independent of the past.” This basically means that for a stochastic process possessing this property, only the information at the present time is of any practical use when trying to predict the future behavior of the process. Certainly, not all stochastic processes behave in this manner, but for those that do the literature concerning their properties is massive. (See [125].) A formal investigation involves rather technical computations involving the conditional expectation of the process based on the information provided by certain σ algebras. We shall only discuss this on an intuitive level. We proceed as in [83]. Let 0 ≤ t ≤ T and ε > 0. We must verify that ∀x ∈ R, P ({ω ∈ Ω : X(t + ε ; ω ) ≤ x} |Ft ) = P ({ω ∈ Ω : X(t + ε ; ω ) ≤ x} |X(t; ω ) ) . (3.154) We need an expression for X(t + ε ; ω ) in terms of X(t; ω ). This follows by integrating (3.73) over the interval (t,t + ε ) , as follows: ˆ t+ε ˆ t+ε X(t + ε ; ω ) = X(t; ω ) + aX(s; ω )ds + cX(s; ω )dW (s), 0 ≤ t ≤ T t
= I1 + I2 + I3 .
t
(3.155)
The question we must address is whether or not the right-hand side of (3.155) depends on any information provided by Ft other than X(t; ω ) itself. To this end, note that certainly the term I1 is fine. (Why?) Also, because the integrand of the term I2 does not extend into the past beyond time t and the integrand is a constant multiple of X(s; ω ), this term depends only on X(t; ω ) itself. Finally, note that term I3 is independent of X0 (ω ) (Why?) and the increments W (t + ε ) − W(t) and W (t) are independent. (Why?) Because the integrand does not depend on X(s; ω ) for 0 < s < t, we can conclude that the right-hand side of (3.155) depends only on information provided by X(t; ω ) itself. As such, we conclude that (3.154) holds. Exercise 3.6.9. Convince yourself that the same holds true for the strong solution of (3.74).
3.7
Some Convergence Results
The notion of continuous dependence on initial data is naturally related to the convergence scheme introduced in this section.
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R For every n ∈ N, consider the IVP ( dXn (t; ω ) = an Xn (t; ω )dt + ∑m k=1 (ck )n Xn (t; ω )dWk (t), Xn (0; ω ) = (X0 )n (ω ), ω ∈ Ω
159
(3.156)
where 0 < t < T, ω ∈ Ω. Assume the following: (H3.4) There exists a ∈ R such that lim |an − a| = 0. n→∞
(H3.5) For every k ∈ {1, . . . , m} , lim |(ck )n − ck | = 0. n→∞
(H3.6) There exists X0 ∈ L20 (Ω; R) such that lim k(X0 )n − X0 kL2 (Ω;R) = 0. n→∞
0
Proposition 3.7.1. If (H3.1) - (H3.6) hold, then lim kXn − XkC([0,T ];L2 (Ω;R)) = 0, n→∞ where X is the strong solution of (3.74). Proof. The strong solutions of (3.74) and (3.156) (for a given n ∈ N) are given by ˆt m ˆ t X(t; ω ) = X0 (ω ) + aX(s; ω )ds + ∑ ck X(s; ω )dWk (s), (3.157) 0
k=1 0
ˆ
t
Xn (t; ω ) = (X0 )n (ω ) + an Xn (s; ω )ds 0 m ˆ t +∑ (ck )n Xn (s; ω )dWk (s).
(3.158)
k=1 0
Let ε > 0. There exists M0 > 0 such that E |X(t; ·)|2 ≤ M0 , ∀t ∈ [0, T ] .
(3.159)
(Why?) Because convergent sequences are bounded, (H3.4) and (H3.5) guarantee the existence of M1 , . . . , Mm+1 > 0 such that |an |2 ≤ M1 , ∀n ∈ N,
(3.160)
2
|(ck )n | ≤ Mk+1 , ∀n ∈ N, k ∈ {1, . . . , m} .
(3.161)
Let η = 2T ∑m+1 k=1 Mk . There exist N1 , . . . , Nm+2 ∈ N such that n ≥ N1 =⇒ |an − a|2 < n ≥ Nk+1 =⇒ n ≥ Nm+2 =⇒
ε2
,
(2T 2 M0 ) (m + 2)η ε2 ,k |(ck )n − ck |2 < (6mT 2 M0 ) (m + 2)η ε2 k(X0 )n − X0k2L2 (Ω;R) < . 0 3(m + 2)η
© 2011 by Taylor & Francis Group, LLC
(3.162) = 1, . . . , m, (3.163) (3.164)
160
Volume 2: Stochastic Equations
Let N = max {N1 , . . . , Nm+2 }. Then, (3.162) through (3.164) hold, ∀n ≥ N . Observe that ˆ t 2 E |Xn (t; ·) − X(t; ·)| = E ((X0 )n − X0 ) + (an Xn (s; ·) − aX(s; ·)) ds 0 m ˆ t +∑ ((ck )n Xn (s; ω ) − ck X(s; ·)) dWk (s) k=1 0 ˆ t ≤ 3 k(X0 )n − X0 k2L2 (Ω;R) + T E |an Xn (s; ·) − aX(s; ·)|2 ds 0 0 # ˆ m
+3mT
∑
k=1 0
t
E |(ck )n Xn (s; ·) − ck X(s; ·)|2 ds .
(3.165)
Using the triangle inequality, together with (3.159), (3.160), and (3.162), yields ˆ t E |an Xn (s; ·) − aX(s; ·)|2 ds ≤ 0 ˆ t E |an Xn (s; ·) − an X(s; ·) + anX(s; ·) − aX(s; ·)|2 ds ≤ (3.166) 0 ˆ t h i 2 |an |2 E |Xn (s; ·) − X(s; ·)|2 + |an − a|2 E |X(s; ·)|2 ds ≤ 0 ˆ t ε2 2M1 E |Xn (s; ·) − X(s; ·)|2 ds + . T (m + 2)η 0 Similarly, using (3.159), (3.161), and (3.163) yields, ∀k ∈ {1, . . . , m} , ˆ t E |(ck )n Xn (s; ·) − ck X(s; ·)|2 ds ≤ 0 ˆ t h i 2 2 |(ck )n | E |Xn (s; ·) − X(s; ·)|2 + |(ck )n − ck |2 E |X(s; ·)|2 ds ≤ (3.167) 0 ˆ t ε2 2Mk+1 E |Xn (s; ·) − X(s; ·)|2 ds + . 3mT (m + 2)η 0 Substituting (3.166) and (3.167) into (3.165) yields !ˆ t m+1 ε2 2 E |Xn (t; ·) − X(t; ·)| < + 2T ∑ Mk E |Xn (s; ·) − X(s; ·)|2 ds. η 0 k=1
(3.168)
As such, applying Gronwall’s Lemma shows that E |Xn (t; ·) − X(t; ·)|2 <
ε 2 (2T ∑m+1 Mk )t k=1 e , 0 ≤ t ≤ T. η
(3.169)
Hence, upon taking the supremum over [0, T ] on both sides of (3.169), we conclude that n ≥ N =⇒ kXn − XkC([0,T ];L2 (Ω;R)) < ε , as needed. This completes the proof.
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
161
Exercise 3.7.1. Argue that ∀0 ≤ t ≤ T , lim µXn (t) = µX (t),
n→∞
lim VarXn (t) = VarX (t).
n→∞
We have introduced noise into linear ODEs and have established the existence and uniqueness of a strong solution of the stochastic IVP, as well as its analytical and statistical properties. We now seek to approximate the stochastic IVP by the original deterministic IVP. Precisely, let 0 < ε < 1 and consider the following two IVPs: ( dXε (t; ω ) = aε Xε (t; ω )dt + ∑m k=1 (ck )ε Xε (t; ω )dWk (t), (3.170) Xε (0; ω ) = X0 (ω ), ω ∈ Ω where 0 < t < T, ω ∈ Ω, and ( dX(t) = aX(t)dt, 0 < t < T, X(0) = X0 .
(3.171)
We intend to compare the solution of the stochastic IVP (3.170) to the solution of the deterministic IVP (3.171), and this requires us to view a deterministic function X(t) as a random variable. This is easily done because a deterministic function is simply a constant random variable in the sense that X(t) ≡ X(t; ω ), ∀ω ∈ Ω. We assume the following: (H3.7) lim |aε − a| = 0, ε →0+
(H3.8) For every k ∈ {1, . . . , m} , lim (ck )ε = 0. ε →0+
We proceed in basically the same manner as in the previous convergence argument to prove the following result. Proposition 3.7.2. Let p > 2 and Xε and X be the strong solutions of (3.170) and (3.171), respectively. Then, ∃ζ > 0 and a function ψ : I ⊂ [0, 1] −→ (0, ∞) for which lim ψ (ε ) = 0 and ε →0+
E |Xε (t; ·) − X(t)| p ≤ ζ ψ (ε ),
(3.172)
∀0 ≤ t ≤ T and ε > 0 sufficiently small. (That is, lim kXε − XkC([0,T ];L p (Ω;R)) = 0.) ε →0+
Exercise 3.7.2. Prove Prop. 3.7.2. As expected, as the noise term diminishes, the noise has less impact on the solution process and so, in the limit, the solution process tends to resemble the deterministic case.
© 2011 by Taylor & Francis Group, LLC
162
3.8
Volume 2: Stochastic Equations
A Brief Look at Stability
There are several different notions of stability, which is reasonable because there are various notions of convergence (cf. Def. 2.3.5). Some natural questions are: 1. If the solution of a deterministic IVP behaves in a certain manner, what natural conditions can be imposed on the stochastic terms to ensure that the same result holds in the presence of noise? 2. What are the relationships among the different notions of stability? Entire volumes are devoted to this subject. (See [105, 139, 161, 267, 268, 285, 414].) We only explore a few ideas to introduce the topic. Consider (3.74) on [0, ∞), together with the IVP ( dY (t; ω ) = aY (t; ω )dt + ∑m k=1 ckY (t; ω )dWk (t), 0 < t < T, ω ∈ Ω, (3.173) Y (0; ω ) = Y0 (ω ), ω ∈ Ω. Definition 3.8.1. A strong solution of (3.74) is said to be i.) asymptotically exponentially pth moment stable (p ≥ 2) if ∃ζ , λ > 0 such that for any strong solution of (3.173), E |X(t; ·) − Y (t; ·)| p ≤ ζ e−λ t E |X0 (·) − Y0(·)| p , ∀t ≥ 0.
(3.174)
ii.) almost surely exponentially stable if ∃λ > 0 such that for any solution Y of (3.173), 1 lim log |X(t; ω ) − Y (t; ω )| ≤ −λ a.s. [P] , (3.175) t→∞ t or equivalently, |X(t; ω ) − Y (t; ω )| ≤ e−λ t , ∀t ≥ 0, a.s. [P] .
(3.176)
Here, −λ is called the Lyapunov exponent. In particular, for Y0 (·) = 0, Y ≡ 0 is the so-called equilibrium solution of (3.173) and Def. 3.8.1 can be interpretted directly for this solution. An extensive discussion of stability can be found in [20, 285, 414]. Remarks. 1. Definition 3.8.1(i) is given in terms of a deterministic function (namely, the pth moments), while Def. 3.8.1 (ii) governs the behavior of the sample paths. 2. The Lyapunov exponent λ is significant because it is the rate of exponential decay (when λ < 0) of sample paths of the solution process to the equilibrium position.
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
163
For simplicity, consider (3.73). The pth -moments are given by 2 2 p c c2 t p a− 2 + 2 p
E |X(t; ·)| p = E |X0 (·)| e
.
(3.177)
Computing the pth -moment of the difference between (3.73) and the strong solution of the version of (3.173) where cY (t; ω )dW (t) is in place of ∑m k=1 ckY (t; ω )dWk (t) yields p
p
E |X(t; ·) − Y (t; ·)| = E |X0 (·) − Y0 (·)| e
2 2 2 p a− c2 + p 2c t
.
(3.178)
(Why?) As such, a necessary and sufficient condition to ensure that the strong solution of (3.73) satisfies Def. 3.8.1 (i) is that p 2 c2 c2 + < 0. (3.179) p a− 2 2 Note that when c = 0 (that is, the deterministic case), (3.179) simplifies to a < 0, which is exactly what you would expect. (Why?) Exercise 3.8.1. Determine a condition like (3.179) that guarantees that the strong solution of (3.74) satisfies Def. 3.8.1(i). Exercise 3.8.2. For given values of a and c, does ∃p0 ∈ N such that (3.179) does not hold for p ≥ p0 . This would imply that some moments are stable (in the sense of Def. 3.8.1(i)), while others are not. The notion of robustness with respect to perturbation in important in applications. Precisely, consider (3.73) and the following perturbed variant: dZ(t; ω ) = [aZ(t; ω )dt + cZ(t; ω )dW (t)] (3.180) + [a⋆ Z(t; ω )dt + c⋆Z(t; ω )dW (t)] , 0 < t < T, ω ∈ Ω, Z(0; ω ) = Z0 (ω ), ω ∈ Ω.
Assume that condition (3.179) holds. For a given p ∈ N, we would like to determine which perturbations of (3.73) remain asymptotically exponentially pth -moment stable. This requires that we determine when the strong solution of (3.180) satisfies Def. 3.8.1 (i). This is easily done because (3.180) is equivalent to the IVP ( dZ(t; ω ) = (a + a⋆) Z(t; ω )dt + (c + c⋆) Z(t; ω )dW (t), (3.181) Z(0; ω ) = Z0 (ω ), ω ∈ Ω where 0 < t < T, ω ∈ Ω. Arguing as above reveals that a necessary and sufficient condition for this to occur is ! p2 (c + c⋆)2 (c + c⋆ )2 ⋆ + < 0. (3.182) p (a + a ) − 2 2
© 2011 by Taylor & Francis Group, LLC
164
Volume 2: Stochastic Equations
How do we interpret this condition? For the moment, assume that c⋆ = 0. Then, condition (3.182) simplifies to c2 p 2 c2 + +pa⋆ < 0. (3.183) p a− 2 2 {z } | <0 by assumption
As such, a⋆ can be any value for which the sum of pa⋆ and the expression in (3.179) remains negative. That is, a⋆ satisfies 2 2 2 p a − c2 + p 2c . a⋆ < − (3.184) p
The interpretation when c⋆ 6= 0 is more involved to treat analytically. But, for given values of p, a, and c, it suffices to consider the surface defined by z = the left-hand side of (3.182) and determine the subset of the a⋆ c⋆ -plane in which the surface lies below the a⋆ c⋆ -plane. Exercise 3.8.3. Establish such a robustness result for (3.74). Finally, we consider Def. 3.8.1 (ii). Recall that the formula for the strong solution of (3.73) is given by 1 2 X(t; ω ) = X0 (ω )e((a− 2 c )t+cW (t)) .
(3.185)
Taking the absolute value on both sides of (3.185), followed by taking the log, yields 1 2 log |X(t; ω )| = log |X0 (ω )| + a − c t + cW (t). (3.186) 2 Dividing both sides of (3.186) by t > 0 and using the Law of Large Numbers results in a − 21 c2 t log |X(t; ω )| log |X0 ω )| cW (t) lim = lim + lim + lim t→∞ t→∞ t→∞ t→∞ t | {z t } | {z t } | {z t } =0
1 = a − c2 a.s. [P]. 2
= (a− 21 c2 )
=0
(3.187)
As such, the strong solution of (3.73) is almost surely exponentially stable if a − 21 c2 < 0. Exercise 3.8.4. Derive such a condition for the almost surely exponential stability of the strong solution of (3.74).
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
165
Exercise 3.8.5. Investigate the robustness of this type of stability. Exercise 3.8.6. Prove that if the strong solution of (3.73) is asymptotically exponentially pth -moment stable, then it is almost surely exponentially stable, but not conversely in general.
3.9
A Classical Example
Presently, we consider a classical example of an SDE arising in physics. The theory presented in this chapter can be applied directly. Example 3.9.1. (The Ornstein-Uhlenbeck Process) Consider a particle that moves through space merely under the influence of friction. Its position and velocity functions are naturally vector-valued. For simplicity, we consider a single component of each of these vectors, denoted by s(t; ω ) and v(t; ω ). Assuming that the acceleration is subject to white noise dW dt , Ornstein and Uhlenbeck [285] formulated the following system of SDEs governing the motion of such a particle: ( dv(t; ω ) = −α v(t; ω )dt + β dW(t), t > 0, ω ∈ Ω, (3.188) v(0; ω ) = v0 (ω ), ω ∈ Ω, ( ds(t; ω ) = v(t; ω )dt, t > 0, ω ∈ Ω, (3.189) s(0; ω ) = s0 (ω ), ω ∈ Ω, where α > 0, β ∈ R, and s0 (·) and v0 (·) are F0 -measurable members of L2 (Ω; R) that are normally distributed. Exercise 3.9.1. i.) Derive a representation formula for the strong solution of (3.188). ii.) Solve (3.189). Write down its representation formula using (i). iii.) Argue that both {v(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} and {s(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} are Gaussian processes. iv.) Calculate the following: µv (t), µs (t), Varv (t), and Vars (t). v.) Derive the pth -moments for (3.188) and (3.189) directly using the representation formula from (i).
© 2011 by Taylor & Francis Group, LLC
166
3.10
Volume 2: Stochastic Equations
Looking Ahead
Armed with some rudimentary tools of stochastic analysis, we are ready to embark on our journey through the world of stochastic evolution equations. We will begin by investigating some models whose mathematical description involves an extension of (3.1) to vector form. Specifically, it is natural to ask what is meant by a strong solution of the stochastic IVP: ( dX dt (t; ω ) = AX(t; ω ), 0 < t < T, ω ∈ Ω, (3.190) X(0; ω ) = X0 (ω ), ω ∈ Ω,
X1 (t; ω ) .. where X(t; ω ) = and A ∈ MN (R). It is tempting to write X(t; ω ) = .
XN (t; ω ) eAt X0 (ω ), but what does this really mean? What are its properties? More generally, if we introduce randomness by means of white noise, the stochastic IVP ( dX(t; ω ) = AX(t; ω )dt + CX(t; ω )dW (t), 0 < t < T, ω ∈ Ω, (3.191) X(0; ω ) = X0 (ω ), ω ∈ Ω, arises. Interpreting this IVP requires that we broaden our definition of the Itó integral, to say the least. We address these questions and much more in Chapter 4.
3.11 3.11.1
Guidance for Selected Exercises Level 1: A Nudge in a Right Direction
3.1.4. Integrate both sides of (3.5) corresponding to each initial condition. (Now what?) 3.1.5. Consider integrated versions of (3.6) and proceed as in Exer. 3.1.4. 3.2.1. Use the fact that c ∈ L2 (Ω; [0, ∞)). 3.2.2. Use the fact that U is a linear space. (So what?) 3.2.3. Use Step 3 of the building block process. 3.2.4. (i) f is continuous on a compact set. (So what?) Also, use Prop. 3.2.1(iv) and (vi)(a). (How?) (ii) Use the upper bound from (i). (iii) Use the upper bound from (ii). 3.2.5. (i) Use the Cauchy-Schwarz inequality for (i) and triangle inequality for (ii). (ii) Apply Prop. 3.2.1(viii) with g(x) = 1. 3.2.9. (i) You must be careful because the step functions u and v need not be defined
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
167
in terms of characteristic functions using the same partition of [0,t] . Let 0 = t0 < t1 < . . . < tm−1 < tm = t and 0 = t0 < t1 < . . . < tn−1 < tn = t be partitions of [0,t] ,and {bi : i = 1, . . . , n} ∪ {ci : i = 1, . . . , m} ⊂ L2 (Ω; [0, ∞)) be Fti -adapted. Define u, v : [0,t] × Ω −→ [0, ∞) by m
u(s; ω ) =
∑ ci (ω )χ[ti−1 ,ti ) (s),
i=1 n
v(s; ω ) =
∑ b j (ω )χ[t j−1 ,t j ) (s).
j=1
Then,
m
n
(u + v)(s; ω ) = ∑ ∑ (ci (ω ) + b j (ω )) χ[ti−1 ,ti )∩[t j−1 ,t j ) (s). i=1 j=1
Also, note that constant multiples do not affect the partitions used to define a step function. (Now what?) (ii) Apply additivity to each member of the sum. Then, pull apart. (Now what?) (iii) Use the linearity of E [·] with the analogous property established in Step 1 of the discussion. (iv) Note that W (t j ) − W t j−1 is independent of ci (·) c j (·) (W (ti ) − W (ti−1 )) for all i < j. (Why?) So, E
ˆ
0
T
2 u(s; ·)dW (s) = =
m
n
∑∑E
i=1 j=1 h m
∑E
i=1
ci (·) c j (·) (W (ti ) − W (ti−1 )) W (t j ) − W t j−1
i c2i (·) (W (ti ) − W (ti−1 ))2 .
(Now what?) (v) (a) The sum of Ft -measurable functions is Ft -measurable. Moreover, each term in the sum is Ft -measurable. (b) Apply on the subintervals of the partition used to define the step function. (Then what?) (c) The sum of functions that are continuous a.s. [P] is again continuous a.s. [P]. (d) Use Exer. 2.5.7 to conclude that the sum in normal. (Why can this be applied?) 3.2.11. Because the sum of Ft -measurable random variables is again Ft -measurable, it suffices to argue that each of the three terms on the right-hand side of (3.42) is Ft measurable. First, Y0 is F0 -measurable and F0 ⊂ Ft , ∀t. (So what? How about the other two terms?) 3.2.13. (i) ∂∂ ht = 0, ∂∂xh = x2 , ∂∂xh = x1 . (How about the second partials?) 1 2 1 (ii) d (X1 (t)X2 (t)) = X2 dX1 + X1dX2 + [dX1 dX2 + dX2 dX1 ] |2 {z } =dX1 dX2 ∂h ∂t =
3.2.14. Use h(t, x) = ln x in (3.49). Observe that
© 2011 by Taylor & Francis Group, LLC
0,
∂h ∂x
= 1x ,
∂ 2h ∂ x2
= − x12 . Now,
168
Volume 2: Stochastic Equations
compute d [ln X(t)] . 3.2.15. (i) Use h(t, x) = e−At x. Use Itó’s formula to show that d e−At X(t; ω ) = ε e−At dW (t).
(ii) Observe that
e
−At
X(t; ω ) − X0(ω ) =
and so At
X(t; ω ) = X0 (ω )e + ε
t
ˆ
ε e−As dW (s),
0
ˆ
t
e−A(t−s) dW (s).
0
3.4.1. kX0 kL2 , T, a, ck (k = 1, . . . .m), and m 3.4.2. The process is essentially identical to the one used in (3.125) and (3.126). You need only determine how the specific terms on the right-hand side of (3.126) change. 3.5.1. Use (3.128) directly. (How?) 3.5.2. Add and subtract a⋆ X(t; ·) in (3.129). Separate the terms appropriately. What do you need in order to be able to apply Gronwall’s Lemma? 3.6.3. (i) Use the integration by parts formula to see that d (X(t; ·)X(t; ·)) = 2X(t; ·)d(X(t; ·)) + (d(X(t; ·)))2 = 2X(t; ·) (aX(t; ·)dt + cX(t; ·)dW (t)) + (aX(t; ·)dt + cX(t; ·)dW (t))2 .
Now, continue simplifying. 3.6.6. Use Itó’s formula with h(t, x) = x p . Argue as in Prop. 3.6.1. 3.7.2. Use the representation formulae for the solutions rather than the integrated forms of the IVPs. 2 2 2 2 2 3.8.6. We know that p a − c2 + p 2c < 0. Since p 2c > 0, we see that c2 c2 p 2 c2 p a− ≤ p a− + < 0. 2 2 2
You can construct a counterexample to show that the reverse implication does not hold simply by choosing appropriate ´ t values for a, p, c. (Tell how.) 3.9.1. (i) v(t; ω ) = e−α t v0 (ω ) + β 0 e−α (t−s) dW(s). ´t (ii) s(t; ω ) = α1 (1 − e−α t ) v0 (ω ) + s0 (ω ) + αβ 0 1 − e−α (t−s)dW (s) (iv) µv (t) = e−α t E [v0 (·)] , µs (t) = β2
Vars (t) = e−2α t Var [v0 (·)] + 2α
3.11.2
(1 − e−α t ) E [v0 (·)] + E [s0 (·)] , and 1 − e−2α t .
1 α
Level 2: An Additional Thrust in a Right Direction
3.1.4. Use Gronwall’s Lemma. (How?) 3.2.4. (i) ∃M ⋆ > 0 such that | f (x)| ≤ M ⋆ , ∀x ∈ [a, b] . One natural upper bound for the given set is ζ = M ⋆ + (b − a) (M1 M ⋆⋆ + M2 ) ,
© 2011 by Taylor & Francis Group, LLC
Linear Homogenous Stochastic Evolution Equations in R
169
where M ⋆⋆ = sup {|u(z)| : z ∈ [a, b]} . (Verify this.) (ii) ζ N (Why?) (iii) ζ N (b − a) (Why?) 3.2.9. (i) Now, apply the linearity of a finite sum and regroup the terms of u and v. (iv) Continue the previous string of equalities as follows: m
... =
∑E
i=1
=E =
ˆ
"
0
m
∑
i h c2i (·) E (W (ti ) − W (ti−1 ))2 #
c2i (·) (ti − ti−1 )
i=1 T
E u2 (s; ·) ds
(v) (b) Now, use linearity of E [·| · ·] with the property from Step 1. (d) The increments on the right-hand side are independent and each term is normal by the definition of W (·). ´t 3.2.11. Because u1 (t) is Ft -measurable, it follows immediately that 0 u1 (s; ω )ds is ´t Ft -measurable. Also, 0 u2 (s; ω )dW (s) is Ft -measurable by Prop. 3.2.3(v)(a). This completes the proof. 2 2 2 2 3.2.13. (i) ∂∂ xh2 = ∂∂ x2h = 0, ∂ x∂ ∂hx = 1 = ∂ x∂ ∂hx 1
2
1
2
2
1
3.2.14. Observe that 1 1 1 d [ln X(t; ω )] = 0dt + dX(t; ω ) + − 2 (dX(t; ω ))2 X(t; ω ) 2 X (t; ω ) . = .. 1 = A − B2 dt + BdW. 2 (We will revisit this problem later in the chapter.) 1 m 2 m 3.4.2. The formula is X(t; ω ) = eat X0 (ω )e− 2 ∑k=1 ck t+∑k=1 ckWk (t) . ε 3.5.1. We need kX0 − Y0 k2L2 (Ω;R) < 3T 2 a2 +m . (Why?) c2 ∑m k=1 k ) 3e ( 3.5.2. You will need E |X(t; ·)|2 ≤ C, ∀0 ≤ t ≤ T . (Why? Now what?) x 3.6.6. Note that ∂∂ hx = p |x| p−1 |x| .
© 2011 by Taylor & Francis Group, LLC
Chapter 4 Homogenous Linear Stochastic N Evolution Equations in R
Overview The question of how phenomena evolve over time is central to a broad range of fields within the social, natural, and physical sciences. The behavior of such phenomena is governed by established laws of the underlying field that typically describe the rates at which it and related quantities evolve over time. The measurement of all parameters is subject to noise. As such, a precise mathematical description involves the formulation of so-called stochastic evolution equations whose complexity depends to a large extent on the realism of the model. We focus in this chapter on models in which the evolution equation is generated by a system of ordinary differential equations with finitely many independent sources of multiplicative noise. We are in search of an abstract paradigm into which all of these models are subsumed as special cases. Once established, we will study the rudimentary properties of the abstract paradigm and subsequently apply the results to each model. Some standard references used throughout this chapter are [11, 62, 178, 193, 244, 251, 287, 302, 318, 333, 375, 397, 399].
4.1
Motivation by Models
Throughout this chapter, the formulation of all models begins with a complete probability space (Ω, F , P) equipped with a natural filtration {Ft : t ≥ 0} to which all Wiener processes are adapted. We motivate the theoretical development presented in this chapter with a discussion of some elementary models. Model I.1 Chemical Kinetics Chemical substances are transformed via a sequence of reactions into other products. The use of stochastic differential equations facilitates the understanding the chemical kinetics of such reactions. (See [59, 72, 128, 270, 303, 390, 391].) For instance, α1 consider a first-order reaction Y −→ Z in which a substance Y, whose concentration 171 © 2011 by Taylor & Francis Group, LLC
172
Volume 2: Stochastic Equations
at time t is denoted by [Y ] (t), is transformed into a product Z at a rate α1 . The rate at which [Y ] (t) reacts and is converted into Z is described by an initial-value problem. We first assume that noise is introduced via the initial data only in the sense that we assume that the initial concentration [Y ]0 is an F0 -measurable random variable with E |[Y ]0 |2 < ∞. Doing this automatically renders both [Y ] (t) and [Z] (t) as stochastic processes. For each fixed ω ∈ Ω, the random IVP governing this scenario is given by d[Y ](t;ω ) = −α1 [Y ] (t; ω ), t > 0, ω ∈ Ω, dt d[Z](t;ω ) (4.1) = α1 [Z] (t; ω ), t > 0, ω ∈ Ω, dt [Y ] (0; ω ) = [Y ]0 (ω ), [Z] (0; ω ) = 0, ω ∈ Ω. The system (4.1) is easily converted into the equivalent matrix form: " #′ " #" # [Y ] (t; ω ) − α 0 [Y ] (t; ω ) 1 = , t > 0, ω ∈ Ω, [Z] (t; ω ) [Z] (t; ω ) 0 α1 " # " # [Y ]0 (ω ) [Y ] (0; ω ) = , ω ∈ Ω. [Z] (0; ω ) 0
(4.2)
For a given ω ∈ Ω, (4.2) can be treated as in the deterministic case using the matrix exponential. We will revisit this in the next section. A more interesting manner in which noise can be introduced into the model is in the measurement of the rate constant α1 . This parameter is measured experimentally and, hence, is subject to randomness. Precisely, we assume that
α1 = α1 + α2
dW (t) , dt
(4.3)
where dWdt(t) formally represents a white noise process (cf. Section 2.9.3). Formally substituting (4.3) into (4.2) and rewriting the equation in differential form yields the following stochastic IVP: d [Y ] (t; ω ) = −α1 [Y ] (t; ω )dt − α2 [Y ] (t; ω )dW (t), t > 0, ω ∈ Ω, (4.4) d [Z] (t; ω ) = α1 [Z] (t; ω )dt + α2 [Z] (t; ω )dW (t), t > 0, ω ∈ Ω, [Y ] (0; ω ) = [Y ]0 (ω ), [Z] (0; ω ) = 0, ω ∈ Ω,
where [Y ]0 (·) is independent of {W (t) : 0 ≤ t ≤ T } . We would like to write (4.4) in an equivalent matrix form similar to (4.2). Here, the natural approach is to mimic how the right-hand side of (4.2) is formulated. Doing so yields " # " #" # [Y ] (t; ω ) − α 0 [Y ] (t; ω ) 1 d = dt [Z] (t; ω ) 0 α1 [Z] (t; ω ) " #" # −α2 0 [Y ] (t; ω ) + dW (t), t > 0, ω ∈ Ω, (4.5) 0 α2 [Z] (t; ω ) " # " # [Y ]0 (ω ) [Y ] (0; ω ) = , ω ∈ Ω. [Z] (0; ω ) 0 © 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
173
(Check this!) α
β
A related reversible reaction Y −→ Z, Y ←− Z in which part of the product resulting from the forward reaction is converted back into the original substance at a certain rate can also be considered. Suppose that both parameters α and β are modeled as white noise processes, say dW1 (t) , dt dW2 (t) β = β1 + β2 , dt
α = α1 + α2
(4.6) (4.7)
where {W1 (t) : 0 ≤ t ≤ T } and {W2 (t) : 0 ≤ t ≤ T } are independent, real-valued Wiener processes. The resulting stochastic IVP is given by d [Y ] (t; ω ) = −α1 [Y ] (t; ω ) + β1 [Z] (t; ω ) dt − α2 [Y ] (t; ω )dW1 (t) +β2 [Z] (t;ω )dW2 (t), t > 0, ω ∈ Ω, (4.8) d [Z] (t; ω ) = α1 [Y ] (t; ω ) − β1 [Z] (t; ω ) dt + α2 [Y ] (t; ω )dW1 (t) −β2 [Z] (t; ω )dW2 (t), t > 0, ω ∈ Ω, [Y ] (0; ω ) = [Y ]0 (ω ), [Z] (0; ω ) = [Z]0 (ω ), ω ∈ Ω,
where both random variables [Y ]0 (·) and [Z]0 (·) are F0 -measurable with finite second moments and are independent of the Wiener processes {W1 (t) : 0 ≤ t ≤ T } and {W2 (t) : 0 ≤ t ≤ T }. We want to express (4.8) in an equivalent matrix form, but the right-hand sides of the SDEs in IVP (4.8) are more complicated than those appearing in (4.4). How do we proceed? When converting (4.4) into (4.5), we inserted “zero place holders” without deliberately announcing as much. Doing so enabled us to formally define a [Y ] (t; ω ) second coefficient matrix that, when multiplied by the solution process [Z] (t; ω ) and then by dW (t), accurately captured all of the noise terms. We shall proceed in the same manner for both equations in (4.8) and then appropriately combine them. To this end, observe that for every t > 0, ω ∈ Ω, d [Y ] (t; ω ) = −α1 [Y ] (t; ω ) + β1 [Z] (t; ω ) dt +(−α2 [Y ] (t; ω ) + 0 [Z] (t; ω )) dW1 (t) + 0 [Y ] (t; ω ) + β2 [Z] (t; ω ) dW2 (t), (4.9) d [Z] (t; ω ) = α1 [Y ] (t; ω ) − β1 [Z] (t; ω ) dt + (α2 [Y ] (t; ω ) + 0 [Z] (t; ω )) dW1 (t) + 0 [Y ] (t; ω ) − β2 [Z] (t; ω ) dW2 (t). (4.10) Now, gather all the dW1 (t) terms together. We apply the same approach used to formulate the matrix version of (4.4) to obtain the matrix expression −α2 0 [Y ] (t; ω ) −α2 [Y ] (t; ω )dW1 (t) dW1 (t) = . (4.11) α2 0 [Z] (t; ω ) α2 [Y ] (t; ω )dW1 (t)
© 2011 by Taylor & Francis Group, LLC
174
Volume 2: Stochastic Equations
Similarly, we have [Y ] (t; ω ) β2 [Z] (t; ω )dW2 (t) 0 β2 dW2 (t) = . [Z] (t; ω ) 0 −β2 −β2 [Z] (t; ω )dW2 (t) Moreover, observe that −α2 0 [Y ] (t; ω ) 0 β2 [Y ] (t; ω ) dW1 (t) + dW2 (t) α2 0 [Z] (t; ω ) [Z] (t; ω ) 0 −β2 −α2 [Y ] (t; ω )dW1 (t) + β2 [Z] (t; ω )dW2 (t) = . α2 [Y ] (t; ω )dW1 (t) − β2 [Z] (t; ω )dW2 (t) As such, we can write (4.8) in the equivalent matrix form: " #" # " # ω ) − α β [Y ] (t; ω ) [Y ] (t; 1 1 d = dt [Z] (t; ω ) α1 −β1 "[Z] (t; ω#) " # " # #" 0 β2 −α2 0 [Y ] (t; ω ) [Y ] (t; ω ) dW1 (t) + dW2 (t), + α2 0 [Z] (t; ω ) 0 −β2 [Z] (t; ω ) " # # " [Y ]0 (ω ) [Y ] (0; ω ) , ω ∈ Ω, [Z] (0; ω ) = 0
(4.12)
(4.13) (4.14)
(4.15)
where t > 0, ω ∈ Ω. What are the concentrations of both substances at time t, and do they approach an equilibrium state as t → ∞? Model II.1 Pharmacokinetics The field of pharmacokinetics is concerned with studying the evolution of a substance (e.g., drugs, toxins, nutrients) administered to a living organism (by consumption, inhalation, absorption, etc.) and its effects on the organism. Models can be formed by partitioning portions of the organism into compartments, each of which is treated as a single unit; improvements of these models can be made by refining the compartments in various ways. We consider a rudimentary model motivated by the work discussed in [120, 309]. Let a = absorption rate into the bloodstream, b = rate at which the drug is eliminated from the blood. As in Model I.1, we introduce noise into both of these parameters by assuming that dW1 (t) , dt dW2 (t) b = b1 + b2 , dt where ai , bi > 0 (i = 1, 2), and {W1 (t) : 0 ≤ t ≤ T } and {W2 (t) : 0 ≤ t ≤ T } are independent real-valued Wiener processes. Further, let a = a1 + a2
y(t; ω ) = concentration of the drug in the GI tract, z(t; ω ) = concentration of the drug in the blood,
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
175
and assume that y0 ∈ L2 (Ω; R) is independent of both Wiener processes. The following system is obtained based on an elementary “rate in minus rate out” model: dy(t; ω ) = −a1 y(t; ω )dt − a2 y(t; ω )dW1 (t), dz(t; ω ) = (a y(t; ω ) − b z(t; ω )) dt + a y(t; ω )dW (t) 1 1 2 1 (4.16) −b2 z(t; ω )dW2 (t), y(0; ω ) = y0 (ω ), z(0; ω ) = 0, ω ∈ Ω, where t > 0, ω ∈ Ω.
Exercise 4.1.1. Reformulate (4.16) in an equivalent matrix form similar to (4.15). We can further assume that the measurement of the parameter a is subject to two independent sources of noise, say a = a1 + a2
dW1 (t) dW3 (t) + a3 , dt dt
(4.17)
where {W1 (t) : 0 ≤ t ≤ T }, {W2 (t) : 0 ≤ t ≤ T } , and {W3 (t) : 0 ≤ t ≤ T } are independent, and the initial condition y0 (·) is independent of all three Wiener processes. Doing so gives rise to the following modification of (4.16): dy(t; ω ) = −a1 y(t; ω )dt − a2y(t; ω )dW1 (t) − a3y(t; ω )dW3 (t), dz(t; ω ) = (a y(t; ω ) − b z(t; ω )) dt + a y(t; ω )dW (t) 1 1 2 1 (4.18) +a y(t; ω )dW (t), −b z(t; ω )dW (t), 3 3 2 2 y(0; ω ) = y0 (ω ), z(0; ω ) = 0,
where t > 0 and ω ∈ Ω. As before, it is desirable to write (4.18) in an equivalent matrix form, but this time we must account for an R3 -valued Wiener process W(t) = hW1 (t),W2 (t),W3 (t)i . Exercise 4.1.2. Rewrite (4.18) in an equivalent matrix form similar to (4.15). At what time is a certain level of the substance reached within each compartment in the body? When is the substance concentration among different compartments in equilibrium? What happens if our measurements of the parameters or the initial condition y0 are a little off; are the resulting solutions drastically different? Model III.1 Spring-Mass Systems A second-order ordinary differential equation (ODE) describing the position x(t) at time t of a mass m attached to an oscillating spring with spring constant k with respect to an equilibrium position can be derived using Newton’s second law. Initially, let us assume that the movement of the mass is one-dimensional and that there is no damping factor or external driving force. Assuming that the initial data are random
© 2011 by Taylor & Francis Group, LLC
176
Volume 2: Stochastic Equations
variables and that this is the only source of noise being introduced into the model, Hooke’s law describes the force acting on the spring, resulting in the stochastic IVP: ( 2 d x (t; ω ) + α 2 x(t; ω ) = 0, t > 0, ω ∈ Ω, dt 2 (4.19) x(0; ω ) = x0 (ω ), dx dt (0; ω ) = x1 (ω ), ω ∈ Ω. Here, α 2 = mk , x0 (·) is the initial position of the mass with respect to the equilibrium, and x1 (·) is the initial speed. Both x0 (·) and x1 (·) are assumed to belong to L2 (Ω; R) . This is the most basic example of a stochastic harmonic oscillator. (See [144, 170].) This IVP can be converted into a system of first-order random ODEs by way of the change of variable ( ( dy dx y = x, dt = dt = z so that (4.20) dz d2 x 2 2 z = dx dt dt = dt2 = −α x = −α y. Then, (4.20) can be written in the equivalent matrix form: " # " # #" 0 1 y(t; y(t; ω ) ω ) d , t > 0, ω ∈ Ω, dt z(t; ω ) = −α 2 0 z(t; ω ) " # " # y(0; ω ) x0 (ω ) z(0; ω ) = x (ω ) , ω ∈ Ω.
(4.21)
1
Certainly, z(t; ω ) is redundant (Why?), but this transformation is useful because it enables us to consider a second-order random ODE in the same form as the previous two models. As before, IVP (4.21) can be handled using the deterministic theory. We now go one step further and assume that dW (t) . (4.22) dt (Actually, a more realistic stochastic spring mass system is obtained by introducing noise via an external driving force. This will be explored in Chapter 5.) Substituting (4.22) into (4.19) yields the equation
α 2 = (α1 )2 + (α2 )2
d 2x dW (t) (t; ω ) + (α1 )2 x(t; ω ) = − (α2 )2 x(t; ω ) ,t > 0, ω ∈ Ω. 2 dt dt Performing a similar change of variable, we see that dy ( dx dt = dt = z y = x, 2x 2 dz d so that x − (α2 )2 |{z} x dW dt = dt2 = − (α1 ) |{z} dt . z = dx dt =y
(4.24)
=y
Hence, converting (4.23) to differential form yields dy(t; ω ) = z(t; ω )dt, t > 0, ω ∈ Ω, dz(t; ω ) = − (α1 )2 y(t; ω )dt − (α2 )2 y(t; ω )dW, t > 0, ω ∈ Ω, y(0; ω ) = x0 (ω ), z(0; ω ) = x1 (ω ), ω ∈ Ω. © 2011 by Taylor & Francis Group, LLC
(4.23)
(4.25)
Homogenous Linear Stochastic Evolution Equations in RN Inserting “zero place holders” then yields (0y + z) dt + (0y+ 0z)dW, dy =
dz = − (α1 )2 y + 0z dt + − (α2 )2 y + 0z dW,
y(0) = x , z(0) = x . 0 1
177
(4.26)
(Note that we have suppressed the dependence on t and ω in (4.26).) Subsequently, this results in the following matrix form: " # " #" # y(t; ω ) y(t; ω ) 0 1 d = dt dt z(t; ω ) z(t; ω ) − (α1 )2 0 " # " # y(t; ω ) 0 1 dW (t),t > 0, ω ∈ Ω, (4.27) + 2 z(t; ω ) − (α2 ) 0 " # " # x0 (ω ) y(0; ω ) = , ω ∈ Ω. z(0; ω ) x (ω ) 1
Remark. The trick of converting a higher-order SDE into a system of first-order SDEs is very useful and arises in the study of several different models, such as wave equations and equations governing the dynamics of beams.
Next, consider the scenario in which there are two springs, one to which a mass mA is affixed and the other to which a mass mB is attached. One of these springs is fastened to the mass of the other to form a system of coupled springs. The deterministic IVP governing the positions xA (t) and xB (t) of the masses mA and mB , respectively, with respect to the equilibrium state is given by mA x′′A (t) + (kA + kB ) xA (t) + kAxB (t) = 0, t > 0, m x′′ (t) − k x (t) + k x (t) = 0, t > 0, B B B A B B (4.28) ′ xA (0) = x0,A , xA (0) = x1,A , xB (0) = x0,B , x′B (0) = x1,B . Exercise 4.1.3. Formulate a random version of (4.28) analogous to (4.19) by introducing noise via the initial data. Then, convert the resulting system to an equivalent matrix form. Exercise 4.1.4. Suppose that dW1 , dt dW2 kB = kB⋆ + kB , dt kA = kA⋆ + kA
(4.29) (4.30)
where {W1 (t) : 0 ≤ t ≤ T } and {W2 (t) : 0 ≤ t ≤ T } are independent Wiener processes, and all the initial conditions are independent of both Wiener processes. Incorporate (4.29) and (4.30) into (4.28) to obtain a system of second-order SDEs. Then,
© 2011 by Taylor & Francis Group, LLC
178
Volume 2: Stochastic Equations
convert this into a first-order system. Common Theme: Although these applications arise in vastly different contexts, the nature of the IVPs used to describe the scenarios and the questions posed are strikingly similar. We encountered two different types of stochastic systems. The simpler of the two is when the noise is incorporated into the model only via the initial conditions. Such an IVP can be written compactly in vector form as ( U′ (t; ω ) = AU(t; ω ), t > 0, ω ∈ Ω, (4.31) U(0; ω ) = U0 (ω ), ω ∈ Ω, where U : [0, ∞) × Ω → RN is the solution stochastic process, A is an N × N constant matrix, and U0 ∈ L2 Ω; RN is the vector containing the initial conditions. It would be efficient to initially focus our attention on the abstract IVP (4.31) and answer as many rudimentary questions as possible regarding existence and uniqueness of a solution, continuous dependence of the solutions with respect to initial data, etc. Then, in turn, we could apply those results to any model that could be viewed as a special case of (4.31). In analogy with the first-order case, ∀ω ∈ Ω, we can treat (4.31) as a deterministic ODE and apply the theory of homogenous linear systems developed in [295] and outlined in Section 3.2. Indeed, we expect the solution process of (4.31) to be U(t; ω ) = eAt U0 (ω ), a.s. [P], where eAt is the matrix exponential. For such an IVP, a complete theory already has been developed and can be applied directly with the caveat that all statements hold a.s. [P]. The stochastic systems formed by introducing white noise processes into the description of the parameters is more involved, but still resembles (3.73) and (3.74). Specifically, all these IVPs can be written in the matrix form ( dU(t; ω ) = AU(t; ω )dt + ∑m k=1 Bk U(t; ω )dWk (t), t > 0, ω ∈ Ω, (4.32) U(0; ω ) = U0 (ω ), ω ∈ Ω, where U : [0, ∞)×Ω → RN is the solution stochastic process; A, B1 , . . . , Bm are N ×N constant matrices; {Wi (t) : 0 ≤ t≤ T }, i = 1, . . . , m are independent R-valued Wiener processes; and U0 ∈ L2 Ω; RN is an F0 -measurable random variable independent of {Wi (t) : 0 ≤ t ≤ T }, i = 1, . . . , m. The striking similarity between (4.32) and (3.74) suggests that the matrix exponential might be of some utility. And it is, but not without certain restrictions. It is reasonable to expect that the theory should be able to be extended from the one-dimensional case to the N-dimensional setting without tremendous difficulty, just as in the deterministic theory, due to the structural properties of RN and the matrix exponential. Performing this generalization requires that we understand how to work with the matrix exponential and that we appropriately extend the notions of the Lebesgue and Itó integrals to RN -valued stochastic processes. To this end, we first recall the basics of the matrix exponential from [295] and investigate random IVPs of the form (4.31). Then, we define the two integrals and proceed with a more substantive development of the theory of Itó SDEs of the form (4.32) in RN .
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
4.2
179
Deterministic Linear Evolution Equations in RN
We provide the following terse outline of the basic definitions and results from the deterministic theory for finite-dimensional linear systems of ODEs that we need in order to develop an analogous theory in the stochastic setting. A thorough development of this material can be found in Volume 1.
4.2.1
The Matrix Exponential
A natural definition of eat that is independent of a geometric context is the Taylor rep(at)k At resentation eat = ∑∞ k=0 k! , which converges ∀t ∈ R. We can define e in a similar manner. Definition 4.2.1. For any A ∈ MN (R) and t ∈ R, the matrix exponential eAt is the unique member of MN (R) defined by eAt =
∞
(At)k . k=0 k!
∑
For instance, consider the following example. a0 Example. Let A = , where a, b ∈ R . Observe that 0b "
a0 e 0b
#
t
" # k k k (at) 0 a0 at 0 t ∞ ∞ ∞ 0 (bt)k 0b 0 bt = ∑ =∑ =∑ k! k! k! k=0 k=0 k=0 " k # " # k (at) (at) ∞ eat 0 0 0 ∑∞ k=0 k! k! = ∑ = = . k k (bt) 0 ebt 0 (bt) 0 k=0 ∑∞ k=0 k! k!
Exercise 4.2.1. Compute eAt where A is a diagonal N × N matrix with real diagonal entries a11 , a22 , . . . , aNN . Justify all steps. Exercise 4.2.2. Let A ∈ MN (R) and assume that ∃D, P ∈ MN (R) such that D is diagonal, P is invertible, and A = P−1 DP. (In such case, A is said to be diagonalizable.) Show that ∀t ∈ R, eAt = P−1 eDt P. (Note: For nondiagonalizable matrices A, even though eAt exists, computing it can be tedious. In such case, the Putzer algorithm is a useful tool.) We gather some important properties below about eAt and its relationship to A. Proposition 4.2.2. Let A ∈ MN (R) and define B : dom(B) ⊂ RN → RN by Bx = Ax. Also, for every t ∈ R, define St : dom(St ) ⊂ RN → RN by St x = eAt x. Then,
© 2011 by Taylor & Francis Group, LLC
180
Volume 2: Stochastic Equations
i.) dom(B) = RN ; ii.) For every α , β ∈ R and x, y∈ RN , B(α x + β y) = α Bx + β By; iii.) For every x∈ RN , kBxkRN ≤ kAkMN kxkRN ; iv.) dom(St ) = RN ; N , S (α x + β y) = α S x + β S y; v.) For every α , β ∈ R and x,y∈ R t t t
At
N
vi.) For every x∈ R , kSt xkRN = e x RN ≤ eAt MN kxkRN ≤ etkAkMN kxkRN . Definition 4.2.3. Let A ∈ MN (R) and t ≥ 0. The family of operators eAt : t ≥ 0 is contractive if eAt x RN ≤ kxkRN , ∀x∈ RN ,t ≥ 0.
Exercise 4.2.3. i.) Give an example of A ∈ MN (R) for which eAt : t ≥ 0 is not contractive. ii.) Determine a sufficient condition that could be imposed on a diagonal matrix A ∈ MN (R) to ensure that eAt : t ≥ 0 is contractive.
Proposition 4.2.4. Let A, B ∈ MN (R) and t ≥ 0. i.) e0 = I, where 0 is the zero matrix and I is the identity matrix in MN (R); ii.) For every t, s ≥ 0 , eA(t+s) = eAt eAs = eAs eAt ; −1 iii.) For every A ∈ MN (R) and t ≥ 0, eAt is invertible and eAt = e−At ; iv.) If AB BA, then eB eA = eA eB = eA+B ;
= At
v.) lim e − I MN = 0; t→0+
vi.) For every x0 ∈ RN , g: [0, ∞) → RN defined by g(t) = eAt x0 is continuous; vii.) For every t0 ≥ 0, h: RN → RN defined by h(x) = eAt0 x is continuous; ´ t +h viii.) For every x0 ∈ RN and t0 ≥ 0, lim 1h t00 eAs x0 ds = eAt0 x0 ; h→0+ (eAh −I)x0 N ix.) For every x0 ∈ R , lim = Ax0 ; h h→0+ x.) For every t ≥ 0, AeAt = eAt A;
xi.) For every x0 ∈ RN , g: (0, ∞) → Rn defined by g(t) = eAt x0 is in C1 (0, ∞) ; RN and d At e x0 = AeAt x0 = eAt Ax0 ; dt xii.) For every t0 ≥ 0 and x0 ∈ RN , ˆ t0 A eAs x0 ds = eAt0 x0 − x0; 0
xiii.) For every 0 < s ≤ t < ∞ and x0 ∈ RN , ˆ t ˆ t At As Au e x0 − e x0 = e Ax0 du = AeAu x0 du. s
s
The function B : RN → RN defined by eAh − I z Bz = lim h h→0+ is the generator of the family eAt : t ≥ 0 .
Definition 4.2.5. Let A
∈ MN (R).
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
181
By Prop. 4.2.4, the operator B generates eAt : t ≥ 0 . For brevity, we say “A At generates e : t ≥ 0 .” As such, to every A ∈ MN (R) there is associated at least one exponential family.
4.2.2
The Homogenous Cauchy Problem
The deterministic homogenous linear IVP in RN is given by ( U′ (t) = AU(t), t > 0, U(0) = U0 .
(4.33)
Definition 4.2.6. A classical solution of (4.33) is a function U ∈ C [0, ∞) ; RN ∩ C1 (0, ∞) ; RN that satisfies the ODE and IC in (4.33).
The properties of eAt established in Section 2.2 enable us to establish the following result. Theorem 4.2.7. For every U0 ∈ RN , the IVP (4.33) has a unique classical solution given by U(t) = eAt U0 . A natural change of variable can be used to show the following. Corollary 4.2.8. For every t0 > 0, the IVP ( U′ (t) = AU(t), t > t0 , U(t0 ) = U0
(4.34)
has a unique classical solution U: [t0 , ∞) → RN given by U(t) = eA(t−t0 ) U0 . Because theclassical solution is U(t) = eAt U0 , these questions ultimately concern At the nature of e : t ≥ 0 , which in turn is directly linked to the matrix A. How, specifically, does the relationship between A and eAt : t ≥ 0 translate into different long-term behavior? The following exercises shed some light on this situation. α 0 , where α , β ∈ R. Answer the following three quesExercise 4.2.4. Let A = 0 β tions for each description of α and β to follow.
(I) Let t ≥ 0. Compute eAt and determine an upper bound for eAt MN .
(II) Does ∃lim eAt x RN ? Does it depend on the choice of x ∈ RN ? t→∞
(III) Address each of the four questions posed at the beginning of this section for the classical solution of the corresponding IVP. i.) α , β < 0; ii.) α , β > 0; iii.) Exactly one of α , β is equal to zero and the other is strictly positive; iv.) Exactly one of α , β is equal to zero and the other is strictly negative;
© 2011 by Taylor & Francis Group, LLC
182
Volume 2: Stochastic Equations
v.) α < 0 < β . The eigenvalues of the matrix A significantly impact the structure of eAt (cf. Prop. 4.2.4). Every N × N matrix has N complex eigenvalues, including multiplicity. As such, it is reasonable to expect a connection between them and the long-term behavior of eAt : t ≥ 0 . This is apparent in the following simple scenario. α 0 , whose eigenvalues are α and β . Exercise 4.2.5. Consider the matrix A = 0 β For each case listed in Exer. 4.2.4, associate the nature of the eigenvalues with the long-term behavior of the classical solution U(t) of (4.34). (For instance, if α , β < 0, then the eigenvalues of A are both negative and in such case, lim kU(t)kR2 = 0.) t→∞
4.3
Exploring Two Models
As mentioned earlier, the deterministic theory discussed in Section 3.2 can be applied for fixed ω ∈ Ω to study stochastic IVPs of the form (4.31). Consider the following exercises. Exercise 4.3.1. Consider the chemical kinetics IVP (4.1). i.) Derive a formula for the solution of this IVP and calculate mX (t) and VarX (t). ii.) If [Y ]0 is b(3, 0.5), how many different solution vectors are there? Compute mX (t) and VarX (t) for each of them. iii.) If [Y ]0 is n(0, 1), how do your responses in (ii) change? ⋆ iv.) Suppose that α1⋆ > 0 is such that |α1 − α1| >⋆0. Denote the solutions of (4.1) cor[Y ] (t; ·) [Y ] (t; ·) responding to α1 and α1⋆ by and , respectively. Determine an [Z] (t; ·) [Z ⋆ ] (t; ·)
⋆ 2
[Y ] (t; ·) [Y ] (t; ·)
estimate for , ∀t > 0.
[Z] (t; ·) − [Z ⋆ ] (t; ·) 2
L (Ω;R)
[Y ]
v.) For what values of α1 does −→ 0 as t −→ ∞?
[Z] C([0,T ];L2 (Ω;R)) Exercise 4.3.2. Consider the spring-mass system described by the IVP (4.19). i.) Use the definition of the matrix exponential to show that "
0 1 2 − e α 0
#
t
=
cos (α t) α1 sin (α t) . −α sin (α t) cos (α t)
ii.) Use (i) to derive an explicit formula for the solution of (4.19). iii.) Assume that x0 is b(N, 0.5). Compute mX (t) and VarX (t). iv.) Assume that x0 is n µ , σ 2 . Compute mX (t) and VarX (t). © 2011 by Taylor & Francis Group, LLC
(4.35)
Homogenous Linear Stochastic Evolution Equations in RN
183
v.) Consider a sequence {an : n ∈ N} ⊂ R for which lim an = a. For every n ∈ N, n→∞
find a formula for the classical solution Un of (2.5). Does there exist U⋆ for which Un −→ U⋆ uniformly as n → ∞? vi.) Error can occur in the measurement of any parameter, including the initial conditions. Consider two versions of IVP (2.5), one for which the initial data are y(0) = y0 , z(0) = 0 and the other for which y(0) = y0 , z(0) = z0 . Denote the classical solutions by U(t) and U(t), respectively, assume that E |y0 − y0 |2
2 E |z0 |2 < δ2 . For any T > 0, determine sup E U(t) − U(t) RN : 0 ≤ t ≤ T .
vii.) Determine an estimate for E |x(t; ·)| p , for p > 2.
4.4
The Lebesgue and Ito´ Integrals in RN
Assume (S.A.1). Developing a theory for SDEs in RN of the form (4.32) analogous to the theory developed in Chapter 3 requires that we extend the definitions of the Lebesgue and Itó integrals to handle RN -valued random variables. As in Chapter 3, we restrict out attention to stochastic processes u : [0,t] × Ω −→ RN satisfying the following conditions: u(s; ·) is Fs − adapted,∀s ∈ [0,t], u(s; ω ) is progressively measurable on [0,t] × Ω, ˆ t E ku(s; ·)k2RN ds < ∞.
(4.36) (4.37) (4.38)
0
The collection of all RN -valued stochastic processes satisfying (4.36) through (4.38) is denoted by UN . Exercise 4.4.1. Interpret (4.36) and (4.37) in terms of the components of u.
4.4.1
The Lebesgue Integral for RN -Valued Stochastic Processes
The standard calculus operations for deterministic matrix-valued functions are performed componentwise. The benefit is that the operation (e.g., limit, derivative, or integral) is performed on real-valued functions for which we already have a working definition and properties. It is reasonable to define these calculus operations for matrix-valued stochastic processes in a similar manner. To this end, we have the following. Definition 4.4.1. Let u : [0,t] × Ω −→ RN be a stochastic process, whose component form is u(t; ω ) = [u1 (t; ω ), . . . , uN (t; ω )]T , that belongs to UN . The Lebesgue integral
© 2011 by Taylor & Francis Group, LLC
184
Volume 2: Stochastic Equations
of u on (0,t) is given by ´t ˆ t 0 u1 (s; ω )ds T ´t ´t .. u(s; ω )ds = = 0 u1 (s; ω )ds, · · · , 0 uN (s; ω )ds , (4.39) . ´t 0 0 uN (s; ω )ds where each of the component integrals is as defined in Section 3.2.1.
Remarks. 1. Observe that for a given t > 0, the Lebesgue integral of an RN -valued stochastic process is an RN -valued random variable. 2. The properties listed in Prop. 3.2.1 carry over to the present setting by making the obvious modifications, namely replacing the absolute value by the RN -norm, interpreting the integrands as RN -valued random variables, etc. Each of these properties can be verified by applying the corresponding one-dimensional version of the property to the components and appealing to the arithmetic of vectors in RN and using the properties of the RN -norm. Exercise 4.4.2. i.) State the analogous form of Prop. 3.2.1 for UN . Take careful note of the precise nature of all modifications. ii.) Prove the linearity and additivity properties of the Lebesgue integral for stochastic processes in UN . Recall that the expectation of an RN -valued random variable is itself a (deterministic) vector in RN . Fubini’s theorem applies equally well for members of UN . Indeed, let u ∈ UN and observe that E
ˆ
0
t
ˆ t T ˆ t u(s; ω )ds = E u1 (s; ω )ds, . . . , uN (s; ω )ds 0
0
ˆ t T ˆ t = E u1 (s; ω )ds, . . . , E uN (s; ω )ds =
0
ˆ
t
E [u1 (s; ω )] ds, . . . ,
0 t
=
ˆ
t
=
ˆ
t
=
ˆ
ˆ
0 t
0
T E [uN (s; ω )] ds
[E [u1 (s; ω )] , . . . , E [uN1 (s; ω )]]T ds
0
E [u1 (s; ω ), . . . , uN (s; ω )]T ds
0
E [u(s; ω )] ds,
0
as needed.
© 2011 by Taylor & Francis Group, LLC
(4.40)
Homogenous Linear Stochastic Evolution Equations in RN
4.4.2
185
The Ito´ Integral for RN -Valued Stochastic Processes
An examination of (4.32) suggests that we will need to consider the following integral at the very onset of our analysis: ˆ t m (4.41) ∑ Bk U(s; ω )dWk (s), 0 k=1
where 0 ≤ t ≤ T ; {W1 (t) : 0 ≤ t ≤ T } , . . .,{Wm (t) : 0 ≤ t ≤ T } are independent realvalued Wiener processes; Bk ∈ MN (R) (k = 1, . . . , m); and U : [0, T ] × Ω −→ RN . The independence of the Wiener processes arising in (4.41) enables us to gather the Wiener noise terms together as the m-dimensional Wiener process W(t) = hW1 (t), . . . ,Wm (t)iT .
(4.42)
We must assume that ∀s ∈ [0, T ] ,
σ (W(u)| 0 ≤ u ≤ s) ⊂ Fs .
(4.43)
(Why?) We seek to define the Itó integral ˆ t g(s; ω )dW(s)
(4.44)
0
in a manner consistent with the development in Section 3.2.2 and for which the integral (4.41) can be subsumed as a special case by appropriately rearranging terms. The question, of course, is for which stochastic processes g is (4.44) meaningful? In the present form, it is insufficient to simply require that g ∈ UN . (Why?) Answering this question requires that we think about the form of the noise terms that can occur in any of the N SDEs comprising the system (4.32). Momentarily ignoring the precise nature of the coefficients of dW j ( j = 1, . . . , m) in the SDEs, we note that ∀1 ≤ i ≤ N, the form of the equation governing Xi = Xi (t; ω ) is dX1 = (a11 X1 + . . . + a1N XN ) dt + (g11 dW1 (t) + . . . + g1m dWm (t)) , .. .
(4.45)
dXN = (aN1 X1 + . . . + aNN XN ) dt + (gN1 dW1 (t) + . . . + gNm dWm (t)) , where each gi j is an appropriately behaved linear expression of X1 , . . . , XN . (This will be made precise in Section 4.5.) Now, writing (4.45) in matrix form gives rise to the following modified form of (4.32): g11 (t) · · · g1m (t) dW1 (t) .. .. .. dX(t; ω ) = AX(t; ω )dt + ... . . . = AX(t; ω )dt +
gN1 (t) · · · gNm (t)
G(t) · dW(t) . | {z } | {z }
N×m matrix m×1 matrix
© 2011 by Taylor & Francis Group, LLC
dWm (t)
(4.46)
186
Volume 2: Stochastic Equations
Forming the integrated version of (4.46) suggests that we define the Itó integral with respect to an m-dimensional Wiener process for MN×m -valued stochastic processes possessing similar characteristics to members of UN . It is helpful to view the matrices G(t) as operators, especially in the next chapter when we make the transition to the Hilbert space setting. To this end, note that for a given G ∈ MN×m , we can define the operator B : Rm → RN by G y . B( y ) = |{z} |{z} |{z} m×1
(4.47)
N×m m×1
| {z } N×1
Let G = [gi j ] , 1 ≤ i ≤ N, 1 ≤ j ≤ m. We equip MN×m with the so-called HilbertSchmidt norm defined by N m kGk2MN×m ≡ trace GT G = ∑ ∑ g2i j < ∞.
(4.48)
i=1 j=1
Remark. Observe that ∀α , β ∈ R and y, z ∈ Rm , kB(y)kRN ≤ kGkMN×m kykRm = trace GT G
21
kykRm ,
B(α y + β z) = G(α y + β z) = α Gy + β Gz = α B(y) + β B(z).
(4.49) (4.50)
We say that B is a bounded linear operator with finite trace or, equivalently, that m N B is a Hilbert-Schmidt operator the from R into R . We denote collection of all m N such operators by B0 R , R . It can be shown that B0 Rm , RN is a Banach space when equipped with the norm kBkB0 ≡ trace GT G
12
,
(4.51)
where G is defined in (4.46). In order to avoid cumbersome notation, it is customary to treat the operator B and the matrix G in (4.47) as being indistinguishable and refer to G itself as the Hilbert-Schmidt operator with norm kGkB0 given by the right-hand side of (4.51). Exercise 4.4.3. Let G = [gi j ] , 1 ≤ i ≤ N, 1 ≤ j ≤ m. Verify that N m trace GT G = ∑ ∑ g2i j . i=1 j=1
Remark. Observe that trace GT G < ∞, ∀G ∈ MN×m . (Why?) However, it is not true when either Rm or RN are replaced by general separable Hilbert spaces. The requirement that “trace GT G < ∞ ” becomes nontrivial in such case. Next, we define the Itó integral for B0 Rm , RN -valued stochastic processes.
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
187
Definition 4.4.2. Let u : [0, T ] × Ω −→ B0 Rm , RN be a stochastic process whose component form is u(t; ω ) = [ui j (t; ω )] , 1 ≤ i ≤ N, 1 ≤ j ≤ m. Assume that u is ´t Ft -adapted, progressively measurable, and is such that 0 E ku(s; ·)k2B0 ds < ∞. The Itó integral of u over (0,t) with respect to {W(s) : 0 ≤ s ≤ t} is given by m ´t ∑ j=1 0 u1 j (s; ω )dW j (s) ˆ t .. u(s; ω )dW(s) = (4.52) . ´t 0 m ∑ j=1 0 uN j (s; ω )dW j (s) h iT ´t ´t = ∑mj=1 0 u1 j (s; ω )dW j (s), · · · , ∑mj=1 0 uN j (s; ω )dW j (s) ,
where the integrals used to define the components are as defined in Section 3.2.2.
As with the Lebesgue integral, componentwise arguments can be used to show that the properties of the Itó integral of R-valued stochastic processes carry over to the present setting. It would be instructive for you to verify these properties directly. Exercise 4.4.4. i.) State the analogous form of Prop. 3.2.3 for B0 Rm , RN -valued stochastic processes. Make careful note of the precise nature of all modifications. ii.) Prove the linearity and additivity properties of the Itó integral for B0 Rm , RN valued stochastic processes.
We verify that the Itó isometry holds. Observe that for all B0 Rm , RN -valued stochastic processes u satisfying the conditions of Def. 4.4.2, !2
ˆ t
2 N m ˆ t
ui j (s; ·)dW j (s) E
u(s; ·)dW(s) m = E ∑ ∑ 0
R
j=1 0
i=1
N
=
"
m
∑E ∑
i=1
j=1
+∑ ∑
N
=
|
j k6= j
"
m
© 2011 by Taylor & Francis Group, LLC
j=1
t
0
ˆ
∑E ∑
i=1
ˆ
t
0
ˆ
2 ui j (s; ·)dW j (s)
ˆ t ui j (s; ·)dW j (s) uik (s; ·)dWk (s) 0 {z }
0
All of the cross−terms
t
2 # ui j (s; ·)dW j (s)
(4.53)
188
Volume 2: Stochastic Equations
m
N
=
∑∑E
i=1 j=1 N
=
m
∑∑
ˆ
0
t
ˆ
i=1 j=1 0
=
ˆ
t N
t
m
2 ui j (s; ·)dW j (s)
E u2i j (s; ·) ds
∑∑E
0 i=1 j=1
|
u2i j (s; ·) ds
{z
}
=trace(uT (s;·)u(s;·))
=
ˆ
t
0
4.4.3
ku(s; ω )k2B (Rm ,RN ) ds. 0
Some Crucial Estimates
The following generalization of Lemma 3.2.7 will be useful. Lemma 4.4.3. Let p > 2. ´T i.) Assume that u ∈ UN with E 0 ku(s; ·)kRp N ds < ∞. Then, ∀0 ≤ t ′ < t ≤ T,
ˆ t
p ˆ
p t ′ q
E u(s; ·)ds ≤ t − t E ku(s; ·)kRp N ds, (4.54) t′
where
1 p
t′
RN
+ 1q = 1.
´T p ii.) Let u : [0, T ] × Ω −→ B0 Rm , RN be as in Def. 4.4.2 with E 0 ku(s; ·)kB ds < 0 ∞. Then, ∀0 ≤ t ′ < t ≤ T,
ˆ t
p ˆ
t p ′
E ku(s; ·)kB ds, (4.55) E u(s; ·)dW(s) ≤ ζB0 t,t 0 t′
t′
RN
where
′
p
ζB0 t,t = 2 N
p+1 2
m
p
"
p# p p p(p − 1) 2 ′ 2 t2 + t . 2
(4.56)
Proof. It is more convenient to use the max-norm for RN (cf. (1.46)). Doing so, observe that (i) holds because
ˆ t
p ˆ t p
E u(s; ·)ds = E max ui (s; ·)ds 1≤i≤N t ′ t′ RN ˆ p t ≤ max t − t ′ q E |ui (s; ·)| p ds 1≤i≤N t′ ˆ t p p ≤ max t − t ′ q E max u j (s; ·) ds 1≤i≤N 1≤ j≤N t′ ˆ t p ≤ t − t ′ q E ku(s; ·)kRp N ds. t′
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
189
Next, we see that (ii) holds because " ˆ
ˆ t
p
2 # 2p
t
E
′ u(s; ·)dW(s) N = E ′ u(s; ·)dW(s) N t
R
R
t
N
= E ∑
m
∑
≤N
E
t
j=1 t ′
i=1
p−1 2
ˆ
"
N
ui j (s; ·)dW j (s)
m
∑ ∑
ˆ
j=1 t ′
i=1
!2 2p
t
!p#
ui j (s; ·)dW j (s)
(4.57)
ˆ t p ≤N m ∑ ∑ E t ′ ui j (s; ·)dW j (s) i=1 j=1 " p# p p p(p − 1) 2 p p−! p−1 ′ 2 ≤2 N 2 m t2 + t 2 ˆ N m t p ×∑ ∑ E ui j (s; ·) ds. p−1 2
p−1
N
m
i=1 j=1 t ′
Note that
p p 2 2p 2 E ui j (s; ·) = E ui j (s; ·) ≤ kuk2B0 .
(4.58)
Using (4.58) in (4.57) enables us to continue the string of inequalities to conclude that (4.55) holds. This completes the proof. Remark. The numerical estimate ζB0 (t,t ′ ) can be improved by following the proof of Lemma 3.2.7(ii) and replacing the absolute value by the RN -norm. Given that this is a real-valued stochastic process, the same form of Itó’s formula applies. The existence of such a bound ζB0 (t,t ′ ) is all that we will need in our qualitative arguments.
4.4.4
The Multivariable It Formula — Revisited
We introduced Itó’s formula for mappings h : [0, T ] × RN → R in Prop. 3.2.6. This formula is sufficient for our purposes because we merely apply it componentwise to derive formulae for slightly more general mappings h : [0, T ] × RN1 → RN2 . But, by way of motivation for the extension of Prop. 3.2.6 to functions that map one separable Hilbert space into another in Chapter 5, we present the formula in an equivalent manner that is more amenable to generalization. Suppose that X : [0, T ] × Ω → RN is an Itó process given by ( dX(t; ω ) = F(t)dt + G(t)dW(t), 0 < t < T, ω ∈ Ω, (4.59) X(0; ω ) = X0 (ω ), ω ∈ Ω,
© 2011 by Taylor & Francis Group, LLC
190
Volume 2: Stochastic Equations
where F : [0, T ] → RN , G : [0, T ] → B0 Rm , RN , and W(t) = hW1 (t), . . . ,Wm (t)iT is an m-dimensional Wiener process. The ith component of dX(t; ω ) is given by dXi (t; ω ) = Fi (t)dt + Gi1(t)dW1 (t) + . . . + Gim (t)dWm (t).
(4.60)
We consider each term in the Itó formula (3.52) individually. Observe that
∂h ∂h dXi (t; ω ) = [Fi (t)dt + Gi1 (t)dW1 (t) + . . . + Gim (t)dWm (t)] , ∂ Xi ∂ Xi so that
n
∂h
∑ ∂ Xi dXi (t; ω ) = (∇h · F)(t)dt + ∇h · (G(t)dW(t)) ,
(4.61)
i=1
D E where ∇h = ∂∂Xh , . . . , ∂∂XhN and “·” represents the usual RN dot product. 1 Next, ∀1 ≤ i, j ≤ N, observe that dXi (t; ω )dX j (t; ω ) = (Fi (t)dt + Gi1 (t)dW1 (t) + . . . + Gim (t)dWm (t)) · Fj (t)dt + G j1(t)dW1 (t) + . . . + G jm (t)dWm (t)
= Gi1 (t)G j1 (t) (dW1 (t))2 + . . . + Gim (t)G jm (t) (dWm (t))2 m
=
∑ Gik (t)G jk (t)dt
(4.62)
k=1
= G(t)GT (t) i j dt,
where G(t)GT (t) i j is the (i j)th component of the n × n matrix G(t)GT (t). As such, we have N N N N ∂ 2h ∂ 2h ω )dX (t; ω ) = dX (t; j i ∑ ∑ ∂ Xi ∂ X j ∑ ∑ ∂ Xi ∂ X j G(t)GT (t) i j dt. (4.63) i=1 j=1 i=1 j=1
Going one step further reveals that the right-hand side of (4.63) is 2 ∂ h ∂ X1 ∂ X1 . trace .. ∂ 2h | ∂ XN ∂ X1
··· .. .
∂ 2h ∂ X1 ∂ XN
··· {z
∂ 2h ∂ XN ∂ XN
= J (h)
where J (h) is the Jacobian matrix of h.
G(t)GT (t) , }
(4.64)
Exercise 4.4.5. Show that (4.64) equals the right-hand side of (4.63). Using (4.63) and (4.64) in (3.52) yields the equivalent formula d (h (t, X(t; ω ))) =
∂h 1 dt + (∇h · F)(t)dt + trace J (h)G(t)GT (t) (4.65) ∂t 2 +∇h · (G(t)dW(t)) .
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
4.5
191
The Cauchy Problem — Formulation
Assume (S.A.1). The focus of our study is linear systems of N stochastic ODEs of the general form dX1 = (a11 X1 + . . . + a1N XN ) dt + b111 X1 + . . . + b11N XN dW1 (t) + . . . + b1m1 X1 + . . . + b1mN XN dWm (t), .. . (4.66) dXN = (aN1 X1 + . . . + aNN XN ) dt + bN11 X1 + . . . + bN1N XN dW1 (t) + . . . + bNm1 X1 + . . . + bNmN XN dWm (t), X1 (0; ω ) = (X0 )1 (ω ), . . . , XN (0; ω ) = (X0 )N (ω ), ω ∈ Ω, where 0 < t < T, ω ∈ Ω and Xi = Xi (t; ω ) (i = 1, . . . , N). The system (4.66) can be written in the concise form (4.32). Indeed, let X : [0, T ] × Ω → RN be given by X1 (t; ω ) (X0 )1 (ω ) .. .. X(t; ω ) = (4.67) and X0 (ω ) = . . . XN (t; ω )
(X0 )N (ω )
We identify the constant coefficient matrix of the “dt” portion of the right-hand side of (4.66) as a11 · · · a1N A = ... . . . ... . (4.68) aN1 · · · aNN
Also, for each 1 ≤ j ≤ m, group all terms involving dW j and rewrite in matrix form in a manner that retains the individual contributions to each of the N equations in (4.66). Doing so results in 1 b j1 · · · b1jN X1 (t; ω ) .. . . .. .. (4.69) . dW j (t) = B j X(t; ω )dW j (t). . . . bNj1 · · · bNjN
XN (t; ω )
Using (4.67) through (4.69) shows that (4.66) can be rewritten as (4.32). We assume the following:
(H4.1) ai j , bkij are real constants, ∀1 ≤ i, j, k ≤ N. (H4.2) W(t) = hW1 (t), . . . ,Wm (t)iT , 0 ≤ t ≤ T, is an m-dimensional Wiener process. (H4.3) X0 is an F0 -measurable random variable in L2 Ω; RN that is independent of {W(t) : 0 ≤ t ≤ T } . Moreover, ∀t ∈ [0, T ],
σ (X0 , W(s)| 0 ≤ s ≤ t) ⊂ Ft .
© 2011 by Taylor & Francis Group, LLC
192
Volume 2: Stochastic Equations
The integral form of (4.32) is given by ˆ t AX(s; ω )ds X(t; ω ) = X0 (ω ) + 0 ˆ t m +∑ Bk X(s; ω )dWk (s), 0 ≤ t ≤ T, ω ∈ Ω.
(4.70)
k=1 0
Following the discussion in Section 3.3 regarding the well-posedness of (3.78), we must make certain that the right-hand side of (4.70) is well-defined. And, requiring that X ∈ C [0, T ] ; L2 Ω; RN does the trick. Indeed, in such case, the Lebesgue integral in (4.70) is certainly defined. (Why?) We must argue that the Itó integral terms can be expressed in the form defined in Section 4.4.3. This follows immediately by defining N
∑ bijk Xk (s; ω ), ∀1 ≤ i, j ≤ N, 0 ≤ s ≤ T, ω ∈ Ω,
(4.71)
N 1 X (s; ω ) dW (s) b ∑ j k=1 jk k 0 ˆ t .. G(s; ω )dW(s) = . . 0 ´t m N N ∑ j=1 0 ∑k=1 b jk Xk (s; ω ) dW j (s)
(4.72)
Gi j (s; ω ) =
k=1
so that
∑mj=1
´t
Because the matrices G(s; ω ) are Hilbert-Schmidt operators, it follows that the integral defined in (4.72) is well-defined. (Why?) Moreover, (4.70) is equivalent to ˆ t ˆ t X(t; ω ) = X0 (ω ) + AX(s; ω )ds + G(s; ω )dW(s), 0 ≤ t ≤ T, ω ∈ Ω. (4.73) 0
0
Exercise 4.5.1. Carefully show that (4.70) and (4.73) are equivalent. As such, seeking a solution of (4.71) in the following sense is reasonable. N Definition 4.5.1. A stochastic process X : [0, T ] × Ω −→ R is a strong solution of 2 N (4.70) on [0, T ] if X ∈ C [0, T ] ; L Ω; R and X(t; ω ) satisfies (4.70) a.s. [P] , ∀0 ≤ t ≤ T .
Now, take a step back and compare the setting of (4.70) to that of (3.74). Specifically, the main differences are that (i) the quantities that are constants in (3.74) are now constant matrices in (4.70), and (ii) the solution process is now an RN valued stochastic process exhibiting characteristics that resemble those of the onedimensional case almost verbatim.
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
193
Exercise 4.5.2. Formally show that (3.74) is a special case of (4.70). This connection served as the basis for the development of the matrix exponential and the ensuing theory in the deterministic case. Looking back, the proofs of the theoretical results in the N-dimensional setting were virtually identical to those of the analogous one-dimensional results due to the fact that the properties of the matrix exponential so closely resembled the properties of the real-valued exponential function. In fact, other than a change of norm and being careful about the commutativity of products (because we are now dealing with matrices), the proofs go through unaltered, with the exception that the actual value of some of the numerical estimates are necessarily different. This renders the remainder of our work in this chapter rather simple; we simply need to carefully check line by line that the proofs work in the present setting. Because the proofs of the results in the more general case of multiple sources of noise were often left as exercises in Chapter 3, actually working through the proofs in this chapter for (4.70) will be especially instructive. In what follows, much of the detail-checking will be left as an exercise. A more complete discussion will be provided for those topics for which the details are new.
4.6
Existence and Uniqueness of a Strong Solution
The main existence/uniqueness result for (4.70) is as follows. Theorem 4.6.1. If (H4.1) through (H4.3) hold, then (4.70) has a unique strong solution on [0, T ] . Exercise 4.6.1. Prove Thrm. 4.6.1 by carefully modifying the proof of Thrm. 3.4.1. We can use the properties of the matrix exponential to derive a representation formula for a strong solution of (4.70), as long as all matrices A, B1 , . . . , Bm are pairwise commutative. Precisely, we have Proposition 4.6.2. Assume that A, B1 , . . . , Bm are pairwise commutative. Then, the strong solution of (4.70) is given by h i 1 m m 2 X(t; ω ) = e(A− 2 ∑k=1 Bk )t+∑k=1 Bk dWk (t) X0 (ω ), 0 ≤ t ≤ T, ω ∈ Ω. (4.74)
Proof. Define Y : [0, T ] × Ω −→ MN (R) by ! ˆ t ˆt m 1 m 2 Y(t; ω ) = A − ∑ Bk ds + ∑ Bk dWk (s). 2 k=1 0 0 k=1
We must argue that the stochastic process Z : [0, T ] × Ω −→ RN defined by Z(t; ω ) = eY(t;ω ) X0 (ω )
© 2011 by Taylor & Francis Group, LLC
(4.75)
194
Volume 2: Stochastic Equations
satisfies (4.70). Applying Prop. 3.2.6 with h(z) = ez (so that ∂∂ ht = 0, ∂∂ hz = yields h i d (Z(t; ω )) = d eY(t;ω ) X0 (ω ) = d (Y(t; ω )) eY(t;ω ) X0 (ω ) 1 + (d (Y(t; ω )))2 eY(t;ω ) X0 (ω ) 2 1 = d (Y(t; ω )) Z(t; ω ) + (d (Y(t; ω )))2 Z(t; ω ). 2 Using ( m 2 d (Y(t; ω )) = A − 12 ∑m k=1 Bk dt + ∑k=1 Bk dWk (t), 0 < t < T, ω ∈ Ω, Y(0; ω ) = 0, ω ∈ Ω,
∂ 2h ∂ z2
= ez )
(4.76)
(4.77)
in (4.76) and simplifying yields "
! # m 1 m 2 d (Z(t; ω )) = A − ∑ Bk dt + ∑ Bk dWk (t) Z(t; ω ) 2 k=1 k=1 ! m 1 + ∑ B2k dt Z(t; ω ) 2 k=1 !
(4.78)
m
= AZ(t; ω )dt +
∑ Bk dWk (t)
Z(t; ω )
k=1 m
= AZ(t; ω )dt + ∑ Bk Z(t; ω )dWk (t). k=1
Also, observe that Z(0; ω ) = eY(0;ω ) X0 (ω ) = IX0 (ω ) = X0 (ω ). Consequently, Z(t; ω ) satisfies (4.70). By uniqueness, we conclude that X(t; ω ) = Z(t; ω ), a.s. [P], ∀0 ≤ t ≤ T, thereby resulting in (4.74). This completes the proof. Exercise 4.6.2. i.) Where was the commutativity of A, B1 , . . . , Bm used in the proof of Prop. 4.6.2? ii.) Explain how Itó’s formula is being applied to a matrix-valued process Y(t; ω ). The formula (4.74) simplifies considerably when A, B1 , . . . , Bm are diagonal matrices. In such case, the N equations are all decoupled, all matrices necessarily commute (Why?), and the resulting formula is an N-dimensional stochastic process whose ith component is precisely the representation formula (of the form (3.126)) of
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
195
the solution of the ith equation in the system. Use this observation to complete the following exercises. Exercise 4.6.3. Derive a simplified formula for the strong solution of (4.15). Exercise 4.6.4. Use Putzer’s algorithm to aid you in deriving a simplified formula for the strong solution of (4.27). Then, interpret the components of the solution process.
4.7
Continuous Dependence on Initial Data
Consider (4.70) and the related IVP ( dY(t; ω ) = AY(t; ω )dt + ∑m k=1 Bk Y(t; ω )dWk (t), 0 < t < T, ω ∈ Ω, Y(0; ω ) = Y0 (ω ), ω ∈ Ω,
(4.79)
both under hypotheses (H4.1) through (H4.3). Exercise 4.7.1. Before proceeding, try to derive an estimate for E kX(t; ·) − Y(t; ·)k2RN in the spirit of (3.128). What differences do you encounter in this RN setting? Proposition 4.7.1. For all 0 ≤ t ≤ T,
2
m
2
E kX(t; ·) − Y(t; ·)k2RN ≤ 3 kX0 − Y0 k2L2 e3t (T kAkMN +mζB0 ∑k=1 kBk kMN ) .
(4.80)
Proof. Let 0 ≤ t ≤ T. Subtracting (4.70) and the integrated form of (4.79) and using Lemma 4.4.3 yields "
ˆ t
2
2 2
E kX(t; ·) − Y(t; ·)kRN ≤ 3 kX0 − Y0kL2 + E A (X(s; ·) − Y(s; ·))
RN
0
ˆ t
2 #
+m ∑ E Bk (X(s; ·) − Y(s; ·)) dWk (s)
N (4.81) m
k=1
R
0
ˆ t ≤ 3 kX0 − Y0 k2L2 + t E kA (X(s; ·) − Y(s; ·))k2RN ds 0 # ˆ m
+mζB0
≤
t
∑
k=1 0
3 kX0 − Y0 k2L2 ·
ˆ
0
t
E kBk (X(s; ·) − Y(s; ·))k2B0 ds
+3 T
kAk2MN
E kX(s; ·) − Y(s; ·)k2RN ds.
© 2011 by Taylor & Francis Group, LLC
m
+ mζB0
∑
k=1
kBk k2MN
!
196
Volume 2: Stochastic Equations
Applying Gronwall’s Lemma in (4.81) yields (4.80). This completes the proof. Exercise 4.7.2. Formulate (4.80) directly for IVPs (4.5) and (4.15). Exercise 4.7.3. Replace A in (4.79) by A⋆ and assume ∃δ1 , δ2 > 0 such that kA − A⋆kMN < δ1 and kX0 − Y0 kL2 < δ2 .
(4.82)
Establish an estimate for E kX(t; ·) − Y(t; ·)k2RN as in Prop. 4.7.1.
4.8
Statistical Properties of the Strong Solution
The same statistical properties for the R-valued stochastic processes developed in Section 3.6 are of interest here. The computations closely resemble those in Section 3.6 and are therefore left as an exercise. Exercise 4.8.1. Assume that (H4.1) through (H4.3) hold. Let X : [0, T ] × Ω −→ RN be the strong solution of (4.70). i.) Show that µX (t) = eAt E [X0 ]. ii.) Compute µX (t) directly for the IVPs in Section 4.1. ´ t iii.) Assume that m = 1 in (4.70) and write the Itó term as 0 BX(s; ·)dW(s). a.) Develop a formula for VarX (t). b.) Compute VarX (t) directly for IVP (4.5). c.) Compute CovX (t, s) for the IVP (4.5). iv.) Assume that E kX0 (·)kRp N < ∞, ∀p ≥ 2. a.) Use Itó’s formula to derive an estimate for E kX(t; ·)kRp N . b.) Prove that there exists a continuous function η : [0, T ] × [0, T ] −→ R such that
p E X(τ ; ·) − X(τ ′ ; ·) RN ≤ η p τ , τ ′ . c.) Interpret the results in (a) and (b) specifically for the IVPs in Section 4.1. v.) Convince yourself that {X(t; ω ) : 0 ≤ t ≤ T, ω ∈ Ω} is a Markov process.
4.9
Some Convergence Results
These results are natural extensions of those formulated in Section 3.7. You are encouraged to provide the details. For every n ∈ N, consider the IVP ( dXn (t; ω ) = An Xn (t; ω )dt + ∑m k=1 (Bk )n Xn (t; ω )dWk (t), (4.83) Xn (0; ω ) = (X0 )n (ω ), ω ∈ Ω.
© 2011 by Taylor & Francis Group, LLC
Homogenous Linear Stochastic Evolution Equations in RN
197
where 0 < t < T, ω ∈ Ω. Complete the following exercise to establish a generalization of Prop. 3.7.1. Exercise 4.9.1. i.) Formulate hypotheses that correspond to (H3.4) through (H3.6) for (4.83). ii.) Subtract (4.70) from the integrated version of (4.83) and use Lemma 4.4.3 to obtain an initial estimate for E kXn (t; ·) − X(t; ·)k2RN . iii.) Let ε > 0. Mimicking the proof of Prop. 3.7.1, scout ahead to determine estimates in the spirit of (3.162) through (3.164) so that the end result of the argument is the statement n ≥ N =⇒ kXn − XkC([0,T ];L2 (Ω;RN )) < ε . (4.84) Exercise 4.9.2. Argue that ∀0 ≤ t ≤ T, lim µXn (t) = µX (t), lim VarXn (t) = VarX (t).
n→∞
n→∞
(4.85)
Exercise 4.9.3. Interpret the results from Exercises 4.9.1 and 4.9.2 specifically for the IVPs in Section 4.1. In a similar fashion, we can approximate the solution of the deterministic IVP ( X′ (t) = AX(t), t > 0, (4.86) X(0) = X0 , by a sequence of strong solutions of appropriately chosen stochastic IVPs of the form (4.32). Following the development of Prop. 3.7.2, complete the following exercise. Exercise 4.9.4. i.) Let 0 < ε < 1. What stochastic IVP plays the role of (3.170) in this setting? ii.) Formulate the hypotheses that should replace (H3.7) and (H3.8). iii.) Formulate the generalization of Prop. 3.7.2 for this setting. iv.) Argue as in the proof of Prop. 3.7.2 to prove this proposition. Exercise 4.9.5. i.) D