Character degree sums in finite nonsolvable groups more

CHARACTER DEGREE SUMS IN FINITE NONSOLVABLE GROUPS KAY MAGAARD AND HUNG P. TONG-VIET abstract. Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions raised by Berkovich and Mann, and Berkovich and Zhmud'. 1. Introduction and notations All groups are finite. Let G be a group. Denote by Irr(G) the set of all complex irreducible characters of G. Let N be a normal subgroup of G. Let 0 G Irr(N) be an irreducible character of N. We say that 0 is extendible to G if there exists X € Irr(G) such that the restriction of x to JV is 0, that is \n = 0. There are many papers devoted to finding a sufficient conditions for 0 to be extendible to G (see Gallagher [7], Gagola [6] and [8, Chapter 8 and 11]). In this paper, we are interested in the existence problem, that is, assume N is a normal subgroup of G, is there any non-trivial irreducible character of N that extends to G? We are mostly concerned with nonsolvable groups. Suppose that N is a minimal normal nonabelian subgroup of a group G. In [3, Lemma 5], it is shown that there exists a nontrivial irreducible character 0 of N which is extendible to G. In Theorem 1.1 below, we will show that 0 can be chosen with 0(1) > 5. Using this result, we answer two open problems raised by Berkovich and Mann, and Berkovich and Zhmud'. Theorem 1.1. Suppose that N is a minimal normal nonabelian subgroup of a group G. Then there exists an irreducible character 9 of N such that 9 is extendible to G with 0(1) > 5. Let T(G) be the sum of degrees of complex irreducible characters of G, i.e T(G) = SX£/rr(G) x(l)- Let k(G) be the number of conjugacy classes of G and let 6(G) be the largest irreducible character degree of G. Let N be a normal subgroup of G. Denote by Irr(G, N) the set of all complex irreducible characters x of G such that N j£ Ker\ and by T(G, N) the corresponding sum of degrees of all characters in Irr(G, N). It is obvious that Irr(G) = Irr(G/N) U Irr(G,N) and T(G) = T(G/N)+T(G,N). In [1, Theorem 8], Y. Berkovich and A. Mann showed that if G is nonsolvable then T(G) > 2|G : G'| and they asked whether or not T(G) > 2T(G/N), where N is a nonsolvable normal subgroup of G. Here is our first result. Theorem 1.2. Let N be a nonsolvable normal subgroup of a group G. ThenT(G) > 6T(G/N). Date: April 15, 2010. 2000 Mathematics Subject Classification. Primary 20C15, 20D05. Key words and phrases, nonsolvable, character degree sum, conjugacy class. 1 2 KAY MAGAARD AND HUNG P. TONG-VIET This settles Question 4 in [1] or Problem 138 in [2]. By Schwarz inequality, it is easy to see that T(G)2 < \G\k(G). Hence T(G) can be used to estimate k(G). Moreover, as T(G) < k(G)b(G), we can also get a lower bound for 6(G) in terms of T(G) and k(G). The reason that we are interested in the character degree sums comes from a question of Jan Saxl ([9, Problem 9.56]) which asked for the classification of groups in which the square of every irreducible character is multiplicity free. In fact if we could prove that T(G/F(G)) < b(G/F(G))2, provided G is nonsolvable, where F(G) is the Fitting subgroup of G, then such a group in Jan Saxl's question is solvable. This will limit the possibilities for such groups. The proof for this fact is quite straight forward. Let G be a minimal counter-example to the assertion that the square of every irreducible character of G is multiplicity free but G is not solvable. We first observe that if N < G and X € Irr(G/N) then \ € Irr(G) and every irreducible constituent of x2 in G is also an irreducible character of G/N so that x2 is multiplicity free in G/N since it is multiplicity free in G. Thus G/N satisfies Saxl's condition. Secondly, for any X € Irr(G), as x2 is multiplicity free, it follows that x(l)2 = X2(l) < T{G). Now combining these two observations for the quotient group G/F(G), we obtain b(G/F(G))2 < T(G/F(G)), where b(G/F(G)) is the largest character degree of G/F(G). As G is nonsolvable and the Fitting subgroup F(G) is solvable, G/F(G) is nonsolvable. Then the inequality mentioned above would provide a contradiction. Denote by Ti(G) the sum of degrees of nonlinear irreducible characters of G. Let Irr2(G) = {x € Irr(G) | x(l) > 2} and let T2(G) be the sum of degrees of characters in Irr2(G). Observe that if G does not have any irreducible characters of degree 2 then T\(G) = T2(G), for example, this is the case if G is a nonabelian simple group. The following result is a generalization of [1, Theorem 8]. Theorem 1.3. If G is nonsolvable then T2(G) > 5|G : G'|. It is well known that a group G is abelian if and only if T(G) = k(G). The following theorem shows that the structure of G is very restricted when T(G) is small in terms of k(G). Theorem 1.4. IfT(G) < 2k(G) then G is solvable. This gives a positive answer to Problem 24 in [2]. We note that this property does not characterize the solvability of groups. In fact, let G = 32 : 2S\, which is a maximal parabolic subgroup of PSL(3, 3). We have T(G) = 50, k(G) = 11, T(G) > Ak(G) and G is solvable. Now if G = A5, then T(G) = l6,k(G) = 5, T(G) < 4k(G) and G is nonsolvable. We conjecture that a group G is solvable provided that T(G) < 3k(G). 2. Preliminaries Lemma 2.1. Let T be a non-abelian simple group. Then there exists a nontrivial irreducible character ip of T that extends to Aut{T) with y(l) > 5. This is essentially Lemma 4.2 in [10] or [3, Theorems 2,3,4]. However, the fact that ip(l) > 5 is not explicitly stated there so that we will give a proof for completeness. Proof. According to the Theorem of Classification of Finite Simple Groups, every nonabelian simple group is isomorphic to the alternating group of degree n > 7, a CHARACTER DEGREE SUMS IN FINITE NONSOLVABLE GROUPS 3 sporadic group or a finite group of Lie type. We will consider the Tits group 2i<4(2) as a sporadic rather than a finite group of Lie type. For alternating group An, n > 7, the irreducible character <p corresponding to the partition (n — 1,1) extends to Sn and <p(l) = n — 1 > 6. If T is a sporadic group, Tits group or by inspecting [4], we can see that there exists an irreducible character <p of T that extends to Aut(T) with <p(l) > 5. Finally assume T is a finite group of Lie type defined over a field of size q = , where p is prime. Choose <p to be the Steinberg character of T of degree \T\P, the order of the p-Sylow subgroup of T. Then <p is extendible to Aut(T) (see [5]). Moreover, we can easily check that \T\p > 5 provided that T ^ L2(4) = L2(5) = A5. Thus y>(l) > 5. This completes the proof. □ Lemma 2.2. (Gallagher [8, Corollary 6.17]). Let N<G and letX G Irr(G) be such that xn = $ G Irr(N). Then the characters f3X for (3 G Irr{G/N) are irreducible, distinct for distinct (3 and are all of the irreducible constituents o/t9G. 3. Proof of the Main Results Proof of Theorem 1.1. Since N is a minimal normal nonabelian subgroup of G, there exists a nonabelian simple group T such that N = T\ x T2 x • • • x Tk, where Tj = T, i = 1, • • • , k. Let <p be an irreducible character of T obtained from Lemma 2.1 and let 9 = <p x <p x • • • x <p. By [3, Lemma 5], 9 G Irr(N) and it is ex- tendible to G. As y>(l) > 5, we have 0(1) = cp(l)k > 5. The proof is now complete. □ Proof of Theorem 1.2. We argue by induction on the order of G. Assume first that N is a minimal normal subgroup of G. By Theorem 1.1, there exists an irreducible character <p of N which extends to an irreducible character \ of G with x(l) ^ 5. Now by Lemma 2.2, there is an injective map from Irr(G/N) to Irr(G, N) which maps f3 G Irr(G/N) to (3X e Irr(G,N), so that X{f)T{G/N) < T(G,N). Therefore T(G) = T{G/N) + T{G, N)>{1 + x(l))T(G/N) > 6T(G/N). Let if be a minimal normal subgroup of G which is contained in N. Then if is a proper subgroup of N. If K is solvable, then N/K is nonsolvable, and by inductive hypothesis, we have T(G) > T{G/K) > QT{{G/K)/{N/K)) = QT{G/N). If K is nonsolvable, then we can apply the result proved in the first paragraph to deduce that T(G) > 6T(G/K). As K < N, we have T(G/K) > T(G/N) so that T(G) > 6T(G/K) > 6T(G/N). The proof is now complete. □ Proof of Theorem 1.3. Let N be the last term of the derived series of G and let K be maximal among the normal subgroups of G that are contained in N. Since N = N' < G', it suffices to prove the result for G/K so that we can as- sume that K = 1 and hence N is a minimal normal nonabelian subgroup of G. By Theorem 1.1, there exists an irreducible character x G Irr(G), with x(l) > 5, and Xat = <p G Irr(N). Let = xg> ■ As -i/V = <f & Irr(N), it follows that G Irr(G') and hence xc = 4> & Irr(G') with x G Irr(G) and x(l) > 5. Now by Lemma 2.2, there is an injective map from Irr(G/G') to Irr2(G) which maps (3 G Irr(G/G') to f3X G Irr2(G), so that X(l)\G : G'\ < T2(G). Thus T2(G) > 5\G : G'\. This finishes 4 KAY MAGAARD AND HUNG P. TONG-VIET the proof. □ Proof of Theorem 1.4. By way of contradiction, assume that G is nonsolvable. Let a be the number of linear characters of G, let 6 be the number of irreducible characters of G of degree 2 and finally let c be the number of irreducible characters of degree greater than 2. We have (1) k(G) = a + b + c (2) T(G) = a + 2b + T2(G) (3) T(G) > a + 26 + 3c Since T(G) < 2k{G), it follows from (1) and (3) that a + 26 + 3c < 2a + 26 + 2c and hence (4) c < a Since T(G) < 2k(G), it follows from (1) and (2) that a + 2b + T2(G) < 2a + 26 + 2c and so T2(G) <a + 2c. Combining with (4), we obtain (5) T2(G) < 3a = 3|G : G'\. However, this contradicts Theorem 1.3. Thus G must be solvable. This completes the proof. □ Acknowledgment. The authors would like to thank the referee for the helpful comments and suggestions. These have improved our exposition and have shortened the proof of Theorem 1.1. The second author is supported by the Leverhulme Trust and is grateful to Dr. Paul Flavell for his help and support. References 1. Y. Berkovich and A. Mann, On sums of degrees of irreducible characters, J. Algebra. 199 (1998), no. 2, 646-665. 2. Y. Berkovich and E. Zhmud", Characters of finite groups, Part 2. Translations of Mathemat- ical Monographs, 181. AMS, Providence, ri, 1999. 3. M. Bianchi, D. Chillag, M. Lewis and E. Pacifici, Character degree graphs that are complete graphs, Proc. Amer. Math. Soc. 135 (2007), no. 3, 671-676. 4. J. H. Conway et al., Atlas of Finite groups, maximal subgroups and ordinary characters for simple groups, with computational assistance from J. G. Thackray, Oxford University Press, Eynsham, 1985. 5. W. Feit, Extending Steinberg characters, Linear algebraic groups and their representations (Los Angeles, CA, 1992), Contemp. Math., 153 (1993), 1-9. 6. S.M. Gagola Jr., An extension theorem for characters, Proc. Amer. Math. Soc. 83 (1981), no. 1, 25-26. 7. P.X. Gallagher, Group characters and normal Hall subgroups, Nagoya Math. J. 21 (1962), 223-230. CHARACTER DEGREE SUMS IN FINITE NONSOLVABLE GROUPS 5 8. I.M. Isaacs, Character theory of finite groups, AMS Chelsea Publishing. AMS. Province, Rhode Island, 2006. 9. V.D. Mazurov, E.I. Khukhro (Eds.), Unsolved Problems in Group Theory, The Kourovka Notebook, No. 16, Russian Academy of Sciences Siberian Division, Institute of Mathematics, Novosibirsk, 2006. 10. A. Moreto, Complex group algebras of finite groups: Brauer's problem, 1, Adv. Math. 208 (2007), no. 1, 236-248. E-mail address: K.Magaard@bham.ac.uk (K. Magaard) E-mail address: tongviet@maths.bham.ac.uk (H.P. Tong-Viet) School of Mathematics, University of Birmingham, Birmingham, B15 2TT, UK