Processing math: 100%

Friday, October 11, 2013

Facts About General Roots of Unity (13.6.1-4)

Dummit and Foote Abstract Algebra, section 13.6, exercises 1-4:

MathJax TeX Test Page 1. Suppose m and n are relatively prime integers. Prove ζmζn is a primitive mnth root of unity.

2. Let d | n. Prove ζdn is a primitive (n/d)th root of unity.

3. Prove that if a field contains the nth roots of unity for odd n then it also contains the 2nth roots of unity.

4. Prove that if n=pkm for p  m then there are precisely m distinct nth roots of unity over a field of characteristic p.

Proof: (1) Let the field in question be of characteristic p or 0, and assume without loss that p  n. Further assume that p m or that the characteristic is 0. Then by (4) we may assume ζm,ζn are of orders m,n respectively. We see (ζmζn)mn=1 so the order of ζmζn is mn. As well, (ζmζn)m=ζmn is of order n, so n divides the order of ζmζn. Similarly m divides this order and ζmζn is of order mn and thus a primitive mnth root of unity (still keeping mind of the case of characteristic p, as the mn zeros of xmn1 are all distinct).

Now assume exclusively characteristic p and m=pkm for p  m. Then xm1=(xm1)pk and so ζm is of order m and ζmζn is of order mn. Finally, we see xmn1=(xmn1)pk so there are exactly mn distinct solutions and thus ζmζn is a primitive mnth root.

(2) Suppose characteristic 0. Then clearly ζdn is of order n/d and at least of this order, so is a primitive root. Suppose characteristic p and write d=pjd and n=pkn for maximal j,k. Then xn/d1=(xn/d1)pkj has n/d solutions, so since ζn is of order n by (4) and thus ζdn of order n/d, we thus have ζdn is primitive.

(3) Since 1 is the 2nd root of unity, by (1) ζn are the 2nth roots of unity.

(4) We have xn1=(xm1)pk where Dxxm1=mx0 has no zeros in common with xm1, so there are m distinct roots of xm1 and thus of xn1.

No comments:

Post a Comment