SearcharxivSearch

arXiv · 2303.03778

Anti-Classification Results for Rigidity Conditions in Abelian and Nilpotent Groups

Abstract

Relying on the techniques and ideas from our recent paper [13], we prove several anti-classification results for various rigidity conditions in countable abelian and nilpotent groups. We prove three main theorems: (1) the rigid abelian groups are complete co-analytic in the space of countable torsion-free abelian groups ($\mathrm{TFAB}_\omega$); (2) the Hopfian groups are complete co-analytic in $\mathrm{TFAB}_\omega$; (3) the co-Hopfian groups are complete co-analytic in the space of countable $2$-nilpotent groups. In combination with our result from [13, S5], which shows that the endo-rigid abelian groups are complete co-analytic in $\mathrm{TFAB}_\omega$, this shows that four major notions of rigidity from (abelian) group theory are as complex as possible as co-analytic problems. Further, the second and third theorem above solve two open questions of Thomas from [18], who asked this for the space of all countable groups. We leave open the question of whether the co-Hopfian mixed abelian groups are complete co-analytic in the space of countable abelian groups, but we reduce the problem to a concrete question on profinite groups, showing that if $G$ is a countable co-Hopfian abelian reduced group, then, for every prime number $p$, the torsion subgroup $\mathrm{Tor}_p(G)$ of $G$ is finite and $G$ embeds in the profinite group $ \prod_{p \in \mathbb{P}} \mathrm{Tor}_p(G)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Gianluca Paolini, Saharon Shelah. 2023-03-07. Anti-Classification Results for Rigidity Conditions in Abelian and Nilpotent Groups. https://arxiv.org/abs/2303.03778

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO