]> Commutative Algebra - Direct Sums

Commutative Algebra

Direct Sums

Let R 1 ,...,R m be rings. Then the direct sum of R 1 ,...,R m is the ring

R=R 1 ...R m= i=1 nR i= i=1 nR i={(x 1 ,...,x m)x iA i}

with coordinatewise addition and multiplication. The projection mapping p i:RR i for each i is an onto ring homomorphism defined by p(x 1 ,...,x m)=x i.

Let R be a ring and J 1 ,...,J nR. Define ϕ:R i=1 nR i by

ϕ:x(J 1 +x,...,J n+x)

, so ϕ is a ring homomorphism with kerϕ= i=1 nJ i.

Proposition:

1. ϕ is injective if and only if i=1 nJ i={0 }

2. ϕ is surjective if and only if J i,J k are coprime for ik

3. If J i,J k are coprime for ik then i=1 nJ i= i=1 nJ i.

Proof: (1) is clear.

For (2), suppose ϕ is surjective. Then for some xR we have (J 1 +x,...,J n+x)=(J 1 +1 ,J 2 ,...,J n), thus x(J 1 +1 )J 2 , hence 1 =(1 x)+xJ 1 +J 2 , so J 1 ,J 2 are coprime. Similarly, J i,J k are coprime whenever ik.

Conversely, suppose J i,J k are coprime for ik. Then for all k2 there exists some u kJ 1 ,v kJ k with u k+v k=1 . Let aR. Set x=av 2 ...v n. Then xJ k for k2 , and

x=a(1 u 2 )...(1 u n)=a+( terms containing u i)J 1 +a

So ϕ(x)=(J 1 +a,J 2 ,...,J n). Similarly for any i, we can show (J 1 ,...,J i+a,,...,J n)imϕ. Hence for any a 1 ,...,a nR we have (J 1 +a 1 ,...,J n+a n)= i=1 n(J 1 ,...,J i+a i,...,J n)imϕ.

(3) Suppose J i,J k are coprime for ik. For n=2 we have J 1 J 2 =J 1 J 2 since J 1 ,J 2 are coprime. Now suppose n>2 and i=1 n1 J i= i=1 n1 J i. Write K= i=1 n1 J i. Since for all i=1 ,...,n1 there exists x iJ i,y iJ n with x i+y i=1 ,we have

1 = 1 (x 1 ...x n1 )+(x 1 ...x n1 ) = 1 ((1 y 1 )...(1 y n1 ))+(x 1 ...x n1 ) = 1 (1 +y)+x

for some yJ n,xK. Thus 1 J n+K. Hence

i=1 nJ i=KJ n=KJ n

since J n,K are coprime.

Theorem: Let R be a ring. Then:

1. Let J 1 ,...,J nR and P be a prime ideal of R with P i=1 nJ i. Then PJ k for some k. Futhermore if P= i=1 nJ i then P=J k for some k.

2. Let P 1 ,...,P n be prime ideals of R and suppose JR satisfies J i=1 nP i. Then JP i for some i.

Proof: (1) Suppose P does not contain any of the J i. Then for all i, choose some x iJ iP. Set y=x 1 ...x n. Then y i=1 nP. But since P is prime, for some k we have x kP, a contradiction. Hence PJ i.

Next suppose P= k=1 nJ k. Then J iPJ i.

(2) If n=1 then JP 1 . This is the basis of an induction. We shall show that for some j=1 ,...,n, we have J ijP i, from which the result follows.

Suppose not. Then for all j=1 ,..,n choose x jJ ijP i. Since J i=1 nP i we must have x jP j for each j=1 ,...,n. Set

y= j=1 nx 1 ...x j1 x j+1 ...x n

Then yJ= i=1 nP i so yP k for some k=1 ,...,n. But this means

x 1 ...x k1 x k+1 ...x n=y jkx 1 ...x j1 x j+1 ...x nP k,

and since P k is prime, we have x jP k for some jk, a contradiction.