Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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 B(S) with total mass one. Here B(S) 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Weak convergence of borel probability measures

Definition

For Borel probability measures μn,μ on a metric space S, write μnμ if fdμnfdμ 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 fdμfμ(S)<, so the integrals are finite in Integrable real and complex functions, and their integrals. No completeness or coupling is required.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Convergence in distribution of random elements

Definition

Random elements Xn,X with values in the same metric space converge in distribution, written XnX, if their laws from Law or distribution of a random element satisfy PXnPX in Weak convergence of borel probability measures. They may be defined on different probability spaces. The definition specifies only their marginal laws.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Portmanteau theorem

Statement

For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

Facts & Assumptions

[F1]

d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz: Let (X,d) be a metric space (def-metric-space), let AX be nonempty and let x,yX. Then

d(x,A)d(y,A)d(x,y),

with d(,A) the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function ud(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz.

[F2]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fnf almost everywhere and fng almost everywhere for a single nonnegative measurable function g with gdμ<+. Then fL1(μ), fnfdμ0, and hence fndμfdμ.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

(i) implies (ii) because a uniformly continuous function is continuous. Suppose (ii), and let F be nonempty and closed. By F1, fm(x)=max(0,1md(x,F)) is bounded and uniformly continuous. Moreover fm1F. Thus lim supnμn(F)fmdμ for every m. F2 with majorant one gives (iii) as m tends to infinity. For F empty the inequality is zero<=zero.

F1F2
1.2

For G open, apply (iii) to its closed complement and use μn(G)=1μn(SG) to obtain (iv). Conversely the same complement calculation obtains (iii) from (iv). If A is a Borel continuity set, AAA and μ(A)=μ(A)=μ(A). The open lower bound and closed upper bound therefore squeeze μn(A) to μ(A), proving (v).

givenalgebra
1.3

Assume (v), and fix a bounded continuous real f and η>0. The disjoint level sets with μ(f=t)1/r 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 t0<<tm outside this countable set, with t0<f, tm>f and mesh below η. Such levels exist in every open interval, since an interval is uncountable.

givenalgebra
2.1

For Aj={tj1f<tj}, continuity of f gives Aj{f=tj1}{f=tj}, so (v) applies. The simple function s=jtj11Aj satisfies fsη everywhere. Therefore fdμnfdμ2η+jtj1(μn(Aj)μ(Aj)). The finite sum tends to zero, by step 1.3 and (v). Letting η tend to zero proves (i), closing all equivalences.

step 1.3
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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

[F1]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F2]

Convergence in distribution for real random variables: For real random variables (Xn) and X, write XnX, or XnX in distribution, when FXn(x)FX(x) at every continuity point x of FX. Here FX 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.

[F3]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then

μ(nNEn)=infnNμ(En).

[F4]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then

μ(nNEn)=supnNμ(En).

No finiteness hypothesis is required.

[F5]

Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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 nN with n1, let Rn be the set of functions nR and let d2 be the Euclidean metric on it (lem-metrics-on-rn). Then:

  1. Closed boxes are compact. For reals akbk (k<n) the box Q={xRn:akxkbk for every k<n} is a compact subset of (Rn,d2) (def-metric-compactness).
  2. Heine-Borel. A subset KRn is a compact subset of (Rn,d2) if and only if K is closed in Rn (def-metric-topology) and bounded (def-metric-bounded-diameter).
  3. The real line. A subset KR is a compact subset of (R,dR), the usual metric dR(x,y)=xy (lem-real-line-is-a-metric-space), if and only if K is closed in R 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 n1 is inherited from lem-metrics-on-rn, which defines Rn and its metrics only there; the last remark below records what happens at n=0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

Use F4 for increasing rays. Use F3 for decreasing rays and intervals of finite probability. For a probability law μ, write F(t)=μ((,t]). 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 μ({t}) at t. Thus a continuity point has μ({t})=0. If μnμ, F1 on (,t] gives Fn(t)F(t) at every such point, exactly F2.

F1F2F3F4
1.2

Conversely assume convergence of CDFs at continuity points of F. Fix bounded continuous f, M=f, and η>0. Choose continuity points a<b with μ((,a])+μ((b,))<η. 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.

givenalgebra
2.1

The closed bounded interval [a,b] 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 a=t0<<tm=b by continuity points with oscillation of f on each interval below η. Then μn((tj1,tj])=Fn(tj)Fn(tj1) 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 3Mη in the comparison of the two integrals, by step 1.2. Let η decrease to zero. This proves weak convergence.

