MAT401 HW5 Solutions CHAPTER 16 22. Prove that Z[x] is not a principle ideal domain.

Consider the ideal <x, 2> = {xf(x) + 2g(x) | f(x), g(x) Z[x]} Claim: <x, 2> cannot be generated by a single polynomial p(x). Proof: Assume <x, 2> <p(x)>, p(x) Z[x]. 2 <x, 2> p(x) = c, where c {-2, 2}. <x, 2> = <p(x)> = <c>, c {-2, 2}. Now for x <x, 2>, h(x) Z[x] s.t. x = h(x)c, where h(x) = ax, a Z. x = h(x)c = axc, a 0, c 0. 1 = ac, c {-2, 2}. c = 2, a = 1 or c = -2, a = - 1
2 2

but a = 1 Z h(x) Z, contradiction. 2 <x, 2> cannot be generated by a single polynomical p(x), and Z[x] is not a ! ! principle ideal domain. 27. Let F be a field & let I = {anx n + an-1xn-1 + a1x + a0 | ai F, a n + a n-1 + + a0 = 0}. Show that I is an ideal of F[x] & find a generator for I. Well show that I is an ideal using the ideal test. Let a(x), b(x) I. 1. anxn + an-1xn-1 + a1x + a0, bnxn + bn-1xn-1 + b1x + b0 I, ai, bi F, an + an-1 + + a0 = 0, bn + bn-1 + + b0 = 0. a(x) b(x) = (anxn + an-1xn-1 + a1 x + a0) (bnxn + bn-1xn-1 + b1x + b0) = (an-bn)xn + (an-1 bn-1)xn-1 + + (a0 b0) now ai, bi F ai bi F (an bn) + (an-1 bn-1) + (a0 b0) = (an + an-1 + + a0) (bn + bn-1 + + b0) =00 =0 a(x) b(x) I. 2. Let a(x) I, r(x) F[x]. Then, anxn + an-1xn-1 + a1x + a0 I, ai F, an + an-1 + + a0 = 0 and r(x) is a polynomial with coefficients in F. Note that the sum of the coefficients of r are not necessarily 0. r(x)a(x) = r(x)[anxn + an-1xn-1 + a1x + a0] = r(x)anxn + r(x)an-1xn-1 + .. r(x)a1x + r(x)a0 = [rmxm + rm-1xm-1 + + r0]anxn + [rmxm + rm-1xm-1 + + r0]an-1xn-1 + .. [rmxm + rm-1xm-1 + + r0]a1x + r(x)a0 The coefficients of r(x)a(x) are: rman, rman-1, rma0, rm-1an, rm-1an-1, rm-1a0, r0an, r0an-1, r0a0 Sum of the coefficients of r(x)a(x): rman + rman-1 + + rma0 + + rm-1an + rm-1an-1 + + rm-1a0 + + r0an + r0an-1 + + r0 a 0 = rm(an + an-1 + + a0) + rm-1(an + an-1 + + a0) + + r0(an + an-1 + + a0) = rm(0) + rm-1(0) + + r0(0) =0 r(x)a(x) I. Similarly, it can be shown that a(x)r(x) I. By the ideal test, I is an ideal.
!

Now let h(x) be the generator of I. By Thm 16.4, g(x) is a nonzero polynomial of minimum degree, where minimum degree is 1. h(x) = a1x + a0 but a1 + a0 = 0, so a0 = -a1 h(x) = a1x a1 = a1(x 1) h(x) <x-1>, and g(x) = x 1 is a generator for I 31. For every prime p, show that xp-1 1 = (x 1)(x 2) [x (p 1)] in Zp[x]. Let f(x) = xp-1 1 (x 1)(x 2) [x (p 1)]. By Corollary 3, f(x) can have at most (p 1) zeros. Claim: 1, 2, (p 1) are zeros of f(x). Recall: Fermats Little Theorem: ap-1 1 mod p, gcd(a, p) = 1 Its easy to see that 1, 2, (p 1) are zeros for [(x 1)(x 2) (x (p 1))] For xp-1 1, 1, 2, (p 1) are all relatively prime to p Then by Fermats Little Theorem, xp-1 1 mod p for x = 1, 2, (p 1) xp-1 1 1 1 mod p xp-1 1 0 mod p f(x) = 0 for x = 1, 2, (p 1) f(x) = 0 in Zp[x] 0 = xp-1 1 (x 1)(x 2) [x (p 1)] xp-1 1 = (x 1)(x 2) [x (p 1)] 39. Let F be a field & let f, g F[x]. If there is no polynomial of positive degree in F[x] that divides both f & g (in this case, f and g are said to be relatively prime), prove that polynomicals h, k F[x] s.t. fh + gk = 1. By Thm 16.3, F[x] is a principle ideal domain. <f, g> = <r>, r F[x] r|f & r|g, but f, g relatively prime so r = a0, a0 0, a0 F <f, g> = <a0>, so m, n F[x] s.t. fm + gn = a0.
fm a0

gn a0

= 1 , let h(x) =

m a0

, k(x) =

n a0

fh + gk = 1 41. Let f R[x]. If f(a) = 0, f(a) = 0, show that (x a)2 divides f(x). ! ! ! f(a) = 0 a is a zero of f(x) (x a)|f(x) f(x) = g(x) + (x a)g(x) f(a) = 0 f(a) = g(a) + (a a)g(a) = g(a) = 0 g(a) = 0, a is a zero of g and (x a)|g g(x) = (x a)h(x), h R[x] Thus, f(x) = (x a)g(x) = (x a)(x a)h(x) = (x a)2h(x) (x a)2|f(x) CHAPTER 17 4. Suppose f(x) = xn + a n-1xn-1 + + a0 Z[x]. if r is rational & (x r) divides f(x), show that r is an integer. (x r)|f(x) r is a zero of f(x). Since r Q, let r = 0 = f(r) = f( p ) = ( p )n + an-1( p )n-1 + + ( p )a1 + a0
q q q q p q

, (p, q) = 1, p, q Z. Now,

Multiplying by qn,
! ! ! !

0 = pn + an-1qpn-1 + + a1qn-1p + a0qn = pn + q(an-1pn-1 + q(an-2pn-2 + + qa0)) By above, it must be that q|pn, but (p, q) = 1 so q must be 1 and hence r is an integer