1/23
Looks like no tags are added yet.
Exercise 1(1). Prove or disprove: Every subring of Z is generated by one element.
True. Let S⊆Z be a subring. Since S is closed under addition and additive inverses, (S,+) is an additive subgroup of (Z,+). By the classification of subgroups of Z, every such subgroup has the form nZ for some n≥0. Thus S=nZ=kn:k∈Z. This set is generated additively by the single element n. It is also the subring generated by n, since it is closed under multiplication: (an)(bn)=abn2∈nZ. Therefore every subring of Z is generated by one element. If subrings are required to contain the identity, the only possibility is Z itself, generated by 1.
Exercise 1(2). Prove or disprove: In a ring with identity without zero-divisors, the only elements r such that r2=1 are 1 and −1.
True. Let R be a ring with identity and no zero-divisors, and suppose r2=1. Subtracting 1 gives r2−1=0. Since 1 commutes with every element, we can factor this expression even when R is noncommutative: (r−1)(r+1)=r2−1=0. By the assumption that R has no zero-divisors, a product can equal zero only if at least one factor is zero. Therefore r−1=0 or r+1=0, giving r=1 or r=−1. Conversely, 12=1 and (−1)2=1. Hence the solutions are exactly 1 and −1, which may coincide in characteristic 2.
Exercise 1(3). Prove or disprove: The set of rational numbers with odd denominator (when written in lowest terms) is a subring of Q.
True. Define S=a/b∈Q:a,b∈Z, b=0, b odd. First, 0=0/1∈S, so S is nonempty. Let a/b,c/d∈S, where b,d are odd. Their difference is a/b−c/d=(ad−bc)/(bd). Since the product of two odd integers is odd, bd is odd. Similarly, their product is (a/b)(c/d)=ac/(bd), again with odd denominator. Reducing either fraction to lowest terms only divides its denominator by an integer, so the resulting denominator remains odd. Thus S is closed under subtraction and multiplication. By the subring test, S is a subring of Q.
Exercise 1(4). Prove or disprove: An element r of a ring with identity R with two distinct right inverses (distinct s,t∈R such that rs=rt=1) is a left zero-divisor.
True. Suppose r∈R has two distinct right inverses s,t∈R, meaning rs=1 and rt=1, with s=t. Subtract these equations: rs−rt=1−1=0. By right distributivity, r(s−t)=0. Because s=t, their difference s−t is nonzero. Also, r=0, since rs=1 and the identity of the ring is nonzero under the stated hypothesis that two distinct right inverses exist. Thus we have found nonzero elements r and s−t whose product is zero, with r on the left. By definition, r is a left zero-divisor.
Exercise 2(1). Let (G,+) be an abelian group, R=group homomorphisms G→G, and define (φ+ψ)(g)=φ(g)+ψ(g) for every g∈G. Let ∘ denote composition. Show that (R,+,∘) is a ring with identity.
First show closure: for a,b∈G, (φ+ψ)(a+b)=φ(a)+φ(b)+ψ(a)+ψ(b)=(φ+ψ)(a)+(φ+ψ)(b), using commutativity of G. Pointwise associativity and commutativity follow from G. The zero homomorphism is the additive identity, and (−φ)(g)=−φ(g) gives additive inverses. Composition is closed because compositions of homomorphisms are homomorphisms, and it is associative because function composition is associative. Right distributivity follows from ((φ+ψ)∘θ)(g)=φ(θ(g))+ψ(θ(g)). Left distributivity follows from (φ∘(ψ+θ))(g)=φ(ψ(g)+θ(g))=φ(ψ(g))+φ(θ(g)). Finally, idG∘φ=φ∘idG=φ. Therefore R is a ring with identity idG.
Exercise 2(2). Let (G,+) be an abelian group, R=group homomorphisms G→G, with pointwise addition (φ+ψ)(g)=φ(g)+ψ(g) and multiplication by composition. If G were not abelian, would R still be a ring?
No. Suppose G is nonabelian. The identity map idG is a group homomorphism, so it belongs to R. If R were closed under pointwise addition, then idG+idG would also be a homomorphism. Therefore, for every a,b∈G, the homomorphism property would imply (a+b)+(a+b)=(a+a)+(b+b). Written without parentheses, associativity gives a+b+a+b=a+a+b+b. Cancel the first a on the left and the last b on the right to obtain b+a=a+b. Since a,b were arbitrary, G would be abelian, contradicting our assumption. Thus pointwise addition is not closed on R, so the proposed operations do not make R a ring.
Exercise 2(3). Let (G,+) be an abelian group, R=group homomorphisms G→G, with pointwise addition and multiplication by composition. Find a nontrivial group G for which R is commutative and one for which R is not commutative.
For a commutative example, take G=(Z,+). Every homomorphism φ:Z→Z is determined by φ(1)=n, so φ(k)=nk. For any two endomorphisms φn,φm, we have (φn∘φm)(k)=nmk=mnk=(φm∘φn)(k). Hence R≅Z is commutative. For a noncommutative example, take G=(Z2,+). Define φ(x,y)=(y,0) and ψ(x,y)=(0,x). Both are homomorphisms. But (φ∘ψ)(x,y)=(x,0), whereas (ψ∘φ)(x,y)=(0,y). These are different, for example at (1,0). Thus composition is not commutative and R≅M2(Z) is noncommutative.
Exercise 2(4). Let (G,+) be an abelian group, R=group homomorphisms G→G, with pointwise addition and multiplication by composition. Show that the units of R are the group automorphisms of G.
Recall that a unit of R is an endomorphism φ possessing a two-sided inverse under composition. Suppose φ is a unit. Then there exists ψ∈R such that φ∘ψ=ψ∘φ=idG. Therefore φ has a two-sided inverse as a function, so it is bijective. Since φ is already a homomorphism, it is a group automorphism. Conversely, suppose φ is an automorphism of G. It is a bijective homomorphism, and its inverse function φ−1 is also a homomorphism: if a=φ(x) and b=φ(y), then φ−1(a+b)=x+y=φ−1(a)+φ−1(b). Thus φ−1∈R, and both compositions equal idG. Hence R×=Aut(G).
Exercise 3(1). Let (R,+R,⋅R) and (S,+S,⋅S) be rings. On R×S define (r1,s1)+(r2,s2)=(r1+Rr2,s1+Ss2) and (r1,s1)⋅(r2,s2)=(r1⋅Rr2,s1⋅Ss2). Show that (R×S,+,⋅) is a ring.
Verify the ring axioms coordinatewise. Closure under addition and multiplication follows because each coordinate lies in its respective ring. The additive identity is (0R,0S), and the additive inverse of (r,s) is (−r,−s). Addition is associative and commutative because addition in R and S has these properties. Multiplication is associative since ((r,s)(u,v))(x,y)=((ru)x,(sv)y)=(r(ux),s(vy))=(r,s)((u,v)(x,y)). For distributivity, (r,s)((u,v)+(x,y))=(r(u+x),s(v+y))=(ru+rx,sv+sy)=(r,s)(u,v)+(r,s)(x,y). The other distributive law follows similarly. All ring axioms hold, so R×S is a ring.
Exercise 3(2). Let R,S be rings and define addition and multiplication on R×S componentwise. Show that R×S is commutative if and only if both R and S are commutative.
Prove both directions. First suppose R and S are commutative. For arbitrary (r,s),(u,v)∈R×S, we have (r,s)(u,v)=(ru,sv)=(ur,vs)=(u,v)(r,s). Hence R×S is commutative. Conversely, suppose R×S is commutative. Choose arbitrary r,u∈R and consider (r,0S) and (u,0S). Their commutativity gives (ru,0S)=(ur,0S), so ru=ur. Thus R is commutative. Similarly, comparing (0R,s)(0R,v) with (0R,v)(0R,s) for arbitrary s,v∈S gives sv=vs. Therefore S is commutative. Both implications hold, proving the equivalence.
Exercise 3(3). Let R,S be rings and define addition and multiplication on R×S componentwise. Show that R×S has an identity if and only if both R and S have identities.
First assume R and S have multiplicative identities 1R and 1S. Then for every (r,s)∈R×S, (1R,1S)(r,s)=(r,s)=(r,s)(1R,1S). Thus (1R,1S) is the identity of the product. Conversely, assume R×S has identity (eR,eS). For arbitrary r∈R, multiplying (r,0S) on both sides by this identity gives (eRr,0S)=(r,0S)=(reR,0S). Therefore eRr=reR=r for every r∈R, so eR is the identity of R. Similarly, applying the identity to (0R,s) shows eSs=seS=s for every s∈S. Thus both rings have identities, completing the equivalence.
Exercise 3(4). Let R,S be rings with identity and define multiplication on R×S componentwise. Show that (R×S)×=R××S×, where R× denotes the group of units of R.
Suppose (r,s)∈(R×S)×. Then there exists (u,v)∈R×S such that (r,s)(u,v)=(u,v)(r,s)=(1R,1S). By componentwise multiplication, this means ru=ur=1R and sv=vs=1S. Therefore r is a unit of R with inverse u, and s is a unit of S with inverse v. Thus (r,s)∈R××S×. Conversely, suppose r∈R× and s∈S×. Their inverses exist, and (r,s)(r−1,s−1)=(1R,1S)=(r−1,s−1)(r,s). Hence (r,s) is a unit in R×S. The two inclusions establish (R×S)×=R××S×, with inverses computed coordinatewise.
Exercise 3(5). Let R,S be rings and define addition and multiplication on R×S componentwise. Determine under which conditions on R,S the ring R×S is a division ring.
Recall that a division ring is a nontrivial ring with identity in which every nonzero element has a multiplicative inverse. Suppose both R and S are nontrivial. Choose r=0 in R and s=0 in S. Then (r,0S) and (0R,s) are nonzero, but (r,0S)(0R,s)=(0R,0S). This is impossible in a division ring, since division rings have no nonzero zero-divisors. Hence at least one factor must be the zero ring. If S=0, the map R→R×S given by r↦(r,0) is a ring isomorphism. Therefore R×S is a division ring precisely when R is one. The case R=0 is symmetric. Thus exactly one factor must be zero and the other a division ring.
Exercise 4(1). Let R,S be rings, and let R′⊆R and S′⊆S be subrings. Show that R′×S′ is a subring of R×S, where the product operations are componentwise.
Apply the subring test. Because R′ and S′ are subrings, they contain their respective additive identities, so (0R,0S)∈R′×S′. Thus the proposed subring is nonempty. Take arbitrary (a,b),(c,d)∈R′×S′. Since subrings are closed under subtraction, a−c∈R′ and b−d∈S′. Consequently, (a,b)−(c,d)=(a−c,b−d)∈R′×S′. Similarly, closure of R′ and S′ under multiplication gives ac∈R′ and bd∈S′, so (a,b)(c,d)=(ac,bd)∈R′×S′. Therefore R′×S′ is nonempty and closed under subtraction and multiplication. By the subring test, it is a subring of R×S.
Exercise 4(2). Let R,S be rings. Find R,S such that R×S contains a subring T not of the form R′×S′ for subrings R′⊆R, S′⊆S. Explain why T cannot be written that way.
Take R=S=Z and define the diagonal subset T=(n,n):n∈Z⊆Z×Z. First verify it is a subring. It contains (0,0), and (a,a)−(b,b)=(a−b,a−b)∈T and (a,a)(b,b)=(ab,ab)∈T. Now suppose for contradiction that T=R′×S′ for some subrings R′,S′⊆Z. Since (1,1)∈T, we must have 1∈R′ and 1∈S′. Also 0∈S′ because every subring contains zero. Therefore (1,0)∈R′×S′=T. But every element of T has equal coordinates, whereas 1=0. This contradiction proves that T cannot be expressed as a direct product of two subrings.
Exercise 4(3). Let R,S be nontrivial rings and let r∈R∖0. Show that (r,0S) is a zero-divisor in R×S.
Since S is a nontrivial ring, there exists an element s∈S with s=0S. Consider (0R,s)∈R×S. This element is nonzero because its second coordinate is nonzero. By assumption, r=0R, so (r,0S) is also nonzero. Using componentwise multiplication, compute (r,0S)(0R,s)=(r0R,0Ss)=(0R,0S). Hence (r,0S) multiplies a nonzero element on its right to give the zero element of R×S. Therefore (r,0S) is a left zero-divisor. In fact, the reverse product also vanishes, so it is a two-sided zero-divisor. This proves the statement.
Exercise 4(4). Let R,S be rings. Show that R×S is an integral domain if and only if R is an integral domain and S=0, or S is an integral domain and R=0.
Recall that an integral domain is a nontrivial commutative ring with identity and no zero-divisors. Suppose R×S is an integral domain. If both factors were nontrivial, choose r=0 and s=0. Then (r,0S)(0R,s)=(0R,0S), contradicting the absence of zero-divisors. Thus at least one factor is zero. They cannot both be zero because an integral domain is nontrivial. Suppose S=0. The map φ:R→R×S defined by φ(r)=(r,0) is bijective and preserves addition and multiplication, so it is a ring isomorphism. Hence R is an integral domain. The other case is symmetric. Conversely, if R is an integral domain and S=0, then R×S≅R is an integral domain. Similarly for the reversed factors.
Exercise 5(1). Let R be a ring. Define its center by Z(R)=r∈R:rs=sr for all s∈R. Show that Z(R) is a subring of R.
Use the subring test. First, 0∈Z(R) because 0r=r0=0 for every r∈R. Let a,b∈Z(R) and choose any r∈R. Since a and b commute with every element of R, we have ar=ra and br=rb. Therefore (a−b)r=ar−br=ra−rb=r(a−b), showing a−b∈Z(R). For multiplication, (ab)r=a(br)=a(rb)=(ar)b=(ra)b=r(ab). Thus ab∈Z(R). Since the center is nonempty and closed under subtraction and multiplication, it is a subring of R. Furthermore, any two elements of Z(R) commute, since each commutes with every element of R.
Exercise 5(2). Let R be a division ring and define Z(R)=a∈R:ar=ra for all r∈R. Show that Z(R) is a subfield of R.
By part (1), Z(R) is a subring of R. It is commutative because any a,b∈Z(R) satisfy ab=ba. Also 1R∈Z(R), since the identity commutes with every element. It remains to show that every nonzero central element has an inverse belonging to the center. Let a∈Z(R) with a=0. Since R is a division ring, a−1∈R exists. For any r∈R, centrality gives ar=ra. Multiply this equality on the left and right by a−1 to obtain ra−1=a−1r. Thus a−1 commutes with every r∈R, so a−1∈Z(R). Hence Z(R) is a commutative ring with identity in which every nonzero element is invertible, proving it is a field.
Exercise 5(3). Let R be a ring with identity and n∈N+. Prove Z(Mn(R))=(aij)∈Mn(R):aij=0 for i=j, a11=⋯=ann∈Z(R).
Write the proposed center as aIn:a∈Z(R) and prove both inclusions. If a∈Z(R) and B=(bij) is arbitrary, then (aInB)<em>ij=ab</em>ij=bija=(BaIn)<em>ij, so aIn is central. Conversely, let A=(a</em>ij)∈Z(Mn(R)) and denote the standard matrix units by Eij. Commuting A with every Eii forces all off-diagonal entries of A to be zero, so A is diagonal. Commuting with Eij for i=j gives aii=ajj; hence A=aIn for some a∈R. Finally, for arbitrary r∈R, commuting A with rE11 gives arE11=raE11, hence ar=ra. Thus a∈Z(R). For n=1, this final step alone suffices. Both inclusions establish the equality.
Exercise 6. Let R be a commutative ring and p∈R[X]∖0. Show that p is a zero-divisor in R[X] if and only if there exists r∈R∖0 such that pr=0.
First, if pr=0 for some nonzero constant r∈R, then r is a nonzero polynomial, so p is a zero-divisor. Conversely, suppose pq=0 for some nonzero q∈R[X]. Choose such a q of minimal degree m. Write p=∑i=0naiXi and q=∑j=0mbjXj, with bm=0. The coefficient of Xn+m in pq=0 gives anbm=0. Hence deg(anq)<m if anq=0. But p(anq)=anpq=0, so minimality forces anq=0. Induct downward: assuming ai+1q=⋯=anq=0, the coefficient of Xi+m in pq gives aibm=0, because all higher-index contributions vanish. Again p(aiq)=0 and deg(aiq)<m, so aiq=0. Thus aibm=0 for every i, and therefore pbm=0. Since bm=0, take r=bm.
Exercise 7(1). Let R be a nontrivial ring and G a nontrivial group. Let RG be the group ring. Show that ε:RG→R, defined by ε(∑g∈Grgg)=∑g∈Grg, is well-defined and a ring homomorphism.
Every element of the group ring RG has a unique representation as a finite formal sum ∑g∈Grgg, with only finitely many nonzero coefficients. Therefore ε is well-defined because the coefficient sum is finite and independent of the representation. Let a=∑grgg and b=∑hshh. Addition is coefficientwise, so ε(a+b)=∑g(rg+sg)=ε(a)+ε(b). For multiplication, the group-ring rule gives ab=∑g,hrgsh(gh). Hence ε(ab)=∑g,hrgsh=(∑grg)(∑hsh)=ε(a)ε(b) by distributivity and finite summation. Thus ε preserves addition and multiplication and is a ring homomorphism. If R has identity, it also preserves identity.
Exercise 7(2). Let R be a nontrivial ring and G a nontrivial group. Assume R has identity. Show that rg∈(RG)× for every r∈R× and g∈G.
Suppose r∈R× and g∈G. Since r is a unit, there exists r−1∈R satisfying rr−1=r−1r=1R. Since G is a group, g has inverse g−1∈G with gg−1=g−1g=eG. Consider the element r−1g−1∈RG. By the multiplication rule in the group ring, (rg)(r−1g−1)=(rr−1)(gg−1)=1ReG. Similarly, (r−1g−1)(rg)=(r−1r)(g−1g)=1ReG. The element 1ReG is the multiplicative identity of RG. Thus r−1g−1 is a two-sided multiplicative inverse of rg. Therefore rg∈(RG)×, with (rg)−1=r−1g−1.
Exercise 7(3). Let R be a nontrivial ring and G a nontrivial group. Assume G has a nontrivial element of finite order. Show that the group ring RG has a zero-divisor.
Choose g∈G with finite order n>1, so gn=eG, and choose 0=r∈R. Define a=rg−reG and b=reG+rg+⋯+rgn−1 in RG. Both are nonzero: the elements eG,g,…,gn−1 are distinct, and the coefficients r and −r are nonzero. Compute their product using distributivity: ab=r2(g−eG)(eG+g+⋯+gn−1). The intermediate terms cancel telescopically, leaving ab=r2(gn−eG). Since gn=eG, this equals zero. Therefore a=0 and b=0 but ab=0, proving that RG contains a zero-divisor. The argument does not require R to have an identity.