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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Nonregular and Misspecified Limits

1 · Prerequisites

2 · Summary

This page covers two limits that require conditions beyond regular interior likelihood theory. Under misspecification, a separated interior population target and explicit score and Hessian laws give the sandwich covariance H−1JH−T. At a boundary, a uniform local quadratic likelihood over convergent tangent cones gives a difference of squared Fisher distances. The uniform endpoint MLE supplies a support-changing counterexample: its rate is n, its limit is exponential, and the model is not QMD.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Pseudo-true parameter under misspecification

Definition

Let X be a set, let A be a sigma-algebra on it, let Θ⊆Rd be nonempty, and let μ be a fixed sigma-finite measure on (X,A). Suppose (pθ)θ∈Θ is a specified family of nonnegative measurable densities with ∫pθ dμ=1. Let P be the actual data probability measure; it need not equal any model law pθμ (Probability measures and probability spaces). Assume pθ(X)>0 P-almost surely and ℓθ(X):=log⁡pθ(X) is integrable under P for every parameter considered. Expectation means integration against P (Expectation of a nonnegative or integrable random variable).

The population log-likelihood criterion is MP(θ):=EP[ℓθ(X)]. A pseudo-true parameter is any maximizer θ∗∈argmax⁡θ∈ΘMP(θ). It is unique when this argmax set is the singleton {θ∗}. The model is misspecified relative to P when P≠pθμ for every θ∈Θ. This definition does not assert existence, uniqueness, interiority, or separation of the maximizer; those are theorem hypotheses when needed.

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

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Fisher-information metric distance to a set

Definition

Let d≥1 and let I be an invertible real symmetric positive-definite d×d matrix. Define ∥v∥I:=vTIv for v∈Rd. For a nonempty set C⊆Rd define

dI(x,C):=inf⁡c∈C∥x−c∥I.

This is the distance from x to C in the norm induced by I. The definition uses an infimum; attainment is proved separately when a later result requires it.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Quadratic likelihood optimization is squared Fisher distance

Statement

Let d≥1, let I be an invertible real symmetric matrix such that vTIv>0 for every nonzero v∈Rd, let z∈Rd, and let C⊆Rd be nonempty and closed in the Euclidean metric. Define qz(h):=zTh−12hTIh. Then there is a constant λ>0 such that hTIh≥λ∥h∥22 for all h, qz attains its maximum on C, and

sup⁡h∈Cqz(h)=12zTI−1z−12dI2(I−1z,C).

Facts & Assumptions

Given: d≥1, I, z, and C as in the Statement.

[F1]

The Euclidean inner product is ⟨u,v⟩=uTv and its norm is ∥u∥2=uTu (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F2]

A Euclidean closed ball is B‾2(c,r)={x:∥x−c∥2≤r}, and the unit sphere is Sd−1={x:∥x∥2=1} (Euclidean spheres and closed balls as subspaces of Rn).

[F5]

A continuous real-valued function on a nonempty compact metric space attains its maximum and minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

[F7]

For symmetric positive-definite I, dI(x,C)=inf⁡c∈C(x−c)TI(x−c) (Fisher-information metric distance to a set).

Proof

Given: The matrix, vector and set in the Statement.

1.1F1F2F4F5given

On the unit sphere Sd−1 of [F2], the function u↦uTIu is continuous and strictly positive. The sphere is nonempty, closed and bounded, hence compact by [F4]; [F5] gives a minimum λ>0, since a zero minimum would be attained at a unit vector and contradict positive definiteness. Rescaling any nonzero h to the unit sphere gives hTIh≥λ∥h∥22, also valid for h=0.

1.2F1F6givenalgebra

Completing the square gives qz(h)=12zTI−1z−12(h−I−1z)TI(h−I−1z). By [F1] and [F6], qz(h)≤∥z∥2∥h∥2−12λ∥h∥22, which tends to −∞ as ∥h∥2→∞.

2.1F2F3F4F5step 1.2givenchoose

