Zeros and roots of unity in character tables
Abstract.
For any finite group , Thompson proved that, for each , is a root of unity or zero for more than a third of the elements , and Gallagher proved that, for each larger than average class , is a root of unity or zero for more than a third of the irreducible characters . We show that in many cases “more than a third” can be replaced by “more than half”.
Key words and phrases:
Zeros, roots of unity, characters1991 Mathematics Subject Classification:
20C151. Introduction
For any finite group , let
and let
Burnside proved that each with has at least one zero, P. X. Gallagher proved that each with is a zero of at least one , J. G. Thompson proved that
and Gallagher proved that
The proofs run by taking the relations () and , applying the elements of the Galois group , averaging over , and using that the average over of is for any nonzero algebraic integer , or using the fact, due to C. L. Siegel, that the average over of is for any algebraic integer which is neither a root of unity nor zero, cf. [1, 3, 4, 11]. For certain groups, there are also strong asymptotic results about zeros due to Gallagher, M. Larsen, and the author [5, 8, 10].
Are the lower bounds of for and for the best possible?
Question 1.
What is the greatest lower bound of ?
Question 2.
What is the greatest lower bound of ?
The author suspects that the answers to these questions are both . In particular, we propose the following:
Conjecture 1.
and are for every finite group .
We establish the conjecture for all finite nilpotent groups by establishing a much stronger result about zeros for this family of groups, which includes all -groups. The number of -groups of order was shown by G. Higman [6] and C. C. Sims [12] to equal with , and it is a folklore conjecture that almost all finite groups are nilpotent in the sense that
which, in view of our result, would mean that Conjecture 1 holds for almost all finite groups.
Conjecture 1 is readily verified for rational groups, such as Weyl groups, and all groups of order , and although for certain dihedral groups, the second inequality is strict in all known cases. The author suspects that both inequalities are strict for all finite simple groups:
Conjecture 2.
and are for every finite simple group .
2. Nilpotent groups
We begin with our results on finite nilpotent groups.
Theorem 1.
For each finite nilpotent group , and each with , for more than half of the elements .
Theorem 2.
Let be a finite nilpotent group, and let .
If , then
for more than half of the nonlinear .
If ,
then for at least half of the nonlinear .
Corollary 3.
and are whenever is nilpotent.
The key ingredient in the proof of Theorems 1 and 2 is Theorem 8, which will replace the result of Siegel used by Thompson and Gallagher. Its proof relies on some auxiliary results of independent interest and is based on arithmetic in cyclotomic fields.
For each positive integer , we denote by a primitive -th root of unity. For any algebraic integer contained in some cyclotomic field, we denote by the least integer such that is a sum of roots of unity, by the least positive integer such that , and by the normalized trace
so for any cyclotomic field containing ,
Lemma 4.
Let and be rational integers, and let and be -th roots of unity with prime and nonnegative. If
then
Proof of Lemma 4.
If , then there is nothing to prove, so assume . Let be a primitive -th root of unity. For each and , let and be nonnegative integers such that and . Put
Then , so is divisible in by the cyclotomic polynomial
Hence . ∎
Proposition 5.
Let be a finite group, let , and let be an element of with order a power of a prime . If or , then either , is a root of unity, or .
Proof of Proposition 5.
Suppose that or . Let be the order of , and let be a primitive -th root of unity, so . Let with such that
(1) |
We will show that either , is a root of unity, or .
Let . Using , then divides . If , then is rational and the conclusion follows. If is divisible by , then for a primitive -th root of unity, is uniquely of the shape
(2) |
the are algebraic integers, and a straightforward calculation [2, p. 115] shows that is at least the number of nonzero . By (1), at least two of the are nonzero. Hence if .
It remains to consider the case . Since , we must have . If , then ; if , then is a root of unity; and if , then by a result of Cassels [2, Lemma 3]. So assume . Then by [9, Thm. 1(i)], can be written in the shape
where and are -th roots of unity. If , then either or . So assume
By Lemma 4,
(3) |
By (3) and the fact that ,
Hence, for some root of unity and primitive -th root of unity ,
Hence
Lemma 6.
Let be a finite group, let , and let be an element of with order a power of a prime . If , then is not a root of unity.
Proof of Lemma 6.
Let be the order of , so , and suppose that is a root of unity. Since the roots of unity in a given cyclotomic field are the -th roots of unity for the least common multiple of and , we then have
for some and -th root of unity . So by Lemma 4, either or . ∎
Lemma 7.
Let be a finite group of prime-power order, let , and let . If , then either or .
Proof of Lemma 7.
For any character of a finite group, let
Theorem 8.
Let be a finite nilpotent group, let , and let . Then
(4) |
Proof of Theorem 8.
If , then , so assume . Since is nilpotent, it is the direct product of its nontrivial Sylow subgroups . Let be the unique sequence with and
For each , let be the unique irreducible constituent of the restriction of to . Then
(5) |
(6) |
(7) |
and
(8) |
For any algebraic integers and with , we have and , and hence
(9) |
(10) |
where denotes the number of characters with . From (5), (6), and (7), is equal to the number of prime divisors of . ∎
Proposition 9.
For each finite nilpotent group , and each ,
(11) |
Proof of Proposition 9.
Proof of Theorem 2.
3. Simple groups
We now establish Conjecture 2 for several families of simple groups.
Theorem 10.
Let .
-
I.
For , we have
(19) -
II.
For with , we have
(20) and
(21) so and
(22) -
III.
For with a prime power, we have .
-
IV.
For , we have .
-
V.
For each sporadic group , we have .
-
VI.
For each finite simple group of order , we have .
Corollary 11.
.
Proof of Corollary 11.
Verification of I.
(19) holds up to , so assume . In the character table of , the values are rational integers, except some values with
for some partition of into distinct odd parts . Since , it follows that each pair satisfies
(23) |
Using (23) and the fact that simple groups do not have irreducible characters of degree 2, we get that each nonprincipal satisfies
(24) |
and from (24) it follows that . Similarly, for any class with , we have
and hence . ∎
Verification of II.
Let , , , and , so
Maintaining the notation of Suzuki [13], there are elements such that each element of can be conjugated into exactly one of the sets
where (), and the irreducible characters of are given by the following table [13, Theorem 13]:
Here, , , , ,
(25) |
and and are certain characters on and . The ’s satisfy
(26) |
and denoting by () the set of elements that can be conjugated into , we have
(27) |
where and .
Let with and . Then
and
Since , and , it follows that
(28) |
So for any ,
(29) |
and for any ,
(30) |
Verification of III.
Let with prime, , let and be as in [7, pp. 402–403], and let (resp. ) be the set of nonidentity elements that can be conjugated into (resp. ).
Assuming first , then
(33) | ||||||
(34) |
and consists of 3 classes: , , , with . Inspecting Jordan’s table [7, p. 402], each satisfies either
-
(i)
on , or
-
(ii)
on and on or .
If , then
(35) |
and if , then . So . Similarly,
and for (resp. ) and , we have away from the irreducible characters of degree (resp. the characters of degree ), from which it follows that .
For , we have , ,
(36) |
and consists of 2 classes: and with . The irreducible characters of are given by Jordan [7, p. 403]. There is the principal character, character of degree , characters of degree , and characters of degree . All the characters satisfy on , the character of degree is on and , the characters of degree vanish on , and the characters of degree vanish on . From this, it follows that and are . ∎
Verification of IV.
Let be a positive integer, , , and , so
The irreducible characters of are given by Ward [14] in a 16-by-16 table, with the last 6 rows being occupied by 6 families of exceptional characters, the sizes of which are, from top to bottom,
From Ward’s table, we find that for any class , for more than half of the irreducible characters of . Since the classes all have size , we conclude that .
The first step in verifying is to compute the following table:
1 | |
Then with Table 1 and Ward’s table in hand, a straightforward check establishes that, for each ,
Hence . ∎
Verification of V and VI
Here, in Tables 2 and 3, we report the values of and for sporadic groups and simple groups of order . All values are rounded to the number of digits shown.
0.7290 | 0.8000 | |
0.7955 | 0.8667 | |
0.7117 | 0.8333 | |
0.6827 | 0.7647 | |
0.6913 | 0.7692 | |
0.5583 | 0.6000 | |
0.6373 | 0.6190 | |
0.5840 | 0.7143 | |
0.6925 | 0.7903 | |
0.8739 | 0.8515 | |
0.8347 | 0.8333 | |
0.7528 | 0.8333 | |
0.8029 | 0.8769 |
0.8328 | 0.8469 | |
0.8808 | 0.8056 | |
0.7853 | 0.8750 | |
0.6722 | 0.8333 | |
0.7088 | 0.7576 | |
0.8517 | 0.8333 | |
0.8141 | 0.8372 | |
0.6830 | 0.8667 | |
0.6362 | 0.7593 | |
0.7879 | 0.8491 | |
0.7978 | 0.8750 | |
0.8812 | 0.8587 | |
0.8855 | 0.8711 |
0.6736 | 0.8333 | |
0.7049 | 0.8571 | |
0.6000 | 0.8000 | |
0.8713 | 0.9000 | |
0.6892 | 0.7273 | |
0.7103 | 0.8571 | |
0.6754 | 0.8667 | |
0.6433 | 0.7037 | |
0.8867 | 0.8333 | |
0.6235 | 0.7273 | |
0.7121 | 0.9000 | |
0.8321 | 0.9130 | |
0.6501 | 0.6471 | |
0.5701 | 0.6786 | |
0.6741 | 0.7586 | |
0.6911 | 0.8621 |
0.7038 | 0.7778 | |
0.8041 | 0.9149 | |
0.6650 | 0.7083 | |
0.7006 | 0.8182 | |
0.5488 | 0.6000 | |
0.6237 | 0.6739 | |
0.5494 | 0.6250 | |
0.7341 | 0.7308 | |
0.8555 | 0.9245 | |
0.7578 | 0.8462 | |
0.6920 | 0.6571 | |
0.6660 | 0.6970 | |
0.6449 | 0.7500 | |
0.5354 | 0.5938 | |
0.6662 | 0.6957 | |
0.6020 | 0.5714 |
References
- [1] W. Burnside, On an arithmetical theorem connected with roots of unity, and its application to group-characteristics. Proc. Lond. Math. Soc. 1 (1904) 112–116.
- [2] J. W. S. Cassels, On a conjecture of R. M. Robinson about sums of roots of unity. J. Reine Angew. Math. 238 (1969) 112–131.
- [3] P. X. Gallagher, Group characters and commutators. Math. Z. 79 (1962) 122–126.
- [4] P. X. Gallagher, Degrees, class sizes and divisors of character values. J. Group Theory 15 (2012) 455–467.
- [5] P. X. Gallagher, M. J. Larsen, and A. R. Miller, Many zeros of many characters of . Int. Math. Res. Not. IMRN 2022 (2022) 4376–4386.
- [6] G. Higman, Enumerating -groups. I: Inequalities. Proc. London Math. Soc. 10 (1960) 24–30.
- [7] H. E. Jordan, Group-characters of various types of linear groups. Amer. J. Math. 29 (1907) 387–405.
- [8] M. J. Larsen and A. R. Miller, The sparsity of character tables of high rank groups of Lie type. Represent. Theory 25 (2021) 173–192.
- [9] J. H. Loxton, On two problems of R. M. Robinson about sums of roots of unity. Acta Arith. 26 (1974) 159–174.
- [10] A. R. Miller, The probability that a character value is zero for the symmetric group. Math. Z. 277 (2014) 1011–1015.
- [11] C. L. Siegel, The trace of totally positive and real algebraic integers. Ann. of Math. 46 (1945) 302–312.
- [12] C. C. Sims, Enumerating -groups. Proc. London Math. Soc. 15 (1965) 151–166.
- [13] M. Suzuki, On a class of doubly transitive groups. Ann. of Math. 75 (1962) 105–145.
- [14] H. N. Ward, On Ree’s series of simple groups. Trans. Amer. Math. Soc. 121 (1966) 62–89.