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 be iid from in a correctly specified dominated model, with an interior point of the full open parameter set . In a local parameter chart, suppose the null is , so its local null set is a linear subspace of codimension ; all score and information coordinates below use this chart. Assume QMD at with positive-definite information
and write . If , interpret nuisance blocks as empty, so and products involving are zero. Let . 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 ; it is root- bounded by that theorem's localization conclusion. For every finite the following likelihood and score expansions hold uniformly over :
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 , put , and set . Then, under the null,
Here 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.
Quadratic-mean differentiability at a parameter: QMD supplies the score and information matrix .
Wald, score, and likelihood-ratio statistics for regular nulls: in local coordinates , uses the tested MLE coordinates and their covariance, uses the consistent estimated efficient score and information, and is twice the unrestricted-minus-restricted log likelihood.
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 is root- bounded.
Stochastic order and convergence notation for finite-dimensional random vectors: boundedness in probability and convergence in probability use the finite-dimensional Euclidean norm.
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.
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.
Multivariate iid central limit theorem: under AC, the normalized sum of iid finite-second-moment vectors converges to a multivariate normal with their covariance.
Multivariate normal law, including singular covariance: under AC, has covariance and its linear maps are multivariate normal.
Chi-square laws, including zero degrees: for , is the law of when has independent standard-normal coordinates.
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.
is positive definite and ; when , the nuisance blocks are empty and their products are interpreted as zero.
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
If , then is positive definite. If , is a positive-definite principal block. For nonzero , evaluate the quadratic form of at ; the result is , so is positive definite in either case. Normalizing in the QMD expansion [F1], write with . Expanding the squared norm, whose value is , gives . Taking and dividing by proves each score coordinate has mean zero. Since is square integrable by [F1], the iid CLT [F7] gives under AC. Define . Its covariance, by block multiplication, is Thus the linear-map case of Slutsky [F6] gives ; its covariance is the block calculation above.
By [F3], the full MLE satisfies . Solving the block system shows its tested block is , including the empty-nuisance case. If , the local null contains only , so consistency makes the constrained MLE equal to with probability tending to one and there is no nuisance expansion to prove. Otherwise, [F3] makes the constrained root- error bounded. In local coordinates for , the limiting quadratic log likelihood is For general , completing the square in gives the unique maximizer and the profile up to a term independent of . At the null this gives the unique nuisance maximizer . On every distance- set from , strict positive definiteness of makes the quadratic log likelihood at least below its maximum. Uniformity of the likelihood expansion [A1], constrained root- tightness [F3], and this gap therefore give .
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 is by solving the block system . The differentiable local chart has tested coordinate , so the Wald statistic in [F2], the expansion in step 2.1, and covariance consistency give
If , the nuisance score is empty and the score expansion [A1] at gives . If , the score expansion [A1] at the constrained MLE and give and . The estimated projection coefficient is bounded in probability by consistency, so the efficient score in [F2] is . Efficient-information consistency and [F5] imply .
The likelihood expansion in [A1] makes equal, up to , twice the maximum of over all local minus twice its maximum over the null . The unrestricted and restricted quadratic maximizers are linear functions of , hence are 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 The identity follows by completing the square at . Hence .
Since and is positive definite, its transformed vector converges to . The squared Euclidean norm of that limit is 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
- Parametric statistical models
- Quadratic-mean differentiability at a parameter
- Wald, score, and likelihood-ratio statistics for regular nulls
- Asymptotic linearity and normality of a regular MLE
- Stochastic order and convergence notation for finite-dimensional random vectors
- Finite-dimensional stochastic-order calculus and tightness
- Vector Slutsky theorem
- Multivariate iid central limit theorem
- Multivariate normal law, including singular covariance
- Chi-square laws, including zero degrees
- The Axiom of Choice
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
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 26, PDF pp. 9–17 (standard reference, not scraped)
- John Duchi, Stats 300B Lecture 6, Winter 2018, complete scribe note, PDF pp. 1–5 (standard reference, not scraped)
- Yen-Chi Chen, STAT 581 Chapter 4: Hypothesis tests in likelihood models, lines 33–76 (standard reference, not scraped)