Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 H⊂Rd be compact, let π be a probability measure on H, and let Pn,0 be base laws. Suppose Ln(h,x) is jointly measurable in (h,x), nonnegative, and satisfies ∫Ln(h,x)Pn,0(dx)=1 for every h∈H. Let Δn⇒Z∼Nd(0,K) under Pn,0, where K is positive semidefinite, and put gh(z)=exp⁡(hTz−12hTKh). Assume the random variable an(x):=sup⁡h∈H∣Ln(h,x)−gh(Δn(x))∣ is measurable and EPn,0an→0. Let the prior-predictive law be Mn(dx)=mn(x)Pn,0(dx) with mn(x)=∫HLn(h,x)π(dh), and define posteriors Πn(dh∣x)=Ln(h,x)π(dh)mn(x),ΠG(dh∣z)=gh(z)π(dh)m(z),m(z)=∫Hgh(z)π(dh), where an arbitrary probability measure is assigned if a denominator is zero. Then EMn∫H∣Ln(h,X)mn(X)−gh(Δn(X))m(Δn(X))∣π(dh)⟶0. In particular the posterior laws converge in expected total variation, because their event-probability differences are bounded by this L1(π) distance. The convention for total variation is Total variation distance for probability laws.

This lemma assumes an L1 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 L1 uniform approximation above.

[A1]

The Axiom of Choice: AC is assumed for the multivariate normal law.

[F1]

Convergence in distribution of random elements: Weak convergence of Δn gives convergence of expectations for bounded continuous functions.

[F2]

Dominated convergence: For a nonnegative integrable U, E(U−Q)+→0 as Q→∞, since (U−Q)+≤U.

[F3]

Multivariate normal law, including singular covariance and Standard normal and normal laws: For Z∼Nd(0,K), hTZ∼N(0,hTKh); completing the square in the standard normal density gives Eexp⁡(hTZ)=exp⁡(hTKh/2), so Egh(Z)=1.

[F4]

Measurability of integration against a kernel: Integrating a jointly measurable nonnegative function against the prior gives measurable predictive densities and posterior integrals.

[F5]

Markov's inequality for random variables: For nonnegative integrable U and b>0, P(U>b)≤EU/b.

[F6]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: A nonnegative jointly measurable function may be integrated in either order.

[F7]

Continuous mapping theorem: Applying a continuous map to weakly convergent random elements preserves convergence in distribution.

[F8]

Dominated convergence: Pointwise convergence under a common integrable majorant passes through the integral.

[F10]

Weakly convergent sequences are tight: A weakly convergent sequence of probability laws on Rd is tight.

Proof

Proof technique: normalize the two posterior densities and control their denominators on tight central-sequence sets.

1.1A1F1F2F3F4F6F7F8givenalgebra

By [F4], integration against the prior makes mn measurable; [F6] gives EPn,0mn=1. Also ∣mn(x)−m(Δn(x))∣≤an(x), so EPn,0m(Δn)→1. The function m is continuous: if zj→z, then gh(zj)→gh(z) for each h, and compactness of H gives a common finite bound on gh(zj); [F8] passes the limit through the prior integral. Thus [F1] and [F7] give m(Δn)⇒m(Z). By [F3], Em(Z)=1. Write Un=m(Δn) and U=m(Z), and discard finitely many indices so EUn<∞. For Q>0, weak convergence of the bounded continuous cutoff and convergence of the means give E(Un−Q)+=EUn−E(Un∧Q)→EU−E(U∧Q)=E(U−Q)+. Since u1{u>2Q}≤2(u−Q)+, the limsup of the tail expectations is at most 2E(U−Q)+, which tends to zero by [F2]. The finitely many initial integrable terms also have vanishing tails; thus (Un) is uniformly integrable on this eventual index range.

1.2F9givenalgebra

Fix R>0. On the compact set {z:∥z∥2≤R}, the continuous function m(z) has a positive minimum cR, since each gh(z)>0 and π is a probability. On the event ∥Δn∥2≤R and an≤cR/2, one has mn≥cR/2. For the two posterior densities with respect to π, ∫H∣Ln(h,x)mn(x)−gh(Δn(x))m(Δn(x))∣π(dh)≤2an(x)mn(x)≤4an(x)cR. Thus the posterior total variation distance is at most 4an/cR on this event.

2.1F1F2F10step 1.1givenalgebra

The sequence Δn is tight by [F10] because it converges in distribution. For any Q>0, E[m(Δn)1{∥Δn∥2>R}]≤E[m(Δn)1{m(Δn)>Q}]+QP(∥Δn∥2>R). First choose Q large using uniform integrability from step 1.1, then R large using tightness. Since mn≤m(Δn)+an and Ean→0, the predictive probability of ∥Δn∥2>R is correspondingly small.

3.1F4F5step 1.2step 2.1givenalgebra

On {∥Δn∥2≤R}, m(Δn)≤MR for some finite MR. By [F5], Mn(∥Δn∥2≤R, an>cR/2)≤MR2EancR+Ean→0, using mn≤m+an. On the complement of the exceptional events established in the preceding two steps, step 1.2 bounds the posterior L1(π) distance by 4an/cR, and mn≤MR+cR/2. Its predictive expectation is therefore at most 4(MR+cR/2)Ean/cR→0. The distance is at most two on the exceptional events, whose predictive probabilities vanish as first n→∞ and then R→∞. This proves the first conclusion.

4.1F1step 1.1F3givenalgebra∎

For bounded continuous f, the predictive law satisfies EMnf(Δn)=EPn,0[mnf(Δn)]=EPn,0[m(Δn)f(Δn)]+o(1). For a cutoff Q, (m∧Q)f is bounded and continuous, so its expectation converges by [F1]. The tail error is at most ∥f∥∞E[m(Δn)1{m(Δn)>Q}], which tends uniformly to zero as Q→∞ by step 1.1. Thus the limit is E[m(Z)f(Z)]. This is the Gaussian-shift mixture with base law Nd(0,K) and density m(z).

Depends on

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