?

MATH 4442 & MATH 6442: MODERN ALGEBRA II

HOMEWORK SETS AND EXAMS
Yongwei Yao
2016 SPRING SEMESTER
GEORGIA STATE UNIVERSITY

Contents
HW Set #01, Solutions
HW Set #02, Solutions
HW Set #03, Solutions
HW Set #04, Solutions
Midterm I, Review
Midterm I, Solutions
HW Set #05, Solutions
HW Set #06, Solutions
HW Set #07, Solutions
HW Set #08, Solutions
Midterm II, Review
Midterm II, Solutions
HW Set #09, Solutions
HW Set #10, Solutions
Extra Credit Set, Solutionsnot really

1
3
5
7
9
10
11
13
15
17
19
20
21
23
25

Note. There are four (4) problems in each homework set. Math 6442 students need to do
all 4 problems while Math 4442 students need to do any three (3) problems out the four.
If a Math 4442 student submits all 4 problems, then one of the lowest score(s) is dropped.
There is a bonus point for a Math 4442 student doing all 4 problems correctly.
Problems for extra credits are available; see the last page of this file.
There are three (3) PDF files for the homework sets and exams, one with the problems
only, one with hints, and one with solutions. Links are available below.

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

Math 4442/6442 (Spring 2016)

Homework Set #01 (Due 01/19)

Solutions

Problem 1.1. Let R be a ring and a, b R.

(1) Expand (a + b)3 .
(2) Further assume that R is commutative. Expand (a + b)3 .
Solution. (1) We expand (a + b)3 as follows
(a + b)3 = (a + b)(a + b)(a + b) = (a + b)((a + b)(a + b))
= (a + b)(a(a + b) + b(a + b)) = (a + b)(aa + ab + ba + bb)
= a(aa + ab + ba + bb) + b(aa + ab + ba + bb)
= aaa + aab + aba + abb + baa + bab + bba + bbb
= a3 + a2 b + aba + ab2 + ba2 + bab + b2 a + b3 .
(2) If R is commutative, then
(a + b)3 = a3 + a2 b + aba + ab2 + ba2 + bab + b2 a + b3
= a3 + a2 b + ba2 + aba + ab2 + b2 a + b3
= a3 + a2 b + a2 b + a2 b + ab2 + ab2 + ab2 + b3 = a3 + 3a2 b + 3ab2 + b3 .
This completes the problem.

Problem 1.2. Let R = {a + b 3 2 + c 3 4 | a, b, c Z}. Consider (R, +, ), with the usual

addition and multiplication.
(1) Determine whether (R, +) is an abelian group. No need to justify.
(2) Determine whether R is closed under multiplication. Justify your claim.
(3) Determine whether (R, +, ) is a ring. No need to justify.
(4) If (R, +, ) is a ring, determine whether it is a commutative ring.
(5) If (R, +, ) is a ring, determine whether it has unity.
Solution. (1) Yes, (R, +) is an abelian group. (This is easy to verify.)

(2) We claim
that R
is closed under multiplication. Let x, y R, so that x = a+b 3 2+c 3 4
and y = a0 + b0 3 2 + c0 3 4 with a, b, c, a0 , b0 , c0 Z. Then we have

3
3
3
3
xy = (a + b 2 + c 4)(a0 + b0 2 + c0 4)

3
3
3
3
3
3
3
3
= aa0 + ab0 2 + ac0 4 + ba0 2 + bb0 4 + bc0 8 + ca0 4 + cb0 8 + cc0 16

3
3
3
3
3
3
= aa0 + ab0 2 + ac0 4 + ba0 2 + bb0 4 + 2bc0 + ca0 4 + 2cb0 + 2cc0 2

3
3
3
3
3
3
= aa0 + 2bc0 + 2cb0 + ab0 2 + ba0 2 + 2cc0 2 + ac0 4 + bb0 4 + ca0 4

3
3
= (aa0 + 2bc0 + 2cb0 ) + (ab0 + ba0 + 2cc0 ) 2 + (ac0 + bb0 + ca0 ) 4 R
since aa0 + 2bc0 + 2cb0 Z, ab0 + ba0 + 2cc0 Z, and ac0 + bb0 + ca0 Z. This shows that R is
closed under multiplication.
(3) Yes, (R, +, ) is a ring. By (2), R is closed under multiplication. Also, note that
associativity and distribution hold for both addition and multiplication in C, they clearly
hold in R. Finally, (R, +) is an abelian group, as noted in (1). Therefore, (R, +, ) is a ring
under the usual addition and multiplication.
(4) Yes, R is a commutative ring. Indeed,
xy =yx for all x, y C, hence for all x, y R.

3
(5) Yes, R has unity. Indeed, 1 = 1 + 0 2 + 0 3 4 R and 1x = x = x1 for all x R.
1

Problem 1.3. Let S = {a + b 3 12 + c 3 18 | a, b, c Z}. Consider (S, +, ), with the usual

addition and multiplication.
(1) Determine whether (S, +) is an abelian group. No need to justify.
(2) Determine whether S is closed under multiplication. Justify your claim.
(3) Determine whether (S, +, ) is a ring. No need to justify.
(4) If (S, +, ) is a ring, determine whether it is a commutative ring.
(5) If (S, +, ) is a ring, determine whether it has unity.
Solution. (1) Yes, (S, +) is an abelian group. (This is easy to verify.)

3
(2)
We
claim
that
S
is
closed
under
multiplication.
Let
x,
y

S,
so
that
x
=
a
+
b
12 +

3
0
0 3
0 3
0
0
0
c 18 and y = a + b 12 + c 18 with a, b, c, a , b , c Z. Then we have

3
3
3
3
xy = (a + b 12 + c 18)(a0 + b0 12 + c0 18)

3
3
3
3
3
3
3
3
= aa0 + ab0 12 + ac0 18 + ba0 12 + bb0 144 + bc0 216 + ca0 18 + cb0 216 + cc0 324

3
3
3
3
3
3
= aa0 + ab0 12 + ac0 18 + ba0 12 + 2bb0 18 + 6bc0 + ca0 18 + 6cb0 + 3cc0 12

3
3
3
3
3
3
= aa0 + 6bc0 + 6cb0 + ab0 12 + ba0 12 + 3cc0 12 + ac0 18 + 2bb0 18 + ca0 18

3
3
= (aa0 + 6bc0 + 6cb0 ) + (ab0 + ba0 + 3cc0 ) 12 + (ac0 + 2bb0 + ca0 ) 18 S
since aa0 + 6bc0 + 6cb0 Z, ab0 + ba0 + 3cc0 Z, and ac0 + 2bb0 + ca0 Z. This shows that S
is closed under multiplication.
(3) Yes, (S, +, ) is a ring. By (2), S is closed under multiplication. Also, note that
associativity and distribution hold for both addition and multiplication in C, they clearly
hold in S. Finally, (S, +) is an abelian group, as noted in (1). Therefore, (S, +, ) is a ring
under the usual addition and multiplication.
(4) Yes, S is a commutative ring. Indeed,
xy =
yx for all x, y C, hence for all x, y S.

