Separable Polynomials - Dummit and Foote - Proposition 37 .... ....

In summary, separable polynomials are polynomials whose roots are all distinct, and Proposition 37 in Dummit and Foote states that a polynomial is separable if and only if its derivative and itself have no common roots. A polynomial can only be either separable or inseparable, and to determine if a polynomial is separable, one can use the criteria in Proposition 37. Separable polynomials have significant applications in algebra, number theory, and cryptography, and are useful in solving polynomial equations and factoring polynomials.
  • #1
Math Amateur
Gold Member
MHB
3,990
48
I am reading David S. Dummit and Richard M. Foote : Abstract Algebra ...

I am trying to understand the proof of Proposition 37 in Section 13.5 Separable and Inseparable Extensions ...The Proposition 37 and its proof (note that the proof comes before the statement of the Proposition) read as follows:
View attachment 6643
In the above text by D&F we read the following:

"If \(\displaystyle p(x)\) were inseparable then we have seen that \(\displaystyle p(x) = q(x^p)\) for some polynomial \(\displaystyle q(x) \in \mathbb{F} [x]\). ... ... "I cannot understand exactly why this is true ...Can someone please explain exactly why, as D&F assert ...\(\displaystyle p(x)\) inseparable \(\displaystyle \ \ \Longrightarrow \ \ p(x) = q(x^p)\) for some polynomial \(\displaystyle q(x) \in \mathbb{F} [x] \)I cannot find where D&F establish exactly this implication ... but maybe there is some idea in the proof of Corollary 34 which reads as follows:
View attachment 6644
View attachment 6645
Corollary 36 may also be relevant ... so I am providing that as well ... as follows:
View attachment 6646
Hope someone can help explain the assertion by D&F mentioned above ..

Peter
 
Physics news on Phys.org
  • #2


Dear Peter,

Thank you for reaching out and asking for clarification on this topic. I am happy to help you understand the proof of Proposition 37 in Section 13.5 of "Abstract Algebra" by Dummit and Foote.

Firstly, let's define what it means for a polynomial to be inseparable. A polynomial p(x) over a field F is said to be inseparable if it cannot be factored into distinct linear factors in an extension field of F. In other words, if p(x) has a repeated root in its splitting field, then it is inseparable.

Now, let's look at the proof of Proposition 37. The proof starts by assuming that p(x) is inseparable. This means that p(x) cannot be factored into distinct linear factors in an extension field of F. Since p(x) is a polynomial, it can be written as a product of irreducible polynomials over F. Let's say that p(x) = f_1(x) f_2(x) ... f_n(x), where f_i(x) are irreducible polynomials over F.

Now, since p(x) is inseparable, it cannot be factored into distinct linear factors. This means that at least one of the irreducible factors, let's say f_1(x), must have a repeated root in its splitting field. This repeated root can be written as a polynomial q(x) = f_1(x^p), where p is the characteristic of the field F. This is because any element in the splitting field of f_1(x) can be written as a polynomial in its root, and since the root is repeated, the polynomial will have a degree less than p.

Therefore, we can write p(x) as p(x) = q(x) g(x), where g(x) = f_2(x) ... f_n(x). This shows that p(x) can be factored into two polynomials, q(x) and g(x), over F. And since q(x) is a polynomial in x^p, it is also a polynomial in x. This proves the statement p(x) = q(x^p) for some polynomial q(x) \in \mathbb{F} [x].

I hope this explanation helps you understand the proof of Proposition 37. If you have any further questions, please don't hesitate to ask.
 

1. What are separable polynomials?

Separable polynomials are polynomials whose roots are all distinct. In other words, they do not have any repeated roots.

2. What is Proposition 37 in Dummit and Foote?

Proposition 37 in Dummit and Foote is a theorem that states that a polynomial over a field is separable if and only if its derivative and itself have no common roots.

3. Can a polynomial be both separable and inseparable?

No, a polynomial can only be either separable or inseparable. A polynomial is separable if all of its roots are distinct, while a polynomial is inseparable if it has at least one repeated root.

4. How do you determine if a polynomial is separable?

To determine if a polynomial is separable, you can use the criteria in Proposition 37 in Dummit and Foote. Check if the polynomial and its derivative have any common roots. If they do not, then the polynomial is separable.

5. What is the significance of separable polynomials?

Separable polynomials have many important applications in algebra, number theory, and cryptography. They are also useful in solving polynomial equations and factoring polynomials.

Similar threads

  • Linear and Abstract Algebra
Replies
5
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
980
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
6
Views
3K
  • Linear and Abstract Algebra
Replies
1
Views
801
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
Replies
3
Views
2K
  • Linear and Abstract Algebra
Replies
3
Views
1K
Back
Top