Search arXivSearch

arXiv · 2607.12160

$μ$-abstract elementary classes of modules

Abstract

We prove several new results in the theory of $μ$-AECs, focusing mainly on (almost) stability, with the primary objective of undertaking a systematic study of $μ$-AECs of $R$-modules. Our main results are the following. 1. We show that, under suitable syntactic assumptions, all tame $μ$-AECs of $R$-modules (where $R$ is a ring) are almost stable, and are stable if they additionally satisfy a strong amalgamation property. This extends the work of the second author and Shelah [49] to the setting of $μ$-AECs. 2. We then turn to applications to concrete $μ$-AECs of $R$-modules. Our main result in this direction is that $(R$-Mod$, \leq_{pp}^μ)$ has a stable independence relation and is a stable and tame $μ$-AEC, where $\leq_{pp}^μ$ denotes the $μ$-pure submodule relation. We also prove similar stability results for various classes of abelian groups, including the $\aleph_1$-AEC of torsion-free abelian groups with the balanced subgroup relation. Moreover, we prove the almost stability of all $μ$-AECs of modules of the form $(R$-Mod$, \preccurlyeq)$, where $\preccurlyeq$ refines the direct summand relation and satisfies a strong form of coherence. 3. Finally, we study $μ$-AECs of the form $(K, \leq_\oplus)$, where $K$ is a class of pure-injective $R$-modules (note that this is, in general, not an AEC), and use our results to show that, for many natural choices of $K$, the class $(K, \leq_\oplus)$ has a stable independence relation and is therefore stable and tame. We use these results to give a sufficient condition for abstract classes of modules of the form $(K, \leq_{pp})$ to be stable when $K$ is closed under pure-injective envelopes. This generalizes, by a substantially different proof, results of Mazari-Armida [45].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roberto Carnevale, Gianluca Paolini. 2026-07-13. $μ$-abstract elementary classes of modules. https://arxiv.org/abs/2607.12160

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