Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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