Thawe Thawe Aye
PhDPrelim-Math-24
2024-2025 Academic Year
October 5, 2024
1. [Beachy, J. A., "Abstract Algebra", 4th Edt., pg. 247, No.17 ] De ne new opera-
tions on Q by letting a ⊕ b = a + b and a ⊙ b = 2ab, for all a, b ∈ Q. Show that
Q is a commutative ring under these operations.
For all a, b ∈ Q, we have a ⊕ b = a + b. Since a + b ∈ Q, a ⊕ b ∈ Q. For all
a, b ∈ Q, a ⊙ b = 2ab. Since ab ∈ Q, 2ab ∈ Q. Hence closure law holds under
these operations.
For all a, b ∈ Q,
a⊕b=a+b=b+a=b⊕a
and
a ⊙ b = 2ab = 2ba = b ⊙ a.
Commutative law holds under addition and multiplication.
For all a, b, c ∈ Q,
(a ⊕ b) ⊕ c = (a + b) ⊕ c
= (a + b) + c
= a ⊕ (b + c)
= a ⊕ (b ⊕ c)
and
(a ⊙ b) ⊙ c = 2ab ⊙ c
= 2(2ab)c
= 2a(2bc)
= a ⊙ (2bc)
= a ⊙ (b ⊙ c).
Thus, associative law holds under addition and multiplication.
1
For all a, b, c ∈ Q,
a ⊙ (b ⊕ c) = a ⊙ (b ⊕ c)
= 2a(b + c)
= 2ab + 2ac
= 2ab ⊕ 2ac
= (a ⊙ b) ⊕ (a ⊙ c).
Similarly, (a ⊕ b) ⊙ c = (a ⊙ c) ⊕ (b ⊙ c). Hence, distributive property holds.
0 is an additive identity element in Q because
a ⊕ 0 = a + 0 = a = 0 + a = 0 ⊕ a.
For any a ∈ Q, there exists −a ∈ Q such that a ⊕ (−a) = a + (−a) = a − a =
0 = −a + a = (−a) ⊕ a. Thus, −a is additive inverse of a in Q.
1
is a multiplicative identity element in Q because
2
1 1 1 1
a⊙ = 2a( ) = a = 2 a = ⊙ a.
2 2 2 2
Therefore, Q is a commutative ring under these operations.
2. [, No.18] De ne new operation on Z by letting m ⊕ n = m + n − 1 and
m ⊙ n = m + n − mn, for all m, n ∈ Z. Is Z a commutative ring under these
operations.
For all m, n ∈ Z, m ⊕ n = m + n − 1 ∈ Z because m + n − 1 ∈ Z. m ⊙ n =
m + n − mn ∈ Z because m + n − mn ∈ Z. Hence, Z is closed under these
operations.
To show these operations are commutative: For all m, n ∈ Z,
m⊕n=m+n−1=n+m−1=n⊕m
because m + n = n + m and
m ⊙ n = m + n − mn = n + m − nm = n ⊙ m
because mn = nm, m + n = n + m.
2
For all m, n, p ∈ Z,
(m ⊕ n) ⊕ p = (m + n − 1) ⊕ p
= (m + n − 1) + p − 1
= m + (n − 1 + p) − 1
= m + (n + p − 1) − 1
= m ⊕ (n + p − 1)
= m ⊕ (n ⊕ p)
and
(m ⊙ n) ⊙ p = (m ⊙ n) + p − (m ⊙ n)p
= m + n − mn + p − (m + n − mn)p
= m + n − mn + p − mp − np + (mn)p
= m + n + p − mn − mp − np + m(np)
= m + n + p − np − m(n + p − np)
= m + (n + p − np) − m(n + p − np)
= m + (n ⊙ p) − m(n ⊙ p)
= m ⊙ (n ⊙ p).
Hence, associative law holds under addition and multiplication.
To show distributive property holds: For any m, n, p ∈ Z,
m ⊙ (n ⊕ p) = m ⊙ (n + p − 1)
= m + (n + p − 1) − m(n + p − 1)
= m + n + p − 1 − mn − mp + m
and
(m ⊙ n) ⊕ (m ⊙ p) = (m + n − mn) ⊕ (m + p − mp)
= m + n − mn + m + p − mp − 1.
Thus, m ⊙ (n ⊕ p) = (m ⊙ n) ⊕ (m ⊙ p). Similarly, we can show that
(m ⊕ n) ⊙ p = (m ⊙ n) ⊕ (m ⊕ p).
3
1 is an additive identity element in Z because for any m ∈ Z,
m ⊕ 1 = m + 1 − 1 = m + 0 = m = 0 + m = 1 + (−1) + m = 1 + m + (−1) = 1 ⊕ m.
0 is a multiplicative identity element in Z because for any m ∈ Z,
m ⊙ 0 = m + 0 − m(0) = m + 0 − 0 = m
and
0 ⊙ m = 0 + m − 0(m) = 0 + m − 0 = m.
For any m ∈ Z, there exists 2 − m ∈ Z such that
m ⊕ (2 − m) = m + 2 − m − 1 = 1 = 2 − m + m − 1 = (2 + m) ⊕ m.
Thus, 2 − m is an additive inverse of m in Z. Therefore, Z is a commutative ring
under these operations.
3. [, No.19] Let R and S be commutative rings. Prove that the set of all
ordered pairs (r, s) such that r ∈ R and s ∈ S can be given a ring structure by
de ning
(r1 , s1 ) + (r2 , s2 ) = (r1 + r2 , s1 + s2 ) and (r1 , s1 ) · (r2 , s2 ) = (r1 r2 , s1 s2 ).
This is called the direct sum of R and S , denoted by R ⊕ S .
Let R and S be commutative rings. Let R ⊕ S = {(r, s)| r ∈ R, s ∈ S}. De ne
+ : R ⊕ S × R ⊕ S → R ⊕ S by
+ ((r1 , s1 ), (r2 , s2 )) = (r1 , s1 ) + (r2 , s2 )
and
· ((r1 , s1 ), (r2 , s2 )) = (r1 , s1 ) · (r2 , s2 ) = (r1 r2 , s1 s2 )
for all r1 , r2 ∈ R, s1 , s2 ∈ S .
Closure law holds under addition and multiplication by de nitions.
Commutative law holds under addition and multiplication because for all (r1 , s1 ),
(r2 , s2 ) ∈ R ⊕ S ,
(r1 , s1 ) + (r2 , s2 ) = (r1 + r2 , s1 + s2 ) = (r2 + r1 , s2 + s1 ) = (r2 , s2 ) + (r1 , s1 )
4
and
(r1 , s1 ) · (r2 , s2 ) = (r1 r2 , s1 s2 ) = (r2 r1 , s2 s1 ) = (r2 , r1 ) · (s2 , s1 ).
Associative law holds under addition and multiplication because for all (r1 , s1 ),
(r2 , s2 ), and (r3 , s3 ) ∈ R ⊕ S ,
[(r1 , s1 ) + (r2 , s2 )] + (r3 , s3 ) = (r1 + r2 , s1 + s2 ) + (r3 , s3 )
= ((r1 + r2 ) + r3 , (s1 + s2 ) + s3 )
= (r1 + (r2 + r3 ), s1 + (s2 + s3 ))
= (r1 , s1 ) + (r2 + r3 , s2 + s3 )
= (r1 , s1 ) + [(r2 , s2 ) + (r3 , s3 )]
and
[(r1 , s1 ) · (r2 , s2 )] · (r3 , s3 ) = (r1 r2 , s1 s2 ) · (r3 , s3 )
= ((r1 r2 )r3 , (s1 s2 )s3 )
= (r1 (r2 r3 ), s1 (s2 s3 ))
= (r1 , s1 ) · (r2 r3 , s2 s3 )
= (r1 , s1 ) · [(r2 , s2 ) · (r3 , s3 )].
Distributive laws hold because for all (r1 , s1 ), (r2 , s2 ), and (r3 , s3 ) ∈ R ⊕ S ,
(r1 , s1 ) · ((r2 , s2 ) + (r3 , s3 )) = (r1 , s1 ) · (r2 + r3 , s2 + s3 )
= (r1 (r2 + r3 ), s1 (s2 + s3 ))
= (r1 r2 + r1 r3 , s1 s2 + s1 s3 )
= (r1 r2 , s1 s2 ) + (r1 r3 , s1 s3 )
= (r1 , s1 ) · (r2 , s2 ) + (r1 , s1 ) · (r3 , s3 )
and
((r1 , s1 ) + (r2 , s2 )) · (r3 , s3 ) = (r1 + r2 , s1 + s1 ) · (r3 , s3 )
= ((r1 + r2 )r3 , (s1 + s2 )s3 )
= (r1 r3 + r2 r3 , s1 s3 + s2 s3 )
= (r1 r3 , s1 s3 ) + (r1 r3 , s1 s3 )
= (r1 , s1 )(r3 , s3 ) + (r2 , s2 )(r3 , s3 ).
5
The element (0R , 0S ) is additive identity element in R ⊕ S because for any
(r, s) ∈ R ⊕ S such that
(r, s) + (0R , 0S ) = (r + 0R , s + 0S ) = (r, s) = (0R + r, 0S + s) = (0R , 0S ) + (r, s).
The element (1R , 1S ) is multiplicative identity element in R ⊕ S because for
any (r, s) ∈ R ⊕ S such that
(r, s) · (1R , 1S ) = (r1R , s1S ) = (r, s) = (1R r, 1S s) = (1R , 1S ) · (r, s).
For any (r, s) ∈ R ⊕ S , there exists(−r, −s) ∈ R ⊕ S such that
(r, s) + (−r, −s) = (r + (−r), s + (−s)) = (0R , 0S ) = (−r + r, −s + s) = (−r, −s) + (r, s).
Thus,(−r, −s) is an additive inverse of (r, s) in R ⊕ S .