Homomorphisms and Calculating Elements

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


Suppose that ##G## is a cyclic group with generator ##g##, that ##H## is some arbitrary group, and that ##\phi : G \rightarrow H## is a homomorphism. Show that knowing ##\phi (g)### let's you compute ##\phi(g_1)## ##\forall g_1 \in G##

Homework Equations



##\phi(g^n) = \phi(\underbrace{g~\star_G~ g~ \star_G~ g ... \star_G~ g}_{n|}) = \underbrace{\phi (g) \star_H \phi(g) \star_H ... \star_H \phi(g)}_{|n|} = \phi(g)^n ##

The Attempt at a Solution


Let ##g_1 \in G## be arbitrary. This implies that ##\exists k \in \mathbb{Z}## such that ##g_1 = g^k##.

##\phi(g_1 \star_G g ) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g^k \star_G g) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g^{k+1}) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g)^{k+1} \star_H \phi(g)^{-1} = \phi(g_1) \iff##

##\phi(g)^k = \phi(g_1)##

This seems correct, but I am unsure. If this is correct, though, does this imply that ##H## is also cyclic, where ##\phi(g)## is the generator?
 
Physics news on Phys.org
Bashyboy said:

Homework Statement


Suppose that ##G## is a cyclic group with generator ##g##, that ##H## is some arbitrary group, and that ##\phi : G \rightarrow H## is a homomorphism. Show that knowing ##\phi (g)### let's you compute ##\phi(g_1)## ##\forall g_1 \in G##

Homework Equations



##\phi(g^n) = \phi(\underbrace{g~\star_G~ g~ \star_G~ g ... \star_G~ g}_{n|}) = \underbrace{\phi (g) \star_H \phi(g) \star_H ... \star_H \phi(g)}_{|n|} = \phi(g)^n ##

The Attempt at a Solution


Let ##g_1 \in G## be arbitrary. This implies that ##\exists k \in \mathbb{Z}## such that ##g_1 = g^k##.

##\phi(g_1 \star_G g ) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g^k \star_G g) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g^{k+1}) = \phi(g_1) \star_H \phi(g) \iff##

##\phi(g)^{k+1} \star_H \phi(g)^{-1} = \phi(g_1) \iff##

##\phi(g)^k = \phi(g_1)##

This seems correct, but I am unsure. If this is correct, though, does this imply that ##H## is also cyclic, where ##\phi(g)## is the generator?

Wouldn't it be much simpler just to say ##\phi(g_1)=\phi(g^k)=\phi(g)^k##?? I don't know what all the extra stuff is for. And no, it doesn't mean H is cyclic. It does mean that the image of G under ##\phi## is a cyclic subgroup of H.
 
Hmm...yes, it would have been terribly simpler, had I done that...
 
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