Search arXivSearch

arXiv · 2010.02918

Some stable non-elementary classes of modules

Abstract

Fisher [Fis75] and Baur [Bau75] showed independently in the seventies that if $T$ is a complete first-order theory extending the theory of modules, then the class of models of $T$ with pure embeddings is stable. In [Maz4, 2.12], it is asked if the same is true for any abstract elementary class $(K, \leq_p)$ such that $K$ is a class of modules and $\leq_p$ is the pure submodule relation. In this paper we give some instances where this is true: $\textbf{Theorem.}$ Assume $R$ is an associative ring with unity. Let $(K, \leq_p)$ be an AEC such that $K \subseteq R\text{-Mod}$ and $K$ is closed under finite direct sums, then: - If $K$ is closed under pure-injective envelopes, then $(K, \leq_p)$ is $λ$-stable for every $λ\geq LS(K)$ such that $λ^{|R| + \aleph_0}= λ$. - If $K$ is closed under pure submodules and pure epimorphic images, then $(K, \leq_p)$ is $λ$-stable for every $λ$ such that $λ^{|R| + \aleph_0}= λ$. - Assume $R$ is Von Neumann regular. If $K$ is closed under submodules and has arbitrarily large models, then $(K, \leq_p)$ is $λ$-stable for every $λ$ such that $λ^{|R| + \aleph_0}= λ$. As an application of these results we give new characterizations of noetherian rings, pure-semisimple rings, dedekind domains, and fields via superstability. Moreover, we show how these results can be used to show a link between being good in the stability hierarchy and being good in the axiomatizability hierarchy. Another application is the existence of universal models with respect to pure embeddings in several classes of modules. Among them, the class of flat modules and the class of injective torsion modules.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcos Mazari-Armida. 2021-07-09. Some stable non-elementary classes of modules. https://arxiv.org/abs/2010.02918

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