MAT 603; Abstract Algebra: Homework set 1

Taffohouo Nwaffeu Yves Valdez

Problem 1 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20

Recquired to prove that a Ring without unity can be embedded in a ring without unity

black!10 Subproblem 1

Let (R, +, ·, 0) be a system satisfying all the requirements for a ring except the existence of a
multiplicative identity. Prove that there is a ring (R0 , +, ·, 0, 1) in which (R, +, ·, 0) is an ideal.
[Hint: On R0 = R × Z define addition and multiplication by (r, n) + (s, m) = (r + s, n + m) and
(r, n) · (s, m) = (rs + mr + ns, nm).]
To prove that there is a ring (R0 , +, ·, 0, 1) in which (R, +, ·, 0) is an ideal, we can use the Cartesian
product construction on the set R0 = R × Z, where Z represents the set of integers. We will define
addition and multiplication on R0 = R × Z as follows:
1. Addition: ∀ (r, n) and (s, m) ∈ R0 = R × Z, we define their sum as (r, n) + (s, m) = (r + s, n + m),
where the addition on the right-hand side of the equation is the addition of integers.
2. Multiplication: ∀ (r, n) and (s, m) ∈ R0 = R × Z, we define their product as (r, n) · (s, m) =
(rs + mr + ns, nm), where the multiplication on the right-hand side of the equation is the multiplication
of integers.
Now, let’s demonstrate that this construction indeed forms a ring (R0 , +, ·, 0, 1):
1. Closure under addition: - ∀ (r, n) and (s, m) ∈ R0 = R × Z, we have (r, n) + (s, m) = (r + s, n + m).
Since R is a ring, the addition of r and s is also an element of R, and the addition of n and m is an
element of Z. Therefore, (r + s, n + m) ∈ R × Z. Hence, the closure under addition is satisfied.
2. Associativity of addition: The associativity of addition in R × Z follows directly from the asso-
ciativity of addition in R and Z.
3. Identity element for addition: The element (0, 0) serves as the identity element for addition in
R × Z since (r, n) + (0, 0) = (r + 0, n + 0) = (r, n) ∀(r, n) ∈ R × Z.
4. Inverse elements for addition: - ∀ element (r, n) ∈ R × Z, the inverse element with respect to
addition is (−r, −n), since (r, n) + (−r, −n) = (r − r, n − n) = (0, 0).
5. Closure under multiplication: - ∀ (r, n) and (s, m) ∈ R × Z, we have (r, n) · (s, m) = (rs + mr +
ns, nm). Since R is a ring, the product rs + mr + ns is also an element of R, and the productnmis
an element of Z. Therefore, (rs + mr + ns, nm) is an element of R × Z. Hence, the closure under
multiplication is satisfied.
6. Distributivity: The left and right distributive properties hold in R×Z, derived from the distributive
properties in R and Z.
Next, we will define the additional elements 0 and 1 in R × Z to form the complete ring (R0 , +, ·, 0, 1):
- The element 0 is defined as (0, 0) ∈ R × Z. It serves as the additive identity in the ring (R0 , +, ·, 0, 1).
- The element 1 is defined as (1, 0) in R×Z. It serves as a multiplicative identity in the ring (R0 , +, ·, 0, 1).
Finally, we need to show that (R, +, ·, 0) forms an ideal in the ring (R0 , +, ·, 0, 1). To prove this, we need
to verify two conditions:
1. Closure of (R, +, ·, 0) under addition: ∀ (r, n) and (s, m) ∈ R × Z, we have (r, n) + (s, m) =
(r + s, n + m). Since R forms an ideal, the element r + s ∈ R, and the element n + m ∈ Z. Therefore,
(r + s, n + m) ∈ R × Z, which implies closure under addition.
2. Absorption property: ∀ (r, n) ∈ R × Z and (s, m)inR, we have (r, n) · (s, m) = (rs + mr + ns, nm).
Since the product rs + mr + nsis in R, and the productnmis in Z, the element (rs + mr + ns, nm)
is in R × Z. This shows the absorption property, ensuring that the ideal (R, +, ·, 0) is closed under
multiplication by elements of R.
Therefore, we have proven that there exists a ring (R0 , +, ·, 0, 1) in which (R, +, ·, 0) is an ideal, using
the Cartesian product construction on R × Z.

