Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 m≥1, let z1,…,zm be fixed, and let F be a nonempty finite class of real-valued functions on their domain. For each i, suppose ∣Φi(x)−Φi(y)∣≤L∣x−y∣ for all x,y∈R, with a common L≥0, and Φi(0)=0. Then

Eσsup⁡f∈F∣∑i=1mσiΦi(f(zi))∣≤2L Eσsup⁡f∈F∣∑i=1mσif(zi)∣.

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 2 is separate from the factor 2 in independent-process symmetrization.

Facts & Assumptions

Given: A fixed sample, a nonempty finite class, and L-Lipschitz maps Φi satisfying Φi(0)=0.

[F1]

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.

1.1givenalgebra

Enlarge the evaluation-vector class by adjoining the zero vector. Since Φi(0)=0, for each sign vector both A:=sup⁡f∈F∪{0}∑iσiΦi(f(zi)) and B:=sup⁡f∈F∪{0}−∑iσiΦi(f(zi)) are nonnegative. The supremum of the absolute value is max⁡(A,B)≤A+B.

2.1F1step 1.1algebra

The map σ↦−σ preserves the uniform sign law, so EσA=EσB. Therefore the left side is at most 2EσA. Applying [F1] to the enlarged class gives EσA≤LEσsup⁡f∈F∪{0}∑iσif(zi)≤LEσsup⁡f∈F∣∑iσif(zi)∣. Combining proves the claimed factor 2L.

3.1step 2.1given∎

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