Quant Sandbox
DerivativesPortfolio & RiskFixed IncomeCorporate FinanceStochastic ModelsGuide
Guide
Derivatives pricing
01Forwards, calls and puts02Combining positions03Arbitrage and the forward price04Put–call parity05The one-step binomial model06Risk-neutral probabilities07Multi-step trees and backward induction08American options and early exercise09Delta and hedging10Geometric Brownian motion11The Black–Scholes formula12The Greeks: gamma, vega, theta and rho13Implied volatility and the volatility smile14Stochastic volatility and the Heston model15Static replication: Breeden–Litzenberger and Carr–Madan16Exotic options: barriers, Asians and digitals
Portfolio & risk
01Returns and volatility02Diversification and correlation03The efficient frontier and the capital market line04Risk aversion and the optimal complete portfolio05CAPM, beta and the security market line06Performance measures: Sharpe, Treynor, Jensen and information ratio07Factor models and systematic risk08Value at Risk and expected shortfall
Fixed income
01Bond prices and yields02Duration and convexity03Immunization and duration matching04Spot rates, forward rates and the yield curve05Bond futures and the cheapest-to-deliver06Interest rate swaps07Callable bonds and negative convexity08Credit risk: default probabilities and credit spreads
Corporate finance
01Interest, compounding and discounting02Annuities, perpetuities and loan amortization03Net present value and internal rate of return04The weighted average cost of capital05Capital structure and the Modigliani–Miller theorems06Discounted cash flow valuation07Relative valuation with multiples08Real options: the value of flexibility
Stochastic models
01Random walks and Brownian motion02Probability spaces, σ-algebras and random variables03Filtrations, adapted processes and stopping times04Conditional expectation and martingales05Properties of Brownian motion06The reflection principle and first passage times07The Brownian bridge08The Itô integral09Itô's lemma10Kolmogorov equations and the Feynman–Kac formula11Change of measure and Girsanov's theorem12Monte Carlo option pricing13Simulating SDEs: the Euler–Maruyama scheme14Mean reversion: Ornstein–Uhlenbeck and Vasicek15Jumps and the Merton jump-diffusion model
Knowledge graph

© 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.

Guide/Stochastic models

Properties of Brownian motion

Lesson 5 of 15 · 1 min read

The lesson "Random walks and Brownian motion" obtained Brownian motion as the limit of a scaled coin-flip walk and listed its defining properties informally. With the language of "Probability spaces, σ-algebras and random variables" and "Filtrations, adapted processes and stopping times" in hand, this lesson states the definition precisely, proves that Brownian motion is characterised by its covariance function, and uses that characterisation to derive four invariances, among them time inversion. It ends with the main path properties: recurrence, nowhere differentiability, infinite total variation, finite quadratic variation, and the Markov and strong Markov properties.

Definition of Brownian motion

Let (Ω,F,P)(\Omega, \mathcal{F}, \mathbb{P})(Ω,F,P) be a probability space. A standard Brownian motion is a family of random variables (Wt)t≥0(W_t)_{t \ge 0}(Wt​)t≥0​ on it such that

  • W0=0W_0 = 0W0​=0 almost surely;
  • for all 0≤t0<t1<⋯<tn0 \le t_0 < t_1 < \cdots < t_n0≤t0​<t1​<⋯<tn​ the increments Wt1−Wt0,…,Wtn−Wtn−1W_{t_1} - W_{t_0}, \dots, W_{t_n} - W_{t_{n-1}}Wt1​​−Wt0​​,…,Wtn​​−Wtn−1​​ are independent;
  • for 0≤s<t0 \le s < t0≤s<t the increment Wt−WsW_t - W_sWt​−Ws​ has the normal distribution N(0,t−s)N(0, t - s)N(0,t−s);
  • for almost every ω∈Ω\omega \in \Omegaω∈Ω the path t↦Wt(ω)t \mapsto W_t(\omega)t↦Wt​(ω) is continuous.

That such a process exists is a theorem (Wiener, 1923); a standard proof builds the finite-dimensional distributions and then uses Kolmogorov's continuity theorem to obtain a continuous version. Given a filtration (Ft)t≥0(\mathcal{F}_t)_{t \ge 0}(Ft​)t≥0​, WWW is a Brownian motion with respect to (Ft)(\mathcal{F}_t)(Ft​) if it is adapted and Wt−WsW_t - W_sWt​−Ws​ is independent of Fs\mathcal{F}_sFs​ for every s<ts < ts<t. For the natural filtration FtW=σ(Wu:u≤t)\mathcal{F}^W_t = \sigma(W_u : u \le t)FtW​=σ(Wu​:u≤t) this follows from the independent increments.

Brownian motion as a Gaussian process

A process (Xt)(X_t)(Xt​) is a Gaussian process if every vector (Xt1,…,Xtn)(X_{t_1}, \dots, X_{t_n})(Xt1​​,…,Xtn​​) is multivariate normal. Its law is then fixed by the mean function E[Xt]\mathbb{E}[X_t]E[Xt​] and the covariance function Cov⁡(Xs,Xt)\operatorname{Cov}(X_s, X_t)Cov(Xs​,Xt​), because a multivariate normal distribution is fixed by its mean vector and covariance matrix.

Brownian motion is Gaussian: (Wt1,…,Wtn)(W_{t_1}, \dots, W_{t_n})(Wt1​​,…,Wtn​​) is a linear transformation of the independent normal increments, since Wtk=∑j≤k(Wtj−Wtj−1)W_{t_k} = \sum_{j \le k}(W_{t_j} - W_{t_{j-1}})Wtk​​=∑j≤k​(Wtj​​−Wtj−1​​). Its mean is zero, and for s≤ts \le ts≤t, splitting Wt=Ws+(Wt−Ws)W_t = W_s + (W_t - W_s)Wt​=Ws​+(Wt​−Ws​) with the second term independent of the first,

Cov⁡(Ws,Wt)=Var⁡(Ws)+Cov⁡(Ws,Wt−Ws)=s=min⁡(s,t).\operatorname{Cov}(W_s, W_t) = \operatorname{Var}(W_s) + \operatorname{Cov}(W_s, W_t - W_s) = s = \min(s, t).Cov(Ws​,Wt​)=Var(Ws​)+Cov(Ws​,Wt​−Ws​)=s=min(s,t).

Characterisation: a process (Xt)t≥0(X_t)_{t \ge 0}(Xt​)t≥0​ with continuous paths is a standard Brownian motion if and only if it is a centred Gaussian process with Cov⁡(Xs,Xt)=min⁡(s,t)\operatorname{Cov}(X_s, X_t) = \min(s, t)Cov(Xs​,Xt​)=min(s,t).

The forward direction was just shown. Conversely, let XXX be such a process. Then Var⁡(X0)=0\operatorname{Var}(X_0) = 0Var(X0​)=0, so X0=0X_0 = 0X0​=0. For s<ts < ts<t, Var⁡(Xt−Xs)=t−2s+s=t−s\operatorname{Var}(X_t - X_s) = t - 2s + s = t - sVar(Xt​−Xs​)=t−2s+s=t−s. For disjoint intervals s<t≤u<vs < t \le u < vs<t≤u<v,

Cov⁡(Xt−Xs, Xv−Xu)=min⁡(t,v)−min⁡(t,u)−min⁡(s,v)+min⁡(s,u)=t−t−s+s=0.\operatorname{Cov}(X_t - X_s,\, X_v - X_u) = \min(t,v) - \min(t,u) - \min(s,v) + \min(s,u) = t - t - s + s = 0.Cov(Xt​−Xs​,Xv​−Xu​)=min(t,v)−min(t,u)−min(s,v)+min(s,u)=t−t−s+s=0.

The increments are jointly normal, and for jointly normal variables zero covariance implies independence. So all four defining properties hold. In practice this means: to show that a transformed process is a Brownian motion, it suffices to check that it is centred Gaussian, has covariance min⁡(s,t)\min(s,t)min(s,t), and has continuous paths.

Four invariances

