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 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.
Depends on
Used by
Dependency tree · two levels
23 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.1, pp. 9–10 (standard reference, not scraped)