This paper investigates how irreducible modules over alternating groups restrict to subgroups in small characteristics, providing new reduction theorems that narrow down possible subgroup-module configurations, especially in challenging small characteristic cases.
Contribution
It introduces new reduction theorems for irreducible restrictions of alternating group modules in small characteristics, extending previous results known for larger characteristics.
Findings
01
Reduction theorems restrict subgroup classes for irreducible restrictions
02
Analysis specific to small characteristics requires new techniques
03
Results contribute to the classification of maximal subgroups in finite classical groups
Abstract
We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the characteristic of the ground field is greater than 3, but the small characteristics cases require a substantially more delicate analysis and new ideas. In view of our earlier work on symmetric groups we may consider only the restriction of irreducible modules over alternating groups which do not extend to symmetric groups. This work fits into the Aschbacher-Scott program on maximal subgroups of finite classical groups.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Algebra and Geometry
Full text
Irreducible restrictions of representations of alternating groups in small characteristics: Reduction theorems
We study irreducible restrictions from modules over alternating groups to subgroups.
We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the characteristic of the ground field is greater than 3, but the small characteristics cases require a substantially more delicate analysis and new ideas. In view of our earlier work on symmetric groups we may consider only the restriction of irreducible modules over alternating groups which do not extend to symmetric groups. This work fits into the Aschbacher-Scott program on maximal subgroups of finite classical groups.
2010 Mathematics Subject Classification:
20C20, 20C30, 20E28
The first author was supported by the NSF grant DMS-1700905 and the DFG Mercator program through the University of Stuttgart. The second author was supported by the DFG grant MO 3377/1-1, the DFG Mercator program through the University of Stuttgart, and is also grateful to the University of Oregon for hospitality. The third author was supported by the NSF-grants DMS-1839351 and DMS-1840702. This work was also supported by the NSF grant DMS-1440140 and Simons Foundation while all three authors were in residence at the MSRI during the Spring 2018 semester.
1. Introduction
Let F be an algebraically closed field of characteristic p≥0. Denote by An the alternating group on n letters. We always assume that n≥5.
In this paper we are concerned with the following problem
Problem 1 (Irreducible Restriction Problem for Alternating Groups).
*Classify the subgroups G<An and FAn-modules V of dimension greater than 1 such that the restriction V↓G is irreducible.
*
This is a special case of the general Irreducible Restriction Problem where we have an arbitrary almost quasi-simple group in place of An.
A major application of the Irreducible Restriction Problem is to the Aschbacher-Scott program on maximal subgroups of finite classical groups, see [1, 26, 22, 13, 6] for more details on this. For the purposes of the applications to the Aschbacher-Scott program we may assume that G is also almost quasi-simple, but we will not be making this additional assumption.
For the case p=0, Problem 1 has been solved by Saxl [25].
Let us assume from now on that p>0. Indeed, it is the positive characteristic case which is important for the Aschbacher-Scott program. For p>3, Problem 1 is solved in
[20]. It is important to extend this to the case of characteristics 2 and 3.
However, there are formidable technical obstacles which make the small characteristics cases much more complicated. The most serious difficulty is that the submodule structure of certain important permutation modules over symmetric groups gets very complicated for p=2 and 3. This in turn necessitates a rather detailed study of branching for symmetric groups.
Let V be an irreducible FAn-module. If V lifts to the symmetric group Sn then the problem reduces to the Irreducible Restriction Problem for Symmetric Groups, which is studied in [7], where the problem is completely solved for p>3, and [17], where reduction theorems are obtained for the small characteristics cases. So in this paper we are concerned mostly with the case where V does not lift to Sn, and prove major reduction theorems for that case. These reduction theorems, together with the ones in [17], will play a key role in our future work [18], which will complete the solution of the Irreducible Restriction
Problem for both Sn and An (and G a maximal subgroup) in all characteristics.
To formulate our main result we recall some facts about irreducible representations of symmetric and alternating groups referring the reader to the main body of the paper for more details. The irreducible FSn-modules are labeled by the p-regular partitions of n. If λ is such a partition, we denote by Dλ the corresponding irreducible FSn-module. We refer the reader to [16, §11.1] for the definitions of combinatorial notions of a residue of a node and of a normal node.
It is known that Dλ↓Sn−1 is irreducible if and only if λ is in the explicitly defined class of Jantzen-Seitz (or JS) partitions which go back to [12, 14].
There is a special irreducible FSn-module in characteristic 2 called the basic spin module Dβn.
We denote by PpA(n) the set of all p-regular partitions of n such that Dλ↓An is reducible. If λ∈PpA(n) we have Dλ↓An≅E+λ⊕E−λ for irreducible FAn-modules E+λ≅E−λ. The set of partitions PpA(n) is well understood—if p=2 it is described explicitly in [2] while for p>2 these are exactly the partitions which are fixed by the Mullineux bijection, see [24, 9, 3].
We formulate our main results for all characteristics, although they are only new for p=2 and 3:
Theorem A**.**
Let n≥5, λ∈PpA(n) and G≤An. If E±λ↓G is irreducible then one of the following statements holds.
(i)
G* is primitive.*
2. (ii)
G≤An−1, and either
(a)
λ* is JS, or*
2. (b)
λ* has exactly two normal nodes, both of residue different from [math].*
3. (iii)
G≤An−2,2* and λ is JS.*
4. (iv)
p=2, n≡2(mod 4) and λ=βn.
The exceptional case (i) in Theorem A will be treated in [18], and the exceptional cases (ii), (iii), (iv) are addressed in Theorems B, C, D, respectively.
Theorem B**.**
Let n≥5, λ∈PpA(n). Then E±λ↓An−1 is irreducible if and only if one of the following statements holds.
(a)
λ* is JS.*
2. (b)
λ* has exactly two normal nodes, both of residue different from [math].*
We point out that the irreducible restrictions of the form E±λ↓An−1 for p>2 have been classified in [4, Theorem 5.10], see also [20, Proposition 3.7]. For p=2 partial information is available in [4, Theorem 6.5 and Proposition 6.6], but Theorem B says more. The irreducible restrictions E±λ↓An−2,2 for p>2 have been classified in [20, Theorem 3.6], but for p=2 the following theorem is new.
Theorem C**.**
Let n≥5 and λ∈PpA(n). If p=2, assume in addition that λ=βn. Then the following are equivalent:
(i)
E±λ↓An−2,2* is irreducible;*
2. (ii)
E±λ↓An−2* is irreducible;*
3. (iii)
λ* is JS.*
The case λ=βn, excluded in Theorems A(iv) and C, is handled in the following theorem (note that the condition n≡2(mod 4) is equivalent to βn∈P2A(n)).
Theorem D**.**
Let p=2, n≡2(mod 4) and G≤An. If E±βn↓G is irreducible then one of the following statements
holds.
(i)
G* is primitive.*
2. (ii)
G≤An−k,k* for some 1≤k<n, and either
n≡0(mod 4) and k is odd, or k≡2(mod 4). Moreover, in all of these cases E±βn↓An−k,k is irreducible.*
3. (iii)
G≤(Sa≀Sb)∩An* for a,b>1 with n=ab, and either a is odd or a≡2(mod 4) and b=2. Moreover, in all of these cases E±λ↓(Sa≀Sb)∩An is irreducible.*
Theorems A, B, C, D are proved in §§ 5.6, 5.2, 5.3, 6.3 respectively.
2. Preliminaries
2.1. Groups and modules
Throughout the paper we work over a fixed algebraically closed ground field F of characteristic p>0. We do not yet assume that p=2 or 3 but will do this when necessary.
For a group G, we denote by \text{\boldmath1}_{G} the trivial FG-module. For an FG-module V, we denote by VG the set of G-invariant vectors in V. If L1,…,La are irreducible FG-modules, we denote by L1∣⋯∣La a uniserialFG-module with composition factors L1,…,La listed from socle to head. If V is an FG-module, we use the notation
[TABLE]
to indicate that V is isomorphic to a direct sum of the uniserial modules L1∣⋯∣La, …, K1∣⋯∣Kb. On the other hand, if V1,…,Va are any FG-modules, we write
[TABLE]
to indicate that V has a filtration with subquotients V1,…,Va listed from bottom to top.
We use the notation
[TABLE]
to indicate that V≅X⊕⋯⊕Y for X∼L1∣⋯∣La, …, Y∼K1∣⋯∣Kb.
For an odd element σ∈Sn and an FAn-module V, we denote by Vσ the FAn-module which is V as a vector space with the twisted action g⋅v=σgσ−1v for g∈An,v∈V.
If G is a subgroup of Sn (resp. An), we consider the induced modules
[TABLE]
For G≤An we have
I(G)↓An≅J(G)⊕J(G)σ.
For a composition μ=(μ1,…,μr) of n and positive integers a,b with ab=n, we have the subgroups
[TABLE]
2.2. Partitions
We denote by P(n) the set of all partitions of n and by Pp(n) the set of all p-regular partitions of n, see [11, 10.1].
We identify a partition λ=(λ1,λ2,…) with its Young diagram{(r,s)∈Z>0×Z>0∣s≤λr}.
The number of non-zero parts of a partition λ is denoted by h(λ). The following partition will play a special role in this paper:
[TABLE]
We denote by λ↦λM the Mullineux bijection on Pp(n), see [9, 3, 24]. If p=2, the Mullineux bijection is the identity map.
For partitions μ1=(μ11,…,μh11)∈P(n1),…,μk=(μ1k,…,μhkk)∈P(nk), we define the composition
[TABLE]
of n1+⋯+nk.
For a partition λ=(λ1,…,λh) of n, we now define its double
Suppose that n≥5 and λ∈PpA(n). Then h(λ)≥3 unless p=2, n≡2(mod 4) and λ=βn.
Proof.
For p=2 this is clear from the definition.
For p>2 the result is contained in [20, Lemma 1.8(i)]. ∎
Let
I:=Z/pZ
identified with {0,1,…,p−1}.
Given a node A=(r,s) in row r and column s, we consider its residueresA:=s−r(mod p)∈I.
Let i∈I and λ∈P(n).
A node A∈λ (resp. B∈λ) is called i-removable (resp. i-addable) for λ
if resA=i and λA:=λ∖{A} (resp. λB:=λ∪{B}) is a Young diagram of a partition.
We refer the reader to [16, §11.1] for the definition of i-normal, i-conormal, i-good, and i-cogood nodes for λ.
We denote
[TABLE]
If εi(λ)>0, let A be the i-good node of λ and set
e~iλ:=λA.
If φi(λ)>0, let B be the i-cogood node for λ and set
f~iλ:=λB.
Then e~iλ and f~iλ are p-regular, whenever λ is so.
We call λ∈Pp(n) a JS partition if λ has only one normal node, equivalently ∑i∈Iεi(λ)=1. We will need the following technical result on JS partitions for p=3:
Lemma 2.5**.**
Let λ∈P3A(n) be a JS partition. Then one of the following holds:
(i)
λ1≥λ2+9, λ3≥7, λ1≤(n+2)/2, and n≥4h(λ).
2. (ii)
λ1≥λ2+7≥λ3+10, λ4≥6, λ1+λ2≤(n+8)/2, h(λ)≥6 and n≥6h(λ).
3. (iii)
λ1≥λ2+4≥λ3+8, λ4≥4, λ1+λ2≤(n+8)/2, h(λ)≥6 and n≥6h(λ).
4. (iv)
λ* is one of the following: (1), (4,12), (7,3,2), (10,42), (13,6,5), (7,3,2,1), (10,42,1), (13,6,5,1), (10,6,32,12), (13,6,5,4,12), (13,9,5,4,3,2,1).*
Proof.
Let \left(\begin{array}[]{ccc}a_{0}&\dots&a_{k}\\
r_{0}&\dots&r_{k}\end{array}\right) be the Mullineux symbol of λ, and let λ(0)=λ,λ(1),…,λ(k) be obtained by recursively removing the 3-rim.
From [5, Theorem 4.1] we have that \left(\begin{array}[]{c}a_{k}\\
r_{k}\end{array}\right)=\left(\begin{array}[]{c}1\\
1\end{array}\right) and that for 0≤j<k:
•
if \left(\begin{array}[]{c}a_{j+1}\\
r_{j+1}\end{array}\right)=\left(\begin{array}[]{c}6c+1\\
3c+1\end{array}\right) then \left(\begin{array}[]{c}a_{j}\\
r_{j}\end{array}\right)=\left(\begin{array}[]{c}6(c+1)-1\\
3(c+1)\end{array}\right),
•
if \left(\begin{array}[]{c}a_{j+1}\\
r_{j+1}\end{array}\right)=\left(\begin{array}[]{c}6c-1\\
3c\end{array}\right) or \left(\begin{array}[]{c}a_{j+1}\\
r_{j+1}\end{array}\right)=\left(\begin{array}[]{c}6c\\
3c\end{array}\right) then \left(\begin{array}[]{c}a_{j}\\
r_{j}\end{array}\right)=\left(\begin{array}[]{c}6c\\
3c\end{array}\right) or \left(\begin{array}[]{c}a_{j}\\
r_{j}\end{array}\right)=\left(\begin{array}[]{c}6c+1\\
3c+1\end{array}\right).
Note in particular that h(λ)=r0 is of the form 3c or 3c+1 for some c≥0.
Claim 1: *if h(λ) is of the form 3c or 3c+1 then n≥2ch(λ). *
Indeed, if h(λ)=3c then \left(\begin{array}[]{c}6j-5\\
3j-2\end{array}\right)=\left(\begin{array}[]{c}6(j-1)+1\\
3(j-1)+1\end{array}\right) and \left(\begin{array}[]{c}6j-1\\
3j\end{array}\right) appear as column of the Mullineux symbol for each 1≤j≤c. So
[TABLE]
while if h(λ)=3c+1 then similarly
[TABLE]
Claim 2: if n≥42 then n≥6h(λ).
Indeed, if c≥3 then n≥6h(λ) by Claim 1, so we may assume that c≤2, in which case h(λ)≤7 and if n≥42 then n≥6h(λ).
The next two claims are easy to see.
Claim 3: *If λ1(j)≥λ2(j)+3≥…≥λm(j)+3(m−1)
for some 1≤j≤k and m≥2
then λs(j−1)−λs+1(j−1)≥λs(j)−λs+1(j) for all 1≤s<m. *
Claim 4: λl(j−1)≥λl(j)* for all 1≤j≤k and l≥1.*
Claim 5: if h(λ(j))≥3c and λ1(j)+…+λc(j)≤(∣λ(j)∣+b)/2 for some 1≤j≤k, c∈Z>0 and b∈Z, then λ1(j−1)+…+λc(j−1)≤(∣λ(j−1)∣+b)/2.
Indeed, using the fact that h(λ(j))=rj and λM=λ, we deduce that aj−1≥6c. So
[TABLE]
Claim 6: *if 1≤j≤k, ∣λ(j)∣≥42 and λ(j) satisfies (i) (resp. (ii), resp. (iii)), then so does λ. *
We provide the proof for the condition (i), the conditions (ii) and (iii) are treated similarly. The condition λ1≥λ2+9 is deduced using Claim 3 with m=2. The condition λ3≥7 comes from Claim 4. The condition λ1≤(n+2)/2 comes from Claim 5 with c=1 and b=2 since λ3≥7 of course implies h(λ)≥3. The condition n≥4h(λ) comes from Claim 2.
For n<42 the lemma holds by inspection (the exceptional cases are listed in part (iv)). Assume that n≥42. Pick j maximal such that ∣λ(j)∣≥42. Then ∣λ(j+1)∣<42 and by inspection again we see that (i), (ii) or (iii) holds for λ(j). The proof is completed using Claim 6.
∎
2.3. Irreducible modules over symmetric and alternating groups
We use James’ notation
{Dλ∣λ∈Pp(n)} for the set of the irreducible FSn-modules up to isomorphism, see [11, §11].
For example, D^{(n)}\cong\text{\boldmath1}_{{\sf S}_{n}}. By [12] and [14], Dλ↓Sn−1 is irreducible if and only if λ is JS. The following much more general result is contained in [16, Theorems 11.2.10] and [15, Theorem 1.4].
Lemma 2.6**.**
Let λ∈Pp(n), i∈I and r∈Z≥0. Then:
(i)
eirDλ≅(ei(r)Dλ)⊕r!;
2. (ii)
ei(r)Dλ=0* if and only if r≤εi(λ), in which case ei(r)Dλ is a self-dual indecomposable module with socle and head both isomorphic to De~irλ.*
3. (iii)
if Dμ is a composition factor of ei(r)Dλ then εi(μ)≤εi(λ)−r, with equality holding if and only if μ=e~irλ;
5. (v)
dimEndSn−1(Dλ↓Sn−1)=∑j∈Iεj(λ).
6. (vi)
Let A be a removable node of λ such that λA is p-regular. Then DλA is a composition factor of eiDλ if and only if A is i-normal, in which case [eiDλ:DλA] is one more than the number of i-normal nodes for λ above A.
To describe the irreducible FAn-modules, let us first suppose that p=2. For λ∈P2(n), by [2, Theorem 1.1],
we have Dλ↓An is irreducible if and only if λ∈P2A(n). In this case, we denote Eλ=Dλ↓An. On the other hand, if λ∈P2A(n), then Dλ↓An≅E+λ⊕E−λ for irreducible FAn-modules E+λ≅E−λ. Moreover
[TABLE]
is a complete set of irreducible FAn-modules up to isomorphism.
Now, let p>2. We denote by sgn the sign module over Sn. Then by [9] (see also [3]), we have Dλ⊗sgn≅DλM, and Eλ:=Dλ↓An≅DλM↓An is irreducible if and only if λ=λM. If λ=λM, i.e. λ∈PpA(n), we have Dλ↓An≅E+λ⊕E−λ for irreducible FAn-modules E+λ≅E−λ. By Clifford theory,
[TABLE]
is a complete set of irreducible FAn-modules, and
Eλ≅EλM for λ∈Pp(n)∖PpA(n) are the only non-trivial isomorphisms among these.
For any p we now have that (E±λ)σ≅E∓λ for σ∈Sn∖An and λ∈PpA(n).
It follows that if G=σGσ−1 is a subgroup of An then E+λ↓G is irreducible if and only if E−λ↓G is irreducible. For example, this applies to the subgroups of the form Aμ and Ga,b.
Lemma 2.7**.**
Let V be an FSn-module, W be an FAn-module and μ∈Pp(n)∖PpA(n).
(i)
If there is ψ∈HomSn(W↑Sn,V) such that [imψ:Dμ]=0 then there exists ψ′∈HomAn(W,V↓An) such that [imψ′:Eμ]=0.
2. (ii)
If there is ψ∈HomSn(V,W↑Sn) such that [imψ:Dμ]=0 then there exists ψ′∈HomAn(V↓An,W) such that [imψ′:Eμ]=0.
Proof.
We prove (i), the proof of (ii) being similar. Since W↑Sn↓An≅W⊕Wσ, there exists ψ′ as required or there exists ψ′′∈HomAn(Wσ,V↓An) such that [imψ′′:Eμ]=0. In the second case, twisting ψ′′ with σ yields the required ψ′.
∎
Lemma 2.8**.**
Let n≥8, λ∈Pp(n), and S4×S4≤S8≤Sn be natural subgroups. Then Dλ↓S4×S4 has a composition factor of the form Dμ⊠Dν with dimDμ>1 and dimDν>1, unless λ or λM belongs to {(n),(n−1,1)}.
Proof.
If n=8 this is an easy explicit check. Now the result follows by induction using [21, Proposition 2.3].
∎
2.4. Some special permutation modules
For a 2-row partition (n−k,k), we use the special notation
[TABLE]
(when it is clear what n is).
If (n−k,k)∈Pp(n), we also denote
[TABLE]
By Lemma 2.4, we almost always have (n−k,k)∈PpA(n),
in which case
Ek≅E(n−k,k) is irreducible.
Let 0≤k≤n/2 and G≤Sn. We denote by ik(G) the number of G-orbits on Ωk. Note that
[TABLE]
We will need the following information on the structure of some special permutation modules.
Theorem 2.10**.**
[17, Lemmas 4.3, 4.4, 4.5]* Let p=3 and n≥6. Then*
[TABLE]
Further
(i)
If n≡0(mod 3) then M3∼S2∗⊕((D0⊕S1∗)∣S3∗).
2. (ii)
If n≡1(mod 3) then M3∼S1∗⊕((D0⊕S2∗)∣S3∗).
3. (iii)
If n≡2(mod 3) then M3∼M2∣S3∗.
Theorem 2.11**.**
[17, Lemmas 4.6, 4.7, 4.9]*
Let p=2 and n≥7. Then M1∼D0∣S1∗. Further*
(i)
If n≡0(mod 4) then
[TABLE]
2. (ii)
If n≡1(mod 4) then
[TABLE]
3. (iii)
If n≡2(mod 4), then
[TABLE]
4. (iv)
If n≡3(mod 4), then
[TABLE]
Lemma 2.12**.**
Let n≥5, and λ∈Pp(n) be such that dimDλ>1. If p=2 assume further that λ=βn. Then there exists ζ2∈HomSn(M2,EndF(Dλ)) with [imζ2:D2]=0.
Proof.
This follows from [17, Corollary 6.4] and [19, Lemma 3.8].
∎
Lemma 2.13**.**
Let n≥7, and λ∈Pp(n) with h(λ),h(λM)≥3. Then there exists ζ3∈HomSn(M3,EndF(Dλ)) with [imζ3:D3]=0.
Proof.
This follows from [17, Corollaries 6.7, 6.10] and
[7, Lemmas 3.1,3.2 and Corollary 3.9].
∎
2.5. Invariants
In this subsection we will compute some invariants (Sk∗)G for small k. We use the standard basis v1,…,vn in M1 and the corresponding elements vˉ1,…vˉn∈S1∗=M1/⟨∑j=1nvj⟩ so that {vˉ1,…,vˉn−1} is a basis of S1∗.
Let Ωn be the set of all 2-element subsets of {1,…,n} .
We use the standard basis
{vA∣A∈Ωn} in M2 and write vi,j:=v{i,j} for {i,j}∈Ωn. It is easy to check that S2∗≅M2/K, where
[TABLE]
Set vˉA:=vA+K∈M2/K=S2∗. Then
[TABLE]
is a basis of S2∗, and
[TABLE]
Lemma 2.14**.**
Let n≥5, 1≤k≤n/2, and G=An−k,k. Then dim(S1∗)G=dim(S2∗)G=1, with the only exception (S2∗)An−1=0.
Proof.
For S1∗ this is an easy explicit check left to the reader. For S2∗, assume first that k=1. Then, acting with An−3, we deduce that x∈(S2∗)G must be of the form
[TABLE]
for c,d,e∈F. Acting with (1,2)(n−2,n−1) gives e=d and acting with (1,2)(n−3,n−2) then gives c=d=0.
The case k=2 is handled similarly, giving e=0 and c=d, which gives a non-trivial invariant if c=1.
Let k>2. Note that ∑A∈Ωn−kvˉA∈(S2∗)G. If k≥3, then acting with An−k,k−3, we deduce that x∈(S2∗)G must be of the form
[TABLE]
for some a,b,c,d,e,f,g∈F. In view of the invariant already found, we may assume that a=0 and then prove that x=0. Acting with (1,2)(n−1,n) we get f=g=0. Then acting with (1,2)(n−2,n−1) we get c=e=0. In the case k=3 we are done since then the two remaining sums are empty, and we done. Otherwise,
acting with (1,2)(n−3,n−2) we get b=d=0.
∎
Lemma 2.15**.**
Let Ga,b≤Sn for n=ab≥6. Then:
(i)
if a,b≥2 then dim(S1∗)Ga,b=0, unless p=b=2 in which case dim(S1∗)Ga,b=0
2. (ii)
if a,b≥3 then dim(S2∗)Ga,b=1.
Proof.
(i) is an easy explicit calculation similar to the proof of [17, Lemma 2.35].
(ii) For r=1,…,b, we set Br=[(r−1)a+1,ra]. For 1≤i=j≤n we write i∼j if i,j∈Br for some r. Starting with the invariant vector v:=∑i∼jvi,j∈M2, we express vˉ:=v+K∈S2∗ as
[TABLE]
which yields a non-zero vector in (S2∗)Ga,b. Let now x∈(S2∗)Ga,b. Acting with ((Sa≀Sb−1)×S{n−a+1,…,n−3})∩An and subtracting a multiple of vˉ, we may assume that
[TABLE]
Acting with (1,2)(n−1,n), we get that d=g=0. Acting with (1,2)(n−2,n−1), we get c=f=0. If a=3, then the sums with coefficients b and e are empty. Otherwise, acting with (1,2)(n−3,n−2) yields b=e=0. Now using the permutation which swaps the last two blocks Bb and Bb−1 (possibly multiplied with (1,2)), we get a=0.
∎
3. Branching lemmas
In this section we prove some technical lemmas on branching for symmetric groups.
3.1. Some special composition factors
In this subsection we prove some technical results concerning special composition factors in Dλ↓Sk.
Lemma 3.1**.**
Let n,m∈Z>0, and λ=(a1b1,…,akbk)∈Pp(n+m) with a1>…>ak>0 and b1,…,bk>0.
Set hr:=b1+…+br for 0≤r≤k.
Suppose that there is 1≤j≤k and a composition ν=(ν1,…,νhj) of n such that μ:=λ−ν is a p-regular partition of m and
(λ1,…,λhj) is JS.
If
[TABLE]
and
[TABLE]
then Dμ is a composition factor of Dλ↓Sm.
Proof.
In view of Lemma 2.6(v), it suffices to see that there exists a sequence A1,…,An of nodes such that Ar is normal for λ∖{A1,…,Ar−1} and λ∖{A1,…,Ar} is p-regular for r=1,…n, and λ∖{A1,…,An}=μ.
Such a sequence is obtained by removing the nodes of λ∖μ in the ends of rows
[TABLE]
if there are any, then starting over in the row h1 and proceeding in the same order until all the nodes of λ∖μ are exhausted.
∎
Remark 3.2**.**
For p=2 the assumptions on ν in Lemma 3.1 are equivalent to ν∈P(n), and so Lemma 3.1 generalizes [17, Lemma 3.14].
Let p=2. Then λ∈P2(n) is JS if and only if all its parts λr are of the same parity. We now describe a procedure which assigns to every partition λ∈P2(n) a JS-partition λJS∈P2(m) for m≤n. If λ is already JS then λJS will return λ. We begin by setting λ1:=λ. For r≥1, as long as λr+1r>0 define λr+1 as follows. If λr+1r≡λrr(mod 2) then λr+1:=λr. If instead λr+1r≡λrr(mod 2) let l≥r+1 be minimal such that λl+1r>λlr+1 or such that λl+1r=0 and define
[TABLE]
Let s be minimal with λs+1s=0. Take λJS:=λs.
Lemma 3.3**.**
Let p=2 and λ∈P2(n). Then λJS is a 2-regular JS partition of m≤n. Moreover, denoting h:=h, we have:
(i)
λJS=λ* if and only if λ is JS.*
2. (ii)
DλJS* is a composition factor of Dλ↓Sm.*
3. (iii)
λjJS−λj+1JS≤2⌈(λj−λj+1)/2⌉* for each j≥1.*
4. (iv)
0≤λj−λjJS≤j−1. In particular λh+1≤h.
5. (v)
if k is maximal such that λ2k−1>0 then ∣λJS∣≥(n+k)/2.
6. (vi)
if λhJS≥3 then λh+1≤1 and if λh+1=1 then λ1 is even.
7. (vii)
if λhJS=2 and λh−1JS≥6 then λh≤3.
8. (viii)
if λhJS=1 and λh−1JS≥5 then λh≤2.
Proof.
Let λ=λ1,…,λs=λJS be as in the construction. Then for all r=1,…,s, we have that λr is 2-regular, (λ1r,…,λrr) is JS. Moreover, to go from λr to λr+1 we remove normal nodes on each step. So by Lemma 2.6, Dλr+1 is a composition factor of Dλr↓S∣λr+1∣. The statement that λJS is a 2-regular JS partition as well as (i) and (ii) follow by induction, while (iv) holds by construction.
(iii) Notice that λjr+1−λj+1r+1≤λjr−λj+1r unless j=r and λjr−λj+1r is odd, in which case λjr+1−λj+1r+1=λjr−λj+1r+1.
(v) Using (iv) we have that
λiJS≥λi−i+1≥λ2i−1 for all i. So, by definition of k,
[TABLE]
(vi) Note that λhh=λhJS≥3 and λh+1JS=0. If some node had been removed from row h+1 of λ to obtain λh then λh+1h=λhh−1≥2 and then λh+1JS≥1, leading to a contradiction. So no node was removed from row h+1 of λ and then λh+1JS=0 implies λh+1≤1. Further if λh+1=1 then since λh+1JS=0 the node (h+1,1) needs to be removed on step h+1 of the construction, so (λ1h,…,λhh) is JS, while (λ1h,…,λhh,1) is not.
Hence λ1=λ1h is even.
(vii) and (viii) are proved similarly to (vi).
∎
Lemma 3.4**.**
Let n≥12 be even, p=2 and λ∈P2A(n). Exclude the cases where λ is the double of one of the following partitions:
[TABLE]
Then ∣λJS∣≥n/2+5 and λ2j−1JS−λ2jJS≤2 for each j≥1.
Proof.
The inequalities λ2j−1JS−λ2jJS≤2 come from the assumption that λ∈P2A(n) and Lemma 3.3(iii).
If h(λ)≥17 then ∣λJS∣≥n/2+5 by Lemma 3.3(v). Moreover, by Lemma 3.3(iv),
[TABLE]
So the lemma holds if h(λ)(h(λ)−1)/2≤n/2−5.
So we may assume that h(λ)≤16 and h(λ)(h(λ)−1)/2>n/2−5. This leaves only a finite number of partitions to be considered. For these it can be checked, using GAP [10], that ∣λJS∣≥n/2+5, unless we are in one of the exceptional cases.
∎
3.2. Non-isomorphic composition factors
In this subsection we obtain various technical results which guarantee the presence of several non-isomorphic composition factors in the restriction Dλ↓Sk.
Lemma 3.5**.**
Let p=3, n be even and λ∈P3A(n) be a JS partition with λ=(4,1,1). Then Dλ↓Sn/2 has at least 5 non-isomorphic composition factors.
Proof.
By Lemma 2.5, λ is belongs to one of the families (i)-(iv) of that lemma. By the assumptions the only partitions from the family (iv) that need to be considered are (7,3,2), (10,42), (13,6,5), (10,6,32,12) and (13,6,5,4,12). For
λ=(7,3,2) the lemma can be checked using [11, Tables] and branching in characteristic [math]. For the remaining ones, the lemma can be proved using Lemma 3.1. So we may assume that we are in one of the cases (i), (ii), (iii) of Lemma 2.5. Let λ=(a1b1,…,ambm) with a1>…>am>0 and all bj>0. Define hj:=b1+…+bj.
Set λ0:=λ and then recursively define λi:=(λ1i−1−1,…,λh(λi−1)i−1−1). By Lemma 3.1, Dλi is a composition factor of Dλ↓S∣λi∣ for all i. Let k maximal such that ∣λk∣≥n/2. Let ν:=λ−λk. For any composition α=(α1,…,αhm) define α:=(αh1,…,α1,…,αhm,…,αhm−1+1), and let ν1=ν+(1n/2−∣ν∣). Note that ν1∈P(n/2). By Lemma 3.1, Dλ−ν1 is a composition factor of Dλ↓Sn/2. We will now construct ν2,…,ν5 and apply the same lemma to see that Dλ−ν1,…,Dλ−ν5 are distinct composition factors of Dλ↓Sn/2.
Case 1. λ is as in case (i) of Lemma 2.5. Note that b1=1 and k≥2 since n/2≥2h(λ).
Now, k≥2 and λ3≥7 imply ν11,ν21,ν31≥2. As λ1≤n/2+1 we have λ1−ν11≤n/2+1−2<n/2, so λ2−ν21>0.
We write ν1 in the ‘canonical’ form ν1=(c1,1,c1,2d1,2,c1,3d1,3,…) with c1,1≥c1,2>c1,3>… and d1,j>0, and then proceed to define
ν2,…,ν5 in the ‘canonical’ form
νi=(ci,1,ci,2di,2,ci,3di,3,…) recurrently according to the cases.
Case 1.1. d1,2≥2 or c1,2=c1,3+1. For 1≤i<5 define νi+1 recurrently by setting νi+1:=(ci,1+1,ci,2di,2−1,ci,2−1,ci,3di,3,ci,4di,4,…) (this form is not necessarily ‘canonical’, so we might have to rewrite into the ‘canonical’ form before the next recurrent step).
Case 1.2. d1,2=1, c1,2>c1,3+1, and either of the following conditions holds: d1,3≥2, c1,3=c1,4+1. In this case let ν2:=ν1+(1,−1,0,0,…), ν3:=ν2+(1,0,−1,0,0,…), ν4:=ν3+(1,0,0,−1,0,0,…) and ν5:=ν4+(1,−1,0,0,…).
Case 1.3. d1,2=d1,3=1, c1,2>c1,3+1>c1,4+2. In this case let ν2:=ν1+(1,−1,0,0,…), ν3:=ν2+(1,0,−1,0,0,…), ν4:=ν3+(1,−1,0,0,…) and ν5:=ν4+(1,0,−1,0,0,…).
Case 2. λ is as in case (ii) or (iii) of Lemma 2.5. Then b1=b2=1, and since n/2≥3h(λ), we have k≥3. Now, h(λ)≥6, λ4≥4 and k≥3 imply that ν1,ν2,ν3,ν4≥3. As λ1+λ2≤n/2+4 it then follows that λ3−ν31>0.
We will be writing νi in the ‘canonical’ form
νi=(ci,1,ci,2,ci,3di,3,ci,4di,4,…) with ci,1≥ci,2≥ci,3>ci,4>… and all di,j>0.
Case 2.1. d1,3≥2 or c1,3=c1,4+1. For 1≤i<5 define
[TABLE]
Case 2.2. d1,3=1, c1,3>c1,4+1, and either of the following conditions holds: d1,4≥2, c1,4=c1,5+1. In this case let ν2:=ν1+(1,0,−1,0,0,…), ν3:=ν2+(1,0,0,−1,0,0,…), ν4:=ν3+(1,0,0,0,−1,0,0,…) and ν5:=ν4+(1,0,−1,0,0,…) if λ1−λ2≥5 or ν5:=ν4+(0,1,−1,0,0,…) if λ1−λ2=4.
Case 2.3. d1,3=d1,4=1, c1,3>c1,4+1>c1,5+2. In this case let ν2:=ν1+(1,0,−1,0,0,…), ν3:=ν2+(1,0,0,−1,0,0,…), ν4:=ν3+(1,0,−1,0,0,…) and ν5:=ν4+(1,0,0,−1,0,0,…) if λ1−λ2≥5 or ν5:=ν4+(0,1,0−1,0,0,…) if λ1−λ2=4. ∎
Lemma 3.6**.**
Let p=2, λ∈P2(n) be a JS-partition and 5≤k≤n/2. Then Dλ↓Sn−k has at least three non-isomorphic composition factors, unless possibly one of the following holds:
•
λ=(n)**
•
n* is even and λ=(n−1,1),*
•
n* is even and λ=(n/2+2,n/2−2),*
•
n* is even and λ=(n/2+1,n/2−1),*
•
n* is odd and λ=((n+1)/2,(n−3)/2,1),*
•
n≡0(mod 3)* and λ=(n/3+2,n/3,n/3−2),*
•
n≥14* with n≡2(mod 3), λ=((n−2)/3+4,(n−2)/3,(n−2)/3−2) and k≡1(mod 3),*
•
n≥19* with n≡1(mod 3), λ=((n+2)/3+2,(n+2)/3,(n+2)/3−4) and k≡2(mod 3),*
•
h(λ)=3, λ1=λ2+2, λ2≥λ3+4 and k=5,
•
n≥22* with n≡4(mod 6), λ=((n−1)/3+2,(n−1)/3,(n−1)/3−2,1) and k≡0(mod 3),*
•
λ=(λ1,λ1−2,λ1−4,λ4)* and k=5,*
•
n≥20* with n≡0(mod 4) and λ=(n/4+3,n/4+1,n/4−1,n/4−3).*
Proof.
Let λ0:=λ and then recursively define λj:=(λ1j−1−1,…,λh(λj−i)j−1−1). Note that λj is JS.
Let aj:=∣λj∣−n+k. Since ∣λj∣−aj=n−k≥n/2, we have n≥2(n−∣λj∣+aj). Moreover, ∣λj∣/2≤n/2≤n−k=∣λj∣−aj implies aj≤∣λj∣/2. There is a unique i with 5≤ai≤h(λi)+4.
By Lemma 3.1, Dλj is a composition factor of Dλ↓S∣λj∣, so it suffices to show that for some j such that ∣λj∣≥n−k
there exist distinct composition factors Dμ,Dν,Dπ of Dλj↓Sn−k. We always assume that we are not in one of the excluded cases. We will repeatedly apply Lemma 3.1 without referring to it. We denote by δm the composition (0,…,0,1,0,…,0) with 1 in the mth position.
Case 1. ai≤h(λi). Then, using the fact that ai≥5, we can take μ=λi−δ1−⋯−δai, ν=λi−2δ1−δ2−⋯−δai−1, and π=λi−2δ1−2δ2−δ3−⋯−δai−2.
Case 2. ai=h(λi)+1≥6. Then we can take μ=λi−2δ1−δ2−⋯−δai−1, ν=λi−2δ1−2δ2−δ3−⋯−δai−2 and π=λi−3δ1−2δ2−δ3−⋯−δai−3.
Case 3. ai=h(λi)+2≥7. Then we can take μ=λi−2δ1−2δ2−δ3−⋯−δai−2, ν=λi−2δ1−2δ2−2δ3−δ4−⋯−δai−3 and π=λi−3δ1−2δ2−δ3−⋯−δai−3.
Case 4. ai=h(λi)+3≥8. Then we can take μ=λi−2δ1−2δ2−2δ3−δ4−⋯−δai−3, ν=λi−3δ1−2δ2−2δ3−δ4−⋯−δai−4 and π=λi−3δ1−2δ2−δ3−⋯−δai−3.
Case 5. ai=h(λi)+4≥9. Then we can take μ=λi−2δ1−2δ2−2δ3−2δ4−δ5−⋯−δai−4, ν=λi−3δ1−3δ2−2δ3−δ4−⋯−δai−5 and π=λi−3δ1−2δ2−2δ3−δ4−⋯−δai−4.
Case 6. h(λi)≤4. Note that ∣λi∣≥n/2+5≥10.
Case 6.1. h(λi)=1. By assumption λ=(n),(n−1,1). Since λ is JS, there exists 0≤j≤i−2 with λj=(λ1j,2). From j<i we have that aj>ai=5. So we can take μ=(λ1j−(aj−2)), ν=(λ1j−(aj−1),1) and π=(λ1j−aj,2) (notice that λ1j−aj>2 since n−k≥n/2≥5).
Case 6.2. h(λi)=2. In this case ai=5 or 6.
Case 6.2.1. λ2i=1. Then i≥1 and so λi−1=(λ1i+1,2), since λ=(n−1,1) is JS. So we can take μ=(λ1i−(ai−1)), ν=(λ1i−ai,1) and π=(λ1i−(ai+1),2).
Case 6.2.2. λ2i=2. Then we can take μ=(λ1i−(ai−2)), ν=(λ1i−(ai−1),1) and π=(λ1i−ai,2).
Case 6.2.3. λ2i≥3 and λ1i≥λ2i+6. Then we can take μ=(λ1i−⌈ai/2⌉,λ2i−⌊ai/2⌋), ν=(λ1i−⌈ai/2⌉−1,λ2i−⌊ai/2⌋+1) and π=(λ1i−⌈ai/2⌉−2,λ2i−⌊ai/2⌋+2).
Case 6.2.4. λ2i≥3 and λ1i=λ2i+4 (note that we cannot have λ1i=λ2i+5 since λi is JS).
Let μ=(λ1i−⌈ai/2⌉,λ2i−⌊ai/2⌋), ν=(λ1i−⌈ai/2⌉−1,λ2i−⌊ai/2⌋+1). To get the third composition factor, note that
by assumption λ=(n/2+2,n/2−2), so there exists 0≤j<i with λj=(λ1j,λ1j−4,1). In particular n≥∣λi∣+3≥13 and then n−k≥7. Now we take π=(λ1j−2−⌈(aj−2)/2⌉,λ1j−4−⌊(aj−2)/2⌋,1) (note that λ1j−4−⌊(aj−2)/2⌋>1 since 2(λ1j−4−⌊(aj−2)/2⌋)+3=n−k≥7).
Case 6.2.5. λ2i≥3 and λ1i=λ2i+2.
We can take μ=(λ1i−⌈ai/2⌉,λ2i−⌊ai/2⌋). To get two more composition factors, note that
since λ=(n/2+1,n/2−1),((n+1)/2,(n−3)/2,1) is JS, we have that i≥2 and there exists 0≤j≤i−2 with λj=(λ1j,λ1j−2,2). In this case n≥2(n−∣λi∣+ai)≥22 and so n−k≥11. So we can take ν=(λ1j−⌈(aj−1)/2⌉,λ1j−2−⌊(aj−1)/2⌋,1) and π=(λ1j−⌈aj/2⌉,λ1j−2−⌊aj/2⌋,2) (note that aj>ai≥5 and λ1j−2−⌊aj/2⌋>2 since 2(λ1j−2−⌊aj/2⌋)+5≥n−k≥11).
Case 6.3. h(λi)=3. In this case 5≤ai≤7.
Case 6.3.1. λ3i=1 and λ1i≥λ2i+6. Then we can take μ=(λ1i−⌈(ai−1)/2⌉,λ2i−⌊(ai−1)/2⌋), ν=(λ1i−⌈(ai+1)/2⌉,λ2i−⌊(ai−3)/2⌋) and π=(λ1i−⌈(ai+3)/2⌉,λ2i−⌊(ai−5)/2⌋).
Case 6.3.2. λ3i=1 and λ1i=λ21+4. Notice that λ1i is odd in this case. If λ1i≥9 then λ2i−⌊(ai−2)/2⌋≥λ1i−4−2>1. If λ1i≤7 then λi=(7,3,1) and ai=5 and then λ2i−⌊(ai−2)/2⌋>1 again. So we can take μ=(λ1i−⌈(ai−1)/2⌉,λ2i−⌊(ai−1)/2⌋), ν=(λ1i−⌈(ai+1)/2⌉,λ2i−⌊(ai−3)/2⌋) and π=(λ1i−⌈(ai+2)/2⌉,λ2i−⌊(ai−2)/2⌋,1).
Case 6.3.3. λ3i=1 and λ1i=λ21+2. Since ∣λi∣≥10 and λi is JS, we have λ1i≥7 and so λ2i≥5. We can take μ=(λ1i−⌈(ai−1)/2⌉,λ2i−⌊(ai−1)/2⌋), ν=(λ1i−⌈ai/2⌉,λ2i−⌊ai/2⌋,1). To get the third composition factor,
note that since λ=((n+1)/3,(n−3)/2,1), we have i≥1 and λi−1=(λ1i+1,λ1i−1,2). If λ1i≥9 then λ2i−⌊(ai+1)/2⌋≥λ1i−2−4>2. In this case we can take π=(λ1i−⌈(ai+1)/2⌉,λ2i−⌊(ai+1)/2⌋,2)=(λ1i−1−⌈(ai+3)/2⌉,λ2i−1−⌊(ai+3)/2⌋,λ3i−1).
If λ1i=7 then n≥∣λi−1∣=16 and ai−1≥8. It then follows that λ=λi−1=(8,6,2) and k=8. Notice first D(4,3,2) that is a composition factor of D(8,6,2)↓S9. From [11, Tables] we have that [D(4,3,2)]=[S(4,3,2)]−[S(8,1)]. Using branching rule in characteristic [math] and [11, Tables], it then follows that D(4,3,1), D(5,3) and D(6,2) are composition factors of D(8,6,2)↓S8.
Case 6.3.4. λ3i≥2, λ1i≥λ2i+4 and ai=5. In this case we can take μ=(λ1i−2,λ2i−2,λ3i−1), ν=(λ1i−3,λ2i−1,λ3i−1) and π=(λ1i−4,λ2i−1,λ3i).
Case 6.3.5. λ3i≥2, λ1i≥λ2i+4 and ai=6. In this case we can take μ=(λ1i−2,λ2i−2,λ3i−2), ν=(λ1i−3,λ2i−2,λ3i−1) and π=(λ1i−4,λ2i−1,λ3i−1).
Case 6.3.6. λ3i≥2, λ1i≥λ2i+6 and ai=7. In this case we can take μ=(λ1i−3,λ2i−2,λ3i−2), ν=(λ1i−4,λ2i−2,λ3i−1) and π=(λ1i−5,λ2i−1,λ3i−1).
Case 6.3.7. λ3i≥2, λ1i=λ2i+4, λ2i≥λ3i+4 and ai=7. In this case we can take μ=(λ1i−3,λ2i−2,λ3i−2), ν=(λ1i−4,λ2i−2,λ3i−1) and π=(λ1i−3,λ2i−3,λ3i−1).
Case 6.3.8. λ3i≥2, λ1i=λ2i+4, λ2i=λ3i+2 and ai=7. If h(λ)=3 then λ=((n−2)/3+4,(n−2)/3,(n−2)/3−2) (and n≡2(mod 3) and n≥14 since λ3≥λ3i≥2) and k=ai+3i≡1(mod 3), which is one of the excluded cases. Else there exists j<i with λj=(λ1j,λ1j−4,λ1j−6,1). If λ1i≥10 then λ1j=λ1i+i−j≥10+i−j and aj=ai+3(i−j)+1=8+3(i−j), so that we can take μ=(λ1i−3,λ2i−2,λ3i−2), ν=(λ1i−4,λ2i−2,λ3i−1) and π=(λ1j−3−(i−j),λ1j−7−(i−j),λ1j−8−(i−j),1).
If λ1i≤9 then λi=(8,4,2) or λi=(9,5,3). Since n≤2(n−k)=2(∣λi∣−ai) and n≥∣λj∣≥∣λi∣+4, this leads to a contradiction.
Case 6.3.9. λ3i≥2, λ1i=λ2i+2, λ2i≥λ3i+4, ai=5 and h(λ)=3. In this case i≥1, as otherwise we are in one of the excluded cases. Further λ2i≥λ3i+6, since else n≡1(mod 3), λ=((n+2)/3+2,(n+2)/3,(n+2)/3−4) and k=ai+3i=5+3i≡2(mod 3) (this is one of the excluded cases, since λ3>λ3i≥2, so that n≥19). So we can take μ=(λ1i−2,λ2i−2,λ3i−1), ν=(λ1i−3,λ2i−2,λ3i) and π=(λ1i−3,λ2i−3,λ3i+1)=(λ1i−1−4,λ2i−1−4,λ3i−1).
Case 6.3.10. λ3i≥2, λ1i=λ2i+2, λ2i≥λ3i+4, ai=5 and h(λ)≥4. In this case there exists 0≤j<i with λj=(λ1j,λ2j,λ3j,1). For this j we have that aj=ai+3(i−j)+1=3(i−j)+6. We can take μ=(λ1i−2,λ2i−2,λ3i−1), ν=(λ1i−3,λ2i−2,λ3i) and π=(λ1j−(i−j)−3,λ2j−(i−j)−3,λ3j−(i−j),1) (notice that λ3j=λ3i+i−j≥i−j+2).
Case 6.3.11. λ3i≥2, λ1i=λ2i+2, λ2i≥λ3i+4 and ai=6. Then we can take μ=(λ1i−2,λ2i−2,λ3i−2), ν=(λ1i−3,λ2i−2,λ3i−1) and π=(λ1i−3,λ2i−3,λ3i).
Case 6.3.12. λ3i≥2, λ1i=λ2i+2, λ2i≥λ3i+4 and ai=7. Then we can take μ=(λ1i−3,λ2i−2,λ3i−2), ν=(λ1i−3,λ2i−3,λ3i−1) and π=(λ1i−4,λ2i−3,λ3i).
Case 6.3.13. λ3i≥2, λ1i=λ2i+2, λ2i=λ3i+2. Then h(λ)≥4, as otherwise we are in one of the excluded cases. So there exists 0≤j<i with λj=(λ1j,λ2j,λ3j,1)=(λ1j,λ1j−2,λ1j−4,1). If λ3i=2 then ∣λi∣=12 and n/2≤n−k=∣λi∣−ai≤7. So n−∣λi∣≤2≤h(λi) and then λ=λi, contradicting h(λ)≥4 and h(λi)=3. If λ3i=3 then ∣λi∣=15 and n/2≤n−k=∣λi∣−ai≤10, so that n≤20. So n−∣λi∣≤5 and then i=j+1=1. This contradicts λ being JS. So λ3i≥4. Then λ1j=λ3i+i−j+4≥i−j+8. Further aj=ai+3(i−j)+1.
Case 6.3.13.1. ai=5. Then we can take μ=(λ1j−(i−j)−2,λ1j−(i−j)−4,λ1j−(i−j)−5), ν=(λ1j−(i−j)−3,λ1j−(i−j)−4,λ1j−(i−j)−5,1) and π=(λ1j−(i−j)−2,λ1j−(i−j)−4,λ1j−(i−j)−6,1).
Case 6.3.13.2. ai=6. In this case j≥1, as otherwise, being λ3j>λ3i≥4 and λ3j odd, it follows that n≥22 with n≡4(mod 6), λ=((n−1)/3+2,(n−1)/3,(n−1)/3−2,1) and k=ai+3i+1=3i+7≡1(mod 3). We have that λj−1=(λ1j+1,λ1j−1,λ1j−3,2) (since λ is a JS-partition) and aj−1=aj+4=3(i−j)+11. If λ3i=4 then ∣λi∣=18 and n/2≤n−k=∣λi∣−ai=12, so that n≤24. Since 1≤j<i we obtain ∣λj−1∣≥∣λi∣+8>n, leading to a contradiction. So λ3i≥5 (and then λ1j≥i−j+9). In this case we can take μ=(λ1j−(i−j)−2,λ1j−(i−j)−4,λ1j−(i−j)−6), ν=(λ1j−(i−j)−3,λ1j−(i−j)−4,λ1j−(i−j)−6,1) and π=(λ1j−(i−j)−3,λ1j−(i−j)−5,λ1j−(i−j)−6,2)=(λ1j−1−(i−j)−4,λ2j−1−(i−j)−4,λ3j−1−(i−j)−3,λ4j−1).
Case 6.3.13.3. ai=7. In this case j≥1, as otherwise, being λ3j>λ3i≥4 and λ3j odd, it follows that n≥22 with n≡4(mod 6), λ=((n−1)/3+2,(n−1)/3,(n−1)/3−2,1) and k=ai+3i+1=3i+7≡2(mod 3). We have that λj−1=(λ1j+1,λ1j−1,λ1j−3,2) (since λ is a JS-partition) and aj−1=aj+4=3(i−j)+12. If λ3i=4 then ∣λi∣=18 and n/2≤n−k=∣λi∣−ai=11, so that n≤22. Since 1≤j<i we obtain ∣λj−1∣≥∣λi∣+8>n, leading to a contradiction. If λ3i=5 then ∣λi∣=21 and n≤28. In this case ∣λj−1∣≥∣λi∣+8>n, again leading to a contradiction. So λ3i≥6 (and then λ1j≥i−j+10). We can take μ=(λ1j−(i−j)−3,λ1j−(i−j)−4,λ1j−(i−j)−6), ν=(λ1j−(i−j)−3,λ1j−(i−j)−5,λ1j−(i−j)−6,1) and π=(λ1j−(i−j)−3,λ1j−(i−j)−5,λ1j−(i−j)−7,2)=(λ1j−1−(i−j)−4,λ2j−1−(i−j)−4,λ3j−1−(i−j)−4,λ4j−1).
Case 6.4. h(λi)=4. In this case 5≤ai≤8.
Case 6.4.1. ai=5. Then we can take μ=(λ1i−2,λ2i−1,λ3i−1,λ4i−1), ν=(λ1i−2,λ2i−2,λ3i−1,λ4i).
Case 6.4.1.1. λ1i≥λ2i+4. Then we can take π=(λ1i−3,λ2i−1,λ3i−1,λ4i).
Case 6.4.1.2. λ2i≥λ3i+4. Then we can take π=(λ1i−3,λ2i−2,λ3i,λ4i).
Case 6.4.1.3. λ1i=λ2i+2, λ2i=λ3i+2 and h(λ)=4. If i=0 then λ=λi=(λ1i,λ1i−2,λ1i−4,λ4i) and k=ai=5, which is one of the excluded cases. So we can assume that i≥1. If λ3=λ4+2 then n≡0(mod 4) and λ=(n/4+3,n/4+1,n/4−1,n/4−3), which is also an excluded case. So we can also assume that λ3≥λ4+2. In this case we can take π=(λ1i−2,λ1i−4,λ1i−6,λ4i+1)=(λ1−i−2,λ2−i−2,λ3−i−2,λ4−i+1).
Case 6.4.1.4. λ1i=λ2i+2, λ2i=λ3i+2 and h(λ)≥5. In this case there exists 0≤j<i with λj=(λ1j,λ2j,λ3j,λ4j,1)=(λ1i+i−j,λ1i+i−j−2,λ1i+i−j−4,λ4i+i−j,1).
Case 6.4.1.4.1. λ4i≥3. Then λ4j≥i−j+3, so we can take π=(λ1i−2,λ1i−4,λ1i−5,λ4i−1,1)=(λ1j−(i−j)−2,λ2j−(i−j)−2,λ3j−(i−j)−1,λ4j−(i−j)−1,λ5j).
Case 6.4.1.4.2. λ4i=2. Then we can take π=(λ1i−3,λ1i−4,λ1i−5,λ4i,1)=(λ1j−(i−j)−3,λ2j−(i−j)−2,λ3j−(i−j)−1,λ4j−(i−j),λ5j) (notice that λ1i≥λ4i+6 since λ is JS).
Case 6.4.1.4.3. λ4i=1. If λ4i=1 and λ1i=7 then λi=(7,5,3,1) and then ∣λi∣=16. In this case n≤22. Since λ is JS, we have that j≤i−2, so that n≥∣λj∣≥∣λi∣+9=25, leading to a contradiction. So λ1i≥9 and then we can take π=(λ1i−3,λ1i−4,λ1i−6,λ4i+1,1)=(λ1j−(i−j)−3,λ2j−(i−j)−2,λ3j−(i−j)−2,λ4j−(i−j)+1,λ5j).
Case 6.4.2. ai=6. Then we can take μ=(λ1i−2,λ2i−2,λ3i−1,λ4i−1) and ν=(λ1i−3,λ2i−2,λ3i−1,λ4i).
Case 6.4.2.1. λ1i≥λ2i+4. We can take π=(λ1i−4,λ2i−1,λ3i−1,λ4i).
Case 6.4.2.2. λ2i≥λ3i+4. We can take π=(λ1i−3,λ2i−3,λ3i,λ4i).
Case 6.4.2.3. λ3i≥λ4i+4. We can take π=(λ1i−2,λ2i−2,λ3i−2,λ4i).
Case 6.4.2.4. λ1i=λ2i+2, λ2i=λ3i+2 and λ3i=λ4i+2. Then λi=(λ1i,λ1i−2,λ1i−4,λ1i−6) with λ1i≥7. If h(λ)=4 then n≡0(mod 4) and λ=(n/4+3,n/4+1,n/4−1,n/4−3), which is one of the excluded cases. So we can assume that there exists 0≤j<i with λj=(λ1j,λ1j−2,λ1j−4,λ1j−6,1). If λ1i≥9 we can take π=(λ1i−2,λ1i−4,λ1i−6,λ1i−7,1)=(λ1j−(i−j)−2,λ2j−(i−j)−2,λ3j−(i−j)−2,λ4j−(i−j)−1,λ5j). If 7≤λi≤8 then λi=(7,5,3,1) or λi=(8,6,4,2) and then n≤28, so that λ=(9,7,5,3,1) and k=11 (since h(λ)≥5, n−k=∣λi∣−ai and k≤n/2). In this case notice first that D(5,4,3,2,1) is a composition factor of D(9,7,5,3,1)↓S15. Since D(5,4,3,2,1)≅S(5,4,3,2,1), using branching rule in characteristic 0 and decomposition matrices, we can see that D(9,7,5,3,1)↓S14 has more than 3 composition factors.
Case 6.4.3. ai=7. Then we can take μ=(λ1i−2,λ2i−2,λ3i−2,λ4i−1) and ν=(λ1i−3,λ2i−2,λ3i−1,λ4i−1).
Case 6.4.3.1. λ1i≥λ2i+4. We can take π=(λ1i−4,λ2i−2,λ3i−1,λ4i).
Case 6.4.3.2. λ2i≥λ3i+4. We can take π=(λ1i−3,λ2i−3,λ3i−1,λ4i).
Case 6.4.3.3. λ3i≥λ4i+4. We can take π=(λ1i−3,λ2i−2,λ3i−2,λ4i).
Case 6.4.3.4. λ1i=λ2i+2, λ2i=λ3i+2 and λ3i=λ4i+2. Then λi=(λ1i,λ1i−2,λ1i−4,λ1i−6) with λ1i≥7. Again we can assume that there exists 0≤j<i with λj=(λ1j,λ1j−2,λ1j−4,λ1j−6,1). If λ1i≥9 we can take π=(λ1i−3,λ1i−4,λ1i−6,λ1i−7,1)=(λ1j−(i−j)−3,λ2j−(i−j)−2,λ3j−(i−j)−2,λ4j−(i−j)−1,λ5j). If 7≤λi≤8 then λi=(7,5,3,1) or λi=(8,6,4,2) and n≤26, so that λ=(9,7,5,3,1) and k=12 (since h(λ)≥5, n−k=∣λi∣−ai and k≤n/2). In this case notice first that D(5,4,3,2,1) is a composition factor of D(9,7,5,3,1)↓S15. Since D(5,4,3,2,1)≅S(5,4,3,2,1), using branching rule in characteristic 0 and [11, Tables], we can see that D(9,7,5,3,1)↓S13 has more than 3 composition factors.
Case 6.4.4. ai=8 and λ4i≥2. Then we can take μ=(λ1i−2,λ2i−2,λ3i−2,λ4i−2) and ν=(λ1i−3,λ2i−2,λ3i−2,λ4i−1).
Case 6.4.4.1. λ1i≥λ2i+4. We can take π=(λ1i−4,λ2i−2,λ3i−1,λ4i−1).
Case 6.4.4.2. λ2i≥λ3i+4. We can take π=(λ1i−3,λ2i−3,λ3i−1,λ4i−1).
Case 6.4.4.3. λ3i≥λ4i+4. We can take π=(λ1i−3,λ2i−3,λ3i−2,λ4i).
Case 6.4.4.4. λ1i=λ2i+2, λ2i=λ3i+2 and λ3i=λ4i+2. Then λi=(λ1i,λ1i−2,λ1i−4,λ1i−6) with λ1i≥8. Again we can assume that 0≤j<i with λj=(λ1j,λ1j−2,λ1j−4,λ1j−6,1). If λ1i≥9 we can take π=(λ1i−2,λ1i−4,λ1i−6,λ1i−7,1)=(λ1j−(i−j)−2,λ2j−(i−j)−2,λ3j−(i−j)−2,λ4j−(i−j)−1,λ5j). If λi=8 then λi=(8,6,4,2) and n≤24 and it can be checked that no λ exists (since h(λ)≥5).
Case 6.4.5. ai=8 and λ4i=1.
Case 6.4.5.1. λ1i≥λ2i+4. Then we can take μ=(λ1i−3,λ2i−2,λ3i−2,λ4i−1), ν=(λ1i−4,λ2i−2,λ3i−1,λ4i−1) and π=(λ1i−5,λ2i−2,λ3i−1,λ4i).
Case 6.4.5.2. λ2i≥λ3i+4. Then we can take μ=(λ1i−3,λ2i−2,λ3i−2,λ4i−1), ν=(λ1i−3,λ2i−3,λ3i−1,λ4i−1) and π=(λ1i−4,λ2i−3,λ3i−1,λ4i).
Case 6.4.5.3. λ1i=λ2i+2 and λ2i=λ3i+2. Then λi=(λ1i,λ1i−2,λ2i−4,1) with λ1i≥7 odd. If i≥1 then λi−1=(λ1i+1,λ1i−1,λ1i−3,2) and ai−1=ai+4=12. Then 3λ1i−1=∣λi−i∣≥2ai−1=24 and so λ1i≥9. So we can take μ=(λ1i−3,λ1i−4,λ1i−6), ν=(λ1i−3,λ1i−5,λ1i−6,1) and π=(λ1i−4,λ1i−5,λ1i−6,2)=(λ1i−1−5,λ2i−1−4,λ3i−1−3,λ4i−1). If i=0 then λ=λi and so n≡4(mod 6), λ=((n−1)/3+2,(n−1)/3,(n−1)/3−2,1) and k=ai=8. If n=16 then λ=(7,5,3,1), else n≥22, so that we are in one of the excluded cases. If λ=(7,5,3,1) notice first that D(4,3,2,1) is a composition factor of D(7,5,3,1)↓S10. Since (4,3,2,1) is a 2-core, we have that D(4,3,2,1)≅S(4,3,2,1). From [11, Tables] and branching rule in characteristic 0, it then follows that D(7,5,3,1)↓S8 has more than 3 non-isomorphic composition factors.
∎
Lemma 3.7**.**
*Let p=2∣n, and λ∈P2A(n). Then Dλ↓Sn/2 has at least 3 non-isomorphic composition factors unless λ has one
of the following forms:
*
(i)
βn* with n≡0(mod 4),*
2. (ii)
(βn−1,1),
3. (iii)
n≥24* with n≡0(mod 8) and λ=(n/4+3,n/4+1,n/4−1,n/4−3),*
4. (iv)
n≥10* with n≡2(mod 4) and λ=((n+6)/4,(n+2)/4,(n−2)/4,(n−6)/4),*
5. (v)
n≥24* with n≡0(mod 4) and λ=(n/4+2,n/4+1,n/4−1,n/4−2),*
6. (vi)
n≥14* with n≡2(mod 4) and λ=((n+10)/4,(n+6)/4,(n−6)/4,(n−10)/4),*
Proof.
If n≤10 then λ∈P2A(n) implies that λ=βn, (βn−1,1) or (4,3,2,1), in particular, λ is of the exceptional forms (i), (ii) or (iv), and so we may assume that n≥12.
If λ is the double of (11,1), (9,5) or (11,7) then λ is of the exceptional forms (ii) or (iv). So we do not need to consider them. Let E1 be the set of the doubles of the remaining exceptional partitions appearing in Lemma 3.4. Moreover, let
[TABLE]
(there is an overlap between E1 and E2). Finally let
[TABLE]
By Lemma 2.6, D(h(λ),h(λ)−1,…,1) is a composition factor of Dλ↓Sh(λ)(h(λ)+1)/2. Since D(h(λ),h(λ)−1,…,1)≅S(h(λ),h(λ)−1,…,1) is an irreducible Specht module, using branching rule for Specht modules and known decomposition matrices, the lemma can be checked for all λ∈E1∪E2∪E3.
Recalling the partition λJS from §3.1, we can now assume that n≥12 and that we are not in one of the exceptional cases of Lemma 3.4. Then by Lemma 3.4, m:=∣λJS∣≥n/2+5 and λ2j−1JS−λ2jJS≤2 for all j≥1. By Lemma 3.3 we have that DλJS is a composition factor of Dλ↓Sm. Moreover, by Lemma 3.6, DλJS↓Sn/2 has at least three non-isomorphic composition factors, unless λJS in one of the exceptional cases listed in Lemma 3.6. Since λ2j−1JS−λ2jJS≤2 for all j≥1, we are left only with the following cases:
(a)
m is even and λJS=βm,
2. (b)
m is odd and λJS=(βm−1,1),
3. (c)
λJS=(6,4,2),
4. (d)
m≥16 with m≡0(mod 4), λJS=(βm−2,2) and m=n/2+5,
5. (e)
λJS=(7,5,3,1) and n=22,
6. (f)
m≥20 with m≡0(mod 4) and λJS=(m/4+3,m/4+1,m/4−1,m/4−3).
So, using Lemma 3.3 and since n is even, in each of the corresponding above cases the following holds:
(a)
λ is βn or (βn−1,1).
2. (b)
λ is (βn−1,1), (βn−2,2), (βn−3,3), (βn−3,2,1), (βn−4,3,1), (βn−5,3,2) or (βn−6,3,2,1).
3. (c)
λ is (6,4,2), (6,4,3,1), (6,4,3,2,1), (6,5,2,1), (6,5,3), (6,5,3,2), (6,5,4,1), (6,5,4,2,1), (6,5,4,3) or (6,5,4,3,2).
4. (d)
In this case λ is one of the partitions in (b).
5. (e)
λ is (7,5,4,3,2,1), (7,6,4,3,2), (7,6,5,3,1) or (7,6,5,4).
6. (f)
(f1)
λ1≥8, λ1−λ2≤2, λ1−λ3≤4, λ1−λ4≤6, λ5=0 if λ1 is odd or λ5≤1 if λ1 is even;
2. (f2)
λ is one of the following: (8,6,4,3,2,1), (8,6,5,3,2), (8,6,5,4,2,1), (8,6,5,4,3), (8,6,5,4,3,2), (8,7,4,3,2), (8,7,5,3,2,1), (8,7,5,4,2),
Since λ∈P2A(n) we then have that one of the following holds:
(1)
n≡0(mod 4) and λ=βn,
(2)
λ=(βn−1,1),
(3)
λ=(βn−3,2,1),
(4)
n≡0(mod 4) and λ=(βn−4,3,1),
(5)
λ=(βn−5,3,2),
(6)
n≡2(mod 4) and λ=(βn−6,3,2,1),
(7)
n≥24 with n≡0(mod 8) and λ=(n/4+3,n/4+1,n/4−1,n/4−3),
(8)
n≥18 with n≡2(mod 4) and λ=((n+6)/4,(n+2)/4,(n−2)/4,(n−6)/4),
(9)
n≥24 with n≡0(mod 4) and λ=((n+8)/4,(n+4)/4,(n−4)/4,(n−8)/4),
(10)
n≥14 with n≡2(mod 4) and λ=((n+10)/4,(n+6)/4,(n−6)/4,(n−10)/4),
(11)
n≥24 with n≡0(mod 8) and λ=(n/4+2,n/4+1,n/4−1,n/4−3,1),
(12)
λ∈E2.
Taking into account that we have already dealt with λ∈E2 and that in the statement of the lemma we have excluded certain classes of partitions, it remains to deal with the cases (3)–(6), (11). We will repeatedly use Lemma 2.6.
To deal with (3)–(6), first note that if ν=(βl,ν) with ν=0 and ν1≤(βl)2−2, then D(βl−1,ν) and D(βl−2,ν) are composition factors of Dν↓S∣ν∣−1 and Dν↓S∣ν∣−2 respectively and at least one of ν, (βl−1,ν) or (βl−2,ν) has a good node below the second row.
(3) If n≥18 it then follows that D(βn/2−2,2), D(βn/2−1,1) and Dβn/2 are composition factors of D(βn−3,2,1)↓Sn/2. If n=10 then λ is in the exceptional family (iv), if n=12 then λ∈E1, if n=14 then λ is in the exceptional family (vi), while if n=16 then λ∈E3.
(4) If n≥20 that D(βn/2−3,2,1), D(βn/2−2,2) and D(βn/2−1,1) are composition factors of D(βn−4,3,1)↓Sn/2. If n=16 then λ∈E3.
(5) If n≥24 that D(βn/2−3,2,1), D(βn/2−2,2) and D(βn/2−1,1) are composition factors of D(βn−5,3,2)↓Sn/2 (this can be checked also for n=20 and n=22). If n=14 then λ is in the exceptional family (iv), if n=16 then λ∈E1, if n=18 then λ is in the exceptional family (vi).
(6) If n≥26 that D(βn/2−4,3,1), D(βn/2−3,2,1) and D(βn/2−2,2) are composition factors of D(βn−6,3,2,1)↓Sn/2. If n=18 or n=22 then λ∈E3.
(11) If n≥24 with n≡0(mod 8) notice that D(n/4+2,n/4,n/4−2,n/4−4,1) is a composition factor of D(n/4+2,n/4+1,n/4−1,n/4−3,1)↓Sn−3 and D(n/4+2,n/4,n/4−2,n/4−4) is a composition factor of D(n/4+2,n/4+1,n/4−1,n/4−3,1)↓Sn−4. Using Lemma 3.1 it follows that D(n/8+3,n/8+1,n/8−1,n/8−3), D(n/8+2,n/8+1,n/8−1,n/8−2) and D(n/8+3,n/8+1,n/8−1,n/8−2,1) are composition factor of D(n/4+2,n/4+1,n/4−1,n/4−3,1)↓Sn/2 if n≥32. If n=24 then λ∈E3.
∎
Lemma 3.8**.**
Let p=2, n≡0(mod 4) and λ=(n/4+2,n/4+1,n/4−1,n/4−2). Assume that 2≤k≤n−9 and let μ and ν be given by
(i)
μ=(n/4−m+2,n/4−m+1,n/4−m−1,n/4−m−2), ν=(n/4−m+3,n/4−m+1,n/4−m−1,n/4−m−3) if k=4m,
(ii)
μ=(n/4−m+2,n/4−m,n/4−m−1,n/4−m−2), ν=(n/4−m+2,n/4−m+1,n/4−m−1,n/4−m−3) if k=4m+1,
(iii)
μ=(n/4−m+2,n/4−m,n/4−m−1,n/4−m−3), ν=(n/4−m+1,n/4−m,n/4−m−1,n/4−m−2) if k=4m+2,
(iv)
μ=(n/4−m+1,n/4−m,n/4−m−1,n/4−m−3), ν=(n/4−m+2,n/4−m,n/4−m−2,n/4−m−3) if k=4m+3.
Then Dμ and Dν are composition factor of Dλ↓Sn−k.
Proof.
Notice that repeatedly applying Lemma 2.6 we have that
•
D(n/4+2,n/4,n/4−1,n/4−2) is a composition factor of Dλ↓Sn−1,
•
D(n/4+2,n/4,n/4−1,n/4−3) and D(n/4+1,n/4,n/4−1,n/4−2) are composition factors of Dλ↓Sn−2,
•
D(n/4+1,n/4,n/4−1,n/4−3) and D(n/4+2,n/4,n/4−2,n/4−3) are composition factors of Dλ↓Sn−3,
•
D(n/4+1,n/4,n/4−2,n/4−3) and D(n/4+2,n/4,n/4−2,n/4−4) are composition factors of Dλ↓Sn−4,
•
D(n/4+1,n/4−1,n/4−2,n/4−3) and D(n/4+1,n/4,n/4−2,n/4−4) are composition factors of Dλ↓Sn−5.
Since μ=((n−4)/4+2,(n−4)/4+1,(n−4)/4−1,(n−4)/4−2) for k=4, the lemma then follows by induction.
∎
4. Reduction Theorems
4.1. Criterion for reducibility of restrictions
For λ∈Pp(n) we denote
[TABLE]
Note that E(λ) is naturally an FSn-module.
If λ∈PpA(n), then upon restriction to An, we have the FAn-module decomposition
[TABLE]
where
[TABLE]
Lemma 4.1**.**
Let λ∈PpA(n) and V be an FSn-module. Then
[TABLE]
Proof.
Using Dλ≅E±λ↑Sn, it is easy to check that E(λ)≅HomF(E±λ,E+λ⊕E−λ)↑Sn,
which implies the lemma using Frobenious reciprocity.
∎
Let
[TABLE]
be the corresponding projections.
Note that E±λ with (E±λ)σ≅E∓λ implies
[TABLE]
Note also that
E+,+(λ)⊕E−,−(λ)
is an FSn-submodule of E(λ), as is E+,−(λ)⊕E−,+(λ). We then have the corresponding projections
[TABLE]
Recall the notation J(G) from §2.1.
The following is an analogue of [17, Lemma 2.17]:
Lemma 4.5**.**
Let λ∈PpA(n), δ∈{+,−} and G≤An be a subgroup such that Eδλ↓G is irreducible. Then dimHomAn(J(G),Eδ,ε(λ))≤1
for all ε∈{+,−}.
Proof.
We have
[TABLE]
Since Eδλ↓G is irreducible and dimEδλ=dimEελ the lemma follows.
∎
Lemma 4.6**.**
Let k∈Z≥0 and n≥max(5,2k), and exclude the cases (p,n−2k)=(2,≤2),(3,≤1). Suppose that λ∈PpA(n), G≤An and there is ψ∈HomSn(I(G),Mk) such that [imψ:Dk]=0.
(i)
If
there is ζ∈HomSn(Mk,E+,+(λ)⊕E−,−(λ)) such that [imζ:Dk]=0 then there exist
[TABLE]
such that [imξ′:Ek]=0 and [imξ′′:Ek]=0.
2. (ii)
If
there is ζ∈HomSn(Mk,E+,−(λ)⊕E−,+(λ)) such that [imζ:Dk]=0 then there exist
[TABLE]
such that [imξ′:Ek]=0 and [imξ′′:Ek]=0.
Proof.
We prove (i), the proof of (ii) being similar. By Lemma 2.4, the assumptions n≥max(5,2k) and (p,n−2k)=(2,≤2),(3,≤1) guarantee that Ek is irreducible and appears with multiplicity 1 in Mk↓An.
Note that I(G)≅J(G)↑Sn. By Lemma 2.7(i), there is ψ′∈HomAn(J(G),Mk↓An) with [imψ′:Ek]=0.
Furthermore,
with [imζ′:Ek]=0 and [imζ′′:Ek]=0. Since Ek appears in Mk with multiplicity 1, we can now take ξ′:=ζ′∘ψ′ and ξ′′:=ζ′′∘ψ′.
∎
Theorem 4.7**.**
Let k≥1, n≥max(5,2k), and exclude the cases (p,n−2k)=(2,≤2),(3,≤1). Suppose that λ∈PpA(n), G≤An and there are
[TABLE]
such that [imψ:Dk]=0 and [imζ:Dk]=0. Then E±λ↓G is reducible.
Proof.
We prove that E+λ↓G is reducible, the argument for E−λ↓G being similar. Note that there always exists ξ0∈HomAn(J(G),E+,+(λ)) whose image is the trivial module \text{\boldmath1}_{{\sf A}_{n}}. On the other hand, by Lemma 4.6(i), there exists
ξk∈HomAn(J(G),E+,+(λ))
whose image contains Ek as a composition factor. Since ξ0 and ξk are linearly independent, the theorem follows from Lemma 4.5.
∎
Theorem 4.8**.**
Let 1≤k<l, n≥max(5,2l), and exclude the cases (p,n−2l)=(2,≤2),(3,≤1). Suppose that λ∈PpA(n), G≤An and for j=k,l there are
[TABLE]
such that [imψj:Dj]=0 and [imζj:Dj]=0. Then E±λ↓G is reducible.
Proof.
We prove that E+λ↓G is reducible, the argument for E−λ↓G being similar. By Lemma 4.6(ii), for j=k,l, there exists
ξj∈HomAn(J(G),E+,−(λ))
whose image contains Ej as a composition factor. Note that ξk and ξl are linearly independent since Mk↓An does not have El as a composition factor and therefore imξk does not have El as a composition factor. The theorem now follows from Lemma 4.5.
∎
4.2. First reduction theorems for alternating groups
Recall the projections π0,π1 defined in (4.4) and the integers ik(G) from §2.4
Proposition 4.9**.**
Let n≥8 and exclude the case (n,p)=(8,2). If λ∈PpA(n) and G≤An is a subgroup such that 1<i1(G)<i2(G) and E+λ↓G or E−λ↓G is irreducible then one of the following holds:
(i)
i2(G)=i3(G)* and λ is JS.*
2. (ii)
p=2* and λ=βn.*
3. (iii)
p=2∣n* and dim(S1∗)G≥i2(G)−1.*
4. (iv)
λ* is JS, p=2∣n and dim(S2∗)G≥i3(G)−i1(G).*
5. (v)
λ* is JS, p=3, n≡0(mod 3) and dim(S1∗)G≥i3(G)−i2(G)+i1(G)−1.*
6. (vi)
λ* is JS, p=3, n≡1(mod 3) and dim(S2∗)G≥i3(G)−i1(G).*
Proof.
The result for p>3 follows from [20, Main Theorem]. So we may now assume that p=2 or p=3. Also, without loss of generality we assume that E+λ↓G is irreducible. Moreover, in view of (ii) if p=2 we further assume that λ=βn. From Lemma 2.4 it then follows that h(λ)≥3.
In view of (2.9), the assumption i1(G)>1 implies the existence of
[TABLE]
with [imψ1:D1]=0. There also exists
[TABLE]
with [imψ2:D2]=0. Indeed, if p=2∣n, then
in view of (iii), we may assume that dim(S1∗)G<i2(G)−1, whence ψ2 exists by Theorem 2.11. On the other hand if p=3 or p=2∤n, by Theorems 2.10 and 2.11, we have that M2∼M1∣S2∗, so the assumption i2(G)>i1(G) and (2.9) imply the existence of ψ2 with the required properties.
and the well-known structure of M1 (see for example Theorems 2.10 and 2.11)
imply that there is ζ1∈HomSn(M1,E(λ)) with [imζ1:D1]=0.
Case 1.1. ζ1′:=π0∘ζ1 satisfies [imζ1′:D1]=0. Then the proposition follows by Theorem 4.7 (with k=1).
Case 1.2. ζ1′ satisfies [imζ1′:D1]=0. Then ζ1′′:=π1∘ζ1 satisfies [imζ1′′:D1]=0.
Case 1.2.1. ζ2′:=π0∘ζ2 satisfies [imζ2′:D2]=0. Then the proposition follows by Theorem 4.7 (with k=2).
Case 1.2.2. ζ2′ satisfies [imζ2′:D2]=0. Then ζ2′′:=π1∘ζ2 satisfies [imζ2′′:D2]=0 and we can conclude by Theorem 4.8 (with k=1 and l=2).
Case 2. λ is JS.
Case 2.1. ζ2′:=π0∘ζ2 satisfies [imζ2′:D2]=0. Then the proposition follows by Theorem 4.7 (with k=2).
Case 2.2. ζ2′ satisfies [imζ2′:D2]=0. Then ζ2′′:=π1∘ζ2 satisfies [imζ2′′:D2]=0.
In view of (iv), (v) and (vi), using Theorems 2.10 and 2.11, we may assume that there exists ψ3∈HomSn(I(G),M3) with [imψ3:D3]=0.
Case 2.2.1. ζ3′:=π0∘ζ3 satisfies [imζ3′:D3]=0. Then the proposition follows by Theorem 4.7 (with k=3).
Case 2.2.2. ζ3′ satisfies [imζ3′:D3]=0. Then ζ3′′:=π1∘ζ3 satisfies [imζ3′′:D3]=0 and we can conclude by Theorem 4.8 (with k=2 and l=3).
∎
Proposition 4.10**.**
Let n≥8 and exclude the case (n,p)=(8,2). Suppose that λ∈PpA(n) and G≤An is a transitive subgroup such that E+λ↓G or E−λ↓G is irreducible. Then one of the following holds:
(i)
G* is 2-homogeneous.*
2. (ii)
p=2* and λ=βn.*
3. (iii)
n* is even and G≤Gn/2,2 or G≤G2,n/2.*
4. (iv)
p=3, n≡1(mod 3) and dim(S2∗)G>i2(G)−1.
5. (v)
p=2∣n* and dim(S2∗)G>i2(G)−1.*
Proof.
The result for p>3 follows from [20, Theorem 3.13], so let p=2 or 3. We will now prove the following
Claim. We are in one of the cases (i)-(v) or one of the following conditions holds:
(a) p=3, n≡0(mod 3) and (S1∗)G=0;
(b) p=2∣n and dim(S1∗)G≥i2(G)−1.
To prove the claim, we assume that we are not in the cases (i)-(v) or (a),(b) and apply Theorems 4.7 and 4.8 to deduce that E±λ↓G are reducible, obtaining a contradiction.
Since we are not in case (i), we have i2(G)>1. Since we are not in case (ii) we have that Dλ is not basic spin in characteristic 2. So h(λ)≥3 by Lemma 2.4. Since we are not in case (iii), using [8, §5, Corollary], we have that i2(G)<i3(G).
Since we are not in case (b) and i2(G)>1, Theorems 2.10 and 2.11 imply that there exists
[TABLE]
with [imψ2:D2]=0. Since we are not in cases (iv),(v),(a) and i2(G)<i3(G),
Theorems 2.10 and 2.11 imply that there exists
Case 1. ζ2′:=π0∘ζ2 satisfies [imζ2′:D2]=0. The proposition now follows from Theorem 4.7 (with k=2).
Case 2. ζ2′ satisfies [imζ2′:D2]=0. Then ζ2′′:=π1∘ζ2 satisfies [imζ2′′:D2]=0.
Case 2.1. ζ3′:=π0∘ζ3 satisfies [imζ3′:D3]=0. The proposition now follows from Theorem 4.7 (with k=3).
Case 2.2. ζ3′ satisfies [imζ3′:D3]=0. Then ζ3′′:=π1∘ζ3 satisfies [imζ3′′:D3]=0 and so the proposition follows from Theorem 4.8 (with k=2 and l=3).
This completes the proof of the claim.
We now eliminate the exceptional cases (a) and (b) in the Claim. Indeed, if we are in one of those cases then, in view of (i), we may assume that (S1∗)G=0. If G is primitive then by [17, Corollary 2.32 and Lemma 2.33] this implies that Op(G)=1, in which case E±λ↓G is reducible for example by [17, Lemma 2.19]. In the imprimitive case, G≤Ga,b for some a,b>1 with ab=n. In view of (iii), we may assume that a,b=2, in which case (S1∗)Ga,b=0 by Lemma 2.15, and so by the Claim, E±λ↓Ga,b is reducible and so is E±λ↓G.
∎
5. Imprimitive subgroups
In this section we analyze restrictions E±λ↓G for imprimitive subgroups G≤An and prove Theorems A, B and C.
5.1. Intransitive subgroups
In this subsection we deal with maximal intransitive subgroups G≤An, i.e. subgroups of the form An−k,k. The following is easy to check.
Lemma 5.1**.**
Let n≥5, 1<k≤n/2, and G=An−k,k. Then i1(G)=2, i2(G)=3, i3(G)=4 for k>2, and i3(G)=3 for k=2.
Proposition 5.2**.**
Let n≥8 and exclude the case (n,p)=(8,2). If λ∈PpA(n), G≤An is an intransitive subgroup and E+λ↓G or E−λ↓G is irreducible then one of the following holds:
(i)
G≤An−1.
2. (ii)
G≤An−2,2* and λ is JS.*
3. (iii)
p=2* and λ=βn.*
Proof.
We may assume that G=An−k,k with 1<k≤n/2, in which case the result follows from Proposition 4.9 and Lemmas 2.14 and 5.1.
∎
The next result deals with the case k=1 when p=2 (for p>2 the corresponding result is known, see §5.2 below).
Theorem 5.3**.**
Let p=2 and λ∈P2A(n). Then E±λ↓An−1 is irreducible if and only if one of the following holds:
(i)
λ* is JS;*
2. (ii)
λ* has exactly two normal nodes, λ1=λ2+1 and λ1 is even.*
Proof.
If E±λ↓An−1 is irreducible then Dλ↓Sn−1 has at most two composition factors and if it has two composition factors, they are isomorphic and they do not split when restricted to An−1. In particular λ has at most two normal nodes.
Case 1. λ is JS. Then Dλ↓Sn−1 is irreducible, and so E±λ↓An−1 is irreducible.
Case 2. λ has two normal nodes.
Let A:=(1,λ1) and B:=(2,λ2).
If λA is 2-regular, then by Lemma 2.6, Dλ↓Sn−1 has two non-isomorphic composition factors, so in this case E±λ↓An−1 is not irreducible. So we may assume that λ1=λ2+1. Let μ=λB. Then [Dλ↓Sn−1:Dμ]=2 by Lemma 2.6.
Case 2.1. λ1 is odd. Notice that λ1=μ1=μ2+2 and μ1+μ2≡0(mod 4). Since λ∈P2A(n), it then follows that μ∈P2A(n−1). So in this case E±λ↓An−1 is not irreducible.
Case 2.2. λ1 is even. In this case μ1+μ2≡2(mod 4), so μ∈P2A(n−1). Moreover, by Lemma 2.6
[TABLE]
Using Frobenius reciprocity, for any ν∈P2(n−1), we have
[TABLE]
Moreover, E±ν↑Sn−1≅Dν if ν∈P2A(n−1), and
Eν↑Sn−1=Dν∣Dν otherwise.
So soc(Dλ↓An−1)≅(Eμ)⊕k for k≤2. But λ∈P2A(n), so soc(Dλ↓An−1)≅Eμ⊕Eμ. By Frobenius reciprocity again, we now conclude that Eμ↑Sn−1=Dμ∣Dμ is a submodule of Dλ↓Sn−1. Hence Dλ↓Sn−1≅Dμ∣Dμ and E±λ↓An−1 is irreducible.
∎
We now deal with the case k=2 when p=2 and λ is not basic spin (for p>2 the corresponding result is known, see §5.3 below).
Theorem 5.4**.**
Let p=2 and λ∈P2A(n)∖{βn}. Then E±λ↓An−2,2 is irreducible if and only if λ is JS, in which case E±λ↓An−2≅Ee~1−ie~iλ where i is the residue of (1,λ1).
Proof.
If E±λ↓An−2,2 is irreducible, then λ is JS by Proposition 5.2. Conversely, let λ be JS. Note that h(λ)≥2 and μ:=e~1−ie~iλ=(λ1−1,λ2−1,λ3,λ4,…). In particular μ1+μ2=λ1+λ2−2≡2(mod 4) and so μ∈P2A(n−2). Since λ is JS it follows that Dλ↓Sn−1≅De~iλ by Lemma 2.6. Further εi(e~iλ)=0 and ε1−i(e~iλ)=2. So
[TABLE]
Using Frobenius reciprocity as in the proof of Theorem 5.3, we deduce that Eμ↑Sn−2=Dμ∣Dμ is a submodule of Dλ↓Sn−2. Hence Dλ↓Sn−2=Dμ∣Dμ, so E±λ↓An−2 is irreducible.
∎
Suppose first that p>2. By [20, Proposition 3.7] (see also [4, Theorem 5.10]), E±λ↓An−1 is irreducible if and only if λ is JS or λ has two normal nodes of different residues. Under the assumption λ∈PpA(n) this is equivalent to the requirement that the two normal nodes have residues different from [math]. On the other hand, if p=2 then by Theorem 5.3, E±λ↓An−1 is irreducible if and only if λ is JS or λ has two normal nodes and λ1=λ2+1 is even. It remains to show that the latter condition holds if and only if λ has exactly two normal nodes of residue 1. The ‘only-if’ part is clear. For the ‘if’ part, suppose that λ has exactly two normal nodes of residue 1. Since the top removable node is always normal it follows that λ1 is even. Since λ∈P2A(n) it then follows that λ1=λ2+1.
If p>2, the result is [20, Theorem 3.6]. If p=2 use Theorem 5.4.
5.4. Transitive imprimitive subgroups
In this section we begin to investigate restrictions to the maximal transitive imprimitive subgroups G≤An, i.e. subgroups of the form Ga,b with a,b≥2 and n=ab.
Proposition 5.5**.**
Let n=2b≥8, λ∈PpA(n). Then E±λ↓G2,b are reducible.
Proof.
For p>3 this is known, see [20, Main Theorem]. For p=2, this is clear since G2,b has a non-trivial normal 2-subgroup, cf. [17, Lemma 2.19]. Let p=3. It suffices to prove that Dλ↓S2≀Sb has at least three composition factors. Let S(2b)≅S2×⋯×S2 be the base subgroup, with generators g1,…,gb of order 2. The irreducible FS(2b)-modules are of the form
{L(δ1,…,δb)∣δ1,…,δb∈{0,1}}
where L(δ1,…,δb)=F⋅v and grv=(−1)δrv for r=1,…,b. Restriction of any irreducible F(S2≀Sb)-module to S(2b) is a direct sum of modules of the form L(δ1,…,δb) with fixedδ1+⋯+δb. So it suffices to prove that Dλ↓S(2b) has three composition factors L(δ1,…,δb) with three different sums δ1+⋯+δb. Note that D(3,1)↓S(2b)≅L(0,0)⊕L(0,1)⊕L(1,0) and D(2,1,1)↓S(2b)≅L(1,1)⊕L(0,1)⊕L(1,0). Moreover,
by Lemmas 2.4 and 2.8,
the restriction
Dλ↓S4×S4 has a composition factor of the form L1⊠L2 with L1,L2∈{D(3,1),D(2,1,1)}.
Hence Dλ↓S(4,4,2b−4) has a a composition factor of the form L1⊠L2⊠L(δ5,…,δb). Restricting this module to S(2b) yields composition factors of the form L(η1,η2,η3,η4,δ5,…,δb) with fixed δ5,…,δb and at least three different sums η1+η2+η3+η4.
∎
Proposition 5.6**.**
*Let n=2a with a≥4. Let G=Ga,2 and λ∈PpA(n). If E+λ↓G or E−λ↓G is irreducible then
p=2 and λ has at most three normal nodes.
*
Proof.
For p≥5 the proposition holds by [20, Proposition 3.12].
So we may assume that p=2 or p=3.
Without loss of generality we assume that E+λ↓G is irreducible.
Let p=2. We may assume that λ has at least four normal nodes. Hence by Lemma 2.6(v),
[TABLE]
Since M1∼D0∣S1∗ for example Theorem 2.11, it follows that dimHom(S1∗,E(λ))≥3. So by Lemma 4.1,
[TABLE]
But S1∗=D1 or S1∗=D1∣D0, so there exist ζ,ζ′∈HomAn(S1∗↓An,E+,+(λ)⊕E+,−(λ)) such that ζ∣E1 and ζ′∣E1 are linearly independent.
On the other hand, by Lemma 2.15(i) there exists ψ∈HomAn(J(G),S1∗↓An) with [imψ:E1]=0. Note also that there exists ξ∈HomAn(J(G),E+,+(λ)⊕E+,−(λ)) with imξ≅E0. Note that ξ, ζ∘ψ and ζ′∘ψ are linearly independent which contradicts E+λ being irreducible, due to Lemma 4.5.
If p=3 then M2∼M1∣S2∗ by Theorem 2.10. Now, i1(G)=1<2=i2(G) imply that there exists ψ∈HomSn(I(G),M2) with [imψ:D2]=0.
Assume first that λ is not JS. Then by [19, Theorem 3.3] and [23, Lemmas 4.9, 4.11, 4.12] we have
Since M2∼S2∣M1 by Theorem 2.10, we now deduce that there exist homomorphisms ζ,ζ′∈HomAn(M2↓An,E+,+(λ)⊕E+,−(λ)) whose restrictions to S2↓An are linearly independent. Let further ξ∈HomAn(J(G),E+,+(λ)⊕E+,−(λ)) with imξ≅E0. Then ξ, ζ∘ψ and ζ′∘ψ are linearly independent. This contradicts E+λ being irreducible, due to Lemma 4.5.
Assume now that λ is JS. Since E+λ↓G is irreducible, so is E−λ↓G. In particular Dλ↓Sn/2≀S2 has at most 2 composition factors. So by the classification of the irreducible Sn/2≀S2-modules, we have that Dλ↓Sn/2,n/2 has at most 4 composition factors. From Lemma 3.5 we have that Dλ↓Sn/2 has at least 5 non-isomorphic composition factors, leading to a contradiction.
∎
Proposition 5.7**.**
Let n≥8 and exclude the case (n,p)=(8,2).
If λ∈PpA(n), a,b≥2 with ab=n≥8, and E+λ↓Ga,b or E−λ↓Ga,b is irreducible then p=2 and one of the following holds:
(i)
b=2* and λ has at most three normal nodes.*
2. (ii)
λ=βn.
Proof.
By Propositions 5.5 and 5.6 we may assume that a,b≥3. Now by Proposition 4.10, we may assume that we are in the cases (iv) or (v) of that proposition. Since i2(Ga,b)=2, the proposition follows by Lemma 2.15(ii).
∎
5.5. Restrictions to Ga,2 for p=2
The goal of this subsection is to eliminate the exceptional case which appears in Proposition 5.7(i).
Lemma 5.8**.**
Let n=2a≥4, λ∈P2A(n) and G=Ga,2. If E+λ↓G or E−λ↓G is irreducible then Dλ↓Sa≀S2 is either irreducible or it has exactly two composition factors which are isomorphic to each other. In particular, Dλ↓Sa has at most two isomorphism classes of composition factors.
Proof.
Note that
E+λ↓G is irreducible if and only if so is E−λ↓G. Hence Dλ↓Sa≀S2 is either irreducible or has exactly two composition factors. If Dλ↓Sa≀S2 is irreducible then Dλ↓Sa,a is of the form Dμ⊠Dμ or Dμ⊠Dν⊕Dν⊠Dμ, and so all composition factors of Dλ↓Sa are isomorphic to Dμ or Dν.
Suppose that Dλ↓Sa≀S2 has two composition factors L+ and L−. We may assume that
L±↓G≅E±λ↓G. Then, since (1,2)∈Sa≀S2, we get
[TABLE]
As p=2=[Sa≀S2:G], it now follows from Clifford theory that L+≅L−,
and we are done as in the previous paragraph.
∎
Combining Lemmas 5.8 and 3.7 allows us to assume that we are in one of the exceptional cases of Lemma 3.7. The next lemma deals with the exceptional case (ii) of Lemma 3.7.
Lemma 5.9**.**
Let p=2∣n≥6 and λ=(βn−1,1). Then E±λ↓Gn/2,2 is reducible.
Proof.
Assume that E±λ↓Gn/2,2 is irreducible.
On the other hand, by [17, Theorem A], Dλ↓Sn/2≀S2 is reducible. By Lemma 5.8, we conclude that in the Grothendieck group we have either
[TABLE]
for some distinct μ,ν∈P2(n/2) or
[TABLE]
for some μ∈P2(n/2).
For n≤10, using [11, Tables], one checks that neither of these ever happens.
Let now n≥12. It is easy to see by repeatedly applying Lemma 2.6 that Dβn/2 and D(βn/2−1,1) are composition factors of Dλ↓Sn/2. So
[TABLE]
In particular
[TABLE]
For any m, let ⟨m⟩ be a basic spin representation and ⟨m−1,1⟩ be a second basic spin representation of Sm in characteristic 0. From [2, Theorem 1.2] we have that Dβm is a composition factor of ⟨m⟩ and that D(βm−1,1) is a composition factor of ⟨m−1,1⟩, provided βm and (βm−1,1) are 2-regular. This leads to a contradiction with (5.10) using [27, Tables III and IV].
∎
The next result, whose proof is similar to that of [17, Lemma 7.20], treats the exceptional case (iii) of Lemma 3.7.
Lemma 5.11**.**
Let p=2, n≥24, n≡0(mod 8) and λ=(n/4+3,n/4+1,n/4−1,n/4−3). Then E±λ↓Gn/2,2 is reducible.
Proof.
Assume that E±λ↓Gn/2,2 is irreducible. Let
[TABLE]
By Lemma 3.1 or [17, Lemma 3.14], Dμ and Dν are composition factors of Dλ↓Sn/2.
It then follows from Lemma 5.8 that all composition factors of Dλ↓Sn/2,n/2 are of the form Dμ⊠Dν or Dν⊠Dμ.
Let
[TABLE]
By [7, Lemma 1.11], we have that Dπ⊠Dψ is a composition factor of Dλ↓Sn/2+2,n/2−2. As ν=e~i2π, by Lemma 2.6, we have that D^{\nu}\boxtimes\text{\boldmath1}_{{\sf S}_{1,1}}\boxtimes D^{\psi} is a composition factor of Dλ↓Sn/2,1,1,n/2−2. So Dψ is a composition factor of Dμ↓Sn/2−2,
which contradicts [17, Lemma 3.7].
∎
The next two lemmas deal with the exceptional case (v) of Lemma 3.7.
Lemma 5.12**.**
Let p=2, n≥24, n≡0(mod 8), and λ=(n/4+2,n/4+1,n/4−1,n/4−2) then E±λ↓Gn/2,2 is reducible.
Proof.
Assume that E±λ↓Gn/2,2 is irreducible. Let
[TABLE]
By Lemmas 5.8 and 3.8(i), all composition factors of Dλ↓Sn/2,n/2 are of the form Dμ⊠Dν or Dν⊠Dμ. Let π:=(n/8+3,n/8+1,n/8−1,n/8−2). From Lemma 3.8(iv), Dπ is a composition factor of Dλ↓Sn/2+1. In particular there exists ψ∈P2(n/2−1) such that Dπ⊠Dψ is a composition factor of Dλ↓Sn/2+1,n/2−1. Restricting this module to Sn/2,1,n/2−1 we have by Lemma 2.6 that D^{\mu}\boxtimes\text{\boldmath1}_{{\sf S}_{1}}\boxtimes D^{\psi} and D^{\nu}\boxtimes\text{\boldmath1}_{{\sf S}_{1}}\boxtimes D^{\psi} are composition factors of Dλ↓Sn/2,1,n/2−1. In particular Dψ is a composition factor of Dμ↓Sn/2−1 and Dν↓Sn/2−1. Since ν is JS, Lemma 2.6 gives that ψ=(n/8+2,n/8+1,n/8−1,n/8−3), contradicting Dμ↓Sn/2−1 also having a composition factor isomorphic to Dψ, again using Lemma 2.6.
∎
Lemma 5.13**.**
Let p=2, n≥20, n≡4(mod 8), and λ=(n/4+2,n/4+1,n/4−1,n/4−2). Then E±λ↓Gn/2,2 is reducible.
Proof.
Assume that E±λ↓Gn/2,2 is irreducible. Let
[TABLE]
By Lemmas 5.8 and 3.8(iii), in the Grothendieck group we have for some a∈Z>0:
[TABLE]
In particular, all composition factors of Dλ↓Sn/2 are of the form Dμ or Dν. It follows using Lemma 2.6 that all composition factors of Dλ↓Sn/2+1 are of the form Dκ with e~iκ=μ or ν for some i. Since any composition factor of Dλ↓Sk for any k≤n is indexed by a partition with at most 4 rows (for example by [17, Lemma 3.7]), it then follows that any composition factor of Dλ↓Sn/2+1 is of the form Dπ or Dψ, where
[TABLE]
Then, in the Grothendieck group,
[TABLE]
for certain modules M,N of Sn/2−1. Comparing this to
(5.14) and
using Lemma 2.6, we deduce
[TABLE]
Notice that from Lemma 2.6, Dμ↓Sn/2−1≅Dγ⊕Dδ with
[TABLE]
In particular D^{\mu}\boxtimes\text{\boldmath1}_{{\sf S}_{1}}\boxtimes D^{\gamma} is a composition factor of Dλ↓Sn/2,1,n/2−1 and then Dγ is a composition factor of Dν↓Sn/2−1, which contradicts Lemma 2.6 by a block argument.
∎
Proposition 5.15**.**
Let p=2∣n≥10 and λ∈P2A(n). If E±λ↓Gn/2,2 is irreducible then λ=βn.
Proof.
By Lemma 5.8, we may also assume that Dλ↓Sn/2 has at most two isomorphism classes of composition factors. So by Lemma 3.7, we may assume that we are in one of the exceptional cases (i)-(vi) of that lemma. The case (i) does not need to be considered since this is the case λ=βn. In the cases (iv) and (vi), λ has four normal nodes, so we can exclude them by Proposition 5.7. The case (ii) is treated in Lemma 5.9, the case (iii) is treated in Lemma 5.11, and the case (v) is treated in Lemmas 5.12 and 5.13.
∎
For p>3 the result follows from [20, Main Theorem]. So we may assume that p=3 or 2.
In view of the exceptions (i) and (iv) in Theorem A, we may assume that G is imprimitive and λ=βn if p=2.
The theorem is easily checked for n=5,6,7. Indeed, in view of Theorems B and C, we may assume that G is one of the following: G2,3,G3,2,A4,3. Moreover, we only have to consider the cases where either p=2 and λ=(3,2,1) or p=3 and λ=(4,12) or (4,2,1). In the exceptional cases the restriction E±λ↓G are reducible since ∣G∣≤dimE±λ.
The case (n,p)=(8,2) is also easy since in this case λ∈P2A(8)∖{β8} implies λ=(4,3,1) and dimE±λ=20 and G is contained in one of {A7,A6,2,A5,3,A4,4,G2,4,G4,2}. The case G≤A7 is covered by the exceptional case (ii)(b) of Theorem A. The case G≤A6,2 is excluded by Theorem 5.4. The cases G≤A5,3, G≤A4,4 and G≤G2,4 are excluded since then ∣G∣<dimE±(4,3,1). The case G≤G4,2 is excluded by Lemma 5.9. From now we assume that (n,p)=(8,2).
If G is intransitive then G≤An−k,k for some 1≤k≤n/2. By Proposition 5.2, we may assume that either k=1, or k=2 and λ is JS. It remains to apply Theorem B.
If G is transitive then G≤Ga,b for some a,b>1 with ab=n. By Proposition 5.7, we may assume that p=2=b (and λ has at most three normal nodes). Now, we apply Proposition 5.15.
6. Basic spin case
In this section, we assume that p=2.
Recall e.g. from [27] that
[TABLE]
Moreover, βn∈P2A(n) if and only n≡2(mod 4) (although we consider a general n in this section).
6.1. Restricting basic spin module to intransitive subgroups
Lemma 6.2**.**
Let ν=(n1,…,nh) be a composition of n with n1,…,nh>1, and D=Dλ1⊠⋯⊠Dλh be an irreducible FSν-module. Then D↓Aν splits if and only if λr∈P2A(nr) for all r=1,…,h.
Proof.
Suppose λr∈P2A(nr) for all r=1,…,h. Then the number of composition factors of D↓An1×⋯×Anh is 2h. On the other hand An1×⋯×Anh is a normal subgroup of Aν of index 2h−1, so D↓Aν must have at least two composition factors.
Conversely, suppose that λr∈P2A(nr) for some r. Without loss of generality, we may assume that
λ1∈P2A(n1),…,λs∈P2A(ns) and λs+1∈P2A(ns+1),…,λh∈P2A(nh) for some 0≤s<h. Then
[TABLE]
So any submodule of D↓An1×⋯×Anh is the direct sum of some of the summands in the right hand side. But if one such summand lies in an FAν-submodule of D↓Aν then all of them do (this can be seen by conjugating with elements of Aν having odd components in some of the first s positions and, if necessary, an odd component in one of the remaining positions).
∎
Proposition 6.3**.**
Let n≥5, ν=(n1,…,nh) be a composition of n with h>1. Then E(±)βn↓Aν is irreducible if and only if one of the following conditions holds:
(1)
n≡0(mod 4), h=3, nr≡2(mod 4) for exactly one r, and the other two parts of ν are odd;
2. (2)
n≡0(mod 4), h=2, and n1, n2 are both odd;
3. (3)
n≡2(mod 4), h=2, and nr≡2(mod 4) for at least one r.
Proof.
We may assume that n≡2(mod 4), since otherwise Eβn=Dβn↓An, and by [17, Theorem C], Aν≤An−k,k with n−k and k odd, in which case Eβn↓A(n−k,k) is reducible by Lemma 6.2, hence Eβn↓Aν is also reducible.
All composition factors of Dβn↓Sν are isomorphic to Dβn1⊠⋯⊠Dβnh, and by dimensions, we have
[TABLE]
If the last expression is greater than 2, we must have that E±βn↓Aν is reducible. So we may assume that it is at most 2, which leaves us with the following cases:
(a)
h=4 and all nr’s are odd;
2. (b)
h=3 and nr is even for at most one r;
3. (c)
h=2.
In the case (a) the restriction E±βn↓Aν is reducible, since by (6.4), we have that Dβn↓Sν has two composition factors, and these split when restricted to Aν by Lemma 6.2.
In the case (b) Dβn↓Sν has exactly two composition factors by (6.4). Suppose first that nr≡2(mod 4) for all r. In this case E±βn↓Aν is reducible by the argument as in the previous paragraph. Without loss of generality we may then assume that n1≡2(mod 4) and that n2 and n3 are odd. In this case (Dβn1⊠Dβn2⊠Dβn3)↓Aν does not split by Lemma 6.2. So Dβn↓Aν has exactly two composition factors and then E±βn↓Aν is irreducible.
In the case (c) assume first that both n1 and n2 are odd. Then Dβn↓Sν is irreducible by (6.4). So Dβn↓Aν has at most two composition factors and then E±βn↓Aν is irreducible. So we may assume that at least one of n1, n2 is even. In this case Dβn↓Sν has exactly two composition factors by (6.4). If n1,n2≡2(mod 4) then (Dβn1⊠Dβn2)↓Aν splits by Lemma 6.2 and so E±βn↓Aν is reducible. Otherwise we may assume without loss of generality that n1≡2(mod 4). In this case (Dβn1⊠Dβn2)↓Aν does not split by Lemma 6.2. So Dβn↓Aν has exactly two composition factors and then E±βn↓Aν is irreducible.
∎
6.2. Restricting basic spin module to transitive imprimitive subgroups
Throughout this subsection, a,b∈Z≥2 with ab=n. We investigate when the restriction E±βn↓Ga,b is irreducible.
A special role will be played by the irreducible F(Sa≀Sb)-modules of the form Dμ≀Dν for μ∈P2(a) and ν∈P2(b). As a vector space, Dμ≀Dν=(Dμ)⊗b⊗Dν, and the action on v1⊗⋯⊗vb⊗w∈(Dμ)⊗b⊗Dν is determined from the following requirements: (g1,…,gb)∈Sa×⋯×Sa acts as
[TABLE]
and h∈Sb acts as
[TABLE]
Lemma 6.5**.**
All composition factors of the restriction Dβn↓Sa≀Sb are of the form Dβa≀Dβb, and
[TABLE]
Proof.
The first statement is established in the course of proving [17, Lemma 7.19]. The second one follows by dimensions taking into account that dimDβa≀Dβb=dimDβb(dimDβa)b.
∎
Proposition 6.6**.**
Suppose that n≡2(mod 4).
The restriction E±βn↓Ga,b is irreducible if and only if one of the following conditions holds:
(i)
a* is odd;*
2. (ii)
a≡2(mod 4)* and b=2.*
Proof.
We consider the following cases.
Case 1. a* is odd*. Then b≡2(mod 4). By Lemma 6.5, we have that Dβn↓Sa≀Sb≅Dβa≀Dβb. Since Dβn splits and Ga,b is an index 2 subgroup of Sa≀Sb, it follows that Dβa≀Dβb↓Ga,b is a direct sum of two irreducible modules and so E±βn↓Ga,b is irreducible, giving case (i).
Case 2. a* is even and b is even.* As Ga,b is an index 2 subgroup of Sa≀Sb, by Lemma 6.5, we may assume that b=2, in which case we have [Dβn↓Sn/2≀S2:Dβa≀Dβ2]=2. Note that D^{\beta_{2}}\cong\text{\boldmath1}_{{\sf S}_{2}}.
Case 2.1. a≡2(mod 4). In this case Dβa↓Aa is irreducible, so the restriction (Dβa≀Dβ2)↓Aa×Aa≅Dβa⊠Dβa is irreducible. Hence
(Dβa≀Dβ2)↓Ga,2 is irreducible, as Aa×Aa≤Ga,2. It follows that E±βn↓Ga,2 is irreducible, giving case (ii).
Case 2.2. a≡0(mod 4). We claim that in this case E±βn↓Ga,2 is reducible. To prove this it suffices to show that (Dβa≀Dβ2)↓Ga,2 is reducible. If (Dβa≀Dβ2)↓Ga,2 was irreducible, restricting further to the subgroup Aa≀S2≤Ga,2 would give at most two composition factors, but we claim that (Dβa≀Dβ2)↓Aa≀S2 has three. To see this, note that
[TABLE]
It now follows from the classification of irreducible modules over wreath products that (Dβa≀Dβ2)↓Aa≀S2 has composition factors E+,E−,E such that
E±↓Aa×Aa≅E±βa⊠E±βa,
and
E↓Aa×Aa≅E+βa⊠E−βa⊕E−βa⊠E+βa.
Case 3. a* is even and b is odd.* In this case by the assumption n≡2(mod 4) we have a≡0(mod 4). As Ga,b is an index 2 subgroup of Sa≀Sb, by Lemma 6.5, we may assume that b=3, in which case we have [Dβn↓Sa≀S3:Dβa≀Dβ3]=2. We claim that in this case E±βn↓Ga,b is reducible. To prove this it suffices to show that (Dβa≀Dβ3)↓Ga,3 is reducible. For that note first that
[TABLE]
and that [Aa,a,a:Aa×Aa×Aa]=4 and [Ga,3:Aa,a,a]=6. Also note that
Dβ3 has dimension 2, and Dβa↓Aa splits since
a≡0(mod 4),
so
[TABLE]
In particular (Dβa≀Dβ3)↓Aa×Aa×Aa has 16 composition factors all of the same dimension.
If (Dβa≀Dβ3)↓Ga,3 was irreducible, then (Dβa≀Dβ3)↓Aa,a,a would have k composition factors all of the same dimensions with k∣6. From the previous paragraph it then follows that there exists l∣4 such that the restriction of any of these k composition factors has l composition factors. In particular kl=16, which leads to a contradiction, since k∣6 and l∣4.
∎
We consider the case n≡2(mod 4) for completeness, even though it is not needed for the proof of the mains theorems.
Proposition 6.7**.**
Let n≡2(mod 4). Then Eβn↓Ga,b is irreducible if and only of a is odd.
Proof.
If a is even then even Dβn↓Sa≀Sb is reducible by [17, Theorem C], so we may assume that a is odd. Then by [17, Theorem C] again,
Dβn↓Sa≀Sb≅Dβa≀Dβb, and we claim that (Dβa≀Dβb)↓Ga,b is irreducible. As vector spaces we can write
[TABLE]
Note that the direct summand E+βa⊗⋯⊗E+βa⊗Eβb is invariant under the action of the subgroup Aa≀Ab, and forms a submodule of (Dβa≀Dβb)↓Aa≀Ab isomorphic to
E+βa≀Eβb. Note that
[(Dβa≀Dβb)↓Aa≀Ab:E+βa≀Eβb]=1.
If (Dβa≀Dβb)↓Ga,b is reducible, then restricting further to Aa≀Ab, the submodule E+βa⊗⋯⊗E+βa⊗Eβb≅E+βa≀Eβb described in the previous paragraph, must lie in a proper submodule V⊆(Dβa≀Dβb)↓Ga,b.
Acting with elements of Aab with exactly two odd components, we see that all the subspaces Eε1βa⊗⋯⊗Eεbβa⊗Eβb with even ∣{k∣εk=−}∣ lie in V. Next, taking into account the fact that a is odd, there exists an element of Ga,b≤Sa≀Sb with exactly one odd component in the base group Sab. Acting with this element we see that all the remaining subspaces Eε1βa⊗⋯⊗Eεbβa⊗Eβb also lie in V. Thus V=Dβa≀Dβb giving a contradiction.
∎
We may assume that G is not primitive. If G is intransitive, then (up to conjugation) G is contained in a subgroup of the form An−k,k for 1≤k<n, and we can apply Proposition 6.3. If G is transitive then (up to conjugation) G is contained in a subgroup of the form Ga,b for a,b≥2 and n=ab. In this case we apply Proposition 6.6.
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Aschbacher, On the maximal subgroups of the finite classical groups, Invent. Math. 76 (1984), 469–514.
2[2] D.J. Benson, Spin modules for symmetric groups, J. London Math. Soc. 38 (1988), 250–262.
3[3] C. Bessenrodt and J.B. Olsson, On residue symbols and the Mullineux conjecture, J. Algebraic Combin. 7 (1998), 227–251.
4[4] C. Bessenrodt and J.B. Olsson, Branching of modular representations of the alternating groups, J. Algebra 209 (1998), 143–174.
5[5] C. Bessenrodt and J.B. Olsson, Residue symbols and Jantzen-Seitz partitions, J. Combin. Theory Ser. A 81 (1998), 201–230.
6[6] J.N. Bray, D.F. Holt, and C.M. Roney-Dougal, ‘ The Maximal Subgroups of the Low-dimensional Finite Classical Groups ’, London Math. Soc. Lecture Note Series no. 407 . Camb. Univ. Press, 2013.
7[7] J. Brundan and A.S. Kleshchev, Representations of the symmetric group which are irreducible over subgroups, J. Reine Angew. Math. 530 (2001), 145–190.
8[8] P.J. Cameron, P.M. Neumann and J. Saxl, An interchange property in finite permutation groups, Bull. Lond. Math. Soc. 11 (1979), 161–169.