Abstract
\(L_p\) Brunn–Minkowski type inequalities for the lattice point enumerator \(\mathrm {G}_n(\cdot )\) are shown, \(p\ge 1\), both in a geometrical and in a functional setting. In particular, we prove that
for any \(K, L\subset \mathbb {R}^n\) bounded sets with integer points and all \(\lambda \in (0,1)\). We also show that these new discrete analogues (for \(\mathrm {G}_n(\cdot )\)) imply the corresponding results concerning the Lebesgue measure.
Similar content being viewed by others
1 Introduction
The classical Brunn–Minkowski inequality for non-empty compact subsets K, L of the n-dimensional Euclidean space \(\mathbb {R}^n\) asserts that, for any \(\lambda \in (0,1)\),
Here \(\mathrm {vol}(\cdot )\) denotes the n-dimensional Lebesgue measure (when integrating, \(\mathrm {d}x\) will stand for \(\mathrm {d}\mathrm {vol}(x)\)) and \(+\) is used for the Minkowski addition, i.e., \(A+B=\{a+b:\, a\in A, \, b\in B\}\) for any non-empty sets \(A, B\subset \mathbb {R}^n\). Moreover, \(\lambda A\) represents the set \(\{\lambda a:\, a\in A\}\), for \(\lambda \ge 0\).
The Brunn–Minkowski inequality has become not only a cornerstone of the Brunn–Minkowski theory (for which we refer the reader to the updated monograph [26]) but also a powerful tool in other related fields of mathematics. Among other analogues of it we emphasize its analytic version, the so-called Borell–Brascamp–Lieb inequality, which implies a whole family of Brunn–Minkowski type inequalities. For extensive survey articles on this and other related inequalities we refer the reader to [1, 6].
When dealing with convex bodies (compact convex sets) \(K,L\subset \mathbb {R}^n\) containing the origin, the following generalization of the classical Minkowski addition, usually referred to as the p-sum \(K+_pL\) of K and L, was introduced by Firey [5]: for \(1\le p\le \infty \) fixed, there exists a (unique) convex body \(K+_p L\) whose support function is given by
When \(p=\infty \) this must be interpreted as its limit case, i.e., \(h(K+_\infty L,\cdot )=\max \bigl \{h(K,\cdot ), h(L,\cdot )\bigr \}\), as is customary. We recall that the support function of a convex body \(K\subset \mathbb {R}^n\) is defined by \(h(K,u)=\max \bigl \{\left\langle x,u\right\rangle :x\in K\bigr \}\), for all \(u\in \mathbb {R}^n\) (see e.g. [26, Section 1.7]). One may also define a p-scalar multiplication by \(\lambda \cdot _p K:=\lambda ^{1/p}K\), for any \(\lambda \ge 0\). We observe that although this notion surely depends on p, we will use the notation \(\cdot \) (instead of \(\cdot _p\)) throughout the manuscript when this scalar multiplication is used together with the p-sum \(+_p\). Moreover, given \(\lambda ,\mu \ge 0\), we write \(\lambda \cdot K+_p\mu \cdot L\) for \((\lambda \cdot K)+_p(\mu \cdot L)\). Clearly, when \(p=1\) the latter set recovers the classical linear combination \(\lambda K+\mu L\) (cf. (1.2)), whereas the case \(p=\infty \) yields
The main disadvantage of the previous definition of p-sum is that it is defined via p-means of the support functions of the convex bodies (containing the origin) there involved, which implies the necessity of assuming convexity, unlike what happens for the usual Minkowski sum. Lutwak, Yang and Zhang [20] extended the p-sum, for \(1\le p<\infty \), to the case of arbitrary subsets of the Euclidean space, by showing that there is a pointwise definition of it, similar to that of the Minkowski addition: for any \(K,L\subset \mathbb {R}^n\),
where q is the Hölder conjugate of p (i.e., such that \(1/p+1/q=1\)). From now on, given \(p\ge 1\), the notation q will have this meaning, unless stated otherwise.
In [20] it is shown that the definition in (1.3) coincides with the one given by (1.2) when K and L are n-dimensional convex bodies containing the origin. Moreover, in the case when \(p=1\) (and hence \(q=\infty \)), the coefficients \((1-\mu )^{1/q},\mu ^{1/q}\) must be understood as 1 for all \(0\le \mu \le 1\), and thus \(K+_1L\) equals \(K+L\). Furthermore, as shown in [20], one has
for all \(0\le \lambda \le 1\). Finally, we would like to mention that, although (1.3) makes also sense for \(p=\infty \) (and so \(q=1\)), we will omit this case throughout the manuscript (following [20] too), since for such a value of p all the results trivially hold. So, along the rest of the paper, when writing \(p\ge 1\) we will refer to a real number \(p\ge 1\).
The \(L_p\) version of the Brunn–Minkowski inequality (1.1) was originally proven by Firey [5], in the setting of convex bodies containing the origin, and by Lutwak, Yang and Zhang (see [20, Theorem 4]) for arbitrary non-empty compact sets:
Theorem A
Let \(\lambda \in (0,1)\) and \(p\ge 1\), and let \(K,L\subset \mathbb {R}^n\) be non-empty compact sets. Then
Around three decades after the introduction given by Firey for the p-sum of convex bodies (containing the origin), Lutwak [18, 19] initiated a deep and systematic study of p-additions and their consequences. This new and remarkable extension of the classical Brunn–Minkowski theory, usually referred to in the literature as the \(L_p\) Brunn–Minkowski theory, is not only a very active area of research nowadays, but it has further supposed to be the starting point for new developments and generalizations. An example of the latter can be seen in [7, 8, 21] and the references therein, where the authors perform a thorough investigation into the fundamental characteristics of operations between sets and provide with an elegant construction that allows one to define a general pointwise operation between sets. For more information on the \(L_p\) Brunn–Minkowski theory and its consequences we refer the reader to [26, Section 9.1].
In the discrete setting of \(\mathbb {Z}^n\) endowed with the cardinality \(|\cdot |\), Gardner and Gronchi [9] obtained an engaging and powerful analogue of the following form of the Brunn–Minkowski inequality: \(\mathrm {vol}(K+L)\ge \mathrm {vol}(B_K+B_L)\), where \(B_K\) and \(B_L\) are centered Euclidean balls of the same volume as the convex bodies K and L, respectively. Moreover, from the above-mentioned discrete version, they derive some inequalities that improve previous results obtained by Ruzsa in [24, 25].
More recently, different discrete analogues of the Brunn–Minkowski inequality have been obtained, including the case of its classical form (cf. (1.1)) for the cardinality [10, 13, 16], functional extensions of it [11, 14, 16, 17, 27] and versions for the lattice point enumerator \(\mathrm {G}_n(\cdot )\) [11, 15, 16], which is defined by \(\mathrm {G}_n(M)=|M\cap \mathbb {Z}^n|\), \(M\subset \mathbb {R}^n\). In this respect, in [16] it is shown the necessity of extending \((1-\lambda )K+\lambda L\) to \((1-\lambda )K+\lambda L+(-1,1)^n\) in order to get a discrete analogue of (1.1) for all \(\lambda \in (0,1)\), as follows:
Theorem B
Let \(\lambda \in (0,1)\) and let \(K,L\subset \mathbb {R}^n\) be non-empty bounded sets. Then
For particular sets K, L, the equality is attained.
Here we are mainly interested in finding a discrete counterpart to (1.4), or equivalently, in getting an \(L_p\) version of (1.5). In this regard, we show the following:
Theorem 1.1
Let \(\lambda \in (0,1)\) and \(p\ge 1\), and let \(K,L\subset \mathbb {R}^n\) be bounded sets with \(\mathrm {G}_n(K)\mathrm {G}_n(L)>0\). Then
For particular sets K, L, the equality is attained.
For any fixed \(p\ge 1\), the Minkowski addition of the cube \((-1,1)^n\) on the left-hand side of the latter inequality cannot be, in general, neither reduced (by means of a smaller cube) nor substituted by its p-sum (see Remark 3.2). And again, as in the classical framework, the case of \(p=1\) of this result recovers (1.5). Furthermore, we show that the \(L_p\) Brunn–Minkowski inequality (1.4), in the setting of n-dimensional convex bodies, can be derived as a consequence of this new discrete inequality for the lattice point enumerator \(\mathrm {G}_n(\cdot )\):
Theorem 1.2
The discrete \(L_p\) Brunn–Minkowski type inequality (1.6) implies the \(L_p\) Brunn–Minkowski inequality (1.4) for n-dimensional convex bodies K and L.
In fact, we will prove these results on the lattice point enumerator \(\mathrm {G}_n(\cdot )\) by showing (the more general version of) their functional counterpart (see Theorems 2.1 and 2.2).
The paper is organized as follows: in Sect. 2 we recall some preliminaries and we state our main results (in the functional setting), whereas their proofs will be established in Sect. 3.
2 Functional results: background and main results
As mentioned before, we will obtain Theorem 1.1 as a direct consequence of its functional analogue. To introduce it, we recall the analytical counterpart (for functions) of the Brunn–Minkowski inequality, the so-called Borell–Brascamp–Lieb inequality, originally proven in [2] and [3]. For its statement, we first need to give the definition of the \(\alpha \)-sum \(\mathcal {S}_{\alpha }^{t,s}\left( \cdot ,\cdot \right) \) of two non-negative numbers, with positive coefficients t and s, where \(\alpha \) is a parameter varying in \(\mathbb {R}\setminus \{0\}\cup \{\pm \infty \}\), as well as the notion of \(\alpha \)-mean \(\mathcal {M}_{\alpha }^{\lambda }\left( \cdot ,\cdot \right) \), with \(\lambda \in (0,1)\), for \(\alpha \in \mathbb {R}\cup \{\pm \infty \}\) (for a general reference for \(\alpha \)-sums and means of non-negative numbers, we refer the reader to the classic text of Hardy, Littlewood and Pólya [12] and to the handbook [4]). We consider first the case \(\alpha \in \mathbb {R}\), with \(\alpha \ne 0\): given \(a,b>0\), let
For \(\alpha =\pm \infty \) we set \(\mathcal {S}_{\infty }^{t,s}\left( a,b\right) =\max \{a,b\}\) and \(\mathcal {S}_{-\infty }^{t,s}\left( a,b\right) =\min \{a,b\}\). Furthermore, if \(ab=0\), we define \(\mathcal {S}_{\alpha }^{t,s}\left( a,b\right) =0\) for all \(\alpha \in \mathbb {R}\setminus \{0\}\cup \{\pm \infty \}\), and moreover, when \(t=s=1\) we just write
Finally, for any \(\alpha \ne 0\) we set
whereas for \(\alpha =0\) we write \(\mathcal {M}_{0}^{\lambda }\left( a,b\right) =a^{1-\lambda }b^{\lambda }\).
The reason to modify in this way (when \(ab=0\)) the definition of \(\alpha \)-sums given in [12] is due to the classical statement of the Borell–Brascamp–Lieb inequality, which is collected below (we refer the reader, for instance, to [6, Section 10]). In fact, without such a modification (although redundant for any \(\alpha \le 0\)), if we do not assume \(f(x)g(y)>0\) in (2.1), the thesis of this result would not have mathematical interest when \(\alpha >0\).
Theorem C
(The Borell–Brascamp–Lieb inequality) Let \(\lambda \in (0,1)\). Let \(-1/n\le \alpha \le \infty \) and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be integrable functions such that
for all \(x,y\in \mathbb {R}^n\) with \(f(x)g(y)>0\). Then
Taking into account the definition of p-sum given by (1.3), it is natural to wonder about the possibility of extending the above result to the \(L_p\) setting by suitably modifying the condition on the functions there involved (cf. (2.1)). Such an expected \(L_p\) version of the Borell–Brascamp–Lieb inequality has been very recently obtained in [23] (shown independently, for the case of \(\alpha >0\), in [28]):
Theorem D
Let \(\lambda \in (0,1)\) and \(p\ge 1\). Let \(-1/n\le \alpha \le \infty \) and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be integrable functions such that
for all \(x,y\in \mathbb {R}^n\) with \(f(x)g(y)>0\) and all \(\mu \in [0,1]\). Then
Before going on, we would like to clarify the special case of \(\alpha =0\) in condition (2.2) of the previous result:
Remark 2.1
On the one hand, it is clear that
On the other hand, we have \((1-\lambda )^{1/p}(1-\mu )^{1/q}+\lambda ^{1/p}\mu ^{1/q}=1\) if \(\mu =\lambda \) and
for all \(\mu \in [0,1]\) with \(\mu \ne \lambda \), by Hölder’s inequality (jointly with its equality case, see e.g. [12, Theorem 11]). Then, by convention, the case \(\alpha =0\) in (2.2) will be understood as
for all \(x,y\in \mathbb {R}^n\). In other words, the case \(\alpha =0\) in Theorem D is the same to the one in Theorem C, i.e., the classical Prékopa–Leindler inequality (see e.g. [6, Section 7]).
For the statement of the next result, we first need to introduce some additional notation. From now on we will write \(\chi _{_M}\) to represent the characteristic function of a given set \(M\subset \mathbb {R}^n\), namely,
Moreover, for a function \(\phi :\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) we denote by \(\phi ^{\diamond }:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) the function defined by
Such an extension of \(\phi \) is just the Asplund product \(\star \) of the functions \(\phi \) and \(\chi _{(-1,1)^n}\), which can be seen as the functional analogue of the Minkowski sum of sets in the setting of log-concave functions. Indeed,
For more information on the Asplund product, also known as the sup-convolution, we refer the reader to [26, Section 9.5] and the references therein.
Taking into account this notation, the following discrete Borell–Brascamp–Lieb inequality was shown in [16]:
Theorem E
Let \(\lambda \in (0,1)\) and let \(K, L \subset \mathbb {R}^n\) be non-empty bounded sets. Let \(-1/n\le \alpha \le \infty \) and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be non-negative functions such that
for all \(x\in K\), \(y\in L\) with \(f(x)g(y)>0\). Then
where \(M=(1-\lambda )K+\lambda L\).
In this paper we show the corresponding \(L_p\) version of the latter result. In other words, we prove the following discrete analogue of Theorem D, which, in particular, will imply Theorem 1.1:
Theorem 2.1
Let \(\lambda \in (0,1)\) and \(p\ge 1\), and let \(K,L\subset \mathbb {R}^n\) be non-empty bounded sets. Let \(-1/n\le \alpha \le \infty \) and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be non-negative functions such that
for all \(x\in K\), \(y\in L\) with \(f(x)g(y)>0\) and all \(\mu \in [0,1]\). Then
where \(M_p=(1-\lambda )\cdot K+_p\lambda \cdot L\).
As in the classical framework, the case \(\alpha =0\) in this result is that of Theorem E (see Remark 2.1).
We will also show that our discrete counterpart, Theorem 2.1, implies the continuous result collected in Theorem D, under mild assumptions for the functions there involved.
Theorem 2.2
The discrete \(L_p\) Borell–Brascamp–Lieb type inequality (Theorem 2.1) implies the (continuous) \(L_p\) Borell–Brascamp–Lieb inequality (Theorem D), provided that the functions f, g are Riemann integrable and h is upper semicontinuous.
3 Proofs and further consequences
To prove the \(L_p\) version of the discrete Borell–Brascamp–Lieb inequality (2.4) we need to show the following auxiliary result (here \(\lceil x\rceil \) denotes the ceiling function of x, i.e., the least integer greater than or equal to x):
Theorem 3.1
Let \(t,s>0\) and let \(K,L\subset \mathbb {R}^n\) be non-empty bounded sets. Let \(-1/n\le \alpha \le \infty \), \(\alpha \ne 0\), and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be non-negative functions such that
for all \(x\in K\), \(y \in L\) with \(f(x)g(y)>0\). Then
where \(M=tK+sL\).
To show this, we need the statement of the following Brunn–Minkowski type inequality for the lattice point enumerator, proven in [15]:
Theorem F
Let \(t,s\ge 0\) and let \(K,L\subset \mathbb {R}^n\) be bounded sets such that \(\mathrm {G}_n(K)\mathrm {G}_n(L)>0\). Then
For particular sets K, L, the equality is attained.
The proof of Theorem 3.1 now follows by using the same steps to those of the proof of Theorem E, just replacing convex combinations \((1-\lambda )x+\lambda y\), for \(\lambda \in (0,1)\), by linear combinations \(tx+sy\), with \(t,s>0\), and applying (3.1) instead of (1.5).
Now we are ready to show our main result. We follow here the underlying idea of the original proof of (1.4) given in [20].
Proof of Theorem 2.1
Along the proof, we will assume that
since the result is trivial otherwise. Now we set, for any given \(\mu _0\in [0,1]\) (to be suitably chosen later),
for which one has, by Hölder’s inequality, that \(t+s\le 1\). Notice that the assumption (2.3) can be then rewritten, in terms of t, s, as
for all \(x\in K\) and \(y\in L\) with \(f(x)g(y)>0\), and thus Theorem 3.1 yields
Moreover, from (1.3) we clearly have
This, together with (3.2) and the fact that \((-1,1)^n\supset \bigl (-1,\lceil t+s\rceil \bigr )^n\), allows us to conclude that
Notice also that if \(\alpha =-1/n\) then \(\alpha /(n\alpha +1)=-\infty \) and hence we are done. Then, in the following we may assume that \(\alpha \ne 0,-1/n\) (cf. Remark 2.1) and thus, defining \(\beta :=\alpha /(n\alpha +1)\in (-\infty ,0)\cup (0,1/n]\), we must check whether
for a suitable value of \(\mu _0\in [0,1]\). To this aim, it is enough to take
and a straightforward computation shows that (3.3) indeed holds (in fact, with equality). This concludes the proof. \(\square \)
Remark 3.1
Following the same approach as the one in the proof of Theorem 2.1, just replacing the sums of the functions f, g and h by their integrals on \(\mathbb {R}^n\), one may also derive Theorem D. For, one can similarly exploit the suitable version of Theorem C for linear combinations \(tx+sy\) instead of the one for means \((1-\lambda )x+\lambda y\) (see [2]).
An analogous result for arbitrary lattices can be obtained. We recall that an n-dimensional lattice \(\Lambda \subset \mathbb {R}^n\) is the set of all integer combinations of n linearly independent vectors \(v_1,\dots ,v_n\), the set \(\mathcal {B}=\{v_1,\dots ,v_n\}\) being called a basis of \(\Lambda \). Thus, for such an n-dimensional lattice \(\Lambda \), let \(\varphi :\mathbb {R}^n\longrightarrow \mathbb {R}^n\) be the linear (bijective) map defined by \(\varphi (x)=\sum _{i = 1}^n x_i v_i\) for each \(x=(x_1,\dots ,x_n)\in \mathbb {R}^n\). Taking into account the pointwise definition of the p-sum given in (1.3), we clearly have
This allows us to extend the statement of Theorem 2.1 to the setting of an n-dimensional lattice \(\Lambda \subset \mathbb {R}^n\), by considering the auxiliary functions \(f_{\mathcal {B}}, g_{\mathcal {B}}, h_{\mathcal {B}}: \mathbb {R}^n \longrightarrow \mathbb {R}_{\ge 0}\) given by
for any \(x\in \mathbb {R}^n\), as follows:
Corollary 3.1
Let \(\lambda \in (0,1)\) and \(p\ge 1\), and let \(K,L\subset \mathbb {R}^n\) be non-empty bounded sets. Let \(-1/n\le \alpha \le \infty \) and let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be non-negative functions such that
for all \(x\in K\), \(y\in L\) with \(f(x)g(y)>0\) and all \(\mu \in [0,1]\). Let \(\Lambda \subset \mathbb {R}^n\) be an n-dimensional lattice with basis \(\mathcal {B}=\{v_1,\dots ,v_n\}\) and let \(\varphi (x)=\sum _{i = 1}^n x_i v_i\) for \(x\in \mathbb {R}^n\). Then
where \(M_p=(1-\lambda )\cdot K+_p\lambda \cdot L\) and \(h^{\diamond _{_\mathcal {B}}}(z) = \sup _{u\in \varphi ((-1,1)^n)} h(z+u)\) for all \(z\in \mathbb {R}^n\).
3.1 Geometric consequences
Notice that, as in the classical setting, the geometric inequality (1.6) can be derived from the functional one (2.4):
Proof of Theorem 1.1
By applying (2.4) with \(\alpha =\infty \) to the characteristic functions \(f=\chi _{_K}\), \(g=\chi _{_L}\) and \(h=\chi _{_{(1-\lambda )\cdot K +_p \lambda \cdot L}}\), for which \(h^\diamond =\chi _{_{(1-\lambda )\cdot K+_p\lambda \cdot L+(-1,1)^n}}\), one immediately gets (1.6). Finally, to show that the equality can be attained, it is enough to consider \(K = L = [0,m]^n\) with \(m \in \mathbb {N}\), for which \(\mathrm {G}_n\bigl ((1-\lambda )\cdot K +_p \lambda L+(-1,1)^n\bigr )=(m+1)^n=\mathrm {G}_n(K)=\mathrm {G}_n(L)\). \(\square \)
For bounded sets \(K, L \subset \mathbb {R}^n\) with \(\mathrm {G}_n(K)\mathrm {G}_n(L)>0\), it was shown in [16] that
i.e., that (1.5) for \(\lambda =1/2\) also holds by replacing the cube \((-1,1)^n\) by \([0,1]^n\). However, the latter inequality is in general not true for any \(\lambda \in (0,1)\). Thus, and regarding (1.6), it is a natural question whether \((-1,1)^n\) might be reduced to a smaller cube.
Remark 3.2
We notice on the one hand that the set \((-1,1)^n\) cannot be reduced to a strictly smaller cube of the form \((-1,a]^n\) (or \([-a,1)^n\)) with \(a\in (0,1)\), for any fixed value of \(p\ge 1\). Indeed, it is enough to consider, as an example, the sets \(K=[0,1]\), \(L=[0,2]\) in dimension \(n=1\) and the combination
(observe that \(K,L\subset \mathbb {R}^n\) are n-dimensional convex bodies containing the origin and hence, as mentioned in the introduction, the p-sum defined by (1.3) agrees with the classical definition given by (1.2)). Then, since \(\mathrm {G}_{1}(M)=\left\lfloor \mathcal {M}_{p}^{\lambda }\left( 1,2\right) +a\right\rfloor +1\) and \(\mathcal {M}_{p}^{\lambda }\left( 1,2\right) \in [1,2]\), where \(\lfloor x\rfloor \) denotes the floor function of the real number x (i.e., the greatest integer less than or equal to x), it is enough to find \(\lambda >0\) such that \(\mathcal {M}_{p}^{\lambda }\left( 1,2\right) +a<2\). But this is always possible because
and therefore we have \(\mathrm {G}_{1}(M)=2\). However, for the right-hand side of (1.6) we have \(\mathrm {G}_{1}(K)=2\) and \(\mathrm {G}_{1}(L)=3\), and thus
Since \(\lambda >0\), we know that \(\mathcal {M}_{p}^{\lambda }\left( \mathrm {G}_{1}(K),\mathrm {G}_{1}(L)\right) >2\), which shows that
On the other hand, taking a look at (1.5), one could think that its natural \(L_p\) version could be given by considering the p-sum of the cube \((-1,1)^n\) on the left-hand side of (1.6) (instead of its Minkowski addition). In fact, when dealing with n-dimensional convex bodies \(K,L\subset \mathbb {R}^n\) containing the origin, one has that
for any \(p\ge 1\) (see [5]). So, p-summing the cube \((-1,1)^n\) on the left-hand side of (1.6) would be, sometimes, tighter than (Minkowski) adding it. Nevertheless, this is not possible either. Indeed, by considering again the sets \(K=[0,1]\), \(L=[0,2]\) in dimension \(n=1\) and \(p=2\), for which we then have by (1.2) that
we get, now using (1.3),
We observe now that Theorem 1.1 holds also true for arbitrary non-negative (\(L_p\)) linear combinations of K and L, but with the suitable modification of the cube. More precisely, we have:
Corollary 3.2
Let \(t,s\ge 0\) and \(p\ge 1\), and let \(K,L\subset \mathbb {R}^n\) be bounded sets such that \(\mathrm {G}_n(K)\mathrm {G}_n(L)>0\). Then
Proof
The proof follows the same argument to that of Theorem 2.1, by replacing \((1-\lambda )\) and \(\lambda \) by t and s, respectively, for the characteristic functions \(f=\chi _{_K}\), \(g=\chi _{_L}\) and \(h=\chi _{_{t\cdot K +_p s\cdot L}}\). So, in this case, it is enough to set
for which \({\bar{t}}+{\bar{s}}\le (t+s)^{1/p}\) by Hölder’s inequality, and then
The proof is now concluded as in the one of Theorem 2.1. \(\square \)
In [16] it was shown that if \(A,B\subset \mathbb {Z}^n\) are finite, \(A,B\ne \emptyset \), then
Here it makes no sense to wonder about an \(L_p\) version of the above inequality, by just replacing \(A+B\) by \(A+_pB\) on the left-hand side, since \(A+_pB\) is no longer finite (see (1.3)), for \(p>1\). However, from Corollary 3.2 for \(K=A\), \(L=B\) and \(t=s=1\) we get the following result:
Corollary 3.3
Let \(A,B\subset \mathbb {Z}^n\) be finite, \(A,B\ne \emptyset \). Then
Clearly, for \(p=1\), the latter inequality is exactly (3.4), since \(A+B\subset \mathbb {Z}^n\) and the sole integer points in \((-1,2)^n\) are those in \(\{0,1\}^n\).
We would like to note that unlike in the linear case (\(p=1\)), the cube \((-1,2)^n\) on the left-hand side of (3.5) cannot be, in general, reduced to \(\{0,1\}^n\) or even to \([0,1]^n\).
To see this, it is enough to consider \(n=1\), \(A=\{0,\dots ,a\}\) and \(B=\{0,\dots ,b\}\) for some \(a,b\in \mathbb {N}\) with \(0<a\le b\). Indeed, on the one hand, taking into account that \(\mathcal {S}_{p}^{}\left( \cdot ,\cdot \right) \) is decreasing in p, we have (see e.g. [12, Theorem 19])
and further \(\mathcal {S}_{p}^{}\left( a+1,b+1\right) >a+b+1\) for \(p>1\) small enough. On the other hand, if we denote by \(K=[0,a]\) and \(L=[0,b]\), then \(K+_pL=\bigl [0,\mathcal {S}_{p}^{}\left( a,b\right) \bigr ]\) since K and L are 1-dimensional convex bodies containing the origin (and thus their p-sum is also given by (1.2)). Moreover, due to the fact that \(\mathcal {S}_{p}^{}\left( a,b\right) <a+b\) for all \(p>1\), we obtain \(\bigl \lfloor \mathcal {S}_{p}^{}\left( a,b\right) \bigr \rfloor +1\le a+b\). Therefore, altogether we get
for any \(p>1\) small enough. In fact, taking for instance \(a=b=1\) and \(p=3/2\), the latter inequality holds, which shows that \([0,1]^n\) cannot replace \((-1,2)^n\) on the left-hand side of (3.5).
3.2 From the discrete to the continuous case
We will now prove Theorem 2.2, i.e., we show that the discrete inequality collected in Theorem 2.1 implies the continuous result established in Theorem D, in the spirit of what happens for \(p=1\) (see [16, Theorem 2.4]).
Proof of Theorem 2.2
Let \(f,g,h:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) be functions in the conditions of Theorem D, namely, verifying (2.2) for all \(x,y\in \mathbb {R}^n\) with \(f(x)g(y)>0\) and all \(\mu \in [0,1]\), for some fixed \(p\ge 1\), \(\lambda \in (0,1)\) and \(-1/n\le \alpha \le \infty \). We will first prove that, given \(k\in \mathbb {N}\) and \(C=[-k,k]^n\), we have
Theorem D will then follow simply by taking limits as \(k\rightarrow \infty \). To this aim, we may assume that the functions f, g and h vanish outside C (multiplying them by the characteristic functions of C, if necessary). We shall also write \(C_0=[-k,k)^n\).
For each \(m\in \mathbb {N}\), let \(\mathrm {O}^m=(-2^{-m},2^{-m})\) and \(\mathrm {R}^m=[0,2^{-m})\), and define the functions \(f_m, g_m, h_m:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) given by
Moreover, for the sake of simplicity, we set \(t:=(1-\lambda )^{1/p}(1-\mu )^{1/q}\) and \(s:=\lambda ^{1/p}\mu ^{1/q}\) for any given \(\mu \in [0,1]\), for which we get, as a consequence of Hölder’s inequality, that \(t+s\le 1\). Again, condition (2.2) can be rewritten in terms of t, s as
for all \(z_1,z_2\in \mathbb {R}^n\) with \(f(z_1)g(z_2)>0\). Thus, since \((t+s)\mathrm {R}^m\subset \mathrm {R}^m\), we have
for all \(x,y\in C\) (and so, in particular, for all \(x,y\in C_0\)) with \(f_m(x)g_m(y)>0\) and all \(\mu \in [0,1]\). Hence, the functions \(f_m,g_m,h_m\) are in the conditions of Corollary 3.1 and we may apply it for the sets \(K=L=C_0\) and the lattice \(2^{-m}\mathbb {Z}^n\). Note that in this case \(\varphi \bigl ((-1,1)^n\bigr )=\mathrm {O}^m\) and thus we obtain
where \(M_p=(1-\lambda )\cdot C_0+_p\lambda \cdot C_0\) and \(h_m^{\diamond _m}(z)=\sup _{u\in \mathrm {O}^m}h_m(z+u)\). Now, since C is an n-dimensional convex body containing the origin, from (1.2) we get
which, jointly with the fact that \((C+\mathrm {O}^m)\cap 2^{-m}\mathbb {Z}^n=C\cap 2^{-m}\mathbb {Z}^n\), allows us to deduce (from (3.7)) that
We now consider the function \({\overline{h}}:\mathbb {R}^n\longrightarrow \mathbb {R}_{\ge 0}\) given by \({\overline{h}}(x)=\sup _{\theta \in 3\mathrm {O}^m}h(x+\theta )\), and show that, for every fixed \(z\in \mathbb {R}^n\) and any \(x\in z+\mathrm {O}^m\), we have \({\overline{h}}(x)\ge h_m^{\diamond _m}(z)\). Indeed,
Furthermore, for any \(r>0\) let
Notice that the superlevel sets \(C_r\) are compact, since h is upper semicontinuous and C is compact (see [22, Theorem 1.6]), and then we clearly have \(C_r=\bigcap _{m=1}^\infty (C_r+3\mathrm {O}^m)\). Moreover, since h vanishes outside C, from the definition of \({\overline{h}}\) we get \({\overline{C}}_r\subset C_r+3\mathrm {O}^m\) for all \(r>0\). Thus, by Fubini’s theorem and the monotone convergence theorem, we obtain
This, together with (3.9) and the fact that \(C+\mathrm {R}^m=C\cap 2^{-m}\mathbb {Z}^n+\mathrm {R}^m\), implies that
Finally, since f is Riemann integrable and \(2^{-mn}\sum _{x \in C_0\cap 2^{-m}\mathbb {Z}^n} f_m(x)\) is an upper Riemann sum of f for the partition \(\{x + \mathrm {R}^m: x\in C_0\cap 2^{-m}\mathbb {Z}^n\}\) of C, we clearly have
The same holds for the function g and then, taking limits on both sides of (3.8), we get (3.6). This finishes the proof. \(\square \)
Due to the well-known fact that a function is Riemann integrable if and only if it is continuous almost everywhere, and since the boundary of a convex set has null measure (and taking also into account the characterization of the upper semicontinuity in terms of the level sets), we directly get Theorem 1.2, as a consequence of Theorem 2.2. We emphasize the necessity of assuming convexity in Theorem 1.2: if one considers bounded measurable sets \(K, L \subset \mathbb {R}^n\) of positive volume, containing no rational point, one cannot expect to recover the \(L_p\) Brunn–Minkowski inequality (1.4) by shrinking the lattice \(\mathbb {Z}^n\) by means of successively considering \(2^{-m}\mathbb {Z}^n\), \(m\in \mathbb {N}\).
References
Barthe, F.: Autour de l’inégalité de Brunn–Minkowski. Ann. Fac. Sci. Toulouse Math. (6) 12(2), 127–178 (2003)
Borell, C.: Convex set functions in \(d\)-space. Period. Math. Hungar. 6, 111–136 (1975)
Brascamp, H.J., Lieb, E.H.: On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions and with an application to the diffusion equation. J. Funct. Anal. 22(4), 366–389 (1976)
Bullen, P.S., Handbook of means and their inequalities. Mathematics and its Applications, vol. 560, Revised from the 1998 original. Kluwer Academic Publishers Group, Dordrecht (2003)
Firey, Wm.J.: \(p\)-means of convex bodies. Math. Scand. 10, 17–24 (1962)
Gardner, R.J.: The Brunn-Minkowski inequality. Bull. Am. Math. Soc. 39(3), 355–405 (2002)
Gardner, R.J., Hug, D., Weil, W.: Operations between sets in geometry. J. Eur. Math. Soc. 15, 2297–2352 (2013)
Gardner, R.J., Hug, D., Weil, W.: The Orlicz-Brunn-Minkowski theory: a general framework, additions, and inequalities. J. Differ. Geom. 97, 427–476 (2014)
Gardner, R.J., Gronchi, P.: A Brunn-Minkowski inequality for the integer lattice. Trans. Am. Math. Soc. 353(10), 3995–4024 (2001)
Green, B., Tao, T.: Compressions, convex geometry and the Freiman-Bilu theorem. Q. J. Math. 57(4), 495–504 (2006)
Halikias, D., Klartag, B., Slomka, B.A.: Discrete variants of Brunn-Minkowski type inequalities. Ann. Fac. Sci. Toulouse Math. 30(2), 267–279 (2021)
Hardy, G.H., Littlewood, J.E., Pólya, G.: Inequalities. Cambridge Mathematical Library, Reprint of the 1952 edition, p. 1988. Cambridge University Press, Cambridge (1952)
Hernández Cifre, M.A., Iglesias, D., Yepes Nicolás, J.: On a discrete Brunn-Minkowski type inequality. SIAM J. Discrete Math. 32, 1840–1856 (2018)
Iglesias, D., Yepes Nicolás, J.: On discrete Borell-Brascamp-Lieb inequalities. Rev. Mat. Iberoam. 36(3), 711–722 (2020)
Iglesias, D., Lucas, E., Yepes Nicolás, J.: On discrete Brunn-Minkowski and isoperimetric type inequalities. Discrete Math. 345(1), 112640 (2022)
Iglesias, D., Yepes Nicolás, J., Zvavitch, A.: Brunn-Minkowski type inequalities for the lattice point enumerator. Adv. Math. 370, 107193 (2020)
Klartag, B., Lehec, J.: Poisson processes and a log-concave Bernstein theorem. Stud. Math. 247(1), 85–107 (2019)
Lutwak, E.: The Brunn-Minkowski-Firey theory, I: Mixed volumes and the Minkowski problem. J. Differ. Geom. 38, 131–150 (1993)
Lutwak, E.: The Brunn-Minkowski-Firey theory, II: affine and geominimal surface areas. Adv. Math. 118, 244–294 (1996)
Lutwak, E., Yang, D., Zhang, G.: The Brunn-Minkowski-Firey inequality for nonconvex sets. Adv. Appl. Math. 48, 407–413 (2012)
Mesikepp, T.: \(M\)-Addition. J. Math. Anal. Appl. 443, 146–177 (2016)
Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 317. Springer, Berlin (1998)
Roysdon, M., Xing, S.: On \(L_p\)-Brunn-Minkowski type and \(L_p\)-isoperimetric type inequalities for measures. Trans. Am. Math. Soc. 374, 5003–5036 (2021)
Ruzsa, I.Z.: Sum of sets in several dimensions. Combinatorica 14, 485–490 (1994)
Ruzsa, I.Z.: Sets of sums and commutative graphs. Studia Sci. Math. Hungar. 30, 127–148 (1995)
Schneider, R.: Convex bodies: the Brunn–Minkowski theory. 2nd expanded ed. Encyclopedia of Mathematics and its Applications, vol. 151. Cambridge University Press, Cambridge (2014)
Slomka, B.A.: A Remark on discrete Brunn–Minkowski type inequalities via transportation of measure. arXiv:2008.00738 (2020) (unpublished)
Wu, Y.: A Prékopa–Leindler type inequality related to the \(L_p\) Brunn–Minkowski inequality. arXiv:2007.01101(submitted)
Acknowledgements
The authors would like to thank the anonymous referee for the helpful suggestions and observations.
Funding
Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is part of the project PGC2018-097046-B-I00, supported by MCIN/AEI/10.13039/501100011033/FEDER “Una manera de hacer Europa”, and by “Programa de ayudas a grupos de excelencia de la Región de Murcia”, Fund. Séneca, 19901/GERM/15.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Hernández Cifre, M.A., Lucas, E. & Yepes Nicolás, J. On discrete \(L_p\) Brunn–Minkowski type inequalities. Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A-Mat. 116, 164 (2022). https://doi.org/10.1007/s13398-022-01309-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13398-022-01309-2