On Extensions of Partial Isomorphisms
Mahmood Etedadialiabadi, Su Gao

TL;DR
This paper explores extensions of finite structures in relational languages, characterizes minimal HL-extensions, and introduces ultraextensive structures, revealing properties of their automorphism groups.
Contribution
It provides a complete description of finite minimal HL-extensions and introduces ultraextensive structures, expanding understanding of automorphism groups in model theory.
Findings
Finite minimal HL-extensions are fully characterized.
The group-theoretic property is closed under free products.
Every countable structure can be extended to a countable ultraextensive structure.
Abstract
In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language . We give a description of all finite minimal HL-extensions of a given finite -structure. In addition, we study a group-theoretic property considered by Herwig--Lascar and show that it is closed under taking free products. We also introduce notions of coherent extensions and ultraextensive -structures and show that every countable -structure can be extended to a countable ultraextensive structure. Finally, it follows from our results that the automorphism group of any countable ultraextensive -structure has a dense locally finite subgroup.
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.
On extensions of partial isomorphisms
Mahmood Etedadialiabadi
Department of Mathematics, University of North Texas, 1155 Union Circle #311430, Denton, TX 76203, USA
and
Su Gao
Department of Mathematics, University of North Texas, 1155 Union Circle #311430, Denton, TX 76203, USA
Abstract.
In this paper we study a notion of HL-extension (HL standing for Herwig–Lascar) for a structure in a finite relational language . We give a description of all finite minimal HL-extensions of a given finite -structure. In addition, we study a group-theoretic property considered by Herwig–Lascar and show that it is closed under taking free products. We also introduce notions of coherent extensions and ultraextensive -structures and show that every countable -structure can be extended to a countable ultraextensive structure. Finally, it follows from our results that the automorphism group of any countable ultraextensive -structure has a dense locally finite subgroup.
Key words and phrases:
Hrushovski property, extension property for partial automorphisms (EPPA), partial isomorphism, HL-extension, HL-map, coherent, ultraextensive, ultrahomogeneous, locally finite, Henson Graph
2010 Mathematics Subject Classification:
Primary 03C13,03C55; Secondary 20E06,20E26
The second author’s research was partially supported by the NSF grant DMS-1800323.
1. Introduction
Let be two structures in a given relational language . A partial isomorphism from into is an isomorphism of a substructure of onto a substructure of . A partial automorphism (or a partial isomorphism) of an -structure is an isomorphism between two (possibly different) substructures of .
Definition 1.1**.**
Let be a class of -structures (containing both finite and infinite structures). is said to have the extension property for partial automorphisms (EPPA) if whenever and are structures in , is finite, is a substructure of , and every partial automorphism of extends to an automorphism of , then there exist a finite structure in which extends and every partial automorphism of extends to an automorphism of .
Hrushovski [References], was one of the first papers to consider the question of whether a certain class of structures has the EPPA. More precisely, he showed that the class of simple graphs has the EPPA, that is, every finite graph can be extended to another finite graph, , such that every partial isomorphism of extends to an automorphism of . Herwig–Lascar [References], generalized the result of Hrushovski to finite relational structures.
Definition 1.2**.**
If is an -structure and a set of -structures, we say that is -free if there is no structure and homomorphism .
Here we use the same definition of a homomorphism as in [References]. That is, if and are -structures, a homomorphism from to is a map such that, if is an integer, is an -ary relation symbol of , and are elements of with , then .
Theorem 1.3** (Herwig–Lascar [3]).**
Let be a finite relational language and a finite set of finite -structures. Then the class of all finite -free -structures has the EPPA.
Inspired by the Herwig–Lascar theorem, we define the following notions. Let be a finite relational language and be an -structure. An HL-extension of is a pair , where is an -structure extending the structure , and is a map from the set of all partial isomorphisms of into the set of all automorphisms of such that extends . With this notion, the Herwig–Lascar theorem can be restated as: Every finite -free -structure has a finite -free HL-extension.
If is an -structure and is an HL-extension of , then we say is minimal if for all , there are partial isomorphisms of and such that
[TABLE]
Our first main result of the paper is a description of all finite -free, minimal HL-extensions of a given finite -free -structure. To do this, we describe a canonical collection of finite -free, minimal HL-extensions from the original construction of Herwig–Lascar [3], and show that every other finite -free, minimal HL-extension is a homomorphic image of one of the canonical extensions.
Our next result is regarding a group-theoretic property in the profinite topology considered by Herwig–Lascar in [3]. We call it the HL-property. For comparison, we say that a group has the RZ-property (RZ standing for Ribes–Zalesskii) if any finite product of finitely generated subgroups of is closed in the profinite topology. Every group with the RZ-property is residually finite. Ribes-Zalesskii [6] proved the RZ-property for finitely generated free groups. Herwig–Lascar [3] introduced the HL-property as a strengthening of the RZ-property, and showed that the Herwig–Lascar theorem is essentially equivalent to the HL-property for finitely generated free groups. Coulbois [1] gave a characterization of the RZ-property in terms of extensions of partial isomorphisms and used it to show that the RZ-property is preserved under taking free products. Rosendal [7] gave a characterization of the RZ-property in terms of extensions of partial isometries for finite metric spaces. Here we give a similar characterization for the HL-property of groups, and show that the HL-property is also preserved under taking free products.
In [8], Solecki proved the EPPA for the class of finite metric spaces. Furthermore, Siniora–Solecki [9] proved a stronger version of the Herwig–Lascar theorem. They showed that for a structure with an HL-extension one can find an HL-extension with the property that for every triple of partial isomorphisms of with we have . This property has been referred to as coherence. A similar concept was considered in [5] and [7].
In this paper we introduce a slightly different notion of coherence between HL-extensions. If are -structures, is an HL-extension of , and is an HL-extension of , then we say that and are coherent if extends , extends for every partial isomorphism of , and the map , where ranges over all partial isomorphisms of , induces an isomorphism between a subgroup of all automorphisms of and a subgroup of all automorphisms of . We will show that, if is a finite set of -structure each of which is a Gaifman clique, then for any finite -free -structures and a finite -free HL-extension of , there is a finite -free HL-extension of coherent with . In the proof of this result we use the above-mentioned coherence result of Siniora–Solecki [9]. We should also mention that Hubička, Konečnỳ, and Nešetřil [5] presented a direct combinatorial construction of HL-extensions with the same coherence property. The technical assumption in the theorem about is necessary and optimal for the proof.
We call an -structure ultraextensive if is ultrahomogeneous, every finite has a finite HL-extension where , and if are finite and is a finite minimal HL-extension of with , then there is a finite minimal HL-extension of such that and and are coherent.
Recall that ultrahomogeneity means that any finite partial isomorphism can be extended to an isomorphism of the entire space. Thus ultraextensiveness is a strengthening of ultrahomogeneity. We will establish the following results about ultraextensive -structures.
Theorem 1.4**.**
Every countable -structure can be extended to a countable ultraextensive -structure. Moreover, if is a finite set of finite -structures each of which is a Gaifman clique, then every countable -free -structure can be extended to a countable -free ultraextensive -structure.
Theorem 1.5**.**
If is an ultraextensive -structure then every countable substructure can be extended to a countable ultraextensive substructure .
Theorem 1.6**.**
If is a countable ultraextensive -structure then the automorphism group of has a dense locally finite subgroup.
The rest of the paper is organized as follows. In Section 2 we give the characterization of finite -free, minimal HL-extensions. In Section 3 we study the HL-property of groups and show that it is preserved under taking free products. In Section 4 we discuss coherent HL-extensions and ultraextensive structures. The results in Sections 2 and 4 are analogous to previous work by the authors [2] on similar concepts in the context of metric spaces.
2. Minimal HL-Extensions
2.1. HL-extensions
We fix some notation to be used in the rest of the paper. Throughout this paper let be a finite relational language. Let be -structures. We say that is an extension of if is a substructure of . Interchangeably, we use the same terminology when contains an isomorphic copy of .
A homomorphism from to is a map such that for every -ary relation and every ,
[TABLE]
An isomorphism from to is a bijection such that for every -ary relation and every ,
[TABLE]
An isomorphism from to is also called an automorphism of . The set of all automorphisms of is denoted as . Under composition of maps, becomes a group.
A partial isomorphism of is an isomorphism between two finite substructures of . The set of all partial isomorphisms of is denoted as . Although is not necessarily a group, it is a groupoid and for each we can speak of the inverse map , which is still a partial isomorphism.
If is an extension of , then every partial isomorphism of is also a partial isomorphism of . In symbols, we have if is a substructure of .
If , we say that extends , and write , if
[TABLE]
We let denote the identity automorphism on , i.e., for all . Let denote the set of all such that . We refer to elements of as nonidentity partial isomorphisms of . Note that if then and .
The main concept we study in this paper is that of an HL-extension.
Definition 2.1**.**
Let be an -structure. An HL-extension of is a pair , where is an extension of , and such that extends for all .
Note that if is an HL-extension of then we can always modify so that for all , . We will tacitly assume this property for all the HL-extensions we consider.
Note that an equivalent restatement of Herwig–Lascar theorem (Theorem 1.3) is that every finite -free -structure has a finite -free HL-extension.
We will need the following notion of homomorphism between HL-extensions.
Definition 2.2**.**
Let be an -structure, and let and be both HL-extensions of . A homomorphism from to is a map such that is a homomorphism from the structure to , is the identity map on , and for all , .
We also define the notion of minimality for an HL-extension as follows.
Definition 2.3**.**
Let be an -structure and be an HL-extension of . We say that is minimal if for all there are and such that .
2.2. A canonical HL-extension
In this subsection we describe a canonical construction of an HL-extension that is essentially due to Herwig–Lascar [3]. In the rest of the paper let be a fixed finite set of finite -structures.
First, note that for every finite -structure there is a unique partition of into substructures such that each is a maximal subset of satisfying that for every , the map that sends to (that is, the map ) is a partial isomorphism of . In other words, we partition into maximal subsets whose elements satisfy the same unary predicates. We call this partition with a specific point from each set a natural factorization of . That is, a natural factorization of is of the form , where each .
Let be a finite -free -structure. Let be a natural factorization of . For every we define
[TABLE]
where is the free group with the generating set (with the convention that the inverse of in coincides with ). By we mean that if with , then is defined and
[TABLE]
Each is a subgroup of .
Let be the -structure with domain
[TABLE]
and such that for every -ary relation symbol , we have iff there are and such that is defined for each , , and .
Note that can be viewed as a substructure of . In fact, consider the map defined as
[TABLE]
for . It is easy to see that is well-defined and is indeed an isomorphic embedding from into .
Given any , the map defined by is an automorphism of . Thus, is an HL-extension of with defined as . Note that by definition, is a minimal HL-extension of .
Assume has a -free HL-extension . Consider the map defined by , where if . Then is a homomorphism. It follows that is also -free.
2.3. Finite HL-extensions
Let be a finite -free -structure as before. We give a description of all finite -free, minimal HL-extensions of . For this we first describe a finite -free, minimal HL-extension by replacing each group in the above canonical with a larger group of the form , where is a normal subgroup of of finite index.
Let be normal subgroups of finite index. We define
[TABLE]
The structure on is defined analogously to the structure on the canonical HL-extension . More precisely, to define the structure on , let be an -ary relation symbol. Then iff there are and such that is defined for each ,
[TABLE]
and .
Consider the map defined by
[TABLE]
for . Then is well-defined. Under suitable assumptions (that will be discussed in Theorem 2.4), becomes an isomorphic embedding. In this case is an isomorphic copy of as a substructure of .
We define by letting
[TABLE]
Assuming the above map is an isomorphic embedding, and noting that there is a canonical surjective homomorphism from to , it follows from the minimality of that is also a minimal HL-extension of .
We are now ready to describe any finite -free, minimal HL-extension of as a homomorphic image of some , which is itself a finite -free, minimal HL-extension of .
Theorem 2.4**.**
Let be a finite -free -structure and be a finite -free, minimal HL-extension of . Then, there are of finite index such that is a finite -free, minimal HL-extension of and there is a homomorphism from onto .
Proof.
For each , let . We define
[TABLE]
Then . Since is finite, each is of finite index.
Let and be defined as above. We claim that is an isomorphic embedding. To see this, let with . Let with and . We show that , which implies . For this, let . Since
[TABLE]
we have that . This shows that is injective. It is easy to see that is an isomorphism between the structures and .
Now we define by . Note that is well-defined since if then by definition of we have and therefore . is onto since is minimal. It is also easy to verify that is a homomorphism. It follows that is -free, and thus is a finite -free, minimal HL-extension of .
Finally, it is routine to check that for every , . Thus is a homomorphism from onto . ∎
3. The HL-Property of a Group
In this section we consider a property for a group analogous to the existence of HL-extensions for free groups.
3.1. The HL-property
First, we need the following definitions.
Definition 3.1** (Herwig–Lascar [3]).**
Let be a group and let . A left system of equations on is a finite set of equations with variables and constants such that each equation is of the form
[TABLE]
where , and .
Definition 3.2**.**
Let be a group. We say that has the HL-property if for every finitely generated and left system of equations on that does not have a solution, there exist normal subgroups of finite index such that the same left system of equations on does not have a solution.
By results of [3], Section , the Herwig–Lascar theorem (Theorem 1.3) implies the HL-property for all free groups with finitely many generators. Our results below will imply that they are actually equivalent.
Recall that we say a group has the RZ-property if for any finitely generated subgroups , is closed in the profinite topology of . Equivalently, a group has the RZ-property iff for any finitely generated and there exist a normal subgroup of finite index, such that . Ribes–Zalesskii [6] proved the RZ-property for free groups with finitely many generators. As noted in [3], the HL-property is a strengthening of the RZ-property, and therefore the Herwig–Lascar theorem is a strengthening of the Ribes–Zalesskii result.
Rosendal in [7] considered the RZ-property and showed that it is equivalent to a statement about extensions of partial isometries for finite metric spaces which he called finite approximability. Earlier, Coulbois [1] gave a characterization of the RZ-property in terms of extensions of partial isomorphisms of finite structures, and used it to show that the RZ-property is closed under taking finite free products. Below we give a characterization of the HL-property also in terms of extensions of partial isomorphisms of finite structures. Our characterization is analogous to Rosendal’s notion of finite approximability.
To state the theorem, we need the following notions. Let be a group acting on sets and and let and be arbitrary subsets. An -map from to is a function such that for all and , if , then . Moreoever, if and are -structures, then is called an -embedding if is an injective -map that is an isomorphism between and .
An -structure is called a Gaifman clique if for every there is a relation symbol with arity and with and .
Theorem 3.3**.**
Let be a group. Then the following are equivalent:
- (i)
* has the HL-property;* 2. (ii)
Let be a finite relational language with unary relation symbols . Let be a finite set of finite -structures. Let be a -free -structure such that is a partition of the domain of . Let be a finite substructure of . Let be a finite subset of . Suppose that acts faithfully by isomorphisms on and that acts transitively on each for . Then there exists a finite -free -structure on which acts by isomorphisms, and an -embedding from to . 3. (iii)
Clause (ii) with the additional assumption that every structure is a Gaifman clique.
The next two subsections are devoted to a proof of Theorem 3.3. We will show (i)(ii)(iii)(i). Since (ii)(iii) is obvious, we focus on showing (i)(ii) and (iii)(i).
3.2. Proof of Theorem 3.3 (i)(ii)
We assume has the HL-property. Let be -free -structures, where is finite. For , let and . Then is a partition of and is a partition of . Without loss of generality, assume for every . Then, by extending , we may assume that for every . Let be a natural factorization of . Since acts transitively on each , we have . By minimizing the structure on , we may also assume that for any -ary relation symbol and for any , we have iff there are and such that and .
Define by letting, for any and , , if ; is undefined otherwise. Since acts by isomorphisms on , if for some and is defined, then . Since is finite, the set is finite.
Let be finite. Since the action of on is faithful, by extending with finitely many points, we may assume that . Pick a finite such that , and . Define
[TABLE]
Since and are finite, is finitely generated. To see this, consider an edge-labeled directed graph on defined as follows: there is an edge from to labeled by if is such that . Note that this graph can have multiple edges and loops. The generators of are precisely those that give a minimal cycle from back to .
Let be the -structure with domain such that for , , and for any -ary relation symbol and for any , iff there are and such that for each , , and
[TABLE]
acts on by left multiplication. Consider the map defined as
[TABLE]
Since acts transitively on each , is well-defined. We claim that is an isomorphic embedding of into . In fact, is injective because of the following fact:
- (C1)
For every and , if and , then .
Furthermore, is an isomorphism between and because of the following fact:
- (C2)
For any such that for all ,
[TABLE]
for some , if
[TABLE]
then there does not exist such that
[TABLE]
(C2) is true since otherwise in we would have
[TABLE]
and yet , violating that is an isomorphism of the structure .
Consider the map defined by . Then is a homomorphism from the structure onto the structure . Since is -free, so is . Thus, we also have the following
- (C3)
For every structure there is no homomorphism from into .
Next we demonstrate that conditions (C1)–(C3) can all be equivalently expressed as certain left systems of equations on not having solutions. To do this, we first establish some general lemmas.
Lemma 3.4**.**
Let be a group and . For any , iff the following left system with variable does not have a solution
[TABLE]
Proof.
It is equivalent to state the lemma as iff the left system (3.1) has a solution. Now it is obvious that (3.1) has a solution iff , which is equivalent to . ∎
Lemma 3.5**.**
Let be a group and . For any , the following are equivalent:
- (i)
There does not exist such that ; 2. (ii)
The following left system with variables does not have a solution
[TABLE]
Proof.
Again we prove the contrapositives. First, assume that there is such that . Thus we have equations
[TABLE]
Each equation, which is of the form , is equivalent to there existing such that
[TABLE]
similar to the proof of Lemma 3.4. Thus the totality of the equations is equivalent to there existing solutions for the equations in (3.2). Conversely, if (3.2) has a solution, then each pair of equations involving give rise to an equation of the form . The solution for witnesses the existence of the desired element in clause (i). ∎
We are now ready to argue that conditions (C1)–(C3) can be equivalently expressed as certain left systems of equations on not having solutions. For (C1), simply apply Lemma 3.4 to the appropriate . Then is equivalent to the following system not having a solution
[TABLE]
Since is finite, there are only finitely many such systems. To summarize, there are finitely many left systems on such that (C1) holds iff each of the left systems does not have a solution.
For (C2), apply Lemma 3.5. The left system correspondent to the condition is
[TABLE]
Again, since is finite, there are only finitely many such systems, and (C2) holds iff each of these left systems does not have a solution.
For (C3), we consider any . Enumerate the elements of as . Introduce variables correspondent to . Suppose first there is a homomorphism of into . Then there are and such that, for any -ary relation symbol , whenever where , we have
[TABLE]
Note that iff there are and such that for all ,
[TABLE]
and
[TABLE]
Applying Lemma 3.5, the above statement is equivalent to the following: there are such that for any -ary relation symbol , whenever with , there are such that for all ,
[TABLE]
and the following left system with variables has a solution
[TABLE]
Here the variables and the left system (3.5) are introduced for each instance of and that satisfy the conditions , for all , and . We call these and a set of witnesses. There are only finitely many possible sets of witnesses. Accumulating all sets of witnesses together, and introducing a left system (3.5) with distinct variables for each set of witnesses, we obtain a single finite left system that is the union of all these left systems for each set of witnesses. Now this resulting left system has a solution. Conversely, if this system has a solution, then the solutions for will witness a homomorphism of into . Thus the existence of a homomorphism of into is equivalent to a single left system having a solution.
Finally, since is finite, we again have finitely many left systems such that (C3) holds iff each of the finitely many left systems on does not have a solution.
In summary, all conditions (C1)–(C3) can be represented as finitely many left systems on not having a solution. Since has the HL-property, we can find such that each of the left systems described by (C1)–(C3) does not have a solution with respect to . Indeed, for each of the left system there are such for the system. For each , let be the intersection of all . We thus get which are still of finite index in so that all of the left systems on still do not have a solution. This implies that the conditions (C1)–(C3) continue to hold with replaced by .
We now define to be the finite -structure with domain such that for all , and for any -ary relation symbol , we have iff there are and such that for all , , and
[TABLE]
Consider the map defined as
[TABLE]
Then conditions (C1) and (C2) with replaced by guarantee that is an isomorphic embedding. Condition (C3) with replaced by implies that is -free. The action of on is by left multiplication, and each of gives an isomorphism of the structure . Finally, we check that is a -map, and therefore an -map. Let and , and assume . Suppose with and with . Then , where by the definition of . This completes the proof of (i)(ii).
3.3. Proof of Theorem 3.3 (iii)(i)
We assume (iii) holds and show that has the HL-property. Suppose are finitely generated subgroups. Consider a left system with many equations on that does not have a solution. Let be the finite set of for all constants appearing in . Let be the trivial subgroup. Consider a relational structure defined as follows:
- a)
the domain of is ; 2. b)
there are many unary relation symbols such that for ; 3. c)
there is a binary relation symbol such that ; 4. d)
for each , there is a binary relation such that ; 5. e)
for each tuple , where and for each , there is an -ary relation symbol such that
[TABLE]
Let be the language of . We claim that the left system has a solution iff a specific finite -structure has a homomorphic image inside .
First we turn into an equivalent left system with the same number of equations. To do this, collect all equations in of the form where is a variable and . Introduce a new variable and replace every equation in the above collection by the equation . Denote the resulting left system as . We claim that has a solution iff has a solution. First suppose has a solution. Then the solution for together with is a solution for . Conversely, suppose has a solution in which in particular. Then this solution with every term left-multiplied by is still a solution for , which, with dropped, is a solution for . Thus, without loss of generality, we may assume that all equations in are of the form where are variables and .
Next we note that every equation of the form can be replaced with two equations of the form and , where the last equation can be rearranged as . By repeating this process, we may obtain an equivalent left system with many equations such that for any variable in , the equations in involving are all of the form or for some variable and constant . Note that for the new variable above, we get two equations and by moving the cosets for to the left hand side of the equations. Now for each variable in , consider the left system consisting only of the equations in that involve . From the above discussion we know that can be listed as:
[TABLE]
for and each is either a variable or of the form (in which case ) for a variable and a constant . Note that has a solution iff the following expression has a solution:
[TABLE]
In fact, if has a solution , then is in the intersection of (3.6). Conversely, if (3.6) holds for some then they become a solution of . Thus each corresponds to a formal relation
[TABLE]
for a suitable of length .
We now describe a finite -structure . The domain of is the set of all formal cosets and , where is a variable in , , and . The definition of is obvious. Also . For each , let B_{g}^{T}=\{(xH_{0},xgH_{0}):x\mbox{ is a variable in \Sigma^{\prime}}\}. The above formal relation (3.7) becomes now the definition of . For other relation symbols , is empty. Note that is a Gaifman clique.
It is now clear that has a solution iff there is a homomorphism from the structure into the structure . Since does not have a solution, neither does and it follows that is -free.
acts faithfully on by left multiplication, and it is clear that the left multiplication by any preserves the structure of . It is also clear that acts transitively on for each .
Let be a finite substructure of whose domain consists of all and for and . Define by letting if ; otherwise is undefined. Since is finite, the set is finite. Let be a finite subset so that , and for each , contains a finite set of generators for . Since the action of on is transitive for each , the partial action of on is also transitive. Apply (iii) to get a finite -free extension of on which acts by isomorphisms, and an -embedding from into . Note that is an element of and is an element of , and we may assume that . Let
[TABLE]
Since is finite, is a normal subgroup of finite index. Now let be obtained from by replacing respectively by . We claim that does not have a solution, which shows that has the HL-property.
Towards a contradiction, assume the left system on has a solution. Similarly to the above, we can obtain an equivalent left system such that each equation in is of the form . Let . Then is still a normal subgroup of finite index, and obviously for all . Now each equation of the form in can be equivalently replaced by and . Also, the last equation can be reformulated as because of the normality of . Thus we obtain an equivalent left system in a similar way as before, whose solution describes a homomorphic image of in a structure . The exact definition of the structure is similar to the definition of above. For notational convenience we define for .
Since is a -free structure, it is enough to show that there is a homomorphism from into . Consider the map defined by . Then is the desired homomorphism. Note that is well-defined since if then for some and ; using the definition of and and the fact that is an -embedding, we have . More precisely, we can write with as contains a finite set of generators for ; since is an -embedding, we have . Also, by definition of , for we have .
It remains to verify that preserves structure. For this let with and assume , that is,
[TABLE]
Then there are and for such that
[TABLE]
The action of on sends the tuple to
[TABLE]
Note that and therefore . Now since acts by an isomorphism on , we have .
Finally, consider for some and . We need to show that . By the definition of , we have and . Since and is an -embedding, we have and . Now acts by an isomorphism on , and so as desired.
This finishes the proof of Theorem 3.3.
3.4. Free products of groups with the HL-property
As a corollary to Theorem 3.3, we show below that the HL-property is closed under taking finite free products. This is analogous to the theorem of Coulbois [1] which states that the RZ-property is closed under taking finite free products. In the proof of the corollary we use the coherence result of Sinora–Solecki [9], which is also established in [5] with a different proof. We summarize in the following proposition the exact fact we will need in our proof.
Proposition 3.6**.**
Let be a finite -free -structure. Then, has a finite -free HL-extension such that for every substructure , defined as
[TABLE]
is a group isomorphic embedding.
Proof.
It was proved in [9] and [5] that, for any finite -free -structure , there is a finite -free extension of and a map such that for all , and for any with we have . We claim is the desired HL-extension. Let be a substructure. Since , we have . Thus , and . The coherence property clearly implies that is a group homomorphism from into . Assume and , then since . Therefore, is an isomorphic embedding from into . ∎
In the proof of the corollary we will also need a property of Gaifman cliques proved by Siniora–Solecki in [9]. To explain the property, first recall some definitions.
Definition 3.7**.**
Let be a relational language and and be -structures. Assume . Then the free amalgamation of and over is the structure on where for every relation in the language . A class of -structures has the free amalgamation property if the free amalgamation of any two structures in over a structure in is still in .
Siniora–Solecki proved in Lemma 4.5 of [9] that a class of -structures has the free amalgamation property iff there is a set of -structures each of which is a Gaifman clique such that is exactly the collection of all -structures for which there does not exist any isomorphic embedding from any into . Note that in our context (where is a finite set of finite -structures) the statement implies that the class of finite -free -structures has the free amalgamation property iff all are Gaifman cliques. This is because, if is a set of Gaifman cliques and if we let to be the set of all homomorphic images of structures in , then is still a finite set of Gaifman cliques, and the collection of -free structures is exactly the collection of structures into which no isomorphically embed.
Corollary 3.8**.**
Let be two groups with the HL-property. Then, the free product of and , , has the HL-property.
Proof.
Suppose have the HL-property. To show that has the HL-property, we use the equivalence between clauses (i) and (iii) of Theorem 3.3. Specifically, we show the following:
- Let be a finite relational language with unary relation symbols . Let be a finite set of finite -structures such that every is a Gaifman clique. Let be a -free -structure such that is a partition of the domain of . Let be a finite substructure of . Let be a finite subset of . Suppose that acts faithfully by isomorphisms on and that acts transitively on each for . Then there exists a finite -free -structure on which acts by isomorphisms, and an -embedding from into .
In the following we construct the desired structure .
Let and be finite subsets such that . Let be a finite structure extending such that for every where for every , and every where , we have for every . Since and have the HL-property, we can find finite -free -structures and such that for :
- (1)
acts by isomorphisms on , and 2. (2)
there exists an -embedding from to .
Let be the free amalgamation of and over , that is, the underlying set of is and for every relation in the language . Since consists of only Gaifman cliques, the collection of all -free -structures has the free amalgamation property. Thus is -free.
By Proposition 3.6, there exists a finite -free HL-extension of such that for every finite substructure , induces a group isomorphic embedding from to . In particular, this holds for . Therefore, induces an action of on by for . By considering the free product of these two actions, we get an action of on by isomorphisms. It remains to show that there exists an -embedding from to . Let denote the inclusion map. We claim is as desired. Let where for every and be such that . Note that for , since is an -embedding from to , we have that is also an -embedding from to . Therefore,
[TABLE]
∎
4. Coherent HL-extensions and Ultraextensive Structures
In this section we introduce a notion of ultraextensive -structures using a new notion of coherent HL-extensions. Coherence in our sense is slightly weaker than the coherence notion of Siniora–Solecki [9] but is sufficient for deriving the interesting properties of ultraextensive structures. These notions are generalizations of similar notions in [2] in the context of metric spaces.
Definition 4.1**.**
Let be -structures and be an HL-extension of for . We say that and are coherent if
- (i)
extends , 2. (ii)
extends for all , and 3. (iii)
letting for , and letting be such that for all , then has a unique extension to a group isomorphic embedding from into .
Definition 4.2**.**
An -structure is ultraextensive if
- (i)
is ultrahomogeneous, i.e., there is a such that is an HL-extension of ; 2. (ii)
Every finite has a finite HL-extension where ; 3. (iii)
If are finite and is a finite minimal HL-extension of with , then there is a finite minimal HL-extension of such that and and are coherent.
Theorem 4.3**.**
Let be a finite set of finite -structures each of which is a Gaifman clique. Suppose are finite -free -structures and is a finite -free HL-extension of . Then there is a finite -free HL-extension of so that is coherent with .
Proof.
Since every is a Gaifman clique, the collection of all -free structures has the free amalgamation property. Let be the free amalgamation of and over . Then is -free. We will again use the main theorem of [9] and [5], which states that, for any finite -free -structure , there is a finite -free extension of and a map such that for all , and for any with we have .
Define as
[TABLE]
Then is an HL-extension of . It is also clear that extends . For , our definition of gives that . Now define by letting and extending the definition of to all finite products in . We first verify that is well-defined. For this let such that . We need to show that . Both products take place in an automorphism group, so they are compositions. By the coherent property of , we have , and so . Thus we have shown that is a group homomorphism. To see that it is a group isomorphic embedding, we show that the kernel of is trivial. For this let so that . Restricting all maps on , we get . ∎
We remark that the condition in the above theorem for to consist only of Gaifman cliques is necessary. If fails this property, not only the proof fails to work because of the failure of the free amalgamation property for the collection of -free -structures, but also the statement of the theorem can fail.
We give a counterexample below.
Consider where is a binary relation symbol and is a quarternary relation symbol. Let where and . Let with and . Let be the induced substructure of . Let where and . Then and is an HL-extension of , with extending to the automorphism and extending to the automorphism . Note that are -free -structures. Now there is no -free HL-extension of that is coherent with .
Theorem 4.4**.**
Let be a finite set of finite -structures each of which is a Gaifman clique. Then every countable -free -structure can be extended to a countable -free ultraextensive -structure.
Proof.
Let be a countable -free -structure. Write as an increasing union of finite -free -structures for . For , inductively define increasing sequences of finite -free -structure , and as follows. Let and be a finite -free, minimal HL-extension of . We define such that for every pair with and any minimal HL-extension of where , there exists a -free minimal HL-extension of where , such that and are coherent. Note that this is possible since there are only finitely many triples and for any such triple by Theorem 4.3 we can fix a coherent extension . Finally, to construct , we add to for all corresponding to the triple such that the union of the new points () and is an isomorphic copy of . is a free amalgamation of -free structures, and hence is -free. Let be the free amalgamation of and over .
In general, assume a finite has been defined for . Apply Theorem 4.3 to obtain a finite -free, minimal HL-extension of that is coherent with . We use a similar construction to the construction of from to define . Note that has the property that for every minimal HL-extension in , that is, for every where is a minimal HL-extension of , every has a minimal HL-extension in that is coherent with . Let be the free amalgamation of and over . All structures obtained are -free.
Let be the union of the increasing sequence . We verify that is ultraextensive. To verify Definition 4.2 (i), let . Then there is such that . Let be the least such . Then for all , by the coherence of with . Define . Then is an isomorphism of that extends .
For Definition 4.2 (ii), let be finite. Then there is such that , and it follows that is an HL-extension of .
Finally, for Definition 4.2 (iii), let be finite and assume that is a finite minimal HL-extension of with . Then, there is a natural number such that . By the construction of , there exists a minimal HL-extension of (corresponding to the triple ) such that and that is coherent with . ∎
We derive some properties of ultraextensive structures below.
Theorem 4.5**.**
If is an ultraextensive -structure, then every countable substructure can be extended to a countable ultraextensive substructure .
Proof.
We use a similar argument to the argument in the proof of Theorem 4.4 to construct . The differences are that in the construction instead of applying Theorem 4.3 we use the properties of ultrextensive structures to find ; and we consider union of structures instead of free amalgamation to find . Clearly, all the structures are substructures of and therefore, . ∎
Theorem 4.6**.**
If is a countable ultraextensive -structure then has a dense locally finite subgroup.
Proof.
Let be an increasing sequence of finite substructures of such that . Since is an ultraextensive -structure, we can find an increasing sequence , where each , such that is an HL-extension of and is coherent with for . Then, is a dense locally finite subgroup of . ∎
Definition 4.7**.**
Let be a class of -structures. We say has the coherent extension property if it has the EPPA and for finite structures in and a finite minimal HL-extension of where is also in , there exists a finite minimal HL-extension of where is in and and are coherent.
Theorem 4.8**.**
Let be a Fraïssé class and be the Fraïssé limit of . Then, is ultraextensive iff has the coherent extension property. In particular, if is a finite set of Gaifman cliques and is the class of -free structures, then is ultraextensive.
Proof.
The equivalence is clear by Definition 4.7. The second part is the direct consequence of Theorem 1.3 and Theorem 4.3. ∎
Corollary 4.9**.**
The Henson graph , the Fraïssé limit of the class of -free graphs, is ultraextensive for every natural number .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Coulbois, Free product, profinite topology and finitely generated subgroups , Internat. J. Algebra Comput. 11 (2001), no. 2, 171–184.
- 2[2] M. Etedadialiabadi, S. Gao, On extensions of partial isometries , preprint. Available at ar Xiv:1903.09723.
- 3[3] B. Herwig, D. Lascar, Extending partial automorphisms and the profinite topology on free groups , Trans. Amer. Math. Soc. 352 (2000), no.5, 1985–2021.
- 4[4] E. Hrushovski, Extending partial isomorphisms of graphs , Combinatorica 12 (1992), no. 4, 411–416.
- 5[5] Jan Hubička, Matěj Konečnỳ, and Jaroslav Nešetřil, A combinatorial proof of the extension property for partial isometries , Comment. Math. Univ. Carolinae 60 (2019), no. 1, 39–47.
- 6[6] L. Ribes, P. A. Zalesskii, , On the profinite topology on a free group , Bull. London Math. Soc. 25 (1993), no. 1, 37–43.
- 7[7] C. Rosendal, Finitely approximable groups and actions part I: the Ribes–Zalesskii property , J. Symbolic Logic 76 (2011), no. 4, 1297–1306.
- 8[8] S. Solecki, Extending partial isometries , Israel J. Math. 150 (2005), 315–331.
