proof of Minkowski’s bound
The proof of Minkowski’s bound will rely on Minkowski’s lattice point theorem (http://planetmath.org/MinkowskisTheorem), but we first need to establish some lemmas.
Lemma 1.
Let be a real number and suppose that for every non-zero ideal of the ring of integers there exists a non-zero with norm .
Then, every ideal class of has a representative satisfying .
Proof.
Let be an ideal class represented by the ideal . Choosing a non-zero then is an ideal of and, by the condition of the lemma, contains a non-zero satisfying .Then, is an ideal representing and .∎
If the real embeddings of are denoted by () and the complex embeddings are together with their complex conjugates (), then we define
Also note that is isomorphic as a real vector space to given by the isomorphism
As and are linear maps (with respect to the field of rationals ), the combination gives a -linear map from to . The image will be a lattice, and we can compute its volume.
Lemma 2.
If is a non-zero ideal of , then is a lattice in (http://planetmath.org/LatticeInMathbbRn). Its fundamental mesh has volume
Proof.
The proof of this is to be added.∎
Lemma 3.
For any , let be the set in consisting of points satisfying
Then, has volume .
Proof.
The proof of this is to be added.∎
Proof of Minkowski’s bound
For an ideal and any constant , let be given by
Letting be the set given in Lemma 3 and , Lemmas 2 and 3 give . As is convex and symmetric about the origin, Minkowski’s theorem tells us that there is a non-zero with .
As the geometric mean is always bounded above by the arithmetic mean, we get the inequality
where . If we choose such that is less than the smallest integer greater than , then this gives and Minkowski’s bound follows from Lemma 1.