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

  • Context: Graduate 
  • Thread starter Thread starter ry22
  • Start date Start date
  • Tags Tags
    Dihedral Group
Click For Summary
SUMMARY

The dihedral group D_n is proven to be a group by demonstrating that the composition of reflections and rotations is associative. This is established through the principle that the composition of bijections from a set to itself is associative. By considering the set S(A) of all bijections of a set A, one can confirm that the composition of two bijections results in another bijection, thus validating the group properties of D_n.

PREREQUISITES
  • Understanding of group theory and its axioms
  • Familiarity with bijections and permutations
  • Knowledge of geometric transformations, specifically reflections and rotations
  • Basic principles of composition in mathematics
NEXT STEPS
  • Study the properties of bijections in detail
  • Explore the concept of permutations and their applications in group theory
  • Learn about geometric transformations and their algebraic representations
  • Investigate other types of groups, such as cyclic groups and symmetric groups
USEFUL FOR

Mathematics students, particularly those studying abstract algebra, group theory enthusiasts, and educators looking to deepen their understanding of dihedral groups and their properties.

ry22
Messages
2
Reaction score
0
I don't understand how to show that the reflections and rotations are associative. Thanks for any help.
 
Physics news on Phys.org
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   Reactions: RJLiberator
Thanks man! I got it!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 26 ·
Replies
26
Views
982
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K