This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Higher Congruences in Character Tables

Nate Harman, Joshua Mundinger
(May 16, 2024)
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 GG, when are two columns of the character table of GG 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 rr, the proportion of entries in the character table of SnS_{n} which are divisible by rr tends to 1 as nn goes to infinity.

When rr is a prime number (or a product of distinct primes) this was generalized to wreath products GSnG\wr S_{n} when GG has rational character table and to Weyl groups of type DnD_{n} 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 SnS_{n} are congruent modulo a prime power pmp^{m}. Let mcomb\sim_{m}^{comb} denote the the equivalence relation on partitions generated by λmcombμ\lambda\sim_{m}^{comb}\mu if μ\mu is formed from λ\lambda by replacing pmp^{m} parts of size kk with pm1p^{m-1} parts of size kpkp. For σ\sigma and σ\sigma^{\prime} in SnS_{n}, we say σmcombσ\sigma\sim_{m}^{comb}\sigma^{\prime} if the partitions corresponding to their cycle types are equivalent via mcomb\sim_{m}^{comb}.

Lemma 1.2 ([PS23]).

For σ\sigma, σ\sigma^{\prime} in SnS_{n}, if σmcombσ\sigma\sim_{m}^{comb}\sigma^{\prime}, then χ(σ)χ(σ)modpm\chi(\sigma)\equiv\chi(\sigma^{\prime})\mod p^{m} for all characters χ\chi of SnS_{n}.

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 GG, when are two columns of the character table of GG congruent to one another modulo pmp^{m}?

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 pp. For the symmetric groups SnS_{n}, all of the character table entries are integers, so this makes sense automatically. However, for a general group GG, the entries of the ordinary character table may not be rational integers and instead may live in some finite integral extension of \mathbb{Z}. If this extension is ramified at pp, then there may be no well-behaved notion of two entries being congruent modulo pmp^{m}.

In §2 we introduce the notion of the unramified character table of a group GG at a prime pp, and prove some basic properties of them. Morally, the unramified character table is as close as you can get to working over \mathbb{C}, while still ensuring you have a well-behaved notion of congruence modulo pmp^{m} 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 SnS_{n} are congruent to one another modulo a prime power pmp^{m}. When m=1m=1 there is a general criterion essentially due to Brauer for when two columns of the character table are congruent modulo pp. However for m>1m>1 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 pp 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 pp-group.

We then define an equivalence relation m\sim_{m} on a general group GG, which is a generalization of the relation m\sim_{m} on SnS_{n}. Our second main technical result is Theorem 3.4 which says that if gmgg\sim_{m}g^{\prime}, then χ(g)χ(g)modpm\chi(g)\equiv\chi(g^{\prime})\mod p^{m} for all unramified characters χ\chi of GG.

Section 4: Revisiting the Symmetric Group

We then revisit the combinatorial criterion for when two columns of the character table of SnS_{n} are congruent modulo a prime power pmp^{m}. We show that in this case m\sim_{m} indeed agrees with mcomb\sim_{m}^{comb}. 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 pmp^{m} if and only if the corresponding partitions are equivalent under mcomb\sim_{m}^{comb} (as far as we can tell, only the “if” direction is in the existing literature for m>1m>1).

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 GG and a prime pp dividing |G||G|. Given a complex character χ\chi of GG, let (χ)\mathbb{Q}(\chi) be the field extension of \mathbb{Q} generated by the values of χ\chi.

Definition 2.1.

A character χ\chi is unramified at pp if the field extension (χ)/\mathbb{Q}(\chi)/\mathbb{Q} is unramified at pp.

Let Rp(G)R_{p^{\prime}}(G) be the ring of characters of GG unramified at pp. The ring Rp(G)R_{p^{\prime}}(G) is essentially determined by a cyclotomic Galois action. We summarize this procedure here. By Brauer’s induction theorem, (χ)(e2πi/|G|)\mathbb{Q}(\chi)\subseteq\mathbb{Q}(e^{2\pi i/|G|}) [Ser77, §10.5]. Let |G|=rpe|G|=rp^{e} for rr prime to pp, and let Γ\Gamma be the kernel of the projection (/|G|)×(/r)×(\mathbb{Z}/|G|\mathbb{Z})^{\times}\to(\mathbb{Z}/r\mathbb{Z})^{\times}. The group Γ\Gamma is isomorphic to (/pe)×(\mathbb{Z}/p^{e}\mathbb{Z})^{\times} by the Chinese Remainder Theorem, and is the Galois group of (e2πi/|G|)/(e2πi/r)\mathbb{Q}(e^{2\pi i/|G|})/\mathbb{Q}(e^{2\pi i/r}).

Definition 2.2.

A Γ\Gamma-conjugacy class of GG is an equivalence class of the relation on GG generated by conjugation and xxsx\sim x^{s} for sΓs\in\Gamma.

Proposition 2.3 ([Ser77] §12.4, Corollary 1).

