Reflecting a Brownian path after its first hit of a level preserves Wiener measure and maps an endpoint to .
The ratio of the terminal value of a standard Brownian motion to its running maximum at time one has density for and zero otherwise. The Brownian reflection principle gives joint density for . Substituting and integrating the Jacobian factor proves the density; its integral on is one.
Reflecting a Brownian motion after a stopping time by for , and leaving it unchanged for , preserves its path probability distribution. For finite , the Strong Markov property and symmetry of the future Brownian motion prove this. When , the path is left unchanged.
Stop the Exponential martingale for Brownian motion when first reaches or at . On the hitting event its value is at least , so that event has probability at most . Minimize over and apply the same bound to . The union bound gives the displayed inequality for ; at zero the probability is zero.
For Brownian motion, write the later maximum as , where has a nondegenerate normal distribution and . The independent increments make independent of the earlier history and of . Conditional on those two objects, equality of the two maxima prescribes one value of , an event of probability zero. This argument uses the positive gap and does not assume independence of the two absolute maxima.
For and , the distribution function is . The Brownian reflection principle gives the zero-drift terminal density below the barrier as for . Weight it by using the Girsanov theorem and complete squares in the two Gaussian integrals.
For , , and , the joint distribution function is . The Brownian reflection principle gives killed endpoint density at zero drift. Multiplication by and completion of squares gives the formula.
Let be positive, continuous and nondecreasing, with . The small-value probability for the Brownian running maximum is at most a constant times the value. Brownian scaling and dyadic integral comparison make the exceptional probabilities summable. The Borel-Cantelli first lemma and monotonicity interpolate between dyadic times. Apply this argument to for every positive integer on a countable intersection of probability-one events to obtain the infinite lower limit.
For standard one-dimensional Brownian motion and a fixed , the Brownian reflection principle gives the survival probability . The standard normal distribution function has derivative at zero, giving the displayed asymptotic. Thus the persistence exponent is one half, with leading constant .
Stopping Brownian motion at its first crossing below , the nonnegative local martingale starts at one and ends at zero. The maximal identity for a continuous nonnegative local martingale tending to zero gives tail for the stopped maximum, hence density for . There is no atom at zero.
Let for a standard Brownian motion. For , the Brownian reflection principle givesOn , the pair therefore has joint probability density
For a standard Brownian motion , its Brownian running maximum , and its local time of a semimartingale at zero, the process pairs satisfyIn particular, and are both Reflected Brownian motion and have the same law as processes.
Brownian motion attains its maximum on at a unique time almost surely. This time has the arcsine distribution
Let be the first attainment of the maximum of standard Brownian motion on , with . Time reversal shows with probability one. Then for , an initial interval of positive length. Standard Brownian motion has probability zero of this property by the Brownian reflection principle, so is not Brownian. Moreover is not a stopping time for the natural Brownian filtration: for , , which is strictly between zero and one on . The Strong Markov property is therefore inapplicable at this random time.
Articles by others on the same topic
The Reflection Principle is a fundamental concept in the study of stochastic processes, particularly in the context of the Wiener process (also known as Brownian motion). The principle provides a method for analyzing the behavior of Brownian paths, especially concerning their maximum or minimum values.