]> Number Fields - Trace and Norm: Applications

Trace and Norm: Applications

Let R be the number ring corresponding the the number field K. Then it can be easily shown that every unit u satisfies N(u)=±1 . Also, if aR satisfies N(a)=1 , then 1 =n(a) n/d=a(a n/d1 (σ 2 (a)...σ n(a)) n/d) thus a is indeed factor of unity in R since all conjugates of a must also be algebraic integers.

Hence an element aR is a unit if and only if N(a)=±1 . For example, for squarefree m<0 we have that the only units in the number ring of [m] are ±1 if m1 ,3 . If m=1 we also have i,i, and if m=3 , we have the primitive sixth roots of unity. On the other hand [2 ] has infinitely many units generated by the powers of (1 +2 ) (which correspond to the solutions of a 2 2 b 2 =±1 over the integers).

For aR, if N(a) is prime (in ) then clearly a is irreducible. For example, 9 +10 is irreducible in [10 ].

Note x 2 +5 y 2 cannot be 2 or 3 if x,y are integers so all elements of [5 ] of norm 6 are irreducible. Hence in [5 ] we have 2 3 =(1 +5 )(1 5 ) as an example of nonunique factorization.

The trace can be used to show that certain elements are not contained in certain fields. For example, consider the field [α] where α=2 4 . We wish to determine if 3 is contained in this field. If it is, we have the equation 3 =a+bα+cα 2 +dα 3 . Now T(3 )=T(α)=T(α 2 )=T(α 3 )=0 , and T(a)=4 a, thus we must have a=0 . Dividing both sides of the equation by α gives 9 /2 4 =b+cα+dα+a(α 3 )/2 , and taking traces now shows b=0 . Similarly, dividing by α again shows c=0 . We can divide again to show d=0 and thus obtain a contradiction, or simply say that (dα 3 ) 2 =2 d 2 2 3 .