A character χ\chi is in Rp(G)R_{p^{\prime}}(G) if and only if χ\chi is constant on Γ\Gamma-conjugacy classes. The rank of Rp(G)R_{p^{\prime}}(G) is the number of Γ\Gamma-conjugacy classes.

It follows from Proposition 2.3 that a basis for Rp(G)R_{p^{\prime}}(G) is given by sums of orbits of complex irreducible characters under the action of Γ\Gamma via χs(g)=χ(gs)\chi^{s}(g)=\chi(g^{s}).

Example 2.4.

Let G=Cpe=σG=C^{p^{e}}=\langle\sigma\rangle be a cyclic group of order a power of pp. Then Γ=(/pe)×\Gamma=(\mathbb{Z}/p^{e}\mathbb{Z})^{\times}. The Γ\Gamma-conjugacy classes in GG are represented by 1,σ,σp,,σpe11,\sigma,\sigma^{p},\ldots,\sigma^{p^{e-1}}. The characters of GG are χ:σζ\chi_{\ell}:\sigma\mapsto\zeta^{\ell} for ζ\zeta a primitive pep^{e}th root of unity. A set of orbit representatives for Γ\Gamma acting on the characters of GG are χ1,χp,,χpe=χ0\chi_{1},\chi_{p},\ldots,\chi_{p^{e}}=\chi_{0}; the unramified characters are sums over these orbits. For example, the unramified character table of Cp4C^{p^{4}} is as below:

1 σ\sigma σp\sigma^{p} σp2\sigma^{p^{2}} σp3\sigma^{p^{3}}
χ1\chi_{1} 1 1 1 1 1
[χp][\chi_{p}] p1p-1 p1p-1 p1p-1 p1p-1 1-1
[χp2][\chi_{p^{2}}] p2pp^{2}-p p2pp^{2}-p p2pp^{2}-p p-p 0
[χp3][\chi_{p^{3}}] p3p2p^{3}-p^{2} p3p2p^{3}-p^{2} p2-p^{2} 0 0
[χp4][\chi_{p^{4}}] p4p3p^{4}-p^{3} p3-p^{3} 0 0 0
Example 2.5.

Let VV be an nn-dimensional vector space over 𝔽p\mathbb{F}_{p}. Then the Γ\Gamma-conjugacy classes in VV are exactly 0 and (V)\mathbb{P}(V), the projectivization of VV. The complex irreducible characters of VV are in bijection with the dual space VV^{\ast} via the choice of an additive character ψ:𝔽p×\psi:\mathbb{F}_{p}\hookrightarrow\mathbb{C}^{\times} via the pairing V×V𝔽p×V^{\ast}\times V\to\mathbb{F}_{p}\to\mathbb{C}^{\times}. The Γ\Gamma-orbits on complex characters are {0}(V)\{0\}\cup\mathbb{P}(V^{\ast}), so the irreducible unramified characters are in bijection with {0}(V)\{0\}\cup\mathbb{P}(V^{\ast}). The unramified character table is:

