Math2020: Solving discrete problems

homework 6 hint

Due date:

The homework will be due on Thursday March 31, which will allow time for any extra questions in class on Tuesday.

More hints and examples coming soon - check later on Monday, March 28. Should be up by 2pm.

General:

This homework is about constructing group multiplication (or composition) tables for a group, and using this to say something about the group.

Class 16 was most similar to this homework. In class 16 we did examples of groups with 4 elements. See http://www.math.lsu.edu/~verrill/teaching/discrete2020/lecture16notes.pdf, and the hand out with examples. The homework is similar to this, but with 6 elements instead of 4 in the groups.

Hint about squares mod N

Here is a question similar to one on the homework, but about squares mod 17 instead of mod 13.

Question: Find the squares mod 13, not including 0, and make a mod 17 multiplication table for them.
Note, the squares form a subgroup of the group Z/17Z*. A subgroup is a subset which is also a subgroup.

How to find the squares? It's useful to make a table:
x x^2 x^2 mod 17
1 1 1
2 4 4
3 9 9
4 16 16
5 25 8
6 36 2
7 49 15
8 64 13
9 81 13
10 100 15
11 121 2
12 144 8
13 169 16
14 196 9
15 225 4
16 256 1

So, there are only 8 different squares mod 17, which are:

1, 4, 9, 16, 8, 2, 15, 13.

In numerical order, these are: 1,2,4,8,9,13,15,16

(Remark: do you notice any pattern in this table of squares? How many nonzero squares do you think there are mod N, if N is an odd prime?)

Here is the mutiplication table for the subgroup of squares in Z/17Z*:
1 2 4 8 9 13 15 16
1 1 2 4 8 9 13 15 16
2 2 4 8 16 1 9 13 15
4 4 8 16 15 2 1 9 13
8 8 16 15 13 4 2 1 9
9 9 1 2 4 13 15 16 8
13 13 9 1 2 15 16 8 4
15 15 13 9 1 16 8 4 2
16 16 15 13 9 8 4 2 1

Note, this can be made by first making a multiplication table of the numbers using usual arithmetic, and then working out the answers mod 17.

Note, the fact that this "works" is because the product of two squares is still a square. By works, I mean that the set of all squares is a subgroup. This means that all the numbers in the table are from the list 1,2,4,8,9,13,15,16.
Another example of a subgroup is the subgroup of all even numbers in Z,+. This is a subgroup since any two even numbers add to give another even number. But the set of all odd numbers is not a subgroup of Z,+ because two odd numbers add to give an even number.

Here are the answers to the rest of the questions for this example:

Example of a group given by addition modulo N

What is the table for the composition if the group is Z/8Z,+?

Note, I should have asked for composition tables, not multiplication tables, since the composition law is often not multiplication. In this case it is addition.

Note about isomorphisms

Note that for the homework I did not actually ask you to give the isomorphism map explicitly. Usually you should be able to make a pretty good guess of whether two groups are isomorphic from the orders of the elements of the groups. For the groups to be isomorphic, they must have elements of the same order. So, I will not ask for justification for groups you say are isomorphic, though for your own understanding you might like to explictly find the isomorphism in some examples, as is done in the above example.

Hints for symmetries

There are several web pages with examples of symmetry groups. Try: If you can understand these you should be able to work out the answers to all parts of the question for the symmetry groups.

Example of a non abelian group

In the text book there is an example of the symmetry group of the square, which is an example of a non abliean group of order 8. See Example 9.85, page 389, of the first edition of text book. Note that the table on page 390 is not symmetric about the NW-SE diagonal, so the group is not abelian.

Note, there is a nice java applet showing symmetries of the square on a page at CSUSB .

Answer to question about permutations

By the group of permutations, I mean considering permutations as maps. We wrote these in class in the following kind of notation:
(1 2 3)
(3 2 1)

which means a permutation map f with f(1) = 3, f(2) = 2 and f(3) = 1 or
(1 2 3)
(3 1 2)

which means a permutation g with g(1) = 3, g(2) =1, g(3)=2, for example. (Except the brackets should just be one big bracket on either side, instead of two small braket) So the composition of these, f.g means the map x -> f(g(x)), which we denote by
(1 2 3)
(1 3 2)

this comes from f(g(1)) = f(3) = 1, f(g(2)) = f(1) = 3, f(g(3))=f(2)=2.

So, these computations are similar to those done on the quiz on the symmetries of the cube and tetrahedron - see
http://www.math.lsu.edu/~verrill/teaching/discrete2020/cubesolution.pdf and
http://www.math.lsu.edu/~verrill/teaching/discrete2020/tetra_solution.pdf

This was also discussed in class 12 - see
http://www.math.lsu.edu/~verrill/teaching/discrete2020/lecture12notes.pdf

In the text book, first edition, see section 4.2, page 141-142, also see exercise 1, page 146, end of section 4.2. Also section 9.5, especially example 9.86, page 389-391. Several of the exercises at the end of section 9.5 are also on permutations.

Composition of functions example

Question: How is the order determined for multiplication table 6?

Order means how many times you have to compose an element with itself to get back to the identity. In this case the identity is the map f1(x)=x.

For example, for f6(x), we have
f6(f6(x)) = f6( x/(x-1) ) = x/(x-1) / ( x/(x-1) -1)
mutliply top and bottom by (x-1) to get:
f6(f6(x)) = x / (x - (x-1)) = x/( x - x +1)
= x/1 =x
So f6(f6(x)) = x = f1(x)
So f6 has order 2.

But other elements may have other orders.

E.g.,
f5(f5(x)) = f5(1 - 1/x) = 1 - 1/(1-1/x)
= 1 - 1/ (1-1/x)
multiply top and bottom of second part by x:
= 1 - x/( x - 1)
put everything over a common denominator:
= (x-1 - x)/( x-1) = -1/( x-1) = 1/(1-x) = f4(x)
So doing f5 twice is not the identity, so f5 does not have order 2.

Now you have to compute f5(f5(f5(x)), and see if this is the identity, ie., since f5(f5(x)) = 1/(1-x), is
f5(1/(1-x)) = 1 - 1/(1-1/x))
the same as just x?
If it is, then f5 has order 3. If it's not, the you have to compose again, and see if f5(f5(f5(f5(x))) = x. Continue until you find how many times you have to compose f5 with itself to get x. This is a good review/practice of your algebra skills!