Math 2.0

Probability theory and stochastic processes Proof

Proof that the cumulative distribution function determines the distribution, by the π-λ theorem

Builds on Probability distributionProbability measureProbability spaceBorel sigma-algebraSigma-algebraPi-systemDynkin systemDynkin's π-λ theoremMonotonicity of probabilityContinuity of probability measuresOpen setClosed setThe reals are ArchimedeanDensity of the rationalsThe rationals are countableProduct of countable sets is countableCountable set

Proof

We show that the half-lines form a π-system that generates the Borel sets, and then apply Dynkin's π-λ theorem.

  1. Let μ\mu and ν\nu be probability distributions on ℝ\R with its Borel σ-algebra ℬ(ℝ)\mathcal{B}(\R). Assume μ((−∞,x])=ν((−∞,x])\mu((-\infty, x]) = \nu((-\infty, x]) for all x∈ℝx \in \R.
  2. Let 𝒫={(−∞,x]:x∈ℝ}\mathcal{P} = \set{(-\infty, x] : x \in \R}. It is nonempty, and (−∞,x]∩(−∞,y]=(−∞,min⁡(x,y)]∈𝒫(-\infty, x] \cap (-\infty, y] = (-\infty, \min(x, y)] \in \mathcal{P}. So 𝒫\mathcal{P} is a π-system.
  3. Let σ(𝒫)\sigma(\mathcal{P}) be the smallest σ-algebra on ℝ\R that contains 𝒫\mathcal{P}.
  4. Each (−∞,x](-\infty, x] is closed, because its complement (x,∞)(x, \infty) is open. So (−∞,x]∈ℬ(ℝ)(-\infty, x] \in \mathcal{B}(\R), and hence σ(𝒫)⊆ℬ(ℝ)\sigma(\mathcal{P}) \subseteq \mathcal{B}(\R).
  5. Let a<ba < b. Then (a,b]=(−∞,b]∩(−∞,a]c(a, b] = (-\infty, b] \cap (-\infty, a]^c lies in σ(𝒫)\sigma(\mathcal{P}). The same formula with b≤ab \le a gives ∅∈σ(𝒫)\varnothing \in \sigma(\mathcal{P}).
  6. We claim (a,b)=⋃n≥1(a,b−1/n](a, b) = \bigcup_{n \ge 1} (a, b - 1/n]. Each set on the right lies in (a,b)(a, b). If a<x<ba < x < b, the Archimedean property gives nn with n(b−x)>1n (b - x) > 1, so x≤b−1/nx \le b - 1/n.
  7. By steps 5 and 6, every open interval (a,b)(a, b) with a<ba < b lies in σ(𝒫)\sigma(\mathcal{P}).
  8. Let U⊆ℝU \subseteq \R be open. Let JJ be the set of pairs (q,r)∈ℚ×ℚ(q, r) \in \Q \times \Q with q<rq < r and (q,r)⊆U(q, r) \subseteq U.
  9. The set ℚ\Q is countable, so ℚ×ℚ\Q \times \Q is countable. An injection of ℚ×ℚ\Q \times \Q into ℕ\N restricts to JJ, so JJ is countable.
  10. We claim U=⋃(q,r)∈J(q,r)U = \bigcup_{(q, r) \in J} (q, r). The inclusion ⊇\supseteq holds by the choice of JJ.
  11. For ⊆\subseteq, let x∈Ux \in U. Since UU is open in ℝ\R, there is ε>0\varepsilon > 0 with (x−ε,x+ε)⊆U(x - \varepsilon, x + \varepsilon) \subseteq U.
  12. By the density of the rationals, there are rationals qq and rr with x−ε<q<x<r<x+εx - \varepsilon < q < x < r < x + \varepsilon. Then (q,r)∈J(q, r) \in J and x∈(q,r)x \in (q, r).
  13. By steps 7, 9 and 10, UU is a countable union of sets in σ(𝒫)\sigma(\mathcal{P}), or U=∅U = \varnothing. So U∈σ(𝒫)U \in \sigma(\mathcal{P}).
  14. Thus σ(𝒫)\sigma(\mathcal{P}) is a σ-algebra that contains every open set, so ℬ(ℝ)⊆σ(𝒫)\mathcal{B}(\R) \subseteq \sigma(\mathcal{P}). With step 4, σ(𝒫)=ℬ(ℝ)\sigma(\mathcal{P}) = \mathcal{B}(\R).
  15. Let 𝒟={B∈ℬ(ℝ):μ(B)=ν(B)}\mathcal{D} = \set{B \in \mathcal{B}(\R) : \mu(B) = \nu(B)}. By the hypothesis, 𝒫⊆𝒟\mathcal{P} \subseteq \mathcal{D}.
  16. The triples (ℝ,ℬ(ℝ),μ)(\R, \mathcal{B}(\R), \mu) and (ℝ,ℬ(ℝ),ν)(\R, \mathcal{B}(\R), \nu) are probability spaces, because μ\mu and ν\nu are probability measures. So the results on probability spaces apply to them.
  17. ℝ∈𝒟\R \in \mathcal{D}, because μ(ℝ)=1=ν(ℝ)\mu(\R) = 1 = \nu(\R).
  18. Let A,B∈𝒟A, B \in \mathcal{D} with A⊆BA \subseteq B. By monotonicity of probability, μ(B∖A)=μ(B)−μ(A)=ν(B)−ν(A)=ν(B∖A)\mu(B \setminus A) = \mu(B) - \mu(A) = \nu(B) - \nu(A) = \nu(B \setminus A). So B∖A∈𝒟B \setminus A \in \mathcal{D}.
  19. Let A1⊆A2⊆⋯A_1 \subseteq A_2 \subseteq \cdots be sets in 𝒟\mathcal{D} with union AA. By continuity from below, μ(A)=lim⁡nμ(An)=lim⁡nν(An)=ν(A)\mu(A) = \lim_n \mu(A_n) = \lim_n \nu(A_n) = \nu(A). So A∈𝒟A \in \mathcal{D}.
  20. By steps 17 to 19, 𝒟\mathcal{D} is a Dynkin system on ℝ\R.
  21. By Dynkin's π-λ theorem and steps 2, 15 and 20, σ(𝒫)⊆𝒟\sigma(\mathcal{P}) \subseteq \mathcal{D}.
  22. By step 14, ℬ(ℝ)⊆𝒟\mathcal{B}(\R) \subseteq \mathcal{D}. So μ(B)=ν(B)\mu(B) = \nu(B) for each Borel set B⊆ℝB \subseteq \R.

