The Decomposition of Permutation Module
for Infinite Chevalley Groups
Xiaoyu Chen, Junbin Dong*
Abstract
Let G be a connected reductive group defined over Fq, the finite field with q elements. Let B be an Borel subgroup defined over Fq. In this paper, we completely determine the composition factors of the induced module M(tr)=kG⊗kBtr (tr is the trivial B-module) for any field k.
1 Introduction
The representations of reductive algebraic groups is an interesting and fundamental topic. It has deep connections to other areas of mathematics, for example, algebraic geometry and number theory. The earlier attentions to this topic concentrated on the rational representations of algebraic groups and the representations of finite groups of Lie type. The cohomology theory of flag varieties and Deligne-Lusztig varieties control the rational representations of algebraic groups and ordinary representations of finite groups of Lie type, respectively.
One important class of irreducible modules of a reductive group (resp. Lie algebra) comes from certain induced modules from an one-dimensional character of a Borel subgroup (resp. Borel subalgebra).
For the rational representations of algebraic groups and, the representations of Lie algebras in the BGG category O, it was known that all irreducible modules are the simple quotients of Weyl modules and Verma modules, respectively. Moreover, the decomposition of Weyl modules and Verma modules motivates the famous Lusztig’s conjecture (cf. [Lu1] and [Lu2]) and Kazhdan-Lusztig conjecture (cf. [KL]), respectively. For the representations of finite groups of Lie type in defining characteristic, such induced modules have been deeply investigated. For example, Carter and Lusztig classified simple modules via certain homomorphisms between such induced modules (cf. [CL]). Moreover, [Jan] and [Pil] indicated that the decomposition of such induced modules is closely related to the decomposition of Weyl modules.
Despite the fruitful results above, little was known about the abstract representations of algebraic groups. Assume that k is a field and let θ be a one-dimensional kB-module. It was observed in [Xi] that the induced module M(θ)=kG⊗kBθ will give some new infinite dimensional abstract representations of G. In particular, M(tr) contains a submodule St which is called infinite dimensional Steinberg module. The irreducibility of St was proved in [Xi] for the defining characteristic, and in [Yang] for cross characteristic. Thus St is irreducible for any field k which is surprising. For the nontrivial character θ, it was proved in [Chen1] that M(θ) is irreducible if θ is strongly antidominant, and in [Chen2] that a certain submodule of M(θ) is irreducible when θ is antidominant.
Xi constructed in [Xi] a filtration of M(tr)=kG⊗kBtr whose subquotients are indexed by the subsets of simple reflections. The second author proved that some of these subquotients are irreducible when the groups are of type A or rank 2 in [Dong] when chark=charFq.
Later it was proved in [CD] that all of these subquotients are irreducible and pairwise non-isomorphic if chark=charFq. This paper shows that the same result holds if chark=charFq. Thus we completely determine the composition factors of M(tr) for any field k (see Theorem 4.1). The constructions of these subquotients are uniform for all field, but the proof of irreducibility depends on the characteristic of k. It would be interesting to find a characteristic free proof.
This paper is organized as follows: In Section 2 we recall some notations and basic facts about the structure of reductive groups. Section 3 recalls some basic properties of the induced modules M(tr). Section 4 gives the proof of the main theorem and in Section 5 we give another approach to prove our main theorem. Section 6 lists some open problems for further study.
Acknowledgements. Xiaoyu Chen is supported by National Natural Science Foundation of China (Grant No. 11501546). Junbin Dong is supported by National Natural Science Foundation of China (Grant No. 11671297). The authors are grateful to Professor Nanhua Xi for his helpful suggestions and comments in
writing this paper. Xiaoyu Chen thanks Professor Jianpan Wang and Naihong Hu for their advice and comments.
Junbin Dong thanks Professor Toshiaki Shoji and Qiang Fu for their helpful discussion and comments. Both authors would like to thank the referees for their careful reading and helpful suggestions.
2 Reductive Groups with Frobenius Maps
In this section, we recall the basic notations and facts about the structure of reductive groups. Let G be a connected reductive group defined over Fq with the standard Frobenius map F. Let B be an F-stable Borel subgroup, T be an F-stable maximal torus contained in B, and U=Ru(B) be the (F-stable) unipotent radical of B. We denote Φ=Φ(G;T) the corresponding root system, and Φ+ (resp. Φ−) is the set of positive (resp. negative) roots determined by B. Let W=NG(T)/T be the corresponding Weyl group. For each w∈W, let w˙ be a representative in NG(T).
One denotes Δ={αi∣i∈I} the set of simple roots and S={si∣i∈I} the corresponding simple reflections in W.
For each α∈Φ, there is an unique unipotent subgroup
Uα of G which is isomorphic to Fˉq and is
stable under the conjugation by T. For each α, we fix an
isomorphism εα:Fˉq→Uα so
that tεα(c)t−1=εα(α(t)c).
For any w∈W, we set
[TABLE]
Now assume Φw−={β1,β2,…,βk} and Φw+={γ1,γ2,…,γl}
for a given w∈W and, we denote
[TABLE]
The following properties are well known (see [Car]).
(a) For w∈W and α∈Φ we have w˙Uαw˙−1=Uw(α);
(b) Uw and Uw′ are subgroups and w˙Uw′w˙−1⊂U;
(c) The multiplication map Uw×Uw′→U is a bijection;
(d) Each u∈Uw is uniquely expressible in the form
u=uβ1uβ2…uβk with uβi∈Uβi;
(e) (Commutator relations) Given two positive roots α and β, there exist a total ordering on Φ+ and integers cαβmn such that
[TABLE]
for all a,b∈Fˉq, where the product is over all
integers m,n>0 such that mα+nβ∈Φ+, taken
according to the chosen ordering.
In the following sections, we will often use the properties of root subgroups. Except the properties above, we have the following technical but useful lemma.
Lemma 2.1**.**
Let s=sα be a simple reflection and ws>w. If Uw=(Uw)s, then ws=tw for some t∈S.
Proof.
Let Φw−={α1,α2,…,αm}.
Since Uws=Uα(Uw)s=UαUw, then we have
[TABLE]
Let Φw+=Φ+\Φw−={β1=α,β2,…,βl}. Denote by αi′=w(αi)∈Φ− and βi′=w(βi)∈Φ+, then we have
[TABLE]
Since Uw=(Uw)s, there is a permutation σ of {1,2,…,m} such that s(αi)=ασ(i). Therefore we have
[TABLE]
Similarly, there is a permutation τ of {2,3,⋯,l} such that
wsw−1(βj′)=βτ(j)′ for j=2,3,…,l.
The above discussion implies ℓ(wsw−1)≤1.
But wsw−1=1 and hence wsw−1=t∈S which completes the proof.
∎
For J⊂I, let WJ be the standard parabolic subgroup of W and assume that wJ is the longest element in WJ.
For w∈W, set R(w)={s∈S∣ws<w} and denote
[TABLE]
Corollary 2.2**.**
Let s∈S and w∈YJ. If sw∈YJ and sw>w, then UwJw−1=(UwJw−1)s.
Proof.
Suppose UwJw−1=(UwJw−1)s, then by Lemma 2.1 there exists a simple reflection r∈S such that wJw−1s=rwJw−1 which is a contradiction to sw∈YJ.
∎
3 The Permutation Module
In this section, we recall some basic facts in [Xi] and [CD]. Assume that k is a field. Let M(tr)=kG⊗kBtr, where tr is the trivial kB-module, and call it the permutation module. Let 1tr be a nonzero element in tr. For convenience, we abbreviate x⊗1tr∈M(tr) to x1tr. Since T acts trivially on 1tr, the notation
w1tr=w˙1tr is well defined for any w∈W.
Using the Bruhat decomposition of G, it is easy to see
[TABLE]
Moreover, the set {uw1tr∣w∈W,u∈Uw−1} forms a basis of M(tr).
Remark 3.1**.**
Let G=GF and B=BF. Naturally, we have a “finite version” of M(tr), namely, kG1tr, which is isomorphic to the induced module IndBG1B, where 1B is the trivial kB-module. For k=C, the decomposition of IndBG1B is closely related to the representation of H=EndG(IndBG1B) which is known as the Hecke algebra. For k=Fˉq, it is known that IndBG1B decomposes into a direct sum of indecomposable modules, each with
simple socle, and there is a bijection between the direct summands and the subsets of I (cf. [YY, Proposition 4.5]). However, we have
[TABLE]
for any field k, since it is clear that
f(1tr)∈M(tr)U=k1tr. Therefore
the induced kG-module M(tr) is indecomposable for any field k.
For any J⊂I, let WJ be the subgroup of W generated by si with i∈J. We set
[TABLE]
and let M(tr)J=kGηJ. It was proved in [Xi] that M(tr)J=kUWηJ.
The following lemma is well known and very useful in our arguments later. The proof can be found in [Xi, Proposition 2.3] (see also [CD, Lemma 2.1]).
Lemma 3.2**.**
Let u∈Uαi∗=Uαi\{1} and w∈WJ. Then
(1)* There exist unique x,y∈Uαi∗ and t∈T such that si˙usi˙−1=xsi˙ty; Note that if we denote by x=fi(u), then fi is an isomorphism on Uαi∗;*
(2)* If wwJ<siwwJ, then si˙uwηJ=siwηJ;*
(3)* If siw<w, then si˙uwηJ=xwηJ, where x is defined in (1).*
(4)* If siw>w and siwwJ<wwJ, then si˙uwηJ=(x−1)wηJ, where x is defined in (1).*
Since M(tr)J⊋M(tr)K if J⊊K.
Following [Xi, 2.6], we define
[TABLE]
where M(tr)J′ is the sum of all M(tr)K with J⊊K. The following lemma was proved in [Xi].
Lemma 3.3** ([Xi, Proposition 2.7]).**
If J and K are different subsets of I, then EJ and EK are not isomorphic as
kG-modules.
We denote by CJ the image of ηJ in EJ. Combining [Dong, Lemma 2.6] and [Dong, Lemma 2.7] we see that
Proposition 3.4**.**
The set {uwCJ∣w∈YJ,u∈UwJw−1} forms a basis of EJ.
For any subset J⊂I, the kG-modules EJ is a subquotient of M(tr).
We can also realize EJ as a kG-submodule of a parabolic induced module.
For K⊂I, let PK be the standard parabolic subgroup of G generated by B and si with i∈K, and MK=kG⊗kPKtrK, where trK is the trivial PK-module. Then MK is the quotient kG-module of M(tr). Let 1K be a nonzero element in trK. For convenience, we abbreviate x⊗1K∈MK to x1K.
For J⊂I, we denote J′=I\J. Let EJ′ be the kG-submodule of MJ′ generated by DJ:=∑w∈WJ(−1)ℓ(w)w1J′. Combining Proposition 3.4 and [CD, Proposition 3.2], we get the following
Proposition 3.5**.**
For any J⊂I, the set {uwDJ∣w∈YJ,u∈UwJw−1} forms a basis of EJ′. In particular, EJ′≅EJ as kG-modules.
4 Composition factors of M(tr)
In this section we prove that EJ is irreducible for any subset J⊂I. So we completely determines the composition factors of M(tr) for any field k.
The main theorem is the following
Theorem 4.1**.**
Let k be any field. Then all the kG-modules EJ (J⊂I) are irreducible and pairwise non-isomorphic. In particular, M(tr) has exactly 2r composition factors, where r is the rank of G.
Remark 4.2**.**
Theorem 4.1 reflects a new phenomenon for infinite reductive groups. In other words, it does not hold when kG is replaced by kGqa.
When k=C, it is known that there is a bijection between the composition factors of kGqa1tr and the composition factors of the regular module kW of W, which preserves multiplicities. But the number of composition factors of kW is not equal to 2r in general. When k=Fˉq, let G=SL3(Fˉq). Then Theorem 4.1 says that M(tr) has 4 composition factors. But it was shown in [CL] (page 382) that kGp1tr has 6 composition factors, where Gp=SL3(Fp).
Theorem 4.1 was proved in [CD] in the case chark=charFq.
In this section we will prove Theorem 4.1 in the case chark=charFq. From here to the end of this section, we always assume that chark=charFq.
For any finite subset H of G, let H:=∑h∈Hh∈kG (this is a frequently used notation in the arguments below). It is clear that H⋅H=0 if H is a subgroup and chark divides ∣H∣. For each F-stable subgroup H of G, denote Hqa:=HFa.
Although Theorem 4.1 works for any field k, the arguments in this paper are significantly different to that in the case chark=charFq in [CD]. The following arguments, especially Proposition 4.3 and Proposition 4.4, rely heavily on the condition chark=charFq. While [CD, Lemma 2.4], one of the key steps of arguments in [CD], relies heavily on the condition chark=charFq. [CD, Lemma 2.4] says that for any T-fixed nonzero element η in a kG-module M, we have kGη=kGUqη if chark=charFq. However, this does not hold when chark=charFq. For example, let k=Fˉq, M=M(tr), and η=1tr∈M. Then it is clear that kG1tr=M(tr), while kGUq1tr=0 since u1tr=1tr for any u∈Uq and chark=charFq.
Therefore, we cannot apply [CD, Lemma 2.4] to prove Theorem 4.1 when chark=charFq. So in this paper we use new ideas and techniques to deal with the defining characteristic case. Firstly we list two key technical results (Proposition 4.3 and Proposition 4.4 below) used in the proof of Theorem 4.1.
For each nonempty subset Y of YJ, set ΦY=⋃w∈YΦwJw−1−. We fix a linear order on ΦYJ such that
ΦYJ={β1,⋯,βm} with ht(β1)≥⋯≥ht(βm), and assume that the linear order of each ΦY (In particular, each ΦwJw−1) is inherited from ΦYJ.
Let a,b∈N such that a∣b. For each w∈YJ, write ΦwJw−1−={γ1,⋯,γt} with respect to the above order (In particular ht(γ1)≥⋯≥ht(γt)). For such a,b,w, and 0≤d≤t, set
[TABLE]
With the above notations, we have the following proposition.
Proposition 4.3**.**
Assume that chark=charFq, and M is a nonzero kG-module. Let Y be a nonempty subset of YJ and write ΦY={α1,⋯,αn} with respect to the above order.
Let d∈Z≥0 such that {α1,…,αd}⊂⋂w∈YΦwJw−1−.
If
[TABLE]
for a,b∈N such that a=b and a∣b (all aw∈k here are nonzero), then UwJw−1,qcwCJ∈M for some w∈YJ and c∈N.
Proposition 4.4**.**
Assume that chark=charFq, and M is a nonzero kG-module. If UwJw−1s,qaswCJ∈M for some a∈N, where sw∈YJ and sw>w (this implies w\in Y^{J}$$), then UwJw−1,qbwCJ∈M for some b∈N.
Once Proposition 4.3 and Proposition 4.4 are proved, we can prove Theorem 4.1 in the case chark=charFq as follows.
Proof of Theorem 4.1..
For a fixed J⊂I, assume that M is a nonzero kG-submodule of EJ.
Let EJ,qi:=kGqiCJ. Choose a nonzero element x∈M.
Then x∈EJ,qa for some a∈N since EJ=⋃i>0EJ,qi.
It is clear that (kGqax)Uqa⊂(EJ,qa)Uqa⊂⨁w∈YJkUwJw−1,qawCJ by Lemma 3.4. Moreover, (kGqax)Uqa=0 by [Se, Proposition 26]. There exists a nonzero element
[TABLE]
Choose an integer b=a and a∣b. Then ξ=∑w∈YJcwΘ(w,0,b,a)wCJ. We apply Proposition 4.3 to Y={w∈YJ∣cw=0}, d=0 and ξ=ξd. Then UwJw−1,qcwCJ∈M for some w∈YJ and c∈N.
Applying Proposition 4.4 repeatedly, we see that UwJ,qmCJ∈M for some m∈N.
By [St, Lemma 2], since chark=charFq, we have
[TABLE]
which implies that EJ is irreducible. The set J in the above arguments can be any subset of I, so all EJ (J⊂I) are irreducible.
∎
Therefore, we devote to prove Proposition 4.3 and Proposition 4.4 in the sequel. In order to prove these two propositions, we need the following technical lemma.
Lemma 4.5**.**
Fix w∈YJ and let A={α1,α2,…,αm} and B={β1,β2,…,βn} be two disjoint subsets of ΦwJw−1−. Assume that ∑iliαi∈A whenever ∑iliαi∈Φ+ for some li∈Z≥0.
Let a,b∈N with a∣b, and denote
[TABLE]
Then we have
(i)* Assume that kβ1+∑iliαi∈A whenever kβ1+∑iliαi∈Φ+ for some k∈Z>0 and li∈Z≥0. Then*
[TABLE]
for any x∈Uβ1,qb.
(ii)* Let γ∈ΦwJw−1+. Assume that kγ+∑iliαi+∑imiβi∈A whenever kγ+∑iliαi+∑imiβi∈ΦwJw−1− for some k∈N and li,mi∈Z≥0. Then yδ=δ for any y∈Uγ,qb.*
Proof.
(i) By commutator formula and the assumption, it is easy to show that VA=1≤i≤m∏Uαi is a normal subgroup of VAUβ1. In particular, VA,qb=1≤i≤m∏Uαi,qb is a normal subgroup of
VA,qbUβ1,qb. Thus, x commutes with Uα1,qb⋯Uαm,qb which proves (i).
(ii) By assumption, for any y∈Uγ,qb, g1∈VA,qb, and g2∈VB,qa=∏1≤i≤nUβi,qa, we have
[TABLE]
where σ(g1)∈VA,qb and z∈UwJw−1′. We claim that the map g1↦σ(g1) (for fixed y and g2) is injective. Indeed, assume that σ(g1)=σ(g1′) for some g1′∈VA,qb. Since yg1′g2=σ(g1)g2z′ for some z′∈UwJw−1′, we have
[TABLE]
It follows from equation (3) that g2−1g1−1g1′g2∈UwJw−1∩UwJw−1′={1}, and hence g1=g1′ which proves the claim. Since zwDJ=wDJ for any z∈UwJw−1′, we have yδ=δ for any y∈Uγ,qb thanks to equation (2) and the injectivity of σ.
∎
With this preparation in hand, we can give
Proof of Proposition 4.3.
We will prove this lemma by the induction on ∣Y∣.
If ∣Y∣=1, then ξd=cΘ(w,d,b,a)wCJ∈M for some c∈k× and w∈YJ. We consider the kUqb-module N=kUqbΘ(w,d,b,a)wCJ⊂M. Clearly, NUqb=0 by [Se, Proposition 26]. Note that NUqb⊆(kUqbwCJ)Uqb=kUwJw−1,qbwCJ, then UwJw−1,qbwCJ∈M.
Assume that ∣Y∣>1. Let Ii be a set of left coset representatives of Uαi,qa in Uαi,qb. Let l be the minimal number such that αd+l∈ΦwJw−1− for some w∈Y. Since Φw1−=Φw2− if w1=w2, such l always exists.
If w∈Y and αd+l∈ΦwJw−1−, combining our assumption on the order in each ΦwJw−1− and Lemma 4.5 (i) yields
[TABLE]
for all 0≤i<l−1, and
Lemma 4.5 (ii) yields
[TABLE]
since chark=charFq and b=a.
Thus, combining (4) and (5) yields
[TABLE]
If w∈Y and αd+l∈ΦwJw−1−, we have
[TABLE]
by Lemma 4.5 (i). Denote ξd+l:=Id+l⋯Id+1ξd∈M and let Y′ be the set of w∈YJ such that the coefficient of Θ(w,d+l,b,a)wCJ in ξd+l is nonzero. Combining (6), (7), and the minimality of l, we see that ξd+l=0 (equivalently, Y′ is nonempty) and Y′⊊Y (In particular ∣Y′∣<∣Y∣). Notice that {α1,⋯,αd+l}⊂⋂w∈Y′ΦwJw−1−, The lemma follows from applying the induction hypothesis to Y′ and ξd+l.
∎
Proof of Proposition 4.4.
We may assume that the a is big enough such that each w∈W has a representative w˙ in Gqa. Fix a representative s˙ of s=sα in Gqa.
Since UwJw−1s=Uα(UwJw−1)s, we have
[TABLE]
By Lemma 3.2 (1), the above equation equals to
[TABLE]
By the assumption UwJw−1s,qaswCJ∈M, we get
[TABLE]
Let ΦwJw−1−∩ΦwJw−1s−={α1,α2,…,αm}. By Corollary 2.2 we have UwJw−1=(UwJw−1)s, which implies ΦwJw−1−∩ΦwJw−1s+=∅. Let ΦwJw−1−∩ΦwJw−1s+={β1,β2,…,βn}. Hence UwJw−1 is the product of Uαi and Uβj for i=1,2,…,m and j=1,2,…,n. Write γi=s(βi), then (UwJw−1)s is the product of Uαi and Uγj for i=1,2,…,m and j=1,2,…,n.
Choose βH∈{β1,β2,…,βn} such that
[TABLE]
Then the following property hold: (♣) βH+γi=γj for any i,j.
Indeed, we have
[TABLE]
Since wJw−1(βH)∈Φ− and wJw−1α∈Φ+, this forces ⟨βH,α∨⟩<0. If βH+γi=γj, then
[TABLE]
It follows that ht(βj)>ht(βH) which contradicts to the choice of βH. This proves Property (♣).
We consider the following set
[TABLE]
It is clear that V is a subgroup of UwJw−1 and also a subgroup of (UwJw−1)s. Let
[TABLE]
Then
UwJw−1=VV1 and (UwJw−1)s=VV2. Let b∈N such that b=a and a∣b and I be a set of the left coset representatives of Vqa in Vqb, and write
[TABLE]
We set
[TABLE]
It is clear that
[TABLE]
Since
UwJw−1,qawCJ−(UwJw−1,qa)sswCJ∈M,
we have ξ−η∈M.
Let IH be a set of the left coset representatives of UβH,qa in UβH,qb. Using Property (♣) and Lemma 4.5 (ii), we obtain IHη=qb−aη=0 since chark=charFq. Therefore by Lemma 4.5 (i), IHξ∈M is nonzero. Let N=kUqbIHξ⊂M. Then NUqb=0 by [Se, Proposition 26]. Since NUqb⊂(kUqbwCJ)Uqb=kUwJw−1,qbwCJ, we have UwJw−1,qbwCJ∈M which completes the proof.
∎
5 Another Proof of Theorem 4.1
In this section, we assume that chark=charFq. Let w0 be the longest element in W and write w0=vJwJwJ′ with ℓ(w0)=ℓ(vJ)+ℓ(wJ)+ℓ(wJ′) (Recall that J′=I\J). In this section, we combine Proposition 4.4 and Proposition 5.1 below to give an another proof of Theorem 4.1.
Proposition 5.1**.**
Let M be a nonzero kG-submodule of EJ′. Then
[TABLE]
for some a∈N.
To prove this, we make some preparation. Following [CL, Proposition 3.16], for any a∈N and w∈W there is a Tw∈EndkGqa(kGqa1tr) such that Tw1tr=Uw,qaw−11tr. For any J⊂I, denote
[TABLE]
Combining [CL, Theorem 7.1], [CL, Theorem 7.4], and [CL, Corollary 7.5] yields
Lemma 5.2**.**
The map J↦kGqafqaJ is a bijection between the subsets of I and the irreducible summands of SocGqakGqa1tr. Moreover, the stablizer of the space kfqaJ in Gqa is PJ,qa, and kfqaJ is the unique 1-dimensional Uqa-invariant space in kGqafqaJ.
Keep the notation PK, 1K, MK, J′ in the end of Section 3. For any a∈N, let fK,qa=∑w∈WKUw−1,qaw1tr∈M(tr). Since fK,qa is PK,qa-invariant and all uwfK,qa (w∈WK,u∈Uw−1,qa) are linearly independent, the kGqa-module MK,qa=kGqa1K⊂MK is isomorphic to the kGqa-submodule of kGqa1tr generated by fK,qa (via 1K↦fK,qa). The kGqa-module EJ,qa′=kGqaDJ is isomorphic to the submodule of kGqa1tr generated by the element ∑w∈WJ(−1)ℓ(w)wfJ′,qa (via DJ↦∑w∈WJ(−1)ℓ(w)wfJ′,qa). We denote φ for this isomorphism in the sequel.
Since the conjugation by w0 permutes the simple reflections, this induces a permutation σ on I. Notice that WσJ′=w0WJ′w0. By definition we have
[TABLE]
The above formula implies
[TABLE]
By the definition of φ, we have
[TABLE]
Assume that w≨wJ. Then there exists a γ∈Φ+ such that wJvJ−1(γ)∈Φ− and w−1vJ−1(γ)∈Φ+ and hence
[TABLE]
It follows that
[TABLE]
if w≨wJ. Combining (8), (9), (10) yields
[TABLE]
Lemma 5.3**.**
The kGqa-socle of EJ,qa′ is simple and generated by φ(fqaσJ′).
Proof.
By above discussion and Lemma 5.2, SocGqaEJ,qa′⊃kGqaφ(fqaσJ′). It remains to show that φ(fqaσK′)∈EJ,qa′ for K=J by Lemma 5.2. Suppose that φ(fqaσK′)∈EJ,qa′, then we have DK∈EJ,qa′ by the same arguments in the previous section, and the above discussion. It follows that EK′⊂EJ′ and taking the T-fixed points yields the inclusion ϕ:(EK′)T→(EJ′)T. But DK∈(EK′)T is uniquely determined by the following two conditions: (i) si˙DK=−DK if and only if i∈K, and (ii) UαiDK=DK if and only if i∈K. Therefore, K=J implies any nonzero element in (EJ′)T does not satisfy the above conditions for DK, and such ϕ does not exist. This contradiction completes the proof.
∎
With the above preparation, we can give
Proof of Proposition 5.1.
Let 0=x∈M. Then x∈M∩EJ,qa′ for some a∈N, and hence
[TABLE]
by Lemma 5.3.
It follows that φ(fqaσJ′)=(−1)ℓ(wJ)UwJvJ−1,qavJDJ∈M which completes the proof.
∎
Using Proposition 5.1 and the same discussion in Section 4, we can also prove that EJ′ is irreducible which implies the irreducibility of EJ by Proposition 3.5.
6 Further Developments
In this section we propose some questions on infinite dimensional abstract representations of reductive groups with Frobenius maps. Any one-dimensional representation θ of T is regarded as a representation of B through the homomorphism B→T. Let M(θ)=kG⊗kBθ. If k=Fˉq and θ is a rational character of T, the first author gave in [Chen1] a necessary and sufficient condition for irreducibility of M(θ), and found some M(θ) with infinitely many irreducible subquotients. The following questions naturally arise.
(1) Can one give a characteristic free proof of Theorem 4.1?
(2) What is the necessary and sufficient condition for M(θ) to have finitely many composition factors? If so, how does M(θ) decompose?
(3) Besides the irreducibility of EJ, Proposition 3.5 is more interesting in its own right. Now that EJ can be realized as a submodule of a parabolic induced module, can one give a geometric construction of EJ (probably using the geometry of partial flag varieties G/PK, K⊂I)?