paper

Applications of Siegel's Lemma to a system of linear forms and its minimal points

arXiv:1904.06121 · doi:10.2140/moscow.2022.11.125

Abstract

Consider a real matrix consisting of rows , for . The problem of making the system linear forms for integers small naturally induces an ordinary and a uniform exponent of approximation, denoted by and respectively. For , a sharp lower bound for the ratio was recently established by Marnat and Moshchevitin. We give a short, new proof of this result upon a hypothesis on the best approximation integer vectors associated to . Our conditional result extends to general (but may not be optimal in this case). Moreover, our hypothesis is always satisfied in particular for and thereby unconditionally confirms a previous observation of Jarník. We formulate our results in the more general context of approximation of subspaces of Euclidean spaces by lattices. We further establish criteria upon which a given number of consecutive best approximation vectors are linearly independent. Our method is based on Siegel's Lemma.

29 pages

References in corpus (3)

Cited by in corpus (2)