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.

Semiparametric Efficiency

1 · Prerequisites

2 · Summary

An asymptotically linear estimator has a Gaussian limit under the iid central limit theorem. In a pathwise differentiable model, regularity forces its influence function to represent the path derivative; orthogonal decomposition then gives the covariance bound of the canonical gradient. The separate convolution route treats general regular estimators under explicit LAN, regularity, limit-law, and dense-submodel hypotheses. None of these lower bounds establishes that an attaining estimator exists.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Asymptotic linearity implies asymptotic normality

Statement

Assume the Axiom of Choice. Let X1,X2,… be iid with law P, let k<∞, and let ψ^n estimate ψ(P)∈Rk. If it is asymptotically linear at P with influence function φ∈L02(P)k, then

n{ψ^n−ψ(P)}⇒Nk(0,Σφ),Σφ=P[φφT].

The covariance may be singular. This is a distributional limit only; the theorem asserts neither local regularity nor estimator attainment of an efficiency bound.

Facts & Assumptions

Given: The iid experiment, the finite-dimensional estimator and target, asymptotic linearity with φ∈L02(P)k, and AC.

[F1]

Asymptotically linear estimators and influence functions: ψ^n−ψ(P)=(Pn−P)φ+oP(n−1/2), where Pφ=0 and P∥φ∥2<∞.

[F2]

Multivariate iid central limit theorem: under AC, normalized sums of iid finite-second-moment vectors converge to the centered multivariate normal with their covariance, including singular covariance.

[F3]

Continuous mapping theorem: continuous linear maps preserve convergence in distribution.

[F4]

Slutsky's theorem for real random variables: adding a real random variable converging to zero in probability preserves a real distributional limit.

[F5]

Cramer wold device: convergence of every one-dimensional projection to the corresponding projection of a specified Borel probability law implies vector convergence in distribution; this use assumes AC.

[A1]

The Axiom of Choice: AC is assumed by [F2] and [F5].

Proof

Given: AC, iid Xi∼P, k<∞, and an estimator satisfying [F1].

1.1A1F1F2givenalgebra

Put Zn=n−1/2∑i=1nφ(Xi) and Rn=n{ψ^n−ψ(P)}−Zn. By [F1], Rn→0 in probability. The vectors φ(Xi) are iid, centered, and have finite second moment, so [F2] gives Zn⇒Z∼Nk(0,Σφ). The covariance is positive semidefinite by aTΣφa=P[(aTφ)2]≥0 for every a∈Rk.

2.1F3F4step 1.1given

Fix any a∈Rk. By [F3], aTZn⇒aTZ. Also ∣aTRn∣≤∥a∥∥Rn∥, so aTRn→0 in probability. Apply [F4] to obtain aT(Zn+Rn)⇒aTZ.

3.1A1F5step 1.1step 2.1∎

Step 2.1 holds for every a, and Z is the specified Borel Gaussian law from step 1.1. [F5] therefore gives Zn+Rn⇒Z, which is the asserted limit. No nonsingularity of Σφ is used.

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

Finite-dimensional LAN convolution bound for differentiable functionals

Statement

Assume AC and let d,k≥1 be finite. Let {Pn,h:h∈Rd} be LAN at h=0 with positive-definite information matrix K and central sequence Δn. Let ψn,h∈Rk be a local target such that for every fixed h,

δn(h):=n(ψn,h−ψn,0)⟶Dh

for a fixed matrix D∈Rk×d. Suppose Tn=n(ψ^n−ψn,0) is regular for this target: under each fixed Pn,h, Tn−δn(h)⇒W for the same Borel law W. Then there is a probability law ν on Rk such that

L(W)=Nk(0,DK−1DT)∗ν.

The Gaussian covariance may be singular. No finite-moment hypothesis on W or ν is needed.

Facts & Assumptions

Given: AC; the finite-dimensional LAN experiment, positive-definite K, central sequence Δn; the local target derivative matrix D; and a regular estimator with common limit law W.

[F1]

Local asymptotic normality for local experiments: for each fixed h, a mean-one proxy has log⁡Ln,h=hTΔn−12hTKh+oPn,0(1) and is total-variation close to the actual local law.

[F2]

Regular estimator under local alternatives: for an identity target the centered statistic has a common limit under each fixed local displacement; the statement gives the corresponding target-shift condition explicitly.

[F3]