3
3
(5) Yes, S has unity. Indeed, 1 = 1 + 0 12 + 0 18 S and 1x = x = x1 for all x S.


Problem 1.4. Consider R = { 00 | , R}, which is a ring under the usual matrix
addition and matrix multiplication.
(1) Find concrete a, b R such that a 6= 0R , b 6= 0R and ab = 0R .
(2) Find concrete r, s, t R such that rt = st, t 6= 0R and r 6= s.
Solution. (1) Consider the following elements in R:


a = 10 00
and b =

0 0
1 0

.

It is clear that a 6= 0R , b 6= 0R and ab = 0R .

(2) Consider the following elements in R:




0
0 0
r = 13
s = 28
and t =
0 0 ,
0

0 0
36 0

.

It is clear that rt = st, t 6= 0R and r 6= s.

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

Math 4442/6442 (Spring 2016)

Homework Set #02 (Due 01/26)
Solutions

Problem 2.1. Let = 21 (1 + 5) C and R = {a + b | a, b Z} C.

(1) Determine whether R is a subring of C (under the usual addition and multiplication).
(2) If R is a ring, is R an integral domain? with unity? Justify your answers.
Solution. (1) Since is a root of 2x2 2x + 3 (i.e., 22 2 + 3 = 0), we see
2 = 3/2.
Or, computing directly, we see
2 = ( 21 (1 +

5))2 = = 1 + 21 5 = 32 + .

(We are going to show 2

/ R rigorously.) Suppose 2 R. Then 2 = a + b, meaning
32 + = a + b
for some a, b Z. This implies
(1 b) = a + 23 .
Note that a +

3
2

6= 0, since a Z. Thus 1 b 6= 0. Therefore we obtain

=

a + 23
Q,
1b

which is a contradiction. This proves 2

/ R.
Since R but 2
/ R, we see that R is not closed under multiplication. Hence R is not
a subring of C. (So R is not a ring under usual addition and multiplication.)
(2) As R is not a ring, it is not an integral domain (and the question involving unity does
not apply).
 a b


Problem 2.2. Let M2 (R) =
under
c d | a, b, c, d R , which is aring
with unity
a 0
the usual
addition and matrix multiplication. Let R =
and
0 d | a, d R
 a 0
matrix
S = 0 0 | a R . Answer the following questions (with no justifications needed):
(1) Is R a subring of M2 (R)? Is R commutative? with unity?
(2) Find the unity of R (if it exists) explicitly. Does it agree with the unity of M2 (R)?
(3) Is S a subring of M2 (R)? Is S commutative? with unity?
(4) Find the unity of S (if it exists) explicitly. Does it agree with the unity of M2 (R)?
Solution. Skipping the details/justifications, we answer the questions as follows:

(1) Yes, R is a subring of M2 (R)
and R is commutative with unity 1R = 10 01 .
(2) The unity of R is 1R = 10 01 , which agrees with the unity of M2 (R).

(3) Yes, S is a subring of M2 (R),
commutative, and with unity 1S = 10 00 .


(4) The unity of S is 1S = 10 00 , which does not agree with the unity of M2 (R).
Problem 2.3. Let R be a ring with unity which is denoted by 1R , and S be a subring of R
with unity 1S = 1R . (Recall that U(R) denotes the set of all units of R.)
(1) Prove that U(R) is closed under multiplication (i.e., under the multiplication of R).
(2) Prove U(S) U(R).
(3) Is U(R) a group under multiplication? There is no need to justify.
(4) Prove or disprove: U(S) = U(R) S.
3

Proof/Solution. (1) Let u, v U(R). Then there exist u1 , v 1 R such that

uu1 = 1R = u1 u and vv 1 = 1R = v 1 v.
Consider v 1 u1 R. By associativity and the meaning of 1R , we see
(uv)(v 1 u1 ) = u(vv 1 )u1 = u1R u1 = uu1 = 1R
(v 1 u1 )(uv) = v 1 (u1 u)v = v 1 1R v = v 1 v = 1R ,
which verifies uv U(R) with (uv)1 = v 1 u1 . Thus U(R) is closed under multiplication.
(2) Let u U(S). Then there exists x S such that ux = 1S = xu. Now, since u, x R
and 1S = 1R , we see u U(R). This shows U(S) U(R). (Thus U(S) U(R) S.)

(3) Yes, U(R) a group under multiplication. (This should be easy to prove.)
(4) We disprove it with a counterexample. Let S = Z and R = Q. Then S is a subring
of R with 1S = 1 = 1R . However,
U(Z) = {1, 1} and

U(Q) = Q \ {0}.

In particular, we see U(Z) 6= U(Q) Z. (For example, 13 U(Q) Z but 13

/ U(Z).)
Problem 2.4 (Math 6442). Let R be a ring such that x2 = x for all x R. (Such ring is
called a Boolean ring.) We prove that R is commutative via the following steps.
(1) Prove that a = a for all a R.
(2) Prove that ab + ba = 0 for all a, b R.
(3) Prove that ab = ba for all a, b R.
Proof. (1) Let a R. By considering (a + a)2 , we see
a + a = (a + a)2 = a2 + a2 + a2 + a2 = a + a + a + a.
In short, a + a = a + a + a + a. By cancellation, we get 0R = a + a, hence a = a.
Alternatively, we can verify a = a as follows:
a = a2 = (a)2 = a,
which relies on the property (x)(y) = xy for all x, y R.
(2) Let a, b R. By considering (a + b)2 , we see
a + b = (a + b)2 = a2 + ab + ba + b2 = a + ab + ba + a.
In short, we have a + b = a + ab + ba + a. By cancellation, we get 0R = ab + ba.
(3) Let a, b R. From (1), we see
ab = ab.
From (2), we get 0R = ab + ba, which implies
ba = ab.
Combining the above, we see
ab = ab = ba.
In short, ab = ba for all a, b R. Thus R is commutative.

PROBLEMS

HINTS


SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

Math 4442/6442 (Spring 2016)

Homework Set #03 (Due 02/02)

Solutions

Problem 3.1. In R = Z100 = {0, 1, . . . , 98, 99}, consider x = 17 and y = 15.

(1) Find the inverse element of x in Z100 explicitly, if x U(R).
(2) Find a non-zero element z Z100 such that yz = 0R and zy = 0R .
Solution. As gcd(17, 100) = 1 and gcd(15, 100) = 5, we see 17 is a unit in Z100 and 15 is a
zero-divisor in Z100 .
(1) To find the inverse of 17 in Z100 , it suffices to find m, n Z such that 17m + 100n = 1.
We accomplish this via repeated division algorithm (a.k.a. Euclidean algorithm):
100 = 17 5 + 15,
17 = 15 1 + 2,
15 = 2 7 + 1,
2 = 1 2 + 0.
Then, reading the above equations backward, we get
gcd(17, 100) = 1 = 15 2 7
= 15 (17 15 1)7
= 17 7 + 15 8
= 17 7 + (100 17 5)8
= 17 47 + 100 8 = 17(47) + 100(8).
Thus 17(47) = 1 800, which implies 17(47) 1 mod 100. Hence
17 47 = 47 17 = 1.

