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.
Continuous images of the scaled posterior converge weakly
Statement
Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Let be a metric space and let be Borel measurable with , where . For every bounded continuous ,
in -probability. In particular this holds for continuous maps, including continuous linear functionals into .
Facts & Assumptions
The scaled posterior converges weakly on the negative Sobolev space: converges weakly in probability to on .
Continuous mapping theorem: If on a metric space and is measurable with , then .
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, the bounded-Lipschitz metric metrizes weak convergence on Polish .
The Axiom of Choice: AC is needed only for the weak-topology interpretation imported through [F1] and [F3]; the continuous-mapping step is the choice-free theorem [F2].
Given: AC, a metric target , the map , and the posterior and limit measures in the statement.
Proof
Fix a bounded continuous and define . If , [F3] gives under [A1]; [F2] and imply , hence . Since is a metric, this sequential criterion proves continuity of at .
Given , continuity from step 1.1 supplies such that implies . Therefore by [F1] and [F3], which give bounded-Lipschitz convergence in probability on . This is the stated convergence in probability for .
Depends on
Used by
Nothing in the library uses this result yet.
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
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, continuous-mapping discussion, §4.1, printed pp. 2021–2022 (standard reference, not scraped)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, continuous-mapping consequence, §7.3.4, printed pp. 600–601 (standard reference, not scraped)