Each transformation below is a linear map applied to WWW, so the result is again a centred Gaussian process; only the covariance and continuity need checking. Let c>0c > 0c>0 and s≥0s \ge 0s≥0 be fixed.

  • Symmetry. Xt=−WtX_t = -W_tXt​=−Wt​. Then Cov⁡(Xu,Xv)=min⁡(u,v)\operatorname{Cov}(X_u, X_v) = \min(u,v)Cov(Xu​,Xv​)=min(u,v) trivially.
  • Scaling. Xt=c−1/2WctX_t = c^{-1/2} W_{ct}Xt​=c−1/2Wct​. Then Cov⁡(Xu,Xv)=c−1min⁡(cu,cv)=min⁡(u,v)\operatorname{Cov}(X_u, X_v) = c^{-1}\min(cu, cv) = \min(u,v)Cov(Xu​,Xv​)=c−1min(cu,cv)=min(u,v). Speeding up time by ccc and shrinking space by c\sqrt{c}c​ gives the same process.
  • Time shift. Xt=Ws+t−WsX_t = W_{s+t} - W_sXt​=Ws+t​−Ws​. Then Cov⁡(Xu,Xv)=min⁡(s+u,s+v)−s−s+s=min⁡(u,v)\operatorname{Cov}(X_u, X_v) = \min(s+u, s+v) - s - s + s = \min(u,v)Cov(Xu​,Xv​)=min(s+u,s+v)−s−s+s=min(u,v). Moreover XXX is independent of Fs\mathcal{F}_sFs​, because its finite-dimensional vectors are built from increments after sss. This is the simple Markov property: after any fixed time the process starts afresh, independently of the past.
  • Time inversion. Xt=t W1/tX_t = t\,W_{1/t}Xt​=tW1/t​ for t>0t > 0t>0 and X0=0X_0 = 0X0​=0. For u,v>0u, v > 0u,v>0, Cov⁡(Xu,Xv)=uvmin⁡(1/u,1/v)=uv/max⁡(u,v)=min⁡(u,v)\operatorname{Cov}(X_u, X_v) = uv\min(1/u, 1/v) = uv/\max(u,v) = \min(u,v)Cov(Xu​,Xv​)=uvmin(1/u,1/v)=uv/max(u,v)=min(u,v).

Only time inversion needs care with continuity. On (0,∞)(0, \infty)(0,∞) the path t↦tW1/tt \mapsto t W_{1/t}t↦tW1/t​ is continuous; the question is whether Xt→0X_t \to 0Xt​→0 as t↓0t \downarrow 0t↓0. Restricted to the positive rationals, XXX and WWW have the same finite-dimensional distributions, and the event {Xq→0 as q↓0, q∈Q}\{X_q \to 0 \text{ as } q \downarrow 0,\ q \in \mathbb{Q}\}{Xq​→0 as q↓0, q∈Q} is determined by countably many coordinates. Its probability is therefore the same as for WWW, namely 1. Continuity on (0,∞)(0, \infty)(0,∞) then gives Xt→0X_t \to 0Xt​→0 along all ttt. Substituting u=1/tu = 1/tu=1/t yields the law of large numbers for Brownian motion:

lim⁡u→∞Wuu=lim⁡t↓0t W1/t=0almost surely.\lim_{u \to \infty} \frac{W_u}{u} = \lim_{t \downarrow 0} t\,W_{1/t} = 0 \quad \text{almost surely}.u→∞lim​uWu​​=t↓0lim​tW1/t​=0almost surely.

Time inversion swaps the behaviour of the path near t=0t = 0t=0 with its behaviour as t→∞t \to \inftyt→∞: every statement about one end gives a statement about the other.

The figure applies one transformation at a time to fresh Brownian paths and draws 8 transformed paths on t∈[0,1]t \in [0, 1]t∈[0,1] together with the curves ±t\pm\sqrt{t}±t​ and ±2t\pm 2\sqrt{t}±2t​. Choose scaling and move ccc from 0.25 to 4, choose time inversion, symmetry, or time shift and move sss from 0 to 2, and press "New paths". The readouts, computed over 2000 paths, show the sample variance of X1X_1X1​, close to 1, and the sample covariance of (X0.5,X1)(X_{0.5}, X_1)(X0.5​,X1​), close to min⁡(0.5,1)=0.5\min(0.5, 1) = 0.5min(0.5,1)=0.5, whichever transformation is selected.

Transformations of Brownian motionOpen in Stochastic Learning Studio →

X(t) = t · W(1/t)

±√t±2√t
Variance of X₁ (2000 paths)
0.967
Cov(X₀.₅, X₁) (2000 paths)
0.493

Worked example

Find P(W1>0, W2>0)\mathbb{P}(W_1 > 0,\ W_2 > 0)P(W1​>0, W2​>0). The pair (W1,W2)(W_1, W_2)(W1​,W2​) is bivariate normal with variances 1 and 2 and covariance min⁡(1,2)=1\min(1,2) = 1min(1,2)=1, so its correlation is ρ=1/2≈0.7071\rho = 1/\sqrt{2} \approx 0.7071ρ=1/2​≈0.7071. For a centred bivariate normal pair the probability that both coordinates are positive is 14+arcsin⁡(ρ)/(2π)\tfrac14 + \arcsin(\rho)/(2\pi)41​+arcsin(ρ)/(2π), hence

