Abstract Algebra: Theory and Applications · Problem 17.5.25

Integral Domains — Thomas Judson

Mathematics — Abstract Algebra · polynomial-derivatives

Problem

Let FF be a field and f(x)=a0+a1x+⋯+anxnf(x) = a_0 + a_1 x + \cdots + a_n x^n be in F[x]F[x]. Define f′(x)=a1+2a2x+⋯+nanxn−1f'(x) = a_1 + 2a_2 x + \cdots + na_n x^{n-1} to be the derivative of f(x)f(x). ((a)) Prove that (f+g)′(x)=f′(x)+g′(x)(f+g)'(x) = f'(x) + g'(x). Conclude that we can define a homomorphism of abelian groups D:F[x]→F[x]D: F[x] \to F[x] by D(f(x))=f′(x)D(f(x)) = f'(x). ((b)) Calculate the kernel of DD if char F=0\text{char}\, F = 0. ((c)) Calculate the kernel of DD if char F=p\text{char}\, F = p. ((d)) Prove that (fg)′(x)=f′(x)g(x)+f(x)g′(x)(fg)'(x) = f'(x)g(x) + f(x)g'(x). ((e)) Suppose that we can factor a polynomial f(x)∈F[x]f(x) \in F[x] into linear factors, say f(x)=a(x−a1)(x−a2)⋯(x−an)f(x) = a(x - a_1)(x-a_2)\cdots(x-a_n). Prove that f(x)f(x) has no repeated factors if and only if f(x)f(x) and f′(x)f'(x) are relatively prime.

Browse the problem library