MAT 444 H.

Barcelo
Spring 2004
Homework 10 Solutions
Chapter 10
Section 10.5
Question:
4. Prove that the elements
2 1
1, ( ) , , ( )
n
t t

form a basis C for [ ] / (( ) )
n
t t C .
Answer:
Since ( )
n
t is a monic polynomial by proposition 5.7 we know that
1
{1, , , }
n
t t

is a
basis for [ ] / (( ) )
n
t t C when considered as a vector space. Thus, it suffices to show that
the set
2 1
{1, , ( ) , , ( ) }
n
t t t

is linearly independent. There are several ways of
showing this, Here is one. Assume that


2 1
0 1 2 1
(1)
( ) ( ) ( ) 0
n
n
a a t a t a t

+ + + + =
_


where 0 denotes the constant polynomial zero. For (1) to be equal to the zero polynomial it
must be zero for all values of t. Let
0 0
, then (1) 0 t a a = = = . So we are left with

2 1
1 2 3
( ) ( ) ( ) 0
n
a t a t a t

+ + =
Factoring out ( ) t yields


2 2
1 2 3 1
( ) ( ( ) ( ) ( ) ) 0
n
n
t a a t a t a t

+ + + + =


2 2
1 2 3 1
(2)
( ( ) ( ) ( ) 0
n
n
a a t a t a t

+ + + + =
_

since t is not the zero polynomial. But then again, evaluating (2) at t = yields that
1
0 a = . Continue in the same manner to obtain that 0 0, , 1
i
a i n = = .

Question:
5. Let denote the residue of x in the ring
4 3 2
[ ] / ( 1) R x x x x x = + + + + Z . Compute the
expressions for
3 2 5
) ( 1) and + + + in terms of the basis
2 3 4
(1, , , , ) .

Answer:
3 2 4 3 2 3 2
4 3 2 3 2
3 2
( ) ( ) ( 1)
( 1) 1
1
a


+ + + = + + + + +
= + + + + + +
= +

5 5 4 3 2
( ) ( 1) 1 ( 1) ( 1) 1
( 1) . 0 1 1.
b

= + = + + + + +
= + =

MAT 444 Barcelo
Homework 10 Page 2
Typeset by Georgeann Lorentz

Question:
10. Determine the structure of the ring R obtained from Z by adjoining element satisfying
each set of relations.
(a) 2 6, 6 15 = = (b) 2 6, 6 18 = = (c) 2 6, 6 8 = =

Answer:
a) [ ] / (2 6, 6 15)
I
R x x x =

Z

In R we have that 2 6 0 x = and 6 15 0 6 18 0 x x = = and
6 15 0 18 15 3 0 x = = = .
Hence, 3 I and so does 3x and 3.2 = 6. Thus, we have that 2 6 6 2 x x I + = and
3 2 x x x I = . So we have that ( , 3) x I . It is straightforward to show that
( , 3) I x . So we have that

3
[ ] / (3, ) ( [ ] / ( )) / (3)
/ (3)
R x x x x =

Z Z
Z Z


b) The ideal (2 6, 6 18) (2 6) x x x = since 6 18 3(2 6) x x = so
[ ] / (2 6, 6 18) [ ] / (2 6) x x x x x = Z Z

c) Let (2 6, 6 8) I x x = . In [ ] / R x I = Z we have that 2 6 x = and 6 8 6 18 x x = =
18 8 0 = . Again, it is easy to show that (2 6, 10) I x = , so
10
[ ] / ( [ ] / (10)) / (2 6) [ ] / (2 6) x I x x x x = Z Z Z .

Question:
11. Let / (10) R Z = . Determine the structure of the ring obtained by adjoining an element
satisfying each relation.
(a) 2 6 0 = (b) 2 5 0 =

Answer:
a)
10
[ ] / (2 6) R x x = Z

b) [ ] / (10, 2 5) R x x Z
In 2 5 and 10 0 4 10 0 8 0 R x x x = = = = = and 10 0 2 0 5 0 x x = = = since
2 5 x = . But then 5 0 and 5 4 x x x I x I = , so we have just shown that
(5, ) (10, 2 5) x x . It is easy to show that (10, 2 5) (5, ) x x , since
10 2.5 and 2 5 2 . 5! x x = = Hence,
5
[ ] / (10, 2 5) [ ] / (5, ) ( [ ] / ( )) / (5) x x x x x x = Z Z Z Z .
MAT 444 Barcelo
Homework 10 Page 3
Typeset by Georgeann Lorentz
Section 10.6

Question:
8. A semigroup S is a set with an associative law of composition having an identify element. Let
S be a commutative semigroup which satisfies the cancellation law: ab = ac implies b = c.
Use fractions to prove that S can be embedded into a group.

Answer:
Here is a sketch of the proof. For every ordered pair of elements ( , ) with 0 a b b ,
introduce the fraction
a
b
. Two fractions
1 2
1 2
,
a a
b b
are said to be equivalent
1 2
1 2
a a
b b
if and
only if
1 2 2 1
a b a b = . Next, follow Artins proof (p. 369) to show that this is an equivalence
relation. Since S came equipped with a cancellation law, the proof will go through without
difficulties. Next, let G be the set of equivalence classes of fractions, with the operation
a c ac
b d bd

=


.
First, you must show that this operation is well-defined; that is if,
1 1 2 2
1 1 2 2
and
a c a c
b d b d
,
then
1 2 1 2
1 2 1 2
a a c c
bb d d
. Next, you must show that the operation is associative. This will hold,
because the operation in S was associative. Then you will be left with showing that there is
an identity element, that every element has an inverse and that the set G so defined, is
closed under product of fractions (the operation just introduced). The existence of an
identity in G will follow from the existence of an identity in S. Then the embedding of S
into G will be given by

:
( )
1
S G
s
s

=

It is straightforward to show that this is an injective map.