Irreducible tensor products for alternating groups in characteristics 2 and 3
Lucia Morotti
Institut für Algebra, Zahlentheorie und Diskrete Mathematik
Leibniz Universität Hannover
30167 Hannover
Germany
[email protected]
Abstract.
In this paper we study irreducible tensor products of representations of alternating groups in characteristic 2 and 3. In characteristic 3 we completely classify irreducible tensor products, while in characteristic 2 we completely classify irreducible tensor products where neither factor in the product is a basic spin module. In characteristic 2 we also give some necessary conditions for the tensor product of an irreducible module with a basic spin module to be irreducible.
1. Introduction
Let F be an algebraically closed field of characteristic p≥0 and G be a group. In general, given irreducible FG-representations V and W, the tensor product V⊗W is not irreducible. We say that V⊗W is a non-trivial irreducible tensor product if V⊗W is irreducible and neither V nor W has dimension 1. One motivation to this question is the Aschbacher-Scott classification of maximal subgroups of finite classical groups, see [1] and [2]. In particular, in view of class C4, a classification of non-trivial irreducible tensor products is needed to understand which subgroups appearing in class S are maximal, see [29] for more details.
Non-trivial irreducible tensor products of representations of symmetric groups have been fully classified (see [6], [13], [14], [31] and [36]). In particular non-trivial irreducible tensor products for symmetric groups only exist in characteristic 2 for n≡2mod4. For alternating groups in characteristic 0 or p≥5 non-trivial irreducible tensor products have been classified in [5], [7], [32] and [36].
In this paper we will consider the case where G=An is an alternating group and p=2 or 3. Our main result, which extends [7, Main Theorem] and [32, Theorem 1.1] in a slight modified version, is the following. For an explanation of the notations used see §2.1 and the last part of §2.2.
Theorem 1.1**.**
Let V and W be irreducible FAn-modules of dimension larger than 1. If V⊗W is irreducible then one of the following holds up to exchange of V and W:
- (i)
p∤n, V≅E±λ where λ is a JS-partition and W≅E(n−1,1). In this case V⊗W is always irreducible and
V⊗W≅E(λ∖A)∪B, where A is the top removable node of λ and B is the second bottom addable node of λ.
2. (ii)
p=3, V≅E+(4,12) and W≅E−(4,12). In this case V⊗W≅E(4,2).
3. (iii)
p=2, V is basic spin and at least one of V or W cannot be extended to a FΣn-module.
Note that in the first two cases the tensor products are irreducible. This does however not always hold in the third case. A classification of irreducible tensor products with a basic spin module for alternating groups in characteristic 2 is currently not known. In Section 13 we will consider case (iii) more in details and give some conditions for such products to be irreducible.
In the next section we will give an overview of known results which will be used in the paper. In Section 5 as well as in Sections 7 to 9 we study, in different ways, certain submodules of the modules HomΣn(Dλ) and HomAn(E±λ), using results from Sections 3 and 4 and Section 6 respectively. These results will then be used in Sections 10 and 11 to study tensor products of a non-split and a split modules and of two split modules. Together with results on tensor products for modules of symmetric groups this will allow us to prove Theorem 1.1 in Section 12. Although we cannot completely classify irreducible tensor products in characteristic 2 with a basic spin module, we will give some more restrictions for such tensor products to be irreducible in Section 13.
2. Notations and basic results
Throughout the paper F will be an algebraically closed field of characteristic p.
Given modules M and N1,…,Nh we will write
[TABLE]
if M has a filtration with subquotients Nj counted from the bottom and
[TABLE]
if there exists modules Mi,Nj,ℓ such that M≅M1⊕…⊕Mk and Mj∼Nj,1∣…∣Nj,hj for 1≤j≤k. Further if modules V1,…,Vh are simple, we will write
[TABLE]
if M is uniserial with factors Vj counted from the bottom and then similarly to above we will also write
[TABLE]
For certain specific modules V, where V is a simple or (dual of a) Specht module or direct sum of such, we will sometimes write V⊆M. When writing this we will always mean that V is contained in M up to isomorphism.
2.1. Irreducible modules
It is well known that irreducible representations of symmetric groups in characteristic p are indexed by p-regular partitions and that they are self-dual. For λ∈Pp(n) a p-regular partition, let Dλ be the corresponding simple FΣn-module. The module Dλ can be defined as the head of Sλ, see [16, Corollary 12.2]. Further let λM∈Pp(n), the Mullineux dual of λ, be the unique partition with DλM≅Dλ⊗sgn (where sgn is the sign representation of FΣn).
For p≥3 it is well known that if λ=λM then Dλ↓An=Eλ is irreducible (and in this case Eλ≅EλM), while if λ=λM then Dλ↓An=E+λ⊕E−λ is the direct sum of two non-isomorphic irreducible representations of An. Further all irreducible representations of An are of one of these two forms (see for example [11]). If p=2 there is a different description of splitting irreducible representations (see Lemma 2.1). Also in this case either Dλ↓An is irreducible or it is the direct sum of two non-isomorphic irreducible representations and any irreducible representation of An is of one of these two forms.
For any p let
[TABLE]
If p≥3 we have from the previous paragraph that λ∈PpA(n) if and only if λ=λM. For p=2 we have the following result:
Lemma 2.1**.**
[4, Theorem 1.1]**
Let p=2 and λ∈P2(n). Then λ∈P2A(n) if and only if the following hold
λ2i−1−λ2i≤2* for each i≥1 and*
λ2i−1+λ2i≡2mod4* for each i≥1.*
When considering splitting modules for p≥3 we have the following result, where h(λ) is the number of parts of λ:
Lemma 2.2**.**
[28, Lemma 1.8]**
Let p≥3 and n≥5. If λ∈PpA(n) then h(λ)≥3.
If p=2 a special role will be played by the irreducible modules indexed by the partition βn:=(⌈(n+1)/2⌉,⌊(n−1)/2⌋). Such modules (for Σn) can be obtained by reducing modulo 2 a basic spin module of the covering group of Σn and are therefore also called basic spin modules (see [4]).
It easily follows from Lemmas 2.1 and 2.2 that for large n, splitting modules cannot be indexed by partitions with at most two rows, unless possibly p=2 and the module is a basic spin module.
2.2. Branching
Since we will often study restrictions of modules to Young subgroups, we will now give a review of the needed branching results.
Given a node (a,b) define its residue by res(a,b)=b−amodp. Given a partition λ define its content to be the tuple (c0,…,cp−1), where ci is the number of nodes of λ of residue i, for each residue i. Two simple FΣn-modules are in the same block if and only if the corresponding partitions have the same content. Thus we may define the content of a block and distinct blocks have distinct contents. For a residue i and a module M contained in the block with content (c0,…,cp−1), let eiM (resp. fiM) be the block component of M↓Σn−1 (resp. M↑Σn+1) contained in the block with content (c0,…,ci−1,ci−1,ci+1,…,cp−1) (resp. (c0,…,ci−1,ci+1,ci+1,…,cp−1)) if such a block exists or let eiM:=0 (resp. fiM:=0) otherwise. The definitions of eiM and fiM can then be extended to arbitrary modules additively. Then:
Lemma 2.3**.**
For M a FΣn-module we have
[TABLE]
Proof.
We may assume that M has only one block component. For M simple the result holds by [24, Theorems 11.2.7, 11.2.8]. The result then hold in general by definition of ei and fi (there are no other block components).
∎
The following properties of ei and fi can be seen as special cases of [24, Lemma 8.2.2].
Lemma 2.4**.**
If M is self dual then so are eiM and fiM.
Lemma 2.5**.**
The functors ei and fi are left and right adjoint of each other.
For r≥1 define ei(r):FΣn\mbox−mod→FΣn−r\mbox−mod and fi(r):FΣn\mbox−mod→FΣn+r\mbox−mod to be the divided power functors (see [24, §11.2] for the definitions). For r=0 define ei(0)Dλ and fi(0)Dλ to be equal to Dλ. For a partition λ let εi(λ) be the number of normal nodes of λ of residue i and φi(λ) be the number of conormal nodes of λ of residue i (see [24, §11.1] or [7, §2] for definitions of normal and conormal nodes). Normal and conormal nodes of partitions will play a crucial role through all of the paper. If εi(λ)≥1 we will denote by e~i(λ) the partition obtained from λ by removing the i-good node, that is the bottom i-normal node. Similarly, if φi(λ)≥1 we denote by f~i(λ) the partition obtained from λ by adding the i-cogood node, that is the top i-conormal node. The next two lemmas will be used throughout the paper and show that the modules eirDλ and ei(r)Dλ (and similarly firDλ and fi(r)Dλ) are closely connected. For r=0 the lemmas hold trivially. For r>0 see [24, Theorems 11.2.10, 11.2.11].
Lemma 2.6**.**
Let λ∈Pp(n), r≥0 and i be a residue. Then eirDλ≅(ei(r)Dλ)⊕r!. Further ei(r)Dλ=0 if and only if εi(λ)≥r. In this case
- (i)
ei(r)Dλ* is a self-dual indecomposable module with head and socle isomorphic to De~ir(λ),*
2. (ii)
[ei(r)Dλ:De~ir(λ)]=(rεi(λ))=dimEndΣn−r(ei(r)Dλ),
3. (iii)
if Dψ is a composition factor of ei(r)Dλ then εi(ψ)≤εi(λ)−r, with equality holding if and only if ψ=e~ir(λ).
Lemma 2.7**.**
Let λ∈Pp(n), r≥0 and i be a residue. Then firDλ≅(fi(r)Dλ)⊕r!. Further fi(r)Dλ=0 if and only if φi(λ)≥r. In this case
- (i)
fi(r)Dλ* is a self-dual indecomposable module with head and socle isomorphic to Df~ir(λ),*
2. (ii)
[fi(r)Dλ:Df~ir(λ)]=(rφi(λ))=dimEndΣn+r(fi(r)Dλ),
3. (iii)
if Dψ is a composition factor of fi(r)Dλ then φi(ψ)≤φi(λ)−r, with equality holding if and only if ψ=f~ir(λ).
For r=1 it follows that ei=ei(1) and fi=fi(1). In this case more composition factors of eiDλ and fiDλ are known by [9, Theorem E(iv)] and [23, Theorem 1.4].
Lemma 2.8**.**
Let λ∈Pp(n). If A is an i-normal node of λ and λ∖A is p-regular then [eiDλ:Dλ∖A] is equal to the number of i-normal nodes of λ weakly above A.
Similarly if B is an i-conormal node of λ and λ∪B is p-regular then [fiDλ:Dλ∪B] is equal to the number of i-conormal nodes of λ weakly below B.
Since the modules eiDλ (or fiDλ) correspond to pairwise distinct blocks, the following holds combining Lemmas 2.3, 2.6(ii) and 2.7(ii).
Lemma 2.9**.**
For λ∈Pp(n) we have that
[TABLE]
When considering the functors e~i and f~i the following easily holds by definition (alternatively see [24, Lemma 5.2.3] for the first part and Lemmas 2.6(iii) and 2.7(iii) for the second part).
Lemma 2.10**.**
For r≥0 and p-regular partitions λ,ν we have that e~ir(λ)=ν if and only if f~ir(ν)=λ. In this case εi(ν)=εi(λ)−r and φi(ν)=φi(λ)+r.
The total numbers of normal and conormal nodes of a partition are related by following result, which hold by the corresponding result for removable and addable nodes and by definition of normal and conormal nodes (the set of normal and conormal nodes is obtained by recursively removing pairs of a removable and an addable node from the set of removable and addable nodes).
Lemma 2.11**.**
Any p-regular partition has 1 more conormal node than it has normal nodes.
The following result connects branching and the Mullineux bijection (see [22, Theorem 4.7] or [32, Lemma 5.10]).
Lemma 2.12**.**
For any partition λ∈Pp(n) and for any residue i we have εi(λ)=ε−i(λM) and φi(λ)=φ−i(λM).
If εi(λ)>0 then e~i(λ)M=e~−i(λM), while if φi(λ)>0 then f~i(λ)M=f~−i(λM).
We conclude by defining JS-partitions. A JS-partition is a partition λ∈Pp(n) for which Dλ↓Σn−1 is irreducible. In view of Lemmas 2.3 and 2.6 a p-regular partition is a JS-partition if and only if it has exactly one normal node. By Lemma 2.11 we then also have that JS-partitions have exactly 2 conormal nodes. JS-partitions will play a special role in this paper. They have a nice combinatorial description, see [20, Section 4] and [21, Theorem D]:
Lemma 2.13**.**
Let λ=(a1b1,…,ahbh) with a1>a2>…>ah≥1 and 1≤bi≤p−1 for 1≤i≤h. Then λ is a JS-partition if and only if ai−ai+1+bi+bi+1≡0modp for each 1≤i<h.
For p=2 this simplifies to:
Lemma 2.14**.**
Let p=2 and λ∈P2(n). Then λ is a JS-partition if and only if all parts of λ have the same parity.
2.3. Permutation modules
For any composition λ of n let Σλ=Σλ1×Σλ2×…⊆Σn be the corresponding Young subgroup and define Mλ:=1↑ΣλΣn. Clearly the modules Mλ are self-dual, as is any permutation module. Note that if λ and μ can be obtained from each other by rearranging their parts, then Mλ≅Mμ. So from now on we will assume that λ∈P(n) is a partition. In this case let Sλ be the Specht module indexed by λ. It is well known that Sλ⊆Mλ (this holds for example by comparing standard bases of Mλ and Sλ). Further let Yλ be the corresponding Young module, that is the module given by the following lemma (see [17] and [30, §4.6]). In the lemma ⊳ denotes the dominance order.
Lemma 2.15**.**
There exist indecomposable FΣn-modules {Yλ∣λ∈P(n)} such that Mλ≅Yλ⊕⨁μ⊳λ(Yμ)⊕mμ,λ for some mμ,λ≥0. Moreover, Yλ can be characterized as the unique direct summand of Mλ containing Sλ. Further Yλ is self-dual for any λ∈P(n).
The above lemma will be used in Section 6 to study the structure of certain small permutation modules. The structure of such permutation modules, together with the next lemma, will then be used in Sections 7 to 9 to study the submodule structure of EndF(V), for V a simple FΣn- or FAn-module using the next lemma, which holds by Frobenious reciprocity. For any partition α∈P(n) let Aα:=An∩Σα. It is easy, by Mackey induction-reduction theorem, to check that if α=(1n) then Mα↓An≅1↑AαAn.
Lemma 2.16**.**
For any FΣn-module V and any α∈P(n) we have that
[TABLE]
Similarly for any FAn-module W and α=(1n) we have that
[TABLE]
The following lemma will play a crucial role in Sections 10 and 11 to prove that in most cases V⊗W is not simple, see [32, Lemma 5.3] for a proof (for p=2 and H=An the proof is similar).
Lemma 2.17**.**
Let H=Σn or H=An and let V and W be FH-modules. For α∈P(n) let mV∗,α,mW,α∈Z≥0 be such that there exist φ1α,…,φmV∗,αα∈HomH(Mα,V∗) with φ1α∣Sα,…,φmV∗,αα∣Sα linearly independent and similarly there exist ψ1α,…,ψmW,αα∈HomH(Mα,W) with ψ1α∣Sα,…,ψmW,αα∣Sα linearly independent. If H=Σn let A:=Pp(n). If H=An and p=2 let A:=P2(n)∖P2A(n). If H=An and p≥3 let A be the set of partitions α∈Pp(n)∖PpA(n) with α>αM. Then
[TABLE]
Since we will often work with permutation modules Mλ with λ=(n−m,μ)=(n−m,μ1,μ2,…) for certain fixed partitions μ∈P(m) with m small, we will write Mμ, Sμ and Yμ for M(n−m,μ), S(n−m,μ) and Y(n−m,μ) respectively, provided (n−m,μ)∈P(n). Similarly, if (n−m,μ)∈Pp(n) is p-regular, we will write Dμ for the simple module D(n−m,μ).
3. Branching recognition
In this section we will show that under certain assumptions on n, if λ∈Pp(n) is of certain special forms, then (some) restrictions Dλ↓Σn−m have composition factors indexed by partitions with similar forms as λ. These results will be used in Section 5 to show existence of homomorphisms Mμ→EndF(D) which do not vanish on Sμ (for certain small partitions μ), where D is a simple FΣn- or FAn-module.
Lemma 3.1**.**
Let p=2 and λ∈P2(n). If n>h(λ)(h(λ)+1)/2 there exists a composition factor Dμ of Dλ↓Σn−1 with h(μ)=h(λ). In particular D(h(λ),h(λ)−1,…,1) is a composition factor of Dλ↓Σh(λ)(h(λ)+1)/2.
Proof.
Note that for any λ∈P2(n) we have that n≥h(λ)(h(λ)+1)/2, with equality holding if and only if λ=(h(λ),h(λ)−1,…,1). So the second part of the lemma follows from the first. Assume now that n>h(λ)(h(λ)+1)/2. Let 1≤k≤h(λ) minimal such that λk≥λk+1+2 (such a k exists since n>h(λ)(h(λ)+1)/2). Then (k,λk) is normal and μ=λ∖(k,λk)∈P2(n−1) with h(μ)=h(λ). The lemma then follows from Lemma 2.8.
∎
Lemma 3.2**.**
Let p=3, n≥9 and λ∈P3(n). If h(λ),h(λM)≥4 then Dλ↓Σn−1 has a composition factor Dμ with h(μ),h(μM)≥4.
Proof.
Assume first that h(λ),h(λM)≥5 and let A be a good node of λ. Then (λ∖A)M=λM∖B for a good node B of λM (see Lemma 2.12). Then Dλ∖A is a composition factor of Dλ↓Σn−1 by Lemma 2.6 and h(λ∖A),h((λ∖A)M)≥4. So, up to exchange of λ and λM we may assume that h(λM)≥h(λ)=4. For any partition α let G1(α) be the first column of the Mullineux symbol of α (see [12, Section 1] for definition of the Mullineux symbol of λ and how to obtain the Mullineux symbol of λM from that of λ). If λ has a normal node C such that λ∖C is 3-regular and G1(λ)=G1(λ∖C) then the lemma holds, by Lemma 2.8 and the combinatorial definition of λM.
Case 1. λ1=λ2. Then λ2>λ3 and we can take C=(2,λ2).
Case 2. λ1=λ2+1=λ3+1=λ4+2. In this case λM=(2λ1−1,2λ1−3) by [3, Lemma 2.3], contradicting the assumptions.
Case 3. λ1=λ2+1=λ3+1=λ4+3. If λ1=4 then λ=(4,3,3,1) and D(5,2,2,1) is a composition factor of D(4,3,3,1)↓Σ10 by [16, Tables]. Since h((5,2,2,1))=h((5,2,2,1)M)=4, we may assume that λ1≥5. In this case D(λ1,λ2,λ3,λ4−1) is a composition factor of Dλ↓Σn−1 and h((λ1,λ2,λ3,λ4−1)),h((λ1,λ2,λ3,λ4−1)M)≥4.
Case 4. λ1=λ2+1=λ3+1>λ4+3. In this case we can take C=(3,λ3).
Case 5. λ1=λ2+1>λ3+1. In this case we can take C=(1,λ1).
Case 6. λ1=λ2+2=λ3+2. Then λ3>λ4 and we can take C=(3,λ3).
Case 7. λ1=λ2+2=λ3+3=λ4+3. If λ1=4 then n=8, so we may assume that λ1≥5. In this case D(λ1,λ2,λ3,λ4−1) is a composition factor of Dλ↓Σn−1 and h((λ1,λ2,λ3,λ4−1)),h((λ1,λ2,λ3,λ4−1)M)≥4.
Case 8. λ1=λ2+2=λ3+3≥λ4+4. In this case we can take C=(2,λ2).
Case 9. λ1=λ2+2=λ3+4=λ4+4. If λ1≥6 we can take C=(4,λ4). If λ1=5 then λ=(5,3,1,1), D(5,2,1,1) is a composition factor of D(5,3,1,1) and h((5,2,1,1)),h((5,2,1,1)M)=4.
Case 10. λ1=λ2+2=λ3+4>λ4+4. In this case D(λ1,λ2,λ3−1,λ4) is a composition factor of Dλ↓Σn−1 and h((λ1,λ2,λ3−1,λ4)),h((λ1,λ2,λ3−1,λ4)M)≥4.
Case 11. λ1=λ2+2≥λ3+5. In this case we can take C=(2,λ2).
Case 12. λ1≥λ2+3. In this case we can take C=(1,λ1).
∎
Lemma 3.3**.**
Let p=3, n≥7 and λ=(n−k,k) with n−2k≥2 and k≥2. Then Dλ↓Σn−1 has a composition factor Dμ with μ=(n−1−ℓ,ℓ) with n−1−2ℓ≥2 and ℓ≥2. In particular D(4,2) is a composition factor of Dλ↓Σ6.
Proof.
If n−2k≥3 then we can take μ=(n−k−1,k) by Lemma 2.8. If n−2k=2 then k≥3 since n≥7 and, again by Lemma 2.8, we can take μ=(n−k,k−1). The result for Dλ↓Σ6 follows by induction.
∎
Lemma 3.4**.**
Let p=3, n>6 and λ∈P3A(n) be a JS-partition with h(λ)=3. Then n≡0mod6 and Dλ↓Σn−6 has a composition factor Dμ with μ∈P3A(n−6) a JS-partition with h(μ)=3. Further D(5,12) is a composition factor of Dλ↓Σ7.
Proof.
We have that λ∈P3A(m) if and only if λ∈P3(m) is Mullineux-fixed. From [8, Theorem 4.1] we have that Mullineux-fixed partitions with 3-parts are exactly the partitions with Mullineux symbols
[TABLE]
So λ=λM and h(λ)=3 if and only if n≡0mod6 and λ=(n/2+1,(n/2−1)M). Assume that this is the case. From Lemma 2.8 it follows that D(n/2,(n/2−1)M), D(n/2,(n/2−2)M), D(n/2,(n/2−3)M), D(n/2−1,(n/2−3)M), D(n/2−1,(n/2−4)M) and D(n/2−2,(n/2−4)M) are composition factors of Dλ↓Σn−k with 1≤k≤6. We can then take μ=(n/2−2,(n/2−4)M)=((n−6)/2+1,((n−6)/2−1)M). For the last claim note that by induction D(7,3,2) is a composition factor of Dλ↓Σ12 and by the previous D(7,3,2)↓Σ7 has a composition factor D(5,12).
∎
4. Special homomorphisms
In this section we will give conditions under which there exist homomorphisms Mμ→EndF(D) which do not vanish on Sμ. Such conditions will then be checked to hold in some cases in the next section.
Lemma 4.1**.**
Let n≥6 and V be a FAn-module. For pairwise distinct a,b,c define [a,b,c]:=(a,b,c)+(a,c,b). If
[TABLE]
and x3V=0 then there exists ψ∈HomAn(M3↓An,EndF(V)) which does not vanish on S3↓An.
Proof.
Let {v{x,y,z}∣x,y,z\mboxdistinctelementsof{1,…,n}} be the standard basis of M3. Define ψ∈HomAn(M3↓An,EndF(V)) through
[TABLE]
for each w∈V (it can be easily checked that ψ is an homomorphism). Let
[TABLE]
Then e generates S3 (see[16, Section 8]), since it corresponds to the tableau
[TABLE]
Notice that ψ(e)(w)=x3w. Similar to [25, Lemma 6.1], ψ vanishes on S3↓An if and only if x3E±λ=0.∎
Lemma 4.2**.**
[25, Lemma 6.1]**
Let n≥8 and V be a FΣn-module. For pairwise distinct a,b,c,d define [a,b,c,d] to be the sum of all elements of Σ{a,b,c,d} which do not fix any element. If
[TABLE]
and x4V=0 then there exists ψ∈HomΣn(M4,EndF(V)) which does not vanish on S4.
Lemma 4.3**.**
[32, Lemma 6.1]**
Let p≥3, n≥6 and V be a FΣn-module. If
[TABLE]
and x22V=0 then there exists ψ∈HomΣn(M22,EndF(V)) which does not vanish on S22.
5. Homomorphism rings
With the help of the two previous sections we will now show that in many cases there exist homomorphisms Mμ→EndF(D) which do not vanish on Sμ. Existence of such homomorphisms will then be used to prove that often V⊗W is not irreducible. In the next lemma remember that βn=(⌈(n+1)/2⌉,⌊(n−1)/2⌋) is the partition labeling the basic spin modules in characteristic 2.
Lemma 5.1**.**
[25, Corollary 6.4]**
Let p=2 and n≥5. If λ∈P2(n) with λ=(n),βn, then there exists ψ∈HomΣn(M2,EndF(Dλ)) which does not vanish on S2.
Lemma 5.2**.**
[25, Corollary 6.10]**
Let p=2 and n≥6. If λ∈P2(n) with h(λ)≥3, then there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3.
Lemma 5.3**.**
Let p=2 and n≥7. If λ∈P2(n) with h(λ)≥3 and λ∈P2A(n), then there exists ψ∈HomAn(M3↓AnEndF(E±λ)) which does not vanish on S3↓An.
Proof.
From [25, Lemma 3.17] and Lemma 2.1 we have that E(4,2,1) is a composition factor of E±λ↓A7. From Lemma 4.1 it is enough to prove that x3E±λ=0 (where x3 is as in [25, §6.1] or Lemma 4.1), which follows from x3E(4,2,1)≅x3D(4,2,1)=0 by [25, Lemma 6.9].
∎
Lemma 5.4**.**
Let p=2 and n≥10. If λ∈P2(n) with h(λ)≥4, then there exists ψ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
By Lemma 3.1, D(4,3,2,1) is a composition factor of Dλ↓Σ10. Since (4,3,2,1) is a 2-core we have that D(4,3,2,1)≅S(4,3,2,1). From Lemma 4.2 it is enough to prove that x4Dλ=0, where x4 is as in Lemma 4.2.
In particular it is enough to prove that x4S(4,3,2,1)=0. If vt and et are the standard basis elements of M(4,3,2,1) and S(4,3,2,1) respectively (see [16, Section 8]) it can be easily checked that x4es has non-zero coefficient for vy, where
[TABLE]
and so the lemma follows.
∎
Lemma 5.5**.**
[27, Lemma 3.8]**
Let p=3 and n≥4. If λ∈P3(n) with λ=(n),(n)M, then there exists ψ∈HomΣn(M2,EndF(Dλ)) which does not vanish on S2.
Lemma 5.6**.**
[25, Corollary 6.7]**
Let p=3 and n≥6. If λ∈P3(n) with h(λ),h(λM)≥3, then there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3.
Lemma 5.7**.**
Let p=3 and n≥8. If λ∈P3(n) with h(λ),h(λM)≥4, then there exists ψ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
By Lemma 4.2 in order to prove the lemma it is enough to prove that x4Dλ=0 (where x4 is as in Lemma 4.2). Using Lemma 3.2 it is enough to prove the lemma when n=8. So we may assume that λ=(4,2,1,1). Since (4,2,1,1) is a 3-core, D(4,2,1,1)≅S(4,2,1,1). Let
[TABLE]
be the standard basis of M(4,2,1,1). Let e be the basis element of S(4,2,1,1) corresponding to the tableau
[TABLE]
(see [16, Section 8] for definition of e). Then it can be proved that the coefficient of x4e corresponding to v{2,3},1,8 is non-zero and so the lemma holds.
∎
Lemma 5.8**.**
Let p=3, n≥6 and λ=(n−k,k) with n−2k≥2 and k≥2. Then there exists ψ∈HomΣn(M22,EndF(Dλ)) which does not vanish on S22.
Proof.
Similar to the previous lemmas, from Lemmas 3.3 and 4.3 it is enough to prove that x22D(4,2)=0 (with x22 as in Lemma 4.3). Notice that D(4,2)≅S(4,2). Let {v{i,j}:1≤i<j≤6} be the standard basis of M(4,2) and e be the basis element of S(4,2) corresponding to the tableau
[TABLE]
(see [16, Section 8] for definition of e). It can be computed that the coefficient of x22e corresponding to v{1,5} is non-zero, thus proving the lemma.
∎
Lemma 5.9**.**
Let p=3 and n≥9. If λ∈P3A(n) then there exists ψ∈HomAn(M3↓An,EndF(E±λ)) which does not vanish on S3↓An.
Proof.
From Lemma 2.2 we have that h(λ)≥3. Note that there are no Mullineux fixed partitions for p=3 and n=9. In view of [25, Lemma 3.16] there exists μ∈P3(9) with h(μ),h(μM)≥3 and Eμ a composition factor of E±λ↓A9. By [25, Lemma 6.6] we have that x3Eμ≅x3Dμ=0. In particular x3E±λ=0 and so the lemma holds by Lemma 4.1.
∎
Lemma 5.10**.**
Let p=3, n>6 and λ∈P3A(n) be a JS-partition with h(λ)=3. Then there exists ψ∈HomΣn(M22,EndF(Dλ)) which does not vanish on S22.
Proof.
From Lemmas 3.4 and 4.3 it is enough to prove that x22D(5,12)=0 (with x22 as in Lemma 4.3). Notice that D(5,12)≅S(5,12) (see [16, Tables]). Let {vi,j:i=j∈{1,…7}} be the standard basis of M(5,12) and {ei,j:2≤i<j≤7} be the standard basis of S(5,12) (see [16, Section 8]). It can be checked that the coefficient of x22e2,4 corresponding to v2,5 is non-zero and so the lemma follows.
∎
6. Permutation modules
In this section we consider the structure of certain permutation modules Mα. The structure of many of the modules considered here has already been studied in other papers, in some cases dual filtrations to those presented here where found. Note that if M∼N1∣…∣Nh then M∗∼Nh∗∣…∣N1∗. As noted in section 2, the modules Mλ, Yλ and Dλ are self-dual. Remember that Mμ:=M(n−m,μ) and similarly for Sμ, Dμ and Yμ if μ∈P(m).
Lemma 6.1**.**
[25, Lemmas 4.7 and 4.9]**
Let p=2. If n≥6 is even then M1≅D0∣D1∣D0∼S1∣D0 and M2∼S2∣(D0⊕S1). Further if n≡0mod4 then
[TABLE]
Lemma 6.2**.**
Let p=2. If n≥7 is odd then
[TABLE]
Proof.
This follows from [25, Lemma 4.6], since hd(Sk)≅Dk for 0≤k<n/2 (in particular in these cases Sk is indecomposable) and Sk⊆Mk.
∎
Lemma 6.3**.**
Let p=3, n≥8 with n≡2(mod3). Then
[TABLE]
Proof.
This holds by [25, Lemma 4.5], since hd(Sk)≅Dk for 0≤k≤n/2 and Sk⊆Mk.
∎
Lemma 6.4**.**
Let p=3, n≡0(mod3) with n≥9. Then
[TABLE]
for a module A⊆M3 with M3/A≅S1.
Proof.
For the structure of M1, M2 and M3 see [25, Lemma 4.3], together from Sk⊆Mk and hd(Sk)≅Dk for k≤n/2. It then also follows that S2≅D2.
For the structure of M12 note that by Lemma 6.3 and [16, Corollary 17.14]
[TABLE]
We then only still have to study the structure of M4.
For 0≤k≤n/2 let
[TABLE]
be the standard basis of Mk. Given 0≤k≤ℓ≤n/2 define ηℓ,k:Mℓ→Mk by
[TABLE]
for any element vI of the standard basis of Mℓ.
From [35, Theorem 1] we have that dimImη4,3=dimM3−(n−1), dimImη4,1=dimM1 and dimImη3,1=n−1. In particular there exist submodules X,Y⊆M4 and A⊆M3 with dimA=dimM3−(n−1) such that M4∼X∣A and M4∼Y∣M1. Further η3,1∘η4,3=0 by [35, (3.1)]. So A≅kerη3,1. So M3/A≅Imη3,1⊆M1 has dimension n−1. Since M1≅D0∣D1∣D0∼S1∣D0 is uniserial and D0≅1Σn, it then follows that M3/A≅S1. Since D3≅hd(S3) is not a composition factor of S1 and S3⊆M3, it follows that S3⊆A. From [16, Example 17.17, Theorem 24.15] we also have that D1≅hd(S1) is not a composition factor of A/S3. Since D0 is contained exactly once in the head of Mk for each k, it follows that M4∼(X∩Y)∣S1∣A. As S4⊆M4 and D4≅hd(S4) is not a composition factor of S1 or A, it follows by comparing dimensions that M4∼S4∣S1∣A.
∎
Lemma 6.5**.**
Let p=3, n≡1(mod3) with n≥10. Then
[TABLE]
Proof.
For the structure of M1, M2 and M3 see [25, Lemma 4.4] and use that hd(Sk)≅Dk for k≤n/2. Notice that D1 and D4 are in the same block, while D0, D2 and D3 are in a different block. Further S4≅D4 or S4≅D1∣D4 from [16, Theorem 24.15]. In particular Y4≅D4 if S4≅D4 or Y4≅D1∣D4∣D1 if S4≅D1∣D4. The lemma then follows from Lemma 2.15 and by comparing composition factors (see [16, Example 17.17, Theorem 24.15]).
∎
7. Partitions with at least 2 normal nodes
In the next three sections we will study more in details the endomorphism rings of the modules Dλ, Eλ or E±λ for certain particular classes of partitions. We start here by considering the case where λ has at least 2 normal nodes.
Lemma 7.1**.**
Let p=2 and n≥10 be even. If λ∈P2(n) with ε0(λ)+ε1(λ)≥3 then there exist ψ,ψ′,ψ′′∈HomΣn(M2,EndF(Dλ)) such that ψ∣S2, ψ′∣S2 and ψ′′∣S2 are linearly independent.
Proof.
By Lemma 6.1 we have that M2∼S2∣(D0⊕S1). By Lemma 2.16 if
[TABLE]
then there exist homomorphisms φi∈HomΣn(M2,EndF(Dλ)) for 1≤i≤c−1 such that φ1∣S2,…,φc−1∣S2 are linearly independent. Since λ has at least 3 normal nodes we have by [25, Lemma 5.4] and Lemmas 2.16 and 4.3 that
[TABLE]
and so by [31, Lemma 4.14]
[TABLE]
from which the lemma follows.
∎
Lemma 7.2**.**
Let p=2 and n≥10 be even. Assume that λ∈P2A(n) with ε0(λ)+ε1(λ)=2. Then there exist ψ,ψ′∈HomΣn(M2,EndF(Dλ)) such that ψ∣S2 and ψ′∣S2 are linearly independent.
Proof.
By Lemma 6.1 we have that M2∼S2∣(D0⊕S1) and so by Lemma 2.16 it is enough to prove that
[TABLE]
From [25, Lemma 5.5] we have that dimEndΣn−2,2(Dλ↓Σn−2,2)≥4. By [25, Lemmas 3.12, 3.13] we may then assume that dimHomΣn(S1,EndF(Dλ))=2 and that for some residue ℓ we have εℓ(λ),φℓ(λ)>0 and (λ∖X)∪Y is not p-regular, where X is the ℓ-good node and Y the ℓ-cogood node of λ. By [25, Lemma 2.13] we then have that h(λ)≥3 and that there exists 1≤j≤h(λ) with λj=λj+1+2 and
[TABLE]
If j is odd then there exists k≥1 such that λ2k+1≥1 and
[TABLE]
From Lemma 2.1 this contradicts the assumption that Dλ↓An splits. So j is even. If j=h(λ) then λh(λ)=2 and the other parts of λ are odd, contradicting n being even. If j=h(λ)−1 then, from Lemma 2.1, λh(λ)−1=3, λh(λ)=1 and the other parts of λ are even. So again from Lemma 2.1, λ=(4,3,1), contradicting n≥10. Thus 2≤j≤h(λ)−2 is even. Notice that the normal nodes of λ are on rows 1 and j and so they have the same residue i. It then follows from Lemmas 2.3 and 2.6 that Dλ↓Σn−2,2≅A⊕B with A↓Σn−2≅ei2Dλ and B↓Σn−2≅e1−ieiDλ. From [31, Lemma 4.15] we have that A≅(De~i2(λ)⊗D(2))∣(De~i2(λ)⊗D(2)). So it is enough to prove that
[TABLE]
Notice that B is self-dual, since it is a block component of a self-dual module of Σn−2,2. Further
[TABLE]
and then from 2≤j≤h(λ)−2,
[TABLE]
So ε1−i(e~i(λ))=2 (the corresponding normal nodes are on rows j+1 and j+2). Let μ:=e~1−ie~i(λ). From Lemma 2.6 it follows that
[TABLE]
with C=ei−1De~i(λ) indecomposable with simple head and socle and [C:Dμ]=2. So B is not semisimple. If the socle of B is not simple then dimEndΣn−2,2(B)≥3 (since head and socle of B are isomorphic and B is not semisimple). So we may assume that the socle of B is simple. Since
[TABLE]
and any composition factor of M(12) is of the form D(2), we then have that soc(B)≅De~1−ie~i(λ)⊗D(2). Further
[TABLE]
Note that
[TABLE]
So there exists a quotient C of C⊗M(12) not isomorphic to Dμ⊗D(2) such that C⊆B. Further soc(B)⊊C⊆B and C has simple head and socle isomorphic to Dμ⊗D(2). If C≅C⊗M(12) then C is self-dual, as is B. So C⊗M(12) is also a quotient of B and then
[TABLE]
(using Lemma 2.6). So we may assume that C≅C⊗M(12). Notice that [C⊗M(12):Dμ⊗D(2)]=4, that C⊗M(12) has simple head and socle isomorphic to Dμ⊗D(2) and that C⊗D(2) and Dμ⊗M(12) are distinct submodules of C⊗M(12) with [C⊗D(2):Dμ⊗D(2)]=2, [Dμ⊗M(12):Dμ⊗D(2)]=2 and both C⊗D(2) and Dμ⊗M(12) have simple head and socle isomorphic to Dμ⊗D(2). So [C:Dμ⊗D(2)]=2.
Note that when μ∈Pp(m) and Dμ is defined as KΣm-module (with K a field which is not necessarily algebraic closed), then any block component of the restriction of Dμ to a Young subgroup is self-dual. Further any permutation module of KG is self-dual, for any field K and group G. In particular the previous part, about the structure of B, also holds over F2 (since F2 is a splitting field of Σm for any m) and not only over F, where F is algebraically closed, so until the end of the proof we will work over the field F2.
In this case there exist exactly three submodules E1,E2,E3⊆C⊗M(12) with [Ej:Dμ⊗D(2)]=2 and head and socle isomorphic to Dμ⊗D(2). Similarly C⊗M(12) has exactly three quotients F1,F2,F3 with [Fj:Dμ⊗D(2)]=2 and head and socle isomorphic to Dμ⊗D(2). We may assume that E1≅F1≅C⊗D(2) and that E2≅F2≅Dμ⊗M(12). Let g1,g2∈EndΣn−2,2(C⊗M(12)) with Imgj=Ej and (C⊗M(12))/Kergj=Fj. Since C⊗M(12) has simple head and socle isomorphic to Dμ⊗D(2), then so does Im(g1+g2), if it is non-zero. Since Ej⊆Ek if j=k, we then have that E3=Im(g1+g2) and (C⊗M(12))/Ker(g1+g2)=F3. So E3≅F3. By duality of C⊗M(12), there exists σ∈Σ3 with Fσ(j)∗≅Ej for 1≤j≤3. Since E1≅F1 and E2≅F2 are self-dual, it then follows that also E3≅F3 is self-dual. In particular C is self dual, since it is isomorphic to some Ej.
Since soc(B)⊊C⊊B and any of these three modules is self-dual, it then follows that dimEndΣn−2,2(B)≥3.
∎
8. Two rows partitions
Modules indexed by two rows partitions will play a special role in the proof of Theorem 1.1, since in this case not all results from Section 5 apply. So we will consider them more in details in this section. We start by citing a branching result for two rows partitions, which is part of the main result of [33], that will be used in this section.
We want to remember that when writing for example D1⊆EndF(V) we mean that EndF(V) has a submodule which is isomorphic to D1.
Lemma 8.1**.**
Let λ=(n−k,k) with k≥1 and n−2k≥1. Write n−2k=∑jsjpj with 0≤sj<p and let t minimal such that st<p−1. If t≥1 then, in the Grothendieck group, [Dλ↓Σn−1] is equal to
[TABLE]
where D(n−k−1+r,k−r):=0 if (n−k−1+r,k−r)∈Pp(n−1) and δ=1 if st<p−2 or δ=0 else.
Lemma 8.2**.**
Let p=2 and n≥7 be odd. If λ=(n−k,k) with k≥2 and n−2k≥3 then there exist ψ2,ψ2′∈HomΣn(M2,EndF(Dλ)) such that ψ2∣S2, ψ2′∣S2 are linearly independent or there exists ψ3∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3.
Proof.
From Lemma 6.2, M2∼S2∣M1 and M3∼S3∣M2. So if
[TABLE]
there exist ψ,ψ′∈HomΣn(M2,EndF(Dλ)) such that ψ∣S2, ψ′∣S2 are linearly independent, by Lemma 2.16. If
[TABLE]
there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3, again by Lemma 2.16.
Since n is odd, both removable nodes are normal and so, by Lemma 2.9, dimEndΣn−1(Dλ↓Σn−1)=2. It is then enough to prove that at least one of
[TABLE]
holds. Note that n−2k is odd.
Case 1: n−2k≡3mod4, so t≥2 in Lemma 8.1. Then by block decomposition (Lemma 2.3), Lemmas 2.6 and 8.1
[TABLE]
where [A:D(n−k−2,k)]=1 and [A:D(n−k,k−2)]=2. It easily follows that Dλ↓Σn−2,2 has (at least) 2 block components with at least 2 composition factors each and then dimEndΣn−2,2(Dλ↓Σn−2,2)≥4, since FΣn- and FΣn−2,2-modules are self-dual.
Case 2: n−2k≡1mod4, so t=1 in Lemma 8.1. Then by block decomposition (Lemma 2.3), Lemmas 2.6 and 8.1
[TABLE]
where B and C are indecomposable with simple head and socle. To see this, note that Dλ↓Σn−1 is indecomposable with simple head and socle each isomorphic to D(n−k,k−1) by Lemma 2.6 and the composition factors, with multiplicities, of Dλ↓Σn−1 are known by Lemma 8.1. The structure of Dλ↓Σn−2 then follows by Lemmas 2.3 and 2.6. For Dλ↓Σn−3 use again Lemmas 2.6 and 8.1.
Notice that Dλ↓Σn−3,3≅F⊕G, where all composition factors of F↓Σ1n−3,3 are of the form 1⊗D(3) and all composition factors of G↓Σ1n−3,3 are of the form 1⊗D(2,1) (since D(3) and D(2,1) are in different blocks). From [10, Lemma 1.11] we have that D(n−k−2,k−1)⊗D(2,1) and D(n−k−3,k)⊗D(3) are composition factors of Dλ↓Σn−3,3. So F has a composition factor isomorphic to D(n−k−2,k−1)⊗D(2,1). Since D(2,1) has dimension 2 and D(n−k−2,k−1) appears only once in the socle of Dλ↓Σn−3, it follows that F is non-zero and not simple. Similarly G is non-zero and not simple, since it has a composition factor D(n−k−3,k)⊗D(3) and D(n−k−3,k) does not appear in the socle of Dλ↓Σn−3. Further F and G are self-dual, since they are block components of Dλ↓Σn−3,3. So dimEndΣn−3,3(Dλ↓Σn−3,3)≥4.
∎
Lemma 8.3**.**
Let p=2 and n≥4 be even. If λ=(n−k,k) with 1≤k<n/2 and dimHomΣn(S1,EndF(Dλ))≥1 then λ=βn. In this case if n≡0mod4 then D1⊆EndF(Dλ), while if n≡2mod4 then S1⊆EndF(Dλ).
Proof.
This follows from [31, Lemma 7.1], since (n−k,k) is JS by Lemma 2.14.
∎
Lemma 8.4**.**
Let p=2 and n≥8 with n≡0mod4. If λ=(n−k,k) with k≥2 and n−2k≥3 then one of the following happens:
D2⊕2⊆EndF(Dλ),
S3⊆EndF(Dλ),
D2⊕D3⊆EndF(Dλ),
there exists ψ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
Note that λ is JS by Lemma 2.14, since n is even and λ has two parts. From Lemmas 2.6 and 8.1 we have that
[TABLE]
where all composition factors of B and C are of the form D(n−k−2+2i,k−2i) with i≥1. Let 0≤j≤⌊k/2⌋ with D(n−k−2+2j,k−2j)⊆N (such a j exists since any composition factor of N, and so also of its socle, is of the form D(n−k−2+2j,k−2j) for some 0≤j≤⌊k/2⌋).
By Lemma 2.6 and block decomposition we then have that
[TABLE]
where m=2j if j<k/2 or m=2j−1 if j=k/2.
Case 1: k≥3. Fix j,m as above. We may assume that there is no ψ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4. By [16, Example 17.17] we have that M4∼S4∣A with A∼S3∣S2∣S1∣S0. Further dimHomΣn(S1,EndF(Dλ))=0 by Lemma 8.3. In particular D1⊆EndF(Dλ), since D1≅hd(S1). By Lemma 2.16 it then follows that
[TABLE]
From Lemma 6.1, S3≅D2∣D1∣D3 and S2≅D1∣D2. From Lemma 5.1 we have that D2⊆EndF(Dλ), since D1⊆EndF(Dλ). By the same reasons, if dimHomΣn(S2,EndF(Dλ))≥2 then D2⊕2⊆EndF(Dλ), while if dimHomΣn(S3,EndF(Dλ))≥1 then D3 or S3 is contained in EndF(Dλ) (and so in this case D2⊕D3 or S3 is contained in EndF(Dλ). Thus it is enough to prove that dimEndΣn−4,4(Dλ↓Σn−4,4)≥3.
We have that (n−k−2,k−2)=(n−k−3+m,k−m−1), since k≥3. If μ is either of these two partitions then
[TABLE]
It then follows that there are at least two non-isomorphic simple modules appearing in the socle of Dλ↓Σn−4,4. Further Dλ↓Σn−4 is not semisimple, since it contains D(n−k−2,k−1)↓Σn−4 which is not semisimple (by Lemma 2.6). So the same holds for Dλ↓Σn−4,4. In particular dimEndΣn−4,4(Dλ↓Σn−4,4)≥3, since Dλ↓Σn−4,4 is self-dual, it is not semisimple and its socle is not simple.
Case 2: k=2. By Lemma 6.1 we have that M3∼M1⊕(S3∣S2). So by Lemmas 2.16 and 2.9
[TABLE]
In this case it is then enough to prove that dimEndΣn−3,3(Dλ↓Σn−3,3)≥3. Since n≡0mod4, from Lemma 8.1 we have that [N]=2[D(n−2)]+[D(n−4,2)] and so [N↓Σn−3]=2[D(n−3)]+[D(n−5,2)]. Since D(n−3) and D(n−5,2) are not in the same block as D(n−4,1), it follows that Dλ↓Σn−3,3 has at least two non-zero block components and that at least one of the block components is not simple. So dimEndΣn−3,3(Dλ↓Σn−3,3)≥3, since block components of Dλ↓Σn−3,3 are self-dual, as are simple FΣn−3,3-modules.
∎
Lemma 8.5**.**
Let p=3, n≡0mod3
and λ=(n−k,k) with 1≤k<n/2. Then
[TABLE]
Proof.
From Lemma 6.4 and self-duality of M1 and D0, we have that M1∼D0∣S1∗. So
[TABLE]
and then there exists D⊆Dλ⊗M1 with D≅Dλ such that Dλ⊗S1∗≅(Dλ⊗M1)/D. Since p=3 and h(λ)=2, from [26, Theorem 2.10] we have that Ext1(Dλ,Dλ)=0. So
[TABLE]
∎
Lemma 8.6**.**
Let p=3, n≥10 with n≡1mod3 and λ=(n−k,k) with 1≤k<n/2. Then
[TABLE]
Proof.
From Lemma 6.5 and self-duality of M2, M1 and D0 we have that M2⊕D0∼M1⊕(D0∣S2∗). Similarly to the previous lemma we then have that
[TABLE]
∎
Lemma 8.7**.**
Let p=3, n≥9 and λ=(n−k,k) with 1≤k≤n/2. If
[TABLE]
then there exists ψ∈HomΣ3(M3,EndF(Dλ)) which does not vanish on S3.
Proof.
If n≡2mod3 we have by Lemma 6.3 that M3∼S3∣M2 and so the lemma follows by Lemma 2.16 applied for both α=(n−2,2) and (n−3,3).
If n≡0mod3 then by Lemma 6.4 we have that M3∼D2⊕(S3∣(D0⊕S1)) and that M2≅D2⊕M1. Again by Lemma 2.16 applied for both α=(n−2,2) and (n−3,3) and by assumption
[TABLE]
Since M2≅D2⊕M1 we then have
[TABLE]
and then from Lemma 8.5
[TABLE]
Since M3∼S3∣(D2⊕D0⊕S1), the lemma follows.
If n≡1mod3 then by Lemma 6.5 we have that M3∼D1⊕(S3∣(D0⊕S2)) and M1≅D0⊕D1. The result then follows by Lemma 8.6 similarly to the previous case.
∎
Lemma 8.8**.**
Let p=3, n≡1mod3 with n≥10 and λ=(n−k,k) with 2≤k<n/2 and n−2k≥2. If
[TABLE]
then there exists ψ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
From Lemma 6.5 we have that M4∼S4∣M3. The result then follows by Lemma 2.16 applied for both α=(n−3,3) and (n−4,4).
∎
Lemma 8.9**.**
Let p=3 and λ=(n−k,k) with n−2k≥2 and k≥2. If the two removable nodes of λ are both normal and have different residues then
[TABLE]
Proof.
In this case n−k≡kmod3, so n−2k≥3. Also if i is the residue of the removable node on the first row of λ, then the residue of the removable node on the second row of λ is i−1. Considering residues of removable/addable nodes of the corresponding partitions, it follows easily from Lemmas 2.3 and 2.6 that eiDλ≅D(n−k−1,k), ei−1Dλ≅D(n−k,k−1) and
[TABLE]
Further eiD(n−k,k−1)≅D(n−k−1,k−1), while ei−1D(n−k−1,k) has simple socle isomorphic to D(n−k−1,k−1) and dimEndΣn−2(ei−1D(n−k−1,k))=2.
Note that
[TABLE]
From [10, Lemma 1.11] we have that D(n−k−2,k)⊗D(2) and D(n−k−1,k−1)⊗D(12) are both composition factors of Dλ↓Σn−2,2. Since soc(Dλ↓Σn−2)≅(D(n−k−1,k−1))⊕2, it follows (by block decomposition) that
[TABLE]
and that Dλ↓Σn−2,2≅M⊕N with M and N indecomposable with simple socle. Since D(n−k−1,k−1)⊆ei−1D(n−k−1,k), by [7, Lemma 1.2] we have that, up to exchange, M⊆ei−1D(n−k−1,k)⊗D(2) and N⊆ei−1D(n−k−1,k)⊗D(12). By the same lemma we also have that ei−1D(n−k−1,k)⊆M↓Σn−2 or N↓Σn−2. Thus
[TABLE]
or
[TABLE]
So
[TABLE]
Since k≥2, from Lemma 2.6 we also have that ei±1D(n−k−1,k−1)=0. Since D(n−k−1,k−1) appears with multiplicity larger than 1 in Dλ↓Σn−2 and all simple FΣ3-modules are 1-dimensional, it follows that Dλ↓Σn−3,3 has at least two blocks components which are non-zero and not simple. As block components of Dλ↓Σn−3,3 are self-dual, we then have that
[TABLE]
∎
Lemma 8.10**.**
Let p=3, n≥9 and λ=(n−k,k) with n−2k≥2 and k≥2. If the two removable nodes of λ are both normal and have different residues then there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3.
Proof.
From Lemma 8.9 we have that
[TABLE]
The result then holds by Lemma 8.7.
∎
Lemma 8.11**.**
Let p=3 and λ=(n−k,k) with n−2k≥2 and k≥2. If the two removable nodes of λ have the same residue then
[TABLE]
Proof.
In this case n−k≡k+2mod3 and both removable nodes are normal. It then follows that dimEndΣn−1(Dλ↓Σn−1)=2 by Lemma 2.9. Let i be the residue of the removable nodes of λ. From Lemma 2.6 and considering the structure of the corresponding partitions [ei2Dλ:D(n−k−1,k−1)]=2 and
[TABLE]
So by block decomposition Dλ↓Σn−2≅A⊕B with A and B non-zero, non-simple and self-dual. Since any simple FΣ2-module is 1-dimensional it is easy to see that a similar decomposition exists for Dλ↓Σn−2,2. The lemma then follows.∎
Lemma 8.12**.**
Let p=3 and λ=(n−k,k) with n−2k≥2 and k≥2. If the two removable nodes of λ have the same residue then there exists ψ,ψ′∈HomΣn(M2,EndF(Dλ)) such that ψ∣S2 and ψ′∣S2 are linearly independent.
Proof.
From Lemma 8.11 we have that
[TABLE]
We have that M2∼S2∣M1 by Lemmas 6.3, 6.4 and 6.5 (if n≡0mod3 then S2≅D2 by [16, Theorem 24.15]). The result then follows from Lemma 2.16.
∎
Lemma 8.13**.**
Let p=3 and λ=(n−k,k) with n−2k≥2 and k≥2. If λ is a JS-partition then
[TABLE]
Proof.
Since λ is a JS-partition we have that n−k≡k+1mod3. So by assumption n−k≥k+4. Repeated use of Lemmas 2.3, 2.6 and 2.8 give
[TABLE]
So Dλ↓Σn−2,2 is semisimple with two non-isomorphic direct summands and then dimEndΣn−2,2(Dλ↓Σn−2,2)=2. Further, comparing residues of the removed nodes, it can be checked that D(n−k−2,k−2) and D(n−k−4,k) are in the same block, but D(n−k−3,k−1) is in a distinct block. So Dλ↓Σn−4,4 has at least two non-zero block components, at least one of which is not simple. Since Dλ↓Σn−4 is self-dual, as are all simple FΣn−4,4-modules, we also have that dimEndΣn−4,4(Dλ↓Σn−4,4)≥3.
∎
Lemma 8.14**.**
Let p=3, n≡1mod3 with n≥10 and λ=(n−k,k) with n−2k≥2 and k≥2. If λ is a JS-partition then there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3 or there exists ψ′∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
From Lemma 8.13 we have that
[TABLE]
The lemma then holds by Lemmas 8.7 and 8.8.
∎
Lemma 8.15**.**
Let p=3, n≡0mod3 with n≥9 and λ=(n−k,k) with n−2k≥2 and k≥2. If λ is a JS-partition then the only normal node of λ has residue 1 and f1e1Dλ≅Dλ∣D(n−k−1,k,1)∣Dλ.
Proof.
It follows easily from Lemma 2.13 and the assumptions on n and λ that the only normal node of λ has residue 1. So from Lemmas 2.3 and 2.6
[TABLE]
Notice that f1e1Dλ≅f1De~1(λ) has simple socle and head isomorphic to Dλ from Lemmas 2.6 and 2.7.
From Lemma 6.4 we have that M1∼D0∣S1∗ and that S1∗⊆M12. So Dλ⊗S1∗⊆Dλ⊗M12. Further
[TABLE]
so that Dλ⊗S1∗≅(Dλ⊗M1)/D for some D⊆Dλ⊗M1 with D≅Dλ. Let B be the block component of Dλ⊗S1∗ corresponding to the block of Dλ. Then B≅(f1e1Dλ)/Dλ. We will now show that soc(B)≅D(n−k−1,k,1). From Lemmas 2.3 and 2.6 we have that
[TABLE]
Since B⊆Dλ⊗S1∗⊆Dλ⊗M12≅Dλ↓Σn−2↑Σn, comparing blocks we have that the socle of B is contained in the socle of
[TABLE]
From Lemma 2.7 we have that
[TABLE]
Consider now soc(f1f0Dλ). We have that f0D(n−k−2,k)≅e0D(n−k−1,k+1) by [31, Lemma 3.4]. Thus by Lemmas 2.6 and 8.1
[TABLE]
for a certain module C such that all composition factors of C are of the form D(n−k−2+3j,k+1−3j) with j≥0. Let μ∈P3(n) with Dμ⊆f1f0D(n−k−2,k). Then by Lemma 2.5
[TABLE]
By Lemma 2.6 there exists a composition factor Dν of f0D(n−k−2,k) such that e~1μ=ν and then, by Lemma 2.10, μ=f~1ν. Thus μ=λ or μ=(n−k−2+3j,k+2−3j) for some j≥0. In the second case e1Dμ≅D(n−k−2+3j,k+1−3j), contradicting dimHomΣn−1(e1Dμ,f0D(n−k−2,k))≥1 by Lemma 2.7. Thus μ=λ.
In particular the only simple modules appearing in the socle of
[TABLE]
are Dλ and D(n−k−1,k,1). From Lemma 2.8 we have that B has exactly one composition factor of the form Dλ, one composition factor of the form D(n−k−1,k,1) and possibly other composition factors. So, in view of Lemma 2.7, soc(B)≅D(n−k−1,k,1) and then
[TABLE]
for a certain module E. Since f1e1Dλ and B both have simple socle and f1e1Dλ is self-dual (by Lemma 2.4), the lemma follows.∎
Lemma 8.16**.**
Let p=3, n≡0mod3 with n≥6 and λ=(n−k,k) with n−2k≥2 and k≥2. If λ is a JS-partition then
[TABLE]
Proof.
Let μ:=(n−k−1,k,1). Since μ is 3-regular, so that Dμ is the head of Sμ we have that Sμ∼rad(Sμ)∣Dμ. So there exists an exact sequence
[TABLE]
From [18] we have that [Sμ:Dλ]=1, and then dimHomΣn(rad(Sμ),Dλ)≤1. It is then enough to prove that dimExtΣn1(Sμ,Dλ)=0.
Notice that by assumption n−k≡2mod3, k≡1mod3 and n−2k≥4. In particular λ has no normal node of residue 0, so e0Dλ=0 by Lemma 2.6. Further
[TABLE]
by [16, Corollary 17.14]. Since (n−k−2,k,12) and (n−k−2,k+1,1) are 3-regular, we have that dimHomΣn(A,Dλ)=0. Thus there exists an exact sequence
[TABLE]
From e0Dλ=0 and [26, Lemma 1.4] it then follows that
[TABLE]
∎
Lemma 8.17**.**
Let p=3, n≡0mod3 with n≥9 and λ=(n−k,k) with n−2k≥2 and k≥2. If λ is a JS-partition then there exists ψ∈HomΣn(M3,EndF(Dλ)) which does not vanish on S3 or there exists ψ′∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4.
Proof.
In view of Lemma 8.7 we may assume that
[TABLE]
Thus by Lemma 8.13
[TABLE]
By Lemma 6.4 we have that M1∼D0∣S1∗ and that M4∼S4∣S1∣A for a certain submodule A⊆M3 with M3/A≅S1. In view of Lemma 2.16 it is then enough to prove that
[TABLE]
Since λ is JS we have by Lemma 8.5 that
[TABLE]
From Lemmas 2.3 and 8.15 we have that Dλ⊗M1≅Dλ↓Σn−1↑Σn≅B⊕C where B≅Dλ∣D(n−k−1,k,1)∣Dλ is the block component of Dλ⊗M1 of the block containing Dλ and C is the sum of the other block components. It follows from M1∼D0∣S1∗ that Dλ⊗S1∗≅(B/Dλ)⊕C. Thus there exists M⊆Dλ⊗M3 with N⊆M≅(B/Dλ)⊕C such that N≅B/Dλ and (Dλ⊗M3)/M≅Dλ⊗A∗. Considering block decomposition we then have that
[TABLE]
Since h(λ)=2<3=p we have from Lemma 8.16 and [26, Theorem 2.10] that
[TABLE]
Since N≅D(n−k−1,k,1)∣Dλ it follows that
[TABLE]
So the lemma holds.
∎
9. Splitting JS partitions
Splitting modules indexed by JS partitions also play a special role in the proof of Theorem 1.1, so they and the corresponding partitions will be studied more in details in this section.
Lemma 9.1**.**
Let p=2. If λ∈P2A(n) is a JS-partition then the parts of λ are odd. Further n≡h(λ)2mod4.
Proof.
Since λ is a JS-partition all parts have the same parity by Lemma 2.14. It then easily follows that all parts are odd by Lemma 2.1. Let k be maximal with 2k≤h(λ). For 1≤i≤k we have by Lemma 2.1 that λ2i−1−λ2i=2 and so λ2i−1+λ2i≡0mod4 and further if h(λ) is odd then λh(λ)=1. So n≡h(λ)2mod4.
∎
Lemma 9.2**.**
Let p=2 and n≥6 be even. Let λ∈P2A(n) be a JS-partition with λ=βn. Then n≡0mod4 and D2⊆EndF(Dλ). Further D2↓An⊆EndF(E±λ) or S3∗↓An⊆EndF(E±λ).
Proof.
From Lemma 9.1 we have that n≡0mod4. From [31, Lemma 7.5] we then have that D2⊆EndF(Dλ).
From Lemma 6.1 we have that M3≅M1⊕A, where
[TABLE]
From Lemma 2.15 we have that A≅Y3 is self-dual, so we also have
[TABLE]
By Lemma 5.3 it then easily follows that dimHomAn(A,EndF(E±λ))≥1.
From Lemma 8.3, by Frobenious reciprocity and since D1≅hdS1,
[TABLE]
The lemma then follows.
∎
Lemma 9.3**.**
[32, Lemma 8.1]**
Let p≥3 and λ∈P3A(n) be a JS-partition. Then n≡h(λ)2modp.
10. Spilt-non-split case
In this section we study irreducible tensor products of the form E±λ⊗Eμ. We will use E±λ to refer to E+λ or E−λ, and E∓λ to the other.
For p≥3 the following lemma holds by [7, Lemma 3.1].
Lemma 10.1**.**
Let λ∈PpA(n) and μ∈Pp(n)∖PpA(n). If E±λ⊗Eμ is irreducible then
[TABLE]
Proof.
Notice that, by Frobenious reciprocity,
[TABLE]
The lemma then follows, since E+λ⊗Eμ and E−λ⊗Eμ have the same dimension.
∎
Theorem 10.2**.**
Let p=2, λ∈P2A(n) and μ∈P2(n)∖P2A(n). If E±λ and Eμ are not 1-dimensional and E±λ⊗Eμ is irreducible, then λ or μ is equal to (n−1,1) or βn.
Proof.
For n≤9 the theorem holds by comparing dimensions using [16, Tables]. So we may assume that n≥10 and λ,μ∈{(n),(n−1,1),βn}. By Lemma 2.1 we then have that h(λ)≥3. Note that there always exist ψ0,λ∈HomΣn(M0,EndF(Dλ)) and ψ0,μ∈HomΣn(M0,EndF(Dμ)) which do not vanish on S0. Further for 2≤k≤3, from Lemmas 5.1 and 5.2 there exist ψk,λ∈HomΣn(Mk,EndF(Dλ)) which do not vanish on Sk. Similarly there exists ψ2,μ∈HomΣn(M2,EndF(Dμ)) which does not vanish on S2.
Assume first that h(μ)≥3. Then there similarly also exists ψ3,μ∈HomΣn(M3,EndF(Dμ)) which does not vanish on S3. So by Lemma 2.17
[TABLE]
contradicting E±λ⊗Eμ being irreducible by Lemma 10.1.
So we may now assume that μ=(n−k,k) with n−2k≥3 and k≥2. Consider first n odd. Then by Lemma 8.2 there exist ψ2,μ,ψ2,μ′∈HomΣn(M2,EndF(Dμ)) with ψ2,μ∣S2,ψ2,μ′∣S2 linearly independent or there exists ψ3,μ∈HomΣn(M3,EndF(Dμ)) which does not vanish on S3. In either case by Lemmas 2.17
[TABLE]
again leading to a contradiction by Lemma 10.1.
If n is even and λ has at least two normal nodes we can similarly conclude by Lemma 5.1 applied μ and Lemma 7.1 or 7.2 applied to λ.
So assume now that n is even and λ is JS. Then h(λ)≥4 by Lemma 9.1. So by Lemma 5.4 there exists ψ4,λ∈HomΣn(M4,EndF(Dλ)) which does not vanish on S4. In view of Lemma 5.1 (and arguing as above), we may then assume that there does not exist any ψ4,μ∈HomΣn(M4,EndF(Dμ)) which does not vanish on S4. So by Lemma 8.4 we may assume that A⊆EndF(Dμ)=EndF(Eμ) with A∈{D22,S3,D2⊕D3}. By Lemma 9.2 we have that D2⊆EndF(Dλ). Since D0⊆EndF(Dλ),EndF(Dμ), we may thus assume that A∈{S3,D2⊕D3}. From Lemma 9.2 we also have that there exists B⊆EndF(E±λ) with B∈{D2↓An,S3∗↓An}. Further from Lemma 6.1, D2⊆S3. It then follows that
[TABLE]
which also contradicts E±λ⊗Eμ being irreducible.
∎
Theorem 10.3**.**
If p=2, n≥3 and λ∈PpA(n) then E±λ⊗E(n−1,1) is irreducible if and only if n is odd and λ is a JS-partition, in which case E±λ⊗E(n−1,1)≅Eν, where ν is obtained from λ by removing the top removable node and adding the second bottom addable node.
Proof.
If E±λ⊗E(n−1,1) is irreducible then Dλ is not a composition factor of Dλ⊗D1 (since E(n−1,1) is not 1-dimensional). In particular, using Lemmas 6.1 and 6.2,
[TABLE]
From [25, Lemma 3.5], Lemma 2.3 and block decomposition,
[TABLE]
Assume first that n is even. Then λ has at most two normal nodes. If λ has exactly two normal nodes then we have from [31, Lemma 6.2] that [Dλ⊗M1:Dλ]>2 (notice that φ0(λ)+φ1(λ)=3 by Lemma 2.11). If λ is a JS-partition then the only normal node is the top removable node and the only conormal nodes are the two bottom addable nodes. From Lemma 9.1 all these nodes have residue 0, thus [Dλ⊗M1:Dλ]=3.
So we may now assume that n is odd, in which case it easily follows from [Dλ⊗M1:Dλ]=1 that λ is a JS-partition. In this case by Lemma 9.1 the normal node has residue 0 and the two conormal nodes both have residue 1. Let A be the top removable node of λ, B be the second bottom addable node of λ and C be the bottom addable node of λ. Then A is the normal node of λ and B and C are the conormal nodes of λ. From Lemmas 2.1 and 9.1 (or Lemma 2.14) we easily have that h(λ)≥3. In particular B and C are the two bottom addable nodes of e~0(λ)=λ∖A. So B and C are conormal in e~0(λ). From Lemma 2.10 we have that A is also conormal in e~0(λ). Since λ is a JS-partition it is easy to check that the normal nodes of e~0(λ) are exactly the two top removable nodes. From Lemma 2.11 it follows that A, B and C are the only conormal nodes of e~0(λ). So, from Lemmas 2.3 and 2.7,
[TABLE]
From Lemma 6.2 it then follows that
[TABLE]
Notice that λ has an odd number of parts, all of which are odd. Since Dλ↓An splits, it follows from Lemma 2.1 that λh(λ)=1 and then that D(λ∖A)∪B↓An does not split (the corresponding partition has an odd number of parts and the last part is 2). Since soc(Dλ⊗D1)≅D(λ∖A)∪B it follows that
[TABLE]
for some k≥2. So
[TABLE]
Since E(λ∖A)∪B↑Σn≅D(λ∖A)∪B∣D(λ∖A)∪B and the socle of Dλ⊗D1 is simple, we have that E(λ∖A)∪B↑Σn⊆Dλ⊗D1 and then that Dλ⊗D1≅D(λ∖A)∪B∣D(λ∖A)∪B, from which the theorem follows.
∎
Theorem 10.4**.**
Let p=3, λ∈P3A(n) and μ∈P3(n)∖P3A(n). If E±λ and Eμ are not 1-dimensional then E±λ⊗Eμ is irreducible if and only if μ∈{(n−1,1),(n−1,1)M}, λ is a JS-partition and n≡0mod3. In this case E±λ⊗E(n−1,1)≅Eν, where ν is obtained from λ by removing the top removable node and adding the bottom addable node.
Proof.
If μ∈{(n−1,1),(n−1,1)M} the theorem holds by [7, Theorem 3.3] and Lemma 9.3. So we may now assume that μ∈{(n),(n)M,(n−1,1),(n−1,1)M}. For n≤9 the theorem can be checked separately, using [16, Tables]. So we may also assume that n≥10. By [3, Lemma 2.2], and checking small cases separately, it then follows that α>αM for α∈{(n),(n−2,2),(n−3,3),(n−4,22)}.
From [32, Theorem 9.2] we may assume that λ is a JS-partition. From Lemma 2.2 we have that h(λ)≥3. Assume first that h(μ),h(μM)≥3. Then for k=0 and k=3 (the second case by Lemmas 5.6 and 5.9) there exist ψk,λ∈HomAn(Mk,EndF(E±λ)) and ψk,μ∈HomAn(Mk,EndF(Eμ)) which do not vanish on Sk. By Lemma 2.17,
[TABLE]
contradicting E±λ⊗Eμ being irreducible.
So, up to exchange of μ and μM, we may assume that μ=(n−k,k) with k≥2 and n−2k≥2. If the removable nodes of μ have distinct residues then apply Lemmas 5.5 and 5.6 to λ and Lemmas 5.5 and 8.10 to μ. If the removable nodes of μ have the same residue apply Lemma 5.5 to λ and Lemma 8.12 to μ. Similarly to the above case we then have by Lemma 2.17 that in either case
[TABLE]
again contradicting E±λ⊗Eμ being irreducible, due to Lemma 10.1.
So we may assume that μ is also a JS-partition. From Lemma 9.3 we have that n≡h(λ)2≡0\mboxor1mod3. If n≡1mod3, then h(λ)≥4 by Lemmas 2.2 and 9.3. In this case apply Lemmas 5.5, 5.6 and 5.7 to λ and Lemmas 5.5 and 8.14 to μ. If n≡0mod3 and h(λ)>3 apply Lemmas 5.5, 5.6 and 5.7 to λ and Lemmas 5.5 and 8.17 to μ. If n≡0mod3 and h(λ)=3 then apply Lemmas 5.5 and 5.10 to λ and Lemmas 5.5 and 5.8 to μ. In each of these cases we then again contradict E±λ⊗Eμ being irreducible by Lemmas 2.17 and 10.1.
∎
11. Double split case
In this section we study irreducible tensor products of the form E±λ⊗E±μ.
Theorem 11.1**.**
Let p=2. If λ,μ∈P2A(n) and E±λ⊗E±μ is irreducible, then n≡2mod4 and λ=βn or μ=βn.
Proof.
For n≤8 the theorem can be checked separately. So we may assume n≥9. By Lemma 2.1 we then have that (n−3,3)∈P2(n)∖P2A(n) and that if λ,μ=βn then h(λ),h(μ)≥3. In this case by Lemmas 2.17 and 5.3
[TABLE]
(similar to the proofs of Theorems 10.2 and 10.4), contradicting E±λ⊗E±μ being irreducible.
So λ=βn or μ=βn, and then n≡2mod4 by Lemma 2.1.
∎
Theorem 11.2**.**
Let p=3 and λ,μ∈P3A(n) and assume that E±λ and E±μ are not 1-dimensional. Then E±λ⊗E±μ is irreducible if and only if, up to exchange, E±λ=E+(4,1,1) and E±μ=E−(4,1,1). Further E+(4,1,1)⊗E−(4,1,1)≅E(4,2).
Proof.
For n≤8 it can be proved using [16, Tables] that if E±λ⊗E±μ is irreducible then n=6 and λ,μ=(4,1,1), in which case the theorem can be checked using [19]. So we may now assume that n≥9. Then (n−3,3)>(n−3,3)M by [3, Lemma 2.2] and so by Lemmas 2.17 and 5.9,
[TABLE]
In particular E±λ⊗E±μ is not irreducible.
∎
12. Proof of Theorem 1.1
We will now prove our main result. We will consider the cases p=2 and p≥3 separately.
Case 1: p=2.
If λ,μ∈P2(n)∖P2A(n) and Eλ⊗Eμ is irreducible as FAn-module, then Dλ⊗Dμ is irreducible as FΣn-module. If Eλ and Eμ are not 1-dimensional then by [6, Main Theorem] and [31, Theorems 1.1 and 1.2] we have that n≡2mod4 and Dλ⊗Dμ≅Dν with ν=(n/2−j,n/2−j−1,j+1,j) with 0≤j≤(n−6)/4. By Lemma 2.1 it follows that ν∈P2A(n), contradicting Eλ⊗Eμ being irreducible. If λ∈P2A(n) and μ∈P2(n)∖P2A(n) the theorem holds by Theorems 10.2 and 10.3. If λ,μ∈P2A(n) the theorem holds by Theorem 11.1.
Case 2: p≥3.
Note that from Lemma 9.3 if λ∈PpA(n) is JS, then n≡h(λ)2modp. In particular in this case n≡0modp if and only if h(λ)≡0modp. Assume that λ∈PpA(n) is JS and that n≡0modp. Let A be the top removable node of λ and B and C be the two bottom addable nodes of λ. Then A is the only normal node of λ and B and C are the only conormal nodes of λ. Since h(λ)≡0modp, the bottom addable node of λ has residue different from 0. In view of Lemma 2.12 we then have that res(A)=0 and that res(B)=i=−res(C) for some residue i=0. By [7, Lemma 2.9] we further have that A,B,C are the only conormal nodes of λ∖A. Comparing residues we have that (λ∖A)M=λ∖A and that ((λ∖A)∪B)M=(λ∖A)∪C by Lemma 2.12. So (λ∖A)∪B,(λ∖A)∪C∈Pp(n)∖PpA(n) and E(λ∖A)∪B≅E(λ∖A)∪C. For p≥5 the theorem then holds by [7, Main Theorem] and [32, Theorem 1.1]. So assume now that p=3. If λ,μ∈P3(n)∖P3A(n) and Eλ and Eμ are not 1-dimensional, then Eλ⊗Eμ is not irreducible by [6, Main Theorem]. If λ∈P3A(n) and μ∈P3(n)∖P3A(n) the theorem holds by Theorem 10.4 and the above observation. If λ,μ∈P3A(n) the theorem holds by Theorem 11.2.
13. Tensor products with basic spin
In this section we give some restrictions on tensor products with basic spin module in characteristic 2 which might be irreducible.
Lemma 13.1**.**
Let p=2 and λ,ν∈P2(n). If [Dλ⊗Dβn:Dν]=2ib with b odd then h(ν)≤4i+2 if n is odd or h(ν)≤4i+4 if n is even. Further if Dν⊆Dλ⊗Dβn then h(λ)≤2h(ν).
Proof.
For γ∈P(n) let ξγ be the Brauer character of Mγ. For ψ∈P2(n) let φψ be the Brauer character of Dψ. If α∈P(n) is the cycle partition of a 2-regular conjugacy class and φ is any Brauer character of Σn, let φα be the value that φ takes on the conjugacy class indexed by α.
Let c:=2i+1 if n is odd or c:=2i+2 if n is even. Let α∈P(n) correspond to a 2-regular conjugacy class of Σn. We have that φαβn=±2⌊(h(α)−1)/2⌋ by [34, VII, p.203]. In particular if φαβn is not divisible by 2i+1 then h(α)≤c (note that h(α)≡nmod2 since α is the cycle partition of a 2-regular conjugacy class).
For γ∈P(n) and 1≤j≤n let aj=aj(γ) be the number of parts of γ equal to j. Further let A=A(γ):=a1!⋯an! and A=A(γ) be the largest power of 2 dividing A. Since Mλ=1↑Σλ×jΣj≀Σaj↑Σn we have that A∣ξαγ for each α∈P(n) corresponding to a 2-regular conjugacy class. Since irreducible Brauer characters are linearly independent modulo 2 (see for example [15, Theorem 15.5]), we then have that ξγ=Aξγ with ξγ a Brauer character. Further, whenever they are defined, ξγγ=A (and so ξγγ is odd) and ξψγ=0 if h(ψ)≤h(γ) and ψ=γ. In particular there exists bγ∈N such that if
[TABLE]
then φα is divisible by 2i+1 for each α∈P(n) corresponding to a 2-regular conjugacy class (start by choosing b(n) so that this holds for α=(n), if n is odd, then consider bα for partitions α with two parts and so on).
Again since irreducible Brauer characters are linearly independent modulo 2, it follows that φ=2i+1φ for some Brauer character φ. If m is the multiplicity of φν in φ then
[TABLE]
Since b is odd and m∈N, there then exists γ∈P(n) with h(γ)≤c such that
[TABLE]
Note that Sβn⊗Mγ≅Sβn↓Σγ↑Σn. In view of the Littlewood-Richardson rule, in characteristic 0, any composition factor of Sβn↓Σγ is of the form Sα1⊗…⊗Sαh(γ) with αj∈P(γj) such that h(αj)≤h(βn)=2 and then any composition factor of Sβn⊗Mγ is of the form Sα with h(α)≤h(γ)h(βn)≤2c. Considering reduction modulo 2 we then have that any composition factor of Sβn⊗Mγ, and so in particular also any composition factor of Dβn⊗Mγ, is of the form Dζ, where ζ∈P2(n) has at most 2c parts. It follows that h(ν)≤2c.
Assume now that Dν⊆Dλ⊗Dβn. Since
[TABLE]
it follows that
[TABLE]
So, similarly to the above, h(λ)≤h(βn)h(ν)=2h(ν).
∎
Theorem 13.2**.**
Let p=2, λ∈P2(n) and assume that Dλ and Dβn are not 1-dimensional and that exactly one of them splits when restricted to An. Then E±βn⊗Eλ or E±λ⊗Eβn is irreducible if and only if Dλ⊗Dβn∼Dν∣Dν with ν∈P2(n)∖P2A(n). In this case h(ν)≤6 if n is odd, h(ν)≤8 if n is even and h(λ)≤2h(ν). Further λ has at most 2 normal nodes if n is odd or at most 3 normal nodes if n is even.
Proof.
From [6, Main Theorem] and [31, Theorems 1.1 and 1.2] if Dλ⊗Dβn is simple as FΣn-module, then n≡2mod4 and h(λ)=h(βn)=2. So from Lemma 2.1 neither Dλ nor Dβn splits in this case. Thus we may assume that Dλ⊗Dβn is not simple as FΣn-module. Let {α,γ}={λ,βn} such that α∈P2A(n) and γ∈P2A(n). Then E+α⊗Eγ≅(E−α⊗Eγ)σ with σ∈Σn∖An. In particular E+α⊗Eγ is irreducible if and only if E−α⊗Eγ is irreducible. So, since Dλ⊗Dβn is not simple as FΣn-module, E±α⊗Eγ is irreducible if and only if Dλ⊗Dβn∼Dν∣Dν with ν∈P2(n)∖P2A(n). In this case h(ν)≤6 if n is odd, h(ν)≤8 if n is even and h(λ)≤2h(ν) by Lemma 13.1.
If n is odd then M1≅D0⊕D1 by Lemma 6.2. Since βn is not a JS-partition in this case, we have that D1⊆EndF(Dβn) by Lemma 2.9. If λ has at least 3 normal nodes then D1⊕2⊆EndF(Dλ) from Lemma 2.9.
If n is even then M1≅D0∣D1∣D0∼D0∣S1∗ by Lemma 6.1 and self-duality of M1. From Lemma 8.3 we also have that D1 or S1 is contained in EndF(Dβn). If λ has at least 4 normal nodes we have from Lemma 2.9 that
[TABLE]
Since S1∗≅D1∣D0 and dimHomΣn(D0,EndF(Dλ))=1, we then have that (S1∗)⊕2⊆EndF(Dλ).
From D0⊆EndF(Dβn),EndF(Dλ), it follows that in either case
[TABLE]
and so E±α⊗Eγ is not irreducible by Lemma 10.1.
∎
Theorem 13.3**.**
Let p=2, n≡2mod4, λ∈P2A(n) and ε,δ,ε′,δ′∈{±}. If E±λ and E±βn are not 1-dimensional and Eελ⊗Eδβn is irreducible then one of the following holds:
Dλ⊗Dβn∼Dν∣Dν∣Dν∣Dν* with ν∈P2(n)∖P2A(n). In this case Eε′λ⊗Eδ′μ≅Eν is irreducible and h(ν)≤10 if n is odd or h(ν)≤12 if n is even.*
Dλ⊗Dβn∼Dν∣Dν* with ν∈P2A(n). In this case Eε′λ⊗Eδ′μ∈{E+ν,E−λ} is irreducible and h(ν)≤6 if n is odd or h(ν)≤8 if n is even.*
[Dλ⊗Dβn:Dν]=2* with ν∈P2(n)∖P2A(n) and Eελ⊗Eδβn≅E−ελ⊗E−δβn≅Eν, while E−ελ⊗Eδβn≅Eν≅Eελ⊗E−δβn. Further h(ν)≤6 if n is odd or h(ν)≤8 if n is even.*
n≡0mod4, [Dλ⊗Dβn:Dν]=1 with ν∈P2A(n), {Eελ⊗Eδβn,E−ελ⊗E−δβn}={E+ν,E−ν}, while E−ελ⊗Eδβn,Eελ⊗E−δβn∈{E+ν,E−ν}. Further h(ν)≤4.
In each of the above cases h(λ)≤2h(ν). Further λ has at most 3 normal nodes if n is odd or at most 4 normal nodes if n is even.
Proof.
Note that if σ∈Σn∖An then Eε′λ⊗Eδ′βn≅(E−ε′λ⊗E−δ′βn)σ.
In particular if Eελ⊗Eδβn≅Eν then E−ελ⊗E−δβn≅Eν and either both or neither of Eελ⊗E−δβn and E−ελ⊗Eδβn is isomorphic to Eν. Similarly if Eελ⊗Eδβn≅E±ν then E−ελ⊗E−δβn≅E∓ν and {Eελ⊗E−δβn,E−ελ⊗Eδβn} is either equal to or disjoint from {E+ν,E−ν}.
So we are in one of the following cases:
- (i)
Dλ⊗Dβn∼Dν∣Dν∣Dν∣Dν with ν∈P2(n)∖P2A(n) and Eε′λ⊗Eδ′μ≅Eν.
2. (ii)
Dλ⊗Dβn∼Dν∣Dν with ν∈P2A(n) and Eε′λ⊗Eδ′μ∈{E+ν,E−λ}.
3. (iii)
[Dλ⊗Dβn:Dν]=2 with ν∈P2(n)∖P2A(n) and Eελ⊗Eδβn≅E−ελ⊗E−δβn≅Eν, while E−ελ⊗Eδβn≅Eν≅Eελ⊗E−δβn.
4. (iv)
[Dλ⊗Dβn:Dν]=1 with ν∈P2A(n), {Eελ⊗Eδβn,E−ελ⊗E−δβn}={E+ν,E−ν}, while E−ελ⊗Eδβn,Eελ⊗E−δβn∈{E+ν,E−ν}.
If [Dλ⊗Dβn:Dν]=2i then, from Lemma 13.1, h(λ)≤2h(ν) and that h(ν)≤4i+2 if n is odd or h(ν)≤4i+4 if n is even (note that we always have Dν⊆Dλ⊗Dβn, since E(±)ν≅Eελ⊗Eδβn⊆(Dλ⊗Dβn)↓An). In case (iv) if n is odd then h(ν)≤2 and so ν=βn by Lemma 2.1, contradicting E±λ not being 1-dimensional.
This proves the theorem, up to the bound on the number of normal nodes of λ. Notice that if n is odd then M1≅D0⊕D1, while if n is even then M1≅D0∣D1∣D0 by Lemma 6.1. If n is odd then D1⊆EndF(Dβn) since in this case βn is not a JS-partition. If n is even then n≡0mod4 by Lemma 2.1 and so D1⊆EndF(Dβn) from Lemma 8.3. If λ has at least 4 normal nodes if n is odd or at least 5 normal nodes if n is even then D1⊕3⊆EndF(Dλ). It then follows that there exist ε′′,δ′′∈{±} such that
[TABLE]
and so Eελ⊗Eδβn is not irreducible by [7, Lemma 3.4].
∎
14. Acknowledgements
The author thank Alexander Kleshchev for some comments and pointing out some references. The author also thanks the referee for comments.
The author was supported by the DFG grant MO 3377/1-1.