Let ζ be a primitive 11th root of unity, how does one show that α=ζ+ζ−1 has minimal polynomial x5+x4−4x3−3x2+3x+1?
I have been unable to solve this problem that I would have assumed was simple for hours... It gives a hint that we can evaluate the minimal polynomial of ζ at ζ and divide each side by ζ5, and rewrite in terms of α, but I can't get it:
ζ=z for saving type it 200 times
z10+z9+⋯+z+1=0
z5+z4+⋯+z−4+z−5=0
z5+z4+z3+z2+1+z−2+z−3+z−4+z−5+α=0
How is this meant to give me the minimal polynomial?
Answer
It depends how much Galois theory you know. I would do it as follows, which is not so easily seen to be related to the hint you were given. The Galois group of the splitting field of x11−1 is cyclic of order 10, and is generated by σ:σ(ζ)=¯ζ and τ:τ(ζ)=ζ4. The element α is already fixed by σ. Now τ5 is the identity,
and it follows that the coefficients of the polynomial
(x−α)(x−τ(α))(x−τ2(α))(x−τ3(α))(x−τ4(α)) are fixed by both σ and τ, so are fixed by the full Galois group, and lie in Q.
Hence if you expand out (x−(ζ+ζ−1))(x−(ζ4+ζ−4))(x−(ζ5+ζ−5))(x−(ζ2+ζ−2))(x−(ζ3+ζ−3)), you will obtain a polynomial of degree 5 in Q[x] satisfied by α, and it is easy to check that this has to be the minimum polynomial of α. By the way, I have made use of the fact that ζ11=1, so that ζ16=ζ5 and ζ20=ζ9=ζ−2. Likewise ζ8=ζ−3.
No comments:
Post a Comment