An elementary proof of Minkowski's second inequality

From MaRDI portal





Let \(K\) be an open convex set in \(n\)-dimensional Euclidean space, symmetric with respect to the origin and of Jordan content (volume) \(V\); Minkowski's inequality to be proved is \[ \lambda_{1} \lambda_{2} \ldots \lambda_{n} V \leq 2^{n}, \] where the \(\lambda_i\) are the ``successive minima of \(K\). Let, for large natural numbers \(\ell\), \(N(\ell)\) denote the number of points of the form \[ \left(2u_1/ \lambda_1 \ell, 2u_2/ \lambda_2 \ell, \ldots, 2u_n/ \lambda_n\ell\right) \tag{*} \] which are in \(K\), the \(u_i\) being integers. From the definition of \(V\) it easily follows that \[ \lim_{\ell \rightarrow \infty} \frac{N(\ell)}{\ell^n}=2^{-n} \lambda_{1} \lambda_{2} \ldots \lambda_{n} V \] and Minkowski's inequality follows from \( N(\ell) \leq \ell^{n}(1+O(1))\). This is proved by dividing the points \(*\) into the ``bad and the ``good types. The ``bad are ``near the boundary of \(K\) and their number is \(o\left(\ell^{n}\right)\). The number of ``good points is shown to be at most \(\ell^n\) by an explicit construction.











This page was built for publication: An elementary proof of Minkowski's second inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565239)