Markov properties of Brownian motion
[10/30%]If is a Brownian motion, let . Find the density for .
With and as in Exercise 4.1, find the joint density of .
Let be a Brownian motion started at and let be the first time hits . Find the law of .
Use the reflection principle to prove that if is a Brownian motion and , then
In other words, Brownian motion enters the interval immediately. By symmetry it enters the interval immediately. Conclude that Brownian motion hits 0 infinitely often in every time interval .
Let be a Brownian motion and be the minimal augmented filtration generated by . Let
Show that is not a stopping time with respect to .
Let and be as in Exercise 4.1.
Let and let with . Show that there exists a constant , depending on , and , but not or , such that
Show that the path of a Brownian motion does not take on the same value as a local maximum twice. That is, if and are times when has a local maximum, then , a.s.
Let be the number of upcrossings of by a Brownian motion up to time . This means we let , and for , and we set . Show that , a.s., as .
Let be a Brownian motion. The zero set of Brownian motion is the random set
Show that is a closed set for each .
Show that with probability one, every point of is a limit point of . Conclude that is an uncountable set.
Let be a one-dimensional Brownian motion and .
Prove that there exists such that if , then
Prove there exists such that
Prove that if , then
and the same with in place of . Conclude that
Use induction to prove that if , there exists such that
Prove that if is a -dimensional Brownian motion, , and , there exists such that
The -variation of a function on the interval is defined by
the supremum is over all partitions of . In this exercise we will prove that if and is a Brownian motion, then , a.s.
Let be an i.i.d. sequence of random variables with finite mean. Use the strong law of large numbers to prove that if , then
as .
If , take , and let . Let and for , set . Set . Prove that the are i.i.d. with finite mean.
Use (1) to show that
as .
Using the partition , show that on the event .
Conclude , a.s.