Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Independent-process symmetrization for convex moments

Statement

Let n≥1, let Z1,…,Zn be IID observations with law P, and let Z1′,…,Zn′ be an independent IID copy. Let σ1,…,σn be independent uniform signs, independent of both samples. Let F be a nonempty countable class of measurable P-integrable real functions. Assume the two suprema below are finite almost surely. If Φ:[0,∞)→[0,∞) is finite, convex, and nondecreasing, then

EΦ ⁣(sup⁡f∈F∣∑i=1n(f(Zi)−Pf)∣)≤EΦ ⁣(2sup⁡f∈F∣∑i=1nσif(Zi)∣).

The same statement holds for an uncountable class when a specified countable subclass gives the same three displayed suprema almost surely for the data, copy, and signs. This is an expectation inequality only; a tail form requires separate assumptions.

Facts & Assumptions

Given: IID observations, an independent IID copy and independent signs, a nonempty countable measurable class of integrable functions, finite displayed suprema, and a finite convex nondecreasing Φ≥0.

[F1]

Pf=Ef(Zi), Pnf=n−1∑if(Zi), and Gn(f)=n(Pnf−Pf); the general centered independent-process sum is ∑i(Xi(t)−EXi(t)) (Empirical, centered, and Rademacher processes).

[F2]

Independence of random elements means independence of their generated sigma-algebras, and finite independent random elements have product joint law (Independent random elements, Independent random elements have product joint law).

[F3]

For an integrable real random variable X and a convex Φ with Φ(X) integrable or nonnegative, Φ(EX)≤EΦ(X) (Jensen's inequality for expectation).

[F5]

Increasing nonnegative measurable functions pass to the limit under integration (Monotone convergence for the integral).

[F6]

IID means independent and identically distributed; each observation and its copy therefore have the same law P (Identical distribution and IID families).

[F7]

The finite product measure is determined by its rectangle formula, so a coordinate permutation that preserves those rectangle probabilities preserves the product law (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).

[F8]

For finite subclasses, coordinate lifts, sums, absolute values, maxima, and their compositions with a Borel map are measurable. Since Φ is nondecreasing, each strict upper level set is an upper interval and hence Borel; composition with Φ therefore preserves measurability (The product sigma-algebra and its finite iterates, Arithmetic and lattice operations preserve measurability whenever they are defined, Composition with a Borel measurable outer map preserves measurability).

Proof

Given: The objects and hypotheses of the statement.

1.1F1F3F4F8given

First let F0⊂F be finite. For fixed observed values z1,…,zn, write Df:=∑i(f(zi)−f(Zi′)). Then ∑i(f(zi)−Pf)=EZ′Df. For each f, ∣EZ′Df∣≤EZ′∣Df∣≤EZ′max⁡g∈F0∣Dg∣; taking the finite maximum and applying monotonicity of Φ and Jensen [F3] gives Φ(max⁡f∣∑i(f(zi)−Pf)∣)≤EZ′Φ(max⁡f∣Df∣). By [F8], these finite statistics and their Φ-compositions are measurable, so Tonelli [F4] applies when integrating over observations and copy. It gives EΦ(max⁡f∣∑i(f(Zi)−Pf)∣)≤EZ,Z′Φ(max⁡f∣∑i(f(Zi)−f(Zi′))∣).

2.1F2F6F7step 1.1

By [F6], each Zi and Zi′ has law P; by [F2] and the independent-copy hypothesis, all 2n coordinates have product law. [F7] makes this product law invariant under swapping the two coordinates in any selected pair. Thus for every fixed sign vector σ, the signed difference process ∑iσi(f(Zi)−f(Zi′)) has the same law as the unsigned difference process. Averaging this equality over the finite sign space leaves the right-hand expectation in step 1.1 unchanged when f(Zi)−f(Zi′) is replaced by σi(f(Zi)−f(Zi′)).

3.1F8givenstep 1.1step 2.1algebra

For every outcome, put A:=max⁡f∣∑iσif(Zi)∣ and B:=max⁡f∣∑iσif(Zi′)∣. By [F8] these statistics and their Φ-compositions are measurable. The triangle inequality gives max⁡f∣∑iσi(f(Zi)−f(Zi′))∣≤A+B. Monotonicity and convexity yield Φ(A+B)≤12Φ(2A)+12Φ(2B); since A and B have the same distribution, the resulting expectation is EΦ(2A). Combining with steps 1.1 and 2.1 proves the desired inequality for finite F0.

4.1F1F5F8step 3.1given∎

Enumerate the countable class and let Fk be its first k members. The finite-class inequality applies to every Fk, and its suprema increase to those over F. To justify the limit, fix c>0 and b>c. For c<x<b, monotonicity and convexity give 0≤Φ(x)−Φ(c)≤x−cb−c(Φ(b)−Φ(c)); for 0<x<c, writing c=b−cb−xx+c−xb−xb gives 0≤Φ(c)−Φ(x)≤c−xb−c(Φ(b)−Φ(c)). Thus Φ is continuous on (0,∞). At zero, for any a>0 and t↓0, monotonicity and convexity give Φ(0)≤Φ(ta)≤(1−t)Φ(0)+tΦ(a), so it is right-continuous there too. By [F8], the finite-class compositions are measurable; [F5] now passes both nonnegative expectations to the limit. A countable subclass giving the same suprema proves the stated separable-version extension.

Depends on

Used by

Dependency tree · two levels

55 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