Groups whose orders have no common factors

  • Thread starter Thread starter SNOOTCHIEBOOCHEE
  • Start date Start date
  • Tags Tags
    Factors Groups
SNOOTCHIEBOOCHEE
Messages
141
Reaction score
0

Homework Statement


Let G and G' be finite groups whose orders have no common factor. Prove that the homomorphism \varphi G \rightarrow G' is the trivial one \varphi (x) =1 for all x.



The Attempt at a Solution



My thoughts are that we need to use lagrange's thm. somehow. or maybe not.

We have the order of G and G' such that. GCD( |G|, |G'|) =1.

\varphi G \rightarrow G'

Let |G| = n

By legranges thm.

gn \in G = 1G

and we know that \varphi (gn)= 1G'

But i don't really no what to do from here. It doesn't seem as if i am on the right track.

Any thoughts?
 
Physics news on Phys.org
I presume you mean prove that the only homomorphism from G to G' is \phi(g)= 1_{G'}. Let x be a member of G, not equal to 1G. Let n be the order of x: the smallest integer n such that xn= 1G. What is the order of \phi(x)?
 
The order of \varphi(x) must divide n.
 
But the order of any member of member of G must divide |G|. Since the order \phi(x) divides n, it also divides |G|. And the order of \phi(x) must, like the order of any member of G', must divide |G'|. What is the only number that divides both |G| and |G'|?
 
Holy crap youre my hero.
 
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