Alphabeta Math
Pipeline-generated
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.

✓ 2 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

M- and Z-Estimators

1 · Prerequisites

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 {mθ:θ∈Θ} satisfies its uniform-convergence premise when it is pointwise measurable, has a measurable integrable envelope, and has finite L1(P) 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 {ψθ,j:θ∈Θ}, 1≤j≤q. If Un,j=sup⁡θ∣(Pn−P)ψθ,j∣, the supplier gives Un,j=oP(1) for each coordinate. For the fixed norm in the theorem and standard basis vectors ej, the triangle inequality gives sup⁡θ∥(Pn−P)ψθ∥≤∑j=1q∥ej∥Un,j=oP(1). The last conclusion follows from a finite union bound, since q 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

M-estimators

Definition

Let P be a probability measure on a measurable observation space (X,A), and let X1,X2,… be IID with law P; IID means a common law and mutual independence of the whole family (Probability measures and probability spaces, Identical distribution and IID families). Let (Θ,d) be a metric candidate space with its Borel sigma-algebra (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The Borel sigma-algebra of a topological space). For each θ∈Θ, let mθ:X→R be measurable and assume P∣mθ∣<∞. Define Pnmθ=1n∑i=1nmθ(Xi),Pmθ=∫mθ dP.

A measurable estimator sequence θ^n into the Borel target Θ is an M-estimator if it maximizes or minimizes θ↦Pnmθ; measurability is as in Estimator sequences in IID experiments. It is an exact maximizer when Pnmθ^n=sup⁡θ∈ΘPnmθ, and an oP(1)-approximate maximizer when the finite measurable gap sup⁡θ∈ΘPnmθ−Pnmθ^n is oP(1). For minimization use the gap Pnmθ^n−inf⁡θ∈ΘPnmθ. The notation oP(1) is that of Stochastic order and convergence notation for finite-dimensional random vectors.

The maximizing and minimizing forms are both included; replacing mθ by −mθ converts one to the other. This definition does not assert that a maximizer exists, nor that the population criterion Pmθ has a unique maximizer. Whenever a random candidate is substituted into the empirical or population criterion, assume that evaluation is measurable and finite.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Z-estimators

Definition

Let P be a probability measure on (X,A), let X1,X2,… be IID with law P (Probability measures and probability spaces, Identical distribution and IID families), and let (Θ,d) be a metric candidate space with its Borel sigma-algebra (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, The Borel sigma-algebra of a topological space). Fix a finite integer q≥1 and a norm on Rq. For each θ∈Θ, let ψθ:X→Rq be measurable with P∥ψθ∥<∞. Define Ψn(θ)=Pnψθ=1n∑i=1nψθ(Xi),Ψ(θ)=Pψθ.

A measurable estimator sequence θ^n into the Borel target Θ is a Z-estimator if it is an exact or oP(1)-approximate root: Ψn(θ^n)=0 for every n, or ∥Ψn(θ^n)∥=oP(1). Measurability is as in Estimator sequences in IID experiments, and oP(1) 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 q≥1 is finite, For n≥1 all norms on Rn are equivalent gives constants c,C>0 with c∥v∥2≤∥v∥≤C∥v∥2 for every v∈Rq. Thus for every Rq-valued sequence, convergence of the chosen-norm tails to zero is equivalent to the Euclidean oP(1) 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Consistency of M-estimators under a uniform law

Statement

Let (Θ,d) be a metric space, let X1,…,Xn be IID with law P, and let mθ be a jointly measurable, P-integrable real criterion for every θ∈Θ. Write Mn(θ)=Pnmθ and M(θ)=Pmθ. Fix θ0∈Θ. Assume the displayed suprema and estimator evaluations below are measurable and finite where used. In the maximization case, suppose

  1. Un=sup⁡θ∈Θ∣Mn(θ)−M(θ)∣=oP(1);

  2. for every ε>0, γε=M(θ0)−sup⁡{M(θ):d(θ,θ0)≥ε}>0, with sup⁡∅=−∞;

  3. the measurable estimator θ^n satisfies Mn(θ^n)≥Mn(θ0)−ρn for a nonnegative ρn=oP(1).

Then θ^n is consistent in probability for θ0, meaning P⊗n{d(θ^n,θ0)>ε}→0 for every ε>0 (Pointwise consistency in probability). The same conclusion holds for a minimizing estimator if, for every ε>0, inf⁡{M(θ):d(θ,θ0)≥ε}−M(θ0)>0 and Mn(θ^n)≤Mn(θ0)+σn for a nonnegative measurable σn=oP(1). The relative criterion-gap premise in the maximizing case is implied by the global exact or oP(1)-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.

[F1]

M-estimators: An M-estimator is a data-measurable exact or oP(1)-approximate maximizer or minimizer of the empirical criterion Pnmθ.

[F2]

Stochastic order and convergence notation for finite-dimensional random vectors: oP(1) 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.

[F3]

Pointwise consistency in probability: At a fixed target, consistency means that the probability of every fixed positive metric error tends to zero.

[A1]

The parameter space (Θ,d) is a metric space, the data are IID with law P, each mθ is integrable, and all displayed criterion evaluations and suprema are measurable.

[A2]

The uniform error Un is oP(1).

[A3]

For every ε>0, the population criterion has the stated positive separation gap γε.

[A4]

The empirical maximization error ρn is nonnegative and oP(1), and Mn(θ^n)≥Mn(θ0)−ρn.

[A5]

