Abstract
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains infinitely many alternating groups, or contains classical groups of unbounded dimensions, we prove that there is no such algorithm. On the other hand, for families of simple groups of Lie type of bounded rank, we obtain positive results. For example, for any fixed untwisted Lie type X there is an algorithm that determines whether or not any given finitely presented group has simple images of the form X(q) for infinitely many q, and if there are finitely many, the algorithm determines them.
Introduction
According to a result of the first author and Wilton [3], there is no algorithm that, given a finite presentation, determines whether or not the group presented has a nontrivial finite quotient. Consequently there is no algorithm that determines the finite simple images of a finitely presented group. On the other hand, by [11, 22] there is an algorithm that determines the images of a finitely presented group that are isomorphic to \(\mathrm{PSL}_2(q)\) or \(\mathrm{PGL}_2(q)\) for some q. More precisely, the algorithm determines whether there are finitely or infinitely many values of q such that \(\mathrm{PSL}_2(q)\) or \(\mathrm{PGL}_2(q)\) is an image, and in the finite case it enumerates all the values of q. A similar algorithm is given in [12] concerning the images in \(\{\mathrm{PSL}_3(q),\,\mathrm{PGL}_3(q),\,\mathrm{PSU}_3(q),\,\mathrm{PGU}_3(q)\}\) of groups with a 2generator finite presentation.
Thus the question arises—for which collections of finite simple groups is there an algorithm that determines the members of the collection that are images of an arbitrary finitely presented group G? In this paper we provide answers to this question.
Note that there is an obvious algorithm that determines the finite cyclic images of G (just work with the abelianisation of G), so we restrict attention to the nonabelian simple groups.
First, for groups of unbounded rank, we have a negative answer. In the following statement, by the dimension of a classical group we mean the dimension of its natural module.
Theorem 1
Let \({{\mathcal {F}}}\) be a set of finite simple groups that either contains an infinite number of alternating groups, or contains a classical group of dimension n for infinitely many values of n. Then there is no algorithm that, given a finite presentation, does either of the following:

(i)
determines whether or not the group presented has at least one quotient in \({{\mathcal {F}}}\);

(ii)
determines whether or not the group presented has infinitely many quotients in \({{\mathcal {F}}}\).
On the other hand, we are able to prove a positive result for simple groups of fixed rank, reflecting the results on \(\mathrm{PSL}_2\), \(\mathrm{PSL}_3\) and \(\mathrm{PSU}_3\) already mentioned. In order to state our result we need to define some notation. Let X be a fixed untwisted Lie type (e.g. \(A_n\) or \(E_8\)), and for a prime power q let X(q) be the simple group of type X over \({\mathbb {F}}_q\). If X(q) possesses a graph automorphism of order \(d \in \{2,3\}\), denote by \(^d\!X(q)\) the corresponding twisted simple group over \({\mathbb {F}}_q\). (Here we are using the notation q rather than \(q^d\), as used for example in [4, Chapter 14].) For convenience write \(^1\!X(q) = X(q)\). Denote by \(\mathrm{ID}(^d\!X(q))\) the group generated by inner and diagonal automorphisms of \(^d\!X(q)\). Recall that \(\mathrm{ID}(^d\!X(q))\) is the fixed point group of a Frobenius endomorphism of the adjoint simple algebraic group of type X (see [9, Definition 2.5.10]).
Definition
For a fixed Lie type \(^d\!X\) (with \(d \in \{1,2,3\}\)) define the classes of groups \({{\mathcal {X}}}^d\) and \({{\mathcal {Y}}}^d\) as follows.

(i)
For any d, let
$$\begin{aligned} {{\mathcal {Y}}}^d = \{ Y\;:\; ^d\!X(q) \le Y \le \mathrm{ID}(^d\!X(q)) \hbox { for some }q\}. \end{aligned}$$ 
(ii)
For \(d=1\), let
$$\begin{aligned} {{\mathcal {X}}}^1 = \{X(q)\,:\,\hbox {all prime powers }q\}. \end{aligned}$$ 
(iii)
For \(d>1\), let \({{\mathcal {X}}}^d ={{\mathcal {Y}}}^d\).
For example, if \(X = A_{n1}\,(n\ge 3)\), there are two Xclasses:
Note that apart from types \(^d\!X = \,^2\!A_n\), \(^2\!D_n\) and \(^2\!E_6\), all classes \({{\mathcal {X}}}^d\) consist of simple groups.
Theorem 2
Let \(^d\!X\) be a fixed Lie type, and let \({{\mathcal {X}}} = {{\mathcal {X}}}^d\) be the corresponding class of groups defined above. Then there is an algorithm that determines whether or not any given finitely presented group has infinitely many quotients in \({{\mathcal {X}}}\); moreover, if there are finitely many such quotients, the algorithm determines them. In particular, the algorithm determines whether or not any given finitely presented group has at least one quotient in \({{\mathcal {X}}}\).
Remarks

1.
The proof of Theorem 2 shows that the same result holds for various subsets of the classes \({{\mathcal {X}}}^d\)—the collection of groups in \({{\mathcal {X}}}^d\) of fixed characteristic, for example.

2.
Theorem 2 shows, for example, that there is an algorithm that determines whether a finitely presented group has infinitely many quotients \(\mathrm{PSL}_n(q)\) (n fixed, q varying); on the other hand, by Theorem 1, there is no such algorithm for \(\mathrm{PSL}_n(q)\) (q fixed, n varying).

3.
The algorithms in Theorem 2 can be taken to be primitive recursive, that is, they do not involve an unbounded search. While the algorithms are in principle explicit, they are not practical because of our reliance in the proof on results in model theory such as Theorem 3.5 and because of the complexity of the formulas involved. There is much interest in producing practical algorithms for finitely presented groups—for example, the algorithms in [11, 12, 22] have found many applications. Thus—given a class \({{\mathcal {X}}}^d\) for some fixed Lie type \(^d\!X\)—now that we know that there is an algorithm that determines whether or not any given finitely presented group has infinitely many quotients in \({{\mathcal {X}}}^d\), a practical such algorithm would be of great interest.
Clearly, if a perfect group G has a quotient Y such that \(^d\!X(q) \le Y \le \mathrm{ID}(^d\!X(q))\), then \(Y = \,^d\!X(q)\). Hence for perfect finitely presented groups we have a complete solution to our question:
Corollary 3
For a fixed Lie type \(^d\!X\), there is an algorithm that determines whether or not any given perfect finitely presented group has infinitely many quotients of the form \(^d\!X(q)\), and if there are finitely many, the algorithm determines them.
An important ingredient of the proof of Theorem 2 is the following result, which enables us to distinguish between images in families of simple groups of twisted and untwisted types. We are very grateful to Alex Lubotzky for suggesting this result together with a sketch of a proof using strong approximation, and to Andrei Rapinchuk for much useful information.
Theorem 4
Let \(^d\!X\) be a fixed Lie type, and let G be a finitely generated group. If G has infinitely many quotients in the class \({{\mathcal {Y}}}^d\), then G also has infinitely many simple quotients \(X(q) =\, ^1\!X(q)\).
For example, applying the result with \(^d\!X = \,^2\!A_{n1}\) shows that a finitely generated group with infinitely many images \(\mathrm{PSU}_n(q)\) also has infinitely many images \(\mathrm{PSL}_n(q)\). Applying it with \(^d\!X = \,^1\!A_{n1}\) shows that a finitely generated group with infinitely many images in the set \(\{Y: \mathrm{PSL}_n(q) \le Y \le \mathrm{PGL}_n(q) \hbox { for some }q\}\) also has infinitely many images \(\mathrm{PSL}_n(q)\).
Our algorithmic results would have been more elegant if it were possible to establish the latter conclusion with unitary groups \(\mathrm{PGU}_n(q)\), \(\mathrm{PSU}_n(q)\) replacing \(\mathrm{PGL}_n(q)\), \(\mathrm{PSL}_n(q)\) (in Theorem 2 this would enable us to replace our classes of twisted groups \({{\mathcal {X}}}^d\) (\(d>1\)) by just the simple groups in the class). However this is in fact false, as is shown by Corollary 5.2, which for any n divisible by 4, produces a finitely presented group that has infinitely many images in the set \(\{Y:\mathrm{PSU}_n(q) \le Y \le \mathrm{PGU}_n(q) \hbox { for some }q\}\), but has only finitely many images \(\mathrm{PSU}_n(q)\).
Proof of Theorem 1
Our proof of Theorem 1 is based on the following result, taken from [19, 26].
Theorem 2.1
([19, Theorem 2.3], [26, Theorem 2]) There is a function \(f:{\mathbb {N}}\times {\mathbb {N}}\rightarrow {\mathbb {N}}\) with the property that for any two finite nonabelian simple groups \(T_1,T_2\) of orders \(t_1,t_2\), the following hold.

(i)
Every classical simple group of dimension greater than \(f(t_1,t_2)\) is generated by a copy of \(T_1\) and a copy of \(T_2\).

