Math 2.0

Probability theory and stochastic processes Proof

Proof that almost sure convergence implies convergence in probability

Builds on Almost sure convergenceConvergence in probabilityContinuity of probability measures

Proof

We bound the event of a large deviation at time nn by the event of a large deviation at some time m≥nm \ge n.

  1. Let C={ω∈Ω:lim⁡n→∞Xn(ω)=X(ω)}C = \set{\omega \in \Omega : \lim_{n \to \infty} X_n(\omega) = X(\omega)}. By almost sure convergence, P(C)=1P(C) = 1.
  2. Fix ε>0\varepsilon > 0. For n≥1n \ge 1, let An=⋃m≥n{∣Xm−X∣>ε}A_n = \bigcup_{m \ge n} \set{\abs{X_m - X} > \varepsilon}. Each AnA_n is an event, as a countable union of events.
  3. The sets decrease: A1⊇A2⊇⋯A_1 \supseteq A_2 \supseteq \cdots, because the union defining An+1A_{n+1} runs over fewer indices. Let A=⋂n≥1AnA = \bigcap_{n \ge 1} A_n.
  4. Claim: A∩C=∅A \cap C = \varnothing. Let ω∈C\omega \in C. Since Xm(ω)→X(ω)X_m(\omega) \to X(\omega), there is NN with ∣Xm(ω)−X(ω)∣≤ε\abs{X_m(\omega) - X(\omega)} \le \varepsilon for all m≥Nm \ge N.
  5. Then ω∉AN\omega \notin A_N, so ω∉A\omega \notin A. This proves the claim.
  6. By step 4, A⊆Ω∖CA \subseteq \Omega \setminus C. So P(A)≤1−P(C)=0P(A) \le 1 - P(C) = 0.
  7. By the continuity of probability from above, P(An)→P(A)=0P(A_n) \to P(A) = 0.
  8. For each nn, {∣Xn−X∣>ε}⊆An\set{\abs{X_n - X} > \varepsilon} \subseteq A_n, since m=nm = n appears in the union. So 0≤P(∣Xn−X∣>ε)≤P(An)0 \le P(\abs{X_n - X} > \varepsilon) \le P(A_n).
  9. By steps 7 and 8, P(∣Xn−X∣>ε)→0P(\abs{X_n - X} > \varepsilon) \to 0. Since ε>0\varepsilon > 0 was arbitrary, Xn→XX_n \to X in probability.

Idea

If XnX_n is far from XX at time nn, then it is far from XX at some time after nn. The events "far at some time after nn" shrink to the event "far infinitely often", which has probability 00 when the sequence converges almost surely.

Reading path

To understand this page from the ground up, read these 65 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the continuity of probability measures, Proof of the probability of the complement, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the monotonicity of probability, Proof that the reals are Archimedean from the completeness axiom.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Ordered field definition
  5. Proposition concept
  6. Random experiment concept
  7. Rational numbers object
  8. Real numbers object
  9. Set bounded above definition
  10. Set definition
  11. Ring of integers statement
  12. Archimedean ordered field definition
  13. Disjunction definition
  14. Implication definition
  15. Predicate definition
  16. The reals form a field statement
  17. Supremum definition
  18. Ordered pair definition
  19. Union definition
  20. Sample space definition
  21. The rationals form a field statement
  22. Existential quantifier definition
  23. Universal quantifier definition
  24. Completeness axiom statement
  25. Cartesian product definition
  26. Subset definition
  27. The rationals form an ordered field statement
  28. Uniqueness quantifier definition
  29. Binary relation definition
  30. Universal set definition
  31. Order on the reals definition
  32. Power set definition
  33. Antisymmetric relation definition
  34. Reflexive relation definition
  35. Transitive relation definition
  36. Complement definition
  37. Function definition
  38. Interval definition
  39. Preorder definition
  40. Sigma-algebra definition
  41. Preimage of a set definition
  42. Partial order definition
  43. Event definition
  44. Borel sigma-algebra definition
  45. Total order definition
  46. Probability axioms concept
  47. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  48. Probability measure definition
  49. Probability space definition
  50. The reals form an ordered field statement
  51. Almost surely definition
  52. Random variable definition
  53. Proof of the approximation property of the supremum proof
  54. Almost sure convergence definition
  55. Convergence in probability definition
  56. Approximation property of the supremum statement
  57. Proof that the reals are Archimedean from the completeness axiom proof
  58. The reals are Archimedean statement
  59. Proof of the probability of the complement proof
  60. Probability of the complement statement
  61. Proof of the monotonicity of probability proof
  62. Monotonicity of probability statement
  63. Proof of the continuity of probability measures proof
  64. Continuity of probability measures statement
  65. Proof that almost sure convergence implies convergence in probability proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Proofs_of_convergence_of_random_variables, Convergence almost surely implies convergence in probability
About this page
Tag9XXBTE8HDD
URIm2://9XXBTE8HDD
Kindproof
WritingW0 stub
MSC60F15
ProvesAlmost sure convergence implies convergence in probability
UsesAlmost sure convergence, Convergence in probability, Continuity of probability measures
Changed4 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)

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.