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.
Compact-uniform LAN approximates compact-prior posteriors
Statement
Assume AC.
Let be compact, let be a probability measure on , and let be base laws. Suppose is jointly measurable in , nonnegative, and satisfies for every . Let under , where is positive semidefinite, and put Assume the random variable is measurable and . Let the prior-predictive law be with , and define posteriors where an arbitrary probability measure is assigned if a denominator is zero. Then In particular the posterior laws converge in expected total variation, because their event-probability differences are bounded by this distance. The convention for total variation is Total variation distance for probability laws.
This lemma assumes an uniform likelihood-field approximation. Pointwise LAN alone does not supply that hypothesis.
Facts & Assumptions
Given: AC; the compact set and prior, the mean-one likelihood field, the central sequence and its Gaussian limit, and the measurable uniform approximation above.
The Axiom of Choice: AC is assumed for the multivariate normal law.
Convergence in distribution of random elements: Weak convergence of gives convergence of expectations for bounded continuous functions.
Dominated convergence: For a nonnegative integrable , as , since .
Multivariate normal law, including singular covariance and Standard normal and normal laws: For , ; completing the square in the standard normal density gives , so .
Measurability of integration against a kernel: Integrating a jointly measurable nonnegative function against the prior gives measurable predictive densities and posterior integrals.
Markov's inequality for random variables: For nonnegative integrable and , .
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: A nonnegative jointly measurable function may be integrated in either order.
Continuous mapping theorem: Applying a continuous map to weakly convergent random elements preserves convergence in distribution.
Dominated convergence: Pointwise convergence under a common integrable majorant passes through the integral.
The Euclidean inner product on : is the Euclidean norm.
Weakly convergent sequences are tight: A weakly convergent sequence of probability laws on is tight.
Proof
Proof technique: normalize the two posterior densities and control their denominators on tight central-sequence sets.
By [F4], integration against the prior makes measurable; [F6] gives . Also so . The function is continuous: if , then for each , and compactness of gives a common finite bound on ; [F8] passes the limit through the prior integral. Thus [F1] and [F7] give . By [F3], . Write and , and discard finitely many indices so . For , weak convergence of the bounded continuous cutoff and convergence of the means give . Since , the limsup of the tail expectations is at most , which tends to zero by [F2]. The finitely many initial integrable terms also have vanishing tails; thus is uniformly integrable on this eventual index range.
Fix . On the compact set , the continuous function has a positive minimum , since each and is a probability. On the event and , one has . For the two posterior densities with respect to , Thus the posterior total variation distance is at most on this event.
The sequence is tight by [F10] because it converges in distribution. For any , First choose large using uniform integrability from step 1.1, then large using tightness. Since and , the predictive probability of is correspondingly small.
On , for some finite . By [F5], using . On the complement of the exceptional events established in the preceding two steps, step 1.2 bounds the posterior distance by , and . Its predictive expectation is therefore at most . The distance is at most two on the exceptional events, whose predictive probabilities vanish as first and then . This proves the first conclusion.
For bounded continuous , the predictive law satisfies For a cutoff , is bounded and continuous, so its expectation converges by [F1]. The tail error is at most , which tends uniformly to zero as by step 1.1. Thus the limit is . This is the Gaussian-shift mixture with base law and density .
Depends on
- Local asymptotic normality for local experiments
- Convergence in distribution of random elements
- Multivariate normal law, including singular covariance
- Standard normal and normal laws
- The standard normal density has total mass one
- Measurability of integration against a kernel
- Markov's inequality for random variables
- Continuous mapping theorem
- Total variation distance for probability laws
- The Axiom of Choice
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Dominated convergence
- Weakly convergent sequences are tight
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
76 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
- John Duchi, A few notes on contiguity, asymptotics, and local asymptotic normality, §3.1, PDF pp. 13–16 (standard reference, not scraped)
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 23, PDF pp. 11–13 (standard reference, not scraped)