black!10 Subproblem 2

1
Show that any homomorphism defined from R −→ R0 is an isomorphism.

To deduce that any ring without unity can be embedded in a ring with unity by defining an isomorphic
map from R’ to R, we can utilize the construction discussed in the previous response.
Let (R, +, ·, 0) be a ring without a multiplicative identity, and let (R0 , +, ·, 0, 1) be the ring constructed
by extending R using the set R0 = R × Z with the operations defined as:
Addition: (r, n) + (s, m) = (r + s, n + m) ∀(r, n), (s, m) ∈ R0 . Multiplication: (r, n) · (s, m) =
(rs + mr + ns, nm) ∀ (r, n), (s, m) ∈ R0 .
We can show that there exists an isomorphism between R0 and a subring of R with a multiplicative
identity.
We will define the map φ : R0 longrightarrowR as φ(r, n) = r + (n − 1)r, ∀ (r, n) ∈ R0 .

Just like in the previous proof, we need to show that φ is an isomorphism:

1. Well-Defined: Since φ(r, n) = r + (n − 1)r ∀ (r, n) ∈ R0 , the mapping is well-defined.

2. Homomorphism: Let (r, n), (s, m) ∈ R0 , then we have:

φ((r, n) + (s, m)) = φ(r + s, n + m)

= (r + s) + ((n + m − 1)(r + s))
= r + (n − 1)r + s + (m − 1)s
= (r + (n − 1)r) + (s + (m − 1)s)
= φ(r, n) + φ(s, m)
φ((r, n) · (s, m)) = φ(rs + mr + ns, nm)
= (rs + mr + ns) + ((nm − 1)(rs + mr + ns))
= rs + mr + ns + (nm − 1)(rs + mr + ns)
= rs + mr + ns + nmr + mrs + nrs − rs − mr − ns
= nmr + mrs + nrs
= r(n − 1)m + r(m − 1)s + r(n − 1)s
= r(n − 1)m + r(m − 1)s + r(n − 1)s
= (r + (n − 1)r)(m + (s − 1)m) + (r + (n − 1)r)(s + (n − 1)s)
= φ(r, n) · φ(s, m)

Therefore, φ preserves addition and multiplication, making it a homomorphism.

3. Injectivity: If φ(r, n) = φ(r0 , n0 ) for some (r, n), (r0 , n0 ) ∈ R0 , then r + (n − 1)r = r0 + (n0 − 1)r0 . By
comparing the components, we obtain r = r0 and n = n0 .

4. Surjectivity: f orall r ∈ R, we can choose (r, 1) ∈ R0 . Then φ(r, 1) = r, which shows that φ is
surjective.

5. Preservation of the Zero Element: φ(0, 0) = 0, which implies that the zero element in R0 is
mapped to the zero element in R.

From the above properties, we conclude that φ is a bijective homomorphism, which means it is an
isomorphism.

Since R0 is isomorphic to R via the map φ, we can consider R0 as a subring of R where R now has a
multiplicative identity.

Hence, any ring without a multiplicative identity can be embedded in a larger ring where the larger ring
has a multiplicative identity, achieved by defining an isomorphic map from R0 to R.

Problem 2 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20

2
    
Z R Z 0
Let R = denote a ring and S = denote a non-empty subring of R. We must
0 Z 0 Z
determine whether S is an ideal of R or not.

black!10 Subproblem 1
We must check whetherS is a left ideal of R or not  
a1 0 b1 0
Suppose A = , where a1 , a2 ∈ Z and B = with b1 , b2 ∈ Z we notice that;
0 a2 0 b2
 
