Seint Seint Thu

PhDPrelim-Math-1
2024-2025 Academic Year
August 15, 2024
1. [Pg. 9, Pro. 1.1.4] Prove that a nonempty subset R of a ring S is a
subring if and only if
(a) R is closed under the addition and multiplication of S ,
(b) if a ∈ R, then −a ∈ R,
(c) the multiplicative identity of S belongs to R.
Proof. Assume that R be a subring. Then R is a ring under the
operations on S . Thus the required conditions (a) to (c) are satised.
Conversely, assume that conditions (a) to (c) satisfy. We will show
that R is a ring. By (a), closure law satises under addition and mul-
tiplication. Since R is a subset of S , associative law and commutative
law satisfy under addition By (b), each element a ∈ R has an inverse
in R. By (a) and (b), the additive identity element, 0 is in R.
Since R ⊂ S , associative law satises under multiplication. Also, left
and right distrubutive law satisy. We have 1S = 1R by condition
(iii). Thus 1R =!S is the multiplicative identity of R. Therefore R is a
subring. #
2. [Eg.1.1.4] Let the set of all 2 × 2 matrices with complex entries, M2 (C)
be a ring under matrix addition and matrix
 multiplication.
 Determine
a b
whether or not R = M2 (Z) = : a, b, c, d ∈ Z is a subring of
c d
M2 (C)?    
a b e f
Proof. For any , ∈ R,
c d g h
     
a b e f a+e b+f
+ = ∈R
c d g h c+g d+h
because a + e, b + f, c + g, d + h ∈ Z.
   
a b e f
For any , ∈ R,
c d g h
    
a b e f ae + gb af + bh
= ∈R
c d g h ce + dg cf + dh

1
 because ae + gb, af + bh, ce + dg, cf + dh ∈ Z. (i) is satised.

a b
For any ∈ R,
c d
  
a b −a −b
− = ∈R
c d −c −d

because −a, −b, −c, −d ∈ Z. (ii) is satised.


a b
For any ∈ R,
c d
    
1 0 a b a b
= ,
0 1 c d c d
and     
a b 1 0 a b
= .
c d 0 1 c d
 
1 0
Thus is multiplicative identity element of R . (iii) is satised.
0 1
Thus R is a subring of M2 (C). #
The ring R has interesting facts more than M2 (R). These are:
 
a b
ˆ The matrix has a multiplicative inverse if and only if ad −
c d
bc = ±1.
ˆ From an integral domain, there are many examples of nonzero  
1 0
matrices A, B ∈ M2 (Z) = R with AB = 0, such as A =
  0 0
0 0
and B = .
0 1
 
a b
ˆ Let S be the subring of M2 (C) consisting of all matrices
c d
such that b = 0. The ring S is called the ring of lower triangular
matrices with entries in Z.
 
a 0
ˆ The matrix is invertible if and only if a = ±1 and b = ±1.
c d

3. [Eg. 1.1.5] Let R1 , R2 , . . . , Rn be rings. Show that the set of n-tuples

(r1 , r2 , . . . , rn ) such that ri ∈ Ri for all i = 1, 2, . . . , n is a ring under

2
componentwise addition and multiplication.

Proof. Let R = R1 ⊕ · · · ⊕ Rn = {(r1 , r2 , . . . , rn )| ri ∈ Ri , 1 ≤ i ≤ n}.

Dene + : R × R → R by
+((a1 , a2 , . . . , an ), (b1 , b2 , . . . , bn )) = (a1 + b1 , a2 + b2 , . . . , an + bn )
for all ai , bi ∈ R, i = 1, 2, · · · , n and
· : R × R → R by
·((a1 , a2 , . . . , an ), (b1 , b2 , . . . , bn )) = (a1 b1 , a2 b2 , . . . , an bn )
for all ai , bi ∈ R, i = 1, 2, . . . , n.
Closure Law holds under addition and multiplication because
ai + bi ∈ Ri , and ai bi ∈ R, for all i.
For any (a1 , a2 , . . . , an ), (b1 , b2 , . . . , bn ), (c1 , c2 , . . . , cn ) ∈ R, we have

(a1 , . . . , an ) + {(b1 , . . . , bn ) + (c1 , . . . , cn )}

= (a1 , . . . , an ) + (b1 + c1 , . . . , bn + cn )}
= ((a1 + (b1 + c1 , . . . , an + (bn + cn ))
= (a1 + b1 ) + c1 ), . . . , (an + bn ) + cn )
= (a1 + b1 , . . . , an + bn ) + (c1 , . . . , cn )
= {(a1 , . . . , an ) + (b1 , . . . , bn )} + (c1 , . . . , cn ).

(a1 , . . . , an ){(b1 , . . . , bn )(c1 , . . . , cn )} = (a1 , . . . , an )(b1 c1 , . . . , bn cn )

