The Reflection Principle
A trick for computing "did the price ever touch a barrier?" by mirroring every path that crosses the barrier onto its reflection — the technique behind closed-form barrier-option prices and the classic ballot-problem style probability puzzles.
Prerequisites: Brownian Motion, Stopping Times
A barrier option knocks out the moment the price touches a level, whether or not it's still there at expiry. Pricing it means answering "what's the probability the maximum of the path over exceeded some level ?" — a question about the whole path's extreme value, not just its endpoint. That sounds like it needs tracking every possible path shape. It doesn't: a symmetry trick collapses it into a question about the endpoint alone.
The analogy: mirror everything that overshoots
Brownian motion, once it touches a level, is equally likely to continue upward or bounce back down from that instant on — by the strong Markov property, the future beyond a hitting time forgets everything except where it currently is, and up-versus-down from there are symmetric coin flips. So take every path that touches the barrier at some point and then ends up below by time . For each one, there's an equally likely path that touches at the same instant and then, from that point on, does exactly the mirror-image motion — ending up above by the same distance instead. Reflecting every such path across the barrier pairs them up one-to-one with paths that end up above . That pairing is the entire trick.
Writing it down
Let be the running maximum of Brownian motion up to time . The reflection principle states
In words: the probability the path ever reached level equals exactly twice the probability that it happens to be above at the final time alone. Every path ending above certainly touched along the way (since it started at 0), and the reflection argument shows there's an equal-probability mirror path, touching and ending an equal distance below it, for each one — so "touched and ended above it" and "touched and ended below it" are equally likely, and together they make up the full event .
Since , this gives a closed form:
where is the standard normal CDF. In words: a question about the entire path's extreme value has been reduced to a single lookup in a normal distribution table.
Sample paths above and pick a level in your head. Some paths that stay below your level the whole time count as "never touched." Some cross it and end up above; the reflection principle's claim is that exactly as many paths cross it and drift back down to end below it — you can see the rough symmetry by eye across many redraws, even though any single path's ending is unpredictable.
Worked example 1: probability of ever touching a level
For and barrier : . Using : . So there's about a 31.7 percent chance standard Brownian motion ever reaches level 1 within one unit of time — nearly four times the roughly 8 percent chance it happens to be above 1 exactly at (computed as , then halved isn't needed — that's already itself). The gap between 15.9 percent (ending above) and 31.7 percent (ever touching) is entirely paths that spiked above 1 at some point and drifted back down by — invisible if you only looked at the endpoint.
Worked example 2: pricing the probability behind a barrier option
A stock modeled as driftless Brownian motion (for simplicity) starts effectively at 0 in log terms, and a down-and-out barrier sits at (in log-price units), with years to expiry and volatility scaled so the process has variance . , using the mirror-image version of the formula for a minimum: . So there's a 31.7 percent chance this barrier knocks the option out before expiry — the same reflection-principle formula, just applied to a running minimum instead of a maximum, is the core building block inside every closed-form barrier option pricing formula.
What this means in practice
- Closed-form barrier option prices (up-and-out, down-and-in, and their combinations) are built directly from reflection-principle probabilities like the one above, layered with the risk-neutral drift and discounting.
- First-passage-time distributions — "how long until the price first hits a stop-loss level" — follow from differentiating the reflection-principle formula with respect to the barrier or time, giving the density of the hitting time directly (see First Passage Times).
- The classic ballot problem and related combinatorial brainteasers ("in an election counted vote by vote, what's the probability the winner was always ahead") are the discrete random-walk version of exactly this same mirroring argument.
The reflection principle turns "did the path ever cross a barrier?" into "what's the probability the path ends up beyond that barrier, doubled" — because every path that crosses and ends up on one side has an equally likely mirror-image twin that crosses and ends up the same distance on the other side. It converts a whole-path question into a single normal-distribution lookup.
The clean formula relies specifically on driftless, symmetric Brownian motion starting at 0 — the mirror-image argument needs up-moves and down-moves from any point to be equally likely. The moment there's a nonzero drift (as in almost every real asset-price model), the naive doubling formula no longer applies directly; a drift-adjusted version (via a change of measure using Girsanov's theorem) is required, and plugging drifted prices into the plain reflection formula silently misprices the barrier probability.
Related concepts
Practice in interviews
Further reading
- Shreve, Stochastic Calculus for Finance II (ch. 3.7)
- Karatzas & Shreve, Brownian Motion and Stochastic Calculus (ch. 2.8)