This paper proves a variation of Thompson's Theorem showing that certain finite groups with restricted character table properties are trivial, using the classification of finite simple groups.
Contribution
It introduces a new variation of Thompson's Theorem relating character table properties to the triviality of specific group substructures.
Findings
01
Groups with two distinct non-divisible character table entries are trivial.
02
Uses classification of finite simple groups to establish the result.
03
Provides a new criterion for group triviality based on character table analysis.
Abstract
We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group G contains only two distinct values not divisible by a given prime number p>3, then Opp′pp′(G)=1. This is done by using the classification of finite simple groups.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
We prove a variation of Thompson’s Theorem.
Namely, if the first column of the character table of a finite group G contains only two distinct values
not divisible by a given prime number p>3, then Opp′pp′(G)=1. This is done by using the classification of finite simple groups.
Mathematics Classification Number: 20C15, 20C33
Keywords: Character degrees, Finite simple groups.
1 Introduction
Many problems in the character theory of finite groups deal with character degrees and prime numbers. For instance, the Itô-Michler theorem ([13],[20]) asserts that a prime p does not divide χ(1) for any χ∈Irr(G) if and only if the group G has a normal abelian Sylow p-subgroup. As usual, we denote by Irr(G) the set of complex irreducible characters of G and by Irrp′(G) the subset of Irr(G) consisting of irreducible characters of degree coprime to p. If we write cd(G) for the set of character degrees of G and cdp′(G) for the subset of cd(G) consisting of those character degrees not divisible by p, the Itô-Michler theorem deals with the situation when cdp′(G)=cd(G).
At the opposite end of the spectrum, we have a theorem of Thompson ([29]) showing that if cdp′(G)={1}, then G has a normal p-complement.
In [1], Berkovich showed that in this situation, G is solvable, using the Classification of Finite Simple Groups.
In [9], a variation on Thompson’s theorem for two primes is studied. Namely, it is shown there that if G has only one character with degree coprime to two different primes, then G is trivial. In this paper, we offer another variation on Thompson’s theorem by describing finite groups G such that ∣cdp′(G)∣=2. Thompson’s theorem may equivalently be viewed in terms of Opp′(G), where Opp′(G)=Op′(Op(G)). Namely, Thompson’s theorem says that if cdp′(G)=1 then Opp′(G)=1. Similarly, we will denote by Opp′pp′(G) the group Opp′(Opp′(G)) and prove a corresponding statement for the case ∣cdp′(G)∣=2.
Theorem A**.**
Let G be a finite group and let p>3 be a prime. Suppose that ∣cdp′(G)∣=2. Then G is solvable and Opp′pp′(G)=1.
We remark that Theorem A answers Problem 5.3 of [21], which suggested that groups satisfying ∣cdp′(G)∣=2 must be p-solvable. It is already said in [21] that there are many examples of non-solvable groups satisfying ∣cd2′(G)∣=2 (the symmetric group on 5 letters is the smallest one). For p=3, we have that if G is the automorphism group of PSL2(27), then ∣cd3′(G)∣=2, for instance.
We also remark that, for a given prime p, we can find examples of non-solvable groups G satisfying ∣cdp′(G)∣=3. For instance, the alternating group on 5 letters, A5, satisfies that ∣cdp′(A5)∣=3 for p=2,3,5. For p>5, we have that ∣cdp′(PGL2(p))∣=3.
Further, unlike many statements on character degrees, Theorem A does not immediately seem to correspond to a dual statement for conjugacy classes. For instance, we observe that A5 has exactly two conjugacy classes of size coprime to 5.
As in the case of the result of Berkovich, our proof of Theorem A uses the Classification of Finite Simple Groups. In particular, we need the following result on simple groups.
Theorem B**.**
Let S be a non-abelian simple group and let p>3 be a prime. Then there exist nonlinear α,β∈Irrp′(S) such that α extends to Aut(S), β(1)∤α(1), and β is P-invariant for every p-subgroup P≤Aut(S).
We obtain Theorem B as a corollary to the following stronger statement, after dealing with the exceptions separately.
Theorem C**.**
Let S be a non-abelian simple group and let p>3 be a prime dividing ∣S∣. Assume that S is not one of A5,A6 for p=5 or one of PSL2(q),PSL3ϵ(q),PSp4(q), or 2B2(q). Then there exist two nontrivial characters α,β∈Irrp′(S) such that α(1)=β(1) and both α and β extend to Aut(S).
This article is structured as follows. In Section 2, we prove Theorem A assuming that Theorem B is true and show that Theorem C (and hence Theorem B) holds for sporadic groups. In Section 3, we prove Theorem B for the alternating groups. Finally, in Section 4, we prove Theorem B for simple groups of Lie type and we conclude by using the Classification of Finite Simple Groups.
Acknowledgement The authors would like to thank Gabriel Navarro for many useful conversations on this topic. They would also like to thank the Mathematisches Forschungsinstitut Oberwolfach and the organizers of the 2019 MFO workshop “Representations of Finite Groups”, where part of this work was completed. The second author is supported by a Fellowship FPU of Ministerio de Educación, Cultura y Deporte. The third author is partially supported by a grant from the National Science Foundation (Award No. DMS-1801156).
2 Reduction to simple groups
In this section we assume Theorem B and we prove Theorem A. We will need the following result, which is essentially Lemma 4.1 of [23]. We provide a proof for the reader’s convenience.
Lemma 2.1**.**
Let Q be a finite group acting on a finite group N and suppose that N=S1×⋯×St, where the Si′s are transitively permuted by Q. Let Q1 be the stabilizer of S1 in Q and let T={a1,⋯,at} be a transversal for the right cosets of Q1 in Q with Si=S1ai. Let ψ∈Irr(S1) be Q1-invariant. Then
[TABLE]
is Q-invariant.
Proof.
First, we have that Q acts transitively on T, and we use the notation ai⋅q to indicate the
unique element of T such that Q1(aiq)=Q1(ai⋅q) for ai∈T and q∈Q. Now notice that Q acts on N as follows: if q∈Q and Siq=Sj (that is, if ai⋅q=aj), then (x1,...,xt)q=(y1,…,yt), where yj=xiq. Let q∈Q, and let σ∈St be the permutation defined by ai⋅q=aσ(i), so xiq=yσ(i). Then
[TABLE]
∎
Theorem 2.2**.**
Let G be a finite group and let p>3 be a prime. Suppose that ∣cdp′(G)∣=2. Then G is solvable.
Proof.
We argue by induction on ∣G∣.
Write cdp′(G)={1,m}. Let N be a minimal normal subgroup of G. Then either N is abelian or N is semisimple. It is clear that ∣cdp′(G/N)∣≤∣cdp′(G)∣. Hence by induction and Proposition 9 of [1] we have that G/N is solvable.
Suppose that N=S1×S2×⋯×St where Si≅S, a non-abelian simple group. Write H=NG(S1) and Si=S1xi, where G=⋃i=itHxi is a disjoint union. By Theorem B, there exist α∈Irrp′(S1) with α(1)=1, extending to Aut(S1), and β∈Irrp′(S1)P-invariant for every p-subgroup P≤Aut(S1), with β(1)∤α(1).
Now let θ=αx1×⋯×αxt∈Irr(N). By Lemma 5 of [2] we have that θ extends to G. Let θ~∈Irr(G) extending θ. Then θ~(1)=θ(1)=α(1)t is not divisible by p and hence, by hypothesis, θ~(1)=m.
Let Q∈Sylp(G) and write {T1,…,Tr} for a set of representatives of the action of Q on {S1,…,St}, with T1=S1. Write O(Ti) for the orbit of Ti under the action of Q. Rearrange S1,S2,…,St in such a way that O(T1)={S1,S2,⋯,Sl1}, O(T2)={Sl1+1,…,Sl2}, etc. Notice that l1+l2+⋯lr=t. Write N1=S1×S2×⋯×Sl1, N2=Sl1+1×⋯×Sl2, etc. Notice that Q normalizes Ni and N=N1×N2×⋯×Nr.
Now, let U={q1,q2,…,ql1} be a transversal for the right cosets of Q1=Q∩NG(S1) in Q such that Sj=S1qj for j=1,2,…,l1, and define γ1∈Irr(N1) as follows:
[TABLE]
By Lemma 2.1 we have that γ1 is Q-invariant. If Ti=S1xk proceed analogously with βxk to define γi∈Irr(Ni) (notice that βxk is Qk-invariant, where Qk=NG(S1xk)∩Q). By Lemma 2.1, we have that γi is Q invariant for all i=1,2,…,r.
Now, let
[TABLE]
We claim that γ is Q-invariant. Indeed, let q∈Q and let n1n2⋯nr∈N, with ni∈Ni. Since Q normalizes Ni for all i, we have:
[TABLE]
Notice that γ(1)=β(1)t and hence, γ∈Irrp′(N). Then gcd(o(γ)γ(1),∣NQ:N∣)=1 and since γ is Q-invariant, we have that γ extends to γ~∈Irr(NQ). Since γ~(1) and ∣G:NQ∣ are not divisible by p, there exists χ∈Irr(G∣γ~) of p′-degree. But χ∈Irr(G∣γ), and hence γ(1)∣χ(1). Since γ(1)=1, we have that χ(1)=1, and therefore χ(1)=m. Hence β(1)t=γ(1) divides χ(1)=m=α(1)t, and β(1)∣α(1). This contradiction shows that N is abelian and hence G is solvable.
∎
Let G be a finite group and let p>3 be a prime. Suppose that ∣cdp′(G)∣=2. Then Opp′pp′(G)=1.
Proof.
Let K=Op(G), L=Op′(K)=Opp′(G), N=Op(L)=Opp′p(G) and W=Op′(N)=Opp′pp′(G), and write cdp′(G)={1,m}. Let W/X be a chief factor of G. Then W/X is a minimal normal subgroup of G/X and since G is solvable, we have that W/X is abelian. Now, if a prime q, different from p, divides ∣W:X∣, we have that W/X has a normal q-complement H/X and ∣W:H∣ is not divisible by p, a contradiction with the fact that W=Op′(N). Hence W/X is a p-group.
Now, if X>1, since cdp′(G/X)⊆cdp′(G), by induction and Thompson’s theorem we have that Opp′pp′(G/X)=X and hence W=X, a contradiction. Therefore we may assume that X=1.
Let Y be a complement of W in N. By the Frattini argument, we have that G=NNG(Y)=WNG(Y). Since W is abelian, we have that CW(Y)⊲G and then W∩NG(Y)=CW(Y)=1. Hence W is complemented in G and by Problem 6.18 of [11], every λ∈Irr(W) extends to Gλ.
Let P be a Sylow p-subgroup of G, let 1W=λ1,λ2…,λt be representatives of the action of P on Irr(W) and let Oi be the P-orbit of λi. Then
[TABLE]
Then there exists i>1 such that ∣Oi∣λi(1)2 is not divisible by p. Since ∣Oi∣=∣P:Pλi∣, we have that ∣Oi∣=1 and hence there is 1W=λ∈Irr(W)P-invariant. Let T=Gλ and let λ^ be an extension of λ to T. Then λ^G∈Irr(G) and λ^G(1)=∣G:T∣. But P⊆T and hence ∣G:T∣=p′. By hypothesis, ∣G:T∣=m.
If λ is N invariant, we have that
[TABLE]
and [N,W]⊆ker(λ). But [N,W]⊲G and [N,W]⊆W. Since W is a minimal normal subgroup of G we have that [N,W]=W or [N,W]=1. If [N,W]=1, we have that [Y,W]⊆[N,W]=1 and hence by Lemma 4.28 of [12] we have that W=1 and we are done. Thus we may assume that [N,W]=W. Then W⊆ker(λ), which contradicts the fact that λ=1W. Hence N⊆T.
If cdp′(G/N)={1}, by Thompson’s theorem we are done. Then we may assume that cdp′(G/N)={1,m}. Let χ∈Irr(G/N) with χ(1)=m and let ϵ∈Irr(TN/N) lying under χ of p′-degree. Since N⊆ker(ϵ), we have that ϵT is irreducible and ρ=ϵTλ^∈Irr(T∣λ). Thus ρG∈Irr(G∣λ) and
[TABLE]
is not divisible by p. Then ∣G:T∣ϵ(1)=m=∣G:T∣ and ϵ is linear. Now, since χ is an irreducible constituent of ϵG we have that
[TABLE]
This contradiction shows that W=1. ∎
We end this section with the following, which can be seen using the GAP Character Table Library.
Proposition 2.4**.**
Let S be a simple sporadic group or the Tits group 2F4(2)′. Then Theorem C holds for S.
3 Alternating Groups
The aim of this section is to prove Theorem B for alternating groups. We achieve this goal by proving the slightly stronger Proposition 3.5.
We begin by recalling some basic facts in the representation theory of symmetric and alternating groups.
The irreducible characters of the symmetric group Sn are labelled by partitions of n. We let P(n) be the set of partitions of n. Given λ=(λ1,…,λℓ)∈P(n), we denote by χλ the corresponding irreducible character of Sn. We sometimes use the notation λ⊢n to say that λ∈P(n) and we use the symbol λ⊢p′n to mean that χλ∈Irrp′(Sn), for some prime number p. Given λ∈P(n) we let λ′ be the conjugate partition of λ.
We recall that the restriction to the alternating group (χλ)An is irreducible if,
and only if, λ=λ′ (see [14, Thm. 2.5.7]). Moreover, if λ,μ∈P(n) then (χλ)An=(χμ)An if, and only if, μ∈{λ,λ′}.
Given λ∈P(n) we denote by [λ] its corresponding Young diagram. The node (i,j) of [λ] lies in row i and column j. As usual, we denote by h(i,j)(λ) the hook-length corresponding to (i,j). We let H(λ) be the multiset of hook-lengths in λ.
By the hook-length formula [14, Thm. 2.3.21] we know that χλ(1)=n!(∏h∈H(λ)h)−1.
Given e∈N we let He(λ) be the multiset of hook-lenghts in H(λ) that are divisible by e.
The e-core Ce(λ) of λ is the partition of n−e∣He(λ)∣ obtained from λ by successively removing hooks of length e. A useful consequence of work of Macdonald [16] is stated here (see [9, Lemma 2.4] for a short proof).
Lemma 3.1**.**
Let p be a prime and let n be a natural number with p-adic expansion
n=∑j=0kajpj. Let λ be a partition of n. Then λ⊢p′n if and only if ∣Hpk(λ)∣=ak and Cpk(λ)⊢p′n−akpk.
We let L(n)={λ∈P(n)∣λ2≤1}. Elements of L(n) are usually called hook partitions. We denote by Lp′(n) the set consisting of all those hook partitions of n whose corresponding irreducible character of Sn has degree coprime to p.
In the following proposition we completely describe the elements of Lp′(n) and we give a closed formula for ∣Lp′(n)∣. This might be known to experts in the area, but we were not able to find an appropriate reference in the literature.
Proposition 3.2**.**
Let n∈N and let n=∑j=1kajpnj be its p-adic expansion, where 0≤n1<n2<⋯<nk and 1≤aj≤p−1 for all j∈{1,…,k}. Then
[TABLE]
Moreover, for λ,μ∈L(n) we have that χλ(1)=χμ(1) if and only if λ∈{μ,μ′}.
Proof.
We proceed by induction on k, the p-adic length of n.
Suppose first that k=1. If n1=0 then n=a1<p and therefore ∣Lp′(n)∣=∣L(n)∣=a1. On the other hand, if n1>0 and λ∈L(n) then h(1,1)(λ)=n=a1pn1. It follows that ∣Hpn1(λ)∣=a1 and that Cpn1(λ)=∅. Using Lemma 3.1 we conclude that λ∈Lp′(n) and hence that L(n)=Lp′(n). Therefore, we have that ∣Lp′(n)∣=a1pn1.
Let us now assume that k≥2. Let m:=n−akpnk and let γ∈Lp′(m).
We denote by Aγ the subset of Lp′(n) defined as follows:
[TABLE]
Observing that the pnk-core of a hook partition is a hook partition and using Lemma 3.1 we deduce that
[TABLE]
where the above union is clearly disjoint.
Given γ∈Lp′(m) we notice that the set Aγ consists of all those hook partitions of n that are obtained from γ by adding x-many pnk-hooks to the first row of [γ] and (ak−x)-many to the first column of [γ].
In particular
[TABLE]
We conclude that ∣Aγ∣=ak+1, for all γ∈Lp′(m). This, combined to the inductive hypothesis shows that:
[TABLE]
The second statement is a consequence of a very well known fact. Namely that for λ=(n−x,1x)∈L(n) we have that χλ(1)=(xn−1).
(This can be easily deduced from the hook length formula).
∎
Given a natural number n and S⊂P(n) we let cd(S)={χλ(1)∣λ∈S}. Moreover, we let cdp′ext(An) be the set consisting of all the degrees of irreducible characters of An of degree coprime to p that extend to Sn. Here we find a lower bound to
∣cdp′ext(An)∣.
Proposition 3.3**.**
Let n∈N. Then ∣cdp′ext(An)∣≥⌊∣Lp′(n)∣/2⌋.
Proof.
A hook-partition λ∈L(n) is such that λ=λ′ if and only if n is odd and λ=((n+1)/2,1(n−1)/2). Moreover, the set Lp′(n) is clearly closed under conjugation of partitions. It follows that ((n+1)/2,1(n−1)/2)∈Lp′(n) if and only if ∣Lp′(n)∣ is odd. Let S={λ∈Lp′(n)∣λ1>λ1′}. The above discussion shows that ∣S∣=⌊∣Lp′(n)∣/2⌋. The second statement of Proposition 3.2 implies that ∣cd(S)∣=∣S∣.
We observe that if λ∈S then (χλ)An is irreducible of degree coprime to p and clearly extends to Sn. In other words, (χλ)An(1)∈cdp′ext(An).
Moreover, for λ,μ∈S we have that (χλ)An(1)=(χμ)An(1) if and only if λ=μ. Thus we conclude that
∣cdp′ext(An)∣≥∣cd(S)∣=∣S∣=⌊∣Lp′(n)∣/2⌋, as desired.
∎
In order to verify that Theorem C holds for alternating groups,
we aim of to show that ∣cdp′ext(An)∣≥3, for all n≥7.
Propositions 3.2 and 3.3 give in most of the cases a much larger lower bound than the one needed. In fact, Proposition 3.5 below is a consequence of these propositions, together with the analysis of the cases where n∈N is such that ⌊∣Lp′(n)∣/2⌋≤2.
The following facts are easy applications of the hook-length formula and are important to deal with the few exceptional cases mentioned above.
Lemma 3.4**.**
Let n,t,c∈N be such that c∈{2,3}, n≥4+c and 0≤t≤n−2c.
Let λ(t) be the partition of n defined as λ(t):=(n−c−t,c,1t)∈P(n). If 0≤t≤⌊2n−4−c⌋,
then
[TABLE]
Proof.
To ease the notation we let m:=λ(t)1=n−c−t.
The (strange) hypothesis 0≤t≤⌊2n−4−c⌋ is equivalent to say that λ(t+1)1≥(λ(t+1)′)1. In turn this is equivalent to say that 0≤t≤m−4.
If c=2 then using the hook length formula we observe that
[TABLE]
where the first inequality is obtained by replacing t with m−4.
The proof of the statement for c=3 is completely similar and therefore it is omitted.
∎
We care to remark that a more general statement (with arbitrary c∈N) does not hold, as for instance is shown by the pair (6,5,1,1) and (5,5,1,1,1).
Proposition 3.5**.**
Let n≥7 be a natural number and let p>3 be a prime, then ∣cdp′ext(An)∣≥3.
Proof.
Let n=∑j=1kajpnj be the p-adic expansion of n, where 0≤n1<n2<⋯<nk and 1≤aj≤p−1 for all j∈{1,…,k}.
Suppose that
[TABLE]
since n≥7, then ∣cdp′ext(An)∣≥3, by Propositions 3.2 and 3.3.
To conclude the proof, we analize the remaining cases one by one.
Suppose first that n=1+apk, for some a∈{1,2,3}. Let t∈N be such that 0≤t≤⌊2n−6⌋ and let λ(t)=(n−2−t,2,1t). Observe that λ(t)=(λ(t))′. By Lemma 3.4 we have that
[TABLE]
Moreover, since h(1,1)(λ(t))=apk and Cpk(λ(t))=(1), then Lemma 3.1 implies that χλ(t)∈Irrp′(Sn), for all t∈{0,1,…,⌊2n−6⌋}.
Since n=1+apk≥7 it follows that n≥8 and hence that ⌊2n−6⌋≥1. Since λ(t) is never equal to the trivial partition,
we conclude that ∣cdp′ext(An)∣≥3.
Let k,h∈N be such that k<h, and suppose that n=1+pk+ph. To ease the notation we let m=1+pk. By Lemma 3.1 it is easy to observe that
[TABLE]
Since p≥5 we have that ∣Pp′(m)∣≥3. For each γ∈Pp′(m) we let
[TABLE]
Using Lemma 3.1 it is now routine to check that λ(γ)⊢p′n. Moreover, since ph>m we have that λ(γ)=(λ(γ))′ for all γ∈Pp′(m). Therefore, using again Lemma 3.4 we conclude that also in this case ∣cdp′ext(An)∣≥3.
Finally suppose that n=2+pk, for some k∈N. Let t∈N be such that 0≤t≤⌊2n−7⌋ and let λ(t)=(n−3−t,3,1t). Observe that λ(t)=(λ(t))′. Since h(1,1)(λ(t))=pk and Cpk(λ(t))=(2), by Lemma 3.1 we deduce that χλ(t)∈Irrp′(Sn), for all t∈{0,1,…,⌊2n−7⌋}.
If pk=5 then n≥9 and hence ⌊2n−7⌋≥1.
Since λ(t) is never equal to the trivial partition, using Lemma 3.4 we conclude that ∣cdp′ext(An)∣≥3.
If pk=5 then direct verfication shows that ∣cdp′ext(A7)∣≥3.
∎
We are now ready to prove Theorem B.
Corollary 3.6**.**
Theorem B holds for all simple non-abelian alternating groups.
Proof.
Let n≥5.
Since p>3 a Sylow p-group P of Aut(An) is necessarily contained in An. Hence all irreducible characters of An are P-invariant. With this in mind, we observe that for all n≥7 Theorem B follows from Proposition 3.5.
If n=5 then (in accordance with the notation used in the statement of Theorem B) we choose α=(χ(4,1))A5 and β an irreducible constituent of (χ(3,1,1))A5. Similarly for n=6 we observe that Theorem B holds by choosing α=(χ(4,2))A6 and β an irreducible constituent of (χ(3,2,1))A6.
∎
4 Simple Groups of Lie Type
Throughout this section, we will adopt the following notation. Let S be a simple group of Lie type, by which we mean that there is a simply connected simple linear algebraic group G defined over Fq such that S=G/Z(G), where G:=GF is the group of fixed points of G under a Steinberg endomorphism F. Here Fq is an algebraic closure of the field Fq with q elements, and q is a power of some prime. We further write G∗=(G∗)F∗, where (G∗,F∗) is dual to (G,F).
We denote by ι:G↪G a regular embedding, as in [5, Chapter 15], and let ι∗:G∗↠G∗ be the dual surjection of algebraic groups. When F is a Frobenius endomorphism, we may extend F to a Frobenius endomorphism on G, which we also denote by F, and we let G:=GF and G∗:=(G∗)F∗ be the corresponding group of Lie type and its dual, respectively. Then G⊲G and the automorphisms of G are generated by the inner automorphisms of G (known as inner-diagonal automorphisms of G) together with graph and field automorphisms.
When G is of type An−1, we use the notation PSLnϵ(q) with ϵ∈{±1} to denote PSLn(q) for ϵ=1 and PSUn(q) for ϵ=−1. We will also use the corresponding notation for SLnϵ(q),GLnϵ(q), and PGLnϵ(q).
The goal of this section is to prove the following, which is Theorem B for groups of Lie type.
Theorem 4.1**.**
Let S be a simple group of Lie type defined over Fq and let p>3 be a prime dividing ∣S∣. Assume that S is not one of PSL2(q),PSL3ϵ(q),PSp4(q), or 2B2(q). Then there exist two nontrivial characters χ1,χ2∈Irrp′(S) such that χ1(1)=χ2(1) and both χ1 and χ2 extend to Aut(S).
To deal with the exceptions in Theorem 4.1, we prove the following, which is Theorem C.
Theorem 4.2**.**
Let S be a simple group of Lie type defined over Fq and let p>3 be a prime dividing ∣S∣. Then there exist two nontrivial characters χ1,χ2∈Irrp′(S) such that χ2(1)∤χ1(1), χ1 extends to Aut(S), and χ2 is invariant under every p-group of Aut(S).
4.1 Defining Characteristic
We begin by fixing some notation for this section. Let q=pa be a power of a prime p>3. We fix a:=pb⋅m where (m,p)=1, b≥0, and m≥1. In what follows, it will be useful to consider certain elements of Fq×. For a positive integer n, we will denote by ζn an element of order pn−1 in Fq× and by ξn an element of order pn+1 in Fq×. In particular, ζ1∈Fp×⊆Fq×, ζm∈Fq×, and ξm∈Fq2×∖Fq×. We also have ξ1∈Fq2× and further ξ1∈Fq× if and only if q is a square.
4.1.1 Establishing the Basic Strategy
Suppose that F is a Frobenius map. In what follows, we will often proceed following ideas like those in [25, Theorem 4.5(4)] and [26, Proposition 6.4] to construct characters of S=G/Z(G) satisfying our desired properties, using characters of G. Namely, if s is a semisimple element of G∗, there exists a unique so-called semisimple character χs of p′-degree associated to the G∗-conjugacy class of s, and χs(1)=[G∗:CG∗(s)]p′. If further s∈[G∗,G∗], then χs is trivial on Z(G), using [22, Lemma 4.4]. Furthermore, the number of irreducible constituents of χ:=χs∣G is exactly the number of irreducible characters θ∈Irr(G/G) satisfying χsθ=χs, and we have Irr(G/G)={χz∣z∈Z(G∗)} and E(G,s)χz=E(G,sz) for such z∈Z(G∗), by [7, 13.30]. Then χ is irreducible if and only if s is not G∗-conjugate to sz for any nontrivial z∈Z(G∗). Finally, if φ∈Aut(G) and φ∗:G∗→G∗ is dual to φ, then [24, Corollary 2.4] tells us that χsφ=χφ∗(s).
Therefore, in the context of proving Theorem 4.1, we will be interested in showing that there exist two nontrivial semisimple elements s1,s2∈G∗ such that:
(1)
s1,s2 are contained in [G∗,G∗];
(2)
for i=1,2, si is not conjugate to siz for any nontrivial z∈Z(G∗);
(3)
the G∗-classes of s1 and s2 are Aut(G∗)-invariant; and
(4)
∣CG∗(s1)∣p′=∣CG∗(s2)∣p′.
In the context of Theorem 4.2, we will need to replace (3) and (4) with:
(3’)
the G∗-class of s1 is Aut(G∗)-invariant and that of s2 is fixed by p-elements of Aut(G∗); and
(4’)
∣CG∗(s1)∣p′∤∣CG∗(s2)∣p′.
4.1.2 The Proofs in Defining Characteristic
Proposition 4.3**.**
Let S be a simple group of Lie type defined in characteristic p>3 not in the list of exclusions of Theorem 4.1. Then the conclusion of Theorem 4.1 holds for S and p.
Proof.
First assume S is one of G2(q),F4(q), or 3D4(q). The character degrees in these cases are available at [15], and the generic character tables are available in CHEVIE [8]. Here Aut(S)/S is cyclic generated by a field automorphism, so characters extend to Aut(S) if and only if they are invariant under Aut(S). In the case of G2(q), there is a unique character of degree (q4+q2+1) and a unique character of degree (q3+ϵ), where ϵ=±1 is such that q≡ϵ(mod6), so the statement holds for G2(q). Similarly, F4(q) has a unique character of degree (q8+q4+1) and a unique character of degree (q2+1)(q4+1)(q8+q4+1). Since 3D4(q) has a unique character of degree (q8+q4+1), it suffices in this case to find another member of Irrp′(S) invariant under field automorphisms. Taking k to be such that γk∈Fp×, where γ generates Fq×, this is accomplished by χ13(k) in CHEVIE notation, which has degree (q+1)(q8+q4+1).
Hence we may assume S is not in the above list, and by Section 3, we may assume that S is not isomorphic to an alternating group. Also note that we may assume G does not have an exceptional Schur multiplier. Let D≤Aut(G) be as in [27, Notation 3.1], so that D is generated by appropriate graph and field automorphisms and Aut(G) is generated by D and the inner automorphisms of G.
Since [G:G] is coprime to p, we see by Clifford theory that the set of members of Irr(G) lying above members of Irrp′(G) is exactly the set Irrp′(G). By [27, Proposition 3.4], for every χ∈Irrp′(G), there is a character χ0∈Irr(G∣χ) such that (G⋊D)χ0=Gχ0⋊Dχ0 and χ0 extends to G⋊Dχ0. Further, if χ∣G=χ0 and χ is D-invariant, it further follows that χ0 extends to G⋊D, following the proof of [27, Lemma 2.13], since the factor set constructed there for the projective representation of (G⋊D)χ0 extending χ0 is trivial in this case.
Hence it suffices to show that there exist D-invariant χ1,χ2∈Irrp′(G) that are trivial on Z(G), have different degrees, and satisfy that χ1∣G and χ2∣G are irreducible. In particular, it suffices to find s1 and s2 as described in Section 4.1.1 satisfying conditions (1)-(4). For condition (2), we note that by [3, Corollary 2.8(a)], it suffices to show that CG∗(ι∗(si)) are connected, and hence by [19, Exercise 20.16(c)], to choose si such that (∣si∣,∣Z(G)∣)=1.
First, suppose that G is not of type Aℓ. Let Φ and Δ:={α1,α2,⋯,αℓ} be a system of roots and simple roots, respectively, for G∗ with respect to a maximal torus T∗, following the standard model described in [10, Remark 1.8.8]. Note that we may assume that ∣Δ∣≥3 if Φ is type Bℓ or Cℓ, ∣Δ∣≥4 if Φ is type Dℓ, and otherwise Φ is type E6,E7, or E8. Further, our assumptions imply that if the Dynkin diagram for Φ has a nontrivial graph automorphism, then all members of Δ have the same length and that automorphism has order 2 unless Φ is of type D4.
Given α∈Φ, let hα denote the corresponding coroot, following the notation of [10]. Notice that for α∈Φ and t∈Fq×, we have hα(t)∈[G∗,G∗]. (See, for example, [10, Theorem 1.10.1(a)].) Let δ∈Fp× be such that ∣δ∣ is prime to ∣Z(G)∣, if possible. Otherwise, we have G is type E7,Bℓ,Cℓ, or Dℓ and p−1 is a power of 2. (Note that if G is type E6, and p−1 is a power of 3, then p=2, contradicting our assumption that p>3). In these latter cases, let δ be an element of Fp2× with order prime to ∣Z(G)∣ dividing p+1.
We define s1′:=hα1(δ)hα2(δ)⋯hαℓ−1(δ)hαℓ(δ). Let β be a member of Δ as follows. For Φ of type E6,E7, or E8, let β:=α4. If Φ is of type Cℓ or Dℓ, let β:=αℓ. If Φ is type Bℓ, let β:=α1.
Let s2′:=hβ(δ) for Φ not of type Dℓ; s2′:=hαℓ(δ)hαℓ−1(δ) for Φ of type Dℓ with ℓ≥5; and s2′:=hα1(δ)hα3(δ)hα4(δ) for Φ of type D4. Note then that for i=1,2, si′ is fixed under graph automorphisms and (∣si′∣,∣Z(G)∣)=1.
If δ∈Fq×, we see that the si′ are F∗-fixed, and we write si:=si′. Otherwise, the elements α1+…+αℓ and β are members of Φ, and in the case of Dℓ, we have αℓ+αℓ−1=2eℓ−1 and for ℓ=4, α1+α3+α4=e1−e2+2e3. In the first case, let w˙∈NG∗(T∗) induce the corresponding reflection in the Weyl group of G∗. In the case of αℓ+αℓ−1 in type Dℓ, we may take w˙ to be the product of members of NG∗(T∗) inducing the reflections in the Weyl group of G∗ for αℓ and αℓ−1, and similarly for α1+α3+α4 in the case of D4. In any case, we have si:=si′g is F∗-fixed, where g∈G∗ satisfies g−1F∗(g)=w˙. (Note that such a g exists by the Lang-Steinberg theorem.) Hence s1 and s2 are members of [G∗,G∗].
Further, we have constructed s1 and s2 to be fixed under graph automorphisms and such that ∣CG∗(s1)∣p′=∣CG∗(s2)∣p′. The latter can be seen by analyzing the root information in [10] and using the fact that CG∗(si) has root system Φsi where Φsi consists of α∈Φ with α(si)=1 (see [7, Proposition 2.3]). Let Fp denote a generating field automorphism such that Fp(hα(t))=hα(tp) for α∈Φ and t∈Fq×. Then for i=1,2, si′ is G∗-conjugate to Fp(si′), taking for example w˙ as the conjugating element when si′=Fp(si′). Hence si is also G∗-conjugate to Fp(si). Since the CG∗(si) are connected, this yields that the si are G∗-conjugate to Fp(si), using [7, (3.25)]. Then s1 and s2 are semisimple elements satisfying (1)-(4), as desired.
Now let Φ be of type An−1, so that G≅G∗≅GLnϵ(q), G≅[G∗,G∗]=SLnϵ(q), and G∗≅PGLnϵ(q), with ϵ∈{±1} and n≥4. If (p,ϵ)=(5,+1), let δ∈Cp−ϵ, viewed as a subgroup of Fq2, be such that δ=ζ1 in case ϵ=1 and δ=ξ1 in case ϵ=−1. Note that ∣δ∣>4, from the conditions on p. If (p,ϵ)=(5,+1), let δ be an element of order 6 in F25. Then in any case, we have δ chosen such that ∣δ∣>4.
Recall that the class of a semisimple element in GLnϵ(q) is determine by its eigenvalues. Let s1∈G∗ have eigenvalues {δ,δ−1,1,1,…,1} and s2 have eigenvalues {δ,δ,δ−1,δ−1,1,…,1}. Then CG∗(s1)≅GLn−2ϵ(q)×GL1ϵ(q)2 and CG∗(s2)≅GLn−4ϵ(q)×GL2ϵ(q)2, unless ϵ=−1 and q is square or (p,ϵ)=(5,+) and q is nonsquare, in which case CG∗(s1)≅GLn−2ϵ(q)×GL1(q2) and CG∗(s2)≅GLn−4ϵ(q)×GL2(q2). In any case, we therefore have ∣CG∗(s1)∣p′=∣CG∗(s2)∣p′. Since the graph automorphism acts via inverse-transpose on GLn(q) and the generating field automorphism acts on semisimple elements by raising the eigenvalues to the power of p, we see that the G∗-classes of s1 and s2 are each Aut(G∗)-invariant. Further, as s1 and s2 have determinant 1, they are contained in [G∗,G∗]=SLnϵ(q).
Now, in this case, Z(G∗) is comprised of matrices of the form μ⋅In, where μ is an element of Cq−ϵ, viewed as a subgroup of Fq2. Since ∣δ∣=2, we see by comparing eigenvalues that s1 cannot be conjugate to s1z for any nontrivial z∈Z(G∗). Now, if s2z is conjugate to some z∈Z(G∗), then there is some μ as above such that δμ=δ−1 and δ−1μ=δ, except possibly if n=6, in which case δμ=1 is another possibility. In the latter case, μ=δ−1, so s2z has eigenvalues {1,1,δ−2,δ−2,δ−1,δ−1}, so we must have δ−2=δ, contradicting ∣δ∣>4. Hence we are in the case δμ=δ−1 and δ−1μ=δ. Then μ=δ−2=δ2, again contradicting ∣δ∣>4. Hence in all cases, we have exhibited the desired elements s1,s2∈G∗, and the proof is complete.
∎
We remark that the conclusion of Theorem 4.1 fails for PSL2(q) and PSL3(q) when q is a square. Indeed, in these cases, the only option for Aut(G∗)-invariant semisimple classes of G∗ would be comprised of elements with eigenvalues {δ,δ−1} and {δ,δ−1,±1}, respectively, where δp=δ or δ−1. If q is a square, both options would yield δ∈Fq, so all corresponding semisimple characters have the same degree. However, we can show the following:
Lemma 4.4**.**
Let S≅PSL2(q), PSL3ϵ(q), or PSp4(q) with q a power of a prime p>3. Then the conclusion of Theorem 4.2 holds for S and p. Moreover, if q is not square and further p=5 in the case of PSL2(q), then the conclusion of Theorem 4.1 holds for S and p.
Proof.
Note that since p>3, the graph and diagonal automorphisms are not in a p-subgroup of Aut(S). In particular, the only p-elements of D are induced from field automorphisms of p-power order. Arguing as in the proof of Proposition 4.3, it suffices to show that there are two semisimple elements s1,s2 of G∗ satisfying conditions (1), (2), (3’), and (4’) from Section 4.1.1. Throughout the proof, let q=pa where a=pbm with (m,p)=1.
(i) First suppose that p>5 and S≅PSL2(q). Note that since p>5, both ζ1 and ξm have order larger than 4. Let s1∈G∗ have eigenvalues {ζ1,ζ1−1}, and s2 have eigenvalues {ξm,ξm−1}. Then s1 and s2 satisfy conditions (1), (2), (3’), and (4’) from Section 4.1.1. Here CG∗(s1)≅GL1(q)2, CG∗(s2)≅GL1(q2), and the corresponding semisimple characters have degrees χ1(1)=q+1 and χ2(1)=q−1, respectively. This proves the first statement when p>5 and S≅PSL2(q).
(ii) Next let p=5 and S≅PSL2(q). First suppose m>1. Here we may take s1∈G∗ to have eigenvalues {ξ1,ξ1−1}, and take s2 to have eigenvalues {ζm,ζm−1} if 2∤m and eigenvalues {ξm,ξm−1} if 2∣m. Then if 2∤m, we have CG∗(s1)≅GL1(q2) and CG∗(s2)≅GL1(q)2. When 2∣m, the centralizers of s1 and s2 are reversed. In either case, however, we obtain χ1 and χ2 satisfying the required conditions, as above.
Now let m=1, so q=55b. Then q≡1(mod4) and q≡−1(mod3). We obtain an Aut(S)-invariant character χ1 constructed using s1 as in the case in the previous paragraph. Here χ1(1)=q−1. Further, we see from the generic character table that there is a character of degree (q+1)/2 which is invariant under every field automorphism, completing the proof of the first statement for PSL2(q).
(iii) Now let S be PSL3ϵ(q), with p≥5. Notice that an element s∈G∗ with eigenvalues {δ,δ−1,1} with ∣δ∣≥4 cannot be conjugate to sz for any nontrivial z∈Z(G∗), as then the sets {δ,δ−1,1} and {δμ,δ−1μ,μ} are the same for some μ∈Cq−ϵ, yielding δ3=1. Note ∣ζ1∣≥4 since p≥5. Hence we may construct s1 and s2 analogously to case (i) above. Namely, let s1 have eigenvalues {ζ1,ζ1−1,1}, and let s2 have eigenvalues {ξm,ξm−1,1}. Then s1 and s2 satisfy properties (1),(2),(3’),(4’) of Section 4.1.1. Here CG∗(s1)≅GL1(q)3 in case ϵ=1, and CG∗(s1)≅GL1(q2)×GU1(q) in case ϵ=−1. Further, CG∗(s2)≅GL1(q2)×GL1(q) in case ϵ=1 and CG∗(s2)≅GU1(q)3 in case ϵ=−1. Hence χ1(1)=(q+1)(q2+ϵq+1) and χ2(1)=(q−1)(q2+ϵq+1).
(iv) Now let S=PSp4(q). The character table of G=Sp4(q) and of G=CSp4(q) are available in [28] and [4], respectively. From this we see that the characters in the families χ8(k) and χ6(ℓ) with k∈{1,...,(q−3)/2},ℓ∈{1,....,(q−1)/2} in the notation of [28], with degrees (q+1)(q2+1) and (q−1)(q2+1), respectively, contain Z(G) in the kernel and extend to G. Further, comparing notations shows these extensions are invariant under the same field automorphisms as the characters of G. Choosing k and ℓ such that γk=ζ1 and ηℓ=ξm, where γ generates Fq× and η generates the cyclic group of size q+1 in Fq2×, we see that χ1:=χ8(k) and χ2:=χ6(ℓ) satisfy the desired properties.
(v) Finally, let q be nonsquare, and further assume p>5 in the case S≅PSL2(q). Let s1 be as in part (i) in the case PSL2(q) and as in part (iii) for PSL3ϵ(q). Let s2 in G∗ have eigenvalues {ξ1,ξ1−1} or {ξ1,ξ1−1,1}, respectively. In this case ξ1∈Fq2×∖Fq× has order larger than 4. These elements satisfy conditions (1)-(4) discussed in Section 4.1.1. In particular, when S≅PSL2(q), the semisimple characters corresponding to s1 and s2 have degrees q+1 and q−1, respectively. When S≅PSL3ϵ(q), the semisimple characters corresponding to s1 and s2 have degrees (q+1)(q2+ϵq+1) and (q−1)(q2+ϵq+1), respectively. Then in these cases, as in the proof of Proposition 4.3, the conclusion of Theorem 4.1 holds.
Now let S=PSp4(q). Here we let χ1 be as in (iv), and let χ2 be the character χ6(ℓ), where ℓ is now chosen so that ηℓ=ξ1 is a p+1 root of unity in Fq2∖Fq. Then χ1 and χ2 both extend to Aut(S) and have different degrees, completing the proof.
∎
4.2 Non-Defining Characteristic
In this section, we address the proofs of Theorems 4.1 and 4.2 in the case p∤q.
Proposition 4.5**.**
Let S be a simple group of Lie type defined over Fq not in the list of exclusions of Theorem 4.1, and let p>3 be a prime dividing ∣S∣ but not dividing q. Or let S=2B2(q2) where q2:=22m+1 and let p>3 be a prime dividing ∣S∣ but not dividing q2−1. Then the conclusion of Theorem 4.1 holds for S and p.
Proof.
By [18, Theorem 2.4], every unipotent character of S extends to its inertia group in Aut(S), so it suffices to find two unipotent characters with different degrees in Irrp′(S) that are invariant under Aut(S). Since the Steinberg character StS is one such character, we aim to exhibit another nontrivial unipotent character of p′-degree invariant under Aut(S).
Further, [18, Theorem 2.5], yields that every unipotent character of S is invariant under Aut(S) unless S is a specifically stated exception for one of Dn(q) with n even, B2(q) with q even, G2(q) with q a power of 3, or F4(q) with q even.
The unipotent characters of classical groups are indexed by partitions in case of type An−1 and 2An−1 and by “symbols” in the other types. Discussions of these symbols and the corresponding character degrees are available in [6, Section 13.8]. In Table 1, we list two unipotent characters for each classical type that extend to Aut(S) by [18, Theorems 2.4 and 2.5]. Further, p>3 cannot divide the degree of both characters listed simultaneously, which can be seen, for example, by an application of [17, Lemma 5.2]. Hence taking χ1=StS and χ2 the character listed whose degree is not divisible by p, the desired statement holds in the case of classical types.
Similarly, for groups of exceptional type, Suzuki and Ree groups, and 3D4(q), by observing the explicit list of unipotent character degrees in [6, Section 13.9], we see that there is likewise always a second unipotent character with degree not divisible by p, except in the case of 2B2(q2) or 2G2(q2) with p∣(q2−1). Further, these can again be chosen not to be one of the exceptions listed in [18, Theorem 2.5]. When S=2G2(q2) and p∣(q2−1), we may consider instead the unique character of degree q4−q2+1, which must be invariant under Aut(S), and hence extends since Aut(S)/S is cyclic.
∎
Together, note that Propositions 4.3 and 4.5 prove Theorem 4.1.
We also note the following, which follows from the proof of Lemma 4.4 and ideas from Proposition 4.5, together with the fact that PSL3ϵ(q) has a unipotent character of degree q(q+ϵ).
Lemma 4.6**.**
Let p>3 be a prime and let S≅PSL2(q) or PSL3ϵ(q) be simple with q a power of a prime r>3, where r=p. Then the conclusion of Theorem 4.2 holds for S and p. Moreover, the conclusion of Theorem 4.1 holds for S and p in the following situations:
•
S=PSL2(q), r>5, and p∤(q+1) or q is not square;
•
S=PSL3(q)* and p∤(q+1) or q is not square;*
•
S=PSU3(q).
To complete the proof of Theorem 4.2, we need to consider 2B2(22n+1), PSL2(q), and PSL3ϵ(q) when q is a power of 2 or 3 and p∤q. These are treated in the next two Lemmas.
Lemma 4.7**.**
*Let p>3 be a prime and let S≅PSL2(q) or PSL3ϵ(q) be simple with q a power of 2 or 3. Then the conclusion of Theorem 4.2 holds for S and p. *
Proof.
Let r∈{2,3}. Note that we omit the cases PSL2(r), since S is simple. As before, we take χ1=StS, and show that there exists χ2 satisfying the desired properties.
First suppose that q=rpb for some positive integer b. Notice then that p∤(q2−1). Indeed, otherwise we have p∣Φ2pc(r) or p∣Φpc(r) for some nonnegative integer c, and hence by [17, Lemma 5.2], we have r has order 1,2, or a power of p modulo p. Since the latter is impossible, it follows that p∣(r2−1), which is impossible since p>3 and r≤3. If S=PSL3ϵ(q), we may take χ2 to be the unipotent character of degree q2+ϵq, and in fact the conclusion of Theorem 4.1 holds in this case using [18, Theorems 2.4 & 2.5]. In the case S=PSL2(q) and r=3, we have q≡−1(mod4), and we may take χ2 to be a character of degree (q−1)/2, which is fixed by the field automorphisms. In the case r=2 and S≅PSL2(q), let s∈G∗ have eigenvalues {δ,δ−1} where ∣δ∣=3. Then the corresponding semisimple character of G restricts to SL2(q)≅PSL2(q) irreducibly, is fixed by field automorphisms, and has degree q±1. Letting χ2 be the corresponding irreducible character of S, we are done in this case.
So we may assume q=ra where r∈{2,3}, and a=pbm with m>1 and (m,p)=1. Let S=PSL3ϵ(q). If p∤(q+ϵ), we may again take χ2 to be the unipotent character of degree q2+ϵq, and the conclusion of Theorem 4.1 holds. So assume that p∣(q+ϵ). Arguing similarly to above, we see that this excludes the case (r,m)=(2,2) if ϵ=−1, so we may further assume (r,m)=(2,2) if ϵ=−1. Taking s∈G∗ to have eigenvalues {δ,δ−1,1} with ∣δ∣=rm+ϵ, we may argue as before to obtain a character χ2 of S with degree (q−ϵ)(q2+ϵq+1), which is not divisible by p, that is invariant under every p-element of Aut(S).
Now let S=PSL2(q). Then taking si∈G∗ for i=1,2 to have eigenvalues {δi,δi−1}, with ∣δ1∣=rm−1 and ∣δ2∣=rm+1, we obtain characters with degree (q+1) and (q−1) of S that are invariant under p-elements of Aut(S). Since p>3 cannot divide both of these character degrees, we may make an appropriate choice for χ2, which completes the proof.
∎
Lemma 4.8**.**
Let S be a simple Suzuki group 2B2(q2) with q2=22n+1 and let p>3 be a prime dividing q2−1. Then the conclusion of Theorem 4.2 holds for S and p.
Proof.
As before, we may take χ1 to be the Steinberg character. Now, since Aut(S)/S is cyclic of size 2n+1, generated by field automorphisms, it suffices to exhibit a character χ2 with degree coprime to p that is invariant under field automorphisms of p-power order. Let 2n+1=pbm with (m,p)=1. Arguing as in Lemma 4.7, we see m>1, since p∣(q2−1). Hence letting s be such that γs has order 2m−1, where γ has order q2−1, we may take χ2 to be the character χ5(s) in CHEVIE notation. Then χ2 has degree q4+1 and is invariant under p-elements of Aut(S).
∎
Theorem 4.2 now follows by combining Lemmas 4.4, 4.6, 4.7, and 4.8 with Theorem 4.1, which completes the proofs of Theorems A-C.
Bibliography29
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Yakov Berkovich. Finite groups with small sums of degrees of some non-linear irreducible characters. J. Algebra , 171(2):426–443, 1995.
2[2] Mariagrazia Bianchi, David Chillag, Mark L. Lewis, and Emanuele Pacifici. Character degree graphs that are complete graphs. Proc. Amer. Math. Soc. , 135(3):671–676, 2007.
3[3] Cédric Bonnafé. Quasi-isolated elements in reductive groups. Comm. Algebra , 33(7):2315–2337, 2005.
4[4] Jeffery Breeding II. Irreducible characters of G S p ( 4 , q ) 𝐺 𝑆 𝑝 4 𝑞 {G}{S}p(4,q) and dimensions of spaces of fixed vectors. The Ramanujan Journal , 36(3):305–354, April 2015.
5[5] Marc Cabanes and Michel Enguehard. Representation theory of finite reductive groups , volume 1 of New Mathematical Monographs . Cambridge University Press, Cambridge, 2004.
6[6] Roger W. Carter. Finite groups of Lie type . Wiley Classics Library. John Wiley & Sons Ltd., Chichester, 1993. Conjugacy classes and complex characters, Reprint of the 1985 original.
7[7] François Digne and Jean Michel. Representations of finite groups of Lie type , volume 21 of London Mathematical Society Student Texts . Cambridge University Press, Cambridge, 1991.
8[8] Meinolf Geck, Gerhard Hiss, Frank Lübeck, Gunter Malle, and Götz Pfeiffer. CHEVIE – A system for computing and processing generic character tables for finite groups of Lie type, Weyl groups and Hecke algebras. Appl. Algebra Engrg. Comm. Comput. , 7:175–210, 1996.