Splitting Fields: Anderson and Feil, Theorem 45.4

Click For Summary
SUMMARY

The forum discussion centers on Theorem 45.4 from "A First Course in Abstract Algebra" by Anderson and Feil, specifically addressing the proof's implications regarding polynomial factors. The main contention is whether the polynomial \( g \) in the expression \( f = (x - \alpha)^k g \) should be over the field \( F \) instead of \( K \). Participants clarify that \( g \) can reside in \( K[x] \) due to the nature of \( \alpha \) being a repeated root, and they explain the term-by-term differentiation process that confirms \( f' \in F[x] \).

PREREQUISITES
  • Understanding of polynomial factorization in abstract algebra
  • Familiarity with fields and their extensions, specifically \( F \) and \( K \)
  • Knowledge of differentiation of polynomials
  • Concept of irreducibility in polynomial rings
NEXT STEPS
  • Study the concept of splitting fields in abstract algebra
  • Learn about polynomial irreducibility criteria in \( F[x] \)
  • Explore the implications of repeated roots in polynomial factorization
  • Review the process of term-by-term differentiation in calculus
USEFUL FOR

Students of abstract algebra, mathematicians focusing on polynomial theory, and educators teaching concepts related to fields and polynomial differentiation.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Anderson and Feil - A First Course in Abstract Algebra.

I am currently focused on Ch. 45: The Splitting Field ... ...

I need some help with some aspects of the proof of Theorem 45.4 ...

Theorem 45.4 and its proof read as follows:View attachment 6677
My questions on the above proof are as follows:Question 1In the above text from Anderson and Feil we read the following:"... ... This means that $$f = ( x - \alpha)^k g$$, where $$k$$ is an integer greater than $$1$$ and $$g$$ is a polynomial over $$K$$ ... ... Since $$f$$ is in $$F[x]$$ ... that is $$f$$ is over $$F$$ ... shouldn't g be over $$F$$ not $$K$$?

(I am assuming that f being "over $$F$$" means the coefficients of $$f$$ are in $$F$$ ... )

Question 2In the above text from Anderson and Feil we read the following:"... ... We then have that $$x - \alpha$$ is a factor of both $$f$$ and $$f'$$. But if we use term-by-term differentiation instead, it is clear that $$f'\in F[x]$$. ... ... "What do Anderson and Feil mean by term-by-term differentiation in this context ... ... and if they do use term-by-term differentiation (what ever they mean) how does this show that $$f'\in F[x]$$ ... ... ?
Hope someone can help ...

Help will be much appreciated ... ...

Peter
 
Physics news on Phys.org
Peter said:
Question 1In the above text from Anderson and Feil we read the following:"... ... This means that $$f = ( x - \alpha)^k g$$, where $$k$$ is an integer greater than $$1$$ and $$g$$ is a polynomial over $$K$$ ... ... Since $$f$$ is in $$F[x]$$ ... that is $$f$$ is over $$F$$ ... shouldn't g be over $$F$$ not $$K$$?

If $g$ were a polynomial over $F$, then $f$ would be reducible in $F[x]$, contrary to assumption.
Peter said:
Question 2In the above text from Anderson and Feil we read the following:"... ... We then have that $$x - \alpha$$ is a factor of both $$f$$ and $$f'$$. But if we use term-by-term differentiation instead, it is clear that $$f'\in F[x]$$. ... ... "What do Anderson and Feil mean by term-by-term differentiation in this context ... ... and if they do use term-by-term differentiation (what ever they mean) how does this show that $$f'\in F[x]$$ ... ... ?

They mean to differentiate each summand in the standard form of $f$. So if $f(x) = c_0 + c_1x + \cdots + c_n x^n$, then you are to compute $Df$ by computing the derivative of each summand $c_i x^i$ ($0 \le i \le n$). This would give a polynomial in $F[x]$ of lesser degree than that of $f$.
 
Euge said:
If $g$ were a polynomial over $F$, then $f$ would be reducible in $F[x]$, contrary to assumption. They mean to differentiate each summand in the standard form of $f$. So if $f(x) = c_0 + c_1x + \cdots + c_n x^n$, then you are to compute $Df$ by computing the derivative of each summand $c_i x^i$ ($0 \le i \le n$). This would give a polynomial in $F[x]$ of lesser degree than that of $f$.
Thanks for the help Euge ...You write:"... ... If $g$ were a polynomial over $F$, then $f$ would be reducible in $F[x]$, contrary to assumption. ... ... But ... ... ... couldn't $$g$$ have it's coefficients in $$F$$ ... but possesses no root in $$F$$ ... and still be irreducible in $$F[x]$$ ... why is this not possible ... ?

Can you help further ...?

Peter
 
Since $k >1$, $x - \alpha$ would be a proper factor of $f$.
 
Euge said:
Since $k >1$, $x - \alpha$ would be a proper factor of $f$.
Thanks Euge ... but I still do not follow ... sorry ... probably being slow to catch on ...

I am having difficulties seeing the link between k > 1 and f being reducible in F[x] and g being over K (or F) ...

Are you able to clarify ...

Again ... apologies for not following your points ...

Peter
 
Sorry, I made a slight error, assuming $\alpha\in F$. It's by definition of $\alpha$ being a repeated root in $K$ that $f(x)$ can be expressed as $(x - \alpha)^k g(x)$ for some $g(x)\in K[x]$ and integer $k > 1$. So while it's possible that $g(x)\in F[x]$ (as $F[x]\subset K[x]$), it is not necessarily true that $g(x)\in F[x]$.
 
Euge said:
Sorry, I made a slight error, assuming $\alpha\in F$. It's by definition of $\alpha$ being a repeated root in $K$ that $f(x)$ can be expressed as $(x - \alpha)^k g(x)$ for some $g(x)\in K[x]$ and integer $k > 1$. So while it's possible that $g(x)\in F[x]$ (as $F[x]\subset K[x]$), it is not necessarily true that $g(x)\in F[x]$.
Thanks Euge ...

Appreciate all your help ...

Peter
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
1
Views
2K
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
2
Views
2K