Multiparameter Resources: An Introduction to Random Fields
Davar Khoshnevisan
Springer
Springer Monographs in Mathematics
Davar Khoshnevisan
Multiparameter Resources An Introduction to Random Fields
Davar Khoshnevisan Department of Mathematics University of Utah Salt Lake City, Ut 84112-0090
[email protected]
With 12 illustrations. Mathematics Subject Classification (2000): 60Gxx, 60G60 Library of Congress Cataloging-in-Publication Data Khoshnevisan, Davar. Multiparameter processes : an introduction to random fields / Davar Khoshnevisan. p. cm. — (Springer monographs in mathematics) Includes bibliographical references and index ISBN 0-387-95459-7 (alk. paper) 1. Random fields. I. Title. II. Series. QA274.45 .K58 2002 519.2′3—dc21 2002022927 Printed on acid-free paper. 2002 Springer-Verlag New York, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Manufacturing supervised by Jerome Basma. Camera-ready copy prepared from the author’s LaTeX files. Printed and bound by Edwards Brothers, Inc., Ann Arbor, MI. Printed in the United States of America. 9 8 7 6 5 4 3 2 1 ISBN 0-387-95459-7
SPIN 10869448
Springer-Verlag New York Berlin Heidelberg A member of BertelsmannSpringer Science+Business Media GmbH
Preface
This book aims to construct a general framework for the analysis of a large family of random fields, also known as multiparameter processes. The need for such a development was pointed out in Doob (1990, p. 47). Referring to the theory of one-parameter stochastic processes, Doob writes:1 Our definition of a stochastic process is historically conditioned and has obvious defects. In the first place there is no mathematical reason for restricting T to be a set of real numbers, and in fact interesting work has already been done in other cases. (Of course, the interpretation of t as time must then be dropped.) In the second place there is no mathematical reason for restricting the value assumed by the xt ’s to be numbers. There are a number of compelling reasons for studying random fields, one of which is that, if and when possible, multiparameter processes are a natural extension of existing one-parameter processes. More exciting still are the various interactions between the theory of multiparameter processes and other disciplines, including probability itself. For example, in this book the reader will learn of various connections to real and functional analysis, a modicum of group theory, and analytic number theory. The multiparameter processes of this book also arise in applied contexts such as mathematical statistics (Pyke 1985), statistical mechanics (Kuroda and Manaka 1998), and brain data imaging (Cao and Worsley 1999). 1 He
is referring to a stochastic process of the form (xt ; t ∈ T ).
vi
My writing philosophy has been to strike a balance between developing a reasonably general theory, while presenting applications and explicit calculations. This approach should set up the stage for further analysis and exploration of the subject, and make for a more lively approach. This book is in two parts. Part I is about the discrete-time theory. It also contains results that allow for the transition from discrete-time processes to continuous-time processes. In particular, it develops abstract random variables, parts of the theory of Gaussian processes, and weak convergence for continuous stochastic processes. Part II contains the general theory of continuous-time processes. Special attention is paid to processes with continuous trajectories, but some discontinuous processes will also be studied. In this part I will also discuss subjects such as potential theory for several Markov processes, the Brownian sheet, and some Gaussian processes. Parts I and II are influenced by the fundamental works of Doob, Cairoli, and Walsh. My goal has been to keep this book as self-contained as possible, in order to make it available to advanced graduate students in probability and analysis. To this I add that a more complete experience can only be gained through solving many of the problems that are scattered throughout the body of the text. At times, these in-text exercises ask the student to check some technical detail. At other times, the student is encouraged to apply a recently introduced idea in a different context. More challenging exercises are offered at the end of each chapter. Many of the multiparameter results of this book do not seem to exist elsewhere in a pedagogic manner. There are also a number of new theorems that appear here for the first time. When introducing a better-known subject (e.g., martingales or Markov chains), I have strived to construct the most informative proofs, rather than the shortest. This book would not exist had it not been for the extensive remarks, corrections, and support of R. Bass, J. Bertoin, K. Burdzy, R. Dalang, S. Ethier, L. Horv´ ath, S. Krone, O. L´evˆeque, T. Lewis, G. Milton, E. Nualart, T. Mountford, J. Pitman, Z. Shi, J. Walsh, and Y. Xiao. Their efforts have led to a much cleaner product. What errors remain are my own. I have enjoyed a great deal of technical support from P. Bowman, N. Beebe, and the editorial staff of Springer. The National Science Foundation and the North Atlantic Treaty Organization have generously supported my work on random fields over the years. My sincerest gratitude goes to them all. Finally, I wish to thank my dearest friend, and my source of inspiration, Irina Gushin. This book is dedicated to the memory of Victor Gushin, and to the recent arrival of Adrian V. Kh. Gushin. Davar Khoshnevisan, Salt Lake City, UT. March 2002
Contents
Preface
v
List of Figures
xv
General Notation
I
xvii
Discrete-Parameter Random Fields
1 Discrete-Parameter Martingales 1 One-Parameter Martingales . . . . . . . . . . 1.1 Definitions . . . . . . . . . . . . . . . 1.2 The Optional Stopping Theorem . . . 1.3 A Weak (1,1) Inequality . . . . . . . . 1.4 A Strong (p, p) Inequality . . . . . . . 1.5 The Case p = 1 . . . . . . . . . . . . . 1.6 Upcrossing Inequalities . . . . . . . . 1.7 The Martingale Convergence Theorem 2 Orthomartingales . . . . . . . . . . . . . . . . 2.1 Definitions and Examples . . . . . . . 2.2 Embedded Submartingales . . . . . . 2.3 Cairoli’s Strong (p, p) Inequality . . . 2.4 Another Maximal Inequality . . . . . 2.5 A Weak Maximal Inequality . . . . . .
1 . . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
3 4 4 7 8 9 9 10 12 15 16 18 19 20 22
viii
Contents
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
22 24 26 30 31 31 31 33 35 37 38 40 44
2 Two Applications in Analysis 1 Haar Systems . . . . . . . . . . . . . . . . . 1.1 The 1-Dimensional Haar System . . 1.2 The N -Dimensional Haar System . . 2 Differentiation . . . . . . . . . . . . . . . . 2.1 Lebesgue’s Differentiation Theorem . 2.2 A Uniform Differentiation Theorem 3 Supplementary Exercises . . . . . . . . . . . 4 Notes on Chapter 2 . . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
47 47 48 51 54 54 58 61 63
3 Random Walks 1 One-Parameter Random Walks . . . . . . 1.1 Transition Operators . . . . . . . . 1.2 The Strong Markov Property . . . 1.3 Recurrence . . . . . . . . . . . . . 1.4 Classification of Recurrence . . . . 1.5 Transience . . . . . . . . . . . . . . 1.6 Recurrence of Possible Points . . . 1.7 Recurrence–Transience Dichotomy 2 Intersection Probabilities . . . . . . . . . . 2.1 Intersections of Two Walks . . . . 2.2 An Estimate for Two Walks . . . . 2.3 Intersections of Several Walks . . . 2.4 An Estimate for N Walks . . . . . 3 The Simple Random Walk . . . . . . . . . 3.1 Recurrence . . . . . . . . . . . . . 3.2 Intersections of Two Simple Walks 3.3 Three Simple Walks . . . . . . . . 3.4 Several Simple Walks . . . . . . . 4 Supplementary Exercises . . . . . . . . . . 5 Notes on Chapter 3 . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
65 . 66 . 66 . 69 . 70 . 72 . 74 . 75 . 78 . 80 . 80 . 85 . 86 . 89 . 89 . 90 . 91 . 93 . 97 . 99 . 103
3
4 5
2.6 Orthohistories . . . . . . . 2.7 Convergence Notions . . . . 2.8 Topological Convergence . . 2.9 Reversed Orthomartingales Martingales . . . . . . . . . . . . . 3.1 Definitions . . . . . . . . . 3.2 Marginal Filtrations . . . . 3.3 A Counterexample . . . . . 3.4 Commutation . . . . . . . . 3.5 Martingales . . . . . . . . . 3.6 Conditional Independence . Supplementary Exercises . . . . . . Notes on Chapter 1 . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
Contents
4 Multiparameter Walks 1 The Strong Law of Large Numbers . . . . . 1.1 Definitions . . . . . . . . . . . . . . 1.2 Commutation . . . . . . . . . . . . . 1.3 A Reversed Orthomartingale . . . . 1.4 Smythe’s Law of Large Numbers . . 2 The Law of the Iterated Logarithm . . . . . 2.1 The One-Parameter Gaussian Case . 2.2 The General LIL . . . . . . . . . . . 2.3 Summability . . . . . . . . . . . . . 2.4 Dirichlet’s Divisor Lemma . . . . . . 2.5 Truncation . . . . . . . . . . . . . . 2.6 Bernstein’s Inequality . . . . . . . . 2.7 Maximal Inequalities . . . . . . . . . 2.8 A Number-Theoretic Estimate . . . 2.9 Proof of the LIL: The Upper Bound 2.10 A Moderate Deviations Estimate . . 2.11 Proof of the LIL: The Lower Bound 3 Supplementary Exercises . . . . . . . . . . . 4 Notes on Chapter 4 . . . . . . . . . . . . . .
ix
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
105 106 106 107 109 110 112 113 116 117 118 119 121 123 125 127 128 130 132 135
5 Gaussian Random Variables 1 The Basic Construction . . . . . . . . . . . . 1.1 Gaussian Random Vectors . . . . . . . 1.2 Gaussian Processes . . . . . . . . . . . 1.3 White Noise . . . . . . . . . . . . . . . 1.4 The Isonormal Process . . . . . . . . . 1.5 The Brownian Sheet . . . . . . . . . . 2 Regularity Theory . . . . . . . . . . . . . . . 2.1 Totally Bounded Pseudometric Spaces 2.2 Modifications and Separability . . . . 2.3 Kolmogorov’s Continuity Theorem . . 2.4 Chaining . . . . . . . . . . . . . . . . 2.5 H¨ older-Continuous Modifications . . . 2.6 The Entropy Integral . . . . . . . . . . 2.7 Dudley’s Theorem . . . . . . . . . . . 3 The Standard Brownian Sheet . . . . . . . . . 3.1 Entropy Estimate . . . . . . . . . . . 3.2 Modulus of Continuity . . . . . . . . . 4 Supplementary Exercises . . . . . . . . . . . . 5 Notes on Chapter 5 . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . .
137 137 137 140 142 144 147 148 149 153 158 160 165 167 170 172 172 173 175 178
6 Limit Theorems 181 1 Random Variables . . . . . . . . . . . . . . . . . . . . . . . 181 1.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . 182
x
Contents
2
3
4
5 6
II
1.2 Distributions . . . . . . . . . . . . . . 1.3 Uniqueness . . . . . . . . . . . . . . . Weak Convergence . . . . . . . . . . . . . . . 2.1 The Portmanteau Theorem . . . . . . 2.2 The Continuous Mapping Theorem . . 2.3 Weak Convergence in Euclidean Space 2.4 Tightness . . . . . . . . . . . . . . . . 2.5 Prohorov’s Theorem . . . . . . . . . . The Space C . . . . . . . . . . . . . . . . . . 3.1 Uniform Continuity . . . . . . . . . . 3.2 Finite-Dimensional Distributions . . . 3.3 Weak Convergence in C . . . . . . . . 3.4 Continuous Functionals . . . . . . . . 3.5 A Sufficient Condition for Pretightness Invariance Principles . . . . . . . . . . . . . . 4.1 Preliminaries . . . . . . . . . . . . . . 4.2 Finite-Dimensional Distributions . . . 4.3 Pretightness . . . . . . . . . . . . . . . Supplementary Exercises . . . . . . . . . . . . Notes on Chapter 6 . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
Continuous-Parameter Random Fields
7 Continuous-Parameter Martingales 1 One-Parameter Martingales . . . . . . . . . . 1.1 Filtrations and Stopping Times . . . . 1.2 Entrance Times . . . . . . . . . . . . . 1.3 Smartingales and Inequalities . . . . . 1.4 Regularity . . . . . . . . . . . . . . . . 1.5 Measurability of Entrance Times . . . 1.6 The Optional Stopping Theorem . . . 1.7 Brownian Motion . . . . . . . . . . . . 1.8 Poisson Processes . . . . . . . . . . . . 2 Multiparameter Martingales . . . . . . . . . . 2.1 Filtrations and Commutation . . . . . 2.2 Martingales and Histories . . . . . . . 2.3 Cairoli’s Maximal Inequalities . . . . . 2.4 Another Look at the Brownian Sheet . 3 One-Parameter Stochastic Integration . . . . 3.1 Unbounded Variation . . . . . . . . . 3.2 Quadratic Variation . . . . . . . . . . 3.3 Local Martingales . . . . . . . . . . . 3.4 Elementary Processes . . . . . . . . . 3.5 Simple Processes . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
183 184 185 186 188 188 189 190 193 193 195 196 199 200 201 202 204 207 210 213
215 . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .
217 217 218 221 222 223 226 226 228 230 233 233 234 235 236 239 239 242 245 246 247
Contents
4
5 6
3.6 Continuous Adapted Processes . . . . . . 3.7 Two Approximation Theorems . . . . . . 3.8 Itˆ o’s Formula . . . . . . . . . . . . . . . . 3.9 The Burkholder–Davis–Gundy Inequality Stochastic Partial Differential Equations . . . . . 4.1 Stochastic Integration . . . . . . . . . . . 4.2 Hyperbolic SPDEs . . . . . . . . . . . . . 4.3 Existence and Uniqueness . . . . . . . . . Supplementary Exercises . . . . . . . . . . . . . . Notes on Chapter 7 . . . . . . . . . . . . . . . . .
xi
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
248 250 251 253 255 256 257 260 263 266
8 Constructing Markov Processes 1 Discrete Markov Chains . . . . . . . . . . . 1.1 Preliminaries . . . . . . . . . . . . . 1.2 The Strong Markov Property . . . . 1.3 Killing and Absorbing . . . . . . . . 1.4 Transition Operators . . . . . . . . . 1.5 Resolvents and λ-Potentials . . . . . 1.6 Distribution of Entrance Times . . . 2 Markov Semigroups . . . . . . . . . . . . . 2.1 Bounded Linear Operators . . . . . 2.2 Markov Semigroups and Resolvents . 2.3 Transition and Potential Densities . 2.4 Feller Semigroups . . . . . . . . . . . 3 Markov Processes . . . . . . . . . . . . . . . 3.1 Initial Measures . . . . . . . . . . . 3.2 Augmentation . . . . . . . . . . . . 3.3 Shifts . . . . . . . . . . . . . . . . . 4 Feller Processes . . . . . . . . . . . . . . . . 4.1 Feller Processes . . . . . . . . . . . . 4.2 The Strong Markov Property . . . . 4.3 L´evy Processes . . . . . . . . . . . . 5 Supplementary Exercises . . . . . . . . . . . 6 Notes on Chapter 8 . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . . .
267 267 267 272 272 275 277 279 281 281 282 284 287 288 288 290 292 293 294 298 303 307 311
9 Generation of Markov Processes 1 Generation . . . . . . . . . . . . . 1.1 Existence . . . . . . . . . . 1.2 The Hille–Yosida Theorem 1.3 The Martingale Problem . . 2 Explicit Computations . . . . . . . 2.1 Brownian Motion . . . . . . 2.2 Isotropic Stable Processes . 2.3 The Poisson Process . . . . 2.4 The Linear Uniform Motion
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
313 313 314 315 317 320 320 322 325 326
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
xii
Contents
3
4
5 6
The Feynman–Kac Formula . . . . . . . . . . 3.1 The Feynman–Kac Semigroup . . . . . 3.2 The Doob–Meyer Decomposition . . . Exit Times and Brownian Motion . . . . . . . 4.1 Dimension One . . . . . . . . . . . . . 4.2 Some Fundamental Local Martingales 4.3 The Distribution of Exit Times . . . . Supplementary Exercises . . . . . . . . . . . . Notes on Chapter 9 . . . . . . . . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
326 326 328 329 330 331 335 339 340
10 Probabilistic Potential Theory 1 Recurrent L´evy Processes . . . . . . . . . . 1.1 Sojourn Times . . . . . . . . . . . . 1.2 Recurrence of the Origin . . . . . . . 1.3 Escape Rates . . . . . . . . . . . . . 1.4 Hitting Probabilities . . . . . . . . . 2 Hitting Probabilities for Feller Processes . . 2.1 Strongly Symmetric Feller Processes 2.2 Balayage . . . . . . . . . . . . . . . 2.3 Hitting Probabilities and Capacities 2.4 Proof of Theorem 2.3.1 . . . . . . . 3 Explicit Computations . . . . . . . . . . . . 3.1 Brownian Motion and Capacities . . 3.2 Stable Densities and Subordination . 3.3 Asymptotics for Stable Densities . . 3.4 Stable Processes and Capacities . . . 3.5 Relation to Hausdorff Dimension . . 4 Supplementary Exercises . . . . . . . . . . . 5 Notes on Chapter 10 . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . .
343 344 344 347 350 353 360 360 362 367 368 373 373 377 380 382 385 386 388
11 Multiparameter Markov Processes 1 Definitions . . . . . . . . . . . . . . . . . . . 1.1 Preliminaries . . . . . . . . . . . . . 1.2 Commutation and Semigroups . . . 1.3 Resolvents . . . . . . . . . . . . . . . 1.4 Strongly Symmetric Feller Processes 2 Examples . . . . . . . . . . . . . . . . . . . 2.1 General Notation . . . . . . . . . . . 2.2 Product Feller Processes . . . . . . . 2.3 Additive L´evy Processes . . . . . . . 2.4 Product Process . . . . . . . . . . . 3 Potential Theory . . . . . . . . . . . . . . . 3.1 The Main Result . . . . . . . . . . . 3.2 Three Technical Estimates . . . . . . 3.3 Proof of Theorem 3.1.1: First Half .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
. . . . . . . . . . . . . .
391 391 392 395 397 398 401 401 402 405 407 408 408 410 413
Contents
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
418 419 419 424 426 428 429 433 435 438 438 441 443 448 450 453
12 The Brownian Sheet and Potential Theory 1 Polar Sets for the Range of the Brownian Sheet . . 1.1 Intersection Probabilities . . . . . . . . . . 1.2 Proof of Theorem 1.1.1: Lower Bound . . . 1.3 Proof of Lemma 1.2.2 . . . . . . . . . . . . 1.4 Proof of Theorem 1.1.1: Upper Bound . . . 2 The Codimension of the Level Sets . . . . . . . . . 2.1 The Main Calculation . . . . . . . . . . . . 2.2 Proof of Theorem 2.1.1: The Lower Bound . 2.3 Proof of Theorem 2.1.1: The Upper Bound 3 Local Times as Frostman’s Measures . . . . . . . . 3.1 Construction . . . . . . . . . . . . . . . . . 3.2 Warmup: Linear Brownian Motion . . . . . 3.3 A Variance Estimate . . . . . . . . . . . . . 3.4 Proof of Theorem 3.1.1: General Case . . . 4 Supplementary Exercises . . . . . . . . . . . . . . . 5 Notes on Chapter 12 . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
455 455 456 457 460 468 472 473 474 476 477 478 480 485 488 491 493
4
5
6 7
III
3.4 Proof of Theorem 3.1.1: Second Half . . Applications . . . . . . . . . . . . . . . . . . . . 4.1 Additive Stable Processes . . . . . . . . 4.2 Intersections of Independent Processes . 4.3 Dvoretzky–Erd˝ os–Kakutani Theorems . 4.4 Intersecting an Additive Stable Process 4.5 The Range of a Stable Process . . . . . 4.6 Extension to Additive Stable Processes 4.7 Stochastic Codimension . . . . . . . . . α-Regular Gaussian Random Fields . . . . . . . 5.1 Stationary Gaussian Processes . . . . . 5.2 α-Regular Gaussian Fields . . . . . . . . 5.3 Proof of Theorem 5.2.1: First Part . . . 5.4 Proof of Theorem 5.2.1: Second Part . . Supplementary Exercises . . . . . . . . . . . . . Notes on Chapter 11 . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
xiii
Appendices
497
A Kolmogorov’s Consistency Theorem B Laplace Transforms 1 Uniqueness and Convergence Theorems 1.1 The Uniqueness Theorem . . . . 1.2 The Convergence Theorem . . . 1.3 Bernstein’s Theorem . . . . . . .
499
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
501 501 502 503 505
xiv
Contents
2
A Tauberian Theorem . . . . . . . . . . . . . . . . . . . . . 506
C Hausdorff Dimensions and Measures 1 Preliminaries . . . . . . . . . . . . . 1.1 Definition . . . . . . . . . . . 1.2 Hausdorff Dimension . . . . . 2 Frostman’s Theorems . . . . . . . . 2.1 Frostman’s Lemma . . . . . . 2.2 Bessel–Riesz Capacities . . . 2.3 Taylor’s Theorem . . . . . . . 3 Notes on Appendix C . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
511 511 511 515 517 517 520 523 525
D Energy and Capacity 1 Preliminaries . . . . . . . . . . . . . . . . . . . . . 1.1 General Definitions . . . . . . . . . . . . . . 1.2 Physical Interpretations . . . . . . . . . . . 2 Choquet Capacities . . . . . . . . . . . . . . . . . . 2.1 Maximum Principle and Natural Capacities 2.2 Absolutely Continuous Capacities . . . . . 2.3 Proper Gauge Functions and Balayage . . . 3 Notes on Appendix D . . . . . . . . . . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
527 527 527 530 533 533 537 539 540
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
References
543
Name Index
565
Subject Index
572
List of Figures
1.1 1.2 1.3
Orthohistories . . . . . . . . . . . . . . . . . . . . . . . . Orthohistories . . . . . . . . . . . . . . . . . . . . . . . . Histories . . . . . . . . . . . . . . . . . . . . . . . . . . .
5.1
Covering by balls . . . . . . . . . . . . . . . . . . . . . . 160
9.1
Gambler’s ruin . . . . . . . . . . . . . . . . . . . . . . . . 335
10.1
Covering balls . . . . . . . . . . . . . . . . . . . . . . . . 345
11.1 11.2
Planar Brownian motion . . . . . . . . . . . . . . . . . . 431 Additive Brownian motion . . . . . . . . . . . . . . . . . 434
12.1 12.2 12.3 12.4
Planar Brownian sheet (aerial) . . . Planar Brownian sheet (portrait) . Planar Brownian sheet (side) . . . . The zero set of the Brownian sheet
C.1
Cantor’s set . . . . . . . . . . . . . . . . . . . . . . . . . 516
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
22 23 32
458 458 458 473
This page intentionally left blank
General Notation
While it is generally the case that the notation special to each chapter is independent of that in the remainder of the book, there is much that is common to the entire book. These items are listed below.
Euclidean Spaces, Integers, etc. The collection of all real (nonnegative real) numbers is denoted by R (R+ ), positive (nonnegative) integers by N (N0 and/or Z+ ). Finally, the rationals (nonnegative rationals) are written as Q (Q+ ). The latter spaces are endowed with their standard Borel topologies and Borel σ-fields which will also be referred to as Borel fields. Recall that the Borel field on a topological space X is the σ-field generated by all open subsets of X; that is, the smallest σ-field that contains all open subsets of X. The sequence space p is the usual one: For any p > 0, pdesignates the p collection of all sequences a = (ak ; k ≥ 1) such that k |ak | < ∞. ∞ As usual, stands for all bounded sequences. When ∞ > p ≥ 1, these p spaces can be normed by ap = { k |ak |p }1/p . Using these norms in turn, we can norm the Euclidean space Rk in various ways. Throughout, we will use the following two norms: (a) the ∞ norm, which is |x| = max1≤j≤k |x(j) |, for x ∈ Rk ; and (b) the 2 norm, which is k 1 x = { j=1 |x(j) |2 } 2 .
xvii
Product Spaces Throughout, the “dimension” numbers d and N are reserved for the spatial and temporal dimension, respectively. Given any two sets F and T , the set F T is defined as the collection of all functions f : T → F . When F is a topological space, F T is often endowed with the product topology; cf. Appendix D. If m ∈ N, F m is the usual product space
F
m
m times = F × ··· × F .
This, too, is often endowed with the product topology if and when F is topological. Throughout, the ith coordinate of any point s ∈ Rm is written as s(i) . We need the following special order structure on the Rm : Whenever s, t ∈ Rm , we write s t (s ≺ t) when for i = 1, . . . , m, s(i) ≤ t(i) (s(i) < t(i) ). Occasionally, we may write this as t s (or t s). Whenever s, t ∈ Rm , st designates the point whose is s(i) ∧ t(i) for all i = 1, . . . , m. m ith(j)coordinate (j) If s t, then [s, t] = j=1 [s , t ]. We will refer to [s, t] as a rectangle (or an m-dimensional rectangle). When this rectangle is of the form [s, s + (r, . . . , r)] for some r ∈ R1+ and s ∈ Rm , then it is a (hyper)cube. If s ≺ t, one can similarly define ]s, t[, [s, t[, and ]s, t[. For instance, ]s, t] = m (j) (j) m j=1 ]s , t ]. All subsets of R automatically inherit the order structure of Rm . This way, s t makes the same sense in Nk as it does in Rk , for instance.
Probability and Measure Theory Unless it is stated to the contrary, the underlying probability space is nearly always denoted by (Ω, G, P), where Ω is the so-called sample space, G is a σ-field of subsets of Ω, and P is a probability measure on G. Unless it is specifically stated otherwise, the corresponding expectation operator is always denoted by E. While intersections of σ-fields are themselves σ-fields, their unions are not always. Thus, when F1 and F2 are two σ-fields, we write F1 ∨ F2 to mean the smallest σ-field that contains F1 ∪ F2 . More generally, for any index set A, we write ∨α∈A Fα for the smallest σ-field that contains all of the σ-fields (Fα ; α ∈ A). An important function is the indicator function (called the characteristic function in the analysis literature): In any space for any set A in that space, 1lA denotes the function x → 1lA (x) that is defined by 1lA (x) = 1 if x ∈ A and 1lA (x) = 0 if x ∈ A. In particular, if A is an event in the probability space, 1lA is the indicator function of the event A.
xix
Throughout, “a.s.” is treated synonymously to “almost surely,” “Palmost everywhere,” “almost sure,” or “P-almost sure,” depending on which is more applicable. Both “iid” and “i.i.d.” stand for “independent, identically distributed.” When µ is a (nonnegative) measure on a measure space (Ω, F), Lp (µ) denotes the collection of all real-valued, p-times µ-integrable functions on Ω. In particular, we use this notation quite often when µ is a probability measure P. In this case, we can interpret Lp (P) as the collection of all random variables whose absolute value has p finite moments. (You should recall that Lp spaces are in fact spaces of equivalence relations, where we say that f and g are equivalent when they are equivalent µ-almost everywhere.) A special case is made for the Lp spaces with respect to Lebesgue’s measure (on Euclidean spaces): When E ⊂ Rk is Borel (or more generally, Lebesgue) measurable, Lp (E) (or sometimes Lp E) denotes the collection of all p-times continuously differentiable functions that map E into R. For instance, we write Lp [0, 1] and/or Lp ([0, 1]) for the collection of (equivalence classes of) all p-times integrable functions on [0, 1]. Depending on the point that is being made, a stochastic process (Xt : t ∈ T ) (where T is some indexing set) is identified with the “randomly chosen function” t → Xt . Throughout, Leb denotes Lebesgue’s measure regardless of the dimension of the underlying Euclidean space.
This page intentionally left blank
Part I
Discrete-Parameter Random Fields
1
This page intentionally left blank
1 Discrete-Parameter Martingales
In this chapter we develop the basic theory of multiparameter martingales indexed N or NN by a countable subset of RN + , usually N 0 . As usual, N = {1, 2, . . .}, N0 = {0, 1, 2, . . .}, and N denotes a fixed positive integer. We will be assuming that the reader is quite familiar with the standard aspects of the theory of martingales indexed by a discrete one-parameter set. However, we have provided a primer section on this subject to reacquaint the reader with some of the one-parameter techniques and notations; see Section 1 below. The main thrust of this chapter is its discussion of maximal inequalities, since they are at the very heart of the theory of multiparameter martingales. Even in the simple setting of one-parameter random walks, maximal inequalities are considered deep results to this day. For instance, consider n i.i.d. random variables ξ1 , . . . , ξn and define the corresponding random walk as Sn = ξ1 + · · · + ξn . Then, Kolmogorov’s maximal inequality states that whenever ξ’s have mean 0, for all λ > 0, 1 P max |Sj | ≥ λ ≤ E{|Sn |}. 1≤j≤n λ On the other hand, a straightforward application of Chebyshev’s inequality implies that for all λ > 0, P(|Sn | ≥ λ) ≤ λ1 E{|Sn |}, and this is sharp, in general. Thus, roughly speaking, Kolmogorov’s maximal inequality asserts that the behavior of the entire partial sum process j → Sj (1 ≤ j ≤ n) is controlled by the value of the latter process at time n. The aforementioned maximal property leads to one of the key steps in the usual proof of Kolmogorov’s strong law of large numbers and is by no means a singular property. Indeed, maximal inequalities are precisely the tools required to prove strong convergence theorems in the theory of multiparameter martingales (Cairoli’s second convergence theorem, Theorem 2.8.1), as well as Lebesgue’s differentiation theorem (Theorem 2.1.1, Chapter 2). They are also an essential
4
1. Discrete-Parameter Martingales
ingredient in the analysis of the intersections of several random walks (Theorem 2.2.1, Chapter 3), the law of the iterated logarithm (Section 2.6, Chapter 4), regularity theory of general stochastic processes (Section 2.4, Chapter 5), and weak convergence of measures and processes in the space of continuous functions (Theorem 3.3.1, Chapter 6). You might have noted that we have chosen a discretetime example for every chapter in Part I of this book! Suffice it to say that Part II also relies heavily on maximal inequalities, and we now proceed with our treatment of discrete-parameter martingales without further ado. Let (Ω, G, P) be a probability space. In this chapter we will discuss martingales N on (Ω, G, P) that are indexed by NN 0 and sometimes N . Before proceeding further, the reader should become familiar with the notation described in the preamble to this book.
1 One-Parameter Martingales This section is not a comprehensive introduction to one-parameter martingales. Rather, it serves to remind the reader of some of the key methods and concepts as well as familiarize him or her with the notation. Further details can be found in the Supplementary Exercises.
1.1 Definitions Suppose F = (Fk ; k ≥ 0) is a collection of sub–σ-fields of the underlying σ-field G. We say that F is a (discrete-time, one-parameter) filtration if for all k ≥ 0, Fk ⊂ Fk+1 . By a stochastic process, or a random process, we mean a collection of random variables that are indexed by a possibly arbitrary set. A stochastic process M = (Mk ; k ≥ 0) is adapted to the filtration F if for all k ≥ 0, Mk is Fk -measurable. A stochastic process M is a submartingale (with respect to the filtration F) if 1. M is adapted to F; 2. for all k ≥ 0, E{|Mk |} < ∞; that is, Mk ∈ L1 (P) for all k ≥ 0; and 3. for all k ≥ 0, E[Mk+1 | Fk ] ≥ Mk , almost surely. We say that M is a supermartingale if −M is a submartingale. If M is both a supermartingale and a submartingale, then it is a martingale. We will refer to M as a smartingale if it is either a sub- or a supermartingale. By Jensen’s inequality, if M is a nonnegative submartingale, Ψ is convex nondecreasing on [0, ∞[, and if E{|Ψ(Mk )|} < ∞ for all k ≥ 0, then (Ψ(Mk ); k ≥ 0) is also a submartingale.
1 One-Parameter Martingales
5
Exercise 1.1.1 (RandomWalks) Suppose ξ1 , ξ2 , . . . are i.i.d. mean 0 n random variables. Let Sn = j=1 ξj (n = 1, 2, . . .) denote the corresponding partial sum process that is also known as a random walk. If S0 = 0 and if Fn denotes the σ-field generated by ξ1 , . . . , ξn (n = 0, 1, 2 . . .), show that S = (Sn ; n ≥ 0) is a martingale with respect to F = (Fk ; k ≥ 0). Exercise 1.1.2 (Branching Processes) Write X0 = 1 and define Xn Xn+1 = =1 ξ,n (n = 0, 1, . . .), where the ξ’s are all i.i.d., integrable random variables that take their values in N0 . Let Fm denote the σ-field
generated by X1 , . . . , Xm (m = 0, 1, . . .) and show that µ−n Xn ; n ≥ 0 is a martingale with respect to F = (Fn ; n ≥ 0), where µ = E[ξ1,1 ]. The stochastic process X is a branching process and, quite often, arises in the modeling of biological systems. For instance, suppose each individual gene in a given generation has a chance to give birth to a random number of genes (its offspring in the following generation). If the birth mechanisms are all i.i.d., from individual to individual and from generation to generation, and if the entire population starts out with one individual in generation 0, the above Xn denotes the total number of individuals in generation n, for appropriately chosen birth numbers. Exercise 1.1.3 (Random Stick-Breaking) Let X0 = 1 denote the length of a stick at time 0. Let X1 be a random variable picked uniformly Xn+1 to be picked from [0, X0 ] and, conditionally on {X 1 , . . . , Xn }, define
uniformly from [0, Xn ]. Show that 2n Xn ; n ≥ 0 is a martingale with respect to F = (Fn ; n ≥ 0), where Fn denotes the σ-field generated by X1 , . . . , Xn . Among other things, this process models breaking the “stick” [0, 1] in successive steps. Suppose T is a random variable that takes its values in N0 ∪ {∞}. Then, we say that T is a stopping time (with respect to F) if for all k ≥ 0, (T > k) ∈ Fk . Equivalently, T is a stopping time if for all k ≥ 0, T = k ∈ Fk . This is a consequence of the properties of filtrations, together with the decomposition
T =k = T >k−1 ∩ T >k . In order to emphasize the underlying filtration F, sometimes we say that T is an F-stopping time. There are many natural stopping times, as the following shows. Exercise 1.1.4 Nonrandom constants are stopping times. Also, if T1 , T2 , . . . are stopping times, so are • min(T1 , T2 ) = T1 ∧ T2 ; • max(T1 , T2 ) = T1 ∨ T2 ; • T1 + T2 ;
6
1. Discrete-Parameter Martingales
• inf n Tn , supn Tn , lim inf n Tn , and lim supn Tn . Finally, if X is an adapted process and A is a Borel subset of R, then T is a stopping time, where T = inf(k ≥ 0 : Xk ∈ A) and inf ∅ = ∞. For any stopping time T , define ∞
FT = A ∈ Fn : A ∩ (T ≤ k) ∈ Fk , for all k ≥ 0 . n=1
Exercise 1.1.5 Show that (a) this extends the definition of Fk when T ≡ k for some nonrandom k; and (b) an alternative definition of FT would be ∞
Fn : A ∩ (T = k) ∈ Fk , for all k ≥ 0 . FT = A ∈ n=1
Also show that, in general, FT is a σ-field and T is an FT -measurable random variable. Furthermore, show that when T is an a.s. finite F-stopping time and when M is adapted to F, MT is an FT -measurable random variable.1 Finally, demonstrate that whenever T1 and T2 are stopping times that satisfy T1 ≤ T2 , we have FT1 ⊂ FT2 . The choice of the σ-field FT is made to preserve many of the fundamental properties of martingales. We conclude this subsection with an example of this phenomenon. Recall that 1lA is the indicator function of the measurable event A. Theorem 1.1.1 Suppose F = (Fk ; k ≥ 1) is a filtration and Y is an integrable random variable. Define M = (Mk ; k ≥ 1) by Mk = E[Y | Fk ]. Then, M is a martingale with respect to F. Moreover, if T is a stopping time with respect to F, MT 1l(T <∞) = E[Y | FT ]1l(T <∞) , a.s. Equivalently, for any j ≥ 1, E[Y | Fj ] = E[Y | FT ], on (T = j). It is important to note that there is something that needs to be proved here. This is not a mere consequence of “replacing” FT by Fj on (T = j). Proof Clearly, M is adapted. By Jensen’s inequality, sup E{|Mk |} ≤ E{|Y |} < ∞. k
1 Recall
that the random variable MT is defined ω by ω as MT (ω) = MT (ω) (ω).
1 One-Parameter Martingales
7
Recall the towering property of conditional expectations: If H1 ⊂ H2 are two σ-fields, then for any integrable random variable U , (1) E[U | H1 ] = E E{U | H2 } H1 = E E{U | H1 } H2 , almost surely. The martingale property of M follows from the towering property of conditional expectations, together with the fact that Fk ⊂ Fk+1 . For any A ∈ FT , E[E{Y | FT }1l(T =j) 1lA ] = E[Y 1l(T =j) 1lA ], since A ∩ (T = j) ∈ FT . On the other hand, A ∩ (T = j) ∈ Fj implies that E[Y 1l(T =j) 1lA ] = E[E{Y | Fj }1l(T =j) 1lA ] = E[MT 1l(T =j) 1lA ]. Since MT 1l(T =j) and E[Y | FT ]1l(T =j) are both FT -measurable random variables, the result follows.
1.2 The Optional Stopping Theorem Perhaps the single most important fact about smartingales is Doob’s optional stopping theorem;2 see (Doob 1990; Hunt 1966). Theorem 1.2.1 (The Optional Stopping Theorem) Suppose M is a submartingale with respect to a filtration F. Then, for any integer k ≥ 0 and all F-stopping times T1 and T2 with T1 ≤ T2 ≤ k, E[MT2 | FT1 ] ≥ MT1 ,
a.s.
Proof For any A ∈ FT1 , 2 −1 T
E (MT2 − MT1 )1lA = E Mj+1 − Mj 1lA
j=T1
=
k
E (Mj+1 − Mj )1lA∩(T1 ≤j
j=0
On the other hand, for all j ≥ 0, A ∩ (T1 ≤ j) and (T2 > j) are both in Fj. Hence, so is B = A ∩ (T1 ≤ j < T2 ). By the submartingale property, E (Mj+1 − Mj )1lB ] ≥ 0. This shows that for all A ∈ FT1 , E MT1 1lA ≤ E MT2 1lA , which is the desired conclusion.
2 In the general theory of processes, stopping times are known as optional times, whence the name.
8
1. Discrete-Parameter Martingales
Exercise 1.2.1 (Doob’s Decomposition) Suppose X1 , X2 , . . . are integrable random variables and let Fk denote the σ-field generated by X1 , . . . , Xk (k = 1, 2, . . .). Let X0 = E[X1 ] and let F0 = {∅, Ω} be the trivial σ-field. Show that M = (Mk ; k ≥ 1) is a martingale with respect to F = (Fk ; k ≥ 1), where Mk =
k
X − E[X | F−1 ] ,
k ≥ 1.
=1
In particular, show that every submartingale can be written as the sum of a martingale and an increasing process. Exercise 1.2.2 Use Theorem 1.1.1 and Exercise 1.2.1, in conjunction, to give another proof of the optional stopping theorem, Theorem 1.2.1. This proof is due to G. A. Hunt; cf. (Dellacherie and Meyer 1982; Hunt 1966) for this and much more. The following, perhaps more standard, form of the optional stopping theorem is an immediate corollary of the above: Corollary 1.2.1 If M is a submartingale and T is an F-stopping time, then (MT ∧k ; k ≥ 0) is a submartingale. Many of the important results of martingale theory are consequences of clever applications of the above. We list some of them in order.
1.3 A Weak (1,1) Inequality Suppose M is a submartingale. A strong (p, q) maximal inequality is one of the form E[max0≤i≤k |Mi |p ] ≤ CE{|Mk |q }, where C is a positive finite constant that may depend only on p and q. When p = q = 1, such a result typically does not hold. Instead, one ought to prove a weak (1,1) inequality that states that the tails of the distribution of the maximum of a submartingale are well controlled by the size of the expectation of the submartingale. More precisely, we have the following theorem. Theorem 1.3.1 (Doob’s Maximal Inequality) If M is a nonnegative submartingale, λ > 0 is a real number, and k ≥ 0 is an integer, then P(Mk∗ ≥ λ) ≤
1 E[Mk 1l(Mk∗ ≥λ) ], λ
where Mk∗ = max0≤i≤k Mi . Typically, one uses the above as follows: Under the above conditions, for all λ > 0 and k ≥ 0, 1 P(Mk∗ ≥ λ) ≤ E[Mk ]. λ
1 One-Parameter Martingales
9
Proof Define T = inf(i ≥ 0 : Mi ≥ λ), where inf ∅ = ∞. Then, T is a F-stopping time and (Mk∗ ≥ λ) is nothing but the event (T ≤ k). Note that M is nonnegative. Moreover, on (T < ∞), MT ≥ λ. Consequently, MT ∧k 1l(T ≤k) ≥ λ · 1l(T ≤k) . Since (T ≤ k) ∈ FT ∧k and T ∧ k ≤ k, we can apply Theorem 1.2.1 to the stopping times T ∧ k and k to see that E[MT ∧k 1l(T ≤k) ] ≤ E[Mk 1l(T ≤k) ].
This implies the result.
1.4 A Strong (p, p) Inequality It turns out that Theorem 1.3.1 implies a strong (p, p) inequality if p > 1. Theorem 1.4.1 (Doob’s Strong Lp (P) Inequality) If p > 1, then for any nonnegative submartingale M = (Mk ; k ≥ 0) and all integers k ≥ 0, p p E max Mip ≤ E[Mkp ]. 0≤i≤k p−1 Proof Without loss of generality, we may assume that E[Mkp ] < ∞; otherwise, there is nothing to prove. Since p > 1, Jensen’s inequality shows that Mkp is also a submartingale. In particular, check that k E[Mjp ] ≤ kE[Mkp ] < ∞. E max Mip ≤ 0≤i≤k
j=1
We integrate Theorem 1.3.1 by parts and use the notation there to obtain Mk∗ ∞ ∗ p p−1 ∗ p−2 λ P(Mk ≥ λ) dλ ≤ pE λ dλ · Mk . E{|Mk | } = p 0
0
We have used Fubini’s theorem. Therefore, p p
p−1
1 E{|Mk∗ |p } ≤ E{|Mk∗ |p−1 ·Mk } ≤ E{|Mk∗ |p } p E[Mkp ] p , p−1 p−1 by H¨ older’s inequality. The result follows readily from this.
1.5 The Case p = 1 Our proof of Theorem 1.4.1 breaks down when p = 1. However, it does show that ∞ ∞ 1 E[Mk∗ 1l(Mk∗ ≥1) ] = E[Mk 1l(Mk∗ ≥λ) ] dλ P(Mk∗ ≥ λ) dλ ≤ λ 1 1 Mk∗ 1 dλ = E[Mk ln+ Mk∗ ], = E Mk 1l(Mk∗ ≥1) λ 1
10
1. Discrete-Parameter Martingales
where ln+ x = ln(x ∨ 1). Therefore, E[Mk∗ ] ≤ 1 + E[Mk ln+ Mk∗ ]. We will have need for the following inequality: For all w ≥ 0, ln w ≤ 1e w.3 Apply this with w = xy to see that whenever 0 ≤ x ≤ y, x ln y ≤ x ln+ x+ 1e y. We have proven the following weak (1, 1) inequality. Theorem 1.5.1 If M = (Mk ; k ≥ 0) is a nonnegative submartingale and k ≥ 0, e 1 + E[Mk ln+ Mk ] . E max Mi ≤ 0≤i≤k e−1 Exercise 1.5.1 Suppose X and Y are nonnegative random variables such that for all λ > 0, 1 P(Y > λ) ≤ E[X1l(Y >λ) ]. λ Show that if E[X{ln+ X}k ] is finite for some k ≥ 1, so is E[Y {ln+ Y }k−1 ]. This is from Sucheston (1983, Corollary 1.4). Exercise 1.5.2 Suppose M 1 , M 2 , . . . are nonnegative submartingales, and that for any j ≥ 0, limn→∞ E{Ψ(Mjn )} = 0, where Ψ(x) = x ln+ x. Prove that for any integer k ≥ 0, lim max Mjn = 0,
n→∞ j≤k
where the limit takes place in L1 (P).
1.6 Upcrossing Inequalities Given a submartingale M and two real numbers a < b, let T0 = inf( ≥ 0 : M ≤ a), and for all j ≥ 1, define inf( > Tj−1 : M ≥ b), if j is odd, Tj = inf( > Tj−1 : M ≤ a), if j is even, with the usual stipulation that inf ∅ = ∞. These are the upcrossing times of the interval [a, b]. Furthermore, for all j ≥ 1, MTj ≥ b if j is odd and MTj ≤ a if j is even. For all k ≥ 1, define Uk [a, b] = sup(0 ≤ j ≤ k : T2j < ∞), 3 To verify this, you need only check that g(w) = ln w − and g(e) = 0.
1 w e
is maximized at w = e
1 One-Parameter Martingales
11
where sup ∅ = 0. In words, Uk [a, b] represents the total number of upcrossings of the interval [a, b] made by the (random) numerical sequence (Mi ; 0 ≤ i ≤ k). Theorem 1.6.1 (Doob’s Upcrossing Inequality) If M = (Mk ; k ≥ 0) is a submartingale, a < b, and k ≥ 0, then E{Uk [a, b]} ≤
|a| + E{|Mk |} . b−a
It is also possible to derive downcrossing inequalities for supermartingales; cf. Exercise 1.6.1 below. Proof By considering the submartingale (Mk − a)+ instead of M , we can assume without loss of generality that a = 0 and that M is nonnegative. For all j ≥ 0, define τj = Tj ∧k, and note that the τj ’s are nondecreasing, bounded stopping times. Clearly, [Mτj+1 − Mτj ] ≥ bUk [0, b]. (1) j even
On the other hand, by the optional stopping theorem (Theorem 1.2.1), E[Mτj ] is increasing in j. Thus, since we have a finite sum, we can interchange expectations with sums to obtain Mτj+1 − Mτj = E Mτj+1 − Mτj ≥ 0. E j odd
j odd
Adding this to equation (1) above, we obtain the result. (Why? That is, what if for all j, τj < k?) Exercise 1.6.1 Let M = (Mk ; k ≥ 0) denote a supermartingale with respect to a filtration F = (Fk ; k ≥ 0). Show that whenever 0 ≤ a < b, E{Dk [a, b]} ≤
E[X1 ∧ b] − E[Xn ∧ b] , b−a
where Dk [a, b] denotes the number of downcrossings of the interval [a, b] made by the sequence (Mi ; 0 ≤ i ≤ k), i.e., Dk [a, b] = Uk [−b, −a]. Doob’s upcrossing inequality contains a prefatory but still useful formulation of the weak (1,1) inequality. Indeed, note that in the special case where M is a martingale,
P max |Mj | ≥ λ ≤ P(|M0 | ≥ 12 λ) + P max |Mj − M0 | ≥ 12 λ . 0≤j≤k
0≤j≤k
But |Mj − M0 | is a nonnegative submartingale. Let Uk (λ) denote the number of upcrossings of [0, λ] made by this submartingale before time k. Then,
12
1. Discrete-Parameter Martingales
by first applying Chebyshev’s inequality and then Doob’s upcrossing inequality (Theorem 1.6.1), we obtain P
max |Mj | ≥ λ ≤ P(|M0 | ≥ 12 λ) + P(Uk ( 12 λ) ≥ 1)
0≤j≤k
2 E{|M0 |} + E[Uk ( 12 λ)] λ 2 2 ≤ E{|M0 |} + E{|Mk − M0 |} λ λ 4 2 ≤ E{|M0 |} + E{|Mk |}. λ λ ≤
Since E{|M0 |} ≤ E{|Mk |}, we obtain P
6 max |Mj | ≥ λ ≤ E{|Mk |}. 0≤j≤k λ
This is essentially the weak (1,1) inequality (Theorem 1.3.1) with a slightly worse constant. (If M0 = 0, check that in the above, the constant 6 can be improved to the constant 1 of Theorem 1.3.1.)
1.7 The Martingale Convergence Theorem Recall that a stochastic process X = (Xk ; k ≥ 0) is Lp (P)-bounded (or bounded in Lp (P)) for some p > 0 if supk≥0 E{|Mk |p } < ∞. Theorem 1.7.1 (Doob’s Convergence Theorem) If M is an L1 (P)bounded submartingale, then M∞ = limk→∞ Mk exists almost surely, and M∞ ∈ L1 (P). If M is uniformly integrable, then Mk → M∞ in L1 (P) and Mk ≤ E[M∞ | Fk ], a.s. Finally, if M is Lp (P)-bounded for some p > 1, then Mk → M∞ , in Lp (P), as well. Among other things, Chatterji (1967, 1968) has constructed a proof of Doob’s convergence theorem that is based solely on Doob’s maximal inequality (Theorem 1.3.1) and the optional stopping theorem (Theorem 1.2.1). This proof was later discovered independently in Lamb (1973) and is developed in Supplementary Exercise 3. The argument described below is closer to the original proof of J. L. Doob and is based on the upcrossing inequality. Proof Note that k → Uk [a, b] is an increasing map. Therefore, by Lebesgue’s monotone convergence theorem, if M is bounded in L1 (P), Doob’s upcrossing inequality (Theorem 1.6.1) implies that for all a < b, (1) E sup Uk [a, b] < ∞. k≥0
1 One-Parameter Martingales
13
For all a < b, define the measurable event
Na,b = lim inf Mk ≤ a < b ≤ lim sup Mk . k
k
Then, by equation (1), P(Na,b ) = 0 for all a < b, for otherwise, with positive probability, [a, b] is upcrossed infinitely many times, which would contradict equation (1). Consequently,
P Na,b = 0, a,b∈Q:a
where, as usual, Q denotes the collection of all rationals. Thus, with probability one, lim supk Mk = lim inf k Mk , which gives the desired limit M∞ . Moreover, this is finite, almost surely. In fact, applying Fatou’s lemma, we arrive at E{|M∞ |} < ∞. If Mk is uniformly integrable, then we immediately have Mk → M∞ in L1 (P). If Mk is also Lp (P) bounded for some p > 1, then, by the strong (p, p) inequality (Theorem 1.4.1), supk |Mk | is in Lp (P). In particular, |Mk |p is uniformly integrable. It remains to prove that under uniform integrability, Mk ≤ E{M∞ | Fk }, a.s. For k ≤ , and for any λ > 0, Mk ≤ E{M | Fk } = E{M 1(|M |≤λ) | Fk } + E{M 1(|M |>λ) | Fk },
a.s.
By the bounded convergence theorem for conditional expectations, with probability one, lim E{M 1(|M |≤λ) | Fk } = E{M∞ 1(|M∞ |≤λ) | Fk }.
→∞
On the other hand, M∞ ∈ L1 (P) and the dominated convergence theorem for conditional expectations together reveal that, as λ → ∞, the right-hand side of the above display converges to E{M∞ | Fk }, a.s. It suffices to show that a.s., lim inf lim inf E{|M |1(|M |>λ) | Fk } = 0. λ→∞
→∞
But this follows from the following formulation of uniform integrability: limλ→∞ sup≥1 E{|M |1(|M |>λ) } = 0. Exercise 1.7.1 Consider the branching process of Exercise 1.1.2 and show that when µ < 1, limn→∞ Xn = 0, a.s., and when µ > 1, limn→∞ Xn = +∞, a.s. That is, if the mean number of progeny is strictly less (greater) than one, then the population will eventually die out (blow up). Exercise 1.7.2 Consider the stick-breaking process of Exercise 1.1.3 and show that limn→∞ Xn exists, a.s. Identify this limit.
14
1. Discrete-Parameter Martingales
Exercise 1.7.3 Prove that every positive supermartingale converges. (Hint: Try Exercise 1.6.1 first.) We conclude this section with an important application of the martingale convergence theorem. The tail σ-field T corresponding to the collection of σ-fields X = (Xn ; n ≥ 1) is defined as T=
∞ ∞
Xn .
m=1 n=m
We say that T is the tail σ-field of the random variables X1 , X2 , . . . when T is the tail σ-field of σ(X1 ), σ(X2 ), . . . . We now present a martingale proof of Kolmogorov’s 0-1 law. In words, it states that the tail σ-field corresponding to independent random variables is trivial. Corollary 1.7.1 (Kolmogorov’s 0-1 Law) If T denotes the tail σ-field corresponding to independent random variables X1 , X2 , . . ., then for all events Λ ∈ T, P(Λ) is identically 0 or 1. Proof Let F = (Fk ; k ≥ 1) denote the filtration generated by the Xi ’s; that is, Fk = ∨k=1 σ(X ). Since for all m > n, ∨∞ k=m σ(Xk ) is independent of Fn , Fn and T are independent. In particular, for any Λ ∈ T, P(Λ) = P(Λ | Fn ), a.s. The latter defines a bounded martingale (indexed by n), which, by Doob’s martingale convergence theorem, converges, a.s., to P(Λ | ∨n Fn ). Since Λ is ∨m Fm -measurable, this almost surely equals 1lΛ . We have shown that with probability one, P(Λ) = 1lΛ , which proves our result. Exercise 1.7.4 It is possible to devise measure-theoretic proofs of Kolmogorov’s 0-1 law, as we shall find in this exercise. In the notation of our proof of Kolmogorov’s 0-1 law, show that for all Λ ∈ T and for all ε ∈]0, 1[, there exists some n ≥ 1 large enough and some event Λn ∈ ∨i≥n σ(Xi ) such that P(ΛΛn ) ≤ ε, where denotes the set difference operation. Now use this to verify that P(Λ ∩ Λ) = {P(Λ)}2 . The following difficult exercise should not be neglected. Exercise 1.7.5 (Hewitt–Savage 0-1 Law) (Hard) Recall that a function f : Rm → R is said to be symmetric if for all permutations π of {1, . . . , m} and for all x1 , . . . , xm ∈ R, f (x1 , . . . , xm ) = f (xπ(1) , . . . , xπ(m) ). Now suppose that X1 , X2 , . . . are independent random variables—all on one probability space (Ω, G, P)—and for all m ≥ 1, define E−m to be the σfield generated by all random variables of the form f (X1 , . . . , Xm ), where f : Rm → R is measurable and symmetric. The σ-field E = ∩m E−m is called the exchangeable σ-field. Our goal is to prove the Hewitt–Savage 0-1 law: “E is trivial.” n (i) If Sn = j=1 Xj , show that the event (Sn > 0, infinitely often) is exchangeable. Also, prove that the tail σ-field of X1 , X2 , . . . is
2 Orthomartingales
15
in E, although the converse need not hold. Moreover, check that (E−m ; m ≥ 1) is a filtration. (ii) Consider integers n ≥ m ≥ 1 and a bounded, symmetric function f : Rm → R. Show that for any 1 ≤ i1 , . . . , im ≤ n, a.s., E f (Xi1 , . . . , Xim ) E−n = E f (X1 , . . . , Xm ) E−n . (iii) Given integers n ≥ m ≥ 1 and a bounded, symmetric f : Rm → R, define −1 n Un = f (Xi1 , . . . , Xim ), m C(n)
n
where C(n) represents summation over all m combinations of m distinct elements {i1 , . . . , im } from {1, . . . , n}. Show that Un is E−n measurable. Conclude that as n → ∞, Un almost surely converges to E[f (X1 , . . . , Xm ) | E]. n −1 (iv) Show that limn m . . , Xim ) = 0, a.s., where C(n;1) f (Xi1 , .
n represents summation over all C(n;1) m combinations of m distinct elements {i1 , . . . , im } from {1, . . . , n}, such that one of the ij ’s equals 1. Conclude that E[f (X1 , . . . , Xm ) | E] is independent of X1 . Extend this argument to prove that E[f (X1 , . . . , Xm ) | E] is independent of (X1 , . . . , Xm ).
(v) Prove that E is independent of itself. Equivalently, for all Λ ∈ E, P(Λ) ∈ {0, 1}. (Hint: For part (ii), compute E[f (Xi1 , . . . , Xim ) · g(X1 , . . . , Xn )]; for part (iv), start by computing the cardinality of C(n; 1); for part (v), use (iv) to conclude that E is independent of X1 , X2 , . . . .)
2 Orthomartingales: Aspects of the Cairoli–Walsh Theory Now that the one-parameter theory is established, we are ready to tackle multiparameter smartingales. There are two sources of difficulty that need to be overcome and they are both related to the fact that NN 0 —and more generally RN —cannot be well-ordered in a useful way.4 4 The stress here is on the word useful, since the 1904 well-ordering theorem of E. Zermelo states that, under the influence of the axiom of choice, every set can be wellordered. However, the structure of this well-ordering is not usually known and/or in line with the stochastic structure of the problem at hand.
16
1. Discrete-Parameter Martingales
The first problem is that there is no sensible way to uniquely define multiparameter stopping times. To illustrate, suppose (Mt ; t ∈ NN 0 ) is a collection of random variables. Then, it is not clear—and in general not true—that there is a uniquely defined first time t ∈ NN 0 such that Mt ≥ 0, say. The second source of difficulty with the multiparameter theory is that there are many different ways to define smartingales indexed by several parameters. In this book we will study two such definitions, both of which are due to R. Cairoli and J. B. Walsh. This material, together with other aspects of the theory of multiparameter martingales, can be found in Cairoli (1969, 1970a, 1970b, 1971, 1979), Cairoli and Gabriel (1979), Cairoli and Walsh (1975, 1978), Ledoux (1981), and Walsh (1979, 1986b). Later on, in Section 3, we will study multiparameter martingales. They are defined in complete analogy to one-parameter martingales based on the conditional expectation formula s t =⇒ E[Mt | Fs ] = Ms , together with the obvious measurability and integrability conditions. As we shall see throughout the remainder of this book, multiparameter smartingales are both natural and useful. Despite this, it is unfortunate that, when considered in absolute generality, multiparameter martingales have no structure to speak of. Nonetheless, it is possible to tame them when a so-called commutation hypothesis holds. To clarify these issues, we begin with a different—seemingly less natural—class of multiparameter smartingales that we call orthosmartingales. These are the second class of multiparameter smartingales encountered in this book and are the subject of this section.
2.1 Definitions and Examples Let N be a positive numeral and throughout consider N (one-parameter) filtrations F1 , . . . , FN , where Fi = (Fki ; k ≥ 0) (1 ≤ i ≤ N ). A stochastic process M = (Mt ; t ∈ NN 0 ) is an orthosubmartingale if for each 1 ≤ i ≤ N , and all nonnegative integers (t(j) ; 1 ≤ j ≤ N, j = i), t(i) → Mt is a one-parameter submartingale with respect to the one-parameter filtration Fi . The stochastic process M is an orthosupermartingale if −M is an orthosubmartingale. If M is both an orthosupermartingale and an orthosubmartingale, it is then an orthomartingale. Finally, we say that M is an orthosmartingale if it is either an orthosubmartingale or an orthosupermartingale. For example, let us consider the case N = 2 and write the process M as M = (Mi,j ; i, j ≥ 0). Then, M is an orthosubmartingale if 1. for all i, j ≥ 0, E{|Mi,j |} < ∞; 2. for all j ≥ 0, the one-parameter process i → Mi,j is adapted to the filtration F1 , while for each i ≥ 0, j → Mi,j is adapted to F2 ; and
2 Orthomartingales
17
3. for all i, j ≥ 0, E[Mi+1,j | Fi1 ] ≥ Mi,j , a.s., and E[Mi,j+1 | Fj2 ] ≥ Mi,j , a.s. While the above conditions may seem stringent, we will see next that in fact, many such processes exist. Example 1 Suppose M = (Mi ; i ≥ 0) (1 ≤ ≤ N ) are N stochastic processes that are adapted to independent filtrations M = (Mi ; i ≥ 0) (1 ≤ ≤ N ). We then say that M 1 , . . . , M N are independent processes. Given that the M ’s are all (super- or all sub- or all plain) martingales, we define the additive smartingale A as At =
N =1
Mt() ,
t ∈ NN 0 .
We also define the multiplicative smartingale M as N
Mt = =1
Mt() ,
t ∈ NN 0 .
Then, it is possible to see that both M and A are orthosmartingales with respect to the F ’s, where for all 1 ≤ ≤ N , Fk = Mk ∨
N
Mim ,
k ≥ 0.
i=1 m≥0 i =
In words, the filtration Fk is the σ-field generated by {Xi ; 0 ≤ i ≤ k}, as well as all of the variables {Xim ; m = , i ≥ 0}. The following should certainly be attempted. Exercise 2.1.1 Check that for each 1 ≤ ≤ N , F is a one-parameter filtration. Conclude that additive smartingales and multiplicative smartingales are indeed orthosmartingales. We mention another example, to which we will return in Chapter 4. Example 2 Suppose X = (Xt ; t ∈ NN 0 ) are i.i.d. random variables. Define the multiparameter random walk S = (St ; t ∈ NN 0 ) based the these X’s as St = Xs , t ∈ NN 0 . st
Define one-parameter filtrations F1 , . . . , FN as follows: For all 1 ≤ i ≤ N , Fki = σ(Xs ; s(i) ≤ k),
k ≥ 0,
18
1. Discrete-Parameter Martingales
where σ(· · ·) denotes the σ-field generated by the random variables in the parentheses. Multiparameter random walks are related to orthomartingales in the same way that one-parameter random walks are to one-parameter martingales, as the following simple but important exercise reveals. Exercise 2.1.2 Whenever E[Xt ] = 0 for all t ∈ NN 0 , S is an orthomartingale with respect to F1 , . . . , FN . We will encounter multiparameter martingales many more times in this book. For now, let us note the following consequence of Jensen’s inequality. It shows us how to produce more orthosmartingales in the presence of some. Lemma 2.1.1 Suppose that M = (Mt ; t ∈ NN 0 ) is a nonnegative orthosubmartingale with respect to one-parameter filtrations F1 , . . . , FN , that Ψ : [0, ∞[→ [0, ∞[ is convex nondecreasing, and that for all t ∈ NN 0 , E[Ψ(Mt )] < ∞. Then, t → Ψ(Mt ) is an orthosubmartingale.
2.2 Embedded Submartingales We have seen many instances where stopping times play a critical role in the one-parameter theory of stochastic processes. For instance, see the described proof of Doob’s weak (1,1) maximal inequality (Theorem 1.3.1). In a multiparameter setting, we can use the following idea to replace the use of stopping times, since stopping times are not well defined in the presence of many parameters. Proposition 2.2.1 Suppose M = (Mt ; t ∈ NN 0 ) is an orthosubmartingale with respect to the one-parameter filtrations F1 , . . . , FN . If s, t ∈ NN 0 with s t, then E[Ms ] ≤ E[Mt ]. Moreover, for all t(2) , . . . , t(N ) ≥ 0, the following is a one-parameter submartingale with respect to F1 : !s(1) = M
max
0≤s(2) ≤t(2)
···
max
0≤s(N ) ≤t(N )
Ms ,
s(1) ≥ 0.
In particular, the first part says that, as a function on NN 0 , t → E[Mt ] is increasing in the partial order . Furthermore, suppose N = 2 and write M = (Mi,j ; i, j ≥ 0). Then, Proposition 2.2.1 states that, as a process in i, max0≤j≤m Mi,j is a submartingale with respect to F1 . By reversing the roles of i and j, this proposition also implies that, as a process in j, max0≤i≤n Mi,j is a submartingale with respect to F2 . Consequently, Proposition 2.2.1 extracts 2 (in general, N ) one-parameter submartingales from M. Proof We prove the first part for N = 2. Write M = (Mi,j ; i, j ≥ 0) and recall that (i, j) (n, m) if and only if i ≤ n and j ≤ m. Fix any such pair (i, j) and (n, m). Since i → Mi,j is a one-parameter submartingale,
2 Orthomartingales
19
by Jensen’s inequality, E[Mi,j ] ≤ E[Mn,j ]. On the other hand, j → Mn,j is a submartingale, too. Another application of Jensen’s inequality shows that E[Mi,j ] ≤ E[Mn,m ], as claimed. The general case (i.e., when N ≥ 2 is arbitrary) is proved in Exercise 2.2.1 below. For the second and main part of the proposition, note that by the definitions, for any s(j) ≤ t(j) (2 ≤ j ≤ N ), Ms is measurable with respect to Fs1(1) . Therefore, max0≤s(2) ≤t(2) · · · max0≤s(N ) ≤t(N ) Ms is also measurable with respect to Fs1(1) . Moreover, E max · · · max |Ms | ≤ ··· E{|Ms |}, 0≤s(2) ≤t(2)
0≤s(N ) ≤t(N )
0≤s(2) ≤t(2)
0≤s(N ) ≤t(N )
which is finite. It remains to verify the submartingale property. This can be checked directly, as we demonstrate below: Suppose s(1) = k + 1. Then, max Ms Fk1 ≥ max · · · max E[Ms | Fk1 ] E max · · · 0≤s(2) ≤t(2)
0≤s(N ) ≤t(N )
0≤s(2) ≤t(2)
≥
max
0≤r (2) ≤t(2)
0≤s(N ) ≤t(N )
···
max
0≤r (N ) ≤t(N )
Mr ,
a.s.,
where r(1) = k. We have used the orthosubmartingale property of M in the last step, and shown that !k , !k+1 F1 ≥ M E M a.s. k This is the desired result.
Exercise 2.2.1 Prove Proposition 2.2.1 for a general integer N ≥ 2. Exercise 2.2.2 Suppose γ : NN 0 → N0 is a nondecreasing function in the sense that whenever s t, then γ(s) ≤ γ(t). Prove that whenever M is an N -parameter orthosubmartingale with respect to F1 , . . . , FN , M ◦ γ is a 1-parameter submartingale with respect to F ◦ γ, where (M ◦ γ)t = Mγ(t) i N and (F ◦ γ)t = ∩N i=1 Fγ (i) (t) (t ∈ N0 ).
2.3 Cairoli’s Strong (p, p) Inequality We can combine Proposition 2.2.1 with Doob’s strong (p, p) maximal inequality (Theorem 1.4.1) to obtain Cairoli’s strong (p, p) inequality for orthosubmartingales. Theorem 2.3.1 (Cairoli’s Strong (p, p) Inequality) Suppose that M = (Ms ; s ∈ NN 0 ) is a nonnegative orthosubmartingale with respect to oneparameter filtrations F1 , . . . , FN . Then, for all t ∈ NN 0 and p > 1, p N p E[Mtp ]. E max Msp ≤ 0st p−1
20
1. Discrete-Parameter Martingales
!s(1) , where Proof Write max0 s t Ms as max0≤s(1) ≤t(1) M !k = M
max
0≤s(2) ≤t(2)
···
max
0≤s(N ) ≤t(N )
Mk,s(2) ,...,s(N ) .
! is a (one-parameter) submartingale with respect By Proposition 2.2.1, M to the one-parameter filtration F1 . Applying Doob’s strong (p, p)-inequality (Theorem 1.4.1), we see that p E max Ms 0st p p !t(1) |p } E{|M ≤ p−1 p p p = E max · · · max Mt(1) ,s(2) ,...,s(N ) . p−1 0≤s(2) ≤t(2) 0≤s(N ) ≤t(N ) Going through the above argument one more time, we arrive at p E max Ms 0st
≤
p p 2p E max · · · max Mt(1) ,t(2) ,s(3) ,...,s(N ) . p−1 0≤s(3) ≤t(3) 0≤s(N ) ≤t(N )
The result follows from induction on N .
2.4 Another Maximal Inequality The method of Section 2.3 can be used in the p = 1 case. However, this time, the relevant result is the maximal inequality of Theorem 1.5.1. Theorem 2.4.1 Suppose M = (Mt ; t ∈ NN 0 ) is a nonnegative orthosubmartingale with respect to one-parameter filtrations F1 , . . . , FN . Then, for all p ≥ 0 and all t ∈ NN 0 , e N E max Ms (ln+ Ms )p ≤ (p + 1)N N + E Mt (ln+ Mt )p+N . 0st e−1 Consequently, letting p = 0, we obtain a multiparameter extension of Theorem 1.5.1: e N N + E Mt (ln+ Mt )N . E max Ms ≤ 0st e−1 Proof Without loss of generality, we can and will assume that the expectation on the right-hand side of the theorem’s display is finite. Define Ψp (x) = x(ln+ x)p (p ≥ 1). Note that Ψp is both nondecreasing and convex
2 Orthomartingales
21
on ]0, ∞[. By Jensen’s inequality, Ψp (M ) = (Ψp (Mt ); t ∈ NN 0 ) is an orthosubmartingale. First, let us suppose that N = 1. We can apply Theorem 1.5.1 to see that E max Ψp (Mi ) 0≤i≤k e 1 + E Ψp (Mk ) ln+ Ψp (Mk ) ≤ e−1 e 1 + E Ψp+1 (Mk ) + pE [Ψp (Mk ) ln+ ln+ Mk ] . ≤ e−1 Since ln+ ln+ x ≤ ln+ x and p ≥ 0, e 1 + (p + 1)E[Ψp+1 (Mk )] E max Ψp (Mi ) ≤ 0≤i≤k e−1 e 1 + E[Ψp+1 (Mk )] . ≤ (p + 1) e−1 This is the desired result for N = 1. To prove this result in general, we write !s(1) ), max Ψp (Ms ) = max Ψp (M 0st
0≤s(1) ≤t(1)
!k ; k ≥ 0) is defined in Section 2.3. By Jensen’s inequality and the where (M !) is a (one-parameter) submartingale embedding Proposition 2.2.1, Ψp (M with respect to the (one-parameter) filtration F1 . The first portion of the proof, and the monotonicity of Ψp for all p ≥ 0, together reveal that E max Ψp (Ms ) 0st
≤
e(p + 1) 1+E max · · · max Ψp+1 (Mt(1) ,s(2) ,...,s(N ) ) . e−1 0≤s(2) ≤t(2) 0≤s(N ) ≤t(N )
Once again, using the first part of our proof, together with the embedding Proposition 2.2.1, we arrive at E max Ψp (Ms ) 0st e e 1 + (p + 1) ≤ (p + 1) e−1 e−1 p+2 × 1+E max · · · max Ψ (Mt(1) ,t(2) ,s(3) ,...,s(N ) ) 0≤s(3) ≤t(3)
e 2 ≤ (p + 1)2 e−1 × 2+E max
0≤s(3) ≤t(3)
0≤s(N ) ≤t(N )
···
max
0≤s(N ) ≤t(N )
The result follows upon induction.
Ψp+2 (Mt(1) ,t(2) ,s(3) ,...,s(N ) ) .
22
1. Discrete-Parameter Martingales
2.5 A Weak Maximal Inequality In Section 1 we have shown how to use a maximal probability estimate such as Theorem 1.3.1 to obtain maximal moment estimates such as the results of Sections 1.4 and 1.5. Now we go full circle and obtain a maximal N -parameter probability estimate in terms of the N -parameter moment estimates of Sections 2.3 and 2.4. In fact, we have the following weak (1, L lnN −1 L) inequality: Theorem 2.5.1 Suppose M = (Mt ; t ∈ NN 0 ) is a nonnegative orthosubmartingale with respect to filtrations F1 , . . . , FN . Then, for all t ∈ NN 0 and all real λ > 0, P
1 e N −1 max Ms ≥ λ ≤ (N − 1) + E Mt (ln+ Mt )N −1 . 0st λ e−1
Proof By the embedding Proposition 2.2.1 and by Theorem 1.3.1, P
1 max · · · max Mt(1) ,s(2) ,...,s(N ) . max Ms ≥ λ ≤ E 0st λ 0≤s(2) ≤t(2) 0≤s(N ) ≤t(N )
The above maximum is over N − 1 variables and is the maximum of an (N −1)-parameter orthosubmartingale; cf. the embedding Proposition 2.2.1. We obtain the result from Theorem 2.4.1.
2.6 Orthohistories A stochastic process M = (Mt ; t ∈ NN 0 ) generates N orthohistories H1 , . . . , HN defined in the following manner: For any 1 ≤ i ≤ N and any k ≥ 0, Hki is the smallest σ-field that makes the collection (Mt ; 0 ≤ t(i) ≤ k) measurable. For instance, if N = 2 and if we write M = (Mi,j ; i, j ≥ 0), then Hk1 is the σfield generated by (Mi,j ; 0 ≤ i ≤ k, 0 ≤ j) and Hk2 is the σ-field generated by (Mi,j ; 0 ≤ i, 0 ≤ j ≤ k). You can (and should) think of Hk1 and 2 Hk as “the information contained in the values of the process M , over the sets” shown in Figures 1.1 and 1.2, respectively. The following lemma contains some elementary properties of orthohistories. k Lemma 2.6.1 Let H1 , . . . , HN denote Figure 1.1: Hk1 the orthohistories corresponding to the stochastic process M = (Mt ; t ∈ NN 0 ). Then,
2 Orthomartingales
23
1. each of the Hi ’s forms a one-parameter filtration; and 2. ∨k≥0 Hk1 = · · · = ∨k≥0 HkN . Proof Consider H1 : It is an increasing family of σ-fields, i.e., a filtration. A similar argument can be applied to all the Hi ’s; this proves 1. To prove 2, 1 N note that ∨∞ i=1 Hi is the σ-field generated by (Mt ; t ∈ N0 ). Since a similar ∞ 2 ∞ N remark holds for ∨i=1 Hi , . . . , ∨i=1 Hi , our proof is complete. An interesting property of orthohistories is that they preserve smartingale properties. Proposition 2.6.1 Suppose M is an orthosubmartingale with respect to one-parameter filtrations F1 , . . . , FN , and let H1 , . . . , HN denote the orthohistories of M . Then, M is an orthosubmartingale with respect to H1 , . . . , HN .
k
Proof Recall that for all 1 ≤ i ≤ N and all (i) t ∈ NN → Mt is adapted to Fti(i) . Since 0 ,t i Ht(i) is the smallest σ-field with respect to which t(i) → Mt is adapted, we have shown that for all integers k ≥ 0 and all 1 ≤ i ≤ N , Hki ⊂ Fki . To finish our proof of the proposition, we need only check the submartingale property of M with respect to the Hi ’s. Since Hi ⊂ Fi , this follows from the towering property of conditional expectations; see equation (1) of Section Figure 1.2: Hk2 1.1, Chapter 1. In other words, suppose t ∈ NN and 1 ≤ i ≤ N . Then E[Mt | Hti(i) −1 ] = E E{Mt | Fti(i) −1 } Hti(i) −1 , a.s., ≥ E[Ms | Hti(i) −1 ],
a.s.,
where s(j) = t(j) if j = i; but s(i) = t(i) − 1. As a result, Ms is measurable with respect to Hti(i) −1 = Hsi (i) . Thus, E[Mt | Hti(i) −1 ] ≥ Ms ,
a.s.,
for the above choice of s. This completes our proof.
Proposition 2.6.1 frees us from sometimes having to worry about the one-parameter filtrations with respect to which M is an orthosmartingale. That is, if no such filtrations are mentioned, it is sometimes safe to assume that they are the orthohistories.
24
1. Discrete-Parameter Martingales
2.7 Convergence Notions One of the highlights of the one-parameter theory of smartingales is Doob’s convergence theorem (Theorem 1.7.1). In order to discuss such a result in the setting of orthosmartingales, we first need to define what we mean by “limt→∞ Xt ” for a stochastic process X = (Xt ; t ∈ NN 0 ). In this book two natural notions of convergence arise. The first is a straightforward topological one. Namely, given a finite real number L, we say that “L = limt→∞ Xt , a.s.” whenever the following holds with probaN bility one: As the distance between the point t ∈ NN 0 and the axes of R grows, Xt converges to L. That is, lim Xt =
t→∞
lim
t(1) ,...,t(N ) →∞
Xt = L.
In this spirit, if L = +∞ (respectively − ∞), “L = limt→∞ Xt , a.s.” means that with probability one, for all M > 0, there exists K > 0, such that whenever min1≤i≤N t(i) ≥ K, then Xt ≥ M (respectively Xt ≤ −M ). Sometimes, the almost sure existence of a topological limit is too stringent a condition. We can relax it considerably by defining sectorial limits as follows: Consider a real-valued function f on RN + , and let ΠN denote the collection of all permutations of {1, . . . , N }. For any π ∈ ΠN , define π − lim f (t) = t→∞
lim
t(π(1)) →∞
···
lim
t(π(N )) →∞
f (t),
when it exists. Of course, the order in which the limits are taken is, in general, quite important. We say that the function f has sectorial limits (at infinity) if π − limt→∞ f (t) exists for all π ∈ ΠN . To illustrate, suppose N = 2. Then Π2 = {π1 , π2 }, where π1 : (1, 2) → (1, 2) and π2 : (1, 2) → (2, 1). The two sectorial limits are π1 − lim f (t) = t→∞
π2 − lim f (t) = t→∞
lim
lim f (t);
lim
lim f (t).
t(1) →∞ t(2) →∞ t(2) →∞ t(1) →∞
Simple examples show that the sectorial limits need not be equal. However, if and when they are, we write limt∞ f (t) for their common value, which we refer to as the sectorial limit of f (at infinity). Next, let us suppose that M = (Mt ; t ∈ NN 0 ) is an orthosubmartingale E{|M that is bounded in L1 (P). That is, supt∈NN t |} < ∞. We can apply the 0 one-parameter convergence theorem (Theorem 1.7.1) to the first coordinate of M , say, to see that for all integers t(2) , . . . , t(N ) ≥ 0, the following exists, almost surely: Mt1(2) ,...,t(N ) = lim Mt . t(1) →∞
2 Orthomartingales
25
The next step in showing the existence of sectorial limits is to let t(2) → ∞ in the above. We could do this if we knew that the (N − 1)-parameter stochastic process M 1 was an (N − 1)-parameter orthosubmartingale. A little thought shows that for this to hold, we need more stringent conditions than mere boundedness in L1 (P). Indeed, the following suffices: Theorem 2.7.1 (Cairoli’s First Convergence Theorem) If M is an N -parameter uniformly integrable orthosubmartingale, the sectorial limit M∞,...,∞ = limt∞ Mt exists, almost surely and in L1 (P). Moreover, for any π ∈ ΠN , # " π(1) π(2) π(N ) Mt ≤ E · · · E E M∞,...,∞ Ftπ(1) Ftπ(2) · · · Ftπ(N ) , a.s. To understand this theorem better, consider the case N = 2 and write M = (Mi,j ; i, j ≥ 0). The above result states that a.s. Mi,j ≤ min E E M∞,∞ Fi1 Fj2 , E E M∞,∞ Fj2 Fi1 , In particular, when M is a 2-parameter orthomartingale, then we have the following commutation property: Mi,j = E E (M∞,∞ Fi1 Fj2 = E E M∞,∞ Fj2 Fi1 , a.s. We will explore an abstraction of this property in greater depth later on. Proof Let us prove the result for N = 2. The general case is contained in Exercise 2.7.1 below. Throughout this proof we will assume that F1 and F2 are the orthohistories of the two-parameter process M . See the discussion of Section 2.6. We will also write M = (Mi,j ; i, j ≥ 0). For any j ≥ 0, i → Mi,j is a one-parameter uniformly integrable submartingale. By the one-parameter smartingale convergence theorem (Theorem 1.7.1), M∞,j = limi→∞ Mi,j exists almost surely and in L1 (P). Moreover, Mi,j ≤ E[M∞,j | Fi1 ]. Next, we need the process properties of M∞,j . By the asserted L1 (P) convergence, E M∞,j+1 Fj2 = lim E Mi,j+1 Fj2 ≥ lim Mi,j = M∞,j , i→∞
i→∞
where the convergence takes place in L1 (P). Hence, j → M∞,j is itself a one-parameter submartingale with respect to F2 and Mi,j ≤ E[M∞,j | Fi1 ].
26
1. Discrete-Parameter Martingales
Appealing to Fatou’s lemma, we see that j → M∞,j is a uniformly integrable one-parameter submartingale with respect to F2 . The oneparameter smartingale convergence theorem (Theorem 1.7.1) shows that 1 = limj→∞ M∞,j exists almost surely and in L1 (P). It may be useful M∞,∞ to point out that in the notation of the paragraph preceding the statement of the theorem, 1 M∞,∞ = π2 − lim Mi,j = lim lim Mi,j , j→∞ i→∞
(i,j)→∞
a.s. and in L1 (P),
where π2 : (1, 2) → (2, 1). Our argument, thus far, can be applied equally well to the variables in reverse order. In this way we obtain a uniformly integrable F1 orthomartingale (Mi,∞ ; i ≥ 0) that almost surely converges to some 2 1 2 , as i → ∞. That is, we have extracted M∞,∞ and M∞,∞ as the M∞,∞ two possible sectorial limits of M . Now we show that with probability one, 1 2 M∞,∞ = M∞,∞ . For all k ≥ 0, 1 1 Fk = lim lim E Mi,j Fk1 ≥ lim lim Mk,j = Mk,∞ , a.s. E M∞,∞ j→∞ i→∞
1 limk→∞ E[M∞,∞
| Fk1 ]
j→∞ i→∞
2 M∞,∞ ,
Thus, ≥ almost surely. Since F1 is a filtration, the one-parameter martingale convergence theorem implies that the 1 | ∨k≥0 Fk1 ], almost surely. By Lemma mentioned limit is equal to E[M∞,∞ 1 2 1 2.6.1, ∨k≥0 Fk = ∨k≥0 Fk , and M∞,∞ is measurable with respect to the 1 2 ≥ M∞,∞ , almost surely. We now reverse the roles of latter. That is, M∞,∞ 1 2 the indices to deduce that with probability one, M∞,∞ = M∞,∞ = M∞,∞ . 1 We have shown the almost sure, as well as the L (P), existence of the sectorial limit lim(i,j)∞ Mi,j . That Mi,j can be bounded by a conditional expectation of M∞,∞ follows from the L1 (P) convergence. Exercise 2.7.1 Prove Theorem 2.7.1 when N ≥ 2 is arbitrary.
2.8 Topological Convergence In this section we will show that, at little extra cost, the sectorial convergence of Section 2.7 can be greatly strengthened: Theorem 2.8.1 (Cairoli’s Second Convergence Theorem) Consider any orthomartingale M = (Mt ; t ∈ NN 0 ) that satisfies the following integrability condition: sup E{|Mt |(ln+ |Mt |)N −1 } < ∞. t∈NN 0
Then, with probability one, lim
sup
t(1) →∞ t(2) ,...,t(N ) ≥0
|Mt − Mt1(2) ,...,t(N ) | = 0,
2 Orthomartingales
27
where Mt1(2) ,...,t(N ) = limt(1) →∞ Mt , almost surely. In particular, by interchanging the indices we can conclude the following strengthened form of Theorem 2.7.1 for orthomartingales: Corollary 2.8.1 Suppose M = (Mt ; t ∈ NN 0 ) is an orthomartingale with N −1 the property that supt∈NN E{|M |(ln |M |) } < ∞. Then, limt→∞ Mt t + t 0 1 exists almost surely and in L (P). Exercise 2.8.1 Prove Corollary 2.8.1.
Our proof of Theorem 2.8.1 requires the following technical lemma. Lemma 2.8.1 Suppose M = (Mt ; t ∈ NN 0 ) is a uniformly integrable orthosubmartingale. Suppose Ψ : [0, ∞[→ [0, ∞[ is convex, and that x → E[Ψ(|Mt |)] < ∞, x−1 Ψ(x) is finite and nondecreasing on [0, ∞[. If supt∈NN 0 then M∗ = limt∞ Mt exists and lim E[Ψ(|Mt − M∗ |)] = 0.
t→∞
Proof Since M is uniformly integrable, by Theorem 2.7.1, the sectorial limit, M∗ = limt∞ Mt , exists, a.s. and in L1 (P). Moreover,
Fatou’s lemma shows that E[Ψ(|M∗ |)] < ∞. Observe that t → Ψ |Mt | is itself an N parameter orthosubmartingale and, by Theorem 2.7.1, for all s ∈ NN 0 , |Ms | ≤ E · · · E E |M∗ | Fs1(1) Fs2(2) · · · FsN(N ) , almost surely. By convexity, almost surely, Ψ(|Ms |) ≤ E · · · E E Ψ(|M∗ |) Fs1(1) Fs2(2) · · ·
N F (N ) . s
Consequently, as long as Λ ∈ ∩N =1 Fs() , the following inequality holds:
E[Ψ(|Ms |)1lΛ ] ≤ E[Ψ(|M∗ |)1lΛ ].
(1)
We let Λs = (Ψ(|Ms |) > λ) (λ > 0, s ∈ NN 0 ) and apply equation (1) with 1 E[Ψ(|Mt |)], this probability Λ replaced by Λs . Since P(Λs ) ≤ supt∈NN 0 λ (i.e., P(Λs )) goes to 0 as λ → ∞, uniformly in s ∈ NN 0 . By equation (1), we deduce that t → Ψ(|Mt |) is a uniformly integrable, N -parameter orthosubmartingale. Since Ψ is continuous on [0, ∞[, by Theorem 2.7.1, lim E[Ψ(|Mt |)] = E[Ψ(|M∗ |)].
t∞
(2)
We now show that the sectorial limit “limt∞ ” is, in fact, a topological one. To this end, note that for all x, y ∈ R, Ψ(|x − y|) ≤ |Ψ(x) − Ψ(y)|.
(3)
28
1. Discrete-Parameter Martingales
To verify this, write Ψ(x) = xf (x) (x ≥ 0), where f is nondecreasing, and assume without loss of generality that x ≥ y ≥ 0. Then, Ψ(|x − y|) = (x − y)f (x − y) ≤ xf (x) − yf (x − y). Thus, if x − y ≥ y, we obtain equation (3). If x − y ≤ y, Ψ(|x − y|) ≤ (x − y)f (y) = xf (y) − yf (y) ≤ xf (x) − yf (y). Now that we have demonstrated equation (3), we can proceed with our proof. By Jensen’s inequality, Ψ(|Mt |) is an L1 (P) bounded orthosubmartingale. Since Ψ is nondecreasing, by Proposition 2.2.1, if s t, then E[Ψ(|Ms |)] ≤ E[Ψ(|Mt |)]. A real-variable argument shows that lims→∞ E[Ψ(|Ms |)] exists and, by our assumption on Ψ and M , is finite. Thus, by equation (2), limt→∞ E[Ψ(|Ms |)] = E[Ψ(|M∗ |)] and the lemma follows from equation (3). We can now prove Theorem 2.8.1. Proof of Theorem 2.8.1 For the sake of illustration, we first detail our proof in the case N = 2 and write M = (Mi,j ; i, j ≥ 0). Clearly, the function Ψ(x) = x ln+ x satisfies the conditions of Lemma 2.8.1. That is, it is convex and x−1 Ψ(x) is nondecreasing. Furthermore, by the assumption of Theorem 2.8.1, supi,j≥0 E[Ψ(|Mi,j |)] is finite. Define Mi,∞ = lim Mi,j ,
i ≥ 0,
M∞,j = lim Mi,j ,
j ≥ 0.
j→∞ i→∞
On the other hand, during the course of our proof of Theorem 2.7.1, we already saw that i → Mi,∞ (respectively j → M∞,j ) is a uniformly integrable one-parameter martingale with respect to F1 (respectively F2 ) (Why?) Moreover, if M∞,∞ = limt∞ Mt denotes the sectorial limit, then M∞,∞ = lim Mi,∞ = lim M∞,j , i→∞
j→∞
a.s.
We proceed with establishing some probability estimates. First, we note that for any fixed m ≥ 0, sup sup |Mi,j − Mi,∞ | ≤ 2 sup sup |Mi,j − Mi,m |.
j≥m i≥0
i≥0 j≥m
Hence, for any c > 0 and all m ≥ 0,
P sup sup |Mi,j − Mi,∞ | ≥ λ ≤ P sup sup |c(Mi,j − Mi,m )| ≥ 12 cλ . j≥m i≥0
i≥0 j≥m
2 Orthomartingales
29
On the other hand, for any m ≥ 0, (c|Mi,j − Mi,m )|; i ≥ 0, j ≥ m) is an orthosubmartingale with respect to its orthohistories, for instance. Therefore, by the weak maximal inequality (Theorem 2.5.1 of Section 2.5),
P sup sup |Mi,j − Mi,∞ | ≥ λ j≥m i≥0
≤
2 e 1 + sup sup E Ψ c|Mi,j − Mi,m | . cλ e − 1 j≥m i≥0
By Jensen’s inequality (cf. the first part of the embedding Proposition 2.2.1),
P sup sup |Mi,j − Mi,∞ | ≥ λ j≥m i≥0
≤
2 e 1 + E Ψ c|M∞,∞ − M∞,m | . cλ e − 1
Now note that for any m ≥ 0, i → Mi,m is a uniformly integrable oneparameter martingale with supi≥0 E{|Mi,m | ln+ |Mi,m |} < ∞. In particular, by Lemma 2.8.1, m → M∞,m is a uniformly integrable one-parameter martingale with supm≥0 E{|M∞,m | ln+ |M∞,m |} < ∞. By another appeal to Lemma 2.8.1, for any c > 0, limm→∞ Ψ(c|M∞,∞ − M∞,m |) = 0. Thus, there exists cm > 0 such that limm cm = ∞ and supm≥0 Ψ(cm |M∞,∞ − M∞,m |) ≤ 1. That is,
4 e . P sup sup |Mi,j − Mi,∞ | ≥ λ ≤ cm λ e − 1 j≥m i≥0 Letting m → ∞ and then letting λ → 0+ along a rational sequence, we see that a.s. lim sup sup |Mi,m − Mi,∞ | = 0, m→∞ i≥0
Similarly, lim supn→∞ supj≥0 |Mn,j − M∞,j | = 0, a.s., which proves the result for N = 2. We now proceed with our proof in the general case. Write −1 (1) , t), where t = (t(2) , . . . , t(N ) ) ∈ NN . The above any t ∈ NN 0 as t = (t 0 argument extends naturally to show that for all real c, λ > 0 and all positive integers n,
P sup sup |Mt − Mt1 | ≥ λ t ∈N0N −1 t(1) ≥n
2 e N −1 (N − 1) + E Ψ c|M∗ − Mn,∞,...,∞ | , cλ e − 1 where M∗ = limt∞ Mt and Mn,∞,...,∞ = limt ∞ Mn,t are N parameter and (N −1)-parameter sectorial limits, respectively, and Ψ (x) = x(ln+ x)N −1 ; see Section 2.7. Hence, we can find cn → ∞ such that
N e N −1 . P sup sup |Mt − Mt1 | ≥ λ ≤ cn λ e − 1 t ∈NN −1 t(1) ≥n ≤
0
30
1. Discrete-Parameter Martingales
(The process M 1 is defined in the statement of Theorem 2.8.1 that we are now proving.) The rest of our proof follows as in the N = 2 case. Exercise 2.8.2 In the set-up of Theorem 2.8.1, suppose further that there E[|Mt |p ] < exists p > 1 such that M is bounded in Lp (P). That is, supt∈NN 0 p ∞. Show that Mt has a limit as t → ∞, a.s. and in L (P). Prove a uniform version of this in the style of Cairoli’s second convergence theorem.
2.9 Reversed Orthomartingales Roughly speaking, one-parameter reversed martingales are processes that become martingales once we reverse time. In order to be concrete, we need some filtrations. We say that a collection of σ-fields F = (Fk ; k ≥ 0) is a reversed filtration if for all k ≥ 0, Fk+1 ⊂ Fk . That is, F is a collection of σ-fields that becomes a filtration, once we reverse time. Now we define a stochastic process M = (Mk ; k ≥ 0) to be a reversed martingale (with respect to the reversed filtration F) if 1. M is adapted to F; and 2. for all ≥ k ≥ 0, E[Mk | F ] = M , a.s. Exercise 2.9.1 Verify that the above Condition 2 is equivalent to the following: For all k ≥ 0, E[Mk | Fk+1 ] = Mk+1 , a.s. Exercise 2.9.2 Show that every one-parameter reversed martingale converges. In this regard, see also Supplementary Exercise 4. (Hint: You can begin with by deriving an upcrossing inequality.) Our multiparameter discussion begins with N one-parameter reversed filtrations Fi = (Fki ; k ≥ 0), where 1 ≤ i ≤ N . A stochastic process M = (Mt ; t ∈ NN 0 ) is a reversed orthomartingale if for each integer 1 ≤ i ≤ N and all nonnegative integers (t(j) ; 1 ≤ j ≤ N, j = i), t(i) → Mt is a reversed martingale with respect to the filtration Fi . To illustrate, consider N = 2 and write Mi,j (Fi,j , etc.) for M(i,j) (F(i,j) , etc.). Then, M is a reversed orthomartingale if for all i ≥ 0, (Mi,k ; k ≥ 0) is a martingale with respect to F2 and (Mk,i ; k ≥ 0) is a martingale with respect to F1 . Under a mild integrability condition, reversed orthomartingales always converge. Theorem 2.9.1 Suppose M = (Mt ; t ∈ NN 0 ) is a reversed orthomartingale with respect to one-parameter reversed filtrations Fi = (Fki ; k ≥ 0), 1 ≤ i ≤ N . If E{|M0 |(ln+ |M0 |)N −1 } < ∞, then limt→∞ Mt exists a.s. and in L1 (P). Exercise 2.9.3 Prove Theorem 2.9.1.
3 Martingales
31
Exercise 2.9.4 Prove the following Lp (P) variant of Theorem 2.9.1. In the same context as the latter theorem, if E{|X0 |p } < ∞ for some p > 1, then, as t → ∞, Mt converges in Lp (P). Exercise 2.9.5 Show that whenever M is a uniformly integrable, N parameter reversed orthomartingale, the sectorial limit limt∞ Mt exists and is in L1 (P). Moreover, E{limt∞ |Mt |} ≤ E{|M0 |}.
3 Martingales In this section we discuss N -parameter martingales, and more generally N -parameter smartingales. In an absolutely general setting, N -parameter smartingales do not possess much structure; cf. Section 3.3 below. On the other hand, we will see, in this section, that in some cases one can use the theory of orthomartingales to efficiently analyze N -parameter martingales.
3.1 Definitions While the definition of orthomartingales may have seemed contrived, that of N -parameter martingales is certainly not, since N -parameter martingales are the most natural extension of 1-parameter martingales. It is the deep connections between martingales and orthomartingales that make the latter useful in the study of the former. Suppose F = (Ft ; t ∈ NN 0 ) is a collection of sub σ-fields of G. We say that F is a filtration if s t implies that Fs ⊂ Ft . An N -parameter stochastic N process M = (Mt ; t ∈ NN 0 ) is adapted to the filtration F if for all t ∈ N0 , Mt is Ft measurable. The process M is an N -parameter submartingale (with respect to F) if it is adapted (to F), for all t ∈ NN 0 , E{|Mt |} < ∞ and for all t s, E[Mt | Fs ] ≥ Ms , a.s. The stochastic process M is a supermartingale if −M is a submartingale. It is a martingale if it is both a supermartingale and a submartingale. If M is either a sub- or a supermartingale, then it is a smartingale. The following is an immediate consequence of Jensen’s inequality: Lemma 3.1.1 Suppose M = (Mt ; t ∈ NN 0 ) is a nonnegative submartingale with respect to a filtration F = (Ft ; t ∈ NN 0 ) and Ψ : [0, ∞[→ [0, ∞[ is convex nondecreasing. If for all t ∈ NN , E[Ψ(M t )] < ∞, then t → Ψ(Mt ) 0 is a submartingale with respect to F.
3.2 Marginal Filtrations The collection of all multiparameter smartingales contains the class of all orthosmartingales. To be more precise, suppose M = (Mt ; t ∈ NN 0 ) is an
32
1. Discrete-Parameter Martingales
N -parameter random process that is adapted to the N -parameter filtration F = (Ft ; t ∈ NN 0 ). For all 1 ≤ j ≤ N , define Ft , k ≥ 0. Fkj = t∈NN 0 : t(j) =k
We define Fj = (Fkj ; k ≥ 0), 1 ≤ j ≤ N and refer to the σ-fields F1 , . . . , FN as the marginal filtrations of F. Lemma 3.2.1 If F is a filtration, then, F1 , . . . , FN are one-parameter filN trations, and for all t ∈ NN 0 , Ft ⊆ ∩=1 Ft() . Exercise 3.2.1 Prove Lemma 3.2.1.
The marginal filtrations of an N -parameter filtration form one of the deep links between N -parameter martingales and orthomartingales, as we shall see next. Proposition 3.2.1 Suppose M is adapted to the N -parameter filtration F. If M is an orthosubmartingale with respect to the marginal filtrations of F, then M is a submartingale with respect to F. Proof We present a proof that uses the towering property of conditional expectations (see equation (1) of Section 1.1), working one parameter at a time. Suppose t s are both in NN 0 . Then, with probability one, E[Mt | Fs ] = E E[Mt | Fs1(1) ] Fs ≥ E[Ms(1) ,t(2) ,...,t(N ) | Fs ] = E E{Ms(1) ,t(2) ,...,t(N ) | F2(2) } Fs ≥ E[Ms(1) ,s(2) ,t(3) ,...,t(N ) | Fs ] ≥ · · · ≥ E[Ms | Fs ] = Ms .
s
The remaining properties are easy to check. To each N -parameter process M we can associate a history H as follows: For every t ∈ NN 0 , let Ht denote the σ-field generated by (Ms ; s t). When N = 2, we can think of Ht as the information contained in the values (Ms ; s t). This is shown in Figure 1.3. You should check that the corresponding pictures for the 2 marginal filtrations Hk1 and Hk2 are given by Figures 1.1 and 1.2 of Section 2.6, respectively. It is helpful to have these pictures in mind when interpreting many of the results and arguments that involve multiparameter filtrations, processes, etc.
t
Figure 1.3: A picture of Ht
3 Martingales
33
3.3 A Counterexample of Dubins and Pitman According to Proposition 3.2.1 and Lemma 3.2.1, there is a sense in which the class of all smartingales includes orthosmartingales. Since the latter have rich mathematical properties (Section 2), one may be tempted to think that the same is true of the former. Next, we discuss a two-parameter counterexample of Dubins and Pitman (1980); it shows that, in the absence of further features, general multiparameter smartingales do not have many regularity properties. Related results can be found in the second half of F¨ ollmer (1984a). Let us begin with two fixed sequences of numbers: p1 , p2 , . . ., all taking values in ]0, 1[, and m1 , m2 , . . ., all positive integers. Next, consider a probability space (Ω, G, P) rich enough so that on it we can construct independent random variables X1 , X2 , . . . such that for any k ≥ 1, P(Xk = 0) = pk , and P(Xk = j) = m−1 k (1 − pk ), for all 1 ≤ j ≤ mk . For every integer i, j ≥ 0 and all numerals k ≥ 1, k k define Fi,j to be the trivial σ-field if i + j < k. If i + j = k, define Fi,j to be the σ-field generated by (Xk = 0 or Xk = i). Finally, if i + j > k, k to be the σ-field generated by all of the X’s. We can also define define Fi,j F = (Fi,j ; i, j ≥ 0) by Fi,j =
∞
k Fi,j ,
i, j ≥ 0.
k=1
We begin with some preliminary facts. Exercise 3.3.1 Verify the following properties: k 1. for each fixed integer k ≥ 1, Fk = (Fi,j ; i, j ≥ 0) is a filtration;
2. F1 , F2 , . . . are independent; and 3. F is a filtration. Finally, find the marginal filtrations of F. Let A =
∪∞ k=1 (Xk
= 0) and define Mi,j = P(A | Fi,j ),
i, j ≥ 0.
Clearly, M = (Mi,j ; i, j ≥ 0) is a bounded two-parameter martingale. In fact, 0 ≤ Mi,j ≤ 1 for all i, j ≥ 0. We plan to show that it need not converge. More precisely, we have the following: ∞ Theorem 3.3.1 Suppose k=1 pk < 1 but limk→∞ mk pk = ∞. Then, with Mt > lim inf t∈NN Mt . probability one, lim supt∈NN 0 0
34
1. Discrete-Parameter Martingales
Remarks (a) Once again, we identify Mi,j with M(i,j) for any i, j ≥ 0. Throughout k , etc. our proof, the same remark applies to Fi,j , Fi,j (b) The conditions of the theorem hold, for example, if mk = 5k and pk = 2−k . Proof We start with a calculation that is an exercise in conditional expectations: p , if i + j < k, k mk p k k 1l(Xk =0 or Xk =i) , if i + j = k, (1) P(Xk = 0 | Fi,j )= m p k k + 1 − pk if i + j > k. 1l(Xk =0) , Fix any n, m ≥ 0 and note that for all k large enough (how large depends on n and m), mk p k . m p k k + 1 − pk (i,j) (n,m) (This uses the Borel–Cantelli lemma and the fact that k pk < +∞, so that with probability one, Xk = 0 for all but finitely many k’s.) By (b) above, Xk is independent of the entire collection (F ; = k). Therefore, for all m, n ≥ 0, and all k large enough, mk p k sup P(Xk = 0 | Fi,j ) ≥ . mk p k + 1 − p k (i,j) (n,m) sup
k P(Xk = 0 | Fi,j )≥
Since (Xk = 0) ⊂ A, we obtain the following: For all n, m ≥ 0 and all k large enough, mk p k sup Mi,j ≥ . mk p k + 1 − p k (i,j) (n,m) The left-hand side is independent of all large k and bounded above by one. We can let k → ∞ and use the conditions limk→∞ pk = 0 and limk→∞ mk pk = +∞ to see that with probability one, sup(i,j) (n,m) Mi,j = 1. That is, a.s. (2) lim sup Mt = inf2 sup Ms = 1, t∈NN 0
t∈N0 s t
On the other hand, (Mj,j ; j ≥ 0) is a bounded, one-parameter martingale with respect to the filtration (Fj,j ; j ≥ 0); cf. Exercise 2.2.2. By Doob’s convergence theorem, it converges almost surely and in Lp (P) for all p ≥ 1. That is, with probability one, limj→∞ Mj,j = P(A). This shows that with probability one, lim inf Mt = sup inf Mt ≤ P(A) ≤ t∈NN 0
s∈N20 t s
∞ k=1
P(Xk = 0) =
∞ k=1
pk .
3 Martingales
Since
∞
k=1
pk < 1, this and (2), together, have the desired effect.
Exercise 3.3.2 Verify equation (1).
35
Exercise 3.3.3 Show that Theorem 3.3.1 continues to hold, even if the condition k pk < 1 is replaced by k pk < +∞. (Hint: The Borel–Cantelli lemma.) Exercise 3.3.4 Construct a 2-parameter martingale that is in Lp (P) for for all p > 0, and yet its maximum is a.s. unbounded. This is due to S. Janson. (Hint: For the set-up of the Dubins–Pitman counterexample, consider ∞ Ni,j = k=1 αk P(Xk = 0 | Fi,j ), for a suitably chosen sequence α1 , α2 , . . . that goes to infinity in the limit.)
3.4 Commutation In Section 3.3 we saw that general smartingales can have undesirable properties; cf. Theorem 3.3.1 and Exercise 3.3.4. On the other hand, when the smartingale in question is an orthosmartingale, the theory is quite rich; see Section 2. The question arises, when is a martingale an orthomartingale? This brings us to the so-called commutation hypothesis. Suppose G1 , . . . , GN are sub-σ-fields of G. We say that they commute if for all bounded random variables Y and all π, π ∈ ΠN (the collection of all permutations of {1, . . . , N }), E E E{Y | Gπ(1) } Gπ(2) · · · Gπ(N ) = E E E(Y | Gπ (1) ) Gπ (2) · · · Gπ (N ) , a.s. Two remarks are in order: 1. We have already encountered a weak version of such a property in Section 2.7. See the remarks after Theorem 2.7.1; and 2. Commutation of σ-fields is a rather special property; it typically does not hold. A seemingly different condition is commutation of filtrations. An N 5 N parameter filtration F = (Ft ; t ∈ NN 0 ) is commuting if for every s, t ∈ N0 and for all bounded Ft -measurable random variables Y , E[Y | Fs ] = E[Y | Fst ],
5 This
is also known as condition (F4).
a.s.
36
1. Discrete-Parameter Martingales
Exercise 3.4.1 Construct several (e.g., six or seven) 2-parameter filtrations that do not commute. The following is the first sign of the connections between commuting filtrations, orthomartingales, and martingales. It states that if the underlying filtration is commuting, many martingales are also orthomartingales. As such, this serves as a converse to Proposition 3.2.1. Theorem 3.4.1 Suppose F is an N -parameter commuting filtration. Then, for all bounded random variables Z and all t ∈ NN 0 , a.s., E · · · E E(Z | Ft1(1) ) Ft2(2) · · · FtN(N ) = E[Z | Ft ], where F1 , . . . , FN denote the marginal filtrations of F. Proof To simplify the demonstration, suppose N = 2 and write Mi,j for M(i,j) , etc. By Doob’s 1-parameter martingale convergence theorem (Theorem 1.7.1), E E{Z | Fi1 } Fj2 = E lim E{Z | Fi,k } Fj2 k→∞ = lim E E{Z | Fi,k } Fj2 k→∞ = lim lim E E{Z | Fi,k } F,j , k→∞ →∞
where all of the convergences are taking place in L1 (P). Recall that F is commuting and Y = E[Z | Fi,k ] is Fi,k -measurable. This implies that a.s., E[Y | F,j ] = E[Y | F(i,k)(,j) ] = E[Y | Fi∧,k∧j ] = E[Z | Fi∧,k∧j ]. The ultimate equality follows from the towering property of conditional expectations; cf. equation (1) of Section 1.1, Chapter 1. We have shown that for every i, j ≥ 0 and for all bounded random variables Z, a.s., E E{Z | Fi1 } Fj2 = lim lim E[Z | Fi∧,k∧j ], k→∞ →∞
which, almost surely, equals E{Z | Fi,j }.
The following result better explains the term commuting. Corollary 3.4.1 The marginal filtrations F1 , . . . , FN of an N -parameter commuting filtration F all commute. Proof Consider a bounded random variable Z and a t ∈ NN 0 . By relabeling the parameter coordinates, we see that for all π ∈ ΠN (the collection of all permutations of {1, . . . , N }), π(2) π(N ) π(1) a.s. E · · · E E(Z | Ft(π(1)) ) Ft(π(2)) · · · Ft(π(N )) = E[Z | Ft ], Since the right-hand side is not affected by our choice of π, this implies the result.
3 Martingales
37
Exercise 3.4.2 Prove that the filtration F of the Dubins–Pitman counterexample of Section 3.3 is not commuting. Exercise 3.4.3 The intention of this exercise is to show that under commutation, Lemma 3.2.1 is sharp. One way to make this precise is as follows: Suppose F1 , . . . , FN are N independent 1-parameter filtrations. 1 N That is, for all t ∈ NN 0 , Ft(1) , . . . , Ft(N ) are independent σ-fields. For all ()
N N t ∈ NN 0 , define Ft = ∩=1 Ft() and prove that F = (Ft ; t ∈ N0 ) is a commuting N -parameter filtration. Compute its marginal filtrations. This is related to Exercise 2.1.1.
3.5 Martingales In Section 3.2 we showed that orthomartingales are martingales. We now show that if the underlying filtration is commuting, the converse also holds. In particular, under commutation, the powerful machinery of orthosmartingales becomes available to martingales; see Corollary 3.5.1 below. Theorem 3.5.1 Suppose that F is an N -parameter commuting filtration and that M = (Mt ; t ∈ NN 0 ) is adapted to F. Then, the following are equivalent: (i) M is an orthosubmartingale with respect to the marginals of F; and (ii) M is a submartingale with respect to F. Proof Proposition 3.2.1 shows that (i) =⇒ (ii). We now show that under commutation, (ii) implies (i). Let us suppose (ii) holds. To simplify the exposition, we also suppose N = 2 and write Mi,j for M(i,j) , etc. By the one-parameter martingale convergence theorem, E[Mi+1,j | Fi1 ] = lim E[Mi+1,j | Fi,k ], k→∞
a.s.
Since F is commuting, for all k > j, E[Mi+1,j | Fi,k ] = E[Mi+1,j | Fi,j ]. Since M is a submartingale, E[Mi+1,j | Fi1 ] = lim E[Mi+1,j | Fi,j ] ≥ Mi,j . k→∞
That is, for any fixed j ≥ 0, (Mi,j ; i ≥ 0) is a one-parameter submartingale with respect to F1 . Relabeling the order of the parameters proves the result. As an immediate but important consequence, we obtain the following. Corollary 3.5.1 Suppose M = (Mt ; t ∈ NN 0 ) is a submartingale with respect to the N -parameter commuting filtration F. Then, Cairoli’s maximal inequalities (Theorems 2.3.1 and 2.4.1 and 2.5.1) all hold for M . Moreover, so do Cairoli’s convergence theorems (Theorems 2.7.1 and 2.8.1).
38
1. Discrete-Parameter Martingales
Exercise 3.5.1 Suppose X = (Xt ; t ∈ NN 0 ) is an N -parameter submartingale with respect to a commuting filtration F = (Ft ; t ∈ NN 0 ). Show ) and an adapted process that there exist a martingale M = (Mt ; t ∈ NN 0 A = (At ; t ∈ NN ) such that X = M + A . Moreover, A can be chosen t t t 0 so that it is nondecreasing with respect to the partial order . That is, whenever s t, As ≤At . This is from Cairoli (1971). (Hint: Write Mt = s t ξs and try to imitate the given proof of Doob’s decomposition; cf. Exercise 1.2.2 and Supplementary Exercise 1.) Exercise 3.5.2 Suppose F = (Fn ; n ≥ 0) is a one-parameter filtration and suppose X = (Xt ; t ∈ NN 0 ) is a sequence of random variables indexed by N parameters. Assume that (i) there exists a (nonrandom, finite) constant K > 0 such that a.s., supt |Xt | ≤ K; and (ii) the sectorial limit of Xt exists, which we denote by X∞ . Prove that no matter how we let n, t(1) , . . . , t(N ) → ∞, E[Xt | Fn ] → E[X∞ | Fn ], a.s. In words, show that E[X∞ | Fn ] is the sectorial limit of E[Xt | Fn ], as (n, t) goes to infinity in NN +1 . This is based on Blackwell and Dubins (1962, Theorem 2).
3.6 Conditional Independence Suppose G1 , . . . , Gk+1 are sub-σ-fields of G. We say that G1 , . . . , Gk are conditionally independent given Gk+1 if E
k =1
Y Gk+1 =
k
E[Y | Gk+1 ] =1
whenever Y1 , . . . , Yk are bounded random variables that are measurable with respect to G1 , . . . , Gk , respectively. Exercise 3.6.1 Consider an ordinary random walk S = (Sn ; n ≥ 0) described in Exercise 1.1.1. Fix some n ≥ 1 and define the following σfields: (a) Let Fn be the σ-field generated by (Sj ; 0 ≤ j ≤ n); and (b) let Gn denote the σ-field generated by (Sn+j ; j ≥ 0). Show that Fn and Gn are conditionally independent, given σ(Sn ), the σ-field generated by Sn . The following characterization theorem describes an important connection between conditional independence and commutation. Theorem 3.6.1 For a given filtration F = (Ft ; t ∈ NN 0 ), the following are equivalent: (i) F is commuting; and
3 Martingales
39
(ii) for all s, t ∈ NN 0 , Ft and Fs are conditionally independent, given Fst . Proof Suppose that for all t ∈ NN 0 , Yt is a bounded Ft -measurable random variable. By the towering property of conditional expectations (equation (1), Section 1.1), a.s. E[Yt Ys | Fts ] = E Yt E{Ys | Ft } Fts = E Yt E{Ys | Fts } Fts , Thus, (i) ⇒ (ii). Conversely, supposing that (ii) holds, E[Yt Ys ] = E E{Yt Ys | Fts } = E E{Yt | Fts } · E{Ys | Fts } = E E{Yt | Fts } · Ys . Since Fts ⊂ Fs and the above holds for all bounded Fs -measurable random variables Ys , E[Yt | Fts ] = E[Yt | Fs ], almost surely. This shows that (ii) implies (i), and hence (ii) is equivalent to (i). At this point it would be a good idea to take another look at Figures 1.1, 1.2, and 1.3 and interpret commutation pictorially, at least in the interesting case where the N -parameter filtration in question is the history of a certain stochastic process. We conclude this section, and in fact this chapter, with a series of indispensable exercises on conditionally independent σ-fields. Henceforth, let G1 , G2 denote two σ-fields that are conditionally independent, given another σ-field G3 . Exercise 3.6.2 Prove that G1 ∨ G3 and G2 ∨ G3 are conditionally independent, given G3 . Use this to prove that the following are equivalent: (i) G1 and G2 are conditionally independent, given G3 ; and (ii) for all bounded G1 -measurable random variables X1 , E[X1 | G2 ∨ G3 ] = E[X1 | G3 ],
a.s.
In the general theory of random fields, condition (ii) is referred to as the Markov property for the triple (G1 , G3 , G2 ); see Rozanov (1982, Section 1, Chapter 2). Exercise 3.6.3 Show that G1 and G2 are conditionally independent, given G4 , for any other σ-field G4 ⊃ G3 such that G4 ⊂ G1 ∨ G2 . Construct an example to show that this last condition cannot be dropped. (Hint: Let G1 and G2 denote the σ-fields generated by ξ1 and ξ2 , respectively, where ξ1 , ξ2 are i.i.d. ±1 with probability 12 each. Consider G3 = {∅, Ω} and let G4 denote the σ-field generated by ξ1 + ξ2 .)
40
1. Discrete-Parameter Martingales
Exercise 3.6.4 Suppose Hn (n ≥ 1) is a decreasing sequence of σ-fields such that for all n ≥ 1, G1 and G2 are conditionally independent, given Hn . Prove that G1 and G2 are conditionally independent, given ∩n≥1 Hn . Exercise 3.6.5 Verify that whenever G1 and G2 are conditionally independent, given G3 , then G1 ∩ G2 ⊂ G3 . (Warning: You will need to assume that the underlying probability space, together with all of the mentioned σ-fields, is complete.)
4 Supplementary Exercises 1. Consider a collection of real numbers a = (at ; t ∈ NN 0 ). Show that corresponding to a, there exists a unique sequence δ = (δt ; t ∈ NN 0 ) such that (i) for N δ ; and (ii) for all t ∈ N , δ depends only on (as ; s t). all t ∈ NN s t 0 , at = 0 s t This is an aspect of the so-called inclusion–exclusion formula of J. H. Poincar´e, and the δ’s are referred to as the increments of the sequence a. 2. Suppose M = (Mn ; n ≥ 0) is a nonnegative uniformly integrable 1-parameter submartingale with respect to a filtration F = (F n ; n ≥ 0). (i) Use Doob’s convergence theorem and Fatou’s lemma to prove that for any F-stopping time T , E[MT 1l(T <∞) ] < ∞. (ii) Conclude that whenever T is a finite F-stopping time, (MT ∧n ; n ≥ 0) is uniformly integrable. (iii) Conclude that for all uniformly integrable submartingales M = (Mn ; n ≥ 0) and for all stopping times T , E{|MT |1l(T <∞) } ≤ sup E{|Mn |} < ∞. n
Moreover, when M is a uniformly integrable martingale, then for all stopping times T , E[MT 1l(T <∞) ] = E[M0 ]. 3. As observed by S. D. Chatterji, Doob’s convergence theorem for martingale is also a consequence of Doob’s maximal inequalities; cf. Chatterji (1967, 1968) and Lamb (1973). In this exercise you may not appeal to the martingale convergence theorem. Throughout, the underlying probability space is (Ω, F ∞ , P) and F = (F n ; n ≥ 0) denotes a filtration of sub–σ-fields of F ∞ with F ∞ = ∨n F n . (i) Suppose (Yn ; n ≥ 0) is a uniformly integrable martingale with respect to the filtration F. For all A ∈ F n , define µ(A) = E[Yn 1lA ] and verify that µ is a (signed) measure on ∨n F n . Furthermore, µ is absolutely continuous with respect to P. Conclude the existence of a random variable Y∞ ∈ L1 (P) such that for all n ≥ 0, Yn = E[Y∞ | F n ], a.s. (ii) Let F denote the collection of all Z ∈ L1 (P) such that for some n = n(Z), Z is F n -measurable. Prove that F is dense in L1 (P).
4 Supplementary Exercises
41
(iii) Prove that whenever Y is the uniformly integrable martingale of (i), then as n → ∞, Yn converges a.s. and in L1 (P) to Y∞ . (iv) Prove that whenever M = (Mn ; n ≥ 0) is a uniformly integrable martingale on an arbitrary probability space (Ω, G, P) and with respect to an arbitrary filtration F 1 , F 2 , . . ., there exists M∞ ∈ L1 (P) such that Mn converges to M∞ a.s. and in L1 (P). (v) Let M = (Mn ; n ≥ 0) denote a martingale that is bounded in L1 (P). That is, supn E{|Mn |} < ∞. Prove that there exists M∞ ∈ L1 (P) such that Mn converges to M∞ , a.s. (vi) Deduce Doob’s martingale convergence theorem from (v) and Doob’s decomposition, Exercise 1.2.1. (Hint: For part (i), check that µ(A) = limk→∞ E[Yk 1lA ]. For part (ii), consider ∈ F such that Z’s of the form Z = 1lE , where E ∈ F n . For part (iii), choose Y∞ , a.s. Finally, E{|Y∞ − Y∞ |} ≤ ε. Define Yn = E[Y∞ | F n ] and note that Yn → Y∞ estimate P(supn |Yn − Yn | ≥ ε), via Doob’s maximal inequality. For part (iv), let T = inf(n ≥ 0 : |Mn | ≥ R) and first prove that n → MT ∧n is uniformly integrable. Finish by picking R so large that P(T < ∞) < ε for ε small enough.) 4. Suppose M = (Mn ; n ≥ 0) is a reversed martingale with respect to a reversed filtration F = (F n ; n ≥ 0). (i) Verify that limn→∞ E[Mn ] exists but may be −∞. (ii) If limn E[Mn ] > −∞, prove the existence of a positive finite constant A such , for all λ > 0. that supn P(|Mn | ≥ λ) ≤ A λ (iii) Show that whenever limn E[Mn ] > −∞, (Mk+ ; k ≥ 0) is uniformly integrable. (iv) Prove that whenever n > m and λ > 0, 0 ≥ E[Mn 1l(Mn ≤−λ) ] ≥ E[Mn − Mm ] + E[Mm 1l(Mn <−λ) ]. (v) Conclude that limn E[Mn ] > −∞ is equivalent to the uniform integrability of M . (Hint: For part (ii), check that E[Mn+ 1l(Mn+ ≥λ) ] ≤ E[M1+ 1l(Mn+ ≥λ) ].) 5. Consider the hypercube I0,1 = [0, 1]N . We can subdivide I0,1 into 2N equal-sized subhypercubes of side 12 each and denote them by J1,1 , . . . , J1,2N , in some order. For instance, supposing that N = 2, we could take J1,1 = [0, 12 ]2 , J1,2 = [0, 12 ] × [ 12 , 1], J1,3 = [ 12 , 1] × [0, 12 ] and J1,4 = [ 12 , 1]2 . Next, we toss 2N independent p-coins (i.e., probability of heads equals p ∈]0, 1[)—one coin for every one of the J’s—and declare J1,j as open if the jth coin landed heads. Let N1 denote the number of open hypercubes among J1,1 , . . . , J1,2N and write these (randomly selected) open hypercubes as I1,1 , . . . , I1,N1 in some order. We also N 1 define K1 = ∪N j=1 I1,j , which is a random compact subset of [0, 1] . Next, we N subdivide each of the I1,j ’s (1 ≤ j ≤ N1 ) into 2 equal-sized subhypercubes of side 14 . According to newly introduced independent p-coins, we declare each
42
1. Discrete-Parameter Martingales
of them open or not as before to obtain a compact set K2 ⊂ K1 . We can continue this construction inductively: Having constructed Kn as a random union of hypercubes Jn,1 , . . . , Jn,Nn , we subdivide each Jn,i into 2N equal-sized subhypercubes and keep them or not according to the parity of i.i.d. p-coins, all tossed independently of the previous one. Define Kn+1 to be the union of the hypercubes kept in this (n + 1)st stage and continue the process indefinitely to obtain a decreasing family of random compact sets K1 ⊃ K2 ⊃ · · ·. Let K = ∩n Kn denote the limiting compact set and prove that there exists pc ∈]0, 1[ such that for all p > pc , K = ∅, with positive probability, whereas for all p < pc , K = ∅, a.s. Can you compute pc ? This process of creating random Cantor-like sets was coined fractal percolation by Mandelbrot (1982). (Hint: Consider a hidden branching process.) 6. Consider an N -parameter martingale M = (Mt ; t ∈ NN 0 ) with respect to an N -parameter filtration F = (F t ; t ∈ NN 0 ). We do not require F to be commuting here. (i) Verify that whenever E[Mt2 ] < ∞ for all t ∈ NN 0 , then for all s t, both in NN 0 , E[(Mt − Ms )2 ] = E[Mt2 ] − E[Ms2 ]. (ii) In particular, demonstrate that whenever supt E[Mt2 ] < ∞, t → Mt is a Cauchy sequence in L2 (P). (iii) Deduce the martingale convergence theorem when supt E[Mt2 ] < ∞. Thus, while we essentially need the commutation of F to prove the existence of a.s. limits, the existence of L2 (P) limits is another matter. N 7. Let F = (F t ; t ∈ NN 0 ) denote an N -parameter filtration. An N0 ∪ {+∞}, (T t) ∈ F t . valued random variable is an F-stopping point if for all t ∈ NN 0 N (2) (i) Let X = (Xt ; t ∈ N0 ) be adapted to F and hold integers t , . . . , t(N) ≥ 0 fixed. Prove, then, that for all Borel sets E ⊂ R, T is an F-stopping point, where T (j) = t(j) for all N ≥ j ≥ 2 and T (1) = inf(t(1) ≥ 0 : Xt ∈ E). (You need to interpret inf ∅ = +∞ and identify (∞, t(2) , . . . , t(N) ) with the point +∞ in the one-point compactification of NN 0 .) ) is an N -parameter submartingale (ii) Prove that whenever M = (Mt ; t ∈ NN 0 with respect to F and whenever T S are bounded stopping points, then E[MT ] ≤ E[MS ]. (iii) If T is an F-stopping point, let F T denote the collection of all s ∈ NN 0 such that for all events A, A ∩ (T = s) ∈ F s .
(a) Prove that F T is a σ-field. (b) Show that T is F T measurable and that (T = s) can, equivalently, be replaced by (T s) in the definition of F T . (c) If S and T are F-stopping points, S ∨ T is also an F-stopping point. (d) (Hard) Construct an example of a 2-parameter filtration F and two F-stopping points S and T such that S T is not an F-stopping point.
4 Supplementary Exercises
43
8. Let F denote an N -parameter filtration. A collection of F-stopping points (γ(n); n ≥ 0) is an optional increasing path if γ(1) γ(2) · · ·, almost surely. Extend a part of Exercise 2.2.2 by showing that when M is an N -parameter martingale with respect to F and when γ is an optional increasing path, M ◦ γ is a one-parameter martingale with respect to F ◦ γ, where the ◦ notation is taken from Exercise 2.2.2. 9. Let R denote the collection of all sets of the form [0, t], where t ∈ NN 0 ; let (Ω, G, P) designate a probability space; and let F = (F t ; t ∈ NN 0 ) denote an N -parameter filtration of sub–σ-field of G. A stopping domain D is a subset of NN 0 such that (a) D is a (random) denumerable union of elements of R; and (b) for all t ∈ NN 0 , (t ∈ D) ∈ F t . Its interior D◦ is defined as the collection of all t ∈ D such that there exists s ≺ t that is also in D. Demonstrate the truth of the following: (i) Whenever N = 1, D \ Do is a stopping time with respect to F. (ii) Any nonrandom union of elements of R is a stopping domain. (iii) If D1 and D2 are stopping domains, so are D1 ∩ D2 and D1 ∪ D2 . (iv) Suppose X is an adapted stochastic process. Let K be a measurable set and define [0, t] : t ∈ NN DK = 0 , Xs ∈ K for all s t . Then, DK is a stopping domain. (v) If D is a stopping domain, the following is a σ-field: F D = (A ∈ G : A ∩ (t ∈ D◦ ) ∈ F t for all t ∈ NN 0 ). (vi) If D1 ⊂ D2 are stopping domains, F D1 ⊂ F D2 . (vii) If D is a stopping domain, then for all t ∈ NN 0 , (t ∈ D) ∈ F D . (This is due to J. B. Walsh.) 10. (Hard. Continued from Supplementary Exercise 9.) Let F = (F t ; t ∈ NN 0 ) denote an N -parameter filtration on some probability space and let F 1 , · · · , F N denote its marginal filtrations. %N j N (i) For all t ∈ NN 0 , let F t = j=1 F t(j) and prove that F = (F t ; t ∈ N0 ) is an N -parameter filtration. to be the collection of all events A such (ii) If D is a stopping domain, define F D ◦ , A ∩ (t ∈ D ) ∈ F t . Prove that (a) F D is a σ-field; (b) that for all t ∈ NN 0 N (t ∈ D) ∈ F D , for all t ∈ N0 ; and (c) for all stopping domains D1 ⊂ D2 , FD ⊂ FD . 1 2 (iii) An adapted process M = (Mt ; t ∈ NN 0 ) is a strong martingale if for all 1 s ≺ t, both in NN 0 , Mt ∈ L (P) and E[δt | F s ] = 0, where the δ’s denote the increments of M in the sense of Supplementary Exercise 1. Prove that whenever D1 ⊂ D2 are stopping domains, E = δt F D δt , 1 t∈D2
almost surely.
t∈D1
44
1. Discrete-Parameter Martingales
This exercise constitutes J. B. Walsh’s optional stopping theorem for strong martingales. It opens the door to a rich theory of strong martingales that runs parallel to the one-parameter theory. 11. (Hard) Suppose M denotes an N -parameter orthomartingale. For all i ∈ i {1, . . . , N }, all t ∈ NN 0 , and for all a < b, define Ut [a, b] to be the number of upcrossings of [a, b] made by the numerical sequence (Ms ; s(j) = t(j) for all j = i , s(i) ≤ t(i) ). Prove that sup E{ max Uti [a, b]} < ∞,
t∈NN 0
1≤i≤N
as long as supt E(|Mt |{ln+ |Mt |}N−1 ) < ∞. Using this, describe another proof of Cairoli’s second convergence theorem (Theorem 2.8.1). 12. (Hard) Let F denote a commuting N -parameter filtration and suppose that M is a submartingale with respect to F. In this exercise we prove Cairoli’s second convergence theorem for M , using the ideas of the 1-parameter proof of S. D. Chatterji; cf. Supplementary Exercise 3. 1 (i) If (Yt ; t ∈ NN 0 ) is adapted and uniformly integrable, there exists Y ∈ L (P) such that for all t ∈ NN , Y = E[Y | F ], a.s. t t 0
(ii) Let F denote the collection of all Z ∈ L1 (P) such that for some t = t(Z), Z is F t -measurable. Prove that F is dense in L1 (P). (iii) Prove that whenever Y is the uniformly integrable martingale of (i), Yt has an a.s. and L1 (P) limit, as t → ∞. (iv) Returning to the submartingale M , assume that sup E(|Mt |{ln+ |Mt |}N−1 ) < ∞, t
and show that by (i)–(iii), M converges a.s. as t → ∞.
5 Notes on Chapter 1 Section 1 The basic theory of discrete-parameter martingales is covered in most introductory graduate texts in probability theory such as (Billingsley 1995; Chow and Teicher 1997; Chung 1974; Durrett 1991) and the more advanced books (Dudley 1989; Stroock 1993). Many of the one-parameter exercises of this chapter are standard and borrowed from these texts. For more specialized treatments, together with various applications, see Garsia (1970, 1973), Hall and Heyde (1980), and Neveu (1975). The earlier development of the subject, together with a wealth of information, can be found in Doob (1990). A comprehensive account of 1-parameter martingale theory, in both discrete and continuous time, is Dellacherie and Meyer (1982). In the preamble the claim was made that maximal inequalities are critical to the existence of strong convergence theorems. This can be made quite precise; cf. Burkholder (1964).
5 Notes on Chapter 1
45
The inequalities of Sections 1.3–1.5 are all part of one “master inequality” involving Orlicz norms; see Neveu (1975, Appendix). Exercise 1.2.1 is due to J. L. Doob; see Doob (1990) and Krickeberg (1963, 1965). An abstract theory of martingales can be found in Krickeberg and Pauc (1963). It is interesting that a nonadapted variant of Exercise 1.2.2 arises in the analysis of the game of craps; cf. Ethier (1998) for further details. Corollary 1.2.1 is what is most commonly called Doob’s stopping time theorem; see Dellacherie and Meyer (1982, Sec. 2, Ch. V). Exercise 1.7.5 is the 0-1 law of Hewitt and Savage (1955). The argument outlined borrows its ideas from Hoeffding (1960) and arose from the fundamental work of W. Hoeffding on the so-called U-statistics; see Serfling (1980) for further details. Exercise 3.5.2 was originally presented for N = 1 in Blackwell and Dubins (1962, Theorem 2) in order to rigorously prove the following intriguing principle: “given infinite information, any two people who agree on all things possible and all things impossible, assign equal probabilities to all possible events.” The fact that this exercise also holds for N > 1 is a remark in F¨ ollmer (1984a). Exercise 3.5.2 is also sometimes called Hunt’s lemma; cf. Dellacherie and Meyer (1982, Theorem 45, Ch. V). Section 2 The literature on multiparameter martingales is truely massive. This is partly due to the fact that there are entirely different aspects to this theory. Various facets of the theory of multiparameter martingales not treated in this book, in particular those with applications to ergodic theory and optimization, can be found in (Edgar and Sucheston 1992; Cairoli and Dalang 1996). The astute reader of this section will note that the multiparameter results of Section 2 are proved by several one-parameter projections. See Cairoli and Dalang (1996) and Sucheston (1983). Section 3 This section, together with Section 3, can be viewed as a systematic exposition of the works of R. Cairoli and J. B. Walsh on this subject. This material, in a less expanded form and together with many other aspects of the theory of multiparameter processes, already appears in the extensive notes of J. B. Walsh; see Walsh (1986a, 1986b). Section 3.3 is a slightly simplified version of the counterexample of L. E. Dubins and J. W. Pitman. The mentioned counterexample, in its full generality, is presented in Exercise 3.3.3. Exercise 3.3.4 is ascribed to S. Janson in Walsh (1986b). The multiparameter martingale convergence theorems here are part of a metatheorem that was made precise in Sucheston (1983). In words, it states that we can sometimes work one parameter at a time. An alternative approach to Cairoli’s convergence theorem that is closer, in spirit, to the discussion of this chapter can be found in Bakry (1981a). One can also prove such theorems by using the rather general theory of amarts or asymptotic martingales; see Edgar and Sucheston (1992) for a pedagogic treatment as well as an extensive bibliography of the relevant literature. As mentioned within it, the main idea behind Supplementary Exercise 3 is borrowed from Chatterji, (1968, 1967), where the martingale convergence theorem is proved for some Banach-space-valued martingales. In the context of the original
46
1. Discrete-Parameter Martingales
finite-dimensional convergence theorem, this proof was rediscovered later in Lamb (1973). Supplementary Exercises 11 and 12 are new; see Khoshnevisan (2000) for yet another approach. Exercises 3.6.2–3.6.5 form an integral part in the study of splitting fields and Markov properties of random fields; see Rozanov (1982), for instance. There is a large body of work that extends and studies martingales indexed by partially order sets. A good general reference for those motivated by classical analysis is Walsh (1986b, Ch. 1). Those motivated by the general theory of random fields are studied in (H¨ urzeler 1985; Ivanova and Mertsbakh 1992; Song 1988), among many other references; see also the volume Fouque et al. (1996) for some of the recent developments. A comprehensive treatment of set-indexed martingales can be found in the recent book of Ivanoff and Merzbach (2000). Section 4 Supplementary Exercise 7 is borrowed from Walsh (1986b); see also Mazziotto and Szpirglas (1983, 1982). A self-contained treatment of multiparameter optional stopping theory and related results is Cairoli and Dalang (1996). Supplementary Exercise 8 is part of the general theory of Walsh (1981); see also Cairoli and Dalang (1996).
2 Two Applications in Analysis
One of the unifying themes of this book is its systematic applications of martingales and, in particular, maximal inequalities. While most of our intended applications are in probability theory, in this chapter we sidetrack slightly and show probabilistic/martingale proofs of two fundamental analytic theorems. The first is a theorem that states that Haar functions form an orthonormal basis for Lp [0, 1] for any p > 1. That is, there exists a prescribed collection of piecewise flat functions (H ; ≥ 1) such that any function f ∈ Lp [0, 1] can be written as f = f, H H , where •, • denotes the Hilbertian inner product on L2 [0, 1], extended to Lp , and the infinite sum converges in Lp [0, 1]. The second theorem of interest to us is the celebrated differentiation theorem of H. Lebesgue; it states that indefinite integrals of functions in L1 [0, 1] are almost everywhere differentiable. After gathering some preliminary information, this chapter carefully states and proves the mentioned results. Moreover, it describes some multidimensional extensions of these works that will use the methods of multiparameter martingales.
1 Haar Systems Suppose f : [0, 1]N → R is Lebesgue measurable and for all p > 0, define the Lp norm of f by f p =
[0,1]N
p1 |f (x)|p dx ,
48
2. Two Applications in Analysis
where dx = Leb(dx) denotes N -dimensional Lebesgue measure. A probabilistic way to think of this is as follows: Given a random variable U uniformly distributed over [0, 1]N , f pp = E{|f (U )|p }. Moreover, for any Borel set A ⊂ R, Leb[f −1 (A)] = P(f (U ) ∈ A), where f −1 (A) = {t ∈ [0, 1]N : f (t) ∈ A}. Let Lp [0, 1]N denote the collection of all such f ’s for which f p < ∞. When p ≥ 1, the space Lp [0, 1]N is a complete vector space in the metric defined by its norm, if we identify functions that are equal almost everywhere. We can also define L∞ [0, 1]N to be the collection of all bounded measurable functions f : [0, 1]N → R, with suitable identification made for a.e. equivalence. When f ∈ L∞ [0, 1]N , define f ∞ to be the essential supremum, ess supt∈[0,1]N |f (t)|. Recall that for any measurable g : [0, 1]N → R, ess sup g(t) = inf r ∈ R : Leb[g −1 (r, ∞)] = 0 , t∈[0,1]N
where inf ∅ = ∞. What do the elements of Lp [0, 1]N look like, when p ≥ 1? To answer this, let us begin with the simplest case, N = 1.
1.1 The 1-Dimensional Haar System Let h0,0 (t) = 1,
0 ≤ t ≤ 1,
and for all k ≥ 1, define 1 2 2 (k−1) , hk,0 (t) = −2 12 (k−1) , 0,
if 0 ≤ t ≤ 2−k , if 2−k < t ≤ 2−k+1 , otherwise.
For any 0 ≤ j ≤ 2k−1 − 1, define hk,j (t) = hk,0 (t − j2−k+1 ),
t ≥ 0.
That is, for all 0 ≤ j ≤ 2k−1 −1, hk,j is hk,0 shifted to the right by the amount j2−k+1 . The collection hk,j ; k ≥ 1, 0 ≤ j ≤ 2k−1 − 1 ∪ h0,0 is the standard Haar system on [0, 1], and the hk,j ’s are the Haar functions on [0, 1]. In order to simplify the forthcoming formulæ, let us define the index set Γ(k) = 0, 1, . . . , 2(k∨1)−1 − 1 . Thus, the Haar system is compactly represented as hk,j ; k ≥ 0, j ∈ Γ(k) .
1 Haar Systems
49
Note that the Haar functions are in Lp [0, 1] for all p > 0. It is also a simple matter to check that we have the following orthonormality property: For all k, m ≥ 0, j ∈ Γ(k), and n ∈ Γ(m), " 1 1, if (k, j) = (m, n), hk,j (r)hm,n (r) dr = 0, otherwise. 0 &1 When it makes sense, define the inner product f, g = 0 f (r)g(r) dr. 1 As is usual in Lebesgue’s theory, this induces a norm f 2 = f, f 2 and renders L2 [0, 1] a real separable Hilbert space. In particular, hk,j , hn,m = 0 if (k, j) = (n, m), and otherwise it is equal to hk,j 22 = 1. In this section we will show that the Haar system spans L1 [0, 1], and consequently, it also spans Lp [0, 1] for any p ≥ 1. Thus, in light of the orthonormality property mentioned above, our goal is to show that the Haar system is an orthonormal basis for Lp [0, 1] for any p ≥ 1. Introduce a random variable U that is uniformly distributed on [0, 1], and define the dyadic filtration σ hk,j (U ) , k ≥ 0, Fk =
j∈Γ(k)
where σ · · · denotes the σ-field generated by the objects in the braces. The following is an important exercise. Exercise 1.1.1 Prove that the dyadic filtration is indeed a filtration. Also prove that {sgn hk,j (U ); k ≥ 1, j ∈ Γ(k)} is a collection of mean-zero independent ±1-valued random variables, where sgn x equals 1 if x ≥ 0 and it equals −1 if x < 0. (Hint: Consider first the binary representation of U .) Let us consider an arbitrary f ∈ L1 [0, 1]. Note that for all k ≥ 1 and all j ∈ Γ(k), 1
|f, hk,j | ≤ hk,j ∞ · f 1 = 2 2 (k−1) f 1 < ∞.
(1)
Therefore, the following is well-defined: Mn (f ) =
n
hk,j (U )f, hk,j .
k=0 j∈Γ(k)
(What about the k = 0 term?) Exercise 1.1.2 Verify that whenever q > k are both integers, Mk (1l[0,2−q ] ) = 2−q+k 1l[0,2−q ] (U ), a.s. On the other hand, when q ≤ k, show that Mk (1l[0,2−q ] ) = 1l[0,2−q ] (U ), a.s. (Hint: When q > k, check that Mk (1l[0,2−q ] ) = 2−q βk , where βk = 1 +
k j=1
2j−1 1l[0,2−j ] (U ) − 1l[2−j ,2−j+1 ] (U ) ,
50
2. Two Applications in Analysis
and use induction.) The key observation of this subsection is the following:
Proposition 1.1.1 If f ∈ L1 [0, 1], then (Mn (f ); n ≥ 0) is a martingale. In fact, for all n ≥ 0, Mn (f ) = E[f (U ) | Fn ],
a.s.
Proof By Exercise 1.1.1, the hk,j ’s are i.i.d. mean-zero random variables. The martingale property is a simple consequence of this. What we are after is the stated representation of Mn (f ) as a conditional expectation; this also implies the asserted martingale property of M . Since F0 is the trivial σ-field, the assertion of the theorem holds for n = 0. We will show that it does for n ≥ 1 as well. Note that f → Mn (f ) and f → E[f (U ) | Fn ] are both linear maps. First, we prove the result when f has the following form: f (t) = 1l[0,2−q ] (t),
t ∈ [0, 1],
where q ≥ 1 is a fixed integer. By directly computing, we see that for any two integers k ≥ q and j ∈ Γ(k), the following holds almost surely: E[f (U ) | Fk ]1l[j2−k ,(j+1)2−k ] (U ) = P(U ≤ 2−q | j2−k ≤ U ≤ (j + 1)2−k )1l[j2−k ,(j+1)2−k ] (U ) " 0, if j ≥ 2−q+k , (2) = 1l[j2−k ,(j+1)2−k ] (U ) × 1, if 0 ≤ j ≤ 2−q+k − 1. On the other hand, if k < q, then for all integers j ∈ Γ(k), " 2−q+k 1l[0,2−k ] (U ), if j = 0, E[f (U ) | Fk ]1l[j2−k ,(j+1)2−k ] (U ) = 0 if j ≥ 1.
(3)
It is easy to see directly that when k ≥ q, Mk (f )1l[j2−k ,(j+1)2−k ] (U ) equals the right-hand side of (2), and when k < q, it equals the right-hand side of (3); see Exercise 1.1.2 above. This verifies the result when f is of the form, f = 1l[0,2−q [ for an integer q ≥ 0. The same argument works to establish the result when f is of the form f = 1l[j2−q ,(j+1)2−q [ , for positive integers j and q. The remainder of our proof is an exercise in measure theory. By the asserted linearity, the result holds when f is simple and dyadic, i.e., when it is of the form f = m j=1 αj 1l[j2−q ,(j+1)2−q [ , where m and q are positive integers and α1 , . . . , αm are real-valued. Any continuous function can be sandwiched between two simple dyadic functions. Therefore, the result holds for all continuous f . Since continuous functions are dense in L1 [0, 1], the proposition follows.
1 Haar Systems
51
It is an immediate consequence of Proposition 1.1.1 that if f ∈ L1 [0, 1], then (Mn (f ); n ≥ 1) is a uniformly integrable martingale. Therefore, by the (one-parameter) martingale convergence theorem (Theorem 1.7.1, Chapter 1), it converges almost surely and in L1 (P). In fact, lim Mn (f ) = E[f (U ) | ∨n Fn ] = f (U ),
n→∞
almost surely, and limn E{|Mn (f ) − f (U )|} = 0. In analytical terms, we have proved the following result: Theorem 1.1.1 If f ∈ L1 [0, 1], the following limit exists for Lebesgue almost all t ∈ [0, 1] and in L1 [0, 1]: f (t) = lim
n→∞
n
hk,j (t)f, hk,j .
k=0 j∈Γ(k)
That is, any function in L1 [0, 1] can be thought of as an infinite linear combination of Haar functions. Thus, we have shown that the Haar system forms a basis for L1 [0, 1]. An analogous result holds in Lp [0, 1] when p ∈ (1, ∞). Exercise 1.1.3 Prove that whenever f ∈ Lp [0, 1] for p ∈ [1, ∞), the convergence in Theorem 1.1.1 holds almost everywhere and in Lp [0, 1].
1.2 The N-Dimensional Haar System The Haar system on [0, 1] extends nicely to form a basis for Lp [0, 1]N (p ≥ 1). Recall that for any integer k ≥ 0, " {0, . . . , 2k−1 − 1}, if k ≥ 1, Γ(k) = {0}, if k = 0, and {hk,j ; k ≥ 0, j ∈ Γ(k)} is the Haar system on [0, 1] described in the previous section. Let us begin with the N -dimensional analogue of Γ(k). For all k ∈ NN 0 , define ΓN (k) = Γ(k (1) ) × · · · × Γ(k (N ) ). N N Suppose k ∈ NN 0 and j ∈ Γ (k). For all t ∈ [0, 1] , we can define
hN k,j (t)
N
=
hk() ,j () (t() ),
t ∈ [0, 1]N .
=1 N N The Haar system on [0, 1]N is the collection {hN k,j ; k ∈ N0 , j ∈ Γ (k)}. 1 Note that h is our old Haar system on [0, 1] from Section 1.1.
52
2. Two Applications in Analysis
Next, take a random vector V that is uniformly distributed on [0, 1]N , and define the dyadic filtration
N Ft = σ hN t ∈ NN k,j (V ); j ∈ Γ (k) , 0 . 0kt
Exercise 1.2.1 Show that the above dyadic filtration is indeed an N parameter commuting filtration. For all f ∈ L1 [0, 1]N and t ∈ NN 0 , we define Mt (f ) by N hN Mt (f ) = k,j (V )f, hk,j , 0 k t j∈ΓN (k)
& where f, g = [0,1]N f (t)g(t) dt, whenever it makes sense. Note that Mt (f ) is well-defined as long as f ∈ L1 [0, 1]N . Indeed, using equation (1) of Section 1.1, for all k ∈ NN and j ∈ ΓN (k), 1
2( |f, hN k,j | ≤ 2
N
=1
k() −N )
f 1.
Our multidimensional analogue of Proposition 1.1.1 is the following. Proposition 1.2.1 F is a commuting filtration. Moreover, if f L1 [0, 1]N , then t ∈ NN Mt (f ) = E[f (V ) | Ft ], 0 .
∈
Proof That F is a filtration is immediate. Clearly, the coordinates of V are i.i.d. random variables, each uniformly picked from [0, 1]. Therefore, by N N Exercise 1.1.1, {hN k,j (V ); k ∈ N0 , j ∈ Γ (k)} is a collection of mean-zero independent random variables. Exercise 1.2.1 shows that F is commuting. In fact, we can be more careful and write F in terms of its marginal filtrations: For all t ∈ [0, 1]N , Ft =
N =1
Ft() ,
t ∈ NN 0 ,
(1)
where the marginal filtrations F1 , . . . , FN are independent one-dimensional dyadic filtrations. It remains to demonstrate the representation of Mt (f ) as the mentioned conditional expectation. By appealing to arguments of measuretheory, it suffices to prove the result when f is of the form () N f (t) = N =1 f (t ), t ∈ [0, 1] , where f1 , . . . , fN are bounded, measurable functions from [0, 1] to R. For f of this form, equation (1) implies that N almost surely, E[f (V ) | Ft ] = =1 E[f (V () ) | Ft() ]. By Proposition 1.1.1, N
E[f (V ) | Ft ] =
Mt() (f ), =1
a.s.,
1 Haar Systems
53
where (Mk (f ); k ≥ 0) is the one-parameter process defined in Section 1.1. (Note: The notation is being slightly abused. When t ∈ NN 0 and f : [0, 1]N → R, Mt (f ) is the stochastic process of this section. When t ∈ N10 and f : [0, 1] → R, Mt (f ) is the one defined in Section 1.1.) To finish, let us observe the following simple calculation for f of the above form: N
Mt (f ) =
Mt() (f ). =1
This follows from theform of the Haar system together with the observaN tion that when f = f , f, hN = k,j =1 f , hk() ,j () . A final word of caution: The first inner product above is an integral over [0, 1]N , while the second one is over [0, 1]. This completes our proof. Exercise 1.2.2 If f ∈ L1 [0, 1]N , prove that (Mt,...,t (f ); t ∈ N0 ) is a uniformly integrable one-parameter martingale with respect to the one parameter filtration (Ft,...,t ; t ∈ N10 ). We can argue as in the previous section and use Exercise 1.2.2 to deduce the following: Theorem 1.2.1 Suppose f ∈ L1 [0, 1]N . Then, N hN f (t) = lim k,j (t)f, hk,j , n→∞
0 k (n,...,n) j∈ΓN (k)
for Lebesgue almost all t ∈ [0, 1]N and in L1 [0, 1]N . Exercise 1.2.3 Complete the above proof of Theorem 1.2.1.
Note that we have used only the one-parameter theory to obtain the −1 above. Suppose next that f is L lnN L-bounded. We can use the multi+ parameter martingale convergence theorem (Corollary 2.8.1 of Chapter 1) and its Lp [0, 1]N extensions (Exercise 1.1.2) to obtain the following sharper form of Theorem 1.2.1. Theorem 1.2.2 Suppose f : [0, 1]N → R satisfies |f (t)| · [ln+ |f (t)|]N −1 dt < ∞.
(2)
[0,1]N
Then, f (t) = lim
s→∞
0ks
j∈ΓN (k)
N hN k,j (t)f, hk,j ,
for Lebesgue almost all t ∈ [0, 1]N and in L1 [0, 1]N . Moreover, if f ∈ Lp [0, 1]N for some p ∈ (1, ∞), then convergence also holds in Lp [0, 1]N .
54
2. Two Applications in Analysis
Exercise 1.2.4 Complete the above proof of Theorem 1.2.2.
Theorem 1.2.1 shows that the Haar system forms a basis for L1 [0, 1]N . On the other hand, Theorem 1.2.2 implies that for p > 1, Lp [0, 1]N is spanned by the Haar system, in a uniform fashion.
2 Differentiation We will discuss two differentiation theorems of classical analysis: 1. Lebesgue’s differentiation theorem; and 2. the Jessen–Zygmund–Marcinkiewicz theorem.
2.1 Lebesgue’s Differentiation Theorem Given a continuous function f : [0, 1]N → R, and any ∆, t0 ∈ RN +, 1 f (t) dt − f (t0 ) ≤ sup |f (t) − f (t0 )|. N (j) [t ,t +∆] ∆ t∈[t0 ,t0 +∆] 0 0 j=1 Therefore, for any t0 ∈ ]0, 1[N , lim
∆∈(0,∞)N +: ∆→0
N
1
j=1
∆(j)
[t0 ,t0 +∆]
f (t) dt = f (t0 ).
(1)
There is need for a technical aside here: As we have stated things, f (t) may not be defined for all t ∈ [t0 , t0 + ∆]. To be completely careful, we will extend the definition of any f : [0, 1]N → R by defining f (t) to be 0 where t ∈ [0, 1]N . It is instructive to check that (1) holds uniformly over all choices of t0 ∈ ]0, 1[N . Equation (1) says that—at least for continuous functions—derivatives are anti-integrals. Lebesgue’s differentiation theorem shows that, as long as the integrals are well-defined, this is always almost the case. In its simplest form, Lebesgue’s differentiation theorem states the following: Theorem 2.1.1 (Lebesgue’s Differentiation Theorem) For any function f ∈ L1 [0, 1]N , and for almost all t ∈ [0, 1]N , −N lim ε f (s) ds = f (t). ε→0+
[t,t+(ε,...,ε)]
It is important to note that the approximation in Lebesgue’s differentiation theorem is not as strong as the one in (1). The latter allows for
2 Differentiation
55
N -dimensional rectangles whose sides collapse possibly at different rates, while the former is a statement about N -dimensional hypercubes; in particular, the sides are all of equal length. The key to the above theorem is a maximal inequality. To describe it, define the maximal operator M by M f (t) = sup ε−N |f (s)| ds, t ∈ [0, 1]N , ε>0
[t,t+(ε,...,ε)]
where f (t) = 0 if t ∈ [0, 1]N , for simplicity. The required maximal inequality is the following: Proposition 2.1.1 Suppose f ∈ L1 [0, 1]N . Then for all λ > 0, Leb{t ∈ [0, 1]N : M f (t) ≥ λ} ≤
4N f 1 . λ
Proof Applying Proposition 1.2.1 to |f | and noting the absolute values, we see that for U uniformly distributed on [0, 1]N and F the corresponding dyadic filtration, t ∈ NN Mt (f ) = E |f (U )| Ft , 0 . See Section 1.2 for definitions. In particular, M (f ) = (Mt (f ); t ∈ NN 0 ) is an N -parameter martingale with respect to F. For all k ∈ NN and j ∈ ΓN (k), define Ik,j to be the interior of the (necessarily closed) support of the Haar function hN k,j . That is, N
Ik,j =
() −k() () () j 2 , (j + 1)2−k ,
k ∈ NN , j ∈ ΓN (k).
(2)
=1
The following is an instructive exercise in conditional expectations: For all t, k ∈ NN with k t and for all j ∈ ΓN (k), 1 E |f (U )| Ft 1l(U ∈Ik,j ) = |f (s)|ds · 1l(U ∈Ik,j ) , a.s. Leb(Ik,j ) Ik,j Define p : R → RN by p(x) = (x, . . . , x), and let Xk (t) = 2N k |f (s)| ds · 1lIp(k),j (t), j∈ΓN (k)
Ip(k),j
k ≥ 1, t ∈ RN +.
Since Leb(Ip(k),j ) = 2−N k and the Ik,j ’s are disjoint, we have shown that for all integers k ≥ 1, Mp(k) (f ) = Xk (U ), a.s. In particular, we have shown that (Xk (U ); k ≥ 1) is a nonnegative martingale with respect to the filtration
56
2. Two Applications in Analysis
F ◦ p = (Fp(k) ; k ≥ 1). Therefore, by the weak (1,1) inequality (Theorem 1.3.1, Chapter 1), for all λ > 0,
1 P sup Xk (U ) ≥ λ ≤ sup E[Xk (U )] λ k≥1 k≥1 1 |f (s)| ds · P(U ∈ Ip(k),j ) = sup 2N k λ k≥1 Ip(k),j N j∈Γ (k)
f 1 , = λ
(3)
since the closure of the union over the j’s of the Ip(k),j ’s is all of [0, 1]N . We finish our proof by using an interpolation argument that relates (3) to the maximal function. For all integers k ≥ 2 and every t ∈ ]0, 1[N , we can uniquely find an integer j ∈ ΓN (k) such that t ∈ Ip(k),j . Therefore, there exists a unique j such that [t, t + p(2−k )] is a subset of Ip(k−1),j . (This is why we required k ≥ 2 and not 1.) In particular, Nk |f (s)| ds ≤ 2N Xk−1 (t). 2 [t,t+p(2−k )]
Now take ε ∈ ]0, 14 [. We can find an integer k ≥ 2 such that 2−k−1 ≤ ε ≤ 2−k . Consequently, |f (s)|ds ≤ 2N (k+1) |f (s)| ds ≤ 4N Xk−1 (t), ε−N [t,t+p(2−k )]
[t,t+p(ε)]
thus establishing the pointwise inequality |f (s)| ds ≤ 4N sup Xk (t), sup ε−N 0<ε< 14
t ∈ ]0, 1[N .
k≥1
[t,t+p(ε)]
On the other hand, it is easy to see that sup ε−N |f (s)| ds ≤ 4N f 1 . 1 4 ≤ε
[t,t+p(ε)]
Thus, whenever M f (t) ≥ λ, supk≥1 Xk (t) ≥ 4−N λ. In other words, for all λ ≥ 4N f 1, Leb t ∈ [0, 1]N : M f (t) ≥ λ ≤ Leb t ∈ [0, 1]N : sup Xk (t) ≥ 4−N λ k≥1
= P sup Xk (U ) ≥ 4−N λ
k≥1
4N f 1 , ≤ λ by equation (3). This completes our proof.
2 Differentiation
57
Exercise 2.1.1 Prove that for all p > 1, there exists a finite, positive constant C such that whenever f ∈ Lp [0, 1]N , M f p ≤ Cf p . This is called the Hardy–Littlewood maximal inequality. We are ready to verify Theorem 2.1.1. Proof of Theorem 2.1.1 Throughout this proof, for any g ∈ L1 [0, 1]N , and for all ε > 0, we write gε (t) = ε−N g(s) ds, t ∈ ]0, 1[N , [t,t+(ε,...,ε)]
and extend gε to a function on [0, 1]N by continuity. It should be recognized that whenever g is continuous, then limε→0 gε = g, uniformly on compacts. If f, g ∈ L1 [0, 1]N , an application of the triangle inequality yields fε − gε 1 ≤ f − g1 . On the other hand, for any f ∈ L1 [0, 1]N , we can always find continuous g n such that limn→∞ g n = f in L1 [0, 1]N . Thus, we can use the previous display to establish fε − f 1 ≤ fε − gεn 1 + gεn − g n 1 + f − g n 1 ≤ 2f − g n 1 + gεn − g n 1 . Now, first let ε → 0 to deduce lim supε→0 fε − f 1 ≤ 2f − g n 1 . Then, let n → ∞ to see that fε → f in L1 [0, 1]N . It remains to prove almost everywhere convergence. Recall, once more, that if g is continuous, then limε→0 gε = g, pointwise. In particular, for any continuous function g : [0, 1]N → R, 0 ≤ lim sup fε − lim inf fε ≤ 2M (|f − g|), ε→0
ε→0
pointwise. Consequently, by Proposition 1.1.1, for any λ > 0, 2 · 4N f − g1 . Leb t ∈ [0, 1]N : lim sup fε (t) − lim inf f (t) ≥ λ ≤ ε→0 λ ε→0 Since this holds for an arbitrary continuous g, the above is, in fact, equal to 0 by density. Let λ ↓ 0 along a rational sequence to conclude that limε→0 fε exists almost everywhere. On the other hand, by the already-proved L1 convergence, there exists a subsequence ε → 0 such that fε → f , almost everywhere. Hence, limε→0 fε = f almost everywhere, as desired. Exercise 2.1.2 Prove an Lp [0, 1]N version of Theorem 2.1.1; cf. Exercise 1.1.2 for the 1-parameter version of this.
58
2. Two Applications in Analysis
Exercise 2.1.3 Verify that Lebesgue’s differentiation theorem (Theorem 2.1.1) remains true if we replace [0, 1]N by RN .
2.2 A Uniform Differentiation Theorem As we saw from its proof, Theorem 2.1.1 is actually a one-parameter, or one-dimensional, result. Roughly speaking, it says that if f ∈ L1 [0, 1]N , then its “distribution function” is Lebesgue almost everywhere differentiable. There is a much stronger result, due to B. Jessen, J. Marcinkiewicz, and A. Zygmund, that holds under the stronger assumption that f is in L(ln+ L)N −1 . To simplify the notation, for the remainder of this section define Ψ(x) = x(ln+ x)N −1 , x > 0. Theorem 2.2.1 Suppose f : [0, 1]N → R is a measurable function that satisfies the integrability condition Ψ ◦ |f | ∈ L1 [0, 1]N . Then, for Lebesgue almost all t ∈ [0, 1]N , 1 f (s) ds = f (t). lim N (j) [t,t+∆] ∆∈ ]0,1[N : j=1 ∆ ∆→0
The main point of this theorem is that the sides of the rectangles [t, t+∆] need not go to zero at the same rate, as long as |f (x)| · {ln+ |f (x)|}N −1 dx < ∞. [0,1]N
It is also worth mentioning that in the above, the domain of definition of the function f is implicitly extended to all of RN by defining f (t) ≡ 0 if t ∈ [0, 1]N . Just like its one-parameter counterpart (Theorem 2.1.1), Theorem 2.2.1 is a consequence of a maximal inequality. Define the multiparameter max! by imal operator M !f (t) = sup 1 |f (s)| ds, M N (j) [t,t+∆] ∆∈ ]0, 14 [N j=1 ∆ where f (t) = 0 if t ∈ [0, 1]N . The N -parameter analogue of Proposition 1.2.1 is the following: Proposition 2.2.1 Suppose f : [0, 1]N → R+ is a measurable function such that Ψ ◦ f ∈ L1 [0, 1]N . Then, for all λ > 0, N e N −1 !f (t) ≥ λ} ≤ 2 Leb{t ∈ [0, 1]N : M (N − 1) + Ψ ◦ f 1 . λ e−1
2 Differentiation
59
Proof First, note that f ≥ 0, by definition. Having made this remark, we now adapt the presented proof of Proposition 2.1.1 to the present multiparameter setting. Recall equation (2), Section 2.1, for the definition of Ik,j , k ∈ NN , j ∈ ΓN (k) and define () N 'k (t) = 2 N =1 k · f (s)ds · 1lIk,j (t), t ∈ RN X +, k ∈ N . j∈ΓN (k)
Ik,j
N
()
For any k ∈ NN and j ∈ ΓN (k), Leb(Ik,j ) = 2− =1 k . Thus, the ' = argument of the presented proof of Proposition 2.1.1 shows that X 'k (U ); k ∈ NN ) is a nonnegative N -parameter martingale with respect (X to the dyadic filtration F. Moreover, by Proposition 1.2.1, F is commuting. ' is an orthomartingale with Consequently (Corollary 3.5.1 of Chapter 1), X respect to the marginal filtrations of F. By Theorem 2.5.1 of Chapter 1, for all λ > 0, P
e N −1
'k (U )) . 'k (U ) ≥ λ ≤ 1 sup X (N − 1) + E Ψ(X λ e−1 k∈NN
On the other hand, since Ψ is convex nondecreasing, by Jensen’s inequality,
' Ψ f (s) ds ≤ Ψ ◦ f 1 . E Ψ Xk (U ) ≤ j∈ΓN (k)
Ik,j
(Why?) Thus, we have shown that for all λ > 0, P
e N −1
'k (U ) ≥ λ ≤ 1 {(N − 1) + Ψ ◦ f 1 }. sup X λ e−1 k∈NN
(1)
Next, we will relate this to the maximal function. Recall the function p : R → RN given by p(t) = (t, . . . , t). For all k ∈ NN , () define αk to be the N -dimensional vector whose th coordinate is 2−k . Next, for any ∆ ∈ ]0, 14 [N , find k p(2) such that αk+p(1) ∆ αk . By monotonicity, for all t ∈ ]0, 1[N , 1 1 'k−p(1) (t). f (s) ds ≤ N f (s) ds = 2N X N (j) (j) [t,t+∆] [t,t+α ] α k j=1 ∆ j=1 k+p(1) The result follows from (1).
Exercise 2.2.1 For all p ∈ (1, ∞), prove the existence of a positive, finite !f p ≤ constant C that depends on p such that for all f ∈ Lp [0, 1]N , M Cf p .
60
2. Two Applications in Analysis
We are ready for the following. Proof of Theorem 2.2.1 Throughout, for all integrable functions g : [0, 1]N → R, and for all ∆ ∈ ]0, ∞[N , we write 1 g∆ (t) = N g(s) ds, (j) [t,t+∆] j=1 ∆ ' Θg(t) = lim sup g∆ (t) − lim inf g∆ (t), ∆→0
∆→0
for all t ∈ ]0, 1[N . We can extend the domain of g∆ to all of [0, 1]N by continuity. Given a function f as in the statement of the theorem, we can find continuous functions g n : [0, 1]N → R such that lim g n − f 1 = 0.
n→∞
On the other hand, Ψ(|x − y|) ≤ |Ψ(x) − Ψ(y)|; cf. equation (3), Section 2.8, Chapter 1. Thus, by uniform integrability, for any fixed δ > 0, ( |g n − f | ( ( ( lim (Ψ ◦ ( = 0. n→∞ δ 1 Now, for each fixed n, n ' (t) ≤ Θg ' n (t) + 2M !(|f − g n |)(t) = 2δ M ! |f − g | (t), Θf δ
t ∈ ]0, 1[N .
The latter equality holds from continuity of g n . Consequently, we can apply Proposition 2.2.1 to deduce that for any λ > 0, ' (t) ≥ λ} Leb{t ∈ [0, 1]N : Θf ( |f − g n | ( N +1 2 δ e N −1 ( ( (N − 1) + (Ψ ◦ ≤ ( . λ e−1 δ 1 ' = We can let n → ∞, δ → 0+ , and λ → 0+ , in this order, to deduce that Θf 0, almost everywhere. Equivalently, lim∆→0 f∆ exists almost everywhere. To show that this limit equals f almost everywhere, we can simply apply Lebesgue’s differentiation theorem (Theorem 2.1.1, why?). Exercise 2.2.2 Prove an Lp [0, 1]N version of Theorem 2.2.1.
Exercise 2.2.3 Prove that Theorem 2.2.1 remains true if we replace [0, 1]N by RN everywhere.
3 Supplementary Exercises
61
3 Supplementary Exercises 1. Given a sequence(ck,j ;k ≥ 1, j ∈ Γ(k)) of real numbers, define n the function Fn (t) = k=0 j∈Γ(k) ck,j hk,j (t), (t ∈ [0, 1]). Supposing that ∞ 1 (k−1) 2 maxj∈Γ(k) |ck,j | < +∞, prove that as n → ∞, Fn converges unik=0 2 formly and in Lp [0, 1] for all p ≥ 1. 2. Show that Theorem 1.1.1 on Haar function expansions implies Lebesgue’s differentiation theorem, Theorem 2.1.1. 3. Suppose (It ; t ≥ 0) is a one-parameter monotonic family of rectangles in [0, 1]N with sides parallel to the axes. That is, (a) for any t ≥ 0, It is of the form [a(1) , b(1) ] × · · · × [a(N) , b(N) ] ⊂ [0, 1]N ; and (b) if s ≤ t, Is ⊂ It . For all functions f : [0, 1]N → R, define the maximal function Mf by 1 |f (x − y)| dy, x ∈ [0, 1]N , Mf (x) = sup t≥0 Leb(It ) It where f (z) = 0, for all z ∈ [0, 1]N . Show that whenever f ∈ Lp [0, 1]N for some p > 1, then Mf ∈ Lp [0, 1]N . In fact, show that for all p > 1, there exists a finite constant Cp > 0 such that for all f ∈ Lp [0, 1]N , Mf p ≤ Cp f p . This is from Zygmund (1988, Ch. XVII). 4. For all ε > 0 and t ∈ RN , let Rε (t) denote the collection of all cubes of side ε that contain the point t and whose sides are parallel to the axes, i.e., R ∈ Rε (t) if and only if R = [a, a + (ε, . . . , ε)] for some a ∈ RN such that a t a + (ε, . . . , ε). We can define the enhanced maximal operator M as follows: For all f ∈ L1 (RN ), |f (s)| ds. Mf (t) = sup sup ε−N ε>0 R∈Rε (t)
R
(a) Verify that for all t ∈ RN , 2−N Mf t − (ε, . . . , ε) ≤ M f (t) ≤ Mf (t). (b) Demonstrate the following extension of Proposition 2.1.1: For all f ∈ L1 (RN ) N and all λ > 0, Leb{t ∈ RN : Mf (t) ≥ λ} ≤ 8λ f 1 . (c) Conclude the following enhancement of Lebesgue’s differentiation theorem: Whenever f ∈ L1 (RN ), for almost all t ∈ RN , f (s) ds − f (t) = 0. lim sup ε−N ε→0+ R∈Rε (t)
R
(d) Formulate and prove the corresponding enhancement of the uniform differentiation theorem (Theorem 2.2.1). 5. A function f : Rd → R is said to be& harmonic if it is continuous and if for all x ∈ Rd and all ε > 0, f (x) = (2ε)−d B(x;ε) f (y) dy, where B(x; r) denotes the open ∞ ball of radius r about x. Show that the only bounded harmonic functions on Rd are constants. This is Liouville’s theorem of classical potential theory.
62
2. Two Applications in Analysis
(Hint: For ε of the form ε = 2−n , interpret the right-hand side as a conditional expectation with respect to the dyadic filtration. An alternative proof can be based on Haar function expansions.) 6. Suppose (Ω, F, P) is a probability space. (i) Show that if Y ∈ L1 (P), then A → Q(A) = E[Y 1lA ] defines a measure on the F-measurable subsets of Ω. (ii) Suppose that for every n ≥ 1, Cn = {C1,n , C2,n , . . .} is a denumerable collection of subsets of F that cover Ω. Let F n define the σ-field generated by the elements of Cn and show that E[Y | F n ] =
k≥1: P(Ck,n )>0
Q(Ck,n ) 1lC , P(Ck,n ) k,n
n ≥ 1.
(iii) If Cn+1 ⊃ Cn , conclude that the limn→∞ E[Y | F n ] exists a.s. and in L1 (P). (iv) Suppose Y is ∨n F n -measurable. Then, show that for P-almost every ω ∈ Ω, lim
n→∞
Q(Ck(ω),n ) = Y (ω), P(Ck(ω),n )
where k(ω) is the unique k ≥ 1 such that ω ∈ Ck(ω),n . (Since Y = dQ/dP in the sense of the Radon–Nikod´ ym theorem, the above is a probabilistic proof of the differentiation theorem, which is, in fact, equivalent to the Radon–Nikod´ ym theorem.) (v) Obtain the following form of Lebesgue’s differentiation theorem on R1 : Every function F : R → R that is of bounded variation is a.e. differentiable in the sense that limε→0+ ε−1 {F (x + ε) − F (x)} exists for almost every x ∈ R. This is due to F. Riesz; see Riesz and Sz.-Nagy (1955, Ch. 1) and also (Stein 1970; Stein and Weiss 1971). (vi) Obtain the following form of Lebesgue’s differentiation theorem on a separable metric space (S, d): Given a σ-finite measure µ on the Borel field of S, define for all f ∈ L1 (µ), 1 Tr f (a) = f (y) µ(dy) a ∈ S, r > 0, µ(Bd (a; r)) B d (a;r) where Bd (a; r) = {x ∈ Rd : d(a, r) < r} denotes the ball of radius r about a ∈ S. Prove that as r → 0+ , Tr f → f , µ-almost everywhere. 7. In this exercise we will derive a decomposition of Calder´ on and Zygmund (1952) that is an important tool in the study of singular integrals. (i) Suppose M = (Mn ; n ≥ 0) is a nonnegative one-parameter submartingale with respect to a filtration F = (F n ; n ≥ 0). Suppose M has subexponential growth in the sense that there exists a finite, nonrandom constant C > 0 such that for all n ≥ 0, Mn+1 ≤ CMn . For any λ > 0, define Tλ = inf(n ≥ 0 : Mn > λ), where inf ∅ = +∞. Check that: (a) Tλ is a stopping time for each λ > 0.
4 Notes on Chapter 2
63
(b) on (Tλ < ∞), λ < MTλ ≤ Cλ. (ii) Suppose F is the dyadic filtration on [0, 1]N and consider the martingale M given by M = E[f (V ) | F n ], where f : [0, 1]N → R+ and V is uniformly chosen from [0, 1]N . Use (i) to prove the following: For each α ≥ 0, there exists a decomposition {Φ, Γ}, of [0, 1]N such that: (a) [0, 1]N = Φ ∪ Γ, Φ ∩ Γ = ∅; (b) f (x) ≤ λ, for Lebesgue almost every x ∈ Φ; (c) there exists a countable collection of cubes {Γk ; k ≥ 1} with disjoint interiors such that Γ = ∪k≥1 Γk ; (d) for all k ≥ 1, λ≤
1 Leb(Γk )
Γk
f (x) dx ≤ 2N λ.
(Hint: Show that the dyadic martingale of (ii) satisfies (i) with C = 2N . You may want also to note that (Tλ < ∞) = ∪k (Tλ = k) and (Tλ = k) ∈ F k .)
4 Notes on Chapter 2 Section 1 It is safe to say that a probabilist’s interpretation of Haar functions is Exercise 1.1.1. This exercise can sometimes even be an exercise for the undergraduate student and is a part of the folklore of stochastic processes. The significance of this exercise was showcased by P. L´evy’s construction of Brownian motion, where Supplementary Exercise 1 was essentially introduced and used; cf. (L´evy 1965; Ciesielski 1961). See also Ciesielski (1959), Neveu (1975, III-3), and Ciesielski and Musielak (1959), where you will also find many related works, including proofs for Theorem 1.1.1 and Exercise 1.1.2. Section 2 The differentiation theorem of Lebesgue, as well as that of Jessen, Zygmund, and Marcinkiewicz, is completely classical. See Zygmund (1988, Ch. XVII) for this and related developments. The constants in Proposition 2.2.1 are better than those in the analysis literature, and its probabilistic proof is new. However, the real content of this proof is classical and has already been utilized by Jessen et al. A proof of Theorem 2.2.1 where ∆ ∈ QN + is dyadic can be found in Walsh (1986b), where Cairoli’s convergence theorem is directly applied. It is also possible to use the theory of martingales that are indexed by directed sets in order to prove a more general result than Theorem 2.2.1; see Shieh (1982). An excellent modern source for results relating to this chapter, and much more, is Stein (1993). Section 3 The probabilistic proof outlined in Supplementary Exercise 7 is from Gundy (1969).
This page intentionally left blank
3 Random Walks
Those cannot remember the past are condemned to repeat it. —Santayanna Random walks entered mathematics early on through the analysis of gambling and other games of chance. To cite a typical example, let X0 denote the initial fortune of a certain gambler and let Xn stand for the amount won (if Xn ≥ 0) or lost (if Xn ≤ 0) the nth time that the gambler places a bet. In the simplest i.i.d., and the gambler’s fortune at time n is gambling situations, the Xn ’s are described by the partial sum Sn = n j=0 Xj . The stochastic process S = (Sn ; n ≥ 0) is called a one-dimensional random walk and lies at the heart of modern, as well as classical, probability theory. This chapter is a study of some properties of systems of such walks. The main problem addressed here is, under what conditions does the random walk return to 0 infinitely often? To see how this may come up, suppose the gambler plays ad infinitum and has an unbounded credit line. We then wish to know under what conditions the gambler can break even, infinitely many times, as he or she plays on. In the language of the theory of Markov chains, we wish to know when the state 0 is recurrent. The analogous problem for systems of random walks is more intricate and is the subject of much of this chapter: Suppose the Xj ’s are i.i.d. random vectors in d-space. Then, the d-dimensional random walk models the movement of a small particle in a homogeneous medium. Suppose we have N particles, each of which paints every point that it visits. If each individual particle uses a distinct color, under what conditions do the N random lines created by the N random particles cross paths infinitely many times? These are some of the main problems that are taken up in this chapter.
66
3. Random Walks
1 One-Parameter Random Walks The stochastic process S = (Sn ; n ≥ 1) is a random walk if it has stationary, independent increments. To put it another way, we consider independent, identically distributed random variables X1 , X2 , . . ., all taking nvalues in Rd , and define the corresponding random walk n → Sn as Sn = i=1 Xi (n = 1, 2, . . .). Clearly, X1 = S1 , and for all n ≥ 2, Xn = Sn − Sn−1 , when n ≥ 2. Thus, we are justified in calling the Xi ’s the increments of S. This is a review section on one-parameter random walks; we develop the theory with an eye toward multiparameter extensions that will be developed in the remainder of this chapter.
1.1 Transition Operators Suppose S = (Sn ; n ≥ 1) is a d-dimensional random walk with increments X = (Xn ; n ≥ 1). For all n ≥ 1, define Fn to be the σ-field generated by X1 , . . . , Xn . It is simple to see that Fn is precisely the σ-field generated by S1 , . . . , Sn . In the notation of Chapter 1, we have shown that F = (Fn ; n ≥ 1) is the history of the stochastic process S. It is always the case that the study of the stochastic process S is equivalent to the analysis of probabilities of the form P(Sn1 ∈ E1 , Sn2 ∈ E2 , . . . , Snk ∈ Ek ), where k, n1 , . . . , nk ≥ 1 are integers and E1 , . . . , Ek are measurable subsets of Rd . These probabilities are called the finite-dimensional distributions of S. It turns out that the finite-dimensional distributions of the random walk S are completely determined by the collection P(X1 + x ∈ E), where E ⊂ Rd is measurable and x ∈ Rd . A precise form of such a statement is called the Markov property; we shall come to this later. Bearing this discussion in mind, we define for all measurable functions f : Rd → R, all n ≥ 1, and x ∈ Rd , Tn f (x) = E f (Sn + x) . In particular, note that for all Borel sets E ⊂ Rd , T1 1lE (x) = P(X1 + x ∈ E). Thus, once we know the operator Tn , we know how to compute these probabilities. We begin our study of random walks by first analyzing these operators. Note that Tn is a bounded linear operator: For all bounded measurable f, g : Rd → R, n ≥ 1, x ∈ Rd and all α, β ∈ R, (i) supx∈Rd |Tn f (x)| ≤ supx∈Rd |f (x)|; (ii) Tn (αf + βg)(x) = αTn f (x) + βTn g(x); and (iii) x → Tn f (x) is measurable.
1 One-Parameter Random Walks
67
Next, we interpret Tn in terms of the conditional distributions of S. Lemma 1.1.1 For all n, k ≥ 1 and all bounded measurable f : Rd → R, a.s. E f (Sk+n ) Fk = E f (Sk+n ) Sk = Tn f (Sk ), In particular, for all x ∈ Rd , n, k ≥ 1, and all bounded measurable f : Rd → R, Tn+k f (x) = Tn (Tk f )(x) = Tk (Tn f )(x). In functional-analytic language, (Tn ; n ≥ 1) is a semigroup of operators. To see what the above lemma means, take f = 1lE for some Borel set E ⊂ Rd . The above says that if k denotes the current time, 1. given the present position Sk , any future position Sk+n is conditionally independent of the past positions S1 , . . . , Sk−1 ; and 2. Tn 1lE (Sk ) is the conditional probability of making a transition to E in n steps, given Fk . Motivated by this, we call Tn the n-step transition operator of S. k+n is (a) inProof of Lemma 1.1.1 Note that Sk+n − Sk = j=k+1 Xj n dependent of Fk ; and (b) has the same distribution as Sn = j=1 Xj . Thus, E f (Sk+n ) Fk = E f (Sk+n − Sk + Sk ) Fk = f (x + Sk ) P(Sn ∈ dx) = Tn f (Sk ), almost surely. From this, we also can conclude the equality regarding the conditional expectation E[f (Sk+n ) | Sk ]. Applying the preceding to f (•+x), we obtain E[f (x + Sk+n ) | Fk ] = Tn f (x + Sk ), almost surely. Taking expectations, we deduce that Tk+n f (x) = Tk (Tn f )(x). The rest follows from reversing the roles of k and n. Digression If we define S0 = 0, then for any x ∈ Rd , we can, and should, think of x+S as our random walk started at x. In particular, S itself should be thought of as the random walk started at the origin. The above lemma suggests the following interpretation: Given the position of the process at time k, the future trajectories of our walk are those of a random walk started at Sk . The following is a more precise formulation of this and is a version of the so-called Markov property of S that was alluded to earlier. Theorem 1.1.1 (The Markov Property) Fix integers k ≥ 1, n ≥ 2 and bounded measurable functions f1 , . . . , fn : Rd → R. Then, the following holds with probability one: n n E f (Sk+ − Sk ) Fk = E f (S ) . =1
=1
68
3. Random Walks
In other words, for any k ≥ 1, the process n → Sn+k − Sk is (i) independent of Fk ; and (ii) has the same finite-dimensional distributions as the original process S. Recalling that we think of n → Sn + x as a random walk with increments X1 , X2 , . . . that starts at x ∈ Rd , we readily obtain the following useful interpretation of the above. Corollary 1.1.1 Suppose k ≥ 1 is a fixed integer. Then, conditionally on σ(Sk ), (Sk+n ; k ≥ 0) is a random walk whose increments have the same distribution as X1 . Moreover, the σ-field generated by (Sk+n ; n ≥ 0) is conditionally independent of Fk , given σ(Sk ). See Section 3.6 of Chapter 1 for information on conditional independence. Exercise 1.1.1 Carefully prove Corollary 1.1.1.
Proof of Theorem n 1.1.1 Since it depends only on Xk+1 , . . . , Xk+n , the random variable =1 f (Sk+ − Sk ) is independent of (X1 , . . . , Xk ) and hence of Fk . (Why?) As a result, with probability one, E
n =1
f (Sk+ − Sk ) Fk = E
n
f (Sk+ − Sk ) .
=1
On the other hand, the sequence (Xk+1 , . . . , Xk+n ) has the same distribution as the sequence (X1 , . . . , Xn ). After performing a little algebra, we can reinterpret this statement as follows: The distribution of the Rnd -valued . . , Sk+n −Sk ) is the same as that of (S1 , . . . , Sn ). random vector (Sk+1 −Sk , . n n In particular, we have E[ =1 f (Sk+ − Sk )] = E[ =1 f (S )], which proves the result. It is clear that Corollary 1.1.1 extends the conditional independence assertion of Lemma 1.1.1. However, the latter lemma also contains information on the transition operators, to which we now return. Corollary 1.1.2 The transition operators, in fact T1 , uniquely determine the finite-dimensional distributions and vice versa. Proof By the very definition of Tn , if we know all finite-dimensional distributions, we can compute Tn f (x) for all measurable f : Rd → R+ , all n ≥ 1, and all x ∈ Rd . The converse requires an honest proof. Consider the following proposition: (Πn ) For all measurable f1 , . . . , fn : Rd → R+ , E[ n=1 f (S )] can be computed from T1 . Our goal is to show that (Πn ) holds for all n ≥ 1. We will prove this by using induction on n: Lemma 1.1.1 shows that (Π1 ) is true. Thus, we
1 One-Parameter Random Walks
69
suppose that (Π1 ), . . . , (Πn−1 ) hold and venture to prove (Πn ). By Lemma 1.1.1, for all measurable f1 , . . . , fn : Rd → R+ , E
n =1
n−1 n−1 f (S ) Fn−1 = f (S ) · T1 f (Sn−1 ) = g (S ), =1
=1
where gi = fi for all 1 ≤ i ≤ n − 2 and gn−1 (x) = fn−1 (x) · T1 fn−1 (x). Takn−1 n ing expectations, we see that E[ =1 f (S )] = E[ i=1 gi (Si )]. By Πn−1 , this can be written entirely in terms of T1 , thus proving (Πn ). n Exercise 1.1.2 Find an explicit recursive formula for E[ =1 f (S )] in terms of T1 .
1.2 The Strong Markov Property Let S = (Sk ; k ≥ 1) denote a d-dimensional random walk with history F = (Fk ; k ≥ 1) and increment process X = (Xk ; k ≥ 1). The strong Markov property of S states that for any finite stopping time T (with respect to the filtration F), the stochastic process (Sk+T − ST ; k ≥ 1) is independent of FT and has the same finite-dimensional distributions as the process S. Roughly speaking, this means that the process (Sk+T ; k ≥ 1) is conditionally independent of FT given ST and is, in distribution, the random walk S started at ST . Theorem 1.2.1 (The Strong Markov Property) Suppose T is a stopping time with respect to F. Given integers n, k ≥ 1 and bounded, measurable f1 , . . . , fn : Rd → R, E
n =1
f (ST + − ST ) FT 1l(T <∞) = E
n
f (S ) 1l(T <∞) ,
a.s.
=1
Remarks (i) Given the transition operators, the above expression can be computed using Corollaries 1.1.1 and 1.1.2; see Exercise 1.1.2. (ii) It is important to realize that the stopping time condition cannot be removed in general, as the following clearly shows. Exercise 1.2.1 Consider the simple walk on Z1 . Here, the increments X1 , X2 , . . . take the values ±1 with probability 12 each. Consider the N0 ∪ {∞}-valued random variable L = sup(k ≥ 0 : Sk ≤ − 12 k), where sup ∅ = 0. That is, L designates the last time that the random walk goes below the line y = − 21 x. (i) Show that with probability one, L < ∞ and that L is not a stopping time with respect to the history of the process S.
70
3. Random Walks
(ii) Verify that FL is a σ-field and that the process j → Sj+L − SL is independent of
FL , where FL = A ∈ ∨n Fn : A ∩ (L ≤ j) ∈ Fj , for all j ≥ 0 is defined as if L were a stopping time. (iii) Show that the stochastic process j → SL+j − SL does not have the same finite-dimensional distributions as S. This is a part of a deep result of Williams (1970, 1974). (Hint: for part (i), you can use a limit theorem; for part (ii), condition on the value of L.) T + Proof of Theorem 1.2.1 For all ≥ 1, ST + − ST = j=T +1 Xj . Since for all j ≥ 1, the event (T = j) is FT -measurable, E
n
∞ f (ST + − ST ) FT 1l(T <∞) = E
=1
n
j=1
=1 n
j=1
=1
∞ = E
f (ST + − ST ) FT 1l(T =j) f (Sj+ − Sj ) FT 1l(T =j) ,
n almost surely. Regarding j ≥ 1 as fixed, define Y = =1 f (Sj+ − Sj ) and for all k ≥ 1, let Mk = E[Y | Fk ]. By Theorem 1.1.1, Chapter 1, with probability one, Mj 1l(T =j) = MT 1l(T =j) = E[Y |FT ]1l(T =j) . Thus, E
n
∞ f (ST + − ST ) FT 1l(T <∞) = E
=1
j=1
n
f (Sj+ − Sj ) Fj 1l(T =j) .
=1
By the stationarity and the independence of the increments of S, the above n equals E[ =1 f (S )]1l(T <∞) , as desired.
1.3 Recurrence Suppose S is a d-dimensional random walk with increment process X and history F. Throughout this section we assume that the X’s are taking values in the d-dimensional integer lattice Zd . A point x ∈ Zd is said to be recurrent if P(Sk = x infinitely often) > 0. When is a point x ∈ Zd recurrent? In this subsection we will resolve this when x is the origin of Zd . Since it is the starting position of the random walk, the origin is a very special point; see the Digression in Section 1.1. Recurrence properties of a general point x ∈ Zd are discussed in Section 1.6 below. Recalling that inf ∅ = ∞, let τ1 = inf(j ≥ 1 : Sj = 0); that is, τ1 is the first time the random walk visits 0. Iteratively define τk+1 = inf(j ≥ 1+τk : Sj = 0), for k ≥ 1. It is easy to see that τ1 , τ2 , . . . are stopping times. One should think of τ1 (τ2 , . . .) as the first (second, etc.) time the random walk visits the origin. Among other things, this sequence of visitation times has the following property.
1 One-Parameter Random Walks
71
Lemma 1.3.1 Fix n, j ≥ 1. On (τn < ∞), P(τn+1 − τn = j | Fτn ) = P(τ1 = j),
a.s.
Suppose we knew that with probability one, τn < ∞ for all n ≥ 1. The above lemma asserts that in this case, τ1 , τ2 − τ1 , . . . is a sequence of independent, identically distributed random variables (why?). Since τn = τ1 + nj=2 (τj − τj−1 ), τ = (τn ; n ≥ 1) is then identified as a random walk with nonnegative increments. Proof This is a consequence of the strong
Markov property (see Theorem 1.2.1). In fact, since Sτn = 0 on τn < ∞ ,
P τn+1 − τn = j Fτn 1l(τn <∞)
= P Sτn + = 0 for all 1 ≤ ≤ j − 1, Sτn +j = 0 Fτn 1l(τn <∞)
= P Sτn + − Sτn = 0 for all 1 ≤ ≤ j − 1, Sτn +j − Sτn = 0 Fτn 1l(τn <∞)
= P S = 0 for all 1 ≤ ≤ j − 1, Sj = 0 1l(τn <∞)
= P τ1 = j 1l(τn <∞) . The strong Markov property (Theorem 1.2.1) is used in the penultimate line. This proves the result. In particular, upon summing Lemma 1.3.1 over all integers j ≥ 1, we arrive at the following: For all n ≥ 2, P(τn < ∞) = P(τn − τn−1 < ∞, τn−1 < ∞) = E P(τn − τn−1 < ∞ | Fτn−1 )1l(τn−1 <∞) = P(τ1 < ∞) · P(τn−1 < ∞). By induction,
n P(τn < ∞) = P(τ1 < ∞) .
(1)
With the unambiguous understanding that ∞ ≤ ∞, we can deduce that the τn ’s are nondecreasing. Continuity properties of probability measures then imply that n P(0 is recurrent) = lim P(τn < ∞) = lim P(τ1 < ∞) . n→∞
n→∞
Taking equation (1) into account, we have proven the following: Proposition 1.3.1 The following are equivalent: (i) 0 is recurrent; (ii) P(Sk = 0 infinitely often) = 1; and
72
3. Random Walks
(iii) P(τ1 < ∞) = 1. Informally, we are stating that if starting from the origin we are sure of returning to the origin, then we will do so infinitely many times. This is an example of the strong Markov property at its finest.
1.4 Classification of Recurrence A natural question is, how do the finite-dimensional distributions of a Zd valued random walk influence the recurrence of the point 0? For all integers n ≥ 1, define n 1l(Sk =0) . Rn = 1 + k=1
Recalling the Digression of Section 1.1, we think of S as starting from the origin, so that at time 0, S is at 0. Viewed as such, Rn denotes the total number of visits to the origin by time n. Note that R∞ = limn→∞ Rn is a random variable taking values in N∪{∞}. Proposition 1.3.1 can be restated as follows: P(R∞ = ∞) ∈ {0, 1}. Moreover, this probability is 1 if and only if 0 is recurrent. key to our analysis of recurrence turns out to be E[R∞ ] = 1 + The ∞ P(S olya, K. k = 0). In fact, we have the following result, due to G. P´ k=1 L. Chung, and W. H. J. Fuchs, which appeared in Chung and Fuchs (1951) in full generality; see (P´ olya 1921; Chung and Ornstein 1962) for some related results. Supplementary Exercise 9 contains a complete statement of the above results: the so-called Chung–Fuchs theorem. Theorem olya Criterion) The point 0 is recurrent if and ∞1.4.1 (The P´ only if k=1 P(Sk = 0) = ∞. Informally, S will hit 0 infinitely often if it is expected to do so. For our proof, we need the the following simple and powerful lemma, first found in Paley and Zygmund (1932). Lemma 1.4.1 (Paley–Zygmund Lemma) Suppose Z is an almost surely nonnegative random variable. Then for all ε ∈ ]0, 1[, 2
{E[Z]} , P Z ≥ εE[Z] ≥ (1 − ε)2 2 E[Z ]
provided that all of the mentioned expectations exist. Exercise 1.4.1 Prove the Paley–Zygmund lemma. (Hint: Apply the Cauchy–Schwarz inequality to E[Z1l(Z≥εE[Z]) ].)
1 One-Parameter Random Walks
73
Exercise 1.4.2 If Z is a nonnegative random variable that is also in 2 L2 (P), show that P(Z = 0) ≤ Var(Z)/ E[Z] , where Var denotes the variance. Exercise 1.4.3 Suppose E1 , E2 , . . . are measurable events such that j P(Ej ) = +∞. Prove that whenever n n j=1 k=1 P(Ej ∩ Ek ) < ∞, lim inf n 2 n→∞ j=1 P(Ej ) os 1952; then P(En infinitely often) > 0. This is from (Chung and Erd˝ Kochen and Stone 1964). (Hint: Consider the first two moments of Jn = nj=1 1lEj .) Proof of Theorem 1.4.1 We have already made the observation that ∞ R∞ ≥ 1 and E[R∞ − 1] = k=1 P(Sk = 0). (Since R∞ = limn Rn , a.s., this is a consequence of the monotone convergence theorem of measure theory.) P(S = 0) < ∞ if and only if E[R∞ − 1] < ∞. Consequently, Thus, k k P(S < ∞) < ∞ certainly implies that R∞ < ∞, a.s.; that is to say k k that 0 is not recurrent.Next, we suppose that k P(Sk = 0) = ∞. It is n clear that E[Rn − 1] = k=1 P(Sk = 0) and that this sequence explodes as n → ∞. We now estimate E[(Rn − 1)2 ], viz., n E (Rn − 1)2 = E 1l(Sk =0) + 2E 1l(Sk =0) 1l(S =0) k=1
= E[Rn − 1] + 2
1≤k<≤n
P(Sk = 0)P(S−k = 0),
1≤k<≤n
by the Markov property (Theorem 1.1.1). Relabeling the last summation and possibly adding more nonnegative terms, we arrive at the estimate
2 E (Rn − 1)2 ≤ E[Rn − 1] + 2 E[Rn − 1] . Since Rn − 1 ∈ N0 , (Rn − 1 > 0) = (Rn ≥ 2). Applying Lemma 1.4.1 first, and then the above estimate, in this order, we arrive at the following:
2 E[Rn − 1] P(τ1 ≤ n) = P(Rn ≥ 2) ≥
2 , E[Rn − 1] + 2 E[Rn − 1]
where τ1 = inf j ≥ 1 : Sj = 0 . Since limn E[Rn ] = ∞, this implies that P(τ1 < ∞) ≥ 12 . By Proposition 1.3.1, whenever P(τ < ∞) is positive, it is, in fact, 1. This completes our proof. While it was meant to bring forth a powerful technique, our demonstration of Theorem 1.4.1 is not the fastest method for getting there, as we see next.
74
3. Random Walks
Exercise 1.4.4 Let N denote the total number of returns to zero. That ∞ is, N = k=0 1l(Sk =0) . Show that N is a geometric random variable with olya’s mean p−1 , where p = P(∃k ≥ 1 : Sk = 0). Use this to verify P´ criterion. (Hint: Show that for all k ≥ 1, P(N ≥ k) = pP(N ≥ k − 1).)
1.5 Transience When a point x ∈ Zd is not recurrent for the Zd -valued random walk S, we say that it is transient. It is easy to see that 0 ∈ Zd is transient if and only if lim P(Sk = 0 for some k ≥ n) = 0. n→∞
Thus, a natural measure for the strength of the transience of the origin is the rate at which P(Sk = 0 for some k ≥ n) goes to 0 as n goes to infinity. The following sheds much light on this rate. Theorem 1.5.1 If the origin is transient for the Zd -valued random walk S, the following holds for every integer n ≥ 1:
1 T ≤ P Sk = 0 for some k ≥ n ≤ 8T , 2 ∞
where T =
1+
j=n P(Sj = 0) . ∞ j=1 P(Sj = 0)
This theorem makes the point that as n → ∞, P(Sk = 0 for some k ≥ n) goes to zero like a constant multiple of j≥n P(Sj = 0). Remarks 1. This can be sharpened; see Supplementary Exercise 1. 2. Throughout this subsection we implicitly use the notation of Section 1.3 and Section 1.4. −1 ; see 3. It can be shown that P(τ1 = ∞) = {1 + ∞ k=1 P(Sk = 0)} Supplementary Exercise 1. This is the probability of never hitting 0. ∞ Proof By transience and by Theorem 1.4.1, j=1 P(Sj = 0) < ∞. For all n ≥ 1, let ∞ Z= 1l(Sj =0) = R∞ − Rn−1 , j=n
∞ where R0 = 1. Clearly, E[Z] = j=n P(Sj = 0), which we know is finite. Recall our proof of Theorem 1.4.1; the method used there to estimate
1 One-Parameter Random Walks
75
E[(Rn − 1)2 ] can be used here to show that E[Z 2 ] ≤ 2
∞
∞ P(S = 0) · 1 + P(Sj = 0) .
(1)
j=1
=n
Since (Z > 0) ⊆ (Sk = 0 for some k ≥ n), we obtain the lower bound from the Paley–Zygmund lemma (Lemma 1.4.1). For the upper bound on the probability, define ∞ 1l(Sj =0) Fk , Mk = E
k ≥ n.
j=n
It is not hard to check that M = (Mk ; k ≥ n) is a martingale. Moreover, for all k ≥ n, ∞ ∞ Mk ≥ E 1l(Sj =0) Fk ·1l(Sk =0) = 1+ P(Sj+k −Sk = 0 | Fk ) ·1l(Sk =0) . j=1
j=k
We have used the monotone convergence theorem to write the conditional expectation and the sum of the conditional ∞ probabilities. By the Markov property (Corollary 1.1.1), Mk ≥ {1 + j=1 P(Sj = 0)} · 1l(Sk =0) , almost surely. Taking suprema over all k ≥ n and squaring, we obtain the following: 1l(Sk =0
for some k≥n)
∞ −2 ≤ 1+ P(Sj = 0) · sup Mk2 . j=1
k≥n
(2)
By Doob’s strong (2, 2) inequality (Theorem 1.4.1, Chapter 1), E sup Mk2 ≤ 4 sup E[Mk2 ]. k≥n
k≥n
Therefore, by taking expectations in equation (2), we obtain ∞ −2 P(Sj = 0) sup E[Mk2 ]. P(Sk = 0 for some k ≥ n) ≤ 4 1 + k=1
k≥n
Jensen’s inequality shows that for any k ≥ n, E[Mk2 ] ≤ E[Z 2 ]. Consequently, equation (1) implies the result.
1.6 Recurrence of Possible Points We now return to the question of when a general point x ∈ Zd is recurrent. To illustrate the potential complications, consider the following simple example.
76
3. Random Walks
Example Suppose d = 1 and the X1 , X2 , . . . are independent, identically distributed random variables taking the values ±2 with probability 12 each. Let S = (Sk ; k ≥ 1) denote the random walk whose increments are X1 , X2 , . . .; i.e., Sn = X1 + · · · + Xn , for all n ≥ 1. It should be absolutely clear that the point x = 1 is not recurrent. In fact, odd values can never be visited by S, and even values can. On the other hand, by the central limit theorem, lim supn Sn = − lim inf n Sn = +∞, almost surely. A little thought reveals that for any even number x, there are infinitely many n’s such that Sn = x. Exercise 1.6.1 Use the central limit theorem to show that, in the above example, lim supn Sn = − lim inf n Sn = +∞, a.s. In the previous example we constructed a random walk for which all of the even numbers are recurrent, while the odd numbers can never be reached. This property turns out to be typical. To explore this phenomenon in greater depth, suppose S is a Zd -valued random walk. An x ∈ Zd is possible if there exists an integer k ≥ 1 such that P(Sk = x) > 0. If x is not possible, it is deemed impossible. Clearly, impossible points are not, and can never be, visited. Therefore, any discussion of recurrence must be reduced to the possible points. What do the possible points of a random walk look like? Below is a prefatory result that will be elaborated upon in the next section. Lemma 1.6.1 The collection of all possible points of a Zd -valued random walk is an additive semigroup of Zd . Proof Suppose the random walk is denoted by S and x1 , x2 ∈ Zd are possible for S. By definition, there exist k1 , k2 ∈ Zd such that pi = P(Ski = xi ) > 0 for i = 1, 2. Since P(Sk1 +k2 − Sk1 = x2 ) = P(Sk2 = x2 ) = p2 , by the Markov property (Corollary 1.1.1), P(Sk1 +k2 = x2 + x1 ) ≥ P(Sk1 = x1 , Sk1 +k2 − Sk1 = x2 ) = p1 p2 > 0. This proves the lemma.
The following is a very important exercise. Exercise 1.6.2 Let S denote a random walk on Zd whose increment process is X. We say that S is symmetric if X1 and −X1 have the same distributions. Prove that whenever S is a symmetric random walk on Zd , the set of its possible values forms an additive subgroup of Zd . In particular, argue that the origin is always possible. Lemma 1.6.2 The collection of all recurrent points is an additive subgroup of Zd . In particular, if there are any recurrent points, 0 is one of them.
1 One-Parameter Random Walks
77
Proof We will show that whenever x and y are recurrent, so is x − y. Let τ denote the first hitting time of y. That is, τ = inf(k ≥ 1 : Sk = y), where inf ∅ = ∞. Thanks to the recurrence of y, τ is finite and Sτ = y, a.s.; cf. Proposition 1.3.1. Consequently, the strong Markov property (Theorem 1.2.1) implies the following (why?): P(Sk = x − y for infinitely many k ≥ 1) = P(Sk+τ − Sτ = x − y for infinitely many k ≥ 1) = P(Sk+τ = x for infinitely many k ≥ 1) = P(Sk = x for infinitely many k ≥ 1), which is equal to one, thanks to the recurrence of x, together with Proposition 1.3.1. This completes our proof. Theorem 1.6.1 Suppose S is a Zd -valued random walk. If x ∈ Zd is possible and y ∈ Zd is recurrent, x − y is recurrent. In particular, the following are equivalent: (i) 0 is recurrent; (ii) all possible points x are recurrent with probability one. Note that the condition (ii) subsumes the assumption that x is possible and that Theorem 1.6.1 extends Lemma 1.6.2. Proof To begin, let us argue that the first assertion of the theorem implies the equivalence of (i) and (ii). Suppose (ii) holds, first. Then, for any possible point x, 0 = x − x is recurrent, by the first assertion of the theorem, thus proving (i). Conversely, if (i) holds, by the first assertion of the theorem and by Lemma 1.6.2, for any possible point x, x = x − 0 is recurrent. We have shown that (i) ⇔ (ii) and are left to verify that for all possible points x and all recurrent points y, x − y is recurrent. Holding such x and y fixed, define σ1 = inf(k ≥ 1 : Sk = y), σ2 = inf(k ≥ K0 + τ1 : Sk = y), . . ., where K0 is a fixed constant that is to be chosen later on in this proof. (For now, you can think of K0 = 1, in which case σj denotes the jth time the random walk hits y.) In general, for all j ≥ 1, we define σj+1 = inf(k ≥ K0 + σj : Sk = y), where inf ∅ = ∞, as usual. Since y is recurrent, σj < ∞ for all j ≥ 1, with probability one. Now we define the events E1 , E2 , . . . as
En = Sk = x for some σn < k < σn+1 , n ≥ 1. As k varies between σn and σn+1 , the process Sk makes a loop, starting from y and ending at y. This loop is called an excursion from y, and En denotes the event that in the nth excursion from y, the random walk hits
78
3. Random Walks
x at some point. Equivalently,
En = Sk+σn − Sσn = x − y for some 1 ≤ k ≤ σn+1 − σn . You should check that as a consequence of the strong Markov property, E1 , E2 , . . . are independent events and all have the same probability P(E1 ); cf. Theorem 1.2.1. Now is the time to choose K0 . Since x is possible, by choosing K0 large enough, we can ensure that P(E1 ) > 0. (Why?) Thus, by the Borel–Cantelli lemma, P(En infinitely often) = 1. In particular, x is recurrent and, thanks to Lemma 1.6.2, so is x − y, as desired.
1.7 Recurrence–Transience Dichotomy Let S denote a Zd -valued random walk and P denote the collection of its possible values. According to Theorem 1.6.1, either all x ∈ P are recurrent or they are all transient. This is the recurrence–transience dichotomy. The impossible values, of course, are never visited and have no effect on the structure of the random walk. On the other hand, at least in the presence of some recurrent values, all elements of P are recurrent and P is an additive group (Lemma 1.6.2 and Theorem 1.6.1). Thus, when P = ∅, we can view S as a Markov chain on the group P . A little group theory will show that quite a bit more is true. Indeed, recall that Zd is a free abelian group.1 Since all subgroups of free abelian groups are free abelian,2 Lemma 1.6.1 shows that P is itself a free abelian group. If k ∈ {1, . . . , d} denotes the rank of P , then P is isomorphic to Zk (why an isomorphism and not just a homomorphism?). For us, this means that there exists a k × k invertible matrix A such that AP = Zk . Since Sn ∈ P , a.s. for all n ≥ 1, AS = ASn ; n ≥ 1 is a random walk on Zk and all points in Zk are possible for this walk. Since A−1 exists, all statements about the P -valued Markov chain S translate to statements for the Zk -valued random walk AS, and vice versa. Thus, it is no essential loss in generality to assume that S is itself a Zd -valued random walk for which all points in Zd are possible.
1 Let G be a class of groups. Consider some G ∈ G whose generator is the set g = {xi ; i ∈ I}. Recall that G is freely generated by g (within the class G) if for any group G ∈ G that is generated by {yi ; i ∈ I}, the map xi → yi extends to a homomorphism (i.e., operation-preserving) G → G . The cardinality of I is the rank of G, and G is free within G. A free abelian group is a group that is free within the class of all abelian groups. While general free groups do not have much rank structure in a “dimensional” sense, free abelian groups do. 2 This is an immediate consequence of the free abelian group theorem: Each subgroup of a free abelian group is itself a free abelian group. (Why is it a consequence?) See Kargapolov and Merzljakov (1979, Theorem 7.1.4, Chapter 3),
1 One-Parameter Random Walks
79
Proposition 1.7.1 Suppose S is a Zd -valued random walk and let ϕ denote the characteristic function of the increments ϕ(ξ) = E[eiξ·X1 ], ξ ∈ Rd . Then, ∞
P(Sk = 0) = (2π)−d lim
λ↑1
k=1
Re
[−π,π]d
ϕ(ξ) dξ. 1 − λϕ(ξ)
Combining the above with Theorem 1.6.1, we conclude the following. Corollary 1.7.1 Suppose S is a Zd -valued random walk for which all points are possible. Let ϕ denote the characteristic function of the increments of S. Then, all x ∈ Zd are transient, a.s., unless & limλ↑1 [−π,π]d Re{1 − λϕ(ξ)}−1 dξ < ∞, in which case all points are recurrent, a.s. Bearing in mind the discussion in the beginning of this subsection, what the above states is that for any random walk on Zd , either all possible points are recurrent, or all possible points are transient (why?). In the latter case, we say that the random walk is recurrent and in the former case, transient. It is important to point out that if S is a transient walk for which all points are possible, then with probability one, limn→∞ |Sn | = ∞. The converse also holds, as the following shows. Exercise 1.7.1 S is transient if and only if |Sn | → ∞, a.s.
Proof of Proposition 1.7.1 By the inversion theorem of Fourier analysis on the torus (or by the inversion&theorem for discrete random variables), for all k ≥ 1, P(Sk = 0) = (2π)−d [−π,π]d {ϕ(ξ)}k dξ. Thus, for all λ ∈ ]0, 1[, ∞
k
−d
λ P(Sk = 0) = (2π)
k=1
λ
Re [−π,π]d
ϕ(ξ) dξ, 1 − λϕ(ξ)
since the left-hand side is real-valued. (Check this calculation!) To finish, simply let λ ↑ 1. In fact, the following (surprisingly) subtle fact holds:3 lim λ↑1
Re
[−π,π]d
ϕ(ξ) dξ = 1 − λϕ(ξ)
Re [−π,π]d
ϕ(ξ) dξ. 1 − ϕ(ξ)
We will not have need for this. 3 Cf. Ornstein (1969) and Stone (1969). For a more complete result, see Port and Stone (1971b, Theorem 16.2).
80
3. Random Walks
2 Intersection Probabilities A collection of N (≥ 2) independent Zd -valued random walks S 1 , S 2 , . . . , S N are said to intersect if there exists t ∈ NN such that St1(1) = · · · = StN(N ) . If we think of Ski as the position of particle i at time k, then S 1 , . . . , S N intersect if and only if the particle trajectories cross at some point. It should be recognized that such intersections are different from the collisions of S 1 , . . . , S N . The latter happens when there exists k ∈ N such that Sk1 = Sk2 = · · · = SkN . In words, S 1 , . . . , S N intersect if the trajectories of S 1 , . . . , S N intersect, while they collide if the particles Sk1 , . . . , SkN collide at some time k. In light of the development in Section 1, collision problems are simpler to analyze. For instance, two independent random walks S 1 and S 2 collide infinitely often if and only if 0 is recurrent for the random walk k → Sk1 −Sk2 . In this section we study the more intricate problem of intersections of independent random walks.
Define the multiparameter ZdN -valued process S = St ; t ∈ NN by St = (St1(1) , . . . , StN(N ) ),
t ∈ NN .
This means that the first d coordinates of St match those of St1(1) , the second d coordinates of St are the coordinates of St2(2) , and so on. It is apparent that for any m ≥ 1 (finite or infinite) the ranges of S 1 , . . . , S N intersect m times if and only if S hits the diagonal of ZN d m times. If we write any x ∈ ZN d as x = (x1 , . . . , xN ) with xi ∈ Zd , then the diagonal of ZN d is the set diag(ZN d ) = {x ∈ ZN d : x1 = · · · = xN }. In direct product notation, we can write x ∈ ZN d as x = x1 ⊗ · · · ⊗ xN , where xi ∈ Zd . (For example, (1, 2, 3, 4) = (1, 2) ⊗ (3, 4) = 1 ⊗ 2 ⊗ 3 ⊗ 4.) Since St = St1(1) ⊗ · · · ⊗ StN(N ) , we sometimes write the stochastic process S as S = S 1 ⊗ · · · ⊗ S N and refer to S 1 , . . . , S N as the coordinate processes of S. To write things more explicitly, consider N = 2. Then, S = S 1 ⊗ S 2 is a two-parameter process defined by S(i,j) = (Si1 , Sj2 ), i, j ≥ 1. This means that the first d coordinates of S(i,j) are the d coordinates of Si1 , and the next d coordinates of S(i,j) are those of Sj2 . Henceforth, we will assume that all points are possible for S 1 , . . . , S N . See Section 1.7 for a discussion of this assumption and how it can be essentially made without loss of generality.
2.1 Intersections of Two Walks Let S 1 and S 2 denote two independent random walks on Zd and let S = S 1 ⊗ S 2 denote the associated 2-parameter process. We are interested in knowing when S hits the diagonal of Z2d finitely often. In other words, ∞ ∞ we ask, “when is j=n k=m 1l(Sj1 =Sk2 ) finite for all choices of n, m ≥ 1? ” At the time of writing this book, this question seems unanswerable for
2 Intersection Probabilities
81
completely general walks S 1 and S 2 . However, we will give a comprehensive answer when S 1 and S 2 are both symmetric, i.e., when Sj1 (respectively Sj2 ) has the same distribution as −Sj1 (respectively −Sj2 ) for all j ≥ 1; cf. Exercise 2.1.3 below for a further refinement. According to the recurrence–transience dichotomy (Corollary 1.7.1 and its proceeding discussion ), S 1 is either recurrent or transient, a.s. First, we address the easy case where S 1 (or equivalently, S 2 ) is recurrent. Lemma 2.1.1 If either of S 1 or S 2 is recurrent, then with probability one, there are infinitely many intersections. Exercise 2.1.1 Prove Lemma 2.1.1.
According to Lemma 2.1.1, in our study of the intersections of S 1 and S we can confine ourselves to the transient case. 2
Henceforth, S 1 and S 2 are symmetric walks, and S01 = S02 = 0. Consider the function ∞ ∞ λj+k 1l(Sj1 +a=Sk2 +b) , Gλ (a, b) = E
λ ∈ ]0, 1[, a, b ∈ Zd .
(1)
j=0 k=0
Theorem 2.1.1 Suppose S 1 and S 2 are symmetric, independent, transient random walks in Zd . Then, the following are equivalent: (i) limλ↑1 Gλ (0, 0) = +∞; ∞ (ii) P( ∞ j=1 k=1 1l(Sj1 =Sk2 ) < ∞) > 0; ∞ ∞ (iii) P( j=1 k=1 1l(Sj1 =Sk2 ) < ∞) = 1; and ∞ ∞ (iv) j=1 k=1 P(Sj1 = Sk2 ) < ∞. The following technical lemma lies at the heart of Theorem 2.1.1 and seems to require symmetry. Lemma 2.1.2 Let ϕ1 and ϕ2 denote the characteristic functions of the increments of S 1 and S 2 , respectively. Then, for all λ ∈ ]0, 1[, sup Gλ (a, b) = Gλ (0, 0).
a,b∈Zd
Proof By the inversion formula for characteristic functions, 1 2 e−iξ·(b−a) E[eiξ·Sj ] E[e−iξ·Sk ] dξ P(Sj1 + a = Sk2 + b) = (2π)−d d [−π,π] −d e−iξ·(b−a) {ϕ1 (ξ)}j {ϕ2 (−ξ)}k dξ = (2π) d [−π,π] e−iξ·(b−a) {ϕ1 (ξ)}j {ϕ2 (ξ)}k dξ. = (2π)−d [−π,π]d
82
3. Random Walks
In the last line, symmetry is used. Therefore, 1 1 −d dξ. e−iξ·(b−a) Gλ (a, b) = (2π) 1 (ξ) 1 − λϕ2 (ξ) 1 − λϕ d [−π,π]
(2)
On the other hand, −1 ≤ ϕ1 (ξ), ϕ2 (ξ) ≤ 1, which implies that {1 − λϕ1 (ξ)}−1 × {1 − λϕ2 (ξ)}−1 is nonnegative. Since |e−iξ·(b−a) | ≤ 1, the lemma follows. It may be helpful to note that the one-parameter version of this lemma always holds: Exercise 2.1.2 Suppose S is a random walk on Zd with S0 = 0, and ∞ define for all λ ∈ ]0, 1[, Gλ (a) = E[ k=0 λk 1l(Sk =a) ]. Prove that even if S is not symmetric, Gλ (a) ≤ Gλ (0) for all a ∈ Zd and all λ ∈ ]0, 1[. (Hint: Consider the first hitting time of a.) Proof of Theorem 2.1.1 It is clear that (iii) ⇒ (ii). Conversely, it is not hard to check that (ii) ⇒ (iii), thanks to the Hewitt–Savage 0-1 law; cf. Exercise 1.7.5, Chapter 1. Since (i) ⇔ (iv ) ⇒ (iii) is clear, it remains to prove that if (iv ) fails, then so will (iii). Define for all n ≥ 1, Jλ =
∞ ∞ j=0 k=0
λj+k 1l(Sj1 =Sk2 ) .
Note that E[Jλ ] = Gλ (0, 0); cf. equation (2). Since (iv ) is assumed to fail, limλ↑1 E[Jλ ] = +∞. Our strategy, then, is to show the existence of a nontrivial constant A1 such that
2 E[Jλ2 ] ≤ A1 E[Jλ ] ,
λ ∈ ]0, 1[.
(3)
Assuming this, we can finish our proof: Apply equation (3) and the Paley– Zygmund lemma (Lemma 1.4.1) to see that P
sup Jλ = +∞ ≥ lim P Jλ ≥ 12 E[Jλ ] ≥ A−1 1 , λ↑1
λ∈ ]0,1[
which is positive. Thus, it remains to verify equation (3). We can write E[Jλ2 ] ≤ 2(T1 + T2 ), where T1 =
i≤i
T2 =
j≤j
i≤i
λi+i +j+j P(Si1 = Sj2 , Si1 = Sj2 ),
j ≤j
λi+i +j+j P(Si1 = Sj2 , Si1 = Sj2 ).
2 Intersection Probabilities
83
(Why?) Next, we write T1 = T11 + T12 + T13 , where T11 = λi+i +j+j P(Si1 = Sj2 , Si1 = Sj2 ), T12 =
i
λ
i=0
T13 =
j<j
∞ j=0
P(Si1 = Sj2 = Sj2 ),
λi+i +2j P(Si1 = Sj2 = Si1 ).
i
Similarly, we write T2 = T21 + T12 + T13 , where λi+i +j+j P(Si1 = Sj2 , Si1 = Sj2 ). T21 = i
j <j
We now estimate the Tij ’s in turn. By the Markov property, λi+i +j+j P(Si1 = Sj2 )P(Si1 −i = Sj2 −j ) T11 = i
=
j<j
i
λ2i+2j+(i −i)+(j
−j)
P(Si1 = Sj2 )P(Si1 −i = Sj2 −j )
j<j
2 ≤ E[Jλ ] .
On the other hand, T12 ≤
∞ i=0
λi+j+j P(Si1 = Sj2 )P(Sj2 −j = 0) ≤ A2 E[Jλ ],
j<j
∞ where A2 = i=0 P(Si2 = 0). Of course, since S 2 is transient, A2 < +∞; cf. Theorem 1.4.1. In similar fashion we obtain T13 ≤ A3 E[Jλ ], where A3 = ∞ 1 i=0 P(Si = 0) is finite as well. Since we have assumed (iv ) of the theorem, our job is complete, once we show that there exists a nontrivial constant A4 such that for all n ≥ 1,
2 T21 ≤ A4 E[Jλ ] .
(4)
Indeed, from this, equation (3), and hence the theorem, follows. We observe that T21 equals
λi+i +j+j P Si1 = Sj2 + [Sj2 − Sj2 ] , Si1 + [Si1 − Si1 ] = Sj2 i
=
j <j
i
j <j
2 1 2 ¯1 λi+i +j+j P Si1 = Sj2 + S¯j−j , Si + Si −i = Sj ,
84
3. Random Walks
where (S¯u1 , S¯v2 ) is an independent copy of (Su1 , Sv2 ) for any two integers u, v ≥ 1. This is a consequence of the Markov property; cf. Corollary 1.1.1. Consequently,
2 ¯1 ¯2 T21 = λi+i +j+j P Si1 = Sj2 + S¯j−j , Si −i = Sj−j i
≤
j <j
∞ ∞ ∞ ∞
λi+j+u+v P Si1 = Sj2 + S¯v2 , S¯u1 = −S¯v2
i=0 j=0 u=0 v=0
=
∞ ∞ u=0 v=0
λu+v E Gλ (0, S¯v2 )1l(S¯u1 =−S¯v2 ) ,
by independence and by equation (1). Thanks to Lemma 2.1.2, T21 ≤ Gλ (0, 0)
∞ ∞
λu+v P(Su1 = −Sv2 )
u=0 v=0
= E[Jλ ]
∞ ∞
λu+v P(Su1 = −Sv2 )
u=0 v=0
2
= E[Jλ ] .
To follow up, the first line follows from the fact that (S¯u1 , S¯v2 ) has the same distribution as (Su1 , Sv2 ). The second line is from the definition of Jλ , and the third line follows from the symmetry hypothesis of the theorem. This verifies equation (4) and completes our task. Exercise 2.1.3 A characteristic function ϕ, on Rd , is said to satisfy the sector condition if there exists a constant A > 0 such that |Imϕ(ξ)| ≤ A 1 + |Reϕ(ξ)| , ξ ∈ Rd . Suppose S 1 and S 2 are independent random walks on Zd , whose increments have characteristic functions that satisfy the sector condition. Prove that Theorem 2.1.1 remains valid in this setting. 4 Theorem 2.1.1 states that, under the given conditions, the trajectories of S 1 and S 2 intersect infinitely many times if and only if j,k≥1 P(Sj1 = Sk2 ) = ∞. By a summability argument (see the described proof of Proposition 1.7.1), the latter can be written as follows.
Proposition 2.1.1 We have ∞ j,k=1
P(Sj1
=
Sk2 )
−d
= (2π)
lim λ↑1
[−π,π]d
ϕ1 (ξ) ϕ2 (ξ) dξ. 1 − λϕ1 (ξ) 1 − λϕ2 (ξ)
4 Throughout this book, the trajectories of a stochastic process (X ; t ∈ T ) are the t realizations of the (random) function t → Xt , for any index set T .
2 Intersection Probabilities
Exercise 2.1.4 Verify Proposition 2.1.1.
85
2.2 An Estimate for Two Walks Let S 1 and S 2 be two independent Zd -valued walks. According random 1 to Theorem 2.1.1, we can conclude that P(S = Sk2 ) < ∞ is a j j,k≥1 necessary and sufficient condition for lim P(Sj1 = Sk2 for some (j, k) (n, m)) = 0,
n,m→∞
provided that the random walks are symmetric. We now explore the rate at which the above probability tends to 0, under the extra condition that there exists C0 such that whenever P(Si1 = Sj2 ) > 0, P(Si1 = Sj2 + a) ≤ C0 P(Si1 = Sj2 ).
(1)
This is a unimodality-type condition and is verified, for instance, when S 1 and S 2 are so-called simple random walks; cf. Section 3. Theorem 2.2.1 Suppose S 1 and S 2 are two symmetric and independent Zd -valued random walks that satisfy condition (1). If j,k≥1 P(Sj1 = Sk2 ) < ∞, there exist nontrivial constants C1 and C2 such that for all n, m ≥ 1, C1
∞ ∞
P(Sj1 = Sk2 ) ≤ P(Sj1 = Sk2 for some (j, k) (n, m))
j=n k=m
≤ C2
∞ ∞
P(Sj1 = Sk2 ).
j=n k=m
Proof Define for all n, m ≥ 1, Jn,m =
∞ ∞ j=n k=m
1l(Sj1 =Sk2 ) .
Arguing as we did in Theorem 2.1.1, we can show that there exist nontrivial 2 ] ≤ C3 (E[Jn,m ])2 + constants C3 and C4 such that for all n, m ≥ 1, E[Jn,m C4 E[Jn,m ]; this uses (1), as well as symmetry. Since E[Jn,m ] goes to zero as n, m → ∞, we can deduce the existence of a finite constant C1 such that 2 E[Jn,m ]≤
E[Jn,m ] . C1
(2)
The details are delegated to Supplementary Exercise 6. By the Paley– Zygmund lemma (Lemma 1.4.1), P(Jn,m > 0) ≥ C1 E[Jn,m ],
86
3. Random Walks
which is the desired probability lower bound. To demonstrate the corresponding upper bound, for all n, m ≥ 1, let Fn,m define the σ-field generated by ((Si1 , Sj2 ); 1 ≤ i ≤ n, 1 ≤ j ≤ m). By Exercise 3.4.2 of Chapter 1, F = (Fn,m ; n, m ≥ 1) is a commuting filtration in the sense of Chapter 1. Fix (n, m) ∈ N2 and define Mp,q = E(Jn,m | Fp,q ),
(p, q) (n, m).
By the Markov property (Corollary 1.1.1), Mp,q ≥
∞ ∞ i=p j=q
=
P(Si1 = Sj2 | Fp,q )1l(Sp1 =Sq2 )
∞ ∞ i=1 j=1
=
∞ ∞ i=1 j=1
) =
1 2 P(Si+p − Sp1 = Sj+q − Sq2 | Fp,q ) + 1 1l(Sp1 =Sq2 ) P(Si1 = Sj2 ) + 1 1l(Sp1 =Sq2 )
16 1l(Sp1 =Sq2 ) . C2 C1
(This defines C2 .) It is clear that M = (Mt ; t ∈ N2 ) is a two-parameter martingale with respect to the (commuting) filtration F. Thus, by Cairoli’s strong (2, 2) inequality (Theorem 2.3.1 and Corollary 3.5.1 of Chapter 1), P(Sq1 = Sq2 for some (p, q) (n, m)) ≤
C2 C1 2 E sup Mp,q 16 (p,q) (n,m)
2 ≤ C2 C1 E[Jn,m ].
The probability upper bound follows from this and equation (1).
2.3 Intersections of Several Walks We are ready to consider the general problem of when and how often N independent random walks in Zd intersect, when N ≥ 2 is an arbitrary integer. This will be achieved by extending the two-parameter methods of Section 2.1 to N parameters. Let S 1 , . . . , S N denote N independent Zd -valued random walks. The following can be proved in complete analogy to Lemma 2.1.1. Lemma 2.3.1 If any one of the coordinate processes is recurrent and if the trajectories of the remaining N − 1 coordinate processes intersect infinitely 1 1 l many times, then for all t ∈ NN , s t (S (1) =···=S N(N ) ) = ∞, almost s s surely.
2 Intersection Probabilities
Exercise 2.3.1 Prove Lemma 2.3.1.
87
In particular, we need to consider only the case where all of the coordinate processes are transient. By Theorem 1.4.1, this happens precisely when ∞ i P(S k = 0) < ∞, for all i = 1, . . . , N , a condition that we will assume k=1 tacitly from now on. Let S01 = · · · = S0N = 0 and define the N -variable version of equation (1) of Section 2.2 as Gλ (a1 , . .. , aN ) i1 +···+iN 1l(Si1 =E ··· λ
+a1 =Si2 +a2 =···=SiN 1 2 N
0≤i1 ,...,iN
+aN ) ,
(1)
where a1 , . . . , aN ∈ Zd and λ ∈ ]0, 1[. One can prove the following. Proposition 2.3.1 Suppose S 1 , . . . , S N are N symmetric and independent Zd -valued random walks whose increments have characteristic functions ϕ1 , . . . , ϕN , respectively. Then, Gλ (a1 , . . . , aN ) ≤ Gλ (0, . . . , 0) for all a1 , . . . , aN ∈ Zd . Moreover, Gλ (0, . . . , 0) = (2π)−d(N −1) F (ξ; λ) dξ, [−π,π]d(N −1)
where for all ξ ∈ [−π, π]d(N −1) and all λ ∈ ]0, 1[, F (ξ; λ) =
1−
λϕ1
1
· N −1 − =1 ξ ()
N −1 j=2
1 . 1 − λϕj (ξ)
Exercise 2.3.2 Prove Proposition 2.3.1.
Theorem 2.3.1 Suppose S 1 , . . . , S N are symmetric, independent, Zd valued, transient random walks. Then, the following are equivalent: (i) With positive probability, t∈NN 1l(S 1 =···=S N ) < ∞; (ii) With probability one, (iii)
t∈NN
t(1)
t∈NN
1l(S 1
t(1)
t(N )
=···=S N(N ) ) t
< ∞; and
P(St1(1) = · · · = StN(N ) ) < ∞.
We provide only a sketch of the proof. Sketch of Proof In light of the presented proof of Theorem 2.1.1, (iii) ⇒ (ii) ⇔ (i) follows readily; it remains to show that if (iii) fails, then so does (ii). For all n ≥ 1, define (1) (N ) Jλ = λs +···+s 1l(S 1 =···=S N ) , λ ∈ ]0, 1[. s∈NN 0
s(1)
s(N )
88
3. Random Walks
Our goal is to show that if (iii) fails, supλ∈ ]0,1[ Jλ = ∞, with positive probability. It is this argument that we merely sketch. Since limλ↑1 E[Jλ ] = +∞, it suffices to exhibit a finite C1 such that E[Jλ2 ] ≤ C1 (E[Jλ ])2 for all λ ∈ ]0, 1[. Once this is accomplished, the remainder of our argument follows our proof of Theorem 2.1.1 quite closely. Clearly, N
E[Jλ2 ] = ··· λ =1 (i +i ) P Si11 = · · · = SiNN , Si11 = · · · = SiN . i1 ,i1 ≥0
N
iN ,iN ≥0
Let us consider the contribution to the above when i1 = i 1 : ∞ i1 =0 i2 ,i2 ≥0
···
λ2i1 +
N
=2 (i +i )
iN ,iN ≥0
×P Si11 = Si22 = · · · = SiNN , Si11 = Si22 = · · · = SiN
≤ (N − 1)!
∞
···
N
N
λ
=1 i +
N
=2 (i −i )
i1 =0 0≤i2 ≤i2
×P Si11 = · · · =
0≤iN ≤iN
N SiNN P(Si −i =2
= 0)
≤ C2 E[Jλ ], for some finite constant C2 that is independent of λ ∈ [0, 1]. By symmetry, N N ··· λ =1 i + =2 (i −i ) Q, E[Jλ2 ] ≤ C3 E[Jλ ] + 0≤i1 ,i1 i1 =i1
0≤iN ,iN iN =iN
where Q = P(Si11 = · · · = SiNN , Si1 = · · · = SiN ). A little thought shows 1 N that, over the range in question, Si11 ∧i + S¯i11 −(i1 ∧i ) = · · · = SiNN ∧i + S¯iNN −(iN ∧i ) 1 1 N N and Q = P , Si11 ∧i + S¯i1 −(i ∧i1 ) = · · · = SiNN ∧i + S¯iN −(i ∧iN ) 1
1
1
(Su1(1) , . . . , SuN(N ) )
N
N
N
(S¯u1(1) , . . . , S¯uN(N ) )
and are independent copies of where one another for each u ∈ NN . Solving, we get Si11 ∧i + S¯i11 −(i1 ∧i ) = · · · = SiNN ∧i + S¯iNN −(iN ∧i ) 1 1 N N and Q ≤ P . |S¯|i1 −i1 | | = · · · = |S¯|iN −iN | | 1
N
The rest of the proof follows from changing variables (j = |i − i |) and follows the N = 2 argument very closely, except that we now use Proposition 2.3.1 in place of Lemma 2.1.2.
3 The Simple Random Walk
89
2.4 An Estimate for N Walks We consider the problem of the previous subsection in the case where the number of intersections is finite, almost of surely.1 Under the hypotheses N Theorem 2.3.1, this is to say that P(S = · · · = S ) < ∞. N (1) (N ) t∈N t t The question that we address now is, how large is P(Ss1(1) = · · · = SsN(N ) for some s t) when t ∈ NN is large, coordinatewise? When N = 2, this was achieved in Theorem 2.2.1; the general case follows under the following unimodality analogue of equation (1) of Section 2.2: There exists a finite constant C0 such that sup a1 ,...,aN ∈Zd
P(Si11 + a1 = · · · = SiNN + aN ) ≤ C0 P(Si11 = · · · = SiNN ),
(1)
as long as the right-hand side is positive. Theorem 2.4.1 Suppose S 1 , . . . , S N are independent Zd -valued random = · · · = StN(N ) ), and assume walks and for all t ∈ NN , let ψ(t) = P(St1(1) that these walks satisfy condition (1) above. If t∈NN ψ(t) < ∞, there exist finite constants C1 and C2 such that for all t ∈ NN , ψ(s) ≤ P(Ss1(1) = · · · = SsN(N ) for some s t) ≤ C2 ψ(s). C1 st
st
One can prove this by finding a suitable N -parameter modification of the two-parameter argument used to prove Theorem 2.2.1. Exercise 2.4.1 (Hard) Prove Theorem 2.4.1.
3 The Simple Random Walk Nearest-neighborhood random walks on Zd are random walks that can move only to the nearest point in Zd . Indeed, let (e1 , . . . , ed ) denote the usual ba(i) sis for Rd . That is, for all i, j ∈ {1, . . . , d}, ej equals 1 if i = j, and it equals 0 otherwise. Consider a Zd -valued random walk S = (Sk ; k ≥ 1) with increments X1 , X2 , . . . . We say that S is a nearest-neighborhood random walk if with probability one, X1 ∈ {±e1 , . . . , ±ed}. Nearest-neighborhood random walks form some of the most common models for the motion of a randomly moving particle. An important member of this family of random walks is the simple random walk. A random walk S is said to be simple if it is truly unbiased in its motion. More precisely, S is a simple random walk if P(X1 = e1 ) = P(X1 = −e1 ) = · · · = P(X1 = ed ) = P(X1 = −ed ) = (2d)−1 . In this section we put the general theory of Section 2 to test by way of explicit calculations. Let us recall that for all x ∈ Rk , |x| = max1≤≤k |x() | and x = k 1 { =1 |x() |2 } 2 denote the ∞ and 2 norms of x, respectively.
90
3. Random Walks
3.1 Recurrence We now wish to study the recurrence properties of a simple random walk S in Zd with increments X1 , X2 , . . . . The following elementary result is a first step in this direction. Lemma 3.1.1 All points are possible for a simple random walk. Exercise 3.1.1 Prove Lemma 3.1.1.
Thus, according to Corollary 1.7.1, S is either recurrent or transient. In order to decide which is the case, we first need a technical lemma. & Lemma 3.1.2 The integral [0,1]d ξ−β dξ is finite if and only if β < d.
(j) 2 12 ) } , while |ξ| = max1≤j≤N |ξ (j) |. Proof Recall that ξ = { N j=1 (ξ The traditional approach to this sort of problem is to estimate the integral in polar coordinates; we will do this in & probabilistic language. First, note 1 that |ξ| ≤ ξ ≤ d 2 |ξ|. Therefore, [0,1]d ξ−β dξ < ∞ if and only if & |ξ|−β dξ < ∞. Let U be a random variable that is uniformly picked [0,1]d −β on [0, 1]d. The problem is to decide when } is finite. On E{|U | −β the other hand, a direct calculation shows that n≥1 P(|U | ≥ n) = n≥1 n−d/β , which is finite iff d > β. Theorem 3.1.1 Let S denote the simple random walk in Zd . Then S is recurrent if d ≤ 2; otherwise, S is transient. Proof Let ϕ denote the characteristic function of X1 . It is easy to check that d 1 ϕ(ξ) = cos(ξ () ), ξ ∈ Rd . (1) d =1
Since ϕ(ξ) ≥ 0 (and is, of course, real) for all ξ ∈ [−1, 1]d , we can apply the bounded and monotone convergence theorems to Proposition 1.7.1 to see that ∞ ϕ(ξ) dξ. P(Sn = 0) = (2π)−d [−π,π]d 1 − ϕ(ξ) n=1 (Why?) Equivalently, we apply symmetry to deduce 1+
∞ n=1
P(Sn = 0) = π −d
[0,π]d
1−
d
−1 1 cos(ξ () ) dξ. d =1
By Theorem 1.4.1, it suffices to show that the above integral is finite if and only if d ≥ 3. Owing to Taylor’s theorem with remainder, for all y there exists a λ between 0 and y such that cos(y) = 1 −
y2 λ4 + . 2 12
3 The Simple Random Walk
91
Hence, for all y ∈ [0, 1], 1 1 5 y2 ≤ cos(y) ≤ 1 − y 2 − = 1 − y2. (2) 2 2 12 12 This, in turn, implies the inequality d 1
−1 12d −2 () 1− 2d ξ dξ ≤ cos(ξ ) dξ ≤ ξ−2 dξ. d 5 [0,1]d [0,1]d [0,1]d 1−
=1
& d Since d is an integer, by Lemma 3.1.2, [0,1]d (1 − d−1 =1 cos(ξ () ))−1 dξ if and d ≥ 3. Our proof is concluded once we show that &is finite −1 d only if() (1−d cos(ξ ))−1 dξ < ∞, where K = [0, π]d \[0, 1]d . To observe =1 K this, note that whenever ξ ∈ K, there is at least one ∈ {1, . . . , N } such that cos(ξ () ) ≤ cos(1). For such ξ’s, we can conclude that 1 − d−1
d
cos(ξ () ) ≥ d−1 [1 − cos(1)].
=1
Since cos(1) < 1, d
−1 1 d Leb(K). 1− cos ξ () dξ ≤ d 1 − cos(1) K
(3)
=1
Clearly, Leb(K) ≤ π d < ∞, which proves the result.
Theorem 3.1.1 is deeply related to the following: Exercise 3.1.2 (Hard) If S denotes the simple walk in Zd , then there exists a finite constant C > 1 such that for all n ≥ 1, d
d
C −1 n− 2 ≤ P(S2n = 0) ≤ sup P(S2n = a) ≤ Cn− 2 . a∈Zd
(Hint: Use the inversion theorem for characteristic functions and write d & P(S2n = 0) as (2π)− 2 [−π,π]d E[eiξ·S2n ] dξ. Use the fact that S has i.i.d. increments and expand this integral near ξ = 0. Alternatively, look at Durrett (1991) under “local central limit theorem.”) Exercise 3.1.3 Use Exercise 3.1.2, together with Theorem 1.4.1, to construct an alternative proof of Theorem 3.1.1.
3.2 Intersections of Two Simple Walks Given two independent Zd -valued simple random walks, when do their trajectories intersect infinitely often? In other words, if the random walks are denoted by S 1 and S 2 , when can we conclude that j,k≥1 1l(Sj1 =Sk2 ) = +∞?
92
3. Random Walks
Theorem 3.2.1 Suppose S 1 and S 2 are independent simple random walks in Zd . With probability one, the trajectories of S 1 and S 2 intersect infinitely often if and only if d ≤ 4. Proof When d ≤ 2, S 1 and S 2 are recurrent; cf. Theorem 3.1.1. By Lemma 2.1.1, we can assume with no loss of generality that d ≥ 3, i.e., that S 1 and S 2 are transient. Let ϕ denote the characteristic function of the increments S 2 , since they have the same distribution. By Corollary 1.7.1, of S 1 and/or & limλ↑1 [−π,π]d {1 − λϕ(ξ)}−1 dξ < ∞. Since ϕ(ξ) ≥ 0 for all ξ ∈ [−1, 1]d , the bounded and monotone convergence theorems together show us that 1 dξ < ∞. [−π,π]d 1 − ϕ(ξ) Once again applying the bounded and monotone convergence theorems, this time via Proposition 2.1.1, we obtain the following: ∞ [ϕ(ξ)]2 (2π)d P(Sj1 = Sk2 ) = dξ 2 [−π,π]d {1 − ϕ(ξ)} j,k=1 {1 − ϕ(ξ)}−2 dξ = [−π,π]d {1 + ϕ(ξ)}{1 − ϕ(ξ)}−1 dξ. − [−π,π]d
The & second integral is finite. In fact, it is positive and bounded above by 2 [−π,π]d {1 − ϕ(ξ)}−1 dξ < +∞. Thanks to symmetry and by Theorem & 2.1.1, it suffices to show that [0,π]d {1 − ϕ(ξ)}−2 dξ < ∞ if and only if d ≥ 5. Following the demonstration of Theorem 3.1.1, we split the integral in two parts: where ξ ∈ [0, 1]d and where ξ ∈ K &= [0, π]d \ [0, 1]d . As in the derivation of equation (3) of Section 3.1, K {1 − ϕ(ξ)}−2 dξ ≤ 2 d −2 , which is always finite. It remains to show that &d π {1 − cos(1)} −2 {1 − ϕ(ξ)} dξ is finite if and only if d ≥ 5. d [0,1] Using equation (2) of Section 3.1, 12d 2 (2d)2 ξ−4 dξ ≤ {1 − ϕ(ξ)}−2 dξ ≤ ξ−4 dξ. 5 [0,1]d [0,1]d [0,1]d We obtain the result from Lemma 3.1.2.
The next question that we address is, when do three or more independent simple random walks intersect infinitely many times? When d ≥ 5, the above theorem states that the answer is never, a.s. On the other hand, when d ≤ 2, Theorem 3.1.1 implies that the random walks in question are recurrent; Lemmas 2.1.1 and 2.3.1 together show that any number of
3 The Simple Random Walk
93
such random walks will intersect infinitely many times, a.s. Thus, the only dimensions of interest are d = 3 and d = 4. In the next two subsections we will study these in detail. Exercise 3.2.1 Use Exercise 3.1.3 and Theorem 1.4.1 together to find an alternative proof of Theorem 3.2.1. Exercise 3.2.2 Show that if S 1 and S 2 denote two independent simple walks in Zd where d ≥ 5, there exists a finite constant C > 1 such that for all n ≥ 1, 1
1
C −1 n− 2 (d−4) ≤ P(Si1 = Sj2 for some i, j ≥ n) ≤ Cn− 2 (d−4) . (Hint: Use Exercise 3.1.3 and Theorem 2.2.1.)
3.3 Three Simple Walks By Theorem 3.2.1 of the previous subsection, two independent Z4 -valued simple random walks will intersect infinitely many times. We now address the problem for three such walks. Theorem 3.3.1 Suppose S 1 , S 2 , and S 3 are independent Zd -valued simple random walks. The trajectories of S 1 , S 2 , and S 3 will a.s. intersect infinitely often if and only if d ≤ 3. Our proof relies on two technical lemmas regarding the function Eβd : R → R+ that is defined as follows: d y − ξ−β ξ−β dξ, y ∈ Rd . (1) Eβ (y) = d
ξ∈Rd :
ξ ≤1
Lemma 3.3.1 Suppose β < d < 2β. Then, there are two finite and positive constants C1 and C2 that depend only on β and d such that for all y ∈ Rd with y ≤ 1, C1 yd−2β ≤ Eβd (y) ≤ C2 yd−2β . Proof Fix some y ∈ Rd with y ≤ 1. Evidently, ξ − y−β · ξ−β dξ. Eβd (y) ≥
ξ ≤ y
Over the region of integration, ξ − y ≤ ξ + y ≤ 2y. Hence, d −β −β −β d−β Eβ (y) ≥ 2 y ξ dξ = 2 ζ−β dζ · yd−2β ,
ξ ≤ y
ζ ≤1
94
3. Random Walks
& which gives the desired lower bound with C1 = 2d−β ζ ≤1 ζ−β dζ. (By Lemma 3.1.2, C1 is finite and positive.) Next, we proceed with the upper bound. Write Eβd (y) = T1 + T2 + T3 , where
T1 = T2 = T3 =
ξ−y ≤ 12 y
ξ ≤1
ξ−y > 12 y
ξ ≤2 y ∧1
ξ−y > 12 y 2 y ≤ ξ ≤1
ξ − y−β · ξ−β dξ, ξ − y−β ξ−β dξ, ξ − y−β ξ−β dξ.
We estimate the above in order. When ξ − y ≤ 12 y, by the triangle inequality, ξ ≥ 12 y. Thus, β −β −β 2β−d T1 ≤ 2 y ζ dζ = 2 ζ−β dζ yd−2β .
ζ ≤ 12 y
ζ ≤1
By Supplementary Exercise 7, T1 ≤
22β−d dωd yd−2β , d−β
(2)
where ωd denotes the d-dimensional Lebesgue measure of the ball {z ∈ Rd : z ≤ 1}. Similarly, ζ−β dζ = 2d ζ−β dζ yd−2β . T2 ≤ 2β y−β
ζ ≤2 y
ζ ≤1
Another application of Supplementary Exercise 7 leads us to the bound T2 ≤
2d dωd yd−2β . d−β
It remains to estimate T3 . First, we note that if ξ − y ≥ ξ ≥ 2y, then certainly ξ − y ≤ ξ + y ≤ 32 ξ. Thus, 3 β T3 ≤ ξ − y−2β dξ 2
ξ−y ≥ 12 y 3 β ζ−2β dζ ≤ 1 2
ζ > 2 y β −d d−2β ζ−2β dζ. ≤ 3 2 y
ζ >1
(3) 1 2 y
and
3 The Simple Random Walk
95
& To finish, we are left to show that ζ >1 ζ−2β dζ < ∞. This is easy to do: Since d < 2β, by Supplementary Exercise 7, ∞ dωd −2β . ζ dζ = dωd rd−1−2β dr = 2β −d 1
ζ >1 To summarize, we have shown that T3 ≤ 3β 2−d ωd d(2β − d)−1 yd−2β . Combining this with (3) and (4), we obtain Eβd ≤ C2 yd−2β with C2 = dωd
2d + 22β−d d−β
+
3β 2−d . 2β − d
Since C2 is clearly finite and positive, this concludes our proof.
Going over the above argument with some care, we can also decide what happens when d = 2β. Lemma 3.3.2 There exists a finite and positive constant C that depends
only on d such that for all y ∈ Rd with y ≤ 1, E dd (y) ≤ C ln 4/y . 2
d Proof In the notation of our proof of Lemma 3.3.1, write Ed/2 (y) = T1 + T2 + T3 . Since they still hold for d = 2β, equations (2) and (3) together show that T1 + T2 ≤ C1 ≤ C1 ln(4/y), with C1 = (2d+1 + 2)ωd . Still proceeding with our proof of Lemma 3.3.1 and using β = d2 , we obtain,
T3 ≤
3 d2 2
= dωd = dωd
2≥ ξ ≥ 12 y
3 d2 2 3 d2 2
2 1 2 y
ln
ξ−d dξ
r−1 dr
4 . y
We have used Supplementary Exercise 7 once more and obtained the ded sired result with C = C1 + ( 32 ) 2 dωd . Exercise 3.3.1 Prove that Lemma 3.3.2 is sharp, up to a constant. That is, prove that lim inf y →0+ {ln(1/y)}−1E dβ (y) > 0. 2
We are ready for the following. Proof of Theorem 3.3.1 When d ≤ 2, the simple random walk is recurrent (Theorem 3.1.1). Thus, Lemmas 2.1.1 and 2.3.1 tell us that the trajectories of S 1 , S 2 , and S 3 intersect infinitely many times. (Why?) On the other hand, if d ≥ 5, then by Theorem 3.2.1, the trajectories of S 1 and
96
3. Random Walks
S 2 intersect only finitely many times. In particular, so do the trajectories of S 1 , S 2 , and S 3 . Thus, it remains to focus our attention on d ∈ {3, 4}. ∞ Let S = (2π)2d i,j,k=1 P Si1 = Sj2 = Sk3 . Thanks to Theorem 2.3.1, we need to show that S < ∞ when d = 4 while S = ∞ when d = 3. In order to do this, we begin with the identity ϕ(ξ1 + ξ2 ) ϕ(ξ1 ) ϕ(ξ2 ) S = lim dξ1 dξ2 . λ↑1 [−π,π]2d 1 − λϕ(ξ1 + ξ2 ) 1 − λϕ(ξ1 ) 1 − λϕ(ξ2 ) (We have implicitly used the fact that ϕ is real-valued. Why?) While for every ξ1 , ξ2 ∈ [−1, 1]d, ϕ(ξ1 ), ϕ(ξ2 ) ≥ 0, it is not always true that ϕ(ξ1 + ξ2 ) ≥ 0. To regain positivity, we split the above integral into two parts: Let I1 denote the above integral taken over [− 12 , 12 ]2d , and I2 the integral over K = [−π, π]2d \ [− 12 , 12 ]2d . We estimate I2 first. Since cosines are bounded above by 1, 1 1 1 dξ1 dξ2 . |I2 | ≤ lim λ↑1 K 1 − λϕ(ξ1 + ξ2 ) 1 − λϕ(ξ1 ) 1 − λϕ(ξ2 ) Note that whenever ξ1 , ξ2 ∈ K, then for all 1 ≤ ≤ d, ()
()
(a) cos(ξ1 + ξ2 ) ≤ cos( 12 ) < 1; ()
(b) cos(ξ1 ) ≤ cos( 12 ) < 1; and ()
(c) cos(ξ2 ) ≤ cos( 12 ) < 1. Hence,
−3 |I2 | ≤ (2π)2d 1 − cos( 12 ) < ∞.
Thus, we need to show that |I1 | is finite when d = 4 and is infinite when d = 3. This is where positivity comes into play: If ξ1 , ξ2 ∈ [− 21 , 12 ]2d , then ϕ(ξ1 ), ϕ(ξ2 ), and ϕ(ξ1 + ξ2 ) are all nonnegative. By the monotone convergence theorem, ϕ(ξ1 + ξ2 ) ϕ(ξ1 ) ϕ(ξ2 ) dξ1 dξ2 . I1 = 1 1 2d 1 − ϕ(ξ1 + ξ2 ) 1 − ϕ(ξ1 ) 1 − ϕ(ξ2 ) [− 2 , 2 ] Moreover, if ξ ∈ [− 12 , 12 ], then 0 < cos( 12 ) ≤ cos(ξ) ≤ 1. We have arrived at the bound {cos( 12 )}3 I1 ≤ I1 ≤ I1 , where
−1
−1
−2
1 − ϕ(ξ1 + ξ2 ) 1 − ϕ(ξ1 ) 1 − ϕ(ξ2 ) dξ1 dξ2 . I1 = [− 12 , 12 ]2d
Since I1 ≥ 0, we want to show that I1 is finite if d = 4 but is infinite if 3
d = 3. By equations (1) and (2) of Section 3.1, (2d)3 I1
≤ I1 ≤ ( 12d 5 ) I1 , where I1
= ξ1 + ξ2 −2 ξ1 −2 ξ2 −2 dξ1 dξ2 . [− 12 , 12 ]2d
3 The Simple Random Walk
97
Our goal now is to show that I1
is finite if d = 4 and is infinite if d = 3. By Fubini’s theorem and symmetry, I1
= ξ1 − ξ2 −2 ξ1 −2 ξ2 −2 dξ1 dξ2 [− 12 , 12 ]2d
≤
[− 12 , 12 ]2d
E2d (ξ1 )ξ1 −2 dξ1 .
If d = 4, by Lemma 3.3.2 there exists a finite and positive constant C1 such that 4 I1
≤ C1 ξ−2 dξ. ln ξ [−1,1]4 Since ln(4/ξ) ≤ 4/ξ for all ξ ∈ R4 with ξ ≤ 1, I1
≤ C1 ξ−3 dξ, [−1,1]d
which is finite, thanks to Lemma 3.1.2. If d = 3, by Lemma 3.3.2 there exists a finite positive constant C2 such that I1
≥ C2 ξ−3 dξ. [− 12 , 12 ]3
Since d = 3, Lemma 3.1.2 shows us that I1
= ∞. This concludes our proof.
3.4 Several Simple Walks Throughout, let us fix an integer N ≥ 4 and consider N independent simple walks, S 1 , . . . , S N , all taking values in Zd . If d ≤ 2, such random walks are recurrent (Theorem 3.1.1). By Lemma 2.1.1, when d ≤ 2, the trajectories of S 1 , . . . , S N intersect infinitely often, a.s. Next, suppose d ≥ 4. In this case, the trajectories of S 1 , S 2 , and S 3 intersect finitely often, a.s. (Theorem 3.3.1). Therefore, the same holds for S 1 , . . . , S N . The only case that remains to be analyzed is d = 3. Theorem 3.4.1 The trajectories of four or more independent simple walks in Z3 will almost surely intersect at most finitely many times. Our proof is an imitation of those in the previous sections but requires one more technical lemma. Lemma 3.4.1 For all y ∈ R3 define F (y) = ξ∈R3 : ξ − y−1 ξ−2 dξ.
ξ ≤1
Then, for all y ∈ R3 with y ≤ 1, F (y) ≤ 20π ln(4/y).
98
3. Random Walks
Proof We follow closely the arguments used in the given proofs of Lemmas 3.3.1 and 3.3.2. Write F (y) = T1 + T2 + T3 , where T1 = ξ−y ≤ 1 y ξ − y−1 ξ−2 dξ, 2
ξ ≤1
T2 = T3 =
ξ−y > 12 y
ξ ≤2 y ∧1
ξ−y > 12 y 2 y ≤ ξ ≤1
ξ − y−1 ξ−2 dξ, ξ − y−1 ξ−2 dξ.
We estimate each as in the demonstrations of Lemmas 3.3.1 and 3.3.2. To estimate T1 , use ξ − y ≥ y/2 to obtain ξ − y−1 dξ = r−1 dr. T1 ≤ 4y−2
ξ−y ≤ 12 y
r ≤1
By Supplementary Exercise 7, T1 ≤ 2π ≤ 2π ln(4/y). We have used the elementary fact that ω3 = 4π 3 . Likewise, T2 = 2y−1 ξ−2 dξ = 4 ξ−2 dξ = 8π.
ξ ≤2 y
ξ ≤1
Since 8π ≤ 8π ln(4/y), it remains to show that T3 ≤ 9π ln(4/y). Use ξ − y ≤ 3ξ to obtain 9 9 T3 ≤ ξ − y−3 dξ ≤ ζ−3 dζ. 4 1≥ ξ−y ≥ 12 y 4 2≥ ζ ≥ 12 y By Exercise 3.4.1 below this equals 9π ln(4/y), as desired. Exercise 3.4.1 For any ε ∈ ]0, 2[, compute
& 2≥ ζ ≥ε
ζ−3 dζ.
Exercise 3.4.2 Show that Lemma 3.4.1 is sharp, up to a constant. That is, lim inf y →0+ F (y)/ ln(1/y) > 0. We are ready to prove the theorem. Proof of Theorem 3.4.1 It suffices to consider only N = 4 and to show that ∞ P(Si1 = Sj2 = Sk3 = S4 ) < ∞, i,j,k,=0
S01
S02
where = = S03 = S04 = 0. However, symmetry and Proposition 2.3.1 together show that this is the same as showing that 3 ϕ(ξ1 + ξ2 + ξ3 ) ϕ(ξj ) lim dξ1 dξ2 dξ3 < ∞. λ↑1 [−π,π]9 1 − λϕ(ξ1 + ξ2 + ξ3 ) 1 − λϕ(ξj ) j=1
4 Supplementary Exercises
99
We split the above integral into two parts. Let I1 be the integral over [− 31 , 13 ]9 and I2 the integral over K = [−π, π]9 \ [− 13 , 13 ]9 . The same argument used to prove Theorem 3.3.1 goes through unhindered to show that −4 < ∞. |I2 | ≤ (2π)9 1 − cos( 13 ) It suffices to show that I1 is finite. When ξi ∈ [− 13 , 13 ]3 (i = 1, 2, 3), ϕ(ξi ) is positive (i = 1, 2, 3). Moreover, so is ϕ(ξ1 + ξ2 + ξ3 ). By the monotone convergence theorem, I1 =
[− 13 , 13 ]9
3
ϕ(ξ1 + ξ2 + ξ3 ) ϕ(ξj ) dξ1 dξ2 dξ3 1 − ϕ(ξ1 + ξ2 + ξ3 ) j=1 1 − ϕ(ξj )
−1 1 − ϕ(ξ1 + ξ2 + ξ3 )
≤
ξ1 , ξ2 , ξ3 ≤1
3
−1 1 − ϕ(ξ ) dξ1 dξ2 dξ3 .
=1
4 Employing equations (1) and (2) of Section 3.1, we deduce that I1 ≤ ( 36 5 ) J, where ξ1 + ξ2 + ξ3 −2 ξ1 −2 ξ2 −2 ξ3 −2 dξ1 dξ2 dξ3 . J=
ξ1 , ξ2 , ξ3 ≤1
We propose to show that J < ∞. Using symmetry and the definition of Eβd (equation (1) of Section 3.3), J≤ E23 (ξ1 + ξ2 )ξ1 −2 ξ2 −2 dξ1 dξ2 .
ξ1 , ξ2 ≤1
Lemma 3.3.1 can be applied with d = 3 and β = 2 to show us the existence & of a positive and finite constant C such that J ≤ C ξ ≤1 F (ξ)ξ−2 dξ. By Supplementary Exercise 7, and by Lemma 3.4.1 above, 4 ξ−2 dξ, J ≤ 20πC ln ξ
ξ ≤1 which is finite, by Supplementary Exercise 7.
4 Supplementary Exercises 1. Show that the inequalities of Theorem 1.5.1 can be sharpened to the following: P(Sk = 0 for some k ≥ n) = Qn {1 + Q1 }−1 , where Qn = ∞ n=1 P(Sj = 0).
100
3. Random Walks
2. Refine an aspect of Exercise 3.1.2 by showing that when S denotes the simple d d walk on Zd , limn→∞ (2n) 2 P(S2n = 0) = (2π)− 2 . This is a part of the local central limit theorem. You should compare this to the classical central limit theorem of A. de Moivre and P.-S. Laplace by looking at the density function of a mean-zero Gaussian random variable with the same variance as S2n . 3. Let S denote a transient random walk on Zd with S0 = 0 and define Tx to be the first time S hits x. That is, Tx = inf(k ≥ 0 : Sk = x). In the notation of Section 1.4, show that E[RTx ] = ∞ k=0 {P(Sk = 0) − P(Sk = −x)}. Tx −1 (Hint: By transience, R ∞ < ∞, a.s. Now we can write R∞ = k=0 1l(Sk =0) + ∞ k=Tx 1l(Sk =0) and use the strong Markov property.) k ]≤ 4. Show that for any random walk S on Zd and for all integers n, k ≥ 1, E[Rn k k!{E[Rn ]} . In particular, obtain the large deviation bound
R 1 n λ > 0, ≥λ ≤ e−δλ , P E[Rn ] 1−δ
where δ is an arbitrary number strictly between 0 and 1. 5. (Mixing) Much of the theory for independent random variables goes through with fewer hypotheses than independence. We explore one such possibility in this exercise. A sequence of random variables ξ1 , ξ2 , . . . is said to be ϕ-mixing if sup sup P(E | F ) − P(E) ≤ ϕ(n), i≥1 E∈F [i+n,∞[ F ∈F [1,i]
where F A is the σ-field generated by {ξi ; i ∈ A}, and limn→∞ ϕ(n) = 0. Note that if the ξi ’s are independent, then they are ϕ-mixing for any ϕ that vanishes at infinity. (i) Prove that the tail σ-field T = ∩n F [n,∞[ is trivial. (ii) Show that whenever n ϕ(n) < +∞, " 0, if ∞ n=1 P(ξn = 0) < +∞, P(ξn = 0 infinitely often) = 1, if ∞ n=1 P(ξn = 0) = +∞. 6. Verify equation (1) of Section 2.3. 7. Suppose U is chosen uniformly at random from Dm = {ξ ∈ Rm : ξ ≤ 1}. (i) Show that the density function of U at x ∈ [0, 1] is mxm−1 . (ii) Use the previous part to prove the following integration-by-parts formula: For all integrable functions f : [0, 1] → [0, 1], 1 f (u) du = mωm · sm−1 f (s) ds, Dm
0
where ωm denotes Lebesgue’s (m-dimensional) measure of Dm .
4 Supplementary Exercises (iii) Show that
ωm
m mπ 2 (m/2)! = 1 1 2 2 (m+1) π 2 (m−1) , 1 · 3 · 5 · · · (m − 2)
101
if m is even, if m is odd and m > 1.
8. (Hard) Let S denote the simple walk on Z2 and let S0 = 0. (i) When d = 1, use Supplementary Exercise 2 to deduce that with probability one, n 1 1l(Sk =0) 1 = √ . lim 1 n→∞ ln n 2 2π k2 k=1 (ii) Prove that when d = 2, lim
n→∞
n 1 1 1l(Sk =0) = . ln ln n k=2 ln k 4π
This is due to Erd˝ os and Taylor (1960a, 1960b). (Hint: For part (i), start by proving that the expected value of the limit theorem holds. Then, prove that the variance of the given sum is bounded by C ln n, for some finite constant C > 0. Use the Borel–Cantelli lemma to obtain the a.s. convergence along the subsequence nk = exp(k2 ). To conclude part (i), estimate the sum for nk ≤ n ≤ nk+1 by the end values of n. Part (ii) is proved similarly, but the variance estimate is now given by a bound of C ln ln n, and the subsequence 2 should be changed to nk = exp(ek ).) 9. (Hard) Suppose X1 , X2 , . . . denote i.i.d. random variables that take their values in Rd and define the corresponding random walk Sn = n j=1 Xj (n ≥ 1). We say that 0 is recurrent if for all ε > 0, P(|Sn | < ε infinitely often) > 0. (i) Verify that when P(X1 ∈ Zd ) = 1, our two notions of recurrence are one and the same. (ii) Show that 0 is recurrent if and only if for all ε > 0, P(|Sn | < ε infinitely often) = 1. (iii) Define S0 = 0 and prove that for all n ≥ 1 and all ε > 0, n j=0
P(|Sj | ≤ 2ε) ≤ 16d
n
P(|Sj | ≤ ε).
j=0
(iv) Show that the following are all equivalent: (a) 0 is recurrent;
(b) for some ε > 0, ∞ j=1 P(|Sj | ≤ ε) = +∞; ∞ (c) for all ε > 0, j=1 P(|Sj | ≤ ε) = +∞. (Hint: For part (iii), cover [−2ε, 2ε]d with 16d cubes of side Markov property.)
1 ε 2
and apply the
102
3. Random Walks
d d 10. Given a transient random walk S on Z with S0 = 0, define for each a ∈ Z , 1 l ]. u(a) = E[ ∞ k=0 (Sk +a=0)
(i) Check that u(0) = E[R∞ ] and show that u(a) is finite for all a ∈ Zd . (ii) Show that m → u(Sm ) is a supermartingale. (Hint: Apply Lemma 1.1.1 to f (x) = 1l{0} (x).)
11. (Hard) Let S denote the simple walk on Zd . (i) In the case d ≥ 3, prove that there are finite positive constants C1 < C2 such that for all n ≥ 1, 1
1
C1 n− 2 (d−2) ≤ P(Si = 0 for some i ≥ n) ≤ C2 n− 2 (d−2) . (ii) Let d = 2 and suppose c1 , c2 , . . . is a nondecreasing sequence such that limn→∞ cn = +∞ and lim supn→∞ cn /n < ∞. Show that when d = 2, there exist finite positive constants C1 < C2 such that for all n ≥ 1, cn cn C1 ≤ P(Si = 0 for some n ≤ i ≤ n + cn ) ≤ C2 . n ln cn n ln cn n+cn (Hint: For the lower bound, consider the first two moments of j=n 1l(Sj =0) . n 1l(Sj =0) , For the upper bound, estimate the conditional expectation of n+2c j=n given F m , where m is between n and n + cn .) In different forms and to various extents, this can be found in Benjamini et al. (1995), Erd˝ os and Taylor (1960a, 1960b), Lawler (1991), and R´ev´esz (1990). 12. Let τ1 , τ2 , . . . denote the first, second, . . . hitting times of 0 by a Zd -valued random walk S. The goal of this exercise is an exact computation of the distribution of τ1 . (i) Show that for all λ > 0 and for all integers n ≥ 1, E[e−λτn ] = (E[e−λτ1 ])n . −λk 1l(Sk =0) . Show (ii) Let S0 = τ0= 0 and for all λ > 0, define Vλ = ∞ k=0 e ∞ −λτn that Vλ = n=0 e and conclude the following identity for the Laplace −λk P(Sk = 0)}−1 . transform of τ1 : E[e−λτ1 ] = 1 − { ∞ k=0 e (iii) Show that when S is the simple walk on Zd , 1
lim λ 2
λ→0+
∞
e−λk P(Sk = 0) =
√
2
k=0
when d = 1, and when d = 2, ∞ 1 1 −λk e P(Sk = 0) = . 1 2π λ→0+ ln( ) λ k=0 (Hint: Consider the distribution function F (k) = j≤k P(Sj = 0). Apply the Tauberian theorem Theorem 2.1.1, Appendix B, together with Supplementary Exercise 2.)
lim
Such results are a part of the folklore of random walks; for instance, read Chung and Hunt (1949) with care. In the above forms, they can be found in Khoshnevisan (1994), where you can also find further applications to measure the zero set of random walks.
5 Notes on Chapter 3
103
13. (Continued from Supplementary Exercise 12) (i) Let S denote the simple walk on Zd . In the notation of Supplementary Exercise 12, show that when d = 1, τn /n2 converges in distribution to a nonnegative random variable τ∞ whose Laplace transform is E[e−ζτ∞ ] = √ exp(− ζ). (Hint: Use the convergence theorem for Laplace transforms (cf. Theorem 1.2.1, Appendix B). The random variable τ∞ is the so-called stable random variable of index 12 and will reappear later in Section 3.2, Chapter 10.) √ (ii) Conclude that when d = 1, Rn / n converges in distribution to the absolute value of a standard Gaussian random variable. (Hint: Since τ is the inverse function to R, roughly speaking, P(Rn ≥ √ λ n) = P(τλ√n ≤ n). You need to make this work by a series of inequalities.) 14. (Hard) Suppose S 1 and S 2 are two independent simple walks on Z4 . Consider a nondecreasing sequence c1 , c2 , . . . such that limn→∞ cn = +∞ and lim supn→∞ cn /n < ∞. Show the existence of two positive finite constants C1 < C2 such that for all n ≥ 1, c 2 c 2 1 1 n n · ≤ P(Si1 = Sj2 for some n ≤ i, j ≤ n + cn ) ≤ C2 · . C1 n ln cn n ln cn (You should first study Supplementary Exercise 11.)
5 Notes on Chapter 3 Section 1 The references (Ornstein 1969; Spitzer 1964; R´ev´esz 1990; Revuz 1984) are excellent resources for the fine and general structure of one-parameter random walks, Markov chains, and their connections to ergodic theory and potential theory. The argument of Section 1.7 that reduces attention to the set of possible points is quite old, but often goes unmentioned when d > 1, perhaps to avoid discussions relating to free abelian groups. Much of the material of this section, and, in fact, chapter, can be extended to random walks on locally compact abelian groups. A comprehensive account of the potential-theoretic aspects of this can be found in Port and Stone (1971a, 1971b). The basic message of the investigations of recurrence for random walks is that a point is recurrent for the walk if and only if the walk is expected to hit that point infinitely often. The number of times the random walk hits a given point is the so-called local time at that point. There are limit theorems associated with such local times; they can be viewed as refinements of the notion of recurrence, among other things; see Bass and Khoshnevisan (1993b, 1993c, 1995), Borodin (1986, 1988), Cs´ aki and R´ev´esz (1983), Cs¨ org˝ o and R´ev´esz (1984, 1985, 1986), Kesten and Spitzer (1979), Jacod (1998), Khoshnevisan (1992, 1993), Knight (1981), Perkins (1982), and R´ev´esz (1981).
104
3. Random Walks
Section 2 In the probability literature, the study of the intersections of random walk trajectories goes back at least to Dvoretzky and Erd˝ os (1951), as well as Erd˝ os and Taylor (1960b, 1960a), and Dvoretzky et al. (1950, 1954, 1958, 1957). Related results, together with references to the physics literature, can be found in (Madras and Slade 1993; Lawler 1991). In this section we essentially showed that the intersections are recurrent if and only if the walks are expected to intersect infinitely many times, at least as long as all of the intervening walks are symmetric. At this time it is not known whether Theorem 2.3.1 holds without any symmetry, or sector-type, hypotheses. Further analysis of the number of intersections of random walks leads to a so-called intersection local time that is the main subject of Le Gall et al. (1989), Le Gall and Rosen (1991), Lawler (1991), Rosen (1993), and Stoll (1987, 1989). Some very general results can be found in (Bass and Khoshnevisan 1992a; Dynkin 1988). Many of the quantitative results of this section are new. Section 3 The results of this section are all classical and can be found in the pre60’s references cited under Section 2 above. For further refinements, see Lawler (1991). Many of the presented proofs in this section are new. Further related works, but in a genuine multiparameter context, can be found in Etemadi (1977). A variant of Exercise 3.2.1 can be found in Lawler (1991, Theorem 3.3.2). Section 4 A variant of Supplementary Exercise 14 can be found in Lawler (1991, Theorem 3.3.2). Supplementary Exercise 5 seems to be new. However, much is known about sums of mixing random variables. A good starting place for this is Billingsley (1995).
4 Multiparameter Walks
The discussions of Chapter 3 revolved around multiparameter processes that are formed by considering systems of independent one-parameter random walks. In this chapter we consider properties of genuinely multiparameter random walks. For an example of such a process, suppose each “site” t ∈ NN corresponds to an independent particle that is negatively charged with probability p and positively charged with probability 1 − p. Let Xt = 1 if the particle at site t ∈ NN is negatively charged; otherwise, set Xt = 0. Then, the total number of negatively charged particles in the rectangle [0, t] is precisely s t Xs . When the X’s are general i.i.d. random variables, this defines a general N -parameter random walk. To summarize the main results of this chapter, let us first suppose that the increments of the multiparameter random walk have the same distribution as some random variable ξ. Then, a rough summary of the main results of this chapter is as follows:
The strong law of large numbers holds the law of the iterated logarithm holds
iff E[|ξ|{ln+ |ξ|}N−1 ] < ∞; iff E[|ξ|2 {ln+ |ξ|}N−1 ] < ∞,
with the condition on the law of the iterated logarithm being nearly optimal; cf. Exercise 2.2.1 and Supplementary Exercise 2, as well as the Notes at the end of the chapter. Both of these results are natural extensions of 1-parameter results, with which the reader is expected to be familiar. We prove these results by establishing connections to martingales, maximal inequalities, etc.
106
4. Multiparameter Walks
1 The Strong Law of Large Numbers In this section we discuss the strong law of large numbers for mean-zero, finite-variance multiparameter random walks. We first recall the requisite 1-parameter background. If X1 , X2 , . . . are i.i.d. mean-zero random variables, the random walk S = (Sn ; n ≥ 1) is defined by Sn = X1 + · · · + Xn (n ≥ 1). Supposing that the X’s have mean zero, the weak law of large numbers states that 1 n Sn converges to 0 in probability, as n → ∞. A much more interesting fact—the strong law of large numbers—states that this convergence holds almost surely. In like manner, in the multiparameter setting we will define the increments Xs (s ∈ NN ), together with a walk St = s t Xs (t ∈ NN ). Note that for any fixed t ∈ NN , St is a sum of t i.i.d. random variables, where N
t =
t(j) ,
t ∈ NN .
(1)
j=1
Thus, as soon as the X’s have mean zero, by the weak law of large numbers, lim
t→∞
St = 0, t
in probability.
A more interesting mode of convergence is convergence with probability one, where the analogous law of large numbers is much more delicate. For instance, we have already seen, in the preamble to this chapter, that the necessary and sufficient condition for this strong law is the integrability of X1 {ln+ |X1 |}N −1 and not X1 . Informally, this difference between the 1-parameter and and multiparameter theories arises because in the latter case there are many ways in which the actual time parameter t can go to infinity.
1.1 Definitions Fix an integer N ≥ 1 and consider independent, identically distributed Rd -valued random variables indexed by NN : X = (Xt ; t ∈ NN ). The corresponding multiparameter random walk S = (St ; t ∈ NN ) is defined by St = Xs , t ∈ NN . st
In analogy to the one-parameter theory, the X’s are referred to as the increments of the underlying random walk S. Corresponding to the multiparameter walk S, we define the N -parameter filtration F = (Ft ; t ∈ NN ) to be the history of S. That is, for all t ∈ NN , Ft designates the σ-field generated by (Xr ; r t). If F1 , . . . , FN stand for
1 The Strong Law of Large Numbers
107
the marginal filtrations of F, after recalling Section 2.6 of Chapter 1, it quickly follows that F1 , . . . , FN are the orthohistories of S.
1.2 Commutation An important property of the filtration F is that it is commuting. This will be a consequence of the following. Lemma 1.2.1 (Inclusion–Exclusion Formula) of Given a sequence N X , t ∈ N . Then, real numbers X = (Xt ; t ∈ NN ), let St = st s for all t ∈ NN , N () Xt = (−1) =1 r St−r , r∈{0,1}N
where St = 0 if t ∈ NN . Proof We proceed by induction on N . First, suppose N = 1. Clearly, for all t ∈ NN , Xt = St − St−1 = (−1)r St−r . r∈{0,1}
Thus, the result holds when N = 1. Next, we argue by induction on N (≥ 2). Assuming that the result holds for N − 1, we prove it for N . Write any t ∈ NN as t = (t(1) , t ), where t ∈ NN −1 is given by t = t(2) , . . . , t(N ) ). We will write Xt(1) ,t for Xt = X(t(1) ,t ) . The same convention applies to k (1) ) (t ∈ NN ), where Yr (k) = St . Clearly, St = s t Ys (t j=1 Xj,r (r ∈ NN −1 ). By the induction hypothesis,
Yt (t(1) ) =
N −1
(−1)
=1
r ()
t ∈ NN .
St(1) ,t −r ,
r∈{0,1}N −1
On the other hand, Xt = Yt (t(1) ) − Yt (t(1) − 1), where for any t ∈ NN −1 , Yt (k) = 0 whenever k ∈ NN . In summary, Xt =
N −1
(−1)
=1
r ()
St(1) ,t −r −
r∈{0,1}N −1
N −1
(−1)
=1
r ()
St(1) −1,t −r ,
r∈{0,1}N −1
which is a restatement of the lemma.
A corollary of the above is the commutation property of F. Proposition 1.2.1 If F = (Ft ; t ∈ NN ) denotes the history of a multiparameter random walk S = (St ; t ∈ NN ) with increments X = (Xt ; t ∈ NN ), then: (i) for all t ∈ NN , Ft is the σ-field generated by (Xr ; r t); and
108
4. Multiparameter Walks
(ii) F is a commuting filtration. Proof Temporarily, define Xt to be the σ-field generated by (Xr ; r t). Since St = r t Xr , Xt ⊂ Ft for all t ∈ NN . The converse inclusion also holds and follows from Lemma 1.2.1. Next, we prove (ii). Applying Theorem 3.6.1 of Chapter 1, we set out to show that for all t, s ∈ NN , Ft and Fs are conditionally independent, given Fst . (The mentioned theorem is about stochastic processes indexed by NN 0 , while we have processes indexed by NN . To overcome this trivial difficulty, simply “shift back” time by (1, . . . , 1).) We need to show the following: For all s, t ∈ NN and all bounded random variables Ys and Yt that are Fs and Ft measurable, respectively, E[Yt Ys | Fst ] = E[Yt | Fst ] · E[Ys | Fst ],
a.s.
It suffices to do so for s = t. Henceforth, we fix two different s, t ∈ NN . By Lemma 1.2.1, for all r ∈ NN , Fr is the σ-field generated by (Xs ; s r). By a standard argument only consider Yt and Ys k of measure theory, weneed j of the form Yt = n=0 fn (Xun ) and Ys = m=0 gm (Xvm ), where fn , gm : Rd → [0, 1] (0 ≤ n ≤ k, 0 ≤ m ≤ j) are bounded and measurable functions, vm s, and un t (0 ≤ n ≤ k, 0 ≤ m ≤ j). By relabeling indices and possibly introducing more variables, we may assume the existence of 0 ≤ M ≤ j and 0 ≤ N ≤ k such that for all n ≤ N and m ≤ M , un s t and vm s t. On the other hand, for values of n > N (respectively m > M ) un | s t (respectively vm | s t). Recall that t = s, un t and vm s (0 ≤ n ≤ k, 0 ≤ m ≤ j). Thus, (un ; N < n ≤ k) and (vm ; M < m ≤ j) are necessarily disjoint sequences. Using the independence of the X’s, we can conclude the following: N
E[Ys Yt | Fst ] =
M
fn (Xun ) n=0
×E
gm (Xvm ) m=0
k
fn (Xun ) E
n=N +1
j
gm (Xvm )
m=M+1
= E[Yt | Fst ] E[Ys | Fst ]. This proves the result.
It follows from the above that—when they are in R and integrable— mean-zero, multiparameter random walks are martingales with respect to a commuting filtration. In particular, they enjoy the general properties of martingales with respect to commuting filtrations. Put in more precise terms, we may state the following lemma: Lemma 1.2.2 Suppose S is an R-valued, N-parameter random walk with increments X = (Xt ; t ∈ NN ). If, in addition, X(1,...,1) has mean 0, then S is an N -parameter martingale with respect to a commuting filtration.
1 The Strong Law of Large Numbers
Exercise 1.2.1 Complete the proof of Lemma 1.2.2.
109
Exercise 1.2.2 In the context of Lemma 1.2.2, suppose further that the Xt ’s have a finite variance σ 2 . Show that t → St2 − σ 2 t is a mean-zero martingale with respect to the same commuting filtration as S. Exercise 1.2.3 Suppose S is an N -parameter random walk with meanzero increments, each of which has a finite moment generating function. Given α ∈ R, find a nonrandom function ψ such that t → ψ(t) · eαSt is an N -parameter martingale with mean 1.
1.3 A Reversed Orthomartingale Let S = (St ; t ∈ NN ) denote an N -parameter random walk that takes values in Rd . Recalling equation (1) in the introductory portion of this section, let X denote the increments process and define the “sample average” At =
St , t
t ∈ NN .
(1)
The main goal of this subsection is to show that A is a reversed N parameter orthomartingale. To do so, we shall need N (one-parameter) reversed filtrations. For 1 ≤ i ≤ N , define Ri = (Rik ; k ≥ 1) as follows: For all k ≥ 1, let Rik denote the σ-field generated by (St ; t ∈ NN , such that t(i) ≥ k). To illustrate this better, consider N = 2. Then, R1k is the σ-field generated by (Sn,m ; n ≥ k, m ≥ 1), and R2k is the σ-field generated by (Sn,m ; n ≥ 1, m ≥ k). Continuing with the discussion for N = 2, the inclusion–exclusion formula (Lemma 1.2.1) implies that for any k ≥ 1, R1k is the σ-field generated by the following two collections of random variables: (a) (Sk,m ; m ≥ 1); and (b) (Xn,m ; n ≥ k + 1, m ≥ 1). Likewise, R2k is the σ-field generated by (c) (Sk,n ; n ≥ 1); and (d) (Xn,m ; n ≥ 1, m ≥ k + 1). Now let us suppose d = 1, so that X, S, and A are all real-valued stochastic processes. By the stationarity and the independence of the increments, for any k ≥ 1, E[X1,1 | R1k ] = · · · = E[Xk,1 | R1k ]. Since X1,1 + · · · + Xk,1 = Sk,1 , this implies that E[X1,1 | R1k ] =
Sk,1 = Ak,1 . k
110
4. Multiparameter Walks
More generally, this argument shows that for all k, n ≥ 1, Ak,n =
1 E[X1,1 + · · · + X1,n | R1k ]. n
Similarly, 1 E[X1,1 + · · · + Xk,1 | R2n ]. k Hence, when N = 2, A is a 2-parameter reversed orthomartingale with respect to the reversed filtrations R1 and R2 . The same proof works in any number of temporal dimensions (N ≥ 1). In fact, we have the following result. Ak,n =
Lemma 1.3.1 Suppose S = (St ; t ∈ NN ) is a multiparameter walk with Rvalued increments X = (Xt ; t ∈ NN ). Let A = (At ; t ∈ NN ) be the sample average process given by equation (1). If X(1,...,1) is integrable, then A is a reversed orthomartingale with respect to the reversed filtrations R1 , . . . , RN defined above. Moreover, for all nondecreasing convex Φ : R → R+ , sup E Φ(At ) ≤ E[Φ(X(1,...,1) )], t∈NN
as long as E[Φ(X(1,...,1) )] < +∞. Exercise 1.3.1 Prove Lemma 1.3.1 when N ≥ 3.
1.4 Smythe’s Law of Large Numbers We now state and prove the strong law of large numbers of Smythe (1973) for multiparameter random walks. Theorem 1.4.1 (Smythe’s Law of Large Numbers) Suppose S is an N -parameter random walk with real-valued increments X = (Xt ; t ∈ NN ). Let X0 be a random variable with the same distribution as Xt (t ∈ NN ) and recall A from equation (1) of Section 1.3. If E{|X0 |(ln+ |X0 |)N −1 } < ∞, then almost surely, lim At = E[X0 ]. t→∞
Conversely, suppose P(L = ∞) > 0, where L = lim supt |At |. Then, E |X0 |(ln+ |X0 |)N −1 = ∞. To demonstrate this, we develop two preliminary real-variable facts concerning the following function: dt , x ≥ 1. (1) 1l[1,x] (t) IN (x) = t N [1,∞[
1 The Strong Law of Large Numbers
111
Lemma 1.4.1 For any random variable Z, 1 1 E |Z|IN −1 2 |Z| ≤ P(|Z| ≥ t) dt ≤ E |Z|IN −1 |Z| , 2 N [1,∞[ where N ≥ 1 is an arbitrary integer. Proof It is evident that P(|Z| ≥ t) dt = [1,∞]N
[1,∞[N −1
1
∞
∞
= [1,∞[N −1
v
=E
P(|Z| ≥ sv) ds dv P(|Z| ≥ u) du
dv v
dv . 1l[1,|Z|] (v) |Z| − v v [1,∞[N −1
The inequality |Z| − v ≤ |Z| gives the upper bound of the lemma. On the other hand, if v ≤ 12 |Z|, we have |Z| − v ≥ 12 |Z|, thus deriving the converse bound of the lemma. Our second preliminary result is an estimation of the function IN . Lemma 1.4.2 For all x > e and all integers N ≥ 1, N −N (ln x)N ≤ IN (x) ≤ (ln x)N . This is proved by means similar to those used to verify Lemma 1.4.1. As such, we leave the argument as an exercise. Exercise 1.4.1 Prove Lemma 1.4.2.
Proof of Theorem 1.4.1 To prove half of the theorem, suppose |X0 |(ln+ |X0 |)N −1 is integrable. Certainly, X0 is also integrable. Thus, Lemma 1.3.1 shows that A is a reversed orthomartingale. Moreover, applying the latter lemma to Φ(t) = t(ln+ t)N −1 , we can deduce that supt∈NN E[|At |(ln+ |At |)N −1 ] is finite. By Theorem 2.9.1 of Chapter 1, At has a limit, a.s. To finish our proof of the sufficiency, we need to identify this limit as E[X0 ]. However, by Kolmogorov’s (one-parameter) strong law of large numbers, limt∞ At = E[X0 ], almost surely. This proves the sufficiency. To prove the converse, let us suppose that with positive probability, L = ∞. Since (L = ∞) is a tail event for independent random variables, we must have L = ∞, a.s. (Why?) For all t ∈ ZN \ NN , define At = 0. With this convention in mind, the inclusion–exclusion formula (Lemma 1.2.1) shows us that for all t ∈ NN , Xt = t
r∈{0,1}N
N
(−1)
j=1
r (j)
At−r .
112
4. Multiparameter Walks
Since P(L = ∞) = 1, lim supt→∞ t−1 |Xt | = +∞, almost surely. By the Borel–Cantelli lemma for independence events this is equivalent to the following: For all λ > 0,
P |Xt | ≥ λt = +∞. t∈NN
Since Xt has the same distribution as X0 , the integral test of calculus can be employed to see that
P |X0 | ≥ t dt = ∞. [1,∞[N
The result follows, after we show that for all N ≥ 1,
P |X0 | ≥ t dt = +∞ ⇐⇒ E |X0 |(ln+ |X0 |)N −1 = +∞. [1,∞[N
But this follows from Lemmas 1.4.1 and 1.4.2.
Exercise 1.4.2 In the context of Smythe’s law of large numbers, suppose further that X0 ∈ Lp (P) for some p > 1 and show that as t → ∞, At converges to E[X0 ] in Lp (P) as well. Exercise 1.4.3 Complete our proof of Smythe’s law of large numbers by showing that L = ∞ implies that a.s., lim supt→∞ t−1 |Xt | = +∞. Exercise 1.4.4 Refine Lemma 1.4.1 by showing that P(Z ≥ t) dt [1,∞[N
=
N −1
(−1)j+1 E ZIN −j (Z) + (−1)N −1 E Z1l[1,∞[ (Z) ,
j=1
where Z is any almost surely nonnegative random variable, and N ≥ 1 is an integer.
2 The Law of the Iterated Logarithm Suppose S is an N -parameter random walk in R with increments X = N −1 } < ∞, the strong law of (Xt ; t ∈ NN 0 ). Given that E{|X0 |(ln+ |X0 |) large numbers (Theorem 1.4.1) shows that as t → ∞, St ≈ t · E[X0 ], almost surely.
2 The Law of the Iterated Logarithm
113
One can refine this by seeking to estimate the size of the difference St − tE[X0 ]. When the increments have sufficient integrability, this refinement is the so-called law of the iterated logarithm (written LIL). As a warm-up, we first work with the special case where the random walk is one-parameter Gaussian. This shows some of the salient features of what makes the LIL happen in a setting that is free of many of the technical difficulties inherent to such an undertaking. The general law of the iterated logarithm will be stated and proved following the one-parameter Gaussian case, and will take up the remainder of this chapter.
2.1 The One-Parameter Gaussian Case This subsection proves the following law of the iterated logarithm in the one-parameter Gaussian setting: the simplest of its kind. Theorem 2.1.1 (LIL–Gaussian Case) Let S = (Sk ; k ≥ 1) denote an R-valued random walk whose increments X = (Xk ; k ≥ 1) are standard Gaussian random variables. Then, Sk lim sup √ = 1, 2k ln ln k k→∞
a.s.
The usual proof of the above LIL relies on three key steps: (i) a maximal inequality; (ii) tail estimates for deviation probabilities; and (iii) a blocking argument. We will address each in order. The first step relies on L´evy’s maximal inequality, which holds for all symmetric random walks.1 Lemma 2.1.1 (L´ evy’s Maximal Inequality) Suppose S denotes a realvalued, one-parameter symmetric random walk. Then, for all k ≥ 1 and λ > 0,
P max |Sj | ≥ λ ≤ 2P |Sk | ≥ λ . 1≤j≤k
Proof Fix k ≥ 1 and λ > 0 and define τ = inf(j ≥ 1 : |Sj | ≥ λ), with the usual convention that inf ∅ = ∞. Note that P(max1≤j≤k |Sj | ≥ λ) = P(τ ≤ k), so that
P max |Sj | ≥ λ = P(|Sk | ≥ λ) + P(|Sk | < λ , τ ≤ n) 1≤j≤k
= P(|Sk | ≥ λ) + P(|Sk − Sτ + Sτ | < λ , τ ≤ n). 1 That is, the increments are symmetric. Recall that a random variable Z is symmetric if Z and −Z have the same distribution.
114
4. Multiparameter Walks
Since τ is a stopping time for the history of S, by the strong Markov property (Theorem 1.2.1 of Chapter 3), Sk − Sτ is independent of Sτ and (τ ≤ n). This and the symmetry of the increments together imply that we can replace Sk − Sτ by Sτ − Sk and not change the probability. That is, P
max |Sj | ≥ λ = P |Sk | ≥ λ + P |2Sτ − Sk | < λ , τ ≤ n .
1≤j≤k
On the other hand, on (τ < ∞), |Sτ | ≥ λ. Thus, thanks to the triangle inequality, on (τ < ∞), (|2Sτ − Sk | < λ) ⊂ (|Sk | ≥ λ).
This has the desired result.
Exercise 2.1.1 Suppose S is an N -parameter random walk whose increments X are symmetric random variables. Prove that for all t ∈ NN and for all λ > 0,
P max |Ss | ≥ λ ≤ 2N P(|St | ≥ λ). st
This is due to P. L´evy when N = 1, and Wichura (1973) for N > 1. (Hint: Use the method used in our proof of Lemma 2.1.1, one parameter at a time.) The second step in our proof of the theorem is a probability tail estimate. Lemma 2.1.2 Let S denote a real-valued, one-parameter Gaussian random walk. Then, if xn is a sequence that tends to infinity,
0 1 1 ln P Sk > kxk = − . k→∞ xk 2 lim
Proof For any k ≥ 1, Sk is a Gaussian random variable with mean 0 and variance k. Thus, for any x > 0, √ − 12 P Sk > x k = (2π)
∞
1
2
e− 2 u du.
x
On the other hand, it is easy to check from this (via L’Hˆ opital’s rule of calculus) that √ 1 2 1 lim xe 2 x P Sk > x k = (2π)− 2 , x→∞
and that the convergence rate must be independent of the choice of k ≥ 1.
2 The Law of the Iterated Logarithm
115
Exercise 2.1.2 (Hard) Show that Lemma 2.1.2 continues to hold if we replace the Gaussian walk by the simple walk, at least as long as xk = √ α 2k ln ln k for α > 0 fixed. (Hint: One way √ to proceed is by proving an upper and a lower bound for P(Sn ≥ α 2n ln ln n). For a method of getting the lower bound, peek ahead to Lemma 2.10.1 below. To obtain an upper bound, you can: (i) compute the moment generating function of Sn ; and (ii) prove H. Chernoff’s inequality: For all α > 0, P(Sn > x) ≤ 2e−αn E[eαSn ].
Optimize over the α of part (ii) to get a working upper bound for the probability in question.) We are ready to derive our Gaussian LIL, using the third step: the blocking argument. Proof of Theorem 2.1.1 We will first prove that for any ε > 0, |Sk | ≤ 1 + ε, lim sup √ 2k ln ln k k→∞
a.s.
(1)
Fix any ε > 0, and for any other fixed 1 < b < (1 + ε)2 , define bk = bk ! (k ≥ 1). By Lemma 2.1.1,
0 0
P max |Sj | ≥ (1 + ε) 2bk ln ln bk ≤ 2P |Sbk+1 | ≥ bk+1 xk+1 , 1≤j≤bk+1
bk ln ln bk . To this we can apply Lemma 2.1.2 and where xk+1 = 2(1 + ε)2 bk+1 deduce
0 (1 + ε)2 ln k , P max |Sj | ≥ (1 + ε) 2bk ln ln bk ≤ exp − (1 + δk ) 1≤j≤bk+1 b
where δk is some term that goes to 0 as k → ∞. Since b > (1+ε)2 , the above can be summed over k, and we obtain, from the Borel–Cantelli lemma, that with probability one, 0 max |Sj | ≤ 2(1 + ε)bk ln ln bk , 1≤j≤bk+1
for all but finitely many k. Therefore, for all m ∈ [bk , bk+1 ] sufficiently large, 0 0 |Sm | ≤ max |Sj | ≤ 2(1 + ε)bk ln ln bk ≤ 2(1 + ε)m ln ln m. 1≤j≤bk+1
116
4. Multiparameter Walks
This verifies equation (1). We now work toward the converse. Fixing b > 1, ε > 0, define
0 Ek = Sbk+1 − Sbk ≥ (1 − ε) 2(bk+1 − bk ) ln ln bk . The Ek ’s are independent events. On the other hand, Sbk+1 − Sbk and Sbk+1 −bk have the same distribution. Thus, by Lemma 2.1.2, applied to xn = 2(1 − ε)2 ln ln bn , P(Ek ) ≥ exp − (1 + ηk )(1 − ε) ln k , where ηk is some term that goes to 0 as k → ∞. The upshot of this is that k P(Ek ) = +∞. Therefore, owing to the independence of the Ek ’s and by the Borel–Cantelli lemma for independent events, P(Ek infinitely often) = 1. Equivalently, ) Sbk+1 − Sbk 1 a.s. ≥ (1 − ε) 1 − , lim sup 0 b 2bk+1 ln ln bk+1 k→∞ 1
Since b > 1, equation (1) shows that lim supk→∞ (2bk+1 ln ln bk+1 )− 2 |Sbk | ≤ 1 b− 2 , a.s. Therefore, with probability one, Sbk+1 Sn lim sup √ ≥ lim sup 0 n→∞ 2bk+1 ln ln bk+1 2n ln ln n k→∞ ) ) 1 1 . ≥ (1 − ε) 1 − − b b Since this holds for all b > 1, and since equation (1) holds for all ε > 0, the result follows. We conclude this subsection with the following very important exercise. Exercise 2.1.3 (Khintchine’s LIL) Prove that the 1-parameter LIL (Theorem 2.1.1) still holds when Gaussian walks are replaced by simple ones, that is, when the increments are ±1 with probability 12 each.
2.2 The General LIL We define the function Λ by "√ 2x ln ln x, if x ≥ 4, Λ(x) = 1, otherwise.
(1)
There is nothing special √ about the 4 in this definition. All that we need is a function that equals 2x ln ln x for x large, and Λ is one such function.
2 The Law of the Iterated Logarithm
117
Theorem 2.2.1 (The Law of the Iterated Logarithm) Let S denote a real-valued, N -parameter random walk with increments X = (Xt ; t ∈ 2 2 N −1 ] < ∞, then with NN 0 ). If E[X0 ] = 0, E[X0 ] = 1 and E[X0 (ln+ |X0 |) probability one, √ St lim sup = N , (2) t→∞ Λ t where Λ is given by (1) above, and t is defined in (1) in the introduction of Section 1. We will prove this result in Sections 2.3 through 2.10. Our proof follows loosely along the original 1-parameter proof of A. I. Khintchine for simple walks. However, there are a number of technical difficulties that are overcome by applying the elegant method of de Acosta (1983). Before proving the direct half of the LIL, it should be pointed out that there is an essential converse. Exercise 2.2.1 Show that in the setting of the LIL (Theorem 2.2.1), X 2 (ln |X |)N −1 |St | + 0 = +∞ =⇒ lim sup = +∞. E 0 ln+ ln+ |X0 | t→∞ Λ t This is due to Wichura (1973). (Hint: Adapt our proof of the “converse” in Smythe’s law of large numbers; cf. Theorem 1.4.1.) To conclude this subsection we point out a restatement of the above that is obtained from a real-variable argument. Lemma 2.2.1 Under the conditions of Theorem 2.2.1, equation (2) holds if and only if √ St lim sup = N , a.s. t→∞ Λ t Exercise 2.2.2 Prove Lemma 2.2.1.
2.3 Summability In this subsection we present two summability lemmas. The first is the multiparameter extension of Kronecker’s lemma of classical probability theory. When N = 1, a more general version of this is attributed to L. Kronecker; cf. Supplementary Exercise 6. Lemma 2.3.1 (Part of Kronecker’s Lemma) Suppose (xt ; t ∈ NN ) and a = (at ; t ∈ NN ) denote two collections of nonnegative real numbers. Suppose that a is nondecreasing with respect to the partial order ,
118
4. Multiparameter Walks
limt∞ at = ∞, and
xt /at < ∞. Then,
t∈NN
1 xs = 0. t→∞ at lim
st
Our second result is a quantitative version of summation by parts. Lemma 2.3.2 (Summation by Parts) Suppose {ai }, {bi }, {ci }, and {di } are sequences of positive real numbers such that: (i) b1 , b2 , . . . is a nondecreasing sequence; and (ii) ck ≤
k
j=1
aj ≤ dk , for all k ≥ 1.
Then, for all k ≥ 1, k j=1
cj
b
j+1
− bj
aj bj+1 − bj dk ck + . ≤ ≤ dj bk b bj bj+1 bk j=1 j j=1 k
+
bj bj+1
k
Exercise 2.3.1 Prove the above form of the Kronecker’s Lemma 2.3.1, as well as the summation-by-parts Lemma 2.3.2.
2.4 Dirichlet’s Divisor Lemma (2)
For any positive integer k, let Dk denote the number of its divisors. The following result of J. P. G. L. Dirichlet is an elementary fact from analytic number theory: n 1 (2) lim Dk = 1. n→∞ n ln n k=1
That is, a number that is uniformly picked from {1, . . . , n} has, on average, about ln n divisors. We will need a quantitative version of this, which makes (2) precise the fact that nk=1 Dk is of the order n ln n. The key to this is the (2) observation that Dk = t∈N2 1l{k} (t(1) t(2) ). More generally, define (N )
Dk
=
1l{k} t ,
k ≥ 1.
t∈NN
Lemma 2.4.1 For any two integers n, N ≥ 1, n k=1
(N )
Dk
≤ 2N n(N ln 2 + ln n)N −1 .
(1)
2 The Law of the Iterated Logarithm
119
n (N ) Remark While we need only the above upper bound on k=1 Dk , much more can be done; cf. Supplementary Exercise 1 for a sample, or see Karatsuba (1993, Theorems 3 and 7, Ch. 1) for very detailed estimates when N = 2. Proof For each t ∈ NN define Q(t) = {s ∈ NN : s t , |s − t| < 1}, and recall that for all x ∈ RN , |x| = max1≤j≤N |x(j) | denotes the maximum modulus norm. Thus, Q(t) denotes the cube of side 1 in RN whose “lower end point” is t. Since Lebesgue’s measure of Q(t) is 1, n k=1
(N )
Dk
=
t∈NN
Q(t)
t∈NN
Q(t)
≤
=
[1,∞[N
1l{1,...,n} t ds
1l[1,2N n] s ds
1l[1,2N n] s ds.
To obtain the inequality above we used the fact that for t (1, . . . , 1) and s ∈ Q(t), N
s ≤
t(j) + 1 ≤ 2N t.
j=1
In summary,
n
k=1
(N )
Dk
≤ JN (2N n), where for all x > 1,
JN (x) =
[1,∞[N
1l[1,x] s ds.
Since JN (x) ≤ x(ln x)N −1 , this proves the lemma.
(2)
Exercise 2.4.1 Complete the above by showing that JN (x) ≤ x(ln x)N −1 .
2.5 Truncation Define
) β(x) =
x , if x ≥ 4, ln ln x 1, otherwise.
(1)
Now, for any η > 0, we can truncate the increment Xt as Xt (η) = Xt 1l(|Xt |≤ηβ(t)) ,
t ∈ NN .
(2)
120
4. Multiparameter Walks
These are independent, but not identically distributed, random variables, which have the advantage of being bounded. Based on them we can build the mean-zero independent increments process S(η) as Xs (η) − E[Xs (η)] , t ∈ NN . (3) St (η) = st
In this section we make our first move by reducing the LIL to a problem about sums of bounded independent random variables that are not necessarily identically distributed. Namely, we have the following: Proposition 2.5.1 For any η > 0, lim
t→∞
|St − St (η)| = 0, Λ(t)
a.s.
To prove it we need a supporting lemma. Lemma 2.5.1 The following are equivalent: (i) E[X02 (ln+ |X0 |)N −1 ] < ∞; (ii) for all η > 0,
E Xt − Xt (η) < ∞. Λ(t) N
t∈N
Proof of Lemma 2.5.1 We will prove that (i) ⇒ (ii); the reverse implication is proved similarly. Define the right inverse to β as β −1 (a) = sup{x > 0 : β(x) < a}. By equation (1) above, there exists a constant C1 such that for all x ≥ 0, β −1 (a) ≤ C1 a2 ln+ ln+ a,
∀a ≥ 0.
(4)
(Why?) On the other hand, 1l(|X0 |≥ηβ(t)) E Xt − Xt (η) = E |X0 | · . Λ(t) Λ(t) N N t∈N
t∈N
To this we apply equation (4) with a = |X0 |η −1 , and deduce E Xt − Xt (η) Λ(t) N t∈N
1l(t≤C1 X 2 η−2 ln+ ln+ (X 2 η−2 )) 0 0 ≤ E |X0 | · Λ(t) N t∈N
∞ (N ) Dk = E |X0 | · 1l(k≤C1 X02 η−2 ln+ ln+ (X02 η−2 )) , Λ(k) k=1
(5)
2 The Law of the Iterated Logarithm
121
(N )
where Dk was defined in equation (1) of Section 2.4. By Dirichlet’s divisor lemma (Lemma 2.4.1), there exists a constant C2 such that for all j ≥ 1, j (N ) ≤ C2 j(ln+ j)N −1 . Thus, summation-by-parts (Lemma 2.3.2) k=1 Dk yields a constant C3 such that for any a ≥ 1, Λ(k + 1) − Λ(k) D(N ) (ln+ a)N −1 k ≤ C3 . + C3 k(ln+ k)N −1
2 Λ(k) Λ(a) Λ(k)
1≤k≤a
1≤k≤a
By Taylor’s expansion we can find a constant C4 such that for all integers 1 1 k ≥ 1, Λ(k + 1) − Λ(k) ≤ C4 k − 2 (ln ln k) 2 . Using this, and a few more lines of calculations, we deduce the existence of a constant C5 such that for all a > 0, √ D(N ) a(ln+ a)N −1 k ≤ C5 0 . Λ(k) ln+ ln+ a 0≤k≤a Hence, equation (5) implies that √ E{|Xt − Xt (η)|} Y (ln+ Y )N −1 ≤ C5 E |X0 | · 0 , Λ(t) ln+ ln+ Y t∈NN where Y = C1 X02 η −2 ln+ ln+ (X02 η −2 ). Since E[X02 (ln+ |X0 |)N −1 ] is finite, so is the display above. Using the previous lemma we can finish our proof of Proposition 2.5.1. Proof of Proposition 2.5.1 Since E[Xt ] = 0, E[Xt 1l(|Xt |>ηβ(t)) ] E{|Xt − Xt (η)|} E[Xt (η)] , = ≤ Λ(t) Λ(t) Λ(t) N N N t∈N
t∈N
t∈N
which is finite, thanks to Lemma 2.5.1. Another application of the latter lemma yields Xt − {Xt (η) − E[Xt (η)]} < +∞, a.s. Λ(t) N t∈N
Kronecker’s lemma (Lemma 2.3.1) now shows that (i) ⇒ (ii).
Exercise 2.5.1 Verify the converse half of Lemma 2.5.1, i.e., show that (ii) ⇒ (i).
2.6 Bernstein’s Inequality According to Proposition 2.5.1, we can reduce the LIL to proving a law of the iterated logarithm for bounded, independent random variables. In this
122
4. Multiparameter Walks
section we present a deep inequality of F. Bernstein that states that sums of mean-zero independent random variables have Gaussian tails. Proposition 2.6.1 (Bernstein’s Inequality) Let V1 , V2 , . . . , Vn be independent random variables with zero means and with max1≤i≤n |Vi | ≤ µ, for some deterministic constant µ > 0. Then, for all choices of λ > 0, n
1 λ2 . P Vi ≥ λ ≤ 2 exp − n 2 i=1 Var(Vi ) + µλ i=1
Proof By Taylor’s expansion, for any ζ > 0, eζVi = 1 + ζVi +
ζ 3 (Vi )3 ζVi ζ 2 Vi2 + e , 2 6
where |Vi | ≤ |Vi |, and Vi Vi ≥ 0. Consequently, ζµeζµ ζ 2 Vi2 1+ , eζVi ≤ 1 + ζVi + 2 3
a.s.
We take expectations to see that 1 1 1 1 ζ 2 Var(Vi ) 1 + ζµeζµ , E{eζVi } ≤ 1 + ζ 2 Var(Vi ) 1 + ζµeζµ ≤ exp 2 3 2 3 since 1 + x ≤ ex , for x ≥ 0. In particular, the independence of the Vi ’s leads to 1 n 1 E eζ i=1 Vi ≤ exp ζ 2 σn2 1 + ζµeζµ , 2 3 n 2 where we write σn = i=1 Var(Vi ), for brevity. Thus, by Chebyshev’s inequality, for all ζ, λ > 0, P
ζ 2 σ2 1 n 1 + ζµeζµ − ζλ . Vi ≥ λ ≤ exp 2 3 i=1
n
Now we choose ζ= Since 13 eζµ ≤ P
n
e 3
σn2
λ . + λµ
≤ 1,
ζ 2 σ2 n 1 + ζµ − ζλ Vi ≥ λ ≤ exp 2 i=1 2 σn2 λµ λ2 λ · 1 + − = exp 2(σn2 + λµ) σn2 + λµ σn2 + λµ σn2 + λµ 2 2 1 λ 1 + 2η λ · − 2 , = exp 2 2(σn + λµ) 1 + η 1 + η σn + λµ
(1)
2 The Law of the Iterated Logarithm
123
where η = λµ/σn2 . Consequently, # " n 1 1 + 2η λ2 · 2 − . P Vi ≥ λ ≤ exp − 2(σn2 + λµ) 1+η 1+η i=1 It remains to prove that 2−
1 1 + 2η ≥ 1. 1+η 1+η
But this is an elementary fact.
One can use a different choice of ζ in (1), to get other inequalities. For instance, see the following exercise. Exercise 2.6.1 Prove that in Proposition 2.6.1 there exists a constant C, independent of the distribution of the Vi ’s, such that for all λ > 0, n λ P Vi ≥ λ ≤ C exp − 1 . n 2 2 max i=1 j=1 VarVi , µ In its essence, this is due to A. N. Kolmogorov.
Exercise 2.6.2 Improve Proposition 2.6.1 by finding a constant κ ∈ ]0, 1[, such that n
λ2 . P Vi ≥ λ ≤ 2 exp − n 2 j=1 VarVi + κµλ i=1 Usually, one refers to Bernstein’s inequality as this with κ = 13 .
2.7 Maximal Inequalities In this subsection we prove two maximal inequalities. When used together with Bernstein’s inequality (Proposition 2.6.1), their implications are analogous to those of Lemma 2.1.1. Lemma 2.7.1 Suppose Z = (Zt ; t ∈ NN ) is a collection of R-valued independent random variables with mean zero and σ 2 = supt∈NN E[Zt2 ] < ∞. Then, whenever λ ≥ 2N +1 σ , 0 1 Zr ≥ λ t ≤ . sup P max st 2 t∈NN rs
Our next maximal inequality is a variant of classical inequalities of P. L´evy and G. Ottaviani; cf. (Pyke 1973; Shorack and Smythe 1976; Wichura 1973) for other variants. When the random walk in question is symmetric, an even better inequality is found in Exercise 2.1.1 above.
124
4. Multiparameter Walks
Lemma 2.7.2 In the notation of Lemma 2.7.1 above, for any x, y > 0, and for all t ∈ NN ,
N
P max Zr ≥ x+N y P max Zr ≤ x ≤P Zs ≥ y . st
st
rs
rs
st
Proof of Lemma 2.7.1 Throughout, we write Tt = s t Zs . For any t ∈ NN , define Ft to be the σ-field generated by (Tr ; r t). Our proof of Proposition 1.2.1 can be mimicked to show that F = (Ft ; t ∈ NN ) is a commuting filtration, since in the latter proposition the identical distribution of the increments was not needed. Moreover, the arguments used in Lemma 1.2.2 go through (verbatim) to show that t → Tt is a martingale with respect to F. By Corollary 3.5.1 and Theorem 2.3.1—both of Chapter 1—for all t ∈ NN , E[Zs2 ] ≤ 4N σ 2 · t. E max Ts2 ≤ 4N E[Tt2 ] = 4N st
st
In the last equality we used the fact that the increments of Tt are meanzero independent random variables. The result follows from the above and Chebyshev’s inequality. Proof of Lemma 2.7.2 We will prove this when N = 1 and N = 2. The general case is deferred to Exercise 2.7.1 below. First, suppose N = 1, and consider the stopping time τ = inf(k ≥ 1 : |Zk | ≥ x + y), where, as usual, inf ∅ = +∞. Clearly, k
Zi ≥ x + y = P(τ ≤ n). P max k≤n
i=1
We decompose the above as follows, all the time writing Tn = brevity: P(τ ≤ n) ≤ P(|Tn | ≥ x) + P(τ ≤ n , |Tn | ≤ x).
n
i=1
Zi for
On the other hand, on (τ ≤ n), we can write |Tn | = |Tn − Tτ + Tτ | ≥ |Tτ | − max |Ti+τ − Tτ | ≥ x + y − max |Ti+τ − Tτ |. i≤n
i≤n
Thus,
P(τ ≤ n) ≤ P(|Tn | ≥ x) + P τ ≤ n , max |Ti+τ − Tτ | ≥ y . i≤n
2 The Law of the Iterated Logarithm
125
The above, together with the strong Markov property (Theorem 1.2.1 of Chapter 3), yields
P(τ ≤ n) ≤ P(|Tn | ≥ x) + P(τ ≤ n)P max |Ti | ≥ y . i≤n
Solving, we obtain
P max |Ti | ≥ x + y · P max |Ti | ≤ y ≤ P(|Tn | ≥ x), i≤n
i≤n
(1)
which is the desired result when N = 1. Note that equation (1) holds even if the increments of T are d-dimensional; in that case, | · · · | denotes, as usual, the ∞ -norm on Rd . now proceed with our proof for N = 2. Here, we write Tn,m = We i≤n j≤m Zi,j , where Zi,j is written in place of Z(i,j) , etc. For any fixed integer m ≥ 1, i → Ti = (Ti,1 , . . . , Ti,m ) is an mdimensional, one-parameter random walk. Since equation (1) applies in this case, we have
P max |Ti | ≥ x + 2y · P max |Ti | ≤ 2y ≤ P(|Tn | ≥ x). i≤n
i≤n
Equivalently, in terms of our two-parameter walk, this states that
max |Ti,j | ≤ y P max |Ti,j | ≥ x + 2y · P (i,j) (n,m) (i,j) (n,m)
≤ P max |Tn,j | ≥ x + y . j≤m
The last term is a maximal inequality involving the one-parameter, onedimensional walk j → Tn,j . Equation (1) implies
P max |Tn,j | ≥ x + y · P max |Ti,j | ≤ y j≤m (i,j) (n,m)
≤ P max |Tn,j | ≥ x + y · P max |Tn,j | ≤ y j≤m
j≤m
≤ P(|Tn,m | ≥ x). This and the preceding display together demonstrate the result for the case N = 2. Exercise 2.7.1 Prove the above for general N > 1.
2.8 A Number-Theoretic Estimate (N )
In Section 2.4 we saw Dirichlet’s divisor numbers Dk introduce a variant of these.
(k ≥ 1). Now we
126
4. Multiparameter Walks
For any k ≥ 1, define (N )
Rk
=
1l{k}
N
j=1
t(j) .
(1)
t∈NN (N )
Note that Rk = 0, unless k ≥ N . We proceed to find a quantitative (N ) estimate for the cumulative sums of the function k → Rk . Lemma 2.8.1 For any k ≥ 1, (N )
(N )
=
=1
(N )
R
≤ k N /N !.
= 0, for all negative integers , and note that for all
Proof Define R k ≥ 1, Rk
k
∞
1l{k−}
N −1 j=1
t∈NN −1 =1
∞ k−1 (N −1)
(N −1) t(j) = Rk− = R . =1
(2)
=1
Therefore, for all k ≥ 1, k j=1
(N )
Rj
=
j−1 k j=1 =1
(N −1)
R
.
(3)
We can now perform mathematical induction on N . Clearly, both bounds k (1) hold for N = 1 and, in fact, =1 R = k. Assuming that the result holds for N − 1, we proceed to show that it does for N . By (2) and by the induction hypothesis, k j=1
(N )
Rj
≤
k (j − 1)N −1 j=1
(N − 1)!
≤
1 (N − 1)!
k
xN −1 dx,
0
which is the desired upper bound. Lemma 2.8.1 is sharp, asymptotically, as k → ∞: Exercise 2.8.1 If x+ = max(x, 0), show that k =1
(N )
R
≥
(k − N + 1)N + . N!
Historically, Dirichlet’s divisor lemma (Lemma 2.4.1) and Lemma 2.8.1 arise in analytic number theory through the theory of integer points. In(2) deed, consider Lemma 2.4.1 with N = 2 and observe that Rk denote the number of points of integral coordinates in a large triangle.
2 The Law of the Iterated Logarithm (2)
Exercise 2.8.2 Verify that as k → ∞, k −2 Rk → 12 .
127
Exercise 2.8.3 Continuing with Exercise 2.8.2, let Gk denote the number of points of integral coordinates in the centered disk of radius k on the plane. Show that as k → ∞, k −2 Gk → π. This calculation, together with some of its refinements, are due to C.-F. Gauss. See Karatsuba (1993, Theorems 2 and 6, Ch. 1) for this and more. For our applications to the LIL, integer points come in via summability criteria such as the following important exercise. ∞ (N ) Exercise 2.8.4 Show that k=1 k −γ Rk < +∞ ⇐⇒ γ > N.
2.9 Proof of the LIL: The Upper Bound In light of Proposition 2.5.1, it suffices to show that for any η > 0, almost surely, 1 St (η) lim sup ≤ 14 N 2 η 2 + N + 12 N η, (1) t→∞ Λ(t) where S(η) is the truncation of the walk S; cf. equations (1)–(3) of Section 2.5. The upper bound of the LIL follows upon appealing to Proposition 2.5.1, and letting η ↓ 0 along a rational sequence, in the above display. We work toward establishing tail estimates for the walk S(η). Since E{|Xt (η)|2 } ≤ E{|Xt |2 } = 1, Lemma 2.7.1 shows us that 0 1 inf P max Ss (η) ≤ 2N +2 t ≥ . st 2 t∈NN Therefore, by Lemma 2.7.2, for all t ∈ NN , and all α > 0,
0 P max |Ss (η)| ≥ αΛ(t) + 2N +2 t ≤ 2N P |St (η)| ≥ αΛ(t) . st
The right-hand side can be estimated by Bernstein’s inequality (Proposition 2.6.1). Indeed, since VarSt (η) ≤ VarSt = t, Bernstein’s inequality and the previous display together show us that for all t ∈ NN , and all α > 0, 0 P max Ss (η) ≥ αΛ(t) + 2N +2 t st
≤ 2N +1 exp −
α2 t ln+ ln+ t , t + αηΛ(t)β(t)
where β is defined in equations (1) of Section 2.5. In particular, 0 P max |Ss (η)| ≥ αΛ(t) + 2N +2 t st
≤ 2N +1 exp −
− α2 α2 ln+ ln+ t ≤ 2N +1 ln+ t 1+αη , 1 + αη
(2)
128
4. Multiparameter Walks
and the last inequality is an equality if ln+ ln+ t = ln lnt. This is the desired probability estimate; we will use it via a blocking argument. To define the blocks, let us fix some δ > 0, and for all t ∈ NN , let rt ∈ NN be the point 2 3 (j) rt = exp(δt(j) ) , j = 1, . . . , N. (3) N (j) Note that lnrt ≥ δ j=1 t − δ. In light of (2), we deduce the existence of a constant C such that t∈NN
P max |Ss (η)| ≥ αΛ(rt ) + 2 s rt
N +2
0
rt ≤ C =C
N t∈NN ∞
k
k=1
t
(j)
−
α2 1+αη
j=1 α2 − 1+αη
(N )
Rk ,
(N ) Rk
was defined in equation (1), Section 2.8. Thanks to Exercise where 2.8.4, these sums converge if α2 > N. 1 + αη
(4)
We choose α, η such that they satisfy equation (4) and deduce, from the Borel–Cantelli lemma, that almost surely, 0 max Ss (η) ≤ αΛ(rt ) + 2N +2 rt , for all but finitely many t ∈ NN . s rt
Now, to blocking: For any ν ∈ NN , we can find t ∈ NN such that rt ≤ ν ≤ rt+1 , where (t + 1)(j) = t(j) + 1. Thus, with probability one, for all but a finite number of ν’s in NN , 0 Sν (η) ≤ max Ss (η) ≤ αΛ(rt+1 ) + 2N +2 rt+1 s rt+1
≤ αeδN/2 (1 + oν )Λ(ν), where oν → 0 as ν → ∞. In other words, assuming that condition (4) holds, lim supν→∞ |Λ(ν)|−1 Sν (η) ≤ αeδN/2 , a.s. Since δ is arbitrary, we can let δ → 0 along a rational sequence and see that this lim sup is bounded above by α. We can even let α converge to the positive solution of α2 = N (1 + αη) and not change the validity of this bound. This verifies equation (1) and completes our proof of the upper bound in the LIL.
2.10 A Moderate Deviations Estimate To prove the lower half of the LIL, we need the following one-parameter result, which states that at least half of Lemma 2.1.2 holds only under the conditions of the central limit theorem. This is, in general, sharp; see Supplementary Exercise 5 below.
2 The Law of the Iterated Logarithm
129
Lemma 2.10.1 Let S = (Sk ; k ≥ 1) denote an R-valued random walk with increments X = (Xk ; k ≥ 1). If E[X1 ] = 0 and E[X12 ] = 1, then for all α > 0, √
1 ln P Sk ≥ α 2k ln ln k ≥ −α2 . lim inf k→∞ ln ln k Proof To clarify the essential ideas for this proof, we first present a rough outline. This discussion will be made rigorous subsequently. Fix some t > 0 and working informally, we can write Sk = Y1 + · · · + Yt ln ln k , where Y1 = Sk/(t ln ln k) , and for all j ∈ {2, . . . , t ln ln k}, Yj = Sjk/(t ln ln k) − Yj−1 − · · · − Y1 . Note that Y1 , Y2 , . . . , Yt ln ln k are independent and all have the same distribution as Sk/(t ln ln k) . (This is where our proof is rough; it is rigorous only if t ln ln k and k/(t ln ln k) are both integers. Nonetheless, this idea of “blocking” the sum into independent blocks is correct in spirit.) 0 Clearly, if all the Yj ’s are larger than αt 2k/ ln ln k, then Sk ≥ √ α 2k ln ln k. Thus, using the i.i.d. structure of the Y ’s, we can estimate probabilities as follows: ) #t ln ln k " √
α 2k P Sk ≥ α 2k ln ln k ≥ P Y1 ≥ t ln ln k ) #t ln ln k " α 2k = P Sk/(t ln ln k) ≥ . t ln ln k Let N denote a standard Gaussian random variable. By the central limit theorem, for all ε > 0, there exists k0 such that for all k ≥ k0 , ) ) α 2k 2 ≥P N≥α − ε. P Sk/(t ln ln k) ≥ t ln ln k t Consequently, for all ε > 0, ) √
1 2 lim inf ln P Sk ≥ α 2k ln ln k ≥ t ln P N ≥ α − ε. k→∞ ln ln t t We can let ε → 0, and appeal to standard tail estimates, e.g., Supplementary Exercise 11, to finish. As we have already seen, the above is a complete proof, except that t ln ln k and/or k/(t ln ln k) need not be integer-valued for some choices of t and k. To get around this, fix t > 0 and define for all k ≥ 4, 4 ak =
k 5 , t ln ln k
bk = t ln ln k!.
Since ak bk ≤ k for all k large enough, we can then write Sk = Y1 + · · · + Ybk + (Sk − Ybk ), where Y1 = Sak , and for all 2 ≤ j ≤ bk , Yj = Sjak − Yj−1 .
130
4. Multiparameter Walks
For all δ > 0, α − δ ) 2k bk P Sk ≥ t ln ln k 7 6 α ) 2k bk √
P |Sk − Ybk | ≤ δ 2k ln ln k . ≥ P Y1 ≥ t ln ln k On the other hand, Sk − Ybk has the same distribution as Sk−ak bk which has mean zero and variance (k − ak bk ). By Chebyshev’s inequality, √
k − ak b k . P |Sk − Ybk | ≤ δ 2k ln ln k ≥ 1 − 2 2δ k ln ln k Since ak ≥ k(t ln ln k)−1 − 1 and bk ≥ t ln ln k − 1, 1 t k − ak b k ≤ . + k ln ln k t(ln ln k)2 +k ln ln k √ That is, P(|Sk − Ybk | ≤ δ 2k ln ln k) goes to 1 as k → ∞. By changing α to α + δ, we obtain ) 1 2k −1 lim inf P Sk ≥ αt bk k→∞ bk ln ln k ) 2k −1 ≥ lim inf ln P Sak ≥ (α + δ)t k→∞ ln ln k ) 2 = ln P N ≥ (α + δ) , t thanks to the central limit theorem and the fact that limk→∞ (ak ln ln k/k) = t−1 . Since limk→∞ (bk / ln ln k) = t, for all α < α and all t > 0, ) √
1 1 2
P Sk ≥ α 2k ln ln k ≥ ln P N ≥ (α + β) . lim inf k→∞ ln ln k t t As t → 0 we arrive at the following: For all 0 < α < α and all β > 0, lim inf k→∞
√
1 P Sk ≥ α 2k ln ln k ≥ −(α + β)2 . ln ln k
Letting β ↓ 0 and α ↓ α , this proves the result with α replacing α.
2.11 Proof of the LIL: The Lower Bound To this end, let us fix some δ > 2 and for all r ∈ NN , define (j) (j) B(r) = t ∈ NN : for all 1 ≤ j ≤ N , eδr ≤ t(j) < eδ(r +1) .
(1)
2 The Law of the Iterated Logarithm
131
Note the appearance of rt in the above, where rt were defined in equation (3) in our proof of the upper bound of the LIL (Section 2.9). Whenever r, t ∈ NN satisfy t ∈ B(r), then two things must happen: N N 1. exp(δ j=1 r(j) ) ≤ t ≤ exp(δ + δ j=1 r(j) ); and 2. t L(r), where L(r) is defined to be the point whose jth coordinate is L(j) (r) = exp(δ + δr(j) )!. In words, L(r) is the unique largest element of B(r) with respect to the partial order . It is important also to recognize that 8 9 #B(r) = 1 − e−δ }−N L(r) , (2) where #B(r) denotes the cardinality of B(r). Fix η ∈ ]0, 1[ and define α > 0 by : N α= . (3) 1−η By Lemma 2.10.1, there exists an integer k0 (which may depend on η and δ) such that whenever #B(r) ≥ k0 ,
−α2 (1−ε) P Xt ≥ αΛ #B(r) ≥ ln #B(r) . t∈B(r)
N Also, by equation (2), ln #B(r) = (1 + or )δ j=1 r(j) , where or → 0 as N (j) → ∞. Therefore, there exists a constant C0 such that for all but j=1 r finitely many r, P
N N −(1−ε)α2 −N
Xt ≥ αΛ #B(r) ≥ C0 r(j) = C0 r(j) ,
j=1
t∈B(r)
j=1
thanks to equations (2) and (3). Consequently, there exist constants C1 and C2 such that
(N ) P Xt ≥ αΛ #B(r) ≥ C1 k −N Rk , r∈NN (N )
t∈B(r)
k≥C2
where Rk is defined by equation (1) of Section 2.8. By Exercise 2.8.4, P(E ) = +∞, where E is the event that N r r r∈N t∈B(r) Xt ≥ αΛ(#B(r)). Since the Er ’s are independent events, the Borel–Cantelli lemma tells us that infinitely many of the Er ’s occur with probability one. To recapitulate, for all δ > 2 and all α and η > 0 satisfying equation (3), Xt t∈B(s) ≥ α, lim sup a.s. #B(s)→∞ Λ #B(s)
132
4. Multiparameter Walks
By equation (2), almost surely, lim sup L(s)→∞
Xt − N2 t∈B(s) ≥ α 1 − e−δ . Λ L(s)
(4)
Pick any s ∈ NN such that s is very large, and note that (s) ≤ − X |SL(r) |, SL(s) t
(5)
r
t∈B(s)
(s) where the sum r is taken over all r ∈ NN such that for all but one (j) 1 ≤ j ≤ N , r = s(j) ; for the one exceptional j, r(j) = s(j) − 1. (There are N summands in this sum.) By the already-proven upper bound to the LIL (Section 2.9), (s) 1 3 1 SL(s) − Xt ≤ (1 + θs )N 2 Λ(r) ≤ (1 + κs )N 2 e− 2 N δ Λ(s), r
t∈B(s)
where θs , κs → 0 as s → ∞. By equations (3)–(5), the following holds, a.s.: lim sup t→∞
SL(s) St ≥ lim sup
Λ(t) s→∞ Λ s − N2 3 1 − N 2 e− 2 N δ ≥ α 1 − e−δ : − N2 N 3 1 1 − e−δ = − N 2 e− 2 N δ . 1−η
Moreover, this holds a.s., simultaneously for all rational numbers δ > 2 and η > 0. The desired lower bound to the LIL follows upon letting δ → ∞ and η → 0, in this order, and along rational sequences.
3 Supplementary Exercises 1. Prove that as n → ∞,
n
k=1
(N)
Dk
/n(ln n)N−1 converges to 1.
2. Suppose X1 , X2 , . . . are i.i.d. random variables such that with probability 1 one, lim supn→∞ (n ln ln n)− 2 | n j=1 Xj | < ∞. We wish to show that this implies E[X12 ] < ∞. That is, in the one-parameter setting, LIL is equivalent to the existence of two finite moments. (i) Prove there exists a nonrandom M > 0 such that the above lim sup is bounded above by M .
3 Supplementary Exercises
133
(ii) Prove that it suffices to show this when the X’s are symmetric. (iii) Suppose the X’s are symmetric, fix c > 0, and define X i = Xi 1l(|Xi |≤c) − Xi 1l(|Xi |>c) . Show that (X i ; i ≥ 1) is a copy of (Xi ; i ≥ 1), i.e., that X and X have the same finite-dimensional distributions. 1 (iv) Prove that almost surely, lim supn→∞ (n ln ln n)− 2 | n j=1 Xi 1l(|Xj |≤c) | ≤ 2M. (v) Use the LIL to show that E[X12 1l(|X1 |≤c) ] ≤ 4M 2 and conclude that E[X12 ] < ∞. This result is due to Strassen (1966), while the above-sketched proof is from Feller (1969). (Hint: For part (ii), introduce independent copies Xi of Xi and consider Xi − Xi instead. For part (iv), note that 2X1l(|X|≤c) = X + X.) 3. Let S = (Sk ; k ≥ 0) denote the simple walk on Z, starting from 0 ∈ Z. That is, the increments of S are ±1 with probability 12 each. Prove that for any n ≥ 1, max1≤k≤n Sk has the same distribution as |Sn |. This is the reflection principle of D. Andr´e; see Feller (1968). (Hint: Study the described proof of Lemma 2.7.2 carefully.) 4. Suppose(Xj ; j ≥ 0) are i.i.d. random variables with mean 0 and variance 1. If Sn = n j=1 Xj , prove the following moderate small-deviations bound: For each λ > 0, ) 1 n ln P max |Sk | ≤ λ lim sup ≤ ln P(|N| ≤ 2λ), 1≤k≤n ln ln n n→∞ ln ln n where N is a standard Gaussian random variable. Conclude that with probability 1 one, lim inf n→∞ (ln ln n/n)− 2 max1≤k≤n |Sk | > 0. This is a part of the statement of Chung (1948). 5. (Hard) Our goal, here, is to show the following moderate deviations principle: If V, V1 , V2 , . . . are i.i.d. random variables with mean zero and variance one, and if they have a finite moment generating function in a neighborhood of the origin, then for any sequence xn tending to infinity, such that limn→∞ n1 xn = 0,
√ 1 1 lim ln P V1 + · · · + Vn ≥ nxn = − . n→∞ xn 2 (i) First, show that even without the assumption on the local existence of a √ moment generating function, lim inf n→∞ x−1 nxn ) ≥ n ln P(V1 + · · · + Vn ≥ − 12 . (ii) Use a blocking argument to show that under the stated conditions of the exercise, the corresponding lim sup ≤ − 12 . (Hint: For (i), mimic the derivation of Lemma 2.10.1. For part (ii), start, as in the first part, by blocking j≤n Vj = j≤an Yj,n , where Y1,n , . . . , Yan ,n are i.i.d. random variables, and an is chosen carefully. Then, write
√ Vj ≥ nxn = P Zj,n ≥ an , P j≤n
j≤an
134
4. Multiparameter Walks 1
where Zj,n = an (nxn )− 2 Yj,n . Use the exponential use of Chebyshev’s inequality as was done for Bernstein’s inequality (Proposition 2.6.1), together with the central limit theorem.) 6. (Hard) Prove that Kronecker’s lemma (Lemma 2.3.1) remains true even if the xs ’s are no longer assumed to be nonnegative. When N = 1, this is the classical and standard form of Kronecker’s lemma. When N ≥ 2, this is due to Cairoli and Dalang (1996, Lemma 2, Ch. 1). (Hint: First, do this for N = 1. Then, proceed by induction on N , using the inclusion–exclusion formula, Lemma 1.2.1.) 7. Suppose ε1 , ε2 , . . . are i.i.d. Rademacher random variables. That is, P(ε1 = 1) = P(ε1 = −1) = 12 . (i) If a1 , a2 , . . . is an arbitrary sequence of numbers, prove that with probability n 1 2 one, lim supn→∞ (2υn ln ln υn )− 2 n j=1 εj aj = 1, where υn = j=1 aj . (ii) Suppose X1 , X2 , . . . are i.i.d. and are totally independent of the sequence 1 of ε’s. Conclude that lim supn→∞ (2Vn ln ln Vn )− 2 n j=1 εj Xj = 1, where n Vn = j=1 Xj2 . 1 (iii) Prove that if the Xi ’s are symmetric, lim supn→∞ (2Vn ln ln Vn )− 2 n j=1 Xj = 1, almost surely. 1 (iv) Show that even without symmetry, lim supn→∞ (Vn ln ln Vn )− 2 n j=1 Xj > 0, almost surely. (Hint: Symmetrize.) (v) Verify that when the Xi ’s are symmetric and have variance 1, the LIL follows. Derive an N -parameter version of this result. This is an example of a “self-normalized LIL” and is essentially due to Griffin and Kuelbs (1991). Roughly speaking, it states that in the symmetric case, the LIL is a consequence of the strong law. 8. In the context of Smythe’s law of large numbers, show that whenever E[|X0 |p ] < ∞ for some p > 1, At converges to E[X0 ] in Lp (P). 9. In the context of Smythe’s law of large numbers, show that for any p > 1, E[supt |At |p ] < ∞ if and only if E[|X0 |p ] < ∞, whereas E[supt |At |] < ∞ if and only if E[|X0 |{ln+ |X0 |}N ] < ∞. (Note the power of N and not N − 1.) This is, in various forms, due to (Burkholder 1962; Gabriel 1977; Gut 1979); see also Cairoli and Dalang (1996, Theorem 2.4.2, Chapter 2). 10. The moment conditions of the strong law and the LIL are crucial, as the following shows. Recall that a random variable Y has a standard Cauchy distribution if it has the probability density function (with respect to Lebesgue’s measure) f (x) = π1 (1 + x2 )−1 , (x ∈ R). Given i.i.d. (standard) Cauchy random variables X1 , X2 , . . ., define Sn = n j=1 Xj to be the corresponding random walk. (i) Verify that for each n ≥ 1, n1 Sn has a standard Cauchy random distribution. (Hint: Consider characteristic functions.)
4 Notes on Chapter 4
135
(ii) (Hard) Suppose a1 , a2 , . . . is a nondecreasing sequence of positive reals such that limn an = +∞. Prove that the following dichotomy holds: " 0, if n a−1 2n < ∞, P(Sn > nan infinitely often ) = 1, if n a−1 2n = +∞. (iii) Conclude that for any nondecreasing function h, lim supn→∞ Sn /{nh(n)} is 0 or infinity (a.s.). (iv) Derive an N -parameter version of this “summability test.” 11. If N is standard Gaussian, prove that for all λ > 0, P(|N| ≥ λ) ≤ 2e−λ 0 2 Moreover, prove that limλ→∞ λeλ /2 P(|N| ≥ λ) = 2/π.
2
/2
.
4 Notes on Chapter 4 Section 1 The proof given here of Smythe’s law of large numbers is close to those in (Edgar and Sucheston 1992; Smythe 1973; Walsh 1986b). For a survey of some of these results (five of them, to be exact), see Smythe (1974a). To see further related results, refer to (Bass and Pyke 1984c; Kwon 1994; Pyke 1973; Shorack and Smythe 1976; Smythe 1974b). The method of reduction to the one-parameter setting is, in fact, a metatheorem; cf. Sucheston (1983). Alternative derivations of Smythe’s law can be found in (Cairoli and Dalang 1996; Khosh