1
In other words, 17
= 47 = 53 Z100 .
(2) Let z = 60 Z100 for example. It is easy to see yz = 0 = yz.
Problem 3.2. Let R = Z8 [x] be the polynomial ring over Z8 = {0, . . . , 7} on the variable x.
Consider f = f (x) = 1 + 2x + 3x2 and g = g(x) = 4 + 5x in Z8 [x].
(1) Compute f + g and f g.
(2) Determine deg(f ), deg(g), deg(f + g) and deg(f g).
(3) Find concrete f1 , f2 R with deg(f1 ) = 2 = deg(f2 ) such that deg(f1 + f2 ) = 1.
(4) Find concrete g1 , g2 R with deg(g1 ) = 1 = deg(g2 ) such that deg(g1 g2 ) = 1.
Solution. (1) By routine computation (details omitted), we see
f + g = 5 + 7x + 3x2
f g = 4 + 5x + 6x2 + 7x3 .
(2) We see deg(f ) = 2, deg(g) = 1, deg(f + g) = 2 and deg(f g) = 3.
(3) Let f1 = 1x + 3x2 and f2 = 5x2 , both of degree 2. It is clear that
deg(f1 + f2 ) = deg(1x) = 1.
(4) Let g1 = 1 + 2x and g2 = 4x, both of degree 1. It is clear that
deg(g1 g2 ) = deg(4x) = 1.
Now the solution is complete.
5

Problem 3.3. Let S = Z[ 2] = {a+b 2 | a, b Z} and R = Q[ 2] = {+ 2 | , Q}.

(It is clear that both S and R are commutative rings with 1S =
1 = 1R and S is asubring
of R, which you may assume without proof.) Consider x = 3 + 2 2 and y = 3 + 4 2.
(1) Determine whether x is an invertible element of S. If so, find its inverse in S.
(2) Determine whether y is an invertible element of R. If so, find its inverse in R.

Solution. (1) Consider 3 2 2 S, which is in S. By direct computation, we have

2
3 + 2 2 3 2 2 = 3 2 2 3 + 2 2 = 32 2 2 = 9 8 = 1.

This shows x = 3 + 22 U(S)and x1 = (3+ 2 2)1 = 3 2 2.

(2) We have (3 + 4 2)(3 4 2) = 32 (4 2)2 = 9 32 = 23. Consider

1
3
4
3 4 2 = 23
+ 23
2 R.
23
It is straightforward to see







(3+42)(342)
4
3
4
3
+ 23
2 3 + 4 2 = 3 + 4 2 23
+ 23
2 =
= 1.
23
23

3
4
This shows that y = 3 + 4 2 U(R) with y 1 = 23
+ 23
2 R.

Problem 3.4(Math 6442). Let R = Q[ 2] = { + 2 | , Q}, as in Problem 3.3 .

Let z = a + b 2 6= 0 with a, b Q.

(1) Prove (a + b 2)(a b 2) 6= 0.

(2) Prove a + b 2 U(R).
(3) Prove or disprove: R is a field.

Proof. (1) We have (a + b 2)(a b 2) = a2 (b 2)2 = a2 2b2 . To prove by contradiction,

suppose a2 2b2 = 0 so that a2 = 2b2 . Consider the two possible cases:

If b = 0, then a2 = 0 and hence a

=
0,
which
implies
a
+
b
2 = 0, a contradiction.

2
If b 6= 0, then 2 = ab2 and hence 2 { ab , ab } Q, a contradiction.

Therefore (a + b 2)(a b 2) = a2 2b2 6=0, as required.

(2) In part (1), we have concluded (a + b 2)(a b 2) = a2 2b2 Q \ {0}. Consider

1
a
b
w = a2 2b
2 = a2 2b
2 R.
2 a b
2 + a2 2b2
It is clear that

 a

b
wz = zw = a + b 2 a2 2b
+
2 = 1,
2
a2 2b2

which shows z = a + b 2 U(R).

(3) We prove that R is a field as follows: Clearly, R is a non-zero commutative ring with
unity. Then by part (2), every non-zero element of R is invertible. Thus R is a field.


PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

Math 4442/6442 (Spring 2016)

Homework Set #04 (Due 02/09)

Solutions

Problem 4.1. Consider 1 2x Z[x] Z[[x]] and 1 2x Z4 [x], where Z4 = {0, 1, 2, 3}.
(1) Is 1 2x invertible in Z[x]? Explain why or why not.
(2) True or false: 1 2x U(Z[[x]]) with (1 2x)1 = 1 + 2x + 4x2 + 8x3 + Z[[x]].
(3) Is 1 2x invertible in Z4 [x]? If so, find its inverse explicitly.
Solution. (1) We claim that 12x is not invertible in Z[x]. Indeed, for every 0 6= g(x) Z[x],
we have


deg (1 2x)g(x) = deg(1 2x) + deg(g(x)) > deg(1 2x) > deg(1).
Hence (1 2x)g(x) 6= 1 for all g(x) Z[x], which verifies 1 2x
/ U(Z[x]).
(2) True. It is straightforward to verify (details skipped)
!
!

X
X
(1 2x)
2i xi = 1 =
2i xi (1 2x).
i=0

i=0

(3) Yes, 1 2x U(Z4 [x]). Indeed, it is straightforward to see

(1 2x)(1 2x) = 1.
Thus 1 2x U(Z4 [x]) with (1 2x)1 = 1 2x = 1 + 2x Z4 [x].
Problem 4.2. Let R be a ring, and a R a (fixed) element of R. Define S as follows:
S = {r R | ar = ra}.
Prove that S is a subring of R.
Proof. It is clear that S R. To show that S is not empty, note that
a0R = 0R = 0R a.
Thus 0R S by the definition/construction of S. (We also see a S, as aa = aa.)
Next, let x, y S, which simply means
ax = xa and ay = ya.
Then we see
a(x y) = ax ay
= xa ya = (x y)a,
and moreover
a(xy) = (ax)y = (xa)y
= x(ay) = x(ya) = (xy)a.
In short, for x, y S, we have
a(x y) = (x y)a and a(xy) = (xy)a,
which implies
x y S and xy S
by the definition/construction of S. By the subring criterion, we conclude that S is a subring
of R. The proof is now complete.

7

