The lattice of abstract elementary classes of modulesThanks: Research of Marcos Mazari-Armida was partially supported by NSF grant DMS-2348881 and Simons Foundation grant MPS-TSM-00007597. Research of Gianluca Paolini was supported by project PRIN 2022 “Models, Sets and Classifications”, prot. 2022TECZJA, and by INdAM Project 2024 (Consolidator grant) “Groups, Crystals and Classifications”.
Abstract.
Let be a ring. We organize the abstract elementary classes whose underlying class is the class of all -modules and whose strong submodel relation lies between the submodule and direct summand relations into a lattice , ordered by reverse inclusion. We establish the basic lattice-theoretic properties of and investigate its two natural sublattices, below and above purity. Below purity, we isolate relations defined by first-order -formulas for which amalgamation, tameness, and stability hold. Above purity, we introduce relations defined by infinitary -formulas and prove a broad stability result. Specializing to abelian groups, we show that the lattice has the following properties: it has a strong submodel relation that is not positive syntactic, it contains an uncountable antichain and a strictly increasing proper-class-sized chain, and it has a broad region above purity where amalgamation fails.
Key words and phrases:
Abstract elementary classes; Modules; Stability; Amalgamation.2020 Mathematics Subject Classification
Primary: 03C48, 03C60; Secondary: 03C45, 16D90, 13L05, 20K27.Contents
1. Introduction
Abstract elementary classes (AECs for short) constitute the prominent model-theoretic framework used to study non-elementary classes of structures. These were introduced in the seventies by Shelah [26]. For many years the focus was on developing the abstract theory [1, 4, 30], but recently there has been significant activity on finding interactions and applications of AECs to module theory [3, 5, 18, 19, 21, 24]. This paper introduces a new kind of interaction between AECs and module theory which we expect will be very fruitful.
An abstract elementary class is a pair , where is a class of structures and is a partial order on , subject to a few natural axioms (see Definition 2.14). Two of the key axioms are that is closed under directed colimits and that every element of can be decomposed into small elements of . In this paper, will always be a class of modules over a fixed ring ; in most cases it will in fact be the class of all -modules.
Most of the interactions of AECs and module theory have taken place by fixing a class of modules and studying the AEC one obtains by letting the partial order on the class be the pure submodule relation11 1 is a pure submodule of if every finite system of -linear equations with the right-hand side in that is solvable in is already solvable in .. The choice of purity as the de facto partial order to study classes of modules is motivated both by the algebraic importance of purity [9, 10] and the first-order model-theoretic result of -quantifier elimination [22]. Nevertheless there is no deep reason why one should restrict to purity and recently interesting results for other partial orders have been obtained [7, 19, 20, 21].
In this paper, we fix the class of all modules and instead of studying the AEC one obtains by fixing the partial order to be purity (as it was done in [17]) or another partial order, we study all the possible partial orders that give an AEC on the class of all modules.
This new approach has two key benefits. The first is that it allows us to obtain results for a family of AECs instead of a single AEC. This lets us recover many results from the literature (see Remarks 4.18 and 4.42). The second, which we find to be the most significant, is that it allows us to uncover a new mathematical object , which is the main object of study of this paper. is the lattice of binary relations on the class of -modules such that the class of -modules equipped with is an abstract elementary class and lies between the submodule and direct summand relations, ordered by reverse inclusion (see Definition 3.1 and Corollary 3.5). Since the underlying class is fixed and only the strong submodel relation varies, measures how different algebraically natural notions of submodule change the model-theoretic behavior of the class of modules.
The results on the lattice are of two sorts. The first consists of isolating properties that allow us to show that a broad region of the lattice has or fails to have important model-theoretic properties. The second consists of proving lattice-theoretic results. These results depend heavily on the structure of the ring ; for instance, the lattice is trivial if is semisimple. Thus, in this paper we focus mostly on the case when .
We divide the study of the lattice into two natural sublattices: the sublattice below purity and the sublattice above purity . The techniques we employ to study mimic those used for purity, while the techniques we employ for are new. Regarding , it is worth noticing that even the existence of elements in strictly extending purity was not known before this work. We construct a plethora of elements in by using infinitary -formulas (see Definition 2.1).
The relations above purity, in , measure the extent to which solvability of infinite systems of linear equations in the ambient module is reflected in the submodule. The relation requires the two modules to agree on every weak infinitary -formula; equivalently, whenever a possibly infinite family of first-order -formulas over a finite tuple from the smaller module is realized by a finite tuple in the larger module, it is already realized in the smaller one. The relations and refine the same idea by controlling the size and the syntactic complexity of the admissible infinitary conjunctions (see Definition 4.22). This connects with the study of -s of modules initiated in [6]. The relations of -purity considered there, however, fail to give rise to s, so the relations , and introduced here take on particular interest as they are genuinely new.
The main model-theoretic properties studied in this paper are stability and the amalgamation property. Stability is one of the key dividing lines in model theory (see Definition 2.18); it was introduced for elementary classes in [25] and for AECs in [27]. We show that stability is pervasive in both and . In passing, we recall that it was an open problem whether there exists an unstable AEC of modules with respect to purity; this was answered in the positive in [21] (see also [13]).
Theorem 1.1.
The proofs of the above two results are very different. The first result is obtained by first syntactically characterizing (Galois or orbital) types (see Theorem 4.12) and then counting the number of types using similar tools to the classical tools from first-order model theory. The second result uses in a key way the pushout construction and a local character-like result (see Claim 1 of Theorem 4.38).
Amalgamation is a classical assumption on AECs (see Definition 2.16). This is the case because amalgamation is seen as a weak consequence of the compactness theorem, and because it is expected to follow from categoricity in a tail of cardinals [11, Conjecture 2.3]. We show that amalgamation holds often in , but often fails in when .
Theorem 1.2.
The proofs of the above two results rely heavily on the pushout construction. The second result once again suggests [19, 29] that amalgamation is not as pervasive as commonly assumed. Furthermore, the second result shows that the model-theoretic behavior of the class of modules for a relation above purity is distinct from that for purity.
We obtain a couple of basic lattice-theoretic properties for for an arbitrary ring (see Section 3.1). As mentioned earlier, since depends so heavily on the ring-theoretic properties of , in this paper we focus on the case when . The results for use classical tools from abelian group theory such as the notion of isotype subgroup.
Theorem 1.3.
We encourage the reader to look at Appendix A where we give a depiction of .
Finally, a surprising result is that there is a relation below purity such that cannot be characterized by infinitary -formulas (see Theorem 5.5). This result is important as it shows that the study of is not simply the study of binary relations generated by infinitary -formulas.
Taken together, these results reveal a global contrast: stability is widespread both below and above purity, while amalgamation fails on a broad region above purity, and already for abelian groups the resulting lattice is a proper class.
The paper is divided into five sections. Section 2 has some preliminaries and basic results, including an introduction to infinitary -formulas. Section 3 introduces the main object of study of this paper and presents some of its basic lattice-theoretic properties. Section 4 has important model-theoretic results for broad regions of the sublattices and . Section 5 contains several results on .
2. Preliminaries and basic results
In this section, we present a quick introduction to both the model theory of modules and abstract elementary classes.
2.1. Model theory of modules
All rings considered in this paper are associative with identity, and all modules are left -modules unless stated otherwise. For a fixed ring , we denote the class of -modules by . For , we write if is a submodule of , and if is a direct summand of . We write for the cardinality of the ring .
Throughout this subsection, is a fixed ring. The language of -modules is where for each , the symbol is interpreted as scalar multiplication by .
Following [28, Definition 2.2], we introduce infinitary -formulas.
Definition 2.1.
Let be infinite cardinals. For every ordinal , we define by induction on a set of formulas in with as follows:
- (1)
For , we define as the set of all equations of the form
with and for only finitely many .
- (2)
For a limit ordinal, we define .
- (3)
For , we define as the set of formulas of the form
for some 22 2 We allow . and some with .
Remark 2.2.
We are primarily interested in the case when .
Definition 2.3.
- (1)
We define .
- (2)
We define .
- (3)
We define .
- (4)
We define .
We say that are equivalent (or, more precisely, equivalent relative to the theory of -modules) if, for every -module and every , we have if and only if .
Definition 2.4.
is a first-order positive primitive formula (a -formula, for short) if it is a first-order formula in the language of -modules and is equivalent to a formula in .
We say that is a pure submodule of , denoted by , if and, for every first-order -formula and every , we have if and only if . Equivalently, every finite system of -linear equations with right-hand side in that is solvable in is already solvable in .
The following two results study the syntactic structure of infinitary -formulas.
Proposition 2.5.
Let , where , is a cardinal, and is an ordinal. Then is equivalent, relative to the theory of -modules, to a formula of the form
with 33 3 If is regular, then ., , and, for every ,
with and for each , for only finitely many . In particular, is equivalent to a formula in .
Proof.
The final assertion follows directly from the main statement. We prove by induction on that the conclusion holds for every natural number and every .
If or is a limit ordinal, there is nothing to prove. Assume that . Then
for some and some with . By the induction hypothesis, each is equivalent to
where and
with and for each , for only finitely many . After making the tuples pairwise disjoint by tagging them with as and setting , we obtain the required equivalent formula
∎
Proposition 2.6.
Let , where , is a cardinal, and is an ordinal. If is regular, then is equivalent, relative to the theory of -modules, to a formula in . If is singular, then it is equivalent to a formula in .
Proof.
We prove the regular case; the singular case is analogous. We show by induction on that every is equivalent to a formula in .
If or is a limit ordinal, there is nothing to prove. Assume that . Then
for some and some with . By the induction hypothesis, each is equivalent to a formula . Choose such that , and let , using the regularity of . Then
and this formula is equivalent to . ∎
Remark 2.7.
The following result will be very useful.
Proposition 2.8.
Let be cardinals, let and be ordinals, and let .
- (1)
If for and is an -homomorphism, then .
- (2)
The set is a subgroup of .
Proof.
We prove (1); the proof of (2) is analogous. Let be an -homomorphism. We show by induction on that, for every ordinal and every , if for , then .
If , the result is clear because is a linear equation; if is a limit ordinal, it follows immediately from the induction hypothesis. Assume that and
for some and some with . Choose such that By the induction hypothesis, for every . Hence . ∎
Definition 2.9.
Given , let be the binary relation given in by if and only if and for every and every , if and only if .
Corollary 2.10.
Assume . If , then .
Proof.
Since , there is an -homomorphism such that . The result now follows from Proposition 2.8. ∎
The following classical construction from module theory will be useful.
Remark 2.11.
The pushout of a pair of inclusions and in the category of -modules is a triple
with , and .
Observe that are monomorphisms. Moreover, whenever and are -homomorphisms satisfying , the unique -homomorphism such that and is given by .
2.2. Abstract elementary classes
Abstract elementary classes (AECs) were introduced by Shelah in the seventies [26]. We quickly introduce the notions of AECs used in this paper. For more details, see [1, §§4–8].
The following definition is due to Grossberg.
Definition 2.12.
Let be a class of -structures and let be a binary relation on . We say that is an abstract class if the following conditions are satisfied:
- (1)
and are closed under isomorphisms, i.e., if and is an isomorphism then and if is such that then ;
- (2)
if , then is an -submodel of (written );
- (3)
the relation is a partial order on .
Definition 2.13.
Let be an abstract class, and let . An embedding is a strong embedding (or -embedding) if .
Definition 2.14.
Let be a class of -structures and let be a binary relation on . We say that is an abstract elementary class (AEC) if it is an abstract class, that is, if it satisfies Definition 2.12(1)–(3), and the following additional conditions hold:
- (4)
Tarski–Vaught axioms: If is an increasing continuous -chain of structures in for a limit ordinal, then:
- (4.1)
;
- (4.2)
for each , ;
- (4.3)
Smoothness axiom: if for all , then .
- (4.1)
- (5)
Coherence axiom: If , , and , then ;
- (6)
Löwenheim–Skolem–Tarski axiom: There is a cardinal such that, whenever and , there is with and . The Löwenheim–Skolem number of , denoted by , is the least such cardinal .
When is an AEC, we refer to as a strong submodel relation on the class .
Remark 2.15.
In this paper, is always the language of -modules, and is usually the class of all -modules.
Throughout the rest of this subsection, is an AEC.
Definition 2.16.
has
-
the amalgamation property if every span in can be completed to a commutative square of strong embeddings;
-
the joint embedding property if any two models in strongly embed into a third model in ;
-
no maximal models if every model in has a proper strong extension in .
For , let .
Definition 2.17.
Let , , and be a sequence from . The (orbital or Galois) type of over in , denoted by , is the equivalence class of modulo , where is the transitive closure of the relation defined as follows.
For , , , and , we set
if and there are and strong embeddings , for , such that and .
Stability is a key model-theoretic dividing line that we study in this paper.
Definition 2.18.
- (1)
If , let
- (2)
Let . We say that is -stable if for every .
- (3)
is stable if it is -stable for unboundedly many cardinals .
Given and , let . The following notion was isolated in [12].
Definition 2.19.
is -tame if, for every and , if , then there is a finite subset of such that .
3. The lattice structure of
The main object of this paper is the following lattice.
Definition 3.1.
Let be a ring and let be a cardinal. Define to be the partially ordered class44 4 Corollary 3.5 shows that it is a lattice. of all binary relations on such that is an AEC, , and refines the direct-summand relation. We order by reverse inclusion.55 5 Thus stronger strong submodel relations lie higher in the lattice. Let
In this section, we establish basic properties of the lattices and .
3.1. Basic results
Before we proceed it is important to notice that the structure of and depends strongly on the ring . For instance, if is left semisimple, then and consists only of the submodule relation.
Proposition 3.2.
Let be a cardinal.
- (1)
If , then .
- (2)
If for some cardinal , then .
Proof.
We first prove (1). It is straightforward to verify all the AEC axioms for except the Löwenheim–Skolem–Tarski axiom. Let , and set .
We recursively construct inside , starting with , so that:
- (1)
and for every and ;
- (2)
is an increasing -chain for every ;
- (3)
whenever and ;
- (4)
for every .
The construction follows by recursion on , using the Löwenheim–Skolem–Tarski axiom in each inside and then the Coherence axiom.
Let . Then and by Condition (1). Fix . Conditions (3) and (4) give , so Conditions (1) and (2) and the Tarski–Vaught axioms imply that . Thus .
We now prove (2). The same construction works after replacing in Condition (1) by the size bound Consequently, we have
and hence . ∎
Proposition 3.3.
Let be a cardinal and be a cardinal (possibly finite).
- (1)
If , then this family has a greatest lower bound in .
- (2)
If , then this family has a greatest lower bound in .
Proof.
We prove (1); the proof of (2) is identical. Let
The set is nonempty because the submodule relation belongs to it. It is straightforward to verify all the AEC axioms for except the Löwenheim–Skolem–Tarski axiom. Let . Applying the Löwenheim–Skolem–Tarski axiom to in inside , there is such that and . Since for every , we have . Hence , and it is straightforward to show that it is the greatest lower bound of the family.
For (2), define inside and use in place of . ∎
Remark 3.4.
In general, the relation from Proposition 3.3 differs from . For example, let . Define by requiring that divisibility by of elements of be preserved between and , and define analogously using divisibility by . because fails to be an AEC since transitivity fails as witnessed by .
Corollary 3.5.
For every ring and every cardinal , and are lattices whose bottom element is the submodule relation.
Proof.
The following result relies heavily on [2, Fact 3.1.1].
Lemma 3.6.
For every ring and every cardinal , .
Proof.
It is enough to show that is such that as .
Let be the expansion of by . For each , the proof of Shelah’s Presentation Theorem yields a complete first-order -theory and a set of -types satisfying Conditions (1)–(3) of [2, Fact 3.1.1].
Let given by . There are at most possible -theories and at most possible sets of -types, so it suffices to prove that is injective.
Suppose and . By Condition (1) of [2, Fact 3.1.1], choose with . By Condition (3) of [2, Fact 3.1.1], extend to such that as -structures and . The equality of the two presentation pairs and another application of Condition (3) of [2, Fact 3.1.1], now for , give . Thus ; the reverse inclusion can be shown analogously. ∎
Proposition 3.7.
If , then has no maximal models and the joint embedding property.
Proof.
This follows by taking direct sums, since every direct-summand embedding is a -embedding. ∎
3.2. When is ?
We now characterize the rings for which , equivalently, those for which is an AEC. The following proposition is immediate, so we omit its proof.
Proposition 3.8.
Let be an -module, let be a limit ordinal, and let be a family of submodules of . If is direct for every , then is direct.
Lemma 3.9.
Assume that is an AEC with . Then every -module admits a decomposition for some family of submodules of , each of cardinality at most .
Proof.
Let , and fix an enumeration of .
We recursively construct a sequence of submodules of , each of cardinality at most , such that for every :
- (1)
the sum is direct;
- (2)
is a direct summand of ;
- (3)
.
For , apply the Löwenheim–Skolem–Tarski axiom to inside to obtain a direct summand of cardinality at most containing .
Suppose . By induction hypothesis, we have that with Let be the projection given by the decomposition. Applying the Löwenheim–Skolem–Tarski axiom inside to , choose a direct summand of containing and satisfying . Then has the required properties.
Suppose that is a limit ordinal. By induction hypothesis, for any , the sum is direct and is a direct summand of . Now, by Proposition 3.8 we have that the sum is direct, and moreover:
Thus, by smoothness, this union is a direct summand of . We may therefore proceed exactly as in the successor case to choose .
Finally, Conditions (1) and (3), together with Proposition 3.8, yield . Taking completes the proof. ∎
Fact 3.10 ([23, Theorem 4.5.7]).
Let be a ring. The following are equivalent:
- (1)
is left pure semisimple, i.e., ;
- (2)
There is a cardinal such that every left -module is a direct sum of modules of cardinality less than .
Theorem 3.11.
Let be a ring. is an AEC if and only if is left pure semisimple.
Proof.
If , then has a top element. This leaves open the following natural question.
Question 3.12.
Does the lattice have a top element for every ring ? If the answer is negative, characterize the rings for which has a top element.
4. The sublattices and
We study the lattice by dividing it into two natural sublattices: the one below purity and the one above purity.
4.1. The sublattice
We first study the sublattice given by the strong submodel relations on which are weaker than the pure submodule relation.
Definition 4.1.
Given a ring , let be the sublattice of below the pure submodule relation.
The structure of again depends strongly on . For instance, if is von Neumann regular, then purity coincides with the submodule relation [23, 2.3.22], so has a single element. In this section, we show that, in general, contains many well-behaved relations. In Section 5.1, we further investigate .
Remark 4.2.
If lies below , then , because . Thus, when studying the sublattice below , restricting from to for any cardinal does not change the class of relations.
Proposition 4.3.
is a lattice with bottom element given by and top element given by . Moreover, .
Proposition 4.4.
If is a set of first-order -formulas, then .
Proof.
This follows directly from the syntactic form of -formulas and the first-order downward Löwenheim–Skolem theorem. ∎
Example 4.5.
The following binary relations are in :
- (1)
is a submodule of .
- (2)
is a pure submodule of .
- (3)
is an RD-submodule of , i.e, and for every , . We denote it by .
Definition 4.6.
A set of first-order -formulas is pleasant if:
- (1)
every has the form
with , , , and ;
- (2)
if , then for .
A binary relation on is pleasant with respect to if is pleasant and . We say is pleasant if it is pleasant with respect to some such .
Example 4.7.
- (1)
The submodule relation is pleasant with respect to .
- (2)
The RD-submodule relation is pleasant with respect to
- (3)
The pure submodule relation is pleasant with respect to
Remark 4.8.
Every pleasant relation belongs to by Proposition 4.4.
Lemma 4.9.
If is pleasant, then has the amalgamation property.
Proof.
Let , and form the pushout with maps as in Remark 2.11.
Choose a pleasant set such that . The maps and are monomorphisms, so it remains to show that the formulas in are reflected. We verify this for ; the proof for is analogous.
Suppose where and . Choose witnessing this formula. Then there is such that
As is pleasant, . Since , there is such that . So . Adding the last two equations in we have that . Therefore, by Proposition 2.8. Hence . ∎
Definition 4.10.
Let be a set of -formulas, let , and let . Define to be
If is the set of all -formulas, we write .
Remark 4.11.
The formulas on the second line and third line of the previous definition are themselves first-order pp-formulas. Therefore, when is the set of all pp-formulas, the last two lines do not add any additional information.
Theorem 4.12.
Assume that is pleasant with respect to , and let . The following are equivalent:
- (1)
;
- (2)
.
Proof.
Suppose that . By Lemma 4.9, equality of types may be witnessed in a common extension, so there are and a -embedding such that , and . Since , the formulas from the first line in the definition of agree for and . Since is a monomorphism, the same is true of the equations in the second line.
Suppose now that and that . Proposition 2.8 gives Condition (2) of being pleasant and , imply that the latter formula already holds in . Thus every formula in belongs to ; the reverse inclusion is analogous.
Conversely, suppose that . Let with . Let be the cyclic submodule generated by in . Let and define and Then and . We prove that is a -embedding; the proof for is analogous.
First, we show that is a monormophism. If , then there are and such that
Thus and hence . Therefore , and the first displayed equality gives .
It remains to show that . Suppose where and . Choose witnessing the formula. Then there are and such that
Hence . Choose such that Adding the last two equations in we have that Therefore, by Proposition 2.8. Hence .∎
Remark 4.13.
The preceding syntactic characterization of types yields tameness.
Corollary 4.15.
If is pleasant, then is -tame.
Furthermore, we use Theorem 4.12 to obtain a direct proof of stability.
Proposition 4.16.
If is a left -module, then
where
Proof.
Fix a well-ordering of , let , and let be the set of all -formulas of the form .
Let be given by where for , let be the least tuple such that , if such a tuple exists, and let otherwise.
We show that is injective. Suppose It suffices to prove one inclusion. Let , and write . Then Since and the previous formula is a first-order -formula, As solution sets of -formulas are cosets [22, Corollary 2.2], hence . Since , , and therefore .
Finally, as is a set of first-order formulas, which gives the stated bound. ∎
Lemma 4.17.
Assume that is pleasant. If , then is -stable.
Proof.
Let and be pleasant with respect to . Suppose, toward a contradiction, that is a family of distinct types in . By amalgamation, we may assume that all the types are realized in the same module .
Remark 4.18.
4.2. The sublattice
We now study the sublattice given by the strong submodel relations on which are stronger than the pure submodule relation.
Definition 4.20.
Given a ring , let be the sublattice of above the pure submodule relation.
The structure of again depends strongly on the ring . For instance, if is left pure semisimple, then purity coincides with the direct summand relation [23, Theorem 4.5.7], so has a single element. In this section, we exhibit points of and show that many of them have good stability-theoretic behavior. In Sections 5.2 and 5.3, we further investigate .
Proposition 4.21.
is a lattice with bottom element given by
Our main tool for finding new points in is the use of infinitary -formulas.
Definition 4.22.
Let be infinite cardinals, let be an ordinal, and let . We say that is -pure in , denoted by , if . Equivalently, and, for every and every ,
When , we write instead of .
Similarly, we write if . When , we write instead of .
Proposition 4.23.
- (1)
if and only if if and only if .
- (2)
For every regular cardinal , if and only if .
- (3)
For every singular cardinal , if and only if .
Remark 4.24.
For a cardinal , let if is a limit cardinal, and let if .
Lemma 4.25.
For every cardinal and every ordinal , is an AEC and
Moreover, is an AEC and
Proof.
The moreover part follows from Proposition 4.23(2) and (3), so it is enough to prove the main assertion. Fix a cardinal and an ordinal . It is clear that is an abstract class. We verify Conditions (4)–(6) of Definition 2.14.
- (4)
Let be an increasing continuous -chain, and let . Condition (4.1) is clear. We prove Condition (4.2); the proof of Condition (4.3) is similar.
We show by induction on that, for every , every , and every , if and only if
If , the assertion follows because every formula in is a linear equation. If is a limit ordinal, the assertion follows directly from the induction hypothesis. Suppose that , fix , let , and let .
By Proposition 2.8, implies . Conversely, suppose that . Then
for some and some with . Choose a finite tuple such that There is such that . By the induction hypothesis, so . Since , we conclude that .
- (5)
Coherence is immediate.
- (6)
Since , the downward Löwenheim–Skolem theorem for yields the desired inequality (se for example [16, Theorem 1.23]).
∎
We next introduce a point of that admits both an infinitary -characterization and an algebraic characterization. In Section 5.3, we show that, over , it acts as a dividing point for the amalgamation property.
Definition 4.26.
A weak infinitary -formula is a formula of the form
with , is a cardinal, and each is a first-order -formula. We denote the set of all weak -formulas by .
For , we define if and only if . Equivalently, and, for every and every ,
Remark 4.27.
Suppose that there is a finitely generated -module which is not pure injective. Then is strictly stronger than .
Indeed, let be the pure injective envelope of and fix a finite generating tuple for . We have that and . Since is not pure-injective, there is a -type over which is finitely satisfiable in but not realized in (see for example [22, Theorem 2.8]). As every parameter from is an -linear combination of , we may write this type as . Since is pure-injective, is realized in . Hence
The displayed formula is a weak infinitary -formula, so .
In particular, the hypothesis holds for , taking .
Remark 4.28.
There are at most first-order -formulas in a finite number of variables . Hence every is equivalent, modulo the theory of -modules, to a formula in . In particular, and refines the direct summand relation.
Lemma 4.29.
The class is an AEC with
We use the following definition from [31].
Definition 4.30.
Let and be modules, and let . A function is a --homomorphism if, for every first-order -formula and every ,
Lemma 4.31.
Let . The following are equivalent:
- (1)
.
- (2)
and, for every and , there is a --homomorphism whose domain contains the entries of , such that and .
Proof.
Suppose first that . Fix and , and let . Then and hence Since , there is such that The function on the entries of that fixes and sends to is therefore a --homomorphism.
Conversely, let
let , and suppose that . Choose such that By assumption, there is a --homomorphism that fixes and sends into . Thus so . The reverse implication follows from Proposition 2.8, and hence . ∎
We now show that stability is pervasive in . This contrasts with amalgamation, which, as we will show in Section 5.3, often fails.
Definition 4.32.
A set , where is an infinite cardinal with , is E-nice if every has the form
with , and
with and for each , for only finitely many .
A binary relation on is E-nice with respect to if is E-nice and . We say is E-nice if it is E-nice with respect to some such .
Remark 4.33.
-
It is important to note that if is E-nice, we do not necessarily have that .
-
If is E-nice, then by the syntactic structure of the formulas in .
Lemma 4.34.
If then is E-nice.
Proof.
Definition 4.35.
Suppose that
with , and
with and for each , for only finitely many .
Let be the formula
with , , and
Proposition 4.36.
Assume that is E-nice with respect to and that is an AEC with . If , with , and , then if and only if
Proof.
The forward implication follows from Proposition 2.8. Conversely, suppose that . Then . Since , , and , we have that . Hence . ∎
If , let denote the submodule of generated by . Thus
Remark 4.37.
Assume that is E-nice with respect to and that is an AEC with . Suppose that , that , and that . Then there are , with , and such that
Writing , with and , we obtain
Theorem 4.38.
Assume that is E-nice. If satisfies the following conditions:
- (1)
is an AEC;
- (2)
is closed under -submodules, i.e., if and , then .
Then is stable.
Proof.
Let E-nice for a cardinal such that . A standard witness closing construction, using that from Remark 4.33 and the closure of under submodules, gives .
We prove the theorem through three claims.
Claim 1. If and , where , then there is such that
- (a)
and ;
- (b)
;
- (c)
.
Proof of Claim 1. Suppose, toward a contradiction, that no such exists. In particular, , since otherwise one could take .
We recursively construct an increasing continuous -chain in , formulas in , and tuples , so that for every :
- (1)
;
- (2)
and ;
- (3)
and ;
- (4)
and .
The construction follows from the Löwenheim–Skolem–Tarski axiom and Remark 4.37. At a successor step, we make sure has the at most witnesses for the existential quantifiers in . It is in this construction where we use in a key way the assumption that is closed under submodules.
Let be the set of limit ordinals below . For each , let be least such that ; such an exists because is finite and the chain is continuous. By Fodor’s lemma, there are a stationary set and an ordinal such that for every .
Let given by . The map has range of cardinality at most by Remark 4.33. Hence, it follows from the pigeonhole principle that there are a set of cardinality , a formula , and a tuple such that and for every .
Choose both in . By Condition (4),
Since , Proposition 2.8(1) gives By Proposition 2.8(2), and hence . Since , Proposition 4.36 yields Combining this with and applying Proposition 2.8(1) and (2), we obtain Because as is a limit ordinal, Proposition 2.8(1) implies contradicting Condition (5). This proves Claim 1.
Claim 2. Suppose that and , with and . Let and satisfy Conditions (a)–(c) of Claim 1 for and , respectively. If and there is an isomorphism such that
then
Proof of Claim 2. Let be the pusout and be the map given by the universal mapping property, i.e., .
The map is an epimorphism, we show it is a monomorphism. If , then , and therefore . Thus is an isomorphism. Its inverse is given by
Similarly, the map given by , is an isomorphism.
Let given by This is well defined because and is the identity on this common submodule. Its inverse is induced by , so is an isomorphism. Consequently,
is an isomorphism satisfying and .
Since is closed under submodules, both . So .
Moreover, Condition (c) of Claim 1 gives and Thus
which proves Claim 2.
Claim 3. If , then is -stable.
Proof of Claim 3. Let . Suppose, toward a contradiction, that is a family of distinct types in . For each , choose satisfying Conditions (a)–(c) of Claim 1 for .
Since there are at most subsets of of cardinality at most , by the pigeonhole principle there are a set of cardinality and a set , with , such that for every . Fix an enumeration , where .
Expand the language of -modules by constants and . Let be the set of isomorphism types of structures where , , , and for every . Then For , assign to the isomorphism type of By the pigeonhole principle, there are distinct and an isomorphism
Thus , and fixes pointwise. Claim 2 gives , a contradiction. This proves Claim 3.
For every cardinal , the cardinal satisfies . Hence Claim 3 yields stability in unboundedly many cardinals, and is stable. ∎
Corollary 4.39.
If then is stable.
We can strengthen Corollary 4.39 as follows.
Corollary 4.40.
Let be a set. If , then is stable.
Proof.
Corollary 4.41.
If is a set of first-order -formulas, then is a stable AEC.
Remark 4.42.
Theorem 4.38 also yields stability for other interesting AECs of modules. For example, it applies to the class of torsion abelian groups with pure embeddings and to the class of torsion-free abelian groups with pure embeddings, because both underlying classes are closed under submodules. These results were first obtained in [18, Lemma 3.5] and [3, Theorem 0.3] respectively.
5. The lattice over
In this section, we study the lattice . The first subsection concerns ; the second establishes that is a proper class; and the third investigates the failure of amalgamation.
5.1. The sublattice
We begin with two elementary order-theoretic observations.
Lemma 5.1.
There is an uncountable antichain in .
Proof.
Let be an almost disjoint family of infinite subsets of the set of prime numbers such that . Thus every is countably infinite, while is finite whenever are distinct. Such a family exists by for example [14, Lemma 9.21].
For , let if and only if and for every , . For every , we have that is pleasant with respect to . Hence and is -tame and stable.
We show that is an antichain. Let be distinct. Since and are infinite and is finite, neither is contained in the other. We prove that ; the reverse non-inclusion is analogous.
Choose , and let and . Clearly . To see that , fix and . Then there is such that , so . Since , it follows that in . Thus , and therefore . ∎
The following natural question remains open.
Question 5.2.
Is there an antichain of cardinality in ? This is the largest possible cardinality, since by Proposition 4.3.
Proposition 5.3.
There is a countable strictly increasing chain in .
Proof.
Fix a prime . For , define if and only if and for every . The relation is pleasant with respect to and hence . The relations form a strictly increasing chain in . ∎
It is likewise open whether contains an uncountable strictly increasing chain.
We next show that not all the strong submodel relations in are of the syntactic form so far considered in this paper.
Definition 5.4.
A binary relation on is positive syntactic with respect to if and . We say is positive syntactic if it is positive syntactic with respect to some such .
Pleasant and E-nice relations are positive syntactic. Thus every relation introduced so far is positive syntactic. The next theorem shows that this need not hold for an arbitrary element of .
Theorem 5.5.
There is a relation that is not positive syntactic.
Proof.
For , define if and only if and, for every element of infinite order and every integer , if and only if It is straightforward to verify that is an AEC and that lies below in .
Suppose, toward a contradiction, that for some . Fix a prime , let , and let . Since has no elements of infinite order, , and therefore . By applying Proposition 2.8 to the canonical inclusions and projections and adding, we obtain Hence .
The element has infinite order. It is divisible by in , but it is not divisible by in . This contradicts that ∎
Remark 5.6.
The relation from Theorem 5.5 does not have the amalgamation property. The span
cannot be completed to a commutative square of strong embeddings. We do not know whether is stable.
5.2. is a proper class
We recall several classical notions from abelian group theory.
Definition 5.7 ([9, p. 299]).
Let and let be a prime. For every ordinal , define by induction as follows:
- (1)
;
- (2)
;
- (3)
if is a limit ordinal, then .
Definition 5.8 ([9, p. 386]).
Let be an ordinal and let be a prime. For , we say that is -isotype in , denoted by , if and for every .
Proposition 5.9.
Let be an ordinal and let be a prime. The relation is E-nice with respect to a set
Moreover, , and refines the direct summand relation.
Proof.
We recursively define formulas for .
Let .
If , let
If is a limit ordinal, let
Put . Then if and only if
For every , . Proposition 2.5 therefore gives an E-nice formula equivalent to for every . Hence , so is E-nice.
The moreover part follows because each . The final assertion follows from Corollary 2.10. ∎
Lemma 5.10.
Let be an ordinal and let be a prime. Then is an AEC with
Proof.
It is clear that is an abstract class. Transitivity follows from Proposition 5.9, or directly from [9, p. 365, Condition (b)]. We verify Conditions (4)–(6) of Definition 2.14.
- (4)
Let be an increasing continuous -chain, and let . Condition (4.1) is clear, and Condition (4.2) is [9, p. 365, Condition (c)]. To verify Condition (4.3), suppose that for every . Fix . The inclusion is clear. Conversely, if , choose with . Then Thus .
- (5)
- (6)
Let , and let . Let be the E-nice set given by Proposition 5.9. We construct an increasing chain of submodules of . Set . Having defined , for every and such that , choose in a tuple of witnesses for the existential quantifiers of , and let be the submodule generated by together with all these witnesses. At each stage, at most tuples, each of length at most , are added. Hence for every .
∎
Corollary 5.11.
For every ordinal and every prime , the AEC is stable.
Recall that the -length of a -module , denoted by , is the least ordinal such that .
Proposition 5.12.
Let be a prime. If is an infinite cardinal, then .
Proof.
Lemma 5.10 gives . Suppose, toward a contradiction, that .
By [9, Theorem 10.1.6], there is a -group of -length . Choose . The Löwenheim–Skolem–Tarski axiom yields such that and . By cardinality considerations, . On the other hand, . Indeed, if for some , then an easy induction gives that . This is impossible, since but as . This contradiction proves the result. ∎
Theorem 5.13.
The lattice is a proper class. More precisely, for every fixed prime , the relations form a strictly increasing proper-class-sized chain in .
Proof.
The relations become stronger as increases, and Proposition 5.12 shows that relations indexed by distinct infinite cardinals have distinct Löwenheim–Skolem numbers. Hence the chain is strict and proper-class-sized. ∎
Remark 5.14.
Let be an ordinal and let be a prime. Define if and only if and .
All results proved above for extend to . In particular, forms a strictly increasing proper-class-sized chain in and is a proper class.
5.3. Failure of amalgamation
We conclude by showing that amalgamation often fails in . More precisely, if is at least as strong as and satisfies a suitable syntactic hypothesis, then fails amalgamation. This indicates that the model theory of strong submodel relations in is more complicated than that of .
Definition 5.15.
The abstract class is closed under pushouts if, for every , the maps of the pushout are strong embeddings.
Proposition 5.16.
Let be positive syntactic. has the amalgamation property if and only if is closed under pushouts.
Proof.
If is closed under pushouts, then it clearly has amalgamation. Conversely, assume amalgamation, and let . Choose an amalgam and strong embeddings and satisfying We show that the canonical map is a strong embedding; the argument for is analogous.
Choose such that . By Remark 2.11, is a monomorphism. It remains to show that, for every and every , if and only if
Theorem 5.17.
If is positive syntactic and lies above in , then does not have the amalgamation property.
Proof.
Let be positive syntactic and lie above . We show that is not closed under pushouts; Proposition 5.16 then gives the result.
Choose prime numbers such that
for every . For each , let be given by .
Define
- (i)
;
- (ii)
- (iii)
- (iv)
Notice that . For , let
Then:
- (1)
and for every . Indeed, the intended complements are
and
Thus .
- (2)
If , then , with complement
Thus .
Since , smoothness gives .
Let and be the canonical maps of the pushout (see Remark 2.11). We show that is not a -embedding and hence is not a -embedding.
Let , where
Observe that .
Let be defined by and for every . Note that and we claim that
Let be defined by
Note that .
Fix . For every , let be given by and if . Note that for every .
We have that . Let be given by
Note that and
Similarly,
Using Proposition 2.8 and the identity , we conclude that and hence .
It remains to show that . Suppose otherwise, let such that witnesses the formula, i.e., . Then there is such that for every . Let with such that . Then using that for every , it follows that for every we have both:
| (1) |
Choose large enough such that there is an odd integer with
Let be witnesses to the th conjunct of .
For every , it follows from and the fact that the primes ’s are distinct, that for every . Hence for every .
For , the first divisibility condition then yields
| (2) |
The second divisibility condition then yields
| (3) |
In particular, for , which is odd, we have that by Equation (3). Since we also have that by Equation (1). Hence . As by Equation (1), we conclude that .
Since is even, it follows that
from Equation (3) and the last equation of the previous paragraph. Then it follows that by Equation (2). This is a contradiction as an easy induction yields that . ∎
Appendix A Depiction of
The following figure depicts our current understanding of :
References
- [1] J. T. Baldwin. Categoricity. University Lecture Series, American Mathematical Society, Providence, RI, 2009.
- [2] J. T. Baldwin and W. Boney. Hanf numbers and presentation theorems in AECs. In J. Iovino, editor, Beyond First Order Model Theory, CRC Press, 2017, 327–352.
- [3] J. T. Baldwin, P. C. Eklof, and J. Trlifaj. as an abstract elementary class. Ann. Pure Appl. Logic 149 (2007), no. 1, 25–39.
- [4] W. Boney and S. Vasey. A survey of tame abstract elementary classes. In J. Iovino, editor, Beyond First-Order Model Theory, CRC Press, 2017, 353–427.
- [5] W. Boney. A module-theoretic introduction to abstract elementary classes. In A. Martsinkowsky, editor, Functor and Tensor Categories, Models, and Systems, Springer Proceedings in Mathematics & Statistics 521 (2026).
- [6] R. Carnevale and G. Paolini. -abstract elementary classes of modules. Preprint, arXiv:2607.12160.
- [7] S. Cox. Kaplansky classes and stability. Preprint, arXiv:2608.00905.
- [8] J. Feigert, D. Herden and M. Mazari-Armida. On the abstract elementary class of acts with pure embeddings. Preprint, arXiv:2608.12631.
- [9] L. Fuchs. Abelian Groups. Springer, Cham, 2015.
- [10] R. Göbel and J. Trlifaj. Approximations and Endomorphism Algebras of Modules. 2nd ed., vol. 1, Approximations; vol. 2, Predictions, Walter de Gruyter, Berlin–Boston, 2012.
- [11] R. Grossberg. Classification theory for abstract elementary classes. In Y. Zhang, editor, Logic and Algebra, Contemp. Math., vol. 302, American Mathematical Society, 2002, 165–204.
- [12] R. Grossberg and M. VanDieren. Galois-stability for tame abstract elementary classes. J. Math. Log. 6 (2006), 25–49.
- [13] D. Herden, M. Mazari-Armida, and M. D. Walton. An unstable abstract elementary class of modules: a variation of Paolini–Shelah’s example. Preprint, arXiv:2604.03080, 2026.
- [14] T. Jech. Set Theory. 3rd ed., Springer Monographs in Mathematics, Springer, Berlin, 2003.
- [15] T. G. Kucera and M. Mazari-Armida. On universal modules with pure embeddings. Math. Log. Q. 66 (2020), 395–408.
- [16] D. Marker. Lectures on Infinitary Model Theory. Cambridge University Press, Cambridge, 2016.
- [17] M. Mazari-Armida. Superstability, noetherian rings and pure-semisimple rings. Ann. Pure Appl. Logic 172 (2021), no. 3, 102917.
- [18] M. Mazari-Armida. A model theoretic solution to a problem of László Fuchs. J. Algebra 567 (2021), 196–209.
- [19] M. Mazari-Armida and J. Rosický. Relative injective modules, superstability and noetherian categories. J. Math. Log. 26 (2026), no. 1, 245002.
- [20] M. Mazari-Armida and J. Trlifaj. Deconstructible classes of modules and stability. Preprint, arXiv:2512.17799.
- [21] G. Paolini and S. Shelah. On the problem of stability of abstract elementary classes of modules. Preprint, arXiv:2512.02545.
- [22] M. Prest. Model Theory and Modules. London Mathematical Society Lecture Note Series, vol. 130, Cambridge University Press, Cambridge, 1988.
- [23] M. Prest. Purity, Spectra and Localisation. Encyclopedia of Mathematics and its Applications, vol. 121, Cambridge University Press, Cambridge, 2009.
- [24] J. Šaroch and J. Trlifaj. Deconstructible abstract elementary classes of modules and categoricity. Bull. Lond. Math. Soc. 56 (2024), 3854–3866.
- [25] S. Shelah. Stable theories. Israel J. Math. 7 (1969), 187–202.
- [26] S. Shelah. Classification of nonelementary classes II: Abstract elementary classes. In J. T. Baldwin, editor, Classification Theory, Lecture Notes in Mathematics, vol. 1292, Springer, Berlin, 1987, 419–497.
- [27] S. Shelah. Categoricity for abstract classes with amalgamation. Ann. Pure Appl. Logic 98 (1999), no. 1, 261–294.
- [28] S. Shelah. Modules and infinitary logic. In Groups and Model Theory, Contemp. Math., vol. 576, American Mathematical Society, Providence, RI, 2012, 305–316.
- [29] S. Shelah. Universal structures. Notre Dame J. Form. Log. 58 (2017), no. 2, 159–177.
- [30] S. Shelah. Classification Theory for Abstract Elementary Classes. Vols. 1 and 2, Mathematical Logic and Foundations, vols. 18 and 20, College Publications, 2009.
- [31] M. Ziegler. Model theory of modules. Ann. Pure Appl. Logic 26 (1984), 149–213.