# Constructing dihedral group:D8 from its presentation

This is a survey article intended for expository and illustrative purposes. The style in this article is thus more verbose and pedagogical than most pages. Links are provided to other, more concise pages.

The goal of this article is to use the presentation of dihedral group:D8 as an example illustrating how to deal with presentations, convert them into multiplication tables, and deduce basic facts about the group.

In this article, we denote by the identity element of the group.

We consider the presentation:

Note that due to the relation , we get , and an equivalent presentation is:

And yet another is:

## Contents

## For advanced users

Advanced users, who don't want to wade through a prolonged explanation, can simply read through the following more advanced stuff:

- Presentation of semidirect product is disjoint union of presentations plus action by conjugation relations: Applying this to cyclic group:Z4 and cyclic group:Z2 acting by the inverse map should be enough to convince you that this is a group of order eight given as a semidirect product.
- Presentation of dihedral groups
- Read about the Todd-Coxeter algorithm for a general procedure to construct groups using their presentations.

## What do we care about when dealing with presentations

### Bounding from above

The group is generated by elements and and thus every element can be written as a word involving (possibly with negative exponents) such as . Using the shorthand for words, we can rewrite this as .

However, different words may become equivalent *due to* the relations. For instance, the words and represent the same group element because . This is an obvious equality, but some other equalities are not so obvious. For instance, in the group -- this is not immediately clear, but it can be *deduced* from the relations:

Thus, the very large number (in fact, infinite number) of distinct words can correspond to a much smaller set of possible elements. We give a very simple argument to indicate that there are at most eight distinct elements:

We start with any word. First note that since , all s can be rewritten as .

We now claim that we can rewrite this word by bringing all the s together and all the s together. To do this, we need to *bubble* the s past the s. For this, we note the relations:

(this can be deduced from )

and:

(this can be deduced from and using )

Thus, whenever we see an or immediately right of an , we can rewrite that part of the word pushing the to the right. Iterating this procedure often enough gets all powers of on the left, followed by all powers of . We thus get a word of the form:

Since , can be reduced mod 4 and reduced mod 2, and we get the possibilities listed above.

If this is unclear for you, here's an example: [SHOW MORE]

### Bounding from below

This is (in general) a lot trickier -- it means making sure that there is no *further* collapse than what we have already deduced from the relations. Roughly speaking, the only way to really do this is to actually construct a group -- with its full multiplication table or multiplication rule, and show that this rule is associative and satisfies all the relations. In practice, there are a number of theorems about presentations that we can use to short-circuit this process, but at this stage we don't have access to those theorems.

In our case, we have identified that there are at most eight distinct elements:

In the process, we have made clever use of all the relations. However, how can we be sure that there isn't more scope to use the relations cleverly and cut the group down further, i.e., to find some way of showing that ? This is the kind of question that haunts one when working with presentations. As mentioned, the basic tool is to actually construct the multiplication table once we're sure that we've used up all relations and verify that this multiplication table gives a group satisfying the relations.

## Constructing the actual multiplication table

### Abstract formulation

We first construct the multiplication table as an abstract set of rules on the set :

- times any element is that element.
- times is , where is reduced modulo 4.
- times is , where is reduced modulo 4.
- times : This is the first nontrivial rule. The needs to be moved past a total of times. Each time, becomes , so we get or , where is reduced mod 4.
- times is where is reduced modulo 4.

We can now verify computationally that:

- This rule is associative, for every triple of element types.
- is an identity element.
- Every element has an inverse: the inverse of is , and the inverse of is .
- The relations and are all satisfied.

We thus obtain a group of order eight that realizes the presentation. Further, by the reasoning earlier, we also know that the group given by the presentation has order at most eight. We have thus bounded the group both from above and below, and obtained its precise description.

### Actual multiplication table

Working out the above abstract rules, we can construct the actual multiplication table.

The row element is multiplied on the left and the column element is multiplied on the right.

Element | ||||||||
---|---|---|---|---|---|---|---|---|