Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Misspecified M-estimator sandwich limit

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Let X1,X2,… be IID from a probability law P that is misspecified relative to the density family pθ, and let ℓθ=log⁡pθ be as in Pseudo-true parameter under misspecification. Write Pnf=n−1∑i=1nf(Xi) and M(θ)=EPℓθ(X). Assume that Θ⊆Rd, d≥1, and that θ∗ is the unique separated interior maximizer of M, where interior means that some Euclidean open ball about θ∗ lies in Θ: for each ε>0 there is ηε>0 such that M(θ∗)−M(θ)≥ηε whenever θ∈Θ and ∥θ−θ∗∥2≥ε. Assume the uniform law sup⁡θ∈Θ∣Pnℓθ−M(θ)∣→P0, and let θ^n∈Θ be a measurable approximate maximizer with sup⁡θ∈ΘPnℓθ−Pnℓθ^n→P0.

Let Sθ(x)=∇θℓθ(x) be continuously differentiable in a neighborhood of θ∗. Assume EPSθ∗=0, EP∥Sθ∗∥22<∞, and set J=EP[Sθ∗Sθ∗T]. Suppose H=EP[∇θSθ∗] is nonsingular, D(θ):=EP[∇θSθ] exists and is continuous at θ∗, and for every sufficiently small fixed δ>0,

sup⁡∥θ−θ∗∥2≤δ∥Pn∇θSθ−D(θ)∥op→P0,

where ∥A∥op:=sup⁡∥v∥2≤1∥Av∥2. Finally assume the approximate score equation n PnSθ^n=oP(1). Then

n(θ^n−θ∗)⇒Nd ⁣(0,H−1JH−T).

The covariance is the sandwich matrix formed from the Hessian H under P and the score second moment J under P. The theorem does not assert that it equals the inverse Fisher information of the fitted model.

Facts & Assumptions

Given: The data, model, criterion, estimator and hypotheses in the Statement.

[A1]

The Axiom of Choice (AC) is assumed. It is used by the multivariate IID central limit theorem below, not by the criterion-gap or Taylor arguments (The Axiom of Choice).

[F1]

A pseudo-true parameter maximizes the actual-law expected log-likelihood; existence, uniqueness and separation are not part of the definition (Pseudo-true parameter under misspecification).

[F8]

An M-estimator maximizes an empirical criterion, with an oP(1) optimization gap for an approximate maximizer (M-estimators).

[F2]

IID means identically distributed and mutually independent, not merely pairwise independent (Identical distribution and IID families).

[F3]

For an integrable random variable, expectation is its integral against P; for square-integrable vectors, covariance is the expected outer product of the centered vector (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).

[F4]

Under AC, IID finite-second-moment random vectors have the multivariate central limit theorem: n−1/2∑i(Yi−EYi)⇒Nd(0,Cov⁡(Y1)) (Multivariate iid central limit theorem).

[F5]

If Un⇒U and a finite-dimensional vector Vn converges in probability to a constant v, then (Un,Vn)⇒(U,v) and continuous functions of the pair preserve convergence; independence is not required (Vector Slutsky theorem).

[F6]

For finite-dimensional random vectors, Yn=oP(1) means P(∥Yn∥2>ε)→0 for every ε>0 (Stochastic order and convergence notation for finite-dimensional random vectors).

[F7]

Scalar convergence in probability means P(∣Yn−y∣>ε)→0, and random elements converge in distribution when their laws converge weakly (Convergence in probability, Convergence in distribution of random elements).

Proof

Given: The objects and hypotheses in the Statement.

1.1givenF1F3F7F8algebra

Put Δn=sup⁡θ∈Θ∣Pnℓθ−M(θ)∣ and rn=sup⁡θ∈ΘPnℓθ−Pnℓθ^n. By assumption Δn→P0 and rn→P0. Since θ^n is an approximate maximizer by [F8], Pnℓθ^n≥Pnℓθ∗−rn, and therefore 0≤M(θ∗)−M(θ^n)≤2Δn+rn.

2.1givenstep 1.1F6F7

For any fixed ε>0, separation gives a positive gap ηε whenever ∥θ^n−θ∗∥2≥ε. Step 1.1 then gives P(∥θ^n−θ∗∥2≥ε)≤P(2Δn+rn≥ηε)→0. Thus θ^n−θ∗=oP(1) by [F6], so with probability tending to one the segment from θ∗ to θ^n lies in any fixed neighborhood on which the score is differentiable.

3.1givenF1F8step 2.1F6algebra

Choose a ball about θ∗ inside the differentiability neighborhood; the measurable event that θ^n lies in this ball ensures its segment from θ∗ stays in that neighborhood. On this event define An=∫01Pn∇θSθ∗+t(θ^n−θ∗) dt; set An=H otherwise. For each fixed parameter in a smaller ball, density measurability makes the log-density measurable, and difference quotients make the sections of Sθ and ∇θSθ measurable. On compact subballs, rounding parameters to rational grids gives countable-valued Borel approximations; continuity in θ makes the score and Hessian fields jointly measurable as pointwise limits. The segment integrand is then measurable, and its continuous sample paths make An the limit of measurable Riemann sums. Given ε>0, continuity of D at θ∗ supplies a sufficiently small fixed δ for which ∥D(θ)−H∥op<ε/2 throughout the δ-ball. Consistency from step 2.1 and the assumed uniform Hessian law imply P(∥An−H∥op>ε)→0.

4.1givenstep 3.1F6algebra

On the same high-probability event, the componentwise fundamental theorem of calculus along the segment gives PnSθ^n=PnSθ∗+An(θ^n−θ∗). By step 3.1, every entry of An−H tends to zero in probability. The determinant and adjugate are polynomials in the entries, so det⁡An→Pdet⁡H≠0 and adj⁡(An)→Padj⁡(H); on the event det⁡An≠0, An−1=adj⁡(An)/det⁡An, hence every entry of An−1−H−1 tends to zero in probability. The finite-dimensional matrix bound ∥B∥op≤dmax⁡j,k∣Bjk∣ then gives ∥An−1−H−1∥op→P0. Rearranging gives n(θ^n−θ∗)=−An−1nPnSθ∗+An−1nPnSθ^n on an event whose probability tends to one.

5.1A1F2F4F5F6step 4.1∎

By [F2], the score vectors Sθ∗(Xi) are IID; their mean is zero and their covariance is J. Their second moment is finite by the Statement, so [F4] and [A1] give nPnSθ∗⇒G with G∼Nd(0,J). The matrix An−1 converges in probability in operator norm to H−1, and the residual vector nPnSθ^n=oP(1) by the Statement. Flattening the matrix entries and concatenating the vectors gives a finite-dimensional vector converging in probability to (H−1,0). Applying [F5] to the continuous map (x,A,r)↦−Ax+Ar gives the limit −H−1G. Its covariance is H−1JH−T, proving the assertion.

Depends on

Used by

Dependency tree · two levels

36 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