1.13: Exercises
( \newcommand{\kernel}{\mathrm{null}\,}\)
[x1] Show that the quaternion group has only one element of order 2, and that it commutes with all elements of Q. Deduce that Q is not isomorphic to D4, and that every subgroup of Q is normal.12
[x2] Consider the elements
a=
in \GL2(Z). Show that a4=1 and b3=1, but that ab has infinite order, and hence that the group ⟨a,b⟩ is infinite.
[x3] Show that every finite group of even order contains an element of order 2.
[x4d]Let n=n1+⋯+nr be a partition of the positive integer n. Use Lagrange’s theorem to show that n! is divisible by ∏ri=1ni!.
[x4] Let N be a normal subgroup of G of index n. Show that if g∈G, then gn∈N. Give an example to show that this may be false when the subgroup is not normal.
[x4a] A group G is said to have finite exponent if there exists an m>0 such that am=e for every a in G; the smallest such m is then called the exponent of G.
-
Show that every group of exponent 2 is commutative.
-
Show that, for an odd prime p, the group of matrices
{(1ab01c001)|a,b,c∈Fp}
has exponent p, but is not commutative.
[x4b]Two subgroups H and H′ of a group G are said to be commensurable if H∩H′ is of finite index in both H and H′. Show that commensurability is an equivalence relation on the subgroups of G.
[x4c]Show that a nonempty finite set with an associative binary operation satisfying the cancellation laws is a group.
[x4e]Let G be a set with an associative binary operation. Show that if left multiplication x↦ax by every element a is bijective and right multiplication by some element is injective, then G is a group. Give an example to show that the second condition is needed.
[x0]Show that a commutative monoid M is a submonoid of a commutative group if and only if cancellation holds in M:
mn=m′n⟹m=m′.
Hint: The group is constructed from M as Q is constructed from Z.