Problem 4.3. Let a(x) = 4x4 + 4x3 + 1x2 + 7x + 8 Z9 [x] and b(x) = x2 + 2x + 3 Z9 [x].
Find q(x), r(x) Z9 [x] satisfying
a(x) = b(x)q(x) + r(x)
such that r(x) = 0 or deg(r(x)) < deg(b(x)).
Solution. By the Division Algorithm (a.k.a. long division), we get (details skipped)
4x4 + 4x3 + 1x2 + 7x + 8 = (x2 + 2x + 3)(4x2 + 5x + 6) + (7x + 8).
In other words, we have a(x) = b(x)q(x) + r(x) with
q(x) = 4x2 + 5x + 6 and r(x) = 7x + 8.
Note that deg(r(x)) = 1 < 2 = deg(b(x)), as required.
Problem 4.4 (Math 6442). Let R be a commutative ring with unity. Further assume that
R is finite (i.e., R consists of finitely many elements or, equivalently, |R| < ).
(1) Prove that, for each a R, either a is a zero-divisor or a is a unit.
(2) Further assume that R is a non-zero integral domain. Prove that R is a field.
Proof. (1) Say |R| = n for some positive integer n and write R = {x1 , x2 , . . . , xn }. It suffices
to prove that every non-zero-divisor in R is invertible. So let a R be such that a is not a
zero-divisor. (We must show that a is invertible, i.e., a U(R).)
Consider {ax1 , ax2 , . . . , axn }, which is clearly a subset of R. For all distinct elements
xi 6= xj of R, it should be clear that axi 6= axj . (Indeed, the equation axi = axj would imply
a(xi xj ) = 0, which then would imply xi xj = 0 as a is not a zero-divisor.) Thus, we see
ax1 , ax2 , . . . , axn are mutually distinct elements. Consequently, ax1 , ax2 , . . . , axn exhaust
all elements of R (as |R| = n). So
{ax1 , ax2 , . . . , axn } = R.
In particular,
1R {ax1 , ax2 , . . . , axn }.
That is, there exists xi R with 1 6 i 6 n such that xi a = axi = 1R , i.e., a U(R).
(Here we sketch an alternative proof : Assume a is not a zero-divisor. Then, as R is
finite, there exist 0 6 i < j such that ai = aj . Thus ai (1R aji ) = 0R , which then implies
aji = 1R since a is not a zero-divisor. This implies a U(R) with a1 = aji1 .)
(2) As R is an integral domain, every non-zero element is a non-zero-divisor and hence
invertible by (1) above. This proves that R is a field, given that R is not the zero ring. 

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

Math 4442/6442 (Spring 2016)

Midterm Exam I (02/16)

Review Problems

Rings, subrings, fields: Problems 1.1, 1.2, 1.3, 1.4 2.1, 2.2, 3.4, 4.2, 4.4.
Zero-divisors, non-zero-divisors: Problems 1.4, 3.1, 4.4.
Commutative rings, unity: Problems 1.1, 1.2, 1.3, 2.1, 2.2, 2.4.
Invertible elements: Problems 2.3, 3.1, 3.3, 3.4, 4.1, 4.4.
Polynomial rings, power series rings: Problems 3.2, 4.1, 4.3.
Subring criterion: Problems 2.1, 2.2, 4.2.
Lecture notes and textbooks: All we have covered,

Note: The above list is not intended to be complete. The problems in

the actual test may vary in difficulty as well as in content. Going over,
understanding, and digesting the problems listed above will definitely help.
However, simply memorizing the solutions of the problems may not help you
as much.
You are strongly encouraged to practice more problems (than the ones
listed above) on your own.

Math 4442/6442 (Spring 2016)

Midterm Exam I (02/16)

Solutions

Solutions
have been withdrawn
from the site

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

10

Math 4442/6442 (Spring 2016)

Homework Set #05 (Due 02/23)

Solutions

Problem 5.1. Consider

 a b
the ring Z under
the usual addition and multiplication, as well as
the ring M2 (R) =
|
a,
b,
c,
d

R
under matrix addition and matrix multiplication.
c d
Determine whether each of the functions f, g and h is a ring homomorphism.


(1) Define f : Z M2 (R) by f (m) = m0 m0
for all m Z.
m
(2) Define g : Z M2 (R) by g(m) = m
m m for all m Z.
3
(3) Define h : Z Z by h(m) = m for all m Z.
Solution. (1) We claim that f is a ring homomorphism. Indeed, for all m, n Z,






0
m 0 + n 0 = f (m) + f (n),
f (m + n) = m+n
0 m+n =
0 m
0 n



n 0

0
m 0
f (mn) = mn
0 mn =
0 m
0 n = f (m)f (n).
(2) We claim that g is not a ring homomorphism. For example, g(1 2) 6= g(1)g(2) as
follows


g(1 2) = g(2) = 22 22 ,






g(1)g(2) = 11 11 22 22 = 44 44 .
(3) We claim that h is not a ring homomorphism. For example, h(1 + 2) 6= h(1) + h(2) as
follows
h(1 + 2) = h(3) = 33 = 27,
h(1) + h(2) = 13 + 23 = 1 + 8 = 9.
Problem 5.2. Consider the ring Z and the ring Z6 = {0, . . . , 4, 5}. Define f : Z Z6 by
f (m) = 4m Z6 for all m Z.
(1) Determine whether f is a ring homomorphism.
(2) Determine Ker(f ) explicitly, if f is a ring homomorphism.
(3) Determine Im(f ) explicitly, if f is a ring homomorphism.
Solution. (1) We claim that f is a ring homomorphism. Indeed, for all m, n Z,
f (m + n) = 4(m + n) = 4m + 4n = 4m + 4n = f (m) + f (n),
f (mn) = 4mn = 4mn + 12mn = 16mn = (4m)(4n) = 4m 4n = f (m)f (n).
(2) It is routine to see/verify Ker(f ) = {3k | k Z}. Indeed, for all m Z,
m Ker(f ) f (m) = 0 Z6
4m = 0 Z6
6 | 4m 3 | 2m 3 | m.
In other word, Ker(f ) consists of (precisely all) multiples of 3.
(3) Finally, it is routine to verify Im(f ) = {0, 2, 4}. Indeed, we have
f (3k) = 12k = 0 Z6
f (3k + 1) = 12k + 4 = 4 Z6
f (3k + 2) = 12k + 8 = 2 Z6 ,
for all k Z.
11

Problem 5.3. Let A and R be rings and f : A R a ring homomorphism.

(1) Give a concrete example of A, R and a ring homomorphism f : A R such that A
is commutative and R is not commutative.
(2) Prove that if A is commutative and f is surjective (i.e., onto) then R is commutative.


Solution/Proof. (1) One such example is f : Z M2 (R) defined by f (m) = m0 m0 for all
m Z, as in Problem 5.1 (1).
(2) Assume that A is commutative and f is surjective (i.e., onto). Let r, s R be arbitrary
elements (of R). As f is onto, there exist a, b A such that f (a) = r and f (b) = s. Since
A is commutative, we have ab = ba. Hence
rs = f (a)f (b) = f (ab) = f (ba) = f (b)f (a) = sr.
In short, rs = sr for all r, s R, showing that R is commutative.

