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.
A local KL expansion and square-integrable log-Lipschitz envelope give misspecified iid LAN
Statement
Let be IID from on a measurable space, and let be open, . Suppose a sigma-finite measure and jointly measurable finite-valued densities are supplied, with , , and -almost surely. Define the directional contrast Assume is finite near an interior point , is a finite minimizer of , and, for , for a fixed symmetric positive-definite matrix . Assume also that a measurable random vector satisfies in -probability as through nonzero vectors, and that on a neighbourhood of there is a common -almost-sure bound where and . Then and is finite. With and , for every compact , Suprema and convergence in probability use measurable versions obtained by setting the log-ratio class to zero off its common measurable full set. In particular . No equality between and is assumed; under misspecification they generally differ.
Facts & Assumptions
Given: The supplied dominated iid density model, finite interior KL minimizer, differentiability in -probability, square-integrable local log-Lipschitz envelope, and positive-definite second-order contrast expansion in the Statement.
Identical distribution and IID families: The observations have one common law and are mutually independent.
Stochastic order and convergence notation for finite-dimensional random vectors: means convergence in probability to zero, and means boundedness in probability in finite-dimensional Euclidean norm.
A square-integrable Lipschitz envelope controls a local empirical process: For an iid sample and a pointwise Lipschitz class with square-integrable envelope , the local centered-process supremum is at most in expectation, and its modulus over parameter pairs at distance at most is at most in expectation.
Proof
Given: The objects and hypotheses in the Statement. Write and .
Define the log-ratio class to be zero off the common measurable full set of the log-Lipschitz bound, as in [F3]; this changes no integral or almost-sure sample path and makes its suprema measurable. On that full set put and . Along every coordinate direction , in -probability as , while the envelope gives . Dominated convergence along almost-surely convergent subsequences therefore gives , since the contrast expansion makes the last numerator . The same subsequence argument applied to the directional difference quotients and the common envelope gives almost surely for every coordinate, hence and .
The contrast expansion is uniform after the local substitution: for fixed , because the remainder divided by tends to zero uniformly over .
Differentiability in probability says in -probability. The bound and imply by dominated convergence along every sequence . Also on the common full set, where . Fix and , and choose a finite -net of the radius- ball. For each fixed , independence gives Because the net is finite, the maximum of these centered sums tends to zero in probability. For any in the ball choose with . The modulus bound [F3], applied to with envelope on radius and distance , gives For fixed , the finite-net maximum vanishes as ; Markov's inequality bounds the remaining modulus probability by a constant times , which tends to zero as . Therefore
For , decompose where from step 1.1. Step 2.1 controls the last term uniformly, and step 1.2 gives the uniform quadratic term. Therefore the displayed LAN remainder is uniformly on every compact .
Independence, , and give for every . Since , , so is bounded in probability. Multiplication by the fixed matrix preserves boundedness because . Thus by [F2], completing the LAN assertion.
Depends on
Used by
Dependency tree · two levels
10 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
- B. J. K. Kleijn and A. W. van der Vaart, The Bernstein-Von-Mises theorem under misspecification, §2.2, Lemma 2.1 and proof (standard reference, not scraped)
- Peter Bartlett, Theoretical Statistics, Lecture 23, QMD and local asymptotic normality (standard reference, not scraped)