11
$\begingroup$

The title basically says it all.

Is there a group with more than one element that is isomorphic to the group of automorphisms of itself?

I'm mainly interested in the case for finite groups, although the answer for infinite groups would still be somewhat interesting.

$\endgroup$
3

4 Answers 4

29
$\begingroup$

The automorphism group of the symmetric group $S_n$ is (isomorphic to) $S_n$ when $n$ is different from $2$ or $6$. In fact, if $G$ is a complete group you can ascertain that $G \simeq \mathrm{Aut}(G)$. The reverse implication needn't hold, though.

$\endgroup$
3
  • 8
    $\begingroup$ As mentioned in the comments above, $D_8$ is a counterexample to the reverse implication, since it is not complete but is isomorphic to its automorphism group. $\endgroup$ Jul 2, 2010 at 2:02
  • 3
    $\begingroup$ Could you perhaps add the definition of a complete group? $\endgroup$
    – user717
    Jul 2, 2010 at 9:28
  • 10
    $\begingroup$ Complete = centerless + all automorphisms are inner. Such a group G is isomorphic to Aut(G) by the map taking an element g to the inner automorphism conjugation-by-g. $\endgroup$ Jul 2, 2010 at 16:26
16
$\begingroup$

I am slightly surprised that Wielandt's automorphism tower theorem has not been mentioned: this asserts that given a finite group $G$ with trivial center, the sequence of groups defined by $G_{0} = G$ and $G_{n+1} = {\rm Aut}(G_{n})$ for $n \geq 0$ eventually stabilizes, that is at some stage ${\rm Aut}(G_{n}) = G_{n}$.

$\endgroup$
3
3
$\begingroup$

For the absolute Galois group of $\mathbb Q$, the map $g\mapsto (h \mapsto ghg^{-1})$ is an isomorphism between $G_\mathbb Q$ and its automorphism group. This is a corollary of the Neukirch-Uchida theorem.

$\endgroup$
3
$\begingroup$

See also Problem 2015-4C in the Nieuw Archief voor Wiskunde. A solution (of mine) can be found here: http://www.nieuwarchief.nl/home/problems/pdf/uitwerking-2015-4.pdf

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.