0 x(V)x\in\mathbb{P}(V)
0 1 1
H(V)H\in\mathbb{P}(V^{\ast}) p1p-1 {p1xH1xH\begin{cases}p-1&x\in H\\ -1&x\notin H\end{cases}

2.1 Realizability

By definition, an unramified character χ\chi has (χ)\mathbb{Q}(\chi) unramified at pp. This does not imply the character χ\chi is realizable by a representation over (χ)\mathbb{Q}(\chi). However, there is an unramified extension of p(χ)\mathbb{Q}_{p}(\chi) over which χ\chi is realized. Since the values of a general character χ\chi are algebraic integers, the field p(χ)\mathbb{Q}_{p}(\chi) makes sense, and χ\chi is unramified at pp if and only if p(χ)/p\mathbb{Q}_{p}(\chi)/\mathbb{Q}_{p} is unramified.

Proposition 2.6.

If χ\chi is a character of GG unramified at pp, then there is a representation of GG with character χ\chi defined over an unramified extension of p(χ)\mathbb{Q}_{p}(\chi).

Proof.

Let LL be the maximal unramified extension of p\mathbb{Q}_{p}. By [Ser79, Chapter XII, Theorem 1], the Brauer group of LL is trivial. Hence by [Ser77, §12.2, Corollary], every character of GG with values in LL is afforded by a representation defined over LL. If χ\chi is unramified at pp, then (χ)L\mathbb{Q}(\chi)\subseteq L. ∎

A nontrivial extension of p(χ)\mathbb{Q}_{p}(\chi) may be necessary, as in the next example:

Example 2.7.

Consider G={±1,±i,±j,±k}G=\{\pm 1,\pm i,\pm j,\pm k\}, the order 8 group of unit quaternions. The group GG has one absolutely irreducible character of degree greater than 1, given by χ(±1)=±2\chi(\pm 1)=\pm 2 and χ(±i)=χ(±j)=χ(±k)=0\chi(\pm i)=\chi(\pm j)=\chi(\pm k)=0. Since χ\chi is integer-valued, χ\chi is unramified at all primes. To construct a representation affording this character, consider the quaternion algebra

A=(1,1).A=\left(\frac{-1,-1}{\mathbb{Q}}\right).

Then GAG\subseteq A, and the induced map GA\mathbb{Q}G\to A is the simple factor of G\mathbb{Q}G corresponding to the character χ\chi. Thus, for a field K/K/\mathbb{Q}, χ\chi is afforded by a KGKG-module if and only if AKA\otimes_{\mathbb{Q}}K splits.

It is well-known that AKA\otimes_{\mathbb{Q}}K splits if and only if 1=a2+b2-1=a^{2}+b^{2} for a,bKa,b\in K (see [Ser77, Exercise 12.3]). Thus χ\chi is not realizable over 2=2(χ)\mathbb{Q}_{2}=\mathbb{Q}_{2}(\chi), since 1-1 is not a sum of squares in 2\mathbb{Q}_{2}. However, the number field K=(ζ3)K=\mathbb{Q}(\zeta_{3}) for ζ3\zeta_{3} a primitive 33rd root of unity is unramified at 2; since 1=ζ32+ζ3=ζ32+(ζ32)2,-1=\zeta_{3}^{2}+\zeta_{3}=\zeta_{3}^{2}+(\zeta_{3}^{2})^{2}, the character χ\chi is afforded by a (ζ3)G\mathbb{Q}(\zeta_{3})G-module.

3 Higher congruences

When are two columns of the unramified character table of GG congruent modulo some power of pp? The question of congruence modulo pp is entirely addressed by Brauer’s work on modular characters. Two elements are congruent mod pp for all unramified characters if and only if they agree on all Brauer characters. If g=gsgug=g_{s}g_{u} is the pp-semisimple and pp-unipotent decomposition of gGg\in G, then gg and gg^{\prime} are equal on all Brauer characters if and only if gs=gsg_{s}=g^{\prime}_{s} [Ser77, §18.1].

This answers the question of when two columns are congruent modulo pp. On the other hand, if two columns are congruent modulo a sufficiently large power of pp, then they are actually equal:

Proposition 3.1.

Let e=ordp|G|e=\operatorname{ord}_{p}|G|, and let ff be the maximum of ordpχ,χ\operatorname{ord}_{p}\langle\chi,\chi\rangle as χ\chi ranges over unramified irreducible characters of GG. If g1,g2Gg_{1},g_{2}\in G are such that χ(g1)χ(g2)modpe+f+1\chi(g_{1})\equiv\chi(g_{2})\mod p^{e+f+1} for all unramified irreducible characters χ\chi, then g1g_{1} and g2g_{2} are Γ\Gamma-conjugate.

Proof.

We proceed by column orthogonality of the unramified character table. Let CΓ(g)C_{\Gamma}(g) be the Γ\Gamma-conjugacy class of gGg\in G, and let δCΓ(g)\delta_{C_{\Gamma}(g)} be the Γ\Gamma-class function

δCΓ(g)(h)={1hΓg0h≁Γg.\delta_{C_{\Gamma}(g)}(h)=\begin{cases}1&h\sim_{\Gamma}g\\ 0&h\not\sim_{\Gamma}g.\end{cases}

By Proposition 2.3, the unramified irreducible characters form a basis for Γ\Gamma-class functions, so δCΓ(g)=χ(δCΓ(g),χ/χ,χ)χ\delta_{C_{\Gamma}(g)}=\sum_{\chi}\langle(\delta_{C_{\Gamma}(g)},\chi\rangle/\langle\chi,\chi\rangle)\chi, where the sum is over unramified irreducible characters. By definition δCΓ(g),χ=|CΓ(g)|χ(g1)/|G|\langle\delta_{C_{\Gamma}(g)},\chi\rangle=|C_{\Gamma}(g)|\chi(g^{-1})/|G|. Thus for g1,g2Gg_{1},g_{2}\in G,

χ unr. irr.χ(g1)χ(g21)χ,χ={|G|/|CΓ(g1)|g1Γg20g1≁Γg2.\sum_{\chi\text{ unr. irr.}}\frac{\chi(g_{1})\chi(g_{2}^{-1})}{\langle\chi,\chi\rangle}=\begin{cases}|G|/|C_{\Gamma}(g_{1})|&g_{1}\sim_{\Gamma}g_{2}\\ 0&g_{1}\not\sim_{\Gamma}g_{2}.\end{cases}

Suppose g1,g2Gg_{1},g_{2}\in G are not Γ\Gamma-conjugate. Let MM be the least common multiple of χ,χ\langle\chi,\chi\rangle over the unramified irreducible characters χ\chi. Then χχ(g1)χ(g21)/χ,χ=0\sum_{\chi}\chi(g_{1})\chi(g_{2}^{-1})/\langle\chi,\chi\rangle=0, while

χ unr. irr.Mχ,χχ(g1)χ(g11)=M|G||CΓ(g1)|.\sum_{\chi\text{ unr. irr.}}\frac{M}{\langle\chi,\chi\rangle}\chi(g_{1})\chi(g_{1}^{-1})=\frac{M|G|}{|C_{\Gamma}(g_{1})|}.

The left-hand side is an integer combination of unramified character values, while the right-hand side has pp-adic valuation at most ordpM+ordp|G|=e+f\operatorname{ord}_{p}M+\operatorname{ord}_{p}|G|=e+f. If χ(g1)χ(g2)modpe+f+1\chi(g_{1})\equiv\chi(g_{2})\mod p^{e+f+1} for all χ\chi, then we obtain

0M|G||CΓ(g1)|modpe+f+1,0\equiv\frac{M|G|}{|C_{\Gamma}(g_{1})|}\mod p^{e+f+1},

a contradiction. Hence g1g_{1} and g2g_{2} are Γ\Gamma-conjugate, as desired. ∎

This bound works best when the complex character values of GG are rational, or more generally, tamely ramified over \mathbb{Q}, in which case f=0f=0. If GG is a pp-group, then the character values may be wildly ramified. For example, if G=CpeG=C_{p^{e}}, then f=e1f=e-1, and Proposition 3.1 states that distinct Γ\Gamma-conjugacy classes can be congruent to order at most p2e1p^{2e-1}. This is much worse than necessary. For a pp-group, we have a better bound, which is tight for CpeC_{p^{e}}:

Proposition 3.2.

If GG is a pp-group of order pep^{e} and g1,g2Gg_{1},g_{2}\in G are such that χ(g1)χ(g2)modpe+1\chi(g_{1})\equiv\chi(g_{2})\mod p^{e+1} for all unramified characters of GG, then g1g_{1} and g2g_{2} are Γ\Gamma-conjugate.

Proof.

If GG is a pp-group, then g1g_{1} and g2g_{2} are Γ\Gamma-conjugate if and only if g1g_{1} and g2g_{2} generate conjugate cyclic subgroups. So let CC be the cyclic subgroup generated by g1g_{1}. Consider χ1=IndCG1\chi_{1}=\operatorname{Ind}_{C}^{G}1. Then χ1(g1)=[NG(C):C]\chi_{1}(g_{1})=[N_{G}(C):C], so ordp(χ1(g1))e\operatorname{ord}_{p}(\chi_{1}(g_{1}))\leq e, while χ1(g)=0\chi_{1}(g)=0 if gg is not conjugate to an element of CC. As χ1(g2)χ1(g1)0modpe+1\chi_{1}(g_{2})\equiv\chi_{1}(g_{1})\neq 0\mod p^{e+1}, χ1(g2)\chi_{1}(g_{2}) is not zero. Hence, g2g_{2} is conjugate into CC.

Now let χ2=IndCpG1\chi_{2}=\operatorname{Ind}_{C^{p}}^{G}1. The same argument shows ordp(χ2(g2))e\operatorname{ord}_{p}(\chi_{2}(g_{2}))\leq e if g2g_{2} is conjugate into CpC^{p}, while χ2(g1)=0\chi_{2}(g_{1})=0. Hence g2g_{2} is not conjugate to an element of CpC^{p}. Since CC is a pp-group, this implies g2g_{2} is conjugate to a generator of CC, so g1g_{1} and g2g_{2} generate conjugate cyclic subgroups of GG. ∎

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 pmp^{m}. Motivation comes from the following reframing of Brauer’s condition: consider the relation \sim on GG generated by conjugacy and the relation gghg\sim gh if hh has order a power of pp and commutes with gg. If g,gGg,g^{\prime}\in G, the pp-semisimple parts gsg_{s} and gsg^{\prime}_{s} are equal if and only if ggg\sim g^{\prime}. We will show in Theorem 3.4 that if hh as above is a pp-th power in GG, then a deeper congruence between gg and ghgh is obtained.

To prove this theorem, we first deal with the case when gg and hh are both of order a power of pp, the “totally ramified” case.

Lemma 3.3.

Let KK be a finite extension of \mathbb{Q} or p\mathbb{Q}_{p} unramified over pp. If VV is a finite-dimensional vector space over KK and A,BGL(V)A,B\in GL(V) are each of order a power of pp and satisfy AB=BAAB=BA, then

tr(ABpm1)tr(A)modpm.tr(AB^{p^{m-1}})\equiv tr(A)\mod p^{m}.
Proof.

Since we are taking a trace, we may replace VV with its semisimplification under the action of K[A,B]K[A,B]. By the Nullstellensatz, the simple K[A,B]K[A,B]-modules are of the form LL for L/KL/K a finite extension generated by A,BLA,B\in L. Since AA and BB have order a power of pp, L=K(ζ)L=K(\zeta) for some primitive pjp^{j}th root of unity ζ\zeta, and AA and BB are both powers of ζ\zeta. Since pp is unramified in KK, the trace form for ξζ\xi\in\langle\zeta\rangle is given by

trL/K(ξ)={pjpj1ξ=1pj1ξp=1,ξ10elsetr_{L/K}(\xi)=\begin{cases}p^{j}-p^{j-1}&\xi=1\\ -p^{j-1}&\xi^{p}=1,\xi\neq 1\\ 0&\text{else}\end{cases}

so that trL/K=χ1χ2tr_{L/K}=\chi_{1}-\chi_{2} for χ1\chi_{1} the regular character of ζ\langle\zeta\rangle and χ2\chi_{2} the regular character of ζ/ζpj1\langle\zeta\rangle/\langle\zeta^{p^{j-1}}\rangle.

Thus, it suffices to show that if CC is a cyclic pp-group with regular character χ\chi and A,BCA,B\in C, then χ(ABpm1)χ(A)modpm\chi(AB^{p^{m-1}})\equiv\chi(A)\mod p^{m}. The only case when χ(ABpm1)χ(A)\chi(AB^{p^{m-1}})\neq\chi(A) is if exactly one of ABpm1AB^{p^{m-1}} and AA is not the identity. Hence Bpm1B^{p^{m-1}} is not the identity, so CC must have order greater than pm1p^{m-1}. Thus pm|C|p^{m}\mid|C|. But the nonzero value of χ\chi is |C||C|. Hence χ(ABpm1)χ(A)modpm\chi(AB^{p^{m-1}})\equiv\chi(A)\mod p^{m}, 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 g,hGg,h\in G, hh commutes with GG, and hh has order a power of pp. Then for all unramified characters χ\chi of GG,

χ(g)χ(ghpm1)modpm.\chi(g)\equiv\chi(gh^{p^{m-1}})\mod p^{m}.
Proof.

Let L=purL=\mathbb{Q}^{ur}_{p} be the maximal unramified extension of p\mathbb{Q}_{p}. By Proposition 2.6, there is a LGLG-module VV affording χ\chi. Consider the radical filtration on VV defined by the action of gg, and let gr(V)\operatorname{gr}(V) be the associated graded. Since hh commutes with gg, the action of hh on VV induces an action of hh on gr(V)\operatorname{gr}(V).

Let g=gsgug=g_{s}g_{u} be the pp-semisimple and pp-unipotent decomposition of gg. Since gsg_{s} has order prime to pp, all its eigenvalues lie in LL, so gr(V)\operatorname{gr}(V) has a weight space decomposition with respect to the semisimple operator gsg_{s}. Let WW be a weight space for gsg_{s}. Since gsg_{s} and gug_{u} are powers of gg, hh commutes with gsg_{s} and gug_{u}. Hence gug_{u} and hh are commuting operators on WW. By Lemma 3.3, tr(gu|W)tr(guhpm1|W)modpmtr(g_{u}|W)\equiv tr(g_{u}h^{p^{m-1}}|W)\mod p^{m}. Since gsg_{s} is acting by a scalar on WW, tr(g|W)tr(ghpm1|W)modpmtr(g|W)\equiv tr(gh^{p^{m-1}}|W)\mod p^{m}. Summing over all weights of gsg_{s} gives the desired result. ∎

Definition 3.5.

Given a group GG and m1m\geq 1, let m\sim_{m} be the equivalence relation on GG generated by conjugation and gmghpm1g\sim_{m}gh^{p^{m-1}} whenever hh commutes with gg and has order a power of pp.

Theorem 3.4 shows that if gmgg\sim_{m}g^{\prime}, then χ(g)χ(g)modpm\chi(g)\equiv\chi(g^{\prime})\mod p^{m} for all χ\chi. However, the converse does not hold for every group.

Example 3.6.

Let HH be the Heisenberg group of order p2n+1p^{2n+1}. If (V,ω)(V,\omega) is a 2n2n-dimensional symplectic vector space over 𝔽p\mathbb{F}_{p}, then HH is the central extension

0Z=𝔽pHV00\to Z=\mathbb{F}_{p}\to H\to V\to 0

given by the 2-cocycle ω\omega. The complex characters with nontrivial central character are of the form ψ=1pnIndZHη\psi=\frac{1}{p^{n}}\operatorname{Ind}_{Z}^{H}\eta for η\eta a nontrivial character of the cyclic group ZZ. Hence, there is a single irreducible unramified representation with nontrivial central action, namely ψnr=1pnIndZHIZ\psi^{nr}=\frac{1}{p^{n}}\operatorname{Ind}^{H}_{Z}IZ for IZIZ the augmentation ideal of ZZ. For zZz\in Z, we then have ψnr(z)=pn(1)\psi^{nr}(z)=p^{n}(-1), while ψnr(1)=pn(p1)\psi^{nr}(1)=p^{n}(p-1). Since all other unramified irreducible representations have trivial central action, we obtain that χ(z)χ(1)modpn\chi(z)\equiv\chi(1)\mod p^{n} for all unramified characters χ\chi of HH.

However, all elements in HH are of order pp, so there are no non-trivial ppth powers. Hence, no nontrivial higher congruences are explained by Theorem 3.4.

Remark 3.7.

It is known that if BB is a square integer matrix, then tr(Bpm1)tr(Bpm)modpmtr(B^{p^{m-1}})\equiv tr(B^{p^{m}})\mod p^{m} [Ste17], which for m=1m=1 is a generalization of Fermat’s little theorem to matrices. Thus, if BB is an integer matrix whose order is a power of pp, then inductively applying tr(Bpi1)tr(Bpi)modpitr(B^{p^{i-1}})\equiv tr(B^{p^{i}})\mod p^{i} for imi\geq m implies that tr(Bpm1)tr(1)modpmtr(B^{p^{m-1}})\equiv tr(1)\mod p^{m}, which is conclusion of Lemma 3.3 when A=1A=1. It would be interesting to understand more connections between these congruences.

4 Higher congruences in the symmetric group

While in general, the relation m\sim_{m} of Definition 3.5 does not always coincide with congruence modulo pmp^{m} for m>1m>1, we will show that in the case of the symmetric group SnS_{n} that m\sim_{m} does coincide with congruence modulo pmp^{m} for all mm. To show this, we give a combinatorial characterization of the relation m\sim_{m} on elements of the symmetric group.

Recall that for σSn\sigma\in S_{n}, the cycle type of σ\sigma is the partition of nn formed by the lengths of cycles of σ\sigma. The conjugacy classes of SnS_{n} are in bijection with partitions of nn via cycle type.

Definition 4.1.

The relation mcomb\sim_{m}^{comb} on partitions is the equivalence relation generated by λmcombμ\lambda\sim_{m}^{comb}\mu if μ\mu is formed from λ\lambda by replacing pmp^{m} parts of size kk with pm1p^{m-1} parts of size kpkp.

Let mcomb\sim_{m}^{comb} also denote the relation on conjugacy classes of SnS_{n} defined this way.

Proposition 4.2.

For σ,σSn\sigma,\sigma^{\prime}\in S_{n}, the following are equivalent:

  1. i)

    σmcombσ\sigma\sim_{m}^{comb}\sigma^{\prime};

  2. ii)

    σmσ\sigma\sim_{m}\sigma^{\prime};

  3. iii)

    χ(σ)χ(σ)modpm\chi(\sigma)\equiv\chi(\sigma^{\prime})\mod p^{m} for all characters χ\chi of SnS_{n}.

To prove Proposition 4.2, we need to construct certain representations of the symmetric group. Given a partition λn\lambda\vdash n, let Sλ=Sλ1×Sλ2×S_{\lambda}=S_{\lambda_{1}}\times S_{\lambda_{2}}\times\cdots be the Young subgroup associated to λ\lambda, and let MλM^{\lambda} be the character IndSλSn1Ind_{S_{\lambda}}^{S_{n}}1 induced from the trivial character of SλS_{\lambda}. It is a standard fact that {Mλ}λn\{M^{\lambda}\}_{\lambda\vdash n} is a basis for the representation ring of SnS_{n} [JK81, Theorem 2.2.10], although we do not need it. Given μn\mu\vdash n, let MμλM^{\lambda}_{\mu} denote the value of the character MλM^{\lambda} at the conjugacy class with cycle type μ\mu. We give a combinatorial interpretation of the character values MμλM^{\lambda}_{\mu}:

Definition 4.3.

For λ,μn\lambda,\mu\vdash n, a row decomposition of λ\lambda by μ\mu is a function f:{rows of μ}{rows of λ}f:\{\text{rows of }\mu\}\to\{\text{rows of }\lambda\} such that the preimage of a row of length kk is a set of rows with total length kk. Let RD(λ,μ)RD(\lambda,\mu) be the set of all row decompositions of λ\lambda by μ\mu.

The following is then immediate from the definition of MλM^{\lambda}:

Lemma 4.4.

If λ,μn\lambda,\mu\vdash n, then Mμλ=|RD(λ,μ)|M^{\lambda}_{\mu}=|RD(\lambda,\mu)|.

Lemma 4.5.

Let μ=(ξ,kpm)\mu=(\xi,k^{p^{m}}) and ν=(ξ,(pk)pm1)\nu=(\xi,(pk)^{p^{m-1}}) be partitions of nn for positive integers k,mk,m and a fixed partition ξnkpm\xi\vdash n-kp^{m}. Then for λ=(npk,kp)\lambda=(n-pk,k^{p}) we have

MμλMνλpmmodpm+1M^{\lambda}_{\mu}\equiv M^{\lambda}_{\nu}-p^{m}\mod p^{m+1}
Proof.

Given μ\mu and ν\nu as in the statement, let

R1\displaystyle R_{1} ={ρRD(λ,μ)no rows of kpm are placed in kp in ρ},\displaystyle=\{\rho\in RD(\lambda,\mu)\mid\text{no rows of }k^{p^{m}}\text{ are placed in }k^{p}\text{ in }\rho\},
R2\displaystyle R_{2} ={ρRD(λ,μ)between 1 and p1 rows of kpm are placed in kp in ρ},\displaystyle=\{\rho\in RD(\lambda,\mu)\mid\text{between }1\text{ and }p-1\text{ rows of }k^{p^{m}}\text{ are placed in }k^{p}\text{ in }\rho\},
R3\displaystyle R_{3} ={ρRD(λ,μ)p rows of kpm are placed in kp in ρ}.\displaystyle=\{\rho\in RD(\lambda,\mu)\mid p\text{ rows of }k^{p^{m}}\text{ are placed in }k^{p}\text{ in }\rho\}.

Observe that every ρRD(λ,ν)\rho\in RD(\lambda,\nu) has all rows of (pk)pm1(pk)^{p^{m-1}} placed in the row of length npkn-pk. This gives a bijection R1RD(λ,ν)R_{1}\cong RD(\lambda,\nu). Also, there are (pm)!/(pmp)!(p^{m})!/(p^{m}-p)! ways of choosing pp out of pmp^{m} rows with some order, and given such a choice, tiling the rows kpk^{p} accordingly gives a unique element of R3R_{3}. It follows that

|R3|=(pm)!/(pmp)!=pm(pm1)(pmp+1).|R_{3}|=(p^{m})!/(p^{m}-p)!=p^{m}(p^{m}-1)\cdots(p^{m}-p+1).

By Wilson’s theorem, (p1)!1modp(p-1)!\equiv-1\mod p, so |R3|pmmodpm+1|R_{3}|\equiv-p^{m}\mod p^{m+1}.

By Lemma 4.4, |R1|+|R2|+|R3|=|RD(λ,μ)||R_{1}|+|R_{2}|+|R_{3}|=|RD(\lambda,\mu)| and |R1|=|RD(λ,ν)||R_{1}|=|RD(\lambda,\nu)|. We have shown |R3|pmmodpm+1|R_{3}|\equiv-p^{m}\mod p^{m+1}; thus, we must show |R2|0modpm+1|R_{2}|\equiv 0\mod p^{m+1}.

We show pm+1p^{m+1} divides |R2||R_{2}| by considering orbits of a group and its pp-Sylow subgroup acting on R2R_{2}. There is an action of the symmetric group SpS_{p} on RD(λ,μ)RD(\lambda,\mu) by permuting the pp rows tiled into kpk^{p}. There is a commuting action of SpmS_{p^{m}} on RD(λ,μ)RD(\lambda,\mu) by permuting the placements of the rows of length kk of μ\mu not in ξ\xi. Given ρR2\rho\in R_{2}, let QQ be the pp-Sylow subgroup of the stabilizer of ρ\rho in Sp×SpmS_{p}\times S_{p^{m}}. We will analyze the size of QQ.

Let π1:QSp\pi_{1}:Q\to S_{p} and π2:QSpm\pi_{2}:Q\to S_{p^{m}} be the projections onto the two direct factors of Sp×SpmS_{p}\times S_{p^{m}}. If σQ\sigma\in Q, then since ρ\rho has between 11 and p1p-1 rows of kpmk^{p^{m}} placed into kpk^{p}, π1(σ)\pi_{1}(\sigma) does not act transitively on the pp rows in kpk^{p}. Since QQ is a pp-group, π1(σ)\pi_{1}(\sigma) is either the identity or the pp-cycle; since π1(σ)\pi_{1}(\sigma) does not act transitively, π1(σ)=1\pi_{1}(\sigma)=1. Thus π1\pi_{1} is trivial and π2\pi_{2} is injective.

If ρ\rho has exactly \ell rows of kpmk^{p^{m}} placed into kpk^{p}, then π2(σ)\pi_{2}(\sigma) must fix those \ell rows. Hence π2(Q)Spm\pi_{2}(Q)\subseteq S_{p^{m}-\ell}. Now pmp^{m} divides [Spm:Spm][S_{p^{m}}:S_{p^{m}-\ell}]. It follows that pm+1p^{m+1} divides [Sp×Spm:Q][S_{p}\times S_{p^{m}}:Q]. As the index of QQ in the stabilizer of ρ\rho is prime to pp, we conclude pm+1p^{m+1} divides the cardinality of the orbit of ρ\rho.

Since pm+1p^{m+1} divides the size of every orbit of Sp×SpmS_{p}\times S_{p^{m}} on R2R_{2}, it follows that pm+1p^{m+1} divides |R2||R_{2}|. This proves the claim. ∎

Proof of Proposition 4.2.

i) \implies ii): suppose that σmcombσ\sigma\sim_{m}^{comb}\sigma^{\prime}. We may assume that the cycle type of σ\sigma^{\prime} is formed from that of σ\sigma by replacing pmp^{m} cycles of length kk with pm1p^{m-1} cycles of length pkpk. Write σ=σ1σ2\sigma=\sigma_{1}\sigma_{2} where σ1\sigma_{1} is a product of pmp^{m} disjoint kk-cycles and σ2\sigma_{2} is disjoint from σ1\sigma_{1}. Then σ1=τpm\sigma_{1}=\tau^{p^{m}} for τ\tau a kpmkp^{m}-cycle also disjoint from σ2\sigma_{2}. Since τpm1\tau^{p^{m-1}} is a product of pm1p^{m-1} disjoint cycles of length kpkp, we see that the conjugacy class of σ\sigma^{\prime} is represented by τpm1σ2=τpm1pmσ=(τp1)pm1σ\tau^{p^{m-1}}\sigma_{2}=\tau^{p^{m-1}-p^{m}}\sigma=(\tau^{p-1})^{p^{m-1}}\sigma. Since τ\tau commutes with σ\sigma, we obtain σmσ\sigma\sim_{m}\sigma^{\prime}.

