Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The bounded-Lipschitz metric characterizes weak convergence on Polish spaces

Statement

Assume the Axiom of Choice. Let (S,d) be a Polish space, and let μn,μ be Borel probability measures on S. Define

βBL(ν,ρ):=sup⁡{∣∫g dν−∫g dρ∣:g:S→R, ∥g∥∞≤1, Lip⁡d(g)≤1},

where Lip⁡d(g):=sup⁡x≠y∣g(x)−g(y)∣/d(x,y), with value 0 when S has at most one point. Then

μn⇒μ⟺βBL(μn,μ)⟶0,

where ⇒ is weak convergence of Borel probabilities (Weak convergence of borel probability measures). The implication from bounded-Lipschitz convergence to weak convergence is choice-free; the reverse implication below uses AC through Prokhorov's theorem.

Facts & Assumptions

[F1]

Weak convergence of borel probability measures: μn⇒μ means convergence of integrals for every bounded continuous real test function.

[F2]

Portmanteau theorem: Weak convergence of Borel probabilities on a metric space is equivalent to the closed-set bound lim sup⁡nμn(F)≤μ(F) for every closed F.

[F3]

Prokhorov tightness theorem on polish spaces: Assume AC. A family of Borel probabilities on a Polish space is tight if and only if it is relatively sequentially compact for weak convergence.

[F4]

Dominated convergence: If measurable functions converge pointwise almost everywhere and are dominated by one integrable function, their integrals converge.

[F5]

Polish spaces are separable completely metrizable spaces: A Polish space is separable and completely metrizable.

[F6]

Finite measures agreeing on a generating pi-system and on the whole space are equal: finite measures agreeing on a generating pi-system and on the whole space agree on its generated sigma-algebra.

[A1]

The Axiom of Choice: AC is used only for the Prokhorov implication from relative sequential compactness to tightness in step 2.2; step 1.2 proves the reverse metric implication without AC.

Given: The objects in the statement and AC for step 2.2.

Proof

1.1givenF4F6algebra

Nonnegativity, symmetry and the triangle inequality for βBL follow by applying these properties to the difference of the two test integrals and then taking the supremum. If βBL(ν,ρ)=0, fix a nonempty closed F and put gm=(1−md(⋅,F))+. The function gm/m is an admissible test, so ∫gm dν=∫gm dρ. By [F4], these integrals decrease to ν(F) and ρ(F), respectively. The two probabilities therefore agree on every closed set, including the empty set. Closed sets form a pi-system generating the Borel sigma-algebra, and both total masses are one, so [F6] gives ν=ρ. Thus βBL is a metric; this argument uses no choice.

1.2givenF1

Assume βBL(μn,μ)→0, and fix a nonempty closed set F⊆S. For every integer m≥1, the function gm(x)=(1−md(x,F))+ satisfies 0≤gm≤1 and Lip⁡d(gm)≤m. Hence gm/m is admissible in the definition of βBL, so ∫gm dμn→∫gm dμ. Since 1F≤gm, it follows that lim sup⁡nμn(F)≤∫gm dμ for every m.

1.3givenF1choose

Now assume μn⇒μ, and put A={μ}∪{μn:n≥1}. Any sequence chosen from A either has a member repeated infinitely often, yielding a constant convergent subsequence, or has a subsequence of the form (μnj) with nj→∞, which converges weakly to μ. Therefore A is relatively sequentially compact for weak convergence.

2.1F1F2F4step 1.2

The functions gm decrease pointwise to 1F and are bounded by the integrable constant function 1 under the probability μ. By [F4], ∫gm dμ→μ(F), so the closed-set bound holds; it is trivial for F=∅. The Portmanteau theorem [F2] gives weak convergence in the sense of [F1].

2.2A1F3F5step 1.3

By [F5], S is Polish; therefore [F3] applies under [A1] and A is tight. Thus for every ε>0 there is a compact K⊆S such that sup⁡ν∈Aν(Kc)<ε.

3.1givenconstructchoosestep 2.2

Fix η>0. Compactness gives a finite η/8-net x1,…,xq of K. Quantize each value g(xi)∈[−1,1] into finitely many bins of width at most η/2. There are finitely many resulting value patterns for the bounded 1-Lipschitz test class; choose one representative hr from each nonempty pattern. If g and hr share a pattern, then for x∈K a net point xi gives ∣g(x)−hr(x)∣≤2d(x,xi)+∣g(xi)−hr(xi)∣<η.

4.1F1step 2.2step 3.1∎

For any admissible g, choose the representative hr from its pattern. The integral difference is bounded by ∣∫g dμn−∫g dμ∣≤max⁡r∣∫hr dμn−∫hr dμ∣+2η+2μn(Kc)+2μ(Kc). The maximum tends to zero by [F1], because there are finitely many bounded continuous representatives, and the last two terms are at most 4ε by step 2.2. Taking the supremum over g, then the limit superior in n, gives lim sup⁡nβBL(μn,μ)≤2η+4ε. Letting η,ε↓0 proves the reverse implication.

Depends on

Used by

Dependency tree · two levels

38 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