Choose c0∈C. By step 1.2 there is R>∥c0∥2 such that qz(h)<qz(c0) whenever ∥h∥2≥R. The set C∩B‾2(0,R) is nonempty, closed and bounded, hence compact by [F2]–[F4]. The continuous quadratic qz attains a maximum there by [F5]; values outside are below qz(c0), so this is a global maximum on C.

3.1F7step 1.2step 2.1∎

The identity of step 1.2 says that maximizing qz over C is equivalent to minimizing (h−I−1z)TI(h−I−1z). Step 2.1 proves that this minimum is attained; by [F7] it equals dI2(I−1z,C). Substitution gives the stated supremum formula.

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

Likelihood-ratio limit for local cones in a QMD model

Statement

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

Let d≥1, let Θ0⊆Θ⊆Rd, and let θ0∈Θ0. Assume the full-model parameter set Θ is open in Rd, so θ0 is interior for the QMD model. Under Pθ0, let X1,…,Xn be IID and let ℓn(θ)=∑i=1nlog⁡pθ(Xi) be their sample log-likelihood. Define local parameter sets Cn:=n(Θ−θ0) and C0n:=n(Θ0−θ0). Assume the model is QMD at θ0 as in Quadratic-mean differentiability at a parameter, and write I:=Eθ0[sθ0sθ0T] for its Fisher information; assume I is positive definite, meaning vTIv>0 for every nonzero v. Suppose Cn and C0n are closed in the Euclidean metric (their complements are open), contain 0, and converge locally to nonempty closed convex cones C and C0 with C0⊆C. A cone contains 0 and is closed under multiplication by every nonnegative scalar; convex means that the set contains the line segment between each pair of its points. Local convergence means that, for every R>0, there are δn,R→0 such that every point of Cn∩B‾2(0,R) or C∩B‾2(0,R) is within δn,R in Euclidean distance of the other set, and likewise for C0n and C0. Here a point x is within δ of a set A when inf⁡a∈A∥x−a∥2≤δ.

Assume a uniform local quadratic likelihood expansion: for h∈Cn,

ℓn(θ0+h/n)−ℓn(θ0)=hTZn−12hTIh+rn(h),

where Zn⇒Z∼Nd(0,I) under Pθ0 and, for every R>0, sup⁡{∣rn(h)∣:h∈Cn, ∥h∥2≤R}→P0. Assume the full and null local log-likelihoods attain maxima at h^n∈Cn and h^0n∈C0n and that both maximizer sequences are tight, meaning that for every η>0 some R<∞ makes the limiting upper probability of either norm exceeding R at most η. For

Tn:=2[sup⁡h∈Cn{ℓn(θ0+h/n)−ℓn(θ0)}−sup⁡h∈C0n{ℓn(θ0+h/n)−ℓn(θ0)}],

the likelihood-ratio statistic satisfies

Tn⇒dI2(I−1Z,C0)−dI2(I−1Z,C),

where dI is the Fisher-information distance of Fisher-information metric distance to a set. QMD alone is not asserted to imply the uniform expansion or tightness hypotheses.

Facts & Assumptions

Given: AC, the model, local parameter sets, expansion, convergence, and tightness hypotheses in the Statement.

[A1]

The Axiom of Choice is assumed for the finite-dimensional normal-law convention used here (The Axiom of Choice).

[F1]

QMD at an interior point means the square-root-density expansion ∫[pθ0+h−pθ0−12hTsθ0pθ0]2dμ=o(∥h∥22) for a square-integrable score and common dominating measure (Quadratic-mean differentiability at a parameter).

[F2]

The Fisher distance is dI(x,A)=inf⁡a∈A(x−a)TI(x−a) (Fisher-information metric distance to a set).

[F3]

The Euclidean inner product is uTv and its norm is ∥u∥2 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F4]

B‾2(0,R)={h:∥h∥2≤R}, and the Euclidean metric has this norm as its distance (Euclidean spheres and closed balls as subspaces of Rn).

[F6]

For nonempty closed A, there is λ>0 with hTIh≥λ∥h∥22, and maximizing qz(h)=zTh−12hTIh over A gives 12zTI−1z−12dI2(I−1z,A); the maximum is attained (Quadratic likelihood optimization is squared Fisher distance).

[F7]

