Minkowski's second theoremIn 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. SettingLet K be a closed convex centrally symmetric body of positive finite volume in n-dimensional Euclidean space Rn. The gauge[1] or distance[2][3] Minkowski functional g attached to K is defined by Conversely, given a norm g on Rn we define K to be Let Γ be a lattice in Rn. The successive minima of K or g on Γ are defined by setting the k-th successive minimum λk to be the infimum of the numbers λ such that λK contains k linearly-independent vectors of Γ. We have 0 < λ1 ≤ λ2 ≤ ... ≤ λn < ∞. StatementThe successive minima satisfy[4][5][6] ProofA basis of linearly independent lattice vectors b1, b2, ..., bn can be defined by g(bj) = λj. The lower bound is proved by considering the convex polytope 2n with vertices at ±bj/ λj, which has an interior enclosed by K and a volume which is 2n/n!λ1 λ2...λn times an integer multiple of a primitive cell of the lattice (as seen by scaling the polytope by λj along each basis vector to obtain 2n n-simplices with lattice point vectors). To prove the upper bound, consider functions fj(x) sending points 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
|