Le Cam's third lemma for a Gaussian likelihood-ratio limit: the joint limit tilted by the mean-one Gaussian likelihood ratio describes the statistic's limit under the proxy local law.

[F4]

Weakly convergent sequences are tight and Prokhorov tightness theorem on polish spaces: convergent marginal laws are tight, and under AC a tight sequence of joint Borel laws on Euclidean space has a weakly convergent subsequence.

[F5]

Identity theorem for holomorphic functions: two holomorphic functions on a connected complex domain that agree on a set with an interior accumulation point agree throughout the domain.

[F6]

Multivariate normal law, including singular covariance and Characteristic function of a multivariate normal law: Nd(0,K) has characteristic function u↦e−uTKu/2 and finite exponential moments in every real direction.

[F7]

Continuous mapping theorem and Slutsky's theorem for real random variables: continuous projections preserve weak limits, and scalar oP(1) remainders preserve those limits.

[F8]

Uniqueness of a law from its characteristic function: real probability laws with equal characteristic functions are equal; the vector conclusion below is obtained from scalar projections using Cramer–Wold.

[F9]

Cramer wold device: under AC, equality or convergence of all real projections determines the Borel vector law.

[F12]

Finite and countable subadditivity of measures: the measure of a finite union is at most the sum of the measures of its members.

[F13]

Characteristic function of a real random variable: the characteristic function of a real random variable X is t↦E[eitX].

[F14]

Fubini's theorem for L^1 functions on a sigma-finite product: a bounded complex-valued function is integrable under a product probability, and Fubini factors the integral of a product of coordinate functions.

[A1]

The Axiom of Choice: AC is assumed by LAN, Prokhorov's theorem, and the finite-dimensional characteristic-function uniqueness and Cramer–Wold suppliers.

Proof

Given: The local experiment, target, estimator, and hypotheses above.

1.1A1F1F2F4F11F12givenchoose

Under Pn,0, Tn⇒W by regularity at h=0 and Δn⇒Nd(0,K) by LAN. Marginal tightness gives compact sets with outside probabilities below ε/2; enlarge them to closed balls. Their product is closed and bounded in Rk+d and hence compact by [F11]. By [F12] the joint outside probability is at most ε, so the joint laws of (Tn,Δn) are tight.

2.1A1F1F4F7F9step 1.1given

By [F4], choose a subsequence along which (Tn,Δn)⇒(T,Δ). Its marginals have laws W and Nd(0,K). Fix h∈Rd. By [F1], Pn,0(Ln,h=0)→0; define ℓn,h=log⁡Ln,h when Ln,h>0 and ℓn,h=0 otherwise. This replacement changes a variable only on an event of probability o(1). For any a∈Rk and b∈R, the projection of (Tn,ℓn,h) differs by oP(1) from aTTn+bhTΔn−12bhTKh. The latter converges by [F7]; applying scalar Slutsky and [F9] to every projection gives (Tn,ℓn,h)⇒(T,hTΔ−12hTKh).

3.1F1F2F3F7F9step 2.1given

By the continuous mapping theorem [F7], (Tn,eℓn,h)⇒(T,ehTΔ−12hTKh). Since eℓn,h=Ln,h off the event Ln,h=0, whose probability tends to zero by [F1], the same joint limit holds with Ln,h. Apply [F3] to this mean-one proxy; [F1] transfers its limit under the proxy law to the actual Pn,h law. Regularity and δn(h)→Dh imply that under this same actual law Tn⇒W+Dh: apply [F7] to each real projection and then [F9]. Therefore for every real h and t∈Rk, E[eitTT+hTΔ−12hTKh]=eitTDhφW(t), where φW(t)=E[eitTW].

4.1F5F6step 3.1given

Rearranging step 3.1 gives Ft(h):=E[eitTT+hTΔ]=e12hTKh+itTDhφW(t) for every real h. For complex z∈Cd, define Ft(z)=E[eitTT+zTΔ]. On every compact set of z, its coordinate power series and derivatives are dominated by eR∥Δ∥1 for some finite R, whose expectation is finite because Δ is Gaussian. Thus Ft is entire in each coordinate, as is the right-hand side. Apply [F5] one coordinate at a time, holding the remaining coordinates real and then extending them successively; the equality holds for every complex z.

5.1F6F13step 4.1givenalgebra

