Basic Prerequisites: Probability & Measure Theory and 01 · From Zero.
1. Intuition & Practical Objective
Brownian motion is the canonical fair game in continuous time: it moves, but has no drift, so its best predictor of the future given the present information is the present value. That single property - the martingale property - is the backbone of all no-arbitrage pricing, because “prices under the risk-neutral measure are martingales” is how modern pricing is stated.
The practical objective of this page: understand the three linked faces of BM - (1) Gaussian increments and the covariance ; (2) the martingale and Markov properties and their exponential cousin ; (3) the fact that BM “runs fast,” i.e. quadratic variation and infinite first-order variation. These give the toolkit (independent increments, stopping, first-passage) used constantly in barrier options, simulation, and Girsanov.
2. Mathematical Ground Truth & Derivations
2.1 Definition & covariance (Shreve II Def 3.3.1; Shreve I §13.5–13.7)
A process is BM if: ; paths are continuous; increments are independent and -distributed. Then and finite-dimensional laws are jointly normal with . Equivalent characterizations (Shreve II Thm 3.3.2): independent normal increments ⇔ jointly-normal-with-that-covariance ⇔ the joint MGF form (3.3.5). Normal increments make “uncorrelated ⇒ independent” true here - a huge simplification that fails for general processes.
2.2 Martingale property (Shreve II Thm 3.3.4)
Using independence of the future increment from :
is also Markov: the only relevant information in is itself, with transition density (Shreve II §3.5; via the Independence Lemma, Shreve II Lemma 2.3.4.)
2.3 The exponential martingale (Shreve II Thm 3.6.1; Shreve I Thm 9.41)
For constant ,
Proof. Condition, factor , and use the increment MGF , which exactly cancels the correction. This process is the seed of Girsanov’s change of measure (05 · Girsanov).
2.4 Quadratic variation & the first-passage time (Shreve II §3.4, §3.6)
Let (). Stopping the exponential martingale at and letting via dominated convergence gives (Shreve II Thm 3.6.2):
So BM reaches every level with probability 1 but takes, on average, infinitely long - a striking, exactly-quantified tension. The reflection principle (Shreve II eq 3.7.6) turns barrier/threshold probabilities into tail probabilities:
3. Computational Implementation - verify martingale & exponential-martingale in one shot
Simulate many paths, condition on the state at a fixed time , and check that the sample mean of the later value equals the conditioned state (martingale property); then average the exponential martingale and compare to 1. Stdlib only.
4. Failure Modes & First-Principles Breakdowns
- “Zero drift” ≠ “stays put.” A martingale can have enormous variance - BM, discounted asset prices, everything fair-but-volatile. The martingale property says only that the conditional mean of the future is the present, never that the path is flat. Treating “martingale” as “predictable at the level” misreads the definition.
- Uncorrelated ≠ independent (outside Gaussian). Only for jointly normal processes does zero covariance imply independence (Shreve II §2.2, Example). Many intuitions that “work” for BM fail for general processes; the independence cutoff is the Gaussian assumption, not a general fact.
- surprises everyone. First-passage is almost-sure but mean-infinite; naive simulation (finite horizon) massively understates hitting probabilities, and pricing barrier options from a short simulation is biased. This underlies the continuity-correction and Brownian-interpolation literature (Glasserman Ch 6).
- Mismatched variance in simulation. Mis-scale the step variance: drawing from over a different grid quietly violates and breaks every downstream QV/martingale check.
5. References
- Shreve, Stochastic Calculus for Finance II
- Shreve, Stochastic Calculus for Finance I
- Glasserman, Monte Carlo Methods in Financial Engineering
6. Connected Graph Bridges
- Back: 01 · From Zero
- Forward: 03 · Itô Integral & Doeblin · Index Hub
- Theory: Probability & Measure Theory · No-Arbitrage & Binomial Trees