Problem 5.4 (Math 6442). Let A and R be rings and f : A R a ring homomorphism.
(1) Give a concrete example of A, R and a ring homomorphism g : A R such that A
has unity and R does not have unity.
(2) Prove that if A has unity 1A and f is surjective (i.e., onto) then R has unity.
Solution/Proof. (1) Let A be any ring with unity (e.g., A = Z or A = {0}) and R be any
ring without unity (e.g., R = 2Z = {2k | k Z}). Define/construct f : A R by
f (a) = 0 for all a A.
Since f is clearly a ring homomorphism, we have an example as desired.
(2) Assume that A has unity 1A and f is surjective (i.e., onto). Note that f (1A ) R.
We are going to show that f (1A ) is the unity of R. To this end, let r R be an arbitrary
element (of R). Since f is onto, there exists a A such that f (a) = r. Consequently,
f (1A )r = f (1A )f (a) = f (1A a) = f (a) = r,
rf (1A ) = f (a)f (1A ) = f (a1A ) = f (a) = r.
As f (1A )r = r = rf (1A ) for all r R, we conclude that f (1A ) is the unity of R. This
completes the proof that R has unity.


PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

12

Math 4442/6442 (Spring 2016)

Homework Set #06 (Due 03/01)

Solutions

Problem 6.1. Consider the ring Z3 = {[0], [1], [2]} and the ring Z6 = {0, . . . , 4, 5}. Define
g : Z3 Z6 by g([0]) = 0, g([1]) = 4 and g([2]) = 2.
(1) Determine whether g is a ring homomorphism.
(2) Determine Ker(g) explicitly, if g is a ring homomorphism.
(3) Determine Im(g) explicitly, if g is a ring homomorphism.
Solution. (1) We claim that g is a ring homomorphism. One can verify g(x+y) = g(x)+g(y)
for all x, y Z3 by exhaustion as follows (with details skipped)
g([0] + [0]) = g([0]) + g([0]), g([0] + [1]) = g([0]) + g([1]), g([0] + [2]) = g([0]) + g([2]),
g([1] + [0]) = g([1]) + g([0]), g([1] + [1]) = g([1]) + g([1]), g([1] + [2]) = g([1]) + g([2]),
g([2] + [0]) = g([2]) + g([0]), g([2] + [1]) = g([2]) + g([1]), g([2] + [2]) = g([2]) + g([2]).
Similarly, one can verify g(xy) = g(x)g(y) for all x, y Z3 by exhaustion as follows
g([0] [0]) = g([0])g([0]),

g([0] [1]) = g([0])g([1]),

g([0] [2]) = g([0])g([2]),

g([1] [0]) = g([1])g([0]),

g([1] [1]) = g([1])g([1]),

g([1] [2]) = g([1])g([2]),

g([2] [0]) = g([2])g([0]),

g([2] [1]) = g([2])g([1]),

g([2] [2]) = g([2])g([2]).

(In fact, this ring homomorphism g is closed related to the ring homomorphism f as defined
in Problem 5.2 .)
(2) It is straightforward to see Ker(g) = {[0]}.
(3) It is straightforward to see Im(g) = {0, 2, 4}.
Problem 6.2. Let R be a ring and z R a (fixed) element. Define I = {x R | zx = 0R }.
Prove that I is a right ideal of R.
Proof. It is clear that I is a subset of R.
First of all, from z0R = 0R , we see 0R I and hence I 6= .
Next, let x, y I and r R; so that x, y R and zx = 0R = zy. Consequently
z(x y) = zx zy = 0R 0R = 0R ,
which implies x y I. Moreover,
z(xr) = (zx)r = 0R r = 0R ,
which implies xr I.
Therefore, by the right ideal criterion, I is a right ideal of R.

Problem 6.3. Let R be a ring and let z R be a (fixed) element. Define J = {az | a R}.
Prove that J is a left ideal of R.
Proof. It is clear that J is a subset of R.
First of all, we have 0R = 0R z J, which implies J 6= .
Next, let x, y J and r R; so that x = az and y = bz for some a, b R. Consequently
x y = az bz = (a b)z

with

a b R;

rx = r(az) = (ra)z

with

ra R.

Thus x y J and rx J.
Therefore, by the left ideal criterion, J is a left ideal of R.
13

Problem 6.4. Let R be a ring and let I, J be ideals (i.e., two-sided ideals) of R.
(1) Prove that I + J is an ideal of R. Recall that I + J = {a + b | a I, b J}.
(2) Prove that I J is an ideal of R.
Proof. It is clear that both I + J and I J are subsets of R.
(1) Since 0R I and 0R J, we see 0R = 0R + 0R I + J. Next, let z1 , z2 I + J and
r R. Thus zi = ai + bi with ai I and bi J. Consequently
z1 z2 = (a1 a2 ) + (b1 b2 ) I + J,
rz1 = ra1 + rb1 I + J,
z1 r = a1 r + b1 r I + J.
This proves that I + J is an ideal of R, as required.
(2) As I and J are ideals, we have 0R I and 0R J. Hence 0R I J. Next, let
x, y I J and r R. Thus x, y I and x, y J. Consequently, we see
xy I
xr I
rx I

and x y J,
and xr J,
and rx J.

Therefore
x y I J, xr I J
By the ideal criterion, I J is an ideal of R.

PROBLEMS

HINTS

and rx I J.


SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

14

Math 4442/6442 (Spring 2016)

Homework Set #07 (Due 03/08)

Solutions

Problem 7.1. Let R be a ring and let I, J be ideals of R.

(1) Prove I I + J and J I + J. P
(2) Prove IJ I J. (Recall IJ = { ni=1 ai bi | n N, ai I, bi J}.)
(3) Prove or disprove: I J is (always) an ideal of R.
Proof/Solution. (1) Indeed, for all a I and b J, we have
a = a + 0R I + J

and

b = 0R + b I + J.

Thus I I + J and J I + J.
(2) We prove the statement IJ I J as follows: Let x IJ. Then we can write x as
follows:
n
X
x=
ai b i = a1 b 1 + + an b n
i=1

with n N, ai I, bi J. Since both I and J are ideals of R, we see ai bi I and ai bi J

for all i = 1, . . . , n. Consequently
n
n
X
X
x=
ai b i I
and
x=
ai bi J.
i=1

i=1

So x I J. In summary, every x IJ satisfies x I J, which proves IJ I J.


(3) We disprove the statement that I J is (always) an ideal of R as follows: Consider
the ring R = Z; let I = (2) and J = (3), both being ideals of Z. It is clear that
2 I J,

3I J

but 2 + 3 = 5
/ I J.

This verifies that I J is not (always) an ideal of R.

Problem 7.2. Let R be a ring and I an ideal of R. (Thus there is the quotient ring R/I.)
Prove that R/I is commutative if ab ba I for all a, b R.
Proof. Assume ab ba I for all a, b R. (We need to show that the quotient ring R/I is
commutative.) Let , R/I be arbitrary elements in R/I. (We need to show = .)
By the construction of R/I, there exist a, b R such that
=a+I

