Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 11.2.12
Exercise 11.2.12
Let be monic and separable of degree , and assume that has rank . By theorem 11.2.9, is reducible. In this exercise, you will use the kernel of to produce a nontrivial factorization of .
- (a)
- Show that the constant polynomials in give a one-dimensional subset of the kernel of .
- (b)
- Prove that there is a nonconstant polynomial of degree such that . Parts (c),(d) and (e) will use to produce a nontrivial factorization of .
- (c)
- Explain why .
- (d)
- Use parts (b) and (c) to show that .
- (e)
- Use to show that . Conclude that the factorization of part (d) is nontrivial, i.e., is a nonconstant factor of of degree for at least two .
The basic idea of Berlekamp’s algorithm is that one can factor into irreducibles by taking the gcd’s of the nontrivial factors produced by part (e) as we vary and .
Answers
Proof.
- (a)
-
Let
be the coset of the constant polynomial
. Then
, so
.
is a one-dimensional subspace of the kernel of , corresponding to the constant polynomials in .
- (b)
-
By part (a), the rank of
is not
, and by hypothesis this rank is not
, so the rank of
is less than
, so the kernel of
has dimension at least 2.
Therefore there exists a polynomial , with , such that which is not in the one-dimensional subspace of part (a), thus is not a constant polynomial. Since , , thus .
Conclusion: there is a nonconstant polynomial of degree such that .
- (c)
-
In
, we know that
The formal composition with gives
- (d)
-
We know that if
are polynomials in
such that
if
, then
Take . Then , since
Therefore, since ,
- (e)
-
Since
,
, therefore
. Moreover, since
,
, so
cannot divide
when
.
Therefore the product has more than one nonconstant factor (if all factors except one are constant, then for some , which is impossible).
So is a nonconstant factor of (and non associate to ) for at least two .