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.
Absolute-value Rademacher contraction
Statement
Let , let be fixed, and let be a nonempty finite class of real-valued functions on their domain. For each , suppose for all , with a common , and . Then
The same holds for a countable class when the two suprema are finite for every sign vector. This is the absolute-value theorem; its factor is separate from the factor in independent-process symmetrization.
Facts & Assumptions
Given: A fixed sample, a nonempty finite class, and -Lipschitz maps satisfying .
The one-sided coordinate contraction inequality applies to every finite class, including the class enlarged by the zero vector (One-sided coordinate Rademacher contraction).
Proof
Given: The sample, class, and coordinate maps in the statement.
Enlarge the evaluation-vector class by adjoining the zero vector. Since , for each sign vector both and are nonnegative. The supremum of the absolute value is .
The map preserves the uniform sign law, so . Therefore the left side is at most . Applying [F1] to the enlarged class gives . Combining proves the claimed factor .
For a countable class, enumerate its members and apply the finite proof to increasing finite initial subclasses. For each sign vector, the finite suprema increase to the corresponding countable supremum; averaging over the finite sign cube passes the inequalities to the limit.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Lemma 5.7 (standard reference, not scraped)
- David Pollard, Empirical Processes: Theory and Applications, Chapter 5, Theorem 5.7 (standard reference, not scraped)