Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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.

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))n∈N be complete metric spaces with dn≤1. On ∏nXn, the formula D(x,y)=∑n=0∞2−(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 n∈N 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 sup⁡nμn(F)≤μ(F) for every closed F; (iv) lim inf⁡nμ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)n∈N be an increasing sequence of measurable sets for a measure μ, so En⊆En+1. Then

μ(⋃n∈NEn)=sup⁡n∈Nμ(En).

No finiteness hypothesis is required.

[F7]

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

μ(⋃k∈NEk)≤∑k=0∞μ(Ek).

For every m∈N 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.1F1F2F3

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=0∞2−(j+1)∣xj−yj∣ by F2. It is totally bounded: choose an integer N≥1 with tail ∑j≥N2−(j+1)<η/2 and a finite mesh in coordinates 0,…,N−1 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.

1.2F4F5

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 m≥1, 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 sup⁡jνnj(e(Km))≥1−1/m. Hence the Borel set E=⋃m≥1e(Km)⊆e(S) has ν mass one.

1.3F5

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

1.4F5F6

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(⋃i≤nUi)≤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=⋃i≤rUi one has μnj(Gr)≤1−ε eventually. The open bound in F5 yields μ(Gr)≤lim inf⁡jμnj(Gr)≤1−ε. F6 as r tends to infinity would give μ(S)<=1-ε, a contradiction. Thus a uniform finite initial union exists.

2.1F3F7step 1.4∎

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

Depends on

Used by

Dependency tree · two levels

53 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources