The Additive Structure of a Number Ring
We shall need the fact that a subgroup of a free abelian group of rank is a free abelian group of rank . Refer to the group theory notes, or use the following proof by induction. The case is easy to show. Next, assume this fact is true for , and let be the map that projects to the first coordinate. The kernel of this map has rank (it consists of all elements of that have the identity element as their first component). Thus by inductive assumption, is a free abelian group of rank . Now is either or . In the former case, we must have . In the latter, pick such that generates . Then .
Let be a number field of degree over , and let be the ring of algebraic integers in . Suppose . Then there exists an integer such that is integral, because if for , then is a root of the monic polynomial
Thus given any basis of over , we can find a basis consisting of algebraic integers by multiplying by an appropriate constant. Then for such a basis for over , we have a free abelian group of rank inside :
Theorem: Let be a basis for over , and let . Then every can be written in the form
where and for all .
Proof: Write where . Let be the embeddings of in . Then we have the system of equations
Using Cramer's rule, we have where (so and is the same as except that the th column has been replaced by . Thus so is an algebraic integer. As it is also rational, we must have . Lastly, it can be seen that which is an algebraic integer, and since is rational, it follows that is an integer.
Corollary: is a free abelian group of rank
Proof: We have already established that contains a free abelian group of rank . The previous theorem shows that is contained within the free abelian group of rank
Thus has a basis over , that is, there exist such that every can be written as
where . Such a basis is called an integral basis for , or a basis for over .
For example, in the quadratic field for squarefree , an integral basis for its number ring is when and when .
Theorem: Let where is a prime power. Then .
We shall need a couple of lemmas to prove this.
Lemma: For , and .
Proof: The first equation follows directly from . We shall see this implies the second equation (using a generalization of the next theorem), but it is easy to show it directly:
Lemma: For
Proof: Set
Note all (for ) are roots of since they are roots of but not of . So we must have
since there are exactly values of . Then set .
Proof of Theorem: Recall every algebraic integer can be expressed as
where , and . We have previously shown that so must be a power of . We wish to show . If this were not true, then would contain some element
for some , and with .
By the second of the above lemmas, since each is divisible by . Thus . This leads to , from which it follows , which is impossible since while the lemma shows .
Theorem: Let and be two integral bases for . Then .
Proof: We may write
where is an matrix over . From here we can derive the matrix equation , and taking determinants and squaring gives
Now thus divides . A similar argument shows must also divide thus they must be equal.
Note we may use the same argument to show that if and are elements of that generate the same additive subgroup of then , and we may use this fact to define for any additive subgroup of generated by elements.
By the theorem, the discriminant of an integral basis is an invariant of , and we denote it by , and also where is the number ring of .
Example: We have for squarefree