Math 2.0

Probability theory and stochastic processes Martingales Theorem

Doob decomposition theorem

Builds on MartingaleSubmartingaleAdapted processFiltrationConditional expectation

Statement

Let (Xn)n≥0(X_n)_{n \ge 0} be a sequence of real random variables, adapted to a filtration (ℱn)n≥0(\mathcal{F}_n)_{n \ge 0}, with E[∣Xn∣]<∞E[\abs{X_n}] < \infty for all nn. Then there are a martingale (Mn)n≥0(M_n)_{n \ge 0} and a sequence (An)n≥0(A_n)_{n \ge 0} of integrable random variables with A0=0A_0 = 0 and AnA_n ℱn−1\mathcal{F}_{n-1}-measurable for n≥1n \ge 1, such that Xn=Mn+Anfor all n≥0.X_n = M_n + A_n \quad \text{for all } n \ge 0. This decomposition is unique up to equality almost surely. Explicitly, An=∑k=1n(E[Xk∣ℱk−1]−Xk−1).A_n = \sum_{k=1}^{n} \bigl(E[X_k \mid \mathcal{F}_{k-1}] - X_{k-1}\bigr). Moreover, (An)(A_n) is almost surely non-decreasing if and only if (Xn)(X_n) is a submartingale.

Remarks

Existence: with AnA_n as above, Mn=Xn−AnM_n = X_n - A_n satisfies E[Mn−Mn−1∣ℱn−1]=E[Xn∣ℱn−1]−Xn−1−(An−An−1)=0E[M_n - M_{n-1} \mid \mathcal{F}_{n-1}] = E[X_n \mid \mathcal{F}_{n-1}] - X_{n-1} - (A_n - A_{n-1}) = 0. Uniqueness: if Mn+An=Mn′+An′M_n + A_n = M'_n + A'_n, then M−M′M - M' is a martingale that is predictable, so Mn−Mn′=E[Mn−Mn′∣ℱn−1]=Mn−1−Mn−1′M_n - M'_n = E[M_n - M'_n \mid \mathcal{F}_{n-1}] = M_{n-1} - M'_{n-1}, and it is constant equal to 00. Example: for the simple symmetric random walk SnS_n, Sn2=(Sn2−n)+nS_n^2 = (S_n^2 - n) + n, so An=nA_n = n. A sequence (An)(A_n) with AnA_n ℱn−1\mathcal{F}_{n-1}-measurable is called predictable. Without the predictability of AA the decomposition is not unique: Xn=0+XnX_n = 0 + X_n is another split into a martingale and an adapted process.

Going deeper

For a student

The predictable part AA of M2M^2 for a square-integrable martingale MM is the predictable quadratic variation ⟨M⟩\langle M \rangle, a basic tool for martingale central limit theorems and stochastic integration. The decomposition is the discrete-time model for the Doob–Meyer decomposition theorem, whose continuous-time proof is much harder. It is also the discrete form of the split of a semimartingale into a local martingale and a finite variation part.

Reading path

To understand this page from the ground up, read these 53 pages in order. The foundations come first.

  1. Adapted process concept
  2. Construction of the reals from Cauchy sequences concept
  3. Convex function definition
  4. Element definition
  5. Filtration concept
  6. Integers object
  7. Ordered field definition
  8. Proposition concept
  9. Random experiment concept
  10. Rational numbers object
  11. Real numbers object
  12. Jensen's inequality statement
  13. Set definition
  14. Ring of integers statement
  15. Disjunction definition
  16. Implication definition
  17. Predicate definition
  18. Ordered pair definition
  19. Union definition
  20. Sample space definition
  21. Existential quantifier definition
  22. Universal quantifier definition
  23. The rationals form a field statement
  24. Cartesian product definition
  25. Subset definition
  26. Uniqueness quantifier definition
  27. The rationals form an ordered field statement
  28. Binary relation definition
  29. Power set definition
  30. Universal set definition
  31. Order on the reals definition
  32. Function definition
  33. Complement definition
  34. Interval definition
  35. Injective function definition
  36. Preimage of a set definition
  37. Sigma-algebra definition
  38. Countable set definition
  39. Event definition
  40. Borel sigma-algebra definition
  41. Probability axioms concept
  42. Probability measure definition
  43. Probability space definition
  44. Conditional probability definition
  45. Random variable definition
  46. Discrete random variable definition
  47. Stochastic process concept
  48. Random variable with a density definition
  49. Expected value definition
  50. Conditional expectation definition
  51. Martingale definition
  52. Submartingale definition
  53. Doob decomposition theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Doob_decomposition_theorem
About this page
TagYHSSQ67GDS
URIm2://YHSSQ67GDS
Kindstatement, theorem
WritingW0 stub
MSC60G42
StatusThis copy of the site has no build data. Run m2 status YHSSQ67GDS.
AboutMartingale, Submartingale
UsesMartingale, Submartingale, Adapted process, Filtration, Conditional expectation
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.