12.07.2015 Views

Course in Probability Theory

Course in Probability Theory

Course in Probability Theory

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

8 .2 BASIC NOTIONS 1 273Instead of requir<strong>in</strong>g a to be def<strong>in</strong>ed on all 0 but possibly tak<strong>in</strong>g the valueoc, we may suppose it to be def<strong>in</strong>ed on a set A <strong>in</strong> Note that a strictlypositive <strong>in</strong>teger n is an optional r.v . The concepts of pre-a and post-a fieldsreduce <strong>in</strong> this case to the previous ~„ and ~~, ; .A vital example of optional r.v . is that of the first entrance time <strong>in</strong>to agiven Borel set A :00m<strong>in</strong>{n E N : Z n (w) E A} on U {w : Z n (w) E A) ;(5) aA(w) = n=1+00 elsewhere .To see that this is optional, we need only observe that for each n E N :{w : aA(w) = n } _ {w : Z j (w) E A`, 1 < j < n - 1 ; Zn (w) E A}which clearly belongs to ?,T, ; similarly for n = oo .Concepts connected with optionality have everyday counterparts, implicit<strong>in</strong> phrases such as "with<strong>in</strong> thirty days of the accident (should it occur)" . Historically,they arose from "gambl<strong>in</strong>g systems", <strong>in</strong> which the gambler choosesopportune times to enter his bets accord<strong>in</strong>g to previous observations, experiments,or whatnot . In this <strong>in</strong>terpretation, a + 1 is the time chosen to gambleand is determ<strong>in</strong>ed by events strictly prior to it. Note that, along with a, a + 1is also an optional r .v ., but the converse is false .So far the notions are valid for an arbitrary process on an arbitrary triple .We now return to a stationary <strong>in</strong>dependent process on the specified triple andextend the notion of "shift" to an "a-shift" as follows : ra is a mapp<strong>in</strong>g on{a < oo} such that(6) racy = r n w on {w : a(co) = n} .Thus the post-a process is just the process IX,, (taco), n E N} . Recall<strong>in</strong>g thatX n is a mapp<strong>in</strong>g on S2, we may also write(7) Xa+n (w) = Xn (r a (0) = (Xn ° 'r ' ) (0) )and regard X„ ° ra, n E N, as the r .v.'s of the new process . The <strong>in</strong>verse setmapp<strong>in</strong>g (ra) -1 , to be written more simply as r-a, is def<strong>in</strong>ed as usual :r-'A = {w : raw E A} .Let us now prove the fundamental theorem about "stopp<strong>in</strong>g" a stationary<strong>in</strong>dependent process .Theorem 8 .2 .2 . For a stationary <strong>in</strong>dependent process and an almost everywheref<strong>in</strong>ite optional r .v . a relative to it, the pre-a and post-a fields are <strong>in</strong>dependent. Furthermore the post-a process is a stationary <strong>in</strong>dependent processwith the same common distribution as the orig<strong>in</strong>al one .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!