Math 2.0

Probability theory and stochastic processes Proof

Proof that convergence in probability implies convergence in distribution

Builds on Convergence in probabilityConvergence in distributionCumulative distribution functionBoole's inequality

Proof

We sandwich Fn(x)F_n(x) between values of FF near xx.

  1. Let F,F1,F2,…F, F_1, F_2, \dots be the cumulative distribution functions of X,X1,X2,…X, X_1, X_2, \dots. Fix a point x∈ℝx \in \R at which FF is continuous, and fix ε>0\varepsilon > 0.
  2. Claim: {Xn≤x}⊆{X≤x+ε}∪{∣Xn−X∣>ε}\set{X_n \le x} \subseteq \set{X \le x + \varepsilon} \cup \set{\abs{X_n - X} > \varepsilon}. If Xn≤xX_n \le x and X>x+εX > x + \varepsilon, then X−Xn>εX - X_n > \varepsilon.
  3. By step 2 and Boole's inequality, Fn(x)≤F(x+ε)+P(∣Xn−X∣>ε)F_n(x) \le F(x + \varepsilon) + P(\abs{X_n - X} > \varepsilon).
  4. Claim: {X≤x−ε}⊆{Xn≤x}∪{∣Xn−X∣>ε}\set{X \le x - \varepsilon} \subseteq \set{X_n \le x} \cup \set{\abs{X_n - X} > \varepsilon}. If X≤x−εX \le x - \varepsilon and Xn>xX_n > x, then Xn−X>εX_n - X > \varepsilon.
  5. By step 4 and Boole's inequality, F(x−ε)≤Fn(x)+P(∣Xn−X∣>ε)F(x - \varepsilon) \le F_n(x) + P(\abs{X_n - X} > \varepsilon).
  6. By convergence in probability, P(∣Xn−X∣>ε)→0P(\abs{X_n - X} > \varepsilon) \to 0 as n→∞n \to \infty.
  7. Steps 3, 5 and 6 give F(x−ε)≤lim inf⁡nFn(x)≤lim sup⁡nFn(x)≤F(x+ε)F(x - \varepsilon) \le \liminf_{n} F_n(x) \le \limsup_{n} F_n(x) \le F(x + \varepsilon).
  8. Step 7 holds for every ε>0\varepsilon > 0. Since FF is continuous at xx, F(x−ε)→F(x)F(x - \varepsilon) \to F(x) and F(x+ε)→F(x)F(x + \varepsilon) \to F(x) as ε→0+\varepsilon \to 0^+.
  9. So lim inf⁡nFn(x)=lim sup⁡nFn(x)=F(x)\liminf_n F_n(x) = \limsup_n F_n(x) = F(x), that is, Fn(x)→F(x)F_n(x) \to F(x).
  10. This holds at every continuity point xx of FF. So Xn→XX_n \to X in distribution.

Idea

If XnX_n is within ε\varepsilon of XX with high probability, then the event Xn≤xX_n \le x is squeezed between X≤x−εX \le x - \varepsilon and X≤x+εX \le x + \varepsilon, up to a small error. At a continuity point of FF, both bounds come together as ε\varepsilon shrinks.

Reading path

To understand this page from the ground up, read these 66 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the probability of the complement, Proof of Boole's inequality by disjoint pieces, 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. Probability distribution definition
  51. The reals form an ordered field statement
  52. Random variable definition
  53. Proof of the approximation property of the supremum proof
  54. Convergence in probability definition
  55. Cumulative distribution function definition
  56. Approximation property of the supremum statement
  57. Convergence in distribution definition
  58. Proof that the reals are Archimedean from the completeness axiom proof
  59. The reals are Archimedean statement
  60. Proof of the probability of the complement proof
  61. Probability of the complement statement
  62. Proof of the monotonicity of probability proof
  63. Monotonicity of probability statement
  64. Proof of Boole's inequality by disjoint pieces proof
  65. Boole's inequality statement
  66. Proof that convergence in probability implies convergence in distribution 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 in probability implies convergence in distribution
About this page
TagQC1D2SRDFX
URIm2://QC1D2SRDFX
Kindproof
WritingW0 stub
MSC60F05
ProvesConvergence in probability implies convergence in distribution
UsesConvergence in probability, Convergence in distribution, Cumulative distribution function, Boole's inequality
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.