Alphabeta Math
Pipeline-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.

Parametric Bernstein–von Mises limits and misspecification

1 · Prerequisites

2 · Summary

Objective

This page proves a finite-dimensional total-variation Bernstein–von Mises theorem from compact-uniform LAN, a continuous positive prior density at an interior point, and posterior contraction at the LAN parameter rate. It separately proves the iid misspecified LAN route under differentiability in P0-probability, a square-integrable local log-likelihood Lipschitz envelope, and a positive-definite second-order KL-contrast expansion. The resulting BvM corollary keeps the every-diverging-radius parameter-contraction premise explicit.

The MLE result separately assumes consistency and oP0(n−1) approximate maximization and derives the sandwich covariance. It does not claim those MLE hypotheses follow from posterior consistency. For a QMD path with supplied jointly measurable density versions, the normalized absolutely continuous likelihood component is used and the singular product-law mass is controlled in total variation. That corollary states the BvM prior, positive-finite-evidence, and parameter-rate-contraction conditions explicitly. The existing QMD-to-LAN supplier is only fixed-sequence; compact-uniform proxy LAN remains an additional premise in that branch. The source-specific iid smoothness route is proved independently.

The page requires the misspecified-consistency and LAN/contiguity prerequisites named in the scaffold manifest. The consistency prerequisite supplies a sufficient almost-sure test criterion and an explicit counterexample to its unrestricted weak-test version. Ordinary consistency does not discharge this page's root-n parameter-contraction premise. The fixed-sequence QMD interface likewise leaves compact-uniform proxy LAN as an explicit additional premise.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A square-integrable Lipschitz envelope controls a local empirical process

Statement

Let d≥1 and n≥1, let X1,…,Xn be IID with law P, and let ft:X→R be measurable for t in a neighbourhood of 0∈Rd. Assume f0=0 and that on one P-full set ∣ft(x)−fs(x)∣≤M(x)∥t−s∥2 for all such s,t, where M≥0 is measurable and PM2<∞. For Pnf=n−1∑i=1nf(Xi), both displayed sample-path suprema have measurable versions; expectations below are taken using these versions. There is a finite constant Cd, depending only on d, such that for every radius r whose closed ball is in the parameter neighbourhood, Esup⁡∥t∥2≤r∣n(Pn−P)ft∣≤Cdr(PM2)1/2. Moreover, for 0<ε≤r, Esup⁡∥s∥2,∥t∥2≤r∥t−s∥2≤ε∣n(Pn−P)(ft−fs)∣≤Cdεlog⁡(er/ε)(PM2)1/2.

Facts & Assumptions

Given: The IID sample, finite-dimensional parameter ball, measurable function class, common pointwise Lipschitz envelope, and square-integrability hypothesis in the Statement.

[F1]

Identical distribution and IID families: An IID family has a common law and is mutually independent.

[F2]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: Finite products of the sample law and the two-point sign law define the joint probability space used for the ghost sample and signs.

Proof

technique · Symmetrize the centered process and chain its conditional Rademacher process over dyadic Euclidean nets, including pair nets for the local modulus
1.1F1givenconstruct

Let E be the common measurable P-full set in the hypothesis, intersected with {M<∞}. Replace every ft and M by zero off E. This preserves all integrals and every sample path on the measurable probability-one event {Xi∈E for all i}, and gives the Lipschitz bound everywhere. The countable-net suprema below are therefore measurable versions of the original suprema. A radius-r Euclidean ball has finite r2−k-nets Tk with ∣Tk∣≤(Cd2k)d for a finite dimension-dependent constant Cd: cover a containing cube by a grid of side at most r2−k/d and use closed grid cells; from each nonempty compact intersection with the ball, take its lexicographically least point, obtained by successive coordinate minima. The union of these nets is countable and dense. For each fixed sample in the common full set, t↦ft(Xi) is Lipschitz and hence continuous, so the supremum over the ball equals the supremum over that countable union and is measurable; the centered paths are continuous too because ∣Pft−Pfs∣≤PM∥t−s∥2. The same grid argument on the compact pair domain makes the pairwise-modulus supremum measurable. The first supremum is integrable because ∣ft∣≤rM and PM<∞.

1.2F2givenalgebra

Conditional on X1,…,Xn, write Rn(t)=n−1/2∑iεift(Xi), with signs on the product probability space [F2]. Since Eeλεa=cosh⁡(λa)≤eλ2a2/2, its increments satisfy Eεeλ(Rn(t)−Rn(s))≤eλ2(PnM2)∥t−s∥22/2. The inequality for cosh⁡ follows by integrating (log⁡cosh⁡u)′=tanh⁡u≤u for u≥0 and using evenness. Thus each increment is sub-Gaussian with scale (PnM2)1/2∥t−s∥2.

2.1F1F2step 1.1givenalgebra

By [F1] and [F2], adjoin an independent IID copy X1′,…,Xn′ and independent signs εi∈{−1,1}, each equally likely. For each fixed original sample, the supremum of absolute values of affine functions of the ghost sample is convex; Jensen's inequality therefore bounds Esup⁡t∣n(Pn−P)ft∣ by Esup⁡t∣n−1/2∑i(ft(Xi)−ft(Xi′))∣. Each pair (Xi,Xi′) is exchangeable, so independently swapping the members of each pair with sign εi preserves the joint law. The triangle inequality then bounds the last expectation by 2EEεsup⁡t∣n−1/2∑iεift(Xi)∣.

2.2step 1.1step 1.2givenalgebra

Set T0={0} and fix an ordering of each finite net Tk. For each k≥1, let πk(t) be the first nearest point in that ordering; then ∥πk(t)−πk−1(t)∥2≤3r2−k. For N centered sub-Gaussian variables of scale at most σ, the exponential-moment bound gives Emax⁡j≤N∣Yj∣≤log⁡(2N)/λ+λσ2/2 for every λ>0; the case σ=0 is immediate, and otherwise minimizing at λ=2log⁡(2N)/σ gives σ2log⁡(2N). Apply this to the at most ∣Tk∣∣Tk−1∣ links and sum the resulting bounds: Eεsup⁡t∣Rn(t)∣≤Cdr(PnM2)1/2∑k≥12−kk≤Cd′r(PnM2)1/2. Continuity of the sample paths passes from the nets to the full ball.

3.1step 2.1step 2.2givenalgebra

Combine the symmetrization bound in step 2.1 with step 2.2 and use E(PnM2)1/2≤(PM2)1/2, which is Cauchy--Schwarz. Absorbing the numerical factors into Cd proves the first expectation inequality.

4.1F1F2step 2.1step 1.2step 2.2givenconstructalgebra∎

For the modulus bound, apply the ghost-sample and independent-swap argument of step 2.1 to the class gs,t=ft−fs indexed by the compact set Dr,ε={(s,t):∥s∥2,∥t∥2≤r, ∥t−s∥2≤ε}. Conditional on the data, its signed process is Un(s,t)=Rn(t)−Rn(s); its increments between (s,t) and (s′,t′) are sub-Gaussian with scale at most (PnM2)1/2(∥s−s′∥2+∥t−t′∥2) by step 1.2. At pair-mesh ε2−k, grid the ambient product ball, use closed cells and their lexicographically least points in nonempty compact intersections with Dr,ε, and adjoin (0,0). The resulting finite nets have at most (Cr2k/ε)2d points after increasing the dimension-dependent C. The maximum on the initial net has conditional expectation at most (PnM2)1/2ε2log⁡(2N0), since every pair in Dr,ε has ∥t−s∥2≤ε and Un(0,0)=0. Between consecutive nets, the link lengths are at most a constant times ε2−k and the number of links is at most NkNk−1. The sub-Gaussian maximum bound from step 2.2 therefore bounds the expected maximum link at level k by Cd(PnM2)1/2ε2−klog⁡(er/ε)+k. Summing over k≥1 gives Cd(PnM2)1/2εlog⁡(er/ε); continuity extends the net bound to Dr,ε. Symmetrization and E(PnM2)1/2≤(PM2)1/2 prove the second inequality, after increasing Cd.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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].

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The QMD route uses normalized absolutely continuous likelihoods and a separate uniform LAN premise

Statement

