Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Purely for fun, I was playing around with iteratively applying $\DeclareMathOperator{\Aut}{Aut}\Aut$ to a group $G$; that is, studying groups of the form

$$ {\Aut}^n(G):= \Aut(\Aut(...\Aut(G)...)) $$

Some quick results:

  • For finitely-generated abelian groups, it isn't hard to see that this sequence eventually arrives at trivial group.
  • For $S_n$, $n\neq 2,6$, the group has no center and no outer automorphisms, and so the conjugation action provides an isomorphism $G\simeq \Aut(G)$.
  • Furthermore, I believe that if $G$ is a non-abelian finite simple group, then $\Aut(\Aut(G))\simeq \Aut(G)$, though this is based on hearsay.
  • If one considers topological automorphisms of topological groups, then $\Aut(\mathbb{R})\simeq \mathbb{Z}/2\mathbb{Z}\times \mathbb{R}$, and so $$\Aut(\Aut(\mathbb{R}))\simeq \Aut(\mathbb{Z}/2\mathbb{Z}\times \mathbb{R})\simeq\mathbb{Z}/2\mathbb{Z}\times \mathbb{R}.$$

When the sequence $\Aut^n(G)$ is constant for sufficiently large $n$, we will say the sequence stabilizes. Despite my best efforts, I have been unable to find a group $G$ such that the sequence $\Aut^n(G)$ is provably non-stabilizing. Is this possible?

A slightly deeper question is whether there are groups $G$ such that the sequence becomes periodic after some amount of time. That is, $\Aut^n(G)\simeq \Aut^{n+p}(G)$ for some $p$ and for $n$ large enough, but $\Aut^n(G)\not\simeq \Aut^{n+m}(G)$ for $m$ between 0 and $p$. A simple way to produce such an example would be to give two groups $G \neq H$ such that $\Aut(G)\simeq H$ and $\Aut(H)\simeq G$. Does anyone know an example of such a pair?

share|improve this question
2  
Funny - I was about to ask this question a week or so ago, but decided against it for some reason. –  Qiaochu Yuan Nov 15 '09 at 18:42
22  
I don't think the sequence eventually stabilizes to 0 for all finitely generated abelian groups, e.g. Aut(Z/2 \times Z/2) = S_3. –  Hunter Brooks Dec 22 '09 at 2:18
    
This is a beautiful result: "if G is a non-abelian finite simple group, then Aut(Aut(G))=Aut(G)." Does anyboday have a proof, hint of reference? –  Portland Feb 12 '10 at 15:21
    
Proved in Burnside's book, second edition, I forget the page number. –  Steve D Feb 12 '10 at 17:42
    
See my answer... –  Igor Rivin Apr 24 '12 at 3:40

7 Answers 7

up vote 97 down vote accepted

I remember that my old grad classmate from Berkeley, Joel Hamkins, worked on the transfinite version of this problem. The Automorphism Tower Problem, by Simon Thomas, is an entire book on this subject. The beginning of the book gives the example of the infinite dihedral group $D_\infty$, in the sense of $\mathbb{Z}/2 \ltimes \mathbb{Z}$. It says that the automorphism tower of this group has height $\omega+1$. It also treats Joel's theorem, which says that every automorphism tower does stabilize, transfinitely. A Proceedings paper with the same author and title says that Wielandt showed that every finite centerless group has a finite automorphism tower.


An improved answer: Simon's book later shows that the automorphism tower of the finite group $D_8$ has height $\omega+1$, and that for general finite groups no one even knows a good transfinite bound. (The $8$ may look like a typo for $\infty$, but it's not :-).) Apparently the centerless condition is essential in Wielandt's condition.

Also, to clarify what these references mean by the automorphism tower, they specifically use the direct limit of the conjugation homomorphisms $G \to \mbox{Aut}(G)$. $D_8$ is abstractly isomorphic to its automorphism group. This is a different version of the question that I suppose does not have a transfinite extension. Section 5 of Thomas' book implies that it's an open problem whether the tower terminates in this weaker sense, for finite groups.

Finally an arXiv link to Joel Hamkins' charming paper, Every group has a terminating transfinite automorphism tower.


As other people in this thread have pointed out, it's unsatisfying to make an automorphism tower that only stabilizes transfinitely as a direct limit, when all of the finite terms of the tower are abstractly isomorphic to the base group $G$. I Googled around a bit more and came back to the same two sources, Thomas' book, and this time a joint result of Hamkins and Thomas which is in chapter 8 of the book.

If an automorphism tower stabilizes after exactly $n \in \mathbb{N}$ steps in the direct limit sense, then it also stabilizes after exactly $n$ steps in the weaker abstract isomorphism sense. (Otherwise the direct limit "wouldn't know to stop".) Hamkins and Thomas do better than that. For any two ordinals $\alpha$ and $\beta$, which may or may not be finite numbers, they find one group $G$ whose automorphism tower has height $\alpha$ and $\beta$ in two different models of ZFC set theory. (Whether it's really the "same" group in different worlds is unclear to me, but their models are built to argue that it is so.) I would suppose that it is possible to make a tower without isomorphic terms by taking a product of these groups, even without the two-for-one property.

Other than one paper on the Grigorchuk group by Bartholdi and Sidki, I haven't found anything on automorphism towers of finitely generated groups. The Grigorchuk group has a countably infinite tower, but I'd have to learn more to know whether the terms are abstractly isomorphic.

share|improve this answer
    
Awesome! Do you know if these transfinite bounds are effective enough to prohibit the existence of periodic towers? –  Greg Muller Nov 15 '09 at 19:14
    
At this point I can't do any more than you can, namely read these papers. Just skimming at the book, it does discuss periodic automorphism towers, but I'm no longer sure where. –  Greg Kuperberg Nov 15 '09 at 19:31
14  
It may look like a typo, but it's not! –  Greg Kuperberg Nov 15 '09 at 19:54
4  
Thanks, Greg, for mentioning my theorem so nicely! In the result I proved with Simon, it really is set-theoretically the same group whose tower varies in height, since we change the height by going to a forcing extension of the universe. All sets in the former universe still exist in the larger univese, including the desired group. –  Joel David Hamkins Nov 20 '09 at 16:59
2  
Just as a more elementary answer to the question "can [elnarging the unierse by forcing] make two groups isomorphic that weren't isomorphic before?": many of the simplest forcings collapse cardinalities, i.e. make sets isomorphic that weren't so before. For instance, you can add a bijection $\omega \rightarrow \omega_1$ by using "injective finite partial functions" as forcing conditions. Then eg free abelian groups on these sets gives groups that become isomorphic. –  Peter LeFanu Lumsdaine Jun 20 '10 at 9:41

"if G is a non-abelian simple group, then Aut(Aut(G))=Aut(G)."

This is Theorem 7.14 (Page 162) of

Rotman, Joseph J. (1995), An introduction to the theory of groups, Berlin, New York: Springer-Verlag, ISBN 978-0-387-94285-8
© 1995 Springer-Verlag New York, Inc. ISBN 0-387-94285-8 Springer-Verlag New York Berlin Heidelberg ISBN 3-540-94285-8 Springer-Verlag Berlin Heidelberg New York

All the best,

Fernando.

share|improve this answer
    
Indeed, I have the extract in my answer. –  Igor Rivin Apr 24 '12 at 3:40

I don't know about non-stabilizing, but rigidity provides many examples that stabilize quickly.

1) Let π be the fundamental group of a finite volume hyperbolic manifold M of dimension ≥ 3 with no symmetries (that is, no nontrivial self-isometries). Negative curvature implies that π is centerless, so the map π -> Aut(π) is injective. Mostow-Prasad rigidity says that Out(π) = Isom(M), so the lack of isometries implies that Out(π) is trivial and Aut(π) = π. [This works verbatim for lattices in higher-rank semi-simple Lie groups subject to appropriate conditions.]

2) Let π=Fd be a free group of rank 2≤d<∞. Then Aut(F_n) is a much larger group; however, Dyer-Formanek showed that Out(Aut(F_n)) is trivial. Thus since Aut(F_n) is clearly centerless, we have Aut(Aut(F_n)) = Aut(F_n).

3) Interpolating between these two examples, if π=π1(Sg) is the fundamental group of a surface of genus g≥2, then Aut(π) is the so-called "punctured mapping class group" Modg,*, which is much bigger than π. Ivanov proved that Out(Modg,*) is trivial, and since Modg,* is again centerless, we have Aut(Aut(π1(Sg))) = Aut(π1(Sg)).

In each of these cases, rigidity in fact gives stronger statements: Let H and H' be finite index subgroups of G = Aut(Fn) or Modg,*. (This class of groups can be widened enormously, these are just some examples.) Then any isomorphism from H to H' comes from conjugation by an element of G, by Farb-Handel and Ivanov respectively. In particular, Aut(H) is the normalizer of H in G. Rigidity gives the same conclusion for H = π1(M) as in the first example and G = Isom(Hn) [which is roughly SO(n,1)]. It seems that by carefully controlling the normalizers, you could use this to construct examples that stabilize only after n steps, for arbitrary large n.


Edit: I find the examples of D8 and D unsatisfying because even though Inn(D) is a proper subgroup of Aut(D), we still have Aut(D) isomorphic to D. Here is a general recipe for building similarly liminal examples. Let G be an infinite group with no 2-torsion so that Aut(G) = G and H1(G;Z/2Z) = Z/2Z. (Edited: For example, by rigidity, any hyperbolic knot complement with no isometries has these properties; by Thurston, most knot complements are hyperbolic.) The condition on the 2-torsion implies that for any automorphism G x Z/2Z -> G x Z/2Z, the composition

G -> G x Z/2Z -> G x Z/2Z -> G

is an isomorphism. From this we see that Aut(G x Z/2Z) / G = H1(G;Z/2Z) = Z/2Z. By examination the extension is trivial, and thus Aut(G x Z/2Z) = G x Z/2Z. However, the image Inn(G x Z/2Z) is the proper subgroup G.

Comments: looking back, this feels very close to your original example of R x Z/2Z. Interesting that it's (seemingly) much harder to find group-theoretic conditions to force the behavior the way you want, while topologically it's easy.

Also, if you instead take G with H1(G;Z/2Z) having larger dimension, say H1(G;Z/2Z) = (Z/2Z)2, this blows up quickly. You get Aut(G x Z/2Z) = G x (Z/2Z)2, but then Aut(Aut(G x Z/2Z)) is the semidirect product of H1(G;Z/2Z2) = (Z/2Z)4 with Aut(G) x Aut(Z/2Z2) = G x GL(2,2). Already the next step seems very hard to figure out. However, if you had enough control over the finite quotients of G, perhaps you could show that the linear parts of these groups don't get "entangled" with the rest, so that the automorphism groups would act like a product of G x (Z/2Z)n with something else, with n going to infinity. If so, this could yield an example where the isomorphism types of the groups never stabilize.

share|improve this answer
2  
Laurent Bartholdi and Said Sidki compute the automorphism tower of the Grigorchuk group, which is centerless. In the direct limit sense, the tower has height omega+1. But I can't quickly see whether the terms in the tower are abstractly isomorphic. arxiv.org/abs/math.GR/0308127 –  Greg Kuperberg Nov 15 '09 at 22:38

I had a group theory course with Suzuki in 1993, and he proved that

  • if G is a non-abelian finite simple group, then Aut(Aut(G))=Aut(G).

I don't have that proof any longer, so this is still just hearsay, but with pedigree!

share|improve this answer
    
See my answer... –  Igor Rivin Apr 24 '12 at 3:40

For reference, note that the Wielandt Automorphism Tower Theorem states:

Let G be a finite group, and assume that Z(G) = 1. Write G1 = G, and for i > 1, Gi = Aut(Gi - 1). Then up to isomorphism, there are only finitely many different groups among the Gi.

In fact, I quote the above result from Martin Isaacs' Finite Group Theory; more precisely, the result can be found on page 278 in Chapter 9 of this publication. Isaacs discusses this result in the context of subnormality in some depth and proves it as well.

share|improve this answer
    
Its an excellent result, but it doesn't rule out the possibility of a finite cycle which is stable. –  Greg Muller Jul 12 '10 at 17:19
    
Greg, it does rule that out, since when the first group is centerless, you can prove inductively that all the groups are centerless, and so they must get larger unless you've reached a fixed point. –  Joel David Hamkins Aug 16 '11 at 14:30

It seems that $Aut(G)$ is complete for any simple (not necessarily finite) group. The proof of this is in Rotman's book, but it is very short.

share|improve this answer

I proved with Denis Osin in arXiv:math/0605553 that if G is a (word) hyperbolic group with property (T), then Aut(G) contains Inn(G)=G as a subgroup of finite index. So Aut(G) is hyperbolic and has (T), and we can iterate to get an automorphism tower in which each group is hyperbolic and has (T). A question I like (even though this seems idle curiosity) is whether this automorphism tower always stabilizes. I have no clue how to approach it.

share|improve this answer
5  
Hi Igor, There is lots of cool stuff in your paper with Denis, but the theorem you claim is originally due to Paulin in MR1105339 in 1991. He explicitly stated that if G is hyperbolic with Property (T) then Out(G) is finite as a corollary of his main theorem. –  Daniel Groves Nov 17 '09 at 2:10
1  
Thanks, Daniel! Of course you are right. –  Igor Belegradek Nov 17 '09 at 13:08

Your Answer

 
discard

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.