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 be standard Gaussian on and let be -Lipschitz. If , then for every , If , the probability on the left is zero.
Facts & Assumptions
AC, DC, and countable choice are inherited from the Gaussian log-Sobolev and integration suppliers (The Axiom of Choice, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, The Axiom of Countable Choice ()).
For bounded above and below by positive constants, with bounded first and second derivatives, (Gross logarithmic Sobolev inequality for standard Gaussian measure).
The standard -dimensional Gaussian has Lebesgue density (A positive-definite multivariate normal law has its Gaussian density).
Dominated convergence passes limits through the Gaussian expectations used below (Dominated convergence).
Differentiation under an integral is valid under a common integrable majorant for the parameter derivatives (Differentiation under the integral sign).
The mean value theorem bounds a differentiable function from a bound on its derivative (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
For nonnegative random variables, Markov's inequality bounds by when (Markov's inequality for random variables).
Proof
Given: AC, DC, countable choice, a standard Gaussian vector , and an -Lipschitz function .
First suppose is smooth and bounded with bounded derivatives. For , apply [F1] to . With , the entropy identity and give .
Assume . The function extends continuously to because . Its derivative on is by step 1.1. The mean value theorem [F5] on gives . Markov's inequality [F6] therefore gives ; choosing proves the displayed bound for this .
Suppose . For a general Lipschitz , clip its values to to obtain a bounded -Lipschitz function . For set . Equivalently, write this as an integral against the smooth Gaussian density . Every derivative of the kernel in is a polynomial times a Gaussian density; on compact -sets it has an integrable Gaussian majorant, so [F4] permits differentiation under the integral to every order. The global norm of each kernel derivative is finite, hence the derivatives of are bounded by times finite constants. Using the same integration variable for two points shows is -Lipschitz, so step 2.1 applies. For each fixed , as , and then as . Throughout, . For each fixed , and the density in [F2] give an integrable Gaussian majorant for . Dominated convergence [F3] passes the means and exponential moments first as and then as , proving the bound for .
If , then is constant on , so for every . This handles the zero-Lipschitz case and completes the theorem.
Depends on
- Gross logarithmic Sobolev inequality for standard Gaussian measure
- Standard normal and normal laws
- Multivariate normal law, including singular covariance
- A positive-definite multivariate normal law has its Gaussian density
- Characteristic function of a multivariate normal law
- Dominated convergence
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Differentiation under the integral sign
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- Markov's inequality for random variables
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
- N. Berestycki and R. Nickl, Concentration of Measure (standard reference, not scraped)
- D. Chafaï and D. Lehec, Lectures on the logarithmic Sobolev inequality (standard reference, not scraped)