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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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