Exercise 1.2

Let A be a ring and let A [ x ] be the ring of polynomials in an indeterminate x , with coefficients in A . Let f = a 0 + a 1 x + + a n x n A [ x ] . Prove that

i)
f is a unit in A [ x ] a 0 is a unit in A and a 1 , , a n are nilpotent.
ii)
f is nilpotent a 0 , a 1 , , a n are nilpotent.
iii)
f is a zero-divisor there exists a 0 in A such that af = 0 .
iv)
f is said to be primitive if ( a 0 , a 1 , , a n ) = ( 1 ) . Prove that if f , g A [ x ] , then fg is primitive f and g are primitive.

Answers

Proof of i ) . . We induce on the degree n of f . If n = 0 , then f = a 0 A × . So suppose n > 0 . Let b 0 + b 1 x + + b m x m be the inverse of f . By matching degrees in x in the equation fg = 1 , we have the system of equations

a n b m = 0 a n 1 b m + a n b m 1 = 0 a n 2 b m + a n 1 b m 1 + a n b m 2 = 0 a 0 b 0 = 1 .
(1)

The last row gives that a 0 , b 0 are units. We now claim that a n r + 1 b m r = 0 for 0 r m . The case when r = 0 is the first row in (1). Suppose the claim holds for all 0 r < k . We then have

a n k ( a n k b m + a n k + 1 b m 1 + + a n 1 b m k + 1 + a n b m k ) = a n k a n k b m + a n k a n k + 1 b m 1 + + a n k a n 1 b m k + 1 + a n k + 1 b m k = 0

by multiplying the ( k + 1 ) th line from (1) by a n k . All but the last term vanish by inductive hypothesis, and so a n k + 1 b m k = 0 . In particular, for r = m we have a n m + 1 b 0 = 0 , which implies a n m + 1 = 0 since b 0 is a unit, i.e., a n is nilpotent. Now f a n x n is a unit by Exercise 1, hence by inductive hypothesis a 1 , , a n 1 are units as well.

. g = i = 1 n a i x i is nilpotent since 𝔑 is an ideal by Prop. 1.7, so f = a 0 + g is a unit by Exercise 1. □

Proof of ii ) . We have: . 1 + f is a unit by Exercise 1, and so a 1 , , a n are nilpotent by i ) . a 0 is nilpotent as well for otherwise f m has constant term a 0 m 0 for any m .

. If a 0 , a 1 , , a n 𝔑 , f 𝔑 since 𝔑 is an ideal by Prop. 1.7. □

Proof of iii ) . . Trivial since a A A [ x ] .

. Suppose not, and let g = b 0 + b 1 x + + b m x m be a polynomial of least degree m > 0 such that fg = 0 . We claim a n r g = 0 for all 0 r n . First, a n b m = 0 , hence a n g = 0 since it has degree less than m but annihilates f . Now suppose that a n r g = 0 for all 0 r < r 0 . Then, we have that

fg = ( a 0 + a 1 x + + a n r 0 x n r 0 ) g = 0

by inductive hypothesis. Then, a n r 0 b m = 0 , hence a n r 0 g = 0 since it has degree less than m but annihilates f . By induction, a n r g = 0 for all 0 r n , hence letting a = b m gives af = 0 , a contradiction. □

Proof of iv ) . . Suppose fg is primitive but f is not. Then, 𝔞 = ( a 0 , a 1 , , a n ) 𝔪 A by Cor.  1.4 , where 𝔪 is a maximal ideal. Now consider the natural homomorphism φ : A [ x ] A 𝔪 [ x ] induced by the map A A 𝔪 on coefficients. φ ( f ) = 0 implies that φ ( fg ) = 0 , and so the coefficients of fg are in 𝔪 , a contradiction.

. Suppose f , g are primitive but fg is not. Then, the coefficients of fg generate an ideal 𝔞 , and 𝔞 𝔪 A by Cor.  1.4 , where 𝔪 is again a maximal ideal. The same map φ defined above has φ ( fg ) = 0 , and so φ ( f ) φ ( g ) = 0 , i.e., either φ ( f ) = 0 or φ ( g ) = 0 , for if either were a zero divisor, then there exists a A 𝔪 such that ( f ) = 0 by iii ) , contradicting that A 𝔪 is a field. Thus, the coefficients of either f or g are contained in 𝔪 , a contradiction. □

User profile picture
2023-07-24 14:11
Comments