Search arXivSearch

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}_ω$); (2) the Hopfian groups are complete co-analytic in $\mathrm{TFAB}_ω$; (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}_ω$, 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

Explore connections, maps & timelines

BibTeXRIS

Gianluca Paolini, Saharon Shelah. 2023-12-05. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO