]> Number Fields - The Additive Structure of a Number Ring

The Additive Structure of a Number Ring

We shall need the fact that a subgroup H of a free abelian group G of rank n is a free abelian group of rank n. Refer to the group theory notes, or use the following proof by induction. The case n=1 is easy to show. Next, assume this fact is true for n1 , and let Π:G be the map that projects to the first coordinate. The kernel K of this map has rank n1 (it consists of all elements of G that have the identity element as their first component). Thus by inductive assumption, HK is a free abelian group of rank n1 . Now Π(H) is either {0 } or . In the former case, we must have H=HK. In the latter, pick hH such that Π(h) generates Π(H). Then H=h(HK).

Let K be a number field of degree n over , and let R be the ring of algebraic integers in K. Suppose αK. Then there exists an integer m such that mα is integral, because if a nα n+...+a 0 =0 for a 0 ,...,a n, then a nα is a root of the monic polynomial

x n+a n1 x n1 +a na n2 x n2 ...+a n n1 a 0

Thus given any basis of K over , we can find a basis consisting of algebraic integers by multiplying by an appropriate constant. Then for such a basis α 1 ,...,α nR for K over , we have a free abelian group of rank n inside R:

{m 1 α 1 +...+m nα n:m i}=α 1 +...+α n

Theorem: Let {α 1 ,...,α n}R be a basis for K over , and let d=disc(α 1 ,...,α n). Then every αR can be written in the form

α=m 1 α 1 +...+m nα nd

where m j and dm j 2 for all j.

Proof: Write α=x 1 α 1 +...+x nα n where x j. Let σ 1 ,...,σ n be the embeddings of K in . Then we have the system of equations

σ i(α)=x 1 σ i(α 1 )+...+x nσ i(α n)

Using Cramer's rule, we have x j=γ j/δ where δ=σ i(α j) (so δ 2 =d and γ j is the same as δ except that the jth column has been replaced by σ i(α). Thus dx j=δγ j so dx j is an algebraic integer. As it is also rational, we must have m j=dx j. Lastly, it can be seen that m j 2 /d=γ j 2 which is an algebraic integer, and since m j 2 /d is rational, it follows that m j 2 /d is an integer.

Corollary: R is a free abelian group of rank n

Proof: We have already established that R contains a free abelian group of rank n. The previous theorem shows that R is contained within the free abelian group of rank n

α 1 d...α nd

Thus R has a basis over , that is, there exist β 1 ,...,β nR such that every αR can be written as

α=m 1 β 1 +...+m nβ n

where m i. Such a basis is called an integral basis for R, or a basis for R over .

For example, in the quadratic field [m] for squarefree m, an integral basis for its number ring R is {1 ,m} when m=2,3 (mod4 ) and {1 ,(1 +m)/2 } when m=1 (mod4 ).

Theorem: Let ω=e 2 πi/m where m=p r is a prime power. Then 𝔸[ω]=[ω].

We shall need a couple of lemmas to prove this.

Lemma: For m3 , [1 ω]=[ω] and disc(1 ω)=disc(ω).

Proof: The first equation follows directly from ω=1 (1 ω). We shall see this implies the second equation (using a generalization of the next theorem), but it is easy to show it directly:

disc(ω) = 1 r<sn(α rα s) 2 = 1 r<sn((1 α r)(1 α s)) 2 = disc(1 ω)

Lemma: For m=p r

1 km,pk(1 ω k)=p

Proof: Set

f(x)=x p r1 x p r1 1 =1 +x p r1 +x 2 p r1 +...+x (p1 )p r1

Note all ω k (for pk) are roots of f since they are roots of x p r1 but not of x p r1 1 . So we must have

f(x)= k(xω k)

since there are exactly ϕ(p r)=(p1 )p r1 values of k. Then set x=1 .

Proof of Theorem: Recall every algebraic integer α can be expressed as

α=m 1 +m 2 (1 ω)+...+m n(1 ω) n1 d

where n=ϕ(p r), m i and d=disc(ω). We have previously shown that disc(ω)m ϕ(m) so d must be a power of p. We wish to show R=[ω]=[1 ω]. If this were not true, then R would contain some element

β=m i(1 ω) i1 +m i+1 (1 ω) i+...+m n(1 ω) n1 p

for some in, and m j with pm i.

By the second of the above lemmas, p/(1 ω n)[ω] since each 1 ω k is divisible by 1 ω. Thus βp/(1 ω i)R. This leads to m i/(1 ω)R, from which it follows N(1 ω)N(m i), which is impossible since N(m i)=m i n while the lemma shows N(1 ω)=p.

Theorem: Let {β 1 ,...,β n} and {γ 1 ,...,γ n} be two integral bases for R=𝔸K. Then disc(β 1 ,...,β n)=disc(γ 1 ,...,γ n).

Proof: We may write

(β 1 β n)=M(γ 1 γ n)

where M is an n×n matrix over . From here we can derive the matrix equation [σ j(β i)]=M[σ j(γ i)], and taking determinants and squaring gives

disc(β 1 ,...,β n)=M 2 disc(γ 1 ,...,γ n)

Now M thus disc(β 1 ,...,β n) divides disc(γ 1 ,...,γ n). A similar argument shows disc(γ 1 ,...,γ n) must also divide disc(β 1 ,...,β n) thus they must be equal.

Note we may use the same argument to show that if {β 1 ,...,β n} and {γ 1 ,...,γ n} are elements of K that generate the same additive subgroup of K then disc(β 1 ,...,β n)=disc(γ 1 ,...,γ n), and we may use this fact to define disc(G) for any additive subgroup G of K generated by n elements.

By the theorem, the discriminant of an integral basis is an invariant of R, and we denote it by disc(R), and also disc(K) where R is the number ring of K.

Example: We have for squarefree m

disc([m])={disc(m)=4 m if m=2,3 (mod4 ) disc(1 +m2 )=m if m=1 (mod4 )