Empirical forms of the Petty projection inequality
Abstract
The Petty projection inequality is a fundamental affine isoperimetric principle for convex sets. It has shaped several directions of research in convex geometry which forged new connections between projection bodies, centroid bodies, and mixed volume inequalities. We establish several different empirical forms of the Petty projection inequality by re-examining these key relationships from a stochastic perspective. In particular, we derive sharp extremal inequalities for several multiple-entry functionals of random convex sets, including mixed projection bodies and mixed volumes.
Dedicated to the memory of Clinton Myers Petty, 1923–2021.
1 Introduction
1.1 The Petty projection inequality and its reach
Affine isoperimetric inequalities concern functionals on classes of sets in which ellipsoids play an extremal role. Typically such inequalities involve convex bodies, taken modulo affine (or linear) transformations, and are strictly stronger than their Euclidean counterparts. The standard isoperimetric inequality can be derived from several different affine strengthenings. Such affine inequalities have come to form an integral part of convex geometry and have been extensively investigated within Brunn-Minkowski theory; see the expository survey [22] and books [9, 34] for foundational work on this subject.
A fundamental example is the Petty projection inequality. Recall that the projection body of a convex body in is defined as follows: given a direction on the sphere , the support function of is the volume of orthogonal projection of onto (see §2 for precise definitions). We write for the polar of the projection body. Petty’s inequality states that among all convex bodies of the same volume, ellipsoids maximize the volume of the polar projection body. Formally, it can be stated as
(1) |
where is the centered Euclidean ball with radius chosen to satisfy . The polar projection operator satisfies for any volume-preserving affine transformation , which explains the use of ‘affine’ in this context.
Projection bodies are an important class of convex bodies in geometry and functional analysis [2, 3, 14, 35]. The volume of is related to the surface area via
where ; the latter follows directly from Cauchy’s formula and Hölder’s inequality (see [34, Remark 10.9.1]). Thus Petty’s inequality implies the classical isoperimetric inequality for convex sets. Up to normalization, the surface area is one of the quermassintegrals of , while the quantity is an affine quermassintegral of . Alexandrov’s inequalities state that among convex bodies of a given volume, all quermassintegrals are minimized on balls (see [34, §7.4]) . In a recent breakthrough [27], E. Milman and Yehudayoff proved that all affine quermassintegrals are minimized on ellipsoids, verifying a long-standing conjecture of Lutwak. This result establishes a family of affine inequalities that interpolate between the Petty projection inequality and the fundamental Blaschke-Santaló inequality for the volume of the polar body of . The latter is equalivalent to the affine isoperimetric inequality, see e.g., [22].
Petty originally built on work of Busemann concerning the expected volume of random simplices in convex bodies, and established what is known as the Busemann-Petty centroid inequality [30]. He connected the latter to projection bodies [31] by using an inequality about mixed volumes, known as Minkowski’s first inequality ([34, §7.2]), which asserts that
This idea was further developed by Lutwak and plays an important role in kindred inequalities (see [22]).
Since Petty’s seminal work in 1972, his inequality has been proven by a number of different methods, e.g., [22, 33, 26, 27]. Moreover, several generalizations of the inequality have been established. In particular, Lutwak, Yang and Zhang introduced and Orlicz versions of the projection body and proved the corresponding Petty inequalities [24, 25]. In [11, 1], a generalization to Minkowski valuations was obtained (see also [18] for a characterization of the projection body operator). Another generalization, established by Lutwak involves the notion of mixed projection bodies. Let be convex sets in . The support function of the mixed projection body in a direction is defined as the following mixed volume:
(2) |
where is the line segment joining the origin and . Lutwak established several inequalities for mixed projection bodies, one of which gives Petty’s projection inequality as a special case [19, Theorem 3.8]; namely,
(3) |
Recent active investigation around the notion of the projection body with respect to other measures and generalizations appear in [16, 15].
In this note we establish empirical versions of the Petty projection inequality and its generalizations for mixed projection bodies. The study of empirical versions of affine isoperimetric inequalities for centroid bodies and their -analogues was initiated by the first two authors in [28] and further developed in [6]. A number of inequalities in Brunn-Minkowski theory have been shown to have stronger empirical forms [29], but Petty’s projection inequality has eluded our previous efforts. Inspired by recent results of E. Milman and Yehudayoff [27], and also by the approach of Campi and Gronchi in [4], our work here is intended to fill this gap.
1.2 Empirical mixed projection body inequalities
Our main results concern randomly generated sets, obtained as linear images of a compact, convex set under an random matrix . Namely, we will consider sets of the form
where are independent random vectors distributed according to densities of continuous probability distributions on . We will write for the random matrix that has independent columns distributed according to , the symmetric decreasing rearrangement of (see § 2.3).
More generally, it will be convenient to work with matrices whose column vectors are grouped into blocks. Assume that is a collection of independent random vectors such that is distributed according to , , , where . For , we write , and form with blocks . We adopt a similar convention for , which consists of blocks , where are independent and distributed according to . For ease of reference, we summarize this notation in Table 1.
matrix with blocks | block, | columns with densities |
---|---|---|
With this notation, our first main result concerns mixed projection bodies of random sets generated by and .
Theorem 1.1
Let be compact convex sets such that for and let . Let and be random matrices with in Table 1. Then for any radial measure with a decreasing density,
A special case of central importance concerns the classical projection body operator. Taking and writing and , we have the following consequence.
Theorem 1.2
Let be a compact convex set in . Let and be random matrices with independent columns distributed according to and , respectively. Then for any radial measure with a decreasing density,
Theorem 1.2 extends the Petty projection inequality (1) in various ways. Indeed, let be a convex body in and let be independent random vectors drawn uniformly from . We denote their convex hull by
In matrix notation, we have , where and is the simplex . Thus if is Lebesgue measure, the above theorem states that
(4) |
Note that is not a ball and the above statement does not follow from Petty’s inequality. However, when , we get that , which implies , hence (1) follows from (4). The inequality that we get from Theorem 1.2 as can also be directly obtained by adapting the proof of Petty’s inequality in [27, Section 8.2].
More generally, let and be convex bodies in and assume that the columns of and are distributed according to and . For , we define and , we have
(5) |
where denotes -addition of sets (see § 2); in fact, we can accommodate more general -addition and Orlicz addition operations (see § 2). In a similar manner, Theorem 1.1 implies
(6) |
where we used the same notation as above. When is the Lebesgue measure, then (6) can be seen as a local version of (3) for natural families of random convex sets associated to .
Further specializing to the case when , we get a corollary for the mixed projection body of centroid bodies. Recall that the centroid body of a convex body in is defined by its support function via
The Busemann-Petty centroid inequality mentioned above is a sharp extremal inequality for the volume of , which heavily influenced affine isoperimetric principles [22] and the development of -Brunn–Minkowski theory [24, 25].
A stochastic notion of centroid bodies was developed in [28], which defines a random variant of as the body with support function
where are independent and identically distributed according to the normalized Lebesgue measure on . Our next result concerns mixed projection bodies of independent empirical centroid bodies whose support function is given by
Corollary 1.3
Let be convex bodies in and let be independent empirical centroid bodies. Then
We note that when ,
(7) |
where we use [34, eq. (5.81)]. Haddad recently established a family of isoperimetric inequalities for a new class of convex bodies [12] that are defined using similar determinantal expressions as in (7) and their -generalizations. Our work shows that such bodies arise naturally as limiting cases of mixed projection bodies of random sets in Theorem 1.1 when the ’s are chosen to be cubes.
1.3 Empirical mixed volume inequalities
We also present an alternate empirical version of Petty’s projection inequality. This approach is inspired by the proof of the inequality based on Busemann-Petty centroid inequality and Minkowski’s first inequality [22, 34]. We will use an empirical approximant of centroid bodies, defined as follows. For each convex body in , we use the notation ; this is nothing but the Minkowski sum of random segments , where are independent random vectors sampled according to , i.e.,
Note that . Using this notation with , we establish a sharp extremal inequality for the following quantity:
here we implicitly assume that the random vectors from and random vectors from are independent. With these notational conventions, we have the following theorem.
Theorem 1.4
Let be a convex body in and . Then
For the proof of Theorem 1.4 we first need to establish an empirical version of Minkowski’s first inequality which we believe is of independent interest. In fact, we establish a generalization of the latter, stated as follows.
Theorem 1.5
Let be compact convex sets such that , , and set . Let and be random matrices with in Table 1. Then
Consequently, for any ,
Theorem 1.4 follows directly from the latter theorem since
In each of Theorems 1.1, 1.4 and 1.5, we have used a single matrix with columns arranged in blocks according to Table 1, and multiple bodies . When the are all equal to a given compact convex set in , we have
and only the first block is involved in the expression; in particular, the block matrices in the above mixed entry functional are dependent. When the ’s are compact convex sets placed in consecutive orthogonal subspaces , then the use of independent blocks allows for distinct entries in
and all blocks of are used (and are independent). The block notation for also accommodates scenarios between these two extremes, where some of the ’s are repeated while others are taken in orthogonal subspaces.
Acknowledgements. We would like to thank Mark Rudelson and Franz Schuster for helpful discussions. The second and third authors are also grateful to ICERM for excellent working conditions, where they participated in the program “Harmonic Analysis and Convexity”.
Funding. The first-named author was supported by NSF grants DMS 1800633, CCF 1900881, DMS 2405441, Simons Foundation Fellowship #823432 and Simons Foundation Collaboration grant #964286. The second-named author was supported by NSF grant DMS-2105468 and Simons Foundation grant #635531. The third-named author was supported in part by NSERC Grant no 2022-02961.
2 Preliminaries
2.1 Convex bodies and mixed volumes
We work in Euclidean space and use for the -dimensional Lebesgue measure. The unit Euclidean ball in is , while the unit sphere is . We use to denote the orthogonal projection onto a subspace . We write for the -dimensional subspace of that is orthogonal to .
A convex body is a compact, convex set with non-empty interior. The set of all compact, convex sets is denoted by . We say that is origin-symmetric if . We also say that is 1-unconditional if is symmetric with respect to reflections in the standard coordinate hyperplanes.
The support function of is defined by
The polar body of an origin-symmetric convex body in is defined as . The gauge function (or Minkowski functional) of an origin-symmetric convex body is defined as . If contains the origin in its interior, then .
The Minkowski combination of is defined as
where The Minkowski theorem on volume of Minkowski combinations says that
The coefficient is the mixed volume of ; when the last body appears times, we write , where . For and , we write to denote the mixed volume of repeated times and repeated times.
If are convex bodies in and , then we write for the -dimenisonal mixed volume of in . It is known (see e.g. [34, p. 302]) that for ,
(8) |
where denotes the line segment connecting the origin and .
The projection body of a convex body is defined as the origin-symmetric convex body such that for all . It follows from (8) that for . We will denote the polar projection body by .
2.2 and -addition operations
We recall the notion of -addition of convex bodies from -Brunn–Minkowski theory, e.g. [8, 20, 23]. For containing the origin and , we will write for their -sum, i.e.,
(9) |
A general framework for addition of sets, called -addition, was developed by Gardner, Hug and Weil [10]. Let be an arbitrary subset of and define the -combination of arbitrary sets in by
If and , and are convex sets, then , i.e., is the usual Minkowski addition. If with , and and are origin-symmetric convex bodies, then , i.e., corresponds to -addition as in (9). More generally, let be convex, increasing in each argument, and , . Let and be origin-symmetric convex bodies and let , where . Then we define to be . In this way, -addition encompasses previous notions of Orlicz addition, e.g. [25].
2.3 Symmetrization of sets and functions
Let and . We define by
and by
Notice that and are convex functions.
The Steiner symmetral of a non-empty Borel set of finite measure with respect to , denoted here by , is constructed as follows: for each line orthogonal to such that is non-empty and measurable, the set is a closed segment with midpoint on and length equal to the one-dimensional measure of . In particular, if is a convex body
This shows that is convex, since the function is concave. Moreover, is symmetric with respect to , it is closed, and by Fubini’s theorem it has the same volume as .
For a Borel set with finite volume, the symmetric rearrangement of is the open Euclidean ball centered at the origin whose volume is equal to the volume of . The symmetric decreasing rearrangement of is defined as . It will be convenient to use the following bracket notation for indicator functions:
(11) |
Let be an integrable function. Its layer-cake representation is given by
(12) |
The symmetric decreasing rearrangement of is defined by
The function is radially-symmetric, radially decreasing and equimeasurable with , i.e. and have the same volume for each For integrable functions , the Steiner symmetral of with respect to is defined as follows:
In other words, we obtain by rearranging along every line parallel to . For more background on rearrangements, see [17].
3 Convexity and rearrangement inequalities
3.1 Shadow systems
Rogers–Shephard [32] and Shephard [36] systematized the use of Steiner symmetrization as a means of proving geometric inequalities with their introduction of linear parameter systems and shadow systems, respectively. A linear parameter system is a family of sets
(13) |
where and are bounded sets, and is an index set. For a unit vector and a convex body in , a shadow system is a family of sets of the form
where is the projection parallel to . Setting
where is a bounded function on , gives rise to the shadow system for ,
The choice of has the property that , while is the Steiner symmetral of about , and is the reflection of about . For background on linear parameter systems and shadow systems, we refer to [34, 4].
We will make essential use of the following fundamental theorem of Shephard
Theorem 3.1
Let be shadow systems in common direction . Then
is convex.
3.2 Analytic tools
A non-negative, non-identically zero function is called log-concave if is concave on . We note that if is a convex function, then the function is -concave. Also, is quasi-concave if for all the set is convex, and is quasi-convex if for all the set is convex.
The Prékopa–Leindler inequality states that for and functions such that for any
the following inequality holds
We will use the following consequence of the Prékopa–Leindler inequality: if is -concave, then
is a -concave function on ; see [13].
We also make use of Christ’s form [5] of the Rogers–Brascamp–Lieb–Lutinger inequality, see the survey [29] for the related inequalities, their applications and further references.
Theorem 3.2
Let be integrable functions and let . Suppose that satisfies the following condition: for any and for any , the function defined by is even and quasi-concave. Then
When each is even and quasi-convex, then the inequality in Theorem 3.2 is reversed.
For subsequent reference, we note that the theorem is proved by iterated Steiner symmetrization and the key step involves Steiner symmetrization as follows:
where is the Steiner symmetral of in direction .
4 Minimizing the mixed volume of random convex sets
The proof of Theorem 1.5 relies on Theorem 3.1 about the convexity of mixed volumes of shadow systems along a common direction. Here we show how this interfaces with the use of random linear operators.
Proof of Theorem 1.5. We start by associating a shadow system to linear images of convex sets. To fix the notation, let be a compact convex set in and let . We will attach a shadow system in direction to the set
Decompose as , where for . Let . For , we form the matrix
Fix and . Then for each ,
For , we write and so that
(14) |
As a linear image of the convex set , the latter is convex and hence takes the form of a linear parameter system in (13), which is indexed by and generated by the bounded sets and .
Similarly, assume we have compact convex sets and , where . For , let . For , we write and set
We first consider the case when are in mutually orthogonal subspaces, then and the quantity under consideration is
(15) |
As we will apply Theorem 3.2, it is sufficient to show that
is convex. We need only show that the function is convex on any line joining given points and in , i.e., we need only to establish convexity of
By the discussion at the beginning of this section, each argument in the mixed volume is a shadow system in the common direction . Therefore, we can apply Theorem 3.1 to obtain the required convexity in .
In the case are not necessarily mutually orthogonal, then share some common columns. The proof then applies verbatim but on a smaller product space. For example, in the case when all are identical, the mixed volume reduces to the volume and one works with
here the product space involves only the first random vectors. As Theorem 3.1 concerns any shadow systems (whether or not some are identical), it remains applicable in this case.
5 An empirical Petty projection inequality for measures
While Theorem 1.2 follows directly from Theorem 1.1, we will first prove the former for simplicity of exposition.
Proof of Theorem 1.2. We will first assume that is a rotationally invariant, log-concave measure on with density , i.e. . For and , let be the restriction of to the line that passes through parallel to . We note that since is a rotationally invariant, log-concave measure then is even and log-concave for any fixed .
Fix and . As in §4, we write . Using the notation for indicator functions (11), we have
(16) | |||||
(17) |
Fixed and set , and define
Note that is jointly convex in and . To see this, it is sufficient to show that, given any two points and in , the restriction of to the line segment is convex. Set
and observe that
Each of the arguments are shadow systems in a common direction as observed above. Thus the convexity of , and hence that of , follows from Theorem 3.1.
Using the joint convexity of in and , we have that is -concave. As is the marginal of -concave function on , it is also -concave by the Prekopa–Leinder inequality (see §2.3). In particular, is quasi-concave.
Next, we note that is an even function. Indeed, the sets and are reflections of one another with respect to , hence
where denotes the reflection with respect to . The rotational invariance of the density implies that is even in . Thus, by a change of variables, we have that is even
Thus for every and for every , the function is quasi-concave for every . We write
Applying the key step in the proof of Theorem 3.2 from §3.2, we obtain:
where has independent columns distributed according to the Steiner symmetrals . By iterated symmetrizations, we obtain
As the proof shows, Theorem 3.2 does not require densities to be identical. Hence, Theorem 1.2 holds under this less restrictive assumption.
Up to this point, we dealt with a log-concave measure . The above applies, in particular, to the case of the Lebesgue measure restricted to a centered Euclidean ball. Next, we can consider a measure such that
Using Fubini’s theorem, we have
where is a radius of an Euclidean ball which implies the result for any radial measure with a decreasing density .
Corollary 5.1
Let and be convex bodies in . Let be -unconditional and compact. Then for
If , with , then coincides with -addition as defined in §2.2. Thus the corollary immediately implies (5).
Proof. Let the columns of and be independent and distributed according to and , respectively. As in the introduction, and . Assuming and writing for the copy of lying in , we have
In this way the -addition operation coincides with the image of the convex body under . Similarly, we have
Thus Theorem 1.2 applies directly.
6 Mixed projection bodies
In this section, we prove Theorem 1.1. As the argument is similar to the proof given in § 5, we simply outline the additional steps.
Proof of Theorem 1.1. Let be a log-concave, rotationally invariant measure on with a density as in § 5. As in § 4, we start by assuming that lie in the mutually orthogonal subspaces.
Fix and such that for . Using notation in § 4, we write Thus, we have
(18) | |||||
For fixed , we define
and
Using the same reasoning as in Section 5, is jointly convex in and , and an even function. In particular, joint convexity implies that is -concave. Also, we have that is even, i.e., Therefore, for every and for every , the function is quasi-concave for every .
Repeating the same argument on as in §5, we get
and after iteration of the repeated symmetrization in suitable directions, we arrive at the following
Once again, when are non-mutually orthogonal, the argument applies verbatim on the smaller product space.
Finally, as above, the proof shows that densities need not be identical.
7 Laws of large numbers and convergence
In this section, we detail how one can obtain deterministic inequalities from our main stochastic inequalities. As in the introduction, the centroid body of a convex body in ,is defined by
Similarly, the empirical centroid body of is given by
where are independent and identically distributed according to the normalized Lebesgue measure on . Note that by the strong law of large numbers (as in e.g., [28]), we have convergence a.s. in the Hausdorff metric:
(19) |
Proposition 7.1
Let be a convex body in and . Then
(20) |
Proof. We have convergence a.s. in the Hausdorff metric
see, e.g., [7] for a stronger quantitative result on the rate of convergence. Similarly, by (19)
It follows that we have convergence a.s., as ,
Note that
where is the circumradius of and is the surface area of . By the bounded convergence theorem, we have as ,
Lastly, we show that Thereom 1.4 implies Petty’s projection inequality (1). Applying Theorem 1.4 as and using Proposition 7.1, we get
(21) |
Now we appeal to the fact that
where is a constant independent of ; see, e.g., [22], and compute the right-hand side of (21). For this, we first observe that (see [9, Corollary 9.1.4]). Then
where we used homogeneity of mixed volumes and for . Thus,
which implies (1).
Remark 7.2
References
- [1] Astrid Berg and Franz E. Schuster. Lutwak-Petty projection inequalities for Minkowski valuations and their duals. J. Math. Anal. Appl., 490(1):124190, 24, 2020.
- [2] Ethan D. Bolker. A class of convex bodies. Trans. Amer. Math. Soc., 145:323–345, 1969.
- [3] J. Bourgain and J. Lindenstrauss. Projection bodies. In Geometric aspects of functional analysis (1986/87), volume 1317 of Lecture Notes in Math., pages 250–270. Springer, Berlin, 1988.
- [4] Stefano Campi and Paolo Gronchi. Volume inequalities for sets associated with convex bodies. In Integral geometry and convexity, pages 1–15. World Sci. Publ., Hackensack, NJ, 2006.
- [5] Michael Christ. Estimates for the -plane transform. Indiana Univ. Math. J., 33(6):891–910, 1984.
- [6] Dario Cordero-Erausquin, Matthieu Fradelizi, Grigoris Paouris, and Peter Pivovarov. Volume of the polar of random sets and shadow systems. Math. Ann., 362(3-4):1305–1325, 2015.
- [7] Lutz Dümbgen and Günther Walther. Rates of convergence for random approximations of convex sets. Adv. in Appl. Probab., 28(2):384–393, 1996.
- [8] Wm. J. Firey. -means of convex bodies. Math. Scand., 10:17–24, 1962.
- [9] Richard J. Gardner. Geometric tomography, volume 58 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, New York, second edition, 2006.
- [10] Richard J. Gardner, Daniel Hug, and Wolfgang Weil. Operations between sets in geometry. J. Eur. Math. Soc. (JEMS), 15(6):2297–2352, 2013.
- [11] Christoph Haberl and Franz E. Schuster. Affine vs. Euclidean isoperimetric inequalities. Adv. Math., 356:106811, 26, 2019.
- [12] J. Haddad. A convex body associated to the Busemann random simplex inequality and the Petty conjecture. J. Funct. Anal., 281(7):Paper No. 109118, 28, 2021.
- [13] Marek Kanter. Unimodality and dominance for symmetric random vectors. Trans. Amer. Math. Soc., 229:65–85, 1977.
- [14] Alexander Koldobsky. Fourier analysis in convex geometry, volume 116 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2005.
- [15] Dylan Langharst, Eli Putterman, Michael Roysdon, and Deping Ye. On higher-order extensions of the weighted projection body operator.
- [16] Dylan Langharst, Michael Roysdon, and Artem Zvavitch. General measure extensions of projection bodies. Proc. Lond. Math. Soc. (3), 125(5):1083–1129, 2022.
- [17] Elliott H. Lieb and Michael Loss. Analysis, volume 14 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, second edition, 2001.
- [18] Monika Ludwig. Projection bodies and valuations. Adv. Math., 172(2):158–168, 2002.
- [19] Erwin Lutwak. Mixed projection inequalities. Trans. Amer. Math. Soc., 287(1):91–105, 1985.
- [20] Erwin Lutwak. The Brunn-Minkowski-Firey theory. I. Mixed volumes and the Minkowski problem. J. Differential Geom., 38(1):131–150, 1993.
- [21] Erwin Lutwak. Inequalities for mixed projection bodies. Trans. Amer. Math. Soc., 339(2):901–916, 1993.
- [22] Erwin Lutwak. Selected affine isoperimetric inequalities. In Handbook of convex geometry, Vol. A, B, pages 151–176. North-Holland, Amsterdam, 1993.
- [23] Erwin Lutwak. The Brunn-Minkowski-Firey theory. II. Affine and geominimal surface areas. Adv. Math., 118(2):244–294, 1996.
- [24] Erwin Lutwak, Deane Yang, and Gaoyong Zhang. affine isoperimetric inequalities. J. Differential Geom., 56(1):111–132, 2000.
- [25] Erwin Lutwak, Deane Yang, and Gaoyong Zhang. Orlicz projection bodies. Adv. Math., 223(1):220–242, 2010.
- [26] E. Makai, Jr. and H. Martini. The cross-section body, plane sections of convex bodies and approximation of convex bodies. I. Geom. Dedicata, 63(3):267–296, 1996.
- [27] Emanuel Milman and Amir Yehudayoff. Sharp isoperimetric inequalities for affine quermassintegrals. J. Amer. Math. Soc., 36(4):1061–1101, 2023.
- [28] Grigoris Paouris and Peter Pivovarov. A probabilistic take on isoperimetric-type inequalities. Adv. Math., 230(3):1402–1422, 2012.
- [29] Grigoris Paouris and Peter Pivovarov. Randomized isoperimetric inequalities. In Convexity and concentration, volume 161 of IMA Vol. Math. Appl., pages 391–425. Springer, New York, 2017.
- [30] C. M. Petty. Centroid surfaces. Pacific J. Math., 11:1535–1547, 1961.
- [31] C. M. Petty. Isoperimetric problems. In Proceedings of the Conference on Convexity and Combinatorial Geometry (Univ. Oklahoma, Norman, Okla., 1971), pages 26–41. University of Oklahoma, Department of Mathematics, Norman, OK, 1971.
- [32] C. A. Rogers and G. C. Shephard. Some extremal problems for convex bodies. Mathematika, 5:93–102, 1958.
- [33] Michael Schmuckenschläger. Petty’s projection inequality and Santalo’s affine isoperimetric inequality. Geom. Dedicata, 57(3):285–295, 1995.
- [34] Rolf Schneider. Convex bodies: the Brunn-Minkowski theory, volume 151 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, expanded edition, 2014.
- [35] Rolf Schneider and Wolfgang Weil. Zonoids and related topics. In Convexity and its applications, pages 296–317. Birkhäuser, Basel, 1983.
- [36] G. C. Shephard. Shadow systems of convex sets. Israel J. Math., 2:229–236, 1964.
G. Paouris, Department of Mathematics, Texas A&M University, College Station, Texas, 77843-3368, USA
Department of Mathematics, Princeton University, Fine Hall, 304 Washington Road, Princeton, NJ, 08540, USA
Email address: [email protected]
P. Pivovarov, Mathematics Department, University of Missouri, Columbia, Missouri, 65211, USA
Email address: [email protected]
K. Tatarko, Department of Pure Mathematics, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Email address: [email protected]