step 1.2F5
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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

[F1]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F2]

Dynkin's pi-lambda theorem: Let P be a π-system on X. Then λX(P)=σX(P). Consequently, if D is any lambda-system on X with PD, then σX(P)D.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

If μ and ν have equal integrals of every bounded continuous test, the constant sequence μ converges weakly to ν. F1 gives μ(F)ν(F) for every closed F. Reverse the roles to get equality.

F1
2.1

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.

F2step 1.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Continuous mapping theorem

Statement

Let S,T be metric spaces, g:ST measurable, and μnμ. If the discontinuity set Dg is μ-null, then gμngμ. Consequently XnX implies g(Xn)g(X) whenever PX(Dg)=0.

Facts & Assumptions

[F1]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F2]

Laws commute with measurable maps: Let X:(Ω,F,P)(S,Σ) be a random element, and let g:(S,Σ)(T,T) be measurable. Then gX is a random element and for every BT, PgX(B)=PX(g1(B)).

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

For r1 let Ur 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 rUr: 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 d(g(y),g(x))<ε there. Thus Dg is Borel.

givenalgebra
1.2

If F is closed in T and x lies outside g1(F)Dg, continuity at x and the open complement of F give a neighborhood disjoint from g1(F). Hence g1(F)g1(F)Dg. Applying F1 to this closed preimage closure gives lim supnμn(g1(F))μ(g1(F))μ(g1(F)).

F1
2.1

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(Xn) and g(X), proving the random-element formulation.

F1F2step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-10Open item page →

Converging together lemma

Statement

Let Xn and Yn be Borel-measurable random elements with values in a metric space S, on the same probability space for each n, and let X be an S-valued Borel-measurable random element. Suppose d(Xn,Yn) is measurable and P(d(Xn,Yn)>ε)0 for every ε>0. If XnX, then YnX.

Facts & Assumptions

[F1]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F2]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then

μ(nNEn)=infnNμ(En).

[F3]

d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz: Let (X,d) be a metric space (def-metric-space), let AX be nonempty and let x,yX. Then

d(x,A)d(y,A)d(x,y),

with d(,A) the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function ud(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

By F3, distance to nonempty F is continuous; its sublevel sets are closed. For nonempty closed F put F[ε]={x:d(x,F)ε}, which is closed. If Yn lies in F and d(Xn,Yn)ε, then Xn lies in this enlargement. Thus P(YnF)P(XnF[ε])+P(d(Xn,Yn)>ε).

givenalgebraF3
2.1

F1 and the probability hypothesis give lim supnP(YnF)PX(F[ε]). For mN, the sets Em:=F[1/(m+1)] 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 YnX.

F1F2
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Tight family of probability measures

Definition

A family A of Borel probabilities on a metric space S is tight if, for every ε>0, there is a compact KS such that μ(SK)<ε for every μA. 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Relative sequential compactness for weak convergence

Definition

A family A of Borel probabilities on a metric space is relatively sequentially compact for weak convergence if every sequence from A has a subsequence converging weakly to a Borel probability on the same state space. The limit need not belong to A. Weak convergence means Weak convergence of borel probability measures.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Every borel probability on a polish space is tight

Statement

Assume AC. Every Borel probability on a Polish space S is tight.

Facts & Assumptions

[F1]

Assuming countable choice, Borel probability measures on Polish spaces are inner regular: Assume countable choice. If P is Polish and μ is a Borel probability measure on P, then for every Borel AP and ε>0 there is a compact KA with μ(AK)<ε.

[F2]

Tight family of probability measures: A family A of Borel probabilities on a metric space S is tight if, for every ε>0, there is a compact KS such that μ(SK)<ε for every μA. One K must work for the whole family. Compactness is def-metric-compactness. The empty family is tight, witnessed by the empty compact set.

[F3]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then

μ(nNEn)=supnNμ(En).

No finiteness hypothesis is required.

[F4]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)kN be measurable. Then

μ(kNEk)k=0μ(Ek).

For every mN one also has

μ(k<mEk)k<mμ(Ek),

including m=0, where both sides are 0.

[F5]

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 (X,d) be a metric space (def-metric-space) that is complete (def-complete-metric-space) and totally bounded (def-totally-bounded). Then (X,d) is compact (def-metric-compactness).