Put z=iu in step 4.1. By [F13], the resulting characteristic functions satisfy, for all real t,u, E[eitTT+iuTΔ]=φW(t)e−tTDu−uTKu/2. Set R=T−DK−1Δ and replace u by u−K−1DTt. Direct expansion gives E[eitTR+iuTΔ]=(φW(t)etTDK−1DTt/2)e−uTKu/2. At u=0 the first factor is the characteristic function of R; the second is the characteristic function of Δ. The joint characteristic function therefore factors as the product of the marginal characteristic functions.

6.1A1F6F8F9F10F13F14step 5.1algebra∎

Let ρ=L(R)⊗Nd(0,K), whose product law exists by [F10]. For each t∈Rk and u∈Rd, the function (r,z)↦eitTreiuTz is bounded and hence integrable under ρ; [F14] factors its integral into the marginal characteristic functions. By [F13] and step 5.1, this product equals the characteristic function of (R,Δ). Scalar uniqueness [F8] and [F9] give L(R,Δ)=ρ, so R and Δ are independent. Since DK−1Δ∼Nk(0,DK−1DT) and T=DK−1Δ+R, the law of T, which is W, is the stated convolution. The argument allows singular DK−1DT and uses no inverse of that matrix.

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

A one-sided DQM path yields an iid LAN proxy

Statement

Assume AC. Let t↦Pt be a one-sided path (0≤t<ϵ) of probability laws on (X,A) dominated by one supplied sigma-finite measure μ, with supplied densities pt and P0=P. Suppose the path is differentiable in quadratic mean at 0 with score s∈L2(P), in the sense of A dominated differentiable-in-quadratic-mean submodel. Put I=P[s2]. For a fixed h≥0, let tn=h/n and let X1,…,Xn be iid P. On S={p0>0} set αt=Pt(Sc) and, for sufficiently small t, define

qt(x)=1S(x)pt(x)(1−αt)p0(x)on S,qt(x)=0on Sc.

Then qt is a probability density relative to P. With Ln=∏i=1nqtn(Xi) and Δn=n−1/2∑i=1ns(Xi),

∥Ptn⊗n−LnP⊗n∥TV⟶0,log⁡Ln=hΔn−12h2I+oP(1),Δn⇒N(0,I).

For h=0 take Ln=1 and use the convention log⁡0=−∞. The proxy LnP⊗n is the normalized absolutely continuous component; the conclusion does not assert a full likelihood ratio for Ptn⊗n.

Facts & Assumptions

Given: AC; the common-dominator one-sided DQM path and supplied density family; iid Xi∼P; and fixed h≥0.

[F1]

A dominated differentiable-in-quadratic-mean submodel: ∥pt−p0−t2sp0∥L2(μ)=o(t) as t↓0; the path may be one-sided.

[F2]

A DQM score has mean zero and is unique: Ps=0 and Ps2<∞ for this dominated one-sided DQM path.

[F3]

Cauchy-Schwarz inequality for L2: the L2 pairing is bounded by the product of the L2 norms.

[F4]

Khinchin weak law for integrable IID variables: averages of iid integrable real variables converge in probability to their expectation.

[F5]

Multivariate iid central limit theorem: under AC, iid square-integrable vectors have the centered Gaussian limit with their covariance, including the zero-variance case.

[F6]

Identical distribution and IID families: the sample coordinates are iid under P⊗n.

[F7]

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

[F8]

Markov's inequality for random variables: for nonnegative integrable Y and c>0, P(Y≥c)≤EY/c.

[F9]

Finite and countable subadditivity of measures: the measure of a finite union is at most the sum of its members' measures.

[F10]

The Lebesgue integral is linear on L1(μ): the integral is linear on integrable functions, so the normalization identity for qt=(1+Yt/2)2 expands into its three terms.

[F11]

A uniform derivative bound gives a uniform Taylor remainder bound: if the third derivative is bounded on an interval, the second-order Taylor polynomial has a remainder bounded by a constant times the cube of the displacement.

[F12]

L1 convergence implies uniform integrability: on a probability space, convergence in L1 to an integrable limit makes the convergent sequence uniformly integrable.

[F13]

The measure with density f relative to μ: for a nonnegative measurable function f, A↦∫Af dν is a measure.

[F14]

The product sigma-algebra and its finite iterates: the finite product sigma-algebra is generated by measurable coordinate rectangles. Coordinate projections are measurable because the inverse image of a coordinate event is such a rectangle; finite products of nonnegative measurable coordinate functions are therefore product-measurable.