Assume AC and a common-dominator iid model with supplied jointly measurable, finite-valued density versions that is QMD at an interior θ∗, with P0=Pθ∗. Put p0=pθ∗, S={p0>0}, and α(u)=Pθ∗+u(Sc). For all sufficiently small u, QMD gives α(u)<1; on S the normalized absolutely continuous component has P0-density qu(x)=pθ∗+u(x)(1−α(u))p0(x). For u=h/n, suppose that for every compact H⊂Rd, the proxy log likelihood satisfies sup⁡h∈H∣∑i=1nlog⁡qh/n(Xi)−hTΔn+12hTVh∣=oP0(1), with Δn=OP0(1) and V≻0. Let the prior be a proper Lebesgue density π continuous and strictly positive on a neighbourhood of θ∗, and let Πn be the posterior based on ∏i=1npθ(Xi) and π. Assume that its evidence is finite and positive almost surely and that, for every deterministic Mn→∞, Πn ⁣(∥θ−θ∗∥2>n−1/2Mn∣X1,…,Xn)=oP0(1). Then the total-variation BvM conclusion holds for the actual posterior. The compact-uniform proxy-LAN condition is an additional hypothesis: Quadratic-mean differentiability implies iid LAN asserts LAN only along each fixed convergent local sequence. No full likelihood ratio for the whole local alternative is asserted.

Facts & Assumptions

Given: AC; a common-dominator QMD path with supplied jointly measurable, finite-valued density versions; the normalized absolutely continuous likelihood proxy; compact-uniform proxy LAN; and the proper prior, finite-positive evidence, and parameter-rate contraction hypotheses stated above.

[A1]

The Axiom of Choice: AC is retained for the explicit assumptions of [F2]–[F5], including their Gaussian-law dependencies. The density versions in [F1] are supplied and require no choice step here.

[F1]

Quadratic-mean differentiability at a parameter: The square-root density residual is o(∥u∥2) in L2(μ) at θ∗.

[F2]

QMD controls singular and zero-overlap masses: The singular mass α(u)=Pθ∗+u(p0=0) and zero-overlap mass β(u)=P0(pθ∗+u=0) are both o(∥u∥22).

[F3]

Normalized product likelihood expansion under QMD: For each convergent local sequence hn→h, the normalized absolutely continuous product proxy has the stated log-LAN expansion and its product law is total-variation close to the full local product law.

[F4]

Quadratic-mean differentiability implies iid LAN: The QMD-to-LAN conclusion is for each fixed convergent local sequence and does not itself assert compact-uniform LAN.

[F5]

Compact-uniform LAN and rate contraction imply a total-variation BvM limit: A compact-uniform LAN expansion for the posterior likelihood ratios, together with the prior and contraction hypotheses, yields the stated total-variation BvM conclusion.

Proof

technique · Convert the compact-uniform proxy expansion to the actual posterior likelihood ratio using the singular-mass bound, then apply the general BvM theorem

Given: The hypotheses in the Statement.

1.1A1F1F2givenalgebra

By [A1, F1, F2], α(u)=o(∥u∥22) and β(u)=o(∥u∥22). For fixed compact H with ∥h∥2≤R, this little-o relation is uniform over ∥u∥2≤R/n: nsup⁡h∈Hα(h/n)→0 and nsup⁡h∈Hβ(h/n)→0.

2.1F2F3F4givenstep 1.1algebra

Under P0, each observation lies in S almost surely. On S, the actual density ratio is pθ∗+u/p0=(1−α(u))qu. For α≤1/2, ∣log⁡(1−α)∣≤2α, so step 1.1 gives sup⁡h∈H∣nlog⁡(1−α(h/n))∣≤2nsup⁡h∈Hα(h/n)⟶0. Thus the actual posterior likelihood ratios have the same compact-uniform LAN expansion as the normalized proxy. The zero-overlap bound in step 1.1 is recorded separately; compact-uniform positivity is supplied by the proxy-LAN hypothesis, not inferred from pointwise QMD.

2.2F2F3givenstep 1.1algebra

For each local u, write Pθ∗+u=(1−α(u))Pˉu+α(u)Su, where Pˉu=quP0 is supported on S and Su is the normalized restriction to Sc when α(u)>0. In the product mixture, the all-Pˉu component has weight (1−α(u))n and every other component is supported outside Sn. Hence ∥Pθ∗+u⊗n−Pˉu⊗n∥TV=1−(1−α(u))n≤nα(u). Step 1.1 makes this o(1) uniformly for h∈H. This comparison is between probability laws and does not identify a full Radon–Nikodym derivative for Pθ∗+u⊗n.

3.1F4F5step 2.1given∎

