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.

✓ 2 results · all verified · 2 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 2 also cleared it.

Delta Method and Asymptotic Normality

1 · Prerequisites

2 · Summary

This page proves first- and second-order delta limits for finite-dimensional random vectors and the asymptotic linearity and normality of iid Z-estimators. The first-order result uses a pointwise derivative expansion; the second-order result requires a zero first derivative and a quadratic Peano expansion. The Z-estimator result assumes consistency, a root residual of order oP(n−1/2), a nonsingular mean derivative, finite score covariance, and local stochastic equicontinuity. It does not infer equicontinuity from consistency alone. Its normal-limit branch assumes AC through the library's multivariate iid central limit theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

First- and second-order delta method for random vectors

Statement

Let d,k≥1, let rn>0 be deterministic with rn→∞, and let Tn be Rd-valued random vectors with target θ∈Rd. Suppose Zn=rn(Tn−θ)⇒Z for an Rd-valued random vector Z. All vector norms below are Euclidean.

If g:Rd→Rk is Borel and there is a linear map A:Rd→Rk such that g(θ+h)−g(θ)=Ah+ρ1(h),∥ρ1(h)∥∥h∥⟶0(h→0, h≠0), then rn{g(Tn)−g(θ)}⇒AZ.

If, in addition, A=0 and there is a continuous symmetric bilinear map H:Rd×Rd→Rk such that g(θ+h)−g(θ)=12H[h,h]+ρ2(h),∥ρ2(h)∥∥h∥2⟶0(h→0, h≠0), then rn2{g(Tn)−g(θ)}⇒12H[Z,Z]. For scalar-valued g, H is the usual Hessian bilinear form. The second-order premise is a pointwise Peano expansion; continuous second derivatives on a neighborhood are not required.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[F1]

Stochastic order and convergence notation for finite-dimensional random vectors: OP(1) means bounded in probability by tail probabilities, and oP(1) means convergence in probability to zero.

[F2]

Finite-dimensional stochastic-order calculus and tightness: finite-dimensional weak convergence implies OP(1).

[F3]

Finite-dimensional stochastic-order calculus and tightness: a fixed continuous bilinear map sends an oP(1) factor times an OP(1) factor to oP(1).

[F4]

Vector Slutsky theorem: if Xn⇒X and Yn−c=oP(1), then (Xn,Yn)⇒(X,c), and continuous maps preserve this limit.

[F5]

The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: on finite-dimensional real matrix spaces, differentiability means a real-linear first-order approximation with a remainder whose norm divided by the input norm tends to zero. Identify Rd with real column matrices and use the Euclidean/Frobenius norm equality.

[F6]

Convergence in distribution of random elements: Xn⇒X means weak convergence of their laws in the common metric target; the random elements need not share probability spaces.

Proof

Given: The objects and hypotheses in the statement.

1.1F2F6given

By [F6], Zn⇒Z is weak convergence in Rd. By [F2], this implies Zn=OP(1).

2.1F1F3step 1.1givenalgebra

Since rn−1→0, the deterministic sequence rn−1 is oP(1). Applying the bilinear product rule in [F3] to scalar multiplication gives Tn−θ=rn−1Zn=oP(1).

3.1F1F2step 1.1step 2.1givenchoosealgebraF5

Fix ε,η>0. By [F2] choose M>0 with lim sup⁡nP(∥Zn∥>M)≤η. The first-order remainder limit in the statement gives δ>0 such that ∥ρ1(h)∥≤(ε/M)∥h∥ when 0<∥h∥<δ. Step 2.1 gives P(∥Tn−θ∥≥δ)→0, so the limiting upper probability that rn∥ρ1(Tn−θ)∥>ε is at most η. Letting η↓0 proves rnρ1(Tn−θ)=oP(1). Substitution in the first expansion yields rn{g(Tn)−g(θ)}=AZn+oP(1).

3.2F1F2step 1.1step 2.1givenchoosealgebra

