Minkowski's second theorem
In mathematics, Minkowski's second theorem is a result in the geometry of numbers about the values taken by a norm on a lattice and the volume of its fundamental cell.
Setting
Let {{mvar|K}} be a closed convex centrally symmetric body of positive finite volume in {{mvar|n}}-dimensional Euclidean space {{math|Rn}}. The gaugeSiegel (1989) p.6 or distanceCassels (1957) p.154Cassels (1971) p.103 Minkowski functional {{math|g}} attached to {{math|K}} is defined by
Conversely, given a norm {{math|g}} on {{math|Rn}} we define {{mvar|K}} to be
Let {{math|Γ}} be a lattice in {{math|Rn}}. The successive minima of {{mvar|K}} or {{math|g}} on {{math|Γ}} are defined by setting the {{mvar|k}}-th successive minimum {{math|λk}} to be the infimum of the numbers {{math|λ}} such that {{math|λK}} contains {{mvar|k}} linearly-independent vectors of {{math|Γ}}. We have {{math|0 < λ1 ≤ λ2 ≤ ... ≤ λn < ∞}}.
Statement
The successive minima satisfyCassels (1957) p.156Cassels (1971) p.203Siegel (1989) p.57
Proof
A basis of linearly independent lattice vectors {{math| b1, b2, ..., bn}} can be defined by {{math|1=g(bj) = λj}}.
The lower bound is proved by considering the convex polytope {{math|2n}} with vertices at {{math|±bj/ λj}}, which has an interior enclosed by {{mvar|K}} and a volume which is {{math|2n/n!λ1 λ2...λn}} times an integer multiple of a primitive cell of the lattice (as seen by scaling the polytope by {{math|λj}} along each basis vector to obtain {{math|2n}} Simplex with lattice point vectors).
To prove the upper bound, consider functions {{math|fj(x)}} sending points {{mvar|x}} in to the centroid of the subset of points in that can be written as for some real numbers . Then the coordinate transform has a Jacobian determinant . If and are in the interior of and (with ) then with , where the inclusion in (specifically the interior of ) is due to convexity and symmetry. But lattice points in the interior of are, by definition of , always expressible as a linear combination of , so any two distinct points of cannot be separated by a lattice vector. Therefore, must be enclosed in a primitive cell of the lattice (which has volume ), and consequently .
References
{{Reflist}}
- {{cite book | first=J. W. S. | last=Cassels | author-link=J. W. S. Cassels | title=An introduction to Diophantine approximation | series=Cambridge Tracts in Mathematics and Mathematical Physics | volume=45 | publisher=Cambridge University Press | year=1957 | zbl=0077.04801 }}
- {{cite book | first=J. W. S. | last=Cassels | author-link=J. W. S. Cassels | title=An Introduction to the Geometry of Numbers | series=Classics in Mathematics | publisher=Springer-Verlag | edition=Reprint of 1971 | year=1997 | isbn=978-3-540-61788-4 }}
- {{cite book | first=Melvyn B. | last=Nathanson | title=Additive Number Theory: Inverse Problems and the Geometry of Sumsets | volume=165 | series=Graduate Texts in Mathematics | publisher=Springer-Verlag | year=1996 | isbn=0-387-94655-1 | zbl=0859.11003 | pages=180–185 }}
- {{cite book | last=Schmidt | first=Wolfgang M. | author-link=Wolfgang M. Schmidt | title=Diophantine approximations and Diophantine equations | series=Lecture Notes in Mathematics | volume=1467 | publisher=Springer-Verlag | year=1996 | edition=2nd | isbn=3-540-54058-X | zbl=0754.11020 | page=6 }}
- {{cite book | first=Carl Ludwig | last=Siegel | author-link=Carl Ludwig Siegel | title=Lectures on the Geometry of Numbers | publisher=Springer-Verlag | year=1989 | isbn=3-540-50629-2 | editor=Komaravolu S. Chandrasekharan | editor-link=Komaravolu S. Chandrasekharan | zbl=0691.10021 }}