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.
Semiparametric Efficiency
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- 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 Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- 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
- Contour Integration
- 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
- Finite Probability Spaces and Random Variables
- 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
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- 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
- Influence Functions and Efficient Scores
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- LAN, Contiguity and Efficiency
- 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
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- 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
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- 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
- Semiparametric Models and Tangent Spaces
- 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
- Stationary Markov Chains and Ergodic Limits
- 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 Analytic Hahn Banach Theorem
- 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 Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- 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
An asymptotically linear estimator has a Gaussian limit under the iid central limit theorem. In a pathwise differentiable model, regularity forces its influence function to represent the path derivative; orthogonal decomposition then gives the covariance bound of the canonical gradient. The separate convolution route treats general regular estimators under explicit LAN, regularity, limit-law, and dense-submodel hypotheses. None of these lower bounds establishes that an attaining estimator exists.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Asymptotic linearity implies asymptotic normality
Statement
Assume the Axiom of Choice. Let be iid with law , let , and let estimate . If it is asymptotically linear at with influence function , then
The covariance may be singular. This is a distributional limit only; the theorem asserts neither local regularity nor estimator attainment of an efficiency bound.
Facts & Assumptions
Given: The iid experiment, the finite-dimensional estimator and target, asymptotic linearity with , and AC.
Asymptotically linear estimators and influence functions: , where and .
Multivariate iid central limit theorem: under AC, normalized sums of iid finite-second-moment vectors converge to the centered multivariate normal with their covariance, including singular covariance.
Continuous mapping theorem: continuous linear maps preserve convergence in distribution.
Slutsky's theorem for real random variables: adding a real random variable converging to zero in probability preserves a real distributional limit.
Cramer wold device: convergence of every one-dimensional projection to the corresponding projection of a specified Borel probability law implies vector convergence in distribution; this use assumes AC.
The Axiom of Choice: AC is assumed by [F2] and [F5].
Proof
Given: AC, iid , , and an estimator satisfying [F1].
Put and . By [F1], in probability. The vectors are iid, centered, and have finite second moment, so [F2] gives . The covariance is positive semidefinite by for every .
Fix any . By [F3], . Also , so in probability. Apply [F4] to obtain .
Step 2.1 holds for every , and is the specified Borel Gaussian law from step 1.1. [F5] therefore gives , which is the asserted limit. No nonsingularity of is used.
Finite-dimensional LAN convolution bound for differentiable functionals
Statement
Assume AC and let be finite. Let be LAN at with positive-definite information matrix and central sequence . Let be a local target such that for every fixed ,
for a fixed matrix . Suppose is regular for this target: under each fixed , for the same Borel law . Then there is a probability law on such that
The Gaussian covariance may be singular. No finite-moment hypothesis on or is needed.
Facts & Assumptions
Given: AC; the finite-dimensional LAN experiment, positive-definite , central sequence ; the local target derivative matrix ; and a regular estimator with common limit law .
Local asymptotic normality for local experiments: for each fixed , a mean-one proxy has and is total-variation close to the actual local law.
Regular estimator under local alternatives: for an identity target the centered statistic has a common limit under each fixed local displacement; the statement gives the corresponding target-shift condition explicitly.
Le Cam's third lemma for a Gaussian likelihood-ratio limit: the joint limit tilted by the mean-one Gaussian likelihood ratio describes the statistic's limit under the proxy local law.
Weakly convergent sequences are tight and Prokhorov tightness theorem on polish spaces: convergent marginal laws are tight, and under AC a tight sequence of joint Borel laws on Euclidean space has a weakly convergent subsequence.
Identity theorem for holomorphic functions: two holomorphic functions on a connected complex domain that agree on a set with an interior accumulation point agree throughout the domain.
Multivariate normal law, including singular covariance and Characteristic function of a multivariate normal law: has characteristic function and finite exponential moments in every real direction.
Continuous mapping theorem and Slutsky's theorem for real random variables: continuous projections preserve weak limits, and scalar remainders preserve those limits.
Uniqueness of a law from its characteristic function: real probability laws with equal characteristic functions are equal; the vector conclusion below is obtained from scalar projections using Cramer–Wold.
Cramer wold device: under AC, equality or convergence of all real projections determines the Borel vector law.
The product measure of two sigma-finite measure spaces, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: sigma-finite products have the rectangle formula, and Tonelli evaluates nonnegative product integrals by iterated integration.
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: closed bounded subsets of finite-dimensional Euclidean space are compact.
Finite and countable subadditivity of measures: the measure of a finite union is at most the sum of the measures of its members.
Characteristic function of a real random variable: the characteristic function of a real random variable is .
Fubini's theorem for L^1 functions on a sigma-finite product: a bounded complex-valued function is integrable under a product probability, and Fubini factors the integral of a product of coordinate functions.
The Axiom of Choice: AC is assumed by LAN, Prokhorov's theorem, and the finite-dimensional characteristic-function uniqueness and Cramer–Wold suppliers.
Proof
Given: The local experiment, target, estimator, and hypotheses above.
Under , by regularity at and by LAN. Marginal tightness gives compact sets with outside probabilities below ; enlarge them to closed balls. Their product is closed and bounded in and hence compact by [F11]. By [F12] the joint outside probability is at most , so the joint laws of are tight.
By [F4], choose a subsequence along which . Its marginals have laws and . Fix . By [F1], ; define when and otherwise. This replacement changes a variable only on an event of probability . For any and , the projection of differs by from . The latter converges by [F7]; applying scalar Slutsky and [F9] to every projection gives .
By the continuous mapping theorem [F7], . Since off the event , whose probability tends to zero by [F1], the same joint limit holds with . Apply [F3] to this mean-one proxy; [F1] transfers its limit under the proxy law to the actual law. Regularity and imply that under this same actual law : apply [F7] to each real projection and then [F9]. Therefore for every real and , where .
Rearranging step 3.1 gives for every real . For complex , define . On every compact set of , its coordinate power series and derivatives are dominated by for some finite , whose expectation is finite because is Gaussian. Thus is entire in each coordinate, as is the right-hand side. Apply [F5] one coordinate at a time, holding the remaining coordinates real and then extending them successively; the equality holds for every complex .
Put in step 4.1. By [F13], the resulting characteristic functions satisfy, for all real , . Set and replace by . Direct expansion gives . At the first factor is the characteristic function of ; the second is the characteristic function of . The joint characteristic function therefore factors as the product of the marginal characteristic functions.
Let , whose product law exists by [F10]. For each and , the function is bounded and hence integrable under ; [F14] factors its integral into the marginal characteristic functions. By [F13] and step 5.1, this product equals the characteristic function of . Scalar uniqueness [F8] and [F9] give , so and are independent. Since and , the law of , which is , is the stated convolution. The argument allows singular and uses no inverse of that matrix.
A one-sided DQM path yields an iid LAN proxy
Statement
Assume AC. Let be a one-sided path () of probability laws on dominated by one supplied sigma-finite measure , with supplied densities and . Suppose the path is differentiable in quadratic mean at with score , in the sense of A dominated differentiable-in-quadratic-mean submodel. Put . For a fixed , let and let be iid . On set and, for sufficiently small , define
Then is a probability density relative to . With and ,
For take and use the convention . The proxy is the normalized absolutely continuous component; the conclusion does not assert a full likelihood ratio for .
Facts & Assumptions
Given: AC; the common-dominator one-sided DQM path and supplied density family; iid ; and fixed .
A dominated differentiable-in-quadratic-mean submodel: as ; the path may be one-sided.
A DQM score has mean zero and is unique: and for this dominated one-sided DQM path.
Cauchy-Schwarz inequality for : the pairing is bounded by the product of the norms.
Khinchin weak law for integrable IID variables: averages of iid integrable real variables converge in probability to their expectation.
Multivariate iid central limit theorem: under AC, iid square-integrable vectors have the centered Gaussian limit with their covariance, including the zero-variance case.
Identical distribution and IID families: the sample coordinates are iid under .
Markov's inequality for random variables: for nonnegative integrable and , .
Finite and countable subadditivity of measures: the measure of a finite union is at most the sum of its members' measures.
The Lebesgue integral is linear on : the integral is linear on integrable functions, so the normalization identity for expands into its three terms.
A uniform derivative bound gives a uniform Taylor remainder bound: if the third derivative is bounded on an interval, the second-order Taylor polynomial has a remainder bounded by a constant times the cube of the displacement.
convergence implies uniform integrability: on a probability space, convergence in to an integrable limit makes the convergent sequence uniformly integrable.
The measure with density relative to : for a nonnegative measurable function , is a measure.
The product sigma-algebra and its finite iterates: the finite product sigma-algebra is generated by measurable coordinate rectangles. Coordinate projections are measurable because the inverse image of a coordinate event is such a rectangle; finite products of nonnegative measurable coordinate functions are therefore product-measurable.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: products of sigma-finite measures exist and have the rectangle formula; iterating this applies to finite products of probabilities.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: nonnegative product-measurable functions have their product integral equal to the iterated integrals.
Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system: measures agreeing on a generating pi-system agree everywhere if an increasing finite-measure exhaustion belongs to that pi-system.
The Axiom of Choice: AC is the density-version convention in [F1] and is assumed by [F5].
Proof
Given: The path, densities, score, iid sample, and fixed in the statement.
For let . On , , so . Let . Then . On , the DQM identity gives , hence . Since and is integrable, truncating at a fixed bound and then increasing that bound shows . Thus .
For small , . The definition of gives . On , divide the DQM expansion by and include the normalizer . With , this yields in with .
Since and -almost surely, linearity [F10] expands this normalization identity to . By [F2], [F3], and step 2.1, , so .
Suppose . By [F4] applied to and [F5] applied to , in probability and . Step 2.1 and [F3] give . Since , linearity [F10] and identical distribution [F6] show that the expected sum of these absolute differences is , so Markov's inequality [F8] makes that sum converge to zero in probability. Also in probability; therefore .
The centered iid sum of has variance at most , so [F8] (applied to its square) gives . By [F2], ; step 3.1 therefore gives .
The variables converge in to by step 2.1. By [F3], , since the second factor is bounded. Thus [F12] makes uniformly integrable. For every , [F8] and [F9] give , because the tail threshold for tends to infinity. Also by step 1.1. On the event all factors are positive and , let ; its third derivative is , so on . [F11] gives there, with a uniform constant. Thus . The sum of cubic terms is bounded by a constant times . Steps 3.2–4.1 now yield .
Decompose , where and, when , is the normalized restriction to . Expanding the product mixture, the all- term has weight and law . If , normalize the remaining mixture terms to a probability law ; then . When , the two product laws are equal. Otherwise, this mixture identity and the event-supremum definition [F7] give by finite subadditivity [F9]. Since and for fixed , this is . For the asserted product-density identity, the coordinate factors are nonnegative measurable, so [F14] makes product-measurable. Define the measure by [F13]. Repeated Tonelli [F16] on a measurable rectangle gives , where the one-coordinate identity is the definition . In particular, step 2.1 gives . By [F15], is also a probability and has the same rectangle values. The measurable rectangles form a pi-system (their intersections are coordinate intersections) generating the finite product sigma-algebra by [F14]; the constant exhaustion belongs to it and both measures have mass one there. Thus [F17] proves on every product-measurable event. Consequently , identifying exactly the proxy in the statement with the product law compared above. If , both product laws equal and . This proves every assertion.
Semiparametric information bound for regular asymptotically linear estimators
Statement
Assume AC and Countable Choice. Let be a law in a statistical model, let be its closed score tangent space, and let be a pathwise differentiable -valued functional with canonical gradient . Write . Let be asymptotically linear at with influence function . Assume that for every allowed one-sided DQM path with score and every fixed , under the centered estimator converges to one law independent of , equal to its limit at . Then represents the pathwise derivative on , so
By Asymptotic linearity implies asymptotic normality, this is the covariance lower bound for the estimator's asymptotic normal limit. The theorem does not assert that an estimator attaining the bound exists.
Facts & Assumptions
Given: AC and Countable Choice; the dominated model, allowed one-sided DQM paths, closed tangent space, pathwise differentiable functional, canonical gradient, asymptotic linearity, and the stated pathwise regularity under each fixed local displacement.
Pathwise differentiability and parameter influence curves: for each allowed score , is the value of a continuous linear derivative on ; its canonical gradient represents that derivative.
A one-sided DQM path yields an iid LAN proxy: for each fixed , the one-sided DQM local alternative has a mean-one likelihood-ratio proxy, its product law is total-variation close to the actual local law, its log proxy ratio is , and its proxy-zero probability tends to zero.
Le Cam's third lemma for a Gaussian likelihood-ratio limit: under a joint Gaussian limit of a statistic and the log of a mean-one likelihood-ratio proxy, the limit under the proxy law is exponentially tilted; the statistic's mean shifts by its covariance with the log ratio, while its covariance is unchanged.
Multivariate iid central limit theorem: under AC, iid finite-second-moment vectors have the Gaussian limit with their covariance, including singular covariance.
Slutsky's theorem for real random variables: adding a real term converging to zero in probability preserves the projected Gaussian limit.
Cramer wold device: under AC, convergence of all real projections to the projections of a specified Borel law gives vector convergence.
Asymptotic linearity implies asymptotic normality: the estimator's base-law limit is .
Influence-curve representers form an affine orthogonal-complement class: under Countable Choice, the ambient representers of the derivative are exactly .
Cauchy-Schwarz inequality for : the pairing is continuous, so equality on the score span extends to its norm closure.
Continuous mapping theorem: the continuous map preserves joint weak convergence.
The Axiom of Choice: AC supplies the path density-version convention and is required by [F3] and [F5].
The Axiom of Countable Choice (): Countable Choice is used by the Hilbert projection/Riesz branch that supplies the canonical gradient in [F2] and the representer decomposition in [F9].
Proof
Given: The hypotheses in the statement. Put .
Fix an allowed path with score and a fixed . Let , , and be the proxy ratio from [F3]. By [F3], ; set when and otherwise. For arbitrary and , asymptotic linearity and [F3] give The summands are iid and square-integrable by [F1] and [F2].
Apply [F5] to each scalar linear combination in step 1.1, then apply [F6] to its remainder. Since this holds for every , [F7] gives the joint Gaussian limit of , with first marginal and cross-covariance between and equal to .
The log-ratio marginal in step 2.1 is . Exponentiating the finite version by [F11] gives the joint likelihood-ratio limit, and replacing by changes it only on the -probability zero event from step 1.1. Apply [F4] to the proxy law in [F3]; under that law, . Total-variation closeness in [F3] transfers the same limit to the actual law .
By pathwise differentiability, . The regularity hypothesis therefore makes under the actual local law converge to , using the base limit [F8]. Comparing with step 3.1, uniqueness of weak limits gives . Equal-covariance Gaussian laws have equal means, so .
Step 4.1 holds for every allowed score. By linearity it holds on their linear span; by [F10] the pairing with is continuous, and by [F2] the derivative is continuous, so equality extends to the closure . Thus is an ambient representer of the pathwise derivative.
By [F9], has every coordinate in . Hence , and expansion gives . For every , , proving positive-semidefinite dominance.
Convolution bound for general regular estimators
Statement
Assume AC and Countable Choice. Let be pathwise differentiable at with tangent space and canonical gradient , and write . If , suppose a directed family of finite-dimensional, dominated QMD models , with each open and , has score spans whose union is dense in . In each model let be a score basis, let be nonsingular, and let . Assume for each fixed that , and that under each local law the centered estimator converges to one common law , independent of and . Suppose has finite covariance. By Quadratic-mean differentiability implies iid LAN, each model has the required LAN proxy; Finite-dimensional LAN convolution bound for differentiable functionals then applies with derivative matrix . If , no submodel family is needed. Then
This is a lower bound for general regular estimators; asymptotic linearity is not assumed.
Facts & Assumptions
Given: AC and Countable Choice; the tangent space and canonical gradient; the directed dense family of finite-dimensional QMD submodels; a common regular limit law with finite covariance; and the finite-dimensional convolution premise stated above.
Pathwise differentiability and parameter influence curves and Influence-curve representers form an affine orthogonal-complement class: is continuous linear on and is represented by the canonical gradient .
Quadratic-mean differentiability at a parameter, Quadratic-mean differentiability implies iid LAN, and Local asymptotic normality for local experiments: each finite-dimensional submodel is dominated and QMD at an interior point; for every fixed local displacement its iid experiment has the LAN proxy expansion and total-variation control required by the LAN definition.
Regular estimator under local alternatives: regularity in a finite-dimensional local experiment means the centered estimator has a common limit law under every fixed local displacement; the statement imposes this for the displayed differentiable target in each submodel.
Finite-dimensional LAN convolution bound for differentiable functionals: in a finite-dimensional LAN experiment with target derivative and information , the common regular limit law is a convolution with an independent Gaussian component of covariance .
The Axiom of Choice: AC is assumed by the QMD/LAN and finite-dimensional probability suppliers.
The Axiom of Countable Choice (): Countable Choice supplies the Hilbert projection and Riesz representation used for the canonical gradient.
Proof
Given: The hypotheses in the statement. For one index , abbreviate , , , and .
For any , the projection of onto is : its residual has inner product with every linear combination of the score coordinates. Therefore the covariance matrix of the projected gradient is .
By [F2] and Quadratic-mean differentiability implies iid LAN, this finite-dimensional submodel has the required LAN proxy and total-variation control. The regularity premise in the statement and [F4] give , where is independent of . Since has finite covariance and does, has finite covariance as well; independence yields .
If , then and . Otherwise fix and . Density of the union of the in provides an index and with . The projection formula in step 1.1 is orthogonal, so for any , . Thus the projection error is below , and the quadratic forms approach as .
When , step 2.1 gives for every . Take the approximation in step 2.2 with arbitrarily small to obtain . Since this holds for every , . Together with the zero-tangent case in step 2.2, this proves the claim.
5 · Examples, counterexamples and false statements
None yet.
Sources
- A. W. van der Vaart, Semiparametric Statistics, Lecture Notes in Mathematics 1781, Lecture 2, §2.9 (Springer, 2002)
- Edward H. Kennedy, Semiparametric theory, §§3–4 (2017)
- A. W. van der Vaart, Semiparametric Statistics, Lecture Notes in Mathematics 1781, Lecture 4, §4.2, Theorem 4.12 (Springer, 2002)
- John Duchi, A few notes on contiguity, asymptotics, and local asymptotic normality, §2 (2021)
- John Duchi, A few notes on contiguity, asymptotics, and local asymptotic normality, §§2 and 4.3.1 (2021)
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 22, PDF pp. 8–11 (2013)
- A. W. van der Vaart, Semiparametric Statistics, Lecture Notes in Mathematics 1781, Lectures 2–4 (Springer, 2002)
- A. W. van der Vaart, Semiparametric Statistics, Lecture Notes in Mathematics 1781, Lectures 2 and 4 (Springer, 2002)
- Edward H. Kennedy, Semiparametric theory, §§3–5 (2017)