Problem 5
Exercise 333.1.
Let . Determine which of the following polynomials are irreducible:
Problem 6
Exercise 333.2.
Determine which of the following polynomials in are irreducible:
Polynomial 1
Consider as a polynomial in with coefficients in ; Let denote the algebraic closure of . Denote by a root of in . It is easy to see that is a root of for . By Proposition 114.14, these are all the roots of in . Since no proper subset of the factors yields an element of , it follows that is irreducible.
Polynomial 4
Consider as a polynomial in with coefficients in .
Suppose . If , must be a unit, since the gcd of the coefficients is . The case is possible iff the discriminant is a prefect square; it is clearly not.
Polynomial 2
Consider as a polynomial in with coefficients in .
The discriminant is is not a prefect square.
Polynomial 3
Consider as a polynomial in with coefficients in .
Use Theorem 118.2 with .
Polynomial 5
Consider as a polynomial in with coefficients in .
Use Theorem 118.2 with .
Polynomial 6
Let denote an arbitrary unit.
Consider the map defined by , , and (this is the same map we encountered in Exercise 301.1!). Observe that ; neat. Now, suppose such that . Then, . This forces , for some . It follows that must be a sum of monomials such that for each ; ditto for .
Denote the set of monomials of by . Denote ” and ” by .
Since , WLOG we must have either or .
Since , one of , , , , must be true.
If , none of can be in , since none of them have image under .
If , then is forced, and must be a unit.
Thus, is irreducible.
Problem 7
Exercise 333.3.
Show that is irreducible in iff it has no root in .
It is clear that is reducible if it has a root. Suppose