Quant Sandbox
DerivativesPortfolio & RiskFixed IncomeCorporate FinanceStochastic ModelsGuide
Stochastic Models
Stochastic Learning StudioBeta
1.1Symmetric Random Walk1.2Rescaled Random Walk1.3Standard deviation1.4Central Limit Theorem2.1Defining the Wiener process2.2Increment explorer2.3Joint distributions and covariance3.1Running maximum and minimum3.2Reflection principle3.3First passage times3.4Hitting probabilities
Brownian MotionBeta
Geometric Brownian MotionBeta
Itô ProcessBeta
Monte CarloBeta
Curriculum/Chapter 3 · Brownian Path Geometry/3.2
← PreviousRunning maximum and minimumNext →First passage times

© 2026 Quant Sandbox · A study aid for quantitative finance

Privacy & dataNo cookies

This site does not use cookies and asks for no personal data. It keeps a few small settings in your browser's local storage — your chosen theme and language, the sidebar layout, and your progress and answers in the Guides — so it remembers them on your next visit. This data never leaves your device; clearing your browser storage removes it. Inputs you change can also be captured in the page URL, so you can share or bookmark a specific setup. The site uses Vercel Web Analytics, a privacy-friendly, cookieless service that records only anonymous, aggregated usage (such as page views) without identifying you or tracking you across other sites.

3.2

Reflection principle

Why is the chance that a path ever reaches level a exactly twice the chance that it ends above a?

Goal: reflect a path after its first crossing and confirm by Monte Carlo that P(M(T) ≥ a) = 2·P(W(T) ≥ a).

Simulation controls

Level (barrier) aThe principle holds for every level a > 0
1.00
0.22.5
Play the path
1.00
0.001.00
2,000
1003000
7
19999

Empirical vs theory

P(M(1) ≥ a) empirical
0.297
2·P(W(1) ≥ a) empirical
0.279
2(1 − Φ(a)) theory
0.317
P(W(1) ≥ a) empirical
0.140

About half of the crossing paths end below the level — the terminal probability misses them, but reflection pairs each with a path ending above. The grid maximum slightly underestimates.

Try this

  1. Predict first: once a path reaches the level, how likely is it to end above it? Count over the next few crossing paths.
  2. Set a close to 0: why does P(M(1) ≥ a) approach 1 while P(W(1) ≥ a) only approaches ½?
  3. Drop the paths to 100: which pulls the estimate further from theory — sampling noise or the grid?
A path and its reflection after the first crossing
τₐ = 0.372
  • Original path
  • Reflected path
  • Level a

Up to τₐ the two paths coincide; afterwards the reflected path is 2a − W(t). By symmetry both are equally likely, so every crossing path that ends below a is paired with one that ends above it.

P(M(1) ≥ a) as a function of the level
P(M(1) ≥ a) empirical2·P(W(1) ≥ a) empirical2(1 − Φ(a))

The empirical tail of the running maximum matches twice the terminal probability and the theoretical 2(1 − Φ(a)).