Homomorphism of a cyclic subgroup is a cyclic subgroup ?

  • Thread starter Thread starter Leb
  • Start date Start date
  • Tags Tags
    Cyclic Subgroup
Leb
Messages
87
Reaction score
0

Homework Statement



hom.jpg


Let \alpha:G \rightarrow H be a homomorphism and let x\inG

Prove \alpha(<x>) =<\alpha(x)>

Homework Equations



α(<x>) = α({x^{r}: r ∈ Z}) = {α(x^{r}) : r ∈ Z} = {α(x)^{r}: r ∈ Z} = <α(x)>.


I do not understand how can we take out the 'r' out of a(x^{r}) to get (a(x))^{r} ? What would a(x)^2 say mean ? a(x) (some binary operation defined in H) a(x) or would it be (a°a)(x) i.e. a(a(x)) ?
 
Physics news on Phys.org
Hi Leb! :smile:

(try using the X2 button just above the Reply box :wink:)
Leb said:
I do not understand how can we take out the 'r' out of a(x^{r}) to get (a(x))^{r} ? What would a(x)^2 say mean ? a(x) (some binary operation defined in H) a(x) or would it be (a°a)(x) i.e. a(a(x)) ?

No, that would be ar(x).

This is (a(x))r, the product of r elements of group H. :wink:
 
Thank you for your reply tiny-tim !
However, I am still not sure what will happen...

(a(x))r = a(x) * a(x) *...*a(x) r-times ? But what is * then ? Is it defined in H or in G ?
 
Leb said:
I do not understand how can we take out the 'r' out of a(x^{r}) to get (a(x))^{r} ?
Well, you have that a is homomorphism, so a\bigl(x^2\bigr)=a(x\star x)=a(x)*a(x)=\bigl(a(x)\bigr)^2, same for a(x^{r}), where \star is binary operation in G and * in H.
 
Leb said:
… I am still not sure what will happen...

(a(x))r = a(x) * a(x) *...*a(x) r-times ? But what is * then ? Is it defined in H or in G ?

in H

x is in G, a(x) is in H …

so x can only undergo G's operations,

and a(x) can only undergo H's operations :wink:
 
Ah, OK, now it is clear. Thanks guys !
 
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