SearcharxivSearch

arXiv · 2201.06634

Forcing a Basis into $\aleph_1$-Free Groups

Abstract

In this paper, we address the question of when a non-free $\aleph_1$-free group $H$ can be be free in a transitive cardinality-preserving model extension. Using the $\Gamma$-invariant, denoted $\Gamma(H)$, we present a necessary and sufficient condition resolving this question for $\aleph_1$-free groups of cardinality $\aleph_1$. Specifically, if $\Gamma(H) = [\aleph_1]$, then $H$ will be free in a transitive model extension if and only if $\aleph_1$ collapses, while for $\Gamma(H) \ne [\aleph_1]$ there exist cardinality-preserving forcings that will add a basis to $H$. In particular, for $\Gamma(H) \neq [\aleph_1]$, we provide a poset $(\mathcal P_{\rm pb}, \leq)$ of partial bases for adding a basis to $H$ without collapsing $\aleph_1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Bossaller, Daniel Herden, Alexandra V. Pasi. 2022-01-17. Forcing a Basis into $\aleph_1$-Free Groups. https://arxiv.org/abs/2201.06634

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