Sol HW4
Sol HW4
Sol HW4
ANDY EISENBERG
1 a b
Problem (pgs. 111-114, 9). Let G = GL3 (R). Show that H = 0 1 c is
0 0 1
a subgroup of G.
Proof. Since the determinant
of anymatrix in H is 1, they are all invertible. It is
1 a b
easy to verify that if A = 0 1 c H is an arbitrary element, then
0 0 1
1 a b 1 a ac b 1 a ac b 1 a b 1 0 0
0 1 c 0 1 c = 0 1 c 0 1 c = 0 1 0 .
0 0 1 0 0 1 0 0 1 0 0 1 0 0 1
1 d e
Thus the inverse is also in H. Now let B = 0 1 f H be another arbitrary
0 0 1
element. Then
1 a b 1 d e 1 a + d af + b + e
0 1 c 0 1 f = 0 1 c + f .
0 0 1 0 0 1 0 0 1
Thus for any A, B H, we have A1 H and AB H. Since H is closed under
the group operation and under taking inverses, it is a subgroup.
Problem (pgs. 111-114, 14). Let G be an abelian group. Show that the set of all
elements of G of finite order forms a subgroup of G.
Proof. Let H be the set of all elements of G of finite order. Let a, b H be
arbitrary elements. Since a is of finite order in G, we have an = e for some n.
Then (a1 )n = an = (an )1 = e1 = e, so a1 H. Since b is also of finite
order, there is some m so that bm = e. Now (ab)nm = anm bnm = em en = e, and
ab H. Since H is closed under the group operation and under taking inverses, it
is a subgroup.
Problem (pgs. 111-114, 15). Prove that any cyclic group is abelian.
Proof. Let G = hai be a cyclic group generated by a. Take x, y G. Then there
exist n, m Z such that x = an , y = am . Hence xy = an am = an+m = am an = yx,
so G is abelian.
Problem (pgs. 111-114, 17). Prove that the intersection of any collection of sub-
groups of a group is again a subgroup.
Problem (pgs. 111-114, 26). Let G be a group with a, b G Assume that o(a) and
o(b) are finite and relatively prime, and that ab = ba. Show that o(ab) = o(a)o(b).
Proof. Since o(ab) = lcm(o(a), o(b)) and gcd(n, m) = 1, we have o(ab) = o(a)o(b).