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.
Delta Method and Asymptotic Normality
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
- 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
- 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
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- 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 proves first- and second-order delta limits for finite-dimensional random vectors and the asymptotic linearity and normality of iid Z-estimators. The first-order result uses a pointwise derivative expansion; the second-order result requires a zero first derivative and a quadratic Peano expansion. The Z-estimator result assumes consistency, a root residual of order , a nonsingular mean derivative, finite score covariance, and local stochastic equicontinuity. It does not infer equicontinuity from consistency alone. Its normal-limit branch assumes AC through the library's multivariate iid central limit theorem.
3 · Logical flowchart
4 · Definitions, theorems and proofs
First- and second-order delta method for random vectors
Statement
Let , let be deterministic with , and let be -valued random vectors with target . Suppose for an -valued random vector . All vector norms below are Euclidean.
If is Borel and there is a linear map such that then
If, in addition, and there is a continuous symmetric bilinear map such that then For scalar-valued , is the usual Hessian bilinear form. The second-order premise is a pointwise Peano expansion; continuous second derivatives on a neighborhood are not required.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Stochastic order and convergence notation for finite-dimensional random vectors: means bounded in probability by tail probabilities, and means convergence in probability to zero.
Finite-dimensional stochastic-order calculus and tightness: finite-dimensional weak convergence implies .
Finite-dimensional stochastic-order calculus and tightness: a fixed continuous bilinear map sends an factor times an factor to .
Vector Slutsky theorem: if and , then , and continuous maps preserve this limit.
The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: on finite-dimensional real matrix spaces, differentiability means a real-linear first-order approximation with a remainder whose norm divided by the input norm tends to zero. Identify with real column matrices and use the Euclidean/Frobenius norm equality.
Convergence in distribution of random elements: means weak convergence of their laws in the common metric target; the random elements need not share probability spaces.
Proof
Given: The objects and hypotheses in the statement.
By [F6], is weak convergence in . By [F2], this implies .
Since , the deterministic sequence is . Applying the bilinear product rule in [F3] to scalar multiplication gives .
Fix . By [F2] choose with . The first-order remainder limit in the statement gives such that when . Step 2.1 gives , so the limiting upper probability that is at most . Letting proves . Substitution in the first expansion yields .
Fix . By [F2] choose with . The second-order remainder limit in the statement gives such that for . Step 2.1 puts inside this neighborhood with probability tending to one. Outside the two tail events, because . Thus ; since , substitution in the second expansion gives .
The map is continuous. Apply [F4] to and the error in step 3.1 to obtain the first-order limit .
The quadratic map is continuous. Apply [F4] to its value at and the error in step 3.2 to obtain the second-order limit .
Remarks
The first-order result is choice-free and does not require to be Gaussian. If almost surely, its first-order limit is degenerate; the second-order statement gives a different scale only when its stated expansion holds.
Asymptotic linearity and normality of iid Z-estimators
Statement
Assume the Axiom of Choice (AC), as required by the library's multivariate iid central limit theorem. Let be a measurable space, let be open with its Borel sigma-algebra, and let . Let be iid -valued observations with law . Let be jointly measurable and satisfy for every ; write . Let be a measurable estimator sequence as in Estimator sequences in IID experiments and a Z-estimator as in Z-estimators, with the stronger root-rate condition below. Write Assume the displayed random vectors and suprema below are measurable, and suppose:
- and .
- , , and .
- The mean map has expansion with nonsingular and as , .
- The local stochastic-equicontinuity condition holds: for every ,
Here denotes the product sampling law of .
Then This theorem assumes consistency and the local empirical-process condition; it asserts neither. The local equicontinuity condition is the direct process hypothesis used in the proof, and consistency alone does not replace it.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
and .
For every , the local stochastic-equicontinuity limit in condition 4 of the statement is zero.
, is nonsingular, and .
and .
Stochastic order and convergence notation for finite-dimensional random vectors: and are defined by boundedness and convergence of tail probabilities.
Finite-dimensional stochastic-order calculus and tightness: weak convergence implies finite-dimensional tightness, and .
Vector Slutsky theorem: joint convergence with a probability-limit constant and continuous finite-dimensional transformations require no independence.
Convergence in distribution of random elements: convergence in distribution means weak convergence of laws, with no common probability space required.
Identical distribution and IID families: iid means a common law and mutual independence of the whole family.
The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: a finite-dimensional derivative is the real-linear first-order approximation with remainder .
Multivariate iid central limit theorem: under AC, iid finite-dimensional vectors with finite second moment have a centered normal limit with their covariance; singular covariance is allowed.
Multivariate normal law, including singular covariance: under AC, is characterized by all scalar projections having their corresponding centered normal laws; its covariance is .
The Axiom of Choice: every family of nonempty sets has a choice function.
Z-estimators: a measurable estimator sequence is a Z-estimator when it is an exact root or an -approximate root of its empirical equation.
Estimator sequences in IID experiments: an estimator sequence consists of measurable maps from each product sample space into its Borel target space.
Measurable coordinatewise functions preserve independence: applying measurable coordinatewise maps to an independent family preserves independence.
Proof
Given: AC, the iid observations and score functions, and assumptions [A1]–[A4].
Fix . By [A2] choose such that the limiting upper probability of the displayed supremum exceeding is at most . By [A1], . On the complementary event, is bounded by that supremum. Hence its limiting upper tail probability is at most ; letting proves .
By [F12], applying the same measurable map to the iid observations preserves independence; identical distribution follows because every has the same law. By [A4] and [F5], is a centered iid sum with finite covariance . AC is available by [F9], so [F7] gives , where convergence in distribution is weak convergence of laws by [F4]. In particular by [F2].
Put and . By [F10]–[F11], the estimator and root have the stated Z-estimator and data-measurability conventions; [A1] imposes the stronger root-rate residual, which is also since . The identity , [A1], step 1.1 and the derivative expansion in [A3], as specified by [F6], give . Moreover by [A1] and [A3], with the ratio set to zero when .
Since is nonsingular, [A3] and step 2.1 imply , where and (set if ). With probability tending to one, . Absorbing that term and using from step 1.2 proves .
Now because it is the product of and . Substituting into step 2.1 gives .
By [F4], [F7], and [F8], the continuous linear image converges to a centered Gaussian with covariance : for every , the projection of along is centered normal with variance . Applying [F3] to the remainder in step 4.1 proves the asserted normal limit. AC is used in the multivariate iid CLT and the normal-law supplier, not in the stochastic-order or Taylor steps.
Remarks
By Z-estimators, an root residual is enough for the Z-estimator definition; condition 1 strengthens it to . The theorem assumes consistency and local stochastic equicontinuity; it does not use Consistency of Z-estimators under a uniform law or infer equicontinuity from consistency alone. The proof uses the quantified process condition directly, without a uniform-law theorem.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF pp. 9–12
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, PDF pp. 2–4
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF p. 13
- Aad W. van der Vaart, Semiparametric Statistics, Lecture 6 §6.5, Theorem 6.19, PDF pp. 73–74