Solution: Variance Is a Submartingale — Doob's Decomposition
Part 1
By conditional Jensen on the convex function ϕ(x)=x2:
E[Mn+12∣Fn]≥(E[Mn+1∣Fn])2=Mn2,
where the equality uses the
martingale property E[Mn+1∣Fn]=Mn and the
convexity of
x2 drives the inequality. Both are needed: convexity alone would give a bound but not identify the pointwise lower bound as
Mn2; the martingale property pins down that lower bound.
Part 2
An=∑k=1nE[Mk2−Mk−12∣Fk−1]. Expand:
Mk2−Mk−12=(Mk−Mk−1)2+2Mk−1(Mk−Mk−1).
Take conditional expectation: the second term vanishes because Mk−1 is Fk−1-measurable and E[Mk−Mk−1∣Fk−1]=0 (martingale property). So:
E[Mk2−Mk−12∣Fk−1]=E[(Mk−Mk−1)2∣Fk−1]=Var(Mk−Mk−1∣Fk−1).
(The last equality uses that the conditional mean of Mk−Mk−1 given Fk−1 is zero, by the martingale property.)
Therefore:
An=⟨M⟩n:=k=1∑nVar(Mk−Mk−1∣Fk−1).
Part 3
Shown above: ⟨M⟩n=∑k=1nE[(Mk−Mk−1)2∣Fk−1].
Part 4
For the symmetric random walk, the increments are i.i.d. ±1, independent of Fk−1, so:
Var(Sk−Sk−1∣Fk−1)=Var(Xk)=1.
Summing: ⟨S⟩n=n.
The martingale part is Yn=Sn2−n. A direct check:
E[Yn+1∣Fn]=E[Sn+12∣Fn]−(n+1)=(Sn2+1)−(n+1)=Yn.
So Sn2−n is a martingale — the discrete analogue of the continuous-time fact that Wt2−t is a martingale, and the content of "Brownian motion has quadratic variation t."
Takeaways
- Any square-integrable martingale has two structural pieces: the martingale itself and its predictable quadratic variation ⟨M⟩n, which measures the cumulative conditional variance.
- Doob's decomposition is the discrete precursor of the Doob-Meyer decomposition for continuous-time submartingales, itself the precursor of the stochastic-integral decomposition for semimartingales.
- Mn2−⟨M⟩n is always a martingale. This is the workhorse identity for computing variances of martingale integrals and for bounding martingale deviations via L2 methods.
- For a random walk ⟨S⟩n=n. The accumulation of variance at unit rate is the defining property — and it is what (dW)2=dt encodes in continuous time.