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 square-integrable Lipschitz envelope controls a local empirical process
Statement
Let and , let be IID with law , and let be measurable for in a neighbourhood of . Assume and that on one -full set for all such , where is measurable and . For , both displayed sample-path suprema have measurable versions; expectations below are taken using these versions. There is a finite constant , depending only on , such that for every radius whose closed ball is in the parameter neighbourhood, Moreover, for ,
Facts & Assumptions
Given: The IID sample, finite-dimensional parameter ball, measurable function class, common pointwise Lipschitz envelope, and square-integrability hypothesis in the Statement.
Identical distribution and IID families: An IID family has a common law and is mutually independent.
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: Finite products of the sample law and the two-point sign law define the joint probability space used for the ghost sample and signs.
Proof
Let be the common measurable -full set in the hypothesis, intersected with . Replace every and by zero off . This preserves all integrals and every sample path on the measurable probability-one event , and gives the Lipschitz bound everywhere. The countable-net suprema below are therefore measurable versions of the original suprema. A radius- Euclidean ball has finite -nets with for a finite dimension-dependent constant : cover a containing cube by a grid of side at most and use closed grid cells; from each nonempty compact intersection with the ball, take its lexicographically least point, obtained by successive coordinate minima. The union of these nets is countable and dense. For each fixed sample in the common full set, is Lipschitz and hence continuous, so the supremum over the ball equals the supremum over that countable union and is measurable; the centered paths are continuous too because . The same grid argument on the compact pair domain makes the pairwise-modulus supremum measurable. The first supremum is integrable because and .
Conditional on , write , with signs on the product probability space [F2]. Since , its increments satisfy . The inequality for follows by integrating for and using evenness. Thus each increment is sub-Gaussian with scale .
By [F1] and [F2], adjoin an independent IID copy and independent signs , each equally likely. For each fixed original sample, the supremum of absolute values of affine functions of the ghost sample is convex; Jensen's inequality therefore bounds by . Each pair is exchangeable, so independently swapping the members of each pair with sign preserves the joint law. The triangle inequality then bounds the last expectation by .
Set and fix an ordering of each finite net . For each , let be the first nearest point in that ordering; then . For centered sub-Gaussian variables of scale at most , the exponential-moment bound gives for every ; the case is immediate, and otherwise minimizing at gives . Apply this to the at most links and sum the resulting bounds: . Continuity of the sample paths passes from the nets to the full ball.
Combine the symmetrization bound in step 2.1 with step 2.2 and use , which is Cauchy--Schwarz. Absorbing the numerical factors into proves the first expectation inequality.
For the modulus bound, apply the ghost-sample and independent-swap argument of step 2.1 to the class indexed by the compact set . Conditional on the data, its signed process is ; its increments between and are sub-Gaussian with scale at most by step 1.2. At pair-mesh , grid the ambient product ball, use closed cells and their lexicographically least points in nonempty compact intersections with , and adjoin . The resulting finite nets have at most points after increasing the dimension-dependent . The maximum on the initial net has conditional expectation at most , since every pair in has and . Between consecutive nets, the link lengths are at most a constant times and the number of links is at most . The sub-Gaussian maximum bound from step 2.2 therefore bounds the expected maximum link at level by . Summing over gives ; continuity extends the net bound to . Symmetrization and prove the second inequality, after increasing .
Depends on
Used by
Dependency tree · two levels
15 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, Lemma 2.1 and proof (standard reference, not scraped)
- Peter Bartlett, Theoretical Statistics, Lecture 23, QMD and local asymptotic normality (standard reference, not scraped)