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.
- Let and be probability distributions on with its Borel σ-algebra . Assume for all .
- Let . It is nonempty, and . So is a π-system.
- Let be the smallest σ-algebra on that contains .
- Each is closed, because its complement is open. So , and hence .
- Let . Then lies in . The same formula with gives .
- We claim . Each set on the right lies in . If , the Archimedean property gives with , so .
- By steps 5 and 6, every open interval with lies in .
- Let be open. Let be the set of pairs with and .
- The set is countable, so is countable. An injection of into restricts to , so is countable.
- We claim . The inclusion holds by the choice of .
- For , let . Since is open in , there is with .
- By the density of the rationals, there are rationals and with . Then and .
- By steps 7, 9 and 10, is a countable union of sets in , or . So .
- Thus is a σ-algebra that contains every open set, so . With step 4, .
- Let . By the hypothesis, .
- The triples and are probability spaces, because and are probability measures. So the results on probability spaces apply to them.
- , because .
- Let with . By monotonicity of probability, . So .
- Let be sets in with union . By continuity from below, . So .
- By steps 17 to 19, is a Dynkin system on .
- By Dynkin's π-λ theorem and steps 2, 15 and 20, .
- By step 14, . So for each Borel set .
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.
- Construction of the reals from Cauchy sequences concept
- Definition by recursion concept
- Divisibility definition
- Dynkin system concept
- Element definition
- Integers object
- Mathematical induction concept
- Natural numbers object
- Ordered field definition
- Peano axioms concept
- Pi-system concept
- Probability measure concept
- Proposition concept
- Random experiment concept
- Rational numbers object
- Real numbers object
- Set bounded above definition
- Sigma-algebra concept
- Set definition
- Ring of integers statement
- Archimedean ordered field definition
- Successor function definition
- Dynkin's π-λ theorem statement
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- The reals form a field statement
- Supremum definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Intersection definition
- Union definition
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Sample space definition
- The rationals form a field statement
- Existential quantifier definition
- Universal quantifier definition
- Completeness axiom statement
- Cartesian product definition
- Proof of the commutativity of addition by induction proof
- Union of a family of sets definition
- Subset definition
- Order on the natural numbers definition
- The rationals form an ordered field statement
- Uniqueness quantifier definition
- Binary relation definition
- Universal set definition
- Topological space definition
- Order on the reals definition
- Power set definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Complement definition
- Function definition
- Interval definition
- Strong induction statement
- Preorder definition
- Sigma-algebra definition
- Image of a set definition
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Proof of the well-ordering principle from strong induction proof
- Metric space definition
- Partial order definition
- Pi-system definition
- Surjective function definition
- Dynkin system definition
- Event definition
- Left inverse definition
- Right inverse definition
- Proof that a composition of injections is injective proof
- Well-ordering principle statement
- Countable set definition
- Borel sigma-algebra definition
- Open ball definition
- Total order definition
- Bijective function definition
- Probability axioms concept
- Composition of injections is injective statement
- Metric topology definition
- Proof of the division algorithm proof
- Cantor pairing function example
- Countably infinite set definition
- Proof of the Schröder–Bernstein theorem proof
- Probability measure definition
- Open set definition
- Division algorithm statement
- Proof that a function is bijective iff it has a two-sided inverse proof
- Proof that the reals form an ordered field, with the Cauchy sequence construction proof
- Closed set definition
- Proof that the integers are countable proof
- Schröder–Bernstein theorem statement
- Proof that the product of countable sets is countable proof
- Probability space definition
- Bijective iff it has a two-sided inverse statement
- Probability distribution definition
- The reals form an ordered field statement
- The integers are countable statement
- Product of countable sets is countable statement
- Proof of the approximation property of the supremum proof
- Proof that the rationals are countable proof
- Approximation property of the supremum statement
- The rationals are countable statement
- Proof that the reals are Archimedean from the completeness axiom proof
- The reals are Archimedean statement
- Floor function definition
- Proof of the probability of the complement proof
- Proof that there is a natural number n with 1/n below any positive epsilon proof
- There is a natural number n with 1/n below any positive epsilon statement
- Probability of the complement statement
- Proof of the characterization of the floor proof
- Characterization of the floor statement
- Proof of the monotonicity of probability proof
- Monotonicity of probability statement
- Proof of the density of the rationals proof
- Proof of the continuity of probability measures proof
- Density of the rationals statement
- Continuity of probability measures statement
- Proof that the cumulative distribution function determines the distribution, by the π-λ theorem proof
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | EPTH7116AX |
|---|---|
| URI | m2://EPTH7116AX |
| Kind | proof |
| Writing | W0 stub |
| MSC | 60E05 |
| Proves | The cumulative distribution function determines the distribution |
| Uses | Probability 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 |
| Changed | 4 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.