Step 2.1 supplies the compact-uniform LAN premise for the actual posterior likelihood ratios; the prior, evidence, and posterior-rate hypotheses are those of [F5]. For each n, the iid product experiment is dominated by the finite product of the common sigma-finite dominator, with product densities formed from the supplied jointly measurable versions; iterated integration on rectangles and uniqueness of product measures identify these as the densities of the iid laws. Thus the actual ratios in step 2.1 are the likelihood ratios required by [F5]. Applying [F5] with δn=n−1/2 proves the BvM limit. The fixed-sequence assertion [F4] alone would not justify the compact supremum used here.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN

Statement

Let X1,X2,… be IID from P0 on a measurable space, and let Θ⊂Rd be open, d≥1. Suppose a sigma-finite measure μ and jointly measurable finite-valued densities p0,pθ are supplied, with P0(dx)=p0(x)μ(dx), Pθ(dx)=pθ(x)μ(dx), and pθ∗>0 P0-almost surely. Define the directional contrast K(θ)=E0log⁡p0(X)pθ(X). Assume K is finite near an interior point θ∗, θ∗ is a finite minimizer of K, and, for t→0, E0log⁡pθ∗(X)pθ∗+t(X)=12tTVt+o(∥t∥22) for a fixed symmetric positive-definite matrix V. Assume also that a measurable random vector s(X)∈Rd satisfies log⁡pθ∗+t(X)−log⁡pθ∗(X)−tTs(X)∥t∥2⟶0 in P0-probability as t→0 through nonzero vectors, and that on a neighbourhood U of θ∗ there is a common P0-almost-sure bound ∣log⁡pθ1(X)pθ2(X)∣≤M(X)∥θ1−θ2∥2(θ1,θ2∈U), where M≥0 and E0M2<∞. Then E0s=0 and I=E0[ssT] is finite. With Sn=n−1/2∑i=1ns(Xi) and Δn=V−1Sn, for every compact H⊂Rd, sup⁡h∈H∣∑i=1nlog⁡pθ∗+h/n(Xi)pθ∗(Xi)−hTSn+12hTVh∣=oP0(1). Suprema and convergence in probability use measurable versions obtained by setting the log-ratio class to zero off its common measurable full set. In particular Δn=OP0(1). No equality between I and V is assumed; under misspecification they generally differ.

Facts & Assumptions

Given: The supplied dominated iid density model, finite interior KL minimizer, differentiability in P0-probability, square-integrable local log-Lipschitz envelope, and positive-definite second-order contrast expansion in the Statement.

[F1]

Identical distribution and IID families: The observations have one common law and are mutually independent.

[F2]

Stochastic order and convergence notation for finite-dimensional random vectors: oP(1) means convergence in probability to zero, and OP(1) means boundedness in probability in finite-dimensional Euclidean norm.

[F3]

A square-integrable Lipschitz envelope controls a local empirical process: For an iid sample and a pointwise Lipschitz class with square-integrable envelope M, the local centered-process supremum is at most Cdr∥M∥2 in expectation, and its modulus over parameter pairs at distance at most ε is at most Cdεlog⁡(er/ε)∥M∥2 in expectation.

Proof

Given: The objects and hypotheses in the Statement. Write Pnf=n−1∑i=1nf(Xi) and Gnf=n(Pn−P0)f.

1.1F1F3givenalgebra

Define the log-ratio class to be zero off the common measurable full set of the log-Lipschitz bound, as in [F3]; this changes no integral or almost-sure sample path and makes its suprema measurable. On that full set put ft=log⁡(pθ∗+t/pθ∗) and rt=ft−tTs. Along every coordinate direction ej, faej/a→sj in P0-probability as a→0, while the envelope gives ∣faej/a∣≤M. Dominated convergence along almost-surely convergent subsequences therefore gives E0sj=lim⁡a→0E0faej/a=0, since the contrast expansion makes the last numerator O(a2). The same subsequence argument applied to the directional difference quotients and the common envelope gives ∣sj∣≤M almost surely for every coordinate, hence ∥s∥2≤dM and E0∥s∥22<∞.

1.2givenalgebra

The contrast expansion is uniform after the local substitution: for fixed R, sup⁡∥h∥2≤R∣nE0fh/n+12hTVh∣⟶0, because the remainder divided by ∥t∥22 tends to zero uniformly over 0<∥t∥2≤R/n.

