Abstract Algebra: x^p-a irreducible using automorphisms

In summary, the conversation discusses how to show that either X^{p}-\alpha is irreducible in F[X] or \alpha has a pth root in F by using a splitting field and properties of roots of unity. The approach involves showing that all roots of f are distinct and using a pth root of unity to find all roots of f. The conversation also mentions using the fact that if f can be factored as g and h, the constant term of g must be in F and can be used to deduce a root of f in F.
  • #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!
 
Physics news on Phys.org
  • #2
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

[tex]\{\alpha\zeta^n~\vert~0\leq n< p \}[/tex]

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

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

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

Related to Abstract Algebra: x^p-a irreducible using automorphisms

1. What is abstract algebra?

Abstract algebra is a branch of mathematics that deals with the study of algebraic structures, such as groups, rings, and fields, in an abstract and general way. It focuses on the properties and relationships between these structures rather than specific numbers or equations.

2. What is an automorphism in abstract algebra?

An automorphism in abstract algebra is a mapping from a mathematical structure to itself that preserves the structure's operations and relationships. In other words, an automorphism is a function that can be applied to a structure and still produce the same structure.

3. What does it mean for x^p-a to be irreducible?

In abstract algebra, a polynomial is considered irreducible if it cannot be factored into two polynomials of lower degree with coefficients in the same field. In the case of x^p-a, it is irreducible if it cannot be factored into two polynomials with degree less than p with coefficients in the same field.

4. How is the use of automorphisms helpful in proving irreducibility?

The use of automorphisms can be helpful in proving irreducibility because it allows us to show that if x^p-a can be factored into two polynomials with degree less than p, then the coefficients must lie in a smaller field. This contradicts the fact that x^p-a is a polynomial with coefficients in a larger field, and therefore must be irreducible.

5. What is the significance of proving that x^p-a is irreducible using automorphisms?

Proving that x^p-a is irreducible using automorphisms is significant because it provides a method for determining when a polynomial is irreducible without having to factor it explicitly. This can be useful in various applications of abstract algebra, such as in coding theory and cryptography.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
722
  • Calculus and Beyond Homework Help
Replies
10
Views
1K
  • Calculus and Beyond Homework Help
Replies
24
Views
885
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
17
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
2K
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Calculus and Beyond Homework Help
Replies
8
Views
675
Replies
0
Views
347
Back
Top