\topmargin
=17pt \textwidth=17cm
\textheight=30cm \evensidemargin=0cm \oddsidemargin=0cm
Composition Factors of Tensor Products
of Symmetric Powers
Stephen Donkin and Haralampos Geranios
*Department of Mathematics, University of York, York YO10 5DD
[email protected], [email protected]
20 January 2015
Abstract
We determine the composition factors of the tensor product S(E)⊗S(E) of two copies of the symmetric algebra of the natural module E of a general linear group over an algebraically closed field of positive characteristic. Our main result may be regarded as a substantial generalisation of the tensor product theorem of Krop, [6], and Sullivan, [8] on composition factors of S(E). We earlier answered the question of which polynomially injective modules are infinitesimally injective in terms of the “divisibility index”. We are now able to give an explicit description of the divisibility index for polynomial modules for general linear groups of degree at most 3.
Introduction
This paper is a continuation of [4]. We are interested in the set of composition factors of the m-fold tensor product S(E)⊗m, of the symmetric algebra S(E) of the natural module E for the general linear group GLn(K) of degree n, over an algebraically closed field K of characteristic p>0. In [4] we related this to the set of composition factors of Sˉ(E)⊗m, where Sˉ(E) is the truncated symmetric algebra on E. The main result, Theorem 6.5, of [4], is an explicit description of the set of composition factors of Sˉ(E)⊗m. Here we use this, in the case m=2, to give an explicit description of the composition factors of S(E)⊗S(E). The description of a composition factor is as a twisted tensor product of “primitive” modules and may be regarded as a generalisation of the tensor product theorem of Krop, [6], and Sullivan, [8], on the composition factors of S(E).
The layout of the paper is the following. In Section 1 we record, in the general context, some properties of bounded, special and good partitions. Section 2 is the technical heart of the paper. In this we determine the (2,1)-special partitions. The importance for us is to have control over the composition factors of L⊗⋀jE, j≥0, where L is a composition factor of Sˉ(E)⊗Sˉ(E). The result, Theorem 2.10, is that a partition is (2,1)-special if and only if it has the form μ+ωs, for some s≥0, where μ is 2-special and ωs=1s for s≥1 and ω0=0. This is key to the tensor product description of a composition factor of S(E)⊗S(E) that we obtain in Section 3. The arguments of Section 2 are highly inductive and somewhat lengthy, involving repeated application of node removal from Young diagrams. In Section 3 we also give an explicit description, by highest weight, of the polynomial injective modules for GL3(K) which are injective on restriction to the first infinitesimal subgroup. This is obtained by combining a criterion from [3] with our description of the 2-good partitions, in the special case n=3.
1 Generalities on bounded, special and good partitions.
We use the notation and terminology of [4]. Thus K denotes an algebraically closed field of characteristic p>0. We write
E for the natural module for the general linear group GLn(K). We write S(E) for the symmetric algebra on E and Sˉ(E) for S(E)/I, where I is the ideal generated by xp, x∈E. Then GLn(K) acts naturally on S(E) and Sˉ(E) as algebra automorphisms.
We write Λ+(n) for the set of all partitions of length at most n and for λ∈Λ+(n) write L(λ) for the irreducible polynomial GLn(K)-module with highest weight λ. For 1≤m≤n we say that λ∈Λ+(n) is m-good (resp. m-special) if L(λ) is a composition factor of S(E)⊗m (resp. Sˉ(E)⊗m).
We use the notation En and Ln(λ) for E and L(λ) when we wish to emphasise the role of n.
We shall need some additional terminology.
Definition 1.1**.**
Let a,b≥0. We shall say that a partition λ is (a,b)-bounded if λa+1≤b.
Thus a partition λ is (a,b)-bounded if its diagram fits inside the diagram of a partition of the form rabs, for some r,s≥1.
For example, (1,1)-bounded partitions are hook partitions and (2,0)-bounded partitions are those with at most two rows. Note that in general a partition λ is (a,b)-bounded if and only if the transpose λ′ is (b,a)-bounded.
Definition 1.2**.**
We shall say that λ∈Λ+(n) is (a,b)-special (resp. good), with respect to n, if L(λ) is a composition factor of Sˉ(En)⊗a⊗⋀(En)⊗b (resp. S(En)⊗a⊗⋀(En)⊗b). Thus λ is m-special (resp. good) if
it is (m,0)-special (resp. good), with respect to n.
Remark 1.3**.**
Note for any weight λ of Sˉ(En)⊗a⊗⋀(En)⊗b we have λ1≤a(p−1)+b.
Proposition 1.4**.**
Let λ∈Λ+(n) be (a,b)-good (with respect to n). Then L(λ) is a composition factor of L(μ)⊗L(τ)F, for some (a,b)-special partition μ∈Λ+(n) and some a-good partition τ∈Λ+(n). In particular a restricted partition in Λ+(n) is (a,b)-good if and only if it is (a,b)-special.
Proof.
Since λ is (a,b)-good we have that L(λ) is a composition factor of S(En)⊗a⊗⋀(En)⊗b. Therefore there exist some a-good partition σ∈Λ+(n) such that [L(σ)⊗⋀(En)⊗b:L(λ)]=0. Now by [4] Proposition 2.8 (applied in the classical case) we have that since σ is a-good then L(σ) is a composition factor of L(ξ)⊗L(τ)F for some a-special partition ξ∈Λ+(n) and some a-good partition τ∈Λ+(n). Hence L(λ) is a composition factor of the tensor product (L(ξ)⊗⋀(En)⊗b)⊗L(τ)F and more precisely there exist a partition μ∈Λ+(n) with L(μ) be a composition factor of L(ξ)⊗⋀(En)⊗b such that [L(μ)⊗L(τ)F:L(λ)]=0. Since ξ is a-special it is clear that μ is (a,b)-special and so we are done. The result for the case where λ is restricted follows now directly from the above and using the fact that τ must be [math] in this case by [4], Lemma 3.1.
∎
We will use freely in the rest of the paper the fact that for a restricted partition λ∈Λ+(n) the notions of (a,b)-good and (a,b)-special coincide.
Lemma 1.5**.**
A partition μ is (a,b)-good if and only if we have [∇(λ):L(μ)]=0 for some (a,b)-bounded partition λ.
Proof.
This follows in the same way as [4], Lemma 2.2 using both versions of Pieri’s formula, [7], I, Chapter 5, (5.16), (5.17), this time.
∎
We denote by core(λ) the p-core of a partition λ. If λ,μ∈Λ+(n) are in the same block (i.e., the polynomial modules L(λ) and L(μ) for GLn(K) lie in the same block) then λ and μ have the same p-core, see e.g., [1]. Thus [∇(λ):L(μ)]=0 implies that core(λ)=core(μ). Using now Lemma 1.5 we have the following.
Corollary 1.6**.**
Let λ∈Λ+(n).
(i) If λ is (a,b)-good then core(λ) is (a,b)-good.
(ii) Suppose λ is a p-core. Then λ is (a,b)-good if and only if it is (a,b)-bounded.
It is easy to check the following stability result by the truncation arguments of [4], Section 3.
Proposition 1.7**.**
Fix a,b≥0 and let λ be an element of Λ+(n). Then λ is (a,b)-special (resp. good) if and only if λ is (a,b)-special (resp. good) when regarded as an element of Λ+(n′), n′≥n.
Definition 1.8**.**
In view of the proposition above we declare a partition λ to be (a,b)-special (resp. good) if it is (a,b)-special with respect to n, for n greater than or equal to the length of λ.
By the argument of (cf [4], Section 2, Lemma 2.4) we have the following result.
Lemma 1.9**.**
If λ is (a,b)-special (resp. good) and μ is (c,d)-special (resp. good) then λ+μ is (a+c,b+d)-special (resp. good).
On Sˉ(En) and ⋀(En) we have the forms Sˉ(En)×Sˉ(En)→L and ⋀(En)×⋀(En)→M, given by multiplication followed by projection onto the top component, where L=Ln((p−1)ωn) and M=Ln(ωn). Thus we have the product form (Sˉ(En)⊗a⊗⋀(En)⊗b)×(Sˉ(En)⊗a⊗⋀(En)⊗b)→N, where N=Ln((a(p−1)+b)ωn). For λ∈Λ+(n,r), with λ1≤a(p−1)+b, we define λ†=(a(p−1)+b)ωn−w0λ, where w0 is the longest element of Sym(n). The following is obtained as in the proof of Lemma 3.4 of [4].
Proposition 1.10**.**
(Reciprocity Principle) Let λ∈Λ+(n) with λ1≤a(p−1)+b. Then λ is (a,b)-special if and only if λ† is (a,b)-special.
Proposition 1.11**.**
Let n≥2 and a,b≥0. If λ=(λ1,…,λn) is an (a,b)-special (resp. good) partition then (λ1,…,λn−1) and (λ2,…,λn) are (a,b)-special (resp. good).
Proof.
We give the argument for (a,b)-good. The (a,b)-special case is similar. We put λˉ=(λ1,…,λn−1). Consider the natural module E=En for GLn(K). We have En=En−1⊕L, where L is the K-span of en (and En−1 is the K-span of e1,…,en−1). We regard H=GLn−1×GL1 as a subgroup of GLn(K), in the obvious way. Then En=En−1⊕L is an H-module decomposition. Since L(λ) is a composition factor of S(En)⊗a⊗⋀(E)⊗b it is a composition factor of SαEn⊗⋀βEn, for some sequences α=(α1,…,αa) and β=(β1,…,βb) with at most a and b parts. The H-module L(λ) has highest weight λ and so has (H-module) composition factor Ln−1(λˉ)⊗L1(λn).
For r,s≥0, Sr(E)=⨁r=r1+r2Sr1(En−1)⊗Sr2L and
⋀s(En)=⨁s=s1+s2⋀s1(En−1)⊗⋀s2L, as H-modules. It follows that
Ln−1(λˉ)⊗L1(λn) must be a composition factor of a module of the form Su1(En−1)⊗⋯⊗Sua(En−1)⊗⋀v1(En−1)⊗⋯⊗⋀vb(En−1)⊗M, for some u1,…,ua≥0. v1,…,vb≥0 and one dimensional GL1(K)-module M. Restricting to GLn−1(K) gives that λˉ is (a,b)-good.
The result for (λ2,…,λn) is obtained by restricting to GL1(K)×GLn−1(K) and arguing in the same way.
∎
Corollary 1.12**.**
Suppose λ∈Λ+(n) and λ1=a(p−1)+b. Then λ is (a,b)-special if and only if (λ2,…,λn) is (a,b)-special.
Proof.
Applying the reciprocity principle with respect to n we get that λ is (a,b)-special if and only if (a(p−1)+b)ωn−(λn,…,λ1) is (a,b)-special, i.e., if and only if (a(p−1)+b)ωn−1−(λn,…,λ2) is (a,b)-special. Now applying the reciprocity principle with respect to n−1 we see that this holds if and only if
(λ2,…,λn) is (a,b)-special.
∎
Bounded Modules
We remind to the reader that a filtration 0=V0≤V1≤⋯≤Vr=V of a finite dimensional polynomial GLn(K)-module V is said to be good if for each 1≤i≤r the quotient Vi/Vi−1 is either zero or isomorphic to ∇(λi) for some λi∈Λ+(n). For a polynomial GLn(K)-module V admitting a good filtration for each λ∈Λ+(n), the multiplicity
∣{1≤i≤r∣Vi/Vi−1≅∇(λ)}∣ is independent of the choice of the good filtration, and will be denoted (V:∇(λ)).
We fix a,b≥0.
Definition 1.13**.**
Let M be a finite dimensional polynomial module with a good filtration. We say that M is (a,b)-bounded if each λ∈Λ+(n) such that (M:∇(λ))=0 is (a,b)-bounded. We say that M is (a,b)-deficient if (M:∇(λ))=0 for every (a,b)-bounded element λ of Λ+(n).
Remark 1.14**.**
Note that if M is a finite dimensional polynomial module with a good filtration and character χ=∑λ∈Λ+(n)rλχ(λ) then M is (a,b)-bounded if λ is (a,b)-bounded whenever rλ=0 and M is a (a,b)-deficient if rλ=0 for all (a,b)-bounded λ. Here χ(λ) is the character of ∇(λ), i.e., the Schur function corresponding to the partition λ.
Lemma 1.15**.**
Let M be finite dimensional polynomial module with a good filtration and suppose that M is (a,b)-deficient. Then for every finite dimensional polynomial module V with a good filtration the polynomial module M⊗V is (a,b)-deficient.
Proof.
By the above remark it is enough to show that the coefficient of χ(λ) in the character of M⊗V is zero for all (a,b)-bounded
λ∈Λ+(n). It follows that it is enough to note that for λ,μ∈Λ+(n) with λ being not (a,b)-bounded
the coefficient of χ(τ) in χ(λ)χ(μ) is [math] for all (a,b)-bounded τ∈Λ+(n). So it is enough to show that for any symmetric function ψ in n variables ψχ(λ) is a Z-linear combination of Schur symmetric functions χ(τ) with τ not (a,b)-bounded. The ring of symmetric function is generated by the elementary symmetric functions er=χ(1r), for 1≤r≤n so it enough to show that each erχ(λ) is a sum of terms χ(τ), with τ not (a,b)-bounded. However, by Pieri’s formula erχ(λ) is a sum of terms χ(τ) where the diagram of τ is obtained by adding boxes to the diagram of λ, so the result is clear.
∎
As in [4], we write I(λ) for the injective indecomposable polynomial module corresponding to the partition λ. If λ∈Λ+(n) then we write In(λ) for this polynomial injective GLn(K)-module if we wish to emphasise the role of n.
Lemma 1.16**.**
Let λ∈Λ+(n). Then λ is (a,b)-good if and only if I(λ) is not (a,b)-deficient.
Proof.
We have that λ is (a,b)-good if and only if there exists some (a,b)-bounded partition μ such that [∇(μ):L(λ)]=0. By reciprocity, see e.g., [2], Section 4, (6), this is if and only if there exists an (a,b)-bounded partition μ such that (I(λ):∇(μ))=0, i.e., if and only if I(λ) is not (a,b)-deficient.
∎
We give some additional standard terminology.
Definitions 1.17**.**
We denote the length of a partition λ by len(λ). Let λ be a partition.
(i) We call a node R of λ (or more precisely the diagram of λ) removable if the removal of R from the diagram of λ leaves the diagram of a partition, which will be denoted λR. Thus the node R is removable node if it has the form (i,λi) for some 1≤i≤len(λ) and either i=len(λ) or
λi>λi+1.
(ii) An addable node A of λ is an element of N×N such that the addition of A to the diagram of λ gives the diagram of a partition, which will be denoted λA. Thus A is addable if it has the form (i,λi+1) for some 1≤i≤len(λ)+1 and either i=1 or λi−1>λi or A=(len(λ)+1,1).
(iii) The residue of a node A=(i,j) of a λ is defined to be the congruence class of i−j modulo p.
(iv) Let A and B be removable or addable nodes of λ. We shall say that A is lower than B if A=(i,r), B=(j,s) and i>j.
(v) We call a removable node R suitable if the residue of R is different from the residue of A for all lower addable nodes of λ.**
Lemma 1.18**.**
Let a,b≥0. Suppose that λ is a partition and R=(h,λh) is a suitable node. Then for all sufficiently large n we have:
(i) In(λ) is a direct summand of In(λR)⊗En;
(ii) if In(λR) is (a,b)-deficient then so is In(λ).
Furthermore if λ is (a,b)-good then so is λR.
Proof.
See the proof of Lemma 3.11 of [4].
∎
2 The determination of the (2,1)-special partitions.
We are interested in the (2,1)-special partitions. We first record the description of 2-special partitions obtained by taking m=2 in [4], Theorem 6.4. Recall that a partition is 1-special if and only if it has the form (p−1)ka, for some k≥0 and p−1>a≥0, see e.g., [4], 4.13 Remark. We split the description into the restricted and non-restricted cases. In order to cut down the number of special cases considered we assume now that p>2. This is harmless since the main result of this section, Theorem 2.10 is easily seen to hold also in the characteristic 2 case.
Lemma 2.1**.**
A restricted partition λ is 2-special if and only if has one of the following forms:
(i) λ=(p−2)kab with k≥0 and p−2>a≥b≥0;
*(ii) a sum of two 1-special partitions, i.e., we have
λ=(2(p−1))j(p−1+a)(p−1)kb,
with j,k≥0 and 0≤a,b≤p−2, if k≥1 and 0≤a≤b≤p−2 if k=0.*
Proposition 2.2**.**
*Let λ be a partition and write λ=λ0+pλˉ, with λ0 restricted. Then λ is 2-special and non-restricted if and only if
λ0=(p−2)kab, with k≥0, p−2>a≥b≥0 and λˉ=ωs, with s≥1.*
We now embark on the determination of the (2,1)-special partitions. In this section congruent will always mean congruent modulo p. Recall that partitions λ and μ of the same degree have the same p-core if and only if for each 0≤m<p the number of nodes of (the diagram of) λ of residue m is equal to the number of nodes of μ with residue m.
Lemma 2.3**.**
Let λ be a partition with first entry λ1≤p−1. Then λ is (2,1)-good if and only if it has the form (p−2)kab+ωr, for some k≥0, p−2>a≥b≥0 and r≥0.
Proof.
Certainly all these partitions are (2,1)-good by Lemma 1.9 since partitions of the form (p−2)kab are (2,0) good and ωr is (0,1)-good.
We claim now that a (2,1)-good partition λ with λ1≤p−1 has the required form. Certainly the result holds for partitions of length one or two so we may assume len(λ)≥3. Suppose len(λ)=3, λ=abc. If λ is a p-core we are done by Corollary 1.6. If λ is not a p-core then the edge length a+2 is at least p so that a=p−2 or p−1. If a=p−2 then λ has the required form. If a=p−1 again λ=(p−2,b−1,c−1)+ω3 has the required form.
We suppose that the result is false and that λ is a counterexample of minimal degree. Then the length n, say, of λ is at least 4. We set λ^=(λ1,…,λn−1), λ~=(λ2,…,λn). Thus we have λ^=(p−2)kab+ωr, for some k≥0 and p−2>a≥b≥0, r≥0, by Proposition 1.11 and the minimality assumption.
If k=0 then r=len(λ^)=n−1 and λn−1=1 so that λn=1 and λ=ab+ωn. Thus we have k>0 and so λ1=p−1 or p−2. Now λ~=(p−2)mcd+ωs, for some p−2>c≥d≥0 and m≥0 and s≥0. If λ1=p−1 then we have λ=(p−2)m+1cd+ωs+1, which has the required form.
Thus we may assume λ1=p−2 and λ^=(p−2)kab. Hence we have λ~=(p−2)mcd, with m>0, p−2>c≥d≥0 or λ~=ef+ωn−1, p−2>e≥f≥0. In the first case we have λ=(p−2)m+1cd, which has the required form. Thus we may assume that λ~=ef+ωn−1. This gives λn=1. Now if b=0 or a=b=0 then λ=(p−2)n−2a1 or λ=(p−2)n−11 respectively and both have the required form. Thus we may assume λ=(p−2)kab1, with b>0. If p=3 we must have λ=ωn, which has the required form. Thus we may assume p>3.
We now consider the case k=1, so λ=(p−2)ab1, p−2>a≥b≥1. If b=1 then λ=(p−3)(a−1)+ω4 which has the right form. Hence, we may assume that b>1. Then, λ has the removable node R=(1,p−2) with residue −3 and lower addable nodes to be found among (2,a+1), (3,b+1), (4,2), (5,1), with residues a−1, b−2, −2, −4. Since a=p−2 and b=p−1 we have that λR=(p−3)ab1 must be (2,1)-good, by Lemma 1.18 and this must be of the required form by minimality assumption. However, this is not the case since b>1 and so we have a contradiction.
We now consider the case k=2, so λ=(p−2)2ab1, p−2>a≥b≥1. If a=b=1 then λ=(p−3)2+ω5 and so it is of the right form. Thus we may assume a>1. Then, λ has the removable node S=(2,p−2) with residue −4 and lower addable nodes among (3,a+1), (4,b+1), (5,2), (6,1), with residues a−2, b−3, −3, −5. Since a=p−2 and b=p−1 we have that λS=(p−2)(p−3)ab1 must be (2,1)-good, by Lemma 1.18 and this must be of the required t form by minimality. However, this is not the case, since a>1, and so we have a contradiction.
Thus we have k≥3 and λ=(p−2)kab1. Then, λ has the removable node T=(k,p−2) with residue −k−2 and lower addable nodes among (k+1,a+1), (k+2,b+1), (k+3,2), (k+4,1), with residues a−k, b−k−1, −k−1, −k−3. Since a=p−2 and b=p−1 we have that λT=(p−2)k−1(p−3)ab1 must be (2,1)-good, by Lemma 1.18, and this must be of the required form by minimality. Once again this is not the case and we have a contradiction, so we are done.
∎
Lemma 2.4**.**
Let λ be a restricted partition with λ1=p. Then λ is (2,1)-good if and only if it has the form (p−1)ka+ωr for k≥1,r≥1, p−1>a≥0.
Proof.
Certainly all partitions of this form are (2,1)-good, by Lemma 1.18 and Lemma 2.1.
We now show that any (2,1)-good partition λ with λ1=p has the required form. We assume for a contradiction that this is not so and that λ is a counterexample of minimal degree. If λ has length one then λ cannot be restricted. If λ has length 2 then λ=(p,a), with 0<a≤p−1, so that λ=(p−1,a−1)+(1,1).
Let n=len(λ) and define
λ^=(λ1,…,λn−1) and λ~=(λ2,…,λn). Note that λ2<p for otherwise, by Lemma 1.11, we can write λ~=(p−1)ka+ωr and therefore λ=(p−1)k+1+ωr+1.
Now assume that len(λ)=3 so that λ=pab, for p−1≥a≥b≥1. If b=1 then λ=(p−1,a−1)+(1,1,1). So we have p−1≥a≥b≥2. If p=3 then λ=322 which obviously has the required form. So we may assume that p>3. Suppose b>2. The node R=(3,b) is suitable. However, λR=pa(b−1) does not have the required form, contrary to Lemma 1.18 and the minimality assumption. Hence we have λ=pa2 and it is easy to see that this is a core so that λ is not (2,1)-good by Corollary 1.6.
Thus we have n≥4. The node R=(n,λn) is suitable, so that we may write λR=(p−1)ka+ωr, for some k≥1, p−1>a≥0, 1≤r≤n. If r=1 then λn=a+1 and λ=(p−1)k(a+1)+ω1, which has the required form. Hence r>1 and so k=1, since λ2<p. Thus we have λR=(p−1)a+ωr, with r=n−1 or r=n. But r=n is impossible since λn−1≥λn so that λR=(p−1)a+ωn−1 and λ=(p−1)a+ωn, and we are done.
∎
We next treat the non-restricted partitions.
Lemma 2.5**.**
Let λ be a non-restricted partition with λ1≤2p−1. Then λ is (2,1)-special if and only if it has the form (p−2)kab+ωr+pωs, for some k≥0, p−2>a≥b≥0, r≥0 and s≥1.
Proof.
Certainly all partitions of this form are (2,1)-special by Lemma 1.9 since the partitions of the form (p−2)kab+pωs are 2-special, by Proposition 2.2 and ωr is (0,1)-special.
It is easy to see that if λ is a nonrestricted partition of length at most two and λ1≤2p−1 then λ has the required form.
Suppose for a contradiction that the lemma is false and that λ=μ+pωs is a partition of smallest length n, say, for which it fails and suppose among all partitions of length n, for which if fails, s is as small as possible. Thus we have n≥3. We now proceed in several steps.
Step 1 We have λ1<2p−1.
Suppose λ1=2p−1. Now λ~=(λ2,…,λn) is (2,1)-special, by Proposition 1.11. If λ~ is restricted then λ1−λ2≥p so that λ2≤p−1 and by Lemma 2.3 we have λ~=(p−2)kab+ωr, for some k≥0, p−2>a≥b≥0,r≥0. But then, λ1=2p−1 gives λ=(p−2)k+1ab+ωr+1+pω1. If λ~ is non-restricted then by the minimality of the length we have that λ~=(p−2)kab+ωr+pωs, for some k≥0, p−2>a≥b≥0,r≥0,s≥1. But then, λ1=2p−1 gives λ=(p−2)k+1ab+ωr+1+pωs+1.
Step 2. We have s≤n/2.
Suppose s>n/2. We apply the reciprocity principle with respect to n, as in Proposition 1.10.
Now λ† is (2,1)-special. We have
[TABLE]
Now n−s<s so by minimality so we have
[TABLE]
for some r,s≥0. So we have
[TABLE]
which has the required form.
Step 3. We have n≥4.
If not, we have n=3 and s=1, by Step 2. Thus we have λ=(a+p,b,c) with a≥b≥c≥0 and a≤p−2, by Step 1. We may remove a p-hook from the first
row of λ so the p-core of λ is the p-core of (a,b,c). Now the length of the edge of the diagram of (a,b,c) is a+2≤p. If a=p−2 then
(p+a,b,c)=(p−2,b,c)+pω1 and λ is no counterexample. So we may assume that a+2<p so that (a,b,c) is a p-core. Thus we have c≤1, by Corollary 1.6 (i). If c=0 then (p+a,b,c)=(a,b)+pω1 and λ is no counterexample. If c=1 then (p+a,b,c)=(a−1,b−1)+ω3+pω1 and λ is no counterexample.
Step 4. Conclusion.
Consider λ^=(λ1,…,λn−1). Then λ^ is (2,1)-special, by Proposition 1.11, so by minimality of length we have λ^=(p−2)kab+ωm+pωs, for some k,m≥0, s≥1 and p−2>a≥b≥0. By Steps 2 and 3 we have s<n−1 so that the length n−1 of λ^ is either m or the length of (p−2)kab. Moveover, k=0 or m=0 since λ1<2p−1 (by Step 1). If k=0 then m=n−1 and λn−1=1 which implies that λn=1 and hence λ=ab+ωn+pωs. So we can assume m=0. Thus we have λ^=(p−2)kab+pωs, with k>0 (since λ has length at least 4 by Step 3). If b=0 then λ is either (p−2)n−1λn+pωs or (p−2)n−2aλn+pωs and λ is no counterexample. Thus we can assume b>0 and λ=(p−2)n−3abλn+pωs and
[TABLE]
But λ~ is (2,1)-special . But this contradicts Lemma 2.3 if s=1 and the minimality of n if s>1.
∎
Proposition 2.6**.**
Let λ be a non-restricted partition with λ1≤2p−1. The following are equivalent:
(i) λ is (2,1)-special;
(ii) λ is (2,1)-good;
(iii) λ has the form (p−2)kab+ωr+pωs, for some k≥0, p−2>a≥b≥0 and s≥1.
Proof.
Certainly (i) implies (ii). Moreover, we have already seen that a partition of the form (p−2)kab+pωs, with k≥0, p−2>a≥b≥0, s≥1 is (2,0)-special. But ωr is (0,1)-special, for r≥0, and hence (p−2)kab+pωs+ωr is (2,1)-special. Thus (iii) implies (i). We also have, by Lemma 2.5, that (i) implies (iii).
So it remains to prove that (ii) implies (i). We assume that λ is (2,1)-good. Then L(λ) is a composition factor of L(θ)⊗L(τ)F, for some (2,1)-special partition θ and some 2-good partition τ, by Proposition 1.4. We write θ=α+pβ, for partitions α and β with α restricted.
If β=0 then λ=θ+pτ. Also, we have τ1≤1 since λ1≤2p−1. If τ1=0 then λ=θ, which is (2,1)-special. If τ1=1 then θ1≤p−1 and so λ is (2,1)-special by Lemmas 2.3 and 2.5.
If β=0 then θ has the form (p−2)kab+ωr+pωs, for some k≥0, p−2>a≥b≥0,r≥0,s≥1 by Lemma 2.5. Moreover, L(λ) is isomorphic to L(α)⊗L(γ)F for some partition γ such that L(γ) is a composition factor of L(β)⊗L(τ). Since λ1≤2p−1 we must have γ1≤1 so that γ=ωt for some t≥1 and we are done.
∎
We continue with the analysis of restricted (2,1)-good partitions.
Lemma 2.7**.**
Let λ be a restricted partition with p<λ1<2p−2. Then λ is (2,1)-good if and only if it has the form (p−1)ka+(b)+ωr, for some k≥1, p−1>a≥0, p−1>b>0, r≥0, with r>0 if b=1.
Proof.
Certainly all partitions of the given form are (2,1)-good, by Lemma 1.9 and Lemma 2.1.
There are no partitions of length one satisfying the hypotheses. If λ has length 2 then λ=(p+b,c), with 0<b<c≤p−1 and we may write λ=(p−1,c)+(b)+ω1.
We now consider the case in which λ has length 3. Then λ=(p+b)cd with 1≤b<c≤p−1 and 1≤d≤c≤p−1 or λ=(p+b)(p+c)d with 0≤c≤b<p−2, b=0 and 0≤c<d≤p−1.
Assume first that λ=(p+b)cd. If d=1 then λ=(p−1)(c−1)+(b)+ω3 and so has the right form. If c=p−1 then λ=(p−1)2d+(b)+ω1 and again has the right form. Hence we may assume that 2≤d≤c≤p−2 and 1≤b≤c≤p−2. If λ is a p-core then since λ3=d≥2 we get that λ is not a (2,1)-special partition, by Corollary 1.6. Therefore, we may assume that λ is not a p-core. Hence we can remove at least one p-hook from the diagram of λ. Since c≤p−2 and b<c this p-hook must involve boxes from the first two rows or boxes from all the three rows of λ. If we can remove a p-hook involving boxes only from the first two rows of λ then the resulting partition is (c−1,b+1,d) and since c≤p−2 this is a core, so that core(λ)=(c−1,b+1,d). Again, since d≥2 we get that λ is not a (2,1)-special partition, by Corollary 1.6. If the p-hook that we remove involves boxes from all the rows of λ then the resulting partition has the form (c−1,d−1,b+2) and since c≤p−2 this is a core, so that core(λ)=(c−1,d−1,b+2). But this has third part at least 2 and so is not (2,1)-good, by Corollary 1.6.
We now consider the situation in which λ=(p+b)(p+c)d with 0≤c<b<p−2 and 0≤c<d≤p−1. If c=0 then λ=(p−1)2d+(b)+ω2 and so has the right form. Hence, we may assume that c>0 (so d>1) and we prove that λ is not (2,1)-special. Assume for a contradiction that it is. Then by the reciprocity principle, Proposition 1.10, we have that λ†=(2p−1)ω3−w0λ=(2p−1−d)(p−1−c)(p−1−b) is (2,1)-special. If d=p−1 then λ†=(p,p−1−c,p−1−b) with 1<p−1−b≤p−1−c<p−1 and so we get a contradiction by Lemma 2.4. Thus, we may assume that 1<d<p−1 and so λ† is a restricted partition of the form (p+e)fg with 1≤e<p−2. Hence, by the previous paragraph, it can be written in the form (p−1)ka+(h)+ωr for k≥1,h≥1,r≥1,0≤a<p−1. Since p−1−c<p−1 we have that the length of λ is achieved by ωr and so r=3. In particular we have p−1−b=1 and so b=p−2 which contradicts the assumption on b. Therefore, λ is not (2,1)-special and we are done.
Now assume, for a contradiction, that the result is false, and let λ be a counterexample of minimal degree. Note that λ has length at least 4 by the above. We set λ^=(λ1,…,λn−1) and λ~=(λ2,…,λn). We divide the rest of the proof up into four cases.
Case 1. λn=1 and λn−1=p.
We have λ^=(p−1)ka+(b)+ωr for some k≥1, 0≤a≤p−2, 0<b≤p−2 and r≥0. If r=n−1 then λ=(p−1)ka+(b)+ωn has the required form, so we assume r<n−1. Hence the length n−1 of λ^ is achieved from the partition (p−1)ka so that k=n−2, 0<a<p−1 or k=n−1.
Suppose that k=n−2 so that λ=(p−1)n−2a1+(b)+ωr. If r=n−2 then λ=(p−1)n−2(a−1)+(b)+ωn, which has the required form. If r=n−3 and a=1 then λ=(p−1)n−3(p−2)+(b)+ωn, which again has the required form. So we may assume r<n−2 and it is not the case that r=n−3 and a=1.
Now λ=(p−1)n−2a1+(b)+ωr has the removable node R=(n−2,p−1) with residue −n+1 and lower addable nodes (n−1,a+1), (n,2), (n+1,1) with residues −n+a+2, −n+2, −n. Since a=p−1 we get, from Lemma 1.18, that λR=(p−1)n−3(p−2)a1+(b)+ωr has the required form. But this happens only in the case a=1, r=n−3, which we have already dealt with.
Suppose k=n−1. Then we have λ^=(p−1)n−1+(b)+ωr and r<n−1. Then λ=(p−1)n−11+(b)+ωr has the required form.
Case 2. λn=1 and λn−1=p.
Then λ has the removable node S=(n−1,p), which has residue −n+1 and lower addable nodes (n,2) and (n+1,1), with residues −n+2 and −n. From Lemma 1.18 we get that λS is (2,1)-good and so we may write
λS=(p−1)ka+(b)+ωr, with k≥1
with p−1>a≥0, p−1>b>0, r≥0. Since λn−1=p we must have k≥n−2.
Suppose k=n−2. Then a=p−2, r=n so that
[TABLE]
and λ=(p−1)n−1+(b)+ωn has the required form.
Suppose k=n−1. Then λS=(p−1)n−1a+(b)+ωr. We note that r<n−1 since λn−1=p. Hence a=λn=1, λS=(p−1)n−11+(b)+ωr. If r=n−2 we get λ=(p−1)n−1+(b)+ωn, which is of the required form. However, we can not have r<n−2 since then λS=(p−1)n−11+(b)+ωr would give λn−2=p−1, λn−1=p.
Case 3. λn>1 and, for T=(n,λn), the partition λT is restricted.
In this case we have λT=(p−1)ka+(b)+ωr, for some k≥1, p−1>a≥0, 0<b<p−1 and r≥0. Note that we have λn−1≥2 and hence k≥n−2.
Suppose k=n−2. Then we have r=n and λ=(p−1)n−2a1+(b)+ωn If a=p−2 we can write λ=(p−1)n−12+(b)+ωn−2, in the required form. So we may assume a<p−2. Now λ has the removable node U=(n−2,p) with residue −n+2 and lower addable nodes (n−1,a+2), (n,3) and (n+1,1) with residues −n+a+3, −n+3 and −n. If follows from Lemma 1.18 that λU=(p−1)n−3(p−2)a1+(b)+ωn has the required form. But this is so only if a=p−2, a case we have already excluded. So we have a contradiction.
Suppose now that k=n−1 so that λT=(p−1)n−1a+(b)+ωr. Then we have λ=(p−1)n−1(a+1)+(b)+ωr, which has the required form.
Suppose finally that k=n. Then λT has the form (p−1)n+(b)+ωr. But then λn is at least p and this is not possible since λ is restricted.
Case 4. λn>1 and for T=(n,λn) the partition λT is non-restricted.
We must have that λn−1=λn+p−1. Then λ has the removable node V=(n−1,λn−1) with residue −n+λn and lower addable nodes (n,λn+1) and (n+1,1) with residues −n+λn+1 and −n. From Lemma 1.18 we get that λV is expressible in the form (p−1)ka+(b)+ωr. But then we get λn−2≤p and λn−1=λn+p−1>p, a contradiction.
This completes the proof.
∎
Lemma 2.8**.**
Let λ be a restricted (2,1)-good partition with λ1=2p−2. Then λ has the form (p−1)ka+(p−1)mb, with k,m≥1, p−1>a≥0, p−1>b≥0, or the form (p−1)ka+(p−2)+ωr, with k≥1 and p−1>a≥0, r≥1.
Proof.
As usual we remark that by earlier results, Lemma 1.9 and Lemma 2.1, all partitions of the given form are (2,1)-good.
We now suppose that λ is (2,1)-good restricted partition with λ1=2p−2 and we show that λ has the form. This is vacuously true for partitions of length one. Moreover, if λ has length 2 then λ=(2p−2,p−1)=(p−1,p−1)+(p−1) and so is of the right form. So, we now assume λ has length at least 3. We write n for the length of λ.
Assume first that λn>1. Then we consider the partition λ†. Since λ1=2p−2 we have that λ† is restricted. Moreover λ† has first entry less than 2p−2 and λ† is (2,1)-special by Proposition 1.10. The first entry of λ† is 2p−1−λn and this is at least p as λn<p (as λ is restricted).
Then, by Lemmas 2.4 and 2.7 we have λ†=(p−1)ka+(b)+ωr, with k≥1, p−1>a≥0, b,r≥0 and either b or r nonzero. Since λ=(λ†)† we have
[TABLE]
and, since λ1=2p−2, we easily conclude that λ has the required form.
Now suppose that the result is false and that λ is a counterexample of minimal degree. We know that the length n of λ is at least 3 and λn=1.
Suppose n=3. Then we have either
[TABLE]
or
[TABLE]
and λ has the required form.
Now suppose the length of n=4. Thus we may write λ=(2p−2,p−1+a,b,1), with 0≤a≤p−1 and p≥b≥1. If a=p−1 then b=p or p−1 (since λ is restricted) and then
[TABLE]
or
[TABLE]
and so has the required form. So we have p−1>a. So λ has the removable node R=(1,2p−2) which has residue −3 and lower addable nodes (2,p+a), (3,b+1), (4,2), (5,1) with residues a−2, b−2, −2, −4. Either we may apply Lemma 1.18 or b=p−1. In the latter case we have
[TABLE]
which has the required form. So we map apply Lemma 1.18 to get that
[TABLE]
is (2,1)-good. By Lemma 2.4 for p=3 and Lemma 2.7 for the general case we get that this is only possible if a=0,b=1 or a=1,1≤b≤p. For the first case we get that λR=(2p−3,p−1,1,1) and so
[TABLE]
and so it has the right form. In the second case we have that λR=(2p−3,p,b,1) and so
[TABLE]
and again has the required form. Thus we have n≥5. We divide the remainder of the proof into two cases. We set λ^=(λ1,…,λn−1).
Case 1. λ^ is restricted.
There are two possibilities: (i) λ^=(p−1)ka+(p−1)lb, for some k,l≥1, p−1>a,b≥0; and (ii) λ^=(p−1)mc+(p−2)+ωr, for some m≥1, p−1>c≥0, r≥1. We consider these separately.
Suppose we are in the situation (i). We may assume k≥l. If k,l≥3 then we must have λ~=(p−1)ud+(p−1)ve for some u,v≥1 and then λ=(p−1)u+1d+(p−1)v+1e has the required form. Suppose now that k≥3, l=1. Then k=n−2 or n−1. If k=n−1 then λ=(p−1)n−11+(p−1)b, which has the required form. So we assume k=n−2 so that λ=(p−1)n−2a1+(p−1)b with a=λn−1. We first suppose that n=5. Then λ=(p−1)3a1+(p−1)b. If a=b=1 then
[TABLE]
and has the required form. Hence we may assume that a,b are not simultaneously equal to 1. Then, λ has the removable node R=(3,p−1), with residue −4 and lower addable nodes (4,a+1), (5,2), (6,1), with residues a−3, −3, −5. Thus we may apply Lemma 1.18 to deduce that λR=(p−1)2(p−2)a1+(p−1)b is (2,1)-good and so by minimality of the degree of λ it must have the required form. This happens only if a=b=1 and we have already excluded this case. We now suppose that n>5. Thus, λ has the removable node S=(n−2,p−1), with residue −n+1 and lower addable nodes (n−1,a+1), (n,2), (n+1,1), with residues −n+a+2, −n+2, −n. Thus we may apply Lemma 1.18 to deduce that λS=(p−1)n−3(p−2)a1+(p−1)b is (2,1)-good. But it does not have the required form, contradicting the minimality of the degree of λ.
This leaves the possibility l=2, which we consider now. Thus we have λ^=(p−1)n−2a+(p−1)2b (again as above we may exclude the case k=n−1 for then λ has the required form). We first suppose n=5. So, λ=(p−1)3a1+(p−1)2b. If p=3 then λ=(4,4,3,1,1) or λ=(4,4,2,1,1). For the first case we have that core(λ)=(4,2,2,1,1) and for the second that core(λ)=(3,2,2,1,1) and so in either case λ is not (2,1)-special. Thus, we may assume that p>3. We have the removable node T=(2,2p−2) with residue −4 and lower addable nodes (3,p+b), (4,a+1), (5,2), (6,1) with residues −3+b, a−3, −3, −5. Applying Lemma 1.18 we get that λT=(2p−2,2p−3,p−1+b,a,1) is (2,1)-special. This does not have the required form and we have a contradiction to the minimality of λ. We now suppose n>5. We write λ=(p−1)n−2a1+(p−1)2b. Then λ has the removable node U=(n−2,p−1) with residue −n+1 and lower addable nodes (n−1,a+1), (n,2), (n+1,1) with residues −n+a+2, −n+2, −n. By Lemma 1.18 , λU=(p−1)n−3(p−2)a1+(p−1)2b is (2,1)-special and so must have the required form. This happens only if r=n−3 and c=1 but then λ=(p−1)n−3(p−2)+(p−2)+ωn and has also the required form. So we are done.
We now move on to possibility (ii). So λ^=(p−1)mc+(p−2)+ωr. If r=n−1 then λ=(p−1)mc+(p−2)+ωn has the required form. Suppose now that r=n−2 then λ^=(p−1)n−2c+(p−2)+ωn−2 and we must have c=λn−1>0. Hence we have λ=(p−1)n−2(c−1)+(p−2)+ωn and λ has the required form. So we have λ=(p−1)n−2c1+(p−2)+ωr, with r<n−2. Thus λ has the removable node V=(n−2,p−1) with residue −n+1 and addable nodes (n−1,c+1), (n,2), (n+1,1) with residues −n+c+2, −n+2, −n. Applying Lemma 1.18 we get that λV=(p−1)n−3(p−2)c1+(p−2)+ωr is (2,1)-special. But this is not of the required form, contradicting the minimality of λ.
Case 2. λ^ is not restricted.
We must have λn−1=p. Thus λ has the removable node W=(n−1,p) with residue −n+1 and lower addable nodes (n,2), (n+1,1) with residues −n+2, −n. Applying Lemma 1.18 we get that λW is (2,1)-good. There are two possibilities: λW=(p−1)ka+(p−1)lb, with k≥l≥1, p−1>a,b≥0; λW=(p−1)mc+(p−2)+ωr, with m≥1, r≥1. We consider these cases separately.
In the first case, from λn−1=p, it follows that λW=(p−1)n−11+(p−1)n−2 and that λ=(p−1)n−11+(p−1)n−21, which has the required form.
In the second case we have λW=(p−1)mc+(p−2)+ωr. Since λn−2≥λn−1=p we must have m,r≥n−2. Also, m=n, since λn=1. If m=n−2 then λ=(p−1)n−2(p−2)+(p−2)+ωn, which has the required form. If m=n−1 then r=n−2 (since λn−1=p) so that λW=(p−1)n−1c+ωn−2 and λ=(p−1)n−1c+ωn−1, which has the required form.
∎
Lemma 2.9**.**
Let λ be a restricted (2,1)-good partition with λ1=2p−1. Then λ has the form (p−1)ka+(p−1)mb+ωr, with k,m≥1, p−1>a≥0, p−1>b≥0.
Proof.
Since λ is restricted its length n is at least 2. Suppose the result is false and that λ is a counterexample of minimal length. Consider λ~=(λ2,…,λn). We have λ2≥p (since λ1=2p−1 and λ is restricted). Hence, by Lemmas 2.4, 2.7, 2.8 and the minimality of length, we have λ^=(p−1)ka+(p−1)mb+ωr for some k,m,r≥0 and p−1>a≥0, p−1>b≥0 and hence λ=(p−1)k+1a+(p−1)m+1b+ωr+1.
∎
Most of the preceding results can be summarised in the following simple statement. We assume now that p is any prime.
Theorem 2.10**.**
A partition λ is (2,1)-special if and only if λ1≤2p−1 and λ has the form
μ+ωs for some 2-special partition μ and some s≥0.
Proof.
For p>2 this follows from Lemmas 2.3 to 2.9 and Remark 1.3.
Suppose now p=2. Suppose that λ is a (2,1)-special partition. Then L(λ) is a composition factor of L(μ)⊗⋀sE for some 2-special partition μ and s≥1. But then μ1≤2p−2=2, by Remark 1.3. Now L(μ)⊗⋀sE has unique highest weight μ+ωs and so λ≤μ+ωs, which gives λ1≤2p−2+1=3. But now the fact that λ1≤3 gives that λ may be written ωa+ωb+ωc for some a,b,c≥0. Moreover, ωa+ωb is 2-special, e.g., by [4], Theorem 6.5 so that λ has the required form.
Conversely, suppose that λ is a partition of the form μ+ωs, for some 2-special partition μ and s≥0. Then λ is (2,1)-special by Lemma 1.9.
∎
Symmetric Groups
We can use the analysis above to give a precise description of the simple modules for symmetric groups that appear as composition factors of Specht modules Sp(μ), with μ a (2,1)-bounded partition. For the relation between the polynomial representations of GLn(K) and the representations of the symmetric groups via the Schur functor we refer the reader to chapter 6 of [5]. Here we consider partitions of degree r with r≤n.
We set Dλ=fL(λ), where f is the Schur functor, for λ restricted. For λ a regular partition we write Dλ for the head of Sp(λ). The relationship between the two labelings of the irreducible modules for symmetric groups is given by Ksgn⊗Dλ=Dλ′ for λ regular and Ksgn the sign module, by [5], (6.4l). Moreover for a partition μ we have that f∇(μ)=Sp(μ), see [5] section 6.3, and by applying the Schur functor to a composition series of ∇(μ) one obtains [∇(μ):L(λ)]=[f∇(μ):fL(λ)]=[Sp(μ):Dλ], for a restricted partition λ.
Corollary 2.11**.**
Let λ be a restricted partition. Then Dλ occurs as composition factor of a Specht module Sp(μ), for some (2,1)-bounded partition μ, if and only if λ can be written in the form (p−2)kab+ωs for some k≥0, p−2>a≥b≥0, s≥0 or (p−1)ka+(p−1)mb+ωs, with p−1>a≥0, p−1>b≥0, s≥0.
Corollary 2.12**.**
Let λ be a regular partition. Then Dλ occurs as composition factor of a Specht module Sp(μ), for some (1,2)-bounded partition μ, if and only if λ′ can be written in the form (p−2)kab+ωs for some k≥0, p−2>a≥b≥0, s≥0 or (p−1)ka+(p−1)mb+ωs, with p−1>a≥0, p−1>b≥0, s≥0.
3 The 2-good partitions
In this section we describe the 2-good partitions. We work over an algebraically closed field K of arbitrary positive characteristic p.
Definition 3.1**.**
(i) A partition will be called a beginning term if it has the form (p−2)kab, for some k≥0, p−2≥a≥b≥0.
(ii) A partition will be called a middle term if it is not a beginning term but has the form λ+ωr for some beginning term λ and r≥1.
(iii) A partition will be called an end term if it is restricted, not 2-special and can be written in the form λ+ωr for some 2-special partition λ and r≥1.
Definition 3.2**.**
We call a partition λ primitive if either:
(i) λ is a restricted 2-special partition; or
(ii) λ can be written of the form,
λ=λ0+pλ1+⋯+pmλm for some m>0 and partitions λ0,…,λm such that λ0 is a beginning term, λ1,…,λm−1 are middle terms and λm is an end term.
We will say that the primitive partition is of index [math] in the first case and of index m in the second.
Definition 3.3**.**
We define the set of standard partitions to be the smallest set of partitions such that:
(i) all primitive partitions are standard; and
(ii) a partition λ is standard if it has the form μ+pm+1τ for some primitive partition μ of index m and a standard partition τ.
Thus a standard partition λ has the form
[TABLE]
for some k≥0, where each λ(i) is a primitive partition and where mi is the index of λ(i) for 0≤i<k.
Remark 3.4**.**
Note that, by [4], Theorem 6.5, any 2-special partition is standard.
We check that standard partitions have the following unique readability property.
Lemma 3.5**.**
Suppose for a partition λ=0 we have
[TABLE]
where all μ(i),τ(j) are primitive, μ(k)=0=τ(l) and μ(i) has index mi and τ(j) has index nj, for 0≤i<k, 0≤j<l.
Then we have k=l and μ(i)=τ(i) for 0≤i≤k.
Proof.
We consider the base p expansion
[TABLE]
(where each λh is restricted and λN=0).
If λ0 is not a beginning term then we must have μ(0)=λ0=τ(0) and
[TABLE]
and we obtain inductively that k−1=l−1, so that k=l, and μ(i)=τ(i), for all i.
Thus we may assume that λ0 is a beginning term. Suppose that λh is also a beginning term for some 0<h≤N. Then for some 0≤s≤k, 0≤t≤l, we have
[TABLE]
Thus we have inductively s=t, μ(i)=τ(i) for 0≤i≤s. In particular we have μ(0)=τ(0) and m0=n0. Subtracting μ(0)=τ(0) from λ and dividing by pm0+1 we thus obtain
[TABLE]
and by induction obtain k=l, μ(i)=τ(i), 1≤i≤k.
So we may assume that no λh, with h>0, is a beginning term. This implies that all μ(i),τ(j), with i>0, j>0, are restricted 2-special partitions.
If k=0 then λ=μ(0). If m0=0 then λ=λ0 and the result is clear. If m0>0 then λN is an end term. Hence λN is an end term of some τ(j) and since there is only one beginning term, namely λ0, we must have j=0 and λ=τ(0), l=0. Thus we may assume k>0 and, for the same reason, that l>0.
Thus we have that μ(i) is 2-special for 0<i≤k and τ(j) is 2-special for 0<j≤l. We thus have μ(k)=λN=τ(l) and
[TABLE]
Again we obtain inductively that k−1=l−1, so k=l, and μ(i)=τ(i), for all 0≤i≤k.
∎
An irreducible module will be called primitive of index m (resp. standard) if it has the form L(λ), where λ is primitive of index m (resp. standard).
We now come to the main result of the paper, which gives a precise description of the irreducible modules that occur as a composition factor of a tensor product of symmetric powers of the natural module.
Theorem 3.6**.**
A partition is 2-good if and only if it is standard.
Proof.
Here good will mean 2-good and special will mean 2-special.
We first show that any standard partition is good. Suppose λ is a standard partition and write λ=α+pm+1μ, with α primitive of index m and μ standard. We may assume inductively that μ is good. If m=0 we get immediately that λ=α+pμ is good, from [4], Corollary 2.9(ii). Suppose now m>0 and write α=α0+pα1+…+pmαm with α0 a beginning term, α1,…,αm−1 middle terms and αm an end term. We write αi=βi+ωri, with βi a beginning term, ri≥1, for 1≤i≤m−1. We write αm=βm+ωrm, with βm restricted and special and rm≥1. Now α0+pωr1,β1+pωr2,…,βm−1+pωrm are special, by [4], Theorem 6.5, and
βm is special so that μ is good. Thus by [4], Corollary 2.9(ii), every composition factor of
[TABLE]
is good. But this module has highest weight λ and so λ is good.
We now show the converse. An irreducible good module is a composition factor of
[TABLE]
for some h≥0 and special partitions μ(0),…,μ(h), by [4], Corollary 2.9(ii). We consider the set S of all sequences μ=(μ(0),μ(1),…) of special partitions, with μ(j)=0 for j≫0. For μ=(μ(0),μ(1),…)∈S we define the module
[TABLE]
and the partition
[TABLE]
The result will be proved if we establish the claim that every composition factor of V(μ), for μ∈S, is standard. Assume, for a contradiction,that the claim is false and that μ∈S is such that f(μ) has minimal degree subject to the condition that V(μ) has a non-standard composition factor. We denote by N a non-standard composition factor.
Note that for ν=(0,0,…) we have V(ν)=L(0), which is standard, and so μ=(0,0,…).
Let λ=μ(0). Suppose that λ is restricted. Let τ=(μ(1),μ(2),…)∈S. Then we have V(μ)=L(λ)⊗V(τ)F. Then N is a composition factor of L(λ)⊗MF, for some composition factor M of V(τ). By the minimality of μ, we have M=L(σ), for standard partition σ and hence, by Steinberg’s tensor product theorem
N=L(λ+pσ), which is standard.
Thus λ is not restricted and, by Proposition 2.2, we may write λ=λ0+pωr, with λ0 a beginning term and r≥1. Setting θ=μ(1) we now have
[TABLE]
where Z=L(ωr)⊗L(θ) and ξ=(μ(2),μ(3),…)∈S.
Hence N is a composition factor of L(λ0)⊗Z1F⊗V(ξ)F2, for some composition factor Z1 of Z. By Theorem 2.10, Z1 has the form L(σ+ωs), for some special partition σ and s≥0.
The argument now divides into three cases.
Case (i) : σ is not restricted.
By [4], Theorem 6.5, we have σ=σ0+pωt, for some beginning term σ0 and t≥1. Thus N is a composition factor of L(λ0)⊗L(σ0+ωs)F⊗UF, where
[TABLE]
with ϕ=(pωt,μ(2),μ(3),…). Hence N is a composition factor of L(λ0)⊗L(σ0+ωs)F⊗PF, for some composition factor P of V(ϕ). By the minimality of μ we have P=L(γ), for some standard partition γ. We may write γ=α+pm+1β, with α primitive of index m and β standard. Moreover, since V(ϕ)=(L(ωt)⊗V(ξ))F, we have that α is divisible by p.
If m=0 then α is restricted and hence [math] so that P=L(β)F and so N=L(λ0)⊗L(σ0+ωs)F⊗L(β)F2. If σ0+ωs is not special then it is an end term and L(λ0)⊗L(σ0+ωs)F is primitive of index 1 and N=L(λ0)⊗L(σ0+ωs)F⊗L(β)F2 is standard. If σ0+ωs is special then both λ0 and σ0+ωs are restricted and special, β is standard and so N=L(λ0)⊗L(σ0+ωs)F⊗L(β)F2 is standard.
Assume now that m>0 and write α=α0+pα1+⋯+pmαm, with α0 a beginning term, α1,…,αm−1 middle terms and αm an end term. Since α is divisible by p, we have α0=0. Hence we have
[TABLE]
If σ0+ωs is a beginning term then (σ0+ωs)+pα1+⋯+pmαm is primitive of index m and so L(σ0+ωs)⊗L(α1)F⊗⋯⊗L(αm)Fm⊗L(β)Fm+1 is standard. Hence
[TABLE]
is standard.
If σ0+ωs is not a beginning term then it is a middle term so λ0 is a beginning term, σ0+ωs,α1,…,αm−1 are middle terms and αm is an end term so that
[TABLE]
is primitive of index m+1 and hence δ+pm+2β is standard, i.e., N is standard.
Case (ii) : σ is restricted and σ+ωs is restricted.
Now N is a composition factor of L(λ0)⊗L(σ+ωs)F⊗V(ξ)F2 and so N=L(λ0)⊗L(σ+ωs)F⊗QF2 for some composition factor Q of V(ξ). By minimality of μ we have Q=L(γ) for some standard partition γ.
If σ+ωs is special then λ0 and σ+ωs are restricted special so that λ0+p(σ+ωs)+p2γ is standard, i.e., N is standard.
If σ+ωs is not special then it is an end term and λ0+p(σ+ωs) is primitive of index 1 and so λ0+p(σ+ωs)+p2γ is standard, i.e., N is standard.
Case (iii) : σ is restricted but σ+ωs is not.
Thus we have σ1≥p−1 and so, by [4], Theorem 6.5, σ=(p−1)uc+(p−1)vd, for some u,v≥0, p−1>c≥0, p−1>d≥0. It is not difficult to check that, since σ is restricted and σ+ωs is not, we can write σ=(p−1)ka+(p−1)s and σ+ωs=(p−1)ka+pωs, with k≥0, p−1>a≥0. Hence N is a composition factor of
[TABLE]
where ζ=(p−1)ka. Thus N has the form L(λ0)⊗L(ζ)F⊗LF2, where L is a composition factor of L(ωs)⊗V(ξ). Thus LF is a composition factor of L(pωs)⊗V(ξ)F and, by minimality of μ, we must have LF=L(δ), for some standard δ. We write δ=α+pm+1β, where α is primitive of index m and β is standard.
If m=0 then, since L(δ)=LF, we have α=0. Thus we have N=L(λ0)⊗L((p−1)ka)F⊗L(β)F2, i.e., N=L(η), where η=λ0+pζ+p2β. Now λ0 and ζ are restricted special and β is standard so that η is standard, i.e., N is standard.
So we may suppose m>0. We write α=α0+pα1+⋯+pmαm, with α0 a beginning term, α1,…,αm−1 middle terms and αm an end term. Since L(α)⊗L(β)Fm+1 is LF we must have α0=0. Hence we have
[TABLE]
Recall that ζ=(p−1)ka. If k=0 then ζ is a beginning term. Also, α1,…,αm−1 are middle terms and αm is an end term. Hence ϵ=ζ+pα1+⋯+pmαm is primitive of index m and therefore ϵ+pm+1β is standard. Hence ν=λ0+p(ϵ+pm+1β) is standard, i.e., N=L(ν) is standard.
If k>0 then ζ=(p−1)ka is a middle term. Thus λ0 is a beginning term, ζ,α1,…,αm−1 are middle terms and αm is an end term so that γ=λ0+pζ+p2α1+⋯+pm+1αm is primitive of index m+1 and γ+pm+2β is standard, i.e., N is standard.
Expressing this in terms of modules and bearing in mind the uniqueness statement, Lemma 3.5, we get the following result.
Theorem 3.7**.**
A composition factor L of the tensor product S(E)⊗S(E), of two copies of the symmetric algebra of the natural GLn(K)-module E has the form
[TABLE]
for some k≥0 and primitive partitions λ(0),…,λ(k)∈Λ+(n), where mi is the index of λ(i), for 0≤i<k. Moreover, if L is non-trivial there is a unique such expression, with λ(k)=0. Further every irreducible module of the above form occurs as a composition factor.
∎
Remark 3.8 Recall from [3], that the divisibility index div.ind(V), of a non-zero polynomial GLn(K)-module V is the largest integer k such that V≅V′⊗D⊗k, for some polynomial module V′. Here D denotes the one dimensional module afforded by the determinant representation. We call V critical if div.ind(V)=0.
If V is not critical then div.ind(V)=div.ind(V⊗D∗)+1.
For λ∈Λ+(n) we write div.ind(λ) for the divisibility index of the injective envelope I(λ) of L(λ) in the category of polynomial modules. We call λ critical if I(λ) is critical.
We now take n=3. (The case n=2 was considered in [3], Section 5.) Then, by [3], Lemma 3.9, λ is critical if and only if L(λ) is a composition factor of S(E)⊗S(E), i.e., if and only if λ is 2-good. Thus, from Theorem 3.7, we have an explicit description of the critical partitions λ∈Λ+(3), i.e., λ is critical if and only if for some k≥0 we have
[TABLE]
for primitive λ(i)∈Λ+(3), 0≤i≤k, where λ(i) has index mi, for 0≤i<k.
Thus, by [3], Theorem 4.1, we may describe all λ∈Λ+(3) such that the restriction of I(λ) to the first infinitesimal subgroup G1 of GL3(K) is injective. This amounts to the following:
I(λ) is injective as a G1-module if and only if either:
(i) λ10≥2p−2; or
(ii) p−2≤λ10<2p−2 and λˉ is not critical; or
(iii) λ10<p−2, λˉ and λˉ−ω3 are not critical.
Here we are writing λ=λ0+pλˉ, with λ0 restricted and λˉ∈Λ+(3).
Acknowledgement
The second author gratefully acknowledges the financial support of EPSRC Grant EP/L005328/1.