P(W1>0, W2>0)=14+arcsin⁡(1/2)2π=14+π/42π=38=0.375.\mathbb{P}(W_1 > 0,\ W_2 > 0) = \frac14 + \frac{\arcsin(1/\sqrt{2})}{2\pi} = \frac14 + \frac{\pi/4}{2\pi} = \frac38 = 0.375.P(W1​>0, W2​>0)=41​+2πarcsin(1/2​)​=41​+2ππ/4​=83​=0.375.

Independent signs would give 0.250.250.25; the extra 0.1250.1250.125 comes from the shared stretch [0,1][0, 1][0,1] of the two values.

Path properties

The invariances lead to the following almost-sure properties. They are stated as theorems; the proofs are in any text on Brownian motion.

  • Law of the iterated logarithm (Khinchin): lim sup⁡t→∞Wt/2tln⁡ln⁡t=1\limsup_{t \to \infty} W_t / \sqrt{2t\ln\ln t} = 1limsupt→∞​Wt​/2tlnlnt​=1. By time inversion, also lim sup⁡t↓0Wt/2tln⁡ln⁡(1/t)=1\limsup_{t \downarrow 0} W_t / \sqrt{2t\ln\ln(1/t)} = 1limsupt↓0​Wt​/2tlnln(1/t)​=1.
  • Recurrence: by the law of the iterated logarithm and symmetry, lim sup⁡t→∞Wt=+∞\limsup_{t\to\infty} W_t = +\inftylimsupt→∞​Wt​=+∞ and lim inf⁡t→∞Wt=−∞\liminf_{t\to\infty} W_t = -\inftyliminft→∞​Wt​=−∞. Since paths are continuous, WWW hits every level a∈Ra \in \mathbb{R}a∈R, and does so at arbitrarily large times. Near t=0t = 0t=0 the small-time version shows that WWW returns to 0 infinitely often in every interval [0,ε][0, \varepsilon][0,ε].
  • Nowhere differentiability (Paley, Wiener and Zygmund, 1933): with probability one, t↦Wtt \mapsto W_tt↦Wt​ is differentiable at no ttt. Scaling explains why: (Wt+h−Wt)/h∼N(0,1/h)(W_{t+h} - W_t)/h \sim N(0, 1/h)(Wt+h​−Wt​)/h∼N(0,1/h), so for any bound KKK, P(∣(Wt+h−Wt)/h∣≤K)=P(∣Z∣≤Kh)→0\mathbb{P}(|(W_{t+h} - W_t)/h| \le K) = \mathbb{P}(|Z| \le K\sqrt{h}) \to 0P(∣(Wt+h​−Wt​)/h∣≤K)=P(∣Z∣≤Kh​)→0 as h↓0h \downarrow 0h↓0.

Quadratic and total variation

Take partitions 0=t0<t1<⋯<tn=t0 = t_0 < t_1 < \cdots < t_n = t0=t0​<t1​<⋯<tn​=t with mesh δn=max⁡i(ti+1−ti)→0\delta_n = \max_i (t_{i+1} - t_i) \to 0δn​=maxi​(ti+1​−ti​)→0, write ΔWi=Wti+1−Wti\Delta W_i = W_{t_{i+1}} - W_{t_i}ΔWi​=Wti+1​​−Wti​​, Δti=ti+1−ti\Delta t_i = t_{i+1} - t_iΔti​=ti+1​−ti​, and Qn=∑i(ΔWi)2Q_n = \sum_i (\Delta W_i)^2Qn​=∑i​(ΔWi​)2. The theorem is that Qn→tQ_n \to tQn​→t in L2L^2L2; one writes [W]t=t[W]_t = t[W]t​=t. The proof is short. Since ΔWi∼N(0,Δti)\Delta W_i \sim N(0, \Delta t_i)ΔWi​∼N(0,Δti​) independently, and Var⁡(Z2)=2σ4\operatorname{Var}(Z^2) = 2\sigma^4Var(Z2)=2σ4 for Z∼N(0,σ2)Z \sim N(0, \sigma^2)Z∼N(0,σ2),

