Merges of Smooth Classes and Their Properties
Abstract
Given two Fraïssé-like classes with generic limits, we ask whether we can merge the two classes into one class with a generic limit. We study the properties of these merges and their generics, as well as their connections to structural Ramsey theory and the Hrushovski property (EPPA).
1 Introduction
Given a countable, relational language , a pair is a smooth class if is a class of finite -structures whose elements are related by , which is determined by universal formulas (see §2). Fraïssé classes are smooth classes whose relation is simply , and these Fraïssé classes are the classes used in Fraïssé’s original constructions. The main motivation for this work, and many other works on smooth classes, comes from classes of Shelah-Spencer sparse graphs (see Example 2.2). These particular classes have served as counterexamples in several model theoretic settings, and have proved to have some interesting properties. The results of this paper were inspired by observations made when studying these classes of graphs.
Fraïssé limits/generics are -categorical, ultrahomogeneous structures with respect to a Fraïssé class, and they are well-understood, classical objects. The generics (also called limits) of proper smooth classes, on the other hand, are far more oblique and less free objects. The goal of this paper is to better understand general smooth classes and their generics in both the strictly model-theoretic sense and in applications of model theory.
In §2, we will study certain expansions of smooth classes and their generics by way of merging smooth classes. This is done by taking two smooth classes and in the languages and and forming a new smooth class, , called the merge of and , in the language such that for and all , . In some cases, has a generic .
When and are closed under substructure, it is known by [EHN19] that for , , where is the generic of . We prove that this can be strengthened by assuming that each of and additionally have parallel strongness and smooth intersections (defined in §2.1.1). In this case, we show that for any an infinite set definable in by an existential -formula, . We consider this to be the main theorem from the study of merging smooth classes, and it has many consequences, as described in §2.3.1. In particular, this theorem provides information about the generics of the original classes and .
In §2.3 we study which model theoretic properties are transferred from the generics and to . By strengthening a theorem in [KL92], we show that if and are both atomic, then is atomic. This does not hold for saturation; a merge of classes of Shelah-Spencer graphs gives a counterexample to this transfer.
In §3, we turn to structural Ramsey theory and study smooth classes and their merges in this context. Merges of Fraïssé classes have been the quintessential examples of classes with the Ramsey property (defined in §3). In [KPT04], for example, Fraïssé classes are often merged with the Fraïssé class of all finite linear orders as a way to "rigidify" the classes. The KPT correspondence, which is the main result of [KPT04], gives an equivalence between Fraïssé classes of rigid structures with the Ramsey property and their generics having an extremely amenable automorphism group. This correspondence has drummed up much of the recent interest in classes with the Ramsey property. The correspondence holds for smooth classes of rigid structures, as shown in [GKP16].
We are interested in which smooth classes and their merges have the Ramsey property. This is motivated by [Bod12], in which it is shown that whenever and are Fraïssé classes of rigid structures with the Ramsey property, then has the Ramsey property. It remains unclear as to when this result extends to smooth classes. An intermediate step in the direction of this goal is studying which classes and their merges have the Hrushovski property (often written as EPPA) (defined in §3.1).
While it is known by [HO03] that any Fraïssé class with the free amalgamation property has EPPA, ([EHN19], [GKP16]) have shown that this does not extend to smooth classes. In §3.2, we give an explicit family of smooth classes with the free amalgamation property and prove these classes and their merges have EPPA. This expands upon the ideas given for a specific smooth class in ([EHN19],[EHN21]) and uses the strongest existing EPPA results from [HKN22]. We also put a smooth relation on the class of infinitely many equivalence relations given by [Iva15] and generalize the argument in [Iva15] to obtain a non-trivial smooth class without the free amalgamation property which has EPPA.
2 Merging Smooth Classes
2.1 Background
In this section, we will give the background needed to understand many of the results in this paper. Smooth classes, which also go under the name of "strong classes", are a generalization of Fraïssé’s original constructions. The definition of these classes can vary from author to author. We choose to use one of the most general versions of the definition of smooth classes for the most general results.
2.1.1 Smooth Classes
For the entirety of this paper, we will consider only countable, relational languages. This is done out of convenience; many of the constructions in this section and in section 2.2 still apply when the languages contain functions. We begin with recalling the following definition from [KL92]:
Definition 2.1.
Let be a relational language. Let be a class of finite -structures which is closed under isomorphism. We say the pair , where is a binary relation on the elements of , is a smooth class if
-
1.
is transitive and for all , ,
-
2.
For all and every enumeration of , there is a (possibly infinite) set of universal -formulas with such that , where is the atomic diagram of according to the enumeration , such that for any with ,
-
3.
For , if is an enumeration of and there exists an isomorphism , then for the enumeration of , we require that .
-
4.
and for every ,
Clearly, any class containing and equipped with as its relation is a smooth class. We now give an example of a smooth class whose relation is not . This particular class will appear in several parts of this paper:
Example 2.2.
Let , and a finite, relational language. For any -structure on which every relation is symmetric and irreflexive, define the dimension function on as
where is the number of distinct subsets of on which holds. Define the class as
and set
is a well known smooth class and is called the class of Shelah-Spencer -graphs in .
Smooth classes are meant to be a generalization of classes used in Fraïssé’s constructions. In particular, these classes may also have limits as in Fraïssé constructions. To see this, we will need to define the usual properties of a class with respect to the relation as opposed to :
Definition 2.3.
Let be a smooth class.
-
1.
has the amalgamation property (AP) if, for any such that there exist embeddings and where and , then there exists some such that there exists embeddings and with , , and .
We say has disjoint amalgamation (dAP) if we can find a and embeddings , with , , , and .
-
2.
For any with , the structure is defined as the structure with universe where the only relations between and are contained in . We say has free amalgamation (fAP) if and , then and .
-
3.
has parallel strongness (PS) if for any such that and , there exists some and embeddings and such that , , and . has disjoint parallel strongness (dPS) if this can be done so that .
Note: This property is sometimes referred to as full amalgamation in the literature. (e.g., in [BS96]) - 4.
Only AP is required for a generalization of Fraïssé’s theorem; dPS, fAP, and dAP will have greater roles in the next sections. It is worth noting that the classes in Example 2.2 have dPS, fAP, and smooth intersections, as shown in [BS96], and we will use this fact throughout this paper.
We call a smooth class a Fraïssé class if for , , has AP, and is closed under substructure. These classes have traditional Fraïssé limits, and they vacuously have smooth intersections and PS.
We must now define limits, or generics, for any smooth class, and then give conditions for the existence of a generic of a smooth class.
Suppose is a smooth class. Given an -structure , for with , we write if and only if for any enumeration of , .
Definition 2.4.
We say an -structure is a generic for if
-
1.
There exist with such that and when .
-
2.
If and , for , then there is an embedding such that and .
This is essentially a word-for-word generalization of a Fraïssé limit. The following holds essentially by Fraïssé’s original proofs:
Proposition 2.5.
A smooth class has a generic if and only if has AP and contains only countably many isomorphism types. Moreover, any two generics of a smooth class are isomorphic.
As noted before, the study of the generics of smooth classes will be a central throughout this paper. In the next section, we will discuss the idea of combining smooth classes and studying the resulting expansions of their generics.
2.2 Merges
Our main motivation in the study of merges was to study certain, arguably natural, expansions of smooth classes, particularly the classes of Shelah-Spencer graphs. For any , the generic of the Shelah-Spencer class (see 2.2) is well understood and its theory has a concrete -axiomatization given by ([Las07],[Gun18]). In studying expansions of these graphs, it became increasingly clear that certain expansions lead to the discovery of interesting properties of the generic . This launched an investigation that led to the study of merges of smooth classes, which will be defined in this section.
2.2.1 The Set-Up
We now turn to the problem of combining smooth classes. The idea of combining Fraïssé classes is not new; in fact, it is a rather natural method of constructing new Fraïssé classes. This section can be thought of as a generalization of combining Fraïssé classes, but there are a number of technicalities brought on by the smooth relations that we must deal with.
Definition 2.6.
Fix languages , where . Fix a family of smooth classes such that each is a class of -structures. We define a new smooth class in the language as follows:
and for ,
We call the class defined above the merge of .
Notation: For smooth classes and , we will write to denote the merge of the classes under the relation . For the set of classes , we will write to denote the merge of these classes under the relation .
It is clear from the definition of smooth classes that the merge of smooth classes will be itself a smooth class. Let be the merge of the family . Let and let be an enumeration of . For , let denote the set of universal -formula such that for all , . Let denote the set of universal -formulas such that for all , . Notice that can be chosen of the form .
We now give sufficient conditions for the existence of a generic of the merge. The conditions below can be much more flexible based on which classes one is attempting to merge. Essentially, we need to prove that the merge has AP. To get this, we must have that each class in the merge "agrees" on a cardinality of an amalgamation. We also need that the merged class does indeed have infinitely many elements.
This is essentially what the below definition ensures:
Notation: For a smooth class , define
Definition 2.7.
For languages , where , smooth classes which are classes of -structures, and , we say the set of smooth classes has uniform dAP if:
-
1.
and for all ,
-
2.
For any , there exists some such that for any , and any , , where , , and , then there exists a disjoint amalgam of and over with and .
Remark 2.8.
When all classes in with have closure under substructure and dAP, has uniform dAP trivially. Because of this and Theorem 2.9 we will frequently work within this framework in the context of merging classes.
Theorem 2.9.
If a set of smooth classes has uniform dAP, then the merge has a generic in .
Proof:
We must prove, by Theorem 2.5, that has AP. We will in fact prove that it has dAP. For each and denote by . Let such that there exist embeddings and for which and . For each , let and denote the -embeddings and restricted to the language . Because has uniform dAP, for each , we may choose such that for all , , and for every , there exist -embeddings and with , , , and . Enumerate as , as , and as . Enumerate each as
where , , and . Take a set with and enumerate
In each language , we will define so that the function for defined , , and is an -isomorphism. It follows that by definition.
Moreover, defined as and and defined as and are both -embeddings by the construction of . It is also clear that and . Thus, has dAP.
Similar arguments to the proof above can show that if every class in has dPS and/or fAP, then so does the merge .
Remark 2.10.
The assumptions in Theorem 2.5 can be loosened, but the assumption that each class has dAP is nearly necessary. Without each class having dAP, the possible merged classes with generics are often nearly trivial and highly constrainted, depending on how "strict" the AP in each class is. For example, let the class be such that is the class of all finite linear orders and if and only if is an initial segment of . This class has AP, but certainly not dAP. The only classes which can be merged with and produce a generic of the merge are the classes for which is and every relation in the language holds (or, equivalently, does not hold) on every tuple in every structure of .
2.3 Properties of Merges
2.3.1 Preserving Generics in the Merge
Ideally, when we merge classes and obtain a generic of the merged classes, we would like for the generic of the merged classes to be an expansion of each of the original generics. To have this, we must have that the merged class does not "miss" any information from the original classes. A way of ensuring this is to assume the classes are closed under substructure. In many natural applications, this is a reasonable assumption.
We now prove that this holds under some additional assumptions:
Proposition 2.11.
Suppose and are smooth classes in and respectively. Assume that both classes are closed under substructure, and both have dAP and dPS. Let be the generic of the merge of and . Then for , , where is the generic of .
Proof:
By symmetry, we need only prove the theorem for . We must prove that satisfies conditions (1) and (2) from Definition 2.4. For -structures , we write if and only if . It is easy to see that, since is the generic of , satisfies (1). It remains to show (2).
Let and suppose for some . As is the generic of , we can write where and . Thus, there is some for which . By taking an isomorphic copy of , we may assume .
By applying dAP and closure under substructure in , we can find some with universe such that is a disjoint amalgam over in with . Define so that the universe of is the same as that of , and define the -structure of so that with and (in the sense).
Now, in the language , using dPS over , we can find an -structure with universe so that , , and . Define structures to be so that , for .
Notice this then implies that by definition of . By the genericity of , there exists some -embedding which is the identity on such that and . Now, and . Moreover, . By transitivity, . This proves (2).
When classes are only assumed to be closed under substructure, it is indeed true that the generic of the merge is an expansion of the original generics. This follows from a set-up and proof given in §2 of [EHN19], though one must convert their theorems to the language and ideas of merging smooth classes. Whenever smooth classes and are each closed under substructure with dAP, the merge is a strong extension of both and in the sense defined in §2 of [EHN19]. Because is a strong extension, it is proven that if is the generic of , then where is the generic of .
The proof of this result from [EHN19] and the proof of Proposition 2.11 are entirely different. It turns out that the additional assumption that the classes both have dPS gives an even stronger result than Proposition 2.11, which will be shown in Theorem 2.12. This was inspired from behavior observed from the merge of a class of Shelah-Spencer graphs (Example 2.2) with the Fraïssé class of finite equivalence relations. We observed a relationship between equivalence classes in the merge of the generic and the original generic of the class of Shelah-Spencer graphs. The assumption that classes have dPS is modeled after the fact that classes of Shelah-Spencer graphs have dPS.
We will now state and prove Theorem 2.12, which we consider to be the main result in our study of merging smooth classes.
Notation: If is a relation on a class in and are structures in a language , we write for . If in , we write
Theorem 2.12.
Let and be smooth classes in languages and with generics and respectively. Assume both classes are closed under substructure and have dAP. Suppose has smooth intersections and dPS. Let denote the generic of the merge of and . Suppose is infinite, where and is an existential formula in . Then, is isomorphic to the generic of
Proof:
We must verify that satisfies (1) and (2) from Definition 2.4.
Because is the generic of , we may write where and for all . By assumption, and definition of ,
By the assumption that all classes are closed under substructure, . Thus, satisfies (1).
It remains to show that satisfies (2). Suppose and where . We may take so that . Write . As infinite, we may find a set of elements . Note that . For each , there exists a finite tuple which witnesses that the existential holds in . Let
We may find some finite for which and . Note that by assumption. Using dAP in , we can find an -structure with universe that is an amalgamation over so that . Using dPS in , we can find an -structure with universe that is a dPS amalgam over such that and . Write where for and .
Note that , so , and, moreover, . Now, in , define a -structure enumerated so that and the map is such that and is an -isomorphism. As , we know that .
Define the -structure where so that (in the sense); the map defined , is an -isomorphism; and the map defined , is a -isomorphism. Then, notice that . Now, because and is the generic, then there is a -embedding so that is the identity map on and . Let . There is a natural -isomorphism by , fixing .
Notice that (where we are looking at the copy of the -structure in ). We can write , and notice that in , for each since is a formula and the construction of preserved and copied the the relations between each , and for . Thus, , as is fixed by and as is existential, , thus ensuring . Moreover, . Therefore,
Finally, recall that , so is an embedding over as required. This completes the proof of (2).
By essentially the same argument, we get
Theorem 2.13.
Suppose is a set of smooth classes with uniform dAP such that each class is closed under substructure and has dPS. Suppose is the generic of the merge in the language . For every , if is infinite with and an existential formula in the language , then , the generic of , for .
Theorem 2.12 has the following direct consequences.
Suppose and are smooth classes closed under substructure with dAP, and that has smooth intersections and dPS. Let and denote their respective generics, and to be the generic of .
Corollary 2.14.
as subgroups of .
Corollary 2.15.
If , then .
Proof:
Using Theorem 2.12 and merging with any Fraïssé class , for any , the set is indeed isomorphic to .
The next corollary holds by taking to be the class of finite structures with a binary equivalence relation and applying the main theorem:
Corollary 2.16.
There is an expansion of by a binary equivalence relation such that for any , and a set of equivalence classes of ,
The class can be taken to be a class of Shelah-Spencer graphs with generic , and the class can be taken to be the Fraïssé class of all finite linear orders, giving:
Corollary 2.17.
There exists a family of sets of subsets of such that any finite, non-empty intersection of sets in is isomorphic to .
Take to be a class of Shelah-Spencer graphs in the language , where is binary, and to be another class of Shelah-Spencer graphs in the language where is a binary relation. Let . Applying Theorem 2.12, the following holds:
Corollary 2.18.
For and , .
All of these, of course, can be extended to results with other Fraïssé classes such as the class of finite graphs, the class of free graphs, etc.
These results may be thought of as well-behaved expansions of generics. They also give an idea of the overall structure of a generic, reminiscent of the "self-referential" properties of some Fraïssé classes. For example, the rationals under the standard linear order, , is the Fraïssé limit of the class of all finite linear orders, and it has the property that every open interval in is indeed isomorphic to . Here, we get that for a sufficiently nice class , its generic has the property that it can be linearly ordered so that every interval is isomorphic to .
Given Theorem 2.12, we see that in many cases there is a relationship between the generic of a merge and the generics of the original smooth class. The question is then what other properties of the generics of the original classes transfer to the generic of the merge. The remainder of the paper will discuss this transfer of properties.
2.3.2 Atomic Generics and Merges
In this section, we will study smooth classes with atomic generics and their merged generics. It turns out that the property of the generic of a smooth class being atomic is dependent on the universal formula definition of the relation of the smooth class. Because of this dependency, the property of the generic being atomic transfers very well to the generic of a merge.
We begin by proving the converse of Proposition 3.4 in [KL92], characterizing atomic generics of smooth classes. We will include both directions of the proof for convenience, and because we will need both directions.
Recall: By definition of smoothness, for every and enumeration of , there is a set of universal formulas such that
Proposition 2.19.
Let be a smooth class with a generic . Then, is atomic if and only if for every and every enumeration of , is finitely generated modulo . I.e., there exists a finite subset such that for , .
Proof:
: Let and fix an enumeration of , and suppose that . As is atomic, suppose isolates . Suppose now that is enumerated by and . We immediately have that defined is an isomorphism. Then , and we get that by definition. Thus, as , . By the genericity of , the isomorphism extends to an automorphism of . This implies that . Thus,
But, this implies that some finite subset of must imply modulo , and hence itself.
: Let be enumerated by . Let where is the smallest superstructure of with . Enumerate as , where . Let be the formula in the assumption associated with and . We have that . Set
Claim: isolates .
Suppose . Then, this implies the existence of some enumerated where . We know by assumption that there is an isomorphism with and . It follows that . By the genericity of , has an extension to an automorphism of . Thus, , and it follows that isolates .
Corollary 2.20.
Let and be smooth classes in respective languages , and generics , . Suppose the merge has a generic . Moreover, assume that and . If and are atomic then the merged generic is atomic.
Proof:
For simplicity, we will assume for . Given some , write for . Let be an enumeration of . Let and be the - and - formulas given by Proposition 2.19 such that for ,
Now, suppose for some . For each , this immediately implies that . Now, assume that . Then, , and thus . But this implies that . Therefore, . We can freely impose that . By Proposition 2.19, is atomic.
From Corollary 2.20 we get another immediate result:
Proposition 2.21.
Let be a Fraïssé class and a smooth class. Suppose the merge has a generic such that for , , where is the generic of . If is -categorical, then is -categorical.
Proof:
We will show that every countable structure such that , . Suppose . We must prove that has properties (1) and (2) from Definition 2.4.
To prove (1), note that we have that . By each of and being -categorical, for . In particular, we can write with . It follows by being a Fraïssé class that in the full structure and .
It remains to prove that has property (2). Suppose and for some . Let be an enumeration of and let be an enumeration of . By Corollary 2.20, is atomic, and so by Proposition 2.19 there exist and such that and .
As is a generic, we have that
Thus, as , there is an embedding of such that and . This shows that has property (3).
In the next section, we will prove that there are classes with saturated generics for which the merged generic is not saturated. Similar arguments as in the next section show that Proposition 2.21 does not necessarily extend when both classes are smooth but not Fraïssé. In the proof of Proposition 2.21, the proof that every countable has property (2) always holds for -categorical smooth classes (not necessarily Fraïssé) , ; it is the proof that any such has property (1) that may fail.
2.3.3 Saturated generics and merges
We now ask how the merged generic behaves when both of the original generics are saturated. In contrast to atomic generics, the property of saturation transfers poorly to the generic of a merge. This is due, in part, by the relation in the merged generic being dependent the relations on the original classes; the result is that the generic of the merge cannot satisfy all the new types created.
To make this concrete, we will recall some results and definitions about saturation and smooth classes. For a full treatment of these results, see [BS96].
Definition 2.22.
Suppose is a smooth class of finite structures. We say for , is a -minimal pair if for every , but . has an infinite chain of -minimal pairs if there is a chain
such that and is a -minimal pair for .
We reprove a well-known result about smooth classes and saturation:
Theorem 2.23.
If has a generic , smooth intersections, and an infinite chain of -minimal pairs, then is not saturated.
Proof:
Let be an infinite chain of -minimal pairs. Let and let denote the elementary diagram of over . Set
Let . Note that is realized in by a strong embedding of into . Let . It follows that is finitely satisfiable, and hence satisfiable by compactness. However, does not realize . To see this, suppose for some . There is some finite such that . Suppose . As , there exist sets such that and are -minimal pairs for . Note that , so if , then by definition of a -minimal pair . But this is a contradiction, so for all . However, this implies , which is a contradiction.
Definition 2.24.
A smooth class has many minimal pairs if there exists some such that for all with and for all , there exists some such that , , and there is some for which is a -minimal pair
Example 2.25.
Note that for , the class of Shelah-Spencer -graphs has many minimal pairs and the generic of is saturated by [Gun18]. Theorem 2.26 will show that for , , the generic of the merge is not saturated, despite the fact that and . In fact, is not small. This shows that there exist classes with saturated generics whose merged generic is not saturated, even when both classes satisfy the assumptions of Proposition 2.11.
Theorem 2.26.
Suppose and are smooth classes, each closed under substructure in the resp. languages , . Suppose both classes have many minimal pairs, and suppose the merge has a generic . Then is not saturated.
Proof:
We will show has an infinite chain of -minimal pairs, and get the conclusion by applying Theorem 2.23. By assumption, there exists some such that for , if with , then there is some such that and there exists some such that is a -minimal pair.
Choose some such that . There exists some so that forms a -minimal pair. On the same universe as , by assumption, we can define so that and there exists some so that forms a -minimal pair. Define on the universe of so that for . Then, and is a -minimal pair. Thus, is a -minimal pair.
Suppose is odd and has been defined so that there exists some for which is a -minimal pair. By assumption, we can find some with the same universe as for which and there exists some for which forms a -minimal pair. Let be defined on the same universe as so that for . Then, and forms a -minimal pair. Then, is a -minimal pair. For even, we switch the roles of and in the odd case.
Carrying out this construction, we have an infinite chain of -minimal pairs.
3 Structural Ramsey Theory, EPPA Classes, and Merges
We now turn our attention to the branch of study of structural Ramsey theory. For many years, there has been a campaign to identify classes with the EPPA and Ramsey properties (defined below), especially after the links to topological dynamics were discovered. Most work has been done in the context of Fraïssé classes and, in particular, classes of rigid structures. It is notable that merges of Fraïssé classes have shown up as many of the examples of classes with the Ramsey property and as a way to "rigidify" classes.
The current goal is to try to expand the ideas used on Fraïssé classes to gain an understanding of smooth classes and their merges and which smooth classes have the Ramsey properties. The Ramsey property is hard to achieve in this context; however, a stepping stone is the Hrushovski/EPPA property. In this section we will expand and generalize on previous work to get some classes which do indeed have the EPPA property and for which the EPPA property transfers nicely to some merges of these classes.
3.1 Background & Motivation
Merges of Fraïssé classes have played an important role in the development of structural Ramsey theory. We first recall the definition of the Ramsey property in the smooth class setting:
Definition 3.1.
Suppose is a smooth class. Let . We say has the Ramsey property if for any with , there exists some for which for every coloring , there is some such that is constant.
It is important to note that we are taking the Ramsey property to be on colorings of structures as opposed to colorings of embeddings. This is mostly to avoid ambiguity and to include classes of structures which are not rigid.
Much of the focus of the study of Ramsey classes is on classes of rigid structures because of their connection to extreme amenability. The so-called "KPT-Correspondence" coming from the main results of [KPT04] (and generalized by [GKP16]) asserts that if a smooth class is a class of rigid structures with generic , then is extremely amenable if and only if has the Ramsey property.
Many Fraïssé classes which were proved to have the Ramsey property are indeed merges of Fraïssé classes. Let denote the Fraïssé class of all finite linear orders. When is a Fraïssé class with fAP, by [NR83], has the Ramsey Property. This is, however, not always the case for any Fraïssé class merged with . For example, the class of finite structures with an equivalence relation has the Ramsey property, however, does not.
Merges behave better once we are merging classes which are already rigid and known to have the Ramsey property, as shown in the below theorem by [Bod12]:
Theorem 3.2.
If and are Fraïssé classes of rigid structures (i.e., every automorphism is trivial) and , both have the Ramsey property and dAP, then has the Ramsey Property. Moreover, if is a Fraïssé class of rigid structures with the Ramsey property, and has the Ramsey property, then has the Ramsey property.
This shows, for example, if and are two Fraïssé classes with fAP, has the Ramsey property (when we take the languages of each class to be disjoint) and, moreover, so does . It is not yet clear when Theorem 3.2 will extend to the non-rigid case, or to the general smooth class setting. The proof of the above theorem relies heavily on -categoricity and the results of [KPT04] in rigid settings.
It is our current goal to identify smooth classes with the Ramsey property, but this is a difficult task. As many authors have noted, classes with the Hrushovski property (or EPPA) (defined below) often have connections with classes with the Ramsey property. For example, in the example above has been proven to have EPPA, as well as other classes which have a Ramsey property in some merge. Thus, it seems prudent to study EPPA in the smooth class case in hopes of getting an eventual grasp of the Ramsey property.
We now recall a definition for EPPA in the context of smooth classes:
Definition 3.3.
Let be a smooth class. We say has -EPPA if for any , and for any partial automorphisms of , where, for each , and , then there exists some with such that there exist automorphisms of with . (When is substructure, we simply say EPPA.)
There is a clear relationship between classes with EPPA and amenability, shown in [KR06], which [EHN19] realized extended to -EPPA:
Proposition 3.4.
Let be a smooth class with a generic . If has -EPPA, then is amenable.
It is known by [HO03] that Fraïssé classes with free amalgamation have EPPA. This result does not extend to smooth classes. The Shelah-Spencer class as defined in 2.2, is a class with fAP. It was proven in [GKP16] and [EHN19] that has neither the Ramsey property nor -EPPA. In fact, they proved that the automorphism group is not amenable for any .
We also will make use of a definition of EPPA for permorphisms in the next few sections. These will be definitions originating from Herwig in [Her95] with which we will use the results from [HKN22].
Definition 3.5.
Let be a finite group of permutations of the language which preserve arity of the relations and fix equivalence.
Given an -structure and a bijective function , is a -permorphism of if for all relations .
Definition 3.6.
A class has --EPPA if whenever and are partial permorphisms of such that is a -permorphism for some and for all , then there exists some such that and there exist full permorphisms of such that is a -permorphism and .
3.2 Smooth Classes with -EPPA
In this section, we will prove a particular type of smooth class with fAP has -EPPA. This will be a generalization on work done in both [EHN19] and [HKN22]. We may also extend this to some classes of the same type which do not have fAP. To do this, we will use a nonstandard notion of structure described in [HKN22].
3.2.1 Extended Structures
Because many of the current theorems that give EPPA results involve classes which are Fraïssé classes, or, at minimum, where the relation on the classes is , they cannot be directly applied to smooth classes. A method of remedying this is to convert proper smooth classes to Fraïssé classes by adding partial functions which map points to sets. The newest EPPA results from [HKN22] can handle this type of Fraïssé class and language. However, adding partial functions which map points to sets gives rise to non-standard model theoretic structures. For completeness, we will describe these structures.
Definition 3.7.
Let be a relational language. An extended language of is a language , where is a set of function symbols and is a new unary predicate. For a -structure , let denote the set of all elements of satisfying . A two-sorted -structure is an extended -structure if the set is precisely the power set ; for every relation of arity , ; and for every function of arity , is a partial function such that and .
Definition 3.8.
An extended homomorphism between two extended -structures and is a function such that for all relations
and for any function , we have that
is an extended embedding of into if for all (including equality)
and for any function , we have that
Whenever an extended embedding is onto, is an extended isomorphism between and . An extended structure is an extended substructure of the extended structure if and the map is an extended embedding between and . Whenever is an extended substructure of , we will write . An extended automorphism of an extended structure is an extended isomorphism . An extended partial automorphism of an extended structure is an extended isomorphism such that .
Definition 3.9.
Let be a class of extended -structures related by .
-
1.
We say has closure under extended substructure if is closed under .
-
2.
is an disjoint amalgamation class if is closed under extended substructure, and, for any such that , , there is some such that and .
is a free amalgamation class if it is a disjoint amalgamation class and for any , , as above, we can choose such that for any tuple which includes elements from both and , then no relation holds on in and is not in the domain of any function in .
We will now only work with finite permutation groups on the extended language which fix and preserve equality, arity, and symbol type. The definitions of EPPA, and -EPPA from the previous section generalize to extended structures and extended partial automorphisms. In this context, we use the following main result from [HKN22]:
Theorem 3.10.
Let be a countable, relational language, and let be an extended language of with only unary functions. Let be a finite permutation group on , and therefore on . If is a free amalgamation class of extended -structures, then has -EPPA.
Note that this theorem still applies to standard model-theoretic structures in relational languages, as in these languages, the notion of structures and an extended structure can be viewed identically. The novelty of extended structures is in the advent of functions which map points to sets.
3.2.2 1-local smooth classes
In this section, we will prove that 1-local (defined below) classes have a "Fraïssé-ification" to a class of extended structures, generalizing the argument in §6 of [EHN19]. We prove that 1-local smooth classes have -EPPA and that -EPPA is preserved in a number of merges of these classes.
Definition 3.11.
A smooth class which is closed under substructure is -local if
-
1.
has smooth intersections. From the property of smooth intersections, for any with there is a unique smallest such that . We define .
-
2.
Whenever are such that if , then .
Notice the above properties give us a characterization of the closure relation defined above:
Proposition 3.12.
If is closed under substructure and has smooth intersections, then satisfies (2) in Definition 3.11 if and only if for all with , .
Proof:
Let . First, by condition (2) in Definition 3.11, and by definition of , , and thus . Moreover, by definition of , for all .
Suppose . By assumption, we have that . But, note that . This follows from the fact that since , for every , . The same is true of . Thus, .
We also immediately get:
Proposition 3.13.
If and are both 1-local, then is 1-local.
Definition 3.14.
Let be a 1-local smooth class in the language . Let be a finite permutation group of . Call closure-preserving on if whenever , and is a partial -permorphism of with domain and range such that , then for any , .
Lemma 3.15.
For any 1-local smooth class in a relational language , is closure-preserving on .
Proof:
Suppose and is a partial automorphism of with domain and range such that . Let . Note that since . Now, since and is an isomorphism. By definition of , . Moreover, and by definition, as , . Thus, . Therefore, .
We now give a construction used to prove the main result of this section.
Construction 3.16.
Let be a 1-local, smooth class in a relational language with dAP. Define , where each is a unary function. We will consider extended - structures such that is unary and outputs a set of size .
For each , define the extended expansion of so that is the universe of , and for all , and ,
Moreover, for every , and for , . Define , and consider the class , where is the relation defined in Definition 3.8.
Claim 3.17.
Proof:
If and are in such that , then for and , we have as -structures and . Moreover, from the definitions of and ,
Thus, by definition, .
On the other hand, if such that , then and for any . By definition, we get that for all . Thus, .
Claim 3.18.
is a disjoint amalgamation class
Note that if has fAP, then the same proof below immediately shows is a free amalgamation class, as all functions are unary.
Proof:
Suppose that where . We must show there exists some such that . Clearly, is an -substructure of . Denote the -structure as . Let denote the element of corresponding to . As is closed under substructure, . By definition of , for all with , . This implies that , so . For any , , and therefore , is undefined on . By definition, we have that , the extended structure corresponding to .
Construction 3.16 originated from ([EHN19]. [EHN21]). It is worth noting that any smooth class which satisfies (1) in Definition 3.11 also corresponds to an extended class using a construction similar to Construction 3.16, but the functions needed for that construction need not be unary. The main magic of 1-local classes is that their closure relations can be described point by point, and thus only require the addition of unary functions. The advantage of unary functions is that they preserve free amalgamation from the smooth class. This allow us to apply Theorem 3.10.
We now prove the following:
Proposition 3.19.
If is a -local class with dAP in the relational language , then there is some extended amalgamation class in an extended language of such that for any closure preserving permutation group on , has --EPPA if and only if has -EPPA
Proof:
Let be the extended smooth class corresponding to given by Construction 3.16. Assume has --EPPA. Note that only permutes elements of , so we may consider it to be a permutation group on . We now prove that has -EPPA. Let be in and . Suppose for , is an extended partial -permorphism of . We want to find some such that for , there exists an extended -permorphism of such that .
We may consider each extended -permorphism as a -permorphism of in the language , as by the construction of . As has -EPPA, there is some such that and for , there exists some -permorphism of such that . By construction, . We now show that each is in fact an extended -permorphism of .
As is a -permorphism of , we need only check that preserves the functions of . Let and suppose is defined on . Then, we have . As is a -permorphism and is closure-preserving, . This shows preserves the functions of . Thus, has -EPPA.
The other direction follows similarly.
Example 3.20.
We now give examples of classes which are -local
-
1.
where is the set of all graphs in the language , and if and only if for all , . This class is 1-local.
-
2.
where is the set of all graphs in the language , and if and only if for all , . This class is 1-local.
-
3.
where is the set of all graphs in the language , with 3-ary, and if and only if for all , . This class is 1-local.
-
4.
Any merge of -local classes is -local.
-
5.
All Fraïssé classes are trivially -local.
Thus we can prove:
Proposition 3.21.
If a class is -local and has fAP, then has -EPPA.
Proof:
Putting together Lemma 3.15 and Proposition 3.19, has -EPPA if and only if has EPPA. Since has fAP, then will have free amalgamation as an extended amalgamation class. By Theorem 3.10, has EPPA, and therefore, has -EPPA.
This, in particular, shows that merges of 1-local classes which have fAP will also have -EPPA. Let once again denote the Fraïssé class of all finite linear orders. We now use the theorem given by [EHN21] tailored to extended classes to prove the following:
Corollary 3.22.
If is 1-local with free amalgamation, then has the Ramsey property.
Proof:
This follows by converting to , which has fAP and therefore has the Ramsey property by Theorem 1.3 of [EHN21]. It will then follow that will also have the Ramsey property.
These notions of 1-local classes come as a generalization of the arguments given in ([EHN19], [EHN21], [HKN22]) that the smooth class of -orientations under successor closures has -EPPA. 1-local classes all seem to have a similar definition of the relation , which accounts for their closure relations depending on individual points.
Remark 3.23.
It is also possible to apply the arguments above to show that certain 1-local classes which do not have fAP still have -EPPA. In particular, the class defined in (2) of Example 3.20 has -EPPA, although it certainly does not have fAP. This is done by looking at complements of smooth classes. Let be a relational language. For an -structure , let denote the structure with the same universe as such that for every relation , and , . For a smooth class , the complement of is the class such that and . It is easy to see that is 1-local if and only if is 1-local. It is also immediate that has -EPPA if and only if has -EPPA. Moreover, if is a smooth class, then has -EPPA if and only if the merged class has -EPPA.
3.2.3 Classes without EPPA via 1-local Smooth Classes
Studying smooth classes in the context of EPPA properties can also give some results for EPPA properties of true Fraïssé classes.
Definition 3.24.
Let be a countable, relational language. For a family of finite -structures, define as the class of all -structures so that there does not exist a and a 1-1 mapping such that for all , . Define as the class of all -structures so that there does not exist a and an -embedding .
We say a -structure is irreducible if it cannot be written as a free amalgamation of two of its proper subsets. Let be the class of all -structures so that there does not exist a and a mapping such that is injective on irreducible subsets and for all , .
It is known by [HO03] that if is a Fraïssé class with fAP, then has EPPA.
Suppose that is finite and for every , there is some infinite -structure such that and every partial automorphism of extends to an automorphism of M, and, moreover, for every , . By [HKN22], has EPPA.
Using examples of smooth classes, we can give a proof using a 1-local class that the assumptions above cannot be dropped completely.
Proposition 3.25.
There exists a finite, relational language and a finite family of -structures for which , , and do not have EPPA.
Proof:
Let , a binary relation. Let be the class of all finite -structures. Define the smooth class as if and only if .
Fix such that contains two points so that and a point which is not -connected to any other point in , including itself.
Observation: Consider the partial automorphism . Suppose there were some with for which there exists some automorphism extending . As holds, but fails for every , there must be some such that . But this contradicts that . Thus, there is no with for which there is an automorphism of extending .
Let and , where is a binary relation. Extend to a -structure by stipulating that holds on every 2-tuple of . Let be the class of all finite -structures, and let . Define
We prove that does not have EPPA. The results for and follow by a similar argument.
Suppose did have EPPA. Note that , as all are irreducible by definition of . Then, there would be some such that for any partial -automorphisms of (Note: Here, the domain and range of these partial automorphisms are unrestricted), there exist so that for all .
Notice that we necessarily have that by the definition of and . Moreover, every partial automorphism of is a partial automorphism of . Hence, for , and is an EPPA witness for in the language . This is a contradiction to the observation.
In general, smooth classes give rise to a large variety of classes which cannot have EPPA in the Fraïssé sense.
Fact 3.26.
For a smooth class with a generic , for , let be the class of all such that . If has EPPA, then every partial automorphism of (where the domain and range are simply subsets of ) extends to an automorphism of . If for every , has EPPA, then is the Fraïssé limit of where is the closure of under substructure.
Thus, if the generic of does not extend every partial automorphism of , then does not have EPPA, and moreover, no subclass of has EPPA.
3.3 Merging with 1-local classes
We are now interested in merging classes with EPPA and investigating the resulting merged class. We first observe the following easy fact:
Fact 3.27.
Suppose for every , contains a structure for which for all , holds on every tuple of , and for every , . If is another smooth class such that has -EPPA, then has -EPPA.
The Fraïssé class of equivalence relations under substructure, , for example, would be an example of a as in the above fact. Merges of such classes cannot have any "surprise" EPPA results. For example, any merge of with a class which does not have -EPPA will not have -EPPA.
We now turn to prove some results about classes we know have an EPPA property.
Notation: For every , call an -tuple equivalence relation if is a -ary relation which is transitive, symmetric, irreflexive on -tuples, and whenever holds on tuples and , then for any permutation of the tuple , holds. Let denote the class of finite structures with an -tuple equivalence relation in the language . Set .
We have the following result of [Iva15]:
Theorem 3.28.
The Fraïssé class in the language has EPPA.
The fact that the class has EPPA is interestingly not immediately covered by basic EPPA results that use free amalgamation or forbidden classes. The proof of Theorem 3.28 proceeds by changing the language, extending to a merge of classes, proving the merge has a permorphism EPPA property, then proving the restriction back to has EPPA. It is reminiscent of the operation we applied to -local smooth classes to attain a class of extended structures, though here the goal is to gain a class with free amalgamation. At its core, the proof boils down to an application of Theorem 3.10. Using this, we prove a generalization:
Theorem 3.29.
Let be the Fraïssé class defined above. Let be any -local smooth class with fAP in a countable relational language. Then, the merge in the language has -EPPA.
Proof:
Note that, in this merge, .
Define a new language where is an -ary relation, and let be all structures such that whenever ; for any ; and every is an irreflexive relation (i.e., does not hold on a tuple with repeated elements).
Now, let , and let . Let be any set such that and is finite. Define to be all structures which are in . Let be all arity-preserving permutations of the language . The first observation we make is that has free amalgamation with respect to . Since every fixes , by Theorem 3.10 and Theorem 3.19, has --EPPA.
We now choose any and any partial automorphisms of for which and for . There is a maximum for which is defined on . Thus, for we can enumerate all the classes of each which is satisfied on . Suppose for each , has many classes in . We will then set .
On the universe of , we define an -structure so that if and only if is in the th equivalence class of in . We also require that is precisely . Notice that for each , is a -permorphism of for some and permutes only symbols in .
We automatically get that . has a -- EPPA witness such that and there exist permorphisms of such that . For each , we can find some such that is an - relation not yet appearing in . We will expand to a structure as follows:
For any irreflexive tuple of , if does not hold on any relation in , then we require that holds in the expansion of , call it . Suppose is a permorphism of . Notice that because all tuples which did not belong to a relation in now belong to the same relation in , and since, for each and , must fix , must be a permorphism of as well.
We will define an -structure with the same universe as such that for all , and any -ary tuples , from , if and only if for some . Moreover, we set . As every tuple of satisfies an appropriate equivalence relation, .
Because we have preserved the -structure in our construction, and with respect to the language . Thus, . Now, any permorphism of is clearly an automorphism of , as
And, moreover, it is easy to see that , the original partial automorphisms of . Thus, is a -EPPA witness for .
Using the argument in Remark 3.23
Corollary 3.30.
Let be the Fraïssé class defined above. Suppose is a (possibly infinite) merge of 1-local classes with fAP and/or their complements, then has -EPPA.
We can generalize the proof above slightly:
Definition 3.31.
For defined as above, call a smooth class separably 1-local if there exists some partition where for all , , and on the class , is a 1-local relation.
We can apply the argument in the proof above to a separably 1-local class which has fAP by cutting out and merging it in with a 1-local smooth class to get
Proposition 3.32.
For a smooth class separably 1-local class with fAP and any 1-local smooth class with fAP, has -EPPA.
An easy example of a separably 1-local class is to define for
References
- [Bod12] Manuel Bodirsky “New Ramsey Classes from Old”, 2012 arXiv: https://arxiv.org/abs/1204.3258
- [BS96] John T. Baldwin and Niandong Shi “Stable generic structures” In Annals of Pure and Applied Logic 79.1, 1996, pp. 1–35 DOI: https://doi.org/10.1016/0168-0072(95)00027-5
- [EHN19] David M. Evans, Jan Hubička and Jaroslav Nešetřil “Automorphism groups and Ramsey properties of sparse graphs” In Proceedings of the London Mathematical Society 119.2 Wiley, 2019, pp. 515–546 DOI: 10.1112/plms.12238
- [EHN21] David M. Evans, Jan Hubička and Jaroslav Nešetřil “Ramsey properties and extending partial automorphisms for classes of finite structures” In Fundamenta Mathematicae 253.2 Institute of Mathematics, Polish Academy of Sciences, 2021, pp. 121–153 DOI: 10.4064/fm560-8-2020
- [GKP16] Zaniar Ghadernezhad, Hamed Khalilian and Massoud Pourmahdian “Automorphism Groups of Generic Structures: Extreme Amenability and Amenability”, 2016 arXiv: https://arxiv.org/abs/1508.04628
- [Gun18] Danul K. Gunatilleka “The theories of Baldwin-Shi hypergraphs and their atomic models”, 2018 arXiv: https://arxiv.org/abs/1803.01831
- [Her95] Bernhard Herwig “Extending partial isomorphisms on finite structures” In Combinatorica 15, 1995, pp. 365–371 URL: https://api.semanticscholar.org/CorpusID:13082360
- [HKN22] Jan Hubička, Matěj Konečný and Jaroslav Nešetřil “All those EPPA classes (Strengthenings of the Herwig-Lascar theorem)”, 2022 arXiv: https://arxiv.org/abs/1902.03855
- [HO03] Ian Hodkinson and Martin Otto “Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures” In The Bulletin of Symbolic Logic 9.3 [Association for Symbolic Logic, Cambridge University Press], 2003, pp. 387–405 URL: http://www.jstor.org/stable/3109885
- [Iva15] Aleksander Ivanov “An -categorical structure with amenable automorphism group” In Mathematical Logic Quarterly 61.4-5, 2015, pp. 307–314 DOI: https://doi.org/10.1002/malq.201400036
- [KL92] D. W. Kueker and M. C. Laskowski “On generic structures” In Notre Dame Journal of Formal Logic 33.2 Duke University Press, 1992, pp. 175 –183 DOI: 10.1305/ndjfl/1093636094
- [KPT04] A. S. Kechris, V. G. Pestov and S. Todorcevic “Fraisse Limits, Ramsey Theory, and Topological Dynamics of Automorphism Groups”, 2004 arXiv: https://arxiv.org/abs/math/0305241
- [KR06] Alexander S. Kechris and Christian Rosendal “Turbulence, amalgamation and generic automorphisms of homogeneous structures”, 2006 arXiv: https://arxiv.org/abs/math/0409567
- [Las07] Michael Laskowski “A simpler axiomatization of the Shelah-Spencer almost sure theory” In Israel Journal of Mathematics 161, 2007, pp. 157–186 DOI: 10.1007/s11856-007-0077-8
- [NR83] Jaroslav Nešetřil and Vojtěch Rödl “Ramsey classes of set systems” In Journal of Combinatorial Theory, Series A 34.2, 1983, pp. 183–201 DOI: https://doi.org/10.1016/0097-3165(83)90055-9