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.
Convolution bound for regular estimators
Statement
Assume AC. Let be LAN at with positive-definite information matrix and central sequence . Let be regular under every fixed local alternative, with common limit law as in Regular estimator under local alternatives. Then there is a probability law on such that Here is convolution, the law of the sum of independent random vectors with the two indicated laws. In particular, the efficient Gaussian component with covariance is a convolution factor of every regular limit.
Facts & Assumptions
Given: AC; the LAN experiment, positive-definite , central sequence, and regular estimator with common limit law .
The Axiom of Choice: AC is assumed by Prokhorov tightness, the Gaussian laws, and characteristic-function uniqueness.
Local asymptotic normality for local experiments: For each fixed , an absolutely continuous proxy has log likelihood and is total-variation close to the true local law.
Regular estimator under local alternatives: Under every fixed , with the same .
Le Cam's third lemma for a Gaussian likelihood-ratio limit: A joint limit tilted by the mean-one Gaussian likelihood ratio describes limits under the proxy local alternative; total-variation closeness transfers that law to the true alternative.
Weakly convergent sequences are tight and Prokhorov tightness theorem on polish spaces: Weakly convergent laws on Euclidean space are tight, and under AC every tight sequence of laws on a Polish space has a weakly convergent subsequence.
Vector Slutsky theorem: If one component converges in distribution and another differs in probability by from a continuous function of it, the joint vector converges to the corresponding joint limit.
Multivariate normal law, including singular covariance and Characteristic function of a multivariate normal law: If , then and its characteristic function is .
Identity theorem for holomorphic functions: Two holomorphic functions on a connected domain that agree on a set with an interior accumulation point agree throughout the domain.
Uniqueness of a law from its characteristic function: Under AC, probability laws on with identical characteristic functions are equal.
The Euclidean inner product on : Tightness and compact balls use the Euclidean norm on .
Continuous mapping theorem: Continuous maps preserve convergence in distribution at points where they are continuous.
Cramer wold device: Under AC, Borel probability laws on a finite-dimensional Euclidean space are determined by all their real linear projection laws.
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: The product of two Borel probability laws exists, and bounded product integrals factor into the marginal integrals, by applying Tonelli to the positive and negative parts of their real and imaginary parts.
Proof
Proof technique: extract a joint weak limit, use the third lemma for every fixed local shift, and analytically continue the Gaussian tilt identity.
Under , by regularity at and by LAN. By [F4], both marginal sequences are tight. Their joint laws are tight: for any , choose compact balls with marginal outside probabilities below ; the union bound puts the joint law on the compact product with probability at least .
By [F4] and Prokhorov's theorem, select a subsequence along which . Its marginals are and , since the full marginal sequences already converge. This supplies the joint-limit subsequence used below.
Fix . Along this subsequence [F1] and [F5] give The final coordinate is normal with mean and variance . By [F1], . Assign any finite value to the log on that vanishing event; [F10] then gives . By [F3], under the true law, the first coordinate has limit given by tilting the joint law of by . Regularity [F2] also gives under . Therefore for every and every real , where is the characteristic function of .
Rearranging step 3.1 gives, for real , For complex , is entire in each coordinate: on every compact set of , its exponential power series and coordinate derivatives are dominated by for some finite , whose expectation is finite because each Gaussian coordinate has finite exponential moments. The right-hand side is also entire. Apply [F7] one coordinate at a time, holding the other coordinates real and then successively allowing them to be complex. The equality therefore holds for every complex .
Set in step 4.1. Then Let . Replacing by gives The first factor equals by setting ; the second is the characteristic function of . Thus the joint characteristic function of factors into its marginals.
By [F12], form the product law on . Step 5.1 and factorization of the bounded product integrals show that and have identical joint characteristic functions. For every and real , evaluate these functions at ; this gives equality of the scalar characteristic functions of the projection under the two laws. Scalar uniqueness [F8] identifies each projection law, and Cramér–Wold [F11], under the existing AC hypothesis [A1], gives . Thus and are independent. Since is invertible, , and . The law of , which is , is therefore , proving the claimed convolution with .
Depends on
- Local asymptotic normality for local experiments
- Regular estimator under local alternatives
- Le Cam's third lemma for a Gaussian likelihood-ratio limit
- Prokhorov tightness theorem on polish spaces
- Weakly convergent sequences are tight
- Vector Slutsky theorem
- Multivariate normal law, including singular covariance
- Characteristic function of a multivariate normal law
- Uniqueness of a law from its characteristic function
- Identity theorem for holomorphic functions
- The Axiom of Choice
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Continuous mapping theorem
- Cramer wold device
- 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
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
100 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- A. W. van der Vaart, Semiparametric Statistics, Theorem 4.12 and complete proof, printed pp. 44–46; finite-dimensional proof (a), p. 45 (standard reference, not scraped)