The automorphism tower of a centerless group (mostly) without choice
Abstract
For a centerless group G, we can define its automorphism tower. We define Galpha : G0=G, Galpha +1=Aut(Galpha) and for limit ordinals Gdelta=bigcupalpha < deltaGalpha . Let tauG be the ordinal when the sequence stabilizes. Thomas' celebrated theorem says tauG<2|G|)+ and more. If we consider Thomas' proof too set theoretical, we have here a shorter proof with little set theory. However, set theoretically we get a parallel theorem without the axiom of choice. We attach to every element in Galpha, the alpha-th member of the automorphism tower of G, a unique quantifier free type over G (whish is a set of words from G*< x>). This situation is generalized by defining ``(G,A) is a special pair''.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.