Asymptotic estimates for the largest volume ratio of a convex body
Daniel Galicer, Mariano Merzbacher, Dami\'an Pinasco

TL;DR
This paper establishes a sharp lower bound for the largest volume ratio of convex bodies in n-dimensional space, showing it grows at least as fast as a constant times the square root of n, and explores its asymptotic behavior for specific classes.
Contribution
The paper improves the lower bound for the largest volume ratio of convex bodies from order \\sqrt{n/\\log \\log n} to a sharp constant times \\sqrt{n}, and analyzes its asymptotic behavior for natural classes of convex bodies.
Findings
The largest volume ratio \\lvr(K) \\geq c \\sqrt{n} for all convex bodies K.
\\lvr(K) behaves as the square root of the dimension for unitary invariant norm balls.
\\lvr(K) also behaves as the square root of the dimension for certain tensor product bodies.
Abstract
The largest volume ratio of given convex body is defined as where the runs over all the convex bodies . We prove the following sharp lower bound for every body (where is an absolute constant). This result improves the former best known lower bound, of order . We also study the exact asymptotic behavior of the largest volume ratio for some natural classes. In particular, we show that behaves as the square root of the dimension of the ambient space in the following cases: if is the unit ball of an unitary invariant norm in (e.g., the unit ball of the -Schatten class for any ), is the the unit ball of the full/symmetric tensor…
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.
Asymptotic estimates for the largest volume ratio of a convex body
Daniel Galicer
Departamento de Matemática - IMAS-CONICET, Facultad de Cs. Exactas y Naturales Pab. I, Universidad de Buenos Aires (1428) Buenos Aires, Argentina
,
Mariano Merzbacher
Departamento de Matemática - IMAS-CONICET, Facultad de Cs. Exactas y Naturales Pab. I, Universidad de Buenos Aires (1428) Buenos Aires, Argentina
and
Damián Pinasco
Departamento de Matemáticas y Estadística, Universidad T. Di Tella, Av. Figueroa Alcorta 7350 (1428), Buenos Aires, Argentina and CONICET
Abstract.
The largest volume ratio of given convex body is defined as
[TABLE]
where the runs over all the convex bodies . We prove the following sharp lower bound
[TABLE]
for every body (where is an absolute constant). This result improves the former best known lower bound, of order .
We also study the exact asymptotic behavior of the largest volume ratio for some natural classes. In particular, we show that behaves as the square root of the dimension of the ambient space in the following cases: if is the unit ball of an unitary invariant norm in (e.g., the unit ball of the -Schatten class for any ), is the the unit ball of the full/symmetric tensor product of -spaces endowed with the projective or injective norm or is unconditional.
Key words and phrases:
Volume Ratio, Random Polytopes, Unconditional Convex Bodies, Schatten Classes
2010 Mathematics Subject Classification:
52A23, 52A38, 52A40 (primary); 52A21, 52A20, 47B10 (secondary)
The second author was supported by a CONICET doctoral fellowship. This was partially supported by CONICET PIP 11220130100329, CONICET PIP 11220090100624, ANPCyT PICT 2015-2299
1. Introduction
For many applications in asymptotic geometric analysis, convex geometry or even optimization it is useful to approximate a given convex body by another one. For example, the classical Rogers-Shephard inequality [1, Theorem 1.5.2] states that, for a convex body , the volume of the difference body is “comparable” with the volume of . Precisely, where stands for the -dimensional Lebesgue measure. Rogers and Shephard also showed, with the additional assumption that has barycenter at the origin, that the intersection body has “large” volume. Namely, . These inequalities imply that any given body is enclosed by (or contains) a symmetric body whose volume is “small” (“large”) enough. In many cases this allows us to take advantage of the symmetry of the difference body (or the intersection body) to conclude something about .
Another interesting example of Milman and Pajor [27, Section 3] shows that
[TABLE]
where stands for the isotropic constant of (see [5, Section 2.3.1]) and is an absolute constant. Therefore, having a good approximation of by an unconditional convex body provides structural geometric information of .
Perhaps the most notable application of these kind of approximations can be viewed when studying John/Löwner ellipsoid (maximum/minimum volume ellipsoid respectively). For example, if the Euclidean ball is the maximal volume ellipsoid inside , we can decompose the identity as a linear combination of rank-one operators defined by contact points [1, Theorem 2.1.10]. This decomposition plays a key role in the study of distances between bodies, see [33] for a complete treatment on this. We also refer to [26, 18, 17, 23, 24, 28] for many nice results/applications which involve these extremal ellipsoids. A natural quantity that relates a given body with its ellipsoid of maximal volume is given by the “standard” volume ratio
[TABLE]
Using the Brascamp-Lieb inequality, Ball showed that is maximal when is a simplex . The extreme case, among all the centrally symmetric convex bodies, is given by the cube (see [1, Theorem 2.4.8]).
A natural generalization of this ratio is given by the following definition introduced by Giannopoulos and Hartzoulaki [11] and also studied by Gordon, Litvak, Meyer and Pajor [13]: given two convex bodies and in the volume ratio of the pair is defined as
[TABLE]
where the infimum (actually a minimum) is taken over all affine transformations . In other words, measures how well can be approximated by an affine image of . Note that the classic value is just where is the Euclidean unit ball in .
Given a convex body , it is natural to ask how “good” an approximation of this kind can be (in terms of the dimension of the ambient space). Namely, we want to known how large the value is (for arbitrary convex bodies ). Thus, it is important to compute the largest volume ratio of , given by
[TABLE]
where the runs over all the convex bodies .
Khrabrov (based on the well-known construction due to Gluskin [14] used to understand the diameter of Minkowski compactum), showed in [19, Theorem 5] the following:
For any convex body in there is another body such that
[TABLE]
where is an absolute constant. The body is found using the probabilistic method (Khrabrov considered a random polytope whose vertices are sampled on the unit sphere and showed that, with high probability, it verifies Equation (4)).
On the other hand, it is very easy to see that for every pair . Using Chevet’s inequality together with clever positions of and , Giannopoulos and Hartzoulaki [11] were able to prove the following important and stronger result:
Let and be two convex bodies in . Then
[TABLE]
where is an absolute constant.
Combining the results of Khravrov and Giannopoulos-Hartzoulaki, i.e., Equations (4) and (5), we get:
For any convex body in , its largest volume ratio verifies
[TABLE]
The well known result of John [1, Theorem 2.1.3] asserts that for any convex body we have . It is not difficult to see that where stands for the unit ball of thus,
[TABLE]
In [15, Theorem 1.3] the authors of this article showed that any convex body can be inscribed in a simplex such that , where is an absolute constant. In other words, if is a simplex then , for every convex body . Since the regular simplex is the minimal volume simplex that contains the Euclidean unit ball (see [15, Example 2.7]), by computing volumes we have . Therefore, for a simplex , we know the exact asymptotic behaviour of its largest volume ratio:
[TABLE]
Therefore the largest volume ratio of a convex body, in many cases, behaves as the square root of the dimension (of the ambient space).
We prove the following lower bound, that substantially improves (4).
Theorem 1.1**.**
For any convex body in there is another body such that
[TABLE]
where is an absolute constant. In other words,
[TABLE]
Moreover, we show that there are “many” (with high probability) random polytopes which verify equation (6). As we saw before in the previous examples, this lower bound cannot be improved in general.
To obtain Theorem 1.1 we make some important changes in Khravrov’s proof, which require finer estimates, and use some approximation arguments.
We also deal, for same natural classes of convex bodies, with the upper bounds. Our results are of probabilistic nature, so we will be interested in obtaining bounds with high probability.
First we treat the case of the Schatten trace classes, the non-commutative version of the classical sequence spaces. They consist of all compact operators on a Hilbert space for which the sequence of their singular values belongs to . Many different properties of them in the finite dimensional setting have been largely studied in the area of asymptotic geometric analysis. For example, Köning, Meyer and Pajor [21] established the boundedness of the isotropic constants of the unit balls of (), Guédon and Paouris [16] also studied concentration mass properties for the unit balls, Barthe and Cordero-Eurasquin [3] analyzed variance estimates, Radke and Vritsiou [32] proved the thin-shell conjecture, and recently Kabluchko, Prochno and Thäle [22] exhibited the exact asymptotic behaviour of the volume and standard volume ratio; just to mention a few.
Therefore it is natural to try to understand what happens with the largest volume ratio of their unit ball. The following theorem provides an answer to this query.
Theorem 1.2**.**
Let and be the -Schatten class. The largest volume ratio of its unit ball, , behaves as
[TABLE]
Moreover, we show that this also holds for the unit ball of any unitary invariant norm in (which follows from Theorem 1.1 and Corollary 4.5 below).
Our approach is based on Giannopoulos-Hartzoulaki’s techniques. We show that if is an arbitrary body then with “high probability” we can find transformations such that and
[TABLE]
We also study the largest volume ratio for the unit ball of full or symmetric tensor products of -spaces endowed with the well-known projective and injective tensor norms. Note that these spaces are identified with bounded/nuclear linear forms or homogeneous polynomials over -spaces. We obtain the following.
Theorem 1.3**.**
Let and or . Then we have
[TABLE]
where stands for the dimension of as a vector space.
Recall that a convex body is called unconditional if for every choice of signs , the vector lies in if and only if is in . We also study the asymptotic behaviour of the largest volume ratio for unconditional bodies.
Theorem 1.4**.**
Let be an unconditional convex body. Then,
[TABLE]
The fact that if is unconditional might be known for experts (although, as far as we know, is not explicitly stated elsewhere) and is a consequence of a mixture of the existence of Dvoretzky-Rogers’ parallelepiped and a result of Bobkov-Nazarov. As a result of a theorem of Pivovarov, we present a random version of Dvoretzky-Rogers’ parallelepiped construction (which we believe is interesting in its own right) and show that, if is unconditional and is an arbitrary body, then with “high probability” we can find transformations such that and
[TABLE]
where stands for the isotropic constant of the polar body .
2. Preliminaries
If and are two sequences of real numbers we write if there exists an absolute constant (independent of ) such that for every . We write if and . We denote by the canonical vector basis in and by , the unit sphere in . We denote by the absolute convex hull of the vectors . That is,
[TABLE]
A convex body is a compact convex set with non-empty interior. If is centrally symmetric (i.e., ) we denote by the norm space that has as its unit ball.
The polar set of , denoted by , is defined as
[TABLE]
The following result relates the volume of a body with the volume of it polar and is due to Blaschke-Santaló and Bourgain-Milman [1, Theorem 1.5.10 and Theorem 8.2.2]: If is centrally symmetric then
[TABLE]
A probability measure on is isotropic if its center of mass is the origin
[TABLE]
and
[TABLE]
A convex body is said to be in isotropic position (or simply, is isotropic) if it has volume one and its uniform measure is, up to an appropriate re-scaling, isotropic. In that case, its isotropic constant , is given by
[TABLE]
Given a convex body in with center of mass at the origin, there exists such that is isotropic [1, Proposition 10.1.3]. Moreover, this isotropic image is unique up to orthogonal transformations; consequently, the isotropic constant results an invariant of the linear class of . In some sense, the isotropic constant measures the spread of a convex body .
For a centrally symmetric convex body , its -norm is defined as
[TABLE]
where is the standard Gaussian probability in . For more information about this parameter see [33, Chapter 12]. Recall that where stands for the mean width (see [1, Chapter 1.5.5]).
Given a convex body , is the set of isometries of , that is set of orthogonal transformations such that . We say that has enough symmetries if the only operator that commutes with every is the identity operator. A convex body with enough symmetries is almost in John position [2, Proposition 4.8]. More precisely, is the maximal volume ellipsoid contained in . That means that if has enough symmetries then
[TABLE]
Natural examples of convex bodies with enough symmetries are the unit balls of the Schatten classes. Given a matrix consider the sequence of eigenvalues of (the singular values of ). The -Schatten norm of is defined as
[TABLE]
that is, the -norm of the singular values of . The -Schatten norm arises as a generalization of the classical Hilbert-Schmidt norm. The analysis of the Schatten norm has a long tradition in local Banach space theory and their properties are widely studied. We denote by the unit ball of .
We now review the basics definitions regarding tensor products. We refer to [7, 10] for a complete treatment on the subject. Given a normed space we write for the -fold tensor product of , and for the symmetric -fold tensor product, that is, the subspace of consisting of all tensor that can be written as , where and . Observe that if has dimension , and . Since we consider as a fixed number, we have that in both cases the dimension of the space behaves like for large.
There are many norms than can be defined on the tensor product, we will focus on two of them. The projective tensor norm is defined as
[TABLE]
where the infimum is taken over all representations of , . The injective tensor norm is defined as
[TABLE]
where the supremum runs over all and is a fixed representation of . Let or , we write for -fold product endowed with the norm .
In the same way we can define the corresponding projective and injective norms in the symmetric setting. The symmetric projective norm is given by
[TABLE]
where the infimum is taken over all the representation of of the form .
The symmetric injective norm is computed as follows,
[TABLE]
where is a fixed representation of .
We now recall some basic properties of the volume ratio defined in Equation (3) which can easily be found in [19].
Remark 2.1**.**
For every pair of centrally symmetric convex bodies in the following holds:
- (1)
[TABLE]
where the infimum runs all over the linear transformations that lie on the special linear group of degree (matrices of determinant one). 2. (2)
. 3. (3)
If is a linear operator we have that and so
[TABLE] 4. (4)
* for every convex body in .* 5. (5)
, for any affine transformations and . In other words, the volume ratio between and depends exclusively on the affine classes of the bodies involved.
Notice that by Rogers-Shephards inequality, for every convex body we have . Therefore, by the last property
[TABLE]
Thus, the largest volume ratio of the body can be estimated by considering the supremum over all symmetric bodies. Precisely,
[TABLE]
where the runs over all the centrally symmetric convex bodies . This will be useful since it allow us to deal only with bodies which are centrally symmetric.
3. Lower bound for the largest volume ratio
We now treat lower bounds for the largest volume ratio of a given convex body . Recall the statement of Remark 2.1 (1),
[TABLE]
Therefore, to show “good” lower bounds for we need a body such that its volume is “small” and the norm is large for every operator .
The key idea of [19] is to use the probabilistic method. Namely, Khrabrov considered the random body (based on Gluskin’s work [14])
[TABLE]
where are independent vectors distributed according to the normalized Haar measure in .
Note that as grows, becomes larger but decreases, so there is some sort of trade-off.
It should be noted that the volume of the random polytope is bounded by (see [4])
[TABLE]
In fact, this bound is the exact asymptotic growth of with probability greater than or equal to [5, Chapter 11].
In [19], for , it is shown that, with high probability, the norm is “large” for every . To achieve all this he proved the following interesting inequality:
If is in Löwner position then for very and every ,
[TABLE]
In order to prove our main contribution, Theorem 1.1, we present the following refinement of the previous estimate.
Proposition 3.1**.**
Let be a centrally symmetric convex body and the random polytope defined in (16), then for every we have
[TABLE]
To prove Proposition 3.1 we need a couple of lemmas. The first one is a technical tool which bounds the number of points in an -net for an adequate set. This should be compared with [19, Lemma 5]: note that the set and the metric differ. This subtle but important modification is the key ingredient we need.
Lemma 3.2**.**
Let be a convex body, and
[TABLE]
There is a -net, for in the metric such that
[TABLE]
Proof.
Let be the unit ball of . By the standard identification we consider and as subsets of . Let be a maximal collection of elements of -separated. These elements form an -net and, for every , the balls are disjoints. Since
[TABLE]
we have that and then
[TABLE]
Computing the volume on both sides, we get the following bound for ,
[TABLE]
Now notice that
[TABLE]
and hence
[TABLE]
In order to bound Equation (19) we need a lower bound for . By passing to spherical coordinates it can be checked that
[TABLE]
where is the normalized Haar measure on . Now we apply Hölder’s inequality to get
[TABLE]
Therefore,
[TABLE]
By comparing spherical and Gaussian means and applying Gaussian Chevet’s inequality [33, Equations (12.7),(43.1)], we have that
[TABLE]
which implies
[TABLE]
Now notice that since we have that,
[TABLE]
and hence . Recalling that we get,
[TABLE]
Thus,
[TABLE]
Using Equations (21) and (24) in Equation (19) we get the desired bound. ∎
We also need the following result.
Lemma 3.3** ([33], Lemma 38.3).**
Let be a convex body, the random polytope in (16), and . Then
[TABLE]
We present the proof of Proposition 3.1.
Proof of Proposition 3.1.
Let and be the polytope in (16) such that there exists with . As , lies in the set defined in Lemma 3.2. Consider a -net, for for the metric such that
[TABLE]
Let such that , then
[TABLE]
where we have used the fact that since by construction . Hence,
[TABLE]
Take , by the union bound, Equation (26) and Lemma 3.3
[TABLE]
which concludes the proof. ∎
As a consequence of Proposition 3.1 we obtain the following result.
Proposition 3.4**.**
Let be a centrally symmetric convex body such that
[TABLE]
Given , with probability greater than or equal to the random polytope in (16) verifies
[TABLE]
In particular, .
Proof.
By Proposition 3.1 we know that there is an absolute constant such that, for every ,
[TABLE]
If and , then with probability at least the random polytope verifies
[TABLE]
for every .
Hence, by Equations (17) and (28) and Remark 2.1 (1) we have
[TABLE]
which concludes the proof. ∎
In order to prove Theorem 3.1 we will show that any given convex body can be approximated by another one which fulfils the hypothesis of the previous proposition. To do this we use Klartag’s solution to the isomorphic slicing problem (which asserts that, given any convex body, we can find another convex body, with absolutely bounded isotropic constant, that is geometrically close to the first one).
Theorem 3.5** ([20], Theorem 1.1 ).**
Let be a convex body and let . Then there is a convex body such that
- (1)
, 2. (2)
.
Here is an absolute constant and
[TABLE]
Remark 3.6**.**
Given a convex body there is a convex body such that and , where is an absolute constant.
Indeed, given , by Theorem 3.5 (using ) there is with and . Notice that if for certain and we have that . Then,
[TABLE]
Hence , and by symmetry, the same holds for .
Proposition 3.7**.**
For every convex body there is a convex body with such that
[TABLE]
Proof of Proposition 3.7.
By Remark 3.6 and the Roger-Shephard inequality (replacing the body if necessary) we can assume that is a centrally symmetric isotropic convex body and is uniformly bounded.
By Markov’s inequality we have that
[TABLE]
for some absolute constant .
Consider such that , then and hence .
Since we have that
[TABLE]
Finally, as , we have that (applying the Blaschke-Santaló / Bourgain-Milman inequality, Equation (11)). Therefore
[TABLE]
which concludes the proof. ∎
As pointed out by A. Giannopoulos and A. Litvak [12], an alternative proof of the last proposition can be obtained by using the -position, which seems a more natural approach.
The -position was discovered by Milman in relation with the reverse Brunn-Minkowski inequality. We refer the reader to [1, Chapter 8] for a very nice treatment on this topic.
A convex body is in -position with constant if letting have the same volume as , i.e. , we have
[TABLE]
for every convex body . Milman proved that there is an absolute constant such that for every centrally symmetric convex body there is an transformation such that is in -position with constant .
Alternative proof of Proposition 3.7.
We can suppose that is a centrally symmetric body in -position. By Equation (30) the convex body
[TABLE]
satisfies that and therefore . On the other hand, since , we have that .
Hence,
[TABLE]
as wanted. ∎
The following theorem contains, as a consequence, Theorem 1.1.
Theorem 3.8**.**
Let be convex body. Given , with probability greater than or equal to the random polytope in (16) verifies
[TABLE]
In particular, .
Proof.
By Proposition 3.7 there is with such that
[TABLE]
Applying Proposition 3.4, given , with probability greater than or equal to the random polytope in (16) verifies
[TABLE]
Then,
[TABLE]
as wanted. ∎
Corollary 3.9**.**
Let be a convex body. Given , there is polytope with facets such that
[TABLE]
Proof.
The result follows from the previous theorem, Remark 2.1 (2) and the fact that the polar of the polytope has facets. ∎
4. Upper bounds
We now provide upper estimates for for different classes of convex bodies. Together with this inequalities we derive sharp asymptotic estimates. It should be mentioned that, to bound , Giannopoulos and Hartzoulaki [17] managed to find randomly a unitary operator with small norm. To do this, they used Chevet’s inequality for an adequate position of . To our purposes we will use the following high probability version of the Gaussian Chevet’s inequality (tail inequality).
Proposition 4.1**.**
Let be a random matrix with independent gaussian entries and two convex bodies. Then, for all , with probability greater than we have
[TABLE]
Although the previous proposition is probably known for specialist we were not able to find an explicit reference of it (the closest statement we found is [34, Exercise 8.7.3]). We include a sketch of its proof for completeness.
Sketch of the proof of Proposition 4.1.
We define in the distance
[TABLE]
where stands for the Euclidean norm.
Consider the random process in given by
[TABLE]
It is not hard to see that this process is subgaussian for (see the proof of [34, Theorem 8.7.1]); i.e.,
[TABLE]
Note that if we consider the Gaussian process
[TABLE]
where , and are independent standard Gaussian variables; we have
[TABLE]
Combining the generic chaining (tail bound) [34, Theorem 8.5.5] and Talagrand’s majorizing measure theorem [34, Theorem 8.6.1] we get
[TABLE]
with probability at least .
The result follows by the fact that
[TABLE]
and . ∎
Given a convex body we need to introduce a position highly related with the well-known -position. It has been introduced by Rudelson in [31] and its existence can be also tracked in the proof of the main theorem of the paper of Giannopoulos and Hartzoulaki [11], who used this position together with Chevet’s inequality to bound the volume ratio.
Proposition 4.2**.**
Given a convex body there is position of , that satisfies:
- •
,
- •
,
- •
.
In particular,
[TABLE]
When a convex body in satisfies the previous estimates we say it is in Rudelson position.
First we will show how Rudelson’s position together with Chevet’s inequality can be used to bound the largest volume ratio for some natural classes of convex bodies. Observe that, by Remark 2.1 (3), bounding simultaneously the determinant (from bellow) and the norm (from above) of an operator gives a bound for the volume ratio. We will also need the following lower bound for the determinant of a random Gaussian matrix, which can be found in [29, Corollary 1].
Lemma 4.3**.**
Let with , then with probability at least we have
[TABLE]
Combining the last inequality together with Proposition 4.4, we can ensure that for any , with probability greater than , a random Gaussian operator fulfils both, , and
[TABLE]
for any pair of convex bodies .
Assume that is in Rudelson’s position. Now combining equations (34) and Remark 2.1 (3), we have that and
[TABLE]
with probability greater on equal to .
In the following we are going to use the previous relations to bound the volume ratio for some classes of convex body.
4.1. Unitary invariant norms
Recall that unitary invariant norm on , that is a norm that satisfies for all (the group of distance-preserving linear transformations of a Euclidean space of dimension ). The norm is one of the most important unitary invariant operator norms. It is known that for any unitary invariant norm there is a symmetric norm such that for every
[TABLE]
Assume that and set . By [5, Equation (4.3.6)]
[TABLE]
Taking volumes we have that
[TABLE]
As [5, Lemma 4.3.2], we conclude that
[TABLE]
Theorem 4.4**.**
Let be the unit ball of any unitary invariant norm in and a convex body in Rudelson position, and let be a random matrix with independent Gaussian entries . Then with probability greater than , the body and also
[TABLE]
As a consequence of Theorem 1.1, the previous result and Remark 2.1 (5) we obtain the following corollary.
Corollary 4.5**.**
Let be the unit ball of any unitary invariant norm in . Then,
[TABLE]
Proof of Theorem 4.4.
Note that by [5, Lemma 4.3.2] we know that and also by [2, Excercise 7.24] , hence On the other hand, since has enough symmetries; by Equation (13) and by [2, Excercise 7.24] (see also [22]) we know that
[TABLE]
Using the fact that is in Rudelson’s position, by Equation (35) with , and , we have that , and
[TABLE]
with probability greater than .
By Equation (37),
[TABLE]
As we obtain the desired bound. ∎
4.2. Tensor products
Another natural class of convex bodies for which we can obtain sharp asymptotic bounds for the largest volume ratio are the unit balls of tensor products of -spaces endowed with the projective or injective tensor norm.
In order to do prove Theorem 1.3, we need to have estimates of some geometrical parameters of the involved spaces. Defant and Prengel [8] obtained asymptotic estimates for many of them. We summarize their results in the next proposition.
Proposition 4.6**.**
For set and . For each we have
- (1)
** 2. (2)
** 3. (3)
** 4. (4)
** 5. (5)
** 6. (6)
**
All the proofs can be found in [8]. The comparison between the full and symmetric tensor products follows from [8, Proposition 3.1]. The estimates (1) and (2) are in [8, Theorem 4.2]. For (3) and (4) see [8, Lemma 4.3]. The proof of (5) follows form the fact that
[TABLE]
For (6) the result is stated in [8, Lemma 5.2].
In particular, for every space involved in the last proposition, we have
[TABLE]
Fix an arbitrary body in Rudelson position. If , and is a random Gaussian matrix, we have by equation (35)
[TABLE]
with probability greater than . Now, if we take for example, with , we have that
[TABLE]
So, taking , we get It can be checked that in all cases, . So, choosing we have that with high probability
Arguing analogously for the other cases we obtain Theorem 1.3. Note that in fact we have obtained a high probability version of this theorem (a statement similar to Theorem 4.4).
Tensor products can be identified naturally with multilinear forms or homogeneous polynomials.
From now we assume that is a finite dimensional space. The space of bounded -linear forms on , endowed with the usual supremum norm, will be denoted by . Note that the tensor coincides with the space of -linear operators defined on .
Recall that an operator is -nuclear if can be written as
[TABLE]
with and . We can define the following norm on the space of all -nuclear operators
[TABLE]
where infimum is taken over all representation of as above. We denote this space by .
The space of all -nuclear operators on , , can be identified with .
The tensor products and can be represented as spaces of polynomials. Recall that a function is said to be an -homogeneous polynomial if there is an -linear form such that . We write for the set of -homogeneous polynomials on . If we define in the norm, the space is isometric to .
An -homogeneous polynomial is said to be nuclear if it can be written as
[TABLE]
where , and . We write for the space of nuclear polynomials endowed with the norm
[TABLE]
where the infimum is taken over all representations of as above. Note that the space is isometrically isomorphic to .
Using these identifications and Theorem 1.3 we have the following corollary.
Corollary 4.7**.**
Let and either or . Then we have
[TABLE]
where stands for the dimension of as a vector space.
4.3. Largest volume ratio for unconditional convex bodies and random Dvoretzky-Rogers’ parallelepiped
Let be an unconditional convex body in and be a centrally symmetric convex body; the following statement shows a way to find positions of (say ), with extremely high probability, verifying , with ratio bounded by .
Theorem 4.8**.**
Let be a centrally symmetric convex body such that is in isotropic position and consider the random matrix , where are independently chosen accordingly to the uniform measure in the isotropic body . With probability greater than or equal to , for every unconditional isotropic body , the position lies inside and
[TABLE]
Note that as a direct consequence of Theorem 1.1, the previous theorem and Equation (15) we have
[TABLE]
for every unconditional body (an unconditional body is isotropic and unconditional up to a diagonal operator), which shows the upper estimates in Theorem 1.4.
Recall the following result of Bobkov and Nazarov [6, Proposition 2.4 and Proposition 2.5] (see also [25] or [5, Proposition 4.2.4]), which asserts that the normalized -ball (-ball) in is the largest set (smallest set) within the class of all unconditional isotropic bodies (up to some universal constants).
Proposition 4.9**.**
[6, Proposition 2.4 and Proposition 2.5]** Let be an unconditional isotropic convex body. Then,
[TABLE]
where and stand for the unit balls of and respectively.
It should be noted that (42) can be obtained by a direct use of a classical result of Dvoretzky and Rogers. Indeed, given a centrally symmetric convex body , by [9, Theorem 5A] (see also [30]) there is a centrally symmetric parallelepiped such that
[TABLE]
for some absolute constant . Thus, by Remark 2.1 (5), If is an unconditional body, by Proposition 4.9 we have . By Remark 2.1 (4) we obtain
[TABLE]
Observe that, in general, understanding how the parallelepiped in Equation (44) looks like seems difficult (its construction depends on certain contact points when is in John position, which are not easy to find explicitly), thus Theorem 4.8 seems much stronger since it provides a random algorithm that works with high probability.
We therefore state the following probabilistic construction of the Dvoretzky-Rogers’ parallelepiped, which can be derived from a result of Pivovarov. Note that Theorem 4.8 is a direct consequence of the next theorem together with the first inclusion of Proposition 4.9.
Theorem 4.10**.**
Let be a centrally symmetric convex body such that is in isotropic position and consider the random matrix , where are independently chosen accordingly to the uniform measure in the isotropic body . With probability greater than or equal to , the parallelepiped contains and
[TABLE]
Proof.
By [29, Proposition 1] we know that
[TABLE]
On the other hand since for all and we have that , where .
Thus, , or equivalently and the ratio
[TABLE]
Therefore, by Equations (47) and (46) and taking into account that (which comes by applying the Blaschke-Santaló/Bourgain-Milman inequality, Equation (11), since ) we have, with probability greater than or equal to ,
[TABLE]
which concludes the proof. ∎
We finish the article with a consequence of Theorem 4.8.
Corollary 4.11**.**
For every centrally symmetric convex body we have
[TABLE]
This seems to be an improvement of the well-known inequality [5, Proposition 3.5.13]
[TABLE]
Indeed, by Equation (1) we known that
[TABLE]
but in general can be larger than : according to Theorem 3.8 and [5, Theorem 4.4.1] there is a polytope which verifies
[TABLE]
In Corollary 4.11, at least at first instance, one should be tempted to change by , where the infimum run all over unconditional convex bodies; but using Proposition 4.9, it can be seen that
[TABLE]
4.4. Acknowledgement
The authors are grateful to Apostolos Giannopoulos and Alexander Litvak for pointing out the alternative proof of Proposition 3.7 which uses the -position.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Shiri Artstein-Avidan, Apostolos Giannopoulos, and Vitali Milman. Asymptotic Geometric Analysis, Part I , volume 202. American Mathematical Soc., 2015.
- 2[2] Guillaume Aubrun and Stanisław Szarek. Alice and Bob meet Banach. Mathematical Surveys and Monographs , 223, 2017.
- 3[3] Franck Barthe and Dario Cordero-Erausquin. Invariances in variance estimates. Proceedings of the London Mathematical Society , 106(1):33–64, 2013.
- 4[4] Imre Bárány and Zoltán Füredi. Approximation of the sphere by polytopes having few vertices. Proceedings of the American Mathematical Society , 102(3):651–659, 1988.
- 5[5] Silouanos Brazitikos, Apostolos Giannopoulos, Petros Valettas, and Beatrice-Helen Vritsiou. Geometry of isotropic convex bodies , volume 196. American Mathematical Society Providence, 2014.
- 6[6] Sergey G Bobkov and Fedor L Nazarov. On convex bodies and log-concave probability measures with unconditional basis. In Geometric aspects of functional analysis , pages 53–69. Springer, 2003.
- 7[7] Andreas Defant and Klaus Floret. Tensor norms and operator ideals , volume 176. Elsevier, 1992.
- 8[8] Andreas Defant and Christopher Prengel. Volume estimates in spaces of homogeneous polynomials. Mathematische Zeitschrift , 261(4):909, 2009.
