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 variance-sensitive bound for bounded empirical suprema

Statement

Let X1,…,Xn be iid with law P, n≥1, and let F be a finite or countable class of measurable real functions containing 0. Suppose ∣f∣≤B everywhere and Pf2≤s2 for all f∈F, with finite B,s≥0. Put Z=sup⁡f∈F∑i=1n(f(Xi)−Pf),W=sup⁡f∈F∑i=1nf(Xi)2,m=EW. For every x>0, P(Z>EZ+2(8m+4ns2)x+8 Bx)≤e−x. The bound uses second moments, not only variances. All suprema are measurable by countability. No choice axiom is assumed.

Facts & Assumptions

Given: The iid sample, countable class containing zero, and boundedness and second-moment hypotheses in the Statement.

[F1]

Independent random elements have product joint law and Fubini's theorem for L^1 functions on a sigma-finite product allow coordinatewise integration and independent ghost coordinates on the finite product law.

[F2]

Jensen's inequality for expectation gives Jensen's inequality for convex functions; Dominated convergence permits bounded limits under integration.

Proof

Given: The objects and hypotheses in the Statement. First take a finite class and B>0; the case B=0 is immediate.

1.1F1F2F3algebra

For positive bounded U bounded away from zero, define Ent⁡(U)=E[Ulog⁡U]−EUlog⁡EU. The function Φ(u,a)=ulog⁡(u/a)−u+a is jointly convex: its Hessian quadratic form is (du−(u/a)da)2/u≥0. Direct differentiation in a gives Ent⁡(U)=inf⁡a>0EΦ(U,a), attained at a=EU. If Ei integrates coordinate i, the product identity Ent⁡(U)=E−iEnt⁡i(U)+Ent⁡−i(EiU) is obtained by adding and subtracting E[(EiU)log⁡(EiU)]. Joint convexity gives Ent⁡j(EiU)≤EiEnt⁡j(U) for j≠i: apply Jensen to Φ(EiU,EiEjU) and integrate coordinate j. Induction in the product identity proves tensorization Ent⁡(U)≤E∑iEnt⁡i(U). All integrations here are on finite product laws.

2.1F1F2step 1.1algebra

Let Zi′ replace Xi by an independent copy and put V+=∑iEi′(Z−Zi′)+2. Jensen for the logarithm gives Ent⁡i(etZ)≤Cov⁡i(etZ,tZ) for t>0. A fresh-copy expansion expresses this covariance as t2Ei,i′[(etZ−etZi′)(Z−Zi′)]. Swap the two copies to restrict to Z>Zi′ and use 1−e−ta≤ta for a≥0. Tensorization from step 1.1 then yields Ent⁡(etZ)≤t2E[etZV+]. Choose the first maximizing function f∗ for Z in a fixed finite ordering. Since Z−Zi′≤f∗(Xi)−f∗(Xi′), the bound (a−b)2≤2a2+2b2 gives V+≤2W+2ns2.

2.2F2F3step 1.1algebra

Write c=B2 and Wi=sup⁡f∑j≠if(Xj)2. Choosing a common maximizer for W shows 0≤Δi=W−Wi≤c and ∑iΔi≤W. Use the conditional variational formula of step 1.1 with comparator eaWi, which is independent of coordinate i. With ψ(u)=eu−u−1, it gives Ent⁡i(eaW)≤Ei[eaWψ(−aΔi)]. Convexity and ψ(0)=0 imply ψ(−aΔi)≤(Δi/c)ψ(−ac). Tensorization therefore implies, for L(a)=log⁡EeaW, aL′(a)−L(a)≤ψ(−ac)L′(a)/c, or (1−e−ac)L′(a)≤cL(a). If m=0, W=0 almost surely and the following bound is immediate. Otherwise differentiating L(a)/(eac−1) shows it is nonincreasing; its limit at zero is m/c. Thus L(a)≤(m/c)(eac−1)≤2am whenever 0≤ac≤1/2, where the last scalar inequality follows by integrating eu≤2 on [0,1/2].

3.1F2F3step 2.1step 2.2algebra

Put H(t)=log⁡EetZ and D=tH′(t)−H(t), and let Et denote integration against density etZ−H(t). Step 2.1 gives D≤2t2EtW+2t2ns2. Jensen under this tilted law applied to eaW/etZ−H(t) gives aEtW≤L(a)+D; indeed its expectation under the tilt is EeaW, while the expectation of its logarithm is aEtW−D. Taking a=4t2 and using step 2.2 yields D≤(8m+4ns2)t2 for 0<t≤1/(8B). Integrating (H(t)/t)′=D/t2 from zero proves log⁡Eet(Z−EZ)≤At2, where A=8m+4ns2.

4.1F2F3step 3.1algebra∎

Put b=8B. If A>0, choose t=x/(A+bx)<1/b. Markov's inequality and step 3.1 show that a deviation of size At+x/t has probability at most e−x. Since At+x/t≤2Ax+bx, the stated tail bound follows. The case A=0 follows by taking t↑1/b in the same exponential bound. Finally enumerate a countable class with zero first and increase its finite initial subclasses. Their Z,W increase to the displayed suprema and are bounded by 2nB,nB2; bounded convergence passes the exponential bounds and their expectations to the limit. The same Chernoff argument proves the assertion for the countable class.

Depends on

Used by

Dependency tree · two levels

45 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