Idea

The sets on which two probability measures agree are closed under differences of nested sets and increasing unions, so they form a Dynkin system. The half-lines are closed under intersection and generate all Borel sets. Dynkin's π-λ theorem then spreads the agreement from the half-lines to all Borel sets.

Reading path

To understand this page from the ground up, read these 128 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the commutativity of addition by induction, Proof of the continuity of probability measures, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that a composition of injections is injective, Proof of the probability of the complement, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that the product of countable sets is countable, Proof of the Schröder–Bernstein theorem, Proof that the integers are countable, Proof of strong induction from ordinary induction, Proof of the density of the rationals, Proof of the monotonicity of probability, Proof that the rationals are countable, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof that the reals are Archimedean from the completeness axiom, Proof of the characterization of the floor.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Divisibility definition
  4. Dynkin system concept
  5. Element definition
  6. Integers object
  7. Mathematical induction concept
  8. Natural numbers object
  9. Ordered field definition
  10. Peano axioms concept
  11. Pi-system concept
  12. Probability measure concept
  13. Proposition concept
  14. Random experiment concept
  15. Rational numbers object
  16. Real numbers object
  17. Set bounded above definition
  18. Sigma-algebra concept
  19. Set definition
  20. Ring of integers statement
  21. Archimedean ordered field definition
  22. Successor function definition
  23. Dynkin's π-λ theorem statement
  24. Conjunction definition
  25. Disjunction definition
  26. Implication definition
  27. Predicate definition
  28. The reals form a field statement
  29. Supremum definition
  30. Empty set object
  31. Family of sets definition
  32. Ordered pair definition
  33. Intersection definition
  34. Union definition
  35. Addition of natural numbers definition
  36. The successor function is injective statement
  37. Zero is not a successor statement
  38. Sample space definition
  39. The rationals form a field statement
  40. Existential quantifier definition
  41. Universal quantifier definition
  42. Completeness axiom statement
  43. Cartesian product definition
  44. Proof of the commutativity of addition by induction proof
  45. Union of a family of sets definition
  46. Subset definition
  47. Order on the natural numbers definition
  48. The rationals form an ordered field statement
  49. Uniqueness quantifier definition
  50. Binary relation definition
  51. Universal set definition
  52. Topological space definition
  53. Order on the reals definition
  54. Power set definition
  55. Commutativity of addition statement
  56. Proof of strong induction from ordinary induction proof
  57. Antisymmetric relation definition
  58. Reflexive relation definition
  59. Transitive relation definition
  60. Complement definition
  61. Function definition
  62. Interval definition
  63. Strong induction statement
  64. Preorder definition
  65. Sigma-algebra definition
  66. Image of a set definition
  67. Codomain definition
  68. Function composition definition
  69. Identity function definition
  70. Injective function definition
  71. Proof of the well-ordering principle from strong induction proof
  72. Metric space definition
  73. Partial order definition
  74. Pi-system definition
  75. Surjective function definition
  76. Dynkin system definition
  77. Event definition
  78. Left inverse definition
  79. Right inverse definition
  80. Proof that a composition of injections is injective proof
  81. Well-ordering principle statement
  82. Countable set definition
  83. Borel sigma-algebra definition
  84. Open ball definition
  85. Total order definition
  86. Bijective function definition
  87. Probability axioms concept
  88. Composition of injections is injective statement
  89. Metric topology definition
  90. Proof of the division algorithm proof
  91. Cantor pairing function example
  92. Countably infinite set definition
  93. Proof of the Schröder–Bernstein theorem proof
  94. Probability measure definition
  95. Open set definition
  96. Division algorithm statement
  97. Proof that a function is bijective iff it has a two-sided inverse proof
  98. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  99. Closed set definition
  100. Proof that the integers are countable proof
  101. Schröder–Bernstein theorem statement
  102. Proof that the product of countable sets is countable proof
  103. Probability space definition
  104. Bijective iff it has a two-sided inverse statement
  105. Probability distribution definition
  106. The reals form an ordered field statement
  107. The integers are countable statement
  108. Product of countable sets is countable statement
  109. Proof of the approximation property of the supremum proof
  110. Proof that the rationals are countable proof
  111. Approximation property of the supremum statement
  112. The rationals are countable statement
  113. Proof that the reals are Archimedean from the completeness axiom proof
  114. The reals are Archimedean statement
  115. Floor function definition
  116. Proof of the probability of the complement proof
  117. Proof that there is a natural number n with 1/n below any positive epsilon proof
  118. There is a natural number n with 1/n below any positive epsilon statement
  119. Probability of the complement statement
  120. Proof of the characterization of the floor proof
  121. Characterization of the floor statement
  122. Proof of the monotonicity of probability proof
  123. Monotonicity of probability statement
  124. Proof of the density of the rationals proof
  125. Proof of the continuity of probability measures proof
  126. Density of the rationals statement
  127. Continuity of probability measures statement
  128. Proof that the cumulative distribution function determines the distribution, by the π-λ theorem proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Pi-system
About this page
TagEPTH7116AX
URIm2://EPTH7116AX
Kindproof
WritingW0 stub
MSC60E05
ProvesThe cumulative distribution function determines the distribution
UsesProbability distribution, Probability measure, Probability space, Borel sigma-algebra, Sigma-algebra, Pi-system, Dynkin system, Dynkin's π-λ theorem, Monotonicity of probability, Continuity of probability measures, Open set, Closed set, The reals are Archimedean, Density of the rationals, The rationals are countable, Product of countable sets is countable, Countable set
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)
  • 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.