arXiv math/04051162004-05math.LOmath.GR

The height of the automorphism tower of a group

Saharon Shelah

英文摘要：

For a group G with trivial center there is a natural embedding of G into its automorphism group, so we can look at the latter as an extension of the group. So an increasing continuous sequence of groups, the automorphism tower, is defined, the height is the ordinal where this becomes fixed, arriving to a complete group. We first show that for any kappa=kappa^{aleph_0} there is a group of cardinality kappa with height>kappa^+ (improving the lower bound). Second we show that for many such kappa there is a group of height > 2^kappa, so proving that the upper bound essentially cannot be improved.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Every group has a terminating transfinite automorphism tower

The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group, and so on, iterating transfinitely. Each group maps canonically into the next using inner automorphisms, and so at limit stages one can take a direct limit and continue the iteration. The tower is said to terminate if a fixed point is reached, that is, if a group is reached which is isomorphic to its automorphism group by the natural map. This occurs if a complete group is reached, one which is centerless and has only inner automorphisms. Wielandt [1939] proved the classical…

1998-08-04math.GRmath.LO

How Tall is the Automorphism Tower of a Group?

The automorphism tower of a group is obtained by computing its automorphism group, the automorphism group of THAT group and so on, iterating transfinitely. Each group maps into the next using inner automorphisms and one takes a direct limit at limit stages. The question is whether the process ever terminates in a fixed point, a group which is isomorphic to its automorphism group by the natural map. In this talk I will prove that every group has a terminating automorphism tower. After this, I will discuss the set-theoretic aspects of the height of the automorphism tower of a group, and sketch m…

1998-08-21math.GRmath.LO

Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.

2007-02-26math.GRmath.LO

The automorphism tower problem revisited

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 will show that it is impossible to find an explicit better bound using ZFC.

2000-03-20math.GRmath.LO

长度为 $\kappa^+$ 的自同构塔

An automorphism tower of length $κ^+$

Technion - Israel Institute of Technology（以色列理工学院）；Hebrew University of Jerusalem（耶路撒冷希伯来大学）

本文构造了一个基数为 $\kappa$ 的无中心群，其自同构塔恰好在 $\kappa^+$ 步终止，解决了 Simon Thomas 提出的问题。

2026-09-14math.GRmath.LO

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

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 t…

2006-06-09math.GRmath.LO

更多相关论文收起更多论文

Automorphism towers and automorphism groups of fields without Choice

This paper can be viewed as a continuation of [KS09] that dealt with the automorphism tower problem without Choice. Here we deal with the inequation which connects the automorphism tower and the normalizer tower without Choice and introduce a new proof to a theorem of Fried and Kollár that any group can be represented as an automorphism group of a field. The proof uses a simple construction: working more in graph theory, and less in algebra.

2011-11-17math.LO

Infinitely generated free nilpotent groups: completeness of the automorphism groups

Baumslag conjectured in the 1970s that the automorphism tower of a finitely generated free nilpotent group must be very short. Let F_{n,c} denote a free nilpotent group of finite rank n at least two and of nilpotency class c at least two. In 1976 Dyer and Formanek proved that the automorphism group of F_{n,2} is even complete (and hence the height of the aumorphism tower of F_{n,2} is two) provided that n is not three; in the case when n=3, the height of the automorphism tower of F_{n,2} is three. The author proved in 2001 that the automorphism group of any infinitely generated free nilpotent …

2009-04-03math.GRmath.LO

Changing the heights of automorphism towers

If $G$ is a centreless group, then $τ(G)$ denotes the height of the automorphism tower of $G$. We prove that it is consistent that for every cardinal $λ$ and every ordinal $α< λ$, there exists a centreless group $G$ such that (a) $τ(G) = α$; and (b) if $β$ is any ordinal such that $1 \leq β< λ$, then there exists a notion of forcing $P$, which preserves cofinalities and cardinalities, such that $τ(G) = β$ in the corresponding generic extension $V^{P}$.

1997-03-13math.LO

Degrees of rigidity for Souslin trees

We investigate various strong notions of rigidity for Souslin trees, separating them under Diamond into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under Diamond that there is a group whose automorphism tower is highly malleable by forcing.

2006-02-22math.LO

Metastability and the Furstenberg-Zimmer Tower II: Polynomial and Multidimensional Szemeredi's Theorem

The Furstenberg-Zimmer structure theorem for $\mathbb{Z}^d$ actions says that every measure-preserving system can be decomposed into a tower of primitive extensions. Furstenberg and Katznelson used this analysis to prove the multidimensional Szemerédi's theorem, and Bergelson and Liebman further generalized to a polynomial Szemerédi's theorem. Beleznay and Foreman showed that, in general, this tower can have any countable height. Here we show that these proofs do not require the full height of this tower; we define a weaker combinatorial property which is sufficient for these proofs, and show …

2009-09-30math.DSmath.LO

Precipitous Towers of Normal Filters

We prove that every tower of normal filters of height $\gd$ ($\gd$ supercompact) is precipitous assuming that each normal filter in the tower is the club filter restricted to a stationary set. We give an example to show that this assumption is necessary. We also prove that every normal filter can be generically extended to a well-founded $V$-ultrafilter (assuming large cardinals).

1995-03-22math.LO