I have just a couple of quick questions about the lecture yesterday. In the notes you have lectures 1 to 3, and are these the notes for the 3 hour lecture yesterday?

——————————————————–

The material is more or less the same, but I am presenting the material in different order. Eventually, I will put up a new set where the order is more consistent with the lectures.

——————————————————————–

Also, I am a bit unclear about the link between roots, factors and reducibility of polynomials in Does reducibility basically mean existence of roots and vice versa?

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

A non-constant polynomial is reducible if it can be written as where both and have degree strictly less than the degree of . This will be true if has a root , since then for some . However, this isn’t the only way to be reducible. For example,

is clearly reducible in , but it has no root.

That is, if is irreduble, then it has no root. But the converse is false in general.

————————————————–

For degree 2 or 3 polynomials in you said that is irreducible if it has no roots in . Is this also true for higher degree? We know by Fundamental Theorem of Algebra that any nonconstant polynomial in has roots in , and therefore the only irreducible polynomials in are those which are nonconstant of degree 1. If a polynomial of some degree in has all roots in , then it can be written as the product of some factors with roots in , and is therefore reducible in .

—————————————-

As mentioned above,

is irreducible if and only if it has no root in

is *false* in general, as the degree 4 example I’ve given above illustrates. But

of degree 2 or degree three is irreducible if and only if it has no root in

is true. This is because in this case, the only way to be reducible if for it to have a linear factor, and hence, a root.

As you note, over an algebraically closed field like , the only irreducible polynomials are the linear ones.

———————————————————————–

Also in , some polynomials like have one real root, but two complex roots. So in this situation, if the polynomial has some of roots as real, then we cannot still say that it is reducible in ?

————————————————–

The polynomial you give is indeed reducible in . In fact, you can check easily that any polynomial of degree is reducible in . For odd degree polynomials, this is easily seen because of the existence of a real root. For even degree ones without a real root, factorize first over , and observe that the roots occur in complex conjugate pairs, which can be combined to form quadratic factors.

## 2 Comments

If you take two different irreducible polynomials f and g in K[X], of the same degree d, and construct the fields K[X] / (f), and K[X] / (g), then is it correct that these will both be the “same” field? Because as vector spaces over K[X] they will both have the same dimension d. If they are the same, then does this mean that there is no unique irreducible polynomial f in K[X] which defines a field extension of K[X] of degree d?

Thanks in advance.

Sandeep.

For a given field extension of , it is true that there are many possible irreducible polynomials such that . However, it is definitely *not* true that all irreducible polynomials of the same degree define isomorphic field extension. Consider and and ask yourself what kind of field extensions of we get in the two cases. It is actually a delicate question to determine when two irreducible polynomials give isomorphic field extensions. We will discuss this in class quite a bit.