2.1F1F2F3step 1.1givenchoosealgebra

Differentiability in probability says rt/∥t∥2→0 in P0-probability. The bound ∣rt∣/∥t∥2≤M+∥s∥2≤(1+d)M and E0M2<∞ imply E0rt2=o(∥t∥22) by dominated convergence along every sequence t→0. Also ∣rt−ru∣≤L∥t−u∥2 on the common full set, where L=(1+d)M. Fix R>0 and 0<ε≤R, and choose a finite ε-net Hε of the radius-R ball. For each fixed h∈Hε, independence gives E0∣n(Pn−P0)rh/n∣2=n Var⁡0(rh/n)≤nE0rh/n2⟶0. Because the net is finite, the maximum of these centered sums tends to zero in probability. For any h in the ball choose hε∈Hε with ∥h−hε∥2≤ε. The modulus bound [F3], applied to rt with envelope L on radius R/n and distance ε/n, gives E0sup⁡∥h∥2,∥h′∥2≤R∥h−h′∥2≤ε∣n(Pn−P0)(rh/n−rh′/n)∣≤Cd∥L∥L2(P0)εlog⁡(eR/ε). For fixed ε, the finite-net maximum vanishes as n→∞; Markov's inequality bounds the remaining modulus probability by a constant times εlog⁡(eR/ε), which tends to zero as ε↓0. Therefore sup⁡∥h∥2≤R∣n(Pn−P0)rh/n∣=oP0(1).

3.1step 1.1step 2.1step 1.2algebra

For ∥h∥2≤R, decompose ∑i=1nfh/n(Xi)=nE0fh/n+hTSn+n(Pn−P0)rh/n, where E0s=0 from step 1.1. Step 2.1 controls the last term uniformly, and step 1.2 gives the uniform quadratic term. Therefore the displayed LAN remainder is oP0(1) uniformly on every compact H.

4.1F1F2step 1.1algebra∎

Independence, E0s=0, and E0∥s∥22<∞ give E0∥Sn∥22=E0∥s∥22 for every n. Since R21{∥Sn∥2>R}≤∥Sn∥22, P0(∥Sn∥2>R)≤E0∥s∥22/R2, so (Sn) is bounded in probability. Multiplication by the fixed matrix V−1 preserves boundedness because ∥V−1Sn∥2≤∥V−1∥ ∥Sn∥2. Thus Δn=OP0(1) by [F2], completing the LAN assertion.

CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Misspecified iid LAN gives a BvM limit when the posterior has the required parameter rate

Statement

Assume the hypotheses of A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN at θ∗, and assume AC. Let a proper prior have a Lebesgue density continuous and strictly positive near θ∗, and suppose the posterior has finite positive evidence almost surely and contracts in Euclidean parameter norm outside n−1/2Mn for every deterministic Mn→∞. Here the posterior is based on the iid likelihood ∏i=1npθ(Xi). Then its law of n(θ−θ∗) is oP0(1) in total variation from Nd(V−1Sn,V−1),Sn=n−1/2∑i=1ns(Xi). The parameter-rate contraction is an explicit premise. Ordinary consistency at a KL projection alone does not discharge it.

Facts & Assumptions

Given: The local smoothness, finite KL-minimizer, score, and contrast hypotheses of the referenced iid LAN theorem; AC; the stated proper prior, evidence, and every-diverging-radius parameter-contraction hypotheses.

[F1]

A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN: Under its hypotheses, the iid log-likelihood ratio has a compact-uniform n−1/2 LAN expansion with central vector Sn and positive-definite curvature matrix V.

[F2]

Compact-uniform LAN and rate contraction imply a total-variation BvM limit: Compact-uniform LAN, a prior density continuous and positive at the interior center, proper posterior, and contraction outside δnMn for every Mn→∞ imply the event-supremum total-variation BvM limit.

Proof

Given: The hypotheses of the two cited theorems and the posterior-rate condition in the Statement.

1.1F1given

By [F1], take δn=n−1/2 and use Sn as the central vector Δn in [F2]. The local LAN theorem supplies the required compact-uniform expansion with curvature V and proves Sn=OP0(1); [F2] therefore centers the Gaussian at V−1Sn.

2.1F2step 1.1given∎

