How Do Group Homomorphisms Affect Permutation Groups and Subgroups?

  • Thread starter Thread starter millwallcrazy
  • Start date Start date
  • Tags Tags
    Groups Permutation
millwallcrazy
Messages
14
Reaction score
0
Help with permutation groups...

How do i show that if P: G1 --> G2 is a group homomorphism, then the image, P(G1) =
{g belongs to G2 , s.t. there exists h belonging to G1 , P(h) = g}, is a subgroup of G2

Also if we let G be a group, and Perm(G) be the permutation group of G. How do i show that the map

Q: G --> Perm(G) g --> Qg (g is a subscript of the map Q)
such that Qg(h) = gh is well-defined, 1-1 and a group homomorphism, where
g, h belong to G (again, For Qg(h), the g is a subscript)

Now suppose that G = Z3 (Z subscript 3) = {e, a, a^2}, a^3 = e. If we Label the points of Z3 as {1, 2, 3}, with e = 1, a = 2 and a^2 = 3, how to we give the permutations Qa and Qa^2 , explicitly. (where again a and a^2 are subscripts of Q)
 
Physics news on Phys.org


For the first part, assume you have two elements a, b \in P(G_1).

Thus a = P(x) and b = P(y) for some x,y \in G_1.

What condition(s) must these elements satisfy in order for P(G_1) to be a subgroup of G_2?
 
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