Where the axiom is spent, and why the weaker principle suffices. ACω is used exactly once, at step 3.1, to fix one finite 1/(n+1)-net together with a listing of it for every nN 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 ACω is necessary for the theorem.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

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 μ(SK)<ε. This is F2 for the one-law family.

F1F2
2.1

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 (ai). For each m1, finite initial unions of open balls B(ai,2m) increase to S; choose their least length with loss below ε2m1. Let Cm be the corresponding finite union of closed balls, and K=mCm. Subadditivity gives μ(SK)mμ(SCm)<ε. K is closed and hence complete. For any η>0 choose m with 21m<η; 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.

step 1.1F3F4F5
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Countable uniformly dense tests on a compact metric space

Statement

Assume AC. For a compact metric K, C(K;R) has a countable uniformly dense subset in the supremum norm.

Facts & Assumptions

[F1]

A compact metric space is complete and totally bounded, and neither implication uses any choice principle: Let (X,d) be a compact metric space (def-metric-compactness, def-metric-space). Then (X,d) 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.

[F2]

d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz: Let (X,d) be a metric space (def-metric-space), let AX be nonempty and let x,yX. Then

d(x,A)d(y,A)d(x,y),

with d(,A) the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function ud(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz.

[F3]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: Let (X,dX) be a compact metric space (def-metric-compactness), let (Y,dY) be any metric space (def-metric-space) and let f:XY be continuous (def-metric-continuity). Then f 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.

1.1

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 xmin1jl(qj+Ld(x,aj)), with finite lists ajD, rational qj 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.

F1F2
1.2

Fix continuous f, η>0 and Mf. By F3 choose δ>0 so d(x,y)<δ implies f(x)f(y)<η. Choose integer L with Lδ>2M. Then g(x)=infyK(f(y)+Ld(x,y)) obeys g(x)f(x) 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 f(x)ηg(x)f(x).

F3
2.1

Choose a finite net a1,,al from D with mesh h<δ and Lh<η, and rational qj with qjf(aj)<η. For any y choose aj within h; uniform continuity gives f(aj)+Ld(x,aj)f(y)+Ld(x,y)+2η. Taking the infimum over y and allowing the rational error proves g(x)ηminj(qj+Ld(x,aj))g(x)+3η. 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.

step 1.2
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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

[F1]

Countable uniformly dense tests on a compact metric space: Assume AC. For a compact metric K, C(K;R) has a countable uniformly dense subset in the supremum norm.

[F2]

Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence: Every bounded sequence of reals has a convergent subsequence: if (xk) is a sequence of reals and there is MR with xkM for every kN (def-sequence), then there is a strictly increasing n:NN and a real L with xnjL.

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.

[F3]

Positive functionals on C_c(X) are integration against a Radon measure: Let X be LCH and let Λ:Cc(X;R)R be positive. The Radon measure μ constructed above satisfies Λ(f)=Xfdμ(fCc(X;R)).

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

K cannot be empty because the given laws have mass one. List a countable dense test family f1,f2, by F1. Each numerical sequence fjdμn is bounded by fj. 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 nj with convergence for every listed test.

F1F2
1.2

For any continuous f and η>0 choose a listed test h with fh<η. The inequality fdμnjfdμnk2η+hdμnjhdμnk 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.

givenalgebra
2.1

The compact metric space K is Hausdorff and locally compact (K itself is a compact neighborhood of each point), and Cc(K)=C(K). 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.

F3step 1.2
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-10Open item page →

Prokhorov tightness theorem on polish spaces

Statement

Assume AC. A family A of Borel probabilities on a Polish space S is tight if and only if it is relatively sequentially compact for weak convergence.

Facts & Assumptions

[F1]

Every separable metrizable space embeds in the Hilbert cube [0,1]N: Every separable metrizable space is homeomorphic to a subspace of the Hilbert cube [0,1]N.

[F2]

The standard weighted metric on a countable product of bounded complete metric spaces is complete: Let ((Xn,dn))nN be complete metric spaces with dn1. On nXn, the formula D(x,y)=n=02(n+1)dn(xn,yn) defines a complete metric inducing the product topology. The empty product is the one-point space.

[F3]

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 (X,d) be a metric space (def-metric-space) that is complete (def-complete-metric-space) and totally bounded (def-totally-bounded). Then (X,d) is compact (def-metric-compactness).

Where the axiom is spent, and why the weaker principle suffices. ACω is used exactly once, at step 3.1, to fix one finite 1/(n+1)-net together with a listing of it for every nN 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 ACω is necessary for the theorem.

[F4]

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.

[F5]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F6]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then