Fix ε,η>0. By [F2] choose M>0 with lim sup⁡nP(∥Zn∥>M)≤η. The second-order remainder limit in the statement gives δ>0 such that ∥ρ2(h)∥≤(ε/M2)∥h∥2 for 0<∥h∥<δ. Step 2.1 puts Tn−θ inside this neighborhood with probability tending to one. Outside the two tail events, rn2∥ρ2(Tn−θ)∥≤ε because rn∥Tn−θ∥=∥Zn∥. Thus rn2ρ2(Tn−θ)=oP(1); since A=0, substitution in the second expansion gives rn2{g(Tn)−g(θ)}=12H[Zn,Zn]+oP(1).

4.1F4givenstep 3.1

The map (x,e)↦Ax+e is continuous. Apply [F4] to Zn⇒Z and the oP(1) error in step 3.1 to obtain the first-order limit AZ.

5.1F4givenstep 3.2∎

The quadratic map z↦12H[z,z] is continuous. Apply [F4] to its value at Zn and the error in step 3.2 to obtain the second-order limit 12H[Z,Z].

Remarks

The first-order result is choice-free and does not require Z to be Gaussian. If AZ=0 almost surely, its first-order limit is degenerate; the second-order statement gives a different scale only when its stated expansion holds.

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

Asymptotic linearity and normality of iid Z-estimators

Statement

Assume the Axiom of Choice (AC), as required by the library's multivariate iid central limit theorem. Let (X,A) be a measurable space, let Θ⊂Rd be open with its Borel sigma-algebra, and let θ0∈Θ. Let X1,X2,… be iid X-valued observations with law P. Let ψ:Θ×X→Rd be jointly measurable and satisfy P∥ψθ∥<∞ for every θ∈Θ; write ψθ(x)=ψ(θ,x). Let θ^n:(Xn,A⊗n)→(Θ,B(Θ)) be a measurable estimator sequence as in Estimator sequences in IID experiments and a Z-estimator as in Z-estimators, with the stronger root-rate condition below. Write Pψθ=E[ψθ(X1)],Pnψθ=1n∑i=1nψθ(Xi),Gnψθ=n(Pn−P)ψθ. Assume the displayed random vectors and suprema below are measurable, and suppose:

  1. ∥θ^n−θ0∥=oP(1) and n ∥Pnψθ^n∥=oP(1).
  2. Pψθ0=0, P∥ψθ0∥2<∞, and Σ=P[ψθ0ψθ0T].
  3. The mean map Ψ(θ)=Pψθ has expansion Ψ(θ0+h)=Vh+ρ(h) with V nonsingular and ∥ρ(h)∥/∥h∥→0 as h→0, h≠0.
  4. The local stochastic-equicontinuity condition holds: for every ε>0, lim⁡δ↓0lim sup⁡n→∞Pn ⁣(sup⁡θ∈Θ: ∥θ−θ0∥<δ∥Gn(ψθ−ψθ0)∥>ε)=0.

Here Pn denotes the product sampling law of (X1,…,Xn).

Then n(θ^n−θ0)=−V−1Gnψθ0+oP(1)⇒Nd(0,V−1ΣV−T). This theorem assumes consistency and the local empirical-process condition; it asserts neither. The local equicontinuity condition is the direct process hypothesis used in the proof, and consistency alone does not replace it.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[A1]

∥θ^n−θ0∥=oP(1) and n ∥Pnψθ^n∥=oP(1).

[A2]

For every ε>0, the local stochastic-equicontinuity limit in condition 4 of the statement is zero.

[A3]

Ψ(θ0+h)=Vh+ρ(h), V is nonsingular, and ∥ρ(h)∥/∥h∥→0.

[A4]

Pψθ0=0 and P∥ψθ0∥2<∞.

[F1]

Stochastic order and convergence notation for finite-dimensional random vectors: OP(1) and oP(1) are defined by boundedness and convergence of tail probabilities.

[F2]

Finite-dimensional stochastic-order calculus and tightness: weak convergence implies finite-dimensional tightness, and oP(1)OP(1)=oP(1).

[F3]

Vector Slutsky theorem: joint convergence with a probability-limit constant and continuous finite-dimensional transformations require no independence.

[F4]

Convergence in distribution of random elements: convergence in distribution means weak convergence of laws, with no common probability space required.

[F5]

Identical distribution and IID families: iid means a common law and mutual independence of the whole family.

[F6]

The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: a finite-dimensional derivative is the real-linear first-order approximation with remainder o(∥h∥).

[F7]