[F15]

For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: products of sigma-finite measures exist and have the rectangle formula; iterating this applies to finite products of probabilities.

[F16]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions have their product integral equal to the iterated integrals.

[F17]

Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: measures agreeing on a generating pi-system agree everywhere if an increasing finite-measure exhaustion belongs to that pi-system.

[A1]

The Axiom of Choice: AC is the density-version convention in [F1] and is assumed by [F5].

Proof

Given: The path, densities, score, iid sample, and fixed h in the statement.

1.1A1F1F2givenalgebra

For t>0 let rt=pt−p0−t2sp0. On Sc, rt=pt, so αt=∫Scpt dμ≤∥rt∥22=o(t2). Let Bt=S∩{pt=0}. Then P(Bt)≤∥pt−p0∥22=O(t2). On Bt, the DQM identity gives p0=−t2sp0−rt, hence P(Bt)≤t2{P[s21Bt]}1/2+o(t). Since P(Bt)→0 and s2 is integrable, truncating s2 at a fixed bound and then increasing that bound shows P[s21Bt]→0. Thus βt:=P(pt=0)=P(Bt)=o(t2).

2.1F1step 1.1givenalgebra

For small t, 1−αt>0. The definition of qt gives Pqt=(1−αt)−1∫Spt dμ=1. On S, divide the DQM expansion by p0 and include the normalizer (1−αt)−1/2=1+o(t2). With Yt=2(qt−1), this yields Yt=ts+Rt in L2(P) with ∥Rt∥2=o(t).

3.1F2F3F10step 2.1algebra

Since Pqt=1 and qt=(1+Yt/2)2 P-almost surely, linearity [F10] expands this normalization identity to PYt=−14P[Yt2]. By [F2], [F3], and step 2.1, P[Yt2]=t2I+o(t2), so PYt=−14t2I+o(t2).

3.2A1F2F3F4F5F6F8F10step 2.1given

Suppose h>0. By [F4] applied to s2 and [F5] applied to s(Xi), n−1∑is(Xi)2→I in probability and Δn⇒N(0,I). Step 2.1 and [F3] give E∣Ytn2−tn2s2∣≤∥Rtn∥2(∥Ytn∥2+tn∥s∥2)=o(tn2). Since ntn2=h2, linearity [F10] and identical distribution [F6] show that the expected sum of these absolute differences is o(1), so Markov's inequality [F8] makes that sum converge to zero in probability. Also tn2∑is(Xi)2=(h2/n)∑is(Xi)2→h2I in probability; therefore ∑iYtn(Xi)2→h2I.

4.1F2F8step 3.1givenalgebra

The centered iid sum of Rtn(Xi) has variance at most n∥Rtn∥22=o(ntn2)=o(1), so [F8] (applied to its square) gives ∑iRtn(Xi)=nPRtn+oP(1). By [F2], PRtn=PYtn; step 3.1 therefore gives ∑iYtn(Xi)=hΔn−14h2I+oP(1).

5.1F3F6F8F9F11F12step 1.1step 2.1step 3.2step 4.1algebra

The variables Vn=nYtn(X1) converge in L2(P) to hs(X1) by step 2.1. By [F3], E∣Vn2−h2s(X1)2∣≤∥Vn−hs(X1)∥2(∥Vn∥2+h∥s∥2)→0, since the second factor is bounded. Thus [F12] makes Vn2 uniformly integrable. For every η>0, [F8] and [F9] give P⊗n(max⁡i≤n∣Ytn(Xi)∣>η)≤η−2E[Vn21{∣Vn∣>ηn}]→0, because the tail threshold for Vn2 tends to infinity. Also P⊗n(Ln=0)≤nβtn=o(1) by step 1.1. On the event all factors are positive and max⁡i∣Ytn(Xi)∣≤1, let g(y)=2log⁡(1+y/2); its third derivative is g′′′(y)=12(1+y/2)−3, so ∣g′′′(y)∣≤4 on [−1,1]. [F11] gives g(y)=y−14y2+O(∣y∣3) there, with a uniform constant. Thus log⁡qtn(Xi)=Ytn(Xi)−14Ytn(Xi)2+O(∣Ytn(Xi)∣3). The sum of cubic terms is bounded by a constant times max⁡i∣Ytn(Xi)∣∑iYtn(Xi)2=oP(1). Steps 3.2–4.1 now yield log⁡Ln=hΔn−12h2I+oP(1).