μ(nNEn)=supnNμ(En).

No finiteness hypothesis is required.

[F7]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)kN be measurable. Then

μ(kNEk)k=0μ(Ek).

For every mN one also has

μ(k<mEk)k<mμ(Ek),

including m=0, where both sides are 0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

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=[0,1]N. H has complete metric ρ(x,y)=j=02(j+1)xjyj by F2. It is totally bounded: choose an integer N1 with tail jN2(j+1)<η/2 and a finite mesh in coordinates 0,,N1 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.

F1F2F3
1.2

Assume tightness and take any sequence μn in the family. Push it forward by e. F4 gives a subsequence νnj=eμnjν on H. For every integer m1, choose compact Km in S with all μn(Km)>1-1/m. Their images are compact and closed in H, so F5 gives ν(e(Km))lim supjνnj(e(Km))11/m. Hence the Borel set E=m1e(Km)e(S) has ν mass one.

F4F5
1.3

For Borel B in S, e(B) is Borel relative to e(S). Since E is ambient Borel and contained in e(S), Ee(B) is Borel in H. Define μ(B)=ν(Ee(B)); disjoint unions are preserved and μ(S)=ν(E)=1. For closed F in S there is a closed Z in H with Ze(S)=e(F), by the relative topology. Then μnj(F)=νnj(Z) and ν(Z)=ν(ZE)=μ(F). The closed bound from F5 gives lim supjμnj(F)μ(F), hence weak convergence on S. This proves tightness implies relative sequential compactness without assuming e(S) is Borel.

F5
1.4

For the reverse, let Ui be any countable open cover of S. Fix ε>0. If no finite initial union works uniformly, AC selects μn in the family with μn(inUi)1ε. Relative sequential compactness gives a weakly convergent subsequence with probability limit μ. For any fixed r, eventually nj>=r, so for the fixed open set Gr=irUi one has μnj(Gr)1ε eventually. The open bound in F5 yields μ(Gr)lim infjμnj(Gr)1ε. F6 as r tends to infinity would give μ(S)<=1-ε, a contradiction. Thus a uniform finite initial union exists.

F5F6
2.1

Apply step 1.4 to the dense-center ball cover of radius 2m and loss ε2m1 at each m1. Let Cm be the corresponding finite union of closed balls and K=mCm. F7 bounds every μ(S\K) by mε2m1<ε. K is closed in the complete S and is totally bounded: for any η choose m with 21m<η 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.

F3F7step 1.4
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Weakly convergent sequences are tight

Statement

Assume AC. If μnμ on a Polish space, then {μ,μ1,μ2,} is tight.

Facts & Assumptions

[F1]

Prokhorov tightness theorem on polish spaces: Assume AC. A family A 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.

1.1

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.

givenalgebra
2.1

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.

F1
CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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

[F1]

Prokhorov tightness theorem on polish spaces: Assume AC. A family A 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.

1.1

Let A={μn:n1}. The given uniform compact bounds are exactly tightness of this family. The forward implication of F1 makes it relatively sequentially compact.

F1
2.1

Apply that property to the original sequence itself. It supplies increasing indices nj and a Borel probability μ on S with μnjμ. In particular the limit has mass one and lies on S, as asserted.

givenalgebra
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-09-10Open item page →

Levy prokhorov metric

Definition

For Borel probabilities μ,ν on a metric space S, put F[ε]={x:d(x,F)ε} for nonempty closed F, and [ε]=. Define π(μ,ν) as the infimum of ε>0 such that, for every closed F, both μ(F)ν(F[ε])+ε and ν(F)μ(F[ε])+ε. 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. d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz The metric assertion is proved in the following lemma.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Levy prokhorov distance is a metric

Statement

The closed-set definition of π is a metric on Borel probabilities on any metric space, and 0π1. It equals the infimum obtained by testing all Borel B and using open enlargements Bε={x:d(x,B)<ε}, with empty enlargement empty.

Facts & Assumptions

[F1]

Levy prokhorov metric: For Borel probabilities μ,ν on a metric space S, put F[ε]={x:d(x,F)ε} for nonempty closed F, and [ε]=. Define π(μ,ν) as the infimum of ε>0 such that, for every closed F, both μ(F)ν(F[ε])+ε and ν(F)μ(F[ε])+ε. 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.

[F2]

d(x,A)d(y,A)d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz: Let (X,d) be a metric space (def-metric-space), let AX be nonempty and let x,yX. Then