Under AC, Nd(0,I) is a Borel probability law with the stated covariance (Multivariate normal law, including singular covariance).

[F8]

Weak convergence of laws gives the closed-set upper bound lim sup⁡nP(Zn∈F)≤P(Z∈F) for each closed F (Portmanteau theorem).

[F9]

Continuous maps preserve convergence in distribution at points of continuity of the limiting law (Continuous mapping theorem).

[F10]

For real random variables, adding a term converging in probability to zero preserves convergence in distribution (Slutsky's theorem for real random variables).

[F11]

Convergence in probability means that every fixed positive error threshold is exceeded with probability tending to zero (Convergence in probability); convergence in distribution is weak convergence of the laws (Convergence in distribution of random elements).

Proof

Given: The objects and hypotheses in the Statement.

1.1F1F6F3F5givenalgebra

With the supplied QMD information I of [F1], write qz(h)=hTz−12hTIh and mA(z)=sup⁡h∈Aqz(h) for A=C,C0. By [F6], mA(z)=12zTI−1z−12dI2(I−1z,A). If hA(z) is a maximizer, then qz(hA(z))≥qz(0)=0. The lower bound in [F6] and [F5] imply ∥hA(z)∥2≤2∥z∥2/λ (with the bound immediate when hA(z)=0).

1.2F6F3F4F5givenalgebrachoose

Let λ be from [F6], fix M>0, and choose R>2M/λ+1. For An=Cn, A=C (and likewise for An=C0n, A=C0), write mAn,R(z)=sup⁡h∈An∩B‾2(0,R)qz(h). For every ∥z∥2≤M, [F6] gives a maximizer h(z) of qz on A with ∥h(z)∥2≤2M/λ<R−1. Local set convergence supplies points of An within δn,R−1+1/n of h(z), hence inside the radius-R ball for all large n. Conversely, every point of An∩B‾2(0,R) is within δn,R+1/n of a point of A. With BI=∑j,k=1d∣Ijk∣, [F3] and [F5] give ∣qz(h)−qz(h′)∣≤(M+BI(R+1))∥h−h′∥2 for ∥h∥2,∥h′∥2≤R+1 and ∥z∥2≤M. These two directions show sup⁡∥z∥2≤M∣mAn,R(z)−mA(z)∣→0. The same bounds apply to both full and null sets.

2.1A1F7F8step 1.1givenchoose

The sequence Zn is tight. Indeed, for any η>0 choose R with P(∥Z∥2≥R)<η, possible because [F7] supplies a Borel probability law on finite-dimensional Rd. The set {z:∥z∥2≥R} is closed, so [F8] bounds lim sup⁡nP(∥Zn∥2≥R) by η. step 1.1 then makes the maximizers of qZn over C and C0 tight as well.

2.2F11step 1.2given

For An=Cn or C0n, put LAn,R:=sup⁡h∈An∩B‾2(0,R){ℓn(θ0+h/n)−ℓn(θ0)}. The uniform expansion gives ∣LAn,R−mAn,R(Zn)∣≤sup⁡h∈Cn, ∥h∥2≤R∣rn(h)∣→P0 for each fixed R. For fixed M>0 and R>2M/λ+1, step 1.2 therefore gives, for every ε>0, P(∣LAn,R−mA(Zn)∣>ε, ∥Zn∥2≤M)→0, with A=C or C0, respectively.

3.1F11step 1.1step 2.2givenchoose

Given η>0, tightness of Zn lets us choose M so that ∥Zn∥2≤M with limiting probability at least 1−η/3. Choose R>2M/λ+1 large enough that the joint event that both local likelihood maximizers lie in the radius-R ball has limiting probability at least 1−η/3. By step 1.1 both quadratic maximizers also lie in that ball whenever ∥Zn∥2≤M. Thus all four full and truncated suprema agree except on events with total limiting upper probability at most 2η/3. step 2.2 and arbitrariness of η give Tn−2(mC(Zn)−mC0(Zn))→P0.

4.1F2F6F9F10step 1.1step 1.2step 3.1∎

The form ⟨u,v⟩I=uTIv is an inner product; its Cauchy–Schwarz inequality follows by requiring (u−tv)TI(u−tv)≥0 for every real t. Thus the induced norm satisfies the triangle inequality, and taking infima gives ∣dI(x,C)−dI(y,C)∣≤∥x−y∥I. Also vTIv≤BI∥v∥22, where BI is the finite entry sum from step 1.2, so the distance map is Euclidean Lipschitz after composition with the fixed linear map I−1. Therefore g(z):=dI2(I−1z,C0)−dI2(I−1z,C) is continuous. The formula in step 1.1 gives 2[mC(z)−mC0(z)]=g(z). By [F9], g(Zn)⇒g(Z). step 3.1 and [F10] then give Tn⇒g(Z), which is the stated distance-difference law.

Remarks

The uniform local expansion and tightness are explicit hypotheses. The proof does not infer uniformity over bounded local parameters from pointwise LAN, and it does not invoke the regular interior Wilks theorem at a boundary.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The uniform endpoint MLE has rate n, not square-root n

Statement refuted

For an integer n≥1, iid Xi∼Unif⁡[0,θ] with fixed θ>0 have an endpoint MLE with a nonzero root-n fluctuation: n(θ−X(n)) does not converge in probability to zero.

Facts & Assumptions

Given: θ>0, IID observations with density pθ(x)=θ−11[0,θ](x), and X(n):=max⁡1≤i≤nXi.

[F1]

IID means a common law and mutual independence (Identical distribution and IID families); a probability law has total mass one (Probability measures and probability spaces).

[F2]

QMD at an interior point requires a square-root-density score remainder with squared L2(μ) norm o(h2) (Quadratic-mean differentiability at a parameter).

[F3]

For real random variables, Yn⇒Y means convergence of CDFs at every continuity point of the limiting CDF (Convergence in distribution for real random variables).

[F4]

Yn→Py means P(∣Yn−y∣>ε)→0 for every ε>0 (Convergence in probability).

Counterexample

The parameter space is Θ=(0,∞) and the common dominating measure is Lebesgue measure. The MLE is understood almost surely; on the null event X(n)=0, assign any fixed positive value.

Given: The Uniform model and IID sample in the Statement.

1.1F1givenalgebra

On the probability-one event 0<X(n)≤θ, the likelihood at a candidate u>0 is Ln(u)=∏i=1npu(Xi)=u−n1{X(n)≤u}. It is zero for u<X(n), while for u≥X(n) it equals u−n≤X(n)−n=Ln(X(n)), with strict inequality if u>X(n). Thus X(n) maximizes the likelihood almost surely; on the null event X(n)=0, use the arbitrary positive assignment specified above.

1.2F1givenalgebra

For 0≤t<nθ, independence and the uniform CDF give Pθ{n(θ−X(n))>t}=Pθ{Xi<θ−t/n for every i}=(1−t/(nθ))n. For fixed t≥0 this formula applies for all sufficiently large n, and its limit is e−t/θ.

1.3F2givenassume-contraalgebradischarge-contradiction: the gained-support remainder is not $o(h^2)$

For every h>0 small enough that θ+h>0, the gained support interval (θ,θ+h] has pθ=0 and pθ+h=1/(θ+h). If the model were QMD at θ, the score term in [F2] would vanish on this interval and the squared remainder integral would be at least ∫θθ+hpθ+h(x) dx=h/(θ+h). But [h/(θ+h)]/h2=1/[h(θ+h)]→∞, contradicting the required o(h2) remainder. Thus the model is not QMD at θ.

2.1F3step 1.2

Therefore the nonnegative variable n(θ−X(n)) converges in distribution to the exponential law with rate 1/θ, whose CDF is 0 for t<0 and 1−e−t/θ for t≥0. The limiting CDF is continuous, so [F3] applies at every real t.

3.1F4step 1.2step 2.1algebra∎

For any ε>0 and all n>ε2/θ2, the exact maximum formula gives Pθ{n(θ−X(n))>ε}=(1−ε/(θn))n→0. Thus n(θ−X(n))→P0 by [F4], refuting the stated nonzero root-n fluctuation and confirming the faster n rate in step 2.1.

5 · Examples, counterexamples and false statements

None yet.

Sources