Irreducibility and Roots in ##\Bbb{C}##

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Roots
Click For Summary
SUMMARY

The discussion centers on proving that if a polynomial \( p(x) \in \mathbb{Q}[x] \) is irreducible, then it cannot have repeated roots in \( \mathbb{C} \). The proof employs the contrapositive approach, demonstrating that if \( p(x) \) has a repeated root, then its greatest common divisor with its derivative is not equal to one, indicating that \( p(x) \) is not irreducible. The argument hinges on the relationship between the degrees of the polynomial and its factors, confirming that any irreducible polynomial must have distinct roots in the complex field.

PREREQUISITES
  • Understanding of irreducible polynomials in \( \mathbb{Q}[x] \)
  • Knowledge of polynomial derivatives and their properties
  • Familiarity with the concept of greatest common divisors (gcd) in polynomial rings
  • Basic comprehension of field theory and subfields
NEXT STEPS
  • Study the implications of the Fundamental Theorem of Algebra on polynomial roots
  • Explore the relationship between polynomial irreducibility and field extensions
  • Learn about the properties of gcd in polynomial rings, particularly in \( \mathbb{Q}[x] \)
  • Investigate the role of derivatives in determining the nature of polynomial roots
USEFUL FOR

Mathematicians, students studying algebra, and anyone interested in polynomial theory and its applications in field theory.

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement



Prove that if ##p(x) \in \Bbb{Q}[x]## is an irreducible polynomial, then ##p(x)## has no repeated roots in ##\Bbb{C}##.

Homework Equations



I will appeal to the theorem I attempted to prove here: https://www.physicsforums.com/threads/repeated-roots-and-being-relatively-prime-w-derivative.927168/

Let ##k## be a subfield of the field ##K##. If ##f(x), g(x) \in k[x]##, then their gcd in ##k[x]## is equal to their gcd in ##K[x]##.

If ##k## is a field, then a polynomial ##p(x) \in k[x]## is irreducible if and only if ##\deg (p) = n \ge 1##and there is no factorization in ##k[x]## of the form ##p(x) = g(x) h(x)## in which both factors have a degree smaller than ##n##.

The Attempt at a Solution



I will prove the contrapositive. Suppose that ##p(x)## has a repeated root in ##\Bbb{C}##. Then ##(p,p')_{\Bbb{Q}} = (p,p')_{\Bbb{C}} \neq 1##, and according to the theorem given in the link above, ##p## must have a repeated root in ##\Bbb{Q}##. This means that ##(x-a)^2 |p(x)##, where ##a \in \Bbb{Q}## is the repeated root of ##p##, and so ##p(x) = (x-a)^2 f(x)##. This means ##\deg(p(x)) = \deg((x-a)^2 f(x)) = 2 + \deg(f)## and hence ##\deg(f) < \deg (p)## and ##2 \le \deg (p)##. If ##2 = \deg(p)##, then ##\deg (f) = 0## and so ##f(x) = r \in \Bbb{Q}##, which gives us ##p(x) = r(x-a)^2 = r(x-a)(x-a)##, each factor having a degree smaller than ##p##'s. Thus ##p(x)## is not irreducible whether ##\deg(p) = 2## or ##\deg (p) < 2##.

How does this sound?
 
Physics news on Phys.org
Correct. The proof of the statement you used is the interesting part.
 
  • Like
Likes   Reactions: Bashyboy

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
48
Views
6K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 13 ·
Replies
13
Views
3K
Replies
1
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K