- #1
qftqed
- 7
- 0
Homework Statement
Let F be a field with p[itex]\in[/itex]N, a prime natural number. Show that either X[itex]^{p}[/itex]-[itex]\alpha[/itex] is irreducible in F[X] or [itex]\alpha[/itex] has a pth root in F
Homework Equations
The Attempt at a Solution
I'm trying to do this without making reference to the field norm, so far I've come up with an incomplete proof that is missing some key components. First, if [itex]\alpha[/itex] has a pth root in F then the polynomial (call it f) it is trivially reducible in F[X]. Assume then that there is no such thing in F. Assume also for a contradiction that f=gh, where g and h are not linear. There exists an extension field E in which f is a product of linear polynomials. So f=gh=(X-a[itex]_{1}[/itex])(X-a[itex]_{2}[/itex])...(X-a[itex]_{p}[/itex]). Clearly, some of these linear factors will be factors of g and the rest factors of h. Suppose (X-a[itex]_{i}[/itex]) is a factor of g and (X-a[itex]_{j}[/itex]) not a factor of g. I want to say that there exists an F-automorphism (i.e. one that fixes F pointwise) that will take a[itex]_{i}[/itex] to a[itex]_{j}[/itex]. The coefficients in g will be unchanged by this automorphism, while the factors of g will not, suggesting that the field F is not a Unique Factorization Domain. This would be a contradiction and so f is irreducible. My issue is that I'm not sure whether such an automorphism necessarily exists and, if it does, what any of this has to do with p being prime, which I'm sure should be a key point in this proof. Any help would be much appreciated!