*In which we meet the dihedral groups, build new groups from old, and explore Cayley tables.*

- Definition of a
*cyclic*group. - Definition of the
.^{th}cyclic group - Definition of the
.dihedral group^{th} - Proposition 4:
*Let be a regular -gon in the plane. Write for the rotation anticlockwise by about the centre of , and for the reflection in an axis of . Then the symmetries of are , , , …, , , , , …, .*We proved this by labelling the vertices of anticlockwise as , , …, , then picking a symmetry of , and considering where it sends the vertex , splitting into two cases depending on whether the vertices of are numbered anticlockwise or clockwise. - Definition of the
*Cartesian product*of two sets. - Definition of the
*product group*of two groups and . - Proposition 5:
*The operation just defined is a group operation.*This was a straightforward check of the group axioms. - Definition of the
*order*of a group, and of a*finite group*. - Definition of a
*Cayley table*.

### Understanding today’s lecture

I encourage you to find the permutations of the vertices of the square corresponding to the eight symmetries we identified. A good way to check your understanding would be to work out the permutations for the symmetries of the square, and then to check with Richard Earl’s online notes where he gives the permutations (top of page 11).

You could draw up the Cayley table for some groups we’ve seen so far, e.g. , or for some sensibly small like 4 or 5, or under addition modulo 2 (that was an example from Lecture 1). What’s the Cayley table for ? That would be a really good question to explore, it would give you practice with cyclic groups, with a product group and with a Cayley table, but will also link with ideas we’ll meet later in the course.

Can you use a Cayley table to determine whether a (finite) group is Abelian?

### Further reading

Of course Wikipedia has a page about dihedral groups; it has many pretty pictures. We talked about Cayley tables today; another way to represent a group is via a Cayley graph. These crop up in various places, for example Fields medallist Terry Tao has written about them on his blog, e.g. here (warning: this post assumes knowledge of more advanced maths than first-year undergraduates usually have, but you might enjoy skim-reading the post to get a flavour without worrying about understanding it!).

There are close connections between group theory and the (very English) tradition of change ringing, a particular type of bell ringing. See for example this NRICH article, which even has a link to online bells so that you can have a go yourself, or this Plus article, which makes a nice connection with the group of symmetries of a square that we studied today.

### Preparation for Lecture 3

Some of you will want to tackle the first problems sheet before our next lecture, so here are some definitions that you may find helpful. I’ll give these officially in the lecture too, of course.

- Definition: Let be a group. We say that a subset is a
*subgroup*of if the restriction of to makes into a group, that is,- is closed under ;
- has an identity;
- contains inverses.

- Definition: Let be a group, and take . We define the
*order*of , , to be the smallest positive integer such that . If no such integer exists, then we say that has*infinite order*. - Definition: Let and be two groups. An
*isomorphism*between and is a bijective map such that for all . If such an isomorphism exists, then we say that and are isomorphic.

And now some questions for you to consider before the next lecture.

Does every Cayley table contain each element exactly once in each row and in each column?

In the definition of a subgroup above, why have I not mentioned associativity?

In the Linear Algebra course, you have studied the structure-preserving maps between vector spaces; these are called *linear maps*. In what sense is an isomorphism between groups also an example of a structure-preserving map? (We shall meet more general structure-preserving maps, which need not always be bijections, later in the course; they are called *homomorphisms*.)

Last time, I mentioned that composition of functions is a binary operation on the set of bijections from a set to itself. Is a group under composition of functions? Is the operation commutative? If is a set of size , what is the size of the set ?

## Leave a Reply