Isomorphism of D5 and S5: Finding Elements and Permutations

  • Thread starter Thread starter POtment
  • Start date Start date
  • Tags Tags
    Subgroup
Click For Summary
SUMMARY

The discussion focuses on demonstrating that the dihedral group D5 is isomorphic to a subgroup of the symmetric group S5. It establishes that D5 contains 10 elements, derived from the symmetries of a pentagon, and provides explicit permutations corresponding to these elements. The isomorphism is confirmed by constructing a bijective function that preserves group operations, with specific mappings such as the identity of D5 to the identity in S5 and rotations to corresponding permutations. The reference to Mark Steinberger's book is crucial for understanding the dihedral groups of arbitrary even order.

PREREQUISITES
  • Understanding of group theory concepts, specifically dihedral groups.
  • Familiarity with symmetric groups, particularly S5.
  • Knowledge of permutations and their notation.
  • Basic understanding of bijective functions and group homomorphisms.
NEXT STEPS
  • Study the properties of dihedral groups, focusing on Dn for various n.
  • Learn about symmetric groups and their structure, especially S5.
  • Explore the concept of group isomorphisms and their applications.
  • Read Mark Steinberger's book on algebra for deeper insights into dihedral groups.
USEFUL FOR

Mathematicians, students studying abstract algebra, and anyone interested in group theory and its applications in symmetry and permutations.

POtment
Messages
28
Reaction score
0

Homework Statement


By considering the vertices of the pentagon, show that D5 is isomorphic to a subgroup of S5.

Write all permutations corresponding to the elements of D5 under this isomorphism.

The Attempt at a Solution


To show isomorphic, need to find a function f: D5->S5, where f(a,b) = f(a)f(b), f is one to one and onto.

I'm having a hard time determining the elements of of D5. D4 was trivial, but this one doesn't make sense to me.
 
Physics news on Phys.org
If you understand D4 then it shouldn't be too hard to understand D5. Any element in D5 can be determined in the following way: first pick a vertex and then a new vertex to which you want to move it. You then have two options of orienting it by flipping it over. This means there is a total of 10 elements in D5 (this argument works in general to show that Dn has order 2n).

Since you can think of a symmetry of a pentagon as a permutation of its 5 vertices, it follows that D8 is isomorphic to a subgroup of S5 (of course not all permutations are allowed since adjacent vertices must remain adjacent. Indeed, S5 has order 5! = 120). Note that for this reason your function f cannot be one-to-one.
 
Well, you could imagine flip flopping a pentagon around to get the elements of D_5, or you could look at Section 2.8 of the following book to see the dihedral groups of arbitrary even order written out. Note that in this book the author uses the naming convention D_{2n}, n\in \mathbb{N}. So your D_5 is his D_{10} (that is, the subscript is the actual order of the group).


Book:
http://math.albany.edu/~mark/algebra.pdf, by Mark Steinberger.
 
So the permutations of D5= (1); (12345); (15432); (12)(53)(4); (54)(13)(2); (43)(25)(1); (53);(12);(15)(24)(3); (23)(14)(5) Is this correct?

How can I show this is isomorphic to D5?
 
You can just write out the elements of D5 explicitly (usually people give them names like r, r2, ... and s, s2 - see your favorite book), consider each one and write it out as a permutation. That will explicitly give you an isomorphism.
For example, the identity 1 of D5 is sent to the identity (1) of S5;
The rotation r around an angle 2\pi / 5 is sent to (12345) in S5;
The rotation r2 around an angle 2 \times 2\pi / 5 is sent to (13524) = (12345)(12345) in S5, etc.

Then you will see that you get a bijective function and you can explicitly check that it preserves the group operation, although that is quite obvious from the construction.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
4K