An AEC framework for fields with commuting automorphisms
Tapani Hyttinen, Kaisa Kangas

TL;DR
This paper develops an Abstract Elementary Class framework for fields with multiple commuting automorphisms, extending the model theory of difference fields and establishing properties like amalgamation, homogeneity, and simplicity.
Contribution
It introduces FCA-classes as a new AEC framework for fields with commuting automorphisms, generalizing the ACFA setting and analyzing their model-theoretic properties.
Findings
FCA-classes have AP and JEP, ensuring a monster model.
Galois types coincide with existential types in these models.
The monster model is a simple homogeneous structure.
Abstract
In this paper, we introduce an AEC framework for studying fields with commuting automorphisms. Fields with commuting automorphisms are closely related to difference fields. Some authors define a difference ring (or field) as a ring (or field) together with several commuting endomorphisms, while others only study one endomorphism. Z. Chatzidakis and E. Hrushovski have studied in depth the model theory of ACFA,the model companion of difference fields with one automorphism. Our fields with commuting automorphisms generalize this setting. We have several automorphisms and they are required to commute. Hrushovski has proved that in the case of fields with two or more commuting automorphisms,the existentially closed models do not necessarily form a first order model class. In the present paper, we introduce FCA-classes, an AEC framework for studying the existentially closed models of the…
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.
Taxonomy
TopicsPolynomial and algebraic computation · Logic, programming, and type systems
An AEC framework for fields with commuting automorphisms
Tapani Hyttinen and Kaisa Kangas
Abstract.
In this paper, we introduce an AEC framework for studying fields with commuting automorphisms. Fields with commuting automorphisms are closely related to difference fields. Some authors define a difference ring (or field) as a ring (or field) together with several commuting endomorphisms, while others only study one endomorphism. Z. Chatzidakis and E. Hrushovski have studied in depth the model theory of ACFA, the model companion of difference fields with one automorphism. Our fields with commuting automorphisms generalize this setting. We have several automorphisms and they are required to commute. Hrushovski has proved that in the case of fields with two or more commuting automorphisms, the existentially closed models do not necessarily form a first order model class. In the present paper, we introduce FCA-classes, an AEC framework for studying the existentially closed models of the theory of fields with commuting automorphisms. We prove that an FCA-class has AP and JEP and thus a monster model, that Galois types coincide with existential types in existentially closed models, that the class is homogeneous, and that there is a version of type amalgamation theorem that allows to combine three types under certain conditions. Finally, we use these results to show that our monster model is a simple homogeneous structure in the sense of S. Buechler and O. Lessman (this is a non-elementary analogue for the classification theoretic notion of a simple first order theory).
Research of the second author was supported by grant 310737 of the Academy of Finland
Contents
- 1 Introduction
- 2 A remark on existential types in multiuniversal classes
- 3 The AEC framework
- 4 Independence
- 5 Simplicity
1. Introduction
A field with commuting automorphisms is a field together with distinguished field automorphisms that are required to commute, i.e. for all . Fields with commuting automorphisms arise as a generalisation of fields with one distinguished automorphism. A difference field is sometimes defined to be a field with one distinguished automorphism (see e.g. [10]) but some authors (e.g. [16]) employ the term to refer to a field with several commuting automorphisms. A. Macintyre showed in [17] that the class of existentially closed difference fields with only one automorphism is first-order axiomatizable, i.e. that the theory of difference fields with one automorphism has a model companion. Z. Chatzidakis and E. Hrushovski call this model companion ACFA. They studied its model theory in depth in [5], and continued this effort together with Y. Peterzil in [8]. Hrushovski used the results on difference fields in his model theoretic proof for the Manin-Mumford conjecture, a statement in arithmetic geometry [13]. Moreover, Chatzidakis and Hrushovski have used model theory of difference fields to study algebraic dynamics in [6, 7]. These results highlight the potential for applications in this line of research.
In a difference field, there is a geometry of difference varieties where zero sets of difference polynomials generate the closed sets in a Noetherian topology that resembles the Zariski topology on an algebraically closed field (see e.g. [10, 16]). Here, the existentially closed difference fields play a similar role as algebraically closed fields in algebraic geometry. In [5], Chatzidakis and Hrushovski described the dimension theory for ACFA, including a decomposition into one-dimensional definable sets. They classified the possible combinatorial geometries underlying the one-dimensional sets and proved that Zilber’s Trichotomy holds in characteristic 0. In [8], they presented a new proof for the trichotomy result that also applies in positive characteristic.
ACFA falls in the class of simple unstable theories that was identified by S. Shelah [20, 21]. In this context, non-forking has all the usual properties, but unlike in stable theories, stationarity fails. A good substitute can be found in the Independence Theorem, which can be used to combine types and allows one to generalise the notions of generic type of a group and of stabilisers of types to groups definable in models of ACFA. B. Kim and A. Pillay showed in [15] that a first order theory is simple if and only if it has a notion of independence that has the usual properties of non-forking and satisfies the Independence Theorem.
In [5], Chatzidakis and Hrushovski define an independence notion in models of ACFA by letting, for any set , the model be the field that is obtained by closing the field generated by the set with respect to the distinguished automorphism and its inverse, and then taking the (field theoretic) algebraic closure. They then define to be independent from over if is algebraically independent from over . This notion inherits the usual properties of non-forking from algebraic independence in fields, and Chatzidakis and Hrushovski show that it satisfies a more general version of the independence theorem (Generalised Independence Theorem) that allows them to combine any finite number of types simultaneously. This implies, by [15], that the theory of ACFA is simple and the independence relation coincides with the usual notion of non-forking.
A natural way to generalise a difference field is to add more distinguished automorphisms, and in [13], Hrushovski works at times in this more general setting. However, there the geometries become quite wild, and the topology obtained from zero sets of difference polynomials is no longer Noetherian. Moreover, the strongest results from [5] do not apply. Thus, it makes sense to pose some restrictions to the group of distinguished automorphisms in order to get a more well-behaved model class. A natural idea is to require the automorphisms to commute. However, here one runs into the problem that the existentially closed models of the theory of fields with several commuting automorphisms do not form a first order model class. Hrushovski has come up with a counterexample already in the case of two automorphisms (the proof can be found from [14]).
However, the existentially closed models of the theory of fields with commuting automorphisms do form an abstract elementary class (AEC), and in many instances, geometric stability theory can be developed for AECs. In the present paper, we introduce FCA-classes, an AEC framework for studying fields with commuting automorphisms. The main difference to difference fields is that existentially closed models of the theory of fields with commuting automorphisms are not necessarily algebraically closed as fields (see Example 3.1). We solve this problem by taking an FCA-class to consist of the relatively algebraically closed models of the theory of fields with commuting automorphisms (see Definition 3.2). This class will contain all the existentially closed models, and in particular, it will have an existentially closed monster model.
An FCA-class will have the amalgamation property (AP) (Lemma 3.11) and joint embedding property (JEP) (Lemma 3.13), and thus we can work in a -universal and -model homogeneous monster model for an arbitrary large cardinal . Moreover, the class will be homogeneous, in existentially closed models, existential types will coincide with Galois types, and we get a first order characterisation for Galois types in all models (Lemma 3.14). Following the lines of [5], we define an independence notion that is based on algebraic independence in fields (Definition 4.1). We then show that it has the properties of non-forking that one would expect in a simple unstable setting (Lemma 4.4).
Moreover, we prove a version of the independence theorem that allows us to combine three types if they satisfy certain conditions (Theorem 4.7). One of the main differences to [5] is that we need to require that one of these types has certain technical qualities which we call nice (see Definition 4.6). We show that any type has a free extension that is nice (Lemma 4.8). Thus, when examining a specific type – which is often the case in geometric stability theory – we can always replace it with a nice one by extending the base. This is in line with other results on stability theory in non-elementary settings where it is not usually possible to consider types over arbitrary sets but they need to be extended to “rich” enough models.
Simplicity is often a minimum requirement for geometric stability theory. S. Buechler and O. Lessman introduced a notion of simplicity in one non-elementary context, that of strongly homogeneous structures [4]. A monster model for an FCA-class is strongly homogeneous in the sense of [4], and we will prove that it is also simple in their sense (Corollary 5.10). Buechler and Lessman show that a simple strongly homogeneous model satisfies a version of the Independence Theorem which they call the type amalgamation theorem (Theorem 3.8 in [4]). Adapted to our context, it states that if , , and are finite tuples such that
- (1)
is independent from over , 2. (2)
and have the same Lascar strong type over (i.e. they are equivalent in every -invariant equivalence relation that has only boundedly many equivalence classes), 3. (3)
is independent from over ,
then there is some that realizes the Lascar strong type of over for and is independent from over . This will, then, also be true of a monster model of an FCA-class. It follows that we will be able to use our independence theorem (Theorem 4.7) without the niceness assumption if we know that one of the types implies that and have the same Lascar type over .
The present paper is a beginning of the stability theoretic study of fields with commuting automorphisms in an AEC framework. In the future, we aim to investigate whether some of the results that hold in ACFA could be generalised to our context.
This paper is structured as follows. In section 2, we take a detour to a more general framework of multiuniversal AECs and study existential types there. We show that under certain conditions, there is a first order characterisation for Galois types, existential types determine Galois types, and the class is homogeneous. Moreover, under additional assumptions of AP and JEP, first order types will coincide with Galois types in existentially closed models.
In section 3, we turn our attention to fields with commuting automorphisms, introduce our AEC framework, prove some of its basic properties and point out that it is a multiuniversal AEC satisfying the requirements given in section 2. It then follows that in existentially closed models, Galois types are the same as existential types and the class is homogeneous. In section 4, we present our independence notion, and show that it has the usual properties of non-forking and prove our version of the independence theorem. Finally, in section 5, we use these results to show that the class is simple in the sense of [4].
We denote the field theoretic algebraic closure of by . Moreover, we follow the usual model theoretic convention and write for and to denote that is a tuple of elements from . Most of the time we use this notation for finite tuples, and when we deal with infinite tuples, we mention it specifically.
2. A remark on existential types in multiuniversal classes
In this section, we work in a more general framework than in the rest of the paper and take a look at existential types in multiuniversal classes. In this context, a closure operation can be defined inside a model by taking the smallest strong submodel that contains a given set (see Definition 2.10). We will show that if there exists a collection of quantifier free formulae which determines the closure and satisfies some additional requirements, then Galois types coincide with types that are determined by a collection of first order formulae (Lemma 2.20). Moreover, if the class has AP and JEP, then it is homogeneous (Corollary 2.26) and in existentially closed models, Galois types will be the same as existential types (Corollary 2.24). The abstract elementary class that we present in the next section as a framework for studying fields with commuting automorphisms will satisfy these assumptions. A reader who so wishes can skip this section and go straight to the next one where we start working in the more specific setting of fields with commuting automorphisms.
In [1] (Theorem 3.3), it is proved that in multiuniversal classes, Galois types of infinite sequences are determined by the Galois types of finite subsequences, and this implies that a multiuniversal class with AP and JEP is homogeneous. However, our result (Lemma 2.20) will imply Theorem 3.3. in [1], as we will point out in Remark 2.22. In [19] (Lemma 2.10), it is shown that in a suitable subclass of an essentially -definable class, existential types coincide with automorphism types in sufficiently rich models. However, automorphism types do not necessarily imply Galois types unless the class has AP and JEP. In Example 2.13, we will present a multiuniversal and -definable AEC where amalgamation fails and Galois types do not coincide with existential types even in existentially closed models.
In the setting of [19], Galois types are the same as existential types if the class has AP and JEP and there are arbitrarily large rich structures, but it is not evident that such structures can be always found. In contrast to this, our framework gives a characterisation for Galois types in all models. Moreover, we get both homogeneity and the characterisation of Galois types as result of the same proof. Furthermore, [19] implicitly makes some cardinal assumptions (see the discussion on p. 4 there, just before Definition 2.7). It is possible to get rid of those assumptions by modifying the proof, but it requires some extra effort.
We now recall some basic notions related to AECs. We will use the terms model and structure interchangeably. For basic terminology in model theory, see [18].
Definition 2.1**.**
Let be a countable language, let be a class of -structures and let be a binary relation on . We say is an abstract elementary class (AEC for short) if the following hold.
- (1)
Both and are closed under isomorphisms. 2. (2)
If and , then . 3. (3)
The relation is a partial order on . 4. (4)
If is a cardinal and is a -increasing chain of structures in , then
- a)
; 2. b)
for each , ; 3. c)
if and for each , , then . 5. (5)
If , , and , then . 6. (6)
There is a Löwenheim-Skolem number such that if and , then there is some structure such that and .
If , we say is a strong substructure of .
Definition 2.2**.**
Let be an AEC, and let . We say a map is a strong embedding if is an isomorphism and .
Definition 2.3**.**
Let be an AEC, and let be a cardinal. A model is -universal if for every such that , there is a strong embedding .
Definition 2.4**.**
Let be a cardinal. A model is - model homogeneous if whenever are such that and is an isomorphism, then extends to an automorphism of .
Definition 2.5**.**
We say an AEC has the amalgamation property if for any such that there are strong embeddings and , there is some and strong embeddings and such that .
Moreover, if and the embeddings and can be chosen so that , then we say has the disjoint amalgamation property.
Definition 2.6**.**
We say an AEC has the joint embedding property if for any , there is some and strong embeddings , .
It is well known that if is an AEC with AP and JEP, then it contains, for each cardinal , a -universal and - model homogeneous model (see e.g. [2], Exercise 8.6). In a context like that, it is practical to work inside such a model for some large , and we call it a monster model for . This will be the case with the AEC framework that we will present in the next section. If and , we say is a strong submodel of . We now recall the notion of Galois types. If a monster model exists, then Galois types will become orbits of automorphisms of the monster.
Since our goal is to give an alternative proof to a result from [1], we want to give the exact same definition for Galois types that they use (Definition 2.16 in [22]). Note that the below definition requires .
Definition 2.7**.**
Let be an AEC, and let be the set of triplets , where , , and is a (possibly infinite) sequence of elements from . We define Galois types as follows.
- •
If , we define the relation so that if , and there exist some and strong embeddings and such that and .
- •
We let be the transitive closure of (note that is an equivalence relation).
- •
For , we let the Galois type of over in , denoted to be the - equivalence class of .
If the model is clear from the context (e.g. when we will be working in a universal, model homogeneous monster model), we will write just for .
Definition 2.8**.**
Let be a collection of first order formulae, let be a model, let , and let be a finite tuple. We define the -type of over in , denoted , to be the set of all formulae where either or , and is a finite tuple, such that .
Definition 2.9**.**
Let be a collection of first order formulae. We define a --type over a set to be a collection of formulae , where or is in , and is a tuple from , such that for some model containing and some -tuple , .
If is taken to be the collection of all formulae of the form , where is quantifier free, then we call -types existential types and use to denote the existential type of over in .
We now recall the definition of a multiuniversal class, introduced in [1] (Definition 2.8).
Definition 2.10**.**
Suppose is an AEC. For any , we define
[TABLE]
We say that is a multiuniversal class if the following hold:
- (i)
For all and , it holds that and ; 2. (ii)
If , , and , then is algebraic (i.e. has only finitely many realisations in ).
Lemma 2.11**.**
Let be a multiuniversal AEC, , and let , be possibly infinite sequences such that . Then, there is an isomorphism such that .
Proof.
It suffices to prove the lemma in case . Then, there is some and strong embeddings and such that Since is the smallest strong submodel of containing , we have by transitivity of . Likewise, , and gives the desired isomorphism. ∎
Next, we illustrate with an example that if amalgamation fails in a -definable multiuniversal AEC, then Galois types do not necessarily coincide with existential types even in existentially closed models.
Definition 2.12**.**
Let be an AEC. We say a model is existentially closed if the following condition holds: if , , , is a quantifier free formula, and , then .
Example 2.13**.**
Let , where is a unary predicate, and are binary predicates, and is a constant symbol. Let be a theory that states the following:
- •
;
- •
If , then , , and ;
- •
If , then , , , and ;
- •
For any , there are at most two such that ;
- •
If and , then there is no such that .
Let be the AEC that consists of models of , equipped with the submodel relation. The theory is clearly -axiomatizable, and is a multiuniversal class with .
The class does not have amalgamation. Indeed, let be a model and let be such that there is no with . Then, there are and , such that , , , , and . Now, and cannot be amalgamated over .
In , Galois types are not the same as existential types, not even in existentially closed models. Indeed, let be existentially closed, and suppose are such that , , and . Now, since and . On the other hand, . Indeed, let be such that , where . There are strong embeddings and with , and , so , and .
We will prove that existential types imply Galois types in the case that the closure operation from Definition 2.10 is obtained from a collection of quantifier free first order formulae that satisfy certain requirements, as explained in the following definition.
Definition 2.14**.**
Let be a collection of quantifier free formulae of the form , where is a single variable and a tuple of variables, such that whenever and , then is finite. Moreover, suppose the formula is in .
If and , we define the -closure of in , denoted -, to be the set of all elements such that there is a formula and a finite tuple such that .
In our main results, we will assume we are working in a multiuniversal class and - equals the closure operator from Definition 2.10.
Note that -cl depends on , and the requirements for the collection are rather strong: if , then the set must be finite for all and . Thus, for example, the formula cannot be in if contains infinite models.
Next, we will define a collection of first order formulae such that . We will eventually show that if we are working in a multiuniversal AEC and -closure equals the closure operation from Definition 2.10, then Galois types will coincide with -types (see below). After that, we will point out that existential types imply -types and thus Galois types.
If is as in Example 2.13, and we take to consist of formulae of the form and , then, for any and , we have -.
Definition 2.15**.**
Let be a single variable and use as shorthand for the formula stating that there are exactly many such that , and define the collection of to consist exactly of the formulae that we can construct recursively as follows (i.e. (ii) and (iii) can be iterated):
- (i)
If is an atomic formula or a negated atomic formula, then ; 2. (ii)
If , then ; 3. (iii)
If , for , and , then .
Note that contains all quantifier free formulae, and thus . Note also that when we build the formulae using the recipe from the definition, we are only allowed to quantify over the (single) variable , and the variables will remain free.
The motivation behind the collection is to define a set of formulae such that in a multiuniversal AEC, under the assumption that - equals the closure operator from Definition 2.10, defines the isomorphism type over the (possibly infinite) tuple of the set which you get when you close under the operation - (i.e. if , then - will be isomorphic with -). In the proof of Lemma 2.20 we will see that - actually works this way.
Note that depends on the collection since Definition 2.15, (iii) requires that . The collection will not, generally, contain all existential formulae, but only those needed for the description. Note also that - will not generally be a closure operator but we are interested in cases where it coincides with the closure operatorfrom Definition 2.10.
In Example 2.13, -types are equivalent to quantifier free types in a given if we take, again, to consist of formulae of the form and . Indeed, if is a formula constructed as in (iii) of Definition 2.15 and there is some and such that , then must be of the form or and . It then follows inductively that all satisfiable formulae are equivalent to quantifier free formulae (in the sense that for each formula that is satisfiable in some , there exists a quantifier free formula such that for any and , if and only if ).
As another example, consider the structure , where if . If , we define }. Take to consist of formulae of the form and . Now, Definition 2.15 gives a way to construct recursively the formulae that prove . For example, if , then we can write a formula such that if and only if . Indeed, let
[TABLE]
where
[TABLE]
The way we defined and - in Definitions 2.14 and 2.15 might not feel natural to some model theorists. In the following remark, we present an alternative way to define and - which is more in line with the usual conventions in model theory. However, we chose to use Definitions 2.14 and 2.15 since we have found them more practical. Nevertheless, the same results can be obtained with the following alternative definition.
Remark 2.16**.**
In Definition 2.14, we required that if , then is finite for any and . This is a rather strong requirement since we require the set defined by to be finite in all models in . However, we could define and - alternatively as follows. Let be a collection of quantifier free formulae of the form , where is a single variable and a tuple of variables, such that the formula is in , and if the formula is in , then the formula is in . Moreover, we require that if and , then is -existentially closed in (i.e. if , is a finite tuple, and is such that , then there is some such that ).
If and , we define - to be the set of all elements such that there is a formula and a finite tuple such that and is finite. Define then the collection exactly as in Definition 2.15.
Consider formulae that are as in Definition 2.15 (iii). We will see that if we define as in Definition 2.14, then we can actually omit the last conjunct () in those formulae (it is not needed in the proofs in the rest of this section). That is, we can assume that item (iii) in Definition 2.15 stands as follows:
- (iii)
If , for , and , then .
However, with the alternative definition described above, we will need that last conjunct when we prove that Galois types imply -types (see the proof of Lemma 2.20 and Remark 2.21).
From now on, we will assume we are working in a multiuniversal AEC and that the collections and are as in Definitions 2.14 and 2.15. We will repeat these assumptions in statements of theorems and key lemmas.
Definition 2.17**.**
Let and let be a formula with parameters from such that is finite. Let be a collection of formulae with free variables , with parameters from . If is a tuple, and for all formulae with , then we say that is a generic realisation of with respect to in .
Unless mentioned otherwise, we will assume consists of all the formulae from with parameters from some set . We then say is generic over in .
Our proof that Galois types agree with -types if the two closures coincide will be based on the fact that for each singleton -, there is some formula with parameters from such that is a generic realisation of in with respect to the collection of -formulae with parameters from . The formula then determines the -type of in .
Lemma 2.18**.**
Let be a model, let be a formula with parameters in , and let be a set of formulae in the free variables and with parameters in . Assume that is finite and contains the tuple and there is some formula such that . Then there is a formula such that and whenever is satisfied by in , then .
In particular, if is a formula with parameters in , and , then there is an -formula in such that is a generic of over in .
Proof.
This follows immediately from the fact that the infimum of
[TABLE]
is attained for some .
∎
Lemma 2.19**.**
Suppose and are models, , , are two possibly infinite sequences, , - is a generic realisation of over in , and . Then, there is some - such that .
Proof.
Write , , and let be such that for . Since -, there is some formula such that . As is a generic realisation of over , we have . We will find an element which is a generic realisation of over in , and then show that is as wanted.
Suppose, for the sake of contradiction, that no element in is generic over . Let and . The formula
[TABLE]
is in , , and , so .
Write . By the counterassumption, there is, for each , some formula such that and . Denoting
[TABLE]
we have . Since and there are exactly many distinct such that , we have , and thus . On the other hand, , and thus for each , which contradicts the genericity of .
Thus, there is some which is a generic realisation of over in . Clearly -. We show that if , and , then (the other direction is symmetric). Since is a generic realization of over and , we have
[TABLE]
and thus any realization of satisfies
∎
Lemma 2.20**.**
Suppose is a multiuniversal AEC, and there is a collection of quantifier free formulae such that for all and , -. Then, for any , and any (possibly infinite) sequences , , it holds that if and only if .
Proof.
Suppose first . Since - and -, we have -, -, and by Lemma 2.11, there is an isomorphism -- such that .
We will prove the claim by showing that if and - is a finite tuple, then if and only if . We will do this by induction on the formula . If is quantifier free, the claim clearly holds. It is also easy to see that if the claim holds for and , then it holds for and .
Suppose now
[TABLE]
where for each , , and the claim holds for each . Assume . Let be the exactly many distinct elements such that . To be able to apply the induction hypothesis, we need to show that - for each . And indeed, we have , so -. Since -, we have
[TABLE]
Now, by the induction hypothesis, for . Moreover, these are all the elements of that satisfy this formula. Indeed, suppose for the sake of contradiction that there is some such that for , and . We have -, and since , it follows that -, so is defined at . Thus, which contradicts the fact that only many elements of satisfy this formula. Thus, . Similarly, we can show that . Hence, , and we have proved that Galois types imply -types.
For the other direction, let , and let , , be two sequences such that . We will find an isomorphism such that . To construct such an isomorphism, it is enough to show that if , then there is some such that . This follows from Lemmas 2.18 and 2.19.
Thus, we have seen that By multiuniversality, , and thus . Similarly, , and hence . ∎
Remark 2.21**.**
Note that if we define the set and the operator - as in Remark 2.16, then we need the last conjunct () of Definition 2.15 in the proof of Lemma 2.20 to conclude that -. Indeed, we get that , but we also need that is finite, and this follows from the fact that the formula contains as a conjunct.
Remark 2.22**.**
In [1], it is shown that if is a multiuniversal AEC, , , are possibly infinite sequences, and for any finite , it holds that , then (Theorem 3.3.). We note that our Lemma 2.20 implies this result.
To see this, let be a multiuniversal AEC, and let be the collection of all Galois types (of arbitrarily long finite tuples) such that there is some , some finite tuple , and an element such that and realises . Introduce new relation symbols for , and let be the class that consists of exactly the models of , but with extra structure that is given by interpreting the relations so that if and only if realises . Define the strong submodel relation in so that if and only if holds for the restrictions and of and , respectively, to the original language. Let be the collection of the formulae , .
The class is clearly a multiuniversal AEC since is. The relations are preserved under isomorphisms since isomorphisms preserve Galois types. Thus, strong embeddings stay the same in the new class and preserve the relations .
We want to apply Lemma 2.20 to show that in this setting, Galois types are the same as existential types. The result will then follow since existential types of infinite sequences are determined by the existential types of their finite subsets. To be able to use the lemma, we need to show that for all and , -. If , then there is, by Fact 2.2 in [1] (or Proposition 2.14 in [23]), some finite such that . Then, , , and by condition (ii) of Definition 2.10, is finite, so --
To see that -, we need to prove that Galois types determine the closure operation , i.e. that if , , , , and , then . For this, it suffices to show that if and , then . Suppose not. By the definition of the relation (see Definition 2.7), there is some and elementary embeddings and such that and . Now but , a contradiction.
Recall our standing assumptions that we are working in a multiuniversal AEC and that and are as in Definitions 2.14 and 2.15.
Lemma 2.23**.**
Let , be models, and let , be finite tuples. If , then
Proof.
Suppose and . We prove by induction on the formula . The claim holds for quantifier free formulae, and if it holds for and , then it holds for , and .
Suppose now
[TABLE]
where for each , , and the claim holds for each . Assume . Since , we have . Let enumerate the elements in . Apply now Lemma 2.18 to the formula and to the set of existential formulae in variables with parameters in , to find an existential -formula such that and for any existential formula , it holds that . Then, any realization of satisfies exactly the same existential formulae as over , and therefore has the same existential type over .
Since , we have . If is such that , then . Hence, there is a map such that and preserves existential types.
Thus, if is such that , then the inductive assumption gives for , so there are at least many elements such that . If there were more than many of them, applying the same argument in the other direction, we would get that for more than many elements , a contradiction. Thus, . ∎
Corollary 2.24**.**
Let be a multiuniversal AEC, and suppose there is a collection of quantifier free formulae such that for all and , -. Then, existential types determine Galois types. Moreover, if has AP and JEP and is existentially closed, then Galois types coincide with existential types in .
Proof.
By Lemmas 2.20 and 2.23, existential types determine Galois types. Suppose has AP and JEP and is existentially closed. Then, has a monster model such that . If are two (possibly infinite) sequences such that ), then there is some automorphism of that sends to (cf. Definition 2.4 and the paragraph after). Since is existentially closed,
[TABLE]
∎
Before presenting the main result, we recall the definition of a homogeneous class.
Definition 2.25**.**
Let be a cardinal. We say a model is strongly -homogeneous if the following holds for all sequences , : If for every finite , then there is an automorphism of with for .
We say an AEC is homogeneous if it has a strongly -homogeneous monster model for every cardinal .
Corollary 2.26**.**
Suppose is a multiuniversal AEC with AP and JEP, and there is a collection of quantifier free formulae such that for all and , -. Then, is homogeneous.
Proof.
For each cardinal , the class has a -universal and - model homogeneous monster model . By Corollary 2.24, in , Galois types are the same as existential types. Since existential types of infinite sequences are determined by the existential types of their finite subsets, is -homogeneous. ∎
3. The AEC framework
We now turn our attention to fields with commuting automorphisms. We take our signature to be
[TABLE]
and let be the first order theory that states is a field, are automorphisms of , that they commute, and that for each , the map is the inverse of . We denote the field theoretic algebraic closure of a field by . Moreover, if is a field and , we use the shorthand for , where is the subfield generated by .
One of the main differences between our setting and that of difference fields is that in our case, existentially closed models need not be algebraically closed as fields. When we have a field with several automorphisms, each one of the automorphisms extends to the (field-theoretic) algebraic closure but there are many cases in which the lifts cannot be chosen so that they would still commute. The following example illustrates one such case.
Example 3.1**.**
By [11], there exists a number field such that , the quaternion group given by the generating relations
[TABLE]
The center of is , and by the fundamental theorem of Galois theory, there is some intermediate field of such that . Then, , a commutative group whose elements correspond with the cosets of , , , and . Take the elements corresponding to (say) the cosets of and . Possible lifts to are or and or , respectively, but none of these commute with each other. So, these commuting automorphisms of do not have commuting lifts even to , and thus not to either.
To address this problem, we will look at algebraically maximal (see below) models rather than algebraically closed ones. Eventually, we will work inside a monster model, and then the notion of being an algebraically maximal model will coincide with being relatively algebraically closed as a subfield of the monster.
Definition 3.2**.**
Let . We say is an algebraically maximal model of if the following holds: Suppose and , and let be a non-zero polynomial in one variable with coefficients from . If is such that , then .
Remark 3.3**.**
We note that every algebraically maximal model of is perfect as a field. Indeed, let and suppose . The Frobenius map defines an isomorphism , and the perfect closure of equals . Each distinguished automorphisms , , has the unique extension to . Clearly, the automorphisms , , commute.
We use the notion relatively algebraically closed in its usual algebraic sense, i.e. if are fields, we say is relatively algebraically closed in if .
We want to work inside a monster model, and thus we need to build our AEC in such a way that it has the joint embedding property (JEP) and amalgamation property (AP) (see Definitions 2.5 and 2.6).
In order to obtain the JEP, we will fix a prime model that will be contained in each model. We will then take the class to consist of all algebraically maximal models of that contain the prime model.
In [5], a closure operator is defined on a difference field by first closing a set under the distinguished automorphism and then taking the (field theoretic) algebraic closure. We take the same approach, but in order to obtain a model of , we use the relative algebraic closure instead of the algebraic closure.
Definition 3.4**.**
If is an algebraically maximal model of and , then we define to be the smallest subfield of that is closed under the distinguished automorphisms and relatively algebraically closed in .
Definition 3.5**.**
Suppose is a algebraically maximal model of , and let . We define the class to consist of all algebraically maximal models of that contain . If , we define if . We say a class obtained this way is an FCA-class (for Fields with Commuting Automorphisms).
Note that at this point we do not yet know whether since we do not know if is an algebraically maximal model of . However, as soon as we prove that we can amalgamate over it (Lemma 3.9), it will turn out that it is.
Remark 3.6**.**
Note that if and , then .
The idea of the proof for the amalgamation result comes from the proof of Theorem (1.3) in [5], and it is based on the fact that if two fields, and , are linearly disjoint over (inside some large field), then the tensor product is a domain (for more on linear disjointness of fields, see e.g. [9], chapter 11.6).
Lemma 3.7**.**
Let and . Suppose is some field such that , and assume and are linearly disjoint over . Let and be the distinguished automorphisms of and , respectively. Suppose for , and suppose these restrictions give the distinguished automorphisms of . Then, the automorphisms and , have a unique common extension to the field composite of and in for , and these extensions commute.
Proof.
Let be the composite of the fields and in . Since and are linearly disjoint over , is the field of quotients of . Define automorphisms , of so that for , . Now, and for , and the automorphisms clearly commute. ∎
To prove the amalgamation property, we need the following fact from algebra.
Fact 3.8**.**
Suppose is a separable field extension, and is relatively algebraically closed in (in other words, the extension is regular). Then, and are linearly disjoint over in .
Proof.
See e.g. [9], Theorem 11.6.15. ∎
Lemma 3.9**.**
Suppose is a FCA-class, , , and is such that and is relatively algebraically closed (as a field) in . Then, there exists some such that and an embedding such that and
Proof.
If and are the distinguished automorphisms of and , respectively, then the distinguished automorphisms of are given by , for .
Embed the fields and (as pure fields) into some large algebraically closed field . Since is relatively algebraically closed in , we may assume and are algebraically independent (and thus linearly disjoint) over (if needed, use an automorphism of to move while fixing . By Remark 3.3, is a perfect field, and since is relatively algebraically closed in , it is also perfect. Thus is a separable extension, and by Fact 3.8, and are linearly disjoint over . Hence, and are linearly disjoint over . By Lemma 3.7, the automorphisms and have commuting extensions to the composite of and , and these extensions commute. Now, . ∎
Remark 3.10**.**
Note that it follows from Lemma 3.9 that if is an FCA-class, and , then . Indeed, suppose , , is a non-zero polynomial with coefficients from , and is such that . By Lemma 3.9, there is some such that and an embedding such that . Since , is a root of , and since is an algebraically maximal model of , we have , and thus . Now since is relatively algebraically closed (as a field) in .
Thus, in particular, for the field from Definition 3.5, we have .
It is easy to see that an FCA-class is an abstract elementary class (AEC), and from Remark 3.10, it follows that it is multiuniversal in the sense of [1] (see Definition 2.10 in the present paper). Indeed, if is an FCA-class, are such that and , then , and thus .
FCA-classes serve as examples of a multiuniversal class that is not universal (as an AEC) (see Example 2.7 in [1]). Moreover, it is easy to see that if we take the collection to consist of formulae of the form , where , and each is an -term, then the -closure coincides with the -closure from Definition 2.14. We will use Corollary 2.26 to show that it is a homogeneous class and that existential types imply Galois types, but first we need to show that it has AP and JEP.
Lemma 3.11**.**
If is an FCA-class, then has the disjoint amalgamation property.
Proof.
Since is an -theory, every model of embeds into an existentially closed model of . Since existentially closed models of are algebraically maximal models of , the result follows from Lemma 3.9. ∎
Remark 3.12**.**
Note that we have an even stronger property than the disjoint amalgamation property: If and there are strong embeddings and , then there is some and strong embeddings and such that and and are linearly disjoint (as fields) over .
Lemma 3.13**.**
If is an FCA-class, then has JEP.
Proof.
Since every model in contains the model , this is a straightforward consequence of Lemma 3.11. ∎
We will be working in an FCA-class which we, from now on, denote by . Since it has AP and JEP, there is, for each cardinal , a -universal and - model homogeneous monster model. We will assume we are working in such a monster model for large enough for the monster to contain all models we are interested in. All elements of (even if small) are not contained in but will contain isomorphic copies of them. As is standard practice in model theory, we will assume that the models we consider are strong submodels of . This is analogous to the fact that for the purpose of studying countable fields of characteristic [math], we can consider them as subfields (and, moreover, elementary submodels) of the field of complex numbers even though there, strictly speaking, are proper class many such fields and all of them are not technically subsets of the complex field.
We note that is existentially closed in (i.e. if there is some larger model such that , then is existentially closed in . Now we can define Galois types as orbits of automorphisms of the monster model. If , we will denote the set of automorphisms of that fix pointwise with . Occasionally, we will be working in the pure field language in a monster model for algebraically closed fields, which we will denote by . We can take it to be the algebraic closure (as a field) of .
Now, we can use results from the previous section. We refer the reader to Definitions 2.14 and 2.15 for -types.
Lemma 3.14**.**
Let be the collection of formulae of the form , where , and each is an -term. Then, is homogeneous, and Galois types coincide with -types in every model . Moreover, if is an existentially closed model then, Galois types realized in are the same as existential types in .
Proof.
It is easy to see that for any and , -. By Lemmas 3.11 and 3.13, has AP and JEP, so it is homogeneous by Corollary 2.26. The other statements follow from Lemma 2.20 and Corollary 2.24. ∎
In particular, Lemma 3.14 implies that first order types determine Galois types. For the rest of the paper, we will use existential types as our main notion of type. We will denote by the set of existential types over in the sense of Definition 2.9 (note that these types will then be complete in the sense that if is an existential formula with parameters from , then either or ). If , we say realises or is a realisation of . We say a type is consistent if it has a realisation in . For the rest of this paper, we will write just for and for .
In AEC frameworks, bounded closure is often used as a counterpart for model theoretic algebraic closure. We say a set is bounded if , and a singleton is in the bounded closure of a set if has only boundedly many realisations. In our setting, boundedness will actually be equivalent with finiteness, as we shall soon see.
In [5], it is shown that in models of ACFA, the field theoretic and model theoretic notions of algebraic closure over a substructure coincide (Proposition (1.7)). The same line of reasoning works also in our setting. Our analogue for their result is formulated in the following lemma. It also implies that in our setting, a type has boundedly many realisations if and only if it has finitely many realisations.
Lemma 3.15**.**
Let and let be a finite tuple.
- (i)
If , then has finitely (boundedly) many realisations if and only if for . 2. (ii)
The type has boundedly many realisations if and only if .
Proof.
In (i), the implication from right to left is clear. We prove the other direction first in the case is a singleton. Suppose is transcendental over . Let be another transcendental element. Then and are isomorphic as fields, and thus can be extended to a model of that is isomorphic with . By Lemma 3.11, they both can be embedded linearly disjointly in some model of . This process can be repeated unboundedly many times. For the general case, we note that if has finitely (boundedly) many realisations, then so does for , and hence, since the claim holds for singletons, we have for each .
In (ii), the direction from right to left is again clear, and it suffices to prove the other direction in case is a singleton. Denote , and assume . By (i), (and thus ) has unboundedly many realisations. ∎
4. Independence
Exactly like in [5], we define an independence notion that is based on independence in pure fields and inherits most properties of non-forking from there. At the end of this section, we will present our version of the independence theorem. However, we will first show that our independence notion has all the properties of non-forking that we would expect in a simple unstable setting. In the next section, they will be used, together with the independence theorem, to show that a monster model of is simple in the sense of [4].
Definition 4.1**.**
Let . We say is independent from over , denoted , if is algebraically independent (as a field) from over .
Many of the usual properties of an independence notion follow directly from the corresponding properties for fields. To see that local character holds, we recall some notions from difference algebra.
Definition 4.2**.**
Let , and let denote the free abelian group generated by the distinguished automorphisms. Let be the ring of difference polynomials in variables (i.e. polynomials in the variables , where , ). We say an ideal of is a difference ideal if it is closed under the distinguished automorphisms. We say a difference ideal is perfect, if for all , , and , it holds that if , then .
Lemma 4.3**.**
Let be a finite tuple and . Then, there is some finite such that .
Proof.
Suppose is an -tuple, i.e. . Denote . Let be the difference ideal of generated by the set . Now, is a perfect difference ideal, and by Proposition 2.5.4 of [16], there is some finite set such that is the smallest perfect difference ideal containing . Let () be the finite set of coefficients of the elements of . Then, , and thus .
Now, there is some finite such that . We have and thus . Since , transitivity for field independence gives us and thus . ∎
We now see that our independence notion has all the properties of non-forking that we would expect in a simple unstable setting.
Lemma 4.4**.**
Let be a monster model for , and suppose . Then, the following hold:
- (i)
(Local character) For each finite tuple , there is some finite such that . 2. (ii)
(Finite character) If is a (possibly infinite) tuple and , then there is some finite tuple such that . 3. (iii)
(Extension) For every (possibly infinite) , there is some such that and . 4. (iv)
(Monotonicity) If is a (possibly infinite) tuple, and , then . 5. (v)
(Transitivity) If is a (possibly infinite) tuple, and , then . 6. (vi)
(Symmetry) If are (possibly infinite) tuples and , then 7. (vii)
(Invariance) If is an automorphism of , and , then .
Proof.
(i) is Lemma 4.3.
For (iii), we may (by the definition of our independence relation) without loss of generality assume that and . Let be an isomorphic (over ) copy of that is algebraically independent (in the field sense) from over . Since , the field is relatively algebraically closed in . By Remark 3.3, it is also perfect, so the field extension is separable and thus regular. By Lemma 9.9 in [12], for regular field extensions, algebraic independence implies linear disjointness. Thus, is linearly disjoint as a field from over . Let be the image of in . By Lemma 3.7, the distinguished automorphisms on and have common extensions to . Now, there is an embedding such that , and is as wanted.
The other properties follow straightforwardly from the fact that they hold for algebraic independence in fields. ∎
Next, we will prove a version of the independence theorem that allows us to amalgamate three types given that they satisfy certain conditions. For difference fields, there is a Generalized Independence Theorem ([5], p. 3009-3010) which makes it possible to simultaneously realise any finite number of types over a given base model as long as the tuples realising them are independent over that model. When proving the theorem, Chatzidakis and Hrushovski work largely in the setting of pure algebraically closed fields. At one crucial point, they use the definability of types in -stable theories to move a tuple of parameters into the base model. In our setting, models are not algebraically closed as fields, and thus we do not even know if their theory is stable when we reduce to the pure field language, so the proof from [5] does not generalise. Instead, we need some extra assumptions, mainly that one of the types to be combined is nice in the sense of a technical definition that we will present next.
In the rest of the paper, we will be working at times in the field , viewed as a monster model in the pure field language. Thus, when we talk about automorphisms of , we mean field automorphisms (without the extra structure of distinguished automorphisms), and they will not necessarily restrict to automorphisms of .
In the following, we will be using the notion of a strong type in the context of . By this, we mean the usual first order notion (see [3], p. 113, Definition 3.1). We denote the strong type of over by , and whenever we use strong types, we do it in the context of the theory of algebraically closed fields. We recall that in this context, if and only if , where stands for the first order type in the field language. By a strong automorphism of over we mean an automorphism of that fixes pointwise and preserves strong types over (in our case of algebraically closed fields this is the same as saying that the automorphism fixes pointwise). We write for the set of all strong automorphisms over .
Definition 4.5**.**
Let , let and be possibly infinite sequences of variables, let , and suppose that if is a realisation of , then . Denote by the algebraic closure (as a field) of , viewed as a monster model in the pure field language. We say the type is nice if for all finite sets and , there is some such that , and .
In the proof of our version of the independence theorem, the niceness assumption comes into play in the form of the following technical lemma.
Lemma 4.6**.**
Let , let and be possibly infinite sequences of variables, let be a nice type, and let be a realization of . Let , , let , let be the field composite of and , and let be the field composite of and . Then, is relatively algebraically closed in (as a field).
Proof.
We will work in the pure field language, in . Suppose, for the sake of contradiction, that there is some . Let be the minimal polynomial of over . We will derive a contradiction by showing that has a root in . By the definitions of and , there are finite sets and such that (the field generated by and ) contains the coefficients of , and finite sets and such that . Since the type is nice, there is a strong automorphism such that and . Since and , the automorphism is the identity on and therefore fixes the coefficients of , so . We claim that . Indeed, , and , and since , we have . ∎
Now we can prove the independence theorem. When proving it, we will work in the algebraic closure of . The types given in the statement will give us interpretations of the distinguished automorphisms on certain models in . To prove the theorem, we will need to find a model where these automorphisms have common extensions. For this, we first extend the automorphisms in to the algebraic closures of the original models in such a way that they agree on the overlaps, and then apply the argument from the proof of the Generalized Independence Theorem in [5]. From now on, we will denote by the first order type of over in the pure field language.
Theorem 4.7**.**
Let be an FCA-class, let , let be (possibly infinite) tuples of variables, and let , and be complete existential types over such that , , and . Suppose that is nice and if realises , then . Then, the type can be realised by some tuple such that , , and are independent over .
Proof.
We will construct a model where the types , , and are realised simultaneously. Let , , and be such that they realise , , and , respectively, and (and hence by transitivity).
Denote for , , , , and . For each distinguished automorphism , the type gives an interpretation of on . Denote by the interpretation of on . Moreover, there is some such that , and thus .
From now on, we will work in the pure field language in the algebraic closure of . First, we extend the map to an automorphism as follows. Since , the field is perfect (by Remark 3.3) and relatively algebraically closed in , and thus the fields and are linearly disjoint over by Fact 3.8. Hence, the automorphisms of and of have a common extension on the field composite . Extend now to an automorphism of . We then have .
Thus, for types in the field language, it holds that . Since is independent (in the field sense) from over (by the choice of ), and the same holds for (since ), we have (by stationarity in fields) . Hence, there is a field automorphism such that . Denote now and let .
We will find extensions for the maps to the models such that they agree on the overlaps. After that, we will construct a model where the are compatible, just like it is done in the proof of the Generalized Independence Theorem in [5], p. 3009-3010. To give the big picture, we now sketch the idea of constructing the extensions and then go into the details in the next paragraph. We will first extend the to . Then, since and are linearly disjoint over (note that this is a consequence of the fact that since this guarantees that is perfect by Remark 3.3 and relatively algebraically closed in which allows us to use Fact 3.8), we can find a common extension of this automorphism and to which then extends to . Since and are linearly disjoint over (again because ), this automorphism and have a common extension to and thus to . With an analogous process, we will extend to an automorphism of . Finally, we will apply Lemma 4.6 to construct .
We now go into the details of the above argument. Let be an extension of the to . Now, and have a common extension to which then extends to an automorphism of . The automorphisms and have a common extension to which extends to an automorphism of . We have , and these automorphisms have a common extension to since and are linearly disjoint over (again because ). It extends to an automorphism of .
By Lemma 4.6, we know that is relatively algebraically closed in . It is also the composite of two perfect fields ( is perfect since ) and thus perfect. Hence, and are linearly disjoint over . We will now construct an automorphism on such that and , and then simultaneously extend and to an automorphism of which then extends to an automorphism on . For this, we note that is perfect and relatively algebraically closed in (since ), and thus and have a common extension to . Since and are linearly disjoint over , the maps and extend to a common automorphism of , which in turn extends to an automorphism of .
We now proceed just like in the proof of the Generalised Independence Theorem in [5], p. 3009-3010. First, we note that by the choice of , we have , and thus and are independent in the field sense over . By Lemma 9.9. in [12], they are linearly disjoint over , and thus the automorphisms and (which agree on ) have a common extension to the field composite . Let be the field composite of and in (note that these are linearly disjoint over ). By the choice of , the tuple is independent in the field sense from over , and thus, by Remark 1.9(2) in [5], , which implies that and are linearly disjoint over . Thus the automorphisms and have a common extension to the field composite of and in .
Restrict the automorphisms obtained this way to the field generated by , , and within . Since the restrictions commute on these fields, they also commute on . Extend to an algebraically maximal model of the theory of fields with commuting automorphisms. This proves the theorem. ∎
One motivation behind the present paper is to eventually use the methods of geometric stability theory in FCA-classes. In a geometric context, there often is a specific type that is the object of study. For example, one could look at the “line” given by a type of rank 1. We end this section with a lemma which guarantees that by extending the base model, we can always assume that a given type is nice in the sense of Definition 4.6. This means that after taking a free extension of the type, we can always apply Theorem 4.7 to combine it with other types that satisfy the relevant assumptions.
Lemma 4.8**.**
Suppose is an FCA-class and is a monster model for . Let and . There is some of cardinality such that
- •
;
- •
;
- •
if is such that , then is nice.
Proof.
Consider quadruples where is a finite subset of , are finite subsets of , and is a finite tuple from . We say two such quadruples and are isomorphic if , and in the field the strong type (in the field language) .
Let now list, up to isomorphism, all such quadruples. We note that (there are at most many strong types over a finite set). Construct models , , as follows. Let . For each , construct as follows. If there is some which is isomorphic to , and with , , and , let . Otherwise, let . At limit steps, take unions.
Let . Repeat the above process with in place of , continue this way to obtain a chain of models , , and set . We claim that is as wanted.
First of all, by symmetry, transitivity and local character of the independence relation (Lemma 4.4, (ii), (v), and (vi)), it follows from the construction that .
Let now be a (possibly infinite) tuple such that . We show is nice. Let and be finite sets, and let . Now, there is some finite such that and . By Lemma 4.4 (i) and (v), there is a finite set such that . There is some such that (and thus ), , and . Let be the list we have used to construct from , and let be the construction of . Now, there is some such that is isomorphic to , and then witnesses . So there is such that , , , and is isomorphic to and thus also to . Hence, there is an automorphism such that and . Since , the automorphism is as wanted, and is nice. ∎
5. Simplicity
In [4], the first order notion of a simple theory is generalised to the non-elementary framework of homogeneous models. We will show in this section that a monster model for an FCA-class is simple (or more specifically, -simple or supersimple) in the sense of [4]. The idea of our proof comes from [15], where it is shown that a first order theory is simple if and only if it has a syntactic (i.e. invariant under automorphisms) notion of independence with the usual properties of non-forking (the same that are listed in our Lemma 4.4) and satisfies the Independence Theorem over models. We will adapt the argument to our setting and show that in an FCA-class, Theorem 4.7 together with Lemma 4.4 implies simplicity. The main difference will be that we cannot use Compactness the way it is used in the first order context.
We will now recall the definition of simplicity from [4]. Since we aim to show that our class is -simple (also called supersimple), we will only provide the definitions relevant to that. We refer the reader to [4], Definitions 2.1-2.5 for a more general notion of simplicity in the context of homogeneous structures.
We note that in [4], everything happens, strictly speaking, inside a fixed model rather than a class of models. Moreover, [4] assumes that in their model, quantifier free types imply Galois types. We may also make this assumption after expanding our language with suitable relation symbols, as is done in Remark 2.22.
Definition 5.1**.**
Let be an ordinal and . We say a sequence is indiscernible over if for all and and , it holds that .
Definition 5.2**.**
We say an existential type divides over , if there is an infinite -indiscernible sequence for some infinite ordinal , with , such that is inconsistent.
Definition 5.3**.**
If , we say is -free from over if for all tuples and such that , does not divide over .
Next, we present the notion of -simplicity (or supersimplicity) in the sense of [4] (adapted to our setting). In addition to the two conditions of the following definition (local character and free extensions property), Definition 2.5 in [4] also requires a third condition for -simplicity, namely that -freeness has finite character in the sense of Definition 2.3 in [4] (note that finite character in the sense of this definition is slightly different from finite character in the sense of e.g. our Lemma 4.4). However, -freeness always has finite character in this sense, so the condition is void in the context of -simplicity, and we thus omit it.
Definition 5.4**.**
Let be a monster model for a homogeneous AEC. We say is -simple (supersimple) if the following hold:
- •
If is a finite tuple and , then there is some finite such that is -free from over ;
- •
If , , has infinitely (unboundedly) many realisations, is such that is -free from over , and is such that , then there is some realising such that is -free from over .
Remark 5.5**.**
Another notion of simplicity in a non-elementary setting can be found in [19] (Definition 3.2). There, dividing is defined just as in [4] (see our Definition 5.2) but with in place of (thus it is a stronger requirement than in [4]). Then, a type is defined to fork over a set if there is a (possibly infinite) set of existential formulae (with parameters) each of which divides over such that . Finally, is said to be simple if for any finite tuple and any set , there is some countable such that does not fork over .
We note that if is a monster model for an FCA-class and -simple in the sense of [4], then it is simple in the sense of [19]. Indeed, let be a finite tuple, and . We need to find a countable set such that does not fork over .
Suppose first that has infinitely many realizations. By the first property in Definition 5.4 (local character), there is some finite such that is -free from over . We show that does not fork over . Assume towards a contradiction that it does. Then, there is a collection of existential formulae such that and each divides (in the sense of [19] and thus also in the sense of Definition 5.2) over . By the extension property in Definition 5.4, there are some and such that is free from over , and for all , . Denote . Now there is some . It follows that is not -free from over (and thus not from either), a contradiction.
Suppose now has only finitely many realizations. By Lemma 3.15, . Now, there is some finite such that . We claim that does not fork over . If it does, then there is some such that and divides over (in the sense of [19]). Let be an indiscernible sequence that witnesses the dividing. For each , there is some such that . Since has only finitely many realizations, there is some infinite set such that for all and some . By homogeneity of , there is some automorphism which takes the sequence to . Now, realizes , a contradiction.
We have chosen to use the notions of dividing and simplicity in [4] rather than the ones in [19] since the notion of dividing is more general and the notion of simplicity is stronger. Moreover, we feel they fit our setting better.
Next, we will show that -freeness coincides with the independence relation defined in the previous section. Simplicity will then follow from Lemma 4.4. There is a related argument about the connection between dividing and independence in [15] (Claims I and II in the proof of Theorem 4.2), and we will modify it to our setting. In [15], Claim II states that independence implies non-dividing, and its proof uses Compactness twice.
The proof begins with stretching an infinite indiscernible sequence to the length for some large , and then using Ramsey’s Theorem and Compactness to find an increasing, continuous sequence of models such that each model contains the beginning of the sequence and the rest of the sequence is indiscernible over the said model. Here, we will circumvent Compactness by using the Erdös-Rado Theorem. In the first order setting, Compactness is used for a second time at the end of the proof, to deduce that a type is consistent by showing that each finite subtype is. There, in place of using Compactness, we will we apply Theorem 4.7 and move things around in the monster. These arguments are captured in the following three lemmas. Another difference to [15] is that when we use the Independence Theorem, we need to take care that the niceness condition holds. This can be arranged when we are dealing with an indiscernible sequence (see Lemma 5.7).
Lemma 5.6**.**
Let , and let be an infinite, non-constant sequence of finite tuples that is indiscernible over . Then, there is an increasing, continuous sequence of models , , such that for each ,
- (i)
* contains ;* 2. (ii)
* is indiscernible over .*
Proof.
Since we are working in a homogeneous structure, indiscernible sequences can be extended (see e.g. Lemma 1.5, (ii) in [4], and we can extend the sequence to length . Add now to our language Skolem functions that give roots for those polynomials that have a root in (i.e. for , we will have , where denotes the Skolem hull). The usual Ehrenfeucht-Mostowski construction (for details, see e.g.Theorem 8.18 and Appendix A in [2]) gives us an indiscernible sequence and a model such that if , then there are some such that . If is the original signature (without the Skolem functions), then . For , there are some such that
[TABLE]
and thus, by homogeneity (Lemma 3.14), . Now, the models , are as wanted.
∎
Lemma 5.7**.**
Let be an infinite cardinal, let , and let the sequence of possibly infinite tuples be indiscernible and independent over . Let be an existential type such that for some , it holds that and . Then, there is a type such that , , and if , then .
Proof.
Since indiscernible sequences can be extended (see e.g. Lemma 1.5, (ii) in [4]), we may without loss of generality assume that . Denote , and let be a free extension of to . Now, the type is nice; indeed, if we are given a finite set , then there is a permutation of the sequence that will fix and take for some such that for all , and this permutation extends to a strong automorphism of the algebraic closure of . To see that it extends, we note that the sequence is indiscernible over also in , so its members have the same strong type over and hence over . Applying Theorem 4.7 (with and , i.e. the type which we obtain from by permuting the two variables) we obtain, after a permutation of variables, a type such that , , and . Now is as wanted. ∎
Lemma 5.8**.**
Let , and let be a sequence of possibly infinite tuples that is indiscernible and independent over . Let be an existential type such for some , it holds that and . Then, the type is consistent.
Proof.
Consider first the sequence . Applying Lemma 5.7 to the type , we obtain a type such that , , and . Then, there is some such that and . Next, we apply Lemma 5.7 to the type and the sequence (which is independent and indiscernible over ) to obtain a type and such that .
By applying Lemma 5.7 repeatedly this way, we obtain consistent types for , such that , for , and if realizes , then .
For each , let realise . We have , and thus there is some automorphism such that . Since
[TABLE]
therefore also
[TABLE]
and we can find an automorphism such that . Continuing this way (the next stage fixes , , , , , , , and , and sends to ) we construct a sequence of functions , , satisfying:
- •
;
- •
, when .
Define now a map by setting , , and for each such that ,
[TABLE]
where is the smallest number such that . Note that then whenever . By Corollary 2.26, extends to an isomorphism from to , and thus to some .
Let . Now, for each , we have
[TABLE]
where the last equality follows from the fact that if and , then and (note that the equality also holds if , since then ). Thus realises and .
Let be a sequence where , , and so on. By homogeneity, it is indiscernible over . Moreover, it is independent over , and thus we can apply the same process as above. Continuing this way, we eventually get that is consistent. ∎
We are now ready to prove that our independence notion coincides with freeness (see Definition 5.3), and it will then follow that is -simple. The proof is as in [15] (Claims I and II of Theorem 4.2), and we provide it for the sake of exposition.
Lemma 5.9**.**
Let be a finite tuple, and . Then, if and only if is free from over .
Proof.
We prove first the direction from right to left. If , then, by Lemma 4.4 (ii), there is some finite tuple such that . Now, , so has unboundedly many realisations by Lemma 3.15. Just like in the proof of lemma 5.6, we can apply Erdös-Rado to obtain a sequence of realisations of that are independent and indiscernible over (see also e.g.Theorem 8.18 and Appendix A in [2]) Next, show that if , then is inconsistent, and thus divides over . If was consistent and realised by some , then for all , which implies for all (otherwise symmetry and transitivity would give ). However, by the local character of the independence relation (Lemma 4.4, (ii)), there is some finite and some such that , and thus by monotonicity, , a contradiction. Hence, is not free from over .
For the other direction, we may without loss of generality assume . Suppose , and let . We need to show that does not divide over . Let be an infinite cardinal, and let be an indiscernible sequence over , with . By Lemma 5.6, there is an increasing, continuous sequence of models for such that
- (i)
contains ; 2. (ii)
is indiscernible over .
Denote . By local character (Lemma 4.4, (ii)), there is some finite set such that . Since for some , it follows from monotonicity (Lemma 4.4, (iv) ) that , and therefore, since the sequence is indiscernible over , it is also independent over .
Denote . After relabeling, we have a sequence that is independent and indiscernible over . The type has a free extension to by Lemma 4.4, (iii). Let be a realisation of . Since and , we have by transitivity and monotonicity (Lemma 4.4, (v) and (iv)) that . Now, write as (i.e. ). By Lemma 5.8, the type is consistent. ∎
Corollary 5.10**.**
Let be an FCA-class, and let be a monster model for . Then is -simple (in the sense of Definition 5.4).
Proof.
Follows directly from Lemma 5.9 and Lemma 4.4. ∎
Open questions
Is it possible to get rid of the niceness condition in Theorem 4.7 and prove the full independence theorem over models? 2. 2.
Is it possible to improve Lemma 4.8 to find a model which would work for all which are independent over ?
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Ackerman, N., Boney, W., and Vasey, S.: Categoricity in multiuniversal classes . Annals of Pure and Applied Logic 170, No 11. 2019. Article ID 102712.
- 2[2] Baldwin, J.: Categoricity . University Lecture Series, vol 50, AMS, Providence, RI, 2009. http://homepages.math.uic.edu/ jbaldwin/pub/AE Clec.pdf
- 3[3] Baldwin, J.: Fundamentals of Stability Theory . Cambridge University Press. 2017.
- 4[4] Buechler, S., and Lessmann, O.: Simple homogeneous models . Journal of the American Mathematical Society. Vol 16, No 1, 91-121. 2002.
- 5[5] Chatzidakis, Z. and Hrushovski, E.: Model theory of difference fields . Transactions of the American Mathematical Society, Vol. 351 (8), 1999, 2997-3071.
- 6[6] Chatzidakis, Z. and Hrushovski, E.: Difference fields and descent in algebraic dynamics, I , Journal of the IMJ, 7 (2008) No 4, 653-686.
- 7[7] Chatzidakis, Z. and Hrushovski, E.: Difference fields and descent in algebraic dynamics, II , Journal of the IMJ, 7 (2008) No 4, 687-704.
- 8[8] Chatzidakis, Z., Hrushovski, E. and Peterzil, Y.: Model theory of difference fields II: periodic ideals and the trichotomy in all characteristics . Proceedings of London Mathematical Society (3) 85 (2002), 257-311.