6.1F1F6F7F9F13F14F15F16F17step 1.1step 2.1step 5.1given∎

Decompose Ptn=(1−αtn)Pˉtn+αtnStn, where Pˉtn=qtnP and, when αtn>0, Stn is the normalized restriction to Sc. Expanding the product mixture, the all-Pˉtn term has weight (1−αtn)n and law Pˉtn⊗n. If αtn>0, normalize the remaining mixture terms to a probability law Rn,tn; then Ptn⊗n=(1−αtn)nPˉtn⊗n+(1−(1−αtn)n)Rn,tn. When αtn=0, the two product laws are equal. Otherwise, this mixture identity and the event-supremum definition [F7] give ∥Ptn⊗n−Pˉtn⊗n∥TV≤1−(1−αtn)n≤nαtn by finite subadditivity [F9]. Since αtn=o(tn2) and ntn2=h2 for fixed h>0, this is o(1). For the asserted product-density identity, the coordinate factors qtn are nonnegative measurable, so [F14] makes Ln(x1,…,xn)=∏iqtn(xi) product-measurable. Define the measure Qn(A)=∫ALn dP⊗n by [F13]. Repeated Tonelli [F16] on a measurable rectangle A1×⋯×An gives Qn(A1×⋯×An)=∏i=1n∫Aiqtn dP=∏i=1nPˉtn(Ai), where the one-coordinate identity is the definition Pˉtn=qtnP. In particular, step 2.1 gives Qn(Xn)=(Pqtn)n=1. By [F15], Pˉtn⊗n is also a probability and has the same rectangle values. The measurable rectangles form a pi-system (their intersections are coordinate intersections) generating the finite product sigma-algebra by [F14]; the constant exhaustion Xn belongs to it and both measures have mass one there. Thus [F17] proves Qn=Pˉtn⊗n on every product-measurable event. Consequently LnP⊗n=Pˉtn⊗n, identifying exactly the proxy in the statement with the product law compared above. If h=0, both product laws equal P⊗n and Ln=1. This proves every assertion.

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

Semiparametric information bound for regular asymptotically linear estimators

Statement

Assume AC and Countable Choice. Let P be a law in a statistical model, let T⊆L02(P) be its closed score tangent space, and let ψ be a pathwise differentiable Rk-valued functional with canonical gradient ϕcan∈Tk. Write Vcan=P[ϕcanϕcanT]. Let ψ^n be asymptotically linear at P with influence function φ∈L02(P)k. Assume that for every allowed one-sided DQM path Pt with score s and every fixed h≥0, under Ph/n⊗n the centered estimator n{ψ^n−ψ(Ph/n)} converges to one law independent of h, equal to its limit at h=0. Then φ represents the pathwise derivative on T, so

φ∈ϕcan+(T⊥)k,P[φφT]−Vcan=P[(φ−ϕcan)(φ−ϕcan)T]⪰0.

By Asymptotic linearity implies asymptotic normality, this is the covariance lower bound for the estimator's asymptotic normal limit. The theorem does not assert that an estimator attaining the bound exists.

Facts & Assumptions

Given: AC and Countable Choice; the dominated model, allowed one-sided DQM paths, closed tangent space, pathwise differentiable functional, canonical gradient, asymptotic linearity, and the stated pathwise regularity under each fixed local displacement.

[F1]

Asymptotically linear estimators and influence functions: ψ^n−ψ(P)=(Pn−P)φ+oP(n−1/2) with Pφ=0 and P∥φ∥2<∞.

[F2]

Pathwise differentiability and parameter influence curves: for each allowed score s, ψ˙P(s) is the value of a continuous linear derivative on T; its canonical gradient ϕcan∈Tk represents that derivative.

[F3]

A one-sided DQM path yields an iid LAN proxy: for each fixed h≥0, the one-sided DQM local alternative has a mean-one likelihood-ratio proxy, its product law is total-variation close to the actual local law, its log proxy ratio is hn−1/2∑is(Xi)−12h2P[s2]+oP(1), and its proxy-zero probability tends to zero.

[F4]

Le Cam's third lemma for a Gaussian likelihood-ratio limit: under a joint Gaussian limit of a statistic and the log of a mean-one likelihood-ratio proxy, the limit under the proxy law is exponentially tilted; the statistic's mean shifts by its covariance with the log ratio, while its covariance is unchanged.

[F5]

