The automorphism tower of a centerless group (mostly) without choice
Itay Kaplan, Saharon Shelah
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''.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf