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

Wald, score, and likelihood-ratio asymptotic chi-square calibration

Statement

Assume AC. Let X1,…,Xn be iid from Pθ0 in a correctly specified dominated model, with θ0=(0,η0) an interior point of the full open parameter set Θ⊂Rq×Rd−q. In a local C1 parameter chart, suppose the null is ψ=0, so its local null set is a linear subspace of codimension q≥1; all score and information coordinates below use this chart. Assume QMD at θ0 with positive-definite information

I=(IψψIψηIηψIηη),

and write Ieff=Iψψ−IψηIηη−1Iηψ. If d=q, interpret nuisance blocks as empty, so Ieff=Iψψ=I and products involving η are zero. Let Δn=n−1/2∑isθ0(Xi). Assume the hypotheses of Asymptotic linearity and normality of a regular MLE hold for the full model. Assume the constrained MLE is measurable, exact, consistent, and maximizes over a set containing θ0; it is root-n bounded by that theorem's localization conclusion. For every finite M the following likelihood and score expansions hold uniformly over ∥h∥≤M:

ℓn(θ0+h/n)−ℓn(θ0)=hTΔn−12hTIh+oP(1), n−1/2∇ℓn(θ0+h/n)=Δn−Ih+oP(1).

Assume the covariance, score-projection, and efficient-information estimators in Wald, score, and likelihood-ratio statistics for regular nulls converge in probability to their stated limits. Partition Δn=(Δψ,n,Δη,n), put rn=Δψ,n−IψηIηη−1Δη,n, and set Tn=rnTIeff−1rn. Then, under the null,

Wn=Tn+oP(1),Sn=Tn+oP(1),Ln=Tn+oP(1),Wn⇒χq2,Sn⇒χq2,Ln⇒χq2.

Here χq2 is the law defined in Chi-square laws, including zero degrees. This is an asymptotic calibration; no exact finite-sample chi-square law is asserted.

Facts & Assumptions

Given: The iid correctly specified model and the local-null, QMD, positive-information, consistency, local-expansion, estimator, and covariance hypotheses in the Statement. Assume AC.

[F1]

Quadratic-mean differentiability at a parameter: QMD supplies the score sθ0 and information matrix I=Eθ0[sθ0sθ0T].

[F2]

Wald, score, and likelihood-ratio statistics for regular nulls: in local coordinates (ψ,η), Wn uses the tested MLE coordinates and their covariance, Sn uses the consistent estimated efficient score and information, and Ln is twice the unrestricted-minus-restricted log likelihood.

[F3]

Asymptotic linearity and normality of a regular MLE: under its local envelope and consistency hypotheses, the full MLE has the stated asymptotic linear representation, and any consistent exact restricted maximizer containing θ0 is root-n bounded.

[F4]

Stochastic order and convergence notation for finite-dimensional random vectors: boundedness in probability and convergence in probability use the finite-dimensional Euclidean norm.

[F5]

Finite-dimensional stochastic-order calculus and tightness: a vector converging in distribution is bounded in probability, and products of bounded and vanishing vectors vanish in probability.

[F6]

Vector Slutsky theorem: a continuous map of a weakly convergent vector and a vector converging in probability to a constant has the corresponding weak limit.

[F7]

Multivariate iid central limit theorem: under AC, the normalized sum of iid finite-second-moment vectors converges to a multivariate normal with their covariance.

[F8]

Multivariate normal law, including singular covariance: under AC, Nd(0,I) has covariance I and its linear maps are multivariate normal.

[F9]

Chi-square laws, including zero degrees: for q≥1, χq2 is the law of ∑j=1qGj2=∥G∥2 when G∼Nq(0,Iq) has independent standard-normal coordinates.

[A1]

The local likelihood and normalized score expansions are assumed uniformly on each bounded local parameter set as stated; QMD alone is not used to infer them here.

[A2]

I is positive definite and 1≤q≤d; when q=d, the nuisance blocks are empty and their products are interpreted as zero.

[A3]

The Axiom of Choice: AC is inherited from the density-representative convention in [F2], the MLE theorem [F3], and the probability-law suppliers [F7]–[F9].

Proof

1.1A2A3F1F6F7F8givenalgebra

If d=q, then Ieff=I is positive definite. If d>q, Iηη is a positive-definite principal block. For nonzero v∈Rq, evaluate the quadratic form of I at (v,−Iηη−1Iηψv); the result is vTIeffv>0, so Ieff is positive definite in either case. Normalizing pθ0+h in the QMD expansion [F1], write pθ0+h=pθ0+12hTsθ0pθ0+eh with ∥eh∥L2(μ)=o(∥h∥). Expanding the squared norm, whose value is ∫pθ0+hdμ=1, gives hTEθ0sθ0+O(∥h∥2)+o(∥h∥)=0. Taking h=tej and dividing by t proves each score coordinate has mean zero. Since sθ0 is square integrable by [F1], the iid CLT [F7] gives Δn⇒Nd(0,I) under AC. Define rn=Δψ,n−IψηIηη−1Δη,n. Its covariance, by block multiplication, is Var⁡(rn)=Iψψ−IψηIηη−1Iηψ−IψηIηη−1Iηψ+IψηIηη−1IηηIηη−1Iηψ=Ieff. Thus the linear-map case of Slutsky [F6] gives rn⇒Nq(0,Ieff); its covariance is the block calculation above.

2.1A1A2F3F4step 1.1algebra

By [F3], the full MLE satisfies n(θ^n−θ0)=I−1Δn+oP(1). Solving the block system I(a,b)T=(Δψ,n,Δη,n)T shows its tested block is a=Ieff−1rn, including the empty-nuisance case. If d=q, the local null contains only θ0, so consistency makes the constrained MLE equal to θ0 with probability tending to one and there is no nuisance expansion to prove. Otherwise, [F3] makes the constrained root-n error bounded. In local coordinates h=(u,v) for (η,ψ), the limiting quadratic log likelihood is Qn(u,v)=uTΔη,n+vTΔψ,n−12{uTIηηu+2uTIηψv+vTIψψv}. For general v, completing the square in u gives the unique maximizer u=Iηη−1(Δη,n−Iηψv) and the profile vTrn−12vTIeffv up to a term independent of v. At the null v=0 this gives the unique nuisance maximizer u0=Iηη−1Δη,n. On every distance-ε set from u0, strict positive definiteness of Iηη makes the quadratic log likelihood at least 12λmin⁡(Iηη)ε2 below its maximum. Uniformity of the likelihood expansion [A1], constrained root-n tightness [F3], and this gap therefore give n(η~n−η0)=Iηη−1Δη,n+oP(1).

3.1A1A2F2F4step 2.1algebra

Consistency places both maximizers in the open chart neighborhood with probability tending to one; the off-chart zero conventions in [F2] therefore do not affect the expansions below. The upper-left block of I−1 is Ieff−1 by solving the block system I(x,y)T=(a,0)T. The differentiable local chart has tested coordinate ψ, so the Wald statistic in [F2], the expansion in step 2.1, and covariance consistency give Wn=(Ieff−1rn)TIeff(Ieff−1rn)+oP(1)=rnTIeff−1rn+oP(1).

3.2A1A2F2F4F5step 2.1algebra

If d=q, the nuisance score is empty and the score expansion [A1] at h=0 gives Ueff,n=Uψ,n(θ0)=Δn+oP(1)=rn+oP(1). If d>q, the score expansion [A1] at the constrained MLE and n(η~n−η0)=Iηη−1Δη,n+oP(1) give Uψ,n(θ~n)=rn+oP(1) and Uη,n(θ~n)=oP(1). The estimated projection coefficient is bounded in probability by consistency, so the efficient score in [F2] is rn+oP(1). Efficient-information consistency and [F5] imply Sn=rnTIeff−1rn+oP(1).

3.3A1A2F2F4F5step 2.1algebra

The likelihood expansion in [A1] makes Ln equal, up to oP(1), twice the maximum of Qn(u,v) over all local (u,v) minus twice its maximum over the null v=0. The unrestricted and restricted quadratic maximizers are linear functions of Δn, hence are OP(1) by step 1.1 and [F5]. Taking a bounded local ball large enough with probability arbitrarily close to one justifies using the uniform expansions for both maxima. The profile formula in step 2.1 reduces this difference to 2sup⁡v{vTrn−12vTIeffv}=rnTIeff−1rn. The identity follows by completing the square at v=Ieff−1rn. Hence Ln=rnTIeff−1rn+oP(1).

4.1A3F4F5F6F7F8F9step 1.1step 3.1step 3.2step 3.3∎

Since rn⇒Nq(0,Ieff) and Ieff is positive definite, its transformed vector Ieff−1/2rn converges to Nq(0,Iq). The squared Euclidean norm of that limit is χq2 by [F9]. Combining this with steps 3.1–3.3 and [F4]–[F5] proves all three limits and their common first-order approximation. AC is inherited through [F2], [F3], and [F7]–[F9], as recorded in [A3].

Depends on

Used by

Dependency tree · two levels

54 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