4

$G$ is commutative group. $|G|=n$.
$m\in \mathbb{N}$ and $\gcd(m,n)=1$.

I need to prove that $\varphi :G\to G$, $\varphi(x)=x^m$ is automorphism of G.

My try:
I assume that $a\in \ker(G)$, so $a\in G$ and in one hand: $a^m=e$ (because $\varphi(a)=e$), and at the other hand $a^n=e$ because $a\in G \Longrightarrow$ because $\gcd(m,n)=1,\;a$ must be $e$, so $\ker(\varphi)=\left\{e\right\}$.
And that's mean that $\varphi$ is Aut.

I'm right? my proof is OK?

Thank you!

CS1
  • 2,091

1 Answers1

2

As pointed out in the comments, the proof given above is nearly correct--it just needs to show that $\phi$ is a morphism. (This was done in the comments, but since comments are supposed to be ephemeral, I'll include the outline below.)

If $a, b\in G$, then $\phi(a)\phi(b) = a^mb^m = (ab)^m = \phi(ab)$. Thus, $\phi$ is a homomorphism. (This requires $G$ to be abelian.)

apnorton
  • 17,929
  • 6
  • 55
  • 115