Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 {Pn,h:h∈Rd} be LAN at h=0 with positive-definite information matrix K and central sequence Δn. Let Tn=n(θ^n−θ0) be regular under every fixed local alternative, with common limit law W as in Regular estimator under local alternatives. Then there is a probability law ν on Rd such that L(W)=Nd(0,K−1)∗ν. 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 K−1 is a convolution factor of every regular limit.

Facts & Assumptions

Given: AC; the LAN experiment, positive-definite K, central sequence, and regular estimator with common limit law W.

[A1]

The Axiom of Choice: AC is assumed by Prokhorov tightness, the Gaussian laws, and characteristic-function uniqueness.

[F1]

Local asymptotic normality for local experiments: For each fixed h, an absolutely continuous proxy has log likelihood hTΔn−12hTKh+oPn,0(1) and is total-variation close to the true local law.

[F2]

Regular estimator under local alternatives: Under every fixed Pn,h, Tn−h⇒W with the same W.

[F3]

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.

[F4]

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.

[F5]

Vector Slutsky theorem: If one component converges in distribution and another differs in probability by oP(1) from a continuous function of it, the joint vector converges to the corresponding joint limit.

[F6]

Multivariate normal law, including singular covariance and Characteristic function of a multivariate normal law: If Δ∼Nd(0,K), then EehTΔ=ehTKh/2 and its characteristic function is e−uTKu/2.

[F7]

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.

[F8]

Uniqueness of a law from its characteristic function: Under AC, probability laws on R with identical characteristic functions are equal.

[F9]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: Tightness and compact balls use the Euclidean norm on Rd.

[F10]

Continuous mapping theorem: Continuous maps preserve convergence in distribution at points where they are continuous.

[F11]

Cramer wold device: Under AC, Borel probability laws on a finite-dimensional Euclidean space are determined by all their real linear projection laws.

[F12]

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.

1.1A1F1F2F4F9givenchoosealgebra

Under Pn,0, Tn⇒W by regularity at h=0 and Δn⇒Nd(0,K) by LAN. By [F4], both marginal sequences are tight. Their joint laws are tight: for any ϵ>0, choose compact balls CT,CΔ with marginal outside probabilities below ϵ/2; the union bound puts the joint law on the compact product with probability at least 1−ϵ.

2.1A1F4step 1.1

By [F4] and Prokhorov's theorem, select a subsequence along which (Tn,Δn)⇒(T,Δ). Its marginals are T∼W and Δ∼Nd(0,K), since the full marginal sequences already converge. This supplies the joint-limit subsequence used below.

3.1F1F2F3F5F10step 2.1givenalgebra

Fix h∈Rd. Along this subsequence [F1] and [F5] give (Tn,Δn,log⁡Ln,h)⇒(T,Δ,hTΔ−12hTKh). The final coordinate is normal with mean −hTKh/2 and variance hTKh. By [F1], Pn,0(Ln,h=0)→0. Assign any finite value to the log on that vanishing event; [F10] then gives (Tn,Δn,Ln,h)⇒(T,Δ,ehTΔ−hTKh/2). By [F3], under the true Pn,h law, the first coordinate has limit T(h) given by tilting the joint law of (T,Δ) by ehTΔ−hTKh/2. Regularity [F2] also gives Tn⇒W+h under Pn,h. Therefore for every t∈Rd and every real h, E[ehTΔ−hTKh/2eitTT]=eitThφW(t), where φW is the characteristic function of W.

4.1F6F7step 3.1algebra

Rearranging step 3.1 gives, for real h, Ft(h):=E[eitTT+hTΔ]=ehTKh/2+itThφW(t). For complex z∈Cd, Ft(z)=E[eitTT+zTΔ] is entire in each coordinate: on every compact set of z, its exponential power series and coordinate derivatives are dominated by eR∥Δ∥1 for some finite R, 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 z.

5.1F6step 4.1givenalgebra

Set z=iu in step 4.1. Then E[eitTT+iuTΔ]=φW(t)e−tTu−uTKu/2. Let R=T−K−1Δ. Replacing u by u−K−1t gives E[eitTR+iuTΔ]=(φW(t)etTK−1t/2)e−uTKu/2. The first factor equals EeitTR by setting u=0; the second is the characteristic function of Δ. Thus the joint characteristic function of (R,Δ) factors into its marginals.

6.1A1F6F8F11F12step 5.1algebra∎

By [F12], form the product law ρ=L(R)⊗L(Δ) on R2d. Step 5.1 and factorization of the bounded product integrals show that ρ and L(R,Δ) have identical joint characteristic functions. For every a,b∈Rd and real v, evaluate these functions at (va,vb); this gives equality of the scalar characteristic functions of the projection (r,z)↦aTr+bTz under the two laws. Scalar uniqueness [F8] identifies each projection law, and Cramér–Wold [F11], under the existing AC hypothesis [A1], gives L(R,Δ)=ρ. Thus R and Δ are independent. Since K is invertible, K−1Δ∼Nd(0,K−1), and T=K−1Δ+R. The law of T, which is W, is therefore Nd(0,K−1)∗L(R), proving the claimed convolution with ν=L(R).

Depends on

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