Creating a homomorphism with given generators

  • Thread starter Thread starter Ultraworld
  • Start date Start date
  • Tags Tags
    Generators
Ultraworld
Messages
30
Reaction score
0
I got the Dihedral Group D = <(1 2 3 4 5 6 ), (1 2)(3 4)(5 6)> and the symmetric group Sym(5).

Now I want to construct a homomorphism f : D --> Sym(5). Am I free to map the generators (1 2 3 4 5 6) and (1 2)(3 4)(5 6) to any element in Sym(5) as long holds:
f((1 2 3 4 5 6))6 = 1,
f((1 2)(3 4)(5 6))2 = 1.


I tried
f((1 2 3 4 5 6)) = (1 2 3)(4 5),
f((1 2)(3 4)(5 6)) = (1 2).

Which seems to be fine but
f((1 2 3 4 5 6)) = (1 2 3)(4 5),
f((1 2)(3 4)(5 6)) = (1 4).

seems to fail?

Why?
 
Physics news on Phys.org
You can't just send them to *any* elements of the right order. Homomrphisms must preserve group structure. Like composition of elements.
 
True but how do i know my first attempt is indeed a homomorphism and the 2nd one not. Now I "prooved" it by a computer program (MAGMA).
 
You check if it is a homomorphism. You know what the definition of a homomorphism is, so check if the maps satisfy the definition.
 
And remember that the dihedral group is defined by the relations, in this case, g^6=e, h^2=e and hgh=g^{-1}.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top