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.
M- and Z-Estimators
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Countability and Uncountability
- Filters and Ultrafilters
- Foundations of the Real Numbers for Analysis
- Independence Borel Cantelli and Zero One Laws
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
This page defines M-estimators as measurable empirical criterion extrema and Z-estimators as measurable approximate roots. A nonsmooth M-criterion need not have a score equation, so the two definitions remain distinct. The consistency results prove the uniform criterion-gap and uniform equation-gap arguments under explicit measurability, separation, and approximate-optimization hypotheses. Their uniform-convergence assumptions remain visible: pointwise convergence alone does not supply a uniform law. The examples show quadratic and absolute criteria, a finite-class uniform law, and failure when the population optimum is not separated.
The concrete uniform-law supplier is Glivenko–Cantelli classes and Glivenko–Cantelli theorem by bracketing entropy on Chaining and Uniform Limits. For the M theorem, the class satisfies its uniform-convergence premise when it is pointwise measurable, has a measurable integrable envelope, and has finite bracketing number at every positive scale. A countable pointwise-dense subclass determines the scalar supremum, so that version is measurable; the supplier's outer-probability convention then agrees with ordinary probability. This uses the supplier's convergence-in-probability branch, which requires no Countable Choice assumption.
For the Z theorem, impose those scalar hypotheses on each coordinate class , . If , the supplier gives for each coordinate. For the fixed norm in the theorem and standard basis vectors , the triangle inequality gives The last conclusion follows from a finite union bound, since is fixed. Retain the theorem's explicit measurability assumptions on the displayed vector supremum and estimator evaluations. These are sufficient routes to the stated conditional hypotheses; neither pointwise SLLN nor coordinatewise integrability alone supplies a uniform law.
3 · Logical flowchart
4 · Definitions, theorems and proofs
M-estimators
Definition
Let be a probability measure on a measurable observation space , and let be IID with law ; IID means a common law and mutual independence of the whole family (Probability measures and probability spaces, Identical distribution and IID families). Let be a metric candidate space with its Borel sigma-algebra (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The Borel sigma-algebra of a topological space). For each , let be measurable and assume . Define
A measurable estimator sequence into the Borel target is an M-estimator if it maximizes or minimizes ; measurability is as in Estimator sequences in IID experiments. It is an exact maximizer when , and an -approximate maximizer when the finite measurable gap is . For minimization use the gap . The notation is that of Stochastic order and convergence notation for finite-dimensional random vectors.
The maximizing and minimizing forms are both included; replacing by converts one to the other. This definition does not assert that a maximizer exists, nor that the population criterion has a unique maximizer. Whenever a random candidate is substituted into the empirical or population criterion, assume that evaluation is measurable and finite.
Z-estimators
Definition
Let be a probability measure on , let be IID with law (Probability measures and probability spaces, Identical distribution and IID families), and let be a metric candidate space with its Borel sigma-algebra (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The Borel sigma-algebra of a topological space). Fix a finite integer and a norm on . For each , let be measurable with . Define
A measurable estimator sequence into the Borel target is a Z-estimator if it is an exact or -approximate root: for every , or . Measurability is as in Estimator sequences in IID experiments, and has the convention of Stochastic order and convergence notation for finite-dimensional random vectors. Whenever a random candidate is substituted into an estimating equation, assume the evaluation is measurable.
Because is finite, For all norms on are equivalent gives constants with for every . Thus for every -valued sequence, convergence of the chosen-norm tails to zero is equivalent to the Euclidean convention in Stochastic order and convergence notation for finite-dimensional random vectors.
This definition does not infer a Z-estimating equation from an M-criterion. Differentiating an M-criterion is justified only under additional differentiability and interior-point hypotheses; a nonsmooth criterion need not have a score equation.
Consistency of M-estimators under a uniform law
Statement
Let be a metric space, let be IID with law , and let be a jointly measurable, -integrable real criterion for every . Write and . Fix . Assume the displayed suprema and estimator evaluations below are measurable and finite where used. In the maximization case, suppose
-
;
-
for every , , with ;
-
the measurable estimator satisfies for a nonnegative .
Then is consistent in probability for , meaning for every (Pointwise consistency in probability). The same conclusion holds for a minimizing estimator if, for every , and for a nonnegative measurable . The relative criterion-gap premise in the maximizing case is implied by the global exact or -approximate M-estimator definition, as proved in the final proof step.
The uniform-convergence premise is an explicit hypothesis. This theorem does not replace it with pointwise convergence or a pointwise law of large numbers.
Facts & Assumptions
Given: The IID sampling law, metric parameter space, measurable criterion and estimator, and the three displayed maximization hypotheses; also [A6] when invoking the global-M-estimator specialization.
M-estimators: An M-estimator is a data-measurable exact or -approximate maximizer or minimizer of the empirical criterion .
Stochastic order and convergence notation for finite-dimensional random vectors: for a real random variable means convergence in probability to zero; for finite-dimensional vectors it means the norm exceeds each fixed positive threshold with probability tending to zero.
Pointwise consistency in probability: At a fixed target, consistency means that the probability of every fixed positive metric error tends to zero.
The parameter space is a metric space, the data are IID with law , each is integrable, and all displayed criterion evaluations and suprema are measurable.
The uniform error is .
For every , the population criterion has the stated positive separation gap .
The empirical maximization error is nonnegative and , and .
For the minimizing branch, the population minimum has the stated positive separation gap and the nonnegative measurable minimization error is with .
For the global M-estimator specialization, the nonnegative empirical gap is finite and ; exact maximizers have .
Proof
Fix . If is empty, the corresponding metric-error event is empty and its probability is zero for every . Otherwise write , which is finite and positive because the nonempty set contains a point with finite population criterion and [A3] bounds its supremum strictly below the finite . On the event , separation gives . The remaining steps treat this nonempty case.
On that event, [A2] gives and . The approximate-maximization inequality [A4] also gives . Combining them yields .
Since and , the probability of tends to zero. Step 2.1 therefore gives , which implies the strict-error probability in [F3] tends to zero. Thus is consistent.
For the minimizing case, set and . By [A5], the separated-minimum condition becomes separated maximization of , and . By [A2], . Thus the maximizing hypotheses in steps 1.1–3.1 hold for the transformed criterion, proving consistency in the minimizing case as well.
For an exact or approximate global M-estimator, [F1] and [A6] give . Since , this implies , which is the relative maximization condition [A4] with . Thus the theorem applies.
Consistency of Z-estimators under a uniform law
Statement
Let be a metric space, let be IID with law , and let be jointly measurable and integrable as an -valued function for a fixed finite . Write and , using a fixed norm on . Fix . Assume the displayed suprema and estimator evaluations are measurable. If
-
;
-
and, for every , , with ;
-
for a measurable estimator ,
then is consistent in probability for .
Facts & Assumptions
Given: The IID sampling law, finite-dimensional estimating functions, measurable estimator, and the three displayed hypotheses.
Z-estimators: A Z-estimator is an exact or -approximate root of .
Stochastic order and convergence notation for finite-dimensional random vectors: For fixed finite , means the norm exceeds every fixed positive threshold with probability tending to zero.
Pointwise consistency in probability: Consistency at is convergence in probability in the metric .
The parameter space is a metric space, the data are IID with law , is integrable, and all displayed evaluations and suprema are measurable.
The uniform equation error is .
, and each displayed separation bound is positive.
The root residual is .
Proof
Fix . If is empty, the corresponding metric-error event is empty and its probability is zero for every . Otherwise is finite and positive: [A3] gives positivity, and any point in this nonempty set has a finite population equation norm by integrability in [A1]. Put and . Both are measurable, and and by [A2] and [A4]. The remaining steps treat this nonempty case.
On the event , separation and the triangle inequality give Thus the metric-error event is contained in . This uses the equation error itself, with no representation of the nonlinear quantity as an empirical average of a fixed criterion.
Since , the union bound gives by [F2] and step 1.1. Step 2.1 therefore implies , and hence the same holds with strict inequality. Together with the empty case of step 1.1, this proves consistency for every by [F4].
5 · Examples, counterexamples and false statements
None yet.
Sources
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, PDF pp. 2–8
- Aad W. van der Vaart, Semiparametric Statistics, Lecture 5 §5.3, PDF pp. 54–56
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, PDF pp. 2–3 and 8–10
- Aad W. van der Vaart, Semiparametric Statistics, Lecture 5 §5.3, PDF pp. 55–56
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, Theorem and proof, PDF pp. 7–8
- Aad W. van der Vaart, Semiparametric Statistics, Lecture 5 §5.3, Theorem 5.8 and proof, PDF p. 54
- Yen-Chi Chen, UW STAT 581, Chapter 3, lines 100–109
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 15, Theorem and proof, PDF pp. 8–10
- Aad W. van der Vaart, Semiparametric Statistics, Lecture 5 §5.3, Theorem 5.10 and proof, PDF p. 56
- Yen-Chi Chen, UW STAT 581, Chapter 3, lines 110–118