Multivariate iid central limit theorem: under AC, iid finite-second-moment vectors have the Gaussian limit with their covariance, including singular covariance.

[F6]

Slutsky's theorem for real random variables: adding a real term converging to zero in probability preserves the projected Gaussian limit.

[F7]

Cramer wold device: under AC, convergence of all real projections to the projections of a specified Borel law gives vector convergence.

[F8]

Asymptotic linearity implies asymptotic normality: the estimator's base-law limit is Nk(0,Σφ).

[F9]

Influence-curve representers form an affine orthogonal-complement class: under Countable Choice, the ambient representers of the derivative are exactly ϕcan+(T⊥)k.

[F10]

Cauchy-Schwarz inequality for L2: the L2(P) pairing is continuous, so equality on the score span extends to its norm closure.

[F11]

Continuous mapping theorem: the continuous map (t,ℓ)↦(t,eℓ) preserves joint weak convergence.

[A1]

The Axiom of Choice: AC supplies the path density-version convention and is required by [F3] and [F5].

[A2]

The Axiom of Countable Choice (ACω): Countable Choice is used by the Hilbert projection/Riesz branch that supplies the canonical gradient in [F2] and the representer decomposition in [F9].

Proof

Given: The hypotheses in the statement. Put Σφ=P[φφT].

1.1A1F1F2F3givenalgebra

Fix an allowed path with score s and a fixed h>0. Let Tn=n{ψ^n−ψ(P)}, Δn=n−1/2∑is(Xi), and Ln be the proxy ratio from [F3]. By [F3], P(Ln=0)→0; set ℓn=log⁡Ln when Ln>0 and ℓn=0 otherwise. For arbitrary a∈Rk and b∈R, asymptotic linearity and [F3] give aTTn+bℓn=n−1/2∑i=1n{aTφ(Xi)+bhs(Xi)}−12bh2P[s2]+oP(1). The summands are iid and square-integrable by [F1] and [F2].

2.1A1F5F6F7step 1.1given

Apply [F5] to each scalar linear combination in step 1.1, then apply [F6] to its oP(1) remainder. Since this holds for every (a,b), [F7] gives the joint Gaussian limit of (Tn,ℓn), with first marginal Nk(0,Σφ) and cross-covariance between Tn and ℓn equal to hP[φs].

3.1A1F3F4F11step 1.1step 2.1

The log-ratio marginal in step 2.1 is N(−h2P[s2]/2,h2P[s2]). Exponentiating the finite version ℓn by [F11] gives the joint likelihood-ratio limit, and replacing eℓn by Ln changes it only on the o(1)-probability zero event from step 1.1. Apply [F4] to the proxy law in [F3]; under that law, Tn⇒Nk(hP[φs],Σφ). Total-variation closeness in [F3] transfers the same limit to the actual law Ph/n⊗n.

4.1F2F8step 3.1given

By pathwise differentiability, n{ψ(Ph/n)−ψ(P)}→hψ˙P(s). The regularity hypothesis therefore makes Tn under the actual local law converge to Nk(hψ˙P(s),Σφ), using the base limit [F8]. Comparing with step 3.1, uniqueness of weak limits gives Nk(hP[φs],Σφ)=Nk(hψ˙P(s),Σφ). Equal-covariance Gaussian laws have equal means, so P[φs]=ψ˙P(s).

5.1F2F10step 4.1

Step 4.1 holds for every allowed score. By linearity it holds on their linear span; by [F10] the pairing with φ is continuous, and by [F2] the derivative is continuous, so equality extends to the closure T. Thus φ is an ambient representer of the pathwise derivative.

6.1A2F9step 5.1algebra∎

By [F9], r=φ−ϕcan has every coordinate in T⊥. Hence P[ϕcanrT]=0=P[rϕcanT], and expansion gives P[φφT]−Vcan=P[rrT]. For every a∈Rk, aTP[rrT]a=P[(aTr)2]≥0, proving positive-semidefinite dominance.

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

Convolution bound for general regular estimators

Statement

