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 scaled posterior converges weakly on the negative Sobolev space
Statement
Assume AC and the hypotheses of Weak nonparametric Bernstein–von Mises theorem for product priors. Then the random Borel probability measures converge weakly in probability to on , where weak convergence is the bounded-continuous-test definition in Weak convergence of borel probability measures.
Facts & Assumptions
Weak nonparametric Bernstein–von Mises theorem for product priors: in -probability.
The bounded-Lipschitz metric characterizes weak convergence on Polish spaces: Under AC, convergence in is equivalent to weak convergence on a Polish space.
Weak convergence of borel probability measures: Weak convergence means convergence of integrals for every bounded continuous real test function.
The Axiom of Choice: AC is required only for the weak-topology metrization in [F2]; the bounded-Lipschitz conclusion [F1] itself requires only its stated countable-choice premise.
Given: AC and the main theorem's random posterior measures and limit law.
Proof
By [F2], the bounded-Lipschitz metric is a metric for the weak topology on the Polish space under [A1].
The convergence in probability of this metric to zero in [F1] is exactly convergence in probability in the weak topology established in step 1.1; by [F3], its deterministic convergence relation is bounded-continuous-test convergence. This is the asserted weak posterior limit.
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
- Castillo and Nickl, Nonparametric Bernstein–von Mises theorems in Gaussian white noise, Definition 1 and Theorem 9, printed pp. 2003–2004 and 2019–2020 (standard reference, not scraped)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, Theorem 7.3.19, printed pp. 595–596 (standard reference, not scraped)