ii) \implies iii): this is Theorem 3.4.

iii) \implies i): We proceed by double induction: on mm, and backwards on the length of the smallest cycle where σ\sigma and σ\sigma^{\prime} differ in cycle type. The base case m=1m=1 follows from Brauer’s theory: if σ\sigma has cycle type μ\mu, then the semisimple part σs\sigma_{s} has cycle type formed by replacing parts of size pk,(k,p)=1p^{\ell}k,(k,p)=1, in μ\mu with pp^{\ell} parts of size kk. Hence, if σs\sigma_{s} and σs\sigma^{\prime}_{s} are conjugate, then σ1combσ\sigma\sim_{1}^{comb}\sigma^{\prime}.

Now suppose that m2m\geq 2 and σ,σSn\sigma,\sigma^{\prime}\in S_{n} are such that χ(σ)χ(σ)modpm\chi(\sigma)\equiv\chi(\sigma^{\prime})\mod p^{m} for all characters χ\chi of SnS_{n}. Let kk be the smallest cycle length which appears in σ\sigma and σ\sigma^{\prime} with different multiplicity. Then σ\sigma and σ\sigma^{\prime} have cycle types μ=(ξ,ki,η)\mu=(\xi,k^{i},\eta) and ν=(ξ,kj,τ)\nu=(\xi,k^{j},\tau) for partitions ξ\xi, η\eta, and τ\tau such that all parts in η\eta and τ\tau have size greater than kk. By induction, we have σm1combσ\sigma\sim_{m-1}^{comb}\sigma^{\prime}, which implies pm1(ij)p^{m-1}\mid(i-j). This implies npkn\geq pk, so we may set λ=(npk,kp)\lambda=(n-pk,k^{p}). Any row decomposition of λ\lambda by μ\mu or ν\nu places no parts of η\eta or τ\tau into the parts of length kk. Hence applying Lemma 4.5 (ij)/pm1(i-j)/p^{m-1} times gives

