Reflection principle (Wiener process)
   HOME

TheInfoList



OR:

In the theory of
probability Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speakin ...
for stochastic processes, the reflection principle for a
Wiener process In mathematics, the Wiener process is a real-valued continuous-time stochastic process named in honor of American mathematician Norbert Wiener for his investigations on the mathematical properties of the one-dimensional Brownian motion. It is ...
states that if the path of a Wiener process ''f''(''t'') reaches a value ''f''(''s'') = ''a'' at time ''t'' = ''s'', then the subsequent path after time ''s'' has the same distribution as the reflection of the subsequent path about the value ''a''. More formally, the reflection principle refers to a lemma concerning the distribution of the supremum of the Wiener process, or Brownian motion. The result relates the distribution of the supremum of Brownian motion up to time ''t'' to the distribution of the process at time ''t''. It is a corollary of the strong Markov property of Brownian motion.


Statement

If (W(t): t \geq 0) is a Wiener process, and a > 0 is a threshold (also called a crossing point), then the lemma states: : \mathbb \left(\sup_ W(s) \geq a \right) = 2\mathbb(W(t) \geq a) Assuming W(0) = 0 , due to the continuity of Wiener processes, each path (one sampled realization) of Wiener process on (0,t) which finishes at or above value/level/threshold/crossing point a the time t ( W(t) \geq a ) must have crossed (reached) a threshold a ( W(t_a) = a ) at some earlier time t_a \leq t for the first time . (It can cross level a multiple times on the interval (0,t), we take the earliest.) For every such path, you can define another path W'(t) on (0,t) that is reflected or vertically flipped on the sub-interval (t_a,t) symmetrically around level a from the original path. These reflected paths are also samples of the Wiener process reaching value W'(t_a) = a on the interval (0,t), but finish below a. Thus, of all the paths that reach a on the interval (0,t) , half will finish below a, and half will finish above. Hence, the probability of finishing above a is half that of reaching a. In a stronger form, the reflection principle says that if \tau is a
stopping time In probability theory, in particular in the study of stochastic processes, a stopping time (also Markov time, Markov moment, optional stopping time or optional time ) is a specific type of “random time”: a random variable whose value is inter ...
then the reflection of the Wiener process starting at \tau , denoted (W^\tau(t): t \geq 0), is also a Wiener process, where: : W^\tau(t) = W(t)\chi_\left\ + (2W(\tau) - W(t))\chi_\left\ and the indicator function \chi_= \begin 1, & \textt \leq \tau \\ 0, & \text\end and \chi_ is defined similarly. The stronger form implies the original lemma by choosing \tau = \inf\left\.


Proof

The earliest stopping time for reaching crossing point ''a'', \tau_a := \inf\left\ , is an almost surely bounded stopping time. Then we can apply the strong Markov property to deduce that a relative path subsequent to \tau_a, given by X_t := W(t + \tau_a) - a , is also simple Brownian motion independent of \mathcal^W_ . Then the probability distribution for the last time W(s) is at or above the threshold a in the time interval ,t/math> can be decomposed as : \begin \mathbb\left(\sup_W(s) \geq a\right) & = \mathbb\left(\sup_W(s) \geq a, W(t) \geq a\right) + \mathbb\left(\sup_W(s) \geq a, W(t) < a\right)\\ & = \mathbb\left(W(t) \geq a\right) + \mathbb\left(\sup_W(s) \geq a, X(t-\tau_a) < 0\right)\\ \end. By the tower property for conditional expectations, the second term reduces to: : \begin \mathbb\left(\sup_W(s) \geq a, X(t-\tau_a) < 0\right) &= \mathbb\left \mathcal^W_\right)\right\ & = \mathbb\left \mathcal^W_\right)\right\ & = \frac\mathbb\left(\sup_W(s) \geq a\right) , \end since X(t) is a standard Brownian motion independent of \mathcal^W_ and has probability 1/2 of being less than 0. The proof of the lemma is completed by substituting this into the second line of the first equation.Mörters, P.; Peres, Y. (2010) ''Brownian Motion'', CUP. : \begin \mathbb\left(\sup_W(s) \geq a\right) & = \mathbb\left(W(t) \geq a\right) + \frac\mathbb\left(\sup_W(s) \geq a\right) \\ \mathbb\left(\sup_W(s) \geq a\right) &= 2 \mathbb\left(W(t) \geq a\right) \end.


Consequences

The reflection principle is often used to simplify distributional properties of Brownian motion. Considering Brownian motion on the restricted interval (W(t): t \in ,1 then the reflection principle allows us to prove that the location of the maxima t_\text , satisfying W(t_\text) = \sup_W(s) , has the arcsine distribution. This is one of the Lévy arcsine laws.


References

{{Stochastic processes Stochastic calculus Probability theorems