Representing a ring as the endomorphism ring of an abelian group

Mohsen Asgharzadeh; Mohammad Golshani; Saharon Shelah

Home/Archive/arXiv

arXiv · 2609.06577

Representing a ring as the endomorphism ring of an abelian group

Mohsen Asgharzadeh·Mohammad Golshani·Saharon Shelah

View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate Baer's realization problem for almost free abelian groups, focusing on the extent to which rings can be represented as endomorphism rings under strong freeness conditions. Building on earlier work that relied on additional set-theoretic principles such as the diamond or strong black boxes, we develop new methods that significantly weaken these assumptions. The main result is obtained in ZFC (assuming a mild cardinal arithmetic configuration): for a strong limit singular cardinal $μ$ with $μ^+ < 2^μ< 2^{μ^+}$, and for a wide class of cotorsion-free rings, we construct $μ^+$-free modules whose endomorphism rings are isomorphic to the given ring. This provides a substantial partial solution to a problem of Göbel and Trlifaj. The key innovation is the integration of $κ$-frame constructions with Shelah's Super Black Box, enabling a delicate diagonalization that eliminates nontrivial endomorphisms while preserving high degrees of freeness.

Explore related subjects

math.LO math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Mohsen Asgharzadeh, Mohammad Golshani, Saharon Shelah. 2026-09-06. Representing a ring as the endomorphism ring of an abelian group. https://arxiv.org/abs/2609.06577

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