Why is x^p - a irreducible over a field of characteristic p?

  • Context: Graduate 
  • Thread starter Thread starter imurme8
  • Start date Start date
  • Tags Tags
    Characteristic Field
Click For Summary

Discussion Overview

The discussion centers on the irreducibility of the polynomial x^p - a over a field K of characteristic p, particularly when a is not a pth power in K. Participants explore the implications of this irreducibility in the context of field theory and polynomial factorization.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant notes that if a is not a pth power in K, x^p - a has no roots in K and questions the existence of any factorization into lesser degree polynomials.
  • Another participant suggests considering a splitting field F for the polynomial and a root α in F to further analyze the factorization.
  • A participant proposes that if f(x) = x^p - a has a factorization in K[x], then all factors must have the same degree, leading to the conclusion that the degree must be p, thus asserting irreducibility.
  • Another contribution elaborates on the contradiction arising from assuming a proper factorization, using properties of roots and the relationship between α and a.
  • One participant expresses appreciation for the elegance of the argument presented by another, indicating a positive reception of the reasoning shared.

Areas of Agreement / Disagreement

Participants generally agree on the irreducibility of x^p - a under the given conditions, though the discussion involves different approaches and reasoning to arrive at this conclusion. No consensus is explicitly stated on the simplest method to demonstrate this irreducibility.

Contextual Notes

The discussion assumes familiarity with concepts such as splitting fields, minimal polynomials, and properties of irreducible polynomials in the context of fields of characteristic p. Some mathematical steps and assumptions remain unresolved, particularly regarding the implications of the Frobenius endomorphism.

imurme8
Messages
45
Reaction score
0
If K is a field of characteristic p, and there exists an element a \in K
which is not a pth power (i.e. the Frobenius endomorphism is not
surjective), then I am told we can show x^p - a is an irreducible polynomial
(and since it is not separable our field is imperfect). I see that
x^p - a has no roots in K, but how do we know that there does not exist
any factorization of x^p -a into factors of lesser degree?
 
Physics news on Phys.org
Hint: Let f(x) = x^p - a, let F be a splitting field for f and let \alpha be a root of f(x) in F. Can you take it from there?
 
Last edited:
OK, how about this? Over F we have \alpha as the only root of f(x) (with multiplicity p). Let f(x)=p_1(x)\dotsb p_n(x) be a factorization of f(x) in K[x] into monic irreducibles. Then each of these must be the minimal polynomial of \alpha over K. So they all must have the same degree. So the degree of p_1(x)=\dotsb=p_n(x) divides p, so it is either 1 or p. But it cannot be 1, so it must be p, so f(x) itself is irreducible.

Is that what you would suggest? I don't see an easier way to show (x-\alpha)^m\notin K[x] for all positive integers m<p.
 
Your argument looks OK. Here's what I had in mind: We have that f(x) = (x - \alpha)^p = x^p - \alpha^p and so a = \alpha^p. Suppose that f(x) = g(x)h(x) is a proper, non-trivial factorization of f(x) over K. Then, by unique factorization, g(x) = (x - \alpha)^s, for some 0 < s < p. The constant term of g(x) is \alpha^s, so \alpha^s \in K. Since gcd(s, p) = 1, there exist integers m and n such that sm + pn = 1. Therefore, \alpha = \alpha^{sm+pn} = (\alpha^s)^m (\alpha^p)^n is an element of K. But a = \alpha^p, contradicting the assumption that a is not a pth power in K. Therefore, no such factorization of f(x) exists.
 
  • Like
Likes   Reactions: Warren Leywon
I like your way, very elegant. Thanks for the help!
 

Similar threads

Replies
48
Views
6K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K