Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 and rate contraction imply a total-variation BvM limit

Statement

Assume AC. For each n, let X(n) have law P0,n on a measurable space, and let Θ⊂Rd be open, d≥1. Suppose a supplied sigma-finite measure μn dominates P0,n and the model laws Pn,θ, and suppose jointly measurable finite-valued densities p0,n and pn,θ are supplied. Fix an interior point θ∗∈Θ with pn,θ∗(X(n))>0 P0,n-almost surely. Let the prior be a proper Lebesgue density π continuous and strictly positive on a neighbourhood of θ∗, and assume the displayed likelihood integral is finite and positive almost surely so it defines the posterior Πn(A∣X(n))=∫Apn,θ(X(n))π(θ) dθ∫Θpn,θ(X(n))π(θ) dθ. For δn>0 with δn→0, write ℓn(θ)=log⁡pn,θ(X(n))pn,θ∗(X(n)). Assume V is a fixed symmetric positive-definite d×d matrix, Δn=OP0,n(1), and for every compact K⊂Rd, sup⁡h∈K∣ℓn(θ∗+δnh)−hTΔn+12hTVh∣=oP0,n(1). Also assume that for every deterministic sequence Mn→∞, Πn ⁣(∥θ−θ∗∥2>δnMn∣X(n))=oP0,n(1). Then the posterior law of Hn=δn−1(θ−θ∗) satisfies ∥Πn(Hn∈⋅∣X(n))−Nd(V−1Δn,V−1)∥TV=oP0,n(1), where ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣ over measurable sets. The LAN condition concerns likelihood-density ratios on the P0,n-full set where the denominator is positive; it does not assert a Radon–Nikodym derivative for the entire local model law.

Facts & Assumptions

Given: AC; the finite-dimensional dominated density model, supplied jointly measurable density versions, interior point, proper prior and posterior, compact-uniform LAN expansion, and every-diverging-radius posterior contraction stated above.

[F1]

Dominated statistical experiments: A model is dominated by a supplied sigma-finite positive measure μ when every model law is absolutely continuous with respect to μ.

[F2]

Likelihood densities: A supplied density representative pθ defines the pointwise likelihood Lx(θ)=pθ(x); here the jointly measurable representatives are explicit input.

[F3]

Total variation distance for probability laws: For probabilities P,Q on one measurable space, ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣.

[F4]

Multivariate normal law, including singular covariance: Under AC, Nd(m,Σ) exists for every finite d and symmetric positive-semidefinite covariance Σ.

[F5]

A positive-definite multivariate normal law has its Gaussian density: For Σ≻0, Nd(m,Σ) has the Lebesgue density proportional to exp⁡[−(x−m)TΣ−1(x−m)/2] with normalizing constant (2π)−d/2det⁡(Σ)−1/2.

[F6]

Stochastic order and convergence notation for finite-dimensional random vectors: Yn=OP(1) means its finite-dimensional norm is bounded in probability.

[A1]

The Axiom of Choice: AC is assumed for the Gaussian-law construction in [F4] and the Gaussian-density supplier [F5]; no other choice step is used.

Proof

Given: The hypotheses and notation of the Statement.

1.1F6givenchoose

Let Qn be the posterior law of Hn. The contraction premise implies that (Qn) is tight in probability: for every η,ε>0 there is a finite R such that lim sup⁡nP0,n{Qn(∥h∥2>R)>η}<ε. Otherwise there would be η,ε>0 and increasing radii Rk→∞ with indices nk for which P0,nk{Qnk(∥h∥2>Rk)>η}>ε. Define Mn=Rk for nk≤n<nk+1, with any positive initial values. Then Mn→∞ and the assumed contraction fails along nk, a contradiction.

1.2A1F1F2F5givenalgebra

The supplied common-dominator density setup [F1, F2] makes the posterior likelihood ratio well-defined on the stated P0,n-full set. Fix R>0 and put KR={h:∥h∥2≤R}. Since θ∗ is interior and δn→0, θ∗+δnKR⊂Θ for all sufficiently large n. Relative to Lebesgue measure on KR, the unnormalized posterior density for Hn is proportional to qn(h)=exp⁡(ℓn(θ∗+δnh))π(θ∗+δnh); the Jacobian δnd cancels on conditioning on KR. Set gn(h)=exp⁡(hTΔn−12hTVh). By compact-uniform LAN and continuity of π at θ∗, qn(h)/gn(h)=π(θ∗)(1+oP0,n(1)) uniformly on KR. Completing the square gives gn proportional to the density in [F5] with mean V−1Δn and covariance V−1. If wn=qn/gn and wˉn=∫KRwn dGnKR, where GnKR is the Gaussian law conditioned on KR, the two conditional densities have ratio wn/wˉn. Uniform convergence wn/π(θ∗)→1 implies wˉn/π(θ∗)→1, so sup⁡KR∣wn/wˉn−1∣=oP0,n(1) and their total-variation distance tends to zero.

1.3A1F4F5F6givenalgebra

By [F6] and the assumed Δn=OP0,n(1), the Gaussian means V−1Δn are bounded in probability. For any fixed bound on the mean, its Gaussian probability outside KR is at most the centered Nd(0,V−1) probability outside a ball whose radius tends to infinity with R. For integers m≥1, the sets Fm={z:∥z∥2>m} decrease to the empty set, and Fm=⨆k≥m(Fk∖Fk+1). Countable additivity makes P(Fm) the tail of a convergent nonnegative series, so it tends to zero. Hence the Gaussian tails are tight in probability as R→∞.

2.1F3step 1.1step 1.2step 1.3choosealgebra∎

For any two probability measures P,Q and measurable K, their restrictions conditioned on K satisfy ∥P−Q∥TV≤∥P(⋅∣K)−Q(⋅∣K)∥TV+2P(Kc)+2Q(Kc) whenever both conditioning probabilities are positive. Indeed, for any event A, split it into A∩K and A∩Kc, compare the two conditional masses on K, and use ∣P(K)−Q(K)∣≤P(Kc)+Q(Kc). Choose R so the posterior tail from step 1.1 and Gaussian tail from step 1.3 are arbitrarily small in probability; the conditional distance tends to zero for this fixed R by step 1.2. Letting the tail tolerance decrease to zero proves the asserted full total-variation convergence under [F3].

Depends on

Used by

Dependency tree · two levels

43 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