Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 2.3.1
Exercise 2.3.1
Examples 2.3.1 and 2.3.2 showed that the roots of are the cubes of the roots of . Verify this numerically.
Answers
Proof. We repeat Examples 2.3.1 and 2.3.2 with Sage :
We build the Groebner basis of the ideal , where are the elementary symmetric polynomials in :
e = SymmetricFunctions(QQ).e() e1, e2, e3 = e([1]).expand(3),e([2]).expand(3),e([3]).expand(3) R.<x0,x1,x2,y1,y2,y3> = PolynomialRing(QQ, order = ’degrevlex’) J = R.ideal(e1-y1, e2-y2, e3-y3) G = J.groebner_basis()
We compute the coefficients of as polynomials in :
f = (x-x0^3) * (x-x1^3) * (x-x2^3) coeffs = f.coefficients(x, sparse = False) coeffs = map(lambda c : R(c), coeffs) coeffs
The same coefficients as polynomials in :
var(’sigma_1,sigma_2,sigma_3’) ncoeffs = [c.reduce(G) for c in coeffs] nncoeffs = [c.subs(y1 = sigma_1,y2 = sigma_2,y3 = sigma_3) for c in ncoeffs] nncoeffs
We apply the substitution and compute the polynomial whose roots are , where are the roots of .
nncoeffs = [c.subs(sigma_1 = -2, sigma_2 = -3, sigma_3 = -5) for c in nncoeffs] p = sum(nncoeffs[i]*y^i for i in range(1+f.degree(x))) p
Numerical verification:
S.<y> = PolynomialRing(ComplexField(prec = 40)) [c[0] for c in S(p).roots()]
q = y^3+2*y^2-3*y+5 l = [c[0]^3 for c in q.roots()] l
□