a1 − b1 0
A−B = ∈S
0 a2 − b2
 
c1 r
Let C = , where r ∈ R and c1 , c2 ∈ Z, thus
 0 c2    
c1 r a1 0 c1 a1 ra1
CA = = , where ra2 ∈ R and c1 a1 , c2 a2 ∈ Z
0 c2  0 a 2 0 c2 a2
Z R
Therefore CA ∈ =R
0 Z
Hence S cannot be a left-ideal of R

black!10 Subproblem 2
We must check whether S is a right ideal of R or not
   
a1 0 b1 0
Suppose A = , where a1 , a2 ∈ Z and B = with a1 , a2 ∈ Z we notice that;
0 a2 0 b2
A − B is ofcourse 
verified insubproblem1
 above
a1 0 c1 r a1 c1 a1 r
AC = = , where ra2 ∈ R and a1 c1 , a2 c2 ∈ Z
0 a2  0 c 2 0 a2 c2
Z R
Therefore AC ∈ =R
0 Z
Hence S cannot be a right-ideal of R

Problem 3 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20 black!20

Show that the set of endomorphisms End(G):=f |f : G −→ G, where f (x) = f (x) · f (y) where G is
additive abelian forms a ring

black!10 Subproblem 1
To show that the set of endomorphisms End(G) forms a ring, we need to verify that it satisfies the
properties of a ring: addition, multiplication, associativity, distributivity, and the presence of an additive
identity and additive inverses.
Let G be an additive abelian group. We want to show that the set of endomorphisms of G, denoted
End(G), forms a ring. For an endomorphism f : G → G, we define f (x+y) = f (x)+f (y) for all x, y ∈ G.

To prove that End(G) forms a ring, we need to establish the following properties:

1. Closure under Addition: For f, g ∈ End(G), we define (f + g)(x) = f (x) + g(x) for all x ∈ G.
Then (f + g) is also an endomorphism since (f + g)(x + y) = (f + g)(x) + (f + g)(y) for all x, y ∈ G.
That is;
item (f + g)(x + y) = (f )(x + y) + (g)(x + y) addition of functions
= f (x) + f (y) + g(x) + g(y) homomorphism of both
= f (x) + g(x) + f (y) + g(y) End(G) is abelian
= (f + g)(x) + (f + g)(y) addition of functions

2. Closure under Multiplication: For f, g ∈ End(G), we define (f ◦ g)(x) = f (g(x)) for all x ∈ G.

3
 Then (f ◦ g) is also an endomorphism since (f ◦ g)(x + y) = (f ◦ g)(x) + (f ◦ g)(y) for all x, y ∈ G.
item (f ◦ g)(x + y) = (f )(g(x + y)) composition of functions
= f (g(x) + g(y)) homomorphism of g
= f (g(x)) + f (g(y)) homomorphism of f
= (f ◦ g)(x) + (f ◦ g)(y)
3. Associativity: Addition and multiplication in End(G) are associative since they inherit this
property from the underlying group G.
4. Distributivity: For f, g, h ∈ End(G), we have (f + g) ◦ h = f ◦ h + g ◦ h, thus fulfilling the
distributive property.

5. Additive Identity: The zero endomorphism, denoted as 0, serves as the additive identity since
(f + 0)(x) = f (x) for all f ∈ End(G) and x ∈ G.
6. Additive Inverses: For any endomorphism f ∈ End(G), its additive inverse −f is defined as
−f (x) = −f (x) for all x ∈ G, thus satisfying the property of additive inverses.

With all these properties established, we conclude that the set of endomorphisms of an additive abelian
group G, denoted End(G), forms a ring.

Based on the above arguments, we can conclude that the set of endomorphisms End(G) of an additive
abelian group G forms a ring, as it satisfies the properties of a ring: addition, multiplication, associativity,
distributivity, presence of an additive identity, and additive inverses.