Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 d≥1 and n≥1, let X1,…,Xn be IID with law P, and let ft:X→R be measurable for t in a neighbourhood of 0∈Rd. Assume f0=0 and that on one P-full set ∣ft(x)−fs(x)∣≤M(x)∥t−s∥2 for all such s,t, where M≥0 is measurable and PM2<∞. For Pnf=n−1∑i=1nf(Xi), both displayed sample-path suprema have measurable versions; expectations below are taken using these versions. There is a finite constant Cd, depending only on d, such that for every radius r whose closed ball is in the parameter neighbourhood, Esup⁡∥t∥2≤r∣n(Pn−P)ft∣≤Cdr(PM2)1/2. Moreover, for 0<ε≤r, Esup⁡∥s∥2,∥t∥2≤r∥t−s∥2≤ε∣n(Pn−P)(ft−fs)∣≤Cdεlog⁡(er/ε)(PM2)1/2.

Facts & Assumptions

Given: The IID sample, finite-dimensional parameter ball, measurable function class, common pointwise Lipschitz envelope, and square-integrability hypothesis in the Statement.

[F1]

Identical distribution and IID families: An IID family has a common law and is mutually independent.

[F2]

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

technique · Symmetrize the centered process and chain its conditional Rademacher process over dyadic Euclidean nets, including pair nets for the local modulus
1.1F1givenconstruct

Let E be the common measurable P-full set in the hypothesis, intersected with {M<∞}. Replace every ft and M by zero off E. This preserves all integrals and every sample path on the measurable probability-one event {Xi∈E for all i}, and gives the Lipschitz bound everywhere. The countable-net suprema below are therefore measurable versions of the original suprema. A radius-r Euclidean ball has finite r2−k-nets Tk with ∣Tk∣≤(Cd2k)d for a finite dimension-dependent constant Cd: cover a containing cube by a grid of side at most r2−k/d 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, t↦ft(Xi) 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 ∣Pft−Pfs∣≤PM∥t−s∥2. The same grid argument on the compact pair domain makes the pairwise-modulus supremum measurable. The first supremum is integrable because ∣ft∣≤rM and PM<∞.

1.2F2givenalgebra

Conditional on X1,…,Xn, write Rn(t)=n−1/2∑iεift(Xi), with signs on the product probability space [F2]. Since Eeλεa=cosh⁡(λa)≤eλ2a2/2, its increments satisfy Eεeλ(Rn(t)−Rn(s))≤eλ2(PnM2)∥t−s∥22/2. The inequality for cosh⁡ follows by integrating (log⁡cosh⁡u)′=tanh⁡u≤u for u≥0 and using evenness. Thus each increment is sub-Gaussian with scale (PnM2)1/2∥t−s∥2.

2.1F1F2step 1.1givenalgebra

By [F1] and [F2], adjoin an independent IID copy X1′,…,Xn′ and independent signs εi∈{−1,1}, 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 Esup⁡t∣n(Pn−P)ft∣ by Esup⁡t∣n−1/2∑i(ft(Xi)−ft(Xi′))∣. Each pair (Xi,Xi′) is exchangeable, so independently swapping the members of each pair with sign εi preserves the joint law. The triangle inequality then bounds the last expectation by 2EEεsup⁡t∣n−1/2∑iεift(Xi)∣.

2.2step 1.1step 1.2givenalgebra

Set T0={0} and fix an ordering of each finite net Tk. For each k≥1, let πk(t) be the first nearest point in that ordering; then ∥πk(t)−πk−1(t)∥2≤3r2−k. For N centered sub-Gaussian variables of scale at most σ, the exponential-moment bound gives Emax⁡j≤N∣Yj∣≤log⁡(2N)/λ+λσ2/2 for every λ>0; the case σ=0 is immediate, and otherwise minimizing at λ=2log⁡(2N)/σ gives σ2log⁡(2N). Apply this to the at most ∣Tk∣∣Tk−1∣ links and sum the resulting bounds: Eεsup⁡t∣Rn(t)∣≤Cdr(PnM2)1/2∑k≥12−kk≤Cd′r(PnM2)1/2. Continuity of the sample paths passes from the nets to the full ball.

3.1step 2.1step 2.2givenalgebra

Combine the symmetrization bound in step 2.1 with step 2.2 and use E(PnM2)1/2≤(PM2)1/2, which is Cauchy--Schwarz. Absorbing the numerical factors into Cd proves the first expectation inequality.

4.1F1F2step 2.1step 1.2step 2.2givenconstructalgebra∎

For the modulus bound, apply the ghost-sample and independent-swap argument of step 2.1 to the class gs,t=ft−fs indexed by the compact set Dr,ε={(s,t):∥s∥2,∥t∥2≤r, ∥t−s∥2≤ε}. Conditional on the data, its signed process is Un(s,t)=Rn(t)−Rn(s); its increments between (s,t) and (s′,t′) are sub-Gaussian with scale at most (PnM2)1/2(∥s−s′∥2+∥t−t′∥2) by step 1.2. At pair-mesh ε2−k, grid the ambient product ball, use closed cells and their lexicographically least points in nonempty compact intersections with Dr,ε, and adjoin (0,0). The resulting finite nets have at most (Cr2k/ε)2d points after increasing the dimension-dependent C. The maximum on the initial net has conditional expectation at most (PnM2)1/2ε2log⁡(2N0), since every pair in Dr,ε has ∥t−s∥2≤ε and Un(0,0)=0. Between consecutive nets, the link lengths are at most a constant times ε2−k and the number of links is at most NkNk−1. The sub-Gaussian maximum bound from step 2.2 therefore bounds the expected maximum link at level k by Cd(PnM2)1/2ε2−klog⁡(er/ε)+k. Summing over k≥1 gives Cd(PnM2)1/2εlog⁡(er/ε); continuity extends the net bound to Dr,ε. Symmetrization and E(PnM2)1/2≤(PM2)1/2 prove the second inequality, after increasing Cd.

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