]> Number Theory - Gaussian Periods

Gaussian Periods

As before, let ζ=e 2 πi/17 be a primitive 17th root of unity. Define x 1 ,x 2 by

x 1 =ζ 3 0 +ζ 3 2 +...+ζ 3 14 x 2 =ζ 3 1 +ζ 3 3 +...+ζ 3 15

These are examples of Gaussian periods. We stated before that x 1 x 2 is a rational that is easy to compute. Why?

Write (x 1 x 2 ) 2 as

(x 1 x 2 ) 2 =a 0 +a 1 ζ 3 1 +a 2 ζ 3 2 +...+a 16 ζ 3 16 .

for integers a i. Replacing ζ with ζ 3 merely swaps x 1 and x 2 due to their construction, whence

(x 2 x 1 ) 2 =a 0 +a 1 ζ 3 2 +a 2 ζ 3 3 +...+a 16 ζ 3 17 .

Thus looking at the coefficients of the powers of ζ we have a 16 =a 1 ,a 1 =a 2 ,...,a 15 =a 16 , that is, they are all equal to some integer a:

(x 2 x 1 ) 2 =a 0 +a(ζ+...+ζ 16 )=a 0 a

Thus x 1 x 2 =((x 1 +x 2 ) 2 (x 1 x 2 ) 2 )/4 is some rational number.

To compute x 1 x 2 , we count the number of times b that ζ rζ s=1 where r is a quadratic residue modulo 17 and s is a nonresidue, and then count the number of times c that ζ rζ s=ζ. Since we know the answer is rational, each power of ζ appears exactly c times so the answer is bc.

Since 17 =1 (mod4 ) we know 1 is a quadratic residue, hence if r is a quadratic residue so is r. This means b=0 . Unfortunately I don’t know how to quickly count the number of ways r+s=1 . From the list of powers of 3, the quadratic residues are

1 ,9 ,13 ,15 ,16 ,8 ,4 ,2 .

Since r is also a quadratic residue we can count the solutions to sr=1 instead, in other words, if r is a quadratic residue how often is r+1 a quadratic nonresidue?

We see for r=2 ,4 ,9 ,13 that r+1 is not a quadratic residue, so c=4 , hence x 1 x 2 =4 .

A Loose End

Before we argued that given

a 0 +a 1 ζ 3 1 +...+a 16 ζ 3 16 =a 0 +a 1 ζ 3 2 +...+a 16 ζ 3 17

we can equate coefficients of the powers of ζ. Let us see why. In the above equation, we can move all terms to one side then divide through by ζ to find b i such that

b 1 +b 2 ζ+...+b 16 ζ 15 =0

(each b i is the difference between some a j and a k). Then consider the polynomial g(x)=b 1 +b 2 x+...+b 16 x 15 . Now ζ is a root of g as well as the polynomial

f(x)=1 +x+...+x 16 .

Hence ζ must also be a root of d=gcd(f,g). If g0 , then the polynomial d is a nonzero polynomial dividing f with degree at most g, which is smaller than the degree of f. This is a contradiction since f has no factors with rational coefficients (by Eisenstein).

Thus g must be the zero polynomial, and we may equate the coefficients of the powers of ζ.

[In abstract algebra, we say all this in one line: [ζ] is a degree 17 extension of thus g=0 .]