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.
Nonregular and Misspecified Limits
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Consistency and Limiting Distributions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood Theory and Classical Calibration
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- M- and Z-Estimators
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
This page covers two limits that require conditions beyond regular interior likelihood theory. Under misspecification, a separated interior population target and explicit score and Hessian laws give the sandwich covariance . At a boundary, a uniform local quadratic likelihood over convergent tangent cones gives a difference of squared Fisher distances. The uniform endpoint MLE supplies a support-changing counterexample: its rate is , its limit is exponential, and the model is not QMD.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Pseudo-true parameter under misspecification
Definition
Let be a set, let be a sigma-algebra on it, let be nonempty, and let be a fixed sigma-finite measure on . Suppose is a specified family of nonnegative measurable densities with . Let be the actual data probability measure; it need not equal any model law (Probability measures and probability spaces). Assume -almost surely and is integrable under for every parameter considered. Expectation means integration against (Expectation of a nonnegative or integrable random variable).
The population log-likelihood criterion is . A pseudo-true parameter is any maximizer . It is unique when this argmax set is the singleton . The model is misspecified relative to when for every . This definition does not assert existence, uniqueness, interiority, or separation of the maximizer; those are theorem hypotheses when needed.
Misspecified M-estimator sandwich limit
Statement
Assume the Axiom of Choice (The Axiom of Choice).
Let be IID from a probability law that is misspecified relative to the density family , and let be as in Pseudo-true parameter under misspecification. Write and . Assume that , , and that is the unique separated interior maximizer of , where interior means that some Euclidean open ball about lies in : for each there is such that whenever and . Assume the uniform law , and let be a measurable approximate maximizer with .
Let be continuously differentiable in a neighborhood of . Assume , , and set . Suppose is nonsingular, exists and is continuous at , and for every sufficiently small fixed ,
where . Finally assume the approximate score equation . Then
The covariance is the sandwich matrix formed from the Hessian under and the score second moment under . The theorem does not assert that it equals the inverse Fisher information of the fitted model.
Facts & Assumptions
Given: The data, model, criterion, estimator and hypotheses in the Statement.
The Axiom of Choice (AC) is assumed. It is used by the multivariate IID central limit theorem below, not by the criterion-gap or Taylor arguments (The Axiom of Choice).
A pseudo-true parameter maximizes the actual-law expected log-likelihood; existence, uniqueness and separation are not part of the definition (Pseudo-true parameter under misspecification).
An M-estimator maximizes an empirical criterion, with an optimization gap for an approximate maximizer (M-estimators).
IID means identically distributed and mutually independent, not merely pairwise independent (Identical distribution and IID families).
For an integrable random variable, expectation is its integral against ; for square-integrable vectors, covariance is the expected outer product of the centered vector (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).
Under AC, IID finite-second-moment random vectors have the multivariate central limit theorem: (Multivariate iid central limit theorem).
If and a finite-dimensional vector converges in probability to a constant , then and continuous functions of the pair preserve convergence; independence is not required (Vector Slutsky theorem).
For finite-dimensional random vectors, means for every (Stochastic order and convergence notation for finite-dimensional random vectors).
Scalar convergence in probability means , and random elements converge in distribution when their laws converge weakly (Convergence in probability, Convergence in distribution of random elements).
Proof
Given: The objects and hypotheses in the Statement.
Put and . By assumption and . Since is an approximate maximizer by [F8], , and therefore .
For any fixed , separation gives a positive gap whenever . Step 1.1 then gives . Thus by [F6], so with probability tending to one the segment from to lies in any fixed neighborhood on which the score is differentiable.
Choose a ball about inside the differentiability neighborhood; the measurable event that lies in this ball ensures its segment from stays in that neighborhood. On this event define ; set otherwise. For each fixed parameter in a smaller ball, density measurability makes the log-density measurable, and difference quotients make the sections of and measurable. On compact subballs, rounding parameters to rational grids gives countable-valued Borel approximations; continuity in makes the score and Hessian fields jointly measurable as pointwise limits. The segment integrand is then measurable, and its continuous sample paths make the limit of measurable Riemann sums. Given , continuity of at supplies a sufficiently small fixed for which throughout the -ball. Consistency from step 2.1 and the assumed uniform Hessian law imply .
On the same high-probability event, the componentwise fundamental theorem of calculus along the segment gives . By step 3.1, every entry of tends to zero in probability. The determinant and adjugate are polynomials in the entries, so and ; on the event , , hence every entry of tends to zero in probability. The finite-dimensional matrix bound then gives . Rearranging gives on an event whose probability tends to one.
By [F2], the score vectors are IID; their mean is zero and their covariance is . Their second moment is finite by the Statement, so [F4] and [A1] give with . The matrix converges in probability in operator norm to , and the residual vector by the Statement. Flattening the matrix entries and concatenating the vectors gives a finite-dimensional vector converging in probability to . Applying [F5] to the continuous map gives the limit . Its covariance is , proving the assertion.
Fisher-information metric distance to a set
Definition
Let and let be an invertible real symmetric positive-definite matrix. Define for . For a nonempty set define
This is the distance from to in the norm induced by . The definition uses an infimum; attainment is proved separately when a later result requires it.
Quadratic likelihood optimization is squared Fisher distance
Statement
Let , let be an invertible real symmetric matrix such that for every nonzero , let , and let be nonempty and closed in the Euclidean metric. Define . Then there is a constant such that for all , attains its maximum on , and
Facts & Assumptions
Given: , , , and as in the Statement.
The Euclidean inner product is and its norm is (The Euclidean inner product on ).
A Euclidean closed ball is , and the unit sphere is (Euclidean spheres and closed balls as subspaces of ).
Closed means that the complement is open in the metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
In finite-dimensional Euclidean space, a set is compact exactly when it is closed and bounded (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
A continuous real-valued function on a nonempty compact metric space attains its maximum and minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
For symmetric positive-definite , (Fisher-information metric distance to a set).
Proof
Given: The matrix, vector and set in the Statement.
On the unit sphere of [F2], the function is continuous and strictly positive. The sphere is nonempty, closed and bounded, hence compact by [F4]; [F5] gives a minimum , since a zero minimum would be attained at a unit vector and contradict positive definiteness. Rescaling any nonzero to the unit sphere gives , also valid for .
Completing the square gives . By [F1] and [F6], , which tends to as .
Choose . By step 1.2 there is such that whenever . The set is nonempty, closed and bounded, hence compact by [F2]–[F4]. The continuous quadratic attains a maximum there by [F5]; values outside are below , so this is a global maximum on .
The identity of step 1.2 says that maximizing over is equivalent to minimizing . Step 2.1 proves that this minimum is attained; by [F7] it equals . Substitution gives the stated supremum formula.
Likelihood-ratio limit for local cones in a QMD model
Statement
Assume the Axiom of Choice (The Axiom of Choice).
Let , let , and let . Assume the full-model parameter set is open in , so is interior for the QMD model. Under , let be IID and let be their sample log-likelihood. Define local parameter sets and . Assume the model is QMD at as in Quadratic-mean differentiability at a parameter, and write for its Fisher information; assume is positive definite, meaning for every nonzero . Suppose and are closed in the Euclidean metric (their complements are open), contain , and converge locally to nonempty closed convex cones and with . A cone contains and is closed under multiplication by every nonnegative scalar; convex means that the set contains the line segment between each pair of its points. Local convergence means that, for every , there are such that every point of or is within in Euclidean distance of the other set, and likewise for and . Here a point is within of a set when .
Assume a uniform local quadratic likelihood expansion: for ,
where under and, for every , . Assume the full and null local log-likelihoods attain maxima at and and that both maximizer sequences are tight, meaning that for every some makes the limiting upper probability of either norm exceeding at most . For
the likelihood-ratio statistic satisfies
where is the Fisher-information distance of Fisher-information metric distance to a set. QMD alone is not asserted to imply the uniform expansion or tightness hypotheses.
Facts & Assumptions
Given: AC, the model, local parameter sets, expansion, convergence, and tightness hypotheses in the Statement.
The Axiom of Choice is assumed for the finite-dimensional normal-law convention used here (The Axiom of Choice).
QMD at an interior point means the square-root-density expansion for a square-integrable score and common dominating measure (Quadratic-mean differentiability at a parameter).
The Fisher distance is (Fisher-information metric distance to a set).
The Euclidean inner product is and its norm is (The Euclidean inner product on ).
, and the Euclidean metric has this norm as its distance (Euclidean spheres and closed balls as subspaces of ).
The Cauchy–Schwarz inequality gives (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
For nonempty closed , there is with , and maximizing over gives ; the maximum is attained (Quadratic likelihood optimization is squared Fisher distance).
Under AC, is a Borel probability law with the stated covariance (Multivariate normal law, including singular covariance).
Weak convergence of laws gives the closed-set upper bound for each closed (Portmanteau theorem).
Continuous maps preserve convergence in distribution at points of continuity of the limiting law (Continuous mapping theorem).
For real random variables, adding a term converging in probability to zero preserves convergence in distribution (Slutsky's theorem for real random variables).
Convergence in probability means that every fixed positive error threshold is exceeded with probability tending to zero (Convergence in probability); convergence in distribution is weak convergence of the laws (Convergence in distribution of random elements).
Proof
Given: The objects and hypotheses in the Statement.
With the supplied QMD information of [F1], write and for . By [F6], . If is a maximizer, then . The lower bound in [F6] and [F5] imply (with the bound immediate when ).
Let be from [F6], fix , and choose . For , (and likewise for , ), write . For every , [F6] gives a maximizer of on with . Local set convergence supplies points of within of , hence inside the radius- ball for all large . Conversely, every point of is within of a point of . With , [F3] and [F5] give for and . These two directions show . The same bounds apply to both full and null sets.
The sequence is tight. Indeed, for any choose with , possible because [F7] supplies a Borel probability law on finite-dimensional . The set is closed, so [F8] bounds by . step 1.1 then makes the maximizers of over and tight as well.
For or , put . The uniform expansion gives for each fixed . For fixed and , step 1.2 therefore gives, for every , , with or , respectively.
Given , tightness of lets us choose so that with limiting probability at least . Choose large enough that the joint event that both local likelihood maximizers lie in the radius- ball has limiting probability at least . By step 1.1 both quadratic maximizers also lie in that ball whenever . Thus all four full and truncated suprema agree except on events with total limiting upper probability at most . step 2.2 and arbitrariness of give .
The form is an inner product; its Cauchy–Schwarz inequality follows by requiring for every real . Thus the induced norm satisfies the triangle inequality, and taking infima gives . Also , where is the finite entry sum from step 1.2, so the distance map is Euclidean Lipschitz after composition with the fixed linear map . Therefore is continuous. The formula in step 1.1 gives . By [F9], . step 3.1 and [F10] then give , which is the stated distance-difference law.
Remarks
The uniform local expansion and tightness are explicit hypotheses. The proof does not infer uniformity over bounded local parameters from pointwise LAN, and it does not invoke the regular interior Wilks theorem at a boundary.
The uniform endpoint MLE has rate n, not square-root n
Statement refuted
For an integer , iid with fixed have an endpoint MLE with a nonzero root- fluctuation: does not converge in probability to zero.
Facts & Assumptions
Given: , IID observations with density , and .
IID means a common law and mutual independence (Identical distribution and IID families); a probability law has total mass one (Probability measures and probability spaces).
QMD at an interior point requires a square-root-density score remainder with squared norm (Quadratic-mean differentiability at a parameter).
For real random variables, means convergence of CDFs at every continuity point of the limiting CDF (Convergence in distribution for real random variables).
means for every (Convergence in probability).
Counterexample
The parameter space is and the common dominating measure is Lebesgue measure. The MLE is understood almost surely; on the null event , assign any fixed positive value.
Given: The Uniform model and IID sample in the Statement.
On the probability-one event , the likelihood at a candidate is . It is zero for , while for it equals , with strict inequality if . Thus maximizes the likelihood almost surely; on the null event , use the arbitrary positive assignment specified above.
For , independence and the uniform CDF give . For fixed this formula applies for all sufficiently large , and its limit is .
For every small enough that , the gained support interval has and . If the model were QMD at , the score term in [F2] would vanish on this interval and the squared remainder integral would be at least . But , contradicting the required remainder. Thus the model is not QMD at .
Therefore the nonnegative variable converges in distribution to the exponential law with rate , whose CDF is for and for . The limiting CDF is continuous, so [F3] applies at every real .
For any and all , the exact maximum formula gives . Thus by [F4], refuting the stated nonzero root- fluctuation and confirming the faster rate in step 2.1.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Yen-Chi Chen, UW STAT 581 Chapter 3: M-estimation and the maximum likelihood estimator
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15
- Aad W. van der Vaart, Semiparametric Statistics, extended St Flour lecture notes, Lecture 6 §6.5
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 26
- Steven G. Self and Kung-Yee Liang, Asymptotic Properties of Maximum Likelihood Estimators and Likelihood Ratio Tests Under Nonstandard Conditions
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 22