and

= b + I.

By the operations of R/I, we see

= (a + I)(b + I) = ab + I
= (b + I)(a + I) = ba + I.
Since ab ba I, we get
ab + I = ba + I
by the criterion r + I = s + I r s I. Combining the above, we derive
= (a + I)(b + I) = ab + I
= ba + I = (b + I)(a + I) = .
In short, = for all , R/I. This completes the proof that R/I is commutative if
ab ba I for all a, b R.

15

Problem 7.3. Consider rings Z and Z12 = {[0], . . . , [11]}. Define functions f1 , f2 : Z Z12
by f1 (m) = [8m] and f2 (m) = [9m] for all m Z.
(1) Determine which of the above (i.e., f1 , f2 ) is a ring homomorphism; rename it f .
(2) Find Ker(f ) and Im(f ) explicitly. (Again, f is the one that is a homomorphism.)
(3) By applying the Fundamental Theorem of Homomorphisms, show that there is a ring

=
isomorphism g : Z4 Im(f ).
(4) Describe g explicitly in terms of g(0) = [?], g(1) = [?], g(2) = [?], and g(3) = [?].
Solution. (1) We claim that f1 is not a ring homomorphism and f2 is a ring homomorphism.
Indeed, we have f1 (1 1) = f1 (1) = [8] 6= [64] = [8][8] = f1 (1)f1 (1). For f2 , we have
f2 (m + n) =[9(m + n)] = [9m + 9n] = [9m] + [9n] = f2 (m) + f2 (n) and
f2 (mn) = [9mn] = [9mn] + [72mn] = [81mn] = [(9m)(9n)] = [9m][9n] = f2 (m)f2 (n)
for all m, n Z, showing that f2 is a ring homomorphism. (So from now on, f2 = f .)
(2) We have Ker(f ) = (4) = {4k | k Z} Z and Im(f ) = {[0], [3], [6], [9]} Z12 .
(3) & (4) By the Fundamental Theorem of Homomorphisms, there is a ring isomorphism

=
g : Z/ Ker(f ) Im(f ) defined by g(m + Ker(f )) = f (m). Since Ker(f ) = (4), we see that

=
Z/ Ker(f ) = Z/(4) = Z4 . Putting things together, we see g : Z4 Im(f ) with
g(0) = f (0) = [0],

g(1) = f (1) = [9],

g(2) = f (2) = [6],

and g(3) = f (3) = [3].

Problem 7.4. Let R be a division ring.

(1) Prove that there are exactly two distinct left ideals of R. (What are they?)
(2) How many right ideals does R possess? What are they? No justification is needed.
(3) How many ideals does R possess? What are they? No justification is needed.
Proof/Solution. Note that {0R } and R are distinct ideals of the division ring R (since R is
not the zero ring). (We are going to show that there are no (left or right) ideals other than
{0R } and R in any division ring R.)
(1) It suffices to show that every non-zero left ideal is necessarily R. To this end, let I be
any non-zero left ideal of R, so that there exists x I with x 6= 0R . As R is a division ring,
we see x is invertible so that x1 R. Thus 1R = x1 x I since I is a left ideal. Now that
1R I, we consequently see
r = r1R I

for all r R.

(Or, r = r1R = r(x1 x) = (rx1 )x I for all r R.) This shows R I and hence I = R.
So there are precisely two distinct left ideals (namely {0R } and R) in a division ring R. 
(2) There are two distinct right ideals, namely {0R } and R, precisely. The proof is very
similar to the proof in (1) above. (Indeed, let I be any non-zero right ideal of R, so that
there is x I with x 6= 0R . Then x is invertible; hence for all r R, we see
r = 1R r = (xx1 )r = x(x1 r) I.
This shows R I. Therefore I = R.)
(3) There are precisely two distinct ideals, namely {0R } and R, by the work above.
PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

16

Math 4442/6442 (Spring 2016)

Homework Set #08 (Due 03/22)

Solutions

Problem 8.1. Let R be a ring and I an ideal of R. Prove that the quotient ring R/I is
commutative only if ab ba I for all a, b R. (Compare with Problem 7.2 .)
Proof. Assume that the quotient ring R/I is commutative. (We need to show ab ba I
for all a, b R.) Let a, b R be arbitrary elements in R. (We need to show ab ba I.)
By the construction of R/I, we have
a + I R/I

and

b + I R/I.

and

(b + I)(a + I) = ba + I.

By the operations of R/I, we see

(a + I)(b + I) = ab + I
Since R/I is commutative, we have
(a + I)(b + I) = (b + I)(a + I).
Combining the above, we get
ab + I = (a + I)(b + I)
= (b + I)(a + I) = ba + I.
Now that ab + I = ba + I, we see
ab ba I
by the criterion r + I = s + I r s I. This completes the proof that R/I is
commutative only if ab ba I for all a, b R.

Problem 8.2. Define a function
C by(f (x))
(x) R[x]. (For
3 :R[x] 13
= f (i)
for all f
13
3
example, we have (2x 3x + 5) = 2i 3 i + 5 = 5 + (2 + 3)i C.)


(1) Compute (1 2x + 3x2 ), (4 5x) and (1 2x + 3x2 )(4 5x)
directly.
(2) True or false: (1 2x + 3x2 )(4 5x) = (1 2x + 3x2 )(4 5x) .
(3) True or false: is a ring homomorphism. No justification is necessary.
(4) Find a concrete f (x) R[x] such that deg(f (x)) = 3 and (f (x)) = 0.
(5) Find a concrete g(x) R[x] such that (g(x)) = 13 45i.
Solution. (1) It is routine to carry out the computation (details skipped)
(1 2x + 3x2 ) = 2 2i
(4 5x) = 4 5i


2
(1 2x + 3x )(4 5x) = (4 13x + 22x 15x3 ) = 18 + 2i.
2

(2) True. Indeed, it is routine to see

(1 2x + 3x2 )(4 5x) = (2 2i)(4 5i)


= 18 + 2i = (1 2x + 3x2 )(4 5x) .
(3) As covered in class, is a ring homomorphism
(4) Let f (x) = x3 + x = (x2 + 1)x. Then deg(f (x)) = 3 and moreover
(f (x)) = (x3 + x) = i3 + i = i + i = 0.
(5) Let g(x) = 13 45x. It is clear that
(g(x)) = (13 45x) = 13 45i.
17

