A Note on Average Codegrees of All Proper Subgroups of Finite Groups

Abstract

Let G be a finite group and let T( G ) be the sum of codegrees of complex irreducible characters of a group G . Say f( G )= T( G ) | G | . We prove that a finite group G such that for all proper subgroup H , 1.1<f( H )<1.3 , is solvable.

Share and Cite:

Xie, W. and Liu, S. (2025) A Note on Average Codegrees of All Proper Subgroups of Finite Groups. Applied Mathematics, 16, 347-356. doi: 10.4236/am.2025.164018.

1. Introduction

All groups are finite under consideration. Let G be a group and let Irr( G ) be the set of complex irreducible characters of G . 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 χIrr( G ) , the codegree of a character χ of G is defined as

codχ= | G:kerχ | χ( 1 ) . Now we have codχ=1 when χ= 1 G , the principal character

of G . Let cd cod ( G ) denote the set of irreducible character codegrees of G , i.e. cd cod ( G )={ codχ:χIrr( G ) } . 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 T( G )= χIrr( G ) codχ and f( G )= 1 | G | χIrr( G ) codχ . Let k( G ) be the number of conjugacy classes of G . Then k( G )=| Irr( G ) | .

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 G a CS-group if 1.3>f( G )>1.1 .

Let PSL 2 ( q ) be the projective special linear group of degree 2 over a finite field of order q and A n be the alternating group on n symbols. Now we give the following result.

Theorem 1.2. If G is a nonabelian simple group with f( G )>1.1 , then G is isomorphic to A 5 or PSL 2 ( 7 ) .

Now by Theorem 1.2, we have the following corollary.

Corollary 1.3. If all subgroups of G are CS-groups, then G is solvable.

If we only consider the proper subgroups of a group G , then we introduce the definition as follows.

Definition 1.4. Let prop( G ) be the set of proper nonabelian subgroups of G . Then call G an SCS-group if for every Hprop( G ) , H is a CS-group.

Note that a non-trivial abelian group G has f( G )1.5 as f( C 3 )= 1+3+3 3 2.33 where C n is a cyclic group of order n . 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 G be an SCS-group. Then G is solvable.

Remark 1.6. We know from ([15], p. 2) that A 4 , D 10 and S 3 are the maximal

subgroups of A 5 and by [16], f( A 4 )= 11 12 , f( D 10 )= 13 10 and f( S 3 )= 5 6 . Thus

the condition of Theorem 1.5 “for all Hprop( G ) , H is a CS-group is the best possible.

Remark 1.7. We do not know whether in Theorem 1.5, the condition f( G )>1.1 can be changed into f( G )>1 ”.

Here we introduce the structure of this paper. In Section 2, we compute the T( PSL 2 ( q ) ) . 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 H<G .

(1) Let H be subnormal in G and let ψ be an irreducible constituent of χ M . Then cod( ψ )|cod( χ ) .

(2) For χIrr( G )\{ 1 G } , codχχ( 1 )+ 1 χ( 1 ) >χ( 1 ) .

Proof. (1) It follows from Lemma 5.11 of [17].

(2) cod( χ )= | G:kerχ | χ( 1 ) 1+χ ( 1 ) 2 χ( 1 ) > χ ( 1 ) 2 χ( 1 ) =χ( 1 ) .

Lemma 2.2. Let q be a prime power and let G= PSL 2 ( q ) . Then | G |= 1 ( 2,q1 ) q( q 2 1 ) . Furthermore,

