Bichteler-Dellacherie theorem 2026-10-05
An adapted càdlàg process is a semimartingale exactly when it is a good integrator: on each finite horizon, for every sequence of bounded elementary predictable processes with stopping-time intervals whose deterministic uniform bounds tend to zero, the elementary terminal integrals tend to zero in probability. The elementary integral is a finite sum of measurable coefficients times subsequent increments; the characterization says precisely when this operation extends continuously to stochastic integration. The theorem is used here as a standard characterization, not proved from first principles.
Càdlàg martingale 2026-10-06
A càdlàg martingale is a continuous-time martingale represented by a càdlàg process: its paths are right-continuous and have finite left limits at positive times, on one common probability-one event. This path regularity permits approximation of stopping times from above.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 35 1 a Solution Created 2026-10-03 Updated 2026-10-14
Relative to a filtration satisfying the usual conditions, a local martingale is an adapted càdlàg process for which there exist increasing stopping times almost surely such that every stopped process is an integrable martingale. Thus, for ,The sequence is a localizing sequence. A continuous local martingale additionally has continuous sample paths. The usual definition entails integrability of the initial value; local martingales need not be integrable at later times without stopping.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 202 1 i Solution Created 2026-10-03 Updated 2026-10-05
Let be the predictable sigma-algebra on , generated by with and with . A stochastic process is previsible precisely when is -measurable.
Every left-continuous adapted process is previsible. Indeed, on intervals , put , and put . Each approximation is a predictable process, since its coefficient is -measurable; left continuity gives for every , so measurability passes to the limit.
An adapted càdlàg process need not be previsible. For a concrete example, let take values with equal probabilities, let be trivial for and for , and set . This is an adapted càdlàg process, but is not -measurable, where . Sections at time of the generators of all belong to , so every predictable process has an -measurable value there; this proves the counterexample directly.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 202 2 a Solution Created 2026-09-24 Updated 2026-10-03
A càdlàg process is a finite-variation process when, almost surely, for every ,where the supremum is over every finite partition of an interval .