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 , let be a fixed sample, and let be a nonempty class of measurable functions into . Write for the set of column vectors as ranges over . For , where is the one-sided empirical Rademacher complexity with normalization and is the proper Frobenius covering number of the sample-vector set, identified with matrices. The set is totally bounded because it lies in .
Statement references
One-sided Rademacher complexity: fixes the one-sided empirical sign average and its normalization.
Proper Frobenius covering numbers: defines using finite centers belonging to the covered set.
Facts & Assumptions
Given: , a fixed sample , a nonempty -valued function class, and the corresponding finite sign space.
The one-sided empirical complexity is , where the signs are independent and uniform on . One-sided Rademacher complexity
is the least number of centers in a finite proper Frobenius -cover of . Proper Frobenius covering numbers
For a bounded real random variable and convex exponential, . Jensen's inequality for expectation
is the increasing inverse of on positive reals, with and . The natural logarithm as the inverse of the exponential function Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
If a real function is continuous on and differentiable on , the mean value theorem gives for some . The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
The exponential, chain, and product rules give derivatives of ; the hyperbolic derivatives and identities in [F3] apply. The exponential function is smooth and The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with Sums, scalar multiples, products and quotients: , , , and when
For vectors in a real or complex inner product space, . Cauchy–Schwarz: , with equality exactly for linearly dependent vectors
Proof
For , put . By [F3], and . The mean value theorem [F6] therefore gives ; at this is equality. Put . The derivative rules in [F3] and [F7] give . Applying [F6] on for yields , and equality holds at . Since is even, for every real .
Choose and subtract its sample vector from every vector in . The empirical Rademacher average is unchanged because , and translation preserves all Frobenius covering numbers. Write ; it contains , and each vector has norm at most . For any , partition into finitely many boxes of side at most ; from each box meeting 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 . The singleton is a proper -cover of , so . For each finite truncation and each , choose a proper -cover of with the least possible cardinality, so ; 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 .
Let be a nonempty finite set of vectors in and let . For , independence of the signs and step 1.1 give . If or , . Otherwise, for , [F4] and imply . Choosing gives .
For any translated sample vector , telescope , since . The absolute residual sign sum is at most by [F8]. For each , use only the paired-center difference set . It is a nonempty subset of , so its cardinality is at most , because covering numbers are nonincreasing with radius. Each paired difference has norm at most . Step 2.1 applied to therefore bounds its expected maximum sign sum by . Taking the supremum in the telescoping identity, summing these bounds, and dividing by gives .
The function is nonincreasing in . Since , each summand obeys . Therefore step 3.1 gives .
If , each signed average is at most , so . If , choose the largest with ; such an exists because and . Maximality gives , hence , and . Substitution into step 4.1 proves the stated inequality for every . Together, the two cases prove it for every .
Depends on
- One-sided Rademacher complexity
- Proper Frobenius covering numbers
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- The six hyperbolic functions and their natural domains
- Addition formulas, identities, parity, and derivatives of the hyperbolic functions
- Jensen's inequality for expectation
- The exponential function is smooth and $(\exp)'=\exp$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- 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 \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- The natural logarithm as the inverse of the exponential function
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
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
- Peter L. Bartlett, Dylan J. Foster, and Matus Telgarsky, Spectrally-normalized margin bounds for neural networks, Appendix A.3 (standard reference, not scraped)
- Mehryar Mohri, Foundations of Machine Learning, Lecture 3, pp. 15–16 (standard reference, not scraped)