Chapter 4
Geometry of numbers
4.1. Lattices
Definition 4.1.1. §
A lattice in an finite-dimensional -vector space is an abelian subgroup of that is generated by a finite set of -linearly independent vectors.
Definition 4.1.2. §
A lattice in a finite-dimensional -vector space is said to be complete, or full, if its elements span .
The following is an immediate consequence of the definitions.
Lemma 4.1.3. §
If is a complete lattice in a finite-dimensional -vector space , then is generated by a basis of .
Definition 4.1.4. §
Let be a complete lattice in a finite-dimensional vector space . The fundamental domain of relative to a -basis of is the set
The following is essentially immediate.
Lemma 4.1.5. §
If is a fundamental domain of a complete lattice in a vector space , then every element of may be written uniquely in the form for some and some .
Of course, a finite-dimensional -vector space has a Euclidean metric with respect to any basis of (as such a basis defines an isomorphism for some ). Though the metric depends upon the choice of basis, the resulting topology is independent of the choice of basis.
Definition 4.1.6. §
We say that a subgroup of an finite-dimensional -vector space is discrete if it has the discrete topology as a subspace of .
In other words, a subgroup of a finite-dimensional real vector space is discrete if for every there exists an open neighborhood of in such that . The following is elementary.
Lemma 4.1.7. §
A discrete subgroup of a finite-dimensional -vector space is a closed subset of .
Proposition 4.1.8. §
A subgroup of a finite-dimensional -vector space is discrete if and only if it is a lattice.
Proof.
Let be an -dimensional -vector space for some , and let be a subgroup. If is a lattice, then for some linearly independent and . Extend these to an ordered basis of . Let for some . Then
is an open neighborhood in containing but no other elements of . Thus is discrete.
Conversely, suppose is discrete. Let be the subspace of spanned by , and let be linearly independent with maximal, so that the necessarily span . Let . We claim that is of finite index in . By definition, is a complete lattice in , so so we may choose a system of representatives of the cosets inside the fundamental domain of in . That is, . However, is discrete and closed and is a bounded set, so the intersection of with the closure of is discrete and compact, hence finite. Since is then finite, has only finitely many elements.
Now set . Then , and is a free abelian group of rank , so is free of rank (at most) . In other words, is a lattice. □
Lemma 4.1.9. §
A lattice in is complete if and only if there exists a bounded subset of such that every element of is the sum of an element of and an element of .
Proof.
If is a complete lattice, we may let be the fundamental domain of relative to a basis, and in fact every element of may in that case be written uniquely as an element of .
Suppose that there exists a as in the statement of the lemma. Let be the -span of , and let . For each , write with and . As is bounded, we have
so
But for all and is closed, so . □
We will suppose now that our finite-dimensional vector space comes equipped with a symmetric, positive definite inner product
In other words, is an finite-dimensional real inner product space. The Euclidean metric defined by a choice of an orthonormal basis of is independent of the choice. The resulting Lebesgue measure on has the property that the cube defined by an orthonormal basis of has volume (i.e., measure) one.
Definition 4.1.10. §
Let be an finite-dimensional real vector space with a symmetric, positive definite inner product . Let be a complete lattice in . The volume of lattice is the volume of the fundamental domain of relative to a -basis of .
Remark 4.1.11. §
That the volume of is indepedendent of the choice of basis is a consequence of the following lemma.
Lemma 4.1.12. §
Let be an -dimensional real inner product space. Let be an orthonormal basis of . Let be a complete lattice in with basis , write
and let . Then
Proof.
The first equality is a standard statement of linear algebra. The second is the fact that
since . □
Definition 4.1.13. §
Let be a subset of a finite-dimensional vector space .
- a.
-
We say that is convex if it contains the line segment
between any two vectors .
- b.
-
We say that is symmetric about the origin if for all .
Now we come to the main theorem of this subsection.
Theorem 4.1.14 (Minkowski’s theorem). §
Let be an -dimensional real inner product space, and let be a complete lattice in . Let be a convex, measurable subset of that is symmetric about the origin, and suppose that
Then .
Proof.
Let
If , then , so as is symmetric about the origin. If as well, then
since is convex. We therefore have that the difference of any two points of is in . Note also that .
Let a the fundamental domain for . Suppose that the sets for were pairwise disjoint. Then we would have
the latter equality following since the sets cover . This does not hold by assumption, so there exist distinct such that is nonempty. But then , so . □
4.2. Real and complex embeddings
Let be an number field of degree over . Then, since is separable and is algebraically closed, then we obtain the product
of embeddings of in .
Definition 4.2.1. §
Let be a number field.
- a.
-
A real embedding (or real prime) of is a field embedding of in .
- b.
-
A complex embedding of is a field embedding of in that does not have image contained in .
- c.
-
A complex prime of is an unordered pair of complex embeddings such that for , where denotes the complex conjugate of .
- d.
-
An archimedean prime of is either a real prime or a complex prime.
Notation 4.2.2. §
The number of real (resp., complex) primes of a number field is denoted (resp., ).
We can also apply Proposition 1.1.1 to obtain the following.
Theorem 4.2.3. §
Let be a number field. Then . In fact, we have an isomorphism of -algebras
where for is the product of the real embeddings of applied to and one complex embedding from each complex prime of applied to .
Proof.
Let and be the minimal polynomial of . In , we may write
for some with , where and is irreducible quadratic. Note that for each via maps that take to a chosen root of in . By Proposition 1.1.1, we then have
and the composition of the natural inclusion of in is the product of the real embeddings of and one choice of complex embedding of among pairs of complex conjugate embeddings (i.e., complex primes). We therefore have and . □
Examples 4.2.4. §
Remark 4.2.5. §
Given a number field , Theorem 4.2.3 provides us with a product of embeddings
corresponding to the real and complex primes of .
4.3. Finiteness of the class group
Throughout this section, we let be a number field of degree over . We set and . We let for be the real embeddings of , and we let for be a choice of complex embedding from each complex prime of . We identify with as in Theorem 4.2.3.
We endow with the Lebesgue measure on , where the inverse of said isomorphism is defined by
Proposition 4.3.1. §
Let be a nonzero ideal of . Then is a complete lattice in and
Proof.
Let be a -basis of . Consider the matrix with th row
and the matrix with th row
Simple column operations yield that , and Lemmas 1.4.10 and 1.4.6 imply that
In particular, , so the rows of images of the in are -linearly independent, which is to say that is complete. Since Lemma 4.1.12 implies that , we have the result. □
Notation 4.3.2. §
We define a norm on by
for . For , let
We compute the volume of .
Lemma 4.3.3. §
We have
Proof.
We treat this as a problem about the real inner product space of dimension . Let be the subset of inside of elements with nonnegative real coordinates. Then . Suppose first that and the result holds for . Then we have
Next, suppose that and the result holds for . By elementary calculation, we obtain
□
Proposition 4.3.4. §
For any nonzero ideal of , there exists such that
Proof.
Let be such that
| (4.3.1) |
Since is a lattice, Minkowski’s theorem ensures that contains for some nonzero . Note that is the product of images of under the distinct field embeddings of in . Hence, we have
and since the arithmetic mean bounds the geometric mean, this is at most the th power of
On the other hand, since , the latter quantity is less than , so we have . Now, Lemma 4.3.3 and Proposition 4.3.1 allow us to rewrite (4.3.1) as
Set
so . We can and do choose to be less than the smallest integer greater than . Since is an integer, we must then have that . □
Definition 4.3.5. §
Let be a number field of degree over . The Minkowski bound is the quantity
Proposition 4.3.4 has the following interesting corollary
Corollary 4.3.6. §
The discriminant of a number field satisfies .
Proof.
Take in Proposition 4.3.4, and note that for all . □
Theorem 4.3.7 (Minkowski). §
Let be a number field of degree over . Then there exists a set of representatives for the ideal class group of consisting of integral ideals with .
Proof.
Let be a fractional ideal of . Let be such that is an integral ideal. By Proposition 4.3.4, there exists with . Now, note that for some ideal of , and the ideal class of is the ideal class of , which is the ideal class of . Furthermore, we have that , so , as desired. □
As a consequence, we have the following theorem.
Theorem 4.3.8. §
The class group of a number field is finite.
Proof.
In fact, the set of nonzero integral ideals with is finite. To see this, write for distinct prime ideals and for some . Then
where with prime. Since there are only finitely many positive integers less than , there are only finitely many primes that could divide , and the exponents of these primes are bounded (e.g., by ). Since each prime of has only finitely many primes of lying over it, we are done. □
Definition 4.3.9. §
The class number of a number field is the order of the class group .
The Minkowski bound allows us to actually give bounds on the class number of a number field and sometimes, to actually compute the class group.
Example 4.3.10. §
Consider . Note that , so the Minkowski bound is
Since is not a UFD, it is not a PID, so . Since ramifies in , the class of the prime over it in is the only nontrivial element in . We therefore have .
Example 4.3.11. §
Consider . In this case , and the Minkowski bound is
Set so that . Since the norm of any prime of is at least the prime with , there exists a set of representatives for dividing . The minimal polynomial of is , which splits modulo . Therefore, the class group is generated by the two primes over . Their classes are inverse to each other, so is generated any one of them, which we denote . For , we have if and only if . Note that
so is principal and is a UFD.
4.4. Dirichlet’s unit theorem
Lemma 4.4.1. §
Let . The set of algebraic integers such that and for all archimedean embeddings of is finite.
Proof.
Let be such an integer, and let be its minimal polynomial in . In , we have , the product being taken over the archimedean embeddings. Then is bounded: e.g., it satisfies for all . As each is an integer, the number of minimal polynomials of elements in the stated set, and hence the order of the set, is finite. □
Corollary 4.4.2. §
Let be a number field. Then is a finite group, equal to the set of all such that for all archimedean embeddings of .
Proof.
If satisfies for all , then so does for all . Since the set of such is finite by Lemma 4.4.1, the group is finite, and hence . In particular, since a root of unity has complex absolute value under any archimedean embeddings, the set is finite. □
Definition 4.4.3. §
The unit group of a number field is the group of units in .
Definition 4.4.4. §
For a number field , we let be defined on as
where are the real embeddings of and are the complex embeddings of .
Proposition 4.4.5. §
For a number field , the set is a lattice in that sits in the hyperplane
and .
Proof.
That is just a rewording of Corollary 4.4.2. For , we have that
the latter equality by Corollary 2.5.18, so . For , consider the bounded subset
of . By Lemma 4.4.1, the set of elements of contained in is finite, which means that there exists an open neighborhood in such that the intersection is . This implies that is a discrete group: the set is also open and its intersection with is . Finally, recall that a discrete subgroup of is a lattice. □
Proposition 4.4.5 implies that the sequence
is exact and that the set is a free abelian group of finite rank. In particular, is a finitely generated abelian group of rank that of , and the sequence is split. If is a complete lattice in , then we know that the rank of is . Dirichlet’s unit theorem tells us that this is in fact the case. For this, we require the following lemma.
Lemma 4.4.6. §
Let for some satisfy for all and for all . Then is invertible.
Proof.
Suppose by way of contradication that is a solution to , scaled so that for some and for all . Then
| (4.4.1) |
Note that for since is negative and . Thus, the right-hand side of (4.4.1) is at least , which is the desired contradiction. □
For a number field , let us use to identify and as rings. We can then make the following definition.
Notation 4.4.7. §
For a number field , we let
denote the multiplicative function given by
for with and with .
The following rather complicated lemma is useful in showing the completeness of in .
Lemma 4.4.8. §
Let be a number field of degree . Set
Let be a bounded, convex subset of that is symmetric about the origin and has volume
There exist for some such that for each , there exists some and such that .
Proof.
For , the set
is a complete lattice with volume . Suppose . Since , we have
the latter equality by Proposition 4.3.1. Minkowski’s theorem then tells us that there exists such that .
Since is bounded, there exists such that for all . In particular, we have , which since forces and then . As there are only finitely many ideals of absolute norm at most , there are only finitely many ideals such that for some . Let be these ideals.
Finally, given , let have the property that . Then for some , so and . □
Theorem 4.4.9 (Dirichlet’s unit theorem). §
Let be a number field. Then we have an isomorphism
Proof.
Let , , and be as in Lemma 4.4.8. Set
Since is bounded, we may let be such that if , then for all . For , let
be an element such that for but . Then , so there exists such that . In particular, we must have
with for all . In other words, has negative coordinates for .
Assume without loss of generality that . Set
Consider the matrix . For , we have that the sum of the th row is
as and . Lemma 4.4.6 then tells us that is invertible, so the for form a system of linearly independent vectors in . In other words, is a complete lattice. □
Example 4.4.10. §
Let for some square-free integer , . If is a real quadratic field, which is to say that , then and . Since the complex conjugate of a root of unity equals if and only if , we have in this case that and
If is an imaginary quadratic field, which is to say that , then and . In this case, since , the field cannot contain any roots of unity aside from th and th roots of . But and for a primitive rd root of , so for , we have unless or , in which case and , respectively.
Example 4.4.11. §
Let . In this case, we know that is generated by for some of infinite order. To find such that , we note that . Suppose we choose with , which can be done since
The is known as the fundamental unit for .
If we consider for , it is not hard to check that and . Therefore, we must find a solution to with or minimal (and therefore both), e.g., . That is, is a fundamental unit for .
Example 4.4.12. §
Let be a positive integer, and let be or according to whether is even or odd, respectively. We have