For each n, the iid sample experiment is dominated by the finite product μ⊗n, with densities p0,n(x1,…,xn)=∏ip0(xi) and pn,θ(x1,…,xn)=∏ipθ(xi). Iterated integration gives the product-law formula on measurable rectangles, so uniqueness of product measures identifies these as densities of P0⊗n and Pθ⊗n. Thus the LAN expansion in [F1] is the log-likelihood ratio for this iid experiment. The prior, evidence, interior-point, and parameter-tail hypotheses in the Statement are exactly the remaining hypotheses of [F2]. Applying [F2] gives the claimed total-variation limit.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A consistent approximate MLE has the misspecified sandwich limit under local LAN conditions

Statement

Assume the hypotheses of A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN and AC. Let θ^n be a measurable estimator such that θ^n→θ∗ in P0-probability and Pnlog⁡pθ^n≥sup⁡θ∈ΘPnlog⁡pθ−oP0(n−1), where the empirical supremum is finite and measurable and the approximation remainder is measurable. Set Pnf=n−1∑i=1nf(Xi). Then, with I=E0[ssT] and Sn=n−1/2∑is(Xi), n(θ^n−θ∗)=V−1Sn+oP0(1) ⇒ Nd(0,V−1IV−1). Thus the MLE sampling covariance is the sandwich matrix V−1IV−1, whereas the BvM posterior covariance is V−1. For the optional recentring conclusion, suppose the posterior Πn is formed from a proper prior with a Lebesgue density continuous and strictly positive on a neighbourhood of θ∗, its evidence is finite and positive almost surely, and for every deterministic sequence Mn→∞, Πn ⁣(∥θ−θ∗∥2>n−1/2Mn∣X1,…,Xn)=oP0(1). Then ∥Πn ⁣(n(θ−θ∗)∈⋅∣X1,…,Xn)−Nd ⁣(n(θ^n−θ∗),V−1)∥TV=oP0(1), by Compact-uniform LAN and rate contraction imply a total-variation BvM limit and the estimator expansion proved here. The consistency and approximate-maximization hypotheses are separate assumptions; this theorem proves neither MLE consistency nor existence of an MLE.

Facts & Assumptions

Given: The iid LAN hypotheses and notation, AC, a measurable consistent estimator, its stated oP0(n−1) approximate-maximization property, and, for the optional recentering conclusion, a proper prior with a Lebesgue density continuous and strictly positive near θ∗, finite positive evidence almost surely, and posterior contraction outside n−1/2Mn for every deterministic Mn→∞.

[F1]

A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN: The score has mean zero and finite second moment, and the log-likelihood expansion is uniform on each compact set of local parameters.

[F2]

Stochastic order and convergence notation for finite-dimensional random vectors: oP(1) denotes convergence in probability to zero and OP(1) denotes boundedness in probability.

[F3]

A square-integrable Lipschitz envelope controls a local empirical process: A local log-likelihood class with square-integrable Lipschitz envelope has expected centered-process supremum at most Cdr(E0M2)1/2 on a radius-r ball.

[F4]

Multivariate iid central limit theorem: Under AC, iid finite-second-moment vectors satisfy the multivariate CLT, including singular covariance.

[F5]

Finite-dimensional stochastic-order calculus and tightness: Finite-dimensional convergence in distribution implies boundedness in probability.

[F6]

Vector Slutsky theorem: If Yn−c=oP(1) and Xn⇒X, then (Xn,Yn)⇒(X,c).

[F7]

Total variation distance for probability laws: ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣.

[F8]

Multivariate normal law, including singular covariance, A positive-definite multivariate normal law has its Gaussian density: Under AC, the multivariate-normal law exists for every positive-semidefinite covariance, including a possibly singular sandwich limit; the positive-definite Gaussian with covariance V−1 also has its usual Lebesgue density for the optional recentering argument.

[F9]

Compact-uniform LAN and rate contraction imply a total-variation BvM limit: For a dominated finite-dimensional experiment with supplied jointly measurable density versions, a proper Lebesgue prior density continuous and strictly positive near the interior center, finite positive evidence almost surely, compact-uniform LAN, and contraction outside δnMn for every deterministic Mn→∞, the posterior has the stated total-variation BvM limit.

[A1]

The Axiom of Choice: AC is used by the CLT [F4] and Gaussian-law/density suppliers [F8], and nowhere in the likelihood-optimization argument.

Proof

