MATH 600: Abstract Algebra I (Fall 2000)
Homework Page
URL for this web site:
http://www.math.umd.edu/~jmr/600/homework.html
Note:
All assignments in Hungerford, unless otherwise noted. Also,
assignments are to be turned in and will be graded,
unless otherwise noted.
Due Wednesday, September 6:
I, 1, Exercises, pp. 29-30: 3, 4, 13, 14, 15. Hint for #14:
look at the map x -> x-1.
Additional exercises:
- Show that every semigroup G can be embedded
in a monoid. Hint: Let G~ be the disjoint union of G
and the one-point set {e} and define a suitable multiplication
on G~.
- Show that every monoid is isomorphic to a submonoid of the
monoid of self-maps of some set. Hint: Let the monoid "act on itself".
- Deduce from (1) and (2) that every semigroup
is isomorphic to a subsemigroup of the self-maps of some set.
Due Wednesday, September 13:
I, 2, Exercises, pp. 33-34: 3, 17.
I, 3, Exercises, pp. 36-37: 6, 8, 9.
Additional exercise:
- Show that the result of the last problem (section 3, problem 9) is
false if you drop the assumption that the group is commutative. In
other words, give an example of a group G with two elements of finite
order whose product is NOT of finite order. (Hint: let the group
G be the group of self-maps of the real line R generated by
translation (x --> x+1) and by reflection
(x --> -x).)
Due Wednesday, September 20:
I, 4, Exercises, pp. 40-41: 12, 13.
I, 5, Exercises, pp. 45-46: 5, 8, 16.
I, 6, Exercises, pp. 51-52: 6, 8.
Additional exercise:
- Show by example that in the situation of Exercise 13 in section 4,
there can indeed be more than one subgroup of order q. (Hint:
there is already an example with q = 2, p = 3.)
Due Wednesday, September 27:
I, 7, Exercises, pp. 58-59: 1, 6.
I, 8, Exercises, pp. 63-64: 1.
I, 9, Exercises, pp. 68-69: 6, 8, 12.
Additional exercise:
- What is the coproduct in the category of abelian groups?
Justify your answer.
Due Wednesday, October 4:
II, 1, Exercises, pp. 74-75: 9, 10.
II, 2, Exercises, pp. 81-82: 1, 7, 8, 9.
Additional exercises:
- Strengthen the conclusion of problem 10 in II, 1 by showing
that every finitely generated subgroup of Q is cyclic.
(Prove this first; it's the key to 10a.)
- Let x = (x1, ..., xn) be
an element of the free abelian group Zn
of rank n. Show that there is a basis of
Zn
with x as its first element if and only if x is not a
multiple ky of any other element y of
Zn, with k > 1, or if and only if
the GCD of the integers x1, ...,
xn is 1.
Due Friday, October 13:
II, 4, Exercises, pp. 91-92: 1, 13. (Hint for #13: use
Proposition II.4.8.)
II, 5, Exercises, pp. 95-96: 9, 10, 11. (Note on #11: there is
indeed a (unique) simple group of order 168, and it acts doubly transitively
on a set of 7 elements.)
II, 6, Exercises, pp. 99-100: 9.
Due Friday, October 20:
Additional exercises:
- Show that every group of order 54 has a non-trivial semidirect
product decomposition. Deduce that every group of order 54 is solvable.
Is every group of order 54 nilpotent? If so, is every
group of order 54 abelian? Generalize to groups of order 2pr,
p an odd prime, r a positive integer.
- Suppose that G is a group with a normal subgroup N
such that N has trivial center
and every automorphism of N is inner. Deduce that
G splits as a direct product N x H for some
subgroup H (isomorphic to the quotient group
G/N). Hint: to construct H, you need to show
there is a canonical way to lift elements of the quotient group
G/N back up to G. So first show that each element
of the quotient group lifts to a unique element of G
that commutes with N. To do this, first lift the element
to some element of G, then adjust this element by
something in N.
- Show that every finite group G of order > 2 has a non-trivial
automorphism. Hint: if G is non-abelian, it has a non-trivial
inner automorphism. Consider the abelian case separately, using the
structure theory of finite abelian groups.
- Show that any group of order 1225 = 49.25 is abelian,
and then classify such groups up to isomorphism.
Hint: show that the Sylow subgroups are normal.
- Show that (Zp)n, an
elementary abelian p-group, has no non-trivial
characteristic subgroups. (Here p is a prime.)
Due Monday, November 6:
III, 1, Exercises, pp. 121-122: 11, 12, 13.
III, 2, Exercises, pp. 133-134: 1, 9, 11, 18.
Due Wednesday, November 15:
III, 3, Exercises, pp. 140-142: 3, 4, 11, 13.
Additional exercises:
- Mimic the proof that the Gaussian integers are a Euclidean domain
to show that the subring R of the complex numbers generated by
Z and by a primitive cube root w
= (-1 + sqrt(3) i)/2 of unity is a
Euclidean domain. (Hint: The "absolute value" function is again the square
of the usual absolute value for complex numbers.)
- Retain the notation of
#1. Show that R has exactly 6 units (1, -w2,
w, -1, w2, -w).
Show that (3) is the square of a prime ideal in R. Also show that
all other ordinary prime numbers p either remain prime in R
or else split into products of two primes of R,
which are distinct even up to associates.
- Not required, for extra credit only: Find necessary and
sufficient conditions for the two cases of part (2). In other words,
determine when a prime number p splits and when it remains inert
in R. Interpret the result in terms of solutions of the
Diophantine equation p = a2 + b2
- a b.
Due Wednesday, November 22:
III, 4, Exercises, pp. 148-149: 12, 14, 15.
III, 5, Exercises, pp. 156-157: 7, 8, 9.
Due Monday, December 4:
III, 6, Exercises, pp. 165-166: 1, 7, 10. Thanks to Ben Howard
for contributing a solution to #7, which is
quite tricky.
IV, 1, Exercises, pp. 178-180: 5, 9, 11.
IV, 2, Exercises, pp. 188-190: 13.
Due Wednesday, December 13:
Additional exercises:
- Use the structure theorem for finitely generated modules over a
PID to give a structure theorem for pairs (A, T),
where A is a finitely generated abelian group and
T is an automorphism of A with T2 =
-1. (Hint: if one defines ix = Tx for x in
A, then A becomes a finitely generated module over
R = Z[i], the Gaussian integers.)
- Use your answer to (1) to classify all pairs (A, T)
up to isomorphism, where A is an abelian group of order
25 and T is an automorphism of A of order
precisely 4. (First figure out the possiblilities for A, and
for each one, figure out the possibilities for T2
before figuring out the possibilities for T.)