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, 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.
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
- van Gaans, Theorem 4.2 and Lemma 4.3, pp. 10–12 (standard reference, not scraped)