An example related to the slicing inequality for general measures
Bo'az Klartag, Alexander Koldobsky

TL;DR
This paper investigates the slicing inequality for general measures, establishing a lower bound that grows with dimension and exploring related measure conditions, advancing understanding of geometric measure inequalities.
Contribution
It constructs a new example demonstrating a lower bound for the slicing constant that grows with dimension, and analyzes measures satisfying the -condition.
Findings
Established a lower bound for the slicing constant as n /
Provided examples satisfying the -condition for various
Extended understanding of measure inequalities in convex geometry.
Abstract
For let be the smallest number satisfying the inequality for all centrally-symmetric convex bodies in and all even, continuous probability densities on . Here is the volume of . It was proved by the second-named author that , and in analogy with Bourgain's slicing problem, it was asked whether is bounded from above by a universal constant. In this note we construct an example showing that where is an absolute constant. Additionally, for any we describe a related example that satisfies the so-called -condition.
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.
An example related to the slicing inequality for general measures
Bo’az Klartag and Alexander Koldobsky
Abstract
For let be the smallest number satisfying the inequality
[TABLE]
for all centrally-symmetric convex bodies in and all even, continuous probability densities on . Here is the volume of . It was proved in [16] that , and in analogy with Bourgain’s slicing problem, it was asked whether is bounded from above by a universal constant. In this note we construct an example showing that where is an absolute constant. Additionally, for any we describe a related example that satisfies the so-called -condition.
1 Introduction
Suppose that is a centrally-symmetric convex set of volume one (i.e., ). Given an arbitrary continuous probability density , can we find a hyperplane passing through the origin such that
[TABLE]
where is a universal constant, which is in particular independent of and even the dimension ?
For many classes of convex bodies, the answer is surprisingly positive. It was proven by the second-named author [17] that the answer is affirmative in the case where is unconditional, i.e.,
[TABLE]
This generalizes a result first proven by Bourgain [3], who considered the case where the density is constant. Bourgain’s investigations have led to the formulation of the slicing problem [3, 4], which asks whether , where is the minimal number such that for any centrally-symmetric convex body ,
[TABLE]
Here is the central hyperplane perpendicular to the vector , and is the Euclidean unit sphere centered at the origin. We write for the -dimensional volume of . When the dimension is clear from the context, we will simply use in place of . Bourgain’s slicing problem is still unsolved, the best-to-date estimate was established by the first-named author [11], removing a logarithmic term from an earlier estimate by Bourgain [5]. In analogy with the slicing problem, for let be the smallest number satisfying the inequality
[TABLE]
for all centrally-symmetric convex bodies , and all measures with a non-negative continuous density in . Here we abbreviate
[TABLE]
where the restriction of the density to is integrated with respect to the Lebesgue measure in
Many of the positive results towards the slicing problem may be generalized from the case of the uniform measure on a convex domain to the broader class of any continuous probability density on . Thus (1) holds true, with having the order of magnitude of a universal constant, whenever is the polar to a convex body with bounded volume ratio (see [17]) or the unit ball of a subspace of with (see [18]). The first result of this kind was proved in [15]: If belongs to the class of intersection bodies (see definition in Section 2), then (1) holds with for all measures with even continuous densities.
In view of the positive results mentioned above, one could think that perhaps . In this note we show that this is not the case, and prove the following:
Theorem 1.1**.**
There exist universal constants so that for any ,
[TABLE]
The new result here is the left-hand side estimate. The right-hand side estimate was first established in [16], and later a different proof was found in [6] where the central-symmetry assumption was no longer required. In fact, the upper estimate for the constants may be deduced from the following theorem proved in [17, Corollary 1], which we now describe. A compact is star-shaped if for , where . We say that a star-shaped is a star body if its radial function
[TABLE]
is continuous and positive in . For a star body denote by
[TABLE]
the outer volume ratio distance from to the class of intersection bodies
Theorem 1.2**.**
For any any centrally-symmetric star body and any measure with a continuous density on ,
[TABLE]
The right-hand estimate of Theorem 1.1 follows from Theorem 1.2 and John’s theorem, since all elllipsoids are intersection bodies (see [16]). For the sake of completeness, we present a short proof of Theorem 1.2 and related results in Section 2. In Section 3 we move on to discuss the lower estimate for which shows that the upper bound is in fact optimal up to a -term:
Theorem 1.3**.**
For any there exists a centrally-symmetric convex body and an even, continuous probability density such that for any affine hyperplane ,
[TABLE]
where is a universal constant.
Note that the hyperplane in Theorem 1.3 is not required to pass through the origin. The combination of Theorem 1.2 and Theorem 1.3 implies the following:
Corollary 1.4**.**
There exists a centrally-symmetric convex body with , where is a universal constant.
For we say that a measure on admits -tails with parameters if for any linear functional
[TABLE]
where . It follows from the Brunn-Minkowski inequality that the uniform probability measure on a convex body in has -tails with parameters that are universal constants, see, e.g., [2, Section 2.4]. It follows from the argument by Bourgain (see e.g. [2, Section 3.3]) that for any measure with an even, continuous density supported on a centrally-symmetric convex body ,
[TABLE]
where the supremum runs over all -dimensional affine hyperplanes , where is assumed to have -tails with parameters , and where depends only on and . For completeness, we provide a short argument explaining (4) in an appendix.
Specializing (4) to the case , we obtain the bound for Bourgain’s slicing problem, which is not far from the best estimate known to date. In the log-concave case it was proven in [12] that the logarithmic factor in (4) is not needed. The following theorem establishes the near-optimality of the bound (4), up to logarithmic terms:
Theorem 1.5**.**
For any and there exists a centrally-symmetric convex body and an even, continuous probability density with the following properties:
- (i)
* for any affine hyperplane .* 2. (ii)
The measure whose density is admits -tails with parameters .
Here, depend solely on .
Theorem 1.5 shows that Bourgain’s slicing problem cannot be resolved on the affirmative if all that is used is the uniformly subexponential tails of linear functionals on convex bodies.
Throughout this paper, unless specified otherwise we write etc. for various positive, universal constants, whose value is not necessarily the same in different appearances. We use lower-case for sufficiently small positive universal constants, while etc. are sufficiently large universal constants. A convex body in is a compact, convex set with a non-empty interior. The standard scalar product between is denoted by or by . We write for the natural logarithm.
Acknowledgements. We would like to thank Sergey Bobkov for encouraging us to discuss and think on this problem. We thank the anonymous referee for a thoughtful report. A major part of the work was done when both authors were visiting the Banff International Research Station during May 21–26, 2017. We would like to thank BIRS for hospitality. The first-named author was supported in part by a European Research Council (ERC) grant. The second-named author was supported in part by the US National Science Foundation grant DMS-1700036.
2 The outer volume ratio distance from intersection bodies
The Minkowski functional of a star body is defined by
[TABLE]
Note that for any , where is the radial function of . The class of intersection bodies was introduced by Lutwak [21]. Let be origin-symmetric star bodies in We say that is the intersection body of if the radius of in every direction is equal to the -dimensional volume of the section of by the central hyperplane orthogonal to this direction, i.e. for every
[TABLE]
where is the spherical Radon transform
[TABLE]
All star bodies that appear as intersection bodies of star bodies form the class of intersection bodies of star bodies.
A more general class of intersection bodies is defined as follows; see [9]. If is a finite Borel measure on then the spherical Radon transform of is a functional on acting by
[TABLE]
Definition 2.1**.**
A star body in is called an intersection body, and we write if there exists a finite Borel measure on such that as functionals on i.e.
[TABLE]
For example, let us consider the cross-polytope
[TABLE]
It was proved in [13] that is an intersection body. To see this, note that the function is the Fourier transform of the function
[TABLE]
and use the connection between the Radon and Fourier transforms: For ,
[TABLE]
We get that the radial function of the cross-polytope is the spherical Radon transform of the function
[TABLE]
This function is integrable on the sphere, but it is not bounded (it takes infinite values on a set of measure zero). Therefore, is an intersection body, but not the intersection body of a star body; see [13] or [14, Section 4.3] for details. Note that it was proved in [13] that all polar projection bodies are intersection bodies.
It was proven in [17] that for every unconditional convex body in In fact, by a result of Lozanovskii [20] (see the proof in [22, Corollary 3.4]), there exists a linear operator on so that where is the cube with sidelength 2 in Let From the fact that a linear transformation of an intersection body is an intersection body, the body is an intersection body in Since , we have On the other hand, and so
We now present a proof of Theorem 1.2 that is slightly shorter than that in [17].
Proof of Theorem 1.2.
For every we have
[TABLE]
Let be the continuous density of the measure Writing the integral in spherical coordinates, we see that for every ,
[TABLE]
where
[TABLE]
Therefore, inequality (6) can be written in terms of the spherical Radon transform
[TABLE]
for all Note that the right-hand side of (7) does not depend on .
Let be an intersection body such that the distance is almost realized, i.e. and for some small ,
[TABLE]
Integrating both sides of (7) by over the sphere with respect to the measure corresponding to by definition (5), we get
[TABLE]
The left-hand side of (9) is equal to
[TABLE]
[TABLE]
because implies for every
Now we estimate the left-hand side of (9) from above. We use for every definition (5), Hölder’s inequality and a standard formula for volume:
[TABLE]
[TABLE]
By using (8), sending and combining the estimates above, we obtain the conclusion of the theorem. Note that the uniform measure on the sphere was not normalized in the calculations.
3 A counterexample
We move on to the proof of Theorem 1.3. We may clearly assume that the dimension exceeds a given universal constant , as otherwise the conclusion of the theorem is trivial. We shall need the following well-known Bernstein-type inequality. A proof is provided for completeness:
Lemma 3.1**.**
Let be independent, identically-distributed random variables attaining values in the interval . Let satisfy . Then,
[TABLE]
Proof.
Since with ,
[TABLE]
Therefore,
[TABLE]
By the Markov-Chebyshev inequality,
[TABLE]
For we set . Later on, we will apply Lemma 3.1 for , where is a random point in the sphere and is a fixed unit vector.
Lemma 3.2**.**
Let and let be a random point, distributed uniformly over . Let be a fixed unit vector. Then for any and ,
[TABLE]
where and are universal constants.
Proof.
Denote . Then is a random variable supported in the interval whose density in this interval is proportional to the function . Setting we see that we need to prove that
[TABLE]
where
[TABLE]
In order to prove (11), we note that
[TABLE]
where we used (12) and the inequality , valid for all and . Thus (11) is proven.
By combining Lemma 3.1 and Lemma 3.2 we obtain the following:
Corollary 3.3**.**
Let and let be independent, identically-distributed random vectors, distributed uniformly over the sphere . Fix and . Then,
[TABLE]
where and are universal constants.
Proof.
Set . Then are independent, identically-distributed random variables attaining values in the interval . Set
[TABLE]
where are the constants from Lemma 3.2. Then , according to Lemma 3.2. By Lemma 3.1,
[TABLE]
where we used that in the last passage.
The function has a bounded derivative . Therefore is a -Lipschitz function on the entire real line. This Lipschitz property enables us to make the estimate of Corollary 3.3 uniform in , as explained in the following:
Proposition 3.4**.**
Assume that , that and that . Let be independent, identically-distributed random vectors, distributed uniformly in . Then with probability of at least the following holds: For all and ,
[TABLE]
where are universal constants.
Proof.
For all possible choices of , the function
[TABLE]
is a Lipschitz function on whose Lipschitz constant is at most . Set , and let be a -net, i.e., for any there exists with . By a standard volumetric argument (see, e.g., [22]), there exists a -net with cardinality
[TABLE]
Let be the set of all integer multiples of that lie in the interval . Then for any and there exists and with
[TABLE]
by the aforementioned Lipschitz property of . Let us now apply Corollary 3.3 with , to obtain
[TABLE]
The constant in (16) is at most one. Hence for any with we have that . We therefore conclude from (15) and (16) that
[TABLE]
We have thus proven that with probability of at least , inequality (13) holds true for all and . The validity of (13) when is much easier, as in this case
[TABLE]
with probability one. This completes the proof.
Remark 3.5**.**
The use of the -net in the proof of Proposition 13 is probably not optimal, and it is the reason for the appearance of the -factor in our result. We suspect that this factor may be improved or eliminated by using more sophisticated tools from the theory of Gaussian processes, such as Slepian’s lemma, Talgrand’s majorizing measure or related results. In fact, perhaps Gordon’s minmax theorem may be used in order to improve the double logarithm to a triple logarithm in Theorem 1.1. These considerations will be expanded upon elsewhere. **
By iterating Proposition 13 twice we obtain the following:
Lemma 3.6**.**
Assume that and let us set
[TABLE]
Then there exist unit vectors such that for all and ,
[TABLE]
where are universal constants.
Proof.
We may assume that is sufficiently large so that , where throughout this proof is the constant from Proposition 13. By the conclusion of Proposition 13, we may fix unit vectors such that for all and ,
[TABLE]
Note that . In particular, for any choice of , and for any and ,
[TABLE]
where we used (18) with . Let us now apply Proposition 13 with
[TABLE]
From the conclusion of this proposition we obtain that there exist unit vectors such that for all and ,
[TABLE]
We may combine the two inequalities above to obtain that for all and ,
[TABLE]
The reason we iterated Proposition 13 only twice and not thrice or more in the proof of Lemma 3.6 is basically the non-optimal use of the -net alluded to in Remark 3.5.
Write for the standard unit vectors in . Let and be the unit vectors whose existence is proven in Lemma 3.6. We now define the centrally-symmetric convex body to be the convex hull of the vectors
[TABLE]
We write for the standard Gaussian measure in , whose density is
[TABLE]
We will use below the standard bound for all .
Lemma 3.7**.**
We have that , where is a universal constant.
Proof.
We will mimick an argument by Gluskin [7]. For a centrally-symmetric convex body we denote its polar body by
[TABLE]
Let be a standard Gaussian random vector in . According to the Khatri-Sidak lemma ([10], [23], see also [7] for a simple proof),
[TABLE]
Since is a standard Gaussian random variable, we know that
[TABLE]
Consequently,
[TABLE]
Recalling from (17) the values of our parameters, we obtain
[TABLE]
Since the density of the measure does not exceed , we conclude that
[TABLE]
The conclusion of the lemma now follows from the Santalo inequality (see e.g. [2, Theorem 1.3.4]).
Since while is convex and centrally-symmetric, we know that
[TABLE]
Recall that . By the Markov-Chebyshev inequality,
[TABLE]
Let us now define the probability measure to be the convolution
[TABLE]
where is the delta measure at the point . Then is a probability measure in .
Lemma 3.8**.**
.
Proof.
For any and , the convex body contains the set , according to (19). The measure is an average of translates of , each centered at a point of the form . Consequently,
[TABLE]
Write for the continuous density of the measure . Setting for , we have
[TABLE]
Note that for any and ,
[TABLE]
Lemma 3.9**.**
For any and ,
[TABLE]
Proof.
By (21) we have that
[TABLE]
Therefore, according to Lemma 3.6 and as ,
[TABLE]
completing the proof.
Proof of Theorem 1.3.
We set
[TABLE]
where is the function that equals one on and vanishes otherwise. Then is an even, continuous probability density supported on . According to Lemma 3.8,
[TABLE]
Therefore, from Lemma 3.9, for any and ,
[TABLE]
We also know that , according to Lemma 3.7. Therefore the desired estimate (2) follows from (22).
The left-hand side inequality in Theorem 1.1 clearly follows from Theorem 1.3. Note also that Theorem 1.3 entails the optimality, up to a factor of , of Corollary 1 from [19].
4 Measures admitting tail bounds
This section is devoted to the proof of Theorem 1.5, which is a modification of the proof of Theorem 1.3. We are given a dimension and . We may assume that as otherwise the conclusion of the theorem is trivial.
Lemma 4.1**.**
Let be a random vector, distributed uniformly over . Let be a fixed unit vector. Then,
[TABLE]
where are universal constants.
Proof.
Denote . As in the proof of Lemma 3.2, the density of in the interval is proportional to , where satisfies . We need to prove that
[TABLE]
The left-hand side inequality in (23) follows from
[TABLE]
As for the right-hand side inequality in (23), we argue as follows:
[TABLE]
Let us now introduce the parameter
[TABLE]
Let be independent random vectors, distributed uniformly in .
Lemma 4.2**.**
Assume that . Then with probability of at least of selecting the following holds: For all ,
[TABLE]
Here, are universal constants.
Proof.
The constant will be a sufficiently large universal constant whose value will be determined later on. Fix and set
[TABLE]
Then are independent, identically-distributed random variables attaining values in , with according to Lemma 4.1. By a standard estimate for the binomial distribution (see, e.g., [1, Chapter 2]),
[TABLE]
Consequently, for any fixed ,
[TABLE]
Next, set
[TABLE]
Then while according to Lemma 4.1. We may thus use Lemma 3.1 and conclude that for any fixed ,
[TABLE]
We now select the universal constant large enough so that the assumption implies
[TABLE]
where are the constants from (24) while is the constant from (25). Consider the functions
[TABLE]
Clearly is a -Lipschitz function, while for any ,
[TABLE]
where we used the elementary inequality with . Hence is an -Lipschitz function on . Set and let be a -net of cardinality
[TABLE]
From (24), (25) and (26), with probability of at least of selecting , for all ,
[TABLE]
Since is a -net, from (27) and the Lipschitz properties of and we obtain that with probability of at least , for all ,
[TABLE]
However, according to (26), while . Hence the conclusion of the lemma follows from (28).
We define the centrally-symmetric convex body to be the convex hull of the points
[TABLE]
where
[TABLE]
From now on in this paper, we write etc. for various positive constants that depend solely on .
Lemma 4.3**.**
Assume that . Then with probability one, , where depend solely on .
Proof.
As in the proof of Corollary 4.3, it suffices to show that . Let be a standard Gaussian random vector in , independent of the ’s. By the Khatri-Sidak lemma,
[TABLE]
However, where depends solely on . Moreover, assuming that for some depending on . Hence,
[TABLE]
where depends only on .
We define the probability measure to be the convolution where
[TABLE]
Lemma 4.4**.**
Assume that . Then with probability one, .
Proof.
Note that as . Consequently, the convex body contains the set for any . As in the proof of Lemma 3.8, the measure is a mixture of translates of , each centered at a point of the form . Therefore is at least which in turn is at least by a standard estimate.
Lemma 4.5**.**
Assume that . Then with probability of at least , the measure admits -tails with parameters . Here, depend only on .
Proof.
We will assume that the event described in Lemma 4.2 holds true, which happens with probability of at least . We need to show that for any , setting , we have
[TABLE]
Since the event described in Lemma 4.2 holds true, we know that for any ,
[TABLE]
Therefore,
[TABLE]
A standard application of the Markov-Chebyshev inequality based on (30), which appears e.g. in [2, Section 2.4], shows that for any and ,
[TABLE]
Since , we know that for any and ,
[TABLE]
Since , we deduce (29) from (31) and (32).
Write for the continuous density of the measure . Thus
[TABLE]
Lemma 4.6**.**
Assume that . Then with probability of at least the following holds: For any and ,
[TABLE]
where depend only on .
Proof.
We may assume that is large enough so that the assumption implies that . We may thus apply Proposition 13. According to the conclusion of this proposition, with probability of at least the following holds: For all and ,
[TABLE]
where we recall that depends solely on . Consequently, for all and we may use (21) and obtain
[TABLE]
It is well-known (see, e.g., [2, Section 2.4]) that if the probability measure admits -tails with parameters , then the following reverse Hölder inequality holds true: for any ,
[TABLE]
where depends only on and .
Proof of Theorem 1.5.
We may assume that , as otherwise the conclusion of the theorem is trivial. We may fix such that the events described in Lemma 4.3, Lemma 4.4, Lemma 4.5 and Lemma 4.6 hold true. Set
[TABLE]
an even, continuous probability density supported on . Note that , according to Lemma 4.4. From Lemma 4.6, for any and ,
[TABLE]
where the last passage is the content of Lemma 4.3. This completes the proof of (i).
By Lemma 4.5, the probability measure admits -tails with parameters . Write for the probability measure whose density is . According to Lemma 4.4 and the Cauchy-Schwartz inequality, for any ,
[TABLE]
where we used (34) in the last passage. Since , it thus follows from (35) that also has -tails with parameters . This completes the proof of (ii).
Appendix
In this appendix we indicate how Bourgain’s argument may be modified in order to prove (4). We may normalize and assume that is a probability measure. The first observation is that denoting , we have that for all ,
[TABLE]
where for . We will use inequality (36) in order to replace the hyperplane sections in (4) by second moments of the probability measure . Thus, in order to prove (4), it suffices to show that
[TABLE]
The next step is to reduce matters to the case where is isotropic, in the sense that the integral does not depend on . Indeed, there exists a volume-preserving linear transformation such that the push-forward is isotropic (see, e.g., [2, Section 2.3]). The replacement of by and of by does not alter the right-hand side of (37), while it does not decrease the left-hand side. Hence from now on we assume that does not depend on . In particular,
[TABLE]
From the Markov-Chebyshev inequality it thus follows that . As in the proof of Proposition 3.3.3 in [2], we may now use the -condition in order to conclude that
[TABLE]
where , like all constants in this Appendix, depends solely on and . The next step is “reduction to small diameter”, which means that in proving (37) we would like to reduce matters to the case where is isotropic with
[TABLE]
for some constant . The argument for this reduction in [2, Section 3.3.1], which involves conditioning to the ball , applies almost verbatim thanks to (38). We may thus assume that (39) holds true, or equivalently that for all and all in the support of the measure . Therefore,
[TABLE]
where the last inequality follows from the -condition and a suitable choice of the constant (see [2, Section 2.4] for standard computations related to the -condition). Inequality (40) implies that for any ,
[TABLE]
Once we proved the -estimate in (41), we may proceed as in the proof of Theorem 3.3.5 in [2], and use Talagrand’s comparison theorem, the -position of Figiel and Tomczak-Jaegermann, and Pisier’s estimate for the Rademacher projection. This establishes the desired inequality (37) in the isotropic case.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Boucheron, S., Lugosi, G., Massart, P., Concentration inequalities. A nonasymptotic theory of independence. With a foreword by Michel Ledoux. Oxford University Press, Oxford, 2013.
- 2[2] Brazitikos, S., Giannopoulos, A., Valettas, P., Vritsiou, B.-H., Geometry of isotropic convex bodies. Mathematical Surveys and Monographs, 196. American Mathematical Society, Providence, RI, 2014.
- 3[3] J. Bourgain, On high-dimensional maximal functions associated to convex bodies , Amer. J. Math., 108, (1986), 1467–-1476.
- 4[4] J. Bourgain, Geometry of Banach spaces and harmonic analysis , Proceedings of the International Congress of Mathematicians, Vol. 1, 2 (Berkeley, Calif., 1986), Amer. Math. Soc., Providence, RI, (1987), 871–-878.
- 5[5] J. Bourgain, On the distribution of polynomials on high-dimensional convex sets , Geom. aspects of Funct. Anal. (GAFA seminar notes), Israel Seminar, Springer Lect. Notes in Math. 1469 (1991), 127–137.
- 6[6] G. Chasapis, A. Giannopoulos and D-M. Liakopoulos, Estimates for measures of lower dimensional sections of convex bodies , Adv. Math. 306 (2017), 880–904.
- 7[7] A. Giannopoulos, On some vector balancing problems, Studia Math. 122 (1997), 225–234.
- 8[8] E. D. Gluskin, Extremal properties of orthogonal parallelepipeds and their applications to the geometry of Banach spaces, Mat. Sb. (N.S.) 136(178) (1988), no. 1, 85–96; English translation in Math. USSR-Sb. 64 (1989), no. 1, 85–-96.
