qftqed
- 6
- 0
Homework Statement
Let F be a field with p\inN, a prime natural number. Show that either X^{p}-\alpha is irreducible in F[X] or \alpha 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 \alpha 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_{1})(X-a_{2})...(X-a_{p}). Clearly, some of these linear factors will be factors of g and the rest factors of h. Suppose (X-a_{i}) is a factor of g and (X-a_{j}) 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_{i} to a_{j}. 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!