Problem 8.3. Consider : R[x] C by (f (x)) = f (i) for all f (x) R[x], which is the
same as in Problem 8.2 above.
(1) Prove Ker() = (x2 + 1), the ideal generated by x2 + 1 in R[x].
(2) Prove that is onto. (So what is Im()?)
(3) Prove R[x]/(x2 + 1)
= C.
Proof. (1) For all a(x) (x2 + 1), we see a(x) = b(x)(x2 + 1) for some b(x) R[x] and hence
(a(x)) = a(i) = b(i)(i2 + 1) = b(i)0 = 0,
which implies a(x) Ker(). Hence (x2 + 1) Ker().
Conversely, let f (x) Ker(); so that f (i) = (f (x)) = 0. (We are going to show
f (x) (x2 + 1).) As x2 + 1 is monic, there exists q(x), r(x) R[x] such that
f (x) = q(x)(x2 + 1) + r(x) with r(x) = 0 or deg(r(x)) 6 1.
The above condition on r(x) allows us to write r(x) = r0 + r1 x with r0 , r1 R. Then
0 = f (i) = q(i)(i2 + 1) + r(i) = q(i)0 + r(i) = r(i) = r0 + r1 i.
From r0 +r1 i = 0, we see r0 = r1 = 0 and hence r(x) = 0. Thus f (x) = q(x)(x2 +1) (x2 +1).
This shows Ker() (x2 + 1). All in all, we see Ker() = (x2 + 1).
(2) For a + bi C with a, b R, there exists a + bx R[x] such that (a + bx) = a + bi.
This proves that is onto. (Hence Im() = C.)
(3) By the Fundamental Theorem of Homomorphisms, R[x]/ Ker()
= Im(). Now, in
light of Ker() = (x2 + 1) and Im() = C, we see R[x]/(x2 + 1)

= C.
Problem 8.4. Let R be a ring, z R a (fixed) element of R, and J a (fixed) left ideal of
R. Define I = {r R | rz J}. Prove that I is a left ideal of R.
Proof. It is clear that I R. First, since 0R z = 0R J, we see 0R I and hence I 6= .
Next, let a, b I (so that a, b R with az J and bz J) and let r R. Then
(a b)z = az bz J
because az J, bz J and J is a left ideal. Thus a b I. Also, we have
(ra)z = r(az) J
because az J, r R and J is a left ideal. Thus ra I. By the criterion for left ideals, we
prove that I is a left ideal of R, as required.


PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

18

Math 4442/6442 (Spring 2016)

Midterm Exam II (03/29)

Review Problems

Materials covered earlier: Midterm I; Homework Sets 1, 2, 3, 4.

Ring homomorphism, kernel, image: Problems 5.1, 5.2, 6.1, 6.2, 7.3, 8.2, 8.3, etcetera.
Proofs/examples involving ring homomorphism: Problems 5.3, 5.4, 6.2, 8.4.
Left/right/2-sided ideal, criteria: Problems 6.3, 6.4, 7.1, 7.4, 8.4.
Quotient ring: Problems 7.2, 8.1.
Fundamental theorem of ring homomorphisms: Problems 7.3, 8.3.
Lecture notes and textbooks: All we have covered.

Note: The above list is not intended to be complete. The problems in

the actual test may vary in difficulty as well as in content. Going over,
understanding, and digesting the problems listed above will definitely help.
However, simply memorizing the solutions of the problems may not help you
as much.
You are strongly encouraged to practice more problems (than the ones
listed above) on your own.

19

Math 4442/6442 (Spring 2016)

Midterm Exam II (03/29)

Solutions

Solutions
have been withdrawn
from the site

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

20

Math 4442/6442 (Spring 2016)

Homework Set #09 (Due 04/05)

Solutions

Problem 9.1. Consider the ring Z, which is commutative with unity. Let I1 = (0), I2 =
(9), I3 = (23) and I4 = (28) (be principal ideals generated by 0, 9, 23 and 28 respectively).
(1) List all Ii that are prime ideals.
(2) List all Ii that are maximal ideals.
(3) For each Ii that is not a prime ideal, find ai , bi Z \ Ii such that ai bi Ii .
(4) For each Ii that is not a maximal ideal, find a maximal ideal Mi such that Ii Mi .
Solution. (1) Among I1 , . . . , I4 , the prime ideals are I1 = (0) and I3 = (23).
(2) Among I1 , . . . , I4 , the only maximal ideal is I3 = (23).
(3) We provide elements as required in the following
For I2 , there exist 3, 3 Z \ I2 such that 3 3 = 9 I2 .
For I4 , there exist 4, 7 Z \ I4 such that 4 7 = 28 I4 . (Or, we have 2, 14 Z \ I4
and 2 14 = 28 I4 .)
(4) We may choose M1 = (2), M2 = (3) and M4 = (7). It should be straightforward to
see that Mi are maximal ideals and Ii Mi for all i = 1, 2, 4.
Problem 9.2. Consider the ideal I = (35, 119) in Z.
(1) Find a Z such that I = (a).
(2) Write a as a linear combination of 35 and 119.
Solution. To solve the problem systematically (rather than ad hoc), we apply the Euclidean
Algorithm.
(1) To find gcd(35, 119), we apply the Euclidean Algorithm as follows
119 = 3 35 + 14,
35 = 2 14 + 7,
14 = 2 7 + 0.
Thus a = gcd(35, 119) = 7. That is, I = (35, 119) = (7).
(2) To find a linear combination, we have
a = 7 = 35 2 14
= 35 2(119 3 35) = 7 35 2 119.
In summary, we have a = 7 = 7 35 2 119.
Problem 9.3. Consider the ideal J = (35, 119, 79) of Z.
(1) Find b Z such that J = (b).
(2) Write b as a linear combination of 35, 119 and 79.
Solution. To solve the problem systematically (rather than ad hoc), we apply the Euclidean
Algorithm.
(1) We have gcd(35, 119, 79) = gcd(gcd(35, 119), 79) = gcd(7, 79). Then
79 = 11 7 + 2,
7 = 3 2 + 1,
2=21+0
Thus b = gcd(35, 119, 79) = gcd(7, 79) = 1. That is, J = (35, 119, 79) = (1). (Hence
J = Z.)
21

(2) To find a linear combination, we have

b=1=732
= 7 3(79 11 7)
= 34 7 3 79
9.2

= 34(7 35 2 119) 3 79 = 238 35 68 119 3 79.

In summary, we have b = 1 = 238 35 68 119 3 79.

Problem 9.4 (Math 6442). Let R be a commutative ring with unity and P an ideal of R.
Prove that P is a prime ideal of R if R/P is an integral domain.
Proof. Assume that R/P is an integral domain. (We need to prove that P is a prime ideal.)
To this end, let a, b R such that ab P . Hence ab + P = 0R + P . Thus we see
(a + P )(b + P ) = ab + P = 0R + P = 0R/P R/P.
Now, as R/P is an integral domain and (a + P )(b + P ) = 0R/P , we must have
a + P = 0R + P

or

b + P = 0R + P,

which readily implies

aP
or
b P.
In summary, ab P = a P or b P . This establishes that P is a prime ideal of R. 

PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

22

Math 4442/6442 (Spring 2016)

Homework Set #10 (Due 04/12)

Solutions

