pith. sign in

arxiv: math/0606216 · v1 · submitted 2006-06-09 · 🧮 math.LO · math.GR

The automorphism tower of a centerless group (mostly) without choice

classification 🧮 math.LO math.GR
keywords alphaautomorphismtowercenterlesschoicedefinedeltagroup
0
0 comments X
read the original abstract

For a centerless group G, we can define its automorphism tower. We define G^{alpha} : G^0=G, G^{alpha +1}=Aut(G^alpha) and for limit ordinals G^delta=bigcup_{alpha < delta}G^alpha . Let tau_G be the ordinal when the sequence stabilizes. Thomas' celebrated theorem says tau_G<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 G^alpha, 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''.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.