Two Fra\"iss\'e-style theorems for homomorphism-homogeneous relational structures
Thomas D. H. Coleman

TL;DR
This paper establishes two Fraïssé-style theorems for various notions of homomorphism-homogeneity in relational structures, advancing understanding of their existence, uniqueness, and classification, especially for countable graphs.
Contribution
It proves two key theorems for twelve notions of homomorphism-homogeneity and clarifies their implications for the classification of countable homogeneous graphs.
Findings
Complete classification of homomorphism-homogeneous undirected graphs
Two Fraïssé-style theorems for twelve notions of homomorphism-homogeneity
Insights into directed graph cases
Abstract
In this paper, we state and prove two Fra\"{i}ss\'{e}-style results that cover existence and uniqueness properties for twelve of the eighteen different notions of homomorphism-homogeneity as introduced by Lockett and Truss, and provide forward directions and implications for the remaining six cases. Following these results, we completely determine the extent to which the countable homogeneous undirected graphs (as classified by Lachlan and Woodrow) are homomorphism-homogeneous; we also provide some insight into the directed graph case.
| isomorphism (I) | monomorphism (M) | homomorphism (H) | |
|---|---|---|---|
| End (H) | IH | MH | HH |
| Epi (E) | IE | ME | HE |
| Mon (M) | IM | MM | HM |
| Bi (B) | IB | MB | HB |
| Emb (I) | II | MI | HI |
| Aut (A) | IA | MA | HA |
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.
\newaliascnt
lemmatheorem \aliascntresetthelemma \newaliascntpropositiontheorem \aliascntresettheproposition \newaliascntcorollarytheorem \aliascntresetthecorollary \newaliascntquestiontheorem \aliascntresetthequestion \newaliascntconjecturetheorem \aliascntresettheconjecture
\newaliascntexampletheorem \aliascntresettheexample
\newaliascntdefinitiontheorem \aliascntresetthedefinition
Two Fraïssé-style theorems for homomorphism-homogeneous relational structures
Thomas D. H. Coleman111School of Mathematics and Statistics, University of St Andrews, St Andrews, KY16 9SS, United Kingdom. Email: [email protected]. This work forms part of the author’s PhD thesis at the University of East Anglia.
Abstract
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness properties for twelve of the eighteen different notions of homomorphism-homogeneity as introduced by Lockett and Truss, and provide forward directions and implications for the remaining six cases. Following these results, we completely determine the extent to which the countable homogeneous undirected graphs (as classified by Lachlan and Woodrow) are homomorphism-homogeneous; we also provide some insight into the directed graph case.
Keywords: homomorphism-homogeneous, relational structures, Fraïssé theory, infinite graph theory.
2010 Mathematics Subject Classification: 03C15 (primary), 05C63
1 Introduction
A relational first-order structure is homogeneous (or ultrahomogeneous, depending on source) if every isomorphism between finite substructures of extends to an automorphism of . Examples of homogeneous structures include the countable dense linear order without endpoints , the random graph and the universal tournament [26]. The celebrated theorem of Fraïssé [16] states that a structure is homogeneous if and only if the class of finite substructures of (often called the age of ) satisfies four distinct conditions; furthermore, is unique up to isomorphism if this is the case. A large body of literature, in a range of subjects across mathematics, is devoted to the study of homogeneous structures. Particular areas of interest include classification results [36] [23] [10], combinatorial aspects [6] and model-theoretic properties, both as objects in their own right and via a link to -categorical structures [17]. Through the link to -categorical structures and the famous Ryll-Nardzewski theorem (also Engeler, Svenonius [17]) there is a well-established connection between automorphisms of countable homogeneous structures and interesting infinite permutation groups [3]. Many properties of automorphism groups of homogeneous structures have been studied, such as topological dynamics [20] and applications to constraint satisfaction problems on infinite domains [5]. Furthermore, the groups themselves have lent themselves to research into properties such as: simplicity [27]; generation [15]; reconstruction of the structure from the automorphism group [2]; the existence of generic elements [37]; and the small index property [18] [21]. An excellent overview of this vast subject is [26].
The idea of homogeneity has been extended to other types of finite partial maps between relational structures. This is the concept of homomorphism-homogeneity; originally developed by Cameron and Nešetřil in 2006 [9] and Mašulović in 2007 [29]. This definition was taken to its logical conclusion in the papers of Lockett and Truss [24] [25], in which they detailed eighteen different notions of homomorphism-homogeneity based on both the finite partial map and the type of endomorphism (see Section 2). An example of this is MB-homogeneity; a structure is MB-homogeneous if every monomorphism between finite substructures of extends to a bijective endomorphism of . The development of this subject has been rapid, culminating in detailed accounts of homomorphism-homogeneous graphs [35] [12], finite tournaments with loops [19], and posets [25]. Aside from these combinatorial studies, finding analogues of results about automorphism groups for endomorphism monoids is a motivating factor in this subject; examples of these include the development of oligomorphic transformation monoids [30] [12] and the idea of generic endomorphisms [24].
Throughout this article, let be a countable relational signature. Suppose that is a class of finite -structures. The proof of one direction of Fraïssé’s theorem uses conditions on to inductively construct a homogeneous structure whose age is . One of these conditions is the joint embedding property (JEP); this property (along with two others) ensures that we can construct a countable -structure with age . The second is the amalgamation property (AP); this ensures that is homogeneous. This final claim is verified by showing that has the extension property, a necessary and sufficient condition for a countable -structure to be homogeneous. Fraïssé’s theorem also states that any two homogeneous -structures with the same age are isomorphic; this is shown using a back-and-forth argument between two similarly constructed structures that builds the desired isomorphism. The forth part of the argument ensures that the extended map is totally defined; the back part ensures that the map is eventually surjective.
Cameron and Nešetřil [9] proved an analogue of Fraïssé’s theorem for MM-homogeneity, where every monomorphism between finite substructures of some structure extends to a monomorphism of (see Section 2). This proof necessitated modification of the amalgamation property to ensure MM-homogeneity; resulting in the mono-amalgamation property (MAP). In a slight departure to the technique used to prove Fraïssé’s theorem, the proof of the analogous theorem for MM-homogeneity in [9] utilised a forth alone argument; this is because the extended map need not be surjective. On the uniqueness side, the same article also showed that two MM-structures with the same age may be non-isomorphic; instead detailing that two MM-homogeneous structures were unique up to a weaker notion called mono-equivalence. The proof of this again used a forth alone argument. Finally, work has been done on the case of HH-homogeneity, where every finite partial homomorphisms of extends to an endomorphism of . The notion of a homo-amalgamation property (HAP) first appeared in the preprint of Pech and Pech [33], in which they used this to prove a version of Fraïssé’s theorem for HH-homogeneity by using a forth alone argument. In addition, they also showed that two HH-homogeneous structures with the same age are homomorphism-equivalent. These results were later published in their following paper [34]. Further insights were made by Dolinka [14], who used the HAP (and the equivalent one-point homomorphism extension property (1PHEP)) to determine which structures were both homogeneous and HH-homogeneous.
In the case of MB-homogeneity, a forth alone approach does not suffice. As the extended map must be surjective, we are required to use a back-and-forth argument. The fact that monomorphisms are not invertible in general necessitates the use of a second amalgamation property alongside the MAP of [9]; this was defined by Coleman, Evans and Gray [12] using antimonomorphisms in the bi-amalgamation property (BAP). In a similar situation to [9], two MB-homogeneous structures with the same age may not be isomorphic but instead are unique up to bi-equivalence; the proof of this also requires a back-and-forth argument.
In light of these previous generalisations of Fraïssé’s theorem and the multitude of types of homomorphism-homogeneity (see Section 2), the natural aim would be to find an “umbrella” version of Fraïssé’s theorem; one that encapsulates all possible notions of homomorphism-homogeneity. This result would supply Fraïssé’s theorem, and the versions of [9] and [12], as corollaries. Such a theorem could help to determine the extent to which a structure is homomorphism-homogeneous based on structural properties. In turn, this will provide a rich source of oligomorphic transformation monoids [12, Theorem 1.7].
However, a compromise must be reached between idealism and practicality for two reasons. First, as discussed above, differing approaches are required if the extended map is surjective; see the contrast between analogues of Fraïssé’s theorem for MM-homogeneity [9] and MB-homogeneity [12] for a case in point. In the forth alone case, we can utilise a single modified amalgamation property in order to construct the structure and extend the map. The issue is that monomorphisms and homomorphisms are not “invertible” in general. This is particularly problematic in the homomorphism case; what could you use to accurately describe the ‘back’ condition for homomorphisms, given that the underlying function may not be invertible? As evidenced in [12], we need two modified amalgamation properties in the back-and-forth case; one for the forth part to ensure the extended map is totally defined, and one for the back part to ensure the resulting map is surjective. Second, some kinds of homomorphism-homogeneity are easier to deal with than others. There is a distinct dichotomy in the set of notions of homomorphism-homogeneity, split between those whose extended maps are not necessarily the same “type” as the partial map (such as MH-homogeneity, in that a homomorphism is not necessarily an monomorphism), and those whose extended maps are definitely of the same type than the partial map (such as MM, or MI-homogeneity). The former case causes issues in inductively constructing a structure due to the lack of certainty about the extended map; this is discussed in further detail in Section 2.
The first of these reasons therefore necessitate two similar but markedly different theorems (Theorem 1.1 and Theorem 1.2) based on whether or not the proof uses forth alone or a back-and-forth argument; these form the central theorems of the paper. The second only allows the two theorems to cover twelve of the eighteen different notions of homomorphism-homogeneity. In the statement of the theorems below, what constitutes the “relevant” amalgamation property and notion of equivalence will be explained in Sections 2 and 4.
Theorem 1.1**.**
Let XY II, MI, MM, HI, HM, HH.
- (1)
If is an XY-homogeneous -structure, then Age* has the relevant amalgamation property.* 2. (2)
If is a class of finite -structures with countably many isomorphism types, is closed under isomorphisms and substructures, has the JEP and the relevant amalgamation property, then there exists a XY-homogeneous -structure with age . 3. (3)
Any two XY-homogeneous -structures with the same age are equivalent up to a relevant notion of equivalence.
Theorem 1.2**.**
Let XZ IA, MA, MB, HA, HB, HE.
- (1)
If is an XZ-homogeneous -structure, then Age* has the two relevant amalgamation properties.* 2. (2)
If is a class of finite -structures with countably many isomorphism types, is closed under isomorphisms and substructures, has the JEP and the two relevant amalgamation properties, then there exists a XZ-homogeneous -structure with age . 3. (3)
Any two XZ-homogeneous -structures with the same age are equivalent up to a relevant notion of equivalence.
While not the ideal “umbrella” theorem, these two results are still useful in determining the extent to which a structure is homomorphism-homogeneous; thus providing interesting examples of oligomorphic transformation monoids. To that end, this article is dedicated to the proof of these two theorems; as well as determining a complete picture of homomorphism-homogeneity for some well-known structures.
Section 2 begins by defining the eighteen different notions of homomorphism-homogeneity, and contains the proof of Theorem 1.1 split into three propositions (2, 2, 2) that correspond to the three points of the theorem. Section 3 utilises the idea of the converse of a function to introduce the concept of an antihomomorphism between two -structures; essentially, this is the preimage of a homomorphism that preserves non-relations. This machinery underpins the ‘back’ condition that is used to extend a map between finite substructures of a -structure to a surjective endomorphism of . Following this, Section 4 is dedicated to the proof of Theorem 1.2. In Section 5 we introduce the idea of a maximal homomorphism-homogeneity class (mhh-class), and determine mhh-classes for every countable homogeneous undirected graph in the classification of Lachlan and Woodrow [23], as well as turning our attention to the directed graph case.
Throughout the article, we will write to mean an -tuple of some set; this non-standard notation is motivated by the use of barred notation to mean converses of functions, which appear more regularly. The notation -1 is reserved exclusively for the inverse of a function. For some countable indexing set , we define to be a relational signature. Usually, will denote a countable -structure on domain . The age Age of is the class of all finite structures that can be embedded in . For more on the introductory concepts of model theory, [17] is a good place to start.
2 Proof of Theorem 1.1
We recall the eighteen different notions of homomorphism-homogeneity as developed in the two papers of Lockett and Truss [24] [25]. Following their lead, we denote each type of endomorphism by a symbol: H for endomorphism, E for epimorphism, M for monomorphism, B for bimorphism, I for embedding and A for automorphism. We cannot assert that a finite partial map is surjective; there is no well defined notion of a finite partial epimorphism, for instance. Therefore, there are only three types of finite partial map of a structure: H for homomorphism, M for monomorphism, and I for embedding. Without loss of generality, maps between finite substructures can be taken to be surjective.
Definition \thedefinition.
Let be a first-order structure, and take X and Y . Say that is XY-homogeneous if every finite partial map of type X of extends to a map of type Y of . We denote the collection of all notions of homomorphism-homogeneity by . Furthermore, we denote the class of all XY-homogeneous structures by XY, and say that is the set of all classes of XY-homogeneous structures.
For example, a structure is HE-homogeneous if every finite partial homomorphism (H) of extends to a epimorphism (E) of . Regular homogeneity (as in [26], for instance) corresponds to IA-homogeneity using this notation. All possible types of homomorphism-homogeneity given in Section 2 are outlined in Table 1.
It is important to make the distinction between a notion of homomorphism-homogeneity and the associated class of homomorphism-homogeneous structures. For example, II-homogeneity and IA-homogeneity represent two different notions of homomorphism-homogeneity under consideration. As outlined in Table 1, II-homogeneity is where every finite partial isomorphism extends to an embedding; IA-homogeneity is where every finite partial isomorphism extends to an automorphism. However, the classes II and IA of homomorphism-homogeneous structures coincide. For countable structures, it was shown by Lockett and Truss [25] that a structure is II (MI, HI)-homogeneous if and only if it is IA (MA, HA)-homogeneous; that is, II = IA, MI = MA and HI = HA. This difference between notions of homomorphism-homogeneity and classes of homomorphism-homogeneous structures is apparent in Section 4, where we re-prove this result of [25] from a Fraïssé-theoretic perspective.
It follows that some notions of homomorphism-homogeneity are stronger than others. For instance, as every bimorphism is a monomorphism, it follows that every MB-homogeneous structure is also MM-homogeneous. Similarly, as an isomorphism is both a monomorphism and a homomorphism, it follows that if a structure is XY-homogeneous then it is also IY-homogeneous. This natural concept inversely corresponds to a natural containment order on the set of homomorphism-homogeneity classes; see Figure 1 for a diagram of this order. Notice that the stronger the notion of homomorphism-homogeneity, the class of countable structures that satisfy that notion is smaller. This difference is explained in more detail in Section 5.
As discussed in the introduction, it is necessary to partition into two pieces based on whether or not the extended map is surjective. This represents the division between cases where a forth alone argument will suffice and the other when we require a back-and-forth construction. Furthermore, there are some elements of that are weaker notions of homogeneity than others. These are of the form XY where a map of type Y does not necessarily imply that it is a map of type X; for instance, a homomorphism is not necessarily a monomorphism. These phenomena motivate the division of into the following subsets:
- •
forth alone ;
- •
back-and-forth XZ : X H, M, I, Z E, B, A;
- •
no implication IH, IE, IM, IB, MH, ME;
- •
implication .
This partitions into four parts based on the intersections of with (see Figure 2, where the boxes represent intersections).
We move on to establish the machinery required for the proof of Theorem 1.1. This result deals with types of homomorphism-homogeneity in (see Figure 2); those that only require a forth construction to prove. Consequently, we have that X,Y H, M, I throughout this section. When we say a map of type X, we are referring to this instance; so if is a map of type H, it is a homomorphism. Notice that I M H.
A critical step in Fraïssé’s proof is the establishment that the inductively constructed structure is homogeneous; nominally by showing that satisfies the extension property, a necessary and sufficient condition for homogeneity. Since different kinds of homomorphism-homogeneity rely on extending different kinds of maps, this property needs to be generalised and then shown to be an equivalent condition to the relevant notion of homomorphism-homogeneity. To that end, we define the XY-extension property (XYEP), where X,Y H, M, I:
(XYEP) A structure with age has the XYEP if for all and maps of type X, there exists a map of type Y extending .
For example, the standard extension property in Fraïssé’s theorem is the IIAP, and the mono-extension property of [9] is the MMAP.
Ideally, we would like to say a structure is XY-homogeneous if and only if has the XYEP, generalising the observation of Fraïssé. However, complications occur in the proof of the converse direction of this statement; this is due to the inductive construction of the extended map. For example, suppose that has the IMEP and that is an isomorphism. Extending this using the IMEP gives a monomorphism where and . However, is a monomorphism between finite substructures; and so in general, we cannot extend to another monomorphism between finite substructures. The only way we can continue extending is if the map of type Y is also of type X. This behaviour is the motivating factor in splitting into and (see • ‣ 2). In light of this, we show that the XYEP is a necessary condition for XY-homogeneity in general, and that it is also sufficient when the extended map of type Y is also a map of type X.
Proposition \theproposition.
Let be a countable -structure with age .
- (1)
Suppose that XY . If is XY-homogeneous, then has the XYEP. 2. (2)
Suppose that XY . If has the XYEP, then is XY-homogeneous.
Proof.
(1) Let and be a map of type X. As Age, there exists an isomorphism . Therefore, is a map of type X between finite substructures of . As is XY-homogeneous, extend to a map of type Y. Hence, is a map of type Y. It remains to show that extends ; for any it follows that
[TABLE]
as extends . Therefore has the XYEP.
(2) Suppose that is a map of type X between finite substructures of . We use a forth argument to extend to a map of type Y. As is countable, we enumerate the points of . Set and and assume that we have extended to a map , where and for all . At most, we can assume that is a map of type Y. Select , where is the least natural number such that . We can see that belongs to . As XY , the map of type Y is also of type X; so use the XYEP to find a map of type Y extending . Repeating this process infinitely many times, ensuring that each appears at some stage, extends to a map of type Y; so is XY-homogeneous. ∎
We now move to the proof of Theorem 1.1. Our eventual aim is to construct a countable structure with age , where is XY-homogeneous. Recall (from [26]) that a class of finite -structures has the joint embedding property (JEP) if for all there exists a such that jointly embeds and . This property, along with being closed under substructures and isomorphisms, and having countably many isomorphism types, is required to construct a countable structure with age ; it has nothing to do with the homogeneity of the structure . In Fraïssé’s theorem, it is the amalgamation property that is central to ensuring that the constructed structure is homogeneous; following the lead of [9], this must be generalised in order to ensure XY-homogeneity. So to construct a countable, XY-homogeneous structure with age , the class of finite structures must have the JEP and some generalised amalgamation property.
Since different types of homogeneity require different amalgamation properties, it then makes sense to define an “umbrella” condition; one that encompasses every required amalgamation property. This is the XY-amalgamation property (XYAP), where X,Y H, M, I:
(XYAP) Let be a class of finite -structures. Then has the XYAP if for all , map of type X and embedding , there exists a , embedding and map of type Y such that (see Figure 3).
Based on choices for X and Y, the XYAP yields nine different amalgamation properties; one for each notion of XY-homogeneity in . For instance, the IIAP is the standard amalgamation property, the MMAP is the MAP in [9] and the HHAP is the HAP from [14]. These are the relevant amalgamation properties as alluded to in Theorem 1.1. Our next result demonstrates Theorem 1.1 (1).
Proposition \theproposition (Theorem 1.1 (1)).
Suppose that XY . If a countable -structure is XY-homogeneous, then Age has the XYAP.
Proof.
Suppose that Age, is a map of type X and is an embedding. Without loss of generality, suppose that is the inclusion map and that . Using XY-homogeneity of , extend to a map of type Y. Set and induce the structure on with relations from . Finally, take to be the inclusion map and define to be the map of type Y. We can see that and so these choices verify the XYAP for Age. ∎
Now, we proceed with the proof of Theorem 1.1 (2). As in [9], different stages of the inductive construction are achieved at even and odd steps.
Proposition \theproposition (Theorem 1.1 (2)).
Suppose that XY . Let be a class of finite -structures that is closed under isomorphism and substructures, has countably many isomorphism types, and has the JEP and XYAP. Then there exists a countable XY-homogeneous -structure with age .
Proof.
Along the lines of similar proofs of Fraïssé’s theorem (see [3], [9]), the idea is to construct over countably many stages, assuming that has been constructed at some stage , with being some . As the number of isomorphism types in is countable, we can choose a countable set of pairs with such that every pair is represented by some pair . Define a bijection such that .
Assume first that is even. As has countably many isomorphism types, we can enumerate the isomorphism types of by . Use the JEP to find a structure that contains both and a copy of ; define to be this structure . Now suppose that is odd. Let be the list of all triples such that and is a map of type X. This list is countable as is and there are finitely many maps of type X from into . Let . Then as , the map exists. Therefore, we can use the XYAP to define such that and the map of type X extends to some map of type Y. This ensures that every possible XY-amalgamation occurs.
Define . Our construction ensures that every isomorphism type of appears at a 0 mod 3 stage, so every structure in embeds into . Conversely, we have that for all . As is closed under substructures, every structure that embeds into is in , showing that Age.
It remains to show that is XY-homogeneous. As XY , it is enough to show that has the XYEP by Section 2. So assume that and that is a map of type X. As is finite, it follows that there exists such that . Furthermore, there exists a triple such that there exists an isomorphism with and . Define ; as , it follows that . Here, is constructed by XY-amalgamating and over ; this provides an extension of type Y to the map of type X. It follows that is a map of type Y extending the map of type (see Figure 4 for a diagram). Therefore, has the XYEP, proving that it is XY-homogeneous.∎
All that remains to show is part (3) of Theorem 1.1. It was previously mentioned in [9] that two MM-homogeneous structures with the same age need not be isomorphic, but are instead mono-equivalent. This inspires another collective definition; and is the relevant notion of equivalence as mentioned in the statement of Theorem 1.1.
Definition \thedefinition.
Let be -structures and suppose that Y H, M, I. Say that and are Y-equivalent if Age Age and every embedding from a finite substructure of can be extended to a map of type Y, and vice versa.
Note that if two structures are M-equivalent, then they are mono-equivalent in the sense of [9]. If two structures are I-equivalent, then they are mutually embeddable.
Proposition \theproposition (Theorem 1.1 (3)).
Let be countable -structures, and suppose that XY .
- (1)
Suppose that are Y-equivalent. Then is XY-homogeneous if and only if is. 2. (2)
If are XY-homogeneous and Age* = Age** then are Y-equivalent.*
Proof.
(1) It suffices to show that has the XYEP by Section 2 (2). Suppose then that Age and there exists a map of type X. Note that need not be isomorphic to . As Age Age, there exists a copy of in ; fix an embedding between the two. Therefore, is a isomorphism from a finite substructure of into ; as the two are Y-equivalent, we extend this to a map of type Y. Now, define a map ; this is a map of type X from into . Since is XY-homogeneous, it has the XYEP by Section 2 (1) and so we extend to a map of type Y. Now, the map is a map of type Y; we need to show it extends . So using the facts that extends and extends , we have that for all :
[TABLE]
Therefore has the XYEP. A diagram of this process can be found in Figure 5.
(2) Let and suppose that is an embedding; trivially, is also a map of type X. We extend to a map of type Y via an inductive argument. As is countable, we enumerate its elements . Set and , and suppose that is a map of type Y where and for all . As XY , is also a map of type X. Select a point , where is the least natural number such that . We see that is a substructure of and is therefore an element of Age by assumption. As is XY-homogeneous, by Section 2 (1) it has the XYEP. Using this, extend to a map of type Y. As XY , we can repeat this process infinitely many times; by ensuring that every is included at some stage, we can extend the map to a map of type Y as required. We can use a similar argument to construct a map of type Y; therefore and are Y-equivalent. ∎
3 Multifunctions and antihomomorphisms
As mentioned in the introduction, homomorphisms are not “invertible” in general. For instance, there could be a homomorphism between two relational -structures sending a non-relation of to a relation in ; that is, such that but . Furthermore, there is no guarantee that the homomorphism is even injective; so could send two points in to the same point in . In establishing a suitable ‘back’ amalgamation property for our Fraïssé-style theorem, both of these considerations must be taken into account. This is achieved by the use of the converse of a function.
For a relation , define the converse of to be the set
[TABLE]
We say that a relation is a partial multifunction if implies that ; and that is a multifunction if, in addition, for all there exists such that . It is easy to see that is a partial multifunction if and only if it is the converse of a partial function , and that is a multifunction if and only if the partial function is surjective. A multifunction is surjective if for all there exists such that . Consequently, is a surjective multifunction if and only if it is the converse of a surjective function . It is clear that a (partial) multifunction is a (partial) function if and only if it is the converse of a (partial) injective function . We adopt this barred notation throughout the rest of this article; if is a function, denote the partial multifunction given by the converse of by , and vice versa. Note that for any function .
Example \theexample.
Let and be two sets, and suppose that is a function. Then the converse of is a partial multifunction given by (see Figure 6). By restricting the codomain of to its image , the resulting function that behaves like is surjective. In this case, the converse of is a surjective and totally defined multifunction (see shaded portion of Figure 6). This technique will be used frequently in Section 4.
If is a multifunction, we will abuse notation and write where the context is clear. If , define the set : . In a contrast with a function, notice that is a set and not a single point; in fact, the set could be infinite (see Section 3). For a tuple , define to be the following set of tuples
[TABLE]
For a subset of , we write
[TABLE]
Abusing terminology, we say that is the image of .
Example \theexample.
Recall that the sign function is the surjective function defined by
[TABLE]
Let be the corresponding surjective multifunction. For example, where is the set of positive real numbers, where is the set of negative real numbers, and .
Remark*.*
We note the equivalence between the image of the converse of a function and the preimage of . The reason for the expression of these sets in terms of converses of functions, and not preimages, is for ease of use and notation.
For a multifunction and a subset , we say that the multifunction that acts like on is the restriction of to . If and are sets, and and are two multifunctions, then we say that extends if for all .
Throughout, we would like to be able to compose functions with multifunctions and vice versa; we achieve this by composing them as relations.
Lemma \thelemma.
- (1)
Suppose that and are multifunctions. Then is a multifunction. 2. (2)
Let and be two functions, and suppose that is their composition. Then the converse map is equal to , where and are composed as relations. ∎
Remark*.*
We previously noted that a function is also a multifunction if and only if it is injective; so by this lemma, the composition of a multifunction with an injective function (or vice versa) is again a multifunction. Furthermore, the assumption that the function is injective in this case is necessary for the composition to be a multifunction.
Now, we extend the theory of multifunctions into the setting of relational first-order structures.
Definition \thedefinition.
Suppose that are two -structures and that is a multifunction. We say that is an antihomomorphism if in then in for all and .
Remark*.*
This definition is equivalent to saying that is an antihomomorphism if for all and for all , then implies that .
Informally, an antihomomorphism is a multifunction that preserves non-relations. The motivation behind this definition is explained by the following alternate characterisation of antihomomorphisms.
Lemma \thelemma.
Let be two -structures. Then is a surjective antihomomorphism if and only if is a surjective homomorphism.
Proof.
Assume that is a surjective homomorphism. As is a surjective function we have that is a surjective multifunction. Now suppose that . As must preserve relations, we have whenever ; this is precisely when . Conversely, suppose that is a surjective antihomomorphism; therefore is a surjective function. Suppose also that holds. As is an antihomomorphism, it follows that for every such that . Since is a function, it must be that for some such that ; so is a homomorphism. ∎
Remark*.*
Following this lemma, if is a surjective homomorphism, we write in order to emphasise that the converse of is both a multifunction and antimonomorphism. Similarly, if is a surjective antihomomorphism, we write to emphasise that the converse of is both a function and a homomorphism. The context for when we use this notation should be clear.
If is any homomorphism, we can restrict the codomain to the image to see that is a surjective homomorphism; and hence is a surjective antihomomorphism by Section 3. This technique will be used regularly in Section 4.
This result leads to an immediate corollary; an analogue of Section 3 (2) for -structures.
Corollary \thecorollary.
Let be -structures, and and are surjective homomorphisms. Then is a surjective antihomomorphism. ∎
Note that if is a bijective homomorphism, then is an bijective function from to that preserves non-relations; this is the definition of an antimonomorphism (see [12]). Furthermore, if is a isomorphism, then is exactly , the inverse isomorphism of . Having determined that the product of two multifunctions is again a multifunction in Section 3, an easy composition lemma for antihomomorphisms follows suit.
Lemma \thelemma.
Let be -structures. Suppose that and are antihomomorphisms. Then their composition is an antihomomorphism. ∎
Remark*.*
We note that as every antimonomorphism and isomorphism is also an antihomomorphism, the product of any antihomomorphism with any antimonomorphism or isomorphism is again an antihomomorphism. This fact turns out to be crucial in the statement of a suitable amalgamation property for the back part of the back-and-forth argument. Furthermore, the product of two antimonomorphisms (or an antihomomorphism and an isomorphism) is again an antimonomorphism.
4 Proof of Theorem 1.2
We now move on to discussing extension of finite partial maps of a -structure to surjective endomorphisms; this is when XZ (see page • ‣ 2, item). Due to the lack of symmetry when working with homomorphisms as opposed to isomorphisms, we must provide a backwards condition to achieve the back part of the required back-and-forth argument. Similar to the more conventional amalgamation properties, this backwards condition is defined on finite structures. This will involve using the concept of antihomomorphisms outlined in Section 3 in three distinct cases; antihomomorphisms () as converse homomorphisms (H), antimonomorphisms () as the converse of monomorphisms (M), and inverse isomorphisms () of isomorphisms (I). Note that the classes I and coincide; we use the barred version when applicable throughout for notational consistency. It can be seen that . We will write to mean some multifunction of type from to (see Figure 7).
This notation is used in another manner: if is a surjective homomorphism of type X, we write to be the corresponding surjective antihomomorphism of type . This is uniquely determined by Section 3; see Figure 7 for corresponding pairs. The context of when we use this will usually be clear. We also recall Section 3 and its following remarks; the composition of two multifunctions of type is again a multifunction of type ; a composition table is given in Figure 7.
We note that if Z = E then it is a surjective map of type Y = H; likewise, when Z = B we have that Y = M and when Z = A we have that Y = I. This relation is codified by the following set of pairs:
[TABLE]
It follows that any XZ-homogeneous structure is also XY-homogeneous, where the two are related by the relevant pair (Z,Y) . Therefore, we need to ensure that any XZ-homogeneous structure we construct is also XY-homogeneous for the appropriate Y; so results in Section 2 should be satisfied by .
As mentioned previously, new properties are required to take care of extension and amalgamation in the backwards direction to ensure the map is surjective. This is achieved by writing generalised conditions utilising the concept of antihomomorphisms. Throughout, we let X,Y H, M, I, , and Z E, B, A. To avoid any potential confusion, whenever we refer to a map of type Z being a surjective map of type Y, the symbol Z is always related to Y in the manner illustrated in (see Equation 1).
Motivated by the desire to take care of the ‘back’ part of a back-and-forth argument that would extend a finite partial map of to a surjective endomorphism of , we can state the -extension property (EP) along similar lines to the XYEP in Section 2.
(EP) Suppose that is a structure with age . For all and a multifunction of type such that is finite, there exists a multifunction of type extending .
Notice that this property differs slightly from previous extension properties as it requires an extra finiteness condition on the image of the multifunction . There could exist multifunctions of type where the image is an infinite set (see Section 3); this would cause problems in the proofs of Section 4 and Section 4.
We turn our attention to finding necessary and sufficient conditions for XZ-homogeneity, to be used throughout the proof of Theorem 1.2. As stated above, we need to ensure that any XZ-homogeneous structure we construct is also XY-homogeneous for the appropriate Y. It follows that such a structure must satisfy all the conditions outlined in Section 2; in particular, XY must be in for part (2). With these restrictions in mind, and a desire to obtain the most general result possible, we show that both the XYEP and EP are necessary conditions for XZ-homogeneity in general, and that it these are also sufficient when the extended map of type Y is also a map of type X.
Proposition \theproposition.
Let be a -structure with age .
- (1)
*Suppose that XZ . If is XZ-homogeneous, then has both the XYEP and the *EP. 2. (2)
*Suppose that XZ . If has the XYEP and the *EP, then is XZ-homogeneous.
Proof.
(1) As is XZ-homogeneous, it is also XY-homogeneous and so it has the XYEP by Section 2 (1). Now, suppose that and is a multifunction of type with finite. As is the age of , it follows that contains copies of and and there are isomorphisms and . Restrict the codomain of to its image to find a map ; as this is a surjective multifunction of type , we have that is also a surjective multifunction of type . By Section 3, the converse of is a surjective map of type X with finite domain ; as is XZ-homogeneous, extend to a map of type Z. So is a surjective map of type Y; by Section 3, define to be the corresponding surjective multifunction of type . We need to show it extends . As extends , then extends . So for all :
[TABLE]
and hence has the EP.
(2) Now suppose that XZ ; so a multifunction of type implies that it is also a multifunction of type . Suppose also that has the XYEP and the EP, and that is a map of type X between substructures of . We use a back-and-forth argument to show that is XZ-homogeneous.
Set , and , and assume that we have extended to a surjective map of type Y (and hence of type X, by assumption), where each and for all . Note also that and are finite for all . Furthermore, as is countable we can enumerate the elements of .
If is even, select a point where is the smallest number such that , so . Using the XYEP, extend to a map of type Y; by restricting the codomain of to its image, it follows that is a surjective map of type Y extending .
If is odd, choose a point where is the smallest number such that ; so . Note that as is a surjective map of type X, we have that is a surjective multifunction of type . As is finite, we can use the EP to extend to a multifunction of type . Restricting the codomain of to its image gives a surjective multifunction of type , where is a non-empty set. As is a surjective multifunction of type , we have that is a surjective map of type Y extending .
Since XZ , a map of type Y is also a map of type X; so we can use the XYEP and EP to repeat this process infinitely many times. By ensuring that each point of appears at both an odd and even step, we extend to a surjective map of type Y; which is a map of type Z and so is XZ-homogeneous. ∎
Remark*.*
Together, Section 2 and Section 4 re-prove [25, Lemma 1.1], which states that a countable structure is II (MI, HI)-homogeneous if and only if it is IA (MA, HA)-homogeneous. For if a structure is HI-homogeneous, then it has the HIEP by Section 2; this implies that every homomorphism between finite substructures of is an isomorphism. Since this happens, it follows that every antihomomorphism between finite substructures of is an isomorphism. Finally, as has the HIEP it must have the EP as well and so is HA-homogeneous by Section 4. A similar argument works for the equality concerning MI-homogeneous structures. In the II case, the IIEP is the standard extension property (EP) from Fraïssé’s theorem, and so any structure with the IIEP is homogeneous by the same result.
We now state our new amalgamation property to accommodate the back portion of a back-and-forth argument; this is the -amalgamation property (AP):
(AP) Let be a class of finite -structures. We say that has the AP if for all , multifunction of type and embedding , there exists a , embedding and multifunction of type such that (see Figure 8).
Note that this property represents nine different amalgamation conditions. This corresponds to one for each class XZ , where (Z,Y) (see Equation 1 on page 1) and X and are related as in Figure 7. For examples, the AP is the standard amalgamation property, and the AP is the BAP of [12].
We can now prove Theorem 1.2 (1). Before we do, we state a straightforward yet important fact about surjective endomorphisms of an infinite first-order structure .
Lemma \thelemma.
Let be a -structure, with a finite substructure of . Then for any Epi, there exists a finite structure such that . ∎
Proposition \theproposition (Theorem 1.2 (1)).
Suppose that XZ . If a structure is XZ-homogeneous, then Age has the XYAP and the AP.
Proof.
As is XZ-homogeneous then it is XY-homogeneous and so has the XYAP by Section 2. To show that Age has the AP, suppose that Age, is a multifunction of type and is an embedding. We can assume without loss of generality that are actually substructures of and that is the inclusion mapping.
By restricting the codomain of to its image, is a surjective multifunction of type ; hence the converse of is a surjective map of type X. Use XZ-homogeneity to extend to a map of type Z; and so a surjective map of type Y. We see that is a structure containing , and that extends . Define . As is surjective, there exists a finite substructure such that by Section 4. Now, define the map to be the inclusion map. Since is a surjective map of type Y, is a surjective multifunction of type by Section 3. Therefore is a surjective multifunction of type ; furthermore, as . Define to be the multifunction of type . It is easy to check that and so Age has the AP. ∎
We now show the existence portion of Theorem 1.2. Note that the previously described inductive construction of an infinite structure in Section 2 used even and odd steps to achieve different stages of the construction at different times. Because we have two amalgamation properties, as well as the JEP to ensure a countable structure exists, we proceed using an inductive argument at steps congruent to 0, 1, 2 mod 3 to accommodate different stages of the construction.
Proposition \theproposition (Theorem 1.2 (2)).
Suppose that XZ . Let be a class of finite -structures that is closed under substructures and isomorphism, has countably many isomorphism types and has the JEP, XYAP and the AP. Then there exists a XZ-homogeneous -structure with age .
Proof.
We build over countably many stages, assuming that has been constructed at some stage , with being some . As the number of isomorphism types in is countable, we can choose a countable set of pairs with such that every pair is represented by some pair . Let , where . Define two bijections such that for .
Assume first that . As has countably many isomorphism types, we can enumerate the isomorphism types of by . Use the JEP to find a structure that contains both and a copy of some ; define to be this structure . Now suppose that . Let be the list of all triples such that and is a map of type X. This list is countable as is and there are finitely many maps of type X from into . Let . Then as , the map exists. Therefore, we can use the XYAP to define such that and the map of type X extends to some map of type Y (see Figure 9 (1)). This ensures that every possible XY-amalgamation occurs. If , let be the list of all triples such that and is a multifunction of type with finite image ; again, this list is countable. Let ; as it follows that the multifunction of type is well-defined. So we can use the XZAP to define such that and the multifunction extends to some multifunction (see Figure 9 (2)). This construction ensures that every possible XZ-amalgamation occurs.
Define . Our construction ensures that every isomorphism type of appears at a 0 mod 3 stage, so every structure in embeds into . Conversely, we have that for all . As is closed under substructures, every structure that embeds into is in , showing that Age.
It remains to show that is XZ-homogeneous. By Section 4 and the fact that XZ , it is enough to show that has both the XYEP and the EP. Assume that and that is a map of type X. Using a similar argument to that of Section 2 (with and ), we can show that as has the XYAP, then has the XYEP.
Now suppose that and is a multifunction of type with finite image . As is finite, it follows that there exists such that . Furthermore, there exists a triple such that there exists an isomorphism with and . Define ; as , then . Here, is constructed by -amalgamating and over ; this amalgamation extends the multifunction of type to the multifunction of type . Consequently, the multifunction of type extends the multifunction of type (see Figure 10 for a diagram). As has both the XYEP and the EP, it follows that is XZ-homogeneous by Section 4. ∎
Finally, we show part (3) of Theorem 1.2. Using the fact that XZ-homogeneous structures have two extension properties, we can ensure that a map between two of them is surjective by using a back-and-forth argument. This motivates a new definition, building on that of Y-equivalence.
Definition \thedefinition.
Let be -structures, and suppose that Z E, B, A corresponds to the surjective map of type Y H, M, I via the relation . Say that and are Z-equivalent if Age = Age and every embedding from a finite substructure of into extends to a surjective map of type Y, and vice versa.
For an example, are B-equivalent means that they are bi-equivalent in the sense of [12]. Note that if two structures and are Z-equivalent, then they are also Y-equivalent where (Z,Y) (from Equation 1).
Proposition \theproposition (Theorem 1.2 (3)).
Suppose that XZ .
- (1)
Assume that are Z-equivalent. Then is XZ-homogeneous if and only if is. 2. (2)
If are XZ-homogeneous and Age* = Age*, then and are Z-equivalent.
Proof.
(1) As are Z-equivalent they are also Y-equivalent; as is also XY-homogeneous, so is by Section 2. By Section 2, it follows that has the XYEP. We show now that has the EP. Suppose that Age and there exists a multifunction of type with finite. Note that need not be isomorphic to . As Age Age there exists a copy of in ; fix an isomorphism between the two. Therefore, is a isomorphism from a finite structure of into ; as the two are Z-equivalent, we extend this to a surjective map of type Y. This in turn induces a surjective map by Section 3. Note that extends the isomorphism . Now, define ; this is a multifunction of type from into with finite. Since is XZ-homogeneous, it has the EP by Section 4 and so we extend to a multifunction of type . Here, the multifunction is also of type ; we need to show it extends . As extends , it follows that:
[TABLE]
for all . Therefore has the XZEP.
(2) It is enough to show that has the XYEP and the EP by Section 4. We utilise a back-and-forth argument constructing the surjective map over infinitely many stages. Let be a bijective embedding from a finite structure to a finite substructure . Set , and and assume that is a surjective map of type Y (and so of type X by assumption) extending . Note that as both and are countable, then there exists enumerations and .
If is even, select a , where is the smallest natural number such that . So , and is also in Age by assumption. As is XZ-homogeneous it has the XYEP by Section 2 and we use this to extend to a map of type Y. Restricting the codomain of to its image yields a surjective map of type Y. If is odd, select a such that is the smallest natural number such that . Hence and thus it is an element of Age by assumption. As is a surjective map of type Y, its converse is a surjective multifunction of type by Section 3, and of type by assumption. As is XZ-homogeneous it has the EP and so we can extend to a multifunction of type . By restricting the codomain of to its image, we obtain a surjective multifunction of type , where : is a non-empty set. So by Section 3, there exists a surjective map of type Y extending . By our earlier assumption, as a map of type Y is also a map of type X, we can repeat this process infinitely many times. By ensuring all points in appear at even stages and all points in appear at odd stages, we construct a surjective map of type Y as required. We can use a similar method to show that we can extend any embedding , where and , to a surjective map of type Y; proving that and are Z-equivalent. ∎
Of course, the open problem that arises from Sections 2 and 4 is:
Question \thequestion.
Can we expand Theorem 1.1 and Theorem 1.2 to include those homomorphism-homogeneity classes in ?
5 Maximal homomorphism-homogeneity classes
This section is devoted to determining the extent to which well known examples of homogeneous structures are also homomorphism-homogeneous. In some cases, verifying that a structure is homogeneous involves using a property of to determine that has the EP, and so is homogeneous. Good examples of such properties are the density of , and Alice’s restaurant property characteristic of (see Subsection 5.1). In the homomorphism-homogeneity case, this idea was used by Cameron and Lockett [8] and Lockett and Truss [25] to classify homomorphism-homogeneous posets and determine their position relative to the natural containment order on (see Figure 1). In addition to this, Dolinka [14] used properties of known homogeneous structures to show that they satisfied the one-point homomorphism extension property (1PHEP), a necessary and sufficient condition for HH-homogeneity. Our approach in this section is similar to that of Section 3 of [14]; by defining necessary and sufficient conditions for XY and XZ-homogeneity and using properties of structures to show that these are satisfied or not satisfied. As in Section 4, we let X,Y H, M, I, , and Z E, B, A throughout this section. Furthermore, the pair (Z,Y) is related as in Equation 1 on page 1.
So to begin this section, we define the one-point XY-extension property, and the one-point -extension property:
(1PXYEP) We say that a -structure with age has the 1PXYEP if for all with and maps of type X, there exists a map of type Y extending .
(1PEP) Suppose that is a -structure with age . Say that has the 1PEP if for all with , and a multifunction of type with finite, there exists a multifunction of type extending .
For an example, the 1PHHEP is the same thing as the 1PHEP of [14]. These properties, together with the next proposition, provide some of the theoretical basis for the examples that follow.
Proposition \theproposition.
Suppose that XY . A countable -structure has the XYEP / EP if and only if it has the 1PXYEP / 1PEP.
Proof.
The forward direction for both the XYEP and EP cases is clear. We now aim to show that if has the 1PXYEP then has the XYEP. Assume that with , and is a map of type X. We prove the result by induction on the size of this complement; the base case (where = 1) is true by the assumption that has the 1PXYEP.
So suppose that for some , for any where and any map of type X can be extended to a map of type Y. Take where and to be some map of type X. Now, there exists containing such that . By the inductive hypothesis, we can extend to a map of type Y. As XY , it follows that is also a map of type X. Now, using the 1PXYEP, extend to a map of type Y. Since and extends which extends , we have that extends and so we are done. Using a similar argument, we can show that if has the 1PEP then it has the EP. ∎
Remark*.*
Let XY . Together with Section 2, this result states that a countable structure has the 1PXYEP if and only if is XY-homogeneous. Similarly, by Section 4 a countable structure is XZ-homogeneous if and only if it has the 1PXYEP and the 1PEP, where (Z,Y) are as in (Equation 1 on page 1).
By considering properties of partial maps and endomorphisms of structures, our next result places restrictions on certain types of homomorphism-homogeneity. We look at structures known as cores; a structure is a core if every endomorphism of is an embedding [4]. Widely studied examples of cores include the countable dense linear order without endpoints , the complete graph on countably many vertices , the -free homogeneous graphs for [32] and the Henson digraphs [12]. This straightforward result includes a restatement of Lemma 1.1 of [25].
Lemma \thelemma.
Let be a countable -structure.
- (1)
* is MI and MA-homogeneous (HI and HA-homogeneous) if and only if is IA-homogeneous and every finite partial monomorphism (homomorphism) of is an isomorphism.* 2. (2)
If is HM or HB-homogeneous, then every finite partial homomorphism of is also a monomorphism. 3. (3)
Let be a core. If there exists a finite partial monomorphism of that is not an isomorphism, then is not MH-homogeneous.
Proof.
(1) is contained in Lemma 1.1 of [25]; notice that we cannot extend a map that is not a partial isomorphism of to an isomorphism of the entire structure . The converse direction is clear. To show (2), note that if is a finite partial homomorphism of that is not injective, then we cannot possibly extend this to an injective map and so does not have the HMEP. For (3), let be a finite partial monomorphism of a core that is not an isomorphism. As any endomorphism of is an embedding, we cannot extend . ∎
Remark*.*
Note that (1) and (2) also follow from Theorem 1.1 and Theorem 1.2.
Following the approach of [25] in classifying homomorphism-homogeneous posets, the idea of this section is to look at properties of graphs and digraphs to determine “maximal” homomorphism-homogeneity classes with respect to the containment order on . We formally define what we mean by “maximal”.
Definition \thedefinition.
Let be a first-order structure. A homomorphism-homogeneity class XY is maximal for if is XY-homogeneous and is not PQ-homogenenous, where PQ XY in . If this happens, we say that XY is a maximal homomorphism-homogeneity class (shortened to mhh-class) for .
Remark*.*
While this definition describes a minimal element in the poset , it is so named because of the strengths of different notions of homomorphism-homogeneity. For instance, HA-homogeneity is a stronger condition than IA-homogeneity, but HA IA in . This reflects the inverse correspondence between the relative strength of notions of homomorphism-homogeneity in and containment of classes in (see the discussion on page 1).
For example, if is MB-homogeneous but not MA or HB-homogeneous, then MB is a mhh-class for . A structure may have more than one mhh-class. The set of mhh-classes for completely determines the extent of homomorphism-homogeneity satisfied by ; we therefore denote this set by . As an example HA; this example arose from the classification of homomorphism-homogeneous posets in [25].
If is a countable -structure where there exists a finite partial monomorphism of that is not an isomorphism, and a finite partial homomorphism of that is not an monomorphism, then Section 5 implies that the “best possible” mhh-classes for are IA, MB and HE. As an aside, these classes have important roles to play in the theory of generic endomorphisms [24].
Before we investigate some examples in the context of this article, we note the following direct consequence of Section 5 (3) with respect to Section 5.
Corollary \thecorollary.
Let be a countable homogeneous core. If there exists a finite partial monomorphism of that is not an isomorphism, then IA. ∎
Remark*.*
It has been shown that every -free graph (for ) [32], every Henson digraph (for any set of tournaments on more than vertices) and the myopic local order [12] are cores. By Section 5, it follows that the mhh-class for each of these structures is IA.
In the rest of this section, we look at a selection of countable homogeneous graphs and digraphs encountered throughout the literature in order to determine sets of mhh-classes for these structures. By restricting ourselves to classes XY , we can recall Section 5 and the remark that follows it; to show that is XY-homogeneous it suffices to show that has the 1PXYEP, and to show that is XZ-homogeneous it suffices to show that it has the 1PXYEP and the 1PEP.
5.1 Graphs
In this article, a graph is a set of vertices together with a set of edges , where this edge set interprets a irreflexive and symmetric binary relation . For , recall that a complete graph on vertices is a graph on vertex set (with ) with edges given by if and only if . The complement of the graph is called the null graph on vertices or an independent set on vertices, and is denoted by . Recall that the complement of a graph is the graph ; that is, the graph on vertex set where all the edges in are non-edges of and vice versa. A subset of is an independent set if for all . For more on the basics of graph theory, see [13].
Example \theexample.
It is well-known (see [23]) that the complete graph on countably many vertices is homogeneous. Suppose that is a homomorphism between two finite substructures of . Then as preserves edges, it cannot send two distinct vertices to a single point ; hence is injective. As there are no non-edges to preserve, it must preserve non-edges and so is an embedding. It follows from Section 5 (1) that is HA-homogeneous and so HA.
Its complement , the infinite null graph, is also homogeneous and as every finite partial monomorphism of preserves non-edges, it is MA-homogeneous by Section 5 (1). We note that there exist non-injective finite partial homomorphisms of and hence it is not HM or HB-homogeneous by Section 5 (3). So if is any finite partial homomorphism, we can define a bijective map and note that the map that acts like on and everywhere else is an epimorphism of ; so is HE. Hence MA, HE.
Example \theexample.
Let be the random graph (see [7], for instance). Note that there exist finite partial monomorphisms of that are not isomorphisms and finite partial homomorphisms of that are not monomorphisms; hence is not MI or HM-homogeneous by Section 5. It was shown in [12] that is MB-homogeneous and in [9] that is HH-homogeneous; here, we show that is HE-homogeneous. To do this, we rely on the Alice’s restaurant property characteristic of (see [7]), which says:
(ARP) For any finite, disjoint subsets , there exists such that for all and for all .
Let Age with and suppose that is an antihomomorphism such that is finite. Using ARP, we can find a vertex such that is independent of everything in . Let be the multifunction defined by such that and ; this is an antihomomorphism as all non-edges from to are preserved. Therefore, has the 1PEP and so is HE-homogeneous by Section 5 and Section 4. We conclude that IA, MB, HE.
Remark*.*
It was shown in [24, Theorem 5.3] that has a generic endomorphism. As is HE-homogeneous, it follows from Theorem 2.1 of the same source that this generic endomorphism must be in Epi.
Example \theexample.
Let be the complement of the homogeneous -free graph for . It was previously shown that is MM but not MB-homogeneous [12]. A result of [14] shows that has the 1PHHEP, and so is both MM and HH-homogeneous by these two results.
We now show that does not have the 1PEP and hence cannot be HE-homogeneous. Let be a single vertex, and let be the independent pair of vertices . Note that Age. Let be an antihomomorphism sending to an independent set of vertices in ; such a substructure exists by definition of . Then as antihomomorphisms preserve non-edges and cannot send two points in a domain to a single point in the codomain, a potential image point for in must be a vertex independent of ; this cannot happen as would then induce an independent -set. So does not have the 1PEP. Therefore, is not HE-homogeneous and we see that IA, MM, HH.
The next result, detailing the rest of the disconnected, countably infinite homogeneous graphs, extend results of [9] and [35].
Proposition \theproposition.
Let be a disjoint union of many complete graphs, each of which have size .
- (1)
If for some and , then IA, MM, HH. 2. (2)
If and , then IA, HE. 3. (3)
If , then IA, MB, HE.
Proof.
- (1)
It is shown in [12] that the finite disjoint union of infinite complete graphs is MM but not MB-homogeneous. Furthermore, [9, Proposition 1.1] asserts that is HH-homogeneous. It remains to prove that is not HE-homogeneous; here, it is enough to show that does not have the 1PEP by Section 5 and Section 4. As in this case does not embed an independent -set, the proof of this is similar to Subsection 5.1. 2. (2)
In this case, is HH-homogeneous by [9, Proposition 1.1], but not MM-homogeneous by Proposition 2.5 of the same paper. We show that has the 1PEP in this case; proving that is HE-homogeneous. Suppose that Age with and that is an antihomomorphism such that is finite. As is finite, it follows that for some finite set . Select a , where ; so is independent of every element of . Define to act like on with . Then is an antihomomorphism and so has the 1PEP. 3. (3)
The proof that is MB-homogeneous can be found in [12, Proposition 3.4]; the proof that it is HE-homogeneous is similar to part (2).
∎
The only countable homogeneous graphs that have not yet been considered are the complements of the disconnected graphs described in Subsection 5.1. The following result deals with these cases. Recall from [35, Theorem 3, Theorem 5] that a countable graph is MH-homogeneous if and only if it is HH-homogeneous; if this graph is also connected, then it is HH-homogeneous if and only if it is MM-homogeneous.
Proposition \theproposition.
Let be the complement of a disjoint union of many complete graphs, each of which have size .
- (1)
If for some and , then IA. 2. (2)
If and , then IA, MM, HH. 3. (3)
If , then IA, MB, HE.
Proof.
- (1)
Notice that does not contain an infinite complete graph; therefore it is not MM-homogeneous by [9, Proposition 2.5]. Since is connected, it is not MH-homogeneous by the results of [35] mentioned above. 2. (2)
In this case, any finite set of vertices has a vertex such that is adjacent to every element of . (This is property of [12].) Therefore, is MM and HH-homogeneous by [9, Proposition 2.1]. If were MB-homogeneous, then would be MB-homogeneous by [12, Proposition 3.1]; contradicting Subsection 5.1. So is not MB-homogeneous. It remains to show that is not HE-homogeneous; the proof of this is similar to Subsection 5.1 (1). 3. (3)
This is MB-homogeneous by the remark following [12, Proposition 3.4]. It can be shown that this is HE-homogeneous using a similar argument to part (2) of Subsection 5.1.
∎
Remark*.*
Notice that part (2) of both Propositions 5.1 and 5.1 show that the complement of a HE-homogeneous graph is not necessarily HE-homogeneous.
These results mean that we have determined the mhh-classes for all countable homogeneous graphs in Lachlan and Woodrow’s classification [23]; the results are summarised in Table 2.
5.2 Digraphs
Following the results of Subsection 5.1 and similar work on posets [25], the next natural direction would be to determine mhh-classes for the countable homogeneous digraphs. Unless stated otherwise, in this article a digraph is a set of vertices together with a set of ordered pairs, called arcs of the digraph. For two vertices of , we write if , and if neither nor are in . All the digraphs in this article are loopless; so for all , it follows that . Additionally, we stipulate that they do not contain -cycles – there is a 2-cycle between and if and only if and – with the notable exception of Subsection 5.2.
We provide a few introductory observations here, and leave the further development of the subject as an open question. Our first example deals with the countable homogeneous tournaments, classified in [22].
Example \theexample.
Recall that a tournament is defined to be an oriented, loopless complete graph. By a similar argument to the complete graph in Subsection 5.1, every finite partial homomorphism of a tournament is an embedding. It follows from Section 5 (1) that every countable homogeneous tournament is HA-homogeneous. Therefore, the three countable homogeneous tournaments as classified by Lachlan [22], namely , the random tournament , and the local order , are all HA-homogeneous. So HA is the unique mhh-class for these three examples.
Example \theexample.
Let be the generic digraph without -cycles; for a detailed definition, see [1]. This is the unique countable homogeneous structure whose age contains all finite digraphs without -cycles. This structure is also MB-homogeneous [12, Example 4.4].
However, is not HH-homogeneous. First of all, as there exist finite partial homomorphisms of that are not monomorphisms (such as an independent -set being mapped to a single point), is not HM-homogeneous by Section 5 (2). To show that is not HH-homogeneous, it is enough to prove that every endomorphism of is a monomorphism. Consider End, and suppose there exists such that . As is universal and homogeneous, there exists an oriented graph such that and (see Figure 11).
The image of under is a 2-cycle and this is a contradiction as does not embed -cycles. It follows that every endomorphism of is a monomorphism and so is not HH-homogeneous. We conclude that the mhh-classes of are IA and MB.
Corollary \thecorollary.
Let be a countable connected homogeneous digraph that embeds the digraph as in Figure 11. Then Mon End and is not HH-homogeneous. ∎
Remark*.*
It was shown in [12] that the -free digraph for is MM but not MB-homogeneous. It follows from Subsection 5.2 that the mhh-classes for these digraphs are IA and MM.
In the disconnected case, the situation is slightly different. Here is an example of a HE-homogeneous digraph.
Example \theexample.
Let be the countable, homogeneous random tournament (see [22]). Using homogeneity of , we can show that satisfies the following property :
(Property ) For all finite, disjoint subsets of there exists such that for all in and for all .
Now, let be the infinite disjoint union of isomorphic copies of the countable random tournament. Our aim is to show that is HE-homogeneous; so it is enough to show that has both the 1PHHEP and 1PEP by Section 5 and Section 4. Suppose then that Age is such that . As Age, we can write , where each is a finite tournament and is finite. Let be a homomorphism. There are two cases to consider; either is independent of every tournament in , or it is not. If is independent of every tournament in , then choose any vertex ; the function acting like on and sending to is a homomorphism. If is not independent of , then there is only one tournament that is related to . Partition into two sets
[TABLE]
As is a tournament, it follows that is bijective and so and partition . As is a homomorphism, is a finite subtournament of for some ; so both and are finite. We can use property of to find a vertex such that for all and for all . Now, define a function that acts like on and sends to ; here, preserves all relations and so is a homomorphism. Therefore, has the 1PHHEP.
The proof that has the 1PEP follows from a similar argument to Subsection 5.1 (2). Hence is HE-homogeneous by Section 5 and Section 4. Adapting this proof for the 1PMMEP and 1PEP, we can show that is MB-homogeneous; so IA, MB, HE.
Changing our definition of digraph to include -cycles also increases the flexibility of the structure.
Example \theexample.
Let be the generic digraph with -cycles; similar to , it is the unique countable homogeneous digraph whose age contains all finite digraphs with -cycles. Recall (from [31, ch4] or [11, ch2]) that has a characteristic extension property known as the directed Alice’s restaurant property (DARP), which says:
(DARP) For any finite and pairwise disjoint sets of vertices of , there exists a vertex of such that: there is an arc from to every element of , an arc to from every element of , a 2-cycle between and every element of , and is independent of every vertex in . (See Figure 12 for a diagram of an example.)
It was mentioned in [12] that is MB-homogeneous. Using the DARP, we show that is HE-homogeneous. Let Age with and suppose that is a homomorphism. As is finite, we can use DARP to find a vertex such that there is a 2-cycle between and every element in . Let be the map such that and ; this is a homomorphism as all arcs from to are preserved. Therefore has the 1PHHEP. The proof to show that has the 1PEP is similar; we use DARP to instead find a vertex that is independent of the finite set . The resulting multifunction is an antihomomorphism as it preserves all non-relations. Therefore, is HE-homogeneous by Section 5 and Section 4. So IA, MB, HE.
Remark*.*
Note the difference between the mhh-classes of , the generic digraph without 2-cycles, and , the generic digraph with 2-cycles.
The work in this section leads to a natural open question.
Question \thequestion.
Investigate countable homomorphism-homogeneous digraphs (both with and without -cycles) in more detail. In particular, determine the mhh-classes for those countable homogeneous digraphs in Cherlin’s classification [10].
Acknowledgements: The author would like to thank Christian and Maja Pech for pointing out an oversight in the introduction.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Agarwal, Reducts of the generic digraph. Annals of Pure and Applied Logic , 167(3):370–391, 2016.
- 2[2] S. Barbina and H. D. Macpherson, Reconstruction of homogeneous relational structures. The Journal of Symbolic Logic , 72(3):792–802, 2007.
- 3[3] M. Bhattacharjee and H. D. Macpherson and R. G. Möller and P. M. Neumann, Notes on Infinite Permutation Groups . Number 1698 in Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1998.
- 4[4] M. Bodirsky, The core of a countably categorical structure. In STACS 2005 , pages 110–120. Springer, 2005.
- 5[5] M. Bodirsky, Complexity classification in infinite-domain constraint satisfaction. ar Xiv preprint ar Xiv:1201.0856, 2012.
- 6[6] P. J. Cameron, Oligomorphic permutation groups , volume 152. Cambridge University Press, Cambridge, 1990.
- 7[7] P. J. Cameron, The random graph. In The Mathematics of Paul Erdös II , pages 333–351, volume 14, Springer Science and Business Media, 1997.
- 8[8] P. J. Cameron and D. C. Lockett, Posets, homomorphisms and homogeneity. Discrete Mathematics , 310(3):604–613, 2010.
