Recognition by Spectrum of Some Finite Simple Linear Groups over Fields of Characteristic 5 ()
1. Introduction
Within group theory, quantity is an interesting subject and also occupies an important position. Examples include the order of a group, the order of an element, the element of maximum order in a group, and the set of orders of its elements, and so on. Early results show that we can determine the type of a group using quantities alone. A celebrated result is the Feit-Thompson theorem: every finite group of odd order is solvable. Since the classification of finite simple groups was completed, the quantitative properties within simple groups have become highly interesting. In a recent paper [1], finite simple groups without elements of order 10 are obtained. And then, finite non-solvable groups without elements of order 10 and finite groups without elements of order 10 are obtained successively ([2] and [3]).
All groups in this paper are finite, and all simple groups are nonabelian. For a finite group
,
stands for the set of prime divisors of the order of
, and
denotes its spectrum, namely the set of orders of elements of
. Since
is closed under divisibility, it is uniquely determined by the subset
of maximal elements of
under divisibility.
The spectrum
of a finite group
defines its Gruenberg-Kegel graph
. The vertex set of
is
, and two primes
are adjacent whenever G contains an element of order pq. Clearly,
uniquely determines
. Hence,
implies
.
A finite group
is called quasi-recognizable by spectrum if every finite group
satisfying
possesses a unique nonabelian composition factor isomorphic to
. A finite group
is recognizable by spectrum provided that any finite group
with
is isomorphic to
. Equivalently,
is recognizable if
, where
denotes the number of pairwise non-isomorphic finite groups
with
. By a well-known observation of W. J. Shi, a finite group admitting a nontrivial normal soluble subgroup cannot be recognizable. Therefore, the recognizability problem is of interest mainly for groups with trivial soluble radical, especially for simple and almost simple groups.
Let S be a finite simple group of Lie type of characteristic
, and let A be an abelian
-group equipped with an S-action. An element
is said to be unisingular on A if
has a nonzero fixed point on A. The group S is called unisingular if every element
acts unisingularly on every finite abelian
-group A admitting an S -action.
In [4], finite simple linear groups over fields of characteristic 2 are recognized by spectrum. Applying the adjacency criterions of finite simple groups ([5] and [6]), we solve the recognizability problem for simple groups of type
, which is the goal of this paper. This work enriches the existing body of research on the recognition of finite simple groups by spectrum.
For prime
, if the Gruenberg-Kegel graph of simple group
is disconnected ([7] Table 2a-2c), then
. After treating with them separately, we draw the following conclusions:
Theorem 1. Let
be a finite simple group with disconnected Gruenberg-Kegel graph. Then
is recognizable by spectrum whenever
.
The following conclusion is an immediate consequence of the known results.
Theorem 2. Let
be a finite simple group with disconnected Gruenberg-Kegel graph. Then
is recognizable by spectrum for
, quasi-recognizable by spectrum for
, and satisfies
for
.
2. Preliminary Results
This section contains several auxiliary results required in the sequel.
Gruenberg and Kegel obtained the following description of finite groups with disconnected graph
, which was summarized in ([8] Lemma 1).
Lemma 2.1 (Gruenberg-Kegel Theorem). If G is a finite group with disconnected graph
, then one of the following holds:
(a)
,
is a Frobenius group;
(b)
,
is a 2-Frobenius group;
(c) Let K denote a nilpotent normal subgroup of
. Then there exists a non-abelian simple group S satisfying
; moreover,
and
are
-groups, the graph
is disconnected,
, and for every
,
, there exists
satisfying
such that
.
A more constructive result, which generalizes the Gruenberg-Kegel theorem in a certain sense, was obtained in [5].
Lemma 2.2 ([5] Corollary 7.2). Let L be a finite non-abelian simple group other than
and
with
satisfying
. Let
be a finite group with
, and K denote the maximal normal soluble subgroup of G. Then there exists a finite nonabelian simple group S satisfying
. Moreover,
, and one of the following statements holds:
(1)
or
for some odd
, and
.
(2) Each prime
non-adjacent to 2 in
satisfies that the Sylow p-subgroup of G is isomorphic to the Sylow p-subgroup of S. In particular,
.
For a finite group, we write
for some independent set in
(containing
) with a maximal number of vertices, and put
and
. Let
denote the number of connected components of
, and let
be its
th connected component for
. For any even order group G, we adopt the convention that
. For each
, let
(resp.
) be the collection of all
(resp. all
) such that every prime divisor of
lies in
. The symbol
stands for the integral part of
.
Lemma 2.3 ([7], Lemma 1.1). Let G be a finite simple group whose graph
is disconnected. Then
is a singleton for
. Write
for the unique element in
whenever
. The group
, the value
, and
with
are listed in Tables 1-3, where p stands for an odd prime.
Let q be a natural number and r an odd prime satisfying
. We write
for the minimal positive integer number
such that
. If q is odd, we set
when
and
when
. An odd prime
with
is called a primitive prime divisor of
, denoted by
. Zsigmondy proved the existence of such a prime in [9].
Lemma 2.4 ([10], Lemma 1). Suppose G is a finite group and
. Assume
is a Frobenius group with kernel F and a cyclic complement C. If
and
, then there exists a prime divisor
of
such that
.
3. Proof of Theorem 1
In this section, we investigate the spectrum recognizability of the simple group
whose Gruenberg-Kegel graph is disconnected, which is stated in Theorem 1.
At first we assume the following hypothesis:
Let
where
, and suppose
is a finite group satisfying
. Then
,
,
,
,
and
.
By Lemma 2.1 and Lemma 2.2, if
denotes the maximal normal soluble subgroup of
, then there exists a finite non-abelian simple group
such that
. Furthermore,
, and
for some
with
.
By Lemma 2.3, the group
, the value
and
with
are listed in the following Table 1.
Table 1. Finite simple groups G satiffying
,
and
.
All
(
) are quoted from the three tables above and will not be reproduced unless required.
Suppose
. For every prime
, we have
([6] Lemma 2.2). Let
=
and
=
denote these factor groups. Then
is a nontrivial r-group. Write
for the Frattini subgroup of
, and define the factor groups
and
. As
, the relation
implies
. It follows that we are allowed to replace G and K by
and
, respectively. After this reduction, we may assume that K is a nontrivial elementary abelian
-group ([4], Proposition 1).
Lemma 3.1.
is not isomorphic to any sporadic groups.
Proof. When
is a sporadic group, we have
, then
is not isomorphic to any sporadic groups by Table 1.
Since
, we have
. Thus the second statement of Lemma 2.2 holds, then
and
. We now examine all possibilities for the non-abelian simple group
listed in Table 1.
Lemma 3.2.
.
Proof. Let
, then at least one prime among
equals
. Since
, we have
and
. On the other hand,
and
, then
. So
and
, then
is adjacent to 5 in
([5], Proposition 1.1). However they are non-adjacent in
, we obtain a contradiction.
.
Lemma 3.3.
is not isomorphic to any simple exceptional groups of Lie type.
Proof. Let
, then
, therefore
. However in this case where
, a contradiction.
Let
, then
, therefore
. And since
, then
.But in this case,
is not disconnected since
does not divisible
, a contradiction by Table 1.
Let
, then
, therefore
. If
, then
, a contradiction. If
, then
, we obtain a contradiction by
.
Let
, then
, therefore
or 5. By
,
and
or 3, then
and
. If
, then
, a contradiction. Thus
, then
for
. And since
includes a Frobenius subgroup with kernel of order 13 and cyclic complement of order 6, then
, a contradiction.
Let
or
, then
, therefore
. If p = 3, then
, however
, a contradiction. If p = 5, then
. Since
, we have
, a contradiction. Thus p = 7, and
. However the equation
admits no solutions ([11] Theorem 3), a contradiction.
Let
be isomorphic to a finite simple Suzuki or Ree group, then
, therefore
. However in this case the equation
admits no solutions, a contradiction ([11], Theorem 7).
Lemma 3.4.
is not isomorphic any group of
,
or
.
Proof. If
or
, then
by the condition
, with
a prime. Then
, and this equation admits no solutions whenever
([11], Theorem 7).
If
, then
by Table 1 and
, where
is even. Obviously, when
, the equation
has no solutions. And for
, the equation has also no solutions ([11] Theorem 1).
If
, then
or
by Table 1 and
. Obviously, since
, we have
; otherwise,
, which has no solutions whenever p > 3 ([11] Theorem 7). When
, by
, we infer that
, i.e.,
. Noticing that
implies
([10] Theorem 5), we have
. Suppose
and
, then K can taken as an element abelian
-group. Suppose that
. Since
is normal in
and
is simple, we have
. Therefore
. However
is non-adjacent to any other primes in
, a contradiction. Thus
and S acts faithfully on
. If
, then S acts unisingularly on K ([12] Theorem 1.3). Denote the natural semidirect product
by
, then
. Denote by
the order of an element
. Let
and
such that
and
, then
and
, therefore
, a contradiction. If
, then S includes a Frobenius subgroup with kernel of order
and cyclic complement of order
. Therefore
, a contradiction. Thus
, i.e., S = G. However
and
, we obtain a contradiction. Then
.
Lemma 3.5.
.
Proof. Suppose false. Let
where
and
, then the group
is one of the groups in the following list by Table 1:
, where
and
is even;
, where
is an odd prime,
;
, where n is an odd prime,
;
, where n is an odd prime;
, where n is an odd prime,
,
.
In this case
for
. We have
, therefore
by
. When
and
, we have
or
. If
, then
, which is impossible. If
, we have
, which is also impossible. Similarly, we infer that
or 4 for
. Thus we have p < 11. Let p = 5, then
or
by
. However in this case,
, a contradiction. Similarly we can exclude
. Similarly
isn’t isomorphic to any other case.
When
, by
, we infer that
, i.e.,
.
Thus the Lemma is proved.
Lemma 3.6.
Proof. By Lemma 2.2, we obtain
.
Suppose
, then
may be assumed to be an elementary abelian
-group with
. Let
, then the group
acts unisingular on
, so
, which is a contradiction. Hence
, and
. However
is non-adjacent to any other prime in
, which gives another contradiction. Therefore
, and
.
If
, then there exists an order-2 graph automorphism β such that
([13] Theorem 5). Consider
, the centralizer of β in S. Since
([5] Table 4.5.2), we deduce that
, which yields a contradiction. Consequently,
.
By virtue of Lemmas 3.1-3.6 above, the proof of Theorem 1 is now complete.
Grechkoseeva and Zvezdina investigated the spectrum recognition problem for simple classical groups
and
over finite fields of odd characteristic (see [14]). They proved that every finite group isospectral to
is almost simple with socle
, so
is quasi-recognizable. In particular,
is only known to be quasi-recognizable, and the pure spectrum-recognition remains open for this group. Mazurov showed in [10] that
. Hence, the spectrum-recognition problem for all simple groups
is fully settled, and Theorem 2 is proved.