]> Number Theory - Roots of Unity

Number Theory

Roots of Unity

Gauss generalized his method to to find an expression (using radicals) for any root of unity.

Suppose we want to find an expression for a primitve pth root of unity ζ for a prime p, and assume we have done so for smaller primes. Let d,D be factors of p1 such that D=qd for some q. Let g be a generator of p *. Let β be a primitive qth root of unity.

For any expression γ containing ζ, define Sγ to be the same expression with each ζ replaced by ζ g.

Suppose γ satisfies S Dγ=γ. Then define t=γ+βS dγ+β 2 S 2 dγ+...+β q1 S (q1 )dγ

Then replacing ζ by ζ g d in this expression yields β 1 t. Since t q=(β 1 t) q we can equate the coefficients of the powers of ζ as before to argue t q can be expressed in terms of β.

Example: Take d=1 ,D=2 ,p=17 . Then q=2 ,β=1 . If we take γ=x 1 as defined earlier discussing the 17-gon, we see Sx 1 =x 2 ,Sx 2 =x 1 , thus S 2 γ=γ. Then the expression t is simply t=γ+βSγ=x 1 x 2 and we saw before t 2 must be an integer.

To continue, we took d=2 ,D=4 . Again q=2 ,β=1 and we can take γ=y 1 as defined earlier. Then note S 4 γ=γ and we see (y 1 y 2 ) 2 is an integer.

Now define t i to be t where each β has been replaced by β i. Then we have γ=t 1 +...+t qq (a lot of cancellation occurs, from the fact that the sum of the kth roots of unity is zero for any k>1 ). By a similar argument, each t i q is known, and thus if we choose qth roots correctly, then γ=1 q i=1 qt i qq (the symbol does not have its usual meaning here because the particular qth roots we need may not be real). We can use brute force: try every possible root until the resulting γ is correct.

A much better way is to consider the expression t it 1 qi. Then if we change each ζ to ζ g d (that is apply S d) then t i changes to β it i, while from before we know t 1 qi becomes β (qi)t 1 qi, thus their product is unchanged.

Arguing as before, this means t it 1 qi is known for all i, so once we have made a choice for the value of t 1 we can easily find the values for each t i without guesswork.

Example: Let ζ be a primitive fifth root of unity. We shall derive an expression for ζ in terms of a primitive fourth root of unity.

Set d=1 ,D=4 ,p=5 . Take g=2 , since 2 generates 5 *. Then q=4 ,β=i. Set γ to simply ζ, so the t is are: t 1 = ζ+iζ 2 ζ 4 iζ 3 t 2 = ζζ 2 +ζ 4 ζ 3 t 3 = ζiζ 2 ζ 4 +iζ 3 t 4 = ζ+ζ 2 +ζ 4 +ζ 3 =1 We need to compute t 1 4 , choose a fourth root of the result and then work out values for t 2 ,t 3 ,t 4 from there. To make the computation easier we do not blindly proceed using the most obvious method.

Instead we notice t 2 2 =(ζ+ζ 2 +ζ 3 +ζ 4 )+2 (ζ 3 +1 ζ 4 ζ 1 +1 ζ 2 ) =(1 )+2 (2 (1 ))=5 (I've omitted shortcuts I took for clarity, e.g. since 2 5 * the squares of different powers of ζ will be different powers of ζ, and they will add up to 1 .)

Now t 1 2 =(ζ 2 ζ 4 +ζ 3 ζ)+2 (iζ 3 1 iζ 4 iζ+1 +iζ 2 ) =(t 2 )+2 i(t 2 )

Thus t 1 4 =5 (1 +2 i) 2 whence t 1 =α(5 4 1 +2 i) where α is a fourth root of unity.

Now that we have found the solutions of t 1 , we compute t 1 2 t 2 = (t 2 2 )(1 +2 i)=5 (1 +2 i) t 1 t 3 = (ζζ 4 ) 2 (i(ζ 2 ζ 3 )) 2 = (ζ 2 +ζ 3 +ζ 4 +ζ)+2 (1 1 )=5 t 4 = 1 (Actually first equation is unnecessary since we already have t 2 in terms of t 1 from before.)

Thus after some algebraic manipulation we find t 1 = α(5 4 1 +2 i) t 2 = α 2 5 t 3 = α 3 (5 4 1 2 i) t 4 = 1 Finally, we have all four of the primitive fifth roots of unity: ζ=α 2 5 1 +α(5 4 )(1 +2 iα 2 1 2 i)4 where α=±1 ,±i.

If instead we had chosen d=1 ,D=2 , and then d=2 ,D=4 (i.e. mirror the process used for the 17th roots of unity) we have ζ expressed in terms of a primitive square root of unity (i.e. over the rationals, since 1 is rational): ζ=5 1 ±2 5 10 4 ,5 1 ±2 5 10 4 which can be verified to be the same solutions.