Higher Congruences in Character Tables
Abstract
Motivated by recent work of Peluse and Soundararajan on divisibility properties of the entries of the character tables of symmetric groups, we investigate the question: For a finite group , when are two columns of the character table of congruent to one another modulo a power of a prime?
1 Introduction
In [Mil19] Miller made the following beautiful conjecture, which was proved in a pair of papers by Peluse and Soundararajan.
Theorem 1.1 ([PS22, PS23]).
For any fixed natural number , the proportion of entries in the character table of which are divisible by tends to 1 as goes to infinity.
When is a prime number (or a product of distinct primes) this was generalized to wreath products when has rational character table and to Weyl groups of type in [Don+23].
In both of the Peluse and Soundararajan arguments, as well as the generalization to wreath products, a key representation-theoretic ingredient to the proof is a lemma which gives a criterion for when two columns of the character table of are congruent modulo a prime power . Let denote the the equivalence relation on partitions generated by if is formed from by replacing parts of size with parts of size . For and in , we say if the partitions corresponding to their cycle types are equivalent via .
Lemma 1.2 ([PS23]).
For , in , if , then for all characters of .
With the general goal of investigating Miller-Peluse-Soundararajan type character table divisibility questions in mind, the motivating question of this paper is:
For a finite group , when are two columns of the character table of congruent to one another modulo ?
The remainder of the paper is structured as follows:
Section 2: Unramified Character Tables
We want to talk about entries of the character table a finite group being congruent modulo a power of a prime . For the symmetric groups , all of the character table entries are integers, so this makes sense automatically. However, for a general group , the entries of the ordinary character table may not be rational integers and instead may live in some finite integral extension of . If this extension is ramified at , then there may be no well-behaved notion of two entries being congruent modulo .
In §2 we introduce the notion of the unramified character table of a group at a prime , and prove some basic properties of them. Morally, the unramified character table is as close as you can get to working over , while still ensuring you have a well-behaved notion of congruence modulo for the entries. We believe this is the “right” setting for asking Miller-Peluse-Soundararajan-type divisibility questions about general groups.
In many natural cases of interest the unramified character table is the same as either the ordinary character table or the rational character table. So depending on the interests of the reader this section may be skipped.
Section 3: Higher Congruences
A key step in the Peluse and Soundararajan argument is a combinatorial characterization of when two columns of the character table of are congruent to one another modulo a prime power . When there is a general criterion essentially due to Brauer for when two columns of the character table are congruent modulo . However for the story seems to be much less well understood.
Our first main technical results is Proposition 3.1 which establish an upper bound on the largest power of for which two columns of an unramified character table can be congruent without being forced to the same column. Proposition 3.2 gives an improvement to this bound in the important special case where the group is a -group.
We then define an equivalence relation on a general group , which is a generalization of the relation on . Our second main technical result is Theorem 3.4 which says that if , then for all unramified characters of .
Section 4: Revisiting the Symmetric Group
We then revisit the combinatorial criterion for when two columns of the character table of are congruent modulo a prime power . We show that in this case indeed agrees with . Moreover we show in Proposition 4.2 that the converse of Lemma 1.2 also holds: two columns of the character table are congruent modulo if and only if the corresponding partitions are equivalent under (as far as we can tell, only the “if” direction is in the existing literature for ).
Section 5: Questions and Conjectures
Finally we close out by posing a number of related questions and conjectures.
Acknowledgments
Thanks to Alexander Miller for helpful conversations. We’d also like to thank our REU students Brandon Dong, Skye Rothstein, Lola Vescovo, Hannah Graff, Saskia Solotko, Devin Brown, Francisco Gutierrez, Rylan Rosas, Chris Wu, and Charles Troutman for inspiring these investigations. N.H. was partially supported by NSF grant DMS-2401515. J.M. was partially supported by NSF Graduate Research Fellowship DGE 1746045.
2 The Unramified Character Table
Fix a finite group and a prime dividing . Given a complex character of , let be the field extension of generated by the values of .
Definition 2.1.
A character is unramified at if the field extension is unramified at .
Let be the ring of characters of unramified at . The ring is essentially determined by a cyclotomic Galois action. We summarize this procedure here. By Brauer’s induction theorem, [Ser77, §10.5]. Let for prime to , and let be the kernel of the projection . The group is isomorphic to by the Chinese Remainder Theorem, and is the Galois group of .
Definition 2.2.
A -conjugacy class of is an equivalence class of the relation on generated by conjugation and for .
Proposition 2.3 ([Ser77] §12.4, Corollary 1).
A character is in if and only if is constant on -conjugacy classes. The rank of is the number of -conjugacy classes.
It follows from Proposition 2.3 that a basis for is given by sums of orbits of complex irreducible characters under the action of via .
Example 2.4.
Let be a cyclic group of order a power of . Then . The -conjugacy classes in are represented by . The characters of are for a primitive th root of unity. A set of orbit representatives for acting on the characters of are ; the unramified characters are sums over these orbits. For example, the unramified character table of is as below:
1 | |||||
---|---|---|---|---|---|
1 | 1 | 1 | 1 | 1 | |
0 | |||||
0 | 0 | ||||
0 | 0 | 0 |
Example 2.5.
Let be an -dimensional vector space over . Then the -conjugacy classes in are exactly and , the projectivization of . The complex irreducible characters of are in bijection with the dual space via the choice of an additive character via the pairing . The -orbits on complex characters are , so the irreducible unramified characters are in bijection with . The unramified character table is:
0 | ||
---|---|---|
0 | 1 | 1 |
2.1 Realizability
By definition, an unramified character has unramified at . This does not imply the character is realizable by a representation over . However, there is an unramified extension of over which is realized. Since the values of a general character are algebraic integers, the field makes sense, and is unramified at if and only if is unramified.
Proposition 2.6.
If is a character of unramified at , then there is a representation of with character defined over an unramified extension of .
Proof.
A nontrivial extension of may be necessary, as in the next example:
Example 2.7.
Consider , the order 8 group of unit quaternions. The group has one absolutely irreducible character of degree greater than 1, given by and . Since is integer-valued, is unramified at all primes. To construct a representation affording this character, consider the quaternion algebra
Then , and the induced map is the simple factor of corresponding to the character . Thus, for a field , is afforded by a -module if and only if splits.
It is well-known that splits if and only if for (see [Ser77, Exercise 12.3]). Thus is not realizable over , since is not a sum of squares in . However, the number field for a primitive rd root of unity is unramified at 2; since the character is afforded by a -module.
3 Higher congruences
When are two columns of the unramified character table of congruent modulo some power of ? The question of congruence modulo is entirely addressed by Brauer’s work on modular characters. Two elements are congruent mod for all unramified characters if and only if they agree on all Brauer characters. If is the -semisimple and -unipotent decomposition of , then and are equal on all Brauer characters if and only if [Ser77, §18.1].
This answers the question of when two columns are congruent modulo . On the other hand, if two columns are congruent modulo a sufficiently large power of , then they are actually equal:
Proposition 3.1.
Let , and let be the maximum of as ranges over unramified irreducible characters of . If are such that for all unramified irreducible characters , then and are -conjugate.
Proof.
We proceed by column orthogonality of the unramified character table. Let be the -conjugacy class of , and let be the -class function
By Proposition 2.3, the unramified irreducible characters form a basis for -class functions, so , where the sum is over unramified irreducible characters. By definition . Thus for ,
Suppose are not -conjugate. Let be the least common multiple of over the unramified irreducible characters . Then , while
The left-hand side is an integer combination of unramified character values, while the right-hand side has -adic valuation at most . If for all , then we obtain
a contradiction. Hence and are -conjugate, as desired. ∎
This bound works best when the complex character values of are rational, or more generally, tamely ramified over , in which case . If is a -group, then the character values may be wildly ramified. For example, if , then , and Proposition 3.1 states that distinct -conjugacy classes can be congruent to order at most . This is much worse than necessary. For a -group, we have a better bound, which is tight for :
Proposition 3.2.
If is a -group of order and are such that for all unramified characters of , then and are -conjugate.
Proof.
If is a -group, then and are -conjugate if and only if and generate conjugate cyclic subgroups. So let be the cyclic subgroup generated by . Consider . Then , so , while if is not conjugate to an element of . As , is not zero. Hence, is conjugate into .
Now let . The same argument shows if is conjugate into , while . Hence is not conjugate to an element of . Since is a -group, this implies is conjugate to a generator of , so and generate conjugate cyclic subgroups of . ∎
In between these two extremes, it is more difficult to determine the order of congruence between two columns of the unramified character table. We present a sufficient criterion for two columns to be congruent modulo some power . Motivation comes from the following reframing of Brauer’s condition: consider the relation on generated by conjugacy and the relation if has order a power of and commutes with . If , the -semisimple parts and are equal if and only if . We will show in Theorem 3.4 that if as above is a -th power in , then a deeper congruence between and is obtained.
To prove this theorem, we first deal with the case when and are both of order a power of , the “totally ramified” case.
Lemma 3.3.
Let be a finite extension of or unramified over . If is a finite-dimensional vector space over and are each of order a power of and satisfy , then
Proof.
Since we are taking a trace, we may replace with its semisimplification under the action of . By the Nullstellensatz, the simple -modules are of the form for a finite extension generated by . Since and have order a power of , for some primitive th root of unity , and and are both powers of . Since is unramified in , the trace form for is given by
so that for the regular character of and the regular character of .
Thus, it suffices to show that if is a cyclic -group with regular character and , then . The only case when is if exactly one of and is not the identity. Hence is not the identity, so must have order greater than . Thus . But the nonzero value of is . Hence , establishing the claim. ∎
With the totally ramified case in hand, the general case follows by factoring into unramified and totally ramified cases:
Theorem 3.4.
Suppose that , commutes with , and has order a power of . Then for all unramified characters of ,
Proof.
Let be the maximal unramified extension of . By Proposition 2.6, there is a -module affording . Consider the radical filtration on defined by the action of , and let be the associated graded. Since commutes with , the action of on induces an action of on .
Let be the -semisimple and -unipotent decomposition of . Since has order prime to , all its eigenvalues lie in , so has a weight space decomposition with respect to the semisimple operator . Let be a weight space for . Since and are powers of , commutes with and . Hence and are commuting operators on . By Lemma 3.3, . Since is acting by a scalar on , . Summing over all weights of gives the desired result. ∎
Definition 3.5.
Given a group and , let be the equivalence relation on generated by conjugation and whenever commutes with and has order a power of .
Theorem 3.4 shows that if , then for all . However, the converse does not hold for every group.
Example 3.6.
Let be the Heisenberg group of order . If is a -dimensional symplectic vector space over , then is the central extension
given by the 2-cocycle . The complex characters with nontrivial central character are of the form for a nontrivial character of the cyclic group . Hence, there is a single irreducible unramified representation with nontrivial central action, namely for the augmentation ideal of . For , we then have , while . Since all other unramified irreducible representations have trivial central action, we obtain that for all unramified characters of .
However, all elements in are of order , so there are no non-trivial th powers. Hence, no nontrivial higher congruences are explained by Theorem 3.4.
Remark 3.7.
It is known that if is a square integer matrix, then [Ste17], which for is a generalization of Fermat’s little theorem to matrices. Thus, if is an integer matrix whose order is a power of , then inductively applying for implies that , which is conclusion of Lemma 3.3 when . It would be interesting to understand more connections between these congruences.
4 Higher congruences in the symmetric group
While in general, the relation of Definition 3.5 does not always coincide with congruence modulo for , we will show that in the case of the symmetric group that does coincide with congruence modulo for all . To show this, we give a combinatorial characterization of the relation on elements of the symmetric group.
Recall that for , the cycle type of is the partition of formed by the lengths of cycles of . The conjugacy classes of are in bijection with partitions of via cycle type.
Definition 4.1.
The relation on partitions is the equivalence relation generated by if is formed from by replacing parts of size with parts of size .
Let also denote the relation on conjugacy classes of defined this way.
Proposition 4.2.
For , the following are equivalent:
-
i)
;
-
ii)
;
-
iii)
for all characters of .
To prove Proposition 4.2, we need to construct certain representations of the symmetric group. Given a partition , let be the Young subgroup associated to , and let be the character induced from the trivial character of . It is a standard fact that is a basis for the representation ring of [JK81, Theorem 2.2.10], although we do not need it. Given , let denote the value of the character at the conjugacy class with cycle type . We give a combinatorial interpretation of the character values :
Definition 4.3.
For , a row decomposition of by is a function such that the preimage of a row of length is a set of rows with total length . Let be the set of all row decompositions of by .
The following is then immediate from the definition of :
Lemma 4.4.
If , then .
Lemma 4.5.
Let and be partitions of for positive integers and a fixed partition . Then for we have
Proof.
Given and as in the statement, let
Observe that every has all rows of placed in the row of length . This gives a bijection . Also, there are ways of choosing out of rows with some order, and given such a choice, tiling the rows accordingly gives a unique element of . It follows that
By Wilson’s theorem, , so .
By Lemma 4.4, and . We have shown ; thus, we must show .
We show divides by considering orbits of a group and its -Sylow subgroup acting on . There is an action of the symmetric group on by permuting the rows tiled into . There is a commuting action of on by permuting the placements of the rows of length of not in . Given , let be the -Sylow subgroup of the stabilizer of in . We will analyze the size of .
Let and be the projections onto the two direct factors of . If , then since has between and rows of placed into , does not act transitively on the rows in . Since is a -group, is either the identity or the -cycle; since does not act transitively, . Thus is trivial and is injective.
If has exactly rows of placed into , then must fix those rows. Hence . Now divides . It follows that divides . As the index of in the stabilizer of is prime to , we conclude divides the cardinality of the orbit of .
Since divides the size of every orbit of on , it follows that divides . This proves the claim. ∎
Proof of Proposition 4.2.
i) ii): suppose that . We may assume that the cycle type of is formed from that of by replacing cycles of length with cycles of length . Write where is a product of disjoint -cycles and is disjoint from . Then for a -cycle also disjoint from . Since is a product of disjoint cycles of length , we see that the conjugacy class of is represented by . Since commutes with , we obtain .
ii) iii): this is Theorem 3.4.
iii) i): We proceed by double induction: on , and backwards on the length of the smallest cycle where and differ in cycle type. The base case follows from Brauer’s theory: if has cycle type , then the semisimple part has cycle type formed by replacing parts of size , in with parts of size . Hence, if and are conjugate, then .
Now suppose that and are such that for all characters of . Let be the smallest cycle length which appears in and with different multiplicity. Then and have cycle types and for partitions , , and such that all parts in and have size greater than . By induction, we have , which implies . This implies , so we may set . Any row decomposition of by or places no parts of or into the parts of length . Hence applying Lemma 4.5 times gives
Since for all characters of , we conclude . Assume without loss of generality that . Then for of cycle type . By the case i) iii) above, we have for all characters of . Now and have the same number of cycles of length , so by induction, and thus .
∎
5 Questions and Conjectures
Proposition 4.2 says that fully characterizes higher congruences in the character table of the symmetric group, and based on our limited calculations it seems like this is often the case. However as we saw in Example 3.6 this is not the case in general – it seems to some times fail for -groups (and their close relatives). It is not clear to us why this is the case, so we will close the paper out with a few related questions and conjectures:
Problem 5.1.
Given a fixed prime , characterize the finite groups such that for all unramified if and only if as in Definition 3.5.
Problem 5.2.
Characterize the finite groups such that for all primes , for all unramified if and only if as in Definition 3.5.
Conjecture 5.3.
If is a finite simple group of Lie type and is a prime different from the defining characteristic from , then for all unramified if and only if .
Question 5.4.
Let be a -group. For , what is the largest power such that for all unramified characters ?
Remark 5.5.
We could ask the same question for an arbitrary group , but the -group case is of particular interest. Moreover, we have reason to believe the -group case might have a relatively nice answer. The unramified characters of -groups are the same as the rational characters, and a result of Ford ([For87], Theorem 3) says that every rational character of a -group can be expressed as a difference of two permutation characters. This suggests there is a group-theoretic answer to Question 5.4 in terms of subgroups and conjugacy inside , although thus far we have been unable to find one.
References
- [Don+23] Brandon Dong et al. “Almost all wreath product character values are divisible by given primes” In Algebraic Combinatorics 6.6 The Combinatorics Consortium, 2023, pp. 1519–1531 DOI: 10.5802/alco.313
- [For87] Charles E. Ford “Characters of -groups” In Proc. Amer. Math. Soc. 101.4, 1987, pp. 595–601 DOI: 10.2307/2046653
- [JK81] Gordon James and Adalbert Kerber “The representation theory of the symmetric group” 16, Encyclopedia of Mathematics and its Applications Addison-Wesley Publishing Co., Reading, MA, 1981
- [Mil19] Alexander R Miller “Congruences in character tables of symmetric groups”, 2019 arXiv:1908.03741
- [PS22] Sarah Peluse and Kannan Soundararajan “Almost all entries in the character table of the symmetric group are multiples of any given prime” In Journal für die reine und angewandte Mathematik (Crelles Journal) 2022.786 De Gruyter, 2022, pp. 45–53
- [PS23] Sarah Peluse and Kannan Soundararajan “Divisibility of character values of the symmetric group by prime powers”, 2023 arXiv:2301.02203
- [Ser77] Jean-Pierre Serre “Linear representations of finite groups” 42, Graduate Texts in Mathematics Springer-Verlag, 1977
- [Ser79] Jean-Pierre Serre “Local fields” 67, Graduate Texts in Mathematics Springer-Verlag, 1979
- [Ste17] Heinrich Steinlein “Fermat’s little theorem and Gauss congruence: matrix versions and cyclic permutations” In Amer. Math. Monthly 124.6, 2017, pp. 548–553 DOI: 10.4169/amer.math.monthly.124.6.548