T( G )={ q( q 2 +1 ), q0( mod2 ), q 3 +7 q 2 +8q+2 4 , q1( mod4 ), q 3 +7 q 2 6q+2 4 , q1( mod4 ).

Proof. We know that for a nonabelian simple group G , G has faithful irreducible characters except for 1 G , the principal character. By ([18], pp. 402-403), we have that, if q0( mod2 ) , then

T( G )=11+ 1 2 q q( q 2 1 ) q1 +1 q( q 2 1 ) q +( 1 2 q1 ) q( q 2 1 ) q+1 = q 3 +q =q( q 2 +1 ).

| G |=q( q 2 1 );

if q=1( mod4 ) , then

T( G )=1+1 q( q 2 1 )/2 q +2 q( q 2 1 )/2 ( q1 )/2 + q3 4 q( q 2 1 )/2 q+1 + q3 4 q( q 2 1 )/2 q1 =1+ q 2 1 2 +2( q 2 +q )+ 1 8 ( q3 )( q 2 q )+ 1 8 ( q3 )( q 2 +q ) = q 3 +7 q 2 +8q+2 4 .

| G |= 1 2 q( q 2 1 );

if q=1( mod4 ) , then

T( G )=1+1 q( q 2 1 )/2 q +2 q( q 2 1 )/2 ( q+1 )/2 + q5 4 q( q 2 1 )/2 q+1 + q1 4 q( q 2 1 )/2 q1 = q 3 +7 q 2 6q+2 4 .

| G |= 1 2 q( q 2 1 ).

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,

f( A 5 )= 68 60 = 17 15 and f( PSL 2 ( 7 ) )= 186 168 = 31 28 . We will first determine the structures of CS-groups.

Theorem 3.1. Let G be a nonabelian simple group with f( G )>1.1 . Then G is isomorphic to A 5 or PSL 2 ( 7 ) .

Proof. As G is a nonabelian simple group, we have that for all χIrr( G )\{ 1 G } , kerχ=1 . By the definition of f( G ) and Lemma 2.1, we have that

f( G )= 1 | G | χIrr( G ) | G:kerχ | χ( 1 ) = χIrr( G ) 1 | kerχ |χ( 1 ) = χIrr( G ) 1 χ( 1 ) =1+ χIrr( G )\{ 1 G } 1 χ( 1 ) 1+ ( k1 ) k1 | G |1 .

where k=k( G ) and the last inequality is gotten by using the well-known inequality n i=1 n 1 x i i=1 n x i 2 n . Note that k( A 5 )=5 , so

f( G )1+ ( 51 ) 51 | G |1 =1+ 8 | G |1 .

By hypothesis, we can assume that 1+ 8 | G |1 >1.1 . It follows that

60| G |6401 as a nonabelian simple group G is of order 60 . Now by ([15], p. 239), the possibilities for G are A 5 PSL 2 ( 5 ) , PSL 2 ( 7 ) , A 6 PSL 2 ( 9 ) , PSL 2 ( 11 ) , PSL 2 ( 13 ) , PSL 2 ( 17 ) , A 7 , PSL 2 ( 19 ) , PSL 2 ( 16 ) , PSL 3 ( 3 ) , PSU 3 ( 3 ) and PSL 2 ( 23 ) .

First we consider PSL 2 ( q ) with q5 . By Lemma 2.2, we have that

f( PSL 2 ( q ) )={ q 2 +1 q 2 1 1.1, ifq0( mod2 ), q 3 +7 q 2 +8q+2 2q( q 2 1 ) 1.1, ifq1( mod4 ), q 3 +7 q 2 6q+2 2q( q 2 1 ) 1.1, ifq1( mod4 ),

i.e.

0.1 q 2 2.10,ifq0( mod2 ),

1.2 q 3 7 q 2 10.2q20,ifq1( mod4 ),

1.2 q 3 7 q 2 +1.5q20,ifq1( mod4 ).

It follows from q5 that q is equal to 5 or 7. Now by ([15], pp. 2-3), we obtain that f( A 5 )= 68 60 1.13>1.1 and f( PSL 2 ( 7 ) )= 186 168 1.107>1.1 .

Now we consider these groups A 7 , PSL 3 ( 3 ) and PSU 3 ( 3 ) . By ([15], p. 10, 13-14), we obtain that

f( A 7 )= 1645 2520 0.652 1.1,

f( PSL 3 ( 3 ) )= 3305 5616 0.588 1.1,

f( PSU 3 ( 3 ) )= 5931 6048 0.98 1.1.

Therefore G PSL 2 ( q ) with q=5 or 7.

Here we rewrite Corollary 1.3 here.

Corollary 3.2. If all subgroups of G are CS-groups, then G is solvable.

Proof. Assume the result is not true with minimal order | G | , then G is nonsolvable but its proper subgroups are solvable. Thus, we can assume that G is a nonabelian simple group. Now hypothesis shows that G is a CS-group and by Lemma 3.1, G is isomorphic to A 5 or PSL 2 ( 7 ) . Thus, two cases are done within the following.

Case 1: A 5 .

We know from ([15], p. 2) that A 4 is a maximal subgroup of A 5 . Now by [16], f( A 4 )= 11 12 1.1 , a contradiction.

Case 2: PSL 2 ( 7 ) .

Then by ([15], p. 3), PSL 2 ( 7 ) has S 4 as a maximal subgroup. Now f( S 4 )= 22 24 1.1 arrives at a contradiction.

The two contradictions show that G is solvable.

We also can get the following results.

Theorem 3.3. A finite group with f( G )> 17 15 is solvable.

Proof. If the result is wrong, then G is nonsolvable with minimal order | G | . Thus we can assume that G is a nonabelian simple group. By Theorem 3.1, we see that for a nonabelian simple group G , G has order at most 6401 with

f( G )> 17 15 >1.1 . We can check these groups by [15] and get that f( G ) 17 15 , a contradiction. Thus G is solvable.

Corollary 3.4. Let G be a nonabelian simple group. Then f( G ) 17 15 .

Proof. If the theorem is not true, then f( G )> 17 15 , 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) PSL 2 ( 2 p ) for p a prime;

(2) PSL 2 ( 3 p ) for p an odd prime;

(3) PSL 2 ( p ) , for p any prime exceeding 3 such that p 2 +10( mod5 ) ;

(4) Sz( 2 p ) for p an odd prime;

(5) PSL 3 ( 3 ) .

In order to argue in brief, we introduce the notation [ x ] which denotes the maximal integer part of a rational number x , for example [ π ]=4 and [ π ]=3 . Let

ker m ( G )={ [ 1 G ( 1 ),| G |,1 ],[ χ 1 ( 1 ),| ker χ 1 |, m 1 ],,[ χ s ( 1 ),| ker χ s |, m s ] }

where m i denotes the number of χ i Irr( G ) with the same | ker χ i | .

To control the structure of a group, we also need the following result.

Lemma 3.6. Let D 2n be a dihedral group of order 2n .

(1) Let n be odd. Then

ker m ( D 2n )={ [ 1,2n,1 ],[ 1,n,1 ],[ 2,1, n1 2 ] } .

(2) Let n be even. Then

ker m ( D 2n )={ [ 1,2n,1 ],[ 1,n,1 ],[ 2, ( 3+ ( 1 ) j )/2 , n 2 1 ] } .

(3) T( D 2n )=1+2+22+ j=1 [ n 2 ]1 2n 3+ ( 1 ) j .

Table 1. Character table of D 2n with n odd ([20], p. 182).

g i

1

a r ( 1r ( n1 )/2 )

b

| C D 2n ( g i ) |

2n

n

2

χ 1

1

1

1

χ 2

1

1

−1

ψ j

2

ε jr + ε jr

0

( 1j ( n1 )/2 )

In Table 1, ε= e 2πi/n .

Proof. (1) By Table 1, we have that χ 1 ( g )= χ 1 ( 1 ) for gG , so ker χ 1 =G ; χ 2 ( a r )= χ 2 ( 1 ) , so | ker χ 2 |=1+ 2n n n1 2 =n ; if ψ j ( g )= ψ i ( 1 ) , then g=1 , so ker ψ j =1 . Thus, we have

T( D 2n )=1+ ( 2n/n ) χ 2 ( 1 ) + 1j ( n1 )/2 ( 2n/1 ) ψ j ( 1 ) =3+n n1 2 .

(2) Obviously ker χ 1 =G , so cod χ 1 =1 .

We see | ker χ 2 |=1+1+ 2n n ( m1 )=2m=n and cod χ 2 = ( 2n/n ) 1 =2 .

Now | ker ψ j | equals to 1 + 1 when j is even or 1 when j is odd, so

| ker ψ j |=1+ 2n 2n ( 1+ ( 1 ) j )/2 .

Thus cod ψ j = 2n 3+ ( 1 ) j .

To compute the kernels of the remaining irreducible characters of a group, by Table 2, we need to consider when ( 1 ) k =1 . As the computation methods of ker χ 3 and ker χ 4 are similar, we only consider to compute ker χ 3 . We divide the computation into two cases in light of m .

Table 2. Character table of D 2n , n=2m ([20], p. 183).

g i

1

a m

a r ( 1rm1 )

b

ab

| C D 2n ( g i ) |

2n

2n

n

4

4

χ 1

1

1

1

1

1

χ 2

1

1

1

−1

−1

χ 3

1

( 1 ) m

( 1 ) r

1

−1

χ 4

1

( 1 ) m

( 1 ) r

−1

1

ψ j

2

2 ( 1 ) j

ε jr + ε jr

0

0

( 1jm1 )

In Table 2, ε= e 2πi/n .

Case 1: m is even.

Then in the interval [ 1,m1 ] , there are [ m1 2 ] even numbers r such that ( 1 ) r =1 . Thus

| ker χ 3 |=1+ 2n 2n + 2n n [ n 2 1 2 ]+ 2n 4 =2+2( n4 4 )+ n 2 =n.

so cod χ 3 =2=cod χ 4 .

Therefore T( D 2n )=1+2+22+ j=1 n 2 1 2n 3+ ( 1 ) j .

Case 2: m is odd.

Then there are [ m1 2 ] even integers r in the interval [ 1,m1 ] such that ( 1 ) r =1 , so

| ker χ 3 |=1+ 2n n [ m1 2 ]+ 2n 4 =1+2( m1 2 )+ n 2 =n.

It follows that cod χ 3 =2=cod χ 4 .

Now we have T( D 2n )=1+2+22+ j=1 n 2 1 2n 3+ ( 1 ) j .

The lemma is complete.

Let maxG or max( G ) denote the set of maximal proper subgroups with regard to subgroup-order divisibility. Let F:Q or | F |:| Q | be the Frobenius group with kernel F and complement Q respectively. In order to read easily, we write Theorem 1.5 here.

Theorem 3.7. Let G be an SCS-group. Then G is solvable.

Proof. Assume the theorem is wrong with minimal order | G | . Let Hprop( G ) be a nontrivial minimal normal subgroup in G . Then H is a CS-group, and by Theorem 1.3, H is solvable. Thus H is abelian. If there is a normal subgroup K with H<K<G such that K/H is non-abelian simple, then K is solvable, a contradiction. It means that K=G . If H>1 , then G/H is an SCS-group. It follows from the minimal choice of G that G/H solvable and so is G , a contradiction. It follows that H=1 and that G is a minimal simple group such that its proper subgroups are solvable. Thus G is a minimal nonabelian simple group. So in the following, three cases are considered.

Case 1: PSL 2 ( q ) for certain q .

If q{ 5,7,9,11 } , then by ([15], p. 2-3, 5-7) and [16], we respectively have

f( D 10 )= 13 10 =1.3 < 1.3, D 10 max PSL 2 ( 5 ),

f( 7:3 )=1 1.1,7:3max PSL 2 ( 7 ),

f( 3 2 :4 )= 31 36 1.1, 3 2 :4max PSL 2 ( 9 ),

f( 11:5 )= 43 55 1.1,11:5max PSL 2 ( 11 ).

Thus q5,7,9,11 and we can assume that q13 when q is odd and q8 when q is even, so let n= q±1 k , n6 when q is odd and n7

when q is even. By Lemma 3.6 and Table 3, we have that D 2( q±1 )/k max PSL 2 ( q ) and either

1.1< n 2 n+6 4n <1.3 (1)

or

1.1< 7+ j=1 n 2 1 2n 3+ ( 1 ) j 2n <1.3. (2)

For the inequality (1), we have n=4 6 , a contradiction. But the inquality (2) has no solution in N since n6 .

Table 3. PSL 2 ( q ) , q5 ([21], Chap II, Theorem 8.27).

max PSL 2 ( q )

Condition

C 1

E q : C ( q1 )/k

k=gcd( q1,2 )

C 2

D 2( q1 )/k

q{ 5,7,9,11 }

C 3

D 2( q+1 )/k

q{ 7,9 }

C 5

PSL 2 ( q 0 ).( k,b )

q= q 0 b , b a prime, q 0 2

C 6

S 4

q=p±1( mod8 )

A 4

q=p3,5,13,27,37( mod40 )

S

A 5

q±1( mod10 ), F q = F p [ 5 ]

Case 2: Sz( 2 p ) for p an odd prime.

Let q= 2 p . Then by ([22], p. 385), D 2( q1 ) maxSz( q ) , and so by Lemma 3.6, we have 1.1< (q1) 2 ( q1 )+6 4( q1 ) <1.3 , so q=5 is non-even, a contradiction.

Case 3: PSL 3 ( 3 ) .

By ([15], p. 13), 13:3max PSL 3 ( 3 ) and by [16], f( 13:3 )= 59 39 1.5 1.3 , a contradiction.

From the above three cases, G 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).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Akhlaghi, Z. (2024) On the Average Degree of Linear and Even Degree Characters of Finite Groups. Ricerche di Matematica, 73, 2385-2395.
https://doi.org/10.1007/s11587-022-00750-0
[2] Eskandari, E. and Ahanjideh, N. (2023) On p-Solvability and Average Character Degree in a Finite Group. Bulletin of the Australian Mathematical Society, 109, 507-511.
https://doi.org/10.1017/s0004972723000722
[3] Herzog, M., Longobardi, P. and Maj, M. (2023) On Groups with Average Element Orders Equal to the Average Order of the Alternating Group of Degree 5. Glasnik Matematicki, 58, 307-315.
https://doi.org/10.3336/gm.58.2.10
[4] Moretó, A. (2023) The Average Character Degree of Finite Groups and Gluck’s Conjecture. Journal of Group Theory, 26, 803-815.
https://doi.org/10.1515/jgth-2022-0120
[5] Qian, G., Wang, Y. and Wei, H. (2007) Co-Degrees of Irreducible Characters in Finite Groups. Journal of Algebra, 312, 946-955.
https://doi.org/10.1016/j.jalgebra.2006.11.001
[6] Gintz, M., Kortje, M., Laurence, M., Liu, Y., Wang, Z. and Yang, Y. (2022) On the Characterization of Some Non-Abelian Simple Groups with Few Codegrees. Communications in Algebra, 50, 3932-3939.
https://doi.org/10.1080/00927872.2022.2049807
[7] Hung, N.N. and Moretó, A. (2025) The Codegree Isomorphism Problem for Finite Simple Groups II. The Quarterly Journal of Mathematics, 76, 237-250.
https://doi.org/10.1093/qmath/haaf001
[8] Lewis, M.L. and Yan, Q. (2025) On the Sum of Character Codegrees of Finite Groups. Monatshefte für Mathematik, 206, 143-160.
https://doi.org/10.1007/s00605-024-02033-2
[9] Li, P. and Qu, H. (2024) Finite p-Groups with Three Character Codegrees. Communications in Algebra, 52, 4149-4154.
https://doi.org/10.1080/00927872.2024.2342544
[10] Liu, S. (2023) Finite Groups Whose Numbers of Real-Valued Character Degrees of All Proper Subgroups Are at Most Two. Proceedings of the Bulgarian Academy of Sciences, 76, 990-998.
https://doi.org/10.7546/crabs.2023.07.02
[11] Qian, G. (2025) Finite Groups with Non-Complete Character Codegree Graphs. Journal of Algebra, 669, 75-94.
https://doi.org/10.1016/j.jalgebra.2025.01.022
[12] Wang, Z., Qian, G., Lv, H. and Chen, G. (2023) On the Average Codegree of a Finite Group. Journal of Algebra and Its Applications, 23, Article 2450102.
https://doi.org/10.1142/s0219498824501020
[13] Liu, S. (2022) Finite Groups for Which All Proper Subgroups Have Consecutive Character Degrees. AIMS Mathematics, 8, 5745-5762.
https://doi.org/10.3934/math.2023289
[14] Liu, S. and Tang, X. (2022) Nonsolvable Groups Whose Degrees of All Proper Subgroups Are the Direct Products of at Most Two Prime Numbers. Journal of Mathematics, 2022, Article 1455299.
https://doi.org/10.1155/2022/1455299
[15] Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A. and Wilson, R.A. (1985) Atlas of Finite Groups. Oxford University Press.
[16] Breuer, T. (2012) The GAP Character Table Library, Version 1.3.9.
http://www.math.rwth-aachen.de/homes/Thomas.Breuer/ctbllib
[17] Isaacs, I.M. (1994) Character Theory of Finite Groups. Dover Publications, Inc.
[18] Jordan, H.E. (1907) Group-Characters of Various Types of Linear Groups. American Journal of Mathematics, 29, 387-405.
https://doi.org/10.2307/2370015
[19] Thompson, J.G. (1968) Nonsolvable Finite Groups All of Whose Local Subgroups Are Solvable. Bulletin of the American Mathematical Society, 74, 383-437.
https://doi.org/10.1090/s0002-9904-1968-11953-6
[20] James, G. and Liebeck, M. (2001) Representations and Characters of Groups. 2nd Edition, Cambridge University Press.
https://doi.org/10.1017/cbo9780511814532
[21] Huppert, B. (1967) Endliche Gruppen. I. Die grundlehren der mathematischen wissenschaften. Vol. 134, Springer-Verlag.
[22] Bray, J.N., Holt, D.F. and Roney-Dougal, C.M. (2013) The Maximal Subgroups of the Low-Dimensional Finite Classical Groups. Cambridge University Press.
https://doi.org/10.1017/cbo9781139192576

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.