Alphabeta Math
LemmaStatement: 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 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

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