Abstract
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of a centrally symmetric convex body. Our main tool is a generalization of a result of Davenport that bounds the number of lattice points in terms of volumes of suitable projections.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Let \(\mathcal K ^n\) be the set of all convex bodies in \(\mathbb R ^n\), i.e., compact convex sets \(K\) with nonempty interior \(\text{ int}K\). Such a body \(K\) is called centrally symmetric if \(K=-K\). The family of \(n\)-dimensional lattices in \(\mathbb R ^n\) is denoted by \(\mathcal L ^n\) and the usual Lebesgue measure with respect to the \(n\)-dimensional Euclidean space by \(\text{ vol}_n(\cdot )\). If the ambient space is clear from the context we omit the subscript and just write \(\text{ vol}(\cdot )\). For a given bounded subset \(S\subset \mathbb R ^n\), the number of lattice points in \(S\) is denoted by \(\text{ G}(S)=\#(S\cap \mathbb Z ^n)\). A lattice polytope is a polytope all of whose vertices are points in \(\mathbb Z ^n\). Finally, for an \(A\subseteq \mathbb R ^n\) the dimension of its affine hull will be denoted by \(\dim A\).
We are interested in bounds on the volume in terms of the lattice point enumerator of a convex body. For \(K\in \mathcal K ^n\) with \(\dim (K\cap \mathbb Z ^n)=n\) a sharp lower bound on \(\text{ vol}(K)\) was obtained by Blichfeldt [4]. It reads
We will call results of this kind Blichfeldt-type inequalities. On the other hand, the best known upper bound on \(\text{ vol}(P)\) for a lattice polytope \(P\in \mathcal K ^n\) is due to Pikhurko [15]
and holds under the condition that \(\text{ G}(\text{ int}P)\ne 0\). On the class of centrally symmetric convex bodies, Blichfeldt [4] and van der Corput [6] obtained a sharp upper bound on the volume
Bey, Henk and Wills [3] proposed the study of a reverse inequality also on the class of centrally symmetric convex bodies, and in [11] the authors derive, as a first step, Blichfeldt-type inequalities for lattice crosspolytopes, lattice zonotopes, and for centrally symmetric planar convex sets. Moreover, they conjecture that there is a constant \(c\!>1\) such that \(\text{ vol}(K)\!\ge \frac{c^n}{n!}\text{ G}(K)\), for every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\).
In this work, we confirm this conjecture asymptotically by showing that for every \(\varepsilon \in (0,1]\) and large enough \(n\in \mathbb N \) a valid choice for this constant is \(c=2-\varepsilon \). As the main ingredient to our argument we prove the following generalization of a classical result of Davenport [7]. Therein, we denote by \(\mathcal Q (P)\) the set of all lattice parallelepipeds in \(\mathcal K ^n\) whose edges are parallel to a given lattice parallelepiped \(P\in \mathcal K ^n\). Moreover, \(K|L\) denotes the orthogonal projection of \(K\) onto the subspace \(L\) and \(\genfrac(){0.0pt}{}{[n]}{i}\) is the set of all \(i\)-element subsets of \([n]=\{1,\dots ,n\}\).
Lemma 1
Let \(K\in \mathcal K ^n\) and let \(P=\sum _{j=1}^n[0,z_j]\) be a lattice parallelepiped. Then
where \(L_J=\text{ lin}\{z_j:j\in J\}\) and \(P_J=\sum _{j\in J}[0,z_j]\), for \(J\in \genfrac(){0.0pt}{}{[n]}{i}\). Equality holds if and only if \(P\) is a fundamental cell of \(\mathbb Z ^n\) and \(K\in \mathcal Q (P)\).
As mentioned above, we use the preceding result to derive a Blichfeldt-type inequality for centrally symmetric convex bodies and thereby confirm conjectured bounds from [3, Conj. 1.1] and [11] asymptotically.
Theorem 1
For every \(\varepsilon \in (0,1]\) there exists an \(n(\varepsilon )\in \mathbb N \) such that for every \(n\ge n(\varepsilon )\) and every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\), we have
The constant \(2\) cannot be replaced by a bigger one.
As an application of this inequality, we bound the magnitude \(\frac{\text{ G}(K)}{\text{ G}(K^{\star })\text{ vol}(K)}\) by constants that depend on the dimension \(n\) but not on the body \(K\). Herein, \(K^{\star }=\{ x\in \mathbb R ^n:x^\mathrm{T} y\le 1,\quad \forall y\in K \}\) denotes the polar body of a given \(K\in \mathcal K ^n_0\). Estimates of such kind were first studied and applied by Gillet and Soulé [9] who obtained \(6^{-n}\le \frac{\text{ G}(K)}{\text{ G}(K^\star )\text{ vol}(K)}\le \frac{6^nn!}{c^n}\), for some \(c\le 4\).
Theorem 2
For every \(\varepsilon >0\) there exists an \(n(\varepsilon )\in \mathbb N \) such that for every \(n\ge n(\varepsilon )\) and every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\), we have
where \(c\le 4\) is an absolute constant.
The results of Lemma 1 and Theorem 1 are discussed in the subsequent section. In Sect. 3, we give the details of the proof of Theorem 2.
2 Proofs of Lemma 1 and Theorem 1
A convex body \(T\in \mathcal K ^n\) is said to be a lattice tile with respect to the lattice \(\Lambda \in \mathcal L ^n\) if \(T\) tiles \(\mathbb R ^n\) by vectors in \(\Lambda \), that is, \(\mathbb R ^n=\Lambda +T\) and \((x+\text{ int}T)\cap (y+\text{ int}T)=\emptyset \), for any different \(x,y\in \Lambda \). It is well-known that every lattice tile is a polytope and thus we can assume that every lattice tile has the origin as a vertex. For a survey on tilings and references to the relevant literature the reader may consult [19].
In the case that \(T\) is a fundamental cell of \(\mathbb Z ^n\), the subsequent lemma was already mentioned by Betke and Wills [1] (see also [10, Sect. 3]).
Lemma 2
Let \(K\in \mathcal K ^n\) and let \(T\) be a lattice tile with respect to a sublattice \(\Lambda \) of \(\mathbb Z ^n\). Then
If \(T\) is a lattice parallelepiped \(P\), then equality holds if and only if \(\Lambda =\mathbb Z ^n\) and \(K\in \mathcal Q (P)\).
proof
Since for any \(x-y\in \Lambda \) we have \((x+\text{ int}T)\cap (y+\text{ int}T)=\emptyset \), unless \(x=y\), every residue class modulo \(\Lambda \) is a packing set of \(T\). Let \(\{z_1,\dots ,z_m\}\subseteq T\cap \mathbb Z ^n\) be a maximal subset of different representatives of residue classes modulo \(\Lambda \). Writing \(\Lambda _j=z_j+\Lambda \), we get that for all \(j=1,\dots ,m\)
Since \(T\) is a lattice tile, we have \(\text{ vol}(T)=\det \Lambda =m\), and therefore
By compactness of the involved sets, equality holds if and only if \((K\cap \Lambda _j)+T=K+T\), for all \(j=1,\dots ,m\). In particular, there can only be one residue class and thus \(m=\det \Lambda =1\), i.e. \(\Lambda =\mathbb Z ^n\). In the case that the lattice tile is a lattice parallelepiped \(P=\sum _{i=1}^n[0,a_i],\,a_i\in \mathbb Z ^n\), every hyperplane supporting a facet of the convex polytope \(K+P=(K\cap \mathbb Z ^n)+P\) is parallel to a hyperplane supporting a facet of \(P\). Therefore, \(K+P\) is a lattice translate of \(\sum _{i=1}^n[0,t_ia_i]\) for some \(t_i\in \mathbb N \), and so \(K\) is a lattice translate of \(\sum _{i=1}^n[0,(t_i-1)a_i]\in \mathcal Q (P)\).
Conversely, an easy calculation gives \(\text{ G}(K)=\text{ vol}(K+P)\), for every \(K\in \mathcal Q (P)\) and any fundamental cell \(P\) of \(\mathbb Z ^n\). \(\square \)
proof
(Lemma 1) The lattice parallelepiped \(P=\sum _{j=1}^n[0,z_j]\) is clearly a lattice tile with respect to the sublattice of \(\mathbb Z ^n\) which is spanned by \(z_1,\dots ,z_n\). Based on an alternative proof by Ulrich Betke of an inequality of Davenport [7], we use Lemma 2 and develop the volume of \(K+P\) into a sum of the mixed volumes \(\text{ V}(K,n-i;P,i)\) of \(K\) and \(P\) (we refer to the books of Gardner [8] and Schneider [18] for details and properties of mixed volumes)
By the linearity and nonnegativity of the mixed volumes, we have
and by Eq. (A.41) in [8, App. A.5], it holds
for every \(J\in \genfrac(){0.0pt}{}{[n]}{i}\). Finally, combining (2.1), (2.2) and (2.3) gives the desired result.
The equality characterization is inherited from Lemma 2 since (2.1) is the only step using an inequality. \(\square \)
For later reference, we state the following lemma that can be found for example in [16, Thm. 1] and [5, Lem. 3.1].
Lemma 3
Let \(K\in \mathcal K ^n_0\) and let \(L\) be an \(i\)-dimensional linear subspace of \(\mathbb R ^n\). Then
and both inequalities are best possible.
proof
(Theorem 1) By assumption, we can find \(n\) linearly independent lattice points \(\{z_1,\dots ,z_n\}\) inside \(K\). Applying Lemma 1 with respect to the lattice parallelepiped \(P=\sum _{j=1}^n[0,z_j]\) gives
where \(P_J=\sum _{j\in J}[0,z_j]\). By construction of the subspaces \(L_J\), we have
and together with Lemma 3, we get
where \(L_n(x)=\sum _{k=0}^n\genfrac(){0.0pt}{}{n}{k}\frac{x^k}{k!}\) denotes the \(n\)th Laguerre polynomial. For two functions \(f,g:\mathbb N \rightarrow \mathbb R \), we denote by \(f(n)\approx g(n)\) that \(\lim _{n\rightarrow \infty }\frac{f(n)}{g(n)}=1\). In Szegő’s book [20, p. 199] one finds the approximation
Therefore, by \(\lim _{n\rightarrow \infty }e^{\frac{2\sqrt{2n+1}}{n}}=1\), we have
for every \(\varepsilon \in (0,1]\) and large enough \(n\in \mathbb N \). Hence, for large enough \(n\), we arrive at
In order to see that this inequality is asymptotically sharp, we consider the crosspolytope \(C_{n,l}^\star =\text{ conv}\{\pm le_1,\pm e_2,\dots ,\pm e_n\}\). We have \(\text{ G}(C_{n,l}^\star )=2(n+l)-1\) and \(\text{ vol}(C_{n,l}^\star )=\frac{2^n}{n!}l\). Therefore, \(\root n \of {\frac{n!\text{ vol}(C_{n,l}^\star )}{\text{ G}(C_{n,l}^\star )}}=\root n \of {\frac{2^nl}{2(n+l)-1}}\) tends to \(2\) when \(l\) and \(n\) tend to infinity. On the other hand, the above inequality shows that for every \(\varepsilon \in (0,1]\) we have \(\root n \of {\frac{n!\text{ vol}(K)}{\text{ G}(K)}}\ge 2-\varepsilon \) for \(n\rightarrow \infty \). \(\square \)
3 An application of Theorem 1
In this section, we give the details of the proof of Theorem 2. We proceed by showing that Theorem 1 can be used to derive an improvement of
This inequality is due to Gillet and Soulé [9] and holds for every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\). The volume of the Euclidean unit ball \(B_n\) is denoted by
where \(\varGamma (z)=\int _0^\infty e^{-t}t^{z-1}dt\) is the gamma function (cf. [8, p. 13]).
Corollary 1
For every \(\varepsilon >0\) there exists an \(n(\varepsilon )\in \mathbb N \) such that for every \(n\ge n(\varepsilon )\) and every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\), we have
Here, \(c\le 2\) is an absolute constant and the lower bound holds for every \(n\in \mathbb N \) and arbitrary \(K\in \mathcal K ^n_0\).
proof
For the lower bound, we combine Inequality (1.1) and the estimate
that is due to Bourgain and Milman [5] and holds for some universal constant \(C\le 4\). Indeed, we have
Now we restrict to \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\). The exact inequality (2.4) in the proof of Theorem 1 and the Blaschke-Santaló [17] inequality imply that
Hence, by (2.5), we have that for every \(\varepsilon ^{\prime }\in (0,1]\) and large enough \(n\in \mathbb N \)
Stirling approximation and \(\kappa _n=\frac{\pi ^\frac{n}{2}}{\varGamma (\frac{n}{2}+1)}\) give
For every \(\varepsilon \in (0,1)\) there exists an \(\varepsilon ^{\prime }\in (0,1)\) such that \(\frac{2\pi }{2-\varepsilon ^{\prime }}\le \pi +\varepsilon \), and we conclude that for large \(n\), the inequality \(\text{ G}(K)\text{ vol}(K^\star )\le (\pi +\varepsilon )^n\) holds. \(\square \)
In the planar case, we are able to give sharp bounds. Two sets are called unimodularly equivalent if there is a lattice preserving affine transformation that maps one onto the other. With \(e_i\) we denote the \(i\)th unit vector in \(\mathbb R ^n\).
Proposition 1
Let \(K\in \mathcal K ^2_0\) be such that \(\dim (K\cap \mathbb Z ^2)=2\). Then
In the upper bound equality holds if and only if \(K\) is unimodularly equivalent to the hexagon \(H=\text{ conv}\{\pm e_1,\pm e_2,\pm (e_1+e_2)\}\). The lower bound is also best possible and holds for arbitrary \(K\in \mathcal K ^2_0\).
Proof
For the upper bound, we can restrict to lattice polygons \(P\in \mathcal{P }^2_0\) since for \(P_K=\text{ conv}\{K\cap \mathbb Z ^2\}\) we clearly have \(\text{ G}(K)\text{ vol}(K^\star )\le \text{ G}(P_K)\text{ vol}(P_K^\star )\). By the well-known formula of Pick [14], we get
and therefore
Using the Blaschke-Santaló inequality [17] in the plane gives \(\text{ G}(P)\text{ vol}(P^\star )\le 2\text{ vol}(P)\text{ vol}(P^\star )\le 2\pi ^2<21\), whenever \(\text{ G}(\text{ int}P)>1\). Up to unimodular equivalence there are only three centrally symmetric lattice polygons with exactly one interior lattice point: the square \([-1,1]^2\), the diamond \(\text{ conv}\{\pm e_1,\pm e_2\}\) and the hexagon \(H\) (see for example [13, Prop. 2.1]). Among these three the hexagon is the only maximizer of \(\text{ G}(P)\text{ vol}(P^\star )\).
For the lower bound, we use Mahler’s inequality \(\text{ vol}(K)\text{ vol}(K^\star )\ge 8\), for \(K\in \mathcal K ^2_0\) (see [12]). Following the lines of the proof of Corollary 1, this yields \(\text{ G}(K)\text{ vol}(K^\star )\ge 2\). For small \(\varepsilon >0\), the square \([-1+\varepsilon ,1-\varepsilon ]^2\) shows that this is best possible. \(\square \)
Remark 1
Based on computer experiments in small dimensions, we conjecture that the hexagon in the plane is an exception and that for \(n\ge 3\) the maximizing example is the standard crosspolytope \(C_n^\star =\text{ conv}\{\pm e_1,\ldots ,\pm e_n\}\), i.e. \(\text{ G}(K)\text{ vol}(K^\star )\le (2n+1)2^n\), for every \(K\in \mathcal K ^n_0\) with \(\dim (K\cap \mathbb Z ^n)=n\).
Finally, we are ready to prove Theorem 2. The arguments are similar to those given by Gillet and Soulé [9, Sect. 1.6]. We repeat them here with the necessary adjustments to our bounds and for the sake of completeness.
Proof
(Theorem 2) The upper bound can be derived by applying the lower bound to \(K^\star \) and by using Inequality (3.1) of Bourgain and Milman. In fact, there is an absolute constant \(c\le 4\) with
Here, \(\varepsilon >0\) and \(n\in \mathbb N \) is large enough.
For the lower bound, let \(L=\text{ lin}(K^\star \cap \mathbb Z ^n)\) and \(k=\dim L\). Let us abbreviate \(L_n=L_n(2)\). We use the exact inequality (3.2) from the proof of Corollary 1 in the sublattice \(\mathbb Z ^n\cap L\) and obtain
where \(\det (\cdot )\) denotes the determinant of a lattice. By \(K=(K^\star )^{\star }\), we have \(\text{ int}K=\{ x\in K:|x^\mathrm{T} y|<1,\quad \forall y\in K^{\star } \}\) and thus \(x^\mathrm{T} y=0\), for all \(x\in \text{ int}K\cap \mathbb Z ^n\) and \(y\in K^\star \cap \mathbb Z ^n\). Therefore, using Inequality (1.1) in the sublattice \(\mathbb Z ^n\cap L^\perp \), we get
Combining (3.3), (3.4) and the lower bound in Lemma 3 gives
What remains is to show that the function \(g(k)=\frac{4^k}{k!\,\kappa _k^2\,L_k}\) is nonincreasing for \(k\ge 0\), because together with the previous inequality we then arrive at
In the proof of Corollary 1, we have seen that for every \(\varepsilon >0\) the right hand side of the above inequality is at least \((\pi +\varepsilon )^{-n}\) for large enough \(n\in \mathbb N \).
Now \(g(k)\ge g(k+1)\) if and only if \(\frac{k+1}{4}\ge \frac{\kappa _k^2}{\kappa _{k+1}^2}\frac{L_k}{L_{k+1}}\). By the estimate \(\frac{\kappa _k^2}{\kappa _{k+1}^2}\le \frac{k+2}{2\pi }\) (see [2, Lem. 1]), it is therefore enough to prove \(\frac{k+1}{4}\ge \frac{k+2}{2\pi }\frac{L_k}{L_{k+1}}\). After an elementary calculation, we see that this follows from the recurrence relation \(L_{k+1}=\sum _{i=0}^{k+1}\genfrac(){0.0pt}{}{k+1}{i}\frac{2^i}{i!}=2L_k-\frac{2^k(k-1)}{(k+1)!}\). \(\square \)
References
Betke, U., Wills, J.M.: Stetige und diskrete Funktionale konvexer Körper, Contributions to geometry (Proc. Geom. Sympos., Siegen), Birkhäuser, Basel-Boston. Mass. 1979, 226–237 (1978)
Betke, U., Gritzmann, P., Wills, J.M.: Slices of L. Fejes Tóth’s sausage conjecture. Mathematika 29, 194–201 (1982)
Bey, C., Henk, M., Wills, J.M.: Notes on the roots of Ehrhart polynomials. Discrete Comput. Geom. 38(1), 81–98 (2007)
Blichfeldt, H.F.: Notes on geometry of numbers in the october meeting of the San Francisco section. Bull. Am. Math. Soc. 27(4), 150–153 (1921)
Bourgain, J., Milman, V.D.: New volume ratio properties for convex symmetric bodies in \(\mathbb{R}^n\). Invent. Math. 88, 319–340 (1987)
van der Corput, J.G.: Verallgemeinerung einer Mordellschen Beweismethode in der Geometrie der Zahlen II. Acta Arith. 2, 145–146 (1936)
Davenport, H.: On a principle of Lipschitz. J. Lond. Math. Soc. 26, 179–183 (1951)
Gardner, R.J.: Geometric tomography. Cambridge University Press, New York (1995)
Gillet, H., Soulé, C.: On the number of lattice points in convex symmetric bodies and their duals. Isr. J. Math. 74(2–3), 347–357 (1991)
Gritzmann, P., Wills, J. M.: Lattice points. In: Gruber, P. M., Wills, J. M. (eds.) Handbook of convex geometry, vol. B. North-Holland, Amsterdam (1993)
Henk, M., Henze, M., Wills, J.M.: Blichfeldt-type inequalities and central symmetry. Adv. Geom. 11(4), 731–744 (2011)
Mahler, K.: Ein Minimalproblem für konvexe Polygone. Mathematica (Zutphen) B7, 118–127 (1938)
Nill, B.: Gorenstein toric Fano varieties. Manuscripta Math. 116, 183–210 (2005)
Pick, G.A.: Geometrisches zur Zahlenlehre, Sitzungsber. Lotus Prag 19, 311–319 (1899)
Pikhurko, O.: Lattice points in lattice polytopes. Mathematika 48, 15–24 (2001)
Rogers, C.A., Shephard, G.C.: Convex bodies associated with a given convex body. J. Lond. Math. Soc. 33, 270–281 (1958)
Santaló, L.A.: Un invariante afin para los cuerpos convexos del espacio de \(n\) dimensiones. Portugal. Math. 8, 155–161 (1949)
Schneider, R.: Convex bodies: the Brunn-Minkowski theory. Cambridge University Press, Cambridge (1993)
Schulte, E.: Tilings. In: Gruber, P. M., Wills, J. M. (eds.) Handbook of convex geometry, vol. B. North-Holland, Amsterdam (1993)
Szegő, G.: Orthogonal polynomials, 4th edn. Amer. Math. Soc. Colloq. Publ., vol. 23, Amer. Math. Soc., Providence, RI (1975)
Acknowledgments
We thank Martin Henk for many valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Constantin.
This work was supported by the Deutsche Forschungsgemeinschaft (DFG) within the project He 2272/4-1.
Rights and permissions
About this article
Cite this article
Henze, M. A Blichfeldt-type inequality for centrally symmetric convex bodies. Monatsh Math 170, 371–379 (2013). https://doi.org/10.1007/s00605-012-0461-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-012-0461-2
Keywords
- Blichfeldt-type inequalities
- Davenport inequality
- Central symmetry
- Lattice point enumerator
- Lattice points
- Volume inequalities