SearcharxivSearch

arXiv · 2607.12160

$\mu$-abstract elementary classes of modules

Abstract

We prove several new results in the theory of $\mu$-AECs, focusing mainly on (almost) stability, with the primary objective of undertaking a systematic study of $\mu$-AECs of $R$-modules. Our main results are the following. 1. We show that, under suitable syntactic assumptions, all tame $\mu$-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 $\mu$-AECs. 2. We then turn to applications to concrete $\mu$-AECs of $R$-modules. Our main result in this direction is that $(R$-Mod$, \leq_{pp}^\mu)$ has a stable independence relation and is a stable and tame $\mu$-AEC, where $\leq_{pp}^\mu$ denotes the $\mu$-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 $\mu$-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 $\mu$-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

BibTeXRIS

Roberto Carnevale, Gianluca Paolini. 2026-07-13. $\mu$-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

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