d(x,A)d(y,A)d(x,y),

with d(,A) the distance to a nonempty set (def-metric-bounded-diameter). Thus the real-valued function ud(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz.

[F3]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then

μ(nNEn)=infnNμ(En).

[F4]

Dynkin's pi-lambda theorem: Let P be a π-system on X. Then λX(P)=σX(P). Consequently, if D is any lambda-system on X with PD, then σX(P)D.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

By F1, 0π1 and symmetry holds. Since FF[ε], every positive ε is admissible for equal measures, giving self-distance zero. Admissibility is upward closed because larger radii enlarge sets and increase the error.

F1
1.2

If π(μ,ν)=0, for each positive integer m the upward-closure observation makes 1/m admissible. For nonempty closed F the sets F[1/m] 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 μ=ν.

F2F3F4
1.3

If a is admissible between μ and ν, and b between ν and σ, then for every closed F, μ(F)ν(F[a])+aσ((F[a])[b])+a+bσ(F[a+b])+a+b. 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.

givenalgebra
2.1

If ε is admissible in the all-Borel open convention, it is admissible for closed sets and closed enlargements, since FεF[ε]. Conversely, if a is admissible in the closed convention, any Borel B satisfies μ(B)μ(B)ν((B)[a])+aν(Ba+δ)+a+δ 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.

givenalgebra
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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 Pk for k1, all of whose nonempty atoms have diameter at most 2k and μ-null boundary. Together these partitions generate B(S).

Facts & Assumptions

[F1]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)kN be measurable. Then

μ(kNEk)k=0μ(Ek).

For every mN one also has

μ(k<mEk)k<mμ(Ek),

including m=0, where both sides are 0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

S is nonempty since μ(S)=1. Fix a countable dense list ai. 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 rk,i(2k2,2k1) outside this countable exceptional set. The balls B(ai,rk,i) cover S by density, and each has diameter at most 2^{-k} and boundary contained in its null sphere.

givenalgebra
1.2

At level k disjointize this ordered cover: Dk,i=B(ai,rk,i)j<iB(aj,rk,j). 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 Pk consist of all nonempty intersections D1,i1Dk,ik. 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.

F1
2.1

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 Pk 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.

givenalgebra
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Levy prokhorov metric metrizes weak convergence

Statement

Assume AC. For Borel probabilities on a separable metric space, π(μn,μ)0 if and only if μnμ. Completeness is not required.

Facts & Assumptions

[F1]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F2]

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 Pk for k1, all of whose nonempty atoms have diameter at most 2k and μ-null boundary. Together these partitions generate B(S).

[F3]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then

μ(nNEn)=supnNμ(En).

No finiteness hypothesis is required.

[F4]

Levy prokhorov distance is a metric: The closed-set definition of π is a metric on Borel probabilities on any metric space, and 0π1. It equals the infimum obtained by testing all Borel B and using open enlargements Bε={x:d(x,B)<ε}, with empty enlargement empty.

[F5]

Continuity from above when one set has finite measure: Let (En)nN be a decreasing sequence of measurable sets for a measure μ. If μ(En0)<+ for some n0, then

