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.
Local asymptotic normality for local experiments
Definition
Let be probability laws on a common measurable space for each integer and local parameter , where and is the base law. Suppose that for every fixed we are supplied a nonnegative measurable function with It defines an absolutely continuous proxy The actual local law is allowed to have a singular part; the approximation condition below is what connects it to this proxy.
The experiments are locally asymptotically normal (LAN) at with information matrix and central sequence if is a symmetric positive semidefinite matrix, is an -valued statistic, and for every fixed , where is the event-supremum total variation distance (Total variation distance for probability laws) and means convergence to zero in -probability. We set ; the finite-valued expansion entails . Convergence in distribution is as in Convergence in distribution of random elements, and allows singular (Multivariate normal law, including singular covariance).
If , this is the usual dominated LAN comparison. The proxy formulation also covers QMD paths whose local alternatives are not absolutely continuous with respect to the base law, provided the singular product mass tends to zero in total variation. This definition is pointwise in each fixed ; it does not assert uniformity over bounded sets of .
Depends on
Used by
- Regular estimator under local alternatives Definition
- Gaussian shift LAN and the regular sample mean Example
- Compact-uniform LAN approximates compact-prior posteriors Lemma
- Finite-dimensional LAN convolution bound for differentiable functionals Lemma
- Finite-prior Bayes envelopes converge under pointwise LAN Lemma
- Convolution bound for general regular estimators Theorem
- Convolution bound for regular estimators Theorem
- Local asymptotic minimax bound Theorem
- Quadratic-mean differentiability implies iid LAN Theorem
Dependency tree · two levels
18 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
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 22, PDF pp. 2–6 (standard reference, not scraped)
- John Duchi, A few notes on contiguity, asymptotics, and local asymptotic normality, §2 (standard reference, not scraped)