Mμλ=Mνλ(ij)modpm.M^{\lambda}_{\mu}=M^{\lambda}_{\nu}-(i-j)\mod p^{m}.

Since χ(σ)χ(σ)modpm\chi(\sigma)\equiv\chi(\sigma^{\prime})\mod p^{m} for all characters χ\chi of SnS_{n}, we conclude pm(ij)p^{m}\mid(i-j). Assume without loss of generality that j>ij>i. Then σmcombσ′′\sigma^{\prime}\sim_{m}^{comb}\sigma^{\prime\prime} for σ′′\sigma^{\prime\prime} of cycle type (ξ,ki,(pk)(ij)/p,τ)(\xi,k^{i},(pk)^{(i-j)/p},\tau). By the case i) \implies iii) above, we have χ(σ)χ(σ′′)modpm\chi(\sigma^{\prime})\equiv\chi(\sigma^{\prime\prime})\mod p^{m} for all characters χ\chi of SnS_{n}. Now σ\sigma and σ′′\sigma^{\prime\prime} have the same number of cycles of length kk, so by induction, σmcombσ′′\sigma\sim_{m}^{comb}\sigma^{\prime\prime} and thus σmcombσ\sigma\sim_{m}^{comb}\sigma^{\prime}.

5 Questions and Conjectures

