SearcharxivSearch

arXiv · math/0009089

Localizations of Groups

Abstract

A group homomorphism eta:A-> H is called a localization of A if every homomorphism phi:A-> H can be `extended uniquely' to a homomorphism Phi:H-> H in the sense that Phi eta = phi. This categorical concepts, obviously not depending on the notion of groups, extends classical localizations as known for rings and modules. Moreover this setting has interesting applications in homotopy theory. For localizations eta:A-> H of (almost) commutative structures A often H resembles properties of A, e.g. size or satisfying certain systems of equalities and non-equalities. Perhaps the best known example is that localizations of finite abelian groups are finite abelian groups. This is no longer the case if A is a finite (non-abelian) group. Libman showed that A_n-> SO_{n-1}(R) for a natural embedding of the alternating group A_n is a localization if n even and n >= 10 . Answering an immediate question by Dror Farjoun and assuming the generalized continuum hypothesis GCH we recently showed in math.LO/9912191 that any non-abelian finite simple has arbitrarily large localizations. In this paper we want to remove GCH so that the result becomes valid in ordinary set theory. At the same time we want to generalize the statement for a larger class of A 's.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rüdiger Göbel, Saharon Shelah. 2000-09-08. Localizations of Groups. https://arxiv.org/abs/math/0009089

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR