Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 13.3.7
Exercise 13.3.7
As in Example 13.3.7, let , where .
- (a)
- Use Gauss’s Lemma and the Schönemann-Eisenstein criterion to show that is irreducible over . (These results apply since is a PID.)
- (b)
- Verify the formulas for and given in Example 13.3.7.
- (c)
- Show that is irreducible over the splitting field of .
Proof. (a) is a prime of the PID , but the reduction modulo is , which is not irreducible, since . Nor the Schönemann-Eisenstein not the reduction modulo applies here.
We give a direct proof of the irreducibility of , by proving that has no factor with degree 1 ou 2. By Gauss’s Lemma, if has no factorisation in , then is irreducible in .
If has a factor with degree 1, then has a root , where are relatively prime. Then
therefore , and , hence , and similarly . Thus , where , so that . But , therefore has no factor with degree 1 in .
If has a factor with degree 2, then
where are in . Since , and are units of , so are in , therefore , and similarly , so that
The comparison of the terms in gives , so that
This is a contradiction, since has a nonzero term . Therefore is irreducible over .
Sage verification:
F = Frac(GF(2)[’u’]); u = F.gen() f = x^4 + (u+1)*x^2 + u*x +1 f.is_irreducible()
True
gcd(f,f.derivative(x))
1
This is a verification that is irreducible, separable. (b) For the given polynomial . For we have (cf. Ex.13.3.6,13.3.4 and (13.3),(13.32)):
Sage verification:
R.<x1,x2,x3,x4,y1,y2,y3,y4> = PolynomialRing(QQ, order = ’degrevlex’)
elt = SymmetricFunctions(QQ).e()
e = [elt([i]).expand(4).subs(x0=x1, x1=x2, x2=x3, x3 = x4) for i in range(5)]
J = R.ideal(e[1]-y1, e[2]-y2, e[3]-y3,e[4]-y4)
G = J.groebner_basis()
D = x1^3*x2^2*x3;
D=D+D.subs(x1=x3,x2=x4,x3=x1)+D.subs(x1=x2,x2=x1,x3=x4)
+D.subs(x1=x4,x2=x3,x3=x2)
D=D+D.subs(x1=x2,x2=x3,x3=x1)
+D.subs(x1=x2,x2=x3,x3=x1).subs(x1=x2,x2=x3,x3=x1)
d1=x1*x2+x3*x4;d2=d1.subs(x2=x3,x3=x2);d3=d1.subs(x1=x3,x3=x1);
S1=d1+d2+d3; S2=d1*d2+d1*d3+d2*d3; S3=d1*d2*d3
S.<c1,c2,c3,c4,u> = PolynomialRing(ZZ, order = ’degrevlex’)
A=(D+D.subs(x1=x2,x2=x1)).reduce(G).subs(y1=c1,y2=c2,y3=c3,y4=c4)
A=A.subs(c1=0,c2=u+1,c3=-u,c4=1).change_ring(GF(2));
B=(D*D.subs(x1=x2,x2=x1)).reduce(G).subs(y1=c1,y2=c2,y3=c3,y4=c4)
B=B.subs(c1=0,c2=u+1,c3=-u,c4=1).change_ring(GF(2));
a=S1.reduce(G).subs(y1=c1, y2 = c2,y3=c3,y4=c4)
a=a.subs(c1=0,c2=u+1,c3=-u,c4=1).change_ring(GF(2));
b=S2.reduce(G).subs(y1=c1, y2 = c2,y3=c3,y4=c4)
b=b.subs(c1=0,c2=u+1,c3=-u,c4=1).change_ring(GF(2));
c=S3.reduce(G).subs(y1=c1, y2 = c2,y3=c3,y4=c4)
c=c.subs(c1=0,c2=u+1,c3=-u,c4=1).change_ring(GF(2));
show("A= ",A,", B= ",B)
show("a=",a,", b=",b,", c=",c)
show((y^3+a*y^2+b*y+c).factor())
(c) As per (b), , where .
Then the splitting field of is , where . Since , and . Then is irreducible in (and in ) by the Schönemann-Eisenstein criterion. Therefore is irreducible over the splitting field of
This criterion applies here because ( is a variable), therefore is transcendental over , so that we may consider as a variable : . Hence is a PID, and is a prime in . Gauss’s Lemma and the Schönemann-Eisenstein Criterion apply here.
As an alternative proof of the irreducibility of over , without this criterion, it is sufficient to prove that has no root in , where as above. Such a root is under the form , where and are relatively prime in the PID . Then
hence , with relatively prime, thus , , and similarly . But , so has no root in .
Thus is irreducible over the splitting field of , therefore by Proposition 13.3.6. □
Answers