Proposition 4.2 says that m\sim_{m} 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 pp-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 pp, characterize the finite groups GG such that χ(g)χ(g)modpm\chi(g)\equiv\chi(g^{\prime})\mod p^{m} for all unramified χ\chi if and only if gmgg\sim_{m}g^{\prime} as in Definition 3.5.

Problem 5.2.

Characterize the finite groups GG such that for all primes pp, χ(g)χ(g)modpm\chi(g)\equiv\chi(g^{\prime})\mod p^{m} for all unramified χ\chi if and only if gmgg\sim_{m}g^{\prime} as in Definition 3.5.

Conjecture 5.3.

If GG is a finite simple group of Lie type and pp is a prime different from the defining characteristic from GG, then χ(g)χ(g)modpm\chi(g)\equiv\chi(g^{\prime})\mod p^{m} for all unramified χ\chi if and only if gmgg\sim_{m}g^{\prime}.

Question 5.4.

Let GG be a pp-group. For gGg\in G, what is the largest power pmp^{m} such that χ(g)χ(e)modpm\chi(g)\equiv\chi(e)\mod p^{m} for all unramified characters χ\chi?

Remark 5.5.

We could ask the same question for an arbitrary group GG, but the pp-group case is of particular interest. Moreover, we have reason to believe the pp-group case might have a relatively nice answer. The unramified characters of pp-groups are the same as the rational characters, and a result of Ford ([For87], Theorem 3) says that every rational character of a pp-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 GG, 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 pp-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