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

Lipschitz concentration for standard Gaussian measure

Statement

Assume AC, DC, and countable choice. Let Z∼γd be standard Gaussian on Rd and let f:Rd→R be L-Lipschitz. If L>0, then for every r>0, P{f(Z)≥Ef(Z)+r}≤e−r2/(2L2). If L=0, the probability on the left is zero.

Facts & Assumptions

[F1]

For g∈C2(Rd) bounded above and below by positive constants, with bounded first and second derivatives, Ent⁡γd(g)≤12∫∣∇g∣2/g dγd (Gross logarithmic Sobolev inequality for standard Gaussian measure).

[F2]

The standard d-dimensional Gaussian γd=Nd(0,Id) has Lebesgue density (2π)−d/2e−∣x∣2/2 (A positive-definite multivariate normal law has its Gaussian density).

[F3]

Dominated convergence passes limits through the Gaussian expectations used below (Dominated convergence).

[F4]

Differentiation under an integral is valid under a common integrable majorant for the parameter derivatives (Differentiation under the integral sign).

[F6]

For nonnegative random variables, Markov's inequality bounds P(X≥a) by EX/a when a>0 (Markov's inequality for random variables).

Proof

Given: AC, DC, countable choice, a standard Gaussian vector Z, and an L-Lipschitz function f.

1.1A1F1givenalgebra

First suppose f is smooth and bounded with bounded derivatives. For λ>0, apply [F1] to g=eλf. With ψ(λ)=log⁡Eeλ(f(Z)−Ef(Z)), the entropy identity and ∣∇f∣≤L give λψ′(λ)−ψ(λ)≤λ2L2/2.

2.1F5F6step 1.1algebra

Assume L>0. The function q(λ)=ψ(λ)/λ extends continuously to q(0)=0 because ψ(0)=ψ′(0)=0. Its derivative on (0,∞) is q′(λ)=(λψ′(λ)−ψ(λ))/λ2≤L2/2 by step 1.1. The mean value theorem [F5] on [0,λ] gives ψ(λ)≤λ2L2/2. Markov's inequality [F6] therefore gives P(f(Z)−Ef(Z)≥r)≤e−λr+λ2L2/2; choosing λ=r/L2 proves the displayed bound for this f.

3.1A1F2F3F4step 2.1construct

Suppose L>0. For a general Lipschitz f, clip its values to [−n,n] to obtain a bounded L-Lipschitz function fn. For s>0 set Psfn(x)=∫fn(e−sx+1−e−2sy) dγd(y). Equivalently, write this as an integral against the smooth Gaussian density ρs(y−e−sx). Every derivative of the kernel in x is a polynomial times a Gaussian density; on compact x-sets it has an integrable Gaussian majorant, so [F4] permits differentiation under the integral to every order. The global L1 norm of each kernel derivative is finite, hence the derivatives of Psfn are bounded by ∥fn∥∞ times finite constants. Using the same integration variable for two points shows Psfn is L-Lipschitz, so step 2.1 applies. For each fixed n, Psfn(x)→fn(x) as s↓0, and then fn(x)→f(x) as n→∞. Throughout, ∣Psfn(x)∣≤∣f(0)∣+L∣x∣+L∫∣y∣ dγd(y). For each fixed λ, λL∣x∣≤∣x∣2/4+(λL)2 and the density in [F2] give an integrable Gaussian majorant for eλ∣Psfn(x)∣. Dominated convergence [F3] passes the means and exponential moments first as s↓0 and then as n→∞, proving the bound for f.

4.1givenalgebra∎

If L=0, then f is constant on Rd, so P{f(Z)≥Ef(Z)+r}=0 for every r>0. This handles the zero-Lipschitz case and completes the theorem.

Depends on

Used by

Dependency tree · two levels

74 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