The automorphism tower problem revisited
If \(G\) is a group with trivial centre, then the group \(\operatorname{Inn}G\) of inner automorphisms is isomorphic to \(G\) and so \(G\) can be identified with \(\operatorname{Inn}G\) and is therefore a normal subgroup of \(\Aut G\). Now \(\Aut G\) has also trivial centre and is a subgroup of \(\Aut(\Aut G)\). Hence this gives the automorphism tower of \(G\) \[ G=G_0\trianglelefteq G_1\trianglelefteq G_2\trianglelefteq\cdots\trianglelefteq G_\alpha\trianglelefteq G_{\alpha+1}\trianglelefteq\cdots \] such that for each ordinal \(\alpha\) \(G_{\alpha+1}=\Aut G_\alpha\) and if \(\alpha\) is a limit ordinal, then \(G_\alpha=\bigcup_{\beta<\alpha}G_\beta\). The automorphism tower terminates if there is an ordinal such that \(G_{\alpha+1}=G_\alpha\). A classical result of \textit{H. Wielandt} [Math. Z. 45, 209-244 (1939; Zbl 0021.21003)] says that for a finite group the automorphism tower terminates after finitely many steps. This is not true in general for infinite groups and the problem was whether the automorphism tower terminates at all after finitely or countably or uncountably many steps. This problem was solved in full generality by \textit{S. Thomas} [Proc. Am. Math. Soc. 95, 166-168 (1985; Zbl 0575.20030)], who proved that the automorphism tower of an arbitrary centreless group eventually terminates; and that for each ordinal \(\alpha\) there exists a group whose automorphism tower terminates in exactly \(\alpha\) steps. The authors study the bound of the number of steps the automorphism tower terminates for a group of cardinality \(\kappa\). In their own words: It is well known that the automorphism towers of infinite centreless groups of cardinality \(\kappa\) terminate in less than \((2^\kappa)^+\) steps. But an easy counting argument shows that \((2^\kappa)^+\) is not the best possible bound. However, in this paper, we show that it is impossible to find an explicit better bound using ZFC. In the course of their study the authors introduce many terms and notations and prove many results which have their own significance. We mention only one: If \(\tau(G)\) is the least ordinal \(\alpha\) such that \(G_{\alpha+1}=G_\alpha\) for the centreless group \(G\), then for the infinite cardinal \(\kappa\) let \(\tau_\kappa\) be the least ordinal such that \(\tau(G)<\tau_\kappa\) for every centreless group of cardinality \(\kappa\). The authors prove that \(\tau_\kappa\) is increasing, i.e., if \(\omega\leq\theta<\kappa\), then \(\tau_\theta\leq\tau_\kappa\).
- The Automorphism Tower Problem
- The automorphism tower problem. II
- Changing the heights of automorphism towers
- Iteratively changing the heights of automorphism towers
- The automorphism tower problem for free periodic groups.
- The Automorphism Tower of a Free Group
- On the Automorphism Tower of a Černikov Group
- On the N-tower problem and related problems
- scientific article; zbMATH DE number 3878970
- Automorphism towers of extremal groups
- Automorphism towers of polycyclic groups
- First order theory of permutation groups
- scientific article; zbMATH DE number 3129391 (Why is no real title available?)
- scientific article; zbMATH DE number 3939563 (Why is no real title available?)
- scientific article; zbMATH DE number 3788909 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1390280 (Why is no real title available?)
- scientific article; zbMATH DE number 3204712 (Why is no real title available?)
- scientific article; zbMATH DE number 3372013 (Why is no real title available?)
- Set theory. An introduction to independence proofs
- Subgroups of Infinite Symmetric Groups
- The Automorphism Tower Problem
- The automorphism tower problem. II
- The automorphism tower of a centerless group without choice
- The automorphism tower problem. II
- Changing the heights of automorphism towers
- Towers, ladders and the B. B. Newman spelling theorem
- Free groups and automorphism groups of infinite structures
- Cardinal invariants distinguishing permutation groups
- Automorphism towers and automorphism groups of fields without choice.
- Special pairs and automorphisms of centreless groups.
- Changing the heights of automorphism towers by forcing with Souslin trees over L
- The Automorphism Tower Problem
- Every group has a terminating transfinite automorphism tower
- scientific article; zbMATH DE number 1827831 (Why is no real title available?)
- scientific article; zbMATH DE number 1827958 (Why is no real title available?)
- Polish algebras, shy from freedom.
- The automorphism tower of groups acting on rooted trees
- The automorphism tower of the Mennicke group M(-1,-1,-1)
This page was built for publication: The automorphism tower problem revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969247)