Dr. Kim

Would you mind telling me the different methods i can use to prove polynomial irreducibility over Q. I know Eisenstein’s Criterion and the brute force approach of finding no zeros that divide the constant (gauss?).

Also i was confused about this. Homework Sheet 2, question 2:

Show is irreducible over Q

In the solutions it says irreducible by eisenstein but i thought and ? Am i correct or have i misunderstood the criterion. Instead is it ok to show +-1,+-2 are not zeros of the polynomial?

Thanks for your help, i thought i would ask these basic questions now as not to waste anyone’s time at our revision class.

————————————————————————

Reply:

I won’t explain in much detail and the general problem can be quite complex, although there are various algorithms for dealing with it.

The facts you refer to are:

1. has a linear factor if and only if it has a rational root. Look at the online notes lecture 1 for the proof and for a review of how to check for rational roots. A corollary of this is that a polynomial of degree two or three is irreducible if and only if it has no roots. (This statement, by the way, is true over any field.)

2. Suppose has degree 4. Then the possibilities for reducibility are:

(a)

where has degree 1 and has dergee 3;

(b) both have degree two. To consider this possibility is slightly more tedious, but still manageable by hand.

To consider the general possibilities in this manner for polynomials of degree five or more becomes quite unwieldy.

But in special situations, one can use

3. Eisenstein’s criterion. Perhaps you have misunderstood the statement of the criterion. In the example you mention, since the prime 2 divides all non-leading coefficients and does not divide the constant term, the criterion says is irreducible. Since this polynomial has degree 3, you are right that one could simply check that it has no rational roots to conclude irreducibility. But Eisenstein’s criterion is already useful for since we don’t have to go through the tedious check to rule out degree two factors.

4. It is often convenient to use a change of variable:

is irreducible if and only if is irreducible for some constants . Try writing out for yourself the elemenary proof of this. As an application, we checked, for example, the irreducibility of

for any prime by checking the irreducibility of using Eisenstein’s criterion.

### Like this:

Like Loading...

*Related*