Alphabeta Math
RemarkRemark: AI-adaptedProof: AI-generated
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.

Median–mean gap for convex Lipschitz concentration

PDF p. 35: Paragraph preceding Corollary 6.6

Statement

Assume countable choice: every sequence of nonempty sets admits a choice of one element from each set. In the setting of Convex Lipschitz concentration — Theorem 6.5, let d≥1, let X=(X1,…,Xd) have independent [0,1]-valued random coordinates, and let f:[0,1]d→R be convex and 1-Lipschitz for Euclidean distance. Thus ∣f(x)−f(y)∣≤∥x−y∥2 on the cube. Let Mf(X) be a median: both P(f(X)≤Mf(X)) and P(f(X)≥Mf(X)) are at least 1/2. Then f(X) is integrable and ∣Mf(X)−Ef(X)∣≤4.

Facts & Assumptions

[F1]

The two-sided convex product concentration theorem gives, for each t>0, both P(f(X)>Mf(X)+t)≤2e−t2/4 and P(f(X)<Mf(X)−t)≤2e−t2/4 under the stated hypotheses (Convex Lipschitz concentration with its coordinate metric).

[F2]

Under countable choice, the median-to-mean bridge gives ∣EZ−m∣<4L for an integrable real random variable Z whose two tails about a median m are bounded by 2e−t2/(4L2) for all t>0 (Tail integration and a median-to-mean bridge, The Axiom of Countable Choice (AC_ω)).

[F3]

Random coordinates are measurable, and continuous maps between Euclidean spaces are Borel measurable under countable choice (Independent random elements, Continuous functions on Euclidean spaces are Borel measurable). A measurable real function is integrable when the integral of its absolute value is finite; the nonnegative integral is monotone, and expectation is its integral when it is integrable (Integrable real and complex functions, and their integrals, Monotonicity and nonnegative homogeneity of the nonnegative integral, Expectation of a nonnegative or integrable random variable).

[F4]

On the probability space (Ω,F,P), P(Ω)=1 (Probability measures and probability spaces). For a nonnegative simple measurable function s=∑jcjχEj on disjoint measurable sets, its simple integral is ∑jcjP(Ej) (The integral of a nonnegative simple function), and its nonnegative Lebesgue integral equals this simple integral (The nonnegative integral agrees with the simple integral on simple functions).

Proof

Given: Countable choice, the independent coordinates, the convex Euclidean 1-Lipschitz function and the median in the statement.

Goal: Establish integrability and the stated median–mean bound.

1.1F3F4givenalgebra

The Lipschitz inequality makes f continuous on the cube and gives ∣f(x)∣≤∣f(0)∣+d there. Coordinatewise clipping c(u)i=min⁡{1,max⁡{0,ui}} is continuous and takes Rd into the cube, so f∘c is continuous on Rd. By [F3] it is Borel measurable. The vector X is measurable: inverse images of open boxes are finite intersections of coordinate inverse images, and every open subset of Rd is a countable union of rational open boxes. Therefore f(X)=(f∘c)(X) is measurable. Put C=∣f(0)∣+d. The constant function CχΩ is nonnegative simple and measurable, since its inverse images of Borel sets are either Ω or ∅. By [F4], ∫ΩCχΩ dP=CP(Ω)=C<∞. Since ∣f(X)∣≤CχΩ, monotonicity in [F3] gives ∫Ω∣f(X)∣ dP≤C<∞. Thus [F3] establishes integrability.

2.1F1F2step 1.1algebra∎

Apply [F1] with the given median and then [F2] with Z=f(X), m=Mf(X) and L=1. Step 1.1 supplies integrability, so ∣Ef(X)−Mf(X)∣<4, and hence the asserted weak inequality follows.

Source notes

The article attributes the bound to Boucheron, Lugosi and Massart, Exercise 2.2. The argument above instead uses the separately supplied two-sided concentration and tail-integration results. The article reference records attribution, not a premise of the proof.

Depends on

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources