Math 2.0

Probability theory and stochastic processes Martingales Theorem

Lévy's upward theorem

Builds on Conditional expectationFiltrationAlmost sure convergenceSigma-algebra

Statement

Let (Ω,ℱ,P)(\Omega, \mathcal{F}, P) be a probability space with a filtration (ℱn)n≥0(\mathcal{F}_n)_{n \ge 0}, and let ℱ∞\mathcal{F}_\infty be the σ-algebra generated by ⋃nℱn\bigcup_{n} \mathcal{F}_n. Let XX be a real random variable with E[∣X∣]<∞E[\abs{X}] < \infty. Then E[X∣ℱn]→E[X∣ℱ∞]as n→∞,E[X \mid \mathcal{F}_n] \to E[X \mid \mathcal{F}_\infty] \quad \text{as } n \to \infty, almost surely and in L1L^1, where E[⋅∣⋅]E[\cdot \mid \cdot] is the conditional expectation.

Remarks

The sequence Mn=E[X∣ℱn]M_n = E[X \mid \mathcal{F}_n] is the Doob martingale of XX, and it is uniformly integrable. By Doob's martingale convergence theorems it converges almost surely and in L1L^1 to some M∞M_\infty, which is ℱ∞\mathcal{F}_\infty-measurable. For A∈ℱmA \in \mathcal{F}_m and n≥mn \ge m, E[Mn𝟏A]=E[X𝟏A]E[M_n \mathbf{1}_A] = E[X \mathbf{1}_A], and the L1L^1 limit gives E[M∞𝟏A]=E[X𝟏A]E[M_\infty \mathbf{1}_A] = E[X \mathbf{1}_A]. A π–λ argument extends this to all A∈ℱ∞A \in \mathcal{F}_\infty, so M∞=E[X∣ℱ∞]M_\infty = E[X \mid \mathcal{F}_\infty]. Taking X=𝟏AX = \mathbf{1}_A with A∈ℱ∞A \in \mathcal{F}_\infty gives Lévy's zero–one law: P(A∣ℱn)→𝟏AP(A \mid \mathcal{F}_n) \to \mathbf{1}_A almost surely.

Going deeper

For a student

The theorem is a probabilistic counterpart of the Lebesgue differentiation theorem. On [0,1)[0, 1) with the dyadic filtration, E[X∣ℱn]E[X \mid \mathcal{F}_n] is the average of XX over the dyadic interval of length 2−n2^{-n} containing the point. Lévy's zero–one law follows at once, and it gives Kolmogorov's zero–one law for tail events of independent sequences. A companion result, Lévy's downward theorem, treats decreasing families of σ-algebras.

Reading path

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

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

Further reading

  1. Web https://en.wikipedia.org/wiki/Doob%27s_martingale_convergence_theorems
About this page
TagW01FD2A8NK
URIm2://W01FD2A8NK
Kindstatement, theorem
WritingW0 stub
MSC60G42
StatusThis copy of the site has no build data. Run m2 status W01FD2A8NK.
AboutConditional expectation, Martingale
UsesConditional expectation, Filtration, Almost sure convergence, Sigma-algebra
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.