E[Qn]=∑iΔti=t,Var⁡(Qn)=∑i2 Δti2≤2t δn⟶0.\mathbb{E}[Q_n] = \sum_i \Delta t_i = t, \qquad \operatorname{Var}(Q_n) = \sum_i 2\,\Delta t_i^2 \le 2t\,\delta_n \longrightarrow 0.E[Qn​]=i∑​Δti​=t,Var(Qn​)=i∑​2Δti2​≤2tδn​⟶0.

So E[(Qn−t)2]→0\mathbb{E}[(Q_n - t)^2] \to 0E[(Qn​−t)2]→0. (Along dyadic partitions the convergence is also almost sure.) The total variation is then infinite: Qn≤max⁡i∣ΔWi∣⋅∑i∣ΔWi∣Q_n \le \max_i |\Delta W_i| \cdot \sum_i |\Delta W_i|Qn​≤maxi​∣ΔWi​∣⋅∑i​∣ΔWi​∣, and max⁡i∣ΔWi∣→0\max_i |\Delta W_i| \to 0maxi​∣ΔWi​∣→0 by uniform continuity of the path on [0,t][0, t][0,t], so ∑i∣ΔWi∣→∞\sum_i |\Delta W_i| \to \infty∑i​∣ΔWi​∣→∞ along a subsequence on which Qn→tQ_n \to tQn​→t almost surely. A smooth function has finite total variation and zero quadratic variation; Brownian motion has the opposite. This is why ∫H dW\int H\,dW∫HdW cannot be defined path by path as an ordinary Stieltjes integral.

Markov and strong Markov property

The time-shift invariance states the Markov property: for every fixed s≥0s \ge 0s≥0, the process (Ws+t−Ws)t≥0(W_{s+t} - W_s)_{t \ge 0}(Ws+t​−Ws​)t≥0​ is a Brownian motion independent of Fs\mathcal{F}_sFs​. Equivalently, for bounded measurable fff, E[f(Ws+t)∣Fs]=g(Ws)\mathbb{E}[f(W_{s+t}) \mid \mathcal{F}_s] = g(W_s)E[f(Ws+t​)∣Fs​]=g(Ws​) with g(x)=E[f(x+Wt)]g(x) = \mathbb{E}[f(x + W_t)]g(x)=E[f(x+Wt​)]: the forecast depends on the past only through the present value.

The strong Markov property (Hunt, 1956) allows the fixed time sss to be replaced by a stopping time τ\tauτ: on {τ<∞}\{\tau < \infty\}{τ<∞}, the process (Wτ+t−Wτ)t≥0(W_{\tau+t} - W_\tau)_{t \ge 0}(Wτ+t​−Wτ​)t≥0​ is a Brownian motion independent of Fτ\mathcal{F}_\tauFτ​. Think of it as a restart rule: whenever you stop using only the information available so far, what happens next is a fresh Brownian motion. A random time that looks into the future, such as the time of the maximum on [0,1][0, 1][0,1], does not have this property. The next lesson uses the strong Markov property at the first time the path reaches a level.

Summary

  • Brownian motion: W0=0W_0 = 0W0​=0, independent increments, Wt−Ws∼N(0,t−s)W_t - W_s \sim N(0, t-s)Wt​−Ws​∼N(0,t−s), continuous paths; equivalently, a continuous centred Gaussian process with Cov⁡(Ws,Wt)=min⁡(s,t)\operatorname{Cov}(W_s, W_t) = \min(s,t)Cov(Ws​,Wt​)=min(s,t).
  • Symmetry −Wt-W_t−Wt​, scaling c−1/2Wctc^{-1/2}W_{ct}c−1/2Wct​, time shift Ws+t−WsW_{s+t} - W_sWs+t​−Ws​ and time inversion t W1/tt\,W_{1/t}tW1/t​ are again Brownian motions; time inversion gives Wt/t→0W_t/t \to 0Wt​/t→0.
  • Paths are recurrent, obey the law of the iterated logarithm and are nowhere differentiable.
  • Quadratic variation [W]t=t[W]_t = t[W]t​=t, total variation infinite.
  • Markov property at fixed times, strong Markov property at stopping times.
Try itEstimate the covariance of Brownian motion from simulated paths in the Stochastic Models studio →
3 questions on this lesson at the end of the series →
← PreviousConditional expectation and martingalesNext →The reflection principle and first passage times
Connections
Properties of Brownian motion
Open the full graph →
Labs for this lesson
Stochastic Learning StudioBrownian Motion