For a full lattice in and a -symmetric convex body with gauge function , Weyl's 1942 paper 'On Geometry of Numbers' proved two basis inequalities. First (his Theorem V, found independently by Mahler): for every reduced basis — one with whenever — the normalized product lies between and . Second (his Theorem VI): every pair admits some basis with the product at most , an explicit constant of order . The two basis inequalities are due to Mahler (1938) and Weyl (1942) independently, and the determination of their exact constants is explicitly open in this lineage: Mahler (1964) asks for the exact value of the basis-existence constant at least for small , and Remak (1938) records the true diagonal-product bound for Minkowski-reduced positive definite quadratic forms as unknown for larger . This problem asks for the sharp constants and as functions of , and for the sharp constant in for Minkowski-reduced forms (with , , sharp and classical, Mahler 1964 citing van der Waerden; this question is open from ). The known interval for — from up to Weyl's value — leaves even the exponential order of the optimal constants undetermined. The exact values of and are unknown in every dimension , and the exact value of is unknown for .
Background
A lattice in is the set of all integer linear combinations of a basis of ; its determinant is the volume of a fundamental cell, i.e. the volume of the parallelotope spanned by any of its bases. A -symmetric convex body (a compact convex set with nonempty interior, symmetric under ) determines a gauge function , so that ; conversely every norm on arises this way. The successive minima of with respect to are the smallest numbers such that contains linearly independent points of . Minkowski's second theorem, a cornerstone of the geometry of numbers, bounds their product:
and both inequalities are sharp (attained, for example, by the octahedron with for the lower bound, and by the cube with for the upper bound).
The vectors realizing the successive minima need not form a basis of , which motivates basis-selection statements. An ordered basis of is called reduced (in the sense of Minkowski, Mahler, and Weyl) if for every and all integers with one has ; such bases always exist. For reduced bases the normalized products fill a finite range: the First Finiteness Theorem, found independently by Mahler and Weyl, states
The standard proofs lose a factor at each induction step, so grows like and is expected to be far from optimal, while the lower bound decreases rapidly in . Weyl also proved a basis-existence version (his Theorem VI): every pair admits some basis (not necessarily reduced) with , where and is determined by ; thus , and grows only like , roughly — dramatically faster than the lower bound but dramatically slower than .
When is the unit ball of a positive definite quadratic form (an ellipsoid; ), the reducedness condition above coincides with the classical Minkowski reduction of : writing for the Gram matrix in the reduced basis and for the discriminant, Minkowski's reduction theory gives a bound for reduced forms, with , , sharp and classical (Mahler 1964, citing van der Waerden) and non-sharp reduction-theory values , , ; general upper bounds on follow from bounds on the Hermite constant (the largest, over positive definite forms of determinant in variables, of the minimum of the form on nonzero integer vectors), notably those of Blichfeldt, refined by Remak. The exact is not known for .
Aitchison (1972) delimited the qualitative landscape: the finiteness properties underlying these theorems — that reducedness can be certified by finitely many inequalities, and that only finitely many unimodular transformations (changes of lattice basis by an integer matrix of determinant ) need be considered — hold for general bodies in dimensions at most but only for ellipsoids in dimensions ; sharp general constants therefore cannot come from a finite case analysis. In modern computational lattice reduction, the quality of a basis is measured by the orthogonality defect, the ratio of the product of the basis vector lengths to the lattice determinant — exactly the Euclidean specialization of the products above; its optimal value for reduced bases is likewise unknown in general dimension. Recent adjacent results — a reverse Minkowski theorem bounding lattice-point counts from determinant constraints (Regev and Stephens-Davidowitz), and restricted successive minima over sublattices (Henk and Thiel) — address different quantities and do not determine Weyl's constants.
Problem Statement
Determine the sharp constants in the three inequalities (A)–(C) below, as functions of the dimension .
(A) : the smallest constant such that for every full lattice , every -symmetric convex body with gauge , and every reduced basis of ,
where a basis of is called reduced (with respect to the gauge ) if for every and all integers with one has (such bases exist for every pair ). Known: .
(B) : the smallest constant such that every pair as above admits some basis (not necessarily reduced) with
Known: , where is the integer determined by (this upper bound is Weyl's explicit value; ).
(C) : the smallest constant such that every Minkowski-reduced positive definite quadratic form in variables with Gram matrix and discriminant satisfies
where is Minkowski-reduced when is its Gram matrix with respect to a basis that is reduced, in the sense of (A), for the gauge . Known: , , are sharp and classical (Mahler 1964, citing van der Waerden); reduction theory gives the non-sharp values , , , and general upper bounds via the Hermite constant (Minkowski, Blichfeldt, Remak), none sharp; the question is open from .
The three questions form one objective — the exact strength of the reduced-basis mechanism — and are related: a reduced basis is in particular a basis, so ; and (C) is exactly (A) restricted to ellipsoid gauges, since the Minkowski-reduction condition on a form coincides with reducedness for the gauge (the constants then determine each other through the unit-ball volume). The exact value of each optimal constant is determined, as a function of , as the corresponding supremum or infimum, and, where the extremum is attained, the extremal bodies, lattices, and bases are to be identified as well. The quantifiers in (A)–(C) range over all full lattices , all -symmetric convex bodies (not only ellipsoids or polytopes), and the corresponding bases — reduced in (A) and (C), arbitrary in (B).
References
- H. F. Blichfeldt, 'The minimum values of positive quadratic forms in six, seven and eight variables', Mathematische Zeitschrift 39 (1935), 1–15. DOI: 10.1007/BF01201341. https://doi.org/10.1007/BF01201341
- K. Mahler, 'On Minkowski's theory of reduction of positive definite quadratic forms', Quarterly Journal of Mathematics, Oxford Series 9 (1938), 259–262. DOI: 10.1093/qmath/os-9.1.259. https://doi.org/10.1093/qmath/os-9.1.259
- Robert Remak, 'Über die Minkowskische Reduktion der definiten quadratischen Formen', Compositio Mathematica 5 (1938), 368–391. Full text open access: https://www.numdam.org/item/CM_1938__5__368_0/ (no DOI registered)
- Hermann Weyl, 'On Geometry of Numbers', Proceedings of the London Mathematical Society (2) 47 (1942), 268–289. DOI: 10.1112/plms/s2-47.1.268. https://doi.org/10.1112/plms/s2-47.1.268
- Claude Ambrose Rogers, 'A note on a problem of Mahler', Proceedings of the Royal Society of London, Series A 191 (1947), 503–517. DOI: 10.1098/rspa.1947.0130. https://doi.org/10.1098/rspa.1947.0130
- Edmund Hlawka, 'Zur Theorie des Figurengitters', Mathematische Annalen 125 (1952), 183–207. DOI: 10.1007/BF01343116. https://doi.org/10.1007/BF01343116
- R. P. Bambah, Alan Woods, Hans Zassenhaus, 'Three proofs of Minkowski's second inequality in the geometry of numbers', Journal of the Australian Mathematical Society 5 (1965), 453–462. DOI: 10.1017/s1446788700028482. https://doi.org/10.1017/s1446788700028482
- K. Mahler, 'Inequalities for ideal bases in algebraic number fields', Journal of the Australian Mathematical Society 4 (1964), 425–448. DOI: 10.1017/s144678870002526x. https://doi.org/10.1017/s144678870002526x
- A. C. Woods, 'A generalisation of Minkowski's second inequality in the geometry of numbers', Journal of the Australian Mathematical Society 6 (1966), 148–152. DOI: 10.1017/s1446788700004729. https://doi.org/10.1017/s1446788700004729
- Indar S. Luthar, 'A note on a result of Mahler's', Journal of the Australian Mathematical Society 6 (1966), 399–401. DOI: 10.1017/s1446788700004870. https://doi.org/10.1017/s1446788700004870
- I. Danicic, 'An elementary proof of Minkowski's second inequality', Journal of the Australian Mathematical Society 10 (1969), 177–181. DOI: 10.1017/s1446788700007023. https://doi.org/10.1017/s1446788700007023
- P. W. Aitchison, 'Two finiteness theorems in the Minkowski theory of reduction', Journal of the Australian Mathematical Society 14 (1972), 336–351. DOI: 10.1017/s1446788700010818. https://doi.org/10.1017/s1446788700010818
- Paul R. Scott, 'Modifying Minkowski's theorem', Journal of Number Theory 29 (1988), 13–20. DOI: 10.1016/0022-314X(88)90090-X. https://doi.org/10.1016/0022-314X(88)90090-X
- Edward B. Burger, J. Vaaler, 'On the decomposition of vectors over number fields', Journal für die reine und angewandte Mathematik 435 (1993), 197–219. DOI: 10.1515/crll.1993.435.197. https://doi.org/10.1515/crll.1993.435.197
- Martin Henk, Carsten Thiel, 'Restricted successive minima', Pacific Journal of Mathematics 269 (2014), 341–354. DOI: 10.2140/pjm.2014.269.341. https://doi.org/10.2140/pjm.2014.269.341
- Oded Regev, Noah Stephens-Davidowitz, 'A reverse Minkowski theorem', Annals of Mathematics (2) 199 (2024), 1–49. DOI: 10.4007/annals.2024.199.1.1. https://doi.org/10.4007/annals.2024.199.1.1 (preprint: arXiv:1611.05979, https://arxiv.org/abs/1611.05979)
- Jan-Hendrik Evertse, 'Mahler's work on the geometry of numbers', arXiv:1806.00356 (2018). https://arxiv.org/abs/1806.00356
- Nickolas Andersen, William Duke, 'The Minkowski chain and Diophantine approximation', Journal de Théorie des Nombres de Bordeaux 32 (2020), 503–523. DOI: 10.5802/jtnb.1132. https://doi.org/10.5802/jtnb.1132
- Ansgar Freyer, Eduardo Lucas, 'Interpolating between volume and lattice point enumerator with successive minima', Monatshefte für Mathematik 198 (2022), 717–740. DOI: 10.1007/s00605-022-01713-1. https://doi.org/10.1007/s00605-022-01713-1
- Christian Porter, 'Strongly Reduced Lattice Bases', arXiv:2304.12135 (2023). https://arxiv.org/abs/2304.12135
- R. J. Hans-Gill, Madhu Raka, Ranjeet Sehmi, 'Lecture Notes on Geometry of Numbers', Springer, 2024. DOI: 10.1007/978-981-99-9602-5. https://doi.org/10.1007/978-981-99-9602-5