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.
Dudley entropy-integral bound for sub-Gaussian processes
Statement
Let be a nonempty pseudometric space that is totally bounded in the following sense: for every there is a finite set such that . Its diameter is . For each , let be a real random variable. Assume the process is separable: a specified countable dense subset , equipped with a fixed listing, has the property that the supremum of every process increment over equals its supremum over almost surely. Suppose all increments are centered and sub-Gaussian with their -scale, meaning that for every and ,
If
where is the least number of closed -balls of radius covering (Covering, packing, bracketing numbers, and metric entropy), then for every ,
for a universal constant . If , the integral and the supremum are both zero.
Facts & Assumptions
Given: A nonempty totally bounded pseudometric space , a separable real process with centered sub-Gaussian increments whose MGF proxy is , and a finite entropy integral.
Covering, packing, bracketing numbers, and metric entropy: is the least finite cover size with centers in the class and covering radius .
Sub-Gaussian variables and vectors, and sub-exponential variables: a centered real random variable has sub-Gaussian proxy when for every real .
Jensen's inequality for expectation: for an integrable random variable and convex with integrable or nonnegative , .
Markov's inequality for random variables: for nonnegative and , .
Monotone convergence for the integral: increasing nonnegative limits pass through the integral.
Basic identities for a probability measure: countable unions of null events are null.
Proof
Given: The objects and assumptions in the statement.
First derive a finite-maximum estimate. If are centered and each has sub-Gaussian proxy at most , then for , By [F3], . For , choosing gives ; for , the proxy bound forces every almost surely by [F4] applied to and letting .
If , every pair in has distance zero. The proxy-zero case of step 1.1 applied to each increment, together with separability and [F6] for the countable intersection of probability-one events, makes the supremum zero. Assume . Fix and put . Total boundedness gives a finite cover of by closed balls of radius . Approximate each center by a point of the dense set within to obtain a cover of by the same number of balls of radius . Since the specified countable dense set is listed, choose the first finite tuple under its induced enumeration that is an -net and has cardinality at most this cover size; such a tuple exists by the construction. Denote it by . For each , choose the least-index point within . These canonical choices across scales require no choice axiom. Put and .
For a finite subset , telescope through for every . At level there are at most increments, each with proxy at most ; for there are at most increments, each with proxy at most . Applying step 1.1 to the finite set of increments at each level, and the triangle inequality for their maxima, yields for a universal ; the term is absorbed using and .
The residual maximum over has expectation at most by step 1.1, since . Letting for this fixed finite removes the residual. The dyadic sum in step 2.2 is bounded by a universal multiple of the entropy integral: on each interval , monotonicity of makes the integral at least . Also, for , one ball of radius cannot cover a set of diameter , so and the entropy integral is at least ; this absorbs the geometric contribution from the added . Hence Taking an increasing sequence of finite subsets whose union is , [F5] and the separability assumption give the asserted supremum over .
Depends on
Used by
Dependency tree · two levels
36 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
- David Pollard, Empirical Processes: Theory and Applications, Section 3, Lemma 3.4 and Theorem 3.5 (standard reference, not scraped)
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §3, Corollary 3.5 (standard reference, not scraped)