Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 truncated covering integral bounds empirical Rademacher complexity

Statement

Let n≥1, let S=(z1,…,zn) be a fixed sample, and let G be a nonempty class of measurable functions into [0,1]. Write G∣S for the set of column vectors (g(z1),…,g(zn))⊤ as g ranges over G. For 0<α≤n, R^S(G)≤4αn+12n∫αnlog⁡NF(G∣S,ϵ) dϵ, where R^S is the one-sided empirical Rademacher complexity with 1/n normalization and NF is the proper Frobenius covering number of the sample-vector set, identified with n×1 matrices. The set G∣S is totally bounded because it lies in [0,1]n.

Statement references

One-sided Rademacher complexity: fixes the one-sided empirical sign average and its 1/n normalization.

Proper Frobenius covering numbers: defines NF using finite centers belonging to the covered set.

Facts & Assumptions

Given: n≥1, a fixed sample S, a nonempty [0,1]-valued function class, and the corresponding finite sign space.

[F1]

The one-sided empirical complexity is Eεsup⁡g∈Gn−1∑i=1nεig(zi), where the signs are independent and uniform on {−1,+1}. One-sided Rademacher complexity

[F2]

NF(U,ϵ) is the least number of centers in a finite proper Frobenius ϵ-cover of U. Proper Frobenius covering numbers

[F3]

cosh⁡x>0, cosh⁡ is even, cosh⁡′x=sinh⁡x, tanh⁡′x=sech⁡2x, and cosh⁡2x−sinh⁡2x=1. The six hyperbolic functions and their natural domains Addition formulas, identities, parity, and derivatives of the hyperbolic functions

[F4]

For a bounded real random variable Y and convex exponential, exp⁡(λEY)≤Eexp⁡(λY). Jensen's inequality for expectation

[F5]

log⁡ is the increasing inverse of exp⁡ on positive reals, with log⁡(xy)=log⁡x+log⁡y and log⁡1=0. The natural logarithm as the inverse of the exponential function Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm

[F6]

If a real function is continuous on [a,b] and differentiable on (a,b), the mean value theorem gives f(b)−f(a)=f′(c)(b−a) for some c∈(a,b). The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)

[F8]

For vectors u,v in a real or complex inner product space, ∣⟨u,v⟩∣≤∥u∥∥v∥. Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors

Proof

1.1F3F6F7algebra

For x>0, put r(x)=x−tanh⁡x. By [F3], r(0)=0 and r′(x)=1−sech⁡2x=tanh⁡2x≥0. The mean value theorem [F6] therefore gives r(x)≥0; at x=0 this is equality. Put q(x)=e−x2/2cosh⁡x. The derivative rules in [F3] and [F7] give q′(x)=e−x2/2cosh⁡x (tanh⁡x−x)≤0. Applying [F6] on [0,x] for x>0 yields q(x)≤q(0)=1, and equality holds at x=0. Since q is even, cosh⁡x≤ex2/2 for every real x.

1.2F1F2givenconstruct

Choose g0∈G and subtract its sample vector v0 from every vector in G∣S. The empirical Rademacher average is unchanged because Eε∑iεig0(zi)=0, and translation preserves all Frobenius covering numbers. Write U:=(G∣S)−v0; it contains 0, and each vector has norm at most n. For any ϵ>0, partition [−1,1]n into finitely many boxes of side at most ϵ/n; from each box meeting U take one member of that intersection. The resulting finite set is a proper ϵ-cover, since two points in one box differ in Euclidean norm by at most ϵ. Set ϵj=n 2−(j−1). The singleton V1={0} is a proper ϵ1-cover of U, so ∣V1∣=NF(U,ϵ1)=1. For each finite truncation N≥2 and each 2≤j≤N, choose a proper ϵj-cover Vj of U with the least possible cardinality, so ∣Vj∣=NF(U,ϵj); such a least cardinality exists because a finite cover exists and cover cardinalities are positive integers. Enumerate each finite cover and map every sample vector to the first center within ϵj.

2.1F1F4F5step 1.1algebra

Let V be a nonempty finite set of vectors in Rn and let R=max⁡v∈V∥v∥2. For Tv=∑iεivi, independence of the signs and step 1.1 give EeλTv=∏icosh⁡(λvi)≤eλ2R2/2. If R=0 or ∣V∣=1, Emax⁡v∈VTv=0. Otherwise, for λ>0, [F4] and eλmax⁡vTv≤∑v∈VeλTv imply Emax⁡vTv≤log⁡∣V∣/λ+λR2/2. Choosing λ=2log⁡∣V∣/R gives Emax⁡vTv≤R2log⁡∣V∣.

3.1F1F2F8step 2.1step 1.2algebra

For any translated sample vector v∈U, telescope v=(v−vN[v])+∑j=1N−1(vj+1[v]−vj[v]), since v1[v]=0. The absolute residual sign sum is at most ∥(εi)i∥2∥v−vN[v]∥2≤nϵN by [F8]. For each j<N, use only the paired-center difference set Dj:={vj+1[v]−vj[v]:v∈U}. It is a nonempty subset of Vj+1−Vj, so its cardinality is at most ∣Vj+1∣∣Vj∣≤NF(G∣S,ϵj+1)2, because covering numbers are nonincreasing with radius. Each paired difference has norm at most ∥vj+1[v]−v∥2+∥v−vj[v]∥2≤ϵj+1+ϵj=3ϵj+1. Step 2.1 applied to Dj therefore bounds its expected maximum sign sum by 6ϵj+1log⁡NF(G∣S,ϵj+1). Taking the supremum in the telescoping identity, summing these bounds, and dividing by n gives R^S(G)≤ϵN/n+(6/n)∑j=1N−1ϵj+1log⁡NF(G∣S,ϵj+1).

4.1F2step 3.1algebra

The function f(ϵ)=log⁡NF(G∣S,ϵ) is nonincreasing in ϵ. Since ϵj+2=ϵj+1/2, each summand obeys ϵj+1f(ϵj+1)≤2∫ϵj+2ϵj+1f(ϵ) dϵ. Therefore step 3.1 gives R^S(G)≤ϵN/n+(12/n)∫ϵN+1nf(ϵ) dϵ.

5.1F1step 4.1algebra∎

If n/4≤α≤n, each signed average is at most 1, so R^S(G)≤1≤4α/n. If 0<α<n/4, choose the largest N≥1 with ϵN+1>α; such an N exists because ϵ2=n/2>α and ϵj→0. Maximality gives ϵN+2≤α, hence ϵN=4ϵN+2≤4α, and ∫ϵN+1nf≤∫αnf. Substitution into step 4.1 proves the stated inequality for every 0<α<n/4. Together, the two cases prove it for every 0<α≤n.

Depends on

Used by

Dependency tree · two levels

52 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