Problem 10.1. Consider an ideal I = (x2 + x + 1, x3 + 2x) in Z3 [x], where Z3 = {0, 1, 2}.
(1) Find the monic polynomial f (x) Z3 [x] such that I = (f (x)).
(2) Express f (x) as a linear combination of x2 + x + 1 and x3 + 2x (within Z3 [x]).
Solution. (1) We find gcd(x2 + x + 1, x3 + 2x) in Z3 [x] by the Euclidean Algorithm as follows
x3 + 2x = (x 1)(x2 + x + 1) + (2x + 1),
x2 + x + 1 = (2x + 1)(2x + 1) + 0.
The monic polynomial associated to 2x + 1 is (2)1 (2x + 1) = 2(2x + 1) = x + 2. Thus
f (x) = gcd(x2 + x + 1, x3 + 2x) = x + 2 and (x2 + x + 1, x3 + 2x) = (x + 2).
(2) From (1) above, we see
2x + 1 = x3 + 2x (x 1)(x2 + x + 1).
Therefore
f (x) = x + 2 = 2(2x + 1)


= 2 (x3 + 2x) (x 1)(x2 + x + 1)
= 2(x3 + 2x) (2x 2)(x2 + x + 1)
= 2(x3 + 2x) + (x + 2)(x2 + x + 1).
In summary, f (x) = x + 2 = 2(x3 + 2x) + (x + 2)(x2 + x + 1), as required.
Problem 10.2. In the ring R[x], consider M = (x), the ideal generated by x.
(1) True or false: M consists of all polynomials of R[x] whose constant terms are 0.
(2) Prove that M is a maximal ideal of R[x].
(3) Multiple choice: The quotient ring R[x]/(x) is isomorphic to
Q
R
C


Solution. Note that M = (x) = xp(x) | p(x) R[x] consists of all multiples of x.
(1) True. Indeed, a polynomial is a multiple of x if and only if its constant term is 0.
(2) As 1
/ M but 1 R[x], we see M ( R[x]. (It remains to verify that, for every ideal
I of R[x], if M ( I then I = R[x].) Let I be any such ideal (so that M ( I). Then there
exists a polynomial f (x) I but f (x)
/ M . To be concrete, write
f (x) = an xn + + a1 x + a0

with n > 0 and ai R for i = 0, 1, . . . , n.

Note that a0 6= 0 (since otherwise f (x) (x)) and an xn + + a1 x (x) ( I. Thus

a0 = (an xn + + a1 x + a0 ) (an xn + + a1 x) I.
Now, since a0 I and a0 U(R[x]) (as a0 R \ {0}), we see I = R[x]. (Indeed, for all
p(x) R[x], we have p(x) = a0 (a1
0 p(x)) I since a0 I and I is an ideal of R[x].)
(3) We claim that R[x]/(x) is isomorphic to R. (To justify the claim, we define a ring
homomorphism : R[x] R by
(p(x)) = p(0) for all p(x) R[x].
Note that Ker() = (x) and Im() = R (details omitted, similar to Problem 4.4 ). By the
Fundamental Theorem of Homomorphisms, we see R[x]/(x)
= R.) (Now we can use (3)
to prove (2) as follows: From (3), we see that R[x]/(x) is a field, which then implies that
M = (x) is a maximal ideal of R[x].)
23

Problem 10.3. Let R be a PID (i.e., a commutative integral domain with unity in which
all ideals are principal), and a, b R. Prove that there exists d R such that d | a, d | b
and d = ar + bs for some r, s R. (Here d | a means a = dt for some t R.)
Proof. Consider the ideal (a, b). Since R is a PID, there exists d R such that (a, b) = (d).
(It suffices to show d | a, d | b and d = ar + bs for some r, s R.)
As a, b (a, b), we see a, b (d) = {dz | z R}. This simply means
a = dx and b = dy
for some x, y R. Therefore d | a and d | b.
Finally, as d (d), we see d (a, b) = {ar + bs | r, s R}. This immediately implies
d = ar + bs
for some r, s R. Now the proof is complete.

Problem 10.4 (Math 6442). Let R be a commutative ring with unity and P an ideal of R.
Prove that P is a prime ideal of R only if R/P is an integral domain.
Proof. Assume that P is prime. (We need to prove that R/P is an integral domain.) To this
end, let a + P and b + P in R/P such that
(a + P )(b + P ) = 0R/P .
This translates to
ab + P = 0R + P.
which implies
ab P.
Now, since P is a prime ideal, we see
aP

or

b P,

which implies
a + P = 0R/P
or
b + P = 0R/P .
In summary, if (a + P )(b + P ) = 0R/P , then a + P = 0R/P or b + P = 0R/P . This establishes
that R/P is an integral domain. The proof is now complete.


PROBLEMS

HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID

24

Math 4442/6442 (Spring 2016)

Extra Credit Set

Solutions

Each problem carries 3 points. To claim the eatra points for a problem, you must solve it
completely and correctly. You may attempt a problem for as many times as you wish
by 04/19. Feel free to use the results we have covered.
The points you get here will be added to your total score from homework assignments.
Each F represents a correct solution submitted.
Problem E-1. Let R be a ring, and Si subrings of R (for i = 1, 2) such that R = S1 S2 .
Prove R = S1 or R = S2 .
FFFFFF
Proof. Keep working on this.

Problem E-2. Let R be a ring with d, e R such that d is not a right zero-divisor and
ex = x for all x R. Prove that R has unity.
FFFFF
Proof. Keep working on this.

Problem E-3. Let R be a finite ring such that x2 = x for all x R (thus R is commutative
by Problem 2.4 ). Prove that R has unity.
F
Proof. Keep working on this.

Problem E-4. Let R be a ring with unity and x, y R. Assume that xy = 1R and x is
not a left zero-divisor. Prove x U(R).
FFFFF
Proof. Keep working on this.

Problem E-5. Let R be an integral domain, e R, and I a non-zero left ideal of R. Assume
that ex = x for all x I. Prove that R has unity.
F
Proof. Keep working on this.

Problem E-6. Let R be a commutative ring with unity and let ai R. Prove
U(R[[x]]) a0 U(R).

Proof. Keep working on this.

i=0

ai x i


Problem E-7. Consider the ring M2 (R) of all 2 2 real matrices over R.
(1) Determine whether the zero ideal {0M2 (R) } is maximal in M2 (R).
(2) Determine whether the quotient ring M2 (R)/{0M2 (R) } is a division ring.
(The same questions can be asked for Mn (F ) with F a field and 2 6 n N.)
Proof. Keep working on this.

Problem E-8. For any field F , prove that F [[x]] is a PID.

Proof. Keep working on this.

Problem E-9. Let R be a commutative ring with unity, a, b R, and m a maximal ideal.
Prove that, if ab m2 then either a m2 or b m.
Proof. Keep working on this.
PROBLEMS


HINTS

SOLUTIONS

(R, +, ) . . . ab = 0 ; a = 0 b = 0 . . . R/ Ker()
= Im() . . . @I, m ( I ( R . . . IJ P ; I P J R . . . I = (a) in PID