Gauss and Regular Polygons: Gaussian Periods

4 comments

Introduction

In order to solve the equation zn1=0 Gauss introduced some sums of the nth roots of unity which he called periods, and using these periods he was able to reduce the solution of zn1=0 to a sequence of solutions of equations of lower degrees. The technique offered by Gauss is extremely beautiful and completely novel and it uses the symmetry between the various nth roots of unity to achieve the final solution.

Reduction to the Case when n is Prime

Before we proceed to show what Gauss did we can first restrict ourselves to the case when n is prime. This will not be a problem as the following result shows.
If ξ1,ξ2,,ξr are the rth roots of unity and η1,η2,,ηs are the sth roots of unity then the (rs)th roots of unity are given by the expression ξirηj for i=1,2,,r,j=1,2,,s.

To establish this we only need to observe that zrs1=(zr)s1=sj=1(zrηj) Henceforth we shall therefore focus only on the case when n is prime and we will denote it by the letter p. In what follows p will be a prime unless otherwise explicitly stated.

Gaussian Periods

The roots of the equation zp1=0 are 1,ζ,ζ2,,ζp1 where ζ=cos(2πp)+isin(2πp) Moreover all the roots except 1 are primitive pth roots of unity (since ϕ(p)=p1). Gauss arranged these primitive roots into a particular order through which he could exploit the symmetry between them to the full extent. To do so we need a result about prime numbers (also proved by Gauss) which we state (we don't prove it here to avoid any digression, it can be found online)as follows:

For any given prime p, there exists a positive integer g such that gp11modp, but gi1modp for any positive integer i<(p1).
Such a number g is called a primitive root of p. There are exactly ϕ(p1) primitive roots of p.

It follows from the above result that the numbers 1,g,g2,,gp2 when taken modulo p are all different from one another and non-zero. Therefore they are equal to 1,2,,(p1) in some order.

Let us now choose any primitive root g of p. Then since ζp=1, we can arrange the primitive pth roots of unity in the following order:
ζg0,ζg1,ζg2,ζgp2 To simplify notation we will write ζi=ζgi so that the primitive pth roots of unity are ζ0,ζ1,ζ2,,ζp2. This ordering of the roots is permuted cyclically each time we replace ζ by ζg. Thus we have ζζgζ0ζ1ζ2ζp2ζ0 This is the symmetry which we will exploit along the lines of Gauss.

Let e,f be two positive integers such that ef=(p1), then we define e complex numbers each called a period of f terms as follows: η0=ζ0+ζe+ζ2e++ζe(f1)η1=ζ1+ζe+1+ζ2e+1++ζe(f1)+1η2=ζ2+ζe+2+ζ2e+2++ζe(f1)+2=ηe1=ζe1+ζ2e1+ζ3e1++ζp2 As can be easily seen that a period of 1 term is a root ζ0 whereas a period of (p1) terms is the sum of all roots i.e. ζ0+ζ1++ζp2=1 which is rational. Thus the structure of a period with lesser number of terms is more complex than that of a period of larger number of terms. We will now study the properties of these periods which will ultimately lead us to the radical expressions for the pth primitive root ζ.

Automorphisms of Field Q(ζ)

To set up things more formally, we define Q(ζ) to be the set of all rational expressions in ζ with rational coefficients. This set forms a field and moreover every member of Q(ζ) can be expressed uniquely in the following way: a0+a1ζ+a2ζ2++ap2ζp2 where ai are rational. This is again a very standard result from field theory and not difficult to prove. Moreover it is not specific to ζ, but rather holds good for any algebraic number ζ whose minimal polynomial is of degree (p1) and p need not be necessarily prime for this result.

Coming back to the pth primitive root ζ and prime p, we observe that since Φp(ζ)=0 we have 1+ζ+ζ2++ζp1=0a0=a0(ζ+ζ2++ζp1)a0+a1ζ+a2ζ2++ap2ζp2=(a1a0)ζ+(a2a0)ζ2++(ap2a0)ζp2+(a0)ζp1 Thus we are able to express every uQ(ζ) as a linear combination of powers of ζ with rational coefficients as: a1ζ+a2ζ2++ap1ζp1 and this expression is unique. Changing the indices if necessary we can see that the above can be rearranged to get aoζ0+a1ζ1+a2ζ2++ap2ζp2 We can now setup a mapping, say σ,  from Q(ζ) onto itself defined by σ(1)=1 and σ(aoζ0+a1ζ1+a2ζ2++ap3ζp3+ap2ζp2)=aoζ1+a1ζ2+a2ζ3++ap3ζp2+ap2ζ0 Thus the mapping σ permutes the ζ's cyclically. The above mapping is one-one and onto and we will show that it is an automorphism of field Q(ζ) by showing that σ(uv)=σ(u)σ(v) (it is obvious that σ(u+v)=σ(u)+σ(v)).

From the definition of σ it is clear that σ(ζi)=ζgi so that σ(ζiζj)=σ(ζi)σ(ζj). Since σ is linear i.e. σ(au+bv)=aσ(u)+bσ(v) for rationals a,b, and if we observe that members u,vQ(ζ) are linear combinations of ζ's, it follows that σ(uv)=σ(u)σ(v).

It is thus established that σ is an automorphism of Q(ζ) and moreover it leaves the rationals and only the rationals fixed i.e. σ(u)=uuQ. Now we can compose σ with itself to get other automorphisms. Then for any positive integer e, the mapping σe (i.e. σ applied e times) is an automorphism of Q(ζ). It turns out that these automorphisms are linked with the properties of the Gaussian periods and ultimately enable us to express them in the form of radicals thereby finding radical expressions for the primitive pth roots of unity. This we will finalize in the next post to keep the length of current post manageable.

Print/PDF Version

4 comments :: Gauss and Regular Polygons: Gaussian Periods

Post a Comment

  1. Hi again, one thing is still bothering me, why is the sum of the primitive roots = -1?

  2. @Kazbich-the-bandit,
    Note that if we take all nth roots of unity then these are roots of xn1=0 and hence the sum of these roots is 0. One of these roots is x=1 and hence the sum of other roots (except x=1) is 1. Now in this post we have replaced n with p where p is prime. When p is prime then all roots except x=1 are primitive roots. Hence sum of primitive roots is 1. If p was not prime then sum of primitive roots will not be 1.

  3. OK, I get it. Thanks

  4. What are the definitions of the functions ϕ and Φ as used in this post?