14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

366 <strong>Geometry</strong> of Numbers<br />

22 Minkowski’s First Fundamental Theorem<br />

We cite Cassels [195], prologue:<br />

We owe to MINKOWSKI the fertile observation that certain results which can be<br />

made almost intuitive by consideration of figures in n-dimensional Euclidean space<br />

have far-reaching consequences in diverse branches of number theory. For example,<br />

he simplified the theory of units in algebraic number fields <strong>and</strong> both simplified<br />

<strong>and</strong> extended the theory of approximation of irrational numbers by rational ones<br />

(Diophantine Approximation). This new branch of number theory, which<br />

MINKOWSKI christened “The <strong>Geometry</strong> of Numbers”, has developed into an independent<br />

branch of number theory which, indeed, has many applications elsewhere<br />

but which is well worth studying for its own sake.<br />

Minkowski’s fundamental theorem is one among a small number of basic results<br />

of the geometry of numbers alluded to by Cassels. It relates the basic notions of lattices<br />

<strong>and</strong> convex bodies. The fundamental theorem is simple, almost trivial <strong>and</strong>, at the<br />

same time, deep. There exist numerous generalizations <strong>and</strong> arithmetic consequences<br />

of it. The following remark of Hilbert well describes the situation, see Rose [856]:<br />

The art of doing mathematics consists in finding that special case which contains all<br />

the germs of generality.<br />

In this section we present the fundamental theorem together with some of its classical<br />

applications dealing with Diophantine approximation, representation of integers as<br />

sums of squares, <strong>and</strong> estimates for discriminants of polynomials.<br />

For a wealth of different versions, related results <strong>and</strong> further applications, see<br />

Cassels [195], Kannan [563], <strong>Gruber</strong> <strong>and</strong> Lekkerkerker [447] <strong>and</strong> Erdös, <strong>Gruber</strong> <strong>and</strong><br />

Hammer [307].<br />

22.1 The First Fundamental Theorem<br />

Let f : E d → R. The arithmetic problem of finding a solution u = (u1,...,ud) of<br />

the inequality<br />

f (x1,...,xd) ≤ 1,<br />

where the ui are integers, not all equal to 0, is equivalent to the geometric problem<br />

of finding a point of the integer lattice Z d different from o <strong>and</strong> contained in the set<br />

{x : f (x) ≤ 1}.<br />

This led Minkowski to look for conditions which guarantee that a set, in particular a<br />

convex body, contains points of a lattice different from the origin. The result was his<br />

first fundamental theorem.<br />

In this section we present Minkowski’s theorem together with three elegant <strong>and</strong><br />

convincing proofs, each based on a different idea.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!