A Note on Average Codegrees of All Proper Subgroups of Finite Groups ()
1. Introduction
All groups are finite under consideration. Let
be a group and let
be the set of complex irreducible characters of
. Some authors studied the influence of character degrees on group structure, for instance, see [1]-[4]. Qian [5] gave the definition of the codegree of a finite group as follows: for an irreducible character
, the codegree of a character
of
is defined as
. Now we have
when
, the principal character
of
. Let
denote the set of irreducible character codegrees of
, i.e.
. Some good results are gotten between codegree (degree) and group structure; see [6]-[12] for instance.
Wang, Qian, Lv and Chen studied the relation between average codegree and group structure [12]. Define
and
. Let
be the number of conjugacy classes of
. Then
.
Inspired by [12]-[14], we change the condition from “the codegree sum of a finite group” to “the codegree sums of all proper subgroups of a finite group”. In order to talk in short, the following notion is defined.
Definition 1.1. Then call
a CS-group if
.
Let
be the projective special linear group of degree 2 over a finite field of order
and
be the alternating group on
symbols. Now we give the following result.
Theorem 1.2. If
is a nonabelian simple group with
, then
is isomorphic to
or
.
Now by Theorem 1.2, we have the following corollary.
Corollary 1.3. If all subgroups of
are CS-groups, then
is solvable.
If we only consider the proper subgroups of a group
, then we introduce the definition as follows.
Definition 1.4. Let
be the set of proper nonabelian subgroups of
. Then call
an SCS-group if for every
,
is a CS-group.
Note that a non-trivial abelian group
has
as
where
is a cyclic group of order
. Thus in the hypothesis of the Definition, we only consider the non-abelian subgroups of a group.
As an application of Theorem 1.2, we also can prove the following result.
Theorem 1.5. Let
be an SCS-group. Then
is solvable.
Remark 1.6. We know from ([15], p. 2) that
,
and
are the maximal
subgroups of
and by [16],
,
and
. Thus
the condition of Theorem 1.5 “for all
,
is a CS-group” is the best possible.
Remark 1.7. We do not know whether in Theorem 1.5, the condition “
” can be changed into “
”.
Here we introduce the structure of this paper. In Section 2, we compute the
. In Section 3, some results about CS-groups are given and then prove the solvability of an SCS-group. All other symbols are standard, see [15] and [17] for instance.
2. Results for Section 3
Lemma 2.1. Let
.
(1) Let
be subnormal in
and let
be an irreducible constituent of
. Then
.
(2) For
,
.
Proof. (1) It follows from Lemma 5.11 of [17].
(2)
.
Lemma 2.2. Let
be a prime power and let
. Then
. Furthermore,
Proof. We know that for a nonabelian simple group
,
has faithful irreducible characters except for
, the principal character. By ([18], pp. 402-403), we have that, if
, then
if
, then
if
, then
This completes the proof.
3. Results
In this section, we first show the solvability of a CS-group, and then give that an SCS-group is solvable, and finally some other common-use results for character degree sums are given.
3.1. CS-Groups
In this subsection, we will prove Theorem 1.2 and Corollary 1.3. By Lemma 2.2,
and
. We will first determine the structures of CS-groups.
Theorem 3.1. Let
be a nonabelian simple group with
. Then
is isomorphic to
or
.
Proof. As
is a nonabelian simple group, we have that for all
,
. By the definition of
and Lemma 2.1, we have that
where
and the last inequality is gotten by using the well-known inequality
. Note that
, so
.
By hypothesis, we can assume that
. It follows that
as a nonabelian simple group
is of order
. Now by ([15], p. 239), the possibilities for
are
,
,
,
,
,
,
,
,
,
,
and
.
First we consider
with
. By Lemma 2.2, we have that
i.e.
It follows from
that
is equal to 5 or 7. Now by ([15], pp. 2-3), we obtain that
and
.
Now we consider these groups
,
and
. By ([15], p. 10, 13-14), we obtain that
Therefore
with
or 7.
Here we rewrite Corollary 1.3 here.
Corollary 3.2. If all subgroups of
are CS-groups, then
is solvable.
Proof. Assume the result is not true with minimal order
, then
is nonsolvable but its proper subgroups are solvable. Thus, we can assume that
is a nonabelian simple group. Now hypothesis shows that
is a CS-group and by Lemma 3.1,
is isomorphic to
or
. Thus, two cases are done within the following.
Case 1:
.
We know from ([15], p. 2) that
is a maximal subgroup of
. Now by [16],
, a contradiction.
Case 2:
.
Then by ([15], p. 3),
has
as a maximal subgroup. Now
arrives at a contradiction.
The two contradictions show that
is solvable.
We also can get the following results.
Theorem 3.3. A finite group with
is solvable.
Proof. If the result is wrong, then
is nonsolvable with minimal order
. Thus we can assume that
is a nonabelian simple group. By Theorem 3.1, we see that for a nonabelian simple group
,
has order at most 6401 with
. We can check these groups by [15] and get that
, a contradiction. Thus
is solvable.
Corollary 3.4. Let
be a nonabelian simple group. Then
.
Proof. If the theorem is not true, then
, a contradiction to Theorem 3.3.
3.2. SCS-Groups
In this subsection, we give the proof of Theorem 1.5. We first need the following result which is due to Thompson [19].
Lemma 3.5 (Corollary 1 of [19]). Every minimal simple group is isomorphic to one of the following minimal simple groups:
(1)
for
a prime;
(2)
for
an odd prime;
(3)
, for
any prime exceeding 3 such that
;
(4)
for
an odd prime;
(5)
.
In order to argue in brief, we introduce the notation
which denotes the maximal integer part of a rational number
, for example
and
. Let
where
denotes the number of
with the same
.
To control the structure of a group, we also need the following result.
Lemma 3.6. Let
be a dihedral group of order
.
(1) Let
be odd. Then
.
(2) Let
be even. Then
.
(3)
.
Table 1. Character table of
with
odd ([20], p. 182).
|
1 |
|
|
|
|
|
2 |
|
1 |
1 |
1 |
|
1 |
1 |
−1 |
|
2 |
|
0 |
|
|
|
|
In Table 1,
.
Proof. (1) By Table 1, we have that
for
, so
;
, so
; if
, then
, so
. Thus, we have
.
(2) Obviously
, so
.
We see
and
.
Now
equals to 1 + 1 when
is even or 1 when
is odd, so
.
Thus
.
To compute the kernels of the remaining irreducible characters of a group, by Table 2, we need to consider when
. As the computation methods of
and
are similar, we only consider to compute
. We divide the computation into two cases in light of
.
Table 2. Character table of
,
([20], p. 183).
|
1 |
|
|
|
|
|
|
|
|
4 |
4 |
|
1 |
1 |
1 |
1 |
1 |
|
1 |
1 |
1 |
−1 |
−1 |
|
1 |
|
|
1 |
−1 |
|
1 |
|
|
−1 |
1 |
|
2 |
|
|
0 |
0 |
|
|
|
|
|
|
In Table 2,
.
Case 1:
is even.
Then in the interval
, there are
even numbers
such that
. Thus
so
.
Therefore
.
Case 2:
is odd.
Then there are
even integers
in the interval
such that
, so
It follows that
.
Now we have
.
The lemma is complete.
Let
or
denote the set of maximal proper subgroups with regard to subgroup-order divisibility. Let
or
be the Frobenius group with kernel
and complement
respectively. In order to read easily, we write Theorem 1.5 here.
Theorem 3.7. Let
be an SCS-group. Then
is solvable.
Proof. Assume the theorem is wrong with minimal order
. Let
be a nontrivial minimal normal subgroup in
. Then
is a CS-group, and by Theorem 1.3,
is solvable. Thus
is abelian. If there is a normal subgroup
with
such that
is non-abelian simple, then
is solvable, a contradiction. It means that
. If
, then
is an SCS-group. It follows from the minimal choice of
that
solvable and so is
, a contradiction. It follows that
and that
is a minimal simple group such that its proper subgroups are solvable. Thus
is a minimal nonabelian simple group. So in the following, three cases are considered.
Case 1:
for certain
.
If
, then by ([15], p. 2-3, 5-7) and [16], we respectively have
Thus
and we can assume that
when
is odd and
when
is even, so let
,
when
is odd and
when
is even. By Lemma 3.6 and Table 3, we have that
and either
(1)
or
(2)
For the inequality (1), we have
, a contradiction. But the inquality (2) has no solution in N since
.
Table 3.
,
([21], Chap II, Theorem 8.27).
|
|
Condition |
|
|
|
|
|
|
|
|
|
|
|
,
a prime,
|
|
|
|
|
|
|
|
|
|
Case 2:
for
an odd prime.
Let
. Then by ([22], p. 385),
, and so by Lemma 3.6, we have
, so
is non-even, a contradiction.
Case 3:
.
By ([15], p. 13),
and by [16],
, a contradiction.
From the above three cases,
is solvable, the wanted result.
Acknowledgements
This work was financially supported by the National Natural Science Foundation of China (Grant No: 11871360) and by the Project of High-Level Talent of Sichuan University of Arts and Science (Grant No: 2021RC001Z).