A simplified proof of CLT for convex bodies
Daniel J. Fresen

TL;DR
This paper offers a concise, accessible proof of Klartag's central limit theorem for convex bodies, relying solely on classical properties of log-concave functions, and includes an appendix linking thin shell conditions to CLT.
Contribution
The paper provides a simplified, elementary proof of the CLT for convex bodies, making the result more accessible and connecting thin shell properties to the CLT.
Findings
Simplified proof of Klartag's CLT for convex bodies
Demonstrates that thin shell condition implies CLT
Accessible approach using classical log-concave function facts
Abstract
We present a short proof of Klartag's central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is accessible to anyone.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A simplified proof of CLT for convex bodies
Daniel J. Fresen University of Pretoria, Department of Mathematics and Applied Mathematics, [email protected] or [email protected]. MSC2010: 52A20, 52A23, 60F05 (Primary), 26B25, 52A38, 62E20 (Secondary). Keywords: central limit theorem for convex bodies, log-concave function.
Abstract
We present a short proof of Klartag’s central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is accessible to anyone.
1 Introduction
The central limit theorem for convex bodies (Theorem 1 below) was conjectured by Brehm and Voigt [3] and independently (at about the same time) by Anttila, Ball and Perissinaki [1]. A 1998 preprint of [1] is cited in [2]. It took several years and various partial results before a full proof by Klartag emerged in [8] (see p95 for the history). A different proof was given soon afterwards by Fleury, Guédon, and Paouris [4]. Significantly improved quantitative bounds (from logarithmic to power type) were given by Klartag [9], followed by improved estimates by various authors on the related ’thin shell property’ [5, 7, 11]. More information can be found in [5, 7, 8, 9, 10, 12].
We present a simple proof that is self-contained (except for very classical results such as the Prékopa-Leindler inequality) and is accessible to anyone. The bounds on and that this proof gives are poor; the contribution is simplicity. The methodology is a variation of that in Klartag’s original proof and uses Fourier inversion; the main difference being that we apply concentration directly to the Fourier transform as opposed to the measure of half-spaces. The statement of Theorem 1 below is not identical to Theorem 1.1 in [8], however under log-concavity, a uniform estimate on the cumulative distribution gives an estimate on the total variation distance, so we do indeed recover Theorem 1.1 in [8]. The standard Euclidean norm and inner product on are denoted as and respectively.
Theorem 1
There exist sequences and in with such that the following is true: Let , let be a random vector in with and . Assume that has a density that is log-concave, i.e. where is convex. Then there exists a set with such that for all ,
[TABLE]
where is Haar measure on normalized so that , and .
The proof uses two nontrivial properties of log-concave functions (see [8, 9, 10] for more details): with as in Theorem 1,
If is any linear subspace of dimension , then the projection defined by
[TABLE]
is log-concave. Here integration is performed with respect to dimensional Lebesgue measure on . This is a consequence of the Prékopa-Leindler inequality. Interpreting a convolution in terms of a projection of onto , we see that if is log-concave with , then the convolution is also log-concave.
If has the thin shell property, i.e.
[TABLE]
for some (here we can take ), then the projection of onto most one dimensional subspaces is approximately Gaussian, with estimates depending on . Quantitative results of this type for log-concave measures can be found in [1, 2]. For completeness, we give a precise statement with proof in Section 3.
2 Proof of Theorem 1
The proof is in three main steps.
Step 1: Approximately spherically symmetric projections. The first step mimics Milman’s proof of Dvoretzky’s theorem [14], see for example [15], but in a different way to Klartag [8, Sections 3 and 4]. Let for some , where has the standard normal distribution and is independent of . The density of is , where and denotes convolution. Then , where denotes the Fourier transform,
[TABLE]
and
[TABLE]
For any ,
[TABLE]
and we see that is -Lipschitz on . Let be any fixed subspace and a random matrix uniformly distributed in ( to be determined later). Then is a random -dimensional subspace uniformly distributed in . Let and let be an -dense subset (i.e. for all there exists such that . By considering the volume of disjoint balls, such a subset can be chosen with cardinality . Assume that . By Lévy’s concentration inequality for Lipschitz functions on a sphere, see e.g. [10], and the union bound, with probability at least
[TABLE]
the following event occurs: for all , and all ,
[TABLE]
where
[TABLE]
With the same probability, the same event holds with replaced with . Setting , making the subject of the formula, and using the Lipschitz property of , with high probability, for all ,
[TABLE]
Optimizing over we set . Let denote the orthogonal projection onto , let denote the Fourier transform on and let denote the Fourier transform on ( as a Hilbert space in its own right). Recall the definition in (1). By Fubini’s theorem, the function is the density of the random vector (with respect to -dimensional Lebesgue measure in ). The Fourier transform works well with orthogonal projections, in particular
[TABLE]
where denotes the restriction of to . By Fourier inversion in , for all ,
[TABLE]
so for all , (applying a change of variables)
[TABLE]
**Step 2: Behavior of **(in the spirit of Lemmas 4.3 and 4.4 in [8]). Consider any and define by
[TABLE]
Since and are log-concave, i.e. and are convex with values in , is also log-concave. It follows from the Prékopa-Leindler inequality (see for example the discussion in [8]) that too is log-concave, and therefore and are convex. Since , and are infinitely differentiable. In preparation for an integral over in polar coordinates, we now study and , . These functions are maximized at , that satisfy
[TABLE]
Such numbers exist since is continuous with limit [math] (resp. ) as (resp. ), similarly for . After a possible re-labeling of and we may assume that . Our goal is to show that these numbers cannot be too far apart (in the sense that their ratio is close to ). If there is nothing to show, so assume . By convexity,
[TABLE]
and therefore
[TABLE]
Assume momentarily that there exists such that . Since is the log-concave density of a random vector in with covariance , it follows from Theorem 5.14 in [13] (see also (6) here) that . By convexity again,
[TABLE]
However, by (2),
[TABLE]
We will choose the parameters , , and so that the upper bound on is less than the lower bound, which implies that we may assume that for all . Now let such that
[TABLE]
By (3),
[TABLE]
so
[TABLE]
For an appropriate choice of parameters this will achieve our goal of showing that and cannot be too far apart (relatively). What this means is that in any direction , the function achieves its peak in about the same place. Our next goal is to show that the mass in
[TABLE]
is concentrated around . Since lies above its tangent lines, defining by
[TABLE]
provided . We now translate this to tail probabilities. Fix any and . By log-concavity of ,
[TABLE]
and therefore
[TABLE]
On the other hand, for any ,
[TABLE]
so
[TABLE]
and
[TABLE]
A similar bound holds for the left hand tail. Combining these,
[TABLE]
provided .
Step 3: Thin shell and small details. Now fix an arbitrary . By polar integration,
[TABLE]
which is the so called ’thin shell property’ of in (see Section 3 for more details), and by a result of Bobkov [2] (following Anttila, Ball and Perissinaki [1] in the symmetric case) this implies that with probability at least
[TABLE]
a further random projection is approximately Gaussian (with mean zero and variance ), where is uniformly distributed in ,
[TABLE]
See Theorem 2. Now , and . Assume that and , and consider any . Since
[TABLE]
by the union bound and (7), is bounded below by
[TABLE]
and above by
[TABLE]
Choosing
[TABLE]
(a fairly arbitrary choice), where is chosen first to be small and then is chosen to be appropriately large, we get and the error bound reduces to
[TABLE]
the probability bound (of failure) reduces to
[TABLE]
where can be made arbitrarily large by taking large enough. The upper and lower bounds for earlier in the proof become (respectively) and , which achieves the desired contradiction, and the required bound is satisfied. Note that where is uniformly distributed in , so we have shown that the projection of onto most one dimensional subspaces is approximately Gaussian, and Theorem 1 follows.
Note: Radius of the thin shell. When stating and applying the fact that the thin shell property implies CLT, it is convenient to replace with in (5). Let () be a random variable with density proportional to , . From (4),
[TABLE]
so
[TABLE]
The last inequality follows since . Similarly,
[TABLE]
But , so
[TABLE]
and (changing the constants involved) we may replace with in (5).
Note: Lower bound on . To simplify notation we work with the original function , but the corresponding result can then be applied to by replacing with . By log-concavity, is convex and there exists such that implies . It is an interesting exercise to show that for any log-concave random variable in with zero mean and unit variance, such as , for some universal constant (actually for ). Now
[TABLE]
where is such that and as (and ). Optimizing in yields
[TABLE]
In the symmetric case one gets the optimal base . The estimate can be found, for example, in [13, Theorem 5.14].
3 Appendix: Thin shell implies
CLT
For completeness we collect and prove various known results and tailor them to our specific use. We refer the reader to [2, Theorems 1.1 and 1.2, Eq. (1.7) Proposition 3.1] and [1] for a more extensive discussion. Our proof of Proposition 3.1 in [2] on the Lipschitz constant of is slightly simplified.
Theorem 2
Let . Let be a probability measure on with center of mass [math], identity covariance, and log-concave density . If has the following thin shell property:
[TABLE]
then there exists with such that for all ,
[TABLE]
Proof. Write . For any that are sufficiently close, say ,
[TABLE]
where denotes the symmetric difference of and . By projecting onto and identifying with , we conclude that
[TABLE]
where is the density of the measure projection of into (identified with ), see (1), and . By the Prékopa-Leindler inequality is log-concave, and defines a probability measure with mean [math] and identity covariance. It is an elementary fact that for such a function, with universal constants . By a change of variables (through translation),
[TABLE]
This implies that is -Lipschitz in . Now let be chosen randomly, uniformly distributed on and let . By concentration on (see e.g. [10]) and the union bound, with probability at least , the following event occurs: for all , , where and . Using monotonicity in , we conclude that (with high probability) for all . We now compare to . Let , where is still uniform on . Let be a random vector in with distribution and independent of . The vector is independent of and has the same distribution as . Using Fubini’s theorem and independence, and assuming ,
[TABLE]
A similar lower bound holds. For any ,
[TABLE]
It follows from rotational invariance of the standard normal distribution and uniqueness of Haar measure that if is a standard normal vector in then is uniformly distributed on . Simulating ,
[TABLE]
which (after a bit of fiddling using (7) and Gaussian concentration of about ) implies the well known estimate for all (this can also be seen by considering the density , similar details in [6, Section 3]). Putting all this together,
[TABLE]
with a similar lower bound. Similarly, this also holds for .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Anttila, M., Ball, K., Perissinaki, I.: The central limit problem for convex bodies. Trans. Amer. Math. Soc. 355 (12), 4723-4735 (2003)
- 2[2] Bobkov, S.: On concentration of distributions of random weighted sums. Ann. Probab. 31 (1), 195-215 (2003)
- 3[3] Brehm, U., Voigt, J.: Asymptotics of cross sections for convex bodies. Beitr. Algebra Geom. 41 (2), 437-454 (2000)
- 4[4] Fleury, B., Guédon, O., Paouris, G.: A stability result for mean width of L p subscript 𝐿 𝑝 L_{p} -centroid bodies. Adv. Math. 214 (2), 865-877 (2007)
- 5[5] Fleury, B.: Concentration in a thin Euclidean shell for log-concave measures. J. Func. Anal. 259 (4), 832-841 (2010)
- 6[6] Fresen, D. J.: Explicit Euclidean embeddings in permutation invariant normed spaces. Adv. Math. 266, 1-16 (2014)
- 7[7] Guédon, O., Milman, E.: Interpolating thin-shell and sharp large-deviation estimates for isotropic log-concave measures. Geom. Funct. Anal. 21 (5), 1043-1068 (2011)
- 8[8] Klartag, B.: A central limit theorem for convex sets. Invent. Math. 168, 91-131 (2007)
