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.

Portmanteau theorem

Statement

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 sup⁡nμn(F)≤μ(F) for every closed F; (iv) lim inf⁡nμn(G)≥μ(G) for every open G; (v) μn(A)→μ(A) for every Borel A with μ(∂A)=0.

Facts & Assumptions

[F1]

∣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 A⊆X be nonempty and let x,y∈X. 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 u↦d(u,A) changes by at most d(u,v) between u and v: it is 1-Lipschitz.

[F2]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fn→f almost everywhere and ∣fn∣≤g almost everywhere for a single nonnegative measurable function g with ∫g dμ<+∞. Then f∈L1(μ), ∫∣fn−f∣ dμ⟶0, and hence ∫fn dμ⟶∫f dμ.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1F1F2

(i) implies (ii) because a uniformly continuous function is continuous. Suppose (ii), and let F be nonempty and closed. By F1, fm(x)=max⁡(0,1−md(x,F)) is bounded and uniformly continuous. Moreover fm↓1F. Thus lim sup⁡nμn(F)≤∫fm dμ for every m. F2 with majorant one gives (iii) as m tends to infinity. For F empty the inequality is zero<=zero.

1.2givenalgebra

For G open, apply (iii) to its closed complement and use μn(G)=1−μn(S∖G) to obtain (iv). Conversely the same complement calculation obtains (iii) from (iv). If A is a Borel continuity set, A∘⊆A⊆A‾ and μ(A∘)=μ(A)=μ(A‾). The open lower bound and closed upper bound therefore squeeze μn(A) to μ(A), proving (v).

1.3givenalgebra

Assume (v), and fix a bounded continuous real f and η>0. The disjoint level sets with μ(f=t)≥1/r number at most r for each positive integer r. Their union over r contains all positive-mass levels and is countable (each finite subset of the real line can be listed in increasing order). Choose finitely many increasing levels t0<⋯<tm outside this countable set, with t0<−∥f∥∞, tm>∥f∥∞ and mesh below η. Such levels exist in every open interval, since an interval is uncountable.

2.1step 1.3∎

For Aj={tj−1≤f<tj}, continuity of f gives ∂Aj⊆{f=tj−1}∪{f=tj}, so (v) applies. The simple function s=∑jtj−11Aj satisfies ∣f−s∣≤η everywhere. Therefore ∣∫f dμn−∫f dμ∣≤2η+∣∑jtj−1(μn(Aj)−μ(Aj))∣. The finite sum tends to zero, by step 1.3 and (v). Letting η tend to zero proves (i), closing all equivalences.

Depends on

Used by

Dependency tree · two levels

44 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