Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have the following question:

Let $G$ be a group. And $A,B\leq G$ two cyclic subgroups with $|A|=|B|=n$. When does an Automorphism $\alpha\in\mathrm{Aut}(G)$ exists such that $\alpha(A)=B$?

If $n=p$ is prime, does this changes the situation?

Thanks for help.

share|cite|improve this question
I really don't think that there is any sensible answer to that question without further information or assumptions! – Derek Holt Aug 30 '12 at 22:15
Take $n=p=2$ and $G$ a symmetric group. You get a very clear answer (iff the subgroups have the same cycle structure) which simplifies to "sometimes". – Jack Schmidt Aug 31 '12 at 2:16
If $n$ is a maximal prime power (i.e. $n=p^k$ and $pn$ does not divide $|G|$), then the answer is yes, and in fact then $\alpha\in\operatorname{Inn}(G)$ and $A$, $B$ need not be cyclic (Sylow theorem). In other cases (as given by Jack Smith) $A$ may be a subgroup of a cyclic subgroup of order $k n$, say. This is a property kept by automorphisms, so if $B$ does not have ist, there is no automorphism. – Hagen von Eitzen Sep 1 '12 at 21:01

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.