μ(nNEn)=infnNμ(En).

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

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, lim supnμn(F)μ(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.

F1F5
1.2

Conversely suppose weak convergence. Fix ε>0 and choose δ>0 with 3delta<ε. By F2, select a partition with atom diameters less than ε. Finitely many atoms A1,,Am cover μ mass greater than 1-δ, by F3. F1 gives convergence of each atom mass. Thus eventually imμn(Ai)μ(Ai)<δ, and the complement of their union has μn mass below 2delta.

F1F2F3
2.1

For any Borel B, let V be the union of those selected atoms meeting B. Then VBε and B is contained in V together with the uncovered complement. Step 1.2 gives μn(B)μn(V)+2δμ(V)+3δμ(Bε)+ε. Similarly μ(B)μ(V)+δμn(V)+2δμn(Bε)+ε. These bounds hold simultaneously for every B, so F4 gives π(μn,μ)<=ε eventually. Since ε is arbitrary, π tends to zero.

F4
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Interval realization from refining small diameter partitions

Statement

Assume AC. Let S be nonempty, complete and separable, and let (Pk) be countable refining Borel partitions with nonempty atoms of diameter at most 2k. Fix orders on each family of children. Every Borel probability σ on S is the law of a measurable Tσ:(0,1)S under Borel Lebesgue probability, obtained by nested interval allocation.

Facts & Assumptions

[F1]

A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included: Let n1, assume the Axiom of Countable Choice (def-countable-choice), and let aibi be reals for i<n. Write

R:={xRn:ai<xi<bi for every i<n},R:=[a,b]={xRn:aixibi for every i<n}

(def-multidimensional-rectangle-and-volume). Then R is open and R is closed, so both are Borel and Lebesgue measurable, and every set R with RRR is Lebesgue measurable with

λn(R)  =  i<n(biai).

In particular this covers the four one-dimensional face conventions in each coordinate — the open box, the closed box [a,b], the half-open box B(a,b)=i<n(ai,bi] of def-half-open-box, and every mixture of them, in any combination of coordinates — and it gives measure 0 to all of them whenever ai=bi for some i<n. For a half-open box with infinite parameters the value is already λn(B)=vol(B) (thm-lebesgue-measure-is-a-complete-measure).

[F2]

Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0: Let n1 and assume the Axiom of Countable Choice (def-countable-choice). Every at most countable subset ERn (def-countable) is Lebesgue measurable with

λn(E)  =  0,

so E is a λn-null set (def-measure-null-set-and-almost-everywhere). In particular every singleton is null, and on the real line the set QR of rational reals (lem-rat-embeds-dense) satisfies λ1(QR)=0.

[F3]

Complete metric space: every Cauchy sequence converges in the space: Let (X,d) be a metric space (def-metric-space).

(X,d) is complete if every Cauchy sequence in (X,d) (def-cauchy-in-metric) converges to a point of X (def-metric-convergence).

A subset AX is called complete when the metric subspace (A,dA) is complete (def-isometry-and-metric-embedding); as always, the metric is part of the data, and dA is the restriction of d to A×A.

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 (X,d), not of X and not of the topology of d. 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.

[F4]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fnf almost everywhere and fng almost everywhere for a single nonnegative measurable function g with gdμ<+. Then fL1(μ), fnfdμ0, and hence fndμfdμ.

[F5]

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.

1.1

AC chooses a representative x_A from each nonempty atom and a fixed x0 in S. Assign the root S interval [0,1); inside each parent interval [l,r), put the jth child A in [l+i<jσ(Ai),l+ijσ(Ai)). 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.

F1
1.2

Let Nsigma 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 Ak(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 Zk(u)=x_{Ak(u)} there and Zk(u)=x0 on Nsigma. Each Zk is countably valued and Borel measurable.

F2
1.3

For l>=k and u outside Nsigma, both representatives lie in Ak(u), so d(Zl(u),Zk(u))2k. The sequence is Cauchy; completeness F3 supplies a unique limit Tsigma(u). Define Tsigma=x0 on Nsigma. For a nonempty closed F, d(Tσ(u),F)=limkd(Zk(u),F), and hence its preimage of zero is measurable by countable real limit operations. These are preimages of all closed F, so Tsigma is Borel measurable. The limit belongs to the closure of each selected atom; membership in the atom itself is not needed.

F3
2.1

For bounded continuous f, define hk(x)=f(x_A) on A in Pk. Since d(x,xA)2k, hk(x)f(x) pointwise on S, with hkf. Countable additivity of integrals over the atoms gives f(Zk(u))du=APkσ(A)f(xA)=hkdσ. The null endpoint set does not change this equality. Apply F4 to both sides: the left tends to f(Tσ(u))du by step 1.3, and the right tends to integral f against σ. Thus all bounded continuous test integrals of the law of Tsigma equal those of σ, and F5 identifies the laws.

F4F5step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-10Open item page →

Skorokhod representation on polish spaces

Statement

Assume AC. If μnμ on a Polish S, there are random elements Yn,Y on ((0,1),B((0,1)),λ) with laws μn,μ and YnY almost surely.

Facts & Assumptions

[F1]

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 Pk for k1, all of whose nonempty atoms have diameter at most 2k and μ-null boundary. Together these partitions generate B(S).

[F2]

Interval realization from refining small diameter partitions: Assume AC. Let S be nonempty, complete and separable, and let (Pk) be countable refining Borel partitions with nonempty atoms of diameter at most 2k. Fix orders on each family of children. Every Borel probability σ on S is the law of a measurable Tσ:(0,1)S under Borel Lebesgue probability, obtained by nested interval allocation.

[F3]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

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 Yn and Y for these laws on the indicated Borel interval, with exactly their prescribed marginals.

F1F2
1.2

By F3, every fixed atom A satisfies μn(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.

F3
2.1

Remove the countable union of all endpoint sets for μ and for every μn; 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 μn. The limits Yn(u),Y(u) lie in the closure of that atom by the realization construction. Its closure still has diameter at most 2^{-k}, so d(Yn(u),Y(u))2k for all such n. Letting k increase proves the asserted almost-sure convergence.

givenalgebra
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Countable compactly supported tests determine euclidean weak convergence

Statement

For each finite d1 there is a countable uniformly dense subset D of Cc(Rd;R) containing nonnegative compact cutoffs χm1. If Borel probabilities μn,μ have hdμnhdμ for every hD, then μnμ.

Facts & Assumptions

[F1]

Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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 nN with n1, let Rn be the set of functions nR and let d2 be the Euclidean metric on it (lem-metrics-on-rn). Then:

  1. Closed boxes are compact. For reals akbk (k<n) the box Q={xRn:akxkbk for every k<n} is a compact subset of (Rn,d2) (def-metric-compactness).
  2. Heine-Borel. A subset KRn is a compact subset of (Rn,d2) if and only if K is closed in Rn (def-metric-topology) and bounded (def-metric-bounded-diameter).
  3. The real line. A subset KR is a compact subset of (R,dR), the usual metric dR(x,y)=xy (lem-real-line-is-a-metric-space), if and only if K is closed in R 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 n1 is inherited from lem-metrics-on-rn, which defines Rn and its metrics only there; the last remark below records what happens at n=0.

[F2]

Monotone convergence for the integral: Let 0f1f2 be measurable and suppose fn(x)f(x) for every x. Then fndμfdμ.

[F3]

Weak convergence of borel probability measures: For Borel probability measures μn,μ on a metric space S, write μnμ if fdμnfdμ 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 fdμfμ(S)<, 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.

1.1

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.

givenalgebra
1.2

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.

F1
1.3

D contains χm(x)=j=1dmin(1,max(0,m+1xj)): these are grid interpolants on [-m-1,m+1]^d, equal one on [-m,m]^d. They increase pointwise to one. F2 gives χmdμ1. Given η>0 choose m with this integral greater than 1-η. The assumed test convergence then gives χmdμn>12η for all large n. Hence for K=[-m-1,m+1]^d the outside masses are at most η for μ and 2eta for late μn.

F2
2.1

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, fχm+1 is such a test and equals f on K. Therefore step 1.3 gives lim supnfdμnfdμ3fη. Let η decrease to zero. This is F3.

F3step 1.3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Empirical measures of iid euclidean samples converge weakly

Statement

For IID Rd-valued samples (Xi) with common law μ and finite d1, the empirical probabilities μ^n=n1i=1nδXi converge weakly to μ almost surely on one common event.

Facts & Assumptions

[F1]

Countable compactly supported tests determine euclidean weak convergence: For each finite d1 there is a countable uniformly dense subset D of Cc(Rd;R) containing nonnegative compact cutoffs χm1. If Borel probabilities μn,μ have hdμnhdμ for every hD, then μnμ.

[F2]

Measurable coordinatewise functions preserve independence: Let (Xi)iI be an independent family of random elements Xi:(Ω,F,P)(Si,Σi). For each i, let gi:(Si,Σi)(Ti,Ti) be measurable. Then the family (giXi)iI is independent.

[F3]

Change of variables for expectation: Let X:(Ω,F,P)(S,Σ) be a random element, let PX be its law, and let g:(S,Σ)R or g:(S,Σ)C be measurable.

  1. If g0, then E[g(X)]=SgdPX.
  2. If g(X) is integrable, then g is integrable with respect to PX and the same formula holds: E[g(X)]=SgdPX.
[F4]

Kolmogorov iid l1 strong law: For IID real (Xn)n1 with EX1<, Sn/nμ=EX1 almost surely.

[F5]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)kN be measurable. Then

μ(kNEk)k=0μ(Ek).

For every mN one also has

μ(k<mEk)k<mμ(Ek),

including m=0, where both sides are 0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

For each sample outcome, μ^n is a probability: finite sums of the unit point masses are countably additive and its total mass is n/n=1. For a bounded continuous h, hdμ^n=n1inh(Xi).

givenalgebra
1.2

Let D be the countable class in F1. For every h in D, F2 makes h(Xi) IID; they are bounded and hence integrable. F3 gives their mean hdμ. F4 yields convergence of the corresponding empirical test integrals.

F1F2F3F4
2.1

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.

F1F5step 1.2
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The standard normal density has total mass one

Statement

Assume AC. The function ϕ(x)=ex2/2/2π is positive and Borel measurable on R, with Lebesgue integral one.

Facts & Assumptions

[F1]

The power-series, product-limit, IVP, functional-equation, and Picard definitions agree: The following descriptions give the same function R(0,): the power series xn/n!; the product limit limn(1+x/n)n; the normalized solution of y=y, y(0)=1; the normalized continuous multiplicative function; and the compact-uniform limit of the Picard iterates.

[F2]

The exponential function is smooth and (exp)=exp: The real exponential function is C, and for every mN, exp(m)=exp. In particular (exp)=exp.

[F3]

Continuous functions on Euclidean spaces are Borel measurable: Assume the Axiom of Countable Choice. Let n,m1. Every continuous map f:RnRm is Borel measurable in the sense of def-borel-and-lebesgue-measurable-function-on-rn.

[F4]

Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}: Let F be a complete ordered field (def-complete-ordered-field). Then every aF with a0 has a unique sF with s0 and s2=a; we write s=a. Consequently the positive elements of F are exactly the nonzero squares: x>0 if and only if x=y2 for some y0.

[F5]

Substitution: if φ is differentiable on [c,d] with φ integrable and f is continuous on an interval containing φ([c,d]), then φ(c)φ(d)f=cd(fφ)φ: Let c<d be reals and let φ:[c,d]R be differentiable at every point of [c,d] as a function on [c,d] (def-derivative), with φ integrable on [c,d] (def-darboux-integral). Let JR be order-convex with at least two elements (def-interval) with φ[[c,d]]J, and let f:JR be continuous on J (def-continuity-real).

Then (fφ)φ is integrable on [c,d] and

φ(c)φ(d)f  =  cd(fφ)φ,

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: φ(d) may lie below φ(c), and φ may return to the same value many times. The proof runs through a primitive of f and the chain rule, and no inverse function is ever formed.

Continuity of f is a hypothesis and cannot be weakened to integrability. With f merely integrable the composite fφ 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.

[F6]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: Let a<b be reals and let f:[a,b]R be continuous on [a,b] (def-continuity-real). Then f is bounded (def-bounded-set) and Riemann integrable on [a,b] (def-darboux-integral).

The proof gives more than integrability: it gives a partition that works. For every real ε>0 the uniform partition into N parts already satisfies U(f,P)L(f,P)<ε, as soon as N is large enough that (ba)/N is below the δ that uniform continuity supplies for ε/(2(ba)). Uniform continuity is exactly what makes one δ serve all N subintervals at once, and it is the only place where the compactness of [a,b] is used.

[F7]

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 a<b and let f:[a,b]R be bounded and Riemann integrable. Then f is Lebesgue measurable on [a,b] and is integrable there, and its Lebesgue integral equals its Riemann integral: [a,b]fdλ1=abf(x)dx.

This is the point at which the completeness of Lebesgue measure is used essentially: the proof obtains a Borel function equal to f almost everywhere, and measurability of f itself is then a completeness statement.

[F8]

Monotone convergence for the integral: Let 0f1f2 be measurable and suppose fn(x)f(x) for every x. Then fndμfdμ.

[F9]

The Gaussian integral ex2dx=π: ex2dx=π.

[F10]

Monotonicity and nonnegative homogeneity of the nonnegative integral: Let f,g:X[0,+] be measurable and let c0.

  1. If fg, then fdμgdμ.
  2. cfdμ=cfdμ.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

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.

F1F2F3F4
2.1

For integer n1, F5 with φ(x)=x/2 and continuous f(t)=exp(-t^2) gives nnex2/2dx=2n/2n/2et2dt. 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.

F5F6F7step 1.1
3.1

The nonnegative functions ex2/21[n,n] increase to ex2/2. By F8, its Lebesgue integral is the limit of the compact integrals in step 2.1. F9 identifies the right-hand improper limit as 2π=2π; 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.

F8F9F10step 2.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Standard normal and normal laws

Definition

Assume AC. Define γ(E)=Eex2/2/2πdx for Borel E in R. 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 N(0,1). For mR and σ0, define N(m,σ2) as the law of xm+σx on (R,B,γ). 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 N(m,0)=δm in The Dirac set function at a point.

5 · Examples, counterexamples and false statements

None yet.

Sources