(ii)
Every alternating group \(A_n\) with \(n>f(t_1,t_2)\) is generated by a copy of \(T_1\) and a copy of \(T_2\).
Corollary 2.2
Let \(T_1,T_2\) be finite nonabelian simple groups of orders \(t_1,t_2\), and let \(n> f(t_1,t_2)\). Then both the alternating group \(A_n\), and any classical group \(Cl_n(q)\) of dimension n, are images of the free product \(T_1*T_2\).
Deduction of Theorem 1
Let \({{\mathcal {F}}}\) be a set of finite simple groups satisfying the hypothesis of Theorem 1. Suppose for a contradiction that there is an algorithm that determines whether or not any given finitely presented group has at least one quotient in \({{\mathcal {F}}}\). We shall show that under this assumption there is an algorithm that determines whether or not a finitely presented group has a nontrivial finite image, contrary to the Bridson–Wilton result in [3].
Let G be a finitely presented group. By assumption, there is an algorithm that determines whether or not the finitely presented group \(G*G\) has an image in \({{\mathcal {F}}}\). If the algorithm answers yes, meaning that \(G*G\) has an image in \({{\mathcal {F}}}\), then G has a nontrivial finite image. If the answer is no, then we claim that G can have no finite nonabelian simple image: for if G had such an image, call it S, then \(G*G\) would have an image \(S*S\), and hence by Corollary 2.2, \(G*G\) would have infinitely many images in \({{\mathcal {F}}}\), contradicting the output of the algorithm. Finally, we can easily determine whether or not G has a nontrivial finite abelian image by considering the abelianisation of G.
Thus we have established that if Theorem 1 were false, then there would be an algorithm that determines whether or not G has a nontrivial finite image, and as remarked above, this contradicts [3]. This completes the proof of Theorem 1. \(\square \)
Proof of Theorem 2
The proof of Theorem 2 relies on some representation theory, and also some model theory. We present the required results in Sects. 3.1 and 3.2, and then complete the proof of Theorem 2 in Sects. 3.3–3.5.
Actions on adjoint modules
The main result we shall need is Theorem 3.1, most of which follows from [17, Theorem 4] and [18].
In the statement of Theorem 3.1, we let \({\bar{X}}\) be a simple adjoint algebraic group over an algebraically closed field of characteristic \(p>0\), and F a Frobenius endomorphism of \({\bar{X}}\) such that \(X:= {\bar{X}}^F = \mathrm{ID}(^d\!X(q)) \) is a group of Lie type over \({\mathbb {F}}_q\), where q is a power of p and \(d\in \{1,2,3\}\) (notation of Sect. 1). We say that a subgroup H of X is of the same type as X if \(F^*(H) \cong ({\bar{X}}^{F_0})'\) for some Frobenius endomorphism \(F_0\). Specifically, for such a subgroup H, one of the following holds (see [15, Theorem 5.1]):

(i)
X is untwisted, and \(^e\!X(q_0) \le H \le \mathrm{ID}(^e\!X(q_0))\) for some \(e \in \{1,2,3\}\) and some subfield \({\mathbb {F}}_{q_0}\) of \({\mathbb {F}}_q\);

(ii)
\(X= \,^d\!X(q)\) is twisted (so \(d=2\) or 3), and \(^d\!X(q_0) \le H \le \mathrm{ID}(^d\!X(q_0))\) for some subfield \({\mathbb {F}}_{q_0}\) of \({\mathbb {F}}_q\).
In each case, we say that H is over the field \({\mathbb {F}}_{q_0}\).
Recall that \({\bar{X}}\) acts on its adjoint module, the Lie algebra \(L({\bar{X}})\). This action is usually irreducible, but there are exceptions in a small number of characteristics; the precise composition factors can be found in [17, 1.10].
Theorem 3.1
There is an explicitly computable function \(f: {\mathbb {N}}\rightarrow {\mathbb {N}}\) such that the following holds. Let \(X= {\bar{X}}^F = \mathrm{ID}(^d\!X(q))\) as above, and let r be the rank of \({\bar{X}}\). Suppose H is a subgroup of X such that H acts absolutely irreducibly on every \({\bar{X}}\)composition factor of the adjoint module \(L({\bar{X}})\). Then one of the following holds:

(i)
\(H < f(r)\);

(ii)
H is of the same type as X;

(iii)
H is as in Table 1.
Proof
Assume that H is not of the same type as X. Choose \(X_0 \le X\) of the same type as X, such that \(H\le X_0\) and \(X_0\) is minimal with these properties, and write \(F^*(X_0) = \,^{d'}\!X(q_0) = ({\bar{X}}^{F_0})'\) for some Frobenius endomorphism \(F_0\) and \({\mathbb {F}}_{q_0}\subseteq {\mathbb {F}}_q\). Let M be a maximal subgroup of \(X_0\) such that \(H \le M\). Then M is not of the same type as X, by the choice of \(X_0\).
Suppose \({\bar{X}}\) is of exceptional type. Here we apply [18, Corollary 2], which determines the maximal subgroups of \(X_0\) that are irreducible on some composition factor of \(L({\bar{X}})\). It follows from this that there is a computable constant C such that either \(M<C\), or \(({\bar{X}},p)\) is \((F_4,2)\) or \((G_2,3)\); in the latter cases, when \({\bar{X}}=F_4\), we have \(M=D_4(q_0)\cdot S_3\), \(C_4(q_0)\) or \(B_4(q_0)\), and when \({\bar{X}} = G_2\) we have \(M = A_2^\epsilon (q_0).2\). However, in none of these cases is M irreducible on both of the composition factors of \(L({\bar{X}})\), contrary to the hypothesis of the theorem. Hence, taking the function f to satisfy \(f(r)\ge C\), the result is proved for this case.
Now suppose \({\bar{X}}\) is a classical group. We refer to the proof of [14, Theorem 4.8(i)]: this shows that there is a computable function \(f_1\) such that either \(M<f_1(r)\), or there exists a connected \(F_0\)stable subgroup \({\bar{M}}\) of \({\bar{X}}\) such that \(M = N_{X_0}({\bar{M}}^{F_0})\), and moreover M stabilizes the Lie algebra \(L({\bar{M}})\). Assume \(M\ge f_1(r)\) (and take the function f to satisfy \(f(r)\ge f_1(r)\) for all r), so that the latter holds. Then \(L({\bar{X}})\) cannot be \({\bar{X}}\)irreducible, and so [17, Proposition 1.10] shows that \({\bar{X}}\) is as in the following table:
If \({\bar{X}} = A_{n1}\) then \({\bar{M}}\) must have dimension 1 or \(n^22\), and it follows easily that \(n=2\), \({\bar{M}} = T_1\) (a rank 1 torus) and \(M = (q_0\pm 1).2\), as in Table 1. If \({\bar{X}} = C_2\) (so that \(X_0 = C_2(q_0)\) or \(^2\!B_2(q_0)\)), then the composition factors of \(L({\bar{X}})\) have dimensions \(4,4,1^2\) and we see from the lists of maximal subgroups of these groups in [2] that H is as in Table 1. And if \({\bar{X}} = D_n\) with \(n\ge 4\), it is easy to see that \({\bar{X}}\) has no connected subgroups of dimension or codimension 1 or 2 satifying the irreducibility hypothesis of the theorem.
So assume now that \({\bar{X}} = B_n\) or \(C_n\) with \(n\ge 3\) (and \(p=2\)). The possibilities for the connected subgroups \({\bar{M}}\) are given by [16, Theorem 2]: either they belong to one of seven classes of subgroups \({{\mathcal {C}}}_i\), or they are simple and act irreducibly on the natural module for \({\bar{X}}\). Inspection of the nonsimple subgroups in the classes \({{\mathcal {C}}}_i\) shows that none of these has a dimension that is a sum of some of the composition factor dimensions in \(L({\bar{X}})\) given above. Hence \({\bar{M}}\) is simple. Now [17, Lemma 7.1] shows that the only possibililties for \(({\bar{X}},{\bar{M}})\) are \((C_n,D_n)\), \((B_n,D_n)\) and \((C_3,G_2)\). Hence \(X = C_n(q)\) and \(M = D_n^\epsilon (q_0).2\) or \(G_2(q_0)\) (with \(n=3\) in the latter case). By what we have already proved, the only subgroups of M that satify the irreducibility hypothesis are of the same type as M. Hence H is as in Table 1, and the proof is complete. \(\square \)
Remark
Note that in Theorem 3.1(ii), if H is of the same type as X, then H does act absolutely irreducibly on each \(\bar{X}\)composition factor of \(L(\bar{X})\).
Lemma 3.2
Let \(X = C_n(q)\) with q even, \(n\ge 3\), and let \(V = V(\lambda _n)\) be a spin module for X over \({\mathbb {F}}_q\) of dimension \(2^n\). Suppose H is as in the first three rows of Table 1. Then H has a subgroup of index at most 2 that is not absolutely irreducible on V.
Proof
For the first two rows, observe that \(V\downarrow D_n^\epsilon (q)\) is the sum of two halfspin modules for \(D_n^\epsilon (q)\). And for the third row, \(V \downarrow G_2(q)\) has composition factors of dimensions 6, 1, 1. \(\square \)
We also require the following fact about containment between the groups \(^d\!X(q)\).
Theorem 3.3
Let \(^d\!X\) be a fixed Lie type, and p a prime, and let Y be a group such that \(^d\!X(p^e) \le Y \le \mathrm{ID}(^d\!X(p^e))\), where \(^d\!X(p^e)\) is simple. Then Y is a subgroup of \(\mathrm{ID}(^d\!X(p^f))\) if and only if e divides f and d is coprime to f / e.
Proof
Suppose e divides f and d is coprime to f / e, and write \(k = f/e\). Let \({\bar{X}}\) be the adjoint simple algebraic group over \({{\bar{{\mathbb {F}}}}}_p\) of type X, and let F be a Frobenius endomorphism of \({\bar{X}}\) such that \({\bar{X}}^F = \mathrm{ID}(^d\!X(p^f))\). Then \({\bar{X}}^{F^k} = \mathrm{ID}(^d\!X(p^e))\), and so \(Y \le {\bar{X}}^{F^k} \le {\bar{X}}^F\).
Conversely, suppose \(Y \le Z\), where \(Y = \,^d\!X(p^e)\), \(Z = \,^d\!X(p^f)\). By [15, Theorem 5.1], there are Frobenius endomorphisms \(F_Y, F_Z\) such that
Now [15, Lemma 5.3] says that there is a Frobenius automorphism \(\tau \) of Z (as defined in [15, Sect. 5]) such that \(Y = O^{p'}(C_Z(\tau ))\). The existence of such a Frobenius automorphism implies that e divides f and d is coprime to f / e, as required. \(\square \)
For \(d= 1,2,3\) we say that the dpart of \(e \in {\mathbb {N}}\) is the largest power of d which divides e.
Corollary 3.4
Let \(^d\!X\) be a Lie type, with corresponding class \({{\mathcal {Y}}}^d\). For \(1\le i\le r\), suppose \(K_i \in {{\mathcal {Y}}}^d\) is over the field \({\mathbb {F}}_{p^{e_i}}\), where \(e_1,\ldots , e_r\) all have the same dpart. Then there is \(g \in {\mathbb {N}}\) such that each \(K_i\) is a subgroup of \(\mathrm{ID}(^d\!X(p^g))\).
Proof
Let g be a common multiple of \(e_1,\ldots ,e_r\) such that \(g/e_i\) is coprime to d for all i. Then Theorem 3.3 implies that \(K_i \le \mathrm{ID}(^d\!X(p^g))\) for all i, as required. \(\square \)
Model theory
In this section we present some results from model theory that we need. We work with the usual language of rings \(L = \{0, 1, +, , \cdot \}\). ‘Definable’ means ‘definable without parameters’ unless explicitly stated otherwise.
Notation
Denote the set of prime numbers by \({\mathcal {P}}\) and the set of prime powers by \({\mathcal {Q}}\). We say that a subset of \({\mathcal {Q}}\) is small if only a finite number of primes divide its elements. A property which holds for all but a small subset of \({\mathcal {Q}}\) is said to hold for almost all elements of \({\mathcal {Q}}\).
In [1], Ax showed that there is an algorithm to decide, given a closed Lformula, whether or not there are infinitely many finite fields in which it holds. The algorithm makes use of Gödel’s completeness theorem and involves an unbounded (but terminating) search. A primitive recursive algorithm (so not involving unbounded searches) was given by Fried and Sacerdote in [8]. (Recursive procedures for the other results below had also been given by Ax.) We state their results in the following way:
Theorem 3.5
Suppose \(\theta \) is a closed Lformula.

(i)
There is a primitive recursive procedure to decide whether or not there is a finite set of primes such that \(\theta \) is true in \({\mathbb {F}}_q\) for all \(q \in {\mathcal {Q}}\) which are not divisible by a prime in the finite set. If there is such a finite set, then the procedure also determines it.

(ii)
Given a prime p, there is a primitive recursive procedure to decide whether or not \(\theta \) is true in \({\mathbb {F}}_{p^e}\) for all but finitely many e. If it is, then the procedure also determines the finite set of exceptional exponents.

(iii)
There is a primitive recursive procedure to decide whether or not there are infinitely many finite fields \({\mathbb {F}}_q\) in which \(\theta \) is true. If there are only finitely many, then the procedure will determine them.
Note that (i) says that we can determine whether or not \(\{q \in {\mathcal {Q}}: {\mathbb {F}}_q \models \lnot \theta \}\) is small. As a special case of (i), we can determine whether or not \(\theta \) is true in all finite fields.
Proof

(i)
This is from Theorem 2 of [8] (p. 228) with \(K = {\mathbb {Q}}\).

(ii)
This is Theorem 3 of [8] (p. 231).

(iii)
This is stated in [8] (bottom of p. 204), but we give a few more details. First, apply (i) to \(\lnot \theta \). If the procedure finds that the set of all \(q\in {\mathcal {Q}}\) such that \({\mathbb {F}}_q \models \theta \) is not small, then there are infinitely many primes \(p_1< p_2 < \cdots \) and exponents \(e_i\) such that \({\mathbb {F}}_{p_i^{e_i}} \models \theta \), and we can stop. Otherwise, (i) identifies a prime \(p_0\) such that \(\lnot \theta \) is true in \({\mathbb {F}}_{p^e}\) for all primes \(p \ge p_0\). For each prime \(p < p_0\), we then apply (ii) to \(\lnot \theta \) to determine whether or not \(\theta \) holds in infinitely many \({\mathbb {F}}_{p^e}\). If it does not, the algorithm determines the finite set of \({\mathbb {F}}_{p^e}\) in which \(\theta \) holds (cf. Theorem 4 of [8]). \(\square \)
We also require the following result, which follows from Theorem 6.7 of [6].
Theorem 3.6
Suppose \(\theta \) is a closed Lformula and p is a fixed prime. Then there are effectively computable constants \(N>0\) and B such that, for \(e \ge B\),
The following is the effective version of the main result of [5]. Here, ‘effective’ means computable in a primitive recursive way.
Theorem 3.7
[6, Theorem 6.4] For each Lformula \(\theta (x_1,\ldots , x_n, y_1, \ldots , y_m)\) we can effectively compute a finite set \(\{(\theta _i, \mu _i, \varepsilon _i, r_i): i \in I\}\) where:

\(\theta _i(\bar{y})\) is an Lformula, \(\mu _i\), \(\varepsilon _i\) are positive rational numbers, and \(r_i \in \{0,\ldots , n\}\),
such that for each \(q \in {\mathcal {Q}}\) and \({\bar{b}} \in {\mathbb {F}}_q^m\) there is a unique \(i \in I\) with \({\mathbb {F}}_q \models \theta _i({\bar{b}})\) and for this i, the size \(N_q({\bar{b}})\) of the set \(\theta [{\mathbb {F}}_q, {\bar{b}}] = \{ {\bar{a}} \in {\mathbb {F}}_q^n : {\mathbb {F}}_q \models \theta ({\bar{a}},{\bar{b}})\}\) is either zero or it satisfies
In the above, we may assume that the formula \((\forall \bar{x})(\lnot \theta (\bar{x},\bar{y}))\) is one of the \(\theta _i(\bar{y})\). This then picks out those \(q, \bar{b}\) where \(N_q(\bar{b})\) is zero.
Remark 3.8
It is well known that, for fixed \(d \in {\mathbb {N}}\), the field \({\mathbb {F}}_{q^d}\) and its Frobenius map \(x \mapsto x^q\) are firstorder definable in the field \({\mathbb {F}}_q\) in a uniform way, using parameters from \({\mathbb {F}}_q\). For example, let \(\bar{a} = (a_0,\ldots , a_{d1})\) be a dtuple of parameters representing the coefficients in \({\mathbb {F}}_q\) of a polynomial \(f_{\bar{a}} = a_0 + \cdots + a_{d1}x^{d1} + x^d\) which is irreducible over \({\mathbb {F}}_q\). We identify the field \({\mathbb {F}}_{q^d}\) with the set \({\mathbb {F}}_q^d\) with coordinatewise addition and multiplication modulo \(f_{\bar{a}}\). The Frobenius map on \({\mathbb {F}}_{q^d}\) can then be described using a \(d^2\)tuple \(\bar{b}\) of parameters giving the entries of a \(d \times d\) matrix which gives an automorphism of \({\mathbb {F}}_{q^d}\) of order d. These conditions on the parameters \(\bar{a}, \bar{b}\) can be expressed as \({\mathbb {F}}_q \models \gamma (\bar{a}, \bar{b})\) where \(\gamma (\bar{x},\bar{y})\) is an appropriate Lformula.
When we make use of this, the actual choice of the parameters \(\bar{a}, \bar{b}\) will be irrelevant and we will suppress them in the notation. Moreover, the results for parameterfree formulas in Theorems 3.5 and 3.7 will still be applicable. For example, the unitary group \(\mathrm{GU}_n(q)\) thought of as a subgroup of \(\mathrm{GL}_n(q^2)\) is definable in \({\mathbb {F}}_q\) using parameters \(\bar{a}, \bar{b}\) as above (with \(d = 2\)). A firstorder statement \(\theta \) about \(\mathrm{GU}_n(q)\) (say, in the language of groups) can be translated into an Lformula \({\hat{\theta }}(\bar{a}, \bar{b})\) (with parameters) whose truth value does not depend on the choice of the particular \(\bar{a}, \bar{b}\) which satisfy \(\gamma \). Then
and the decidability results in Theorem 3.5 apply to the Lformula on the righthand side here.
Deduction of Theorem 2
Let \(G = \langle x_1,\ldots ,x_s \,\, \rho _1,\ldots , \rho _k\rangle \) be a finitely presented group, with generators \(x_i\) and relators \(\rho _i\). Let \(^d\!X\) be a fixed Lie type, and recall the class \({{\mathcal {Y}}}^d\) of groups defined in the Introduction. Now let
where on the first line, the union is over all e for which the type \(^e\!X\) exists. Exclude the case where \(^d\!X\) is of Suzuki or Ree type \(^2\!B_2\), \(^2\!G_2\) or \(^2\!F_4\); these will be considered in Sect. 3.4.
For a field K, let \(\mathrm{ID}(X(K))\) denote the innerdiagonal group of (untwisted) type X over K, and let \(V = V(K)\) be the adjoint module for \(\mathrm{ID}(X(K))\). For \(K = {\mathbb {F}}_q\), we can regard \(\mathrm{ID}(X(K))\) as a definable subset H(K) of \(K^{l^2}\) (where \(l = \dim V\)) in a uniform way via the action on V, as the solutions of polynomial equations defining the connected adjoint algebraic group of type X.
If \(X = A_n\), \(D_n\) or \(E_6\) and \(K = {\mathbb {F}}_q\), then X possesses a graph automorphism of order \(d \in \{2,3\}\), and the twisted groups \(\mathrm{ID}(^d\!X(q))\) can also be regarded as uniformly definable subsets \(H({\mathbb {F}}_q)\) of some power of K, using Remark 3.8. This is covered in detail in Section 5.3 of [24].
In one exceptional case we vary the above definition of H(K) and V(K). This is the case where \(X = C_n\,(n\ge 2)\) and \(\mathrm{char}(K) = 2\). In this case we have \(\mathrm{ID}(X(K)) = X(K)\); let \(V_{2n}(K)\) be the natural module, and S(K) a spin module for X(K), and for \(K = {\mathbb {F}}_q\) regard X(K) as a uniformly definable subset H(K) of \(K^{l^2}\) via the action on \(V = V_{2n}(K)\oplus S(K)\), where \(l = 2n+2^n\).
For H(K) defined as above, let \(\Phi _0(K)\) be the set of tuples of elements which satisfy the defining relations of G. That is,
This is a definable subset of \(K^{sl^2}\).
For a tuple \({\bar{g}} = (g_1,\ldots , g_s) \in \Phi _0(K)\), define \(\langle {\bar{g}}\rangle : = \langle g_1,\ldots ,g_s\rangle \). There is an Lformula that expresses the condition that the subgroup \(\langle {\bar{g}}\rangle \) of \(\mathrm{GL}(V)\) is absolutely irreducible on every H(K)composition factor of V. One way of writing down such a formula is as follows. Fix a basis B of V. Let \(K_1\) be an extension field of K with \(K_1:K\le n\) (definable in K as in Remark 3.8), let \(V(K_1)\) be the \(K_1\)vector space \(V \otimes _K K_1\), and let \({{\mathcal {W}}}\) be the collection of subspaces of \(V(K_1)\) that are spanned by some proper nonempty subset of B. The formula says that for any such \(K_1\), there is no pair \(h \in \mathrm{GL}(V(K_1))\), \(W \in {{\mathcal {W}}}\) such that each of the conjugates \(g_i^h\) stabilizes W. There is also a formula expressing the condition \(\langle {\bar{g}}\rangle >f(r)\), where f is the function in Theorem 3.1. Hence if we define \(\Phi (K)\) to be the set of all tuples \({\bar{g}}\in \Phi _0(K)\) such that \(\langle {\bar{g}}\rangle \) is absolutely irreducible on every H(K)composition factor of V and has order greater than f(r), then \(\Phi (K)\) is uniformly definable in K. We can regard \(\Phi \) here as a parameterfree Lformula (with the parameters needed to define the required field extensions absorbed into the formula by making use of Remark 3.8). In principle, we could write down this formula \(\Phi \) explicitly.
In the case where \(X = C_n\) and \(\mathrm{char}(K) = 2\), we adjust \(\Phi \) to include the condition that subgroups of index at most 4 in \(\langle {\bar{g}}\rangle \) arising from subgroups of such index in G are also absolutely irreducible on every composition factor of V.
By Theorem 3.1 and Lemma 3.2, for any finite field \(K = {\mathbb {F}}_q\), and any tuple \({\bar{g}} \in \Phi (K)\), the group \(\langle {\bar{g}}\rangle \) is of the same type as X, hence is a group in the class \({{\mathcal {Y}}}\) over some subfield \({\mathbb {F}}_{q_0}\) of \({\mathbb {F}}_q\). Summarising:
Lemma 3.9
For each prime power q, the finitely presented group G has a homomorphic image in the class \({{\mathcal {Y}}}\) over some subfield \({\mathbb {F}}_{q_0}\) of \({\mathbb {F}}_q\) if and only if \({\mathbb {F}}_q \models \exists \bar{x}\Phi (\bar{x})\).
At this point we apply Theorem 3.7 (taking \(m=0\)) to the parameterfree formula \(\Phi (\bar{x})\) and obtain (effectively) a finite set \(\{(\theta _i, \mu _i, \varepsilon _i, r_i): i \in I\}\) as in the theorem. Note that as there are no parameter variables in \(\Phi \), the \(\theta _i\) are Lsentences. Informally, this expresses \(\Phi ({\mathbb {F}}_q)\) as a finite union of subsets of dimensions \(r_i\,(i\in I)\), for any \(q \in {\mathcal {Q}}\).
On the other hand, we have the following simple observation.
Lemma 3.10
For \(q \in {\mathcal {Q}}\), the group \(H({\mathbb {F}}_q)\) acts by conjugation on the set \(\Phi ({\mathbb {F}}_q)\). The size of each orbit is \(H({\mathbb {F}}_q)\).
Proof
If \(\bar{g} \in \Phi ({\mathbb {F}}_q)\), then \(\langle \bar{g}\rangle \le H({\mathbb {F}}_q)\) is a subgroup of \(H({\mathbb {F}}_q)\) of the same type as X, which has trivial centralizer in \(H({\mathbb {F}}_q)\) (by Schur’s lemma applied to the adjoint representation of \(H({\mathbb {F}}_q)\)). So the stabilizer under conjugation of \(\bar{g}\) is trivial. \(\square \)
It follows that we may assume that the ‘dimensions’ \(r_i\) in the above are either 0 or at least x, where x is the dimension of the simple algebraic group of type X. We let \(I_x = \{i \in I : r_i = x\}\) and \(I_y = \{i \in I : r_i > x\}\). Let
for \(j= x \hbox { or } y\).
Define \({\mathcal {Q}}(G)\) to be the set of prime powers q such that G has as a homomorphic image a group in the class \({{\mathcal {Y}}}\) over \({\mathbb {F}}_q\). Let \(S = \{q : {\mathbb {F}}_q \models \exists \bar{x}\Phi (\bar{x})\}\), and for a prime p, let \(S_p = \{e : {\mathbb {F}}_{p^e} \models \exists \bar{x}\Phi (\bar{x})\}\).
Lemma 3.11
The set \({\mathcal {Q}}(G)\) is infinite if and only if at least one of the following holds.

(a)
There are infinitely many primes dividing the numbers in the set S (i.e. this set is not small).

(b)
There is a prime p such that \(\{e \in {\mathbb {N}}: {\mathbb {F}}_{p^e}\models \Theta _y\}\) is infinite.

(c)
\(d \ge 2\) and for some p, the dpart of the elements of \(S_p\) is unbounded.
Proof
If the set in (a) is not small, then the number of primes dividing elements of the set \({\mathcal {Q}}(G)\) is infinite, by Lemma 3.9.
Suppose p is as in (b). Then \(\Phi ({\mathbb {F}}_q)\) is bounded below by a constant times \(q^{x+1}\) for infinitely many powers q of p. As \(\vert H({\mathbb {F}}_q)\vert \) is \(O(q^x)\), it follows that the number of \(H({\mathbb {F}}_q)\)orbits on \(\Phi ({\mathbb {F}}_q)\) can be arbitrarily large. As \(^d\!X(q)\) has boundedly many orbits on subgroups of the same type over a fixed subfield \({\mathbb {F}}_{q_0}\) (by [15, Theorem 5.1]), there is no bound on the size of powers of p in \({\mathcal {Q}}(G)\).
Suppose \(d \ge 2\) and p is as in (c). For \(i \in {\mathbb {N}}\) we can find \(e_i \in S_p\) with dpart \(d^{j_i}\) where \(j_1< j_2 < \cdots \). By Lemma 3.9, there is a subgroup \(K_i\) of \(\mathrm{ID}(^d\!X(p^{e_i}))\) which is in the class \({{\mathcal {Y}}}\) and which is an image of G. This must be over a subfield \({\mathbb {F}}_{p^{f_i}}\) of \({\mathbb {F}}_{p^{e_i}}\), so \(^d\!X(p^{f_i}) \le \, ^d\!X(p^{e_i})\). Thus by Theorem 3.3, \(f_i\) divides \(e_i\) and d is coprime to \(e_i/f_i\). If \(i < k\) then \(e_k\) is divisible by a higher power of d than \(e_i\), and so \(^d\!X(p^{f_i}) \not \le \, ^d\!X(p^{e_k})\) by Theorem 3.3. Hence \(K_k\) is not isomorphic to \(K_i\) and it follows that \({\mathcal {Q}}(G)\) is infinite.
Conversely suppose that \({\mathcal {Q}}(G)\) is infinite. If \({\mathcal {Q}}(G)\) is not small then we are in case (a). If \({\mathcal {Q}}(G)\) is small then there is a prime p such that \(\{ e: p^e \in {\mathcal {Q}}(G)\}\) is infinite.
Suppose first that there is an infinite subset of \(\{ e: p^e \in {\mathcal {Q}}(G)\}\) whose elements have the same dpart. We claim that for infinitely many powers q of p we have \({\mathbb {F}}_q \models \Theta _y\). Assume for a contradiction that this is not the case.
By Corollary 3.4 we have an infinite increasing sequence \(q_1, q_2, q_3, \ldots \) of powers of p with the property that \(\Phi ({\mathbb {F}}_{q_k})\) contains tuples generating a group in \({{\mathcal {Y}}}\) over \({\mathbb {F}}_q\) for at least k different values of q. In particular, the number of orbits of \(^d\!X(q_k)\) on this is at least k, so
But we can also assume that these \({\mathbb {F}}_{q_k}\) all satisfy the same \(\theta _i\) with \(i \in I_x\). The estimate in Theorem 3.7 gives constants \(\alpha , \beta \) such that
This implies that \(n_k / \vert ^d\!X(q_k) \vert \) is bounded above as \(k \rightarrow \infty \) and so we have a contradiction.
In the remaining case, \(\{ e: p^e \in {\mathcal {Q}}(G)\}\) has elements of arbitrarily large dpart. So \(d\ge 2\). If \(p^e \in {\mathcal {Q}}(G)\) there is \(f \in {\mathbb {N}}\) and a quotient K of G such that \(^d\!X(p^f) \ge K \ge \, \mathrm{ID}(^d\!X(p^e))\). By Theorem 3.3, the dparts of e and f are the same. Moreover, \(f \in S_p\). Thus (c) holds. \(\square \)
Remark
It would be interesting to know whether there is an example of a finitely presented group G for which (c) of Lemma 3.11 holds, but (a) and (b) do not hold. This would show an essential difference between the untwisted and twisted cases.
Corollary 3.12
There is a primitive recursive algorithm to decide whether the set \({\mathcal {Q}}(G)\) is infinite or not.
Proof
We say how to check the conditions in Lemma 3.11. We use the notation and terminology from there. First, by Theorem 3.5(i), we can test whether the set S is small or not using a primitive recursive algorithm. If it is not small, then \({\mathcal {Q}}(G)\) is infinite and we can stop. If it is small, then our algorithm gives us an upper bound \(p_0\) on the primes which divide its elements.
For each prime \(p \le p_0\) we decide whether or not (c) of Lemma 3.11 holds. We may of course assume that \(d \ge 2\). By applying Theorem 3.6 to the formula \(\exists \bar{x}\Phi (\bar{x}) \wedge \) ‘characteristic is p’ we can determine effectively: some \(N \in {\mathbb {N}}\) and a (possibly empty) set of residue classes \(a +N{\mathbb {Z}}\) such that, for sufficiently large \(e \in {\mathbb {N}}\), we have \(e \in S_p\) if and only if e lies in one of these classes. So it remains to decide, given a residue class \(a + N{\mathbb {Z}}\), whether or not it has elements of unbounded dpart. But it is easy to show that this happens if and only if the dpart of a is greater than or equal to the dpart of N.
Finally, for primes \(p \le p_0\) we can check in a primitive recursive way whether there are infinitely many e with \({\mathbb {F}}_{p^e}\models \Theta _y\), by Theorem 3.5(ii). \(\square \)
At this point we can complete the proof of Theorem 2 (apart from the Suzuki and Ree families, postponed until the next subsection). We assume Theorem 4, which will be proved in Sect. 4. Fix a Lie type \(^d\!X\), and let \({{\mathcal {X}}}^d\), \({{\mathcal {Y}}}^d\) be the corresponding classes of groups defined in the Introduction. If \(d>1\), then \({{\mathcal {Y}}} = {{\mathcal {Y}}}^d= {{\mathcal {X}}}^d\), so Corollary 3.12 shows that there is an algorithm that determines whether or not G has infinitely many quotients in \({{\mathcal {X}}}^d\). Now suppose \(d=1\), so that \({{\mathcal {Y}}} = \bigcup _e {{\mathcal {Y}}}^e\). By Corollary 3.12, there is an algorithm that determines whether or not G has infinitely many quotients in \({{\mathcal {Y}}}\). If there are infinitely many such quotients, then Theorem 4 shows that there are also infinitely many quotients in \({{\mathcal {X}}}^1\).
This completes the proof of Theorem 2 apart from the last assertion—that if the set \({\mathcal {Q}}(G)\) is finite, we can compute this set. So suppose \({\mathcal {Q}}(G)\) is finite. Note that if N is a positive integer, we can write down a sentence \(\Psi _N\) which, in a field \({\mathbb {F}}_q\), says that there is a tuple in \(H({\mathbb {F}}_q)\) which satisfies the formula \(\Phi (\bar{x})\) and which generates a subgroup of \(H({\mathbb {F}}_q)\) with at least N elements. As in Lemma 3.9, we have that \(\Psi _N\) is true in \({\mathbb {F}}_q\) if and only if there is a homomorphic image of G in \({{\mathcal {Y}}}\) of size at least N. So by our assumption, there is some N with the property that \(\Psi _N\) is false in all finite fields. Using Theorem 3.5, we can find such an N by testing whether \(\Psi _n\) is false in all finite fields for successive values of n until one is found (this involves an unbounded search). This gives a bound N on the size of the groups in \({\mathcal {Y}}\) which are homomorphic images of G, so we can test groups in \({{\mathcal {Y}}}\) of size at most N individually (a series of finite computations) to determine whether or not they are homomorphic images of G.
In Sect. 3.5, we give a more complicated argument which avoids the unbounded search in the previous paragraph, hence providing a primitive recursive algorithm for determining \({\mathcal {Q}}(G)\) in the case where it is finite.
The Suzuki and Ree groups
We are very grateful to Ivan Tomašić for his help with the material of this section. The aim is to adapt the above arguments to handle the classes \({\mathcal {X}}^2\) where X is \(B_2\), \(G_2\), or \(F_4\) (and the characteristic is 2, 3 or 2 respectively). So these are the classes consisting of the Suzuki and Ree groups \(^2\!B_2(q),\,^2\!G_2(q),\,^2\!F_4(q)\)—note that for these groups, \(\mathrm{ID}(^2\!X(q)) = \,^2\!X(q)\), so the classes consist only of the simple groups.
The appropriate modeltheoretic framework is that of algebraically closed fields with a Frobenius automorphism [10], rather than the model theory of finite fields used in the previous subsection.
Let \(L^\sigma \) be the firstorder language consisting of L, the language of rings used previously, together with a unary function symbol \(\sigma \). If q is a power of a prime number p and K is an algebraically closed field of characteristic p, we denote by \(K_q\) the \(L^\sigma \)structure \((K; 0,1,+, , \cdot , \sigma )\) where \(\sigma : K \rightarrow K\) is \(x \mapsto x^q\). In particular, the fixed field of \(\sigma \) is \({\mathbb {F}}_q\), so the field \({\mathbb {F}}_q\) is uniformly definable in \(K_q\) (that is, using an \(L^\sigma \)formula which is independent of q). Similarly, for fixed p, let \(\nu \) denote the Frobenius map \(x \mapsto x^p\). If \(q = p^n\) then the field \({\mathbb {F}}_{p^{2n+1}}\) is uniformly interpreted in \(K_q\) as the fixed field of \(\nu \circ \sigma ^2\). Moreover, \((\nu \circ \sigma )^2(x) = \nu (x)\) for all \(x \in {\mathbb {F}}_{p^{2n+1}}\). Thus we have a uniform interpretation of the fields \({\mathbb {F}}_{p^{2n+1}}\) together with a square root of the Frobenius map on these in the structures \(K_{p^n}\).
It follows that if \(^2\!X(p^{2n+1})\) is a family of Suzuki or Ree groups, then there is a (parameterfree) \(L^\sigma \)formula H such that, for an algebraically closed field K of characteristic p (equal to 2 or 3, as appropriate), the solution set \(H(K_{p^n})\) is the subgroup \(^2\!X(p^{2n+1})\) of the group X(K) (represented by its action on its adjoint module, as in the previous section).
The algorithm to determine whether our finitely presented group G has infinitely many images in the Xclass \({\mathcal {X}}^2\) is then exactly as before, except that we require results for the \(L^\sigma \)structures \(K_q\) in place of Theorem 3.5(ii) and Theorem 3.7. The following result (Theorem 1.1 of [25]) has been communicated to us by Ivan Tomašić.
Theorem 3.13
For each \(L^\sigma \)formula \(\theta (x_1,\ldots , x_n, y_1, \ldots , y_m)\) there exists a positive constant C and a finite set D of pairs \((d,\mu )\) with \(d \in {\mathbb {Z}}\cup \{\infty \}\) and \(\mu \in {\mathbb {Q}}^+\cup \{\infty \}\) such that for each \(q \in {\mathcal {Q}}\) and \({\bar{b}} \in K_q^m\), if \(N_q({\bar{b}})\) is the size (possibly \(\infty \)) of the set \(\theta [K_q, {\bar{b}}] = \{ {\bar{a}} \in K_q^n : K_q \models \theta ({\bar{a}},{\bar{b}})\}\), then either \(N_q(\bar{b})\) is zero, or there is a pair \((d,\mu ) \in D\) with
Moreover, for each \((d,\mu ) \in D\) there is an \(L^\sigma \)formula \(\varphi _{d,\mu }(\bar{y})\) with the property that, for each q and \(\bar{b} \in K_q^m\), the above estimate for \(N_q(\bar{b})\) holds if and only if \(K_q \models \varphi _{d,\mu }(\bar{b})\).
Note that in the above, the obvious conventions about \(\infty \) are being used when \(N_q(\bar{b})\) is infinite. The paper [25] makes no claims about determining C, D and the formulas \(\varphi _{d,\mu }\). However, Tomašić informs us that, using the methods of [28], a version of the above can be proved in which these are determined in a primitive recursive way (so providing a replacement for Theorem 3.7). Moreover, in the case where there are no parameter variables \(\bar{y}\), the \(\varphi _{d,\mu }\) will be such that testing whether or not there are infinitely many q with \(K_q \models \phi _{d,\mu }\) can also be done in an effective way [giving a replacement for Theorem 3.5(ii)].
In summary, we have proved the following result, which is Theorem 2 for the Suzuki and Ree families:
Theorem 5
Suppose \(X = B_2, F_4\) or \(G_2\) and the characteristic is 2, 2 or 3 respectively. Then there is a primitive recursive algorithm algorithm that, given any finitely presented group, will determine whether or not the group has infinitely many images in the class \({\mathcal {X}}^2\).
Determining finitely many images
We continue with the notation of Sect. 3.3. In particular \({\mathcal {Y}}\) is the class defined at the start of that section (or, given the remarks in Sect. 3.4, one of the classes of Suzuki or Ree groups). We will denote \(\mathrm{ID}(^d\!X(q))\) by H(q) (this is consistent with the above notation where \(H({\mathbb {F}}_q)\) is the interpretation of \(\mathrm{ID}(^d\!X(q))\) in \({\mathbb {F}}_q)\).
We suppose that \({\mathcal {Q}}(G)\) is finite and give a primitive recursive algorithm to determine it. From the above, we have a finite list of the possible primes dividing the elements of \({\mathcal {Q}}(G)\), so we fix p to be one of these and determine \({\mathcal {Q}}_p(G)\), the images in \({\mathcal {Y}}\) in this characteristic. By Lemma 3.9, we can test whether this is empty or not by applying Theorem 3.5(ii) to the formula \(\lnot (\exists \bar{x}\Phi (\bar{x}))\).
From now on, we assume that \({\mathcal {Q}}_p(G)\) is nonempty.
Let \(E = \{ e : {\mathbb {F}}_{p^e} \models (\exists \bar{x})(\Phi (\bar{x}))\}\). Note that this is infinite. By Lemma 3.11, the dpart of elements of this set is bounded (and we can compute a bound effectively, as in the proof of Lemma 3.11). Thus it will suffice to show that we can effectively determine the elements of \({\mathcal {Q}}_p(G)\) which are defined over fields \({\mathbb {F}}_{p^e}\) where the dpart of e is some fixed power a of d. Call this \({\mathcal {Q}}_p^a(G)\). In what follows, \(q = p^e\) (sometimes with embellishments) will always denote a power of p with dpart a. Note that there is a formula \(\chi _a\) such that \({\mathbb {F}}_{p^f} \models \chi _a\) if and only if f has dpart a.
Notation 3.14
List the groups in \({\mathcal {Q}}_p^a(G)\) as \(T_1,\ldots , T_m\), where \(T_i\) is over the field \({\mathbb {F}}_{\pi _i}\) for some power \(\pi _i\) of p. For each i there is \(e_i \in \{1,2,3\}\) with \(Y_i \le T_i \le Y_i^I\), where \(Y_i = \, ^{e_i}\!X(\pi _i)\) and \(Y_i^I = \mathrm{ID}(Y_i)\).
We shall show how to determine some q such that H(q) contains a copy of each \(T_i\). Note that such a q exists, by Corollary 3.4.
Apply Theorem 3.7 to the formula \(\Phi (\bar{x}) \wedge \) ‘characteristic is p’ \(\wedge \exists \bar{x}\Phi (\bar{x})\wedge \chi _a\). This gives a finite set \(\{(\theta _i, \mu _i, \varepsilon _i, r_i): i \in I\}\) as in Theorem 3.7 such that if \(e \in E\) and \(q=p^e\), then there is a unique \(i \in I\) with \({\mathbb {F}}_q \models \theta _i\), and for this i,
In the next lemma, \(\dim (X)\) denotes the dimension of the simple algebraic group of type X.
Lemma 3.15
Let \(i\in I\), and suppose there are infinitely many \(e \in E\) with \({\mathbb {F}}_{p^e} \models \theta _i\). Then \(r_i = \dim (X)\).
Proof
By assumption, G has finitely many images in \({\mathcal {Q}}_p(G)\). Also H(q) has boundedly many orbits on subgroups of the same type over a given subfield (by [15, Theorem 5.1]). Hence by Lemma 3.10, there is a constant c such that
As H(q) is of the order of \(q^{\dim (X)}\), the conclusion follows from (1). \(\square \)
Remark 3.16
For i as in Lemma 3.15, we may adjust the formula \(\theta _i\) so that there exists a rational number \(c_i\) with the property that if \((q_j)\) is an increasing sequence of powers of p with \({\mathbb {F}}_{q_j} \models \theta _i\) for all j, then
Assume from now on that this is the case.
For \(j \le m\), let \({\mathcal {C}}_j(q)\) be a system of representatives for the conjugacy classes of subgroups of H(q) which are isomorphic to the group \(T_j\) (of course, this could be empty). Let
Let \(s_j\) denote the number of orbits (under conjugation) of \(T_j\) on the set of stuples in \(T_j\) which satisfy the defining relations of G and which generate \(T_j\). (Recall that s is the cardinality of the given generating set for G.)
Lemma 3.17
We have
Proof
The number of subgroups of H(q) which are isomorphic to \(T_j\) is equal to \(\sum _{T \in {\mathcal {C}}_j(q)} \vert H(q)\vert / \vert N_{H(q)}(T) \vert \). As the number of tuples in \(\Phi ({\mathbb {F}}_{q})\) which generate some \(T \cong T_j\) is \(\vert T \vert s_j\), we obtain the required result. \(\square \)
Lemma 3.18
There are infinitely many powers q of p with the property that for all \(j \le m\) and for all powers \(q'\) of p, we have \(t_j(q) \ge t_j(q')\).
Proof
Let \(\gamma _j = {\mathcal {C}}_j(q)\). Using the notation established in 3.14, if \(\gamma _j \ne 0\), then H(q) has one conjugacy class of subgroups isomorphic to \(Y_j\), each having normalizer isomorphic to \(Y^I_j\) in H(q). Thus \(\gamma _j\) is equal to the number of conjugacy classes of subgroups isomorphic to \(T_j\) in \(Y^I_j\). So in this case it follows that
depends only on j.
So either H(q) does not contain a copy of \(T_j\) and \(t_j(q) = 0\), or \(t_j(q) = \tau _j\). As there are infinitely many q where H(q) contains a copy of \(T_j\) for all \(j \le m\), the result follows. \(\square \)
With \(\tau _j\) as in the proof of the above lemma, let
Let \(\alpha = \sum _{j=1}^m \tau _js_j\).
Lemma 3.19
There is some \(i \in I\) with the property that \({\mathbb {F}}_q \models \theta _i\) for infinitely many \(q \in Q\). For such i we have
for all \(j \in I\) for which there are infinitely many powers \(q'\) of p with \({\mathbb {F}}_{q'} \models \theta _j\).
Proof
Suppose \(l \in I\) and \((q_u)_{u\in {\mathbb {N}}}\) is an increasing sequence with \({\mathbb {F}}_{q_u} \models \theta _l\) and each \(t_j(q_u)\) is constant on the sequence. Let \(\beta = \sum _j t_j(q_u) s_j\) and \(x = \dim (X)\). By Lemmas 3.15 and 3.17 we have:
Letting \(u \rightarrow \infty \), we obtain \(\beta = \mu _l/ c_l\).
It follows that if i, j are as in the statement of the Lemma, then \(\mu _i/c_i = \alpha \). Moreover, we may take an infinite sequence of powers q of p where \({\mathbb {F}}_q\) satisfies \(\theta _j\) and where the \(t_k(q)\) are constant. Then for such q,
as required. \(\square \)
For notational convenience, take \(i = 0\) where i is as in Lemma 3.19. Note that by Lemma 3.19, this i can be determined explicitly (as the constants \(\mu _j\), \(c_j\) are effectively computable). We obtain:
Lemma 3.20
There is an effectively computable constant A such that if \(q = p^e\) and \(e\ge A\) and \({\mathbb {F}}_q \models \theta _0\), then \(t_j(q) = \tau _j\) for all \(j \le m\). In particular, H(q) contains a copy of each \(T_j\).
Proof
Suppose \({\mathbb {F}}_q \models \theta _0\). Then, writing \(x = \dim (X)\) as usual,
if q is sufficiently large. Note that the lefthand side here is an integer and the righthand side tends to zero. Thus, as we know explicitly all of the constants involved, we can compute A such that if \(q \ge A\), then the lefthand side is zero. As \(\tau _j \ge t_j(q)\) for all j and q, this implies that \(t_j(q) = \tau _j\), as required. \(\square \)
We can now give the primitive recursive algorithm to determine \({\mathcal {Q}}_p^a(G) = \{T_1,\ldots , T_m\}\), assuming that we have already tested to determine that it is nonempty.

1.
Determine the \(\{(\theta _i, \mu _i, \varepsilon _i, r_i): i \in I\}\) from Theorem 3.7, as above.

2.
Determine for which \(\theta _i\) there are infinitely many \(e \in E\) with \({\mathbb {F}}_{p^e} \models \theta _i\) (and discard the rest).

3.
Adjust the \(\theta _i\) as in Remark 3.16.

4.
Take i such that \(\mu _i/c_i\) is maximal, and relabel \(i=0\).

5.
Determine the constants A, B, N in Lemma 3.20 and Theorem 3.6 (with \(\theta = \theta _0\)); let \(A_0\) be the maximum of A, B.

6.
Find \(q = p^e\) with \(A_0 \le e \le A_0 + N\) and \({\mathbb {F}}_{q} \models \theta _0\).
It then follows that H(q) contains a copy of each \(T_j\): so we can identify them by inspection.
Proof of Theorem 4
Let \(^d\!X\) be a fixed Lie type, and let \({{\mathcal {Y}}}^d\) be the corresponding class of groups defined in the Introduction. Let G be a finitely generated group, and assume that G has infinitely many quotients \(^d\!{\tilde{X}}(q_i) \in {{\mathcal {Y}}}^d\) (\(i \in {\mathbb {N}}\)), where \(^d\!X(q_i) \le \,^d\!{\tilde{X}}(q_i) \le \mathrm{ID}(^d\!X(q_i))\). For each i, let \(\alpha _i: G \rightarrow \,^d\!{\tilde{X}}(q_i)\) be a surjection. Let \(K_i = {\bar{{\mathbb {F}}}}_{q_i}\), and note that \(^d\!{\tilde{X}}(q_i) < X(K_i)\), the adjoint simple algebraic group over \(K_i\). Let \(V(K_i)\) be the adjoint module for \(X(K_i)\), so for each \(i \in {\mathbb {N}}\) we have
Now let \({{\mathcal {U}}}\) be a nonprincipal ultrafilter on \({\mathbb {N}}\), and take the corresponding ultralimit of the above sequences. This yields
where \(K = \prod K_i/{{\mathcal {U}}}\), an algebraically closed field. We know that \(G\alpha _i=\,^d\!{\tilde{X}}(q_i)\) acts irreducibly on every \(X(K_i)\)composition factor of \(V(K_i)\).
Denote the distinguished generators of G by \(\bar{x}\) and let \(\bar{a}_i\) be the image of these under \(\alpha _i\). Let \(\bar{a}\) be the image of \((\bar{a}_i)_{i \in {\mathbb {N}}}\) in the ultraproduct. Each \(\bar{a}_i\) acts irreducibly on the \(X(K_i)\)composition factors of \(V_i\) and this can be expressed in a firstorder way. So by the Łos Theorem, \(\bar{a}\) acts irreducibly on the X(K)composition factors of V(K). The subgroup A generated by \(\bar{a}\) is an infinite image of G, and its Zariski closure \({\bar{A}}\) is an algebraic subgroup of X(K) which is irreducible on all composition factors of the adjoint module. It follows that \({\bar{A}} = X(K)\), apart possibly from the exceptions corresponding to entries in Table 1 of Theorem 3.1, in which \(X = C_n\), \(p=2\); these can be excluded by adding the extra firstorder condition given in the preamble to Lemma 3.9. Therefore A is Zariski dense in X(K).
Thus we have an algebraically closed field K and a homomorphism \(\alpha : G \rightarrow X(K)\) with Zariskidense image. As G is finitely generated, it follows from [13, Theorem 4.1] that there is a global field \(k_0\) (of the same characteristic as K) and a homomorphism \(\psi : G \rightarrow X(k_0)\) with Zariskidense image. (Note that in all of this, we are thinking of X as an algebraic group in its adjoint representation.)
Let \(\Gamma = G\psi \). We wish to apply Pink’s strong approximation theorem [20, Theorem 0.2], so we first need to replace the triple \((k_0, X, \Gamma )\) with a minimal quasimodel\((k, Y, \Gamma )\), as in [20, Sect. 3]. So in particular, \(k \subseteq k_0\) is a global field, Y is an adjoint algebraic group over k with an isogeny to X over \(k_0\) and we can think of \(\Gamma \) as a subgroup of Y(k). Then \((k, Y, \Gamma )\) satisfies [20, Assumption 0.1].
Denote by \(\mathfrak {o}\) the ring of integers of k. For a prime v of k, denote by \(k_v\) the completion of k with respect to v, and identify k with a subset of \(k_v\). Let \(\mathfrak {o}_v\) be the ring of integers of \(k_v\), and \(F_v\) the residue field of \(\mathfrak {o}_v\).
Let \(\pi : {\hat{Y}} \rightarrow Y\) denote the simply connected cover of Y, and define
By Pink’s Theorem [20, Theorem 0.2], for almost all primes v of k we have
There exists a finite extension \(k_1\) of k such that \(\Delta \le {{\hat{Y}}}(k_1)\) and \({{\hat{Y}}}\) is split over \(k_1\). For a prime w of \(k_1\), write \({{\mathcal {O}}}_w\) for the ring of integers in the completion \((k_1)_w\). Again we think of \(k_1\) as a subset of \((k_1)_w\).
Denote by \(T_1\) the set of primes w of \(k_1\) such that \(\Delta \not \le {{\hat{Y}}}({{\mathcal {O}}}_w)\), and define \(T = \{ w \cap \mathfrak {o} : w \in T_1\}\). As \(\Delta \) is finitely generated, \(T_1\) and T are finite sets.
Let V be the set of primes of k that split completely in \(k_1\). By the Chebotarev density theorem (see [7, Chapter 5]), V has positive density among the primes of k.
Let \(v \in V {\setminus } T\), and let w be a prime of \(k_1\) above v. Since v splits completely, \(k_v \cong (k_1)_w\), so we can identify \(k_1\) with a subset of \(k_v\). Then \(\Delta \le {{\hat{Y}}}(k_v)\), and since \(v \not \in T\), it follows that \(\Delta \le {{\hat{Y}}}(\mathfrak {o}_v)\). Hence by (2), for almost all such v we have \(\Delta \twoheadrightarrow {{\hat{Y}}}(F_v)\). As \({{\hat{Y}}}\) is split over \(k_1\), the image \({{\hat{Y}}}(F_v)\) is of untwisted type, and so \({{\hat{Y}}}(F_v)/Z \cong X(q)\), where \(q = F_v\) and Z is the centre of \({{\hat{Y}}}(F_v)\). Thus \(\Delta \) maps onto X(q) for all such q.
We now note that if S is a finite simple image of \(\Delta \), then S is also an image of \(\Gamma \), and hence of G. Indeed, if N is a normal subgroup of \(\Delta \) with \(\Delta /N = S\), then ZN / N is a central subgroup of S (where \(Z = Z(\Delta )\)), so \(Z \le N\). But then \(S \cong (\Delta /Z)/ (N/Z)\), which is a quotient of \(\Gamma \).
This completes the proof of Theorem 4. \(\square \)
Almost simple quotients of some unitary groups
In this section we exhibit some finitely presented groups that have infinitely many images in the set \(\{Y:\mathrm{PSU}_n(q) \le Y \le \mathrm{PGU}_n(q) \hbox { for some }q\}\), but only finitely many images \(\mathrm{PSU}_n(q)\). This explains why, at least with the methods of this paper, in Theorem 2 we are unable to replace our classes of twisted groups \({{\mathcal {X}}}^d\) (\(d>1\)) by just the simple groups in the class.
Fix \(m\ge 2\) and an algebraic number field k with \(i=\sqrt{1}\notin k.\) Denote by \(^{*}\) the nontrivial kautomorphism of k(i), and extend \(^{*}\) to an automorphism of \({\mathbb {C}}\). Define
These are the krational points of algebraic groups \(G=\mathrm {U}_{m} >G_{1}=\mathrm {SU}_{m}\) defined over k. If \(K\subseteq {\mathbb {C}}\) is a Galois extension of k with \(i\notin K\), then \(G_{1}(K)<G(K)\) are defined by (3) (with K replacing k), while if \(i\in K\) we have \(\mathrm {GL} _{m}(K)\cong G(K)>G_{1}(K)\cong \mathrm {SL}_{m}(K)\), embedded diagonally in \(\mathrm {GL}_{2m}(K).\) Suppose R is a subring of k and \(\pi :R\rightarrow F\) is a homomorphism onto a field F; then \(\pi \) induces a homomorphism \(R[i]\rightarrow F(\sqrt{1})\) and hence a homomorphism (still denoted by \(\pi \)) from \(G(R)=G(k)\cap \mathrm {GL}_{m}(R([i])\) into G(F). Here G(F) is defined by (3) where \(^{*}\) is the nontrivial Fautomorphism of F(i) if \(\sqrt{1}\notin F\), while if \(1\) is a square in F then \(G_{1}(F)\cong \mathrm {SL}_{m}(F)\) (see [21, Sect. 2.3.3]).
Let S be a finite set of primes of k and let R be the ring of Sintegers of k. Then \(R_{1}\supseteq R[i]\supseteq 2R_{1}\) where \(R_{1}\) is ring of Sintegers of k(i). For a prime \({\mathfrak {P}}\) of \(R_{1}\) with \(2 \not \in {\mathfrak {P}}\cap R={\mathfrak {p}}\) set
where \(i^{\prime }\) is a square root of \({}\) 1. Let
Let \(\pi _{{\mathfrak {p}}}:\mathrm {GL}_{m}(R_{1})\rightarrow \mathrm {GL}_{m}(E_{{\mathfrak {p}}})\) be the quotient map induced by \(R_{1}\rightarrow R_{1}/{\mathfrak {P}}\). Write \(\rho _{q}:\mathrm {U}_{m}({\mathbb {F}}_{q})\rightarrow \mathrm {PGU}_{m}({\mathbb {F}}_{q})\) for the quotient map modulo the centre.
Proposition 5.1
Assume that eitherk is not totally real, orS contains a prime \({\mathfrak {p}}\) such that \(\left R/{\mathfrak {p}}\right \equiv 1~({\text {mod}}4)\). Let
Then \(\Gamma \) is a finitely presented infinite group and the following hold.

(i)
For almost all primes \({\mathfrak {p}}\) of R,
$$\begin{aligned} G_{1}(F_{{\mathfrak {p}}})\le \Gamma \pi _{{\mathfrak {p}}}\le G(F_{{\mathfrak {p}}})\le \mathrm {G\mathrm {L}}_{m}(F_{{\mathfrak {p}}}). \end{aligned}$$ 
(ii)
If \({\mathfrak {p}}\in P_{1}\) then \(G_{1}(F_{{\mathfrak {p}}})= \mathrm {SL}_{m}(F_{{\mathfrak {p}}}).\)

(iii)
If \({\mathfrak {p}}\in P_{3}\cup P_{7}\) then \(G_{1}(F_{{\mathfrak {p}}})= \mathrm {SU}_{m}(F_{{\mathfrak {p}}})\cong \mathrm {SU}_m(q_{{\mathfrak {p}}})\) and \(G(F_{{\mathfrak {p}}})=\mathrm {U}_{m}(F_{{\mathfrak {p}}})\cong \mathrm {U}_m (q_{{\mathfrak {p}}}).\)

(iv)
If \({\mathfrak {p}}\in P_{3}\) and \(4\mid m\) then \(\Gamma \pi _{{\mathfrak {p}}}\rho _{q_{{\mathfrak {p}}}}\nleqslant \mathrm {PSU}_{m} (F_{{\mathfrak {p}}}).\)

(v)
Suppose that \(m\ge 4\). Then with at most finitely many exceptions, every finite nonabelian simple image of \(\Gamma \) is of the form \(\Gamma \pi _{{\mathfrak {p}}}\rho _{q_{{\mathfrak {p}}}}\) for some prime \({\mathfrak {p}}\) of R.

(vi)
\(P_{1}\) is infinite and \(P_{3}\cup P_{7}\) is infinite. If \(\sqrt{2}\)\(\in k\) then \(P_{7}\) is empty.
Corollary 5.2
Let \(\Gamma =G(R)\) where \(R={\mathbb {Z}}[\sqrt{2}]\) and \(4\mid m\). Then for infinitely many primes p, \(\Gamma \) has an image X satisfying
and all but finitely many of the finite simple images of \(\Gamma \) are of the form \(\mathrm {PSL}_m(p^f)\), \(f\in \{1,2\}\).
Proof of Proposition 5.1
First observe that \(\Gamma \) is an Sarithmetic group in the simple algebraic group G, hence is finitely presented [21, Theorem 5.11]. That \(\Gamma \) is infinite follows from (i).

(i)
This follows from the strong approximation theorem [21, Theorem 7.12], because \(G_{1}=\mathrm {SU}_{m}\) is a connected and simply connected algebraic group and \(G_{1,S}\) contains \(G_{1}({\mathbb {C}})\cong \mathrm {SL}_{m}({\mathbb {C}})\) if k is not totally real, or \(G_{1}(k_{{\mathfrak {p}}})\cong \mathrm {SL}_{m}(k_{{\mathfrak {p}}})\) where \({\mathfrak {p}} \in S\) splits in k(i).

(ii)
If \({\mathfrak {p}}\in P_{1}\) then \(1\) is a square in \(F_{{\mathfrak {p}}}\). Hence (ii).

(iii)
If \({\mathfrak {p}}\in P_{3}\cup P_{7}\) then \(1\) is not a square in \(F_{{\mathfrak {p}}}\). Hence (iii).

(iv)
Assume now that \({\mathfrak {p}}\in P_{3}\) and write \(q=q_{{\mathfrak {p}}}=\left F_{{\mathfrak {p}}}\right \), so \(q\equiv 3~({\text {mod}}8)\) and \(\left E_{{\mathfrak {p}}}\right =q^{2}\). Thus for \(x\in E_{{\mathfrak {p}}}\) we have \(x^{*}=x^{q}\).
Let \(g=\mathrm {diag}(\,1,1,\ldots ,1)\in \mathrm {GL}_{m}(k(i))\). Then \(g\in \Gamma \). Suppose that \(g\pi _{{\mathfrak {p}}}\rho _{q_{{\mathfrak {p}}}} \in \mathrm {PSU}_{m}(F_{{\mathfrak {p}}})\). Then there exist \(h\in \mathrm {SU}_{m}(F_{{\mathfrak {p}}})\) and \(\mu \in E_{{\mathfrak {p}}}\) such that \(\mu {\mathbf {1}}_{m}\in \mathrm {U}_{m}(F_{{\mathfrak {p}}})\) and \(\mu h=\mathrm {diag}(\,1,1,\ldots ,1)\). Thus
If \(4\mid m\) it follows that \(8\mid o(\mu )\mid q+1\) where \(o(\mu )\) is the order of \(\mu \) in \(E_{{\mathfrak {p}}}^{*}\), a contradiction.

(v)
Now assume that \(m\ge 4.\) Then \(\Gamma \) has the (weak) congruence subgroup property (see [23] or [27]). This implies that if \(N\vartriangleleft \Gamma \) and \(\Gamma /N\) is finite then \(N\ge [H,\Gamma ]\) for some principal congruence subgroup H. If also \(\Gamma /N\) is simple and nonabelian it follows that \(N\ge H\).
Now H is the kernel of the map \(\pi _{I}\) induced by \(R\rightarrow R/I\) for some ideal \(I\ne 0\) of R. Say \(I= {\textstyle \bigcap }{\mathfrak {p}}_{j}^{e_{j}}\). Each nonabelian simple quotient of \(\Gamma \pi _{I}\) is then a quotient of \(\Gamma \pi _{{\mathfrak {p}}_{j}}\) for some j. So \(\Gamma /N\) is a quotient of \(\Gamma \pi _{{\mathfrak {p}}}\) for some \({\mathfrak {p}}\).
It follows from (i), (ii) and (iii) that for almost all \({\mathfrak {p}}\), the group \(\Gamma \pi _{{\mathfrak {p}}}\) has at most one simple quotient and that quotient is \(\Gamma \pi _{{\mathfrak {p}}}\rho _{q_{{\mathfrak {p}}}}\). The claim follows.

(vi)
Observe that \({\mathfrak {p}}\in P_{1}\) if \({\mathfrak {p}}\) splits in k(i), and \({\mathfrak {p}}\in P_{3}\cup P_{7}\) if \({\mathfrak {p}}\) is inert in k(i). Hence both of these sets are infinite, by (an elementary case of) Chebotarev’s Theorem (see e.g. [21, Theorem 1.2]).
Now assume that \(\sqrt{2}\)\(\in k\), \(\sqrt{1}\)\(\notin k.\) Then \(R_{0}={\mathbb {Z}}[\sqrt{2}]\subseteq R\). Suppose \({\mathfrak {p}}\in P_{7}\), and put \({\mathfrak {p}}_{0}={\mathfrak {p}}\cap R_{0}\) and \(q_{0}=\left R_{0}/{\mathfrak {p}}_{0}\right \). Then \(2\) is a square and \(1\) is not a square in the field \(R_{0}/{\mathfrak {p}}_{0}\). This implies that \(q_{0}\equiv 3~({\text {mod}}4),\) hence that \(q_{0}=p\) is prime, and then
so \(p\equiv \pm 3~({\text {mod}}8)\). But \(q_{{\mathfrak {p}}}\) is a power of p so \(q_{{\mathfrak {p}}}\equiv 1\) or \(\pm 3~({\text {mod}}8)\), a contradiction. Hence \(P_7\) is empty.
This completes the proof. \(\square \)
References
Ax, J.: The elementary theory of finite fields. Ann. Math. 88, 239–271 (1968)
Bray, J.N., Holt, D.F., RoneyDougal, C.M.: The maximal subgroups of the lowdimensional finite classical groups. In: London Mathematical Society Lecture Note Series, vol. 407. Cambridge University Press, Cambridge (2013)
Bridson, M.R., Wilton, H.: The triviality problem for profinite completions. Invent. Math. 202, 839–874 (2015)
Carter, R.W.: Simple Groups of Lie Type. Wiley, London (1972)
Chatzidakis, Z., van den Dries, L., Macintyre, A.: Definable sets over finite fields. J. Reine Angew. Math. 427, 107–135 (1992)
Fried, M.D., Haran, D., Jarden, M.: Effective counting of the points of definable sets over finite fields. Isr. J. Math. 85, 103–133 (1994)
Fried, M.D., Jarden, M.: Field Arithmetic, Ergebnisse der Mathematik und ihrer Grenzgebiete III 11. Springer, Heidelberg (1986)
Fried, M.D., Sacerdote, G.: Solving diophantine problems over all residue class fields of a number field and all finite fields. Ann. Math. 104, 203–233 (1976)
Gorenstein, D., Lyons, R., Solomon, R.: The classification of the finite simple groups. Number 3. Part I. Chapter A. Almost simple \(K\)groups. Mathematical Surveys and Monographs, 40.3. American Mathematical Society, Providence (1998)
Hrushovski, E.: The elementary theory of the Frobenius automorphisms. Preprint, version dated July 24, 2012. www.ma.huji.ac.il/~ehud/, 149 p
Jambor, S.: An \(L_2\)quotient algorithm for finitely presented groups on arbitrarily many generators. J. Algebra 423, 1109–1142 (2015)
Jambor, S.: An \(L_3U_3\)quotient algorithm for finitely presented groups. Ph.D. Thesis, RWTH Aachen University (2012)
Larsen, M., Lubotzky, A.: Normal subgroup growth of linear groups: the \((G2, F4, E8)\)theorem. In: Algebraic Groups and Arithmetic, pp. 441–468. Tata Inst. Fund. Res, Mumbai (2004)
Liebeck, M.W., Macpherson, H.D., Tent, K.: Primitive permutation groups of bounded orbital diameter. Proc. Lond. Math. Soc. 100, 216–248 (2010)
Liebeck, M.W., Seitz, G.M.: Subgroups generated by root elements in groups of Lie type. Ann. Math. 139, 293–361 (1994)
Liebeck, M.W., Seitz, G.M.: On the subgroup structure of classical groups. Invent. Math. 134, 427–453 (1998)
Liebeck, M.W., Seitz, G.M.: On the subgroup structure of exceptional groups of Lie type. Trans. Am. Math. Soc. 350, 3409–3482 (1998)
Liebeck, M.W., Seitz, G.M.: Subgroups of exceptional algebraic groups which are irreducible on an adjoint or minimal module. J. Group Theory 7, 347–372 (2004)
Liebeck, M.W., Shalev, A.: Residual properties of the modular group and other free products. J. Algebra 268, 264–285 (2003)
Pink, R.: Strong approximation for Zariski dense subgroups over arbitrary global fields. Comment. Math. Helv. 75, 608–643 (2000)
Platonov, V.P., Rapinchuk, A.S.: Algebraic Groups and Number Theory. Academic, San Diego (1994)
Plesken, W., Fabiańska, A.: An \(L_2\)quotient algorithm for finitely presented groups. J. Algebra 322, 914–935 (2009)
Rapinchuk, A.S.: On the congruence subgroup problem for algebraic groups. Sov. Math. Dokl. 39(3), 618–621 (1989)
Ryten, M.J.: Model theory of finite difference fields and simple groups. Ph.D. Thesis, University of Leeds (2007). http://www.maths.leeds.ac.uk/pure/staff/macpherson/ryten1.pdf
Ryten, M.J., Tomašić, I.: ACFA and measurability. Sel. Math. New Ser. 11, 523–537 (2005)
Tamburini, C., Wilson, J.S.: A residual property of certain free products. Math. Z. 186, 525–530 (1984)
Tomanov, G.: On the congruencesubgroup problem for some anisotropic algebraic groups over number fields. J. Reine Angew. Math. 402, 138–152 (1989)
Tomašić, I.: Direct twisted Galois stratification. Ann. Pure Appl. Log. 169, 21–53 (2018)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Bridson, M.R., Evans, D.M., Liebeck, M.W. et al. Algorithms determining finite simple images of finitely presented groups. Invent. math. 218, 623–648 (2019). https://doi.org/10.1007/s00222019008923
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00222019008923
Mathematics Subject Classification
 Primary 20F10
 Secondary 20D06