The Navarro refinement of the McKay conjecture for finite groups of Lie type in defining characteristic
Lucas Ruhstorfer
Fachbereich Mathematik, TU Kaiserslautern, 67653 Kaiserslautern, Germany
[email protected]
Abstract.
In this paper we verify Navarro’s refinement of the McKay conjecture for quasi-simple groups of Lie type in their defining characteristic. Navarro’s refinement takes into account the action of specific Galois automorphisms on the characters present in the McKay conjecture [13]. Our proof of this case of the conjecture relies on a character correspondence constructed by Maslowski in [12]. Building on this we verify the inductive condition for Navarro’s refinement from [15] for most groups of Lie type in defining characteristic.
Key words and phrases:
McKay conjecture, groups of Lie type
2010 Mathematics Subject Classification:
20C33
1. Introduction
For a finite group G, a prime p and a Sylow p-subgroup P of G the McKay conjecture asserts that there exists a bijection between the set of p′-degree characters Irrp′(NG(P)) of NG(P) and the set of p′-degree characters Irrp′(G) of G.
However, Navarro suggests that there should exist a bijection between these sets of characters which is compatible with certain Galois automorphisms. Denote by Qab the field generated by all roots of unity in C. Let H be the subgroup of G:=Gal(Qab/Q) consisting of all σ∈G for which there exists an integer e such that σ sends any p′-root of unity ζ to ζpe. He then proposes the following refinement of the McKay conjecture, see [13, Conjecture A].
Conjecture 1.1**.**
There exists an H-equivariant bijection between Irrp′(NG(P)) and Irrp′(G).
This conjecture implies several character-theoretical consequences. One of them was proved by Navarro, Tiep and Turull, see [17, Theorem A] and another recently by Schaeffer Fry, see [19].
It therefore seems important to study and verify Conjecture 1.1 for as many families of finite groups as possible. We contribute to this program by proving the following theorem.
Theorem 1.2**.**
Let G be a simple algebraic group of simply connected type defined over an algebraic closure of Fp and F:G→G a Frobenius endomorphism. Suppose that (G,F) is not contained in the table of Theorem 4.3 below. Then there exists an H-equivariant bijection
[TABLE]
where P is a Sylow p-subgroup of GF.
The proof of Theorem 1.2 is based on Maslowski’s work on the inductive McKay condition for simple groups of Lie type in defining characteristic. He constructs a certain automorphism-equivariant bijection for the p′-characters of the universal covering group of a finite simple group of Lie type defined over a field of characteristic p.
For the original McKay conjecture a reduction theorem was proved by Isaacs, Malle and Navarro, see [9, Theorem B]. Recently, Navarro, Späth and Vallejo [15] were able to provide a reduction theorem for Navarro’s refinement of the McKay conjecture. Their theorem asserts that Conjecture 1.1 holds for all finite groups and the prime p if all nonabelian simple groups satisfy the so-called inductive Galois–McKay condition for the prime p. We show here that the inductive Galois–McKay condition holds for many groups of Lie type in defining characteristic.
Theorem 1.3**.**
Suppose that (G,F) satisfies Assumption 5.4. If S:=GF/Z(GF) is a simple non-abelian group and GF is its universal covering group then the inductive Galois–McKay condition from [15, Definition 3.1] holds for the group S and the prime p.
To prove this theorem, we show that the bijection constructed in Theorem 1.2 is suitable for the inductive Galois–McKay condition. In order to do this, we compute the stabilizers of p′-characters under the simultaneous action of Galois automorphisms and group automorphisms. Then we use the theory of Gelfand–Graev characters for disconnected reductive groups to explicitly compute extensions of these characters to certain almost simple groups. The results obtained here may be of independent interest since they give information about character values of characters of almost simple groups.
The structure of our paper is as follows. In Section 2 we introduce some notation. In Section 3 we recall some basic facts about the representation theory of finite groups of Lie type. We discuss the action of Galois automorphisms on Lusztig series and recall a description of irreducible p′-characters originally due to Green, Lehrer and Lusztig. In Section 4 we recall the McKay bijection due to Maslowski[12]. In Section 5 we use the results of the two previous sections to prove Theorem 1.2. Section 6 and 7 are then devoted to the proof Theorem 1.3.
Acknowledgement
This paper originates from the results of the author’s master thesis [18] at the Technische Universität Kaiserslautern. I would like to express my gratitude to my supervisor Gunter Malle for his useful remarks and comments during the development of my thesis. I thank Britta Späth for suggesting this topic and for fruitful discussions.
The author would like to thank the Isaac Newton Institute for Mathematical Sciences for support and hospitality during the programme Groups, representations and applications: new perspectives when work on this paper was undertaken. This work was supported by: EPSRC grant number EP/R014604/1.
2. Notation
2.1. Rings and fields
For an integer m we denote by Qm the m-th cyclotomic field.
Let p be a prime and q an integral power of p. We let k be an algebraic closure of Fp. Let ℓ be a prime different from p and denote by K an algebraic closure of the field of ℓ-adic numbers. Denote by (Q/Z)p′ the subgroup of elements of the abelian group Q/Z whose order is not divisible by p. We fix once and for all an isomorphism k×→(Q/Z)p′ and an injective morphism k×↪K×.
2.2. Characters of finite groups
If Y is a finite group we denote by Irr(Y) the set of irreducible K-valued characters of Y. For K-valued characters we mostly follow the notation of [8]. Let us briefly state the main deviations from the notation in [8]. If X is a normal subgroup of Y and ϑ∈Irr(X) we denote by Yϑ the inertia group of ϑ in Y. Moreover, we denote by Irr(Y∣ϑ) the set of irreducible characters of Y which occur as constituents of the induced character ϑY. We say that characters in the set Irr(Y∣ϑ) lie above ϑ. Similarly, if χ∈Irr(Y) we mean by Irr(X∣χ) the set of irreducible characters of X occurring as constituents of the restriction χX. Such characters are said to lie below χ.
2.3. Finite groups and Galois automorphisms
Let Y be a finite group.
By Brauer’s theorem the Galois group G=Gal(Qab/Q) acts on the set of irreducible characters Irr(Y). Following the notation of [15] for a Galois automorphism σ∈G and a generalized character χ∈ZIrr(Y) we let χσ∈ZIrr(Y) be the generalized character defined by χσ(y)=σ(χ(y)), for y∈Y. This defines indeed a group action of G on Irr(G) since G is abelian.
Furthermore, χH denotes the H-orbit {χσ∣σ∈H} of the character χ.
3. Representation theory of groups of Lie type
3.1. Lusztig series and Galois automorphisms
Let G be a connected reductive group defined over Fq via a Frobenius endomorphism F:G→G. We fix an F-stable maximal torus T of G contained in an F-stable Borel subgroup B. Let U be the unipotent radical of B. We denote by Φ the root system of G with respect to the torus T and by Δ={α1,…,αn} the set of simple roots of Φ with respect to T⊆B. We let Φ+ be the set of positive roots and Φ∨ the set of coroots.
Fix a triple (G∗,T∗,F∗) in duality with (G,T,F) as in [4, Definition 13.10]. This together with the choices made in 2.1 gives rise to a bijection between the set of GF-conjugacy classes of pairs (S,θ) where S is an F-stable maximal torus of G and θ∈Irr(SF) with the set of (G∗)F∗-conjugacy classes of pairs (S∗,s) where s∈(G∗)F∗ is a semisimple element and S∗ is an F∗-stable maximal torus with s∈S∗, see [4, Proposition 13.13].
If s∈(G∗)F∗ is a semisimple element we denote by (s) its (G∗)F∗-conjugacy class. We denote by E(GF,(s))⊆Irr(GF) its rational Lusztig series. We have the following lemma, see the proof of [16, Lemma 9.1].
Lemma 3.1**.**
Let σ∈G such that and σ(ζ)=ζk for a primitive ∣GF∣-th root of unity ζ∈K. Then we have σ(E(GF,(s)))=E(GF,(sk)).
3.2. Gelfand–Graev characters
In order to introduce the Gelfand–Graev characters of GF we proceed as in the proof of [3, Theorem 2.4]. The Frobenius endomorphism F of G induces an automorphism γ of the character group X(T). Since T is a maximally split torus it follows by [11, Proposition 22.2] that γ stabilizes the set of positive roots Φ+ and the set of simple roots Δ. Hence, γ acts on the index set of Δ={α1,…,αn} which yields a partition
[TABLE]
of the index set of Δ into its γ-orbits. For each Ai we fix a representative ai∈Ai. If α∈Φ we let Uα be the root subgroup of G associated to the root α∈Φ. We denote by UAi, i=1,…,r, the product in U/[U,U] of the root subgroups Uα, αj, j∈Ai. By [3, Lemma 2.2] we have
[TABLE]
For each α∈Φ there is an isomorphism xα:(k,+)→Uα with F(xα(a))=xγ(α)(aq) for all a∈k and all α∈Φ. These maps induce an isomorphism xi:(Fq∣Ai∣,+)→UAiF given by
[TABLE]
Now fix a character ϕ0∈Irr((FqN,+)), where N=lcm(∣A1∣,…,∣Ar∣), such that the restriction of ϕ0 to (Fq,+) is nontrivial. Then any character ψ∈Irr(UAiF) is given by ψ(xi(a))=ϕ0(cia) for all a∈Fq∣Ai∣ and some ci∈Fq∣Ai∣. Any irreducible character ϕ∈Irr((U/[U,U])F) is of the form ϕ=i=1∏rϕi for some characters ϕi∈Irr(UAiF) and so we obtain the following.
Lemma 3.2**.**
The map δ:Irr((U/[U,U])F)→i=1∏rFq∣Ai∣
given by
[TABLE]
where the ci∈Fq∣Ai∣ are such that ϕi(xi(a))=ϕ0(cia) for all a∈Fq∣Ai∣ is a bijection.
Let ι:G↪G~ be an extension of G by a central torus such that G~ is a connected reductive group with connected center. Let ξ=δ−1(1,…,1) or more concretely,
[TABLE]
Denote by Γ1 the induced character ξGF. We have a natural isomorphism H1(F,Z(G))≅G~F/GFZ(G~)F by [10, Corollary 1.2] and [10, Proposition 1.5]. For z∈H1(F,Z(G)) we take a representative gz∈G~F and define the Gelfand–Graev character associated to the class z by Γz=gzΓ1.
4. A McKay-type bijection
We fix an indecomposable root system Φ of rank n. From now on G will denote a simple algebraic group of simply connected type with root system Φ defined over a field of characteristic p.
4.1. Frobenius endomorphisms
For α∈Φ we fix isomorphisms xα:(k,+)→Uα. If f is a positive integer we consider the Frobenius endomorphism Fpf:G→G given by Fpf(xα(a)):=xα(apf) for α∈Φ. Moreover, for every symmetry γ of the Dynkin diagram associated to Δ there exists a graph automorphism γ:G→G given by γ(xα(a)):=xγ(α)(a) for a∈k and α∈±Δ.
Up to inner automorphisms of G, every Frobenius endomorphism F of G defining an Fq-structure is of the form Fqγ for some symmetry γ and we may thus assume that F=Fqγ. Let w denote the order of γ. We say that F is a standard Frobenius endomorphism if F=Fq.
4.2. A regular embedding
The center of G is a finite group. We let dp be its minimal number of generators. For our fixed root system Φ we let d be the maximal dp occurring for any prime p. We have d=2 if the root system of G is of type Dn and n is even. In all other cases we either have d=1 or d=0.
Let S=(k×)d be a torus of rank d. Let ρ:Z(G)↪S be an injective group homomorphism and define a group G~ by
[TABLE]
We have embeddings G↪G~ and S↪G~ such that it is convenient to identify G and S with their images in G~. Under this identification G~=GS has connected center Z(G~)=S. Note that the construction of G~ depends on the choice of ρ. In [12, Section 6] explicit choices are made which we assume to be taken.
Note that B~=T~U=NG~(U) is a Borel subgroup of G~ with maximal torus T~=TS and unipotent radical U. We also denote by Fp and γ the extensions of the bijective morphisms from 4.1 to G~ as chosen in Section 3 and Section 4 of [12].
4.3. Generators of the torus
Recall that w denotes the order of the graph automorphism involved in F. Let us define an integer dˉ by
[TABLE]
If dˉ=0 we define t0=1. If dˉ=1 we let t0 be the generator of Z(G~F) as in [12, Section 10]. If dˉ=2 we let t0(1),t0(2) be the generators of Z(G~F) as in [12, Section 10]. In this case, we mean by t0 both elements t0(1) and t0(2).
Recall from 3.2 that the integer r denotes the number of γ-orbits of Δ. We let t1,…,tr∈T~F be as introduced in [12, Proposition 8.1] resp. [12, Proposition 10.2] which together with t0 generate the torus T~F.
4.4. The linear characters of UF
Let us from now on assume that GF is not of type B2(2), F4(2) or G2(3). In this case, we have [U,U]F=[UF,UF] by [7, Lemma 7]. By Lemma 3.2 we obtain a bijection
[TABLE]
Let S be a subset of {1,…,r}. We denote Sc={0,1,…,r}∖S. Define the character ϕS of UF/[UF,UF] to be ϕS=δ−1(c1,…,cr) with
[TABLE]
For simplicity we identify ϕS∈Irr(UF/[UF,UF]) with its inflation to UF. Note that with this notation the linear character ξ introduced in 3.2 coincides with ϕ{1,…,r}.
The action of T~F on the characters of UF can be described explicitly and one obtains the following result.
Proposition 4.1**.**
The characters {ϕS∈Irr(UF)∣S⊆{1,…,r}} form a complete set of representatives for the B~F-orbits on the linear characters of UF. Moreover any character ϕS∈Irr(UF) extends to its inertia group B~ϕSF=⟨ti∣i∈Sc⟩UF.
Proof.
This is [12, Proposition 8.4] and [12, Proposition 8.5].
∎
As a consequence of the previous proposition we can describe the action of Galois automorphisms on linear characters of UF.
Lemma 4.2**.**
Let σ∈G. Then there exists some t~∈T~F such that ϕSσ=ϕSt~ for every S⊆{1,…,r}.
Proof.
Let S={1,…,r}. By the uniqueness statement of Proposition 4.1 we have ϕSσ=ϕS′t~ for some S′⊆{1,…,r} and some t~∈T~F. Recall that the subgroups UAiF are stabilized by the T~F-action. Thus, we have
[TABLE]
Since the characters ϕi,ϕiσ∈Irr(UAiF) are nontrivial this implies S=S′ and ϕSσ=ϕSt~. Hence for every S⊆S we have ϕSσ=ϕSt~ as well.
∎
4.5. A labeling for the local characters
We can now parametrize the p′-characters of B~F. Let ψ∈Irrp′(B~F). Since UF is a normal p-subgroup of B~F and ψ has p′-degree it follows by Clifford’s theorem that ψ lies above a linear character of UF. Hence, by Proposition 4.1 there exists a uniquely determined subset S⊆{1,…,r} such that ψ lies above ϕS∈Irr(UF). By Clifford correspondence there exists a unique character λ∈Irr(B~ϕSF∣ϕS) with λB~F=ψ. Note that B~ϕSF=⟨ti∣i∈Sc⟩UF by Proposition 4.1. We define the map f~loc:Irrp′(B~F)→(K×)dˉ×Kr by
[TABLE]
and
[TABLE]
where λ is determined by ψ as above. For i∈Sc the values λ(ti) of the linear character λ are (qw−1)-th roots of unity, where w is as defined in 3.2. The elements of p′-order of K× are in the image of the embedding k×→K× chosen in 2.1. Hence, we may consider (f~loc(ψ))i as an element of Fqw and we obtain a map f~loc:Irrp′(B~F)→(Fqw×)dˉ×Fqwr.
Let A⊆(Fqw×)dˉ×Fqwr be the image of the map f~loc. By [12, Theorem 10.8] the map f~loc:Irrp′(B~F)→A is injective and hence a bijection.
4.6. The dual group
We give an explicit construction of the dual algebraic group of G~, following the construction in [12, Section 7]. It is similar to the construction in 4.2. Let G∨ be a simple algebraic group of simply connected type with root system Φ∨. We fix a maximal torus T∨ of G∨ and identify the root system of G∨ relative to the torus T∨ with the coroot system Φ∨.
We let S∨=(k×)d, where d is as in 4.2, and we choose an injective group homomorphism ρ∨:Z(G∨)→S∨ as in [12, Section 7]. Denote by G~∗ the resulting linear algebraic group G~∗=G∨×ρ∨S∨ with maximal torus T~∗:=T∨S∨. By the results of [12, Section 7] there exists a Frobenius endomorphism F∗ of G~∗ such that (G~,T~,F) is dual to the triple (G~∗,T~∗,F∗).
4.7. Fundamental weights
Since G∨ is a simple algebraic group of simply connected type its character group X(T∨) has a basis given by the fundamental weights. More precisely, let β1,…,βn∈X(T∨) be a basis of the root system Φ∨ (corresponding to α1∨,…,αn∨ under the identification of the root system of G∨ with Φ∨). Denote by ⟨,⟩:X(T∨)×Y(T∨)→Z the canonical pairing. Then there exist weights ωi∈X(T∨) satisfying ⟨ωi,βj∨⟩=δij for all i,j=1,…,n. Moreover, we let ωi~∈X(T~∗) be the unique extension of ωi to T~∗ which acts trivially on S∨.
4.8. The determinant map
Write g∈G~∗ as g=xz with x∈G∨ and z∈S∨. We define the determinant map det:G~∗→S∨ to be the map with det(xz)=zl where l is the exponent of the fundamental group of the root system Φ.
Note that the map det is a well-defined homomorphism of algebraic groups, see the remark below [12, Definition 7.2]. Furthermore, we denote by deti:G~∗→k× the i-th component of the determinant map.
4.9. The modified Steinberg map
Following Maslowski [12, Section 14], we introduce the modified Steinberg map which separates the semisimple conjugacy classes of G~∗.
By a theorem of Chevalley, see [11, Theorem 15.17], there exists a rational irreducible kG∨-module Vi which is a highest weight module of highest weight ωi∈Y(T∨). Let πi:G∨→k denote the trace function of the representation associated to the kG∨-module Vi. We define the Steinberg map
[TABLE]
as the product map of these trace functions.
A fundamental property of the Steinberg map is that two semisimple elements of G∨ are G∨-conjugate if and only if they have the same image under the Steinberg map, see [21, Corollary 6.7].
We can write any element g~∈G~∗ (not necessarily unique) as g~=xz with x∈G∨ and z∈S∨. In [12, Section 14] Maslowski defines the map π~:G~∗→(k×)d×kn by
[TABLE]
Based on the result of Steinberg mentioned above, Maslowski shows in [12, Proposition 14.2] that the map π~ separates semisimple conjugacy classes of G~∗. Moreover, the semisimple G~∗-conjugacy classes of elements s∈G~∗ with image π~(s) in (Fq×)d×Fqn are precisely the (q−1)dqn different Fq∗-stable semisimple conjugacy classes of G~∗.
4.10. A labeling for the global characters
We now describe a labeling for the p′-characters of G~F. Let χ∈Irrp′(G~F) be a p′-character. Then there exists a conjugacy class (s~) of (G~∗)F∗ such that χ∈E(G~F,(s~)).
We first consider the case that F=Fq. In this case, we define the label of χ by π~(s~)=(b0,(b1,…,bn))∈(Fq×)d×Fqn.
Now suppose that F is not a standard Frobenius map. Since (G~∗)F∗⊆(G~∗)Fqw∗ we have s~∈(G~∗)Fqw∗. In particular it holds π~(s~)=(b0,(b1,…,bn))∈(Fqw×)d×Fqwn. We define the label of χ by (b0(1),(ba1,…,bar))∈(Fq×)dˉ×Fqr, where ai∈Ai are the fixed representatives of the orbits of the γ-action and b0(1) is the first component of b0∈(Fqw×)d.
In any case, the possible labels which occur consist precisely of the elements of A, where A is defined as in 4.4. We shall denote by f~glo:Irrp′(G~F)→A the map which sends a character to its label.
4.11. The Maslowski bijection and its properties
From now on we often write H=HF for the group of fixed points under F of an F-stable subgroup H of G~. In most cases, the map f~glo:Irrp′(G~F)→A is known to be bijective.
Theorem 4.3**.**
*Suppose that (G,F) is not contained in the following table.
type
Frobenius map
Bn, Cn, Dn, G2, F4
q=2, w=1
G2
q=3,w=1
Then the map f~glo:Irrp′(G~)→A is a bijection. Consequently the map f~=f~glo−1∘f~loc:Irrp′(B~)→Irrp′(G~) is a bijection. Moreover, for every character λ∈Irr(Z(G~)) the bijection f~ restricts to a bijection Irrp′(B~∣λ)→Irrp′(G~∣λ).*
Proof.
See [12, Theorem 15.3] and the remarks following [20, Proposition 3.4].
∎
We shall keep the assumptions of Theorem 4.3 for the remainder of this article.
5. The McKay Conjecture and Galois automorphisms
This section is roughly divided in three parts. In 5.1 we show that the bijection f~:Irrp′(B~F)→Irrp′(G~F) is H-equivariant. After this, we relate the p′-characters of B~F (resp. of G~F) with the p′-characters of BF (resp. of GF). In 5.4 we use these results to provide a proof of Theorem 1.2 from the introduction.
We keep the assumptions of Theorem 4.3.
5.1. Compatibility of the character bijection with Galois automorphisms
We now show that the bijection f~:Irrp′(B~)→Irrp′(G~) is H-equivariant. In the following proof we freely use the notation introduced in Section 4.
Theorem 5.1**.**
The bijection
f~:Irrp′(B~)→Irrp′(G~)
is H-equivariant.
Proof.
Let ψ∈Irrp′(B~) with label f~loc(ψ)=(c0,(c1,…,cr)). Denote by χ=f~(ψ) the p′-character of G~ which has the same label as ψ. Fix a Galois automorphism σ∈H that sends any p′-root of unity ζ to ζpe.
We proceed in several steps. In a first step we compute the label g(ψσ) of the character ψσ. In a second step we prove that f~glo(χσ)=f~loc(ψσ) which implies f~(ψσ)=χσ since f~=f~glo−1∘f~loc.
First step: By Proposition 4.1 there exists a unique set S⊆{1,…,r} such that the character ψ∈Irrp′(B~) lies above the character ϕS∈Irr(U). By Clifford correspondence there exists a unique character λ∈Irr(B~ϕS∣ϕS) such that λB~=ψ.
Since ψ lies above ϕS it follows that ψσ lies above the character ϕSσ. By Lemma 4.2 we have ϕSσ=ϕSt~ for some t~∈T~. The character λσ lies above the character ϕSσ=ϕSt~. Since the factor group B~/U≅T~ is abelian we have (λσ)t~−1∈Irr(B~ϕS). Consequently, (λσ)t~−1 lies above the character ϕS and ((λσ)t~−1)B~=ψσ. Let m=∣G~∣ and ζ be a primitive m-th root of unity. We write mp for the highest p-power dividing m and mp′ for the p′-part of m. Furthermore we let k be an integer such that σ(ζ)=ζk. Since λ is linear we have λσ=λk. Thus we obtain
[TABLE]
By definition of the map f~loc we have (f~loc(ψσ))i=cik for every i∈Sc and (f~loc(ψσ))i=0 for i∈S. Consequently, the label of ψσ is given by f~loc(ψσ)=(c0k,c1k,…,crk).
Since σ∈H we have k≡pemodmp′. By [11, Table 24.1] it follows that qw−1 divides mp′, which implies that k≡pemod(qw−1). Since ci∈Fqw for all i, we have
[TABLE]
Second step: We have χ∈E(G~F,(s~)) for some semisimple conjugacy class (s~) of the dual group (G~∗)F∗. By Lemma 3.1 we have χσ∈E(G~F,(s~k)). We have m=∣(G~∗)F∗∣ since (G~,F) and (G~∗,F∗) are in duality, see [2, Proposition 4.4.4]. Thus, the order of the semisimple element s~ is a divisor of mp′. Since k≡pemodmp′ this shows s~pe=s~k. Hence, we have χσ∈E(G~F,(s~pe)).
First we assume that F=Fq is a standard Frobenius map. We may write s~∈G~∗ as s~=xz where x∈G∨ and z∈S∨. The label of the character χσ∈E(G~F,(s~pe)) is given by
[TABLE]
Note that det((xz)pe)=det(xz)pe since det is multiplicative. Recall that π~i(s~pe)=πi(xpe)ω~i(zpe) by definition of the modified Steinberg map. By [12, Lemma 14.1] we have πi(xpe)=πi(x)pe. Moreover, we have ω~i(zpe)=ω~i(z)pe since ω~i∈X(T~∗). Therefore we obtain π~i(s~pe)=πi(x)peω~i(z)pe=π~i(s~)pe. Since π~(xz)=(c0,(c1,…,cn)) we have π~((xz)pe)=(c0pe,(c1pe,…,cnpe)) and therefore the label of χσ is given by f~glo(χσ)=(c0pe,(c1pe,…,cnpe))=f~loc(ψσ) and we have f~(ψσ)=f~(ψ)σ, as required.
Let us now assume that F is not a standard Frobenius endomorphism. Let π~(s~)=(b0,(b1,…,bn))∈(Fqw×)d×Fqwn be the image of s~∈(G~∗)F∗⊆(G~∗)Fqw∗ under the modified Steinberg map. As we have shown above, the image of (s~pe) under the modified Steinberg map is given by π~(s~pe)=(b0pe,(b1pe,…,bnpe)). Let b0(1) be the first component of b0∈(Fqw×)dˉ. The label of the character χ∈E(G~F,(s~)) is given by f~glo(χ)=(b0(1),(ba1,…,bar)) and the label of χσ∈E(G~F,(s~pe)) is f~glo(χσ)=(b0(1)pe,(ba1pe,…,barpe)). We have f~loc(ψ)=(c0,(c1,…,cr))=(b0(1),(ba1,…,bar))=f~glo(χ) since f~(ψ)=χ. Thus, we conclude that
[TABLE]
This shows f~(ψσ)=χσ, as desired.
∎
The following remark will be crucial in the upcoming calculations.
Remark 5.2**.**
Let σ∈H be a Galois automorphism such that σ sends any p′-root of unity ζ to ζpe. Let χ∈Irrp′(G~) and ψ∈Irrp′(B~). By the proof of Theorem 5.1 and [12, Proposition 14.1] the characters χσ and χFpe have the same label, which implies that χσ=χFpe. The same argument (using [12, Proposition 9.4] instead of [12, Proposition 14.1]) shows that ψσ=ψFpe.
Theorem 5.1 gives us Theorem 1.2 in the case where Z(G) is trivial.
Corollary 5.3**.**
Suppose that Z(G)=1. Then there exists an H-equivariant bijection f:Irrp′(B)→Irrp′(G).
Proof.
By Theorem 4.3 and Theorem 5.1 we obtain an H-equivariant bijection Irrp′(B~∣λ)→Irrp′(G~∣λ) for any λ∈Z(G~).
Since Z(G)=1 we have G~≅G×Z(G~). By Theorem 5.1 we have an H-equivariant bijection f~:Irrp′(B~∣λH)→Irrp′(G~∣λH) for every central character λ∈Z(G~). So in particular, for λ=1Z(G~) we obtain a bijection f:Irrp′(B)→Irrp′(G).
∎
5.2. Group automorphisms
We denote by D the subgroup of Aut(G~F) generated by the restrictions to G~F of the graph automorphisms γ:G~→G~ which commute with F and the Frobenius endomorphism Fp:G~F→G~F as in 4.1 and 4.2. Note that BF is D-invariant. We may and we will choose the character ϕ0∈Irr(Fqw,+) in 3.2 such that it has order p. A consequence of that choice is that the characters ϕS, for S⊆{1,…,r} are Fp-stable. In particular, the character ξ=ϕ{1,…,r} is D-stable and so is the Gelfand–Graev character Γ1=ξGF.
5.3. Describing the p′-characters of GF
From now we work with the following assumption, see [20, Assumption 3.2]:
Assumption 5.4**.**
The group G=GF satisfies
[TABLE]
We denote by DG:ZIrr(GF)→ZIrr(GF) the Alvis–Curtis duality map, see [4, Chapter 8].
In what follows, we fix a Galois automorphism σ∈H such that σ maps every p′-root of unity ζ∈K× to ζpe. By Lemma 4.2 there exists some t~∈T~ such that ϕSσ=ϕSt~ for every S⊆{1,…,r}.
Lemma 5.5**.**
For every χ∈Irrp′(G~) there exists a character
χ0∈Irr(G∣χ) which satisfies
[TABLE]
.
Proof.
According to the proof of [20, Remark 3.4] for every χ∈Irrp′(G~) there exists a unique character χ0∈Irr(G∣χ) with (χ0,DG(Γ1))=±1. By Remark 5.2 we have χFpe=χσ. Since Γ1 is D-stable and σ−1t~ fixes Γ1 it follows that Fpeσ−1t~ fixes Γ1. The duality functor DG commutes with Galois automorphisms and group automorphisms of GF. Hence, it follows that Fpeσ−1t~ fixes DG(Γ1). Moreover, as χFpe=χσ it follows that χ0Fpeσ−1t~ is below χ. Thus, χ0Fpeσ−1t~ is the unique common constituent of χG and DG(Γ1). Therefore, χ0Fpeσ−1t~=χ0. Hence, G~χ0Dχ0⟨Fpeσ−1t~⟩ is contained in (G~D⟨σ⟩)χ0.
Now suppose that χ0g~dσ−1=χ0. This rewrites as χ0g~dt~−1Fpe−1=χ0. By the proof of [20, Remark 3.4] we have (G~D)χ0=G~χ0Dχ0.
It follows that g~d(t~−1)∈G~χ0 and dFpe−1∈Dχ0. Therefore, g~dσ−1∈(G~ψDψ)⟨Fpeσ−1t~⟩ which completes the proof.
∎
Lemma 5.6**.**
For every ψ∈Irrp′(B~) there exists a character ψ0∈Irr(B∣ψ) such that
[TABLE]
Proof.
Let ψ∈Irr(B~∣ϕS). By Clifford correspondence there exists a unique character λ∈Irr(B~ϕS∣ϕS) such that λB~=ψ. Denote I:=BϕS and define ψ0:=λIB.
By Remark 5.2 we have ψFpe=ψσ. Since ϕS is Fp-stable and σ−1t~ fixes ϕS it follows that Fpeσ−1t~ fixes ϕS. Consequently, λFpeσ−1t~∈Irr(B~ϕS∣ϕS) is the Clifford correspondent of ψ. From this it follows that λFpeσ−1t~=λ. This implies that the character ψ0=λIB is Fpeσ−1t~-stable as well. Hence, the right-hand side is a subset of the left-hand side. By the proof of [20, Remark 3.6] the character ψ0 satisfies (B~D)ψ0=B~ψ0Dψ0. The converse can now be proved verbatim as in Lemma 5.5.
∎
5.4. An equivariant bijection for the Galois–McKay conjecture
In the proof of the following theorem we closely follow the proof of [20, Theorem 2.10]. We set B:=B~F⋊D.
Theorem 5.7**.**
There exists an H×B-equivariant bijection
[TABLE]
Proof.
The groups H×B and Irr(B~/B) both act on Irrp′(B~). We let T be a transversal in Irrp′(B~) with respect to these combined actions. For every ψ∈T we fix a character ψ0∈Irr(B∣ψ) with the properties from Lemma 5.6 and let T0⊆Irrp′(B) be the set formed by these. This is an H×B–transversal in Irrp′(B).
The bijection f~ is (H×B)⋉Irr(B~/B)-equivariant by [20, Theorem 3.5] and Theorem 5.1.
It follows that the set f~(T) is a transversal in Irr(G~F) with respect to the (H×B)⋉Irr(B~/B)-action. For every χ∈f~(T) we fix a character χ0∈Irr(G∣χ) satisfying the properties of Lemma 5.5. Denote by T0′ the set formed by these characters.
For ψ∈T and ψ0∈T0 we define f(ψ0):=χ0, where χ0 is the unique element in T0′∩Irr(G∣f~(χ)). By Lemma 5.6 and Lemma 5.5 we have (H×B)ψ0=(H×B)χ0 for every ψ0∈T0 and χ0=f(ψ0). We can therefore extend f to an H×B–equivariant bijection f:Irrp′(B)→Irrp′(G)
by setting
[TABLE]
Proof of Theorem 1.2: If GF is not one of the groups excluded in Assumption 5.4 then Theorem 5.7 yields an H-equivariant bijection f:Irrp′(B)→Irrp′(G). Observe that U is a Sylow p-subgroup of G and B=NG(U). By an inspection of [11, Table 24.2] we observe that Z(G)=1 for all groups excluded in Assumption 5.4. Thus, in this case Corollary 5.3 applies. ∎
6. Group automorphisms and Galois automorphisms
The overall aim of this section is to explicitly construct extensions of suitable p′-characters χ∈Irr(G) to GDχ. It is known by [20, Remark 3.4] that every character χ extends to GDχ. Unfortunately, the proof given there is only an existence proof and little to no information is given about the extended characters. To prove the inductive Galois-McKay condition for G we need to be able to explicitly compute the action of the stabilizer (B×H)χ on the extensions of the characters to GDχ. To do this, we extend the ideas of [20] and combine them with the method of descending scalars. This yields more natural extensions of p′-characters.
6.1. Gelfand–Graev characters
We recall the construction of Gelfand–Graev characters for disconnected reductive groups. Let G be a connected reductive group and τ an automorphism of G commuting with F which stabilizes the F-stable pair (T,B). In addition, we assume that τ is a quasi-central automorphism (see [5, Definition 1.15]) and has finite order k. We consider the reductive group G⋊⟨τ⟩ and extend F to G⋊⟨τ⟩ by defining F(τ):=τ. Recall that Γ1=ξGF. We assume that τ stabilizes the character ξ. We let ξ^∈Irr(UF⋊⟨τ⟩) be the extension of ξ defined by ξ^(τ):=1 and denote Γ^1=ξ^GF⋊⟨τ⟩. By Mackey’s formula it follows that Γ^1 is an extension of Γ1. In particular, Γ^1 is multiplicity free.
Let ϕ:G⟨τ⟩→G⟨τ⟩ be a bijective morphism which stabilizes T⟨τ⟩ and commutes with F. Then ϕ restricts to an automorphism of GF⟨τ⟩. We denote by Aut0(GF⟨τ⟩) the set of automorphisms of GF⟨τ⟩ obtained in this way.
The following proposition is a generalization of [20, Remark 3.4(c)].
Proposition 6.1**.**
Assume the notation as above. Let χ∈Irr(GF) be a τ-invariant character such that DG(χ) is a constituent of Γ1. Then there exists an extension χ^∈Irr(GF⋊⟨τ⟩) of χ such that χ^y=μχ^ whenever y∈Aut0(GF⟨τ⟩)×G and μ∈Irr(⟨τ⟩) is a linear character of p′-order which satisfy Γ^1y=μΓ^1.
Proof.
We apply an idea already present in [20, Remark 3.4(c)].
Denote ψ:=DG(χ). Since the Gelfand–Graev character Γ1 is multiplicity free it follows that there exists a unique extension ψ^ of ψ with (ψ^,Γ^1)=0. As τ is a quasi-central automorphism of G we can apply [5, Proposition 3.13] and there exists an extension χ^ of χ to GF⋊⟨τ⟩ which can be obtained from ψ^ using the isometric involutions DG.τj, j=1,…,k, from [5, Definition 3.10]. The map DG.τj is defined using Harish–Chandra induction and restriction in the reductive group G⋊⟨τ⟩, hence it commutes with Galois automorphisms and group automorphisms of Aut0(GF⟨τ⟩). Therefore,
[TABLE]
where the last equality follows from the first sentence in the proof of [5, Proposition 3.30].
Consequently, the character χ^ satisfies χ^y=μχ^.
∎
The last proposition can be refined as follows. Let χ∈Irr(GF) be a τ-invariant character such that DG(χ) is a constituent of Γ1. Since χ is τ-invariant the character θ∈Irr(Z(G)∣χ) is τ-invariant as well. We denote by ξθ∈Irr(UZ) the unique character of UZ extending both θ and ξ. It follows that DG(χ) is a constituent of Γθ, where Γθ:=(ξθ)G. Note that both θ and ξ are τ-stable. Therefore, ξθ can be extended to a character ξ^θ of UZ⟨τ⟩ with ξ^θ(τ)=1. We denote Γ^θ:=(ξ^θ)G⟨τ⟩. The following proposition is then proved in the same way as Proposition 6.1. For completeness we will give a full proof here.
Proposition 6.2**.**
Assume the notation as above. Then there exists an extension χ^∈Irr(GF⋊⟨τ⟩) of χ such that χ^y=μχ^ whenever y∈Aut0(GF⟨τ⟩)×G satisfies Γ^θy=μΓ^θ for some linear character μ∈Irr(⟨τ⟩) of p′-order.
Proof.
Denote ψ:=DG(χ). Since Γ is multiplicity free it follows that Γθ is multiplicity free as well. It follows that there exists a unique extension ψ^ of ψ with (ψ^,Γ^θ)=0. As in the proof of Proposition 6.1 we obtain an extension χ^ of χ to GF⋊⟨τ⟩ which can be obtained from ψ^ using the isometric involutions DG.τj, j=1,…,k. As in the proof of loc. cit. we obtain
DG.τj(Γ^θ)y=DG.τj(Γ^θ)μ. Consequently, the character χ^ satisfies χ^y=μχ^.
∎
Note that the conclusions of Proposition 6.1 and Proposition 6.2 remain true if we replace Γ by any multiplicity-free character Γ′∈Irr(GF) with the property that Γ′=(ξ′)GF for a τ-stable linear character ξ′∈Irr(UF).
6.2. Action of automorphisms on regular characters
Let us now assume again that G is a simple algebraic group of simply connected type. The results of the previous sections suggest that it is important to study the action of Galois automorphisms on Gelfand–Graev characters. We do this by refining the result of Lemma 4.2.
Lemma 6.3**.**
Let σ∈G be a Galois automorphism.
- (a)
Assume that (G,F) is untwisted. For every σ∈G there exists some t~∈T~F0 with ϕSt~=ϕSσ for all S⊆{1,…,r} and γ(t~)t~−1∈Z(G~) for every graph automorphism γ of G.
2. (b)
Assume that G is not of type An, Dn if n is odd and p=2. For every σ∈G there exists some t~∈T~D with ϕSt~=ϕSσ for all S⊆{1,…,r}.
Proof.
Let us first assume that GF is not isomorphic to D4(q) or 3D4(q).
The automorphism σ∈H sends the element ϕ0∈Irr((Fqw,+)) again to an element of Irr((Fqw,+)) of order p. Hence, there exists some b∈Fp× such that ϕ0σ(a)=ϕ0(ba) for all a∈Fqw. By [12, Proposition 8.1] the elements si:=ωi∨(b)∈T~Fp, i=1,…,n, satisfy
[TABLE]
for all i,j=1,…,n and u∈k. We define t~:=∏i=1nsi∈T~ and observe that
[TABLE]
for all j=1,…,r and u∈Fqw. Recall that for S⊆{1,…,r} we have ϕS=∏i∈Sϕi, where ϕi(xi(u))=ϕ0(u) for all u∈Fq∣Ai∣. The action of graph automorphisms on the si is given by [12, Corollary 9.2]. From this it follows that γ(t~)t~−1∈Z(G~) for every graph automorphism γ.
This shows that F(t~)t~−1∈Z(G~) which implies that t~ normalizes the finite group UF. By the explicit description of the action of t~ on the xi’s we easily deduce that ϕSt~=ϕSσ. This proves part (a).
To show part (b) we show using a case-by-case analysis that there exists some z∈Z(G~) such that t~z is D-stable. If G is of type Dn with even n then t~ is already D-stable.
Now suppose that G is of type An with n even or of type E6. Then we have γ(t~)t~−1=s0−n, where s0 is the generator of Z(G~)Fp as in [12, Proposition 8.1]. It follows that the element zt~ with z:=s0−2n is D-stable.
Finally assume that GF is isomorphic to D4(q) or 3D4(q). By Lemma 4.2 there exists t~∈T~ such that ξσ=ξt~. Let X denote the group of graph automorphism of G. Since ξ is X-stable we have γ(t~)t~−1∈T~ξ=TZ(G~) for all γ∈X. Therefore, the image of t~ in H1(F,Z(G)) is X-stable. Since Z(G)X=1 we observe that H1(F,Z(G))X=1 and so t~∈TZ(G~). Consequently, ξσ=ξ and thus ϕSσ=ϕS for all σ∈G.
∎
The restriction on the type of the group of Lie type in Lemma 6.3(b) seems to be necessary in general. However, the following result is true in general.
Lemma 6.4**.**
If σ∈G is a Galois automorphism then there exists some t~∈T~ such that ϕSt~=ϕSσ for all S⊆{1,…,r} and d(t~)t~−1∈Z(G~) for all d∈D.
Proof.
In the untwisted case this is a consequence of Lemma 6.3(a). By Lemma 6.3(b) we can assume that G is not of exceptional type. Suppose now that F is a twisted Frobenius endomorphism. If q is a square then [22, Theorem 1.8(i)] shows that ϕSσ=ϕS for all S. Hence, the statement follows in this case.
If q=pf is not a square, i.e. f is odd, and F=Fqγ, then (Fpγ)f=F. Denote F′:=Fpγ and let t~∈T~ the element constructed in Lemma 6.3. Then we have ϕSσ=ϕSt~ and F′(t~)t~−1∈Z(G~). Applying Lang’s theorem to the Frobenius endomorphism F′:Z(G~)→Z(G~) we observe that there exists some z∈Z(G~) such that t~z is F′-stable. We can replace t~ by t~z and therefore assume that t~∈T~F′=T~F′. Furthermore, we still have ϕSt~=ϕSσ since we only changed t~ by a central element. The same reasoning implies that we still have γ(t~)t~−1∈Z(G~). This yields the statement of the lemma.
∎
6.3. Descent of scalars
In this section, we suppose that F0 is a Frobenius endomorphism with F0k=F for some integer k.
For any F-stable closed subgroup H of G we denote
[TABLE]
We consider the automorphism
[TABLE]
with τ(g1,…,gk)=(g2,…,gk,g1).
The mapping H↦H yields a bijection between closed F-stable subgroups of G and τF0-stable closed subgroups of G. For any such H, the projection map pr:H→H onto the first coordinate yields an isomorphism HτF0≅HF.
If ϕ:G→G is a bijective morphism we denote by ϕ:G→G the bijective morphism given by ϕ(g1,…,gk):=(ϕ(g1),…,ϕ(gk)). For convenience we also write F0 for the Frobenius endomorphism F0:G→G. One easily verifies that the automorphism τ is a quasi-central automorphism of G in the sense of [5, Definition 1.15].
We consider the non-connected reductive group G⋊⟨τ⟩ with Frobenius endomorphism τF0:G→G. One easily checks that pr induces an isomorphism
[TABLE]
6.4. Construction for twisted groups
We generalize the construction of the previous section. This is essentially necessary for working with automorphisms of twisted groups.
We suppose now that F0 is a Frobenius endomorphism with F0kρ=F for some integer k and ρ:G→G a graph automorphism of order l which commutes with F0.
For any Fkl-stable closed subgroup H of G we denote
[TABLE]
As before, we consider the automorphism
[TABLE]
Recall that for any such H, the projection map pr:H→H onto the first coordinate yields an isomorphism HτF0≅HFkl.
Let us consider the closed subgroup
[TABLE]
of G. In fact, one easily observes that Gρ is isomorphic to the k-fold product of G. In particular, Gρ is a connected reductive group. For any subgroup H of G we define Hρ:=H∩Gρ.
The fundamental observation is the following:
Lemma 6.5**.**
The projection map pr:GτF0→GF0kl maps GρτF0 to GF. Moreover, the projection map induces an isomorphism
[TABLE]
Proof.
Assume first that g=(g1,…,gkl)∈GρτF0. Then we have g=(g1,F0kl−1(g1),…,F0(g1)). Since g∈GρτF0 we have g1=ρ(gk+1)=ρ(F0k(g1))=F(g1). In other words, pr(g)=g1 is F-stable. On the other hand, if g∈GF then ρ(F0k(g))=F(g)=g which shows that pr−1(g)=(g,F0kl−1(g),…,F0(g))∈GρτF0. Therefore, GρτF0≅GF as required. Furthermore, we know that pr induces an isomorphism
[TABLE]
This isomorphism then restricts to an isomorphism GρτF0⋊⟨τ⟩≅GF⋊⟨F0⟩.
∎
6.5. Character-theoretic consequences
We fix a character ψ0∈Irrp′(B∣ϕS)∩T and denote χ0:=f(ψ0), where f:Irrp′(B)→Irrp′(G) is as in Theorem 5.7. For the remainder of this section we assume that χ0 is F0-stable, where F0:G→G is (as in the previous section) a Frobenius endomorphism which satisfies F0k=ρF for some graph automorphism ρ of order l which commutes with F0. In particular, this implies that ρ stabilizes the character χ0. Let θ∈Irr(Z(G)) be the common central character of ψ0 and χ0.
Assumption 6.6**.**
We suppose that for every σ∈H there exists an element t~∈T~ such that d(t~)t~−1∈Z(G) for all d∈Dχ0 and ξt~=ξσ. If GF≅D4(q) we let t~=1, which is possible by the proof of Lemma 6.3.
We remark that the existence of such an element has not been shown in general, see Lemma 6.3. Until the end of this section, we will assume that Assumption 6.6 holds. We then define xσ:=Fpeσ−1t~.
Recall that ξθ∈Irr(UZ(G)) denotes the common extension of ξ∈Irr(U) and the central character θ∈Irr(Z(G)). The character ξθ has an extension ξ^θ∈Irr(UZ(G)Dχ0) with Dχ0 in its kernel. Therefore, there exists a linear character μ∈Irr(Dχ0) (which possibly depends on the Galois automorphism σ and θ) such that ξ^θxσ=ξ^θμ. Evaluating this equality at d∈Dχ0 yields
[TABLE]
Since θ∈Irr(Z(G)) is a character of a group of p′-order we conclude that the linear character μ is always of p′-order.
Proposition 6.7**.**
Suppose Assumption 6.6 and let μ∈Irr(Dχ0) be the character defined above. Then there exists an extension χ0^∈Irr(GF⟨F0⟩) of χ0 which satisfies χ^0xσ=χ^0μ for every σ∈H.
Proof.
Let pr∨:ZIrr(GF)→ZIrr(GρτF0) be the map induced by pr. We let χ0:=pr∨(χ0)∈Irrp′(GρτF0).
Observe that (UZ(G))ρτF0=UρτF0Z(G)ρτF0.
We let ξθ∈Irr((UZ(G))ρτF0) be the character of (UZ(G))ρτF0 which corresponds to ξθ under the isomorphism (UZ(G))ρτF0≅UFZ(G)F given by pr. Define Γθ:=ξθGρτF0, which is the character corresponding to Γθ under the isomorphism GρτF0≅GF given by pr. The projection map pr induces an isomorphism GρτF0≅GF and maps the BN-pair (BρτF0,NGρτF0(Tρ)) of GρτF0 to the BN-pair (BF,NGF(T)) of GF. Since Alvis–Curtis duality depends only on the BN-pair structure of the group (see [2, Section 8.2]) we deduce that DGρ∘pr∨=pr∨∘DG.
From this we deduce that DGρ(χ0) is a constituent of Γθ. Let ϕ:G→G be the bijective morphism given by the action of Fpet~. By Assumption 6.6, the morphism ϕ commutes with ρ. Therefore, we can consider the restriction of ϕ to Gρ, which we will denote by the same letter. Observe that Γθϕσ−1=Γθpr∨(μ).
The remarks after Proposition 6.2 show that there
exists an extension χ^0∈Irr(GρτF0⟨τ⟩) of χ0 which satisfies χ^0ϕσ−1=χ^0pr∨(μ). We conclude that the character χ0^:=(pr∨)−1(χ^0)∈Irrp′(GF⟨F0⟩) is an extension of χ0 which satisfies χ^0xσ=χ^0μ.
∎
6.6. Gluing extensions of characters
We need the following elementary lemma about extending characters to semidirect products.
Lemma 6.8**.**
Let Y be a finite group and suppose that X:=X1×X2 acts on Y, where X1, X2 are abelian groups. Let χ∈Irr(Y) be an irreducible character which extends to Y⋊X and let χi be extensions of χ to Y⋊Xi for i=1,2. Then the character χ has an extension χ~ to Y⋊X such that whenever z∈G×NAut(Y⋊X)(YX1,YX2) and μ∈Irr(X) satisfy χiz=μXiχi for i=1,2 then we have χ~z=μχ~.
Proof.
By assumption there exists an extension χ~ of χ to Y⋊X. By [4, Lemma 13.21] there exist linear characters λi∈Irr(Y⋊Xi/Y) such that χi=λiχ~Y⋊Xi. Let λ∈Irr(Y⋊X/Y) be the linear character defined by λ((x1,x2)):=λ1(x1)λ2(x2) for (x1,x2)∈X1×X2. Define χ~′:=λχ~.
The characters χi∈Irr(Y⋊Xi∣χ) satisfy χiz=μXiχi by assumption. We claim that (χ~′)z=μχ~′. Since χ is z-invariant it follows that there exists some linear character μ′∈Irr(X) such that (χ~′)z=μ′χ′~. To show that μ=μ′ it suffices to show that μXi′=μXi for i=1,2. However (χ~′)Y⋊Xi=χi and therefore χiμXi=χiz=χiμXi. Hence, by [4, Lemma 13.21] we have μXi′=μXi. Consequently, we have (χ~′)z=χ′~.
∎
Corollary 6.9**.**
Suppose that Assumption 6.6 holds. Then there exists an extension χ^0∈Irr(GDχ0) of χ0 which satisfies χ^0xσ=χ^0μ for every σ∈H.
Proof.
Assume first that Dχ0 is cyclic. Then there exists a Frobenius endomorphism F0 of G with F0k=γF for some integer k and a (possibly trivial) graph automorphism γ such that F0 generates Dχ0. Then the claim follows immediately from Proposition 6.7. Let us now assume that Dχ0 is a non-cyclic abelian group. Consequently, there exists a field automorphism F0 with F0k=F for some integer k and a graph automorphism γ such that Dχ0=⟨γ,F0⟩. By [20, Remark 3.6] the character χ0 extends to GDχ0. Applying Proposition 6.7 yields an extension of χ0 to G⟨F0⟩. Furthermore, Proposition 6.1 gives an extension of χ0 to G⟨γ⟩. Now applying Lemma 6.8 shows that the character χ0 has an extension to GDχ0 which satisfies the required property.
Finally assume that Dχ0 is non-abelian. By an inspection of the automorphism groups of groups of Lie type we easily see that G≅D4(q). In this case, t~=1 and consequently μ=1Dχ0. Let D1 be the normal Sylow 3-subgroup of Dχ0. An analysis of the subgroup structure of D shows that there exists some abelian subgroup D2 of Dχ0 such that Dχ0=D1D2 and D1∩D2=1. Since F is untwisted we can write Di=⟨γi,F0,i⟩ where the γi’s are (possibly trivial) graph automorphisms and F0,iki=F for some ki’s. We can therefore apply the arguments from before to the groups Di and conclude that there exists an xσ-equivariant extension χi∈Irr(GDi) of χ0. Furthermore, using the arguments used in Proposition 6.1 and Proposition 6.7 one can show that the characters (χ1)G⟨γ1⟩ and (χ1)G⟨F0,1⟩ are D2-stable as well. By Lemma 6.8, we conclude that χ1 is D2-stable. According to [20, Lemma 2.11] we obtain a character χ^0∈Irr(GDχ0) such that the restriction of χ^0 to GDi is χi. By [4, Lemma 13.21] there exists some λ∈Irr(Dχ0) such that χ^0xσ=χ^0λ. Since (χ^0)GDi=χi is xσ-invariant, we deduce that λDi=1Di whence λ=1Dχ0. This proves that χ^0 is xσ-stable.
∎
The local analogue of Corollary 6.9 is easier to prove.
Proposition 6.10**.**
Suppose that Assumpton 6.6 holds. Let ψ∈Irrp′(B~F) and assume that t~∈T~ satisfies d(t~)t~−1∈Z(G) for all d∈Dχ0. Then the character ψ0∈Irr(B∣ψ) constructed in the proof of Lemma 5.6 has an extension ψ^0∈Irr(BDψ) which satisfies ψ^0xσ=ψ^0μ for every σ∈H.
Proof.
Let us briefly recall the construction of ψ0 from Lemma 5.6. By Clifford correspondence there exists a unique character λ∈Irr(B~ϕS∣ϕS) such that λB~=ψ. Then ψ0∈Irr(B∣ϕS) is defined as ψ0=(λBϕS)B.
Denote E:=Dψ0 and I:=BϕS. By [12, Proposition 8.4], the character ϕS is E-stable. Hence by Clifford correspondence, the character λI is E-stable as well.
The group B~ϕS/Ker(ϕS) is abelian by the proof of [12, Lemma 8.5]. We deduce that I/Ker(λI) is abelian as well. Thus, we can consider λI as a character of the abelian group I/Ker(λI). Since IE/Ker(λI)≅I/Kern(λI)⋊E is the semidirect product with an abelian normal factor we know that the E-stable character λI extends to IE. In particular, there exists an extension λ^∈Irr(IE) of λI with E in its kernel. By Mackey’s formula the character ψ^0:=λ^BE is an extension of the character ψ0.
It remains to show that ψ^0 satisfies the desired property. We have ϕSσ=ϕSt~. In particular, the character ϕS is xσ-stable. Since ψ0 is xσ-stable it follows that its Clifford correspondent λ∈Irr(B~ϕS∣ϕS) is xσ-stable as well. Consequently, λ^ and λ^xσ are both extensions of λI. Therefore, there exists a linear character μ′∈Irr(E) such that λ^xσ=μ′λ^. Since ψ^=λ^BE is an extension of ψ, it follows that θ∈Irr(Z(G)∣λ^). Thus, evalutation of the equation λ^xσ=μ′λ^ at d∈E yields μ′(d)=θFpeσ−1(d(t~)t~−1)=μ(d). It follows that μ=μ′ and therefore ψ^0xσ=ψ^0μ.
∎
7. The inductive Galois–McKay condition
7.1. Projective representations
In this subsection, we prove the inductive Galois–McKay condition for groups of Lie type in defining characteristic. For this we need to recall the statement of [15, Lemma 1.4]:
Lemma 7.1**.**
Let X be a finite group and Y⊲X. Let θ∈Irr(Y) and assume that
θgσ=θ for some g∈X and
σ∈G.
Let P be a projective representation of Xθ
associated with θ with values in Qab and factor set α.
Then Pgσ is a projective representation
associated with θ, with factor set αgσ(x,y)=αg(x,y)σ for x,y∈Xθ.
In particular, there exists a unique function
[TABLE]
with μgσ(1)=1, constant on cosets of Y
such that the projective representation Pgσ is similar to μgσP.
Let X~∈{G~,B~} and X:=G∩X~. Fix a character ψ∈Irr(X~) and let ψ0∈Irr(X∣ψ) be the characters of X considered in Lemma 5.5 respectively Lemma 5.6. Denote by ψ1∈Irr(X~ψ∣ψ0) the Clifford correspondent of ψ. We assume without loss of generality that all linear representations are realized over the field Qab.
Let D be a representation affording ψ0. Let D1 be the representation of X~ψ0 affording ψ and extending D. Furthermore, by [20, Remark 3.4] and [20, Remark 3.6] there exists a representation D2 of XDψ0 extending D. For i=1,2 we let ψi be the character of the representation Di. As in [20, Lemma 2.11] we consider the projective representation P of (X~D)ψ0 defined by
[TABLE]
for g~∈X~ψ0 and d∈XDψ0. We can now state the following lemma:
Lemma 7.2**.**
Let y∈H×NB(XDψ0) with ψ0y=ψ0. Suppose that μ1∈Irr(X~ψ0/X) and μ2∈Irr(XDψ0/X) are such that ψiy=μiψi for i=1,2. Then there exists an invertible matrix M such that
[TABLE]
for all g~∈X~ψ0 and d∈XDψ0.
Proof.
The character ψ0 is y-stable, hence there exists an invertible matrix M such that Dy=MDM−1. Note that by Schur’s lemma the matrix M is determined up to a scalar. Since D1y is a second extension of D to X~ψ0 there exists by [4, Lemma 13.21] an invertible matrix S such that D1y=μ1SD1S−1. Hence, we obtain Dy=SDS−1. Consequently, S=λM for some scalar λ∈K×, so that we may assume that S=M. In particular, we have D1y=μ1MD1M−1.
Moreover, note that D2y is a second extension of D to XDψ0. The same reasoning as above shows that D2y=μ2MD2M−1. From this we deduce that
[TABLE]
for all g~∈X~ψ0 and d∈XDψ0.
∎
7.2. Verifying the inductive condition
We are now able to verify the inductive Galois–McKay condition for most groups of Lie type in defining characteristic.
Theorem 7.3**.**
Suppose that (G,F) satisfies Assumption 5.4 and assume additionally that G is not of type An, Dn for odd n. Assume that F:G→G is an untwisted Frobenius endomorphism such that S:=GF/Z(GF) is a simple non-abelian group and GF is its universal covering group. Then the inductive Galois–McKay condition from [15, Definition 3.1] holds for the group S and p.
Proof.
By Theorem 5.7 there exists an H×B-equivariant bijection f:Irrp′(B)→Irrp′(G). Let χ0∈T0 and ψ0:=f(χ0). Fix a character χ∈Irr(G~) lying above χ0 and set ψ:=f~(χ). The definition of H-character triples is given in [15, Definition 1.5]. By [15, Lemma 2.3] it suffices (in the language of said H-character triples) to prove that
[TABLE]
According to [20, Remark 3.4(a)], the group G~D induces all automorphisms of Aut(G). Hence, by [15, Theorem 2.9] it is enough to prove that
[TABLE]
According to Lemma 6.3, for every σ∈G there exists some t~∈T~D with ϕSt~=ϕSσ for all S⊆{1,…,r}. Therefore, Assumption 6.6 is satisfied. We let D2 be a representation affording the extension of χ0 to GDχ0 constructed in Proposition 6.7. We let μ2∈Irr(Dχ0) be the linear character such that χ2xσ=χ2μ2. (In fact since t~ is D-stable we have μ2=1Dχ0 however we will not use this fact.) Furthermore, let D1 be a representation of G~χ0 affording the Clifford correspondent χ1∈Irr(G~χ0∣χ0) of χ. Similarly, let D2′ be a representation affording the extension of ψ0 to BDψ0 constructed in Proposition 6.10 and D1′ a representation of B~ψ0 affording the unique character ψ1∈Irr(B~ψ0∣ψ0) with ψ1B~=ψ. As in 7.1, we let P and P′ be the projective representations of (G~D)χ0 and (B~D)ψ0 constructed with the linear representations Di and Di′, i=1,2, respectively.
According to [20, Theorem 1.1] it suffices to prove that for every a∈(H×B)χ0, the functions μa
and μa′ given by Lemma 7.1 agree on (H×B)χ0. By Lemma 5.5 there exists some σ∈H such that y:=axσ−1∈(B~D)χ0, where xσ=Fpeσ−1t~. By Lemma 6.3, the element Fpet~ stabilizes GDχ0. Let μ1∈Irr(G~χ0/G) such that χ1xσ=μ1χ1. By Lemma 7.2 and Corollary 6.9 there exists an invertible matrix M such that
[TABLE]
for all g~∈G~χ0 and d∈GDχ0. Since y∈(B~D)χ0 we obtain
[TABLE]
by [14, Lemma 10.10(a)]. Therefore, we have
[TABLE]
for the invertible matrix S:=MP(y). This shows that μa(g~d)=μ1y(g~)μ2y(d). By [20, Theorem 3.5(b)] or [18, Corollary 3.20] it follows that ψ1xσ=(μ1)B~ψ0ψ1. By Lemma 7.2 and Proposition 6.10 there exists an invertible matrix M′ such that
[TABLE]
for all g~∈B~ψ and d∈BDψ0. The same calculation as in the global case now shows that μa′(g~d)=μ1y(g~)μ2y(d) for g~d∈(B~D)ψ0.
Consequently, the functions μa
and μa′ agree on (H×B)ψ0.
∎
7.3. An alternative approach to the inductive condition
In the statement of Theorem 7.3 we needed to exclude some cases. This was essentially because the statement of Lemma 6.3(a) doesn’t hold for these groups in general. However, using one of the main results of [22] and the strategy of [6] we can prove the inductive Galois–McKay condition in the remaining cases. The proof also highlights some of the difficulties when dealing with the inductive Galois–McKay condition instead of the inductive McKay condition.
Theorem 7.4**.**
Suppose that G is of type An or Dn for odd n. Assume that F:G→G is a Frobenius endomorphism such that S:=GF/Z(GF) is a simple non-abelian group and GF is its universal covering group. Then the inductive Galois–McKay condition from [15, Definition 3.1] holds for S and p.
Proof.
We assume the notation of the proof of Theorem 7.3. Arguing as in the proof of loc. cit. it suffices to prove that
[TABLE]
If for every σ∈H there exists t~∈T~Dχ0 such that ξσ=ξt~ then this follows from the arguments given in Theorem 7.3. We will now discuss which characters χ0∈Irrp′(G) are not covered by this argument. Note that by Lemma 6.3(b) we can assume that p=2. Furthermore, if q is a square then we have ξσ=ξ by [22, Theorem 1.8(i)] and therefore we can also exclude this case.
Suppose first that Dχ0=⟨F′⟩ for some Frobenius endomorphism F′:G~→G~ which satisfies (F′)s=F for some s≥1. By Lemma 6.4 there exists some t~∈T~ such that ξσ=ξt~ and F′(t~)t~−1∈Z(G~F). Applying Lang’s theorem to the Frobenius map F′:Z(G~)→Z(G~) we find z∈Z(G~) such that t~′:=zt~∈T~F′=T~Dχ0. Since we still have ξσ=ξt~′ we see that the arguments of Theorem 7.3 also apply in this case.
Assume therefore now that no such Frobenius endomorphism exists. Since D=⟨Fp,γ⟩ we can therefore assume that γ∈Dχ0, where γ is the graph automorphism of order 2 of G. In the twisted case, this only works because we can assume that q is not a square.
We let θ∈Irr(Z(G)∣χ0)=Irr(Z(G)∣ψ0). Since θ is γ-stable it follows that θ∈Irr(Z(G)) satisfies θ2=1Z(G).
We will now recall the method introduced in [6]. We denote by L:G~→G~,g↦g−1F(g) the Lang map on G~. Let E⊆Aut(L−1(Z(G))) be the subgroup generated by Fp and γ. The group E acts by automorphisms on G~ and so we can form the semi-direct product G~⋊E, which generates all automorphisms of G. By [15, Theorem 2.9] we can equivalently prove that
[TABLE]
By Lemma 6.4 there exists some t~∈T~ with d(t~)t~−1∈Z(G~) for all d∈D and ξσ=ξt~.
Observe that γ acts by inversion on Z(G) and hence also on H1(F,Z(G)). We therefore have
[TABLE]
in H1(F,Z(G)). This shows that (t2′)2=1 in H1(F,Z(G)) and so t2′=1 in H1(F,Z(G)). By replacing t~ with its 2-part we may assume that t~ is an element of 2-power order.
Since T~=TZ(G~) we find some z∈Z(G~), which we can assume to be of 2-power order, such that t:=zt~∈T. In particular, t is a 2-element again. We observe that L(t)=L(z)∈Z(G~)∩G=Z(G) and a(t)t−1∈Z(G) for all a∈E. Furthermore, we have ξσ=ξt. We set yσ:=Fpeσ−1t∈L−1(Z(G))E×H and π:=Fpeσ−1. We will now make the following important observation.
Lemma 7.5**.**
To prove Theorem 7.4 we can assume that L(Z(G))2⊆Z(G)2.
Proof.
Suppose that GF=Dn(εq) for odd n. If ∣Z(GF)∣∈{1,2} then we have ϕSσ=ϕS for all S⊆{1,…,r} by [22, Theorem 1.8(iv)]. Hence, this case is already covered by the arguments in Theorem 7.3 and we can even assume that Z(G)=Z(GF).
Suppose now that G is of type A. The Lang map L:Z(G)→Z(G) yields an isomorphism L(Z(G))≅Z(G)/Z(G). Since Z(G) is cyclic the claim is hence equivalent to ∣L(Z(G))∣2≤∣Z(G)∣2. This is equivalent (since we assume that p=2) to (n,q−ε)2n2≤(n,q−ε)2. This is satisfied whenever n2≤(q−ε)2. If we assume that n2>(q−ε)2 then we have Z(G~)2⊆Z(G). Since t~ is a 2-element we conclude that γ(t~)t~−1∈Z(G~)2⊆G. Consequently, d(t~)t~−1∈Z(G) for all d∈D. In this case the proof of Theorem 7.3 applies and we can conclude that the inductive Galois-McKay condition holds in that case.
∎
The previous lemma implies that the element t normalizes BE. Indeed, for a∈E we have L(a(t)t−1)∈L(Z(G))2⊆Z(G) and therefore Et=E.
We will now first consider the local situation. Let λ^∈Irr(BϕSEχ0) be the unique extension of ϕS with Eχ0⊆Ker(λ^). By Mackey’s formula the character ψ^2:=λ^BEχ0 is an extension of ψ2. Since ϕS is yσ-stable, we have λ^yσ=μλ^ for some linear character μ∈Irr(Eχ0). Therefore, for a∈Eχ0 we have
[TABLE]
In particular, we have ψ^2yσ=ψ^2μ. Since θ2=1Z(G), we deduce that the linear character μ satisfies μ2=1Eχ0. Furthermore, this implies μ(a)=θ(a(t)t−1).
Let us now consider the global situation. We can write Eχ0=⟨F0,γ⟩, where F0:G→G is a Frobenius endomorphism such that some power of F0 is F and F0(t~)=t~. This is always possible since t~ is Fpγ21−ε-stable by the proof of Lemma 6.4 and (Fpγ21−ε)f=F since q is odd. Consider the Gelfand–Graev character Γ^1:=ξ^G⟨γ⟩, where ξ^∈Irr(U⟨γ⟩) is the unique extension of ξ with ξ^(γ)=1. By the above calculations, we have ξ^yσ=ξ^μ and so Γ^1yσ=μΓ^1.
We can consider Fpet as a bijective morphism of G⋊⟨γ⟩ which stabilizes T⟨γ⟩. Since γ(t)t−1∈Z(G) it follows that the bijective morphism Fpet:G⟨γ⟩→G⟨γ⟩ commutes with the Frobenius endomorphism F of G⋊⟨γ⟩ and stabilizes T⟨γ⟩. By Proposition 6.1 we obtain an extension χ1∈Irr(G⟨γ⟩) of χ0 to GF⟨γ⟩, such that χ1yσ=μχ1.
Denote xσ:=Fpeσ−1t~∈G~D×H. Since t~ is F0-stable we obtain by Proposition 6.7 an extension χ2 of χ to G⟨F0∣GF⟩ which is xσ-stable. Using the group epimorphism G⟨F0⟩→G⟨F0∣GF⟩ we can lift χ2 to an extension χ2 of G⟨F0⟩, with F∈E in its kernel.
Since yσ=xσz we deduce that χ2yσ=χ2z. For x=ga with g∈G and a∈⟨F0⟩, we have
[TABLE]
or in other words χ2yσ=μχ2. Now Lemma 6.8 shows the existence of an extension χ^2∈Irr(GE∣χ0) which satisfies χ^2yσ=μχ^2.
We are now ready to verify the inductive conditions. This is proved in a similar fashion as in Theorem 7.3. Let X∈{B,G} and
ϑ0∈{ψ0,χ0} be the corresponding character of X. We let D be a representation of X affording ϑ0. There exists a representation D1 of X1:=G~χ0∩X, extending D. We denote by ϑ^1∈Irr(X1/X) its character. Let D2 be a representation of X2:=XEϑ0 affording the character ϑ^2∈{ψ^2,χ^2} which extends the representation D.
We consider the projective representation P of X1X2 defined by
[TABLE]
for x1∈X1 and x2∈X2.
Let μ1∈Irr(X1/X) such that χ^1yσ=μ1χ^1.
Note that by [20, Theorem 3.5(b)] or [18, Corollary 3.20] it follows that ψ^1yσ=μ1ψ1. We have P∣Z(G)⟨F⟩=θ×1⟨F⟩Eϑ^0(1). Now [6, Lemma 2.7] implies that
[TABLE]
We now show that the functions μa and μa′ given by Lemma 7.1
for the representations P agree on (H×X1X2)ψ0. By Lemma 5.5 there exists some σ∈H such that y:=ayσ−1∈X1X2.
By Lemma 7.2 there exists an invertible matrix M such that
[TABLE]
for all x1∈X1 and x2∈X2. Since y∈X1X2 we obtain
[TABLE]
by [14, Lemma 10.10(a)]. Therefore, we have
[TABLE]
for the invertible matrix S:=MP(y). This shows that μa(x1x2)=μ1y(x1)μ2y(x2). Therefore, the function μa is the same in the local and the global case. Consequently, we have
[TABLE]
which finishes the proof.
∎