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.
Weak limits are unique
Statement
Bounded continuous real tests determine Borel probability measures on any metric space. In particular, weak limits are unique.
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 .
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.
If and have equal integrals of every bounded continuous test, the constant sequence converges weakly to . F1 gives for every closed F. Reverse the roles to get equality.
The class of Borel sets on which the two probabilities agree contains S, is closed under complements and disjoint countable unions, and contains the closed sets by step 1.1. Closed sets form a -system generating the Borel -algebra; F2 therefore gives equality on all Borel sets. If a sequence has two weak limits, uniqueness of each numerical integral limit gives the hypothesis of step 1.1, so those limits agree.
Depends on
Used by
Dependency tree · two levels
11 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, definiteness argument, pp. 9–10 (standard reference, not scraped)