How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Weak Convergence Tightness and Representation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Strong Laws of Large Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Bounded continuous tests define weak convergence. Portmanteau supplies set criteria and mapping results; compact approximation and Prokhorov characterize tightness. The Levy–Prokhorov metric and refining interval allocations give metrization and Skorokhod copies. Countable compactly supported tests establish empirical convergence. The final items construct the normal probability laws needed by the examples.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Borel probability law on a polish space
Definition
Let S be Polish in the sense of Polish spaces are separable completely metrizable spaces. A Borel probability law on S is a countably additive measure on with total mass one. Here is The Borel sigma-algebra of a topological space and probability measure means Probability measures and probability spaces. A compatible complete metric may be fixed for a construction; it is not additional data in the law. The empty space admits no such law, since its measure must be both zero and one.
Weak convergence of borel probability measures
Definition
For Borel probability measures on a metric space S, write if for every bounded continuous real function f on S. Continuity is Continuity of a map between metric spaces, at a point and globally, in the - form. Such f is Borel measurable (inverse images of open sets are open) and , so the integrals are finite in Integrable real and complex functions, and their integrals. No completeness or coupling is required.
Convergence in distribution of random elements
Definition
Random elements with values in the same metric space converge in distribution, written , if their laws from Law or distribution of a random element satisfy in Weak convergence of borel probability measures. They may be defined on different probability spaces. The definition specifies only their marginal laws.
Portmanteau theorem
Statement
For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Facts & Assumptions
, so the distance to a fixed nonempty set is -Lipschitz: Let be a metric space (def-metric-space), let be nonempty and let . Then
with the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function changes by at most between and : it is -Lipschitz.
Dominated convergence: Let and be measurable complex-valued functions such that almost everywhere and almost everywhere for a single nonnegative measurable function with . Then , and hence
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
(i) implies (ii) because a uniformly continuous function is continuous. Suppose (ii), and let F be nonempty and closed. By F1, is bounded and uniformly continuous. Moreover . Thus for every m. F2 with majorant one gives (iii) as m tends to infinity. For F empty the inequality is zero<=zero.
For G open, apply (iii) to its closed complement and use to obtain (iv). Conversely the same complement calculation obtains (iii) from (iv). If A is a Borel continuity set, and . The open lower bound and closed upper bound therefore squeeze to , proving (v).
Assume (v), and fix a bounded continuous real f and >0. The disjoint level sets with number at most r for each positive integer r. Their union over r contains all positive-mass levels and is countable (each finite subset of the real line can be listed in increasing order). Choose finitely many increasing levels outside this countable set, with , and mesh below . Such levels exist in every open interval, since an interval is uncountable.
For , continuity of f gives , so (v) applies. The simple function satisfies everywhere. Therefore . The finite sum tends to zero, by step 1.3 and (v). Letting tend to zero proves (i), closing all equivalences.
Real cdf and bounded continuous definitions agree
Statement
For real random variables, the CDF continuity-point definition of convergence in distribution agrees with weak convergence of their laws.
Facts & Assumptions
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Convergence in distribution for real random variables: For real random variables and , write , or in distribution, when at every continuity point of . Here is the CDF from def-cumulative-distribution-function-of-a-random-variable and continuity points are those of def-atom-and-continuity-point-of-a-law.
Continuity from above when one set has finite measure: Let be a decreasing sequence of measurable sets for a measure . If for some , then
Continuity from below for measures: Let be an increasing sequence of measurable sets for a measure , so . Then
No finiteness hypothesis is required.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: Let with , let be the set of functions and let be the Euclidean metric on it (lem-metrics-on-rn). Then:
- Closed boxes are compact. For reals the box is a compact subset of (def-metric-compactness).
- Heine-Borel. A subset is a compact subset of if and only if is closed in (def-metric-topology) and bounded (def-metric-bounded-diameter).
- The real line. A subset is a compact subset of , the usual metric (lem-real-line-is-a-metric-space), if and only if is closed in and bounded.
No choice principle is used. The bisection below halves one coordinate at a time and takes the left half whenever the left half still fails to be finitely covered, the right half otherwise: a rule with two outcomes, decided by a property of the box, not a selection. That is the whole reason the theorem is available in ZF, while the general "complete and totally bounded implies compact" (thm-complete-and-totally-bounded-implies-compact) is not.
The hypothesis is inherited from lem-metrics-on-rn, which defines and its metrics only there; the last remark below records what happens at .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
Use F4 for increasing rays. Use F3 for decreasing rays and intervals of finite probability. For a probability law , write . Continuity from above and below of finite measures show F is right-continuous, has limits zero and one at the two infinities, and has jump at t. Thus a continuity point has . If , F1 on gives at every such point, exactly F2.
Conversely assume convergence of CDFs at continuity points of F. Fix bounded continuous f, , and >0. Choose continuity points a<b with . They exist because tails tend to zero and the positive jumps form a countable set: at most r atoms have mass at least 1/r. CDF convergence makes the same sum of two tails less than 2eta for all large n.
The closed bounded interval is compact by F5. On [a,b], continuity is uniform: for each point choose a neighborhood on which oscillation is small, extract a finite subcover by compactness, and use the minimum of the finitely many smaller radii. Choose a finite partition by continuity points with oscillation of f on each interval below . Then converges to the corresponding mass. Integrals of the finite step approximation therefore converge. Its error inside (a,b] is at most for each law; the outside error is at most in the comparison of the two integrals, by step 1.2. Let decrease to zero. This proves weak convergence.
Weak limits are unique
Statement
Bounded continuous real tests determine Borel probability measures on any metric space. In particular, weak limits are unique.
Facts & Assumptions
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Dynkin's pi-lambda theorem: Let be a -system on . Then . Consequently, if is any lambda-system on with , then .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
If and have equal integrals of every bounded continuous test, the constant sequence converges weakly to . F1 gives for every closed F. Reverse the roles to get equality.
The class of Borel sets on which the two probabilities agree contains S, is closed under complements and disjoint countable unions, and contains the closed sets by step 1.1. Closed sets form a -system generating the Borel -algebra; F2 therefore gives equality on all Borel sets. If a sequence has two weak limits, uniqueness of each numerical integral limit gives the hypothesis of step 1.1, so those limits agree.
Continuous mapping theorem
Statement
Let S,T be metric spaces, measurable, and . If the discontinuity set is -null, then . Consequently implies whenever .
Facts & Assumptions
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Laws commute with measurable maps: Let be a random element, and let be measurable. Then is a random element and for every ,
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
For let be the union of all open subsets V of S such that the diameter of g(V) is less than 1/r. The continuity set is : continuity at x supplies such a neighborhood by making all image points within 1/(3r) of g(x); conversely a neighborhood with image diameter below forces there. Thus is Borel.
If F is closed in T and x lies outside , continuity at x and the open complement of F give a neighborhood disjoint from . Hence . Applying F1 to this closed preimage closure gives .
The inequality in step 1.2 is the closed-set bound for the pushforward probabilities, so F1 gives their weak convergence. F2 identifies these pushforwards with the laws of g() and g(X), proving the random-element formulation.
Converging together lemma
Statement
Let and be Borel-measurable random elements with values in a metric space , on the same probability space for each , and let be an -valued Borel-measurable random element. Suppose is measurable and for every >0. If , then .
Facts & Assumptions
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Continuity from above when one set has finite measure: Let be a decreasing sequence of measurable sets for a measure . If for some , then
, so the distance to a fixed nonempty set is -Lipschitz: Let be a metric space (def-metric-space), let be nonempty and let . Then
with the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function changes by at most between and : it is -Lipschitz.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
By F3, distance to nonempty is continuous; its sublevel sets are closed. For nonempty closed F put , which is closed. If lies in F and , then lies in this enlargement. Thus .
F1 and the probability hypothesis give . For , the sets decrease to F, so F2 makes their probabilities decrease to P_X(F). Empty F has probability zero without an enlargement. The resulting closed-set bound is again F1, now proving .
Tight family of probability measures
Definition
A family of Borel probabilities on a metric space S is tight if, for every , there is a compact such that for every . One K must work for the whole family. Compactness is Open cover, subcover, compact metric space, and compact subset of a metric space. The empty family is tight, witnessed by the empty compact set.
Relative sequential compactness for weak convergence
Definition
A family of Borel probabilities on a metric space is relatively sequentially compact for weak convergence if every sequence from has a subsequence converging weakly to a Borel probability on the same state space. The limit need not belong to . Weak convergence means Weak convergence of borel probability measures.
Every borel probability on a polish space is tight
Statement
Assume AC. Every Borel probability on a Polish space S is tight.
Facts & Assumptions
Assuming countable choice, Borel probability measures on Polish spaces are inner regular: Assume countable choice. If is Polish and is a Borel probability measure on , then for every Borel and there is a compact with .
Tight family of probability measures: A family of Borel probabilities on a metric space S is tight if, for every , there is a compact such that for every . One K must work for the whole family. Compactness is def-metric-compactness. The empty family is tight, witnessed by the empty compact set.
Continuity from below for measures: Let be an increasing sequence of measurable sets for a measure , so . Then
No finiteness hypothesis is required.
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then
For every one also has
including , where both sides are .
A complete, totally bounded metric space is compact, proved from countable choice used exactly once: Assume the Axiom of Countable Choice (def-countable-choice). Let be a metric space (def-metric-space) that is complete (def-complete-metric-space) and totally bounded (def-totally-bounded). Then is compact (def-metric-compactness).
Where the axiom is spent, and why the weaker principle suffices. is used exactly once, at step 3.1, to fix one finite -net together with a listing of it for every at once. The family of sets being chosen from is written down before any selection is made and does not depend on the earlier selections, which is precisely the situation countable choice covers and dependent choice (def-dependent-choice) is not needed for. Everything after step 3.1 is canonical: at each stage the construction takes the least admissible index in the listing already fixed.
As always on this page, the claim is an upper bound on the cost of the proof given here, not an assertion that is necessary for the theorem.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
AC restricted to any countable nonempty family gives countable choice. Thus F1 applies to the given Polish S and its probability . Take the Borel set A=S; for each >0 it supplies compact K with . This is F2 for the one-law family.
The complete totally bounded criterion F5 applies under countable choice, already supplied by AC in step 1.1. Use F4 on the countably many omitted sets. Use F3 on the increasing finite unions below. The compact-set construction behind this application can be made explicit. Fix a compatible complete metric and a countable dense sequence . For each , finite initial unions of open balls increase to S; choose their least length with loss below . Let be the corresponding finite union of closed balls, and . Subadditivity gives . K is closed and hence complete. For any >0 choose m with ; each selected ball meeting K contributes one point of K, and those finitely many points form an -net in K. Thus K is totally bounded and complete, hence compact, which realizes the bound in step 1.1.
Countable uniformly dense tests on a compact metric space
Statement
Assume AC. For a compact metric K, has a countable uniformly dense subset in the supremum norm.
Facts & Assumptions
A compact metric space is complete and totally bounded, and neither implication uses any choice principle: Let be a compact metric space (def-metric-compactness, def-metric-space). Then is totally bounded (def-totally-bounded) and complete (def-complete-metric-space).
Both implications are theorems of ZF. Completeness is obtained here from the finite intersection characterisation (thm-compact-iff-finite-intersection-property) applied to the closures of the tails of a Cauchy sequence, and not from the extraction of a convergent subsequence, which would route the argument through sequential compactness. What matters for the ledger is that the route taken below selects nothing at all; the first remark below says why the other route was not taken.
, so the distance to a fixed nonempty set is -Lipschitz: Let be a metric space (def-metric-space), let be nonempty and let . Then
with the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function changes by at most between and : it is -Lipschitz.
Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: Let be a compact metric space (def-metric-compactness), let be any metric space (def-metric-space) and let be continuous (def-metric-continuity). Then is uniformly continuous (def-metric-uniform-continuity).
No choice principle is used: the cover built below is cut out by a property, and the Lebesgue number lemma it is fed to is itself choice free (thm-lebesgue-number-lemma).
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
If K is empty there is one function and the assertion holds. Otherwise F1 supplies finite 1/m-nets. AC chooses these nets with finite listings; their countable union D is dense. Consider all functions , with finite lists , rational and positive integer L, optionally clipped between rational constants. These form a countable family of continuous functions; F2 with singleton sets gives the needed continuity.
Fix continuous f, >0 and . By F3 choose >0 so implies . Choose integer L with . Then obeys by y=x. For d(x,y)< the expression is at least f(x)-; for d(x,y)>= it is greater than -M+2M>=f(x). Thus .
Choose a finite net from D with mesh h< and Lh<, and rational with . For any y choose within h; uniform continuity gives . Taking the infimum over y and allowing the rational error proves . Together with step 1.2 the error from f is at most 3eta. Rational clipping bounds containing f(K) cannot increase it. Letting decrease proves density.
Probability laws on a compact metric space have weakly convergent subsequences
Statement
Assume AC. Every sequence of Borel probability laws on a compact metric K has a subsequence converging weakly to a Borel probability on K.
Facts & Assumptions
Countable uniformly dense tests on a compact metric space: Assume AC. For a compact metric K, has a countable uniformly dense subset in the supremum norm.
Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: Every bounded sequence of reals has a convergent subsequence: if is a sequence of reals and there is with for every (def-sequence), then there is a strictly increasing and a real with .
Equivalently: the subsequential limit set of a bounded sequence is nonempty (def-subsequential-limit).
The theorem is the exact repair of the false claim that a bounded sequence converges. A bounded sequence need not converge, and the alternating sequence is the standing witness; what boundedness does force is that some subsequence converges. The converse of the theorem is false, and badly so: a sequence with a convergent subsequence need not be bounded.
Positive functionals on C_c(X) are integration against a Radon measure: Let be LCH and let be positive. The Radon measure constructed above satisfies
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
K cannot be empty because the given laws have mass one. List a countable dense test family by F1. Each numerical sequence is bounded by . F2 supplies nested infinite subsequences along which the first j integrals converge. AC supplies these successive selections; taking the jth index of the jth subsequence gives one increasing diagonal subsequence with convergence for every listed test.
For any continuous f and >0 choose a listed test h with . The inequality shows the f integrals are Cauchy. Define L(f) as their finite limit. Taking limits in finite linear combinations gives linearity; nonnegative f has nonnegative integrals and hence L(f)>=0; also L(1)=1.
The compact metric space K is Hausdorff and locally compact (K itself is a compact neighborhood of each point), and . The positive functional in step 1.2 therefore satisfies F3. Its representing Borel measure has total mass L(1)=1. The defining identity L(f)=integral f against that measure, combined with step 1.2, is weak convergence of the extracted subsequence.
Prokhorov tightness theorem on polish spaces
Statement
Assume AC. A family of Borel probabilities on a Polish space S is tight if and only if it is relatively sequentially compact for weak convergence.
Facts & Assumptions
Every separable metrizable space embeds in the Hilbert cube : Every separable metrizable space is homeomorphic to a subspace of the Hilbert cube .
The standard weighted metric on a countable product of bounded complete metric spaces is complete: Let be complete metric spaces with . On , the formula defines a complete metric inducing the product topology. The empty product is the one-point space.
A complete, totally bounded metric space is compact, proved from countable choice used exactly once: Assume the Axiom of Countable Choice (def-countable-choice). Let be a metric space (def-metric-space) that is complete (def-complete-metric-space) and totally bounded (def-totally-bounded). Then is compact (def-metric-compactness).
Where the axiom is spent, and why the weaker principle suffices. is used exactly once, at step 3.1, to fix one finite -net together with a listing of it for every at once. The family of sets being chosen from is written down before any selection is made and does not depend on the earlier selections, which is precisely the situation countable choice covers and dependent choice (def-dependent-choice) is not needed for. Everything after step 3.1 is canonical: at each stage the construction takes the least admissible index in the listing already fixed.
As always on this page, the claim is an upper bound on the cost of the proof given here, not an assertion that is necessary for the theorem.
Probability laws on a compact metric space have weakly convergent subsequences: Assume AC. Every sequence of Borel probability laws on a compact metric K has a subsequence converging weakly to a Borel probability on K.
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Continuity from below for measures: Let be an increasing sequence of measurable sets for a measure , so . Then
No finiteness hypothesis is required.
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then
For every one also has
including , where both sides are .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
The empty family satisfies both definitions vacuously. Otherwise fix a compatible complete metric on S. By F1 there is a homeomorphic embedding e into . H has complete metric by F2. It is totally bounded: choose an integer with tail and a finite mesh in coordinates with weighted error below /2, putting zero in later coordinates. AC restricted to countable nonempty families gives the countable choice required by F3, which makes H compact.
Assume tightness and take any sequence in the family. Push it forward by e. F4 gives a subsequence on H. For every integer , choose compact in S with all ()>1-1/m. Their images are compact and closed in H, so F5 gives . Hence the Borel set has mass one.
For Borel B in S, e(B) is Borel relative to e(S). Since E is ambient Borel and contained in e(S), is Borel in H. Define ; disjoint unions are preserved and (S)=(E)=1. For closed F in S there is a closed Z in H with , by the relative topology. Then and . The closed bound from F5 gives , hence weak convergence on S. This proves tightness implies relative sequential compactness without assuming e(S) is Borel.
For the reverse, let be any countable open cover of S. Fix >0. If no finite initial union works uniformly, AC selects in the family with . Relative sequential compactness gives a weakly convergent subsequence with probability limit . For any fixed r, eventually >=r, so for the fixed open set one has eventually. The open bound in F5 yields . F6 as r tends to infinity would give (S)<=1-, a contradiction. Thus a uniform finite initial union exists.
Apply step 1.4 to the dense-center ball cover of radius and loss at each . Let be the corresponding finite union of closed balls and . F7 bounds every (S\K) by . K is closed in the complete S and is totally bounded: for any choose m with and select one point of K from each of the finitely many balls meeting it. These form an -net. F3 makes K compact, proving tightness.
Weakly convergent sequences are tight
Statement
Assume AC. If on a Polish space, then is tight.
Facts & Assumptions
Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space S is tight if and only if it is relatively sequentially compact for weak convergence.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
Consider any sequence of laws from the displayed family. If some law occurs infinitely often, it has a constant subsequence. Otherwise each law occurs only finitely often. Assign every law unequal to its least index in the original sequence. Removing finitely many selected terms for each bounded set of such indices leaves a subsequence whose assigned indices increase to infinity; its weak limit is by the given convergence.
Thus every sequence in the family has a weakly convergent subsequence with a probability limit on S. The reverse implication of F1, with the stated AC and Polish hypotheses, yields tightness.
Tightness extracts a weakly convergent subsequence
Statement
Assume AC. A tight sequence of Borel probability laws on a Polish S has a subsequence converging weakly to a Borel probability on that same S.
Facts & Assumptions
Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space S is tight if and only if it is relatively sequentially compact for weak convergence.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
Let . The given uniform compact bounds are exactly tightness of this family. The forward implication of F1 makes it relatively sequentially compact.
Apply that property to the original sequence itself. It supplies increasing indices and a Borel probability on S with . In particular the limit has mass one and lies on S, as asserted.
Levy prokhorov metric
Definition
For Borel probabilities , on a metric space S, put for nonempty closed F, and . Define as the infimum of >0 such that, for every closed F, both and . The admissible set contains every >=1 and is bounded below by zero, so its real infimum exists by Every nonempty set bounded below has an infimum. Enlargements are closed because distance to a nonempty set is continuous. , so the distance to a fixed nonempty set is -Lipschitz The metric assertion is proved in the following lemma.
Levy prokhorov distance is a metric
Statement
The closed-set definition of is a metric on Borel probabilities on any metric space, and . It equals the infimum obtained by testing all Borel B and using open enlargements , with empty enlargement empty.
Facts & Assumptions
Levy prokhorov metric: For Borel probabilities , on a metric space S, put for nonempty closed F, and . Define as the infimum of >0 such that, for every closed F, both and . The admissible set contains every >=1 and is bounded below by zero, so its real infimum exists by thm-infimum-property. Enlargements are closed because distance to a nonempty set is continuous. The metric assertion is proved in the following lemma.
, so the distance to a fixed nonempty set is -Lipschitz: Let be a metric space (def-metric-space), let be nonempty and let . Then
with the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function changes by at most between and : it is -Lipschitz.
Continuity from above when one set has finite measure: Let be a decreasing sequence of measurable sets for a measure . If for some , then
Dynkin's pi-lambda theorem: Let be a -system on . Then . Consequently, if is any lambda-system on with , then .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
By F1, and symmetry holds. Since , every positive is admissible for equal measures, giving self-distance zero. Admissibility is upward closed because larger radii enlarge sets and increase the error.
If (,)=0, for each positive integer m the upward-closure observation makes 1/m admissible. For nonempty closed F the sets are closed by F2 and decrease to F. F3 gives (F)<=(F) and, symmetrically, the reverse. Equality also holds on the empty set. The sets on which the two probabilities agree form a lambda-system; closed sets form a generating -system, so F4 yields =.
If a is admissible between and , and b between and , then for every closed F, . The last inclusion follows from the metric triangle inequality by approximating each infimum within any positive slack and then taking its infimum; empty F is separate. The reverse inequality interchanges and . Thus a+b is admissible, and taking a and b arbitrarily close above their infima proves the triangle inequality.
If is admissible in the all-Borel open convention, it is admissible for closed sets and closed enlargements, since . Conversely, if a is admissible in the closed convention, any Borel B satisfies for every >0, because distance to B and its closure agree. Interchanging the measures gives the other inequality. Infima and arbitrary positive slack prove equality of the two conventions.
Countable boundary null partitions of a separable metric space
Statement
Assume AC. For a separable metric S with Borel probability , there are countable refining Borel partitions for , all of whose nonempty atoms have diameter at most and -null boundary. Together these partitions generate .
Facts & Assumptions
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then
For every one also has
including , where both sides are .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
S is nonempty since (S)=1. Fix a countable dense list . For a fixed center, spheres at distinct radii are disjoint; at most r spheres have mass at least 1/r. Thus the radii with positive sphere mass form a countable union of finite, increasing-order lists. For each k,i, AC chooses outside this countable exceptional set. The balls cover S by density, and each has diameter at most 2^{-k} and boundary contained in its null sphere.
At level k disjointize this ordered cover: . These sets partition S; discard empty members. Their boundaries lie in the finite union of the first i sphere boundaries, hence are null by F1. Let consist of all nonempty intersections . These form a countable Borel partition, refine the preceding one, and have diameter at most 2^{-k}; their boundaries are again contained in finitely many null boundaries.
Every partition atom is Borel, so the -algebra they generate is contained in Borel(S). Conversely if U is open and x belongs to U, choose a ball about x contained in U and then k with 2^{-k} below its radius. The atom containing x lies in that ball, hence in U. Thus U is the union of the atoms, over countably many levels and members, that are contained in U. It lies in the generated -algebra, proving equality.
Levy prokhorov metric metrizes weak convergence
Statement
Assume AC. For Borel probabilities on a separable metric space, if and only if . Completeness is not required.
Facts & Assumptions
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Countable boundary null partitions of a separable metric space: Assume AC. For a separable metric S with Borel probability , there are countable refining Borel partitions for , all of whose nonempty atoms have diameter at most and -null boundary. Together these partitions generate .
Continuity from below for measures: Let be an increasing sequence of measurable sets for a measure , so . Then
No finiteness hypothesis is required.
Levy prokhorov distance is a metric: The closed-set definition of is a metric on Borel probabilities on any metric space, and . It equals the infimum obtained by testing all Borel B and using open enlargements , with empty enlargement empty.
Continuity from above when one set has finite measure: Let be a decreasing sequence of measurable sets for a measure . If for some , then
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
The decreasing closed enlargements have finite mass, so F5 applies. If tends to zero, for any >0 it is eventually less than , so is admissible by the upward-closed admissibility set. Hence for closed F, . Decreasing to zero makes the right-hand side tend to (F), by finite measure continuity; for F empty the inequality is immediate. F1 proves weak convergence.
Conversely suppose weak convergence. Fix >0 and choose >0 with 3delta<. By F2, select a partition with atom diameters less than . Finitely many atoms cover mass greater than 1-, by F3. F1 gives convergence of each atom mass. Thus eventually , and the complement of their union has mass below 2delta.
For any Borel B, let V be the union of those selected atoms meeting B. Then and B is contained in V together with the uncovered complement. Step 1.2 gives . Similarly . These bounds hold simultaneously for every B, so F4 gives (,)<= eventually. Since is arbitrary, tends to zero.
Interval realization from refining small diameter partitions
Statement
Assume AC. Let S be nonempty, complete and separable, and let be countable refining Borel partitions with nonempty atoms of diameter at most . Fix orders on each family of children. Every Borel probability on S is the law of a measurable under Borel Lebesgue probability, obtained by nested interval allocation.
Facts & Assumptions
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included: Let , assume the Axiom of Countable Choice (def-countable-choice), and let be reals for . Write
(def-multidimensional-rectangle-and-volume). Then is open and is closed, so both are Borel and Lebesgue measurable, and every set with is Lebesgue measurable with
In particular this covers the four one-dimensional face conventions in each coordinate — the open box, the closed box , the half-open box of def-half-open-box, and every mixture of them, in any combination of coordinates — and it gives measure to all of them whenever for some . For a half-open box with infinite parameters the value is already (thm-lebesgue-measure-is-a-complete-measure).
Every at most countable subset of is Lebesgue null; in particular : Let and assume the Axiom of Countable Choice (def-countable-choice). Every at most countable subset (def-countable) is Lebesgue measurable with
so is a -null set (def-measure-null-set-and-almost-everywhere). In particular every singleton is null, and on the real line the set of rational reals (lem-rat-embeds-dense) satisfies .
Complete metric space: every Cauchy sequence converges in the space: Let be a metric space (def-metric-space).
is complete if every Cauchy sequence in (def-cauchy-in-metric) converges to a point of (def-metric-convergence).
A subset is called complete when the metric subspace is complete (def-isometry-and-metric-embedding); as always, the metric is part of the data, and is the restriction of to .
The limit is unique when it exists, since limits in a metric space are unique (lem-metric-limits-unique), so a complete space assigns to each of its Cauchy sequences one point and not a set of points.
Completeness is a property of the pair , not of and not of the topology of . Both quantifiers in the definition are about the metric: the Cauchy condition is stated with distances, and so is convergence. Two metrics on the same set can have the same open sets while exactly one of them is complete, which is the content of fs-completeness-is-a-topological-property and its witness. Read the word complete as an abbreviation for complete with respect to this metric, always.
Dominated convergence: Let and be measurable complex-valued functions such that almost everywhere and almost everywhere for a single nonnegative measurable function with . Then , and hence
Weak limits are unique: Bounded continuous real tests determine Borel probability measures on any metric space. In particular, weak limits are unique.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
AC chooses a representative x_A from each nonempty atom and a fixed in S. Assign the root S interval [0,1); inside each parent interval [l,r), put the jth child A in . Countable additivity makes these child lengths sum to r-l. Zero-mass children have empty intervals. Each interval has the asserted length under F1: its CC hypothesis follows by restricting AC to a countable family.
Let consist of all allocated endpoints in (0,1). It is countable and Borel, and F2 makes it null under the same CC assumption. For u outside it, at each level there is one interval containing u, with a nested atom (u). Existence at each level follows because finite partial sums of child lengths increase to the parent length; an interior u lies below some partial sum. Put (u)=x_{(u)} there and (u)= on . Each is countably valued and Borel measurable.
For l>=k and u outside , both representatives lie in (u), so . The sequence is Cauchy; completeness F3 supplies a unique limit (u). Define = on . For a nonempty closed F, , and hence its preimage of zero is measurable by countable real limit operations. These are preimages of all closed F, so is Borel measurable. The limit belongs to the closure of each selected atom; membership in the atom itself is not needed.
For bounded continuous f, define (x)=f(x_A) on A in . Since , pointwise on S, with . Countable additivity of integrals over the atoms gives . The null endpoint set does not change this equality. Apply F4 to both sides: the left tends to by step 1.3, and the right tends to integral f against . Thus all bounded continuous test integrals of the law of equal those of , and F5 identifies the laws.
Skorokhod representation on polish spaces
Statement
Assume AC. If on a Polish S, there are random elements on with laws and almost surely.
Facts & Assumptions
Countable boundary null partitions of a separable metric space: Assume AC. For a separable metric S with Borel probability , there are countable refining Borel partitions for , all of whose nonempty atoms have diameter at most and -null boundary. Together these partitions generate .
Interval realization from refining small diameter partitions: Assume AC. Let S be nonempty, complete and separable, and let be countable refining Borel partitions with nonempty atoms of diameter at most . Fix orders on each family of children. Every Borel probability on S is the law of a measurable under Borel Lebesgue probability, obtained by nested interval allocation.
Portmanteau theorem: For Borel probabilities on a metric space S, the following are equivalent: (i) ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) for every closed F; (iv) for every open G; (v) for every Borel A with .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
Fix a compatible complete metric. F1 supplies countable refining partitions with diameters at most 2^{-k} and -null boundaries. Fix the same child orders and representatives for all laws. F2 constructs and Y for these laws on the indicated Borel interval, with exactly their prescribed marginals.
By F3, every fixed atom A satisfies (A)->(A). The endpoints of its interval are the left endpoint of its parent plus a finite sum of the masses of preceding children, and possibly its own mass. Starting with root endpoints 0,1 and inducting over each finite address proves convergence of both endpoints for every fixed atom interval.
Remove the countable union of all endpoint sets for and for every ; each is null by the realization lemma. For a remaining u and any fixed level k, u lies strictly between the endpoints of its interval. Step 1.2 and induction along its finite ancestral address imply that for all sufficiently large n, u lies in the same atom interval for . The limits (u),Y(u) lie in the closure of that atom by the realization construction. Its closure still has diameter at most 2^{-k}, so for all such n. Letting k increase proves the asserted almost-sure convergence.
Skorokhod representation does not couple the original variables
Remarks
Skorokhod representation on polish spaces constructs new random elements with the prescribed marginal laws. It gives almost-sure convergence on that new probability space. It does not assert almost-sure convergence of any originally given variables, and it does not preserve their joint distribution.
Countable compactly supported tests determine euclidean weak convergence
Statement
For each finite there is a countable uniformly dense subset of containing nonnegative compact cutoffs . If Borel probabilities have for every , then .
Facts & Assumptions
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: Let with , let be the set of functions and let be the Euclidean metric on it (lem-metrics-on-rn). Then:
- Closed boxes are compact. For reals the box is a compact subset of (def-metric-compactness).
- Heine-Borel. A subset is a compact subset of if and only if is closed in (def-metric-topology) and bounded (def-metric-bounded-diameter).
- The real line. A subset is a compact subset of , the usual metric (lem-real-line-is-a-metric-space), if and only if is closed in and bounded.
No choice principle is used. The bisection below halves one coordinate at a time and takes the left half whenever the left half still fails to be finitely covered, the right half otherwise: a rule with two outcomes, decided by a property of the box, not a selection. That is the whole reason the theorem is available in ZF, while the general "complete and totally bounded implies compact" (thm-complete-and-totally-bounded-implies-compact) is not.
The hypothesis is inherited from lem-metrics-on-rn, which defines and its metrics only there; the last remark below records what happens at .
Monotone convergence for the integral: Let be measurable and suppose for every . Then
Weak convergence of borel probability measures: For Borel probability measures on a metric space S, write if for every bounded continuous real function f on S. Continuity is def-metric-continuity. Such f is Borel measurable (inverse images of open sets are open) and , so the integrals are finite in def-integrable-real-and-complex-functions-and-their-integrals. No completeness or coupling is required.
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
For each integer cube [-M,M]^d, take all finite rational rectangular grids and rational vertex values which are zero on every boundary vertex. Interpolate multilinearly in each grid rectangle and extend by zero outside the cube. Shared-face formulas agree because they use the same vertex data, and the outer face formulas vanish, so the extension is continuous and compactly supported. Finite rational data admit a countable enumeration, giving a countable family D.
If f has compact support, F1 bounds its support inside the interior of some integer cube. Continuity on the cube is uniform: choose local oscillation neighborhoods, extract a finite subcover of smaller balls, and take a sufficiently small minimum radius. Thus choose a finite rational grid with f-oscillation below on every cell, and rational vertex values within of f, taking zero at boundary vertices. Multilinear interpolation is a convex combination of the vertex values. At a point x in any cell each vertex value differs from f(x) by less than 2eta, so the interpolant does too; outside the cube both functions vanish. This proves uniform density.
D contains : these are grid interpolants on [-m-1,m+1]^d, equal one on [-m,m]^d. They increase pointwise to one. F2 gives . Given >0 choose m with this integral greater than 1-. The assumed test convergence then gives for all large n. Hence for K=[-m-1,m+1]^d the outside masses are at most for and 2eta for late .
Uniform density and the probability mass bound extend the assumed convergence to every compactly supported continuous test: approximate it within by a D test, making the two integral errors at most 2delta. For any bounded continuous f, is such a test and equals f on K. Therefore step 1.3 gives . Let decrease to zero. This is F3.
Empirical measures of iid euclidean samples converge weakly
Statement
For IID -valued samples with common law and finite , the empirical probabilities converge weakly to almost surely on one common event.
Facts & Assumptions
Countable compactly supported tests determine euclidean weak convergence: For each finite there is a countable uniformly dense subset of containing nonnegative compact cutoffs . If Borel probabilities have for every , then .
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
Change of variables for expectation: Let be a random element, let be its law, and let or be measurable.
- If , then
- If is integrable, then is integrable with respect to and the same formula holds:
Kolmogorov iid l1 strong law: For IID real with , almost surely.
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then
For every one also has
including , where both sides are .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
For each sample outcome, is a probability: finite sums of the unit point masses are countably additive and its total mass is n/. For a bounded continuous h, .
Let D be the countable class in F1. For every h in D, F2 makes h() IID; they are bounded and hence integrable. F3 gives their mean . F4 yields convergence of the corresponding empirical test integrals.
Each test convergence event is measurable, by the countable real convergence criterion. F5 shows that the intersection over D of the conull events in step 1.2 is conull. On it all the test integrals converge simultaneously. The determining implication in F1 gives weak convergence for each such outcome.
The standard normal density has total mass one
Statement
Assume AC. The function is positive and Borel measurable on , with Lebesgue integral one.
Facts & Assumptions
The power-series, product-limit, IVP, functional-equation, and Picard definitions agree: The following descriptions give the same function : the power series ; the product limit ; the normalized solution of ; the normalized continuous multiplicative function; and the compact-uniform limit of the Picard iterates.
The exponential function is smooth and : The real exponential function is , and for every , In particular .
Continuous functions on Euclidean spaces are Borel measurable: Assume the Axiom of Countable Choice. Let . Every continuous map is Borel measurable in the sense of def-borel-and-lebesgue-measurable-function-on-rn.
Square roots exist: a unique with ; the positives are : Let be a complete ordered field (def-complete-ordered-field). Then every with has a unique with and ; we write . Consequently the positive elements of are exactly the nonzero squares: if and only if for some .
Substitution: if is differentiable on with integrable and is continuous on an interval containing , then : Let be reals and let be differentiable at every point of as a function on (def-derivative), with integrable on (def-darboux-integral). Let be order-convex with at least two elements (def-interval) with , and let be continuous on (def-continuity-real).
Then is integrable on and
the left-hand integral being the oriented one of def-oriented-integral.
Neither injectivity nor monotonicity of is assumed, and that is exactly why the left-hand side is written with oriented limits: may lie below , and may return to the same value many times. The proof runs through a primitive of and the chain rule, and no inverse function is ever formed.
Continuity of is a hypothesis and cannot be weakened to integrability. With merely integrable the composite need not be integrable at all, so the right-hand side need not exist; that is the false statement that weakens it on the companion page.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: Let be reals and let be continuous on (def-continuity-real). Then is bounded (def-bounded-set) and Riemann integrable on (def-darboux-integral).
The proof gives more than integrability: it gives a partition that works. For every real the uniform partition into parts already satisfies , as soon as is large enough that is below the that uniform continuity supplies for . Uniform continuity is exactly what makes one serve all subintervals at once, and it is the only place where the compactness of is used.
A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: Assume the Axiom of Countable Choice. Let and let be bounded and Riemann integrable. Then is Lebesgue measurable on and is integrable there, and its Lebesgue integral equals its Riemann integral:
This is the point at which the completeness of Lebesgue measure is used essentially: the proof obtains a Borel function equal to almost everywhere, and measurability of itself is then a completeness statement.
Monotone convergence for the integral: Let be measurable and suppose for every . Then
Monotonicity and nonnegative homogeneity of the nonnegative integral: Let be measurable and let .
- If , then .
- .
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
F1 gives positivity of the exponential, and F2 gives continuity. Thus is positive and continuous. AC restricts to a choice function on every countable nonempty family, giving CC; F3 therefore applies to . F4 makes its positive denominator well defined.
For integer , F5 with and continuous f(t)=exp(-t^2) gives . The derivative is the constant 1/sqrt2, hence integrable. Both integrands are continuous on the compact intervals, so F6 gives bounded Riemann integrability. F7 identifies the left side with its Lebesgue integral, under the CC in step 1.1.
The nonnegative functions increase to . By F8, its Lebesgue integral is the limit of the compact integrals in step 2.1. F9 identifies the right-hand improper limit as ; the equality follows because both sides are positive with square 2pi, by square-root uniqueness. F10 now divides by sqrt(2pi) to give integral =1.
Standard normal and normal laws
Definition
Assume AC. Define for Borel E in . By The standard normal density has total mass one and The indefinite integral of a nonnegative measurable function is a measure, gamma is a probability measure; denote it . For and , define as the law of on . This affine map is continuous: for >0 choose =/, and for =0 it is constant. Its inverse images of opens are open, so it is Borel measurable. The law of a random element is a probability measure makes its pushforward a probability. When =0, the preimage of E is all of R if m belongs to E and empty otherwise, so in The Dirac set function at a point.
5 · Examples, counterexamples and false statements
None yet.
Sources
- van Gaans, §2, p. 3
- van Gaans, Definition 3.1, pp. 6–7
- van Gaans, Definition 3.1 applied to laws
- van Gaans, Theorem 3.2, pp. 7–9
- Durrett, Theorem 3.2.9, pp. 119–120
- van Gaans, Theorem 4.1, definiteness argument, pp. 9–10
- van Gaans, Theorem 3.2; local closed-preimage argument
- van Gaans, Theorem 3.2 and closed-neighborhood argument
- van Gaans, Definition 5.1, p. 14
- van Gaans, Theorem 5.2, p. 14 (closure of the family)
- van Gaans, Theorem 2.6, pp. 5–6
- van Gaans, Proposition 5.3, pp. 15–16; explicit countable-test replacement for its Alaoglu step
- van Gaans, Proposition 5.3 and §6; diagonal replacement for compact-case functional argument
- van Gaans, Theorem 5.2, Proposition 5.3, Lemma 5.4, pp. 14–18
- Durrett, §§2.4–2.5, pp. 76–87
- van Gaans, §4, pp. 9–10 (open-enlargement convention; equivalence must be proved locally)
- van Gaans, Theorem 4.1, pp. 9–10
- van Gaans, Lemma 4.3, pp. 10–11; refining-partition consequence
- van Gaans, Theorem 4.2 and Lemma 4.3, pp. 10–12
- Advanced Probability, Theorem 5.29, pp. 65–67; representative-limit repair of the nonclosed-atom intersection step
- Advanced Probability, Theorem 5.29, pp. 65–67, repaired as in the preceding lemma
- Advanced Probability, Theorem 5.29
- van Gaans, compact-test approximation in Proposition 5.3 and tightness transfer; explicit Euclidean construction
- Durrett, strong law Theorem 2.5.10 plus countable-test argument
- Durrett, Probability: Theory and Examples, Example 1.6.11, p.34; local normalization from the earlier published Gaussian integral