Group Theory: Verifying Function and Matrix Multiplication's Group Properties - Prof. Pete, Assignments of Algebra

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

Pre 2010

Uploaded on 02/13/2009

koofers-user-d8c
koofers-user-d8c 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 3124 Friday, September 12
Second Homework Solutions
1. Problem 5.14 on page 34 Let H={f:RR|f(x)6=0 for all xR}. For
f,gH, define f g by (f g)(x) = f(x)g(x)for all xR. Then f g H. Verify that with
this operation His a group. How does this group differ from the group of invertible
mappings in M(R)? Also, is this group Habelian?
First note that we do indeed have a binary operation, because if f,gH, then f g:R
R, and f g(x) = f(x)g(x)6=0 for all xR. We now have the three axioms for a group
to check.
(a) Associativity. If f,g,hHand xR, then
(f g)h(x)=(fg)(x)h(x) = f(x)g(x)h(x) = f(x)(gh)(x) = f(gh)(x)
for all xR. Therefore (f g)h=f(gh)which proves associativity.
(b) Identity. This is the function ι:RRdefined by ι(x) = 1 for all xR.
(c) Inverses. The inverse of the function fis the function 1/f, where (1/f)(x) =
1/f(x)(note that this is well defined because f(x)6=0 for all xR).
We have now verified that His a group. It differs in many ways from the group of
invertible mappings in M(R). For one thing His abelian, because if f,gH, then
(f g)(x) = f(x)g(x) = g(x)f(x) = (g f )(x)for all xRand hence f g =g f , while the
group of invertible mappings in M(R)is nonabelian.
2. Let A,BG. Then certainly AB is a 2 ×2 matrix with real entries. Furthermore
(AB)(AB)0=A(BB0)A0=AIA0=AA0=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 IGbecause II0=II =I). Finally if AG, then Ais an invertible matrix with
inverse A0and we have A0A=I. Therefore
I=I0= (A0A)0=A0(A0)0
which shows that A0Gand it follows that all elements have inverses. This completes
the proof that Gis a group.
3. Let
α=1 2 3 4
3 4 1 2and β=1 2 3 4
4 3 1 2.
(a) βα. This sends 1 31, 2 42, 3 14, 4 23. Therefore βα
is 1 2 3 4
1 2 4 3
pf2

Partial preview of the text

Download Group Theory: Verifying Function and Matrix Multiplication's Group Properties - Prof. Pete and more Assignments Algebra in PDF only on Docsity!

Math 3124 Friday, September 12

Second Homework Solutions

  1. Problem 5.14 on page 34 Let H = { f : R → R | f (x) 6 = 0 for all x ∈ R}. For f , g ∈ H, define f g by ( f g)(x) = f (x)g(x) for all x ∈ R. Then f g ∈ H. Verify that with this operation H is a group. How does this group differ from the group of invertible mappings in M(R)? Also, is this group H abelian? First note that we do indeed have a binary operation, because if f , g ∈ H, then f g : R → R, and f g(x) = f (x)g(x) 6 = 0 for all x ∈ R. We now have the three axioms for a group to check.

(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.

  1. Let A, B ∈ G. Then certainly AB is a 2 × 2 matrix with real entries. Furthermore

(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.

  1. Let α =

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 =

  1. First put the position so that there is the space is in the bottom right hand corner; there will be several ways of doing this and it does not matter which you choose. We will

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.