Abstract Algebra: x^p-a irreducible using automorphisms

Click For Summary
SUMMARY

The discussion centers on proving the irreducibility of the polynomial X^p - α in the polynomial ring F[X], where F is a field and p is a prime number. The proof strategy involves assuming that α does not have a pth root in F and demonstrating that any factorization of the polynomial leads to a contradiction regarding the existence of an F-automorphism. The key points include showing that all roots of the polynomial are distinct and that the splitting field K contains all pth roots of unity. Ultimately, the conclusion is that if X^p - α can be factored, it contradicts the properties of unique factorization in the field.

PREREQUISITES
  • Understanding of polynomial irreducibility in field theory
  • Familiarity with field extensions and splitting fields
  • Knowledge of F-automorphisms and their properties
  • Concept of pth roots of unity in algebra
NEXT STEPS
  • Study the properties of unique factorization domains in algebra
  • Learn about splitting fields and their construction
  • Research F-automorphisms and their applications in field theory
  • Explore the significance of pth roots of unity in polynomial equations
USEFUL FOR

Mathematics students, algebraists, and researchers interested in abstract algebra, particularly those studying polynomial irreducibility and field theory.

qftqed
Messages
6
Reaction score
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!
 
Physics news on Phys.org
Let ##K## be a splitting field of the polynomial ##f##.

Can you first show that every root of ##f## is distinct?

Second, can you show that ##K## contains all ##p##th root of unity?

Can you show then that if ##\zeta## is a ##p##th root of unity (which is necessarily in ##K##) and if ##\alpha## is a root of ##f##, then all roots of ##f## are given by

\{\alpha\zeta^n~\vert~0\leq n< p \}

Then if we can write ##f(X) = g(X)h(X)## with ##g## and ##h## polynomials with coefficients in ##F##, show that we can write

g(X) = \prod_{n\in S} (X- \alpha \zeta^n)~\text{and}~h(X) = \prod_{n\in S^c} (X-\alpha\zeta^n)

The constant term of ##g## is in ##F##, what is this constant term? Try to deduce that a root of ##f## lies in ##F##.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
10
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
48
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
3K
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 24 ·
Replies
24
Views
2K