technique · First establish root-$n$ tightness by testing dyadic shells against the local quadratic KL loss; then use the compact-uniform LAN quadratic to identify the approximate maximizer

Given: The objects and hypotheses in the Statement.

1.1F1F3givenchoose

Write ft=log⁡(pθ∗+t/pθ∗). Positive definiteness of V and the contrast expansion in [F1] give constants c,ρ>0 with E0ft≤−c∥t∥22 for ∥t∥2≤ρ. Use the measurable versions from [F3], obtained by zero extension off the common log-Lipschitz full set. The log-Lipschitz envelope and [F3] give E0sup⁡∥t∥≤r∣Gnft∣≤Cr for r≤ρ, where Gn=n(Pn−P0) and C=Cd(E0M2)1/2.

2.1F1F2F3step 1.1givenchoosealgebra

Let ηn=n(sup⁡θ∈ΘPnlog⁡pθ−Pnlog⁡pθ^n). The assumption gives ηn=oP0(1) by [F2]. For fixed A≥1, set rj=2jA/n and consider shells rj≤∥θ^n−θ∗∥2≤2rj with 2rj≤ρ. On such a shell, approximate maximization implies nPnfθ^n−θ∗≥−ηn, while step 1.1 bounds the mean term above by −cnrj2. On {ηn≤cA2/2} this forces sup⁡∥t∥≤2rj∣Gnft∣≥(c/2)nrj2. For nonnegative Z and a>0, a1{Z≥a}≤Z implies P0(Z≥a)≤E0Z/a; apply this to the supremum and threshold above, then step 1.1 gives C′/(nrj)=C′/(2jA). Summing over the shells, using consistency to remove ∥θ^n−θ∗∥>ρ/4, and then taking A→∞ proves n(θ^n−θ∗)=OP0(1).

3.1A1F4F5step 2.1given

Set h^n=n(θ^n−θ∗) and hn∗=V−1Sn. By [F4] the score sums converge in distribution; [F5] makes Sn and hn∗ bounded in probability. Step 2.1 gives the same for h^n. Since θ∗ is interior, θ∗+hn∗/n∈Θ with probability tending to one.

4.1F1step 3.1givenalgebra

On any fixed ball containing h^n and hn∗ with probability arbitrarily close to one, [F1] expands both log likelihoods uniformly. Approximate maximization then gives Qn(h^n)≥Qn(hn∗)−oP0(1),Qn(h)=hTSn−12hTVh. Completing the square gives Qn(hn∗)−Qn(h^n)=12(h^n−hn∗)TV(h^n−hn∗)≥12λmin⁡(V)∥h^n−hn∗∥22. Hence h^n−hn∗=oP0(1).

5.1A1F1F4F6F8step 4.1

By [F1], V−1s(Xi) is centered, iid, and has covariance V−1IV−1. Applying the multivariate CLT [F4] to these vectors gives hn∗=V−1Sn⇒Nd(0,V−1IV−1), including when this covariance is singular. Then [F6] and step 4.1 give h^n⇒Nd(0,V−1IV−1). This is the sandwich sampling covariance; it need not equal the posterior covariance V−1.

6.1F7F8F9step 4.1givenalgebra∎

For each n, the iid sample experiment is dominated by the finite product μ⊗n, with densities p0,n(x1,…,xn)=∏ip0(xi) and pn,θ(x1,…,xn)=∏ipθ(xi). Iterated integration gives the product-law formula on measurable rectangles, so uniqueness of product measures identifies these as densities of P0⊗n and Pθ⊗n. Their likelihood ratio is the sum in the LAN conclusion of [F1]. Under the optional prior, evidence, and posterior-rate conditions in the Statement, [F9] therefore gives the BvM approximation centered at hn∗. Let φV be the density of Nd(0,V−1) from [F8]. The fundamental theorem of calculus and translation invariance of Lebesgue measure give ∫∣φV(x−a)−φV(x−b)∣ dx≤∥a−b∥2∫∥∇φV(x)∥2 dx. The last integral is finite because ∇φV(x)=−VxφV(x) and the Gaussian has a finite first moment. Taking a=h^n, b=hn∗ and using step 4.1 makes this Gaussian-shift TV distance oP0(1). The triangle inequality with the BvM approximation proves the recentered conclusion.

5 · Examples, counterexamples and false statements

None yet.

Sources