How would one prove the dihedral group D_n is a group?

In summary, understanding the principle of composition of bijections can help prove that the reflections and rotations are associative. By considering the set of all bijections, or permutations, of a set A to itself, we can easily show that the composition of two bijections results in another bijection. This principle can be applied to geometric transformations, proving that their compositions are always associative.
  • #1
ry22
2
0
I don't understand how to show that the reflections and rotations are associative. Thanks for any help.
 
Physics news on Phys.org
  • #2
ry22 said:
I don't understand how to show that the reflections and rotations are associative. Thanks for any help.

Composition of bijections from a set to itself is associative. That's a handy principle to know, because it shortcuts the need to prove special cases. Instead of trying to visualize rotations and reflections, all you have to do is note that each reflection or rotation is permutation of the vertices.

Say A is a set, and consider the set S(A) of all bijections of A to itself. You can also think of these as permutations of the elements of the set.

If you compose two bijections you get another bijection (must be proved). And if f, g, and h are bijections, then (fg)g = f(gh) where "fg" means "f composed with g," often denoted f o g. So we could also say that (f o g) o h = f o (g o h).

You should prove that. Once you do, then any time you have a collection of geometric transformations, you know that their compositions are associative.
 
  • Like
Likes RJLiberator
  • #3
Thanks man! I got it!
 

1. What is the definition of a dihedral group Dn?

A dihedral group Dn is a group of symmetries of a regular n-gon. It is denoted by Dn and has 2n elements.

2. How do you prove closure in Dn?

To prove closure, we need to show that the composition of any two elements in Dn results in another element in Dn. This can be done by showing that the composition of any two rotations or reflections in Dn is also a rotation or reflection in Dn.

3. What is the identity element in Dn?

The identity element in Dn is the rotation by 0 degrees, which leaves all points in the n-gon unchanged.

4. How do you prove the existence of inverses in Dn?

To prove the existence of inverses, we need to show that for every element in Dn, there exists another element in Dn that when composed together, results in the identity element. In Dn, the inverse of a rotation is the rotation in the opposite direction and the inverse of a reflection is itself.

5. What is the order of Dn?

The order of Dn is 2n, as it has 2n elements. This can be seen by considering the number of rotations and reflections in Dn.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
787
  • Linear and Abstract Algebra
Replies
1
Views
2K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
4
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
10
Views
368
Back
Top