Multivariate iid central limit theorem: under AC, iid finite-dimensional vectors with finite second moment have a centered normal limit with their covariance; singular covariance is allowed.

[F8]

Multivariate normal law, including singular covariance: under AC, Nd(0,Σ) is characterized by all scalar projections having their corresponding centered normal laws; its covariance is Σ.

[F9]

The Axiom of Choice: every family of nonempty sets has a choice function.

[F10]

Z-estimators: a measurable estimator sequence is a Z-estimator when it is an exact root or an oP(1)-approximate root of its empirical equation.

[F11]

Estimator sequences in IID experiments: an estimator sequence consists of measurable maps from each product sample space (Xn,A⊗n) into its Borel target space.

[F12]

Measurable coordinatewise functions preserve independence: applying measurable coordinatewise maps to an independent family preserves independence.

Proof

Given: AC, the iid observations and score functions, and assumptions [A1]–[A4].

1.1A1A2choose

Fix ε,η>0. By [A2] choose δ>0 such that the limiting upper probability of the displayed supremum exceeding ε is at most η. By [A1], Pn(∥θ^n−θ0∥≥δ)→0. On the complementary event, ∥Gn(ψθ^n−ψθ0)∥ is bounded by that supremum. Hence its limiting upper tail probability is at most η; letting η↓0 proves Gn(ψθ^n−ψθ0)=oP(1).

1.2A4F2F4F5F7F9F12

By [F12], applying the same measurable map ψθ0 to the iid observations preserves independence; identical distribution follows because every Xi has the same law. By [A4] and [F5], Gnψθ0=n−1/2∑i=1nψθ0(Xi) is a centered iid sum with finite covariance Σ. AC is available by [F9], so [F7] gives Gnψθ0⇒Nd(0,Σ), where convergence in distribution is weak convergence of laws by [F4]. In particular Gnψθ0=OP(1) by [F2].

2.1A1A3F6F10F11step 1.1algebra

Put hn=θ^n−θ0 and Wn=n hn. By [F10]–[F11], the estimator and root have the stated Z-estimator and data-measurability conventions; [A1] imposes the stronger root-rate residual, which is also oP(1) since n−1/2≤1. The identity nPnψθ^n=Gnψθ^n+nΨ(θ^n), [A1], step 1.1 and the derivative expansion in [A3], as specified by [F6], give VWn+n ρ(hn)=−Gnψθ0+oP(1). Moreover ∥ρ(hn)∥/∥hn∥=oP(1) by [A1] and [A3], with the ratio set to zero when hn=0.

3.1A3F2step 1.2step 2.1algebra

Since V is nonsingular, [A3] and step 2.1 imply ∥Wn∥≤∥V−1∥(∥Gnψθ0∥+en+an∥Wn∥), where en=oP(1) and an=∥ρ(hn)∥/∥hn∥=oP(1) (set an=0 if hn=0). With probability tending to one, ∥V−1∥an≤1/2. Absorbing that term and using Gnψθ0=OP(1) from step 1.2 proves Wn=OP(1).

4.1A3F1F2step 2.1step 3.1algebra

Now n ρ(hn)=oP(1) because it is the product of ∥Wn∥=OP(1) and ∥ρ(hn)∥/∥hn∥=oP(1). Substituting into step 2.1 gives Wn=−V−1Gnψθ0+oP(1).

5.1F3F4F7F8F9step 1.2step 4.1∎

By [F4], [F7], and [F8], the continuous linear image −V−1Gnψθ0 converges to a centered Gaussian with covariance V−1ΣV−T: for every u∈Rd, the projection of Nd(0,Σ) along −V−Tu is centered normal with variance uTV−1ΣV−Tu. Applying [F3] to the oP(1) remainder in step 4.1 proves the asserted normal limit. AC is used in the multivariate iid CLT and the normal-law supplier, not in the stochastic-order or Taylor steps.

Remarks

By Z-estimators, an oP(1) root residual is enough for the Z-estimator definition; condition 1 strengthens it to oP(n−1/2). The theorem assumes consistency and local stochastic equicontinuity; it does not use Consistency of Z-estimators under a uniform law or infer equicontinuity from consistency alone. The proof uses the quantified process condition directly, without a uniform-law theorem.

5 · Examples, counterexamples and false statements

None yet.

Sources