Past exam of the mathematics course of the University of Cambridge / 2009 / iii / Paper 29 / 1 / a

The previsible sigma-algebra $\mathcal{P}$ on $\Omega \times [0,\infty )$ is generated by $E\times \{0\}$ with $E\in {\mathcal{F}}_0$ and by $E\times (s,t]$ with $E\in {\mathcal{F}}_s$, $0\le s<t$. Equivalently it is the smallest sigma-algebra making every left-continuous adapted process measurable. A previsible process is a process measurable for $\mathcal{P}$.

A bounded simple predictable process has finitely many time intervals and bounded coefficients known at their left endpoints. One may use deterministic endpoints, or the customary more general elementary predictable process with stopping-time intervals:A bounded ${\mathcal{F}}_0$-measurable value at time zero may be added; it does not affect integration against a continuous martingale. A process with finite support is included by adding a zero coefficient on its terminal interval. Both versions of simple processes satisfy the arguments below. The elementary stochastic integral isWhen a stopping time is infinite, use the terminal value $M_{\infty }$, which exists in $L^2$ and almost surely for an L2-bounded continuous martingale. Refining intervals leaves this definition unchanged.

For a continuous local martingale $M$, its quadratic variation $[M]$ is the unique continuous adapted nondecreasing process starting at zero such that $(M_t-M_0{)}^2-[M{]}_t$ is a local martingale. It is predictable because it is continuous and adapted. To recover it from the path, use refining deterministic grids, for example $t_k^{(n)}=k{2}^{-n}$, and formOnly finitely many increments are nonzero on a compact time interval. ThenIn particular each fixed-time sum converges in probability, and a suitable subsequence converges uniformly on compact intervals almost surely. The partial last grid interval is included in this path approximation.