Irreducible tensor products for symmetric groups in characteristic 2
Lucia Morotti
Institut für Algebra, Zahlentheorie und Diskrete Mathematik
Leibniz Universität Hannover
Welfengarten 1
30167 Hannover
Germany
[email protected]
Abstract
We consider non-trivial irreducible tensor products of modular representations of a symmetric group Σn in characteristic 2 for even n completing the proof of a classification conjecture of Gow and Kleshchev about such products.
Mathematics Subject Classification: 20C30, 20C20.
1 Introduction
Let D1 and D2 be irreducible representations of Σn of dimension greater than 1. We would like to know when the tensor product D1⊗D2 is irreducible. We say that D1⊗D2 is a non-trivial irreducible tensor product if D1⊗D2 is irreducible and neither D1 nor D2 has dimension 1. In [23] Zisser proved that there are no non-trivial irreducible tensor products of ordinary representations of symmetric group. In [10] Gow and Kleshchev conjectured that the same holds also for modular representations, unless p=2 and n=2m with m odd. In this case they also conjectured which tensor products are irreducible. In [9] Graham and James proved that the tensor products appearing in the conjecture of Gow and Kleshchev are irreducible. Further in [8] Bessenrodt and Kleshchev proved that non-trivial irreducible tensor products are only possible when p=2, n is even and one of the modules is indexed by a JS-partition.
In this paper we will prove the following two theorems which will prove the conjecture from [10] for p=2 and n=2m even in the cases m odd and m even respectively.
Theorem 1.1**.**
If p=2 and n=2m with m odd then the only irreducible tensor products of 2 representations of Σn of dimension greater than 1 are those of the form
[TABLE]
with 0≤j<(m−1)/2.
Theorem 1.2**.**
Let p=2 and n=2m with m even. If D1 and D2 are irreducible representations of Σn of dimension greater than 1 then D1⊗D2 is not irreducible.
Together with the results from [8] and [9], Theorems 1.1 and 1.2 prove the conjecture which Gow and Kleshchev made in [10].
The classification of non-trivial irreducible tensor products is relevant to the description of maximal subgroups in finite groups of Lie type, see [1] and [2]. For alternating groups, non-trivial irreducible tensor products have been classified in most characteristics in [5] and [6]. Differently than for symmetric groups, there exist non-trivial irreducible tensor products in arbitrary characteristic. For covering groups of symmetric and alternating groups a partial classification of non-trivial irreducible tensor products can be found in [4], [7] and [18]. When considering groups of Lie type in defining characteristic, non-trivial irreducible tensor products are not unusual, due to Steinberg tensor product theorem. In not defining characteristic however it has been proved that in almost all cases non non-trivial irreducible tensor products exist, see [19] and [20].
In Sections 3 to 7 we will prove preliminary lemmas on the structure of the endomorphism rings of restrictions of the modules Dλ and on the structure of certain permutation modules. Some of these results are of independent interest. Using these lemmas we will then prove Theorems 1.1 and 1.2 in Section 8.
2 Notations and basic results
Let F be an algebraically closed field of characteristic p. In most of the paper we will assume that p=2. Some of the results in Sections 3 and 4 however hold for arbitrary primes.
For a partition λ⊢n let Sλ be the corresponding Specht module. If λ is a p-regular partition (that is a partition where no part is repeated p or more times) we define Dλ to be the irreducible FΣn-module indexed by λ. Further for a composition α=(α1,α2,…)⊢n let Σα≅Σα1×Σα2×… be the Young subgroup corresponding to α and define Mα:=1↑ΣαΣn to be the permutation module induced from Σα. The modules Dλ and Mα are known to be self-dual. From their definition we have that D(n)≅S(n)≅M(n)≅1Σn. For more informations on such modules see [11] and [12]. For any partition λ let h(λ) be the number of parts of λ.
Let M be a FΣn-module corresponding to a unique block B with content (b0,…,bp−1) (see [14]). For 0≤i≤p−1, we can define eiM as the restriction of M↓Σn−1 to the block with content (b0,…,bi−1,bi−1,bi+1,…,bp−1). Similarly, for 0≤i≤p−1, we can define fiM as the restriction of M↑Σn+1 to the block with content (b0,…,bi−1,bi+1,bi+1,…,bp−1). We can then extend the definition of eiM and fiM to arbitrary FΣn-modules additively. The following result holds by Theorems 11.2.7 and 11.2.8 of [14].
Lemma 2.1**.**
For M a FΣn-module we have that
[TABLE]
For r≥1 let ei(r):FΣn\mbox−mod→FΣn−r\mbox−mod and fi(r):FΣn\mbox−mod→FΣn+r\mbox−mod denote the divided power functors (see Section 11.2 of [14] for the definitions). For r=0 define ei(0)Dλ and fi(0)Dλ to be equal to Dλ. The modules eirDλ and ei(r)Dλ (and similarly firDλ and fi(r)Dλ) are quite closely connected as we will see in the next two lemmas. The following notation will be used in the lemmas. For a partition λ and 0≤i≤1 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 Section 11.1 of [14] or Section 2 of [5] for two different but equivalent definitions of normal and conormal nodes). Normal and conormal nodes of partitions will play a crucial role throughout the paper.
Lemma 2.2**.**
Let λ⊢n be a p-regular partition. Also let 0≤i≤p−1 and r≥0. Then eirDλ≅(ei(r)Dλ)⊕r!. Further ei(r)Dλ=0 if and only if εi(λ)≥r. In this case, if ν is obtained by λ by removing the r bottom i-normal nodes, then
- (i)
ei(r)Dλ* is a self-dual indecomposable module with head and socle isomorphic to Dν,*
2. (ii)
[ei(r)Dλ:Dν]=(rεi(λ))=dimEndΣn−1(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 ψ=ν.
Lemma 2.3**.**
Let λ⊢n be a p-regular partition. Also let 0≤i≤p−1 and r≥0. Then firDλ≅(fi(r)Dλ)⊕r!. Further fi(r)Dλ=0 if and only if φi(λ)≥r. In this case, if π is obtained by λ by adding the r top i-conormal nodes, then
- (i)
fi(r)Dλ* is a self-dual indecomposable module with head and socle isomorphic to Dπ,*
2. (ii)
[fi(r)Dλ:Dπ]=(rφi(λ))=dimEndΣn+1(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 ψ=π.
For proofs see Theorems 11.2.10 and 11.2.11 of [14] (the case r=0 holds trivially).
In particular, for r=1, we have that ei=ei(1) and fi=fi(1). In this case there are other compositions factors of eiDλ and fiDλ which are known (see Remark 11.2.9 of [14]).
Lemma 2.4**.**
Let λ be a p-regular partition. If α is p-regular and is obtained from λ by removing a normal node of residue i then Dα is a composition factor of eiDλ.
Similarly if β is p-regular and is obtained from λ by adding a conormal node of residue i then Dβ is a composition factor of fiDλ.
The following properties of ei and fi are just a special cases of Lemma 8.2.2(ii) and Theorem 8.3.2(i) of [14].
Lemma 2.5**.**
If M is self dual then so are eiM and fi(M).
Lemma 2.6**.**
The functors ei and fi are left and right adjoint of each others.
Using notations from Lemma 2.2 define e~irDλ:=Dν if εi(λ)≥r, otherwise define e~irDλ:=0. Similarly, with notations from Lemma 2.3, define f~irDλ:=Dπ if φi(λ)≥r, otherwise define f~irDλ:=0. The first part of the next lemma follows from Lemma 5.2.3 of [14]. The second part follows by the definition of e~ir and f~ir and from Lemmas 2.2(iii) and 2.3(iii).
Lemma 2.7**.**
For r≥0 and p-regular partitions λ,ν we have that e~ir(Dλ)=Dν if and only if Dλ=f~ir(Dν). Further in this case εi(ν)=εi(λ)−r and φi(ν)=φi(λ)+r.
In particular, if εi(λ)≥r and notation is as above, then φi(ν)≥r and the r bottom normal i-nodes of λ are the r top conormal i-nodes of ν. Similarly, if φi(λ)≥r, then εi(π)≥r and the r top conormal i-nodes of λ are the r bottom normal i-nodes of π.
When considering the number of normal and conormal nodes of a partition we have the following result (which for p-regular partitions follows from Lemmas 2.1, 2.2, 2.3 and Corollary 4.2 of [13]):
Lemma 2.8**.**
Any partition has 1 more conormal node than it has normal nodes.
Proof.
For each residue i the reduced i-signature is obtained from the i-signature by recursively removing pairs corresponding to an addable and a removable node. The lemma then follows from the definition of normal and conormal nodes, as any partition has 1 more addable node than it has removable nodes.
∎
From Lemmas 2.1, 2.2 and 2.3 and as the modules eiDλ (or the modules fiDλ) correspond to pairwise distinct blocks, we have the following result.
Lemma 2.9**.**
For a p-regular partition λ⊢n we have that
[TABLE]
and
[TABLE]
A p-regular partition λ⊢n for which Dλ↓Σn−1 is irreducible is called a JS-partition. When p=2, such partitions are easily classified, as can be seen in the next lemma, which follows from Theorem D of [15], Lemma 2.9 and from Dλ↓Σn−1 being self-dual.
Lemma 2.10**.**
For p=2 and λ a 2-regular partition the following are equivalent:
- (i)
λ* is a JS-partition,*
2. (ii)
the parts of λ are all congruent modulo 2,
3. (iii)
λ* has only one normal node.*
As we will also consider restrictions of Σn-modules to Σ(n−2,2) we define some notation for the restriction of modules to certain blocks of Σ(n−2,2). For M an Σn\mbox−mod corresponding to the block with content (b0,…,bp−1) we define ei2M as the restriction of M↓Σn−2,2 to the block with content (b0,…,bi−1,bi−2,bi+1,…,bp−1) for the Σn−2 factor of Σn−2,2. Notice that from the definition (ei2M)↓Σn−2=ei2M.
For arbitrary modules M1,…,Mh we will write M∼M1∣…∣Mh if M has a filtration with factors M1,…,Mh counted from the bottom. For irreducible modules D1,…,Dh we will write M=D1∣…∣Dh if M is a uniserial module with composition factors D1,…,Dh counted from the bottom. For irreducible modules D1,D2,D3 we will also write M=(D1⊕D2)∣D3 for a module M with socle D1⊕D2 and head D3 and no other composition factor. Similarly we will write M=D1∣(D2⊕D3) for a module with socle D1 and head D2⊕D3 and no other composition factor.
Let M∼D1∣…∣Dh with Di irreducible. When writing
[TABLE]
edges will correspond to uniserial subquotients. For example uniserial modules can be written as
[TABLE]
and modules of the form (D1⊕D2)∣D3 or D1∣(D2⊕D3) can be written as
[TABLE]
Information on socle, head and direct summands can be obtained from the diagrams, for example if
[TABLE]
then soc(M)=D1⊕D2 and hd(M)=D4⊕D5⊕D6.
3 Modules structure
Before being able to prove Theorems 1.1 and 1.2 we need some lemmas. We start by showing that fi(a)Dπ≅ei(φi(π)−a)f~iφi(π)Dπ if εi(π)=0.
Lemma 3.1**.**
Let M, A and B be G-modules with M∼A∣B. Then for any G-module N we have that
[TABLE]
Proof.
This follows from HomG(⋅,N) being left exact.
∎
Lemma 3.2**.**
Let A and B be finite dimensional modules with soc(B)≅C simple. Then dimHomG(A,B)≤[A:C].
If soc(A)≅C and dimHomG(A,B)=[A:C] then A is isomorphic to a submodule of B.
Proof.
Let A∼D1∣…∣Dh with Di simple. Then, as C≅soc(B) is simple, we have from Lemma 3.1
[TABLE]
Assume now that soc(A)≅C and dimHomG(A,B)=[A:C]. Then A∼C∣A for a certain module A. From the previous part and by assumption
[TABLE]
In particular there exists f∈HomG(A,B) with C≅soc(A)⊆ker(f). As the socle of A is simple we have that soc(A)∩ker(f)=0 and so ker(f)=0, from which the lemma follows.
∎
Lemma 3.3**.**
If π is a p-regular partition with εi(π)=0 and we let ν with Dν=f~iaDπ for some 0≤a≤φi(π), then for 0≤b≤a we have that ei(b)Dν⊆fi(a−b)Dπ.
Similarly if ψ is a p-regular partition with φi(ψ)=0 and we let ρ with Dρ=e~icDρ for some 0≤c≤εi(ψ), then for 0≤d≤c we have that fi(d)Dρ⊆ei(c−d)Dψ.
Proof.
We will prove only the first part of the lemma, as the second part can be proved similarly.
First notice that εi(ν)=a from Lemma 2.7. Also, if γ is such that Dγ=f~ia−bDπ, then, again by Lemma 2.7,
[TABLE]
and then e~ibDν=Dγ. So soc(fi(a−b)Dπ)≅Dγ≅soc(ei(b)Dν) from Lemmas 2.2 and 2.3. We also have that [ei(b)Dν:Dγ]=(ba).
Further, if π⊢n, from Lemmas 2.2, 2.3 and 2.6
[TABLE]
The result now follows from Lemma 3.2.
∎
Lemma 3.4**.**
Let π be a p-regular partition with εi(π)=0 and let ψ with Dψ=f~iφi(π)Dπ. For 0≤a≤φi(π) we have fi(a)Dπ≅ei(φi(π)−a)Dψ.
Proof.
As εi(ψ)=φi(π) and φi(ψ)=0 from Lemma 2.7, we have from Lemma 3.3 that, up to isomorphism,
[TABLE]
and so the lemma holds.
∎
We will now prove some lemmas about the structure of certain modules of Σn and Σn−1.
Lemma 3.5**.**
If n≥4 and p∣n−1 then
[TABLE]
Proof.
As p∣n−1 we have that D(n−1) and D(n−2,1) are in distinct blocks. So D(n−2,1)≅S(n−2,1) from Corollary 12.2 of [11]. The lemma then follows from Corollary 17.14 of [11].
∎
Lemma 3.6**.**
If p=2 and n≥4 is even then S(n−1,1)=D(n)∣D(n−1,1) and M(n−1,1)=D(n)∣D(n−1,1)∣D(n)∼S(n−1,1)∣S(n).
Proof.
The structure of S(n−1,1) follows from Corollary 12.2 and Theorem 24.15 of [11]. Since M(n−1,1) is self-dual, the lemma then follows from Example 17.17 of [11].
∎
Lemma 3.7**.**
Let p=2 and n≥6 be even.
If n≡0mod4 then S(n−2,2)=D(n−1,1)∣D(n−2,2).
If n≡2mod4 then S(n−2,2)=D(n−1,1)∣D(n)∣D(n−2,2).
Proof.
If n≡0mod4 then the lemma holds from Corollary 12.2 and Theorem 24.15 of [11].
If n≡2mod4 then S(n−2,2) has compositions factors D(n), D(n−1,1) and D(n−2,2) from Theorem 24.15 of [11]. Also D(n−2,2)≅hd(S(n−2,2)) from Corollary 12.2 of [11] and D(n)⊆S(n−2,2) from Theorem 24.4 of [11]. So the lemma holds also in this case.
∎
Lemma 3.8**.**
If p=2 and n≡0mod2 with n≥4 then M(n−2,1)=D(n−1)⊕D(n−2,1). If further n≡0mod4 with n≥8 then M(n−3,2)=D(n−1)⊕D(n−2,1)⊕D(n−3,2).
Proof.
From Theorem 24.15 of [11] we have D(n−1)≅S(n), D(n−2,1)≅S(n−1,1) as n−1 is odd. For n≡0mod4 Theorem 24.15 of [11] also gives D(n−3,2)≅S(n−3,2). The lemma now follows as M(n−2,1)∼S(n−2,1)∣S(n−1) and M(n−3,2)∼S(n−3,2)∣S(n−2,1)∣S(n−1) by Example 17.17 of [11] and as M(n−2,1) and M(n−3,2) are self-dual.
∎
Lemma 3.9**.**
If p=2 and n≥4 is even then D(n−2,1)↑Σn≅f0D(n−2,1)≅Y(n−2,1,1) is indecomposable with head and socle isomorphic to D(n−1,1). Also [D(n−2,1)↑Σn:D(n−1,1)]=3.
Proof.
For n even we have that the residues of (n−2,1) are given by
[TABLE]
In particular (1,n−1),(2,2),(3,1) are the conormal nodes of (n−2,1) and they all have residue 0. So D(n−2,1)↑Σn≅f0D(n−2,1) is indecomposable with head and socle isomorphic to D(n−1,1) and [D(n−2,1)↑Σn:D(n−1,1)]=3.
From Lemma 3.8 we have that
[TABLE]
Since D(n−2,1)↑Σn is indecomposable, it follows that D(n−2,1)↑Σn≅Y(n−2,1,1).
∎
Lemma 3.10**.**
Let p=2 and n≥6 be even.
If n≡0mod4 then [S(n−2,1,1):D(n)],[S(n−2,1,1):D(n−1,1)],[S(n−2,1,1):D(n−2,2)]=1.
If n≡2mod4 then [S(n−2,1,1):D(n−1,1)],[S(n−2,1,1):D(n−2,2)]=1 and [S(n−2,1,1):D(n)]=2.
Also soc(S(n−2,1,1))≅D(n−1,1).
Proof.
From page 93 of [11] we have that the character of S(n−2,1,1) is equal to the sum of the characters of S(n−2,2) and of S(n). In particular, from Lemma 3.7, the composition factors of S(n−2,1,1) are as given in the lemma.
From Lemmas 3.5 and 3.9 we have that
[TABLE]
and so the second part of the lemma also holds.
∎
Lemma 3.11**.**
If p=2 and n≥4 is even then (S(n−1,1))∗⊆S(n−2,1,1).
Proof.
For 2≤i<j≤n let ei,j represent the polytabloid corresponding to the standard tableau of shape (n−2,1,1) with second and third row entries i and j respectively. We have
[TABLE]
Also
[TABLE]
and
[TABLE]
So the restriction of S(n−2,1,1) to Σ1,n−1=⟨(n−1,n),(2,…,n)⟩ is a permutation representation. In particular
[TABLE]
From Lemma 3.6 and from the self-duality of M(n−1,1) we have that
[TABLE]
As soc(S(n−2,1,1))≅D(n−1,1) from Lemma 3.10, so that D(n) and M(n−1,1) are not contained in S(n−2,1,1), the lemma follows.
∎
Lemma 3.12**.**
Let p=2 and n≥6 be even. Then e0D(n−1,2) is both a submodule and a quotient of D(n−2,1)↑Σn and S(n−2,2)⊆e0D(n−1,2).
Further [e0D(n−1,2):D(n−1,1)]=2, socle and head of e0D(n−1,2) are isomorphic to D(n−1,1) and
e0D(n−1,2)⊆M⊆D(n−2,1)↑Σn* with M∼S(n−2,1,1)∣D(n−1,1),*
e0D(n−1,2)≅N* or e0D(n−1,2)≅N/D(n) with*
[TABLE]
Proof.
For n even we have that
[TABLE]
In particular (1,n−2) and (2,1) are the normal nodes (all of residue 1) and (1,n−1),(2,2),(3,1) are the conormal nodes (all of residue 0) of (n−2,1). It follows that ε0(n−2,1)=0 and φ0(n−2,1)=3. Also f~02D(n−2,1)=D(n−1,2). So e0D(n−1,2)⊆f0D(n−2,1)=D(n−2,1)↑Σn from Lemmas 3.3 and 3.9. Since e0D(n−1,2) and f0D(n−2,1) are self-dual by Lemma 2.5, we also have that e0D(n−1,2) is a quotient of D(n−2,1)↑Σn. Also head and socle of e0D(n−1,2) are isomorphic to D(n−1,1), as so are those of D(n−2,1)↑Σn (Lemma 3.9). Further ε0(n−1,2)=ε0(n−2,1)+2=2 from Lemma 2.7. So from Lemma 2.2 it follows that [e0D(n−1,2):D(n−1,1)]=2.
From Lemmas 3.5, 3.6, 3.7, 3.10 and 3.9 we have that
[TABLE]
From the previous part it follows that e0D(n−1,2)⊆M⊆D(n−2,1)↑Σn with M∼S(n−2,1,1)∣D(n−1,1) and that e0D(n−1,2) is a quotient of N=D(n−2,1)↑Σn/S(n−2,1,1)∼S(n−2,2)∣S(n−1,1).
Let A be a submodule with N/A≅e0D(n−1,2). Further let B⊆N with B≅S(n−2,2) and N/B≅S(n−1,1). As e0D(n−1,2) and N both have exactly 2 composition factor isomorphic to D(n−1,1), no composition factor of A is isomorphic to D(n−1,1). In particular D(n−1,1)⊆A and so, as soc(S(n−2,2))≅D(n−1,1) (Lemma 3.7), it follows that A∩B=0. In particular S(n−2,2)≅B⊆N/A≅e0D(n−1,1). Also A is isomorphic to a submodule of N/B≅S(n−1,1) with no composition factor isomorphic to D(n−1,1). So A=0 or A≅D(n) as S(n−1,1)≅D(n)∣D(n−1,1) (Lemma 3.6).
∎
Lemma 3.13**.**
If p=2 and n≡2mod4 with n≥6 then
[TABLE]
Proof.
This follows from Theorem 1.1 of [21] and from Lemma 3.9.
∎
Corollary 3.14**.**
If p=2 and n≡2mod4 with n≥6 then
[TABLE]
and
[TABLE]
Proof.
The structure of S(n−2,1,1) follows from Lemmas 3.5, 3.10 and 3.13 (or from (2.4)c of [21]).
The structure of e0D(n−1,2) follows from Lemmas 3.12 and 3.13.
∎
Lemma 3.15**.**
If p=2 and n≡0mod4 with n≥8 then
[TABLE]
Proof.
As n is even we have that the content of (n−3) is
[TABLE]
and so φ0((n−3))=0 and φ1((n−3))=2. So from Lemmas 2.1 and 2.3, f1f1D(n−3)≅D(n−2,1)⊕D(n−2,1) is a direct summand of M(n−3,1,1). From Theorem 1.1 of [21] we have that
[TABLE]
The lemma then follows by comparing degrees (through Theorem 24.15 of [11]).
∎
Lemma 3.16**.**
If p=2 and n≡0mod4 with n≥8 then
[TABLE]
Proof.
Notice that, as n is even,
[TABLE]
and so the normal nodes of (n−1,2) are (n−1,1) and (2,2) and they both have residue 0. In particular, from Lemmas 2.1, 2.2 and 2.4,
[TABLE]
The lemma then follows by comparing dimensions.
∎
Lemma 3.17**.**
If p=2 and n≡0mod4 with n≥8 then
[TABLE]
Proof.
The lemma follows from Theorem 1.1 of [21] and from Lemma 3.9.
∎
Corollary 3.18**.**
If p=2 and n≡0mod4 with n≥8 then S(n−2,1,1)=D(n−1,1)∣(D(n)⊕D(n−2,2)).
Proof.
It follows from Lemmas 3.5, 3.10 and 3.17 (or from (2.4)c of [21]).
∎
Lemma 3.19**.**
If p=2 and n≡0mod4 with n≥8 then
[TABLE]
Proof.
The lemma follows from Theorem 1.1 of [21] (and comparing dimensions) or from Figure 1 of [17].
∎
The next lemmas study the structure of certain submodules and quotients of M(n−2,2) and D(n−2,1)↑Σn.
Lemma 3.20**.**
Let p=2 and n≡0mod4 with n≥8. Then M(n−2,2) has unique submodules isomorphic to D(n−1,1) and S(n−2,2).
Further M(n−2,2)/D(n−1,1)≅D(n)⊕N with
[TABLE]
and M(n−2,2)/S(n−2,2)≅D(n)⊕S(n−1,1).
Proof.
From Lemma 3.7 we have that S(n−2,2)=D(n−1,1)∣D(n−2,2). Also by definition S(n−2,2)⊆M(n−2,2). From Lemma 3.19
[TABLE]
and so D(n−1,1) is contained only once in M(n−2,2) and
[TABLE]
with N=(D(n)⊕D(n−2,2))∣D(n−1,1). Since D(n−2,2) is contained only once in M(n−2,2)/D(n−1,1), we have that M(n−2,2) has a unique submodule of the form D(n−1,1)∣D(n−2,2) which is then isomorphic to S(n−2,2). Also
[TABLE]
So to prove the lemma it is enough to prove that N/D(n−2,2)≅S(n−1,1). From Example 17.17 of [11] and Lemma 3.6 we have that
[TABLE]
Further, from the previous part of the proof,
[TABLE]
Since the head of (N/D(n−2,2))⊕D(n) contains a unique copy of D(n) it follows that N/D(n−2,2)≅S(n−1,1).
∎
Lemma 3.21**.**
Let p=2 and n≡0mod4 with n≥8. If M⊆M(n−2,2) and N⊆D(n−2,1)↑Σn with M,N=D(n−1,1)∣(D(n)⊕D(n−2,2)) then M≅N.
Proof.
From Lemma 3.17 we have that
[TABLE]
Also from Lemma 3.19
[TABLE]
As soc(D(n−2,1)↑Σn)=D(n−1,1), the only quotients of M(n−2,2) which can be contained in D(n−2,1)↑Σn are D(n−1,1) and M(n−2,2)/D(n). Let M=D(n−1,1)∣(D(n)⊕D(n−2,2))⊆M(n−2,2). Then
[TABLE]
In particular, up to isomorphism, M⊆M(n−2,2)/D(n). Using Lemma 3.8 and (1.3.5) and Corollary 1.3.11 of [12] we have that
[TABLE]
As D(n−1,1) is contained only once in D(n−2,1)↑Σn it follows that (up to isomorphism) M⊆M(n−2,2)/D(n)⊆D(n−2,1)↑Σn. As there exists a unique submodule of D(n−2,1)↑Σn of the form D(n−1,1)∣(D(n)⊕D(n−2,2)), the lemma follows.
∎
Lemma 3.22**.**
Let p=2 and n≡0mod4 with n≥8. Let M be a quotient of D(n−2,1)↑Σn with D(n−2,2)⊆M. Then there exists a quotient N of M(n−2,2) with D(n−2,2)⊆N⊆M.
Proof.
From Lemma 3.17 if M is a quotient of D(n−2,1)↑Σn with D(n−2,2)⊆M then M has one of the following forms:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
From Lemmas 3.12, 3.16 and 3.17 we have that
[TABLE]
In order to prove the lemma it is then enough to prove that M3 and M4 are isomorphic to quotients of M(n−2,2). For M3 this holds from Lemma 3.21 and by self-duality of D(n−2,1)↑Σn and M(n−2,2) (since M3=(D(n)⊕D(n−2,2))∣D(n−1,1)). Since M4≅M3/D(n) it follows that M4 is also isomorphic to a quotient of M(n−2,2) and so the lemma holds.
∎
Lemma 3.23**.**
Let p=2 and n≡0mod4 with n≥8. Let M be a quotient of D(n−2,1)↑Σn with M≅D(n−1,1) and such that no submodule of M is of the form D(n)∣D(n). Also let N≅(S(n−1,1))∗ with D(n−1,1)⊆M∩N. Then K⊆L⊆M+N with L a quotient of M(n−2,2) and K=D(n−1,1)∣(D(n)⊕D(n−2,2))⊆M(n−2,2).
Proof.
From Lemma 3.17 M is of one of the following forms:
[TABLE]
[TABLE]
[TABLE]
From Lemmas 3.12, 3.16 and 3.17 we have that
[TABLE]
In particular we can assume that M≅M2 or M≅M3. Let N2,N3≅(S(n−1,1))∗ with D(n−1,1)⊆M2∩N2,M3∩N3. Since (S(n−1,1))∗⊆M2,M3 (by the structure of M2 and M3 and Lemma 3.6), we have that M2∩N2,M3∩N3≅D(n−1,1). As M3≅M2/D(n) it then follows that
[TABLE]
Assume that M2+N2≅M(n−2,2). Then M3+N3≅M(n−2,2)/D(n) and so the lemma holds (the submodules of M(n−2,2) and of M(n−2,2) of the form D(n−1,1)∣(D(n)⊕D(n−2,2)) are isomorphic, as
[TABLE]
from Lemma 3.19).
So it is enough to prove that M2+N2≅M(n−2,2). Since M2∩N2≅D(n−1,1) it is then enough to prove that M(n−2,2)=M2+N2 with M2≅M2, N2≅N2≅(S(n−1,1))∗ and M2∩N2≅D(n−1,1). From Lemmas 3.5 and 3.11 there exists N2⊆M(n−2,2) with N2≅(S(n−1,1))∗. Let M2⊆M(n−2,2) with
[TABLE]
(such a submodule of M(n−2,2) exists and is isomorphic to (M(n−2,2)/D(n))∗ from Lemma 3.19 and self-duality of M(n−2,2)). From the proof of Lemma 3.21 and by self-duality of M(n−2,2) and D(n−2,1)↑Σn we have that M2 is isomorphic to a quotient of D(n−2,1)↑Σn. From the structure of M2 and from Lemma 3.17 it follows that M2≅M2 (since M2 is the only quotient of D(n−2,1)↑Σn of the form (D(n)⊕(D(n−1,1)∣D(n−2,2)))∣D(n−1,1)).
We will next prove that M2∩N2≅D(n−1,1). From Lemma 3.6 and definition of M2 and of N2 we have that both M2 and N2 contain a submodule isomorphic to D(n−1,1). Since both M2 and N2 are submodules of M(n−2,2) and since M(n−2,2) contains only one submodule isomorphic to D(n−1,1) (from Lemma 3.19), it follows that D(n−1,1)⊆M2∩N2. As N2≅(S(n−1,1))∗=D(n−1,1)∣D(n) and as M2 does not contain any uniserial module of the form D(n−1,1)∣D(n) (the only composition factor of M2 isomorphic to D(n) is in its socle), we then have that M2∩N2≅D(n−1,1).
Since M2∩N2≅D(n−1,1) and M2+N2⊆M(n−2,2), comparing compositions factors we obtain that M2+N2=M(n−2,2). The lemma then follows.
∎
Lemma 3.24**.**
If p=2 and n≥2 and M is an Σn module with M=D(n)∣D(n), then M≅1↑AnΣn.
Proof.
We can choose a basis of M so that the matrix representation has the form \pi\mapsto\left(\begin{array}[]{cc}1&x_{\pi}\\
0&1\end{array}\right). Further we may assume that x(1,2)∈{0,1}. As matrices of the form \left(\begin{array}[]{cc}1&x\\
0&1\end{array}\right) commute, we have that xρ=x(1,2) for any transposition ρ and then that xπ=x(1,2)δπ∈An for π∈Σn. As M=D(n)∣D(n) it follows x(1,2)=1. As \left(\begin{array}[]{cc}1&1\\
0&1\end{array}\right) and \left(\begin{array}[]{cc}0&1\\
1&0\end{array}\right) are conjugated in GL2(2), the lemma follows.
∎
4 Dimensions of homomorphism rings
The next lemmas show that under, some assumptions on the dimensions of some homomorphism spaces, certain specific modules are contained in EndF(Dλ). These assumptions will be verified for most partitions in Sections 5 and 6.
Lemma 4.1**.**
Let p=2 and n≡2mod4 with n≥6. If
[TABLE]
then M⊆EndF(Dλ), where M is a quotient of D(n−2,1)↑Σn of one of the following forms:
D(n−2,2)∣D(n)∣D(n−1,1),
D(n)∣D(n−2,2)∣D(n)∣D(n−1,1),
D(n−1,1)∣D(n)∣D(n−2,2)∣D(n)∣D(n−1,1).
Proof.
As n is even, so that M(n−2,1)=D(n−1)⊕D(n−2,1),
[TABLE]
So the assumption of the lemma is equivalent to
[TABLE]
From Lemmas 3.5, 3.6, 3.7, 3.10 and 3.13 we have that D(n−2,1)↑Σn is uniserial of the form
[TABLE]
From Lemma 3.12 it follows that
[TABLE]
If
[TABLE]
then EndF(Dλ) contains a quotient of D(n−2,1)↑Σn which is not a quotient of D(n−2,1)↑Σn/(D(n−1,1)∣D(n)∣D(n−2,2)). As D(n−2,1)↑Σn is uniserial such quotients are given by the modules D(n−2,1)↑Σn/M with M strictly contained in D(n−1,1)∣D(n)∣D(n−2,2). So EndF(Dλ) contains a module of one of the forms
[TABLE]
As e0D(n−1,2) is a quotient of D(n−2,1)↑Σn the lemma holds.
So assume now that
[TABLE]
As D(n−2,1)↑Σn/(D(n−1,1)∣D(n)∣D(n−2,2))∼D(n)∣e0D(n−1,2) we have from Lemma 3.1 that
[TABLE]
So, from
[TABLE]
it follows that one of (e0D(n−1,2))/(D(n−1,1)∣D(n)), (e0D(n−1,2))/D(n−1,1) or e0D(n−1,2) is contained in EndF(Dλ) and so also in this case the lemma holds.
∎
Lemma 4.2**.**
Let p=2 and n≡0mod4 with n≥8. If
[TABLE]
then M⊆L⊆EndF(Dλ), where L is a quotient of M(n−2,2) and M is of one of the following forms:
M≅D(n−2,2),
M=D(n−1,1)∣(D(n)⊕D(n−2,2))⊆M(n−2,2).
Proof.
From Lemma 3.19
[TABLE]
Notice that the only quotients of M(n−2,2) but not of M(n−2,2)/D(n−1,1) are of the form M(n−2,2) or M(n−2,2)/D(n), where
[TABLE]
(no other quotients are possible since the socle of M(n−2,2)/D(n) is ismorphic to D(n−1,1)). Further the submodules of the form D(n−1,1)∣(D(n)⊕D(n−2,2)) contained in M(n−2,2) and M(n−2,2)/D(n) are isomorphic (by the structure of M(n−2,2) or from the proof of Lemma 3.23).
Assume now that EndF(Dλ) does not contain any module
[TABLE]
Then neither M(n−2,2) nor M(n−2,2)/D(n) are contained in EndF(Dλ) and so
[TABLE]
So, from Lemma 3.1 and by assumption,
[TABLE]
Since from Lemma 3.20
[TABLE]
it follows that there exists a quotient L of M(n−2,2) (and so also of M(n−2,2)) with D(n−2,2)⊆L⊆EndF(Dλ).
∎
We will now find lower/upper bounds depending on ε0(λ) and ε1(λ) for dimEndΣn−2(Dλ↓Σn−2) and dimHomΣn(S(n−1,1),EndF(Dλ)). These bounds will be later used to prove that the assumptions in Lemmas 4.1 and 4.2 hold, at least when ε0(λ)+ε1(λ) is large enough.
Lemma 4.3**.**
Let λ⊢n be p-regular. Assume that εi(λ)≥1 and let ν with Dν=e~iDλ. Assume further that εj(ν)≥1. Then
[TABLE]
Proof.
For f∈EndΣn−1(eiDλ) let f be the restriction of f to ejeiDλ. By definition of ei and ej we have that eiDλ is contained in a unique block of FΣn−1 and so ejeiDλ is the restriction of eiDλ↓Σn−2 to a certain block of Σn−2. As f∈EndΣn−1(eiDλ)⊆EndΣn−2(eiDλ↓Σn−2), so that f acts blockwise on eiDλ↓Σn−2, we have that f∈EndΣn−2(ejeiDλ).
From Lemma 2.2(i) we have hd(eiDλ)≅Dν and by assumption ejDν=0, so that 0=ejhd(eiDλ)⊆hd(eiDλ)↓Σn−2. If f∈EndΣn−1(eiDλ) is non-zero, then hd(eiDλ)⊆ker(f). As hd(eiDλ) is simple it then follows that hd(eiDλ)∩ker(f)=0 and so ejhd(eiDλ)∩ker(f)=0. So ejhd(eiDλ)⊆ker(f) and then f=0.
Let now g∈EndΣn−2(ejDν). As soc(eiDλ) and hd(eiDλ) are isomorphic to Dν from Lemma 2.2(i), we can consider g as
[TABLE]
In particular g defines an endomorphism g∈EndΣn−2(ejeiDλ) with g=0 if g=0.
Assume now that f=g=0 for some f∈EndΣn−1(eiDλ) and g∈EndΣn−2(ejDν). Then f=0, in particular soc(eiDλ)⊆Im(f) (as the socle of eiDλ is simple). From
[TABLE]
it follows that
[TABLE]
As f=0 and so f=0 and as hd(eiDλ)≅Dν from Lemma 2.2(i) it follows that
[TABLE]
and then hd(Im(f))≅Dν. Further ej(Im(f))=Im(f), as f acts blockwise on ei(Dλ)↓Σn−2 and by definition of f. In particular ejhd(Im(f)) is a quotient of Im(f). So
[TABLE]
for certain submodules A⊆ejsoc(eiDλ) and B⊆ejDν with A≅B. It follows that A,B=0 and then
[TABLE]
As soc(eiDλ)≅Dν is simple we then have (by the previous part) that
[TABLE]
and then that hd(Im(f))=soc(eiDλ). In particular f can be seen as an element of HomΣn−1(hd(eiDλ),soc(eiDλ))≅EndΣn−1(Dν).
By the first part of the proof we also have that f↦f and g↦g are injective. So
[TABLE]
∎
Lemma 4.4**.**
Let p=2 and λ be 2-regular. Assume that ε0(λ),ε1(λ)≥1. Let x0 and x1 be the lowest normal nodes of λ of residue 0 and 1 respectively. Also let ν0=λ∖{x0} and ν1=λ∖{x1}. Then e~0Dλ=Dν0 and e~1Dλ=Dν1.
Further if 0≤i≤1 and j=1−i are such that xi is above xj then εi(νj)≥εi(λ) and εj(νi)=εj(λ)+2.
Proof.
The first part of the lemma follows from the definition of e~0Dλ and e~1Dλ.
By definition of i, all normal nodes of λ of residue i are above the node xj. So all normal nodes of λ of residue i are also normal in νj and then εi(νj)≥εi(λ).
We will now show that εj(νi)=εj(λ)+2. To see this let y and z be the nodes to the right and to the left of xi (notice that z is a node of νi, since the row of λ containing xi contains at least 2 nodes, as xi is above xj and so not on the last row of λ and as λ is 2-regular). Then y and z both have residue j. As xi is the bottom normal i-node of λ we have that νi is also 2-regular (since Dνi is defined). As all parts of λ and νi are distinct
[TABLE]
and so y is an addable node of λ but not of νi and z is a removable node of νi but not of λ. All other addable and removable nodes of residue j of λ and νi are equal.
So (as y and z both have residue j) the j-signatures of λ and νi are equal, apart for the position corresponding to y and z respectively. In this position the j-signature of λ is − and that of νi is +. From the definition of xj (it is the bottom normal j-node of λ) we can then (partly) reduce the j-signature of λ and νi to
[TABLE]
So the reduced j-signature are given by
[TABLE]
In particular εj(νi)=εj(λ)+2.
∎
Lemma 4.5**.**
Let p=2 and λ⊢n be 2-regular. Assume that ε0(λ),ε1(λ)≥1. Then
[TABLE]
Proof.
It follows from Lemmas 4.3 and 4.4 as if ν0 and ν1 are such that e~0Dλ=Dν0 and e~1Dλ=Dν1 then, for a certain 0≤i≤1 and for j=1−i,
[TABLE]
∎
Lemma 4.6**.**
Let M be an Σn module. Then
[TABLE]
Proof.
This follows from Lemma 1.3.8 and Theorem 1.3.10 of [12] and Mackey’s theorem.
∎
Lemma 4.7**.**
If i=j then eifj and fjei are isomorphic functors.
Proof.
Let M be an Σn-module corresponding to a single block B with content (b0,…,bp−1). Let C be the block with content (c0,…,cp−1), where ci=bi−1, cj=bj+1 and ck=bk if k=i,j. As i=j we have from Lemma 2.1 that the components of
[TABLE]
and
[TABLE]
corresponding to block C are eifjM and fjeiM respectively. Since from Lemma 4.6
[TABLE]
and B=C, so that the components of M↓Σn−1↑Σn and M↑Σn+1↓Σn in block C are isomorphic (as M corresponds to B), it follows that eifjM≅fjeiM.
The lemma holds as eifj and fjei respect direct sums.
∎
Lemma 4.8**.**
Let λ⊢n be p-regular. For i=j we have that
[TABLE]
Proof.
From Lemmas 2.2(ii) and 2.6
[TABLE]
Since Dλ is simple, using Lemmas 2.6 and 4.7 it then follows that
[TABLE]
∎
Lemma 4.9**.**
Let p=2 and λ⊢n be 2-regular. If ε0(λ),ε1(λ)≥1 let a=2ε0(λ)+2ε1(λ)+2ε0(λ)ε1(λ), else let a=0. Then
[TABLE]
Proof.
From Lemma 2.1 we have that
[TABLE]
Further e0e0Dλ, e1e1Dλ and (e0e1Dλ⊕e1e0Dλ) correspond to 3 distinct blocks, from the definition of e0 and e1.
So, from Lemmas 2.2 and 4.8,
[TABLE]
The lemma now follows from Lemma 4.5.
∎
Lemma 4.10**.**
If M,N are G-modules then
[TABLE]
Proof.
We have that
[TABLE]
∎
Lemma 4.11**.**
If n is an Σn-module then
[TABLE]
Proof.
From Lemma 2.1 it follows that
[TABLE]
∎
Lemma 4.12**.**
Let n≥3 with p∣n and λ be p-regular. Then
[TABLE]
Proof.
Since p∣n we have that
[TABLE]
from Lemma 3.6 and as M(n−1,1) is self-dual. Also, from Lemma 4.10,
[TABLE]
Since (S(n−1,1))∗≅M(n−1,1)/D(n), there exists D⊆Dλ⊗M(n−1,1) with D≅Dλ for which Dλ⊗(S(n−1,1))∗≅(Dλ⊗M(n−1,1))/D. We will now show that for an arbitrary D⊆Dλ⊗M(n−1,1) with D≅Dλ we have
[TABLE]
Notice first that, from Lemma 4.11,
[TABLE]
By definition of ei and fj, the block component of Dλ⊗M(n−1,1) is isomorphic to ∑ifieiDλ. So, up to isomorphism,
if D⊆Dλ⊗M(n−1,1) with D≅Dλ, then D⊆∑ifieiDλ. Further
[TABLE]
So we will consider ∑ifieiDλ instead of Dλ⊗M(n−1,1).
Let
[TABLE]
with Di,k simple. Then
[TABLE]
Notice that, from Lemmas 2.3(i) and 2.7, we have that Dλ⊆fiDi,k if and only if Di,k≅e~iDλ. By definition and from the previous part of the proof we have that D≅Dλ and D⊆∑ifieiDλ. So there exist i and k with 1≤k≤hi and with Di,k≅e~iDλ such that
[TABLE]
In particular, from Lemma 2.2(ii) and by definition of Di,k,
[TABLE]
As eiDλ=0 this gives
[TABLE]
From Lemma 4.6 we have that
[TABLE]
So there exists D⊆Dλ↑Σn+1↓Σn with D≅Dλ and
[TABLE]
In particular, with a similar proof, we obtain
[TABLE]
As ε0(λ)+…+εp−1(λ)+1=φ0(λ)+…+φp−1(λ) from Lemma 2.8, the lemma follows.
∎
Lemma 4.13**.**
Let n≥3 with p∣n and λ be p-regular. Then
[TABLE]
In particular if ε0(λ)+…+εp−1(λ)≥2 then
[TABLE]
Proof.
If ε0(λ)+…+εp−1(λ)≥2 then
[TABLE]
since if εi(λ)=ε0(λ)+…+εp−1(λ) then εi(λ)>1. So it is enough to prove the first part of the lemma.
We will now prove that if εi(λ)≥1 then soc((fie~iDλ)/Dλ) contains at most φi(λ)−δφi(λ)>1 copies of Dλ. Since it can be proved similarly that if φi(λ)≥1 then soc((eif~iDλ)/Dλ) contains at most εi(λ)−δεi(λ)>1 copies of Dλ, this will complete the proof of the lemma.
Assume that εi(λ)≥1. Then e~iDλ=0 from definition of e~i. Let ν with Dν=e~iDλ. Then f~iDν=Dλ and φi(ν)=φi(λ)+1≥1 from Lemma 2.7. So we have to prove that soc((fiDν)/Dλ) contains at most φi(λ)−δφi(λ)>1 copies of Dλ (notice that Dλ≅soc(fiDν) from Lemma 2.3(i)). From Lemma 2.3(ii) we have
[TABLE]
So we can assume that φi(λ)>1. In this case (fiDν)/Dλ=0 and so
[TABLE]
by Lemma 2.3(i). In particular hd((fiDν)/Dλ)≅Dλ and then
[TABLE]
for a certain module M⊆(fiDν)/Dλ. As
[TABLE]
we have that M=0. So soc((fiDν)/Dλ)⊆M, as hd((fiDν)/Dλ) is simple and (fiDν)/Dλ∼M∣hd((fiDν)/Dλ). In particular
[TABLE]
∎
We will also need the following lemma which compares the dimensions of EndΣn−2(M↓Σn−2) and of EndΣn−2,2(M↓Σn−2,2) for any Σn-module M.
Lemma 4.14**.**
If p=2 and M is an Σn-module then
[TABLE]
Proof.
As p=2, so that M(2)∼D(2)∣D(2) (as D(2) is the only simple module of Σ2 in characteristic 2), we have that
[TABLE]
So, from Lemma 3.1,
[TABLE]
∎
The next lemma considers the structures of ei2Dλ when εi(λ)=2.
Lemma 4.15**.**
Let p=2 and λ be a 2-regular partition with εi(λ)=2. If Dν≅e~i2Dλ, then ei2Dλ=(Dν⊗D(2))∣(Dν⊗D(2)).
Proof.
As D(2) is the only simple module of Σ2 in characteristic 2 and as (ei2Dλ)↓Σn−2=ei2Dλ=Dν⊕Dν from Lemma 2.2, we have that ei2Dλ∼(Dν⊗D(2))∣(Dν⊗D(2)).
Considering the block decomposition of Dλ↓Σn−2,2 and of (Dν⊗D(2))↑Σn and from the definitions of ei2Dλ and of fi(2)Dν (restrictions of Dλ↓Σn−2,2 and (Dν⊗D(2))↑Σn to certain blocks), we have that
[TABLE]
from which the lemma follows.
∎
Remark 4.16**.**
Notice that Lemmas 3.1, 3.2, 3.3, 3.4, 3.5, 4.3, 4.7, 4.8, 4.10, 4.12 and 4.13 hold in arbitrary characteristic.
5 Partitions with at least 3 normal nodes
We now consider the structure of EndF(Dλ) for partitions with at least 3 normal nodes. We first show that D(n−1,1) is contained in EndF(Dλ). This will be used when considering tensor products with D(m+1,m−1) for m even.
Lemma 5.1**.**
If p=2, λ⊢n with n≥4 even is 2-regular and ε0(λ)+ε1(λ)≥3 then D(n−1,1)⊆EndF(Dλ).
Proof.
As n is even M(n−1,1)=D(n)∣D(n−1,1)∣D(n). From Lemmas 2.9 and 3.1 it then follows that
[TABLE]
∎
We will now show that the assumptions of Lemmas 4.1 and 4.2 holds when λ has at least 3 normal nodes.
Lemma 5.2**.**
Let p=2 and λ⊢n with n≥4 even be 2-regular and assume that ε0(λ)+ε1(λ)≥3. Then
[TABLE]
Proof.
Let a=2ε0(λ)+2ε1(λ)+2ε0(λ)ε1(λ) if ε0(λ),ε1(λ)≥1 and a=0 otherwise. From Lemmas 2.9, 4.9 and 4.13 it is enough to prove that
[TABLE]
and so it is also enough to prove that
[TABLE]
Since x(2x−5)≥0 for x=0 or x≥3 and since a≥0, we only need to check the lemma when 1≤εi(λ)≤2 for some 0≤i≤1. Let j=1−i. If εi(λ)=1 then εj(λ)≥2 and so
[TABLE]
If instead εi(λ)=2 then εj(λ)≥1 and so
[TABLE]
∎
Lemma 5.3**.**
Let p=2 and λ⊢n with n≥4 even be 2-regular and assume that ε0(λ)+ε1(λ)≥3. Then
[TABLE]
Proof.
From Lemma 4.14 we have that
[TABLE]
So it is enough to prove that
[TABLE]
Let a=2ε0(λ)+2ε1(λ)+2ε0(λ)ε1(λ) if ε0(λ),ε1(λ)≥1 or a=0 otherwise. From Lemmas 4.9 and 4.13 it is enough to prove that
[TABLE]
It is then also enough to prove that
[TABLE]
As 2x(x−3)≥0 for x=0 or x≥3 and as a≥0, we still only need to prove the lemma if 1≤εi(λ)≤2 for some 0≤i≤1. Let j=1−i. If εi(λ)=1 then εj(λ)≥2 and so
[TABLE]
If εi(λ)=2 then εj(λ)≥1 and so
[TABLE]
∎
6 Partitions with 2 normal nodes
In this section we will consider partitions with 2 normal nodes. Proofs or results will be more complicated than in the previous case as we have to explicitly consider the structure of such partitions. We first start by studying the structure of partitions with 2 normal nodes.
Lemma 6.1**.**
Let p=2 and λ⊢n be 2-regular with ε0(λ)+ε1(λ)=2. For 1≤k≤h(λ) let ak be the residue of the removable node of the k-th row of λ. Further let 1<b1<…<bt≤h(λ) be the set of indexes k for which ak=ak−1. Then the normal nodes of λ are on rows 1 and b1, while the conormal nodes of λ are on rows bt−1, h(λ) and h(λ)+1. Further abk=abk−1 for 1<k≤t.
Proof.
Notice that ak is defined for each 1≤k≤h(λ), since λ is 2-regular. Further λ has an addable node on row k for each 1≤k≤h(λ)+1.
Notice first that if the removable node on row k is normal then k=1 or k=bs for some s (as otherwise the addable node on row k−1 has residue 1−ak−1=ak). From λ having 2 normal nodes it then follows that t≥1. The removable node on the first row is normal (this is always the case). Also, from definition of ak, we have that the residue of the addable node on row k≤h(λ) is given by 1−ak. For 1≤k<b1−1 we have 1−ak=ak+1 by definition of b1. As 1−ab1−1=ab1−1=ab1, it then follows that the removable node on row b1 is also normal (if the addable node on row k, with 1≤k<b1, has residue ab1 then k<b1−1 and the removable node on row k+1 also has residue ab1). As λ has 2 normal nodes and, by definition, b1≥2, there are no other normal nodes of λ.
The addable nodes on rows h(λ) and h(λ)+1 are conormal (they are always conormal). Further for bt+1≤k≤h(λ) we have, by definition of bt, that 1−ak=ak−1. Also abt=abt−1=1−abt−1 and 1−abt−1 is the residue of the addable node on row bt−1. It then follows that the addable node on row bt−1 is also conormal (notice that bt−1≥b1−1≥1). As λ has 2 normal nodes and so 3 conormal (Lemma 2.8), these are all the conormal nodes of λ.
We will now show that abk=abk−1 for 1<k≤t. To do this, let k≥2 minimal such that abk=abk−1 (if such an k exists). Again notice that the addable node on row s has residue 1−as for s≤h(λ). From the minimality of k it follows that, for 1≤s≤bk−2 with s=bk−1−1,
[TABLE]
Also f:{1,…,bk−2}∖{bk−1−1}→{1,…,bk−1} given through
[TABLE]
is injective and satisfies f(s)>s for each s.
By assumption on k we have that abk=abk−1=abk−1=abk−1−1 (so that the addable nodes on rows bk−1 and bk−1−1 do not have residue abk). It then follows that the removable node on row bk is normal. As k≥2 this would then mean that λ has at least 3 normal nodes, which contradicts the assumptions. So abk=abk−1 for 2≤k≤t.
∎
Lemma 6.2**.**
Let p=2 and λ⊢n be 2-regular with n even. Then we cannot have that εi(λ)=2, εj(λ)=0, φi(λ)=0 and φj(λ)=3 for some 0≤i≤1 and j=1−i.
Proof.
Assume that εi(λ)=2, εj(λ)=0, φi(λ)=0 and φj(λ)=3. For 1≤k≤h(λ) let ak be the residue of the removable node on the k-th row of λ (on each row of λ there are both a removable and an addable node, as λ is 2-regular). Also let 1<b1<…<bt≤h(λ) be the set of indexes k for which ak=ak−1. From Lemma 6.1 we have that the removable nodes on rows 1 and b1 are normal. As εj(λ)=0 we have that a1,ab1=i.
Further, again from Lemma 6.1, the conormal nodes of λ are the addable nodes on rows bt−1, h(λ) and h(λ)+1. As φi(λ)=0 it follows that abt−1,ah(λ)=i and h(λ)≡1−(h(λ)+1)≡jmod2.
We have that (a1,…,ab1−1)=(i,j,…,i), (abt,…,ah(λ))=(i,j,…,i) and (abs−1,…,abs−1)=(abs−1,1−abs−1,…,abs−1,1−abs−1) for 2≤s≤t from definition of bs and Lemma 6.1. So
[TABLE]
Further b1−1 and h(λ)−bt+1 are odd while bs−bs−1 is even for 2≤s≤t. In particular h(λ) is even and so j=0 and i=1. From a1=i=1 it follows that λ1 is even, while from h(λ) even and ah(λ)=i=1 it follows that λh(λ) is odd. So
[TABLE]
contradicting n being even.
∎
Lemma 6.3**.**
Let p=2 and λ⊢n with n≥4 even be 2-regular. Assume that ε0(λ)+ε1(λ)=2. Then D(n−1,1)⊆EndF(Dλ).
Proof.
From Lemma 3.6 we have that M(n−1,1)=D(n)∣D(n−1,1)∣D(n), so that
[TABLE]
From Lemma 6.2 (and Lemma 2.8) there exists i with εi(λ)=0 and φi(λ)=0. Let ν with e~iDλ=Dν. Then φi(ν)=φi(λ)+1≥2 from Lemma 2.7. Also, from Lemma 2.2(i),
[TABLE]
From Lemma 2.3 it then follows that
[TABLE]
and so in particular
[TABLE]
Similarly there exists D≅Dλ contained in the head of fieiDλ which is not contained in the socle of fieiDλ. So
[TABLE]
From Lemma 4.11
[TABLE]
Also, from Lemma 2.9,
[TABLE]
As Dλ is self-dual we then have that the head and socle of Dλ⊗M(n−1,1) both contain 2 copies of Dλ. From the previous computations there exists D,D′≅Dλ with D⊆hd(Dλ⊗M(n−1,1)) but D⊆soc(Dλ⊗M(n−1,1)) and similarly D′⊆soc(Dλ⊗M(n−1,1)) but D′⊆hd(Dλ⊗M(n−1,1)). So
[TABLE]
or
[TABLE]
In each of these cases we can easily deduce that Dλ⊗D(n−1,1) contains a copy of Dλ in its socle or in its head. Since Dλ⊗D(n−1,1) is self-dual, it follows that Dλ⊆soc(Dλ⊗D(n−1,1)). Then, from Lemma 4.10,
[TABLE]
and so the lemma holds.
∎
Lemma 6.4**.**
Let p=2 and λ⊢n with n even be 2-regular with εi(λ)=2 and εj(λ)=0 for some 0≤i≤1 and for j=1−i. Then dimEndΣn−2(ejeiDλ)≥2.
Proof.
Notice that h(λ)≥2, as λ has 2 normal nodes.
First assume that λ1≡λ2mod2 and let ν:=(λ1−1,λ2,λ3,…). Then λ1−λ2≥2 and so ν=λ∖(1,λ1) is 2-regular. As (1,λ1) is a normal node of λ, we have that Dν is a composition factor of eiDλ=Dλ↓Σn−1 (Lemma 2.4). As
[TABLE]
it follows that εj(ν)≥2 (the removable nodes on the first 2 rows of ν are normal of residue j), from which follows from Lemma 2.2(ii) that ejDν is non-zero and not simple. In particular
[TABLE]
is also non-zero and not simple and so the lemma holds as ejeiDλ is self-dual by Lemma 2.5.
Assume now that λ1≡λ2mod2. Then λ1+λ2 is odd and so h(λ)≥3. The removable nodes on the first 2 rows are the only normal nodes of λ (from Lemma 6.1 as they have the same residue). In particular if ρ:=(λ1,λ2−1,λ3,λ4,…) then Dρ=e~iDλ. As the removable nodes on the first two rows of λ have the same residue the removable node on the third row must have a different residue, from Lemma 6.1. So
[TABLE]
So the removable node at the end of the third row of ρ is normal with residue j. In particular εj(ρ)≥1 and then dimEndΣn−2(ejeiDλ)≥2 from Lemma 4.3.
∎
We will now prove that the assumptions of Lemma 4.1 and, in most cases, those of Lemma 4.2 hold.
Lemma 6.5**.**
Let p=2 and λ⊢n with n≥4 even be 2-regular and assume that ε0(λ)+ε1(λ)=2. Then
[TABLE]
Proof.
As ε0(λ),ε1(λ)≤2, from Lemma 4.13 we have that
[TABLE]
So, from Lemma 2.9, it is enough to prove that dimEndΣn−2(Dλ↓Σn−2)>5.
Let first ε0(λ),ε1(λ)=1. Then e0e0Dλ,e1e1Dλ=0 from Lemma 2.2. So from Lemmas
2.1, 4.5 and 4.8 we have that
[TABLE]
Assume now that εi(λ)=2 and εj(λ)=0. Then ejDλ=0 from Lemma 2.2 and so, from Lemmas 2.1, 2.2 and 6.4 and by block decomposition of Dλ↓Σn−2,
[TABLE]
∎
Lemma 6.6**.**
Let p=2 and λ⊢n with n≥4 even be 2-regular Assume that ε0(λ)+ε1(λ)=2. If ε0(λ),ε1(λ)=1 further assume that we do not have
[TABLE]
Then
[TABLE]
Proof.
From Lemma 4.14 it is enough to prove that
[TABLE]
So, from Lemma 4.13, it is enough to prove that dimEndΣn−2,2(Dλ↓Σn−2,2)≥4 or that dimEndΣn−2(Dλ↓Σn−2)≥7.
Assume first that εi(λ)=2 and εj(λ)=0. In this case ejDλ=0 from Lemma 2.2 and then Dλ↓Σn−2=eieiDλ⊕ejeiDλ from Lemma 2.2. So Dλ↓Σn−2,2=ei2Dλ⊕M, where M↓Σn−2=ejeiDλ. It then follows from Lemma 4.15 and the block decomposition of Dλ↓Σn−2,2 that
[TABLE]
From Lemma 6.4 we have that dimEndΣn−2(ejeiDλ)≥2. In particular ejeiDλ is non-zero and not simple. It then follows that the same holds for M (as Σn−2,2≅Σn−2×Σ2 and the only simple module of Σ2 in characteristic 2 is D(2)). Further M is self-dual, as it is the restriction to a block of Σn−2,2 of a self-dual module. So dimEndΣn−2,2(M)≥2 and then dimEndΣn−2,2(Dλ↓Σn−2,2)≥4. In particular the lemma holds when εi(λ)=2 and εj(λ)=0.
Assume now that ε0(λ),ε1(λ)=1. Then (λ1,…,λh(λ)−1) is not a JS-partition. Let ak be the residue of the removable node on the k-th row of λ. Let r≥2 minimal such that ar=ar−1 (it exists from Lemma 6.1). From Lemma 6.1 we have that the removable node on the r-th row of λ is normal. Since ε0(λ),ε1(λ)=1 we have that a1=ar. From Lemma 2.2, e0e0Dλ,e1e1Dλ=0 and so Dλ↓Σn−2=e1e0Dλ⊕e0e1Dλ from Lemma 2.1. If eiDλ=Dνi, we then have from Lemmas 4.3 and 4.8 that
[TABLE]
So it is enough to prove that ε1(ν0)+ε0(ν1)≥5. Let i,j with a1=i and ar=j. Then from Lemma 4.4 we already know that εj(νi)=3. So it is enough to prove that εi(νj)≥2. By definition of r we have that ak=ak−1 for 2≤k<r. So
[TABLE]
and so by assumption r+1≤h(λ). Notice that ar+1=ar from Lemma 6.1 as ar=ar−1 by definition of r. So
[TABLE]
As νj=(λ1,…,λr−1,λr−1,λr+1,λr+2,…) and (νj)r+1=λr+1>0 we have that h(νj)≥r+1 and
[TABLE]
In particular from Lemma 2.10 we have that νj is not a JS-partition. From Lemmas 2.7 and 2.10 we then have that
[TABLE]
∎
For the remaining cases we will prove directly that EndF(Dλ) contains a module of the form D(n−2,2) or D(n−1,1)∣(D(n)⊕D(n−2,2)).
Lemma 6.7**.**
Let p=2 and λ⊢n with n≡0mod4 and n≥8 even be 2-regular. Assume that ε0(λ),ε1(λ)=1 and
[TABLE]
Then M⊆L⊆EndF(Dλ), where L is a quotient of M(n−2,2) and M is of one of the following forms:
M≅D(n−2,2),
M=D(n−1,1)∣(D(n)⊕D(n−2,2))⊆M(n−2,2).
Proof.
As Dλ↓Σn−1 is not irreducible (Lemma 2.9) we have from Lemma 2.10 and by assumption that
[TABLE]
In particular
[TABLE]
So λ1,…,λh(λ)−1 are odd, λh(λ) is even and λ has an odd number of parts. Then
[TABLE]
and so φ0(λ),φ1(λ)≥1 as (h(λ),λh(λ)+1) and (h(λ)+1,1) are conormal (they are always conormal).
We will first prove that (S(n−1,1))∗⊆EndF(Dλ). Let νi with e~iDλ=Dνi for 0≤i≤1 (since εi(λ)=1). As εi(λ)=1, from Lemma 2.2 we have that
[TABLE]
From Lemma 2.7 we also have that φi(νi)=φi(λ)+1≥2. So, from Lemmas 2.3 and 2.7,
[TABLE]
From Lemma 4.11,
[TABLE]
Further from Lemma 3.6 and self-duality of M(n−1,1),
[TABLE]
there exists D⊆Dλ↓Σn−1↑Σn with D≅Dλ and
[TABLE]
From the block decomposition of Dλ↓Σn−1↑Σn (which comes from the definition of ei and fi) it follows that D⊆f0e0Dλ⊕f1e1Dλ. So, as the head and socle of f0e0Dλ⊕f1e1Dλ are disjoint, D is not contained in the head of Dλ↓Σn−1↑Σn. In particular, as D is simple,
[TABLE]
and so from Lemmas 2.9 and 4.10
[TABLE]
From Lemma 3.6, (S(n−1,1))∗=D(n−1,1)∣D(n). As D(n) is contained exactly once in EndF(Dλ) it follows that (S(n−1,1))∗⊆EndF(Dλ).
We can assume that no quotient of M(n−2,2) containing D(n−2,2) as submodule is contained in EndF(Dλ). From Lemma 3.22 we then have that EndF(Dλ) does not contain any quotient of D(n−2,1)↑Σn which contains D(n−2,2) as a submodule. From Lemma 3.5 and by self-duality of D(n−2,1)↑Σn we have that (S(n−1,1))∗⊆D(n−2,1)↑Σn. So from Lemmas 3.17 (or 3.9) and 3.23 we can further assume that D(n−2,1)↑Σn⊆EndF(Dλ).
From Lemmas 2.9, 3.8 and 4.9,
[TABLE]
By Lemma 3.17, the socle of D(n−2,1)↑Σn is isomorphic to D(n−1,1) and D(n−2,2)⊆(D(n−2,1)↑Σn)/D(n−1,1). As by assumption neither D(n−2,1)↑Σn nor any of its quotients containing D(n−2,2) as submodule are contained in EndF(Dλ) it follows that
[TABLE]
Notice that
[TABLE]
Let A be any quotient of D(n−2,1)↑Σn/(D(n−1,1)∣D(n−2,2)) containing the copy of D(n) contained in the socle of D(n−2,1)↑Σn/(D(n−1,1)∣D(n−2,2)). Then A contains an indecomposable module of the form D(n)∣D(n). So 1↑AnΣn⊆A from Lemma 3.24. Assume that A⊆EndF(Dλ). Then 1↑AnΣn⊆EndF(Dλ) and so
[TABLE]
So in this case Dλ↓An splits. This contradicts h(λ) being odd and λh(λ) even (see Theorem 1.1 of [3]). It follows that no such module A is contained in EndF(Dλ). Let M is the submodule of D(n−2,1)↑Σn of the form D(n−1,1)∣(D(n)⊕D(n−2,2)). Since D(n) is contained only once in D(n−2,1)↑Σn as submodule, we have that
[TABLE]
In particular
[TABLE]
(the last line following from Lemma 4.13).
From Lemma 3.5 we have that D(n−2,1)↑Σn has a quotient isomorphic to S(n−1,1). As S(n−1,1)=D(n)∣D(n−1,1) from Lemma 3.6, this quotient is the unique quotient of D(n−2,1)↑Σn of the form D(n)∣D(n−1,1). So
[TABLE]
As S(n−1,1)=D(n)∣D(n−1,1) from Lemma 3.6, we also have from Lemma 4.13 that
[TABLE]
so that D(n−1,1) is contained at most twice in EndF(Dλ) as a submodule.
By assumption no quotient of D(n−2,1)↑Σn containing D(n−2,2) as submodule is contained in EndF(Dλ). As
[TABLE]
and
[TABLE]
it then follows that, if C⊆EndF(Dλ) with C≅D(n−1,1), there exists C⊆B⊆EndF(Dλ) with B≅D(n−1,1) a quotient of (D(n−2,1)↑Σn)/M. In particular, as (D(n−2,1)↑Σn)/M has only one composition factor isomorphic to D(n), we have that B is a quotient of D(n−2,1)↑Σn with B≅D(n−1,1) and not containing any submodule of the form D(n)∣D(n).
By the first part of the proof (S(n−1,1))∗⊆EndF(Dλ). Since D(n−1,1)⊆(S(n−1,1))∗ by Lemma 3.6, we can then conclude by Lemma 3.23.
∎
7 JS-partitions
We will now consider JS-partitions. Notice that from the definition of JS-partitions and from Lemma 2.9, a 2-regular partitions is a JS-partition if and only if it has only 1 normal node.
Also in this case we will need some case analysis. In this case results will be different from those obtained when λ has at least 2 normal nodes and results will depend on whether λ=(m+1,m−1) or not.
Lemma 7.1**.**
Let p=2 and n=2m≥4. Let λ=(n) be a JS-partition which satisfies dimHomΣn(S(n−1,1),EndF(Dλ))≥1. Then λ=(m+1,m−1) and dimHomΣn(S(n−1,1),EndF(Dλ))=1.
If m is odd S(n−1,1)⊆EndF(D(m+1,m−1)), while if m is even D(n−1,1)⊆EndF(D(m+1,m−1)).
Proof.
Assume that dimHomΣn(S(n−1,1),EndF(Dλ))≥1. As M(n−1,1) and D(n−1,1) are self-dual, from Lemma 4.10,
[TABLE]
Since λ is a JS-partition, it follows that
[TABLE]
In particular Dλ is contained exactly once in Dλ⊗M(n−1,1). Further by assumption Dλ is also contained in Dλ⊗(S(n−1,1))∗. So, by self-duality of M(n−1,1) and by Lemma 3.6,
[TABLE]
As Dλ is contained only once in Dλ⊗M(n−1,1) there then exists A⊆Dλ⊗M(n−1,1) with A=Dλ∣Dλ.
As λ is a JS-partition we have from Lemma 2.10 that εi(λ)=1 and εj(λ)=0 for some i and j=1−i. So ejDλ=0 from Lemma 2.2 and then from Lemma 4.11
[TABLE]
From the block decomposition of fieiDλ⊕fjeiDλ we then have that, up to isomorphism, A⊆fieiDλ.
Let ρ with Dρ≅e~iDλ≅eiDλ (from Lemma 2.2 as εi(λ)=1). Then A⊆fieiDλ≅fiDρ. In particular φi(ρ)≥2 from Lemmas 2.3(ii) and 2.7, that is φi(λ)≥1 from Lemma 2.7. Let π and ν with Dπ=f~iDλ and Dν=f~iφi(λ)Dλ. From Lemmas 3.3 and 3.4 we have
[TABLE]
As λ is has only 1 normal node it has 2 conormal nodes from Lemma 2.8. In particular φi(λ)≤2 and so φi(ρ)≤3 from Lemma 2.7. So, from the previous part, ρ has 2 or 3 conormal nodes of content i.
If φi(ρ)=2 then φi(λ)=1 and so π=ν. In this case, from Lemma 2.3,
[TABLE]
So in this case eiDπ=Dλ∣Dλ.
Assume now instead that φi(ρ)=3. As εi(π)=εi(λ)+1=2 from Lemma 2.7 and from Lemmas 2.2 and 2.3 we have in this case that
[TABLE]
So also in this case eiDπ=Dλ∣Dλ.
On the other hand if eiDπ=Dλ∣Dλ then
[TABLE]
So in this case Dλ⊆Dλ⊗(S(n−1,1))∗ and dimHomΣn(S(n−1,1),EndF(Dλ))≥1.
As n is even and λ is a JS-partition we have one of the following:
(i) the parts of λ are even and λ has an even number of parts,
(ii) the parts of λ are even and λ has an odd number of parts,
(iii) the parts of λ are odd and λ has an even number of parts.
We will now in each of the above cases check when eiDπ=Dλ∣Dλ holds and study this cases more in details. Notice that the conormal nodes of λ are those corresponding to nodes (h(λ),λh(λ)+1) and (h(λ)+1,1) (these nodes are always conormal and λ has only 2 conormal nodes).
(i) In this case the parts of λ are even and λ has an even number of parts,, so
[TABLE]
So i=1 (it is the residue of (1,λ1), as this is the only normal node). As the only conormal nodes are (h(λ),λh(λ)+1) and (h(λ)+1,1) and only the first of them has residue 1, we have that π=(λ1,…,λh(λ)−1,λh(λ)+1) in this case.
First assume that h(λ)≥4 or λ1>λ2+2. In this case π=(λ1−1,λ2,…,λh(λ)−1,λh(λ)+1) is 2-regular, as π is 2-regular, π=π∖(1,λ1) and
[TABLE]
(since in this case the parts of λ are all even and λ has an even number of parts). As π is 2-regular and is obtained from π by removing a normal node of residue 1 (the removable node in the first row is always normal), we have that Dπ is a composition factor of e1Dπ from Lemma 2.4. In particular in this case e1Dπ=Dλ∣Dλ.
If h=2 and λ1=λ2+2 then λ=(m+1,m−1) and π=(m+1,m). Also m is odd. In this case e1Dπ=Dλ∣Dλ as deg(Dπ)=2deg(Dλ) (Theorem 5.1 of [3]) and [e1Dπ:Dλ]=2 from Lemma 2.2(ii). From the previous part we have that Dλ⊗M(n−1,1)=f1e1Dλ⊕f0e1Dλ. Since Dλ and f0e1Dλ correspond to distinct blocks,
[TABLE]
from Lemmas 2.3(ii) and 2.7 and as (h(λ),λh(λ)+1) is the only conormal node of λ of residue 1. Further, from Lemma 3.6,
[TABLE]
it follows that [Dλ⊗(S(n−1,1))∗]=1 and [Dλ⊗D(n−1,1)]=0. In particular Dλ⊆Dλ⊗D(n−1,1) and so D(n−1,1)⊆EndF(Dλ) and
[TABLE]
The lemma then follows in the case where the parts of λ are even and λ has an even number of parts, as S(n−1,1)=D(n)∣D(n−1,1) from Lemma 3.6.
(ii) We next consider the case where the parts of λ are even and λ has an odd number of parts. In this case λ has at least 3 parts, since λ=(n) and it has an odd number of parts. Also
[TABLE]
In this case i=1 (i is the residue of the node (1,λ1)). As the conormal nodes of λ are (h(λ),λh(λ)+1) and (h(λ)+1,1) and only the second has residue 1, we have that π=(λ1,…,λh(λ),1) in this case. Let π=(λ1−1,λ2,…,λh(λ),1). Then π=π∖(1,λ1). As π is 2-regular and λ1≥λ2+2 (since λ has at least 3 parts and all parts of λ are even), so that π1>π2, we also have that π is 2-regular. As π=π∖(1,λ1) and (1,λ1) is normal of residue residue 1 in π, we have that Dπ is a composition factor of e1Dπ from Lemma 2.4. In particular eiDπ=Dλ∣Dλ.
(iii) Last we consider the case where the parts of λ are odd and λ has an even number of parts. In this case
[TABLE]
As in this case the residue of (1,λ1) is 0, we have that i=0. Further both conormal nodes of λ, (h(λ),λh(λ)+1) and (h(λ)+1,1), have residue 0. So π=(λ1,…,λh(λ)−1,λh(λ)+1). First assume that h(λ)≥4 or λ1>λ2+2. In this case π=(λ1−1,λ2,…,λh(λ)−1,λh(λ)+1) is 2-regular (the proof goes as in case (i), with the only difference that here all parts of λ are odd instead of even). So Dπ is a composition factor of e0Dπ from Lemma 2.4 and then e0Dπ=Dλ∣Dλ.
If h(λ)=2 and λ1=λ2+2 then λ=(m+1,m−1), π=(m+1,m) and ρ=(m,m−1). In this case m is even. Here e0Dπ=Dλ∣Dλ, from Theorem 5.1 of [3] and as [e0Dπ:Dλ]=2 (Lemma 2.2(ii)). In this case φ0(λ)=2, that is φ0(ρ)=3 and then
[TABLE]
from the computations in the first part of the proof and as e0Dπ=Dλ∣Dλ.
As
[TABLE]
and Dλ⊗M(n−1,1)≅f0e0Dλ⊕f1e0Dλ, with Dλ and f1e0Dλ corresponding to different blocks, it follows that
[TABLE]
In particular Dλ⊆Dλ⊗D(n−1,1) and so D(n−1,1)⊆EndF(Dλ), as
[TABLE]
Also
[TABLE]
The lemma then follows also in this case as S(n−1,1)=D(n)∣D(n−1,1).
∎
Lemma 7.2**.**
Let p=2, λ=(n) be a JS-partition and π=(λ1−1,λ2,λ3,…). Then Dλ↓Σn−1≅Dπ and π has exactly 2 normal nodes. The normal nodes of π are the removable nodes in the first two rows of π and they both have residue different than the normal node of λ.
Proof.
As λ is a JS-partition it has only 1 normal node from Lemma 2.10. So (1,λ1) is the only normal node of λ (as this node is always normal) and then Dλ↓Σn−1≅Dπ from Lemmas 2.1 and 2.2.
We will now prove that π has exactly 2 normal nodes. Notice that π has exactly as many parts as λ, as it is obtain from λ by removing a node on the first row and λ has more than one row, since λ=(n). Let (a1,…,ah) be the residues of the nodes at the end of each row of λ (which are all removal, as λ is 2-regular). As λ is a JS-partitions, so that its parts are either all even or either all odd from Lemma 2.10, it follows that (a1,…,ah(λ))=(i,j,i,j,…) with j=1−i. By definition the residues of the nodes at the end of each row of π are given by (b1,…,bh(λ))=(1−a1,a2,…,ah(λ))=(j,j,i,j,i,j,…). Let (c1,…,ch(λ)+1) be the residues of the addable nodes of π (with ck corresponding to the addable node on row k). Then ck=1−bk for k≤h(λ). For 3≤k≤h(λ) we have that
[TABLE]
and so the removable node on row k of π is not normal if k≥3. As
[TABLE]
the removable nodes on the first 2 rows of π are normal of residue j=1−i, where i is the residue of the normal node of λ. As π does not have any further normal node, the lemma holds.
∎
Corollary 7.3**.**
Let p=2 and λ=(n) be a JS-partition. Then
[TABLE]
Proof.
It follows from Lemmas 2.9 and 7.2.
∎
Lemma 7.4**.**
Let p=2 and n=2m≥6 with m odd and assume that λ=(n),(m+1,m−1) is a JS-partition. Then M⊆EndF(Dλ), where M is a quotient of D(n−2,1)↑Σn of one of the following forms:
D(n−2,2)∣D(n)∣D(n−1,1),
D(n)∣D(n−2,2)∣D(n)∣D(n−1,1).
Proof.
From Lemmas 3.12 and 3.13
[TABLE]
From Lemmas 3.5 and 3.6 we have that S(n−1,1)=D(n)∣D(n−1,1) is a quotient of D(n−2,1)↑Σn and so also of e0D(n−1,2). So
[TABLE]
From Lemmas 3.6 and 7.1 we have that D(n−1,1) is not contained in EndF(Dλ). Also from Lemma 3.8, M(n−2,1)=D(n−1)⊕D(n−2,1), so that M(n−2,1,1)=D(n−2,1)↑Σn⊕M(n−1,1). So, from Corollary 7.3,
[TABLE]
As
[TABLE]
with
[TABLE]
we have from Lemma 3.1 that
[TABLE]
From Lemma 7.1 we then have that one of
[TABLE]
is contained in EndF(Dλ). The lemma now follows since (e0D(n−1,1))/D(n−1,1) is a quotient of D(n−2,1)↑Σn.
∎
Lemma 7.5**.**
Let p=2 and n=2m≥8 with m even. Assume that λ=(n),(m+1,m−1) is a JS-partition. Then M⊆EndF(Dλ) with M a quotient of M(n−2,2) of one of the following forms:
M=D(n−2,2)∣D(n−1,1),
M=(D(n)⊕D(n−2,2))∣D(n−1,1).
Proof.
From Lemma 3.19 we have that
[TABLE]
Also from Lemma 3.20 we have that M(n−2,2)/D(n−1,1)≅D(n)⊕N,
where N=(D(n)⊕D(n−2,2))∣D(n−1,1)∼D(n−2,2)∣S(n−1,1). From Theorem 3.6 of [16] we have that
[TABLE]
In particular dimEndΣn−2,2(Dλ↓Σn−2,2)≥2. As λ=(n),(m+1,m−1) is a JS-partition and S(n−1,1)=D(n)∣D(n−1,1) (Lemma 3.6), we have from Lemma 7.1 that D(n−1,1)⊆EndF(Dλ). So
[TABLE]
The only non-zero quotients of N (which are also quotients of M(n−2,2)) are
[TABLE]
From Lemma 7.1 it follows that N or N/D(n) is a submodule of EndF(Dλ).
∎
We also need some results on the structure of EndF(Dλ↓Σn−1) for the case n≡0mod4. This will be used to show that no non-trivial irreducible tensor products of the form Dλ⊗D(m+1,m−1) exist when m is even.
Lemma 7.6**.**
Let p=2 and n=2m≥4 with m even. Assume that λ=(n) is a JS-partition. Let π=(λ1−1,λ2,λ3,…). Then D(n−2,1) is contained exactly once in EndF(Dπ) as a submodule.
Proof.
From Lemmas 2.9 and 7.2 we have that dimEndΣn−2(Dπ↓Σn−2)=2, as π has 2 normal nodes. From Lemma 3.8 it then follows that
[TABLE]
∎
Lemma 7.7**.**
Let p=2 and n=2m≥8 with m even. Assume that λ=(n) is a JS-partition. Let π=(λ1−1,λ2,λ3,…). Then M⊆EndF(Dπ), where M is a quotient of M(n−3,1,1) of one of the following forms:
M∼(D(n−1)⊕D(n−3,2))∣(D(n−1)⊕D(n−3,2)),
M=D(n−3,2)∣(D(n−1)⊕D(n−3,2)),
M=D(n−1)∣(D(n−1)⊕D(n−3,2)).
Proof.
From Lemma 2.10 there exist 0≤i≤1 and j=1−i with εi(λ)=1 and εj(λ)=0. From Lemma 7.2 we have that εi(π)=0 and εj(π)=2. So, from Lemmas 2.1 and 2.2, Dπ↓Σn−3=ejejDπ⊕eiejDπ. From the block decomposition of Dπ↓Σn−3 and Dπ↓Σn−3,2 it then also follows that Dπ↓Σn−3,2=ej2Dπ⊕N with N↓Σn−3=eiejDπ.
Using Lemmas 2.2 and 4.15 and considering the block decompositions of the modules we have
[TABLE]
Let
[TABLE]
with L⊆M(n−3,1,1) (see Lemma 3.15). Then, from Lemmas 3.8, 3.15 and 7.6,
[TABLE]
As the only quotients of L but not of its head are
[TABLE]
the lemma follows.
∎
Lemma 7.8**.**
Let p=2 and n=2m≥8 with m even. Then there exists M⊆EndF(D(m,m−1)) with M=D(n−1)∣(D(n−1)⊕D(n−3,2)) a quotient of M(n−3,1,1).
Proof.
From Lemmas 2.10 and 7.7 it is enough to show that D(n−3,2)⊆EndF(D(m,m−1)). From Lemma 3.8 it is then enough to prove that
[TABLE]
From Lemma 2.10 and 7.6 the nodes at the end of the 2 rows of (m,m−1) are normal. Both of these nodes have residue 1, as m is even. In particular, from Lemmas 2.1 and 2.2,
[TABLE]
Comparing degrees it follows from Theorem 5.1 of [3] that D(m,m−1)↓Σn−3≅e12D(m,m−1). Then, comparing the block decompositions of D(m,m−1)↓Σn−3 and of D(m,m−1)↓Σn−3,2, using Lemma 4.15 we have that
[TABLE]
As π has 2 normal nodes, from Lemma 2.9 we have that
[TABLE]
from which the lemma follows.
∎
Lemma 7.9**.**
Let p=2 and n=2m≥8 with m even. Assume that λ=(n) is a JS-partition with Dλ↓An irreducible. Let π=(λ1−1,λ2,λ3,…). Then M⊆EndF(Dπ), where M∼(D(n−1)⊕D(n−3,2))∣(D(n−1)⊕D(n−3,2)) or M=D(n−3,2)∣(D(n−1)⊕D(n−3,2)) is a quotient of M(n−3,1,1).
Proof.
From Lemma 7.7 it is enough to prove that if A=D(n−1)∣D(n−1) then A⊆EndF(Dπ). From Lemma 3.24 it is then enough to prove that 1↑An−1Σn−1⊆EndF(Dπ). If 1↑An−1Σn−1⊆EndF(Dπ) then
[TABLE]
and so Dπ↓An−1 splits. We will now show that this is impossible.
Assume instead that Dπ↓An−1 splits. From Theorem 1.1 of [3] we would then have that π2h+1−π2h+2≤2 and π2h+1+π2h+2≡2mod4 for h≥0. By definition of π we also have that λ2h+1−λ2h+2≤2 and λ2h+1+λ2h+2≡2mod4 for h≥1. As λ is a JS-partition all its parts are even or all its parts are odd by Lemma 2.10. By assumption π2=λ2>0 and π1=λ1−1. So π1−π2=1, that is λ1−λ2=2. As Dλ↓An does not splits we have from Theorem 1.1 of [3] that λ1+λ2≡2mod4. So λ1 is even and then this holds for all parts of λ. If λ3=0 then λ=(m+1,m−1), contradicting m and λ1 both being even. If λ3>0 then π4=π3−2 (as π3=λ3>λ4=π4 are both even and π3−π4≤2) and then π3+π4=λ3+λ4≡2mod4, contradicting the assumption that Dπ↓An−1 splits.
∎
8 Proof of Theorem 1.1
We are now ready to prove Theorems 1.1 and 1.2.
Proof of Theorem 1.1.
The theorem holds for n=2 (since Σ2 is abelian). So we can assume that n≥6. We will first prove that if λ,μ=(n),(m+1,m−1) then Dλ⊗Dμ is not irreducible. To do this let λ,μ=(n),(m+1,m−1). Then, from Lemmas 4.1, 5.2, 6.5 and 7.4, there exist M⊆EndF(Dλ) and N⊆EndF(Dμ), with M and N quotients of D(n−2,1)↑Σn of one of the following forms:
D(n−2,2)∣D(n)∣D(n−1,1)=A,
D(n)∣D(n−2,2)∣D(n)∣D(n−1,1)=B,
D(n−1,1)∣D(n)∣D(n−2,2)∣D(n)∣D(n−1,1)=C.
From Lemma 3.13 we have that
[TABLE]
From Lemma 3.12 it then follows that C≅e0D(n−1,2) (it is the only quotient of D(n−2,1)↑Σn with socle D(n−1,1) and 2 composition factors isomorphic to D(n−1,1)). From Lemma 2.2(i) we then have that C is self-dual. Also A and B are quotients of C (from their composition sequences as D(n−2,1)↑Σn is uniserial). Also from the self-duality of C it follows that D(n)∣D(n−2,2)∣D(n)⊆B is self-dual and this module contains D(n)∣D(n−2,2)=A∗/D(n−1,1).
If D(n)⊆M let M:=M, else let M:=M⊕D(n). Define N similarly. Since EndF(Dλ), EndF(Dμ) and D(n−2,1)↑Σn are self-dual, considering the possible combinations of M and N we obtain that
[TABLE]
In particular Dλ⊗Dμ is not irreducible.
We can now assume that λ=(m+1,m−1). From Theorem 3.1(b) of [10] we know that there are at most (m+1)/2 partitions λ for which Dλ⊗Dμ is irreducible. One of these is (n). As from Corollary 3.21 of [9] we have that D(m+1,m−1)⊗D(n−2j+1,2j+1)≅D(m−j,m−j−1,j+1,j) for 0≤j<(m−1)/2 the theorem follows.
∎
Proof of Theorem 1.2.
The theorem is easily checked for n=4, as there is only one irreducible representation of FΣ4 of degree larger than 1. So we can assume that n≥8. Let λ,μ=(n) be 2-regular partitions. From [8] we can assume that λ is a JS-partition.
Assume first that λ,μ=(m+1,m−1). We will now prove that in this case Dλ⊗Dμ is not irreducible. From Lemma 7.5 there exists M⊆EndF(Dλ) with M a quotient of M(n−2,2) such that M=D(n−2,2)∣D(n−1,1) or M=(D(n)⊕D(n−2,2))∣D(n−1,1). By Lemmas 4.2, 5.3, 6.6, 6.7 and 7.5 we also have that N⊆EndF(Dμ) with N=D(n−2,2) or with N=D(n−1,1)∣(D(n)⊕D(n−2,2))⊆M(n−2,2).
First assume that N=D(n−2,2). Then, from self duality of EndF(Dλ) and EndF(Dμ),
[TABLE]
In particular Dλ⊗Dμ is not irreducible.
Assume now that N=D(n−1,1)∣(D(n)⊕D(n−2,2)). From the structure of M(n−2,2) (see Lemma 3.19) and from its self-duality we have that M∗⊆N. If M=D(n−2,2)∣D(n−1,1) then
[TABLE]
If M=(D(n)⊕D(n−2,2))∣D(n−1,1) then
[TABLE]
In either case Dλ⊗Dμ is not irreducible.
Since D(n) is 1-dimensional, we can now assume that λ=(m+1,m−1) and μ=(n) is a 2-regular partition. Assume that Dλ⊗Dμ≅Dν is irreducible. From Lemma 7.1 we have that D(n−1,1)⊆EndF(Dλ). If μ is not a JS-partition, then D(n−1,1)⊆EndF(Dμ) from Lemmas 5.1 and 6.3, so that
[TABLE]
contradicting Dλ⊗Dμ being irreducible. So we can further assume that μ is a JS-partition.
For a 2-regular partition α let φα be the Brauer character of Dα. For any partition β let ξβ be the Brauer character of Mβ. For γ consisting only of odd parts and χ a Brauer character of Σn let χγ be the value that χ takes on the conjugacy class labeled by γ.
Let γ consists only of odd parts. From Theorem 5.1 of [3] and Theorem VII of [22] we have that φγ(m+1,m−1)=±2⌊(h(γ)−1)/2⌋. Assume now that φγ(m+1,m−1) is odd. Then h(γ)≤2 and so, since n=2m with m even, it follows that γ=(n−s,s) with 1≤s<m odd. Also notice that ξ(n−s,s)(n−k,k)=δs,k for 1≤s,k<m. Assume that Dλ⊗Dμ≅Dν and let 1≤s1<…<sr<m odd with φ(n−s,s)μ odd if and only if s=sl for some l. Define φ:=φμ+ξ(n−s1,s1)+…+ξ(n−sr,sr). Then, for each γ consisting only of odd parts, φγ(m+1,m−1)φγ is even. In particular φ(m+1,m−1)φ=2χ for some Brauer character χ, as irreducible Brauer characters are linearly independent modulo 2. Since φ(m+1,m−1)φμ=φν and the definition of φ, we then have that
[TABLE]
In particular
[TABLE]
for some 1≤l≤h. So ν has at most 4 parts, since Dν is a component of S(m+1,m−1)⊗M(n−sl,sl).
Notice that D(m+1,m−1) splits when reduced to An from Theorem 1.1 of [3]. As D(m+1,m−1)⊗Dμ≅Dν we then have that Dν also splits when reduced to An, while Dμ does not. Again from Theorem 1.1 of [3] and as ν at most 4 parts, ν=(a,a−b,c,c−d) with 1≤b,d≤2 and 2a−b,2c−d≡2mod4 or with c=d=0, 1≤b≤2 and 2a−b≡2mod4.
Assume first that c,d=0, 1≤b≤2 and 2a−b≡2mod4. Then b=2 as n is even and so ν=(m+1,m−1)=λ. As μ=(n) so that Dμ has degree at least 2 (as we are in characteristic 2), this gives a contradiction.
So 1≤b,d≤2 and 2a−b,2c−d≡2mod4. As ∣ν∣=2a+2c−b−d is even it follows b=d. If b=2 then from 2a−2,2c−2≡2mod4 it follows that a and c are odd. This would mean that ν is a JS-partition from Lemma 2.10 and so that D(m+1,m−1)↓Σn−1⊗Dμ↓Σn−1 is irreducible, which is impossible from [8] (D(m+1,m−1)↓Σn−1 and Dμ↓Σn−1 are both irreducible of degree at least 2). So b=d=1 and then ν=(m−s,m−s−1,s+1,s) for some 0≤s<(m−2)/2.
As m is even, so that
[TABLE]
we have that εi(ν)=2 and εj(ν)=0 and then dimEndΣn−1(Dν↓Σn−1)=2 from Lemma 2.9. Let π=(μ1−1,μ2,μ3,…). If D(m+1,m−1)⊗Dμ=Dν then
[TABLE]
from Lemma 7.2 and so
[TABLE]
We will show that this is impossible when μ is a JS-partition with Dμ↓An irreducible.
From Lemma 7.6 we have that D(n−2,1) is contained in EndF(D(m,m−1)) and in EndF(Dπ). From Lemmas 7.8 and 7.9 we have that there are modules M⊆EndF(D(m,m−1)) and N⊆EndF(Dπ) which are quotients of M(n−3,1,1) such that M=D(n−1)∣(D(n−1)⊕D(n−3,2)) and N∼(D(n−1)⊕D(n−3,2))∣(D(n−1)⊕D(n−3,2)) or N=D(n−3,2)∣(D(n−1)⊕D(n−3,2)).
Assume first that N∼(D(n−1)⊕D(n−3,2))∣(D(n−1)⊕D(n−3,2)). Then, from Lemma 3.15 and the self-duality of M(n−3,1,1), we have that M is a quotient of N≅N∗. So, from the structure of M and N,
[TABLE]
If N=D(n−3,2)∣(D(n−1)⊕D(n−3,2)) then, again by Lemma 3.15 and the self-duality of M(n−3,1,1), we have that there exists L=D(n−1)∣D(n−3,2) with L⊆M and L a quotient of N∗. Then, from the structure of L,
[TABLE]
In either case dimHomΣn−1(EndF(Dπ),EndF(D(m,m−1)))≥3, leading to a contradiction.
∎
Acknowledgements
The author thanks Christine Bessenrodt for suggesting the here studied question and for discussion and comments on the paper. The author also thanks the referee for comments and for pointing out reference [21].