Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 (T,d) be a nonempty pseudometric space that is totally bounded in the following sense: for every r>0 there is a finite set Er⊆T such that T⊆⋃e∈Er{t∈T:d(t,e)≤r}. Its diameter is D:=sup⁡s,t∈Td(s,t)<∞. For each t∈T, let Xt be a real random variable. Assume the process is separable: a specified countable dense subset T0⊆T, equipped with a fixed listing, has the property that the supremum of every process increment over T equals its supremum over T0 almost surely. Suppose all increments are centered and sub-Gaussian with their d-scale, meaning that for every s,t∈T and λ∈R,

Eexp⁡{λ(Xs−Xt)}≤exp⁡{λ2d(s,t)2/2}.

If

∫0Dlog⁡N(ϵ,T,d) dϵ<∞,

where N(ϵ,T,d) is the least number of closed d-balls of radius ϵ covering T (Covering, packing, bracketing numbers, and metric entropy), then for every t0∈T,

Esup⁡t∈T∣Xt−Xt0∣≤C∫0Dlog⁡N(ϵ,T,d) dϵ

for a universal constant C. If D=0, the integral and the supremum are both zero.

Facts & Assumptions

Given: A nonempty totally bounded pseudometric space (T,d), a separable real process (Xt)t∈T with centered sub-Gaussian increments whose MGF proxy is d(s,t)2, and a finite entropy integral.

[F1]

Covering, packing, bracketing numbers, and metric entropy: N(ϵ,T,d) is the least finite cover size with centers in the class and covering radius ϵ.

[F2]

Sub-Gaussian variables and vectors, and sub-exponential variables: a centered real random variable Y has sub-Gaussian proxy σ2 when EeλY≤eλ2σ2/2 for every real λ.

[F3]

Jensen's inequality for expectation: for an integrable random variable Y and convex φ with integrable or nonnegative φ(Y), φ(EY)≤Eφ(Y).

[F4]

Markov's inequality for random variables: for nonnegative Y and a>0, P(Y≥a)≤EY/a.

[F5]

Monotone convergence for the integral: increasing nonnegative limits pass through the integral.

[F6]

Basic identities for a probability measure: countable unions of null events are null.

Proof

Given: The objects and assumptions in the statement.

1.1F2F3F4givenalgebra

First derive a finite-maximum estimate. If Y1,…,Ym are centered and each has sub-Gaussian proxy at most s2, then for λ>0, Eeλmax⁡j∣Yj∣≤∑j=1m(EeλYj+Ee−λYj)≤2meλ2s2/2. By [F3], Emax⁡j∣Yj∣≤λ−1log⁡(2m)+λs2/2. For s>0, choosing λ=2log⁡(2m)/s gives Emax⁡j∣Yj∣≤s2log⁡(2m); for s=0, the proxy bound forces every Yj=0 almost surely by [F4] applied to e±λYj and letting λ→∞.

2.1F1F6step 1.1givenconstruct

If D=0, every pair in T 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 D>0. Fix k≥1 and put ϵk=2−kD. Total boundedness gives a finite cover of T by N(ϵk/4,T,d) closed balls of radius ϵk/4. Approximate each center by a point of the dense set T0 within ϵk/4 to obtain a cover of T by the same number of balls of radius ϵk/2. Since the specified countable dense set is listed, choose the first finite tuple under its induced enumeration that is an ϵk-net and has cardinality at most this cover size; such a tuple exists by the construction. Denote it by Tk. For each t, choose the least-index point πk(t)∈Tk within ϵk. These canonical choices across scales require no choice axiom. Put T0(0)={t0} and π0(t)=t0.

2.2F1step 1.1algebra

For a finite subset A⊂T0, telescope Xt−Xt0 through π1(t),…,πm(t) for every t∈A. At level 1 there are at most ∣T1∣ increments, each with proxy at most D2; for k≥2 there are at most ∣Tk∣∣Tk−1∣ increments, each with proxy at most (ϵk+ϵk−1)2=(3ϵk)2. Applying step 1.1 to the finite set of increments at each level, and the triangle inequality for their maxima, yields Emax⁡t∈A∣Xπm(t)−Xt0∣≤C1∑k=1mϵk1+log⁡N(ϵk/4,T,d) for a universal C1; the k=1 term is absorbed using ϵ1=D/2 and N(ϵ1/4)≥1.

3.1F1F5step 2.2step 1.1givenalgebra∎

The residual maximum over A has expectation at most ϵm2log⁡(2∣A∣) by step 1.1, since d(t,πm(t))≤ϵm. Letting m→∞ for this fixed finite A removes the residual. The dyadic sum in step 2.2 is bounded by a universal multiple of the entropy integral: on each interval [ϵk/8,ϵk/4], monotonicity of N makes the integral at least (ϵk/8)log⁡N(ϵk/4,T,d). Also, for 0<ϵ<D/2, one ball of radius ϵ cannot cover a set of diameter D, so N(ϵ,T,d)≥2 and the entropy integral is at least (D/2)log⁡2; this absorbs the geometric contribution from the added 1. Hence Emax⁡t∈A∣Xt−Xt0∣≤C∫0Dlog⁡N(ϵ,T,d) dϵ. Taking an increasing sequence of finite subsets whose union is T0, [F5] and the separability assumption give the asserted supremum over T.

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