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.
Asymptotic linearity and normality of a regular MLE
Statement
Assume the Axiom of Choice. Let be iid with law in a dominated parametric model , where is open in , , and . Let be densities with respect to one supplied sigma-finite measure. Suppose the model is QMD at with score and positive-definite information . Assume there are a neighborhood of and a nonnegative measurable with such that, on one -full set,
Suppose a measurable exact MLE exists and is consistent, in the sense that for every . Then Under the same local hypotheses, every consistent measurable exact likelihood maximizer over a possibly -dependent subset that contains is also root- bounded in probability. The conclusion is asymptotic; it gives no exact finite-sample normal law.
Facts & Assumptions
Given: The iid dominated model, QMD score and information, local envelope, consistent measurable exact MLE, and Axiom of Choice in the statement.
Parametric statistical models: a parametric model is the supplied map on an experiment.
Dominated statistical experiments: domination means every is absolutely continuous with respect to one supplied sigma-finite measure.
Quadratic-mean differentiability at a parameter: QMD means the square-root densities have the stated first-order expansion with score .
Stochastic order and convergence notation for finite-dimensional random vectors: is convergence in probability to zero, and is boundedness in probability in finite-dimensional Euclidean norm.
Finite-dimensional stochastic-order calculus and tightness: finite-dimensional convergence in distribution implies boundedness in probability; products of a vanishing factor and a bounded factor vanish in probability.
Vector Slutsky theorem: if and , then , with continuous maps preserving this limit.
Multivariate iid central limit theorem: under AC, iid finite-second-moment vectors satisfy the multivariate CLT, including singular covariance.
Multivariate normal law, including singular covariance: under AC, exists for each finite-dimensional symmetric positive-semidefinite covariance .
Cauchy-Schwarz inequality for : for square-integrable , .
Dominated convergence: pointwise almost-everywhere convergence under an integrable dominating function permits passing limits through the integral.
Chebyshev-Markov inequality for the integral: for measurable and , .
A finite-dimensional QMD score has mean zero: the score of a finite-dimensional parametric QMD model at an interior point has mean zero under that point's law.
The Axiom of Choice: AC is assumed for the multivariate CLT and Gaussian-law suppliers [F7]–[F8].
The score and information are those in [F3]; is positive definite.
The local log-density envelope and consistency/MLE hypotheses are as in the Statement.
Proof
Write , , and . By [F3], , and [F12] gives . On both and vanish, so the probability mass is . Expanding the QMD approximation in [F3] and applying [F9] to its cross term gives .
Normalize the absolutely continuous part on by , and put on . Since , [F3] gives , so and from . The local envelope makes square-integrable on and . Along every sequence with , the convergence of has an almost-everywhere convergent subsequence. On it, pointwise. Since and , ; dominated convergence [F10] gives convergence in along that subsequence. Every subsequence has such a subsubsequence, so convergence holds for the full sequence. Sequential compactness of the unit sphere therefore yields . Moreover, the squares are uniformly integrable because converges in along every convergent direction. Taking the logarithm expansion in expectation requires a tail check. Fix . On , the Taylor remainder is bounded by , where . Uniform integrability gives and therefore . On this tail, ; its expectation is by the envelope, Cauchy–Schwarz [F9], and the tail probability. The tail expectations of and are also by [F9] and uniform integrability. Letting proves that the expected Taylor remainder is . Taking expectations then gives the normalization term is .
The squared Hellinger distance equals by step 1.1. The affinity . On let , so . For , follows from for , since this function has derivative and its minimum is at ; integrating gives . Since for because has derivative and value at . Thus , so for some , whenever .
Let for the empirical measure . The pointwise Lipschitz envelope gives . The sample and mean processes are continuous in on compact local balls, so their suprema equal suprema over countable dense subsets and are measurable. To bound the local supremum, take an independent ghost sample . For each fixed original sample, the supremum of absolute values is convex in the ghost sample vector, so Jensen's inequality replaces by in the expected supremum. Swapping each pair with an independent sign and then using the triangle inequality bounds that supremum by twice the expected conditional Rademacher supremum. Condition on the observations for the latter. For the conditional Rademacher process , Hoeffding's exponential bound , since (integrate for and use evenness), makes each increment sub-Gaussian with variance proxy . Choose successively finer dyadic Euclidean nets of the radius- parameter ball. At level the net has at most points, each increment from its level- parent has scale at most , and the expected maximum of centered sub-Gaussian variables of scale is at most , by the exponential-moment bound and optimizing . Summing the resulting bounds uses the convergent series and gives . Symmetrization and therefore give For , step 2.1 gives , and increments have the square-integrable pointwise envelope . Fix a mesh and cover the bounded -ball by finitely many mesh- points. At each center , the variance of is , so Chebyshev and finiteness of the net make the maximum over centers . For increments within cells, form , where is the center of the cell containing . Each is pointwise bounded by . Apply conditional Rademacher chaining to the union of cell classes: at dyadic level there are at most links, each with conditional scale at most after the normalization. The exponential maximum bound and summation of give an expected supremum at most after symmetrization and . Markov's inequality then shows that these cell increments vanish in probability as . Letting and then proves . Thus, for each fixed , uniformly over , The expectation term is step 2.1; the centered term follows by writing and using the two net bounds.
Reduce if needed so the log envelope holds on the radius ball, and put . Consistency makes lie within of with probability tending to one. On the dyadic shells with , exact maximization and require . The expectation bound in step 3.1 and Markov's inequality [F11] bound the probability of this event by . Summing the geometric series and then letting proves using [F4]. The argument used only consistency, feasibility of , and the maximizing inequality; it therefore proves the same bound for any exact maximizer over a subset containing .
Put and . The multivariate CLT [F7] and [F5] make ; step 4.1 makes . For , Uniform convergence on bounded balls in step 3.1, feasibility of bounded local because is interior, and exact MLE maximization therefore force .
The CLT [F7] gives ; the limiting law exists by [F8]. Since is invertible, by the continuous linear map. Combining this with step 5.1 by [F6] proves both the asymptotic linear representation and the stated normal limit. AC is used only through [F7]–[F8].
Depends on
- Dominated statistical experiments
- Parametric statistical models
- Quadratic-mean differentiability at a parameter
- Stochastic order and convergence notation for finite-dimensional random vectors
- Finite-dimensional stochastic-order calculus and tightness
- Vector Slutsky theorem
- Cauchy-Schwarz inequality for $L^2$
- Dominated convergence
- Chebyshev-Markov inequality for the integral
- A finite-dimensional QMD score has mean zero
- Multivariate iid central limit theorem
- Multivariate normal law, including singular covariance
- The Axiom of Choice
Used by
Dependency tree · two levels
63 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 23, PDF p. 15 (standard reference, not scraped)
- Yen-Chi Chen, STAT 581 Chapter 3: M-estimation and the maximum likelihood estimator, Theorem 14 and QMD discussion (standard reference, not scraped)
- John Duchi, Stats 300B Lecture 3, Winter 2018, complete scribe note, PDF pp. 5–6 (standard reference, not scraped)