For the minimizing branch, the population minimum has the stated positive separation gap and the nonnegative measurable minimization error σn is oP(1) with Mn(θ^n)≤Mn(θ0)+σn.

[A6]

For the global M-estimator specialization, the nonnegative empirical gap τn=sup⁡θ∈ΘMn(θ)−Mn(θ^n) is finite and oP(1); exact maximizers have τn=0.

Proof

1.1A1A3choose

Fix ε>0. If {θ:d(θ,θ0)≥ε} is empty, the corresponding metric-error event is empty and its probability is zero for every n. 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 M(θ0). On the event d(θ^n,θ0)≥ε, separation gives M(θ^n)≤M(θ0)−γ. The remaining steps treat this nonempty case.

2.1A2A3A4step 1.1algebra

On that event, [A2] gives Mn(θ^n)≤M(θ0)−γ+Un and Mn(θ0)≥M(θ0)−Un. The approximate-maximization inequality [A4] also gives Mn(θ^n)≥Mn(θ0)−ρn. Combining them yields γ≤2Un+ρn.

3.1F2F3A2A4step 2.1given

Since Un=oP(1) and ρn=oP(1), the probability of 2Un+ρn≥γ tends to zero. Step 2.1 therefore gives P⊗n{d(θ^n,θ0)≥ε}→0, which implies the strict-error probability in [F3] tends to zero. Thus θ^n is consistent.

4.1A1A2A5step 1.1step 2.1step 3.1algebra

For the minimizing case, set M~n=−Mn and M~=−M. By [A5], the separated-minimum condition becomes separated maximization of M~, and M~n(θ^n)≥M~n(θ0)−σn. By [A2], sup⁡θ∣M~n(θ)−M~(θ)∣=Un=oP(1). Thus the maximizing hypotheses in steps 1.1–3.1 hold for the transformed criterion, proving consistency in the minimizing case as well.

5.1A4A6F1algebra∎

For an exact or approximate global M-estimator, [F1] and [A6] give Mn(θ^n)≥sup⁡θ∈ΘMn(θ)−τn. Since Mn(θ0)≤sup⁡θ∈ΘMn(θ), this implies Mn(θ^n)≥Mn(θ0)−τn, which is the relative maximization condition [A4] with ρn=τn. Thus the theorem applies.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Consistency of Z-estimators under a uniform law

Statement

Let (Θ,d) be a metric space, let X1,…,Xn be IID with law P, and let ψθ be jointly measurable and integrable as an Rq-valued function for a fixed finite q≥1. Write Ψn(θ)=Pnψθ and Ψ(θ)=Pψθ, using a fixed norm on Rq. Fix θ0∈Θ. Assume the displayed suprema and estimator evaluations are measurable. If

  1. sup⁡θ∈Θ∥Ψn(θ)−Ψ(θ)∥=oP(1);

  2. Ψ(θ0)=0 and, for every ε>0, bε=inf⁡{∥Ψ(θ)∥:d(θ,θ0)≥ε}>0, with inf⁡∅=+∞;

  3. ∥Ψn(θ^n)∥=oP(1) for a measurable estimator θ^n,

then θ^n is consistent in probability for θ0.

Facts & Assumptions

Given: The IID sampling law, finite-dimensional estimating functions, measurable estimator, and the three displayed hypotheses.

[F1]

Z-estimators: A Z-estimator is an exact or oP(1)-approximate root of Ψn(θ)=Pnψθ.

[F2]

Stochastic order and convergence notation for finite-dimensional random vectors: For fixed finite q, oP(1) means the norm exceeds every fixed positive threshold with probability tending to zero.

[F4]

Pointwise consistency in probability: Consistency at θ0 is convergence in probability in the metric d.

[A1]

The parameter space (Θ,d) is a metric space, the data are IID with law P, ψθ is integrable, and all displayed evaluations and suprema are measurable.

[A2]

The uniform equation error sup⁡θ∥Ψn(θ)−Ψ(θ)∥ is oP(1).

[A3]

Ψ(θ0)=0, and each displayed separation bound bε is positive.

[A4]

The root residual ∥Ψn(θ^n)∥ is oP(1).

Proof

1.1A1A2A3A4F2chooseF1

Fix ε>0. If {θ:d(θ,θ0)≥ε} is empty, the corresponding metric-error event is empty and its probability is zero for every n. Otherwise b=bε 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 Vn=sup⁡θ∥Ψn(θ)−Ψ(θ)∥ and Rn=∥Ψn(θ^n)∥. Both are measurable, and Vn=oP(1) and Rn=oP(1) by [A2] and [A4]. The remaining steps treat this nonempty case.

2.1A1A3step 1.1algebra

On the event d(θ^n,θ0)≥ε, separation and the triangle inequality give b≤∥Ψ(θ^n)∥≤∥Ψ(θ^n)−Ψn(θ^n)∥+∥Ψn(θ^n)∥≤Vn+Rn. Thus the metric-error event is contained in {Vn+Rn≥b}. This uses the equation error itself, with no representation of the nonlinear quantity −∥Pnψθ∥ as an empirical average of a fixed criterion.

3.1F2F4step 1.1step 2.1given∎

Since b>0, the union bound gives P⊗n(Vn+Rn≥b)≤P⊗n(Vn>b/3)+P⊗n(Rn>b/3)→0 by [F2] and step 1.1. Step 2.1 therefore implies P⊗n{d(θ^n,θ0)≥ε}→0, and hence the same holds with strict inequality. Together with the empty case of step 1.1, this proves consistency for every ε>0 by [F4].

5 · Examples, counterexamples and false statements

None yet.

Sources