We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite group with solvable word problem for which there is no effective method that allows, given some non-identity element, to find a morphism onto a finite group in which this element has a non-trivial image. We also prove that the depth function of this group grows faster than any recursive function.
It is well known that there can be no Higman embedding theorem for recursively presented finitely generated residually finite groups, that is to say, not all finitely generated recursively presented residually finite groups embed into finitely presented residually finite groups. Indeed, a theorem of McKinsey [9, 11, 3] states that all finitely presented residually finite groups have solvable word problem, while on the other hand several recursively presented residually finite groups are known that fail to have solvable word problem: for instance, one example was constructed by Meskin in , and one by Dyson in .
It was unknown whether or not the condition of having solvable word problem is sufficient for such embeddings to exist. For instance, in the article , the authors ask whether “unsolvability of the word problem is the only obstacle” to embed recursively presented residually finite groups into finitely presented residually finite groups. We answer that question negatively.
There exists a finitely generated residually finite group with solvable word problem, that does not embed in any finitely presented residually finite group.
Call a group 𝐺effectively residually finite if there is an algorithm that takes a word 𝑤 on the generators of 𝐺 as input and, if in 𝐺, produces a morphism 𝜑 from 𝐺 to a finite group 𝐹 that satisfies . What we actually prove here is the following theorem.
There exists a finitely generated residually finite group with solvable word problem, that is not effectively residually finite.
Theorem 1 then follows from the following facts.
A finitely presented residually finite group is effectively residually finite.
A finitely generated subgroup of an effectively residually finite group is itself effectively residually finite.
In the first section, Dyson’s groups are introduced, and they are used to reduce the proof of Theorem 2 to a problem about subsets of ℤ. In the second section, this problem is solved. In the last section, we show that the group constructed in order to prove Theorem 2 has a depth function that grows faster than any recursive function.
Following , throughout, recursively presented groups will be called re groups (for recursively enumerable), and groups in which there is an algorithm that recognizes non-trivial elements will be called co-re groups. A group has solvable word problem if and only if it is re and co-re.
1 Dyson’s groups
The author already used Dyson’s groups to investigate the property of having computable finite quotients . What we construct here is a strengthening of the result obtained in that article; we will include here all definitions but omit the proofs that already appear there.
Dyson’s groups are amalgamated products of two lamplighter groups.
The lamplighter group 𝐿 is the wreath product of ℤ and , noted , which is by definition the semi-direct product , where ℤ acts on by permuting the indices. It admits the following presentation:
Whether the group is residually finite depends on whether the set 𝒜 is closed in the profinite topology on ℤ. The profinite topology on a group 𝐺, which we denote by , is the topology defined by taking cosets of finite index normal subgroups as a basis for the open sets. Thus a subset 𝒜 of ℤ is open in if and only if, for every 𝑛 in 𝒜, there exists an integer 𝑝 such that . The profinite topology on ℤ was rediscovered in 1955 by Furstenberg in  (the profinite topology on an arbitrary group was defined in 1950 in ), where it is used to give an elegant proof of the existence of infinitely many primes, and it was proven in  that this topology comes from a metric, which is given by the following formula:
Of course, the distance 𝑑 is effective: 𝑑 is a recursive function. This implies that both the closed and open balls of are recursive sets.
Call an open set 𝑂effectively open (in ) if there is an effective procedure that, given any number 𝑛 in 𝑂, computes some integer 𝑝 such that is contained in 𝑂. A set is effectively closed if its complement is effectively open.
We can now state the properties of the group that will allow us to prove Theorem 2.
Let 𝒜 be a subset of ℤ.
is re, co-re or has solvable word problem if and only if 𝒜 is respectively re, co-re or recursive.
is residually finite if and only if 𝒜 is closed in .
is effectively residually finite if and only if 𝒜 is co-re and effectively closed in .
Suppose first that is effectively residually finite. Then is co-re, and by (1), 𝒜 is co-re as well. Let 𝑥 be an integer in the complement of 𝒜 such that in . By our hypothesis, we can effectively find a morphism 𝜑 from to a finite group 𝐹, with in 𝐹. Call 𝑁 the product of the orders of the images of 𝑎 and in 𝐹. We then claim that . Indeed, if it were not the case, there would exist an integer 𝑘 such that , that is to say, such that in . But then, this would imply
The proof of the converse follows closely the proof of (2) given in  (which differs from the original proof of Dyson), as one only needs to see that the hypothesis that 𝒜 is effectively closed in is enough to effectively carry out that proof. As we actually only use the first implication of (3) in the proof of Theorem 2, no further details are given here. ∎
2 Construction in ℤ
There exists a recursive subset 𝒜 of ℤ, closed in , but not effectively so.
We construct a set ℬ, which will be the complement of the announced 𝒜. Thus it has to be recursive and open but not effectively open.
Call the 𝑛-th prime number. Define a sequence by . This sequence is defined so that divides if and only if . Note also that divides .
Consider an effective enumeration of all Turing machines: is the first machine, is the second, …. We will build ℬ as a disjoint union of open sets , each being a neighborhood of defined thanks to a run of the 𝑛-th Turing machine . If this machine does not halt, is a closed ball centered at of radius . If it halts, it is a finite union of balls, one of which is centered at , the radius of which depends of the number of steps needed for to halt. Thanks to this, information of the form “ contains a ball of radius 𝑟 centered in ” will translate into “if halts, it does so in less than 𝑁 steps”, where 𝑁 can be computed from 𝑟.
Initialize . Call and so that the closed ball is the set . Start a run of the machine .
After each computation step of , note 𝑘 the number of steps already done in the computation and add, to , , , as well as open balls centered in those numbers that are contained in and do not contain . That is, we replace by
If, at some point, the machine halts, consists of and of finitely many open balls centered at points . By construction, a point from is at distance at least from . This infimum can be computed; call it 𝑟. Then compute the smallest natural number 𝑦 such that , and call the distance . We then add to the ball . This implies that cannot contain any ball of center and of radius strictly greater than because it does not contain 𝑦. In particular, any ball centered in that contains one of the elements of the form that were added to is not contained in .
Of course, if the machine does not halt, will be the whole ball .
This ends the definition of , and ℬ is defined as the union . This union is disjoint because, by the choice of the radius , any element of is divisible by , but none is divisible by . We now prove that ℬ defined this way satisfies all three properties that appear in the statement of this lemma.
ℬ is clearly open, because each is open, whether or not the machine halts.
ℬ is a recursive set. It is obviously recursively enumerable because it was defined by an effective enumeration. To see that it is also co-re, let 𝑥 be an integer; we want to decide whether 𝑥 belongs to ℬ. By looking at the prime decomposition of 𝑥, one can find up to one 𝑛 such that 𝑥 might belong to . Because is always contained in , if , 𝑥 cannot be in . Otherwise, it belongs to , and we can find 𝑘 such that . Then, if a run of lasts more then 𝑘 steps, automatically, 𝑥 will belong to . On the other hand, if stops in less than 𝑘 steps, can be determined explicitly as a finite union of open balls, and thus the question of whether 𝑥 belongs to can be settled. Because the problem “does halt in more then 𝑘 steps” is a computable one, in either case, we will be able to determine whether or not 𝑥 belongs to ℬ.
Finally, ℬ is not effectively open. Suppose we have an algorithm that gives, for 𝑥 in ℬ, an integer 𝑘 such that is contained in ℬ. Applying it to , we can find a radius 𝑟 such that is contained in ℬ. We will show that this information implies a new information of the form: if the machine halts, then it halts in less than 𝑁 steps. This would of course allow one to solve the halting problem; thus such an algorithm does not exist.
Indeed, we have seen that if halts in 𝑁 steps, cannot contain any ball centered in that contains an element of the form , with . Turning this around, computing 𝑁 such that belongs to (for instance, ), the information “ is contained in ℬ” implies that either does not halt, or it halts in less then 𝑁 steps.
This ends the proof of Lemma 6. ∎
What we do not know yet is whether the condition of being recursively presented and effectively residually finite, which is necessary to be a subgroup of a finitely presented residually finite group, is also sufficient. For instance, the strictly stronger condition of having computable finite quotients is not known to be unnecessary (see ).
3 Non-recursive depth function
In , Bou-Rabee introduced the residual finiteness growth function, or depth function, , of a residually finite group 𝐺. To a natural number 𝑛, associates the smallest number 𝑘 such that, for any non-trivial element of length at most 𝑛 in 𝐺, there exists a finite quotient of 𝐺 of order at most 𝑘 such that the image of this element in that quotient is non-trivial.
A finitely generated subgroup 𝐻 of a finitely generated residually finite group 𝐺 must have a depth function that grows more slowly than that of 𝐺 (see ). Because it is easy to see that a finitely presented residually finite group always has a recursive growth function, a subgroup of a finitely presented residually finite group must have its depth function bounded above by a recursive function. Note that, in , it was shown that finitely presented residually finite groups can have arbitrarily large recursive depth function. It was also known that the depth function of a residually finite group could grow arbitrarily fast (see ).
Note that an effectively residually finite group with solvable word problem always has its depth function bounded above by a recursive function.
Let 𝒜 be the subset of ℤ given in Lemma 6. The depth function of cannot be smaller than a recursive function.
Suppose there exists a recursive function 𝑓 such that . Then, for each 𝑛 which is not in 𝒜, is a non-identity element of , and thus it has a non-trivial image in a finite quotient 𝐹 of size at most (because and are of word length ). Now the orders of 𝑎 and in 𝐹 both divide ; thus 𝐹 is a quotient of the quotient of given by adding to it the two relations
Communicated by: Pavel A. Zalesskii
 K. Bou-Rabee, Quantifying residual finiteness, J. Algebra 323 (2010), no. 3, 729–737. Search in Google Scholar
 K. Bou-Rabee and B. Seward, Arbitrarily large residual finiteness growth, J. Reine Angew. Math. 710 (2016), 199–204. Search in Google Scholar
 V. H. Dyson, The word problem and residually finite groups, Notices Amer. Math. Soc. 11 (1964), 616–617. Search in Google Scholar
 V. H. Dyson, A family of groups with nice word problems, J. Aust. Math. Soc. 17 (1974), 414–425. Search in Google Scholar
 H. Furstenberg, On the infinitude of primes, Amer. Math. Monthly 62 (1955), 353–353. Search in Google Scholar
 M. Hall, , A topology for free groups and related groups, Ann. of Math. (2) 52 (1950), 127–139. Search in Google Scholar
 O. Kharlampovich, A. Myasnikov and M. Sapir, Algorithmically complex residually finite groups, Bull. Math. Sci. 7 (2017), no. 2, 309–352. Search in Google Scholar
 J. C. C. McKinsey, The decision problem for some classes of sentences without quantifiers, J. Symbolic Logic 8 (1943), 61–76. Search in Google Scholar
 S. Meskin, A finitely generated residually finite group with an unsolvable word problem, Proc. Amer. Math. Soc. 43 (1974), 8–10. Search in Google Scholar
 A. W. O. Mostowski, On the decidability of some problems in special classes of groups, Fund. Math. 59 (1966), 123–135. Search in Google Scholar
© 2020 Rauzy, published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.