Separable Polynomials - Remarks by Dummit and Foote .... ....

That would be a multiple root of ##q## in its splitting field over ##K##, if the degree did go down that far.
  • #1
Math Amateur
Gold Member
MHB
3,990
48
Dummit and Foote in Section 13.5 on separable extensions make some remarks about separable polynomials that I do not quite follow. The remarks follow Corollary 34 and its proof ...

Corollary 34, its proof and the remarks read as follows:
?temp_hash=fe5916743434f8643f9a6c1e31bced35.png

?temp_hash=fe5916743434f8643f9a6c1e31bced35.png

In the above text by D&F, in the remarks after the proof we read:

" ... in characteristic ##p## the derivative of any power ##x^{pm}## of ##x^p## is identically ##0##:

##D_x( x^{pm} ) = pm x^{pm - 1 } = 0##

so it is possible for the degree of the derivative to decrease by more than ##1##.

If the derivative ##D_x p(x)## of the irreducible polynomial ##p(x)## is non-zero, however, , then just as before we conclude that ##p(x)## must be separable. ... ... "My questions are as follows:Question 1

I am assuming that when the degree of the derivative decreases by more than ##1, p(x)## is still relatively prime to ##D_x p(x)## and so ##p(x)## is separable ... is that the correct reasoning here ...Question 2

In stating that "if the derivative ##D_x p(x)## of the irreducible polynomial ##p(x)## is non-zero, however, , then just as before we conclude that ##p(x)## must be separable". D&F are implying that if ##D_x p(x) = 0## then ##p(x)## is not separable (or not necessarily separable) ... is this the case ... if it is the case, why/how is this true ...
Hope that someone can help ...

Peter
 

Attachments

  • D&F - 1 - Corollary 34 - Section 13.5 - PART 1 ... ....png
    D&F - 1 - Corollary 34 - Section 13.5 - PART 1 ... ....png
    25.6 KB · Views: 553
  • D&F - 2 - Corollary 34 - Section 13.5 - PART 2 ... ....png
    D&F - 2 - Corollary 34 - Section 13.5 - PART 2 ... ....png
    42 KB · Views: 482
Physics news on Phys.org
  • #2
First another notation whinge: it's a really bad idea for the author to use ##p## both as the label for the polynomial and as the characteristic of the field. The two have nothing to do with one another, and the opportunities for confusion are rife. In protest I will use ##q## to denote the polynomial.

For Question 2: If ##D_x q## is nonzero then it must be co-prime with ##q## in ##F[x]##. So all factors in ##F[x]## of ##D_xq## must also be co-prime with ##q##. Hence, by proposition 9, none of those factors have any roots/zeros (over the splitting field ##K##) in common with ##q##, and hence ##D_xq## also has no roots in common with ##q##. But any multiple root of ##q## must also be a root of ##D_xq## (with multiplicity one less than in ##q##), so we can conclude that ##q## has no multiple roots. Hence ##q## is separable.

However if ##D_xq## is zero, that argument does not work, because ##q## divides 0, so ##q## and ##D_xq## are not co-prime. It looks like he's going to go on from there to show how to find a multiple root of an irreducible with zero derivative, over a field of nonzero characteristic.

For Question 1:
Math Amateur said:
I am assuming that when the degree of the derivative decreases by more than 1, ##p(x)## is still relatively prime to ##D_x p(x)## and so ##p(x)## is separable ... is that the correct reasoning here ...
Yes, the argument works as long as the degree doesn't go all the way down to -1 (indicating the zero polynomial).
 
  • Like
Likes Math Amateur

What is a separable polynomial?

A separable polynomial is a polynomial whose roots are distinct and do not repeat. This means that each root has a multiplicity of 1, and there are no repeated factors in the polynomial's factorization.

How can I determine if a polynomial is separable?

A polynomial is separable if and only if its derivative and the polynomial itself share no common factors. In other words, if the greatest common divisor of the polynomial and its derivative is 1, then the polynomial is separable.

Why is it important to have separable polynomials?

Having separable polynomials is important because it allows for easier computation and factorization. It also ensures that the roots of the polynomial are distinct, which can have implications in certain applications and proofs.

Can a polynomial have both separable and inseparable factors?

Yes, a polynomial can have both separable and inseparable factors. In fact, every polynomial can be factored into a product of separable and inseparable factors.

What is the difference between separable and irreducible polynomials?

A separable polynomial can be factored into a product of linear factors, while an irreducible polynomial cannot be factored any further. In other words, an irreducible polynomial is a polynomial whose only factors are constants and itself, while a separable polynomial can have factors of any degree.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
979
  • Linear and Abstract Algebra
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
942
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
3K
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
10
Views
2K
  • Linear and Abstract Algebra
Replies
8
Views
2K
  • Linear and Abstract Algebra
Replies
8
Views
1K
Back
Top