\topmargin
=17pt \textwidth=17cm
\textheight=30cm \evensidemargin=0cm \oddsidemargin=0cm
Composition Factors of Tensor Products
of Truncated Symmetric Powers
Stephen Donkin and Haralampos Geranios
*Department of Mathematics, University of York, York YO10 5DD
[email protected], [email protected]
10 July 2015
Abstract
Let G be the general linear group of degree n over an algebraically closed field K of characteristic p>0. We study the m-fold tensor product Sˉ(E)⊗m of the truncated symmetric algebra Sˉ(E) of the symmetric algebra S(E) of the natural module E for G. We are particularly interested in the set of partitions λ occurring as the highest weight of a composition factor of
Sˉ(E)⊗m. We explain how the determination of these composition factors is related to the determination of the set of composition factors of the m-fold tensor product S(E)⊗m of the symmetric algebra. We give a complete description of the composition factors of Sˉ(E)⊗m in terms of “distinguished” partitions.
Our main interest is in the classical case, but since the quantised version is essentially no more difficult we express our results in the general context throughout.
Introduction
Let K be an algebraically closed field of characteristic p>0. The problem of finding the irreducible characters of a connected reductive group G over K is one of the main problems of representation theory. In characteristic [math] the solution to this problem is enshrined in
Weyl’s character formula (see e.g. [20], II, Chapter 5) and for the general linear group in the theory of Schur symmetric functions (see e.g. [16], , Section 3.5).
The problem in positive characteristic is often formulated in terms of the determination of decomposition numbers, i.e, the determination of the multiplicity of the simple module L(μ), of highest weight μ, as a composition factor of the induced module ∇(λ), of highest weight λ.
In this paper we concentrate on the case G=GLn(K), the general linear group of degree n, over K. We are interested in the tensor product Sλ(E)=Sλ1(E)⊗⋯⊗Sλm(E), of symmetric powers of the natural module E. For fixed degree r, the formal characters of the modules Sλ(E) are related to the formal characters of the ∇(μ) (the Schur symmetric functions) by a certain known unitriangular matrix (the transpose of the Kostka matrix, see e.g., [22], Section 6, Table 1, entry (2,4)). Hence, the decomposition number problem would be solved if one could determine the composition factor multiplicities of the modules Sλ(E). So this is a very important (and of course difficult) problem. Here, and in related work, we address the problem of determining the set of composition factors of Sλ(E).
Let m be a positive integer. Our method is to analyse first the tensor product of m truncated symmetric powers and then to use this to analyse the tensor product of m symmetric powers. Here we give an exposition of the general approach via the truncated symmetric powers. For general m, we give a complete list of the composition factors of Sˉ(E)⊗m in terms of “distinguished” partitions. One consequence of this description is that this list is also the list of composition factors L(λ) of S(E)⊗m for partitions λ with first part at most m(p−1). In particular, for m=n, the composition factors of Sˉ(E)⊗n are the partitions of length at most n with first part at most n(p−1).
As an immediate application of our approach we recover the tensor product theorem of Krop, [21] and Sullivan, [25]. This describes the composition factors of the symmetric powers of the natural module. Further, in our companion paper, [13], we obtain a direct analogue for the composition factors of a tensor product of two symmetric powers, [13], Theorem 4.6.
Moreover, with the methods used here and in [13], we obtain an application to the representation theory of the symmetric groups: specifically we
determine which irreducible modules occur as composition factors of Specht modules labelled by partitions with third row length at most one, [13], Corollary 2.11.
Apart from its relevance to the modular character problem we have some other motivation for the consideration of tensor products of symmetric powers coming from our earlier work. In [12] we studied the problem of which polynomial injective modules are injective on restriction to the first infinitesimal subgroup G1 and we gave a solution to this problem in terms of the “index of divisibility” of a polynomially injective module, [12], Theorem 4.1. The divisibility index, in turn, is determined by the set of composition factors of S(E)⊗(n−1), [13], Lemma 3.9.
An explicit solution to the problem of finding all polynomially and infinitesimally injective modules would also resolve the sticking point of the paper by De Visscher and the first author, [10], Conjecture 5.2.
The results of this paper are also used in our recent work, [14]. There we study the invariants of Specht modules for a symmetric group under the action of a smaller symmetric group. At a certain point (in the proof of [14], Lemma 2.1) we use some of the theory developed here to analyse these invariants and give a counterexample to a Conjecture of D. Hemmer, from [18], in each characteristic.
The layout of the paper is the following. Section one is preliminary and we use it to establish notation for the standard combinatorics and polynomial representation theory and connections with Hecke algebras that we shall need. In Section 2 we describe our approach to composition factors of tensor products of symmetric powers of E, via the truncated symmetric powers. In Section 3 we deal with a reciprocity principal for decomposition numbers. This section also contains some technical results on removal of a row or a node from a partition such that the corresponding simple modules occurs as a composition factor of Sˉ(E)⊗m. These principles are used repeatedly in our determination of the composition factors.
In Section 4 we determine for which restricted partitions the corresponding irreducible module occurs as a composition factor of Sˉ(E)⊗m, via the Mullineux involution on regular partitions. In Section 5 we introduce distinguished partitions and describe some of their properties. In Section 6 we complete the determination of the composition factors of Sˉ(E)⊗m.
Our main interest is in the classical case, but since the quantised version is essentially no more difficult we express our results in the general context throughout.
1 Preliminaries
1.1 Combinatorics
The standard reference for the polynomial representation theory of
GLn(K) is the monograph [16]. Though we work in the quantised context this reference is appropriate as the combinatorics is essentially the same and we adopt the notation of [16] wherever convenient. Further details may also be found in the monograph, [9], which treats the quantised case.
We begin by introducing some of the associated combinatorics. By a partition we mean an infinite sequence λ=(λ1,λ2,…) of nonnegative integers with λ1≥λ2≥… and λj=0 for j sufficiently large. If m is a positive integer such that λj=0 for j>m we identify λ with the finite sequence (λ1,…,λm). The length len(λ) of a partition λ=(λ1,λ2,…) is [math] if λ=0 and is the positive integer m such that λm=0, λm+1=0, if λ=0. For a partition λ, we denote by λ′ the transpose partition of λ. We write P for the set of partitions. Let λ∈P. We define the degree of λ=(λ1,λ2,…) by deg(λ)=λ1+λ2+⋯.
We fix a positive integer n. We set X(n)=Zn. There is a natural partial order on X(n). For λ=(λ1,…,λn),μ=(μ1,…,μn)∈X(n), we write λ≤μ if λ1+⋯+λi≤μ1+⋯+μi for i=1,2,…,n−1 and λ1+⋯+λn=μ1+⋯+μn. We shall use the standard Z-basis ϵ1,…,ϵn of X(n), where ϵi=(0,…,1,…,0) (with 1 in the ith position), for 1≤i≤n. We write
ωi for the element ϵ1+⋯+ϵi of X(n), for 1≤i≤n. We denote the element ωn=(1,…,1) simply by ω. We write Λ(n) for the set of n-tuples of nonnegative integers.
We write X+(n) for the set of dominant n-tuples of integers, i.e., the set of elements λ=(λ1,…,λn)∈X(n) such that λ1≥⋯≥λn.
We write Λ+(n) for the set of partitions into at most n-parts, i.e., Λ+(n)=X+(n)⋂Λ(n). We shall sometimes refer to elements of Λ(n) as polynomial weights and to elements of Λ+(n) as polynomial dominant weights. For a nonnegative integer r we write Λ+(n,r) for the set of partitions of r into at most n parts, i.e., the set of elements of Λ+(n) of degree r.
We write Sym(r) for the symmetric group on {1,2,…,r}. The symmetric group W=Sym(n) acts naturally on X(n). We write w0 for the longest element of W, i.e., the element such that w0λ=(λn,…,λ1), for λ=(λ1,…,λn)∈X(n).
We fix a positive integer l. A partition λ=(λ1,λ2,…) is l-regular if there is no positive integer i such that λi=λi+1=⋯=λi+l−1>0. We write Preg for the set of l-regular partitions and Preg(r) for the set of l-regular partitions of degree r.
We write X1(n) for the set of l-restricted partitions into at most n parts, i.e., the set of elements λ=(λ1,…,λn)∈Λ+(n) such that 0≤λ1−λ2,…,λn−1−λn,λn<l. Note that an element λ∈Λ+(n) belongs to X1(n) if and only if λ′ is an l-regular partition.
A dominant weight λ∈X+(n) has a unique expression λ=λ0+lλˉ with λ0∈X1(n), λˉ∈X+(n), moreover if λ∈Λ+(n) then λˉ∈Λ+(n). We shall use this notation a great deal in what follows.
1.2 Rational Modules and Polynomial Modules
Let K be a field. If V,W are vector spaces over K, we write V⊗W for the tensor product V⊗KW. We shall be working with the representation theory of quantum groups over K. By the category of quantum groups over K we understand the opposite category of the category of Hopf algebras over K. Less formally we shall use the expression “G is a quantum group” to indicate that we have in mind a Hopf algebra over K which we denote K[G] and call the coordinate algebra of G. We say that ϕ:G→H is a morphism of quantum groups over K to indicate that we have in mind a morphism of Hopf algebras over K, from K[H] to K[G], denoted ϕ♯ and called the co-morphism of ϕ. We will say H is a quantum subgroup of the quantum group G, over K, to indicate that H is a quantum group with coordinate algebra K[H]=K[G]/I, for some Hopf ideal I of K[G], which we call the defining ideal of H. The inclusion morphism i:H→G is the morphism of quantum groups whose co-morphism i♯:K[G]→K[H]=K[G]/I is the natural map.
Let G be a quantum group over K. The category of left (resp. right) G-modules is the the category of right (resp. left) K[G]-comodules. We write Mod(G) for the category of left G-modules and mod(G) for the category of finite dimensional left G-modules. We shall also call a G-module a rational G-module (by analogy with the representation theory of algebraic groups). A G-module will mean a left G-module unless indicated otherwise. For a finite dimensional G-module V the dual space V∗=HomK(V,K) has a natural G-module structure.
For a finite dimensional G-module V and a non-negative integer r we write V⊗r for the r-fold tensor product V⊗V⊗⋯⊗V and write V⊗−r for the dual of V⊗r.
Let V be a finite dimensional G-module with structure map τ:V→V⊗K[G]. The coefficient space cf(V) of V is the subspace of K[G] spanned by the “coefficient elements” fij, 1≤i,j≤m, defined with respect to a basis v1,…,vm of V, by the equations
[TABLE]
for 1≤i≤m. The coefficient space cf(V) is independent of the choice of basis and is a subcoalgebra of K[G].
We fix a positive integer n. We shall be working with G(n), the quantum general linear group of degree n, as in [9]. We fix a non-zero element q of K.
We have a K-bialgebra A(n) given by generators cij, 1≤i,j≤n, subject to certain relations (depending on q) , as in [9], 0.20. The comultiplication map δ:A(n)→A(n)⊗A(n) satisfies δ(cij)=∑r=1ncir⊗crj and the augmentation map ϵ:A(n)→K satisfies ϵ(cij)=δij (the Kronecker delta), for 1≤i,j≤n. The elements cij will be called the coordinate elements and we define the determinant element
[TABLE]
Here sgn(π) denotes the sign of the permutation π. We form the Ore localisation A(n)dn. The comultiplication map A(n)→A(n)⊗A(n) and augmentation map A(n)→K extend uniquely to K-algebraic maps A(n)dn→A(n)dn⊗A(n)dn and A(n)dn→K, giving A(n)dn the structure of a Hopf algebra. By the quantum general linear group G(n) we mean the quantum group over K with coordinate algebra K[G(n)]=A(n)dn.
We write T(n) for the quantum subgroup of G(n) with defining ideal generated by all cij with 1≤i,j≤n, i=j. We write B(n) for quantum subgroup of G(n) with defining ideal generated by all cij with 1≤i<j≤n. We call T(n) a maximal torus and B(n) a Borel subgroup of G(n) (by analogy with the classical case).
We now assign to a finite dimension rational T(n)-module its formal character. We form the integral group ring ZX(n). This has Z-basis of formal exponentials eλ, which multiply according to the rule eλeμ=eλ+μ, λ,μ∈X(n). For 1≤i≤n we define cˉii=cii+IT(n)∈K[T(n)], where IT(n) is the defining ideal of the quantum subgroup T(n) of G(n). Note that cˉ11…cˉnn=dn+IT(n), in particular each cˉii is invertible in K[T(n)]. For λ=(λ1,…,λn)∈X(n) we define cˉλ=cˉ11λ1…cˉnnλn. The elements cˉλ, λ∈X(n), are group-like and form a K-basis of K[T(n)].
For λ=(λ1,…,λn)∈X(n), we write Kλ for K regarded as a (one dimensional) T(n)-module with structure map τ:Kλ→Kλ⊗K[T(n)] given by τ(v)=v⊗cˉλ, v∈Kλ. For a finite dimensional rational T(n)-module V with structure map τ:V→V⊗K[T(n)] and λ∈X(n) we have the weight space
[TABLE]
Moreover, we have the weight space decomposition V=⨁λ∈X(n)Vλ.
We say that λ∈X(n) is a weight of V if Vλ=0.
The dimension of a finite dimensional vector space V over K will be denoted by dimV.
The character chV of a finite dimensional rational T(n)-module V is the element of ZX(n) defined by
chV=∑λ∈X(n)dimVλeλ.
For each λ∈X+(n) there is an irreducible rational G(n)-module Ln(λ) which has unique highest weight λ and such λ occurs as a weight with multiplicity one. The modules Ln(λ), λ∈X+(n), form a complete set of pairwise non-isomorphic irreducible rational G-modules.
Note that for λ=(λ1,…,λn)∈X+(n) the dual module Ln(λ)∗ is isomorphic to Ln(λ∗), where λ∗=(−λn,…,−λ1). For a finite dimensional rational G(n)-module V and λ∈X+(n) we write [V:Ln(λ)] for the multiplicity of Ln(λ) as a composition factor of V.
We write Dn for the one dimensional G(n)-module corresponding to the determinant. Thus Dn has structure map τ:Dn→Dn⊗K[G], given by τ(v)=v⊗dn, for v∈Dn.
Thus we have Dn=Ln(ω)=Ln(1,1,…,1). We write En for the natural G(n)-module. Thus En has basis e1,…,en, and the structure map τ:En→En⊗K[G(n)] is given by τ(ei)=∑j=1nej⊗cji. We also have that En=Ln(1,0,…,0).
A finite dimensional G(n)-module V is called polynomial if cf(V)≤A(n). The modules Ln(λ), λ∈Λ+(n), form a complete set of pairwise non-isomorphic irreducible polynomial G(n)-modules. We write In(λ) for the injective envelope of Ln(λ) in the category of polynomial modules. We have a grading A(n)=⨁r=0∞A(n,r) in such a way that each cij has degree 1. Moreover each A(n,r) is a finite dimensional subcoalgebra of A(n). The dual algebra S(n,r) is known as the Schur algebra. A finite dimensional G(n)-module V is polynomial of degree r if cf(V)≤A(n,r). We write pol(n) (resp. pol(n,r)) for the full subcategory of mod(G(n)) whose objects are the polynomial modules (resp. the modules which are polynomial of degree r).
For an arbitrary finite dimensional polynomial G(n)-module we may write V uniquely as a direct sum V=⨁r=0∞V(r) in such a way that V(r) is polynomial of degree r, for r≥0. Let r≥0. The modules Ln(λ), λ∈Λ+(n,r), form a complete set of pairwise non-isomorphic irreducible polynomial G(n)-modules which are polynomial of degree r. We write mod(S) for the category of left modules for a finite dimensional K-algebra S. The category
pol(n,r) is naturally equivalent to the category mod(S(n,r)). It follows in particular that, for λ∈Λ+(n,r), the module In(λ) is a finite dimensional module which is polynomial of degree r.
We shall also need modules induced from B(n) to G(n). (For details of the induction functor Mod(B(n))→Mod(G(n)) see, for example, [8].) For λ∈X(n) there is a unique (up to isomorphism) one dimensional B(n)-module whose restriction to T(n) is Kλ. We also denote this module by Kλ. The induced module indB(n)G(n)Kλ is non-zero if and only if λ∈X+(n). For λ∈X+(n) we set ∇n(λ)=indB(n)G(n)Kλ. Then ∇n(λ) is finite dimensional and its character is the Schur symmetric function corresponding to λ. The G(n)-module socle of ∇n(λ) is Ln(λ). The module ∇n(λ) has unique highest weight λ and this weight occurs with multiplicity one. For λ∈X+(n) we take as a definition of the Weyl module Δn(λ) the dual module ∇n(−w0λ)∗. Thus ∇n(λ) and Δn(λ) have the same character.
A filtration 0=V0≤V1≤⋯≤Vr=V of a finite dimensional rational G(n)-module V is said to be good if for each 1≤i≤r the quotient Vi/Vi−1 is either zero or isomorphic to ∇n(λi) for some λi∈X+(n). For a rational G(n)-module V admitting a good filtration for each λ∈X+(n), the multiplicity
∣{1≤i≤r∣Vi/Vi−1≅∇n(λ)}∣ is independent of the choice of the good filtration, and will be denoted (V:∇n(λ)).
For λ,μ∈X+(n) we have ExtG(n)1(∇n(λ),∇n(μ))=0 unless λ>μ. Given Kempf’s Vanishing Theorem, [9], Theorem 3.4, this follows exactly as in the classical case, e.g., [4], Lemma 3.2.1 (or the original source [3], Corollary (3.2)). It follows that if V has a good filtration
0=V0≤V1≤⋯≤Vt=V with sections Vi/Vi−1≅∇n(λi), 1≤i≤t, and μ1,…,μt is a reordering of the λ1,…,λt such that μi<μj implies that i<j then there is a good filtration 0=V0′<V1′<⋯<Vt′=V with Vi′/Vi−1′≅∇n(μi), for 1≤i≤t.
Similarly it will be of great practical use to know that
ExtG(n)1(∇n(λ),∇n(μ))=0 when λ and μ belong to different blocks. Here the relationship with cores of partitions diagrams (discussed later) will be crucial for us. For a partition λ we denote by [λ] the corresponding partition diagram (as in [16]). The l-core of [λ] is the diagram obtained by removing skew l-hooks, as in [19]. If λ,μ∈Λ+(n,r) and [λ] and [μ] have different l-cores then the simple modules Ln(λ) and Ln(μ) belong to different blocks and it follows in particular that ExtS(n,r)i(∇(λ),∇(μ))=0, for all i≥0. A precise description of the blocks of the q-Schur algebras was found by Cox, see [2], Theorem 5.3.
For λ∈Λ+(n) the module In(λ) has a good filtration and we have the reciprocity formula (In(λ):∇n(μ))=[∇n(μ):Ln(λ)] see e.g., [8], Section 4, (6).
1.3 The Frobenius Morphism
It will be important for us to make a comparison with the classical case q=1. In this case we will write G˙(n) for G(n) and write xij for the coordinate element cij, 1≤i,j≤n. In this case we write L˙n(λ) for the G˙-module Ln(λ), λ∈X+(n), and write E˙n for En.
We return to the general situation. If q is not a root or unity, or if K has characteristic [math] and q=1 then all G(n)-modules are completely reducible, see e.g., [8], Section 4, (8). We therefore assume from now on that q is a root of unity and that if K has characteristic [math] then q=1. Also, from now on, l is the smallest positive integer such that 1+q+⋯+ql−1=0.
Now we have a morphism of Hopf algebras θ:K[G˙(n)]→K[G(n)] given by θ(xij)=cijl, for 1≤i,j≤n. We write F:G(n)→G˙(n) for the morphism of quantum groups such that F♯=θ. Given a G˙(n)-module V we write VF for the corresponding G(n)-module. Thus, VF as a vector space is V and if the G˙(n)-module V has structure map τ:V→V⊗K[G˙(n)] then VF has structure map (idV⊗F)∘τ:VF→VF⊗K[G(n)], where idV:V→V is the identity map on the vector space V.
For an element ϕ=∑ξ∈X(n)aξeξ of ZX(n) we write ϕF for the element ∑ξ∈X(n)aξelξ. Then, for a finite dimensional G˙(n)-module V we have chVF=(chV)F. Moreover, we have the following relationship between the irreducible modules for G(n) and G˙(n), see [9], Section 3.2, (5).
1.3.1 Steinberg’s Tensor Product Theorem For λ0∈X1(n) and λˉ∈X+(n) we have
[TABLE]
Usually we shall abbreviate the quantum groups G(n), B(n), T(n) to G, B, T and G˙(n) to G˙. Likewise, we usually abbreviate the modules
Ln(λ), ∇n(λ), Δn(λ), In(λ) and L˙n(λ) to L(λ), ∇(λ), Δ(λ), I(λ) and L˙(λ), for λ∈Λ+(n), and abbreviate the modules En and Dn to E and D.
1.4 A truncation functor
Let N,n be positive integers with N≥n. We identify G(n) with the quantum subgroup of G(N) whose defining ideal is generated by all cii−1, n<i≤N, and all cij with 1≤i=j≤N and i>n or j>n. We have an exact functor (the truncation functor) dN,n:pol(N)→pol(n) taking V∈pol(N) to the G(n) submodule ⨁α∈Λ(n)Vα of V and taking a morphism of polynomial modules V→V′ to its restriction dN,n(V)→dN,n(V′). For a discussion of this functor at the level of modules for Schur algebras in the classical case see [16], Section 6.5.
For a finite sequence of nonnegative integers α=(α1,…,αm) we write Sα(En) for the tensor product of symmetric powers Sα1(En)⊗⋯⊗Sαm(En).
**Proposition 1.4.1 ** The functor dN,n has the following properties:
(i) for polynomial G(N)-modules X,Y we have dN,n(X⊗Y)=dN,n(X)⊗dN,n(Y);
(ii) for α a finite sequence of nonnegative integers we have dN,nSα(EN)=Sα(En);
(iii) for λ∈Λ+(N,r) and Xλ=LN(λ),∇N(λ) or ΔN(λ) then dN,n(Xλ)=0 if and only if λ∈Λ+(n,r);
(iv) for λ∈Λ+(n,r), dN,n(LN(λ))=Ln(λ), dN,n(∇N(λ))=∇n(λ) and dN,n(ΔN(λ))=Δn(λ).
Proof.
Part (i) is immediate. Part (ii) is an easy check as is part (iii). Part (iv) follows from [9], 4.2, (4).
∎
1.5 Connections with the Hecke algebras
We now record some connections with representations of Hecke algebra of type A. We fix a positive integer r. We write len(π) for the length of a permutation π. The Hecke algebra Hec(r) is the K-algebra with basis Tw, w∈Sym(r), and multiplication satisfying
[TABLE]
for w,w′∈Sym(r) and a basic transposition s∈Sym(r).
Assume now n≥r. We have the Schur functor f:mod(S(n,r))→mod(Hec(r)), see [9], 2.1. For λ a partition of degree r we denote by Sp(λ) the corresponding (Dipper-James) Specht module.
Proposition 1.5.1 The functor f has the following properties :
(i) f is exact;
(ii) for λ∈Λ+(n,r) we have f∇n(λ)=Sp(λ);
(iii) for λ∈Λ+(n,r) we have f(Ln(λ))=0 if and only if λ∈X1(n) and the set {f(Ln(λ))∣λ∈X1(n)} is a full set of pairwise non-isomorphic simple Hec(r)-modules.
Proof.
(i) is clear from the definition. For (ii) see [9] Proposition 4.5.8. and for (iii) see [9], 4.3, (9) and 4.4,(2).
∎
There is an alternative description of the irreducible Hec(r)-modules. For λ∈Preg(r), we define Dλ (denoted D(λ) in [9]) to be the head of the Specht module Sp(λ). Then Dλ, λ∈Preg(r), is a complete set of pairwise non-isomorphic simple Hec(r)-modules. The relationship between these two labelings of the irreducible modules will be crucial for us in what follows.
We use the notation of [9], Section 4.4. There is an involutory algebra automorphism ♯:Hec(r)→Hec(r) given by ♯(Ts)=−Ts+(q−1)1, for a basic transposition s∈Sym(r). For a Hec(r)-module V affording the representation π:Hec(r)→EndK(V) we write V♯ for the K-space V regarded as a module via the representation π∘♯.
The relationship between the labellings is:
[TABLE]
for λ∈X1(n).
Therefore a direct relation between the two descriptions of the irreducible modules for the symmetric group is described in terms of the involution Preg(r)→Preg(r), λ↦λ~ defined by
(Dλ)♯≅Dλ~. This bijection is named after G. Mullineux, who proposed, in [24], an algorithm to describe it explicitly in the classical case q=1 and K a field of characteristic p. The algorithm proposed by Mullineux makes perfect sense also in the quantised case. We write Mull:Preg(r)→Preg(r) for this bijection and call it the Mullineux involution. Thus we have
[TABLE]
for λ an l-restricted partition of degree r.
Mullineux’s original conjecture was proved by Ford and Kleshchev in [17]. The quantised version was proved by Brundan, [1].
This bijection is very important to us and we shall assume some familiarity with the Mullineux algorithm in later sections.
We state explicitly some of the most important properties of this map for us. We indicate an argument here since it will be important for us. The argument is essentially in [5] (in the classical case) but it is perhaps more convenient to use the language of tilting modules, as in [9]. For λ∈Λ+(n,r) we write Tn(λ) for the corresponding tilting module, as in [9].
Proposition 1.5.2 Let λ be a restricted partition of r and let μ=Mull(λ′). Then μ is the unique maximal element of the set,
S={τ∈Λ+(n,r)∣[∇n(τ):Ln(λ)]=0}.
Proof.
Let τ∈Λ+(n,r). We have [∇n(τ):Ln(λ)]=(In(λ):∇n(τ)). Moreover, we have In(λ)=Tn(Mull(λ′)), [9], 4.3, (10), so that τ∈S if and only if (Tn(Mull(λ′)):∇n(μ))=0. But Tn(Mull(λ′)) has unique highest weight Mull(λ′) so the result follows.
∎
2 Special Partitions and Good Partitions
The symmetric algebra S(En) has the homogeneous ideal and G(n)-submodule I generated by e1l,…,enl. We write Sˉ(En) for the quotient S(En)/I. Then Sˉ(En) inherits a grading and G(n)-module decomposition Sˉ(En)=⨁r=0∞Sˉr(En). The images of the elements e1r1…enrn, with 0≤r1,…,rn≤l−1, r1+⋯+rn=r form a basis of Sˉr(En), for r≥0.
Let m≤n. For α=(α1,…,αm)∈Λ(m) we define Sˉα(En)=Sˉα1(En)⊗⋯⊗Sαm(En). Thus we have Sˉ(En)⊗m=⨁α∈Λ(m)Sˉα(En).
We are now ready to make two key definitions.
Definition 2.1**.**
Let m≥1.
(i) We will say that λ∈Λ+(n) is m-good (with respect to n) if Ln(λ) is a composition factor of the m-fold tensor product S(En)⊗m.
(ii) We will say that λ∈Λ+(n) is m-special (with respect to n) if Ln(λ) is a composition factor of Sˉ(En)⊗m.
From [12], Lemma 3.8 we get:
Lemma 2.2**.**
An element λ∈Λ+(n) is m-good if and only if there exists μ∈Λ+(n) of length at most m such that [∇n(μ):Ln(λ)]=0.
Lemma 2.3**.**
(The Stability Properties) Let m,n,N be positive integers with N≥n. Let λ be a partition of length at most n. Then λ is m-good (resp. m-special) with respect to n if and only if λ is m-good (resp. m-special) with respect to N.
Proof.
For α∈Λ(m) we have dN,n(Sα(EN))=Sα(En) from Proposition 1.4.1 (ii) and this, together with Proposition 1.4.1 (iv)
gives the result for m-good partitions.
It is easy to check, from the explicit bases of Sˉ(EN) and Sˉ(En), as above, that dN,n(Sˉ(EN))=Sˉ(En) from which we get that dN,n(Sˉ(EN)⊗m)=Sˉ(En)⊗m by Proposition 1.4.1 (i). Now Proposition 1.4.1 (iv) gives the result for m-special partitions.
∎
**Notation **In view of the above lemma, for a positive integer m, we shall say that a partition λ is m-good (resp. m-special) if it is m-good (resp. m-special) with respect to n, for n≥len(λ).
We record an elementary observation.
Lemma 2.4**.**
Let λ,μ∈Λ+(n) and let m1,m2≥0.
If λ is m1-good (resp. m1-special) and μ is m2-good (resp. m2-special) then λ+μ is (m1+m2)-good (resp. (m1+m2)-special).
Proof.
We suppose n is sufficiently large. Let S=S(En) and suppose that λ∈Λ+(n) is m1-good and μ∈Λ+(n) is m2-good. Then Ln(λ) occurs as a section of S⊗m1 and Ln(μ) occurs as a section of S⊗m2. Hence Ln(λ)⊗Ln(μ) occurs as a section of S⊗(m1+m2)=S⊗m1⊗S⊗m2. Now Ln(λ)⊗Ln(μ) has highest weight λ+μ so that Ln(λ+μ) occurs as a composition factor of Ln(λ)⊗Ln(μ), and hence of S⊗(m1+m2), i.e., λ+μ is (m1+m2)-good.
The argument for special partitions is completely analogous.
∎
We elucidate the relationship between m-good and m-special partitions via some properties of graded modules that we now recall.
Let A be a K-algebra. If M is a left A-module, S is a subspace of A and V is a subspace of M then we write SV for the subspace of M spanned by all elements sv, with s∈S, v∈V. Now suppose that A has a K-algebra grading
A=⨁r=0∞Ar. We assume further that A0=K and that A1 generates A and has finite dimension. We set A+=∑r>0Ar.
Let M=⨁i≥0Mi be a finitely generated graded A-module and consider the graded vector space M=M/A+M
Lemma 2.5**.**
If V is a homogeneous subspace of M such that
[TABLE]
for all r then the multiplication map A⊗V→M is surjective.
Proof.
We have M0=V0≤AV. Now assume r>0 and Mj≤AV for j<r. Then
[TABLE]
so it follows by induction that Mr≤AV for all r. Hence AV=M, i.e., the map A⊗V→M is surjective.
∎
Proposition 2.6**.**
(i) The A-module M is graded free if and only if
[TABLE]
for all r≥0
(ii) Assume that M is graded free. A homogenous subspace V is free generating space (i.e., multiplication A⊗V→M is an isomorphism) if and only if the natural map V→M is an isomorphism.
Proof.
Assume that M is graded free and V is a homogeneous subspace freely generating M. Then the multiplication map A⊗V→M is a linear isomorphism and induces an isomorphism,
[TABLE]
Hence the natural map V→M is an isomorphism.
We give A⊗V a grading with A⊗V=⨁r=0∞(A⊗V)r, with (A⊗V)r=∑r=i+jAi⊗Vj, for r≥0.
The isomorphism A⊗V→M gives
[TABLE]
i.e.,
[TABLE]
and hence
[TABLE]
for all r≥0.
Suppose conversely that ∑i+j=rdimAidimMj=dimMr for all r. Let V be any homogeneous subspace of M such that the natural map V→M is an isomorphism, i.e., V=⊕r=0∞Vr, where Vr is a complement of (A+M)r in Mr for each r.
By the Lemma 2.1 above, the multiplication map A⊗V→M is surjective. Hence the map
[TABLE]
is onto for all r. But
[TABLE]
Therefore, the above map is an isomorphism and so the multiplication map is an isomorphism. Hence M is freely generated by V. This proves everything.
∎
We now suppose that A and M are T(n)-modules in such a way that the gradings A=⨁r=0∞Ar and M=⨁r=0∞Mr are module homomorphisms and that multiplication the multiplication map A⊗A→A the action A⊗M→M are T(n)-module homomorphisms.
Proposition 2.7**.**
Assume that M is graded free and let Vr be a T(n)-module complement of (A+M)r in Mr, for each r, and form the T(n)-module V=⨁r≥0Vr. Then, for r≥0, we have
[TABLE]
as T(n)-modules.
We shall apply the above generalities to a tensor product of copies of the symmetric algebra S(E) on the natural module E for G(n). Let S=S(En). Then S has the subalgebra R generated e1l,…,enl. We note that R is a G(n)-submodule and in fact R is isomorphic to S(E˙n)F, (where F:G→G˙ is the Frobenius morphism), via the K-algebra map taking ei∈E˙n to eil∈S(En).
Let m≥0. We set A=R⊗⋯⊗R (m times) and H=S⊗⋯⊗S (m times). We regard S as a module over R, via the inclusion map and hence H=S⊗⋯⊗S as a module over A=R⊗⋯⊗R. As a G(n)-module we have A≅H˙F, where H˙=S(E˙n)⊗⋯⊗S(E˙n). The natural map S⊗m→H induces an isomorphism Sˉ⊗m→H.
Suppose M is a polynomial G(n)-module with decomposition with homogenous component Mr of degree r, for r≥0, and each Mr is finite dimensional. Then, for λ∈Λ+(n,r), we write [M:Ln(λ)] for [Mr:Ln(λ)].
Proposition 2.8**.**
For λ∈Λ+(n) we have
[TABLE]
Proof.
Let r be the degree of λ. Then we have [H:Ln(λ)]=[Hr:Ln(λ)]. Now by Proposition 2.7 the T(n)-modules Hr and ⨁r=i+jHi⊗Aj have the same character. Hence we have
[TABLE]
as required.
∎
If K has characteristic p>0 then we have the usual Frobenius F˙:G˙(n)→G˙(n), whose comorphism takes cij to cijp, for 1≤i,j≤n. In that case we write J for H and Jˉ for H. Repeating the above
Proposition we obtain the following.
Corollary 2.9**.**
Suppose K has positive characteristic. Let λ∈Λ+(n). Then, for all sufficiently large N (depending on λ) we have:
(i) [J:Ln(λ)]=[H⊗(Jˉ⊗JˉF˙⋯⊗JˉF˙N−1)F:Ln(λ)]; and
(ii) λ is m-good if and only if there exists an element μ0∈Λ+(n) which is m-special for G(n) and elements μ1,…,μN∈Λ+(n) which are m-special for G˙(n) such that
[Ln(μ0)⊗(L˙n(μ1)⊗L˙n(μ2)F˙⋯⊗L˙n(μN)F˙N−1)F:Ln(λ)]=0.
3 Reciprocity, Row Removal and Node Removal
The following will be useful to us immediately and in Section 6.
Lemma 3.1**.**
Let λ be a non-restricted partition. If μ is a partition such that L(μ) is a composition factor of L(λ)⊗V, for some polynomial module V, then μ is non-restricted.
Proof.
We write λ=λ0+lλˉ, with λ0,λˉ partitions with λ0 restricted and λˉ=0. Then L(λ)⊗V=L(λ0)⊗L˙(λˉ)F⊗V so that L(μ) is a composition factor of L˙(λˉ)F⊗L(τ), for some partition τ such that L(τ) is a composition factor of L(λ0)⊗V. We have τ=τ0+lτˉ, for partitions τ0,τˉ, with τ0 restricted. Then L(μ) is a composition factor of L(τ0)⊗(L˙(τˉ)⊗L˙(λˉ))F and hence, by Steinberg’s tensor product theorem, we have μ=τ0+lμˉ, where L˙(μˉ) is a composition factor of L˙(τˉ)⊗L˙(λˉ). Thus L˙(μˉ) is polynomial of degree
[TABLE]
Thus μˉ=0 and μ is not restricted.
∎
We shall also need the following result.
Proposition 3.2**.**
Let m be a positive integer. For a restricted partition λ, the following are equivalent:
(i) λ is m-good;
(ii) λ is m-special;
(iii) len(Mull(λ′))≤m.
Proof.
We work with modules for quantum general linear groups of degree n≥r=deg(λ).
(i) ⇒ (ii)
Suppose that λ is m-good. Then putting H=S(E)⊗m we have [H:L(λ)]=0. By Proposition 2.8 there exist partitions μ and τ such that μ is m-special and [L(μ)⊗L˙(τ)F:L(λ)]=0. By Lemma 3.1, τ=0, so that λ=μ, which is m-special.
(ii) ⇒ (i) This is clear.
(i) ⇒ (iii) Since λ is m-good, by Lemma 2.2 we have [∇(μ):L(λ)]=0 for some partition μ with at most m parts. Hence applying the Schur functor f:mod(S(n,r))→mod(Hec(r)) we get
[TABLE]
Now, by [19], Corollary 12.2. we get that Mull(λ′)≥μ and Mull(λ′) has at most m parts.
(iii) ⇒ (i). Suppose that Mull(λ′) has at most m parts and write μ=Mull(λ′). We have that ∇(μ) appears as a section of a good filtration of SμE, see e.g., [11], Lemma 3.8. Moreover applying the Schur functor to [∇(μ):L(λ)] we get that,
[TABLE]
and λ is m-good by Lemma 2.2.
∎
We fix n. For λ=(λ1,…,λn)∈Λ+(n) with λ1≤m(l−1) we define λ†∈Λ+(n) by
[TABLE]
Remark 3.3**.**
For a finite dimensional G(n)-module and λ∈X+(n) the composition multiplicity [V:L(λ)] is the coefficient aλ of chL(λ) in the expression
chV=∑μ∈X+(N)aμchL(μ) (with all aμ non-negative integers). If follows that
for finite dimensional G(n)-modules U,V and λ∈X+(n) we have [U⊗V:L(λ)]=[U∗⊗V∗:L(λ∗)]. This observation will be used in the proof of the following result.
Lemma 3.4**.**
(Reciprocity Principle.) Let λ=(λ1,…,λn)∈Λ+(n) with λ1≤m(l−1). Then λ is m-special if and only if λ† is m-special.
Proof.
Let S=S(E) and Sˉ=Sˉ(E). The images of the elements e1a1…enan, with 0≤a1,…,an≤l−1 and a1+⋯+an=r, form a basis of Sˉr. In particular we have Sˉn(l−1)≅D⊗(l−1) and Sˉj=0 for j>n(l−1). Let 0≤i≤n(l−1). Then the multiplication map Sˉj⊗Sˉn(l−1)−j→Sˉn(l−1) is a G(n)-module map and a perfect pairing of K-spaces. Hence we have the natural isomorphism
[TABLE]
Now we consider H≅Sˉ⊗m. Suppose λ has degree r. Then we have [H:L(λ)]=[Hr:L(λ)] and
[TABLE]
so that [H:L(λ)]=0 if and only if there exists r1,…,rm≥0 such that r=r1+⋯+rm and [Sˉr1⊗⋯⊗Sˉrm:L(λ)]=0. Moreover, we have
[TABLE]
where ti=n(l−1)−ri, 1≤i≤m. Dualising we thus get
[TABLE]
and this is
[TABLE]
But now λ∗=(−λn,…,−λ2,−λ1) and so
[TABLE]
and the result follows.
∎
Combining the stability and reciprocity principles we deduce the following.
Proposition 3.5**.**
Let m≥1 and let λ be a partition with λ1=m(l−1). Then λ is m-special if and only if (λ2,λ3,…) is m-special.
Proof.
Suppose λ has length n. Then, applying the reciprocity principle, we have that λ is m-special if and only if (m(l−1)−λn,m(l−1)−λn−1,…,m(l−1)−λ2,m(l−1)−λ1) is m-special, i.e., if and only if (m(l−1)−λn,m(l−1)−λn−1,…,m(l−1)−λ2) is m-special. However, applying the reciprocity principle once more, this is m-special if and only if (λ2,λ3,…,λn) is m-special.
∎
We now describe the principles of row removal and node removal that will be used extensively in Section 5.
Proposition 3.6**.**
Let n≥2 and m≥1. If λ=(λ1,…,λn) is an m-special (resp. m-good) partition then (λ1,…,λn−1) and (λ2,…,λn) are m-special (resp. m-good) partitions.
Proof.
We give the argument for m-good. The m-special case is similar. We put μ=(λ1,…,λn−1). Consider the natural module E=En for G(n). 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=G(n−1)×G(1) as a subgroup of G(n), in the obvious way. Then En=En−1⊕L is an H-module decomposition. Since L(λ) is a composition factor of S(En)⊗m it is a composition factor of SαEn, for some sequence α=(α1,…,αm). The H-module L(λ) has highest weight λ and so has Ln−1(μ)⊗L1(λn) as a composition factor .
For r≥0 we have Sr(E)=⨁r=r1+r2Sr1(En−1)⊗Sr2L as H-modules. It follows that
Ln−1(μ)⊗L1(λn) must be a composition factor of a module of the form Su1(En−1)⊗⋯⊗Sum(En−1)⊗M, for some u1,…,um≥0, and one dimensional G(1)-module M. Restricting to G(n−1) gives that μ is m-good.
The result for (λ2,…,λn) is obtained by restricting to G(1)×G(n−1) and arguing in the same way.
∎
Constrained Modules and Node Removal
We fix m≥0. We say that a partition is m-constrained if it has at most m parts.
Definition 3.7**.**
Let M be a finite dimensional polynomial module with a good filtration. We say that M is m-constrained if each λ∈Λ+(n) such that (M:∇(λ))=0 is m-constrained. We say that M is m-deficient if (M:∇(λ))=0 for every m-constrained element λ of Λ+(n).
Remark 3.8**.**
Note that if M is a finite dimensional polynomial module with a good filtration and character χ=∑λ∈Λ+(n)rλχ(λ) then M is m-constrained if λ is m-constrained whenever rλ=0 and M is a m-deficient if rλ=0 for all m-constrained λ.
Lemma 3.9**.**
Let M be finite dimensional polynomial module with a good filtration and suppose that M is m-deficient. Then for every finite dimensional polynomial module V with a good filtration the polynomial module M⊗V is m-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 m-constrained τ∈Λ+(n). It follows that it is enough to note that for λ,μ∈Λ+(n) with λ being m-constrained
the coefficient of χ(τ) in χ(λ)χ(μ) is [math] for all m-constrained τ∈Λ+(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 m-constrained. 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 m-constrained. 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.
∎
Lemma 3.10**.**
Let λ∈Λ+(n). Then λ is m-good if and only if I(λ) is not m-deficient.
Proof.
We have that λ is m-good if and only if there exists some m-constrained partition μ such that [∇(μ):L(λ)]=0, by Lemma 2.2. By reciprocity, as in Section 1.2, this is if and only if there exists an m-constrained partition μ such that (I(λ):∇(μ))=0, i.e,. if and only if I(λ) is not m-deficient.
∎
Definitions
Let λ be a partition.
(i) We call a node R of λ (or more precisely of 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(λ) and either i=1 or λi<λi−1 or A=(len(λ)+1,1).
(iii) The residue of a node A=(i,j) of a partition λ is defined to be the congruence class of j−i modulo l.
(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 say that a removable node of λ is suitable if its residue is different from the residue of each lower addable node.
(vi) We say that a removable node A=(i,λi) of λ is co-suitable if the transpose node A′=(λi,i) is a suitable node for λ′.
Recall (or see [22], I, Section 1, Exercise 8) that partitions λ and μ of the same degree have the same l-core if and only if for each 0≤r<l then number of nodes of λ of residue r is equal to the number of nodes of μ with residue r.
Lemma 3.11**.**
Suppose that λ is a partition and R=(h,λh) is a suitable node of λ. Then, for all n sufficiently large, we have:
(i) In(λ) is a direct summand of In(λR)⊗En;
(ii) if In(λR) is m-deficient then so is In(λ).
Furthermore if λ is m-good then so is λR.
Proof.
We have an embedding of ∇n(λR) in In(λR) and hence an embedding of ∇n(λR)⊗En in In(λR)⊗En.
Let μ=λR. By Pieri’s formula the character of M=∇n(μ)⊗En is the sum ∑Aχ(μA), with A running over all addable nodes of μ with len(μA)≤n. Thus we have chM=∑iχ(μ+ϵi), where the sum is over all 1≤i≤n such that (i,μi+1) is an addable node of μ. Thus M has a good filtration 0=Mn+1≤Mn≤⋯≤M1=M, where Mi/Mi+1 is ∇n(μ+ϵi) if (i,μi+1) is addable, and [math] otherwise. Let J=Mh. Then Mh/Mh+1 is ∇n(λ) and ExtG1(Mh/Mh+1,Mh+1)=0, since Mh+1 has a filtration with sections ∇(μ+ϵi), with i>h and
[TABLE]
since λ and μ+ϵi have different cores and so the modules ∇(λ) and ∇(μ+ϵi) lie in different blocks.
Hence ∇n(λ) embeds in In(λR)⊗En and In(λR)⊗En is injective so that In(λR)⊗En contains the injective module In(λ). Moreover if In(λR) is m-deficient then by Lemma 3.10 In(λR)⊗En is m-deficient and so too is In(λ). This proves (i) and (ii). The final assertion follows from (ii) and Lemma 3.10.
∎
4 Distinguished partitions and some Mullineux combinatorics
We shall assume some familiarity with the terminology of the Mullineux bijection, as explained in [24]. This applies to the case in which l is prime but the combinatorics is in fact valid for l arbitrary. A suitable reference for the more general context is [1].
The length of the edge of the diagram of a partition λ is denoted e(λ).
The length of the l-edge (i.e., the sum of the lengths of the l-segments) will be denoted el(λ). Recall that Preg is the set of all l-regular partitions. We recall that the Mullineux involution Mull:Preg→Preg is defined recursively. For λ∈Preg we call Mull(λ) its Mullineux conjugate. The Mullineux conjugate of the empty set is the empty set. If λ∈Preg is not empty and ν is the partition whose diagram is obtained by removing the l-edge from the diagram of λ then Mull(λ) is the unique l-regular partition such that the removal of the l-edge from the diagram of Mull(λ) leaves the diagram of Mull(ν) and
[TABLE]
An easy induction shows that if e(λ)<l then Mull(λ)=λ′. We shall use this property several times in what follows, without further reference.
For a partition λ it will be sometimes convenient to use the notation λ=a1t1a2t2… to indicate that the entry a1 appears t1-times, a2 appears t2-times and so on.
Definition 4.1**.**
Let 0<m<l. We say that a partition λ is m-distinguished if λ has the form λ0+lλˉ, with λ0=(l−m)ka1…am, with k≥0, l−m>a1≥⋯≥am≥0 and λˉ a partition with λˉ1<m.
Our approach is to describe the composition factors of a tensor product of truncated symmetric powers in terms of the distinguished partitions.
**Notation **Let 0<m<l. We write Φm to be the set of partitions λ=(λ1,λ2,…) such that len(λ)≤m and λ1−λm≤l−m.
We note that a partition λ belongs to Φm if and only if we can write λ=rm+α, for some r≥0 and a partition α with α1≤l−m, len(α)<m.
Remark 4.2**.**
It is easy to see that if μ is a (non-zero) l-regular partition with edge length at most l then μ∈Φm, where m=len(μ).
Our interest in this set of partitions is explained by the following result.
Lemma 4.3**.**
Let 0<m<l. A restricted partition λ is m-distinguished if and only if λ′∈Φl−m.
Proof.
If λ=(l−m)ka1…am as above then λ=(l−m)k⋃ν, where ν=a1…am. Thus we have λ′=((l−m)k)′+ν′=kl−m+τ, where τ=ν′, and this has the required form to qualify as an element of Φl−m. Moreover the argument may be reversed and so the result holds.
∎
Lemma 4.4**.**
Let 0<m<l. If λ∈Φm then el(λ)≤l.
Proof.
We write λ=rm+α as above. If r=0 then we have e(λ)=α1+len(α)−1<m+l−m−1<l. If r=1 then we have e(λ)=m+α1+1−1≤m+l−m+1−1=l.
Now suppose r>1. Then we have λ=(r−1)m+μ, where μ=1m+α. By the case just considered we have e(μ)≤l so that the l-edge of μ has length at most l and contains the node (m,1) and hence the first l-segment of λ contains the node (m,r). In particular the first l-segment contains a node from the final row of λ and so there is only one l-segment, i.e., el(λ)≤l.
∎
Lemma 4.5**.**
Let 0<m<l. Let λ∈Φm and let μ denote the partition obtained by removing the l-edge of λ. Then we have μ∈Φm.
Proof.
We write λ in the form rm+α, as above. If r=0 then el(λ)=e(λ)<l and μ is obtained by removing the entire edge of λ. The result is clear in this case. Suppose now that r>0 but e(λ)≤l. Then λ1+m−1≤l so that λ1≤l−m+1. Since we remove the node (1,λ1) in obtaining μ we must have μ1≤l−m. Also, we remove the entire final row of λ in obtaining μ so we must have len(μ)<m. But now len(μ)<m and μ1≤l−m gives μ∈Φm.
Now suppose r>0, e(λ)>l and so, by Lemma 4.4, el(λ)=l. Therefore the node (m,1) does not belong to the l-edge of λ. Thus we may write λ=1m+ν, with ν∈Φm and μ=1m+νˉ, where νˉ is obtained by removing the l-edge from ν. We may assume inductively that νˉ∈Φm and hence μ=1m+νˉ∈Φm.
∎
Proposition 4.6**.**
Let 0<m<l. The Mullineux correspondence restricts to a bijection Φm→Φl−m.
Proof.
It suffice to show that Mull(Φm)⊆Φl−m since, replacing m by l−m, we then get Mull(Φl−m)⊆Mull(Φm).
Let λ∈Φm and let μ=Mull(λ). We write λ=rm+α, with len(α)<m, α1≤l−m.
First suppose that r=0. Then e(λ)=α1+len(α)−1≤l−m+m−1−1<l so that μ=λ′=α′∈Φl−m.
Next suppose that r>0 but e(λ)<l. Then m+λ1−1<l and μ=λ′ so that μ1=len(λ)=m and len(μ)=λ1≤l−m so μ∈Φl−m.
Now suppose that r>0, e(λ)≥l so that el(λ)=l. Let λˉ be the partition obtained by removing the l-edge from λ and let θ=Mull(λˉ). By Lemma 4.5 we have λˉ∈Φm so we can assume by induction that θ∈Φl−m, in particular len(θ)≤l−m.
We first consider the case in which len(θ)<l−m. The l-edge of μ is the edge so that l=μ1+l−m−1, i.e., μ1=m+1. We have len(μ)=l−len(λ)=l−m so that μl−m>0 and μ1−μl−m≤m so that that μ∈Φl−m.
It remains to consider the case len(θ)=l−m. Then we may write θ=tl−m+ϕ, with t=θl−m and we have that μ=tl−m+ψ, where ψ is the
partition with len(ψ)=l−m and such that the removal of the l-edge of ψ leaves ϕ. We can assume inductively that ψ∈Φl−m so that μ=tl−m+ψ∈Φl−m.
∎
Corollary 4.7**.**
An l-restricted m-distinguished partition is m-special.
Proof.
Let λ be a restricted m-distinguished partition. The we have λ′∈Φl−m by Lemma 4.3. Hence we have Mull(λ′)∈Φm, by Proposition 4.6 and hence len(Mull(λ′))≤m and so λ is m-special by Proposition 3.2.
∎
We shall prove a generalisation of this.
Definition 4.8**.**
Let now μ∈Preg. The sequence of Mullineux components μ1,μ2,… of μ is defined as follows. Suppose that the first l-segment of μ ends in the row r1, the second in r2 etc. Then μ1=(μ1,…,μr1), μ2=(μr1+1,…,μr2) etc.
Note that, in the above situation, we have μ=μ1⋃⋯⋃μt.
We shall also develop an alternative notion, which will be useful in Section 5, to express μ in terms of its Mullineux components.
Let α,ρ be partitions with α=0. We shall say that the pair (α,ρ) is compatible if αh≥ρ1,where h is the length of α. If (α,ρ) is compatible we write (α∣ρ) for the concatenation (α1,…,αh,ρ1,ρ2,…). For k≥2 and partitions α1,α2,…,αk+1, such that α1,…,αk=0 and such that the pair (αi,αi+1) is compatible for 1≤i≤k the concatenation (α1∣α2∣⋯∣αk+1) is defined recursively by (α1∣α2∣⋯∣αk+1)=(α1∣(α2∣⋯∣αk+1)).
Thus, in particular, if μ is a l-regular partition with Mullineux components μ1,…,μt, as above, we have μ=(μ1∣μ2∣⋯∣μt).
We note that the notion of Mullineux components easily extends to arbitrary partitions. Thus, for an arbitrary partition λ we write λ=(α∣ρ), for partitions α,ρ, where the first l-segment of λ has final node in the last row of α, i.e., we have α=λ if el(λ)≤l and if el(λ)≥l then α=(λ1,…,λh), ρ=(λh+1,…), where h is minimal such that λ1−λh+1+h≥l. We then say that α is the first Mullineux component of λ and say that the second Mullineux component of λ is the first Mullineux component of ρ, and so on. We shall use these components, in the general context, in Section 5.
Lemma 4.9**.**
Let μ∈Preg have Mullineux components μ1,μ2,…,μt. Then
[TABLE]
Proof.
We have that l∣el(μ) if and only if l∣el(μt). Therefore in the case l∣el(μ) we get,
[TABLE]
For the case in which l∤el(μ) and so l∤el(μt) we get
[TABLE]
∎
Proposition 4.10**.**
Let λ be a l-restricted partition and m be a positive integer. Then λ is m-special if and only if it is possible to write
[TABLE]
where λi is a restricted mi-distinguished partition, for 1≤i≤t and m=m1+⋯+mt.
Proof.
Certainly any such a partition is m-special, by Corollary 4.7 and Lemma 2.4.
We now suppose that λ is l-restricted and m-special and show that it has the required form. Thus len(Mull(λ′))≤m and it is clearly harmless to assume len(Mull(λ′))=m (which we do).
We write μ=λ′ and consider the sequence of Mullineux components μ1,…,μt of μ. We define mi=len(Mull(μi)), 1≤i≤t. Then we have m=m1+⋯+mt, by Lemma 4.9. Moreover, we have
[TABLE]
where λi=(μi)′, 1≤i≤t. Thus it suffices to prove that λi is mi-distinguished and so, by Lemma 4.3, it suffices to prove that μi∈Φl−mi, 1≤i≤t.
Suppose first that 1≤i≤t and el(μi)=l. (This is the case if i<t.) We have len(Mull(μi))=l−len(μi) so that len(μi)=l−mi. Suppose that the l-edge of μi ends at the node (l−mi,k) then (by considering the diagram obtained by removing the first k−1 columns from the diagram of μi) we see that the length of the l-edge of μi is
[TABLE]
so that (μi)1=k+mi and (μi)1−μl−mi≤mi and μi∈Φl−mi, as required.
It remains to consider the case i=t and el(μi)<l. Then
[TABLE]
Moreover we have
[TABLE]
and μt∈Φl−mt, as required.
∎
Finally we record a couple of results that will be needed in our treatment of composition factors.
Lemma 4.11**.**
Let 1<m<l. If θ=(θ1,…,θm)∈Φm then (θ2,…,θm)∈Φm−1.
Proof.
Certainly (θ2,…,θm) has length at most m−1. Also, we have
[TABLE]
∎
We now fix n and consider the reflection with respect to m of an m-distinguished partition.
Lemma 4.12**.**
Let λ be an m-distinguished partition and suppose that n≥len(λ). Then λ† is m-distinguished.
Proof.
We write
[TABLE]
with l−m>a1≥⋯≥am≥0 and m>μ1≥⋯≥μr≥0.
Then we have
[TABLE]
which is m-distinguished.
∎
Remark 4.13**.**
From the definition of Sˉ(E) we see that a 1-special partition has first entry λ1≤l−1 and in particular λ is restricted. Hence, from Proposition 4.10, λ has the form (l−1,…,l−1,b) (with l−1≥b≥0). Assume that K has positive characteristic p. Thus λ is 1-special for G˙(n) if it has the form (p−1,…,p−1,b).
From Corollary 2.7 we get that every composition factor of S(E) has the form
[TABLE]
where λ0 is 1-special for the group G(n) and λ1…,λt are 1-special for the group G˙(n). Specialising to the classical case q=1 we thus
recover the description of Krop, [21], and Sullivan, [25], describing the composition factors of symmetric powers of E.
5 Towards the Main Results
We here assemble the final ingredients needed in the proofs of the main results. We first prove that if λ is an m-distinguished restricted partition then there exists a 1-distinguished partition α and an (m−1)-distinguished restricted μ such that L(λ) is a composition factor of L(α)⊗L(μ). We begin with a couple of preliminary results, given in the next section.
**Notation **For non-negative integers b1,…,bm we write Q(b1,…,bm) for the partition obtained by arranging the numbers b1,…,bm in descending order.
Lemma 5.1**.**
Let (a1,…,am) and (b2,…,bm) be partitions. Suppose that (b2,…,bm)≥(a2,…,am) and (a1,…,am)≥Q(a1,b2,…,bm). Then we have (a2,…,am)=(b2,…,bm).
Proof.
If a1≥b2 then Q(a1,b2,…,bm)=(a1,b2,…,bm) so we have
(a1,a2,…,am)≥(a1,b2,…,bm)
and hence (a2,…,am)≥(b2,…,bm) and therefore (a2,…,am)=(b2,…,bm).
If a1<b2 then Q(a1,b2,…,bm) has first entry b2 and since (a1,…,am)≥Q(a1,b2,…,bm) we get a1≥b2 and so this case does not arise.
∎
Remark 5.2**.**
Our interest in the above is via Pieri’s formula. Recall that for a≥0 and λ∈Λ+(n) the character of the G(n)-module ∇(a)⊗∇(λ)=SaE⊗∇(λ) is ∑μ∈Sχ(μ), where S is the set of all partitions with at most n part whose diagram may be obtained by adding a box to a different columns of the diagram of λ, see [22], Chapter I, Section 5. Hence SaE⊗∇(λ) has a good filtration with sections ∇(μ), μ∈S. It is not difficult to convince oneself that if len(λ)<n and λ=(b2,…,bn) then the set S has unique minimal element Q(a,b2,…,bn). Thus, in this situation, the module V=∇(a)⊗∇(b2,…,bn) has a good filtration with 0=V0<V1<⋯<Vt=V with V1=∇(Q(a,b2,…,bn)).
Proposition 5.3**.**
Let 1<m<l and let λ be a restricted m-distinguished partition of degree r and let n≥r. Then there exists a 1-distinguished partition α and a restricted (m−1)-distinguished partition μ such that the G(n)-module L(λ) is a composition factor of the G(n)-module L(α)⊗L(μ).
Proof.
We have Mull(λ′)=(a1,…,am), for some (a1,…,am)∈Φm, by Lemma 4.3 and Proposition 4.6.
The partition (a1,…,am) is the unique maximal element of the set {τ∈Λ+(n,r)∣[∇(τ):L(λ)]=0}, by Proposition 1.5.2. The module ∇(a1,…,am) occurs as a section in a good filtration of ∇(a1)⊗∇(a2,…,am) (see the above Remark), in particular we have [∇(a1)⊗∇(a2,…,am):L(λ)]=0 and hence [∇(a1)⊗L(θ):L(λ)]=0 for some θ∈Λ+(n) such that L(θ) is a composition factor of ∇(a2,…,am). By Lemma 3.1, θ is restricted.
Let ϕ=Mull(θ′). Then, by Proposition 1.5.2, ϕ is the unique maximal element of the set {τ∈Λ+(n,s)∣[∇(τ):L(θ)]=0}, where s=deg(θ), in particular we have ϕ≥(a2,…,am) and so len(ϕ)≤m−1. We write ϕ=(b2,…,bm).
Since [∇(a1)⊗L(θ):L(λ)]=0, we have
[TABLE]
Let ξ∈Λ+(n) be such that ∇(ξ) occurs as a section in a good filtration of ∇(a1)⊗∇(b2,…,bm) and [∇(ξ):L(λ)]=0. Thus (a1,…,am)≥ξ so, by the Remark 5.2, we have ξ≥Q(a1,b2,…,bm).
Now we have (a1,…,am)≥ξ≥Q(a1,b2,…,bm) and by Lemma 5.1, we have (a2,…,am)=(b2,…,bm), i.e., ϕ=(a2,…,am). By Lemma 4.11 we have ϕ∈Φm−1 and hence, by Lemma 4.3 and Proposition 4.6, θ is a restricted (m−1)-distinguished partition. Now L(λ) is a composition factor of L(α)⊗L(θ) for some composition factor L(α) of ∇(a1). By Lemma 3.1, α is restricted and hence of the form (l−1,…,l−1,b), i.e., a restricted 1-distinguished partition.
∎
We now turn our attention to an analysis of the l-edge of a partition.
Definitions and Notation
Let λ be a partition.
(i) We will denote the l-edge of a partition λ by El(λ).
(ii) We will say that λ is edge l-connected if the collection of nodes El(λ) is connected. More precisely, if λ has (non-zero) Mullineux components λ1,λ2,…,λt+1 then λ is edge l-connected if for each 1≤i≤t the final node of the first l-segment of (λi∣λi+1) lies directly above the node (len(λi)+1,λ1i+1). This may be also expressed by the condition
(*) λ1i−λ1i+1+len(λi)=l, for 1≤i<t.
Now write λ=(α∣ρ), where α is the first Mullineux component. We say that λ is initially edge l-connected if either ρ=0 or ρ=0 and α1−ρ1+len(α)=l. Thus λ is edge l-connected if and only if it is initially edge l-connected and ρ is edge l-connected.
If λ is not edge l-connected we will say that it is edge l-disconnected.
(iii) If λ is a partition and H is a skew l-hook in the diagram of λ (as in [19], Chapter 17) we denote by λH the partition whose diagram is obtained by removing H from the diagram of λ.
Lemma 5.4**.**
Let λ be an edge l-connected partition such that el(λ) is not divisible by l.
(i) If H is any skew l-hook of (the diagram of) λ then λH is edge l-connected, el(λ) not divisible by l and (λH)1=λ1.
(ii) We have core(λ)1=λ1.
Proof.
(i) If e(λ)<l then the result is vacuously true. We assume now that λ is a counterexample of minimal degree. Thus we can write λ=(α∣ρ), with α the first Mullineux component of λ and ρ=0. Let h=len(α). If no node of H belongs to the first h rows then we may write λH=(α∣ρJ), for some skew l-hook J of ρ. But then ρJ is edge l-connected, el(ρ) is not divisible by l and (ρJ)1=ρ1, by minimality. But then the same holds for λ. Hence H contains a node of the diagram of α.
Now the number of nodes in the part of the edge from (1,λ1) to (h,ρ1) is the edge length of (λ1−ρ1+1,…,λh−ρ1+1) i.e., λ1−ρ1+1+h−1=l. So if H involves (1,λ1) then it ends in (h,ρ1). But this is impossible since then the removal of H from the diagram of λ would not result in the diagram of a partition. Hence H does not contain the node (1,λ1). Similarly, H can not be contained entirely within the diagram of α. Thus H contains the nodes (h,ρ1) and (h+1,ρ1).
Let β denote the first Mullineux component of ρ and write ρ=(β∣σ), so that λ=(α∣β∣σ). Let k=len(β). We note that H is contained within the diagram of (α∣β). This is of course true if σ=0. For σ=0 we would otherwise have that H contains the node (h,β1) and also nodes (h+1,λh+1) and (h+k+1,σ1) and hence would contain more nodes than are in the edge of (λh+1−σ1+1,…,λh+k+1−σ1+1) and we would have
[TABLE]
Let μ=λH. Thus we have μ1=λ1 and μh=ρ1−1 (since H contains the nodes (h,ρ1) and (h+1,ρ1). Now we have
[TABLE]
Hence μ has first Mullineux component γ=(μ1,…,μh−1) of length h−1 and μ is initially l-connected. Let δ=(μh,…,μh+k) so now μ=(γ∣δ∣σ).
If σ=0 then since
[TABLE]
we have that δ is the second Mullineux component of μ so that
[TABLE]
and we are done.
So we can assume that σ=0, i.e., λ=(α∣β) and e(β)<l. But now we have
[TABLE]
and again we are done unless e(δ)=0, i.e., unless δ=0. In that case we have 0=δ1=μh=ρ1−1, so ρ1=1. We then have
[TABLE]
and the proof is complete.
(ii) This follows by repeated application of (i).
∎
Lemma 5.5**.**
Let λ be an l-regular partition. Assume that λ is edge l-connected and l∣el(λ). Let λ~ be the partition whose diagram is obtained by removing the first column from the diagram of λ. Then len(Mull(λ))=len(Mull(λ~)).
Proof.
We write λ=(α∣ρ), where α, of length h, say, is the first Mullineux component of λ. Note that the first l-segment does not end at (h,1), for otherwise ρ would have the form (1s), and we would have el(λ)=el(α)+s divisible by l, which is incompatible with the l-regularity of λ. Thus λ~=(α~∣ρ~) (where the diagram of α~ (resp. ρ~) is obtained by removing the first column of the diagram of α (resp. ρ)). So we get
[TABLE]
by induction on degree.
∎
Remark 5.6**.**
Suppose (α,β,γ) is a compatible triple of partitions (i.e., (α,β) and (β,γ) are compatible pairs) and λ=(α∣β∣γ). Let B be an addable node of β and let A be the corresponding addable node of λ, i.e.., the node such that
λA=(α∣βB∣γ). Let S be an edge node of β and let R be the corresponding edge node of λ, i.e., if S=(i,j) then R=(len(α)+i,j). Then res(A)=res(R) if and only if res(B)=res(S).
In order to prove our final two lemmas we need one more useful remark.
Remark 5.7**.**
Let λ be an l-regular partition with el(λ)≤l. We embed λ into the rectangular partition μ=(λ1)len(λ). For any node B=(i,j) of the skew diagram [μ]\[λ] we have
res(B)=res(1,λ1)=λ1−1. Indeed, since el(λ)≤l, we have that λ has only one l-segment and if (len(λ),c) is the last node of El(λ), then λ1+len(λ)−c≤l. Thus we have 2≤i≤len(λ) and c<j≤λ1. If res(B)=λ1−1, then we would have that λ1−j+(i−1)=0 mod l. But this is impossible since,
[TABLE]
Lemma 5.8**.**
Let μ be an l-regular partition. Assume that μ is edge l-disconnected. Then there is a co-suitable node R of μ such that μR is l-regular and len(Mull(μ))=len(Mull(μR)).
Proof.
Assume not and that μ is a counterexample of minimal degree. Our strategy is to first work up from the point in the diagram at which connectedness first fails to show in particular that μ1=μ2 and then work down from the top of the diagram using this information.
We write μ=(μ1∣μ2∣⋯∣μm), where μ1,…,μm are the (non-zero)
Mullineux components. Let hi=len(μi), for 1≤i≤m. We suppose that k is minimal such that (μ1∣⋯∣μk+1) is edge l-disconnected. Thus we have:
(*) μ1i−μ1i+1+hi=l, for 1≤i<k and μ1k−μ1k+1+hk>l.
We write Ri for the node (∑j<ihj+1,μ1i), for 1≤i≤k.
Step 1. We have res(R1)=res(R2)=⋯=res(Rk).
Proof of Step 1. For 1≤i<k we have μ1i−μ1i+1+hi=l so that μ1i−∑j<ihj−1 is congruent (modulo l) to μ1i+1−hi−∑j<ihj−1=μ1i+1−∑j<i+1hj−1, i.e., res(Ri)=res(Ri+1).
Step 2. We have μ1k=μ2k.
Proof of Step 2. Suppose for a contradiction that we have μ1k>μ2k. Then Rk is a removable node. We claim that Rk is co-suitable. If not let A be an addable node above Rk whose residue is that of Rk.
We have
μA=(μ1∣⋯∣μi−1∣(μi)B∣μi+1∣⋯∣μm) for some 1≤i<k and some addable node B of μi. Now Rk has the same residue as Ri, by Step 1. Let S be the corresponding node of μi, i.e., S=(1,μ1i). If Rk and A have the same residue then so do S and B, by Remark 5.6. This is obviously not true if B=(1,μ1i+1) and also impossible for B=(1,μ1i+1) by Remark 5.7. Hence Rk is co-suitable.
Now we have μRk=(τ1∣⋯∣τm) where τi=μi for 1≤i<k, τk=(μ1k−1,μ2k,…,μhkk) and τi=μi for i>k. Moreover, it is easy to check that τ1,τ2,…,τm are the Mullineux components of μRk. We also have that len(Mull(τi))=len(Mull(μi)) for all i so that
[TABLE]
and we have a contradiction.
Step 3. We have μ1i=μ2i, for 1≤i≤k.
Proof of Step 3. Assume not and that s is such that μ1s>μ2s but μ1i=μ2i for all s<i≤k.
We consider the node R=Rs. By the argument of Step 2, R is co-suitable.
Let a=μ1s. We claim that μR is l-regular. If not then the (h1+⋯+hs−1+1)th row in the diagram of μ is followed by l−1 rows of length a−1. In particular we have μs=a(a−1)hs−1. Therefore hs=l−1. Moreover, we have μ1s−μ1s+1+hs=l so μ1s+1=a−1. Hence we have
μ1s+1=μ2s+1=a−1. But then a−1 is the length of the l rows following the (h1+⋯+hs−1+1)th row in the diagram of μ. But μ is l-regular so this is impossible and the claim is established.
Now we have μR=(τ1∣⋯∣τm) where τi=μi for 1≤i<s, τs=(μ1s−1,μ2s,…,μhss,μ1s+1), τi=(μ2i,…,μhii,μ1i+1), for s<i<k, τk=(μ2k,…,μhkk) and τi=μi for i>k. Moreover, it is easy to check that τ1,τ2,…,τm are the Mullineux components of μR. We also have that len(Mull(τi))=len(Mull(μi)) for i=s,k, len(Mull(τs))=len(Mull(μs))−1 and
len(Mull(τk))=len(Mull(μk))+1. Therefore,
[TABLE]
and we have a contradiction.
Step 4. Conclusion
Let R be a removable node of μ such that μR=(μS1∣μ2∣⋯∣μm), for a removable node S of μ1. Then by Step 3 we have that R=(1,μ1). It is easy to check that R is co-suitable and if μR is an l-regular partition we have
[TABLE]
Hence, we may assume that μR is not l-regular so we have μ1=au(a−1)l−1−u, for some 2≤u≤l−1 and μ2=(a−1)uμu+12…μh22 with μu+12<a−1.
Consider the node R=(l−1+u,a−1). This is removable and has residue a−u. Moreover the addable nodes above R are (1,a+1) and (u+1,a) and these have residues a and a−u−1. Hence R is co-suitable. Suppose that μR is l-regular. Then we have that μR=(μ1∣μS2∣⋯∣μm), where S=(u,a−1) and again
[TABLE]
Therefore we must have μ2=(a−1)u(a−2)l−1−u and μ3=(a−2)uμu+13…μh33 with μu+13<a−2. Continuing in this way, we may assume that μ=(μ1∣μ2∣⋯∣μm) with μi=(a−i+1)u(a−i)l−1−u for 1≤i≤k−1 and μk=(a−k+1)uμu+1k…μhkk and 2≤u≤l−1.
Consider finally the node R=((k−1)(l−1)+u,a−k+1). This is removable and has residue a−u. Moreover the addable nodes above R are (1,a+1) and ((i−1)(l−1)+u+1,a−i+1), for 1≤i≤k−1, with residues a and a−u+1. Hence R is co-suitable. In addition μR is l-regular. We have μR=(μ1∣⋯∣μSk∣…∣μm), where S=(u,a−k+1) and
[TABLE]
Thus μ is not a counterexample and the proof is complete.
∎
It will be of great importance, especially for the proof of Lemma 5.9, to review the proof of Lemma 5.8 and give an explicit description of the removable node R we obtain with the properties of Lemma 5.8.
Let μ be an l-regular partition which is l-disconnected. Then by Lemma 5.8 we have that there is a co-suitable node R of μ such that μR is l-regular and len(Mull(μ))=len(Mull(μR)). By the proof of Lemma 5.8 we have that the node R is obtained in one of two different ways, depending on the shape of μ. We describe explicitly the two situations here. We write μ=(μ1∣μ2∣⋯∣μm) where μ1,…,μm are the (non-zero) Mullineux components. Let hi=len(μi) for 1≤i≤m. Let k be minimal such that (μ1∣⋯∣μk+1) is edge l-disconnected. Thus we have μ1i−μ1i+1+hi=l, for 1≤i<k and μ1k−μ1k+1+hk>l.
Case 1. Assume that there is some 1≤i≤k with μ1i>μ2i. Let s=max{i ∣μ1i>μ2i,1≤i≤k}. Then we have that the co-suitable node R with the above properties is the node R=Rs=(∑j<shj+1,μ1s).
Case 2. Assume that μ1i=μ2i for all 1≤i≤k. Let t be the minimal value of 1≤i≤k with the property that the Mullineux component μt has a removable node, say T, such that if R is the removable node of μ with μR=(μ1∣μ2∣⋯∣μTt∣⋯∣μk∣⋯∣μm) then μR is l-regular. The existence of this node is guaranteed by the fact that μ is l-disconnected. In this case it follows that, for some a, we have μj=(a−j+1)u(a−j)l−u−1 for 1≤j≤t−1 and μt=(a−t+1)uμu+1t…μhtt for some 2≤u≤l−1. Moreover the node R=((t−1)(l−1)+u,a−t+1) is the co-suitable node we obtain with the desired properties.
Some further Definitions, Notations and Remarks
(i) A weakly addable node for a partition λ is an element of N×N which has the form, (i,λi+1) for some 1≤i≤len(λ) or (len(λ)+1,1). Observe, that an addable node of λ is always a weakly addable node.
(ii) Let λ be a partition. We write λ as usual in the form λ=λ0+lλˉ, with λ0 be l-restricted. Let A=(i,λi+1) be an addable node for λ with 1≤i≤len(λ0)+1. We consider now A0=(i,λi0+1). This is a weakly addable node for λ0 and the nodes A and A0 have the same residue. We will refer to A0 as the weakly addable node of λ0 corresponding to the addable node A of λ.
(iii) Let λ=λ0+lλˉ be a non-restricted partition. Let A0=(i,λi0) be a removable node of λ0 such that λA00 is a restricted partition. Then A=(i,λi) is a removable node for λ and λA=λA00+lλˉ.
Moreover A and A0 have the same residue.
Lemma 5.9**.**
Let λ=λ0+lλˉ be a non-restricted partition with len(λˉ)≤len(λ0). Let μ=(λ0)′. Assume that μ is edge l-disconnected. Then there is a suitable node S=(i,λi) of λ such that:
(i) the node S0=(i,λi0) is a suitable node of λ0 and λA0 is l-restricted; and
(ii) the node R=(λi0,i) is a co-suitable node of μ such that μR is l-regular and len(Mull(μ))=len(Mull(μR)).
Proof.
We will produce the node S of λ with the above properties using the co-suitable nodes of μ described in Lemma 5.8.
There is a co-suitable node R of μ such that μR is l-regular and
len(Mull(μ))=len(Mull(μR)). By the discussion following the proof of Lemma 5.8 we may produce R according to one of the cases below.
We write μ=(μ1∣μ2∣⋯∣μm) where μ1,…,μm are
the (non-zero)
Mullineux components. Let hi=len(μi) for 1≤i≤m. Let k be minimal such that (μ1∣⋯∣μk+1) is edge l-disconnected. Thus we have μ1i−μ1i+1+hi=l, for 1≤i<k and μ1k−μ1k+1+hk>l.
Case 1. Assume that μ1i>μ2i for some 1≤i≤k and s=max{i ∣μ1i>μ2i,1≤i≤k}. Then we have that R=Rs=(∑j<shj+1,μ1s). We consider first the transpose node S0=(μ1s,∑j<shj+1) of λ0. Since Rs is co-suitable and μRs is l-regular we have that S0 is suitable and λS00 is l-restricted. We take now the node S=(μ1s,∑j<shj+1+lλˉμ1s) of λ. The node S is removable. Hence, it remains to prove that is also suitable. We assume for a contradiction that it is not. Then there is an addable node, say U=(r,λr), of λ below S with the same residue as S. Since len(λˉ)≤len(λ0) we can take now the corresponding weakly addable node U0=(r,λr0+1) of λ0. We have that res(U0)=res(U).
We consider now the transpose node V=(λr0+1,r). We have that res(V)=res(Rs). Moreover, since U0 is a weakly addable node of λ0 appearing lower than S0 we get that V can only have one of the following forms: V=(1,μ1+1); V=(∑j<ihj+1,μ1i+k) for some 1<i≤s with 1≤k≤μhi−1i−1−μ1i ; or V=(∑j<ihj+ℓ,μℓi+k) for some 1≤i<s and 2≤ℓ≤hi with 1≤k≤μℓ−1i−μℓi.
We can exclude directly the case V=(1,μ1+1) because in this case V is an addable node of μ and since res(V)=res(Rs), this contradicts the fact that Rs is co-suitable.
Let V=(∑j<ihj+1,μ1i+k) for some 1<i≤s with 1≤k≤μhi−1i−1−μ1i. We compare the residue of V with the residue of the node Ri=(∑j<ihj+1,μ1i). By Step 1 of the proof of Lemma 5.8 we have that res(Ri)=res(Rs) and so res(V)=res(Ri). Therefore, we get that μ1i−∑j<ihj−1 is μ1i+k−∑j<ihj−1 mod l. Thus k must be congruent to 0 mod l. However, this is not the case since μhi−1i−1−μ1i<μ1i−1−μ1i+hi−1=l and so 1≤k<l. Therefore we have a contradiction.
We have now the final case where V=(∑j<ihj+ℓ,μℓi+k) for some 1≤i<s and 2≤ℓ≤hi with 1≤k≤μℓ−1i−μℓi. We compare the residue of V with the residue of the node Ri=(∑j<ihj+1,μ1i). Since res(Ri)=res(Rs) we get that res(V)=res(Ri). In particular we deduce that the nodes (1,μ1i) and (ℓ,μℓi+k) have the same residue. This contradicts the Remark 5.7. Therefore we have that the node S is a suitable node for λ.
We examine now the situation where the node R is obtained from the second form of the partition μ as described in the remarks following Lemma 5.8.
Case 2. In this case we have that μ1i=μ2i for all 1≤i≤k. Let t be the minimal value of 1≤i≤k with the property that the Mullineux component μt has a removable node, say T, such that if R is the removable node of μ with μR=(μ1∣μ2∣⋯∣μTt∣⋯∣μk∣⋯∣μm), then μR is l-regular. Then, for some a, we have μj=(a−j+1)u(a−j)l−u−1 for 1≤j≤t−1 and μt=(a−t+1)uμu+1t…μhtt for some 2≤u≤l−1 and the node R=((t−1)(l−1)+u,a−t+1) is the co-suitable node of μ with the properties of Lemma 5.8. We consider the transpose node S0=(a−t+1,(t−1)(l−1)+u) of λ0. Since R is co-suitable and μR is l-regular S0 is suitable and λS00 is l-restricted. We take now the node S=(a−t+1,(t−1)(l−1)+u+lλˉa−t+1) of λ. The node S is removable. Hence, it remains to prove that is also suitable. We assume for contradiction that is not. Then there is an addable node, say U=(r,λr), of λ below S with the same residue with S. Since len(λˉ)≤len(λ0) we can take now the corresponding weakly addable node U0=(r,λr0+1) of λ0. We have that res(U0)=res(U).
We consider now the transpose node V=(λr0+1,r). We have res(V)=res(R). Moreover, since U0 is a weakly addable node of λ0 appearing lower than S0 we get that V can only have one of the following forms: V=(1,a+1); or V=((j−1)(l−1)+u+1,a−j+1) for 1≤j≤t−1. Here the node V is always an addable node of μ and so res(V)=res(R) contradicts the fact that R is co-suitable. Therefore we deduce again that the node S of λ is a suitable node and the proof is complete.
∎
We finish this section with a Remark which follows immediately from Lemma 5.4.
Remark 5.10**.**
Let λ=(λ1,λ2,…,λm) be an l-restricted partition. The simple module L(λ) appears as composition factor of ∇(μ), for some partition μ with len(μ)<m if and only if len(core(λ))<m.
Proof.
Assume first that there is a partition μ with len(μ)<m and [∇(μ):L(λ)]=0. Since core(λ)=core(μ) we get immediately that
[TABLE]
Assume now that [∇(μ):L(λ)]=0 for every partition μ with len(μ)<m. Then by Proposition 3.2 we get that len(Mull(λ′))=m. Therefore, by the formula for len(Mull(λ′)) given in the beginning of section 4 we have that
[TABLE]
The first case gives that el(λ′)=λ1+m>e(λ′) which of course is impossible. Hence, we have that only the second case is possible. Therefore, el(λ′)=m+λ1−1=e(λ′) and l∤el(λ′). Thus, λ is edge l-connected and l∤el(λ′). Therefore by Lemma 5.4 we have that core(λ′)1=m and so len(core(λ))=m.
∎
6 The Main Results on Composition Factors
Proposition 6.1**.**
Let m be a positive integer. Suppose that a partition λ can be written in the form λ=λ(1)+⋯+λ(s), where λ(i) is an mi-distinguished (not necessarily restricted) partition and m=m1+⋯+ms. Then λ is m-special.
Proof.
Lemma 2.4 immediately reduces considerations to the case s=1. So we assume that λ is m-distinguished. We write λ=λ0+lλˉ for λ0,λˉ∈Λ+(n) with λ0 restricted and m-distinguished and λˉ1<m. From Corollary 4.7 we may assume that λˉ=0. Suppose that λˉ1<m−1. Then L(λ0) is a composition factor of L(α)⊗L(μ), for α,μ∈Λ+(n), where α is restricted, 1-distinguished and μ is restricted and (m−1)-distinguished, by Proposition 5.3. But now, μ+lλˉ is (m−1)-distinguished so, by induction on m, we have that L(μ+lλˉ)=L(μ)⊗L˙(λˉ)F is a composition factor of Sˉ(E)⊗(m−1) and hence L(α)⊗L(μ)⊗L˙(λˉ)F appears as a section of Sˉ(E)⊗m. But L(α)⊗L(μ)⊗L˙(λˉ)F has a section L(λ0)⊗L˙(λˉ)F and so L(λ) is a composition factor of Sˉ(E)⊗m.
Thus we may assume λˉ1=m−1. Assume that len(λˉ)=len(λ). Then λ has final entry at least l. We consider reciprocity with respect to n=len(λ).
Now
μ=λ† has first entry at most m(l−1)−l=(m−1)l−m. Moreover, μ is m-distinguished, by Lemma 4.12 and writing μ=μ0+lμˉ, for partitions μ0,μˉ, with μ0 restricted, we have μˉ1<m−1. Hence, by the case already considered, μ is m-special and hence by Lemma 3.4, λ is m-special.
So we now suppose len(λˉ)=r<len(λ). If λ10=l−m then λ1=l−m+l(m−1)=m(l−1) so again by reciprocity with respect to n=len(λ) we obtain a partition μ=λ† of shorter length. By induction on length we may assume that μ is m-special and hence, by Proposition 3.5, λ is m-special.
Thus we may assume that len(λ)≤m and λ=(a1,…,am)+lλˉ, with l−m>a1≥⋯≥am≥0 and λˉ1=m−1, λˉ=(λˉ1,…,λˉr), 0<r<m. We set ν=λˉ−ωr. Then we have
[TABLE]
Now ν1=m−2 so we can write ν=α+β for partitions α,β with α1=m−r−1, β1=r−1. Then
(l−m+r,…,l−m+r,ar+1,…,am)+lα is (m−r)-distinguished and hence (m−r)-special and (a1+m−r,…,ar+m−l)+lβ is r-distinguished and hence r-special. Hence λ is the sum of an (m−r)-special and an r-special partition and hence, by Lemma 2.4, is m-special.
∎
Proposition 6.2**.**
Let λ be a partition and write λ=λ0+lλˉ, for partitions λ0,λˉ, with λ0 restricted. If λ is m-good then λ0 is m-good.
Proof.
If not, let λ=λ0+lλˉ be a counterexample of minimal degree. We have that len(λˉ)≤len(λ0). We see this in the following way. Let λ=(λ1,λ2,…,λn) and suppose len(λ0)<len(λˉ). Let λ^=(λ1,λ2,…,λn−1). By Proposition 3.6 λ^ is m-good and by the minimality of the degree of λ we get that λ^0 is m-good. Since len(λ0)<len(λˉ) we have that λ^0=λ0 and so λ0 is m-good and λ is not a counterexample. Therefore we assume from now on that len(λˉ)≤len(λ0).
We have len(λ0)≥m+1, for example by Lemma 2.2. We set μ=(λ0)′. Hence, μ is an l-regular partition with μ1≥m+1. Moreover, since λ0 is not m-good, we get by the Proposition 3.3, that len(Mull(μ))≥m+1.
*Case 1. * Assume that El(μ) is connected and that l∤el(μ). Then by Lemma 5.4 we have that core(μ)1=μ1≥m+1 and so len(core(λ0))≥m+1. But then len(core(λ))≥m+1, contradicting the fact that λ is m-good.
*Case 2. * Assume now that El(μ) is connected and l∣el(μ). Let λ~ be the partition obtained from λ by first row removal. Then by Proposition 3.6 we have that λ~ is m-good and by the minimality of degree we have that λ~0 is m-good. Let μ~ the transpose of λ~0. Hence μ~ is the partition obtained from μ after removing the first column. Therefore we get by Lemma 5.5 that len(Mull(μ~))=len(Mull(μ))≥m+1, contradicting the fact that λ~0 is m-good.
*Case 3. * Therefore, we are left with the case in which El(μ) is disconnected. By Lemma 5.9 there is a suitable node S=(i,λi) of λ with the following properties: S0=(i,λi0) is a suitable node of λ0; λS00 is l-restricted; the node R=(λi0,i) is a co-suitable node of μ; μR is an l-regular partition and; len(Mull(μR))=len(Mull(μ))≥m+1. We consider these three nodes here. Since S is a suitable node of λ we have that λS is m-good by Lemma 3.11. We write λS=λS00+lλˉ. By the minimality of the degree of λ we get that λS00 is m-good. We have that (λS00)′=μR. Hence, len(Mull(μR))≤m by Proposition 3.2. Therefore we have a contradiction.
∎
Corollary 6.3**.**
Let λ be a partition and write λ=λ0+lλˉ, for partitions λ0,λˉ, with λ0 restricted. If λ is m-special then λ0 is m-special.
Proof.
Let λ be m-special, then it is m-good and so by Proposition 6.2 we have that λ0 is m-good. By Proposition 3.2 we have then that λ0 is also m-special.
∎
Proposition 6.4**.**
Let m be a positive integer. Let λ be a partition and write λ=λ0+lλˉ for partitions λ0,λˉ, with λ0 restricted. Suppose λ0 is m-special and λ1≤m(l−1). Then λ can be written in the form λ=λ(1)+⋯+λ(s), where λ(i) is an mi-distinguished (not necessarily restricted) partition and m=m1+⋯+ms. In particular λ is m-special.
Proof.
By an admissible pair of sequences for a partition μ we mean a sequence
(k1,…,kt) of positive integers whose sum is m and a sequence
(μ(1),…,μ(t)) of partitions whose sum is μ and such that μ(i) is
ki-distinguished, for 1≤i≤t. Less formally, we shall say that μ=μ(1)+⋯+μ(t) is an admissible expression for μ. We shall write μ(i)0 for the restricted part and μˉ(i) for the non-restricted part, i.e., μ(i)0 and μˉ(i) are partitions, with μ(i)0 restricted, such that μ(i)=μ(i)0+lμˉ(i), for 1≤i≤t.
Suppose that the result is false and that λ is a partition of minimal degree for which it fails. By Proposition 4.10, λ is not restricted, i.e, λˉ=0. . We choose r>0 such that λˉ−ωr is a partition. We put
[TABLE]
where μˉ=λˉ−ωr. By minimality, μ is writable in the required form.
*Step 1. *If μ=μ(1)+⋯+μ(t) is an admissible expression for μ, with μ(i) a ki-distinguished partition, for 1≤i≤t, then μˉ(i)1=ki−1 for 1≤i≤t.
*Proof of Step 1. *If not then for some j we have μˉ(j)1<kj−1. Now putting
[TABLE]
we have that each λ(i) is ki-distinguished and λ=λ(1)+⋯+λ(t), contrary to assumption.
*Step 2. *If μ=μ(1)+⋯+μ(t) is an admissible expression for μ, with μ(i) a ki-distinguished partition, for 1≤i≤t then we have μ(i)10<l−ki for at least two values of i (with 1≤i≤t).
*Proof of Step 2. *If not then, after reordering, we can assume that μ(i)10=l−ki for 1≤i≤t−1 so we get
[TABLE]
contrary to the fact that λ1≤m(l−1).
From now on we take t to be minimal such that there exists an admissible expression μ=μ(1)+⋯+μ(t).
*Step 3. * There exists an admissible expression μ=μ(1)+⋯+μ(t) with μ(i)0=0 for some 1≤i≤t.
*Proof of Step 3. * Given an admissible pair S, say, for μ, consisting of the sequence
(k1,…,kt) of positive integers (whose sum is m) and sequence (μ(1),…,μ(t)) or partitions, we define index(S) to be the minimum of the set {ki∣1≤i≤t,μ(i)10<l−ki}. We consider admissible pairs for μ whose index h, say, is as small as possible. For such an admissible pair S we define the defect d(S) to be the minimum of the set {μ(i)10∣μ(i)10<l−ki,ki=h}. We further assume that S is such that the defect of S is as small as possible. If d(S)=0 then we are done so we assume that S has positive defect.
We arrange the terms in the admissible expression μ=μ(1)+μ(2)+⋯+μ(t) such that k1=h, d(S)=μ(1)10 and μ(2)10<l−k2 (using Step 2). Note that k1≤k2 by minimality of the index. We choose u>0 such that μ(1)0−ωu is a partition. Now by the definition of distinguished and the fact that μ(1)10<l−k1 we have that u≤k1. Since μ(2)10<l−k2 and k1≤k2 we have that μ(2)+ωu is k2-distinguished. But now, setting
[TABLE]
we obtain an expression μ=ν(1)+⋯+ν(t) and the corresponding admissible pair T, say, has index equal to the index of S (namely h) and smaller defect, a contradiction.
*Step 4. * Conclusion.
We write μ=μ(1)+⋯+μ(t) as in Step 3 and arrange the numbering so that μ(1)0=0 and μ(2)10<l−k2. If k1=1 then μˉ(1)1=0 so that μ(1)=0, contradicting the minimality of t. Thus we have k1>1. We choose u>0 such that μˉ(1)−ωu is a partition. Then μ(1)−lωu is (k1−1)-distinguished and μ(2)+lωu is (k2+1)-distinguished. Moreover, we have that
[TABLE]
is a an admissible expression for μ. Continuing in this way, we can find an admissible expression as above with k1=1, a contradiction.
The proof that λ may be written in the required form is complete. We get that λ is m-special from Proposition 6.1.
∎
We now put together Propositions 6.1 and 6.4 and Corollary 6.3 to give the main result of the paper.
Theorem 6.5**.**
Let m be a positive integer. A partition λ is m-special if and only if it can be written in the form λ=λ(1)+⋯+λ(s), where λ(i) is an mi-distinguished (not necessarily restricted) partition and m=m1+⋯+ms.
Proof.
A partition that is writable in the above form is m-special by Proposition 6.1. Suppose now that λ is m-special. Then, writing λ=λ0+lλˉ for partitions λ0, λˉ, with λ0 restricted, we have that λ0 is m-special, by Corollary 6.3. Moreover, since the simple module L(λ) is a composition factor of Sˉ(E)⊗m, we have λ1≤m(l−1). Hence λ is writable in the required form, by Proposition 6.4.
∎
Corollary 6.6**.**
Let m be a positive integer. A partition λ is m-special if and only if it is m-good and λ1≤m(l−1).
Proof.
If λ is m-special then it is m-good and λ1≤m(l−1). We now assume that λ is m-good and that λ1≤m(l−1). We write λ as λ=λ0+lλˉ for partitions λ0,λˉ with λ0 restricted. Then, by Proposition 6.2 we have that λ0 is m-good and so m-special by Proposition 3.2. Hence, since λ1≤m(l−1), we get by Proposition 6.4 that λ is m-special.
∎
We now consider λ∈Λ+(n) and apply the above in the case m=n.
Corollary 6.7**.**
Let λ∈Λ+(n). Then λ1≤n(l−1) if and only if we can write n as a sum of positive integers n1,…,ns and λ=λ(1)+⋯+λ(s) with λ(i)∈Λ+(n) an ni-distinguished partition, for 1≤i≤s.
Proof.
Clear from Proposition 6.4 and Corollary 6.6.
∎
Let G=G(n) and let E be the natural module. An element λ=(λ1,…,λn) of Λ+(n) is called n(l−1)-bounded if λ1≤n(l−1). For such a partition λ we define the truncated tensor product Sˉλ(E)=Sˉλ1(E)⊗⋯⊗Sˉλn(E). It is clear that if μ∈Λ+(n) is such that L(μ) is a composition factor of Sˉλ(E) then μ1≤n(l−1), i.e., μ is n(l−1)-bounded. One therefore obtains a square matrix of decomposition numbers ([Sˉλ(E):L(μ)]), with λ,μ running over n(l−1)-bounded partitions in Λ+(n). Doty conjectures (in the classical situation) that this matrix is non-singular, see [23], Conjecture 4.2.11. We note that each L(μ) with μ an n(l−1)-bounded partition, appears as the composition factor of some Sˉλ(E) - so at least the decomposition matrix conjectured to be non-singular contains no column consisting entirely of zeros.
Corollary 6.8**.**
Let G=G(n) and let E be the natural module. For each n(l−1)-bounded element μ of Λ+(n) there exists an n(l−1)-bounded partition λ∈Λ+(n) such that [Sˉλ(E):L(μ)]=0.
Proof.
Combining Theorem 6.5 and Corollary 6.7 we have that [Sˉ(E)⊗n:L(μ)]=0. Moreover, we have Sˉ(E)=⨁j=0n(l−1)Sˉj(E). Hence Sˉ(E)⊗n is a direct sum of modules of the form Sˉj1(E)⊗⋯⊗Sˉjn(E), for some 0≤j1,…,jn≤n(l−1). Such a module is has the character of Sˉλ(E), for some n(l−1)-bounded element λ of Λ+(n). Hence we have [Sˉλ(E):L(μ)]=0, for some n(l−1)-bounded element λ of Λ+(n),
∎
Acknowledgement
The second author gratefully acknowledges the financial support of EPSRC Grant EP/L005328/1.