If the first variation of g is bounded, ∫abfdg is defined.
If f is differentiable, FVT(f)=∫0T∣f′(t)∣dt.
Random Walks
Symmetric random walk With coin tosses ωj, Xj=1 if ωj=H and −1 if ωj=T, M0=0 and Mk=∑j=1kXj. The increments Ml−Mk=∑j=k+1lXj over disjoint intervals are independent, with mean 0 and variance l−k, and [M,M]k=∑j=1k(Mj−Mj−1)2=k.
Scaled symmetric random walkW(n)(t)=n1Mnt (for nt an integer). Each step is ±n1, so
and as n→∞, W(n)(t)−W(n)(s)→N(0,t−s) in distribution.
Brownian Motion
W(t), t≥0, is a Brownian motion if for each ω the path t↦W(t) is continuous with W(0)=0, and for 0=t0<t1<⋯<tm the increments W(ti+1)−W(ti) are independent and N(0,ti+1−ti).
A filtration for Brownian motion is (Ft)t≥0 with
Fs⊆Ft for s≤t,
W(t) is Ft-measurable (adapted),
W(u)−W(t) is independent of Ft for 0≤t<u (independent future increments).
Properties
W is a martingale and a Markov process.
Its paths are almost surely nowhere differentiable.
[W,W](T)=T almost surely (the sums converge in L2).
In differential form, dWdW=dt, dWdt=0, dtdt=0.
Exponential Martingale and Geometric Brownian Motion
If X∼N(μ,σ2) then eX is log-normal with E[eX]=eμ+σ2/2. Hence
Z(t)=exp(σW(t)−21σ2t)
is a martingale (the exponential martingale). Geometric Brownian motion
S(t)=S(0)exp((μ−2σ2)t+σW(t))
solves dS=μSdt+σSdW, has d(logS)=(μ−2σ2)dt+σdW, E[S(t)]=S(0)eμt, and e−μtS(t) is a martingale.