Alphabeta Math
TheoremStatement: 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.

One-sided coordinate Rademacher contraction

Statement

Let m≥1, let z1,…,zm be fixed points in a set Z, and let H be a nonempty class of functions h:Z→R. For each i, let Φi:R→R be L-Lipschitz for one common L≥0. Suppose either that H is finite or countable, or that it has a specified nonempty countable subclass H0 for which, for every sign vector σ∈{−1,+1}m, both displayed suprema equal the corresponding suprema over H0. Assume the suprema are finite. With independent uniform signs σ1,…,σm and the one-sided normalization

R^S(H):=1mEσsup⁡h∈H∑i=1mσih(zi),

one has

1mEσsup⁡h∈H∑i=1mσiΦi(h(zi))≤L R^S(H).

No condition Φi(0)=0 is required.

Statement references

One-sided empirical Rademacher complexity: fixes the nonabsolute sign supremum and 1/m normalization.

One-sided coordinate Rademacher contraction: proves this inequality for finite or countable classes, including the no-zero-at-zero case.

Mohri et al., Lemma 5.7, printed pp. 93–94: states the coordinatewise one-sided factor-L contraction under the same normalization.

Bartlett and Mendelson, Theorem 12(4), printed p. 469: uses a different absolute-value convention, assumes the scalar map vanishes at zero, and has factor 2L; that convention is not used here.

Facts & Assumptions

Given: A fixed sample, a nonempty real-valued class, common Lipschitz constant L≥0, and finite sign suprema.

[F1]

The one-sided empirical Rademacher complexity is m−1Eσsup⁡h∈H∑iσih(zi), with no absolute value. One-sided empirical Rademacher complexity

[F2]

For a finite class, or a countable class with finite sign suprema, coordinatewise L-Lipschitz maps satisfy 1mEσsup⁡h∈H∑iσiΦi(h(zi))≤L R^S(H), without requiring Φi(0)=0. One-sided coordinate Rademacher contraction

Proof

Given: The objects and hypotheses in the Statement.

1.1F1F2given

If H is finite or countable, [F1] identifies the right-hand side with the published supplier's one-sided normalization, and [F2] gives the inequality with exactly the stated common Lipschitz constant and no zero-at-zero assumption.

2.1step 1.1givenalgebra∎

Otherwise, use the specified countable subclass H0. For every sign vector, its transformed and untransformed suprema equal those over H by hypothesis; averaging over the finite sign space therefore gives the same two quantities. Applying step 1.1 to H0 proves the displayed inequality for H.

Depends on

Used by

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