On discrete Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_p$$\end{document} Brunn–Minkowski type inequalities

Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_p$$\end{document} Brunn–Minkowski type inequalities for the lattice point enumerator Gn(·)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {G}_n(\cdot )$$\end{document} are shown, p≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p\ge 1$$\end{document}, both in a geometrical and in a functional setting. In particular, we prove that Gn((1-λ)·K+pλ·L+(-1,1)n)p/n≥(1-λ)Gn(K)p/n+λGn(L)p/n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned}\mathrm {G}_n\bigl ((1-\lambda )\cdot K +_p \lambda \cdot L + (-1,1)^n\bigr )^{p/n}\ge (1-\lambda )\mathrm {G}_n(K)^{p/n}+\lambda \mathrm {G}_n(L)^{p/n} \end{aligned}$$\end{document}for any K,L⊂Rn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K, L\subset \mathbb {R}^n$$\end{document} bounded sets with integer points and all λ∈(0,1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda \in (0,1)$$\end{document}. We also show that these new discrete analogues (for Gn(·)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {G}_n(\cdot )$$\end{document}) imply the corresponding results concerning the Lebesgue measure.

Here vol(•) denotes the n-dimensional Lebesgue measure (when integrating, dx will stand for dvol(x)) and + is used for the Minkowski addition, i.e., A + B = {a + b : a ∈ A, b ∈ B} for any non-empty sets A, B ⊂ R n .Moreover, λA represents the set {λa : a ∈ A}, for λ ≥ 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 uniparametric 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 ⊂ R n containing the origin, the following generalization of the classical Minkowski addition, usually referred to as the p-sum K + p L of K and L, was introduced by Firey [5]: for 1 ≤ p ≤ ∞ fixed, there exists a (unique) convex body K + p L whose support function is given by When p = ∞ this must be interpreted as its limit case, i.e., h(K + ∞ L, •) = max h(K, •), h(L, •) , as is customary.We recall that the support function of a convex body K ⊂ R n is defined by h(K, u) = max x, u : x ∈ K , for all u ∈ R n (see e.g.[26,Section 1.7]).One may also define a p-scalar multiplication by λ • p K := λ 1/p K, for any λ ≥ 0. We observe that although this notion surely depends on p, we will use the notation • (instead of • p ) throughout the manuscript when this scalar multiplication is used together with the p-sum + p .Moreover, given λ, µ ≥ 0, we write λ • K + p µ • L for (λ • K) + p (µ • L).Clearly, when p = 1 the latter set recovers the classical linear combination λK + µL (cf.(1.2)), whereas the case p = ∞ 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 ≤ p < ∞, 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 ⊂ 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 ≥ 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 = ∞), the coefficients (1 − µ) 1/q , µ 1/q must be understood as 1 for all 0 ≤ µ ≤ 1, and thus K + 1 L equals K + L. Furthermore, as shown in [20], one has Finally, we would like to mention that, although (1.3) makes also sense for p = ∞ (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 ≥ 1 we will refer to a real number p ≥ 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 nonempty compact sets: Theorem A. Let λ ∈ (0, 1) and p ≥ 1, and let K, L ⊂ R n be non-empty compact sets.Then Around three decades after the introduction given by Firey for the psum 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 Z n endowed with the cardinality | • |, Gardner and Gronchi [9] obtained an engaging and powerful analogue of the following form of the Brunn-Minkowski inequality: vol(K +L) ≥ 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].
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 λ ∈ (0, 1) and p ≥ 1, and let K, L ⊂ R n be bounded sets with The inequality is sharp.
For any fixed p ≥ 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 G n (•): 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 G n (•) by showing (the more general version of) their functional counterpart (see Theorems 2.1 and 2.2).
The paper is organized as follows: in Section 2 we recall some preliminaries and we state our main results (in the functional setting), whereas their proofs will be established in Section 3.

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 α-sum S t,s α (•, •) of two non-negative numbers, with positive coefficients t and s, where α is a parameter varying in R\{0}∪{±∞}, as well as the notion of α-mean M λ α (•, •), with λ ∈ (0, 1), for α ∈ R∪{±∞} (for a general reference for α-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 α ∈ R, with α = 0: given a, b > 0, let moreover, when t = s = 1 we just write whereas for α = 0 we write M λ 0 (a, b) = a 1−λ b λ .The reason to modify in this way (when ab = 0) the definition of α-sums given in [12] is due to the classical statement of the Borell-Brascamp-Lieb inequality, which is collected below.In fact, without such a modification (although redundant for any α ≤ 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 α > 0.
Theorem C (The Borell-Brascamp-Lieb inequality).Let λ ∈ (0, 1).Let −1/n ≤ α ≤ ∞ and let f, g, h : R n −→ R ≥0 be integrable functions such that 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 α > 0, in [28]): Before going on, we would like to clarify the special case of α = 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 for all µ ∈ [0, 1] with µ = λ, by Hölder's inequality (jointly with its equality case, see e.g.[12,Theorem 11]).Then, by convention, the case α = 0 in (2.2) will be understood as for all x, y ∈ R n .In other words, the case α = 0 in Theorem D is the same to the one in Theorem C, i.e., the classical Prékopa-Leindler inequality.
For the statement of the next result, we first need to introduce some additional notation.From now on we will write χ M to represent the characteristic function of a given set M ⊂ R n , namely, Moreover, for a function φ : R n −→ R ≥0 we denote by φ ⋄ : R n −→ R ≥0 the function defined by Such an extension of φ is just the Asplund product ⋆ of the functions φ and χ (−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 supconvolution, 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 λ ∈ (0, 1) and let K, L ⊂ R n be non-empty bounded sets.Let −1/n ≤ α ≤ ∞ and let f, g, h : R n −→ R ≥0 be non-negative functions such that 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 λ ∈ (0, 1) and p ≥ 1, and let K, L ⊂ R n be non-empty bounded sets.Let −1/n ≤ α ≤ ∞ and let f, g, h : R n −→ R ≥0 be nonnegative functions such that As in the classical framework, the case α = 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.

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 ⌈x⌉ 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 ⊂ R n be non-empty bounded sets.Let −1/n ≤ α ≤ ∞, α = 0, and let f, g, h : R n −→ R ≥0 be non-negative functions such that h(tx + sy) ≥ tf (x) α + sg(y) α 1/α for all x ∈ K, y ∈ L with f (x)g(y) > 0.
To show this, we need the statement of the following Brunn-Minkowski type inequality for the lattice point enumerator, proven in [15]: The inequality is sharp.
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 − λ)x + λy, for λ ∈ (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].
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 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 − λ)x + λy (see [2]).
An analogous result for arbitrary lattices can be obtained.We recall that an n-dimensional lattice Λ ⊂ R n is the set of all integer combinations of n linearly independent vectors v 1 , . . ., v n , the set B = {v 1 , . . ., v n } being called a basis of Λ.Thus, for such an n-dimensional lattice Λ, let ϕ : R n −→ R n be the linear (bijective) map defined by ϕ(x) Taking into account the pointwise definition of the psum 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 Λ ⊂ R n , by considering the auxiliary functions f B , g B , h B : R n −→ R ≥0 given by for any x ∈ R n , as follows: Corollary 3.1.Let λ ∈ (0, 1) and p ≥ 1, and let K, L ⊂ R n be non-empty bounded sets.Let −1/n ≤ α ≤ ∞ and let f, g, h : R n −→ R ≥0 be nonnegative functions such that 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) Finally, to show that the equality can be attained, it is enough to consider For bounded sets K, L ⊂ R n with G n (K)G n (L) > 0, it was shown in [16] that i.e., that (1.5) for λ = 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 λ ∈ (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 ∈ (0, 1), for any fixed value of p ≥ 1.Indeed, it is enough to consider, as an example, the sets (observe that K, L ⊂ 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 , where ⌊x⌋ 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 λ > 0 such that M λ p (1, 2) + a < 2. But this is always possible because lim and therefore we have G 1 (M ) = 2.However, for the right-hand side of (1.6) we have G 1 (K) = 2 and G 1 (L) = 3, and thus . 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 ⊂ R n containing the origin, one has that for any p ≥ 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 1 2 we get, now using We observe now that Theorem 1.1 holds also true for arbitrary nonnegative (L p ) linear combinations of K and L, but with the suitable modification of the cube.More precisely, we have: Proof.The proof follows the same argument to that of Theorem 2.1, by replacing (1− λ) and λ by t and s, respectively, for the characteristic functions f = χ K , g = χ L and h = χ t•K+ps•L .So, in this case, it is enough to set t = t(µ 0 ) := t 1/p (1 − µ 0 ) 1/q and s = s(µ 0 ) := s 1/p µ 1/q 0 , for which t + s ≤ (t + s) 1/p by Hölder's inequality, and then The proof is now concluded as in the one of Theorem 2.1.
In [16] it was shown that if A, B ⊂ Z n are finite, A, B = ∅, then (3.4) Here it makes no sense to wonder about an L p version of the above inequality, by just replacing A + B by A + p B on the left-hand side, since A + p B 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: Clearly, for p = 1, the latter inequality is exactly (3.4), since A + B ⊂ 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, . . ., a} and B = {0, . . ., b} for some a, b ∈ N with 0 < a ≤ b.Indeed, on the one hand, taking into account that S p (•, •) is decreasing in p, we have (see e.g.[12,Theorem 19]) and further S p (a + 1, b + 1) > 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 + p L = 0, S p (a, b) 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 S p (a, b) < a + b for all p > 1, we obtain S p (a, b) + 1 ≤ 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]).
We will first prove that, given k ∈ N and C = [−k, k] n , we have Theorem D will then follow simply by taking limits as k → ∞.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 Moreover, for the sake of simplicity, we set t := (1 − λ) 1/p (1 − µ) 1/q and s := λ 1/p µ 1/q for any given µ ∈ [0, 1], for which we get, as a consequence of Hölder's inequality, that t + s ≤ 1.Again, condition (2.2) can be rewritten in terms of t, s as for all x, y ∈ C (and so, in particular, for all x, y ∈ C 0 ) with f m (x)g m (y) > 0 and all µ ∈ [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 Z n .Note that in this case ϕ (−1, 1) n = O m and thus we obtain (3.7) where M p = (1 − λ) • C 0 + p λ • C 0 and h ⋄m m (z) = sup u∈O m h m (z + u).Now, since C is an n-dimensional convex body containing the origin, from (1.2) we get We now consider the function h : R n −→ R ≥0 given by h(x) = sup θ∈3O m h(x+ θ), and show that, for every fixed z ∈ R n and any x ∈ z + O m , we have h(x) ≥ h ⋄m m (z).Indeed,  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 = ∞ m=1 (C r + 3O m ).Moreover, since h vanishes outside C, from the definition of h we get C r ⊂ C r + 3O m for all r > 0. Thus, by Fubini's theorem and the monotone convergence theorem, we obtain 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.
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 ⊂ 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 Z n by means of successively considering 2 −m Z n , m ∈ N.
+ u + v + w) = sup w∈O m sup v∈O m h m (x + v + w) = sup w∈O m h ⋄m m (x + w) ≥ h ⋄m m (z).
r + 3O m ) dr = lim m→∞ ∞ 0 vol(C r + 3O m ) dr ≥ lim m→∞ ∞ 0 vol(C r ) dr = lim m→∞ C+R m h(x) dx.This, together with (3.9) and the fact thatC + R m = C ∩ 2 −m Z n + R m , implies that C h(x) dx ≥ lim m→∞ C+R m h(x) dx ≥ lim m→∞ 2 −mn z∈C∩2 −m Z n h ⋄m m (z).Finally, since f is Riemann integrable and 2 −mnx∈C 0 ∩2 −m Z n f m (x) is an upper Riemann sum of f for the partition {x + R m : x ∈ C 0 ∩ 2 −m Z n } of C, we clearly have lim m→∞ 2 −mn x∈C 0 ∩2 −m Z n f m (x) = C f (x)dx.