Abstract elementary classes stable in $\aleph_0$
Saharon Shelah, Sebastien Vasey

TL;DR
This paper investigates the stability and structural properties of abstract elementary classes in countable cardinality, demonstrating superstable-like behavior and the existence of superlimit models under certain conditions.
Contribution
It establishes that AECs with specific properties in leph_0 exhibit superstable-like behavior, including the existence of superlimit models and a good leph_0-frame, under a locality assumption.
Findings
Existence of a superlimit model of size leph_0
Presence of a good leph_0-frame in the generated class
Superlimit model of size leph_1
Abstract
We study abstract elementary classes (AECs) that, in , have amalgamation, joint embedding, no maximal models and are stable (in terms of the number of orbital types). Assuming a locality property for types, we prove that such classes exhibit superstable-like behavior at . More precisely, there is a superlimit model of cardinality and the class generated by this superlimit has a type-full good -frame (a local notion of nonforking independence) and a superlimit model of cardinality . We also give a supersimplicity condition under which the locality hypothesis follows from the rest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Abstract elementary classes stable in
Saharon Shelah
[email protected] http://shelah.logic.at Einstein Institute of Mathematics
Edmond J. Safra Campus, Givat Ram
The Hebrew University of Jerusalem
Jerusalem, 91904, Israel, and Department of Mathematics
Hill Center - Busch Campus
Rutgers, The State University of New Jersey
110 Frelinghuysen Road
Piscataway, NJ 08854-8019, USA
and
Sebastien Vasey
[email protected] http://math.harvard.edu/~sebv/ Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
Current address: Department of Mathematics
Harvard University
Cambridge, Massachusetts, USA
(Date:
AMS 2010 Subject Classification: Primary 03C48. Secondary: 03C45, 03C52, 03C55, 03C75.)
Abstract.
We study abstract elementary classes (AECs) that, in , have amalgamation, joint embedding, no maximal models and are stable (in terms of the number of orbital types). Assuming a locality property for types, we prove that such classes exhibit superstable-like behavior at . More precisely, there is a superlimit model of cardinality and the class generated by this superlimit has a type-full good -frame (a local notion of nonforking independence) and a superlimit model of cardinality . We also give a supersimplicity condition under which the locality hypothesis follows from the rest.
Key words and phrases:
abstract elementary classes; -stability; good frames; superlimit; locality
The first author would like to thank the Israel Science Foundation for partial support of this research (Grant No. 242/03).
Research partially supported by European Research Council grant 338821, and by National Science Foundation grant no: 136974. 1119 on Shelah’s publication list
1. Introduction
1.1. Motivation
In [She87a] (a revised version of which appears as [She09a, Chapter I], from which we cite), the first author introduced abstract elementary classes (AECs): a semantic framework generalizing first-order model theory and also encompassing logics such as . He studied -representable AECs (roughly, AECs which are reducts of a class of models of a first-order theory omitting a countable set of types) and generalized and improved some of his earlier results on [She83a, She83b] and [She75].
For example, fix a -representable AEC and assume that it is categorical in . Assuming and , the first author shows (without even assuming -representability) [She09a, I.3.8] that has amalgamation in . Further, [She09a, §I.4, §I.5], it has a lot of structure in and assuming more set-theoretic assumptions as well as few models in , has a superlimit model in [She09a, I.5.34, I.5.40]. This means roughly (see Section 2) that there is a saturated model in and that the union of an increasing chain of type consisting of saturated models of cardinality is saturated.
The reader can think of the existence of a superlimit in as a step toward showing that the models of cardinality behave in a “superstable-like” way. Indeed several recent works [Van16b, VV17, BV17a, GV17] have connected superlimits with other definitions of superstability in AECs, including uniqueness of limit models and local character of orbital splitting.
Another notable consequence of the existence of a superlimit in is that it implies that there is a model of cardinality . This ties back to a result of the first author: [She09a, I.3.11]: for a AEC, categoricity in and implies the existence of a model in . The argument first establishes, using only categoricity in and few models in , that there is a pair of models in such that and then uses, in essence, that (by -categoricity) these models are superlimits. In this context, the very strong hypotheses make it possible to avoid referring to any stability-theoretic notions. Still, in more complicated frameworks the existence of a superlimit model in can be thought of as a key conceptual step toward proving existence of models in higher cardinality and more generally developing a stability theory cardinal by cardinal.
The arguments for the results from [She09a, §I.5] discussed in the second paragraph of this introduction are complicated by the lack of -stability: one can only get that there are -many orbital types over countable models. The workaround there is to redefine the ordering (but not the class of models) to obtain a stable class, see [She09a, I.5.29]. If the AEC is “nicely-presented”, e.g. a class of models of an -sentence or more generally a finitary AEC [HK06], then this difficulty does not occur (see [BL16]): -stability follows from few models in and . One can also obtain -stability by starting with only countably-many models in [BLS15, 3.18]. Finally, it is worth noting that (assuming amalgamation and joint embedding in ), -stability is upward absolute for -AECs [LS].
1.2. Main results
The bottom line is that -stability holds in several cases of interest. In fact, there are no known examples which (under ) are categorical in , have few models in , and are not -stable (see [BLS15, Question 3.15]). Thus in the present paper, we start with stability in (and often amalgamation and categoricity in ). Our goal is to say as much as we can on the structure of the class, in particular to get superstable-like behavior in and , without assuming a non-ZFC hypothesis or .
One of our first results (Theorem 4.2) is that -stability (together with amalgamation and -categoricity) imply that the class is already -representable. We also show that the assumption of categoricity in is not really needed: without assuming it, one can find a superlimit in and change to the class generated by that superlimit, which will be categorical in . In fact, we prove (Theorem 4.4) that one can characterize brimmed models (also called limit models in the literature) as those that are homogeneous for orbital types. This has as immediate consequence that the brimmed model of cardinality is superlimit (Corollary 4.6). This last result sheds light on an argument of Lessmann [Les05] and answers a question of Fred Drueck (see footnote 3 on [Dru13, p. 25]), who asked when this equality held. The argument works more generally assuming only density of amalgamation bases, as in [SV99].
For the main result of this paper, we assume that orbital types over countable models are determined by their finite restrictions. The study of statements of the form “orbital types are determined by their small restrictions” was pioneered by Grossberg and VanDieren [GV06], who called this condition tameness. Hyttinen and Kesälä [HK06, §3] were the first to specifically study orbital types over finite sets and the condition that they determine orbital types over countable models.
Following the first author’s terminology [She, 0.1(2)], we call this last condition -locality (not to be confused with sequence locality [She, 0.1(1)], which is called locality in [BS08, 1.8] or [Bal09, 11.4]). This is known to hold for several classes of interest:
Example 1.1**.**
- (1)
Let be a finitary AEC (see [HK06]; this includes classes of models of -sentences) and assume that is stable in (finitary AECs have amalgamation and no maximal models by definition). By [HK06, 4.11], is -local. 2. (2)
Finitary AECs are not the only setup where -locality holds. For example, it is known for quasiminimal pregeometry classes (that may not be finitary [Kir13, Theorem 2]), see [BHH*+*14, 5.2], and more generally in the finite U-rank (FUR) classes of Hyttinen and Kangas [HK16, 2.17] (we thank Will Boney for pointing us to that reference).
We prove the following:
Theorem 1.2**.**
Let be an AEC with and countable vocabulary. Assume that is categorical in , is -local, has amalgamation and no maximal models in and is stable in . Then:
- (1)
(Theorem 5.8) There is a good -frame on . 2. (2)
(Corollary 5.9) There is a superlimit model of cardinality .
The good -frame (or the superlimit in ) imply the nontrivial corollary that has a model of cardinality [She09a, II.4.13]. This consequence also follows from a theorem of the second author [Vasb, 12.1] (which however does not give a good -frame or a superlimit in ). The conclusion that there is a superlimit model in seems new, even for finitary AECs or FUR classes.
It is natural to ask whether the locality hypothesis in Theorem 1.2 is really needed111In fact, an earlier version of the present paper asserted that it could be derived from the other hypotheses but the argument contained a mistake.. In fact we do not even know whether the existence of a good -frame implies -locality:
Question 1.3**.**
Let be an AEC with . If there is a good -frame on , is -local?
In Section 6, we give a partial answer: any AEC that is -stable, -categorical, and supersimple (in a sense generalizing that of homogeneous model theory [BL03]) is -local. This generalizes the proof of [BHH*+*14, 5.2], which shows that quasiminimal pregeometry classes are -local (see also [Vasa]). Supersimple -stable AECs are also much more general than FUR classes.
1.3. Notes
This paper is organized as follows. Section 2 gives some background definitions and fixes the notation. Section 3 is a technical section on good frames (possibly on uncountable models) which sets up the machinery to prove the main theorem (more precisely, to prove a strong symmetry property for nonforking in good frames). Section 4 works with countable models and shows that -stability implies the existence of a superlimit in . Section 5 builds the good -frame and proves the main theorem. Finally, Section 6 studies a sufficient condition to get -locality.
This paper was started while the second author was working on a Ph.D. thesis under the direction of Rami Grossberg at Carnegie Mellon University and he would like to thank Professor Grossberg for his guidance and assistance in his research in general and in this work specifically. We also thank Will Boney, Marcos Mazari Armida, and the referee, for their valuable comments on earlier versions of this paper.
Note that at the beginning of several sections, we make global hypotheses assumed throughout the section.
2. Preliminaries
We assume familiarity with the basics of AECs, as presented for example in [Gro02, Bal09], or the first three sections of Chapter I together with the first section of Chapter II in [She09a]. We also assume familiarity with good frames (see [She09a, Chapter II] or [BV17b]; it would help the reader to have a copy of both available during the reading of Section 3). This section mostly fixes the notation that we will use.
Given a -structure , we write for its universe and for its cardinality. We may abuse notation and write e.g instead of . We may even write instead of .
We write for an AEC. We may abuse notation and write instead of . For a cardinal , we write for the AEC restricted to its models of size . As shown in [She09a, II.1], any AEC is uniquely determined by its restriction .
When we say that is an amalgamation base, we mean (as in [SV99]) that it is an amalgamation base in , i.e. we do not require that larger models can be amalgamated.
For , we say that is universal over if and for any with , if , there exists (usually we will require also that ). We say that is -brimmed over (often also called -limit e.g. in [SV99, GVV16]) if is a limit ordinal, , and there exists an increasing continuous chain of members of such that is universal over , , and is universal over for all . We say that is brimmed over if it is -brimmed over for some limit . We say that is brimmed if it is brimmed over some .
The following key concept appears in [She09a, I.3.3]:
Definition 2.1**.**
We say that is superlimit if, letting , we have that , is universal in (i.e. any embeds into ), is not maximal, and whenever is limit, is increasing with for all , then .
The following notion of types already appears in [She87b]. It is called Galois types by many, but we prefer the term orbital types here. They are the same types that are defined in [She09a, II.1.9], but we also define them over sets. As pointed out in [Vas16b, Section 2], this causes no additional difficulties. The following technical point is important: when the AEC does not have amalgamation, we may want to compute orbital types only in the subclass of amalgamation bases in (as in [SV99]). Thus we allow orbital types to be computed in a subclass of in the definition.
Definition 2.2**.**
Fix an AEC and a subclass of , closed under isomorphisms.
- (1)
We say if:
- (a)
For , , , and . 2. (b)
There exists and , , such that . 2. (2)
is a reflexive and symmetric relation. Let be its transitive closure. 3. (3)
Let be the -equivalence class of . 4. (4)
Define , , , , etc. for the Stone spaces of orbital types, computed inside . This is defined as in [Vas16b, 2.20]. For example, . 5. (5)
When , we omit it.
Let us say that an AEC is stable in if for any , . This makes sense in any AEC, and is quite well-behaved assuming amalgamation and no maximal models (since then it is known that one can build universal extensions). We will often work in the following axiomatic setup, a slight weakening where full amalgamation is not assumed. This comes from the context derived in [SV99]:
Definition 2.3**.**
Let be an AEC and let be a cardinal. We say that is nicely stable in (or nicely -stable) if:
- (1)
. 2. (2)
. 3. (3)
has joint embedding in . 4. (4)
Density of amalgamation bases: For any , there exists such that and is an amalgamation base (in ). 5. (5)
Existence of universal extensions: For any amalgamation base , there exists an amalgamation base such that and is universal over . 6. (6)
Any brimmed model in is an amalgamation base.
We say that is very nicely stable in if in addition it has amalgamation in .
Remark 2.4**.**
An AEC is very nicely stable in if and only if , , is stable in , and has amalgamation, joint embedding, and no maximal models. In particular, stability is a consequence of the existence of universal extensions in Definition 2.3.
We will repeatedly use the following fact [SV99, 1.3.6].
Fact 2.5**.**
Let be nicely stable in and let . Let be limit ordinals such that .
- (1)
If is -brimmed over , for , then . 2. (2)
If is -brimmed, for , then .
Proof.
The first is a straightforward back and forth argument and the second follows from the first using joint embedding. ∎
Remark 2.6**.**
Uniqueness of brimmed models when is a much harder property to establish, akin to superstability. See for example [SV99, Van06, GVV16, Van16a]. However when we automatically have that .
Good frames were first defined by the first author in his paper number 600, which eventually appeared as Chapter II of [She09a]. The idea is to provide a localized (i.e. only for base models of a given size ) axiomatization of a forking-like notion for a “nice enough” set of 1-types. These axioms are similar to the properties of first-order forking in a superstable theory. Jarden and the first author (in [JS13]) later gave a slightly more general definition, not assuming the existence of a superlimit model and dropping some of the redundant clauses. We will make use of good frames for types of finite length (not just length one). Their definition is just like for types of length one, we call them good -frames. For the convenience of the reader, we give the full definition from [BV17b, 3.8] here:
Definition 2.7**.**
Let be an infinite cardinal. A good -frame is a triple (\mathfrak{K},\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits,\mathscr{S}_{\mathfrak{s}}^{\text{bs}}) satisfying, where:
- (1)
is an abstract elementary class with , . 2. (2)
. Moreover, if , then for all . 3. (3)
\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits is a relation on quadruples of the form , where , , and , , are all in . We write \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits(M_{0},M_{1},\bar{a},N) or \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{1} instead of (M_{0},M_{1},a,N)\in\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits. 4. (4)
The following properties hold:
- (a)
Invariance: If and \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{1}, then f(\bar{a})\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{f[M_{0}]}^{N^{\prime}}f[M_{1}]. If , then . 2. (b)
Monotonicity: If \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{1}, is a subsequence of , with , and , then \bar{a}^{\prime}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}^{\prime}}^{N^{\prime}}M_{1}^{\prime} and \bar{a}^{\prime}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}^{\prime}}^{N^{\prime\prime}}M_{1}^{\prime}. If and is a subsequence of , then . [This property and the previous one show that \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits is really a relation on types. Thus if is a type, we say does not fork over if \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{1} for some (equivalently any) and such that . Note that this depends on , but will always be clear from context.] 3. (c)
Nonforking types are basic: If \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M}^{N}M, then . 4. (d)
has amalgamation, joint embedding, and no maximal models. 5. (e)
bs-Stability: for all . 6. (f)
Density of basic types: If are in , then there is such that . 7. (g)
Existence of nonforking extension: If , , is in , then there is some that does not fork over and extends . 8. (h)
Uniqueness: If do not fork over and , then . 9. (i)
Symmetry: If \bar{a}_{1}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{2}, , and , then there is containing and such that \bar{a}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N^{\prime}}M_{1}. 10. (j)
Local character: If is a regular cardinal, is increasing continuous, and is such that , then there exists such that does not fork over . 11. (k)
Continuity: If is a limit ordinal, and are increasing and continuous, and for are such that implies , then there is some such that for all , . Moreover, if each does not fork over , then neither does . 12. (l)
Transitivity: If , does not fork over and does not fork over , then does not fork over .
A good -frame is defined similarly, except we require all types to be types of singletons (i.e. they are in instead of ). We say that an AEC has a good -frame if there is a good -frame where is the underlying AEC.
Notation 2.8**.**
If \mathfrak{s}=(\mathfrak{K},\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits,\mathscr{S}_{\mathfrak{s}}^{\text{bs}}) is a good--frame (or a good -frame), write \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\mathfrak{s}}:=\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits. Also write for and . We will also write as a shortcut for and ().
Remark 2.9**.**
The reader might wonder about the reasons for having a special class of basic types. Following [She09a, Definition III.9.2], let us call a good frame type-full if the basic types are all the nonalgebraic types. There are no known examples of a good -frame which which cannot be extended to a type-full one. However a construction of good frames of the first author [She09a, II.3] builds a non type-full good frame and it is not clear that it can be extended to a type-full one until a lot more machinery has been developed. Thus it can be easier to build a good frame than to build a type-full one, and most results about frames already hold in the non-type-full context. That being said, readers would not miss the essence of the present paper if they assumed that all the frames here were type-full.
Remark 2.10**.**
Any good -frame (i.e. for types of length one) extends to a good -frame (using independent sequences, see [She09a, III.9.4]) or [BV17b, 5.8]. This frame will however not be type-full.
From now on until the end of Section 5, “nonforking” will refer to nonforking in a fixed frame (usually clear from context).
3. Weak nonforking amalgamation
In this section, we work in a good -frame and study a natural weak version of nonforking amalgamation, ( stands for “left weak nonforking amalgamation”). The goal is to obtain a natural criteria for proving the existence of a superlimit in and also prepare the ground for the proof of symmetry in the good frame built in Section 5. The main results are the existence property (Theorem 3.10) and how the symmetry property of is connected to being (Theorem 3.14). Throughout this section, we assume:
Hypothesis 3.1**.**
- (1)
\mathfrak{s}=(\mathfrak{K},\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits,\mathscr{S}_{\mathfrak{s}}^{\text{bs}}) is a fixed good -frame, except that it may not satisfy the symmetry axiom. 2. (2)
is categorical in .
Remark 3.2**.**
In this section, is allowed to be uncountable. However the case is the one that will interest us in the next sections.
The reason for not assuming symmetry is that we will use some of the results of this section to prove that the symmetry axiom holds of a certain nonforking relation in Section 5.
We will use:
Fact 3.3** (II.4.3 in [She09a]).**
Let be a limit ordinal divisible by . Let be increasing continuous in . If for any and any , there exists -many such that the nonforking extension of to is realized in , then is brimmed over .
To understand the definition below, it may be helpful to think of as type-full. Then holds if and only if the type of any finite subsequences of over does not fork over ( is the ambient model). Thus is an attempt to extend nonforking to types of infinite sequences so that it keeps a strong finite character property. In the present paper, will be a helpful technical tool but it is not clear that it has the uniqueness property (in contrast with the relation from [She09a, §II.6] or [JS13, §5], which will have the uniqueness property but requires more assumptions on the good frame). If does have the uniqueness property, this has strong consequence on the structure of the frame, see Theorem 3.17.
Definition 3.4**.**
Define the following -ary relations on :
- (1)
if and only if for and for any , if and are basic then does not fork over . 2. (2)
if and only if [ stands for “right weak nonforking amalgamation”]. 3. (3)
if and only if both and [ stands for “weak nonforking amalgamation].
When is clear from context, we write , , and .
The following result often comes in handy.
Lemma 3.5**.**
Let be a limit ordinal. Let , be increasing continuous in . Assume that for each , we have that . If for each , realizes all the basic types over , then realizes all the basic types over .
Proof.
Let . By local character, there exists such that does not fork over . In particular, is basic. Since realizes all the basic types over , there exists such that . Because for all , , we have by continuity that does not fork over , hence by uniqueness it must be equal to . Therefore realizes , as needed. ∎
Next, we investigate the properties of . We are especially interested in the symmetry property: whether is equal to . To understand it better, we consider the following ordering, defined similarly to from [She09a, II.7.2]:
Definition 3.6**.**
For , define a relation on as follows. For , if and only if there exists increasing continuous resolutions of for such that for all , .
The following is a straightforward “catching your tail argument”, see the proof of [Vas17, 4.6] (this assumes that all types are basic, but the argument goes through without this restriction). Roughly, it says that if ( is the usual order on ), then we can find a resolution of and so that the pieces are in left weak nonforking amalgamation.
Fact 3.7**.**
Let . If , then .
Whether can be concluded as well seems to be a much more complicated question, and in fact is equivalent to being (Theorem 3.14), a weakening of symmetry. We now observe that an increasing union of a -increasing chain of saturated models is saturated:
Lemma 3.8**.**
Let be a limit ordinal. If is a -increasing sequence of saturated models in , then is saturated.
Proof.
If , then any will be -saturated on general grounds. Thus assume without loss of generality that . Let . We build such that:
- (1)
For any , . 2. (2)
For any , . 3. (3)
For any , is increasing and continuous. 4. (4)
For any , is increasing and . 5. (5)
For any , , realizes all the types in .
This is easy to do. Now for each , we have by assumption that . Thus the set of such that for all , is a club (that it is closed follows from the local character and continuity axioms of good frames). Therefore is also a club. Hence by renaming without loss of generality for all and all , .
Now let be such that . We want to see that any type over is realized in . By Fact 3.3, it is enough to show that any basic type over is realized in .
Let be big-enough such that . It is enough to see that any basic type over is realized in . To see this, use Lemma 3.5 with , there standing for , here. We know that for each , and therefore . Thus the hypotheses of Lemma 3.5 are satisfied. ∎
The next fact will be used to prove the existence property of . Its proof is a direct limit argument similar to e.g. [GVV16, 5.2]. Roughly, the nonforking relation there is given by “there exists a smaller submodel over which the type does not split”; in fact, these smaller submodels have to be kept as part of the data of the tower. This is not needed here. The argument is also similar to [JS13, 3.1.8]. However there the symmetry axiom axiom is needed: there is an extra requirement on the type of a certain element , but here we do not make that requirement so do not need symmetry.
Fact 3.9**.**
Let . Let be -increasing continuous (in ) and let be given such that for all and (we allow the ’s to have different length).
There exists -increasing continuous such that:
- (1)
for all . 2. (2)
does not fork over .
We can now list and then prove some basic properties of weak nonforking amalgamation. For the convenience of the reader, we repeat Hypothesis 3.1.
Theorem 3.10**.**
Let \mathfrak{s}=(\mathfrak{K},\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits,\mathscr{S}_{\mathfrak{s}}^{\text{bs}}) be a fixed good -frame, except that it may not satisfy the symmetry axiom. Assume that is categorical in . Let .
- (1)
Invariance: If and , then . 2. (2)
Monotonicity: If and for , then . 3. (3)
Ambient monotonicity: If and , then . If contains , then . 4. (4)
Continuity: If is a limit ordinal and are increasing continuous for with for each , then . 5. (5)
Long transitivity: If is an ordinal, , are increasing continuous and for all , then . 6. (6)
Existence: If , , , then there exists and such that .
Proof.
Invariance and the monotonicity properties are straightforward to prove. Continuity and long transitivity follow directly from the local character, continuity, and transitivity properties of good frames. We prove existence via the following claim:
Claim: There exists such that and is brimmed over for .
Existence easily follows from the claim: given , , there is (by categoricity in ) an isomorphism and (by universality of brimmed models) embeddings extending for . After some renaming, we obtain the desired -amalgam. To obtain an -amalgam, reverse the role of and .
Proof of Claim: The idea of the proof is as follows: for some suitable ordinal , we want to build , with the following property: whenever is as described by Fact 3.9 (plus slightly more), we must have that , is brimmed over , and is brimmed over . To achieve this, we simply start with an arbitrary , and, if it fails the property, take a witness to the failure, add some more ’s to make it more brimmed, and start again to consider whether this witness satisfies the property. After doing this for sufficiently many steps, we eventually succeed to build the desired object. This is somewhat similar to the construction of a reduced tower in [SV99, GVV16], although here we are dealing with nonforking independence and not just set-theoretic disjointness.
We now start with the proof. Let . We choose by induction on such that:
- (1)
is -increasing continuous. 2. (2)
, and for all . 3. (3)
For all , . 4. (4)
For each , is -increasing continuous. 5. (5)
For each and each , does not fork over . 6. (6)
If for , then for -many , is a nonforking extension of . 7. (7)
If and , then for some exactly one of the following occurs:
- (a)
forks over . 2. (b)
There is no -increasing continuous such that:
- (i)
for all . 2. (ii)
does not fork over for all . 3. (iii)
forks over .
- This is possible: Along the construction, we also build an enumeration such that for any , any , any , any , and any , if , then there exists so that , , , and . We require that always and the triple represents a basic type. We make sure that at stage of the construction below, are defined for all , .
For , take any . For limit, let for and . Now assume that , have been defined for . We define and . Fix and such that . We consider two cases.
- –
Case 1: is zero or a limit: Use Fact 3.9 to get -increasing continuous such that for all , and for all , does not fork over . Pick any with and any such that .
- –
Case 2: is a successor: Say . Let , , , . There are two subcases.
Subcase 1: Either , or and (7b) holds with there standing for here.
In this case, we proceed as in Case 1 to define . Then we pick , such that is the nonforking extension of .
- *
Subcase 2: and (7b) fails.
In this case, let witness the failure and set for . Then continue as in Case 1 and define , as before.
- This is enough:
We proceed via a series of subclaims:
Subclaim 1: If for , then for -many , is a nonforking extension of .
Proof of subclaim 1: Pick such that does not fork over . By (6), we know that for -many , the nonforking extension of to is realized in by . But by (5) we also have that does not fork over . In particular by uniqueness also realizes .
Subclaim 2: is brimmed over .
Proof of subclaim 2: Apply Fact 3.3 to the chain , using the previous step.
We now choose increasing continuous such that is brimmed over , for all , and does not fork over . This is possible, see case 1 above. Now let . We have just said that is brimmed over , and by subclaim 2, is brimmed over . Thus is brimmed over for . It remains to see:
Subclaim 3:
Proof of subclaim 3: Pick such that is basic. By local character, there exists such that does not fork over . Further, we can increase if necessary and pick such that . We now apply Clause (7). We know that (7a) fails for all by the choice of , therefore (7b) must hold for all . Now if forks over , then it must fork over for all high-enough , but then would contradict Clause (7b). Therefore does not fork over , as desired.
∎
The following properties of may or may not hold in general (we have no examples for the failure of symmetry, but uniqueness fails in the last good frame of the Hart-Shelah example, see [HS90, BV]):
Definition 3.11**.**
Let .
- (1)
We say that has the symmetry property if implies . 2. (2)
We say that has the uniqueness property if whenever and , there exists with and .
The following are trivial observations about the definitions:
Remark 3.12**.**
- (1)
has the symmetry property, and has the symmetry property if and only if has the symmetry property if and only if . 2. (2)
has the uniqueness property if and only has it.
Recall from [She09a, III.1.3]:
Definition 3.13**.**
is when the following is impossible:
There exists an increasing continuous , , a basic type , and such that for any :
- (1)
. 2. (2)
and is a nonforking extension of , but forks over . 3. (3)
is saturated.
We now show that being is a consequence of symmetry for . Moreover, allows us to build a superlimit in .
Theorem 3.14**.**
, where:
- (1)
has the symmetry property. 2. (2)
is . 3. (3)
For both saturated, implies . 4. (4)
There is a superlimit model in .
Proof.
- •
(3) implies (4): This follows from Lemma 3.8 and the fact that the saturated model in is universal and has a proper extension [She09a, II.4.13].
- •
implies : Fix a witness , , , to the failure of being . Write , . By assumption, is saturated. Clearly, increasing the ’s will not change that we have a witness so without loss of generality is also saturated. We claim that . We show this by proving that for any and any , . Indeed, forks over : if not, then by transitivity does not fork over , and hence does not fork over , and we know that this is not the case of the witness we selected.
- •
implies : Fix saturated in such that but .
Claim: For any of size , there exists and such that , , , but .
Proof of Claim: If not, we can use failure of the claim and continuity of to build increasing continuous resolution , of and respectively such that for all . Thus , contradicting the assumption.
Build , increasing continuous resolutions of , respectively such that for all , and . This is possible by the claim. Let witness the -forking, i.e. forks over . By Fodor’s lemma, local character, and stability, there exists a stationary set , and such that for all , is the nonforking extension of . Without loss of generality, is limit and all elements of are also limit ordinals.
Now build an increasing continuous sequence of ordinals as follows. Let . For limit, let . For successor, pick any with .
Now for not the successor of a limit, let , , . For with a limit, set , , . This gives a witness to the failure of being .
- •
(1) implies (3): If has the symmetry property, then by Remark 3.12, . By Fact 3.7, it follows that implies for any , so (3) holds.
∎
Question 3.15**.**
Are the conditions in Theorem 3.14 all equivalent?
Question 3.16**.**
Is there a good -frame such that does not have the symmetry property?
The next result shows that the uniqueness property has strong consequences. The first author has given conditions under which when , failure of uniqueness implies nonstructure [She09b, VII.4.16].
Theorem 3.17**.**
Assume that is a good -frame (so it satisfies symmetry). If has the uniqueness property, then has the symmetry property and is successful (see [She09a, III.1.1]).
Proof.
By [Vas17, 3.11] (used with the pre--frame induced by , recalling Fact 3.7) is weakly successful. This implies that there is a relation that is a nonforking relation respecting (see [She09a, II.6.1], in particular it has all the properties listed in Theorem 3.10, as well as uniqueness and symmetry). Now as respects , we must have that implies . Since has the uniqueness property and has the existence property, it follows from [BGKV16, 4.1] that . In particular, has the symmetry property.
To see that is successful , it is enough to show that for , implies (where is defined as in Definition 3.6). This is immediate from Fact 3.7 and . ∎
To prepare for the proof of symmetry in the case, we end this section by introducing yet another notion of nonforking amalgamation ( stands for “very weak nonforking amalgamation”). In this case, we look at finite sequences both on the left and the right hand side. We show that if is a good frame, then has the symmetry property and locality of types implies that . Thus in this case has the symmetry property too.
Definition 3.18**.**
- (1)
For , , , we say that does not fork over if there exist , with , , and such that does not fork over . 2. (2)
We define a 4-ary relation on by if and only if , and for any and any finite , if and are both basic, then does not fork over .
Theorem 3.19**.**
Assume that is a type-full good -frame.
- (1)
has the symmetry property: if and only if . 2. (2)
If for any and any there exists finite such that , then . In particular, has the symmetry property.
Proof.
- (1)
By the symmetry axiom of good frames. 2. (2)
This is observed in [Vas16a, 4.5]. In details, it suffices to show that for , does not fork over if and only if does not fork over for all finite . Let be the nonforking extension of . For any finite , we have that , by the uniqueness property for (the extended notion of) forking, see [BGKV16, 5.4]. Therefore by the assumption we must have , as desired.
∎
4. Building a superlimit
In this section, we work in and show assuming -stability and amalgamation that is (Theorem 4.2) and has a superlimit (Corollary 4.6).
Hypothesis 4.1**.**
is an AEC with (and countable vocabulary).
We will use without comments Fact 2.5 and Remark 2.6. The essence of it is that since all brimmed models have the same length, and hence are isomorphic (and the isomorphism fixes any common base they may have).
First note that if is stable and has few models, we can say something about its definability:
Theorem 4.2**.**
Assume that .
- (1)
The set is Borel. 2. (2)
If has amalgamation in and is stable in , then the set and is .
In particular if has amalgamation in and is stable in , then is a -representable AEC.
Proof.
- (1)
Fix . By Scott’s isomorphism theorem, there exists a formula of such that if and only if . Now observe that the set
[TABLE]
is Borel and use that . 2. (2)
For with , let us say that is almost brimmed over if either is brimmed over , or is -maximal. Using amalgamation, it is easy to check that if are both almost brimmed over , then (as in Fact 2.5, recalling that the chains witnessing the brimmedness must have cofinality ). Moreover there always exists an almost brimmed model over any .
Fix such that for any there exists such that (possible as ). For each , fix almost brimmed over . We have:
For :
- (a)
There is and an isomorphism . 2. (b)
If is almost brimmed over , then any such extends to .
For , if and only if and for some , for some we have: and for , is an isomorphism from onto .
[Why? The implication “if” holds by the coherence axiom of AECs. The implication “only if” holds as there is which is almost brimmed over (and so ) hence is almost brimmed over and use above.]
The result now follows from .
By [BL16, 3.3], it follows that is . ∎
We now study homogeneous models and show that they coincide with brimmed models. Note that the homogeneity here is with respect to a set of orbital types.
Definition 4.3**.**
Let be a set of orbital types over the empty set and let . We say that is -homogeneous if it realizes all the types in and whenever is the type of an -elements sequence and realizes (the restriction of to its first “variables”), there exists a sequence such that realizes .
The next result characterizes the countable brimmed model in AECs that are nicely stable in (recall Definition 2.3).
Theorem 4.4**.**
Assume that is nicely stable in and let be the class of amalgamation bases in . Let . The following are equivalent:
- (1)
is brimmed. 2. (2)
is -homogeneous (see Definition 2.2(4)).
Proof.
Let . First we show:
Claim: If is brimmed, , then if and only if there is an automorphism of sending to .
Proof of Claim: The right to left direction is clear. Now assume that . Say witness that is brimmed, and without loss of generality assume that . Then . Since has amalgamation, there exists with and so that . Since is universal over , we can assume without loss of generality that . Now extend to an automorphism of using a back and forth argument.
From the claim, it follows directly that if is brimmed, then it is -homogeneous. Conversely, the countable -homogeneous model is unique (standard back and forth argument) and so it must also be brimmed. ∎
Remark 4.5**.**
By adding constants to the language, we can also characterize brimmed models over as those that are homogeneous for orbital types of finite sequences over .
Corollary 4.6**.**
If is nicely stable in , then there is a superlimit model of cardinality .
Proof.
Let be brimmed (it exists by nice stability in ). We claim that is superlimit. To see this, we check the conditions of Definition 2.1. On general grounds, brimmed models are universal in , are not maximal (from the definition of nice stability), and there is a unique brimmed model of cardinality . Still, it is not obvious that if is an increasing chain of brimmed models in and , then is brimmed. To see this, we use Theorem 4.4: each is (-homogeneous, and it is clear from the definition that an increasing union of such homogeneous models is homogeneous. Thus is -homogeneous. By Theorem 4.4 again, is brimmed, as desired. ∎
We have justified assuming amalgamation in the following sense:
Corollary 4.7**.**
If is nicely stable in , then there exists an AEC such that:
- (1)
. 2. (2)
. 3. (3)
. 4. (4)
and for , if and only if . 5. (5)
For any there exists with . 6. (6)
is categorical in . 7. (7)
is very nicely stable in . In particular it has amalgamation in . 8. (8)
is .
Proof.
Let be superlimit (exists by Corollary 4.6). Let . Now let be the AEC generated by (in the sense of [She09a, II.23]). One can easily check that is nicely stable in ; from this and -categoricity we get amalgamation in , hence (7) holds. As for (8), it follows from Theorem 4.2. ∎
5. Building a good -frame
The aim of this section is to build a good -frame from nice -stability. By Corollary 4.7, we may restrict the class to a superlimit so that it is categorical in . As before, we assume:
Hypothesis 5.1**.**
is an AEC with (and countable vocabulary).
The nonforking relation of the frame will be nonsplitting:
Definition 5.2**.**
For and , splits over if whenever , there exists such that but .
The following is proven in [She09a, I.5.6]. Similar proofs appear in [HK06, 3.16] or [BHH*+*14, 4.2].
Fact 5.3**.**
Assume that is nicely stable in and categorical in . If and , then there exists finite such that does not split over .
The following result about nonsplitting will also come in handy. It appears in various forms in the literature, see e.g. [BV17a, 4.8].
Lemma 5.4** (Weak uniqueness).**
Assume that is nicely stable in and categorical in . Let both be in , . If both and do not split over a finite subset of and for all finite , then for all finite .
Proof.
Let be brimmed over . Let realize and respectively. Fix finite such that and do not split over . Let be finite and let be an enumeration of . Since is brimmed, there exists such that . By nonsplitting, for . Now since we have by assumption that . Therefore . Putting these equalities together, , so , as desired. ∎
Definition 5.5**.**
Let be nicely stable in and categorical in . We define a pre--frame \mathfrak{s}=(\mathfrak{K}^{\mathfrak{s}},\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits,\mathscr{S}_{\mathfrak{s}}^{\text{bs}}) by:
- (1)
. 2. (2)
For all in , , , \bar{a}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M holds if and only if for all and there exists a finite so that does not split over . 3. (3)
For , is the set of all types of finite sequences over such that for all , .
In order to prove that is a good -frame, we will make an additional locality hypothesis. See Example 1.1 and the next section for setups where it holds.
Definition 5.6**.**
is -local if for any , for all finite implies . We say that is weakly -local if this holds for a superlimit .
Remark 5.7**.**
The definition of locality includes types of any finite length, not just of length one. This will be used to prove the symmetry property of , via Theorem 3.19.
We now prove, assuming nice stability, categoricity, and locality, that the pre-frame defined above is a good -frame.
Theorem 5.8**.**
Assume that is nicely stable in and categorical in . If is -local, then (Definition 5.5) is a type-full good -frame. Moreover has the symmetry property (recall Definitions 3.4 and 3.11). In particular, is .
Proof.
Once we have shown that is a type-full good frame, the moreover part follows from Theorem 3.19. The last sentence is by Theorem 3.14.
Now except for symmetry, the axioms of good frames are easy to check (see the proof of [She09a, II.3.4]). For example:
- •
Local character: Let be increasing continuous in . Let . By Fact 5.3, there exists a finite such that does not split over . Pick such that . Then does not fork over .
- •
Uniqueness: by Lemma 5.4 and locality.
- •
Extension: follows on general grounds, see [Vasb, 3.5].
Symmetry is the hardest to prove, and is done as in [She09a, I.5.30]. We give a full proof for the convenience of the reader.
Suppose that does not fork over and let . We want to find such that , , and does not fork over . Assume for a contradiction that there is no such . Using existence for (see Theorem 3.10), as well as the extension property for nonforking, we can increase and if necessary and find such that , is brimmed over , and is brimmed over for . By assumption, forks over .
Claim 1: Let be the linear order . There exists an increasing chain such that for any in , are in and is brimmed over .
Proof of Claim 1: Let be a Scott sentence for the model in . Let be a Scott sentence for a pair such that is brimmed over . Now let be the class of sequences such that is a linear order, for all , and for all in . It is easy to see that is axiomatizable by a sentence in . Moreover, for each , there is a sequence in . By [Kei71, Theorem 12(i)], this implies that contains an -indexed member, as desired.
Fix , as in Claim 1. Fix such that is brimmed over and does not fork over .
For any fixed infinite , write . Assume now that is brimmed over . Let , . Let be brimmed over . By categoricity and uniqueness of brimmed models, there exists , , , and such that . Let and let . Note that holds.
Let . Since we are assuming that forks over , we have that forks over . Moreover does not fork over .
Claim 2: If has no last elements, has no first elements, and , then forks over .
Proof of Claim 2: Suppose that does not fork over . Note that is brimmed over . Find such that , is brimmed over , and . Let be such that . Since , we know that does not fork over , hence by uniqueness . But we have assumed that does not fork over and , hence by a simple renaming we obtain a contradiction to our hypothesis that symmetry failed.
Claim 3: If are both proper initial segments of with no last elements and has no first elements, then .
Proof of Claim 3: Fix . By Claim 2, forks over . We claim that does not fork over . Indeed recall that and by assumption does not fork over . Therefore by monotonicity also does not fork over .
To finish, observe that there are cuts of as in Claim 3. Therefore stability fails, a contradiction. ∎
The next corollary does not assume categoricity, but uses amalgamation in , rather than just density of amalgamation bases.
Corollary 5.9**.**
If is very nicely stable in and weakly -local, then has a superlimit of cardinality .
Proof.
By Corollary 4.6, has a superlimit in . Let be the class generated by this superlimit, as described by the proof of Corollary 4.7. Then is categorical in and nicely stable in , hence we can apply Theorem 5.8 and get a type-full -frame with underlying class . By Theorem 3.14, has a superlimit model in . This is also a superlimit in : the only nontrivial property to check is universality. Let . Fix any with . By universality of , there exists . Now let be superlimit in with . Using amalgamation (amalgamation in suffices for this, see [She09a, I.2.11]), we can find extending , as needed. ∎
6. Locality from supersimplicity
In this section, we give a sufficient condition for locality. As before, we assume:
Hypothesis 6.1**.**
is an AEC with (and countable vocabulary).
In the context of a nicely -stable AEC, the following definition generalizes that of a supersimple homogeneous model [BL03, 2.5(iv)]. The idea is that we want to have a nice notion of nonforking available for all finite sets (not only models). However we do not require that forking over finite sets satisfies any uniqueness requirement. Thus it is not a-priori clear that supersimplicity implies the existence of a good frame (although this will follow from -categoricity and Theorems 5.8, 6.10).
Throughout this section expressions such as “nonforking” or “not fork” will refer to the relation defined in Definition (6.2)(3) below. We give examples after the definition.
Definition 6.2**.**
Assume that is nicely -stable and categorical in . We say that is supersimple if there exists a 4-ary relation \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits such that:
- (1)
\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits(A,B,C,N) implies that , and are all finite or countable. We write B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C instead of \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits(A,B,C,N). Below, we may abuse notation and write e.g. instead of , or \bar{b}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}}^{N}\bar{c} instead of B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C, where , , stand for the ranges of , , and respectively. 2. (2)
Normality: B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C if and only if AB\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}AC. 3. (3)
Invariance under -embeddings: If and , then B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C, if and only if f[B]\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{f[A]}^{N^{\prime}}f[C]. This shows that \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits is really a relation on types, so we say does not fork over if \bar{b}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C. 4. (4)
Monotonicity: If B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C and then B^{\prime}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A^{\prime}}^{N}C. 5. (5)
Symmetry: If B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C, then C\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}B. 6. (6)
Local character: If and , then there exists finite such that does not fork over . 7. (7)
Extension: If does not fork over , then there is such that extends and does not fork over . 8. (8)
Transitivity: If B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C and B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{C}^{N}D with , then B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}D. 9. (9)
Relationship with splitting: If are both in , , and does not fork over , then there is finite such that does not split over .
Remark 6.3**.**
It may be helpful to compare Definition 6.2 with Definition 2.7. The idea of 6.2 is to give a sort of analog of good frames but to allow types over sets. Note that the statement of symmetry in 2.7 is more technical, precisely because types over sets are not allowed. However the idea is the same. Another difference is that local character in 6.2 is stated as “every type does not fork over a finite set”. In 2.7, it is stated as “every type over the union of an increasing chain does not fork over a previous element of the chain”. Again, the lack of types over sets makes it impossible to state the former in good frames.
Example 6.4**.**
- (1)
Working inside a supersimple homogeneous model (in the sense of [BL03, 2.5(iv)]), we can define B\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{A}^{N}C to hold if and only if is -free from over (in the sense of [BL03, 2.2]). The first four conditions of Definition 6.2 are then easy to check. Symmetry is [BL03, 2.14] and transitivity is [BL03, 2.15]. Local character and extension are given by the definition in [BL03, 2.5]. Now if in addition is -stable (in the sense of [BL03, 5.1] or equivalently in the sense given here), then by [BL03, 5.2] the last axiom of Definition 6.2 holds. 2. (2)
Let be a FUR class [HK16, 2.17] (this includes in particular all quasiminimal pregeometry classes). Then letting \mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits be defined as in [HK16, 2.38], we can also check that it satisfies Definition 6.2.
We first show that if a type over a finite set does not fork over a subset of a countable model , then the type is realized inside .
Lemma 6.5**.**
Assume that is nicely -stable, supersimple, and categorical in . Let both be in , and let be finite. Let . If does not fork over , then is realized in .
Proof.
Extending if necessary, we can assume without loss of generality that is brimmed over . Let be a nonforking extension of . Let be an enumeration of . Fix finite and big-enough such that , does not split and does not fork over and does not split over (recall Fact 5.3). Let be such that is brimmed over and contains . Let be such that realizes . We have that \bar{b}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M so by symmetry and monotonicity, \bar{d}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}\bar{b}. By extension, we can pick such that , contains , and \bar{d}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{M_{0}}^{N}M_{0}^{\prime}. Now as does not split over a finite subset of and realizes , we must have by Lemma 5.4 that realizes , as desired. ∎
We will prove locality in supersimple -stable AECs by a back and forth argument. More precisely, we start with , brimmed over , and elements whose types over every finite subset of match. First, we will do a back and forth argument to find an automorphism of sending to and fixing setwise (Lemma 6.8). We will then use this automorphism and nonsplitting to build another automorphism that fixes pointwise (Theorem 6.10).
The next lemma starts setting up the stage by making sure that we can map an element of to an element of .
Lemma 6.6**.**
Assume that is nicely -stable, supersimple, and categorical in . Let both be in . Let , be such that . If \bar{b}_{1}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{1}}^{N}\bar{c}_{1}, then there exists such that .
Proof.
Extending if necessary, we can assume without loss of generality that is brimmed over . By symmetry, \bar{c}_{1}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{1}}^{N}\bar{b}_{1}. Let be an automorphism of sending to . By invariance, f(\bar{c}_{1})\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}}^{N}\bar{b}_{2} (but we do not know that ). Let . We have to show that is realized in . Since does not fork over , this is exactly what Lemma 6.5 tells us. ∎
Our main lemma in the back and forth argument will be:
Lemma 6.7** (The back and forth lemma).**
Assume that is nicely -stable, supersimple, and categorical in . Let both be in with brimmed over . Let , be such that and \bar{b}_{\ell}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{\ell}}^{N}M for . If , , there exists and such that:
- (1)
. 2. (2)
\bar{b}_{\ell}\bar{d}_{\ell}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{\ell}\bar{c}_{\ell}\bar{d}_{\ell}^{\prime}}^{N}M for .
Proof.
Using Lemma 6.6, we can enlarge and if necessary to assume without loss of generality that is empty. Now using local character, fix such that \bar{b}_{1}\bar{d}_{1}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{1}\bar{c}_{1}}^{N}M. By Lemma 6.6, there exists such that . Let be an automorphism of witnessing this. By extension and monotonicity, pick such that and \bar{d}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}\bar{b}_{2}\bar{c}_{2}}^{N}M\bar{b}_{2}. It remains to see that \bar{b}_{2}\bar{d}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}\bar{c}_{2}}^{N}M. We do this using a standard nonforking calculus argument: by normality, \bar{b}_{2}\bar{d}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}\bar{b}_{2}\bar{c}_{2}}^{N}M\bar{b}_{2} and we also know from the hypotheses of the lemma that \bar{b}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}}^{N}M, so by monotonicity and normality \bar{a}_{2}\bar{b}_{2}\bar{c}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}\bar{c}_{2}}^{N}M. Now using transitivity, monotonicity, and symmetry, \bar{b}_{2}\bar{d}_{2}\mathop{\hbox{\lower 2.0pt\hbox to12.77773pt{\hfil\vrule width=0.3pt,depth=-2.0pt,height=10.0pt\hfil}\lower 2.0pt\hbox{\textstyle\smile}}}\limits_{\bar{a}_{2}\bar{c}_{2}}^{N}M, as desired. ∎
We can now build the desired automorphism which fixes setwise.
Lemma 6.8**.**
Assume that is nicely -stable, supersimple, and categorical in . Let , finite, such that and do not fork over . If , then there exists an automorphism of fixing such that .
Proof.
Let be brimmed over . Say , . Let be an enumeration of and let , . Now apply Lemma 6.7 repeatedly in a back and forth argument to build an automorphism of fixing such that and . Let . ∎
We now show that we can actually build an automorphism fixing pointwise. The next lemma is the main argument for this:
Lemma 6.9**.**
Assume that is nicely -stable, supersimple, and categorical in . Let and let be brimmed over . Let be such that for all finite . For any , there exists such that for all finite .
Proof.
Let , . Fix finite such that both and do not fork over and does not split over . By Lemma 6.8, there exists an automorphism of fixing such that . Let be an automorphism of extending such that and let . We claim that this works. Fix finite and let be an enumeration of . Let . We know that , so by nonsplitting, . Applying , we have that . Putting the two equalities together, , so , as desired. ∎
We have arrived to the main theorem of this section:
Theorem 6.10**.**
If is nicely -stable, supersimple, and categorical in , then is -local (recall Definition 5.6).
Proof.
Let and let be such that for all finite . Let be brimmed over and let realize and respectively. Now apply Lemma 6.9 in a back and forth argument to get an automorphism of fixing taking to . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Bal 09] John T. Baldwin, Categoricity , University Lecture Series, vol. 50, American Mathematical Society, 2009.
- 2[BGKV 16] Will Boney, Rami Grossberg, Alexei Kolesnikov, and Sebastien Vasey, Canonical forking in AE Cs , Annals of Pure and Applied Logic 167 (2016), no. 7, 590–613.
- 3[BHH + 14] Martin Bays, Bradd Hart, Tapani Hyttinen, Meeri Kesälä, and Jonathan Kirby, Quasiminimal structures and excellence , Bulletin of the London Mathematical Society 46 (2014), no. 1, 155–163.
- 4[BL 03] Steven Buechler and Olivier Lessmann, Simple homogeneous models , Journal of the American Mathematical Society 16 (2003), no. 1, 91–121.
- 5[BL 16] John T. Baldwin and Paul B. Larson, Iterated elementary embeddings and the model theory of infinitary logic , Annals of Pure and Applied Logic 167 (2016), 309–334.
- 6[BLS 15] John T. Baldwin, Paul B. Larson, and Saharon Shelah, Almost Galois ω 𝜔 \omega -stable classes , The Journal of Symbolic Logic 80 (2015), no. 3, 763–784.
- 7[BS 08] John T. Baldwin and Saharon Shelah, Examples of non-locality , The Journal of Symbolic Logic 73 (2008), 765–782.
- 8[BV] Will Boney and Sebastien Vasey, Good frames in the Hart-Shelah example , Archive for Mathematical Logic, to appear. URL: http://arxiv.org/abs/1607.03885 v 4 . DOI: 10.1007/s 00153-017-0599-7 .