Assume AC and Countable Choice. Let ψ be pathwise differentiable at P with tangent space T and canonical gradient ϕcan∈Tk, and write Vcan=P[ϕcanϕcanT]. If T≠{0}, suppose a directed family of finite-dimensional, dominated QMD models {Pγ,θ:θ∈Θγ⊆Rdγ}, with each Θγ open and Pγ,θγ,0=P, has score spans Sγ⊆T whose union is dense in T. In each model let Sγ∈L02(P)dγ be a score basis, let Iγ=P[SγSγT] be nonsingular, and let Dγ=P[ϕcanSγT]. Assume for each fixed h∈Rdγ that n{ψ(Pγ,θγ,0+h/n)−ψ(P)}→Dγh, and that under each local law the centered estimator n{ψ^n−ψ(Pγ,θγ,0+h/n)} converges to one common law L, independent of γ and h. Suppose L has finite covariance. By Quadratic-mean differentiability implies iid LAN, each model has the required LAN proxy; Finite-dimensional LAN convolution bound for differentiable functionals then applies with derivative matrix Dγ. If T={0}, no submodel family is needed. Then

Cov⁡(L)⪰Vcan.

This is a lower bound for general regular estimators; asymptotic linearity is not assumed.

Facts & Assumptions

Given: AC and Countable Choice; the tangent space and canonical gradient; the directed dense family of finite-dimensional QMD submodels; a common regular limit law with finite covariance; and the finite-dimensional convolution premise stated above.

[F1]

Pathwise differentiability and parameter influence curves and Influence-curve representers form an affine orthogonal-complement class: ψ˙P is continuous linear on T and is represented by the canonical gradient ϕcan∈Tk.

[F2]

Quadratic-mean differentiability at a parameter, Quadratic-mean differentiability implies iid LAN, and Local asymptotic normality for local experiments: each finite-dimensional submodel is dominated and QMD at an interior point; for every fixed local displacement its iid experiment has the LAN proxy expansion and total-variation control required by the LAN definition.

[F3]

Regular estimator under local alternatives: regularity in a finite-dimensional local experiment means the centered estimator has a common limit law under every fixed local displacement; the statement imposes this for the displayed differentiable target in each submodel.

[F4]

Finite-dimensional LAN convolution bound for differentiable functionals: in a finite-dimensional LAN experiment with target derivative Dγ and information Iγ, the common regular limit law is a convolution with an independent Gaussian component of covariance DγIγ−1DγT.

[A1]

The Axiom of Choice: AC is assumed by the QMD/LAN and finite-dimensional probability suppliers.

[A2]

The Axiom of Countable Choice (ACω): Countable Choice supplies the Hilbert projection and Riesz representation used for the canonical gradient.

Proof

Given: The hypotheses in the statement. For one index γ, abbreviate S=Sγ, I=Iγ, D=Dγ, and S=Sγ.

1.1A2F1givenalgebra

For any a∈Rk, the projection of aTϕcan onto S is aTDI−1S: its residual has inner product aTD−aTDI−1P[SST]=0 with every linear combination of the score coordinates. Therefore the covariance matrix of the projected gradient is DI−1DT.

2.1A1F2F3F4step 1.1given

By [F2] and Quadratic-mean differentiability implies iid LAN, this finite-dimensional submodel has the required LAN proxy and total-variation control. The regularity premise in the statement and [F4] give L=dGγ+Wγ, where Gγ∼Nk(0,DI−1DT) is independent of Wγ. Since L has finite covariance and Gγ does, Wγ has finite covariance as well; independence yields Cov⁡(L)=DI−1DT+Cov⁡(Wγ)⪰DI−1DT.

2.2F1step 1.1givenchoosealgebra

If T={0}, then ϕcan=0 and Cov⁡(L)⪰0=Vcan. Otherwise fix a∈Rk and ε>0. Density of the union of the Sγ in T provides an index γ and g∈Sγ with ∥g−aTϕcan∥L2(P)<ε. The projection formula in step 1.1 is orthogonal, so for any g∈Sγ, ∥aTϕcan−g∥22=∥aTϕcan−ΠSγ(aTϕcan)∥22+∥ΠSγ(aTϕcan)−g∥22. Thus the projection error is below ε, and the quadratic forms aTDγIγ−1DγTa approach aTVcana as ε↓0.

3.1step 2.1step 2.2algebra∎

When T≠{0}, step 2.1 gives aTCov⁡(L)a≥aTDγIγ−1DγTa for every γ. Take the approximation in step 2.2 with arbitrarily small ε to obtain aTCov⁡(L)a≥aTVcana. Since this holds for every a, Cov⁡(L)⪰Vcan. Together with the zero-tangent case in step 2.2, this proves the claim.

5 · Examples, counterexamples and false statements

None yet.

Sources