Coprime Polynomials in K[X] and C[X]

Therefore, f and Df are coprime when viewed over C[X].In summary, if there exist a and b in K[X] such that af + bDf = 1, then there exist a and b in C[X] such that af + bDf = 1. This implies that none of the linear factors of f in C[X] are repeated, showing that f and Df are coprime when viewed over C[X].
  • #1
Bleys
74
0
Let K be a subfield of C, the field of complex numbers, and f an irreducible polynomial in K[X].
Then f and Df are coprime so there exist a,b in K[X] such that af + bDf = 1 (D is the formal derivative operator). Now what I don't understand is why this equation implies f and Df are coprime when viewed over C[X]. Doesn't f split into linear factors over C[X] so is it not possible that a factor divides Df (not always but could happen?).
Although if I write f in linear factors and then compute Df I can see that no linear factor of f divides it, but it does if one of the linear factors is repeated?
 
Physics news on Phys.org
  • #2
Certainly if there exist a and b in K[X] such that af + bDf = 1, then there exist a and b in C[X] such that af + bDf = 1. This is equivalent to saying that none of the linear factors of f in C[X] are repeated (if there was such a linear factor, it would divide both f and Df).
 

What are coprime polynomials in K[X] and C[X]?

Coprime polynomials in K[X] and C[X] are two polynomials in the respective fields of K and C, whose only common factor is a constant. In other words, the greatest common divisor of the two polynomials is 1.

How can I determine if two polynomials in K[X] and C[X] are coprime?

To determine if two polynomials in K[X] and C[X] are coprime, you can use the Euclidean algorithm to find the greatest common divisor (GCD) of the two polynomials. If the GCD is equal to 1, then the polynomials are coprime.

Why are coprime polynomials important in mathematics?

Coprime polynomials have various applications in mathematics, such as in number theory, algebraic geometry, and cryptography. They are also used in proving the fundamental theorem of algebra, which states that every non-constant polynomial with complex coefficients has at least one root.

Can two polynomials in K[X] and C[X] be coprime if they have a common root?

No, two polynomials in K[X] and C[X] cannot be coprime if they have a common root. This is because a common root would imply that the GCD of the two polynomials is not equal to 1, and therefore they are not coprime.

What is the relationship between coprime polynomials and irreducible polynomials?

Coprime polynomials are not necessarily irreducible, but irreducible polynomials are always coprime. This is because irreducible polynomials have no non-constant factors, and therefore their only common factor with another polynomial is a constant, making them coprime.

Similar threads

  • Linear and Abstract Algebra
Replies
8
Views
1K
Replies
8
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
16
Views
3K
  • Linear and Abstract Algebra
Replies
8
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
1K
Replies
1
Views
1K
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
9
Views
1K
Back
Top