

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Solutions to homework problems related to group theory. It covers the verification of the group properties of function multiplication and matrix multiplication. How to show that function multiplication of non-zero functions forms a group and how matrix multiplication of invertible matrices also forms a group.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Math 3124 Friday, September 12
(a) Associativity. If f , g, h ∈ H and x ∈ R, then
( f g)h(x) = ( f g)(x)h(x) = f (x)g(x)h(x) = f (x)(gh)(x) = f (gh)(x)
for all x ∈ R. Therefore ( f g)h = f (gh) which proves associativity. (b) Identity. This is the function ι : R → R defined by ι(x) = 1 for all x ∈ R. (c) Inverses. The inverse of the function f is the function 1/ f , where ( 1 / f )(x) = 1 / f (x) (note that this is well defined because f (x) 6 = 0 for all x ∈ R).
We have now verified that H is a group. It differs in many ways from the group of invertible mappings in M(R). For one thing H is abelian, because if f , g ∈ H, then ( f g)(x) = f (x)g(x) = g(x) f (x) = (g f )(x) for all x ∈ R and hence f g = g f , while the group of invertible mappings in M(R) is nonabelian.
(AB)(AB)′^ = A(BB′)A′^ = AIA′^ = AA′^ = I
and we see that AB ∈ G, so we have closure and indeed matrix multiplication is an operation on G. Also matrix multiplication is associative, and the identity is I (note that I ∈ G because II′^ = II = I). Finally if A ∈ G, then A is an invertible matrix with inverse A′^ and we have A′A = I. Therefore
I = I′^ = (A′A)′^ = A′(A′)′
which shows that A′^ ∈ G and it follows that all elements have inverses. This completes the proof that G is a group.
and β =
(a) β ◦ α. This sends 1 → 3 → 1, 2 → 4 → 2, 3 → 1 → 4, 4 → 2 → 3. Therefore β ◦ α is (^) ( 1 2 3 4 1 2 4 3
(b) α ◦ β =
Remember, this means first do β, then α because mappings are written on the left.
(c) α−^1 =
(d) β−^1 =
(e) β−^1 ◦ α−^1 =
(f) α−^1 ◦ β−^1 =
(g) (β ◦ α)−^1 =
(h) (α ◦ β)−^1 =
choose
. We now obtain the permutation
We must decide whether this is a product of an even number or an odd number of transpositions (2-cycles). Writing the permutation as a product of disjoint cycles, we obtain (1 12 13 6 3 5 10 2 14 4 7 9 8 11) This is a 14-cycle, hence a product of 13 transpositions (cf. problem 6.9 on page 40) which is odd. Therefore the position cannot be reached.