Functional Covering Numbers
Shiri Artstein-Avidan, Boaz A. Slomka

TL;DR
This paper introduces and analyzes covering and separation numbers for functions, establishing their properties, exact equalities for certain classes, and geometric inequalities, including strong M-position results for geometric log-concave functions.
Contribution
It defines new function-based covering and separation numbers, explores their properties, and extends geometric inequalities to these concepts, providing new insights into log-concave functions.
Findings
Exact equality of separation and covering numbers for some function classes
Analogues of geometric inequalities for covering numbers
Strong versions of M-positions for geometric log-concave functions
Abstract
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric inequalities on covering numbers, such as volume bounds, bounds connected with Hadwiger's conjecture, and inequalities about M-positions for geometric log-concave functions. In particular, we obtain strong versions of M-positions for geometric log-concave functions.
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.
Functional Covering Numbers
Shiri Artstein-Avidan and Boaz A. Slomka
Abstract
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric inequalities on covering numbers, such as volume bounds, bounds connected with Hadwiger’s conjecture, and inequalities about -positions for geometric log-concave functions. In particular, we obtain strong versions of -positions for geometric log-concave functions.
Keywords: Covering numbers, functionalization of geometry, log-concave functions, duality, volume bounds, -position.
2010 Mathematics Subject Classification: 52C17, 52A23, 46A20.
1 Introduction
1.1 Background and Motivation
Covering numbers can be found in various fields of mathematics, including combinatorics, probability, analysis and geometry. They participate in the solution of many problems in a natural manner, see the book [2, Chapter 4] and references therein. Loosely speaking, their use can be seen as follows: When working with a set, or a body, and considering some monotone property of it (such as volume, say) one can sometimes replace the original body with the union of simpler bodies (say balls), to obtain bounds on the needed quantity. To this end, one computes the least number of balls of a certain radius needed to cover the original set, this is called a covering number, see (1.1) below for the formal definition.
The fact that geometric notions and inequalities have analytic counterparts is considered folklore in the theory of asymptotic convex geometry. This fashion of “functionalization" started in the 90s and has proven to be very fruitful, see [20]. Since covering numbers play a considerable part in the theory of convex geometry, their extension to the realm of log-concave functions is an essential building block for this theory.
The first step towards this end was given in [6] and in [7], where the weighted notions of covering and separation numbers of convex bodies were introduced and the relations between these and the classical notions of covering and separation were investigated.
In this note we define functional covering and separation numbers, and discuss in detail their basic properties. We then show duality between the two notions, which is a nontrivial example of infinite dimensional linear programming duality. In the second part of the note we discuss some more advanced results on functional covering numbers. These include volume bounds of various types, geometric duality results in the form of König and Milman, and results regarding the -position of functions. Sudakov-type estimates for functional covering numbers will appear in [24]. We consider the notions introduced here to be both novel and natural, and believe that they will soon become an innate part of the theory of Asymptotic Geometric Analysis.
1.2 Definitions
1.2.1 Functional covering numbers
Given three measurable functions we define the -covering number of by
[TABLE]
The infimum is taken over all non-negative Borel measures on . Each which satisfies , that is,
[TABLE]
is called a “covering measure" of by . In the case of we thus infimize the total mass of a covering measure of by . For general we infimize a different quantity, namely the integral of with respect to . It is useful to note that the choice of does not influence the set of covering measures. We shall call the functional covering number of by , and the -covering number of by .
One may define variants of this notion when the set of measures over which one takes the infimum is chosen differently. For example, if one allows only atomic measures of the form , then for functions which are indicators of convex sets, and one recovers the usual definition of covering number
[TABLE]
If one lets equal to on and outside of , one recovers , that is, the classical covering number variant when the cover centers are forced to lie inside . Another natural set of measures to discuss is that of discrete measures, namely weighted sums where . These were the ones considered in [6] and discussed in [7], again for weight function .
1.2.2 Functional separation numbers
Similarly, we extend the notion of separation numbers, which is a dual notion to that of covering, to the functional setting. Given three measurable functions we define the -separation number of by
[TABLE]
The supremum is taken over all non-negative Borel measures on . Each which satisfies , that is,
[TABLE]
is called a “separation measure" of with respect to . An interesting case here is when is the indicator of some (say, convex) set and then one supremizes the total weight of a separation measure (of with respect to which is supported on . When then no mass is allowed outside of and this corresponds to the notion of “packing”. We shall call the functional separation number of by , and the -separation number of by .
Again one may define variants of this notion when the set of measures over which one takes the supremum is chosen differently. For example, if one allows only atomic measures of the form , then for functions which are indicators of convex sets, and one recovers the usual definition of separation number
[TABLE]
1.3 Main Results
1.3.1 Duality between covering and separation
As in the case of convex bodies and classical theory, covering and separation numbers are intimately related. In fact, the relation is more exact in the functional setting, and our first main result is an equality between the two, under certain conditions on the functions involved. Define for a function .
The inequality M^{h}\mathopen{}\mathclose{{}\left(f,g_{-}}\right)\leq N^{h}\mathopen{}\mathclose{{}\left(f,g}\right) is particularly simple, and is valid for any three measurable functions , see Proposition 3.1 below. In the language of linear programming, this is called “weak duality". When there is equality in this inequality, we say there is “strong duality", adopting the language of linear programming. Our first main result is a strong duality between functional covering and separation numbers under certain conditions on the functions. Some of these conditions can later be removed. Removing these conditions is usually quite technical. Our first result is concerns the space C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) of continuous real valued functions on which vanish at infinity.
Theorem 1.1**.**
Let 0\neq f,g,h\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Suppose that is compactly supported. Then
[TABLE]
Moreover, there exists a -separated measure such that \int fd\rho=M^{h}\mathopen{}\mathclose{{}\left(f,g_{-}}\right).
Theorem 1.1 follows from the fact that the numbers and can be interpreted as the outcomes of two dual problems in the sense of linear programming, and is a direct consequence of [9, Theorem 7.2], a zero gap result for linear programming duality in a very general setting of ordered topological vector spaces.
The case where (which is not in ) is of particular importance, and we establish a strong duality relation in this case as well:
Theorem 1.2**.**
Let 0\neq f,g\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) and assume that there exists a finite regular Borel measure which covers by . Then
[TABLE]
Moreover, there exists a covering measure of by , such that \mu_{0}(\mathbb{R}^{n})=N^{1}\mathopen{}\mathclose{{}\left(f,g}\right).
The proof of Theorem 1.2 is based on a variation of [9, Theorem 7.2]. For the convenience of the reader, we state and prove a single linear programming duality result from which both Theorems 1.1 and 1.2 follow. This result is given as Theorem 3.3 in Section 3. We also prove the following two extensions of Theorems 1.1 and 1.2, obtained via limiting arguments.
Theorem 1.3**.**
Let 0\neq f,g,h\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Suppose that , and N^{h}\mathopen{}\mathclose{{}\left(f,g}\right)<\infty. Then
[TABLE]
Theorem 1.4**.**
Let be measurable. Suppose that \mathopen{}\mathclose{{}\left(g_{k}}\right)\subseteq C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) is a non-increasing sequence converging point-wise to , and that N^{1}\mathopen{}\mathclose{{}\left(f,g}\right)<\infty. Then M^{1}\mathopen{}\mathclose{{}\left(f,g_{-}}\right)=N^{1}\mathopen{}\mathclose{{}\left(f,g}\right)=\lim N^{1}\mathopen{}\mathclose{{}\left(f,g_{k}}\right). Moreover, there exists a covering measure of by such that \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=N^{1}\mathopen{}\mathclose{{}\left(f,g}\right).
Finally, in the case most relevant for convex geometry, namely that of and where and are geometric log-concave functions, we have again a strong duality result. More precisely, let denote the class of functions which are upper semi continuous, is convex, and . These are called geometric log-concave functions and play a central role in convex geometry and its functional extensions. The following theorem holds, and its proof will appear in [24].
Theorem 1.5**.**
Let f,g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Then .
1.3.2 Volume estimates
A main tool in estimating classical covering numbers are so called “volume bounds”, where the covering numbers are bounded from above and from below by ratios of volumes. We provide two such bounds, for geometric log-concave functions, where volume is replaced by integral. We use to denote usual convolution as above, and use to denote the sup-convolution operation, defined by (and sometimes playing the role of Minkowski addition in the functionalization of convex geometry). We show
Theorem 1.6**.**
Let , then
[TABLE]
and for every
[TABLE]
1.3.3 Functional -position
We provide a covering-number definition for the -position of a convex body, and show that it is equivalent to a volume-type definition in the spirit of Klartag and Milman [15]. We show that there exists a universal constant such that every geometric log-concave function has an -position with constant , and as a result get some extensions of the functional reverse Brunn-Minkowski inequality of Klartag and Milman, in particular to the non-even case. Denoting by the gaussian we show
Theorem 1.7**.**
There exists a universal constant , and for any and any function there exists , such that denoting we have that and the following properties hold:
[TABLE]
and, for every
[TABLE]
and
[TABLE]
Here we denoted for its log-Legendre dual by where {\cal L}\varphi(y)=\sup\mathopen{}\mathclose{{}\left(\langle y,\,x\rangle-\varphi(x)}\right) is the Legendre transform. As a tool in the proof of this theorem, but also of independent interest, we give a König-Milman [16] type result connecting the covering of by and the covering of by which are their log-Legendre duals. We show that there exists a universal (independent of dimension) such that for any and any we have
[TABLE]
The paper is organized as follows. In Section 2 we gather the basic identities and simple inequalities for functional covering numbers, both for use in this paper and a for future reference. In Section 3 we prove Theorems 1.1 up to 1.4. To this end we start with a weak duality result, then prove an infinite dimensional linear programing duality result, which serves as the main ingredient in the proofs. In Section 4 we prove the volume bounds described above. In Section 5 we discuss Hadwiger’s conjecture, we show it is valid in the functional setting for even functions, and provide some bound for the general case. Finally, in Section 6 we define functional -position in two different ways, one via volume and the other via covering, and show that they are equivalent. We then prove a König-Milman type geometric duality result, connecting the covering of by and that of their Legendre duals. Finally, we give two proofs that every centered geometric log-concave function admits a functional -position with a universal constant . One proof using the functional reverse Brunn-Minkowski inequality of Klartag and Milman, and the other following directly from the geometric theorem of Milman on the existence of -positions for bodies.
Acknowledgments
The first named author was supported by ISF grant number 665/15.
2 Basic identities and inequalities
Since this note is the first time the functional covering numbers and the functional separation numbers are introduced, we devote a section to pointing out some of the useful properties of these numbers. The proofs for most of the facts below follow directly from the definitions and are thus omitted. We leave only the ones which are slightly less self-evident.
Linear transformations
Fact 2.1**.**
Define for and , then for measurable functions one has that
[TABLE]
Fact 2.2**.**
Define for and , then for measurable functions one has that
[TABLE]
Fact 2.3**.**
For measurable functions and positive constants one has that
[TABLE]
Sub-additivity
Fact 2.4**.**
For measurable functions one has N\mathopen{}\mathclose{{}\left(f_{1}+f_{2},g,h}\right)\leq N\mathopen{}\mathclose{{}\left(f_{1},g,h}\right)+N\mathopen{}\mathclose{{}\left(f_{2},g,h}\right).
Fact 2.5**.**
For measurable functions one has N\mathopen{}\mathclose{{}\left(f,g,h_{1}+h_{2}}\right)\leq N\mathopen{}\mathclose{{}\left(f,g,h_{1}}\right)+N\mathopen{}\mathclose{{}\left(f,g,h_{2}}\right).
Monotonicity
Fact 2.6**.**
For measurable functions such that , and one has that
[TABLE]
Convolutions
Two types of convolutions are often used for log-concave functions (in fact, there are more, but we restrict to these two for simplicity of the exposition). The first is the standard convolution of functions given by
[TABLE]
which can be defined also for measures by
[TABLE]
This convolution is a very standard operation in analysis. It follows from functional Brunn-Minkowski theory, the Prekopa-Leindler inequality, that the convolution of two log-concave functions is again log-concave.
The second type of convolution we shall need is the so-called sup-convolution or Asplund product, given by
[TABLE]
This operation is sometimes considered in Asymptotic Geometric Analysis as a functional analogue of Minkowski addition for convex bodies. For an account of which operation should be considered as the “natural” analogue of Minkowski addition the reader is referred to [20] and the many references therein.
Let us describe the monotonicity properties of covering numbers with respect to such convolutions.
Fact 2.7**.**
Let be measurable then
[TABLE]
Proof.
Indeed, if is a covering measure of by , then for any non-negative we have that covers by . So, we are infimizing the same linear function on a larger set as there may be other covering measures of by . For the second inequality, note that any for which , will also satisfy that , so we are supremizing the same linear functional on a larger set (as there may be other separation measures of by ). Thus the supremum of the latter is greater than or equal to the former. ∎
Fact 2.8**.**
Let be measurable then
[TABLE]
Proof.
Indeed, if is a covering measure of by , that is, , then for any non-negative we have that covers by . So, when computing we are infimizing over a set which contains for any which is a covering measure of by . In particular, this infimum will be less that or equal to the following number, whenever is a covering measure of by :
[TABLE]
Therefore, if we choose to infimize the linear functional coming from over all covering measures of by , we shall get a greater (than or equal to) result than when we infimize integration with respect to on the set of all covering measure of by .
Similarly, note that any for which , will also satisfy that , so that is a separation measure of with respect to whenever is a separation measure of with respect to . When we compute and take supremum over all which are separation measures with respect to we are going to get a smaller (than or equal to) result, since there may be more separation measures with respect to , not coming from separation measures with respect to which were convolved with . ∎
Next, we give a similar monotonicity result with respect to sup-convolution, analogous to the inequality for classical covering numbers.
Fact 2.9**.**
Let be measurable then .
Proof.
We shall use the easily verified fact that for any three functions
[TABLE]
(and the corresponding fact for measures). Indeed,
[TABLE]
Therefore if is a covering measure of by (that is, ) then is also a covering measure of by , from which this fact follows. ∎
Sub-Multiplicativity
The next few results require an additional assumption on the weight functions associated with the covering number N\mathopen{}\mathclose{{}\left(f,g,h}\right). We will assume that h\mathopen{}\mathclose{{}\left(x+y}\right)\leq h_{1}\mathopen{}\mathclose{{}\left(x}\right)h_{2}\mathopen{}\mathclose{{}\left(y}\right) for the measurable functions used. The log-sub-additive case of a single weight function such that satisfies is of particular interest, and in particular the case where is included.
The following inequality is an analogue of N\mathopen{}\mathclose{{}\left(A,B}\right)\leq N\mathopen{}\mathclose{{}\left(A,C}\right)N\mathopen{}\mathclose{{}\left(C,B}\right) for convex bodies.
Fact 2.10**.**
Let be measurable and assume that h\mathopen{}\mathclose{{}\left(x+y}\right)\leq h_{1}\mathopen{}\mathclose{{}\left(x}\right)h_{2}\mathopen{}\mathclose{{}\left(y}\right) for all . Then
[TABLE]
Proof.
Indeed, if is a covering measure of by and is a covering measure of by then
[TABLE]
and
[TABLE]
By infimizing over all covering measures and we get . ∎
The next result is a functional analogue for N\mathopen{}\mathclose{{}\left(A+B,C+D}\right)\leq N\mathopen{}\mathclose{{}\left(A,C}\right)N\mathopen{}\mathclose{{}\left(B,D}\right).
Fact 2.11**.**
Let be measurable and assume that h\mathopen{}\mathclose{{}\left(x+y}\right)\leq h_{1}\mathopen{}\mathclose{{}\left(x}\right)h_{2}\mathopen{}\mathclose{{}\left(y}\right) for all . Then
[TABLE]
Remark 2.12*.*
Note that Fact 2.11 implies Fact 2.9 under the assumptions that h\mathopen{}\mathclose{{}\left(x+y}\right)\leq h\mathopen{}\mathclose{{}\left(x}\right)h\mathopen{}\mathclose{{}\left(y}\right) and h\mathopen{}\mathclose{{}\left(0}\right)=1. Indeed, is a covering measure of by and hence , from which it follows that
[TABLE]
Note that if \min_{x}h\mathopen{}\mathclose{{}\left(x}\right)=h\mathopen{}\mathclose{{}\left(0}\right) one actually has N\mathopen{}\mathclose{{}\left(\varphi,\varphi,h}\right)=h\mathopen{}\mathclose{{}\left(0}\right) as for any covering measure of by itself, and which follows by integrating the inequality .
Proof of Fact 2.11.
Indeed, as in the proof of Fact 2.9, we know that if is a covering measure for by then so that also
[TABLE]
Hence is a covering measure of by . If is a covering measure of by , then , and hence
[TABLE]
so that is a covering measure of by . Therefore
[TABLE]
∎
Interestingly, a similar result holds when sup-convolution is replaced by usual convolution:
Fact 2.13**.**
Let be measurable and assume that h\mathopen{}\mathclose{{}\left(x+y}\right)\leq h_{1}\mathopen{}\mathclose{{}\left(x}\right)h_{2}\mathopen{}\mathclose{{}\left(y}\right) for all . Then
[TABLE]
Proof.
Indeed, let be a covering measure of by , so that and let be a covering measure of by so that , then
[TABLE]
so that is a covering measure of by . Thus
[TABLE]
which means that N\mathopen{}\mathclose{{}\left(\varphi*f,\psi*g,h}\right)\leq N\mathopen{}\mathclose{{}\left(f,g,h_{1}}\right)N\mathopen{}\mathclose{{}\left(\varphi,\psi,h_{2}}\right) as claimed. ∎
3 Duality between covering and separation
In this section we show results of the form for different classes of functions, and under various conditions on . We prove Theorems 1.1 through 1.4.
3.1 Weak duality
A relatively simple fact is the following.
Proposition 3.1**.**
Let f,g,h\in\mathbb{R}^{n}\to\mathopen{}\mathclose{{}\left[0,\infty}\right) be measurable. Then M^{h}\mathopen{}\mathclose{{}\left(f,g_{-}}\right)\leq N^{h}\mathopen{}\mathclose{{}\left(f,g}\right).
Proof.
Let be a covering measure of by . Let be a -separated measure with respect to . By our assumptions we have that and . Thus Tonelli’s theorem implies that
[TABLE]
and so M^{h}\mathopen{}\mathclose{{}\left(f,g_{-}}\right)\leq N^{h}\mathopen{}\mathclose{{}\left(f,g}\right). ∎
In the sequel we shall make extensive use of the following
Remark 3.2*.*
Note that the inequality above (weak duality relation) holds for any covering and any separating measures. Therefore, any reverse inequality between covering and separation, even when the infimum and supremum are taken over a smaller family of measures, would imply equality (namely a strong duality relation) without any restriction on the measures.
3.2 Strong duality
In this section we prove Theorems 1.1, 1.2, 1.3, and 1.4. The main ingredient of the proofs is Theorem 3.3; an infinite dimensional linear programming duality result which is a simple variation of [9, Theorem 7.2]. In order to state and prove this result, we need to introduce some notation and to recall some facts.
We shall work with the space of finite countably additive regular Borel measures on endowed with the norm topology of total variation. It is a well known fact that \mathcal{M}=C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{*}, namely it is the space dual to C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) endowed with the supremum norm topology. In the sequel, we will always assume that all covering and separation measures in the definitions of N\mathopen{}\mathclose{{}\left(f,g,h}\right),M\mathopen{}\mathclose{{}\left(f,g,h}\right) are restricted to . This is a technical restriction under which we will be able to establish a strong duality relation between covering and separation numbers. By Remark 3.2, once strong duality is established under such a restriction, it also holds without this restriction.
There is a natural duality on \mathcal{M}\times C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) defined by for each and f\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). For , consider the linear functions taking a measure to the functions \mu*g\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) and \mu*g_{-}\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). In the following proofs we will use the fact that these linear functions are adjoint, namely for all . Indeed, this fact follows by Tonnelli’s theorem as
[TABLE]
We endow the spaces and C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\oplus\mathbb{R} with the usual topology of the direct sum. Fixing and which is measurable and bounded, we define the linear transformation A:\mathcal{M}\oplus C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\to C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\oplus\mathbb{R} by A\mathopen{}\mathclose{{}\left(\mu,\varphi}\right)=\mathopen{}\mathclose{{}\left(\mu*g-\varphi,\int_{\mathbb{R}^{n}}h\,d\mu}\right), and consider the image
[TABLE]
of the positive cone K=\mathcal{M}^{+}\times C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{+} .
Theorem 3.3**.**
Let g,f\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right), and let be a bounded continuous function. Suppose that A\mathopen{}\mathclose{{}\left(K}\right) is closed, and that there exists a measure such that . Then N\mathopen{}\mathclose{{}\left(f,g,h}\right)=M\mathopen{}\mathclose{{}\left(f,g_{-},h}\right). Moreover, there exists an optimal covering measure such that and \int hd\mu_{0}=N\mathopen{}\mathclose{{}\left(f,g,h}\right).
The fact that and are non-negative functions is not actually used in the proof of Theorem 3.3 (although non-negativity is assumed in the definitions of covering and separation, one can remove this restriction for the sake of this argument). We may therefore apply the theorem to the functions and instead. Note that by definition N\mathopen{}\mathclose{{}\left(-f,-g,-h}\right)=-M\mathopen{}\mathclose{{}\left(h,g,f}\right), and M\mathopen{}\mathclose{{}\left(-f,-g_{-},-h}\right)=-N\mathopen{}\mathclose{{}\left(h,g_{-},f}\right). We thus get:
Theorem 3.4**.**
Let g,h\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right), and let be a bounded continuous function. Suppose
[TABLE]
is closed, and that there exists a measure such that . Then N\mathopen{}\mathclose{{}\left(f,g_{-},h}\right)=M\mathopen{}\mathclose{{}\left(f,g,h}\right). Moreover, there exists an optimal -separated measure such that and \int hd\rho=M\mathopen{}\mathclose{{}\left(f,g,h}\right).
Before we prove Theorem 3.3, let us show how Theorems 1.1, 1.3, and 1.2 follow. We begin with the proof of Theorem 1.1, for which we need the following lemma.
Lemma 3.5**.**
Let 0\neq g\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) be non-negative, let be bounded, and let be measurable with compact support. Then there exists C\mathopen{}\mathclose{{}\left(f,g,h}\right)>0 such that for any measure satisfying , there exists a measure so that , , and \widetilde{\rho}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\leq C.
Proof.
Denote the support of by . Since is continuous, there exists and a ball such that g\mathopen{}\mathclose{{}\left(x}\right)\geq a for all . Since is bounded, there exist such that K\subseteq\bigcup_{i=1}^{N}\mathopen{}\mathclose{{}\left(x_{i}+B}\right). Thus, for each and every measure which is -separated with respect to , we have that for any
[TABLE]
and so \rho\mathopen{}\mathclose{{}\left(x_{i}+B}\right)\leq\sup_{\mathbb{R}^{n}}h/a which implies that \rho\mathopen{}\mathclose{{}\left(K}\right)\leq N\,\sup_{\mathbb{R}^{n}}h/a=:C. Since is supported in , the measure defined by \widetilde{\rho}\mathopen{}\mathclose{{}\left(A}\right)=\rho\mathopen{}\mathclose{{}\left(A\cap K}\right) is a -separated measure with respect to , that satisfies both and \widetilde{\rho}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\leq C, as required. ∎
Proof of Theorem 1.1.
In order to invoke Theorem 3.4, we need to show that two conditions are satisfied. The first is the existence of a a measure such that , for which we may simply take . The second condition is that
[TABLE]
is closed. Indeed, take a sequence which converges to \psi\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{+} and . For sufficiently large , we have that . Hence, by Lemma 3.5, there exists a uniformly bounded sequence \mathopen{}\mathclose{{}\left(\widetilde{\rho}_{k}}\right) such that and . By the Banach-Alaoglu theorem, we may assume without loss of generality that converges in the weak* topology to some measure . In particular, since is continuous, \widetilde{\rho}_{k}*g\to\widetilde{\rho}*g\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) point-wise. Since , it follows that
[TABLE]
Hence, B\mathopen{}\mathclose{{}\left(\widetilde{\rho},\psi-\widetilde{\rho}*g}\right)=\mathopen{}\mathclose{{}\left(\psi,\alpha}\right)\in B\mathopen{}\mathclose{{}\left(K}\right), which means that B\mathopen{}\mathclose{{}\left(K}\right) is closed. ∎
Next we prove Theorem 1.2.
Proof of Theorem 1.2.
Here , we have , and we would like to show that the conditions of Theorem 3.3 hold. Suppose that A\mathopen{}\mathclose{{}\left(K}\right)\ni\mathopen{}\mathclose{{}\left(\psi_{k},\alpha_{k}}\right)\to\mathopen{}\mathclose{{}\left(\psi,\alpha}\right)\in\mathopen{}\mathclose{{}\left(C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{+},\mathbb{R}^{+}}\right). This means that there exists a sequence \mathopen{}\mathclose{{}\left(\mu_{k}}\right) in and a sequence \mathopen{}\mathclose{{}\left(\varphi_{k}}\right) in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{+} such that and \mu_{k}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\,\to\alpha. By the Banach-Alaoglu theorem we may assume without loss of generality that converges in the weak* topology to some measure . In particular, since is continuous, point-wise and so converges to some continuous function . Clearly, we also have \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\leq\alpha. If \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=\alpha, then \mathopen{}\mathclose{{}\left(\psi,\alpha}\right)\in A\mathopen{}\mathclose{{}\left(K}\right) as needed. Suppose that \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)<\alpha. The case \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=0 cannot occur as , hence c\cdot\mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=\alpha for some . The measure defined by \widetilde{\mu}\mathopen{}\mathclose{{}\left(B}\right)=c\cdot\mu\mathopen{}\mathclose{{}\left(B}\right), and the function \widetilde{\varphi}=\varphi+\mathopen{}\mathclose{{}\left(c-1}\right)\mu*g\in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)^{+}, thus satisfy that and \widetilde{\mu}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=\alpha, which means that \mathopen{}\mathclose{{}\left(\psi,\alpha}\right)\in A\mathopen{}\mathclose{{}\left(K}\right) and A\mathopen{}\mathclose{{}\left(K}\right) is closed.
Since N\mathopen{}\mathclose{{}\left(f,g}\right)<\infty means that there exist some covering measure of by , we may apply Theorem 3.3 to complete the proof. ∎
Next, we prove Theorems 1.3 and 1.4.
Proof of Theorem 1.3.
Let \mathopen{}\mathclose{{}\left(f_{k}}\right) be a non-decreasing sequence of compactly supported functions in C_{0}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right), which converges to in norm, that is \sup_{x}\mathopen{}\mathclose{{}\left|f\mathopen{}\mathclose{{}\left(x}\right)-f_{n}\mathopen{}\mathclose{{}\left(x}\right)}\right|\to 0. By Proposition 3.1,
[TABLE]
By Theorem 1.1 we have that M\mathopen{}\mathclose{{}\left(f_{k},g_{-},h}\right)=N\mathopen{}\mathclose{{}\left(f_{k},g,h}\right). Moreover, we clearly have that
[TABLE]
and therefore it is sufficient to show that \lim_{k}N\mathopen{}\mathclose{{}\left(f_{k},g,h}\right)\geq N\mathopen{}\mathclose{{}\left(f,g,h}\right). Indeed, N\mathopen{}\mathclose{{}\left(f_{k},g,h}\right)\leq N\mathopen{}\mathclose{{}\left(f,g,h}\right) is a monotonically increasing function which has a limit. Assume that there exists such that \lim_{k}N\mathopen{}\mathclose{{}\left(f_{k},g,h}\right)=N\mathopen{}\mathclose{{}\left(f,g,h}\right)-\varepsilon. Let so that , and let . Fix large enough so that \sup\mathopen{}\mathclose{{}\left|f-f_{k}}\right|<\delta. Let be a covering measure of by with \int hd\mu_{k}<N\mathopen{}\mathclose{{}\left(f,g,h}\right)-\varepsilon/2, and let be the Lebesgue measure on . Then
[TABLE]
which means that is a covering measure of by . However, we then have that
[TABLE]
a contradiction. ∎
Proof of Theorem 1.4.
First note that N\mathopen{}\mathclose{{}\left(f,g_{k}}\right) is a bounded sequence as clearly N\mathopen{}\mathclose{{}\left(f,g_{k}}\right)\leq N\mathopen{}\mathclose{{}\left(f,g}\right) for each . Moreover, N\mathopen{}\mathclose{{}\left(f,g_{k}}\right) is also clearly non-decreasing, and thus converges to some limit. Let \mathopen{}\mathclose{{}\left(\mu_{k}}\right) be a sequence of covering measures of by (in ) such that
[TABLE]
The Banach-Alaoglu theorem tells us that we may assume without loss of generality that \mathopen{}\mathclose{{}\left(\mu_{k}}\right) converges in the weak* topology to some non-negative measure . Clearly, we have that \mathopen{}\mathclose{{}\left(\mu_{k}*g_{l}}\right)\mathopen{}\mathclose{{}\left(x}\right)\geq f\mathopen{}\mathclose{{}\left(x}\right) for all . Fixing and taking the limit implies that \mathopen{}\mathclose{{}\left(\mu*g_{l}}\right)\mathopen{}\mathclose{{}\left(x}\right)\geq f\mathopen{}\mathclose{{}\left(x}\right). By the monotone convergence theorem, we may take the limit and get that \mathopen{}\mathclose{{}\left(\mu*g}\right)\mathopen{}\mathclose{{}\left(x}\right)\geq f\mathopen{}\mathclose{{}\left(x}\right). Since is arbitrary, it follows that is a covering measure of by . The fact that \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)\leq\liminf\mu_{k}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) follows from the fact that a norm is lower semi-continuous with respect to weak* convergence. Therefore we have that
[TABLE]
Since is a covering measure of by , it follows that \mu\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right)=N\mathopen{}\mathclose{{}\left(f,g}\right)=\lim N\mathopen{}\mathclose{{}\left(f,g_{k}}\right).
To show that M\mathopen{}\mathclose{{}\left(f,g_{-}}\right)=N\mathopen{}\mathclose{{}\left(f,g}\right), recall first that, by Proposition 3.1, M\mathopen{}\mathclose{{}\left(f,g_{-}}\right)\leq N\mathopen{}\mathclose{{}\left(f,g}\right). On the other hand, by Theorem 1.2 and the above, we have that N\mathopen{}\mathclose{{}\left(f,g}\right)=\lim N\mathopen{}\mathclose{{}\left(f,g_{k}}\right)=\lim M\mathopen{}\mathclose{{}\left(f,g_{-}}\right)\leq M\mathopen{}\mathclose{{}\left(f,g_{-}}\right). Thus, the equality M\mathopen{}\mathclose{{}\left(f,g_{-}}\right)=N\mathopen{}\mathclose{{}\left(f,g}\right) holds. ∎
Finally, we prove Theorem 3.3:
Proof of Theorem 3.3..
Let \gamma=\inf\mathopen{}\mathclose{{}\left\{\alpha\,:\,(f,\alpha)\in A(K)}\right\}. Since if and only if there exists a covering measure of by with , we see that Since A\mathopen{}\mathclose{{}\left(K}\right) is closed and non-empty, there exists an optimal covering measure of by such that and .
Let \beta:=M\mathopen{}\mathclose{{}\left(f,g_{-},h}\right). By Proposition 3.1, we have that . Let . We will next prove that there is a -separated measure such that . This would imply that and therefore . Since A\mathopen{}\mathclose{{}\left(K}\right) is closed and convex, the Hahn-Banach separation theorem implies that the point \mathopen{}\mathclose{{}\left(f,\gamma-\varepsilon}\right) can be strictly separated from A\mathopen{}\mathclose{{}\left(K}\right). In other words, there exists a pair \mathopen{}\mathclose{{}\left(\rho,\sigma}\right)\in\mathcal{M}\oplus\mathbb{R} and a number such that
[TABLE]
and
[TABLE]
for all \mathopen{}\mathclose{{}\left(\mu,\varphi}\right)\in K. Choosing \mathopen{}\mathclose{{}\left(\mu,\varphi}\right)=\mathopen{}\mathclose{{}\left(0,0}\right) implies that . Suppose that for some \mathopen{}\mathclose{{}\left(\mu,\varphi}\right)\in K we have Since is a cone, we may choose a sufficiently large so that inequality (3.2) is violated for \lambda\mathopen{}\mathclose{{}\left(\mu,\varphi}\right)\in K. Thus we must have that
[TABLE]
and
[TABLE]
for all \mathopen{}\mathclose{{}\left(\mu,\varphi}\right)\in K. Define , and observe that \mathopen{}\mathclose{{}\left(\mu_{0},\varphi_{0}}\right)\in K. Hence,
[TABLE]
By subtracting the above inequality from (3.3) we conclude that and, by scaling \mathopen{}\mathclose{{}\left(\rho,\sigma}\right) if needed, we can assume that . Thus we have that
[TABLE]
and
[TABLE]
for all \mathopen{}\mathclose{{}\left(\mu,\varphi}\right)\in K. In particular, for \mathopen{}\mathclose{{}\left(0,\varphi}\right)\in K we get that for all which means that , and for \mathopen{}\mathclose{{}\left(\mu,0}\right)\in K we get that \int\mathopen{}\mathclose{{}\left(\rho*g_{-}}\right)d\mu-\int h\,d\mu\leq 0 for every , which means that . Therefore is a -separated measure with , as desired. ∎
4 Volume bounds
As with classical covering numbers, the simple but strong tool of volume bounds plays a significant role in the the theory and in the proofs. In this section we provide several volume bounds for functional covering numbers, bounds which we then apply in the next sections.
When dealing with the weight function , we denote for short N\mathopen{}\mathclose{{}\left(f,g}\right)=N^{1}\mathopen{}\mathclose{{}\left(f,g}\right).
We shall mainly be concerned with log-concave functions. A function is said to be log-concave if is upper semi-continuous and is concave. In addition, is said to be a geometric log-concave function if it is log-concave and \max f=f\mathopen{}\mathclose{{}\left(0}\right)=1. We will mainly consider geometric log-concave functions with finite and positive integral and denote the class of all such functions by \text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). The class of log-concave functions is considered to be the usual generalization of convex bodies in Asymptotic Geometric Analysis. Numerous objects, notions, inequalities and constructions have been extended from convex geometry to the realm of log-concave functions. This provides a rich theory, and many times the resulting theorems can be applied into convexity again to gain new insight and stronger results. For an extensive description of these ideas and the state of the art see [20] and [2].
Classical covering and separation numbers admit simple bounds in terms of the volumes of the bodies involved. One has (see e.g. [2, Chapter 4])
[TABLE]
These bounds, while very simple to prove, are extremely useful and in many cases suffice for covering numbers estimates to provide tight results.
In this section we prove some analogous bounds, in which the integral of a function plays the role of volume. The role of Minkowski addition is played the by sup-convolution of two functions , which we recall is
[TABLE]
As mentioned above, this convolution plays an important role in the geometry of log-concave function as a natural extension of the Minkowski sum of convex bodies (where indeed for two convex bodies , where denotes the indicator function of a set ). For example, under these analogies one may interpret the Prékopa-Leindler inequality as an extension of Brunn-Minkowski inequality, see e.g., [15]. We prove
Theorem 4.1**.**
Let f,g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Then for every we have
[TABLE]
We remark that the left hand side inequality actually holds for any two functions and , whereas the right hand side inequality is in general an upper bound for M\mathopen{}\mathclose{{}\left(f,g_{-}}\right), which in the log-concave case is equal to N\mathopen{}\mathclose{{}\left(f,g}\right), a fact which follows from approximation arguments (see Theorem 1.5). In any setting in which strong duality between covering and separation holds (such as geometric log-concave functions) the above bounds hold precisely as stated in Theorem 4.1.
Proof of Theorem 4.1.
Let be a covering measure of by . Then
[TABLE]
Since is an arbitrary covering measure, we conclude that N\mathopen{}\mathclose{{}\left(f,g}\right)\geq\frac{\int f}{\int g}.
Next, let be a -separated measure and let . Then
[TABLE]
Since is an arbitrary -separated measure, it follows that M\mathopen{}\mathclose{{}\left(f,g}\right)\leq\frac{\int\mathopen{}\mathclose{{}\left(f\star g^{p-1}}\right)\mathopen{}\mathclose{{}\left(x}\right)dx}{\int g^{p}\mathopen{}\mathclose{{}\left(x}\right)dx}. As f,g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right), Theorem 1.5 tells us that N\mathopen{}\mathclose{{}\left(f,g}\right)=M\mathopen{}\mathclose{{}\left(f,g_{-}}\right), which completes the proof. ∎
Remark 4.2*.*
The above volume bounds can be written for the general weighted covering number as follows: for the right hand side, simply use that \int g\mathopen{}\mathclose{{}\left(x-y}\right)d\rho\mathopen{}\mathclose{{}\left(y}\right)dx\leq h(x) to get
[TABLE]
The left hand side can be generalized for weight functions satisfying as follows
[TABLE]
We get
[TABLE]
We include one more pair of volume bounds which shall be useful for us in further applications:
Theorem 4.3**.**
Let f,g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Then
[TABLE]
In the special case where are even functions we get
[TABLE]
The idea behind the proof of Theorem 4.3 is finding specific covering and separating measures for a given pair of functions . The fact that such measures can be explicitly written is a notable advantage in working with functional covering numbers over classical covering numbers, where one usually cannot write down an explicit covering for two given sets. This advantage was also exploited in [7] where properties of an explicit covering (uniform) measure played an important role in the proof of the fractional Hadwiger conjecture.
Proof of Theorem 4.3.
We begin with the right hand side. Assume that . Consider the measure with density \frac{f^{2}\mathopen{}\mathclose{{}\left(x/2+x_{0}/2}\right)}{\|f*g\|_{\infty}} with respect to the Lebesgue measure. We claim that this is a covering measure of by . Indeed, since is log-concave we have that f^{2}\mathopen{}\mathclose{{}\left(\frac{x-y+x_{0}}{2}}\right)\geq f\mathopen{}\mathclose{{}\left(x}\right)f\mathopen{}\mathclose{{}\left(-y+x_{0}}\right) for all . Therefore, it follows that
[TABLE]
Thus
[TABLE]
For the left hand side inequality, consider the measure with density \frac{f\mathopen{}\mathclose{{}\left(x}\right)}{\|f*g\|_{\infty}}dx. Thus
[TABLE]
which means that is -separated. Therefore
[TABLE]
By Theorem 1.5, M\mathopen{}\mathclose{{}\left(f,g_{-}}\right)=N\mathopen{}\mathclose{{}\left(f,g}\right) and the proof is complete. ∎
Remark*.*
An analogue with weight function for the right hand side can be written. In the even case we get
[TABLE]
5 A remark on the Functional Hadwiger conjecture
A famous conjecture, known as the Levi-Hadwiger or the Gohberg-Markus covering problem, was posed in [17], [14] and [13]. It states that in order to cover a convex body by slightly smaller copies of itself, one needs at most copies. More precisely:
Conjecture 5.1**.**
Let be a convex body with non empty interior. Then there exists such that
[TABLE]
Moreover, equality holds if and only if is a parallelotope.
An equivalent form of this conjecture is that , where {\rm int}\mathopen{}\mathclose{{}\left(K}\right) is the interior of .
This problem has drawn much attention over the years, but not much has been unraveled so far. Our paper [7] has addressed this problem by using fractional covering numbers for convex sets. We showed, in the language of the current paper:
Theorem 5.2**.**
Let be a convex body. Then
[TABLE]
Moreover, for centrally symmetric , if and only if is a parallelotope.
The bound for the non-centrally symmetric case remains a conjecture even in the fractional setting. (Things get significantly better if one considers , though.) In this note we address the functional version. As we shall next demonstrate, it follows from our volume bounds that
Theorem 5.3**.**
Let f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) be an even geometric log-concave function. Then
[TABLE]
where . In the case where is not even, we have that
[TABLE]
Proof.
Theorem 4.1, applied with , implies that
[TABLE]
In the general case, where is not necessarily even, we use Fact 2.10, and Theorem 4.1 to obtain
[TABLE]
∎
6 M-position for functions
One of the deepest results in asymptotic geometric analysis is the existence of an -ellipsoid associated with a convex body, namely that for every convex body there exists an ellipsoid of the same volume which can replace it, in many volume computations, up to universal constants. This profound result was discovered by V. Milman [18, 19], and leads to many far reaching conclusions, among them are the reverse Blaschke-Santaló inequality [11] and the reverse Brunn-Minkowski inequality. For a detailed account of this subject, see [2, Ch. 8].
In the functional setting, Klartag and Milman in [15] showed a reverse Brunn-Minkowski inequality for functions. This requires a choice of a position of course. They proved the following functional version of the inverse Brunn-Mikowski inequality.
Theorem 6.1** (Klartag-Milman [15]).**
For every f:\mathbb{R}^{n}\to\mathopen{}\mathclose{{}\left[0,\infty}\right) which is an even geometric log-concave function, there exists such that the following holds: Let f,h:\mathbb{R}^{n}\to\mathopen{}\mathclose{{}\left[0,\infty}\right) be even geometric log-concave functions. Then letting and one has
[TABLE]
where is a universal constant, independent of the dimension and of and .
In this section we extend their result. We show that two definitions of -position for functions are equivalent, one which uses volume inequalities and another which uses functional covering numbers. We then show that every geometric log-concave function admits an -position with a universal constant, a fact implicitly shown already in [15] but which now bears a stronger meaning as described in Theorem 6.8 below. While this fact can be deduced from Theorem 6.1, we give a independent proof which uses the covering number estimates in -positions of convex bodies. In particular we show that Theorem 6.1 may be extended to the non-even case, if the center of mass of is assumed to be at the origin. The non-centrally-symmetric case of the classical -position was treated in [21].
We would like to mention another result of a similar flavor, of Bobkov and Madiman [10]. They use another functional variation for Minkowski addition coming from the addition of random variables (thus pertaining to the usual convolution of the density functions) and consider entropy instead of volume. Under this setting they show the existence of positions for which a reverse Brunn-Minkowski-type inequality holds. Their results are very different from ours, in particular the sum of two indicators is no longer an indicator. However, their results are in a very general setting of -concave functions (with the constants involved depending on the degree of concavity, and becoming universal when the densities are log-concave).
To simplify the exposition it is useful to first state and prove a duality result in the flavor of König and Milman, and this is done in Section 6.1. The two equivalent definitions for -position, and the proof that they are equivalent are given in Section 6.2, and the fact that Theorem 6.1 implies the existence of an -position is given in Section 6.3. Finally, in Section 6.4 we give a new proof of the existence of -position for functions.
Throughout this section, means that for some universal constants . Moreover, the value of such universal constants may change from line to line, and the reader may take the minimum (or maximum) of the constants appearing (which one could name etc.) as the final constant in the main theorems.
6.1 A König-Milman type result for functions
Let denote the standard scalar product on . The polar of a convex set is defined by A^{\circ}=\mathopen{}\mathclose{{}\left\{v\in\mathbb{R}^{n}:\ \sup_{x\in K}\langle v,\,x\rangle\leq 1}\right\}. Given a centrally symmetric convex body (i.e., a convex set with non-empty interior), the polar set is again a centrally symmetric convex body. The notion of duality is very basic in geometry and analysis. It admit a natural functional extension which is the Legendre transform for convex functions:
[TABLE]
In the log-concave world this transform gives for a log-concave a natural dual . This choice of duality has been used in numerous works, for example in [8, 3, 15] where functional versions of the Santaló inequality and its reverse were proven. We shall discuss below yet another candidate for the “polar function” of a geometric log-concave .
Going back to geometric duality, a central question for covering numbers, proposed by Piestch [22] was to determine the relation between and , as functions of . This is called “duality of entropy numbers”. Many results on this question have been proven by now, see [2]. One of them is the following well-known duality of entropy result due to H. König and V. Milman [16]: There exists a numerical constant such that for any two centrally symmetric convex bodies one has
[TABLE]
Using the suitable corresponding notion of duality for log-concave functions given by the Legendre transform, we prove an analogous functional result:
Theorem 6.2**.**
There exists a numerical constant such that for any dimension and any two functions f,g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) with center of mass at the origin, one has
[TABLE]
Proof.
Note that for every function h\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) one has
[TABLE]
Indeed, the left hand side inequality follows from the fact that and the right hand side inequality follows from h\mathopen{}\mathclose{{}\left(x}\right)\leq h^{2}\mathopen{}\mathclose{{}\left(x/2}\right) which holds due to the fact that is log-concave with h\mathopen{}\mathclose{{}\left(0}\right)=1.
Assume first that and are both even functions. Using the volume bound in Theorem 4.1 together with (6.2) we see that
[TABLE]
As \mathopen{}\mathclose{{}\left(f^{*}\star g^{*}}\right)^{*}=fg, the functional Santaló inequality and its reverse (see [3] and [15]) imply that
[TABLE]
for some absolute constant . By Theorem 4.3 and (6.2), we conclude that
[TABLE]
To obtain the opposite inequality, one simply replaces the roles of with , respectively.
Next, we prove the general case in which and are not necessarily even. Firstly, by the above proof for even functions, we have that
[TABLE]
Secondly, by [1, Theorem 2.2], which is a functional version of the Rogers-Shephard inequality for the difference body, for every geometric log-concave function h\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) with full-dimensional support we have that
[TABLE]
Using the sub-multiplicativity (Fact 2.10), monotonicity of covering (Fact 2.6) together with Theorem 4.3, and (6.4), we have that
[TABLE]
Hence, by Santaló inequality and its reverse, and (6.4), it follows that
[TABLE]
Similarly, we obtain that N\mathopen{}\mathclose{{}\left(f^{*}\star f_{-}^{*},g^{*}\cdot g_{-}^{*}}\right)\leq C_{3}^{n}N\mathopen{}\mathclose{{}\left(g^{*},f^{*}}\right). Together with (6.3), we conclude that
[TABLE]
and
[TABLE]
as claimed. ∎
Remark 6.3*.*
Since [3] an extensive effort has been applied to determining understanding the operation of “duality” for functions and investigating together with other possible definitions. In [4, 5] it was shown that on the class \text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) of geometric log-concave functions there are precisely two order reversing bijections. One of them is , and the second, which we shall denote by , is less well known, and is given by the formula where
[TABLE]
(with the convention .) For a detailed description of this transform, geometric interpretations, properties and more, see [5]. It turns out that a result similar to Theorem 6.2 does not hold when replacing the Legendre-based duality with the polarity transform. However, by slightly altering the polarity transform, one can prove another Santaló-type inequality and its reverse, which leads to a corresponding functional extension of Theorem 6.2. These results will be stated in a precise form and proved in the forthcoming [24].
6.2 The equivalence of the covering and volumetric
-positions
In this section we give two definitions for functional -position and show that they are equivalent. In particular, we will get that in -position we have a family of replacement-by-gaussians inequalities which, we will see in the next section, are equivalent to Theorem 6.1. To distinguish the two definitions, at least until we show they are equivalent, we call the first volume--position and the second covering--position. Denote , so that . In general, for a positive definite matrix let g_{A}\mathopen{}\mathclose{{}\left(x}\right)=\exp(-\frac{1}{2}\langle Ax,\,x\rangle), so that and .
Definition 6.4**.**
Let f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) and . We say that is in volume--position with constant if and for every h\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right),
[TABLE]
and
[TABLE]
For general , if for we have that is in volume--position with constant , then we say that is a volume--ellipsoid of with constant .
Remark 6.5*.*
If is in volume--position, then is not necessarily in volume--position as well, since might not (and actually unless is gaussian, never will) equal . However, the Blashcke-Santaló inequality for functions [3] states that for a log-concave function with center of mass at the origin one has
[TABLE]
and thus if is centered and in volume--position then . Moreover, the reverse Blashcke-Santaló inequality for functions [15] states that there is a universal constant so that for a log-concave function
[TABLE]
and so we actually get that if is in volume--position with constant then (for the normalizing , which is bounded between two universal constants) is in volume--position with constant .
Another possible definition for -position is using covering numbers.
Definition 6.6**.**
Let f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) and . We say that is in covering--position with constant if and
[TABLE]
Again if there exists some such that is in covering--position with constant , we say that is a covering--ellipsoid of with constant .
Remark 6.7*.*
Again, if is in covering--position, then is not necessarily in covering--position due to normalization, but by the Blashcke-Santaló inequality for functions and its reverse, (for the normalizing ) is in covering--position with constant since by our volume bounds,
[TABLE]
We claim that the two definitions coincide, up to a loss in the constants. In other words
Theorem 6.8**.**
For every there exists such that if f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) is in covering--position with constant then it is in volume--position with constant , and if f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) is in volume--position with constant then it is in covering--position with constant .
Proof.
Assume that is in volume--position with constant . Then by the volume inequality of Theorem 4.1 with we have that
[TABLE]
and (using the inequality again, together with the fact that for geometric log-concave functions f^{2}\mathopen{}\mathclose{{}\left(x/2}\right)\geq f\mathopen{}\mathclose{{}\left(x}\right))
[TABLE]
The necessary bounds for N\mathopen{}\mathclose{{}\left(f^{*},g_{0}}\right) and N\mathopen{}\mathclose{{}\left(g_{0},f^{*}}\right) are obtained similarly, or by using Remark 6.5 which states that after normalization is in volume--position too, and the normalizing constant is bounded by some , so it influences the estimates by at most some .
We turn now to the other implication. Let be a covering measure of by , and a covering measure of by . Then using (2.1), we have that
[TABLE]
and, similarly,
[TABLE]
As for the reverse inequality, let be a covering measure of by , and a covering measure of by . Then
[TABLE]
and, similarly,
[TABLE]
∎
6.3 Existence of functional -position
In this section we prove that every centered geometric log-concave function admits an -position with a universal . We shall be using Theorem 6.1 which is for even functions. In order to be able, in the proof, to take care of non-even functions as well, we shall need the following lemma.
Lemma 6.9**.**
Let f\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) with {\rm bary}\mathopen{}\mathclose{{}\left(f}\right)=0. Then for every g\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right), we have
[TABLE]
and
[TABLE]
Proof.
Firstly, since , it follows that N\mathopen{}\mathclose{{}\left(ff_{-},g}\right)\leq N\mathopen{}\mathclose{{}\left(f,g}\right)\leq N\mathopen{}\mathclose{{}\left(f\star f_{-},g}\right). Secondly,
[TABLE]
and hence N\mathopen{}\mathclose{{}\left(f,g}\right)\leq N\mathopen{}\mathclose{{}\left(f,ff_{-}}\right)N\mathopen{}\mathclose{{}\left(ff_{-},g}\right)\leq c_{2}^{n}N\mathopen{}\mathclose{{}\left(ff_{-},g}\right). Thirdly, by Theorem 6.2, and (6.6) (where the roles of and are interchanged), it follows that
[TABLE]
and hence N\mathopen{}\mathclose{{}\left(f,g}\right)\geq\frac{N\mathopen{}\mathclose{{}\left(f\star f_{-},g}\right)}{N\mathopen{}\mathclose{{}\left(f\star f_{-},f}\right)}\geq C_{1}^{-n}N\mathopen{}\mathclose{{}\left(f\star f_{-},g}\right).
To conclude the above, we have N\mathopen{}\mathclose{{}\left(f,g}\right)\sim N\mathopen{}\mathclose{{}\left(ff_{-},g}\right)\sim N\mathopen{}\mathclose{{}\left(f\star f_{-},g}\right).
Next, we show that N\mathopen{}\mathclose{{}\left(g,f}\right)\sim N\mathopen{}\mathclose{{}\left(g,ff_{-}}\right)\sim N\mathopen{}\mathclose{{}\left(g,f\star f_{-}}\right). Note that
[TABLE]
Moreover, by (6.6) and (6.7), it follows that
[TABLE]
and
[TABLE]
The proof is thus complete. ∎
We next show how the reverse Brunn-Minkowski inequality for even functions from [15], quoted as Theorem 6.1 above, implies the existence of an -position for every geometric log-concave function which is centered.
Proposition 6.10**.**
There exists a universal constant such that any centered geometric log-concave function admits a functional -position (as in Definition 6.6 or Definition 6.4).
Proof.
Assume first that is even. Let g_{f}\mathopen{}\mathclose{{}\left(x}\right)=g_{0}\mathopen{}\mathclose{{}\left(x/r}\right) be the scaled standard gaussian such that . By the functional reverse Brunn-Minkowski inequality, there exists such that for ,
[TABLE]
Therefore,
[TABLE]
Similarly, one shows that N\mathopen{}\mathclose{{}\left(g_{f},\widetilde{f}}\right)\leq\mathopen{}\mathclose{{}\left(4C}\right)^{n}.
Using Theorem 6.2, one similarly shows that N\mathopen{}\mathclose{{}\left(\widetilde{f}^{*},g_{f}^{*}}\right),N\mathopen{}\mathclose{{}\left(g_{f}^{*},\widetilde{f}^{*}}\right)\leq C{}_{1}^{n}. By Fact 2.2, if then is in -position.
Next, assume that is not even, but only centered at the origin. By the first part of the proof, we can put the even function in -position, which means that N\mathopen{}\mathclose{{}\left(ff_{-},g_{0}}\right)\leq C^{n}, and N\mathopen{}\mathclose{{}\left(g_{0},ff_{-}}\right)\leq C^{n}. By Lemma 6.9, on the one hand we have that
[TABLE]
and on the other hand, that
[TABLE]
By Theorem 6.2 we have
[TABLE]
which completes the proof. ∎
Finally, we show that if two functions are, up to normalization, in functional -position then they satisfy the functional reverse Brunn-Minkowski inequality.
Proposition 6.11**.**
Suppose f,h\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right) satisfy that \tilde{f}\mathopen{}\mathclose{{}\left(x}\right)=f\mathopen{}\mathclose{{}\left(x/z_{f}}\right) and \tilde{h}\mathopen{}\mathclose{{}\left(x}\right)=h\mathopen{}\mathclose{{}\left(x/z_{h}}\right) are in functional -position (where z_{f}=\mathopen{}\mathclose{{}\left((2\pi)^{n/2}/\int f}\right)^{1/n} and z_{h}=\mathopen{}\mathclose{{}\left((2\pi)^{n/2}/\int h}\right)^{1/n}) with constant Then they satisfy
[TABLE]
In particular, Proposition 6.11 together with Theorem 1.7 imply Theorem 6.1.
Proof.
First, for , let denote the standard gaussian scaled by a factor by , namely g_{r}\mathopen{}\mathclose{{}\left(x}\right)=g_{0}\mathopen{}\mathclose{{}\left(x/r}\right). Note that . Moreover, a simple calculation tells us that for any ,
[TABLE]
By assumption (using the definition of volume--position), we have that for any \psi\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right),
[TABLE]
By replacing with \tilde{\psi}\mathopen{}\mathclose{{}\left(x}\right)=\psi\mathopen{}\mathclose{{}\left(x/z_{f}}\right), and using the facts that \mathopen{}\mathclose{{}\left(\tilde{f}\star\tilde{\psi}}\right)\mathopen{}\mathclose{{}\left(x}\right)=\mathopen{}\mathclose{{}\left(f\star\psi}\right)\mathopen{}\mathclose{{}\left(x/z_{f}}\right) and \mathopen{}\mathclose{{}\left(g_{0}\star\tilde{\psi}}\right)\mathopen{}\mathclose{{}\left(x}\right)=\mathopen{}\mathclose{{}\left(g_{1/z_{f}}\star\psi}\right)\mathopen{}\mathclose{{}\left(x/z_{f}}\right), it follows that for any \psi\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Similarly, we have that for any \psi\in\text{LC}_{g}\mathopen{}\mathclose{{}\left(\mathbb{R}^{n}}\right). Therefore,
[TABLE]
∎
6.4 Direct proof for covering -position
In this section we give a direct proof of the existence of an -position for a centered log-concave geometric convex function, based on the geometric theorem of Milman on the existence of an -position for convex bodies. One may restrict to the case where is even, since the centered and not-necessarily even case will then follow by the reasoning given in the previous section. Let be even and define
[TABLE]
which is a centrally symmetric convex body. This body was used in [15] as well.
Lemma 6.12**.**
Let , then we have that
[TABLE]
for some universal constant .
Proof.
The smallest log-concave function with a given level set is where the epigraph of is the convex hull of and the set . The integral of this function is
[TABLE]
for some universal . Picking , since and they share the level set , it follows that for any . For the other direction, for any function we have that
[TABLE]
for some universal . ∎
Recall that a convex body is in -position with constant if it can be covered by copies of the Euclidean ball where R=\mathopen{}\mathclose{{}\left({\rm Vol}(K)/{\rm Vol}(B_{2}^{n})}\right)^{1/n}. (That is, .) Under this condition, and under the assumption that the center of mass of is at the origin, it is well known that also is in -position and that , and where depends only on . For these properties and more about -position, see [2].
Lemma 6.13**.**
Let satisfy that and that is in -position. Then .
Proof.
Since is in -position, it can be covered by copies of where satisfies {\rm Vol}\mathopen{}\mathclose{{}\left(RB_{2}^{n}}\right)=R^{n}\kappa_{n}={\rm Vol}(K_{f}). By Lemma 6.12, is at most , and hence . We note that (the sum is no longer log-concave) and thus
[TABLE]
To bound the first term, note that since ,
[TABLE]
To bound the second term, note that for any fixed , by covering level sets of height each time, we have that
[TABLE]
In the particular case where we get that
[TABLE]
Since , it follows that
[TABLE]
Putting these together into (6.8) we see that the proof of the lemma is complete. ∎
Lemma 6.14**.**
Assume that is even, satisfies that and that is in -position. Then is also in -position and {\rm Vol}\mathopen{}\mathclose{{}\left(K_{f^{*}}}\right)\approx{\rm Vol}\mathopen{}\mathclose{{}\left(K_{f}}\right).
Proof.
Since is in -position, it follows by the above remarks that is also in -position (here we use the assumption that is even, so that must be centered). To see that in -position, we will use the fact that for any ,
[TABLE]
For the proof of these inclusions, see [12, Lemma 8]. Let be the Euclidean ball with volume , and the Euclidean ball with volume . For , the (6.9) reads , from which it also follows that . Combining the above, we have that is in -position. Indeed,
[TABLE]
and
[TABLE]
The two remaining inequalities are immediately implied by (6.1).
It remains to show that if then so is . Having the inclusions in (6.9), the reverse Santaló inequality, and Lemma 6.12, we see that
[TABLE]
By changing the roles of and , we get {\rm Vol}\mathopen{}\mathclose{{}\left(K_{f^{*}}}\right)\approx 1, as required. ∎
Combining Lemmas 6.13 and 6.14, and Theorem 6.2, we get
Lemma 6.15**.**
Let be an even function, which satisfies that and that is in -position. Then
[TABLE]
Proof.
By Lemma 6.12 we know that and by Lemma 6.14 also and both these bodies are in -position. By Lemma 6.13 this implies for some universal . Using Theorem 6.2 we get the other two inequalities (possibly altering the value of , but keeping it universal nevertheless). ∎
We have seen a direct proof of the covering numbers estimates in Theorem 1.7 for the even geometric log-concave case. Indeed, the mapping is simply chosen so that is in -position and such that , that is, . To prove the covering numbers bound for the case of centered but not necessarily even functions we follow the exact same reasoning as in the proof of Proposition 6.10. We put the even function in -position, use Lemma 6.9, which implies that on the one hand
[TABLE]
and on the other hand,
[TABLE]
Finally, using that the function is centered, as well as , Theorem 6.2 implies that also
[TABLE]
which completes the proof of the covering numbers bound for a general centered function. By Theorem 6.8 we get that the other estimates in Theorem 1.7 hold as well.
Remark 6.16*.*
It would be interesting to give an independent proof for the existence of functional -positions of log-concave functions, without using the analogue classical statement for convex bodies, and perhaps even to show that there are -regular -positions of functions in the sense of Pisier (see e.g., [23], and [2]).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Alonso-Gutiérrez, B. González Merino, C. H. Jiménez, and R. Villa, Rogers-Shephard inequality for log-concave functions , J. Funct. Anal. 271 (2016), no. 11, 3269–3299.
- 2[2] S. Artstein-Avidan, A. Giannopoulos, and V. D. Milman, Asymptotic geometric analysis. Part I , Mathematical Surveys and Monographs, vol. 202, American Mathematical Society, Providence, RI, 2015.
- 3[3] S. Artstein-Avidan, B. Klartag, and V. Milman, The Santaló point of a function, and a functional form of the Santaló inequality , Mathematika 51 (2004), 33–48.
- 4[4] S. Artstein-Avidan and V. Milman, A characterization of the support map , Adv. Math. 223 (2010), no. 1, 379–391.
- 5[5] S. Artstein-Avidan and V. Milman, Hidden structures in the class of convex functions and a new duality transform , J. Eur. Math. Soc. 13 (2011), no. 4, 975–1004.
- 6[6] S. Artstein-Avidan and O. Raz, Weighted covering numbers of convex sets , Advances in Mathematics 227 (2011), no. 1, 730–744.
- 7[7] S. Artstein-Avidan and B. A. Slomka, On weighted covering numbers and the Levi-Hadwiger conjecture , Israel J. Math. 209 (2015), no. 1, 125–155.
- 8[8] K. M. Ball, Ph D dissertation , Cambridge.
