]> Commutative Algebra - Exercises

Commutative Algebra

Exercises from the end of chapter 1 of Atiya and MacDonald.

  1. Let R be a ring. Suppose xR is nilpotent. Show 1 +x is a unit of R. Deduce that the sum of a nilpotent element and a unit is a unit.

    Solution: For a sufficiently large odd positive integer n we have x n=0 , hence 1 =1 +x n=(1 +x)(1 x+...+x n1 ) showing that 1 +x has an inverse. Now suppose x is nilpotent and u is a unit. Note u 1 x is also nilpotent, hence 1 +u 1 x is a unit. Multiplying by u shows that u+x is also a unit.

  2. Let R be a ring. Let f=a 0 +a 1 x+...+a nx nR[x]. Prove that
    1. f is a unit in R[x] a 0 is a unit in R and a 1 ,...,a n are nilpotent.
    2. f is nilpotent a 0 ,a 1 ,...,a n are nilpotent are nilpotent.
    3. f is a zero divisor there exists a0 R such that af=0 .
    4. f is primitive if a 0 ,...,a n=1 . Show that if f,gR[x] then fg is primitive f,g are primitive.
    Solution:
    1. () Suppose a 0 is a unit and a 1 ,...,a n are nilpotent. Without loss of generality a 0 =1 . Set g=(a 1 x+...+a nx n). Then g r=0 for some r since sums and products of nilpotents are nilpotent. Then f 1 =1 /(1 g)=1 +g+g 2 +...g r1

      () Write f 1 =b 0 +b 1 x+...+b mx m, so that (b 0 +...+b mx m)(a 0 +...+a nx n)=1 Thus a 0 b 0 =1 so both a 0 ,b 0 are units. We also have a nb m=0 . Inductively assume a n i+1 b mi=0 for all i<r. By considering the coefficient of x m+nr in the above product we have a nb mr+a n1 b mr+1 +...+a nkb mr+k=0 for some k. Multiplying by a n r and using the inductive hypothesis gives a n r+1 b mr=0 for all r. In particular a n m+1 b 0 =0 , and since b 0 is a unit we have that a n is nilpotent. From exercise 1, fa nx n=a 0 +...+a n1 x n1 is also a unit so by induction a 1 ,...,a n1 are nilpotent.

    2. () Since sums and products of nilpotents are nilpotent, if a 0 ,...,a n are nilpotent then so is f.

      () Let f k=0 . Then a 0 k=0 . Inductively assume a i is nilpotent for i<r. By considering the coefficient of x rk we have a r k+T=0 where every term in T contains a i for some i<r. Thus a r k is nilpotent, hence a r is.

    3. One way is trivial. For the converse, choose g=b 0 +...+b mx m of least degree such that fg=0 . Then a nb m=0 . But since a ngf=0 , a ng has degree less than m, and g is of minimal degree, we must have a ng=0 . Inductively assume a nig=0 for all 0 i<r. The coefficient of x m+nr in fg is a nrb m+...+a nb mr=0 By the inductive hypothesis this simplifies to a nrb m=0 , thus a nrg=0 . Hence a ib j=0 for all i,j, thus any of the b j will annihilate f (so in fact g has degree zero).
  3. Generalize exercise 2 to a multinomial ring R[x 1 ,...,x r].
  4. In R[x], the Jacobson radical is equal to the nilradical.

    Solution: Suppose fR[x] lies in the Jacobson radical. Then 1 fx is a unit, hence by exercise 2.i we have that a 0 ,...,a n are nilpotent, implying that f is nilpotent by exercise 2.ii, thus f also lies in the nilradical.

  5. Let R be a ring and consider R[[x]], the ring of formal power series f= n=0 a nx n.
    1. f is a unit in R[[x]] a 0 is a unit in R.
    2. If f is nilpotent then a n is nilpotent for n0 .
    3. fJ(R[[x]]) a 0 J(R)
    4. The contraction of a maximal ideal IR[[x]] is a maximal ideal of R and I is generated by I c and x.
    5. Every prime ideal of R is the contraction of a prime ideal of R[[x]].
    Solution:
    1. If f is a unit in R then let g=b i be its inverse. Then a 0 b 0 =1 hence a 0 is a unit. Conversely, suppose a 0 is a unit. Then define the b i inductively by b 0 =a 0 1 , b i+1 =b 0 (a 1 b i+...+a i+1 b 0 ) and we have fg=1 .
    2. See 2.ii
    3. Suppose fJ(R[[x]]) then for all bR we have 1 fb is a unit, thus by exercise 5.i we have 1 a 0 b is a unit in R for all bR, hence a 0 J(R). Conversely, if a 0 J(R) then 1 fg for any gJ(R) is a unit again by 5.i.
    4. Let I be a maximal ideal of R[[x]]. We first show that xI. Suppose not. Then since I is maximal, we must have f+xg=1 for some fI,gR[[x]]. This implies the constant term of f is 1, which means f is a unit by exercise 5.i, a contradiction.

      Now suppose I c is not maximal. Then let J be some proper ideal of R strictly containing I c, and take cJI c. Since I is maximal, I and c generate all of R[[x]]. Thus f+cg=1 for some fI,gR[[x]]. The constant terms therefore satisfy a 0 +cb 0 =1 (where a i,b i are the coefficients of f,g). But a 0 =fxf where f=a 1 +a 2 x+..., thus a 0 I c. Hence 1 =a 0 +cb 0 J, a contradiction.

      Then I=I cx, because the constant term of fI must be contained in I c, and there are no restrictions on the other coefficients.

    5. Let I be a prime ideal of R. Consider the ideal J=Ix in R[[x]]. Suppose fgJ. Then if a 0 ,b 0 are the constant terms of f,g then a 0 b 0 =c where cI. Since I is prime we have a 0 ,b 0 I, hence f,gJ.
  6. Let R be a ring such that every ideal not contained in the nilradical contains a nonzero idempotent. Then N R=J(R).

    Solution: Suppose not. Let e be a nonzero idempotent in J(R). Now (1 e) 2 =1 e is a unit, so (1 e)x=1 for some xR. But squaring gives 1 =(1 e) 2 x 2 =(1 e)x 2 =x which implies 1 e=1 , a contradiction since e is nonzero.

  7. Let R be a ring such that every xR satisfies x n=x for some n>1 . Show every prime ideal is maximal.

    Solution: Let I be a prime ideal. Consider the integral domain R/I. Then for all xR, x+R=x n+R for some n. Since R/I is an integral domain, either x=0 or x n1 =1 in which case x has an inverse. Thus R/I is a field showing that I is maximal.

  8. Let R be a nonzero ring. Show that the set of prime ideals has minimal elements with respect to inclusion.

    Solution: Apply Zorn's Lemma.

  9. Let I be a proper ideal of a ring R. Show that I=r(I) I is an intersection of prime ideals.

    Solution: Recall that the radical of an ideal is the intersection of the prime ideals containing it. For the other direction, we use the fact that I=I for prime I and that IJ=IJ.

  10. Let R be a ring and N its nilradical. Show that the following are equivalent.

    1. R has exactly one prime ideal
    2. Every element of R is a unit or nilpotent
    3. R/N is a field.

    Solution: If R has exactly one prime ideal then N must be that ideal because it is the intersection of all the prime ideals. Since maximal ideals are prime, N is maximal as there is only one prime ideal. Thus R/N is a field, so for any xRN we have xy1 +N for some y. Since the sum of a nilpotent and a unit is itself a unit, we have that xy and hence x is a unit. Thus (i) (iii) (ii).

    Lastly suppose every element is a unit or nilpotent. N is maximal because every other unit is a unit, and since N is prime (as it is maximal) and the intersection of all the prime ideals, it is in fact the only prime ideal of R.

  11. A ring R is Boolean if x 2 =x for all xR. Show that
    1. 2 x=0 for all xR.
    2. Every prime ideal P is maximal, and R/P= 2 .
    3. Every finitely generated ideal in R is principal.
    Solution:
    1. 1 +x=(1 +x) 2 =1 +x+2 x implies 2 x=0 .
    2. Every prime ideal is maximal from exercise 7. In R/P, we have x+P=x 2 +P, thus x=0 or x=1 .
    3. Consider the expression x+yxy. Since x(x+yxy)=x,y(x+yxy)=y we have that x+yxy generates everything that x,y does. Thus by repeating this argument any finite set of generators for an ideal may be replaced by a single element.
  12. A local ring contains no idempotent except 0 and 1 .

    Solution: Suppose a local ring R contained an idempotent e0,1 . Its unique maximal ideal is J(R) since J(R) is the intersection of all maximal ideals. If eJ(R) then 1 e is a unit, that is (1 e)x=1 for some xR. But this implies 1 =(1 e) 2 x 2 =(1 e)x 2 =x, thus 1 e=1 which cannot be if e is nonzero. On the other hand, if eJ(R) then we have e 2 +R=e+R in the field R/J(R) implying that e is 0 or 1 , also a contradiction.