= (a1 (b1 c1 ), . . . , an (bn cn ))
= ((a1 b1 )c1 , . . . , (an bn )cn )
= (a1 b1 , . . . , an bn )(c1 , . . . , cn )
= {(a1 , . . . , an )(b1 , . . . , bn )}(c1 , . . . , cn ).

Associative laws hold under addition and multiplication.

For any (a1 , a2 , . . . , an ), (b1 , b2 , . . . , bn ), ∈ R, then we have

(a1 , . . . , an ) + (b1 , . . . , bn ) = (a1 + b1 , . . . , an + bn )

= (b1 + a1 , . . . , bn + an )
= (b1 , . . . , bn ) + (a1 , . . . , an )

Thus, commutative law holds under addition.

For any (a1 , a2 , . . . , an ), (b1 , b2 , . . . , bn ), (c1 , c2 , . . . , cn ) ∈ R, we have

3
(a1 , . . . , an ){(b1 , . . . , bn ) + (c1 , . . . , cn )} = (a1 , . . . , an )(b1 + c1 , . . . , bn + cn )
= (a1 (b1 + c1 ), . . . , an (bn + cn ))
= (a1 b1 , . . . , an bn ) + (a1 c1 , . . . , an cn )
= (a1 b1 , . . . , an bn ) + (a1 c1 , . . . , an cn )
= (a1 , . . . , an )(b1 , . . . , bn ) +
(a1 , . . . , an )(c1 , . . . , cn ).

Again,
{(b1 , . . . , bn ) + (c1 , . . . , cn )}(a1 , . . . , an )
= (b1 + c1 , . . . , bn + cn )(a1 , . . . , an )
= ((b1 + c1 )a1 , . . . , (bn + cn )an )
= (b1 a1 + c1 a1 , . . . , bn an + cn an )
= (b1 , . . . , bn )(a1 , . . . , an ) + (c1 , . . . , cn )(a1 , . . . , an )

Thus, distributive law holds.

For any (a1 , . . . , an ) ∈ R, and 0Ri ∈ Ri then we have

(a1 , . . . , an ) + (0R1 , . . . , 0Rn ) = (a1 + 0R1 , . . . , an + 0Rn ) = (a1 , . . . , an )

and
(0R1 , . . . , 0Rn ) + (a1 , . . . , an ) = (0R1 + a1 , . . . , 0Rn + an ) = (a1 , . . . , an ).

So, (0R1 , . . . , 0Rn ) is the identity element of R under addition.

For any (a1 , . . . , an ) ∈ R, and 1Ri ∈ Ri we have

(a1 , . . . , an )(1R1 , . . . , 1Rn ) = (a1 1R1 , . . . , an 1Rn ) = (a1 , . . . , an ) = (1R1 a1 , . . . , 1Rn an ).

Therefore, (1R1 , . . . , 1Rn ) is the identity element of R under multiplica-

tion.
For any (a1 , . . . , an ) ∈ R, we have −ai ∈ Ri for all i and

(a1 , . . . , an ) + (−a1 , . . . , −an ) = (a1 + (−a1 ), . . . , an + (−an )) = (0R1 , . . . , 0Rn )

and
(−a1 , . . . , −an ) + (a1 , . . . , an ) = (−a1 + a1 , . . . , −an + an ) = (0R1 , . . . , 0Rn ).

So, (−a1 , . . . , −an ) is an inverse element of R under addition.

For any (a1 , . . . , an ) ∈ R, and a−1
i ∈ Ri , we have

4
 (a−1 −1 −1 −1
1 , . . . , an )(a1 , . . . , an ) = ((a1 ) a1 , . . . , (an ) an ) = (1R1 , . . . , 1Rn )

and

(a1 , . . . , an )(a−1 −1 −1 −1
1 , . . . , an ) = (a1 (a1 ) , . . . , an (an ) ) = (1R1 , . . . , 1Rn ).

Thus, (a−1
1 , . . . , an ) is an inverse element of R under multiplication.
−1

Hence, R = R1 ⊕ R2 ⊕ · · · ⊕ Rn is a ring under componentwise addition

and multiplication.

This ring is denoted by R1 ⊕ · · · ⊕ Rn and is called the direct sum of the

rings R1 , . . . , Rn . Remark
ˆ If R1 , . . . , Rn are nontrivial rings, then zero divisors are easily found in
the direc sum R1 ⊕ · · · ⊕ Rn . For example,

(a1 , 0R2 , . . . , 0Rn )(0R1 , a2 , . . . , 0Rn ) = (0R1 , . . . , 0Rn ).

ˆ An element (a1 , . . . , an ) ∈ R1 ⊕ · · · ⊕ Rn is a unit if and only is each

component is a unit. In fact, (a1 , . . . , an )(x1 , . . . , xn ) = (1R1 , . . . , 1Rn )
and (x1 , . . . , xn )(a1 , . . . , an ) = (1R1 , . . . , 1Rn ) if and only if xi = a−1
i for
1 ≤ i ≤ n.