This paper classifies trivial source Specht modules labeled by hook and two-part partitions, providing complete classifications in certain cases and supporting a conjecture in the even characteristic case.
Contribution
It offers a complete classification of trivial source Specht modules for hook partitions and partial results for two-part partitions, confirming a conjecture in even characteristic.
Findings
01
Complete classification for hook partitions
02
Classification for two-part partitions in odd characteristic
03
Partial classification for partitions with 2-weight 2 in even characteristic
Abstract
The paper presented here focuses on the classification of trivial source Specht modules. We completely classify the trivial source Specht modules labelled by hook partitions. We also classify the trivial source Specht modules labelled by two-part partitions in the odd characteristic case. Moreover, in the even characteristic case, we prove a result for the classification of the trivial source Specht modules labelled by partitions with 2-weight 2, which justifies a conjecture of [16].
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
TopicsAdvanced Algebra and Geometry · Advanced Topics in Algebra · Algebraic structures and combinatorial models
The paper presented here focuses on the classification of trivial source Specht modules. We completely classify the trivial source Specht modules labelled by hook partitions. We also classify the trivial source Specht modules labelled by two-part partitions in the odd characteristic case. Moreover, in the
even characteristic case, we prove a result for the classification of the trivial source Specht modules labelled by partitions with 2-weight 2, which justifies a conjecture of [16].
Let G be a finite group and F be an algebraically closed field of positive characteristic p. The trivial source FG-modules, defined as indecomposable FG-modules with trivial sources, are important objects in the modular representation theory of FG. Though the trivial source FG-modules are known to have plenties of properties, it is usually very difficult to classify explicitly all the trivial source FG-modules. Even in the context of group algebras of symmetric groups, the question of classifying all the trivial source modules is still poorly understood.
For the modules of symmetric groups, it is already well-known that the signed Young modules are trivial source modules (see [5, Theorem 3.8 (b)]). However, little knowledge is known in the classification of trivial source Specht modules. Let Sn be the symmetric group on n letters. According to our knowledge, the project of classifying all trivial source Specht modules of FSn first begins in the thesis of Hudson (see [16]). In her thesis, Hudson classified all the trivial source Specht modules labelled by partitions with p-weight 1 when p>3 and identified the trivial source Specht modules of FS2p and FS2p+1 when p is odd. Moreover, for the case p=2, she provided the following conjecture.
Conjecture**.**
[16, Conjecture 5.0.1]**
Let p=2. Then the trivial source Specht modules labelled by partitions with 2-weight 2 are either simple or isomorphic to Young modules.
The paper presented here pursues the topic of the project. The main approaches used in the paper depend on the fixed-point functors of symmetric groups defined in [14] and the Broué correspondence of trivial source FSn-modules. We completely classify the trivial source Specht modules labelled by hook partitions. When p>2, we also classify the trivial source Specht modules labelled by two-part partitions. Moreover, for p=2 we prove the conjecture of Hudson. To state our results more precisely, let λ be a partition of n and denote by Sλ and Yλ the Specht module and Young module labelled by λ respectively. Take JM(n)p to be the set of partitions labelling simple Specht modules of FSn. We will show the following:
Theorem A**.**
Let n and r be integers such that 0≤r<n. Then S(n−r,1r) is a trivial source module if and only if (n−r,1r)∈JM(n)p or one of the following holds:
(i)
p>3, n=p, 0<r<p−1 and 2∣r;
2. (ii)
p=2, 2∤n, n≥2r>2, r=n−2,n−1 and n≡2r+1(mod2L) where the integer L satisfies 2L−1≤r<2L;
3. (iii)
p=2, 2∤n, 2r>n, r=n−2,n−1 and n≡2r+1(mod2L′) where the integer L′ satisfies 2L′−1≤n−r−1<2L′.
Theorem B**.**
Let p>2 and n, r be integers such that n>0 and 0≤2r≤n. Then S(n−r,r) is a trivial source module if and only if (n−r,r)∈JM(n)p.
Theorem C**.**
Let p=2 and n be an integer such that n≥4. Let λ be a partition of n with 2-weight 2 and κ2(λ) be its 2-core. Then Sλ is a trivial source module if and only if λ falls into one of the following cases:
(i)
λ∈JM(n)2;
2. (ii)
λ∈/JM(n)2, Sλ≅Yμ and μ=κ2(λ)+(2,2).
Notice that the case (ii) of Theorem C indeed happens. For example, let p=2. It is well-known that S(3,1,1) is an indecomposable, non-simple, trivial source module. Theorem C says that S(3,1,1)≅Y(3,2).
The paper is presented as follows. In Section 2, we set up the notation used in the paper and give a brief summary of the required knowledge. Section 3 is used to introduce fixed-point functors of symmetric groups and give some properties of them. Using these properties, in Sections 4 and 5, we prove Theorems A and B respectively. In the final section, we use Broué correspondence to study some trivial source FSn-modules and show Theorem C.
2. Notation and Preliminaries
Throughout the whole paper, let F be an algebraically closed field with positive characteristic p. For a given finite group G, write H≤G(resp.H<G) to indicate that H is a subgroup (resp. a proper subgroup) of G. All FG-modules considered in the paper are finitely generated left FG-modules. Write ↑, ↓ to denote induction and restriction of modules respectively. Use ⊗ and ⊠ to present inner tensor product and outer tensor product of modules respectively. By abusing notation, also use FG to denote the trivial FG-module and omit the subscript if there is no confusion.
2.1. Vertices, sources, Green correspondences and Scott modules
The reader is assumed to be familiar with modular representation theory of finite groups. For a general background of the topic, one may refer to [1] or [27].
Let G be a finite group and M, N be FG-modules. Write N∣M if N is isomorphic to a direct summand of M, i.e., M≅L⊕N for some FG-module L. If N is indecomposable, for a decomposition of M into a direct sum of indecomposable modules, the number of indecomposable direct summands that are isomorphic to N is well-defined by the Krull-Schmidt Theorem and is denoted by [M:N]. Let m be a positive integer and Ni be an FG-module for all 1≤i≤m. Write M∼∑i=1mNi to indicate that there exists a filtration of M such that all quotient factors are exactly isomorphic to these Ni’s. The dual of M is denoted by M∗.
Assume further that M is an indecomposable FG-module and P≤G. Following [13], say P a vertex of M if P is a minimal (with respect to inclusion of subgroups) subgroup of G subject to the condition that M∣(M↓P)↑G. All the vertices of M are known to form a G-conjugacy class of p-subgroups of G. They are G-conjugate to a subgroup of a defect group of the p-block containing M. It is clear that M and the indecomposable FG-modules isomorphic to M have same vertices. Moreover, note that M and M∗ have same vertices by the definition. Let P be a vertex of M. There exists some indecomposable FP-module S such that M∣S↑G. It is called a P-source of M. All the P-sources of M are NG(P)-conjugate to each other, where NG(P) is the normalizer of P in G. Call M a trivial source module if all the P-sources of M are trivial modules. Note that M is a trivial source module if and only if M∗ is a trivial source module.
Let NG(P)≤H≤G. The Green correspondent of M with respect to H, denoted by GH(M), is an indecomposable FH-module with a vertex P such that GH(M)∣M↓H. It is well-known that M↓H≅GH(M)⊕U and GH(M)↑G≅M⊕V where U and V are FH-module and FG-module respectively. Furthermore, for any indecomposable direct summand W of U or V, recall that P is not a vertex of W. For more properties of GH(M), one can refer to [27, §4.4].
Let K≤G. For the transitive permutation module FK↑G, a well-known fact says that it has a unique trivial submodule and a unique trivial quotient module. Moreover, there exists an indecomposable direct summand of FK↑G with a trivial submodule and a trivial quotient module. The module, unique up to isomorphism, is called the Scott module of FK↑G and is denoted by ScG(K). The vertices of ScG(K) are G-conjugate to the Sylow p-subgroups of K and it is a trivial source module.
For more properties of ScG(K), one may refer to [3].
2.2. Generic Jordan types and Brauer constructions of modules
We shall introduce some tools used in the paper. Let Cp=⟨g⟩ be a cyclic group of order p and M be an FCp-module. According to representation theory of cyclic groups, the matrix representations of g on all indecomposable FCp-modules are exactly the Jordan blocks with all eigenvalues 1 and sizes between 1 to p. So M can be viewed as a direct sum of the Jordan blocks. We call the direct sum of the Jordan blocks the Jordan type of M and denote it by [1]n1…[p]np, where [i] denotes a Jordan block of size i and ni means the number of Jordan blocks of size i in the sum.
Let E be an elementary abelian p-group of order pn with a generator set {g1,…,gn} and M be an FE-module. Let K denote the extension field F(α1,…,αn) over F where {α1,…,αn} is a set of indeterminates. Write uα to denote the element 1+∑i=1nαi(gi−1) of KE. Note that ⟨uα⟩ is a cyclic group of order p and M can be viewed as a K⟨uα⟩-module naturally. So the Jordan type of M↓⟨uα⟩ is meaningful and is called generic Jordan type of M. Wheeler in [29] showed that generic Jordan type of M is independent of the choices of generators of E. The stable generic Jordan type of M is the generic Jordan type of M modulo free direct summands.
Notice that the modules isomorphic to M as FE-modules and M have same generic Jordan type. For more properties of generic Jordan types of modules, one may refer to [9] and [29].
Let G be a finite group and M be an FG-module. Say M a p-permutation module if, for every p-subgroup P of G, there exists a basis BP of M depending on P such that BP is permuted by P. Note that the class of p-permutation modules is closed by taking direct sums and non-zero direct summands. It is well-known that indecomposable p-permutation FG-modules are exactly trivial source FG-modules. Therefore, a p-permutation FG-module is also equivalently defined to be a non-zero direct summand of a permutation FG-module. To detect p-permutation FG-modules, the following direct corollary of [21, Lemma 3.1] is helpful.
Lemma 2.1**.**
Let E be an elementary abelian p-subgroup of a finite group G. Let M be a p-permutation FG-module. Then M↓E has stable generic Jordan type [1]m for some non-negative integer m.
We now describe the Brauer constructions of p-permutation modules developed by Broué in [2]. Let P≤G and MP be the fixed-point subspace of an FG-module M under the action of P. Note that MP is an F[NG(P)/P]-module. For any p-subgroup Q of P, the relative trace map from MQ to MP, denoted by TrQP, is defined to be
[TABLE]
where {P/Q} is a complete set of representatives of left cosets of Q in P. Observe that the linear map TrQP is well-defined as it is independent of the choices of {P/Q}. Continuously,
[TABLE]
It is also obvious to see that TrP(M) is an F[NG(P)/P]-submodule of MP. The Brauer construction of M with respect to P, written as M(P), is defined to be the F[NG(P)/P]-module
[TABLE]
Notice that M(P)=0 if P is not a p-subgroup of G. For our purpose, we collect some well-known properties of Brauer constructions of modules as follows.
Lemma 2.2**.**
The following assertions hold.
(i)
Let G be a finite group and P be a p-subgroup of G. Let M be a p-permutation FG-module. If there exist some FG-modules U and V such that M≅U⊕V, then M(P)≅U(P)⊕V(P).
2. (ii)
[11, Lemma 2.7]** Let G1, G2 be finite groups and P1, P2 be p-groups such that P1≤G1 and P2≤G2. Let Mi be a p-permutation FGi-module for any 1≤i≤2. Then (M1⊠M2)(P1×P2)≅M1(P1)⊠M2(P2) as modules under the action of NG1×G2(P1×P2)/(P1×P2)≅(NG1(P1)/P1)×(NG2(P2)/P2).
The main result of this subsection, known as Broué correspondence, is summarized as follows.
Theorem 2.3**.**
[2, Theorems 3.2 and 3.4]**
Let P be a p-subgroup of a finite group G and M be a trivial source FG-module with a vertex P. Let L be a p-permutation FG-module.
(i)
The correspondence M↦M(P) is a bijection between the isomorphism classes of trivial source FG-modules with a vertex P and the isomorphism classes of indecomposable projective F[NG(P)/P]-modules.
2. (ii)
The inflation of M(P) from NG(P)/P to NG(P) is isomorphic to
GNG(P)(M).
3. (iii)
Let N be a trivial source FG-module with a vertex Q. Then N∣L if and only if N(Q)∣L(Q). We also have [L:N]=[L(Q):N(Q)].
2.3. Combinatorics
Let N be the set of natural numbers. Let n∈N and n be the set {1,…,n}. Let Sn be the symmetric group acting on n. Set S0 to be the trivial group. A partition of a positive integer m is a non-increasing sequence of positive integers (λ1,…,λℓ) such that ∑i=1ℓλi=m. By abusing notation, as the empty set, the unique partition of [math] is denoted by ∅. Let λ=(λ1,…,λℓ) be a partition. As usual, define ∣λ∣ to be ∑i=1ℓλi and write λ⊢∣λ∣ to indicate that λ is a partition of ∣λ∣. Assume further that λ⊢n. Say λ a two-part partition if ℓ≤2. By the exponential expression of partitions, λ is called a hook partition if λ=(n−r,1r) for some integer r such that 0≤r<n. We will use exponential expression of partitions throughout the whole paper. The Young diagram of λ, denoted by [λ], is the set
[TABLE]
Each element of [λ] is called a node of [λ]. For any node (i,j) of [λ], the hook of the node (i,j) is the set {(i,k)∈[λ]:k≥j}∪{(k,j)∈[λ]:k>i}. Denote the set by Hi,jλ and put hi,jλ=∣Hi,jλ∣. We will not distinguish between λ and [λ] in the paper.
The p-core κp(λ) of λ is the partition whose Young diagram is constructed by removing all rim p-hooks from λ successively. Due to the Nakayama Conjecture, the p-cores of partitions of n label the p-blocks of FSn. We thus write Bκp(λ) to denote the p-block of FSn labelled by κp(λ). The number of rim p-hooks removed from λ to obtain κp(λ) is called the p-weight of λ and is denoted by wp(λ). The p-weight of Bκp(λ) is defined to be wp(λ). One can choose a defect group of Bκp(λ) to be a Sylow p-subgroup of Spwp(λ). We say that λ is p-restricted if λℓ<p and λi−λi+1<p for all 1≤i<ℓ. Take λ′ to be the conjugate of λ and say λ a p-regular partition if λ′ is p-restricted. The p-adic expansion of λ is the unique sum ∑i=0mpiλ(i) for some m∈N∪{0}, where λ(i) is p-restricted or ∅ for all 0≤i≤m, λ(m)=∅ and λ=∑i=0mpiλ(i) via component-wise addition and scalar multiplication of partitions.
2.4. Modules of symmetric groups
We now briefly present some material of representation theory of symmetric groups needed in the paper. One can refer to [17] or [20] for a background of the topic. Given the non-negative integers m1,…,mℓ such that ∑i=1ℓmi≤n, define S(m1,…,mℓ)=Sm1×⋯×Smℓ≤Sn, where Sm1 acts on the set {1,…,m1} (if m1=0), Sm2 acts on the set {m1+1,…,m1+m2} (if m2=0) and so on. Let λ⊢n. The Young subgroup associated with λ of Sn is defined to be Sλ. Throughout the paper, for a given integer m with 1≤m≤n, view Sm and Sn−m as corresponding components of S(m,n−m). So they commute with each other. Use sgn(n) to denote the sign module of Sn and omit the parameter if the symmetric group is clear. If p=2, sgn means the corresponding trivial module.
To describe modules of symmetric groups, we assume that the reader is familiar with the definitions of tableau, tabloid and polytabloid (see [17] or [20]). The Young permutation module with respect to λ, denoted by Mλ, is the F-space generated by all λ-tabloids where Sn permutes these tabloids. Notice that Mλ is a p-permutation module since it is a permutation module.
The Specht module Sλ is an FSn-submodule of Mλ generated by all λ-polytabloids. The dual of Sλ is denoted by Sλ. It is well-known that Sλ is indecomposable if p>2 or p=2 and λ is 2-regular (or 2-restricted). The relation of Sλ and Sλ′ is given by Sλ⊗sgn≅Sλ′. In particular, if p=2, Sλ≅Sλ′ if Sλ is self-dual. Unlike the characteristic zero case, {Sλ:λ⊢n} is usually not the set of all simple modules of Sn up to isomorphism. However, when λ is p-regular, James in [17, Theorem 11.5] showed that Sλ has a simple head Dλ. Moreover, the set D_{n,p}=\{D^{\mu}:\ \mu\ \text{is}\ \text{a}\ \text{p-regular}\ \text{partition}\ \text{of}\ n\}
forms a complete set of representatives of isomorphic classes of simple FSn-modules. It is well-known that every module in Dn,p is self-dual. Following the notation used in [5, Section 4], we denote the set {λ⊢n:Sλissimple} by JM(n)p.
A Specht filtration of an FSn-module is a filtration of the module with all the successive quotient factors isomorphic to some Specht modules.
For a given decomposition of Mλ into a direct sum of indecomposable modules, there exists an indecomposable direct summand of Mλ that contains Sλ. The module is unique up to isomorphism and is denoted by Yλ. Let μ⊢n and ⊴ denote the dominance order on the set of all partitions of n. James in [18, Theorem 3.1] showed that [Mλ:Yλ]=1 and [Mλ:Yμ]=0 only if λ⊴μ. One thus gets
[TABLE]
where kλ,μ=[Mλ:Yμ] and all kλ,μ’s are known as p-Kostka numbers. Note that Young modules are self-dual and are p-permutation modules with trivial sources.
The Brauer constructions of Young modules with respect to their vertices are studied by [8] and [12]. To describe them, let λ have p-adic expansion ∑i=0mpiλ(i) for some non-negative integer m, where ∣λ(i)∣=ni for all 0≤i≤m. Denote by Oλ the partition
[TABLE]
Theorem 2.4**.**
[8, 12]**
Let λ⊢n. Then the vertices of Yλ are Sn-conjugate to the Sylow p-subgroups of SOλ. Moreover, Yλ is projective if and only if λ is p-restricted.
Theorem 2.5**.**
[8]**
Let λ⊢n and λ have p-adic expansion ∑i=0mpiλ(i) where ∣λ(i)∣=ni for all 0≤i≤m. Let α=(n0,…,nm) and Pλ be a Sylow p-subgroup of SOλ.
(i)
We have Sα≅NSn(Pλ)/NSOλ(Pλ)≅(NSn(Pλ)/Pλ)/(NSOλ(Pλ)/Pλ).
2. (ii)
We have that NSOλ(Pλ)/Pλ acts trivially on Yλ(Pλ). Therefore, Yλ(Pλ) can be viewed as an FSα-module.
3. (iii)
We have Yλ(Pλ)≅Yλ(0)⊠Yλ(1)⊠⋯⊠Yλ(m) as FSα-modules.
We conclude the section by collecting some results used in the following discussion.
Theorem 2.6**.**
[4, Proposition 4.6]** The trivial source simple FSn-modules are exactly the simple FSn-Specht modules.
Lemma 2.7**.**
Let λ⊢n and M be an FSn-module. Then
(i)
M* is a p-permutation module if and only if M∗ is a p-permutation module.*
2. (ii)
M* is a p-permutation module if and only if M⊗sgn is a p-permutation module, where sgn means the FSn-trivial module if p=2.*
3. (iii)
Sλ* is a p-permutation module if and only if Sλ′ is a p-permutation module.*
Proof.
Note that ∗ preserves direct sum of FSn-modules and takes a permutation module to a permutation module. (i) thus follows by noticing that M≅(M∗)∗.
Let v be a generator of sgn. If M is a p-permutation module, for any p-subgroup P of Sn, let BP be a basis of M which is permuted by P. Note that BP,v={u⊗v:u∈BP} is a basis of M⊗sgn which is permuted by P. So M⊗sgn is a p-permutation module by the definition. (ii) follows by noting that M≅(M⊗sgn)⊗sgn.
As Sλ′≅(Sλ⊗sgn)∗, (iii) thus follows by combining (i) and (ii). The lemma follows.
∎
3. Fixed-point functors of symmetric groups
The section is designed to study fixed-point functors of symmetric groups. After a short summary of these objects, we present some properties of the functors. Some results will be used in the following two sections while others may be of independent interest.
Let m∈N, m≤n and M be an FSn-module. Recall that Sn−m centralizes Sm. So the space MSm is viewed as an FSn−m-module naturally. The fixed-point functor with the parameter m, introduced by Hemmer in [14], is defined to be
[TABLE]
setting Fm(M)=MSm≅HomFSm(F,M↓Sm)≅HomFSn(M(m,1n−m),M). It is also convenient to regard Fm(M) as the largest subspace of M↓S(m,n−m) where Sm acts trivially. Note that F1(M)=M↓Sn−1 by the definition. Moreover, the functor Fm is exact if m<p and is not exact in general if m≥p. In [15], Hemmer obtained some results of extensions of simple modules of symmetric groups by using fixed-point functors. For any λ⊢n, he also conjectured that
Fm(Sλ) had a Specht filtration (see [14, Conjecture 7.3] or [15, Conjecture 7.2]). However, the conjecture was shown to be false in [7].
We now begin to prove some properties of fixed-point functors. Throughout the whole section, fix an integer m satisfying 1≤m≤n.
Lemma 3.1**.**
Let M and N be FSn-modules. Then Fm(M⊕N)=Fm(M)⊕Fm(N).
Proof.
Note that (M⊕N)Sm=MSm⊕NSm. The lemma follows by restricting both sides of the equality to Sn−m and the definition of fixed-point functors.
∎
Proposition 3.2**.**
Let P be a projective FSn-module. Then Fm(P) is a projective FSn−m-module.
Proof.
We may assume that P is non-zero. As P is projective, for some positive integer ℓ, we have
[TABLE]
where Pi and Qi are indecomposable projective FSm-module and FSn−m-module respectively for all 1≤i≤ℓ. Regarding both sides of (3.1) as FSn−m-modules, we get that Fm(P)≅⨁i=1ℓdimFPiSm.Qi, which implies the desired result.
∎
Let ℓ be an integer and Ωℓ be the ℓth Heller translate of modules of a given symmetric group. We have
Corollary 3.3**.**
Let M be an FSn-module. If m<p, for any integer ℓ, we have Fm(Ωℓ(M))≅Ωℓ(Fm(M)) in the stable category of FSn−m-modules.
Proof.
The case ℓ=0 is clear by Lemma 3.1 and Proposition 3.2. When ℓ=0, note that Fm is exact. By Proposition 3.2 again, Fm takes a minimal projective resolution (resp. a minimal injective resolution) of M to be a projective resolution (resp. an injective resolution) of Fm(M). Therefore, the desired result follows.
∎
Corollary 3.3 may not be true if the fixed-point functor is not exact. For example, let p=2 and n=4. Note that F2 is not exact. Let P be the projective cover of the trivial FS4-module F. For the short exact sequence
0→Ω1(F)→P→F→0, by Proposition 3.2 and long exact sequence,
we have
[TABLE]
As Ω1(F)↓S2 is not free, ExtFS41(M(2,12),Ω1(F))≅ExtFS21(F,Ω1(F)↓S2)=0. These
facts and the long exact sequence imply that F2(Ω1(F))≅F2(P). So F2(Ω1(F)) is projective by Proposition 3.2. However, the FS2-module Ω1(F) is not projective. We thus have F2(Ω1(F))≅Ω1(F) in the stable category of FS2-modules.
Lemma 3.4**.**
Let H≤Sn. Then Fm(FH↑Sn) is a permutation FSn−m-module.
Proof.
It is sufficient to check that Fm(FH↑Sn) has a permutation basis under the action of Sn−m. Let s=∣Sn:H∣ and B=⋃i=1s{giH} be a complete set of representatives of left cosets of H in Sn.
For any σ∈Sn and giH∈B, there exists a unique gjH∈B such that σgiH=gjH.
We denote gj by gσ,i and view B as a basis of FH↑Sn. For all 1≤i≤s, let O(gi) be the orbit of B containing giH
under the action of Sm and O(gi)={xi,1giH,…,xi,tigiH}. So B=⨄j=1tO(gij),
where, for all 1≤j≤t≤s, tij=∣O(gij)∣ and xij,1,…,xij,tij∈Sm.
For any σ∈Sn, let σO(gi)={σxH:xH∈O(gi)} for all 1≤i≤s.
Moreover, write O(gi) to be the sum ∑xH∈O(gi)xH and notice that B=⋃j=1t{O(gij)}
is a basis of (FH↑Sn)Sm. For any τ∈Sn−m, O(gij)⊆B, if ∣O(gij)∣>1, for any integers u,v such that 1≤u<v≤tij, note that xij,ugτ,ijH=xij,vgτ,ijH as xij,ugijH=xij,vgijH. Therefore, τO(gij)⊆O(gτ,ij). Similarly, we have τ−1O(gτ,ij)⊆O(gij). The two relations imply that τO(gij)=O(gτ,ij)=O(gia) for some a∈N and a≤t. We thus have
[TABLE]
If ∣O(gij)∣=1, by a similar deduction, τO(gij)=O(gib) where b∈N, b≤t and ∣O(gib)∣=1. So B is a permutation basis under the action of Sn−m. ∎
We close the section by a corollary. It will be used in the following discussion.
Corollary 3.5**.**
Let M be a p-permutation FSn-module. If Fm(M)=0, then Fm(M) is a p-permutation FSn−m-module.
Proof.
View M as a direct summand of a direct sum of some transitive permutation FSn-modules. By Lemmas 3.1 and 3.4, observe that Fm(M) is a non-zero direct summand of a direct sum of some permutation FSn−m-modules. So Fm(M) is indeed a p-permutation FSn−m-module by the definition.
∎
4. The Specht modules labelled by hook partitions
The section focuses on proving Theorem A. Throughout the whole section, fix n>1 and integers m,r satisfying 1≤m,r<n. We first present some explicit calculation results of Fm(S(n−r,1r)) and then finish the proof of Theorem A.
Notation 4.1**.**
For convenience, we introduce the required notation.
(i)
Let S be a set and write ⟨S⟩ to denote an F-linear space spanned by elements of S. Set ⟨∅⟩=0 and ⟨s⟩=⟨S⟩ if S={s}. Let An be a n-dimensional linear space over F with a basis {e1,…,en} and Ab=⟨{e1,…,eb}⟩ for all 1≤b≤n. Write fi=ei−en for all 1≤i≤n. Note that Ab is an FSb-module as Sb permutes the subscripts of its basis {e1,…,eb}. So An≅M(n−1,1) and S(n−1,1)≅⟨{f1,…,fn−1}⟩. Identify a basis of S(n−1,1) with {f1,…,fn−1}. If n−m≥2, also identify a basis of S(n−m−1,1) with {fm+1,…,fn−1}.
2. (ii)
Let a,b,c∈N. Set J(a,b,c)={i=(i1,…,ib)∈Nb:a≤i1<⋯<ib≤c} and J+(a,b,c)={i=(i1,…,ib)∈Nb:a≤i1<⋯<ib<c}. Write J(a,b), J+(a,b) to denote J(a,b,n), J+(a,b,n) respectively. Let b≤n and ⋀cAb, ⋀cS(n−1,1) be the cth exterior power of Ab, S(n−1,1) respectively. By convention, put ⋀0S(n−1,1)=F and ⋀1S(n−1,1)=S(n−1,1). If c<n and c≤b, then ⋀cAb has a basis
{ei=ei1∧⋯∧eic:i=(i1,…,ic)∈J(1,c,b)}
and ⋀cS(n−1,1) has a basis {fi=fi1∧⋯∧fic:i=(i1,…,ic)∈J+(1,c)}. Use BAbc, BSc to denote the two bases respectively. If r+m−n<c<r and n−m≥2, then the (r−c)th exterior power ⋀r−cS(n−m−1,1) has a basis {fi:i∈J+(m+1,r−c)}. For any v∈⋀rS(n−1,1) and fi∈BSr, let div be the coefficient of fi in the linear combination of elements of BSr representing v.
3. (iii)
Let ℓ be an integer such that 0≤ℓ≤r. Recall that m={1,…,m} and set
[TABLE]
Note that Bu∩Bv=∅ if u=v and observe that Bℓ=∅ if and only if
[TABLE]
For any v∈(⋀rS(n−1,1))Sm and Bℓ=∅, put Bℓv=∑w∈Bℓdwvw, where dwv=div if w=fi. For completeness, let Bℓv=0 if Bℓ=∅. Then v=∑i=0rBiv. Moreover, for any g∈Sm,
gBiv=Biv for all 0≤i≤r as gv=v.
4. (iv)
Let b,c∈N such that b,c<n. Set vb,c=∑i∈J(1,c,b)fi if c≤b and put vb,c=0 if b<c. So vb,c∈⋀cS(n−1,1). Note that ⟨{gvb,c:g∈FSb}⟩ is isomorphic to an FSb-submodule of ⋀cAb. In particular, ⟨vb,c⟩⊆⋀cAb up to FSb-isomorphism.
We now present our calculation results.
Lemma 4.2**.**
We have
[TABLE]
Proof.
When n−m≥2, note that
[TABLE]
If p∣m, we get that ∑i=1mfi=∑i=1mei and
[TABLE]
If p∤m, denote m1∑i=1mei by sum and have
[TABLE]
When n−m=1, we get Fm(S(n−1,1))=⟨∑i=1n−1fi⟩,
which is a trivial module. The lemma now follows.
∎
For further calculation, recall that S(n−s,1s)≅⋀sS(n−1,1) for all 0≤s<n (see [24, Proposition 2.3]).
Lemma 4.3**.**
Let p>2, b,c∈N and c≤b≤n. We have
[TABLE]
Proof.
For any u∈(⋀cAb)Sb and u=∑i∈J(1,c,b)kiei, we have ki=kj for any i, j∈J(1,c,b) by using suitable permutations to act on u and comparing the coefficients. So (⋀cAb)Sb⊆⟨∑i∈J(1,c,b)ei⟩. When c>1, set v=∑i∈J(1,c,b)ei and get that v=w+∑(1,2,…,ic)∈J(1,c,b)e1∧e2∧⋯∧eic. Note that no basis element e1∧e2∧⋯∧ejc of BAbc is involved in w. Now use the transposition (1,2) to act on both sides of the equality of v and obtain that (1,2)v=(1,2)w−∑(1,2,…,ic)∈J(1,c,b)e1∧e2∧⋯∧eic.
So (1,2)v=v and (⋀cAb)Sb=0. When c=1, it is clear that AbSb=⟨e1+⋯+eb⟩. The lemma follows.
∎
Lemma 4.4**.**
Let p>2. If r>1, for any v∈(⋀rS(n−1,1))Sm, we have
[TABLE]
where B1v=∑i∈J+(m+1,r−1)kivm,1∧fi
and ki∈F for all i∈J+(m+1,r−1).
Proof.
Recall that v=∑i=0rBiv. Moreover, Biv∈(⋀rS(n−1,1))Sm for all 0≤i≤r as v∈(⋀rS(n−1,1))Sm. We claim that Biv=0 if 1<i≤r. If Bi=∅, by the definition and an easy calculation, we get that
[TABLE]
where
wi∈⟨{fi:i∈J+(m+1,r−i)}⟩.
Suppose that Buv=0 for some 1<u≤r. We have u≤m, vm,u=0 and wu=0 if u<r. Notice that ⟨vm,u⟩⊆⋀uAm up to FSm-isomorphism. By Lemma 4.3, we get that vm,u is not fixed by Sm as (⋀uAm)Sm=0. In particular, vm,u∧wu∈/(⋀rS(n−1,1))Sm if 1<u<r and vm,r∈/(⋀rS(n−1,1))Sm if u=r. By (4.2), these facts imply that Buv=0, which is a contradiction. The claim is shown. When r<n−m, by (4.1), note that B0=∅ and B1=∅. We therefore get v=B0v+B1v by the claim. For the left cases, we can determine whether B0 or B1 is empty by the given conditions and (4.1). Therefore, we obtain the corresponding results by the claim. The proof is now complete.
∎
Lemma 4.5**.**
Let p>2. If r>1, then we have
[TABLE]
where M≅S(n−m−r,1r)⊕S(n−m−r+1,1r−1) and N∼S(n−m−r,1r)+S(n−m−r+1,1r−1).
Proof.
It is sufficient to determine Fm(⋀rS(n−1,1)). When r<n−m, define
[TABLE]
Observe that the vectors of C0∪C1 are all fixed by Sm. Moreover, C0∪C1 is linearly independent over F. By Lemma 4.4, for any v∈(⋀rS(n−1,1))Sm, v=B0v+B1v, B0v∈⟨C0⟩ and B1v=∑j∈J+(m+1,r−1)kjvm,1∧fj, where kj∈F for all j∈J+(m+1,r−1). We thus conclude that C0∪C1 is a basis of (⋀rS(n−1,1))Sm by these facts. If p∣m, C1 degenerates to be {(∑i=1mei)∧fj:j∈J+(m+1,r−1)}. Therefore, we get Fm(⋀rS(n−1,1))=⟨C0⟩⊕⟨C1⟩, where ⟨C0⟩≅S(n−m−r,1r) and ⟨C1⟩≅S(n−m−r+1,1r−1) as FSn−m-modules.
If p∤m, let S=Fm(⋀rS(n−1,1)) and P=⟨C0⟩. Notice that P≅S(n−m−r,1r) as FSn−m-modules. We need to show that S/P≅S(n−m−r+1,1r−1) as FSn−m-modules. For any v∈S, let v be the image of v under the natural map from S to S/P. Define a linear map ϕ from S/P to ⋀r−1S(n−m−1,1) by sending each vm,1∧fj to fj. It is obvious to see that ϕ is a linear isomorphism. To show that it is an FSn−m-isomorphism, it is enough to check that the action of transposition (n−1,n) is preserved by ϕ. Set σ=(n−1,n) and s=∑i=1mei. Note that vm,1=s−men by the definition. For any vm,1∧fj∈C1 where j=(j1,…,jr−1), we distinguish with two cases.
Case 1:
jr−1<n−1.
We have
[TABLE]
Case 2:
jr−1=n−1.
We have
[TABLE]
So ϕ is an FSn−m-isomorphism. We thus get that N∼S(n−m−r,1r)+S(n−m−r+1,1r−1)
as ⋀r−1S(n−m−1,1)≅S(n−m−r+1,1r−1).
When r=n−m, by Lemma 4.4 and a similar discussion as above, we obtain (⋀rS(n−1,1))Sm=⟨vm,1∧fm+1∧⋯∧fn−1⟩ and Fm(⋀rS(n−1,1))≅sgn. When r>n−m, by Lemma 4.4, Fm(⋀rS(n−1,1))=0 as (⋀rS(n−1,1))Sm=0. The proof is now complete.
∎
Lemma 4.6**.**
Let p=2, a,b∈N and a≤b<n. For any s∈{b+1,…,n}, we have
[TABLE]
Proof.
The case a=1 is trivial by a direct calculation. We now consider the case a>1. For any (i1,…,iℓ,…,ia)∈J(1,a,b), we shall write fi1∧⋯∧fiℓ∧⋯∧fia to denote the corresponding vector of ⋀a−1S(n−1,1) without the component fiℓ. Since p=2, we have
[TABLE]
as desired.
∎
Lemma 4.7**.**
Let p=2 and s=r+m−n+1. If r>1, for any v∈(⋀rS(n−1,1))Sm, we have
[TABLE]
where, for all 0<i<r, Biv=∑i∈J+(m+1,r−i)kivm,i∧fi and ki∈F for all i∈J+(m+1,r−i). Furthermore, Brv∈⟨vm,r⟩.
Proof.
Recall that v=∑i=0rBiv. Moreover, we have Biv∈(⋀rS(n−1,1))Sm for all 0≤i≤r as v∈(⋀rS(n−1,1))Sm. If Bi=∅, an easy calculation gives that
[TABLE]
where wi∈⟨{fi:i∈J+(m+1,r−i)}⟩.
When m<r, by (4.1), note that Bi=∅ for all m<i≤r. When n−m≤r, notice that 0<s. Therefore, by (4.1) again, Bi=∅ for all 0≤i<s. We now get the corresponding results according to these facts and the given conditions. The lemma follows.
∎
Lemma 4.8**.**
Let p=2 and s=r+m−n+1. If r>1, then we have
[TABLE]
Proof.
It is sufficient to work on Fm(⋀rS(n−1,1)). Let ℓ∈N and ℓ<r. When J+(m+1,r), J+(m+1,r−ℓ)=∅ and ℓ≤m, define
[TABLE]
Set Cℓ=∅ if J+(m+1,r−ℓ)=∅ or m<ℓ and put Ci,j=⨄k=ijCk for all 1≤i≤j<r. When r<n−m and r≤m, define C={vm,r}∪C0∪C1,r−1. Note that each vector of C is fixed by Sm. Moreover, C is linearly independent over F. By Lemma 4.7, for any v∈(⋀rS(n−1,1))Sm, v=∑a=0rBav, B0v∈⟨C0⟩, Brv∈⟨vm,r⟩, Bav=∑j∈J+(m+1,r−a)kjvm,a∧fj,
where 1≤a<r and kj∈F for all j∈J+(m+1,r−a). By these facts, we conclude that C is a basis of (⋀rS(n−1,1))Sm.
We shall construct the desired Specht filtration for Fm(⋀rS(n−1,1)). Let U0=⟨C0⟩ and Ui=⟨C0∪C1,i⟩ for all 1≤i<r. Set Ur=Fm(⋀rS(n−1,1)). We have a chain of subspaces of
Fm(⋀rS(n−1,1)) given by
[TABLE]
By the definition of U0, note that U0≅S(n−m−r,1r) as FSn−m-modules. We claim that Ui is an FSn−m-module for all 1≤i<r. According to the definition of Ui, it is enough to check that every element of C1,i is still in Ui under the action of the transposition (n−1,n). Write σ=(n−1,n). For any vm,ℓ∧fj∈C1,i, note that 1≤ℓ≤i<r≤m. If ℓ>1, we have the following calculation:
[TABLE]
where the last equality is from Lemma 4.6. Similarly, one can finish the checking if ℓ=1. The claim is shown. Finally, we will prove that Ui/Ui−1≅⋀r−iS(n−m−1,1) as FSn−m-modules for all 1≤i≤r. For any v∈Ui, write v to denote the image of v under the natural map from Ui to Ui/Ui−1. When 1≤i<r, define a linear map ϕi from Ui/Ui−1 to ⋀r−iS(n−m−1,1) by sending each vm,i∧fj to fj. It is easy to observe that ϕi is a linear isomorphism. To show that ϕi is an FSn−m-isomorphism, we only need to check that the action of σ is preserved by ϕi. If i=1, one may develop a similar checking as the one given in Lemma 4.5. If 1<i<r, one can use the calculation of checking that Ui is an FSn−m-submodule to finish the checking. Therefore, ϕi is an FSn−m-isomorphism for all 1≤i<r. Define a linear map ϕr from Ur/Ur−1 to F by sending vm,r to a generator of F. By Lemma 4.6, it is obvious to see that ϕr is an FSn−m-isomorphism. We now have shown that Fm(⋀rS(n−1,1)) has the desired Specht filtration as ⋀r−iS(n−m−1,1)≅S(n−m−r+i,1r−i) for all 1≤i≤r.
The proofs of all the other cases are similar to the one of the case r<n−m and r≤m. We only list corresponding assertions for each case. One may follow the proof presented above to justify them.
When m<r<n−m, (⋀rS(n−1,1))Sm has a basis C0∪C1,m. Let U0=⟨C0⟩, Ui=⟨C0∪C1,i⟩ for all 1≤i<m and Um=Fm(⋀rS(n−1,1)). Then the chain of the FSn−m-modules
[TABLE]
gives the desired Specht filtration to Fm(⋀rS(n−1,1)). When n−m≤r≤m<n−1, (⋀rS(n−1,1))Sm has a basis {vm,r}∪Cs,r−1.
Let Ui=⟨Cs,i⟩ for all s≤i<r and
Ur=Fm(⋀rS(n−1,1)). Then the chain of the FSn−m-modules
[TABLE]
provides the desired Specht filtration for Fm(⋀rS(n−1,1)). When m=n−1, (⋀rS(n−1,1))Sm has a basis {vm,r}. So Fm(⋀rS(n−1,1))≅S(1). When n−m≤r and r>m, (⋀rS(n−1,1))Sm has a basis Cs,m.
Set Ui=⟨Cs,i⟩ for all s≤i<m and Um=Fm(⋀rS(n−1,1)). Then the chain of the FSn−m-modules
[TABLE]
induces the desired Specht filtration of Fm(⋀rS(n−1,1)). The proof is now complete.
∎
A direct corollary of Lemmas 4.2, 4.5 and 4.8 is given as follows.
Corollary 4.9**.**
Let a and b be integers such that 0≤a<n and 1≤b≤n. Then the following assertions hold.
(i)
If Fb(S(n−a,1a))=0, then there exists a Specht filtration of Fb(S(n−a,1a)) such that all the successive quotient factors of the filtration are labelled by the hook partitions of n−b.
2. (ii)
Let M be an FSn-module with a Specht filtration and Fb(M)=0. If b<p and all the successive quotient factors of the filtration are labelled by hook partitions of n, then Fb(M) has a Specht filtration with all successive quotient factors labelled by hook partitions of n−b.
Proof.
Note that Fn takes an FSn-module to zero or a direct sum of trivial modules. Also notice that Fb(S(n)) is a trivial module. (i) is clear by Lemmas 4.2, 4.5 and 4.8. For (ii), as Fb is now exact, we get the desired result by (i) and induction on the number of quotient factors of the filtration.
∎
One more result is needed to prove Theorem A. It is a part of [23, Theorem 4.5]. To state it and finish the proof of Theorem A, we need another notation. Let a∈N and ap≤n. Let Ea be the elementary abelian p-subgroup ⟨⋃i=ab{si}⟩ of Sn where b=⌊pn⌋ and si=((i−1)p+1,(i−1)p+2,…,ip).
Lemma 4.10**.**
Let p∣n and a be the remainder of r when r is divided by p. If 2∤a, then the stable generic Jordan type of S(n−r,1r)↓E1 is [p−1]b, where b∈N.
Let n>p>2. Then S(n−r,1r) is a trivial source module if and only if (n−r,1r)∈JM(n)p.
Proof.
One direction is clear by Theorem 2.6. For the other direction, we may assume further that p∣n, since it is well-known that S(n−r,1r) is simple if p∤n (see [17, Theorem 24.1]). Let a be the remainder of r when r is divided by p. By Lemmas 4.10 and 2.1, we may assume further that r>1 and 2∣a. We consider about the following cases.
Using Lemma 4.10, we get that the stable generic Jordan type of S(n−2p−r+2,1r−2)↓E3 is [p−1]b, where b∈N. Therefore, S(n−2p−r+2,1r−2) is not a trivial source module by Lemma 2.1. By Corollary 3.5, the fact implies that S(n−r,1r) is not a trivial source module. When n−r<2p, note that n−r=p since p∣n−r and n>r. By Lemma 2.7 (iii), we know that S(r+1,1p−1) is a trivial source module if and only if S(p,1r) is a trivial source module. Notice that r>p−1 as r>1 and a=0. We now apply Fp to S(r+1,1p−1) and obtain that
[TABLE]
by Lemma 4.5. By Lemma 4.10, the stable generic Jordan type of S(r−p+2,1p−2)↓E2 is [p−1]c, where c∈N. Therefore, by the same reason mentioned in the case n−r≥2p and Lemma 2.7 (iii), we deduce that S(p,1r) is not a trivial source module.
By Lemma 4.10 again, the stable generic Jordan type of S(n−p−r+1,1r−1)↓E2 is [p−1]d, where d∈N. So S(n−p−r+1,1r−1) is not a trivial source module by Lemma 2.1. We thus deduce that S(n−r,1r) is not a trivial source module by Corollary 3.5. For the left case, note that n−r=p as p∣n and 0<a<p. When n−r<p, if a=p−1, we have n−r=1 as p∣n and n−r<p. So S(n−r,1r) is in fact the simple module S(1n). We thus assume that a<p−1 in the following discussion. By Lemma 2.7 (iii), we know that S(r+1,1n−r−1) is a trivial source module if and only if S(n−r,1r) is a trivial source module. Note that r>p. Otherwise, we get 2p≤n−r+r<p+p=2p, which is absurd. Moreover, observe that n−r−1≡p−1−a(modp), 2∣p−1−a and p−1−a>0. One may write a similar proof as the one given in the case n−r>p to deduce that S(r+1,1n−r−1) is not a trivial source module. Using Lemma 2.7 (iii) again, we get that
S(n−r,1r) is not a trivial source module.
By the analysis of above two cases, we have shown that S(n−r,1r) is not a trivial source module if n>p>2, p∣n and n−r>1. Therefore, if n>p>2, S(n−r,1r) is a trivial source module only if it is simple. The proof is now complete.
∎
Remark 4.12**.**
Let p>2. If n<p, all the Specht modules are trivial source modules. Moreover, they are all simple. If n=p, let a be an integer such that 0≤a<p. It is known that S(p−a,1a) is a trivial source module if and only if 2∣a (See [8]). These trivial source Specht modules are non-simple except S(p) and S(1p).
We now deal with the case p=2. In this case, all the indecomposable Specht modules labelled by hook partitions of n were classified by Murphy in [25]. Let us state her result as follows. If 2∤n and n≥2r, S(n−r,1r) is indecomposable if and only if n≡2r+1(mod2L), where L∈N and 2L−1≤r<2L. If 2∤n and 2r>n, S(n−r,1r) is indecomposable if and only if n≡2r+1(mod2L′), where L′∈N and 2L′−1≤n−r−1<2L′. If 2∣n, all Specht modules labelled by hook partitions of n are indecomposable. We need the following lemma to conclude the case.
Lemma 4.13**.**
Let p=2 and 2∤n. If S(n−r,1r) is indecomposable, then
(i)
S(n−r,1r)* is a trivial source module.*
2. (ii)
S(n−r,1r)* is non-simple if and only if r>1 and r=n−2,n−1.*
Proof.
Recall that r≥1. We now work on ⋀rS(n−1,1). As 2∤n, it is well-known that ⋀rS(n−1,1)∣⋀rM(n−1,1). (i) thus follows as ⋀rM(n−1,1) is a permutation module. (ii) is a part of [17, Theorem 23.7].
∎
Remark 4.14**.**
Let p=2. If 2∤n, all the non-simple trivial source Specht modules labelled by hook partitions of n are clear by Lemma 4.13 and the Murphy’s result. If 2∣n, let P be a Sylow 2-subgroup of Sn. By [26, Corollary 4.4, Theorem 4.5], note that P is a vertex of S(n−r,1r) and S(n−r,1r)↓P is a P-source of S(n−r,1r). In particular, only the trivial module is a trivial source Specht module in the case.
It is trivial to see that S(1) is a trivial source module. Theorem A is now proved by combining Theorem 2.6, Proposition 4.11 and Remarks 4.12, 4.14.
5. The Specht modules labelled by two-part partitions
The proof of Theorem B will be presented in this section. To finish the proof, we first work on Specht modules labelled by partitions with at most two columns and then translate the obtained results to the Specht modules labelled by two-part partitions by Lemma 2.7 (iii).
Let λ=(λ1,…,λℓ)⊢n, s∈N and s≤ℓ. For our purpose, define λs to be the partition obtained from λ by deleting the first s rows of λ. Namely, we have λs=(λs+1,…,λℓ)⊢n−∑i=1sλi if s<ℓ and get ∅ if s=ℓ. For any non-negative integer m, write ℓp(m) to denote the smallest non-negative integer a such that m<pa. We need some preliminary results.
Lemma 5.1**.**
Let λ=(λ1,…,λℓ)⊢n. We have
(i)
[17, Theorem 24.4]** HomFSn(F,Sλ)=0 if and only if λi≡−1(modpℓp(λi+1)) for all 1≤i<ℓ.
2. (ii)
[17, Corollary 13.17]** HomFSn(F,Sλ)=0 implies that λ=(n) if p>2.
Let λ⊢n. We will call λ a James partition if
HomFSn(F,Sλ)=0.
Lemma 5.2**.**
Let p>2 and λ be a James partition of n. Then Sλ is a trivial source module if and only if λ=(n).
Proof.
One direction is clear. For the other direction, let P be a vertex of Sλ and suppose that λ=(n). As Sλ is a trivial source module, we have Sλ∣FP↑Sn. Note that Lemma 5.1 (ii) implies that Sλ≅ScSn(P). However, since λ is a James partition, we come to a contradiction as we get two trivial submodules for the transitive permutation module FP↑Sn. So λ has to be (n) if Sλ is a trivial source module. The lemma is shown.
∎
Let a and b be non-negative integers such that b<p−1 and n=a(p−1)+b. If p>2, it is well-known that S((a+1)b,ap−1−b) has the simple head sgn (see [17, Example 24.5 (iii)]). We now prove a result which may have its own interest.
Proposition 5.3**.**
Let p>2 and n=a(p−1)+b where a and b are non-negative integers such that b<p−1. Then S((a+1)b,ap−1−b) is a trivial source module if and only if n<p.
Proof.
One direction is trivial. To prove the other direction, write ϵ to denote ((a+1)b,ap−1−b). If Sϵ is a trivial source module, note that Sϵ′ is also a trivial source module by Lemma 2.7 (ii). Moreover, Sϵ′ has a trivial quotient module as Sϵ has the simple head sgn. Let P be a vertex of Sϵ′. The two facts imply that Sϵ′∣FP↑Sn and Sϵ′≅ScSn(P). Therefore, Sϵ′ has a trivial submodule by the definition of ScSn(P). Using Lemma 5.1 (ii), we deduce that ϵ=(1n) and n<p.
∎
For any m∈N, define νp(m) to be the largest non-negative integer a such that pa∣m. In particular, νp(m)≥0. By convention, put νp(0)=∞. The following theorem is known as the Carter criterion. One may refer to [20, Theorem 7.3.23] for a proof.
Theorem 5.4**.**
[20, Carter criterion]**
Let λ be a p-restricted partition of n. Then Sλ is simple if and only if νp(ha,bλ)=νp(ha,cλ) for any two nodes (a,b) and (a,c) of λ.
To finish the preparation, we need a result found by Hemmer in [15].
Theorem 5.5**.**
[15, Theorem 4.5]**
Let λ=(λ1,…,λℓ)⊢n and λ1<p. Then Fλ1(Sλ)≅Sλ1.
We now begin to finish the proof of Theorem B. Until the end of the section, fix p>2 and an integer r satisfying 0≤2r≤n. Note that the partition (2r,1n−2r) is a p-restricted partition of n. The proof of Theorem B will be based on a sequence of lemmas.
Lemma 5.6**.**
Let λ=(2r,1n−2r)⊢n and λ∈/JM(n)p. Let a be the largest positive integer such that the nodes (a,1), (a,2) are in λ and νp(ha,1λ)=νp(ha,2λ). Then there exist non-negative integers u, v and w such that 0≤u,v<p and ha,2λ=u+vpw.
Proof.
Note that ha,2λ>0 and let ha,2λ have p-adic sum ∑i≥0bipi where 0≤bi<p for all i≥0. If ha,2λ=b0, we may assign u=b0 and v=w=0. If b0<ha,2λ, let s be the smallest subscript such that s>0 and bs>0. We claim that ∑i>sbipi=0. Suppose that ∑i>sbipi>0. Set t=a+∑i>sbipi and note that the nodes (t,1), (t,2) are in λ. Moreover, we have ht,1λ=ha,1λ−∑i>sbipi and ht,2λ=b0+bsps. If b0=0, νp(ha,2λ)=νp(ht,2λ)=0. However, as νp(ha,1λ)=νp(ha,2λ), observe that both νp(ha,1λ) and νp(ht,1λ) are non-zero. So νp(ht,1λ)=νp(ht,2λ). It contradicts with the choice of a as t>a. If b0=0, νp(ha,2λ)=νp(ht,2λ)=s. By the choice of a, we conclude that νp(ht,1λ)=s. It implies that νp(ha,1λ)=s. We thus get νp(ha,1λ)=νp(ha,2λ)=s, which also contradicts with the choice of a. Therefore, the claim is shown. We can set u=b0, v=bs and w=s by the claim. The lemma follows.
∎
Lemma 5.7**.**
Let λ=(2r,1n−2r)⊢n and λ∈/JM(n)p. If h1,2λ≥p, νp(h1,1λ)=νp(h1,2λ) and νp(ha,1λ)=νp(ha,2λ) for all nodes (a,1), (a,2) of λ such that a>1, then νp(h1,1λ), νp(h1,2λ)>0.
Proof.
By the hypotheses and Lemma 5.6, let h1,1λ and h1,2λ have p-adic sums ∑i≥0aipi and b0+bsps respectively, where 0≤ai,b0,bs<p for all i≥0 and bs,s>0. Suppose that either νp(h1,1λ) or νp(h1,2λ) is zero. Without loss of generality, we may assume that νp(h1,1λ)=0. So we have a0=0 while b0=0. Note that h1,1λ>a0 otherwise λ∈JM(n)p as λ is a p-core. Let u=a0+1 and observe that the nodes (u,1) and (u,2) are in λ. Moreover, hu,1λ=∑i>0aipi and hu,2λ=bsps−a0. In particular, from the hypotheses, we have νp(hu,1λ)=νp(hu,2λ). But it is clear to see that νp(hu,1λ)≥1 and νp(hu,2λ)=0. It shows that νp(hu,1λ)=νp(hu,2λ), which is a contradiction. One may write a similar proof to get a contradiction for the case νp(h1,2λ)=0. Therefore, we conclude that νp(h1,1λ), νp(h1,2λ)>0. The proof is now finished.
∎
Lemma 5.8**.**
Let λ=(2r,1n−2r)⊢n and λ∈/JM(n)p. If νp(h1,1λ)=νp(h1,2λ) and νp(ha,1λ)=νp(ha,2λ) for all nodes (a,1), (a,2) of λ such that a>1, then Sλ is not a trivial source module.
Proof.
By the hypotheses and Lemmas 5.6, 5.7, if h1,2λ≥p, let h1,1λ and h1,2λ have p-adic sums ∑i>0aipi and bsps respectively, where 0≤ai,bs<p for all i>0 and bs,s>0. Let t be the smallest subscript such that t>0 and at>0. Note that νp(h1,1λ)=t=s=νp(h1,2λ) by computation and the hypotheses. We claim that s<t. Suppose that s>t. Let u=1+atpt and note that the nodes (u,1), (u,2) are in λ. Moreover, hu,1λ=∑i≥t+1aipi and hu,2λ=bsps−atpt. In particular, from the hypotheses, νp(hu,1λ)=νp(hu,2λ). However, we also get that νp(hu,1λ)=νp(∑i≥t+1aipi)≥t+1 but
νp(hu,2λ)=νp(pt(bsps−t−at))=t.
The calculation implies that νp(hu,1λ)=νp(hu,2λ), which is a contradiction. The claim is now shown.
Suppose that Sλ is a trivial source module. Notice that λ′=(h1,1λ−1,h1,2λ). By Lemma 2.7 (iii), we know that Sλ′ is a trivial source module. If h1,2λ<p, νp(h1,1λ)>0 as νp(h1,1λ)=νp(h1,2λ)=0. Note that λ′ is a James partition by Lemma 5.1 (i). Due to Lemma 5.2 , we get h1,2λ=0. It is a contradiction since λ∈/JM(n)p. If h1,2λ≥p, by the claim and Lemmas 5.7, 5.1 (i), we observe that λ′ is also a James partition as s<t. Therefore, by Lemma 5.2, we get λ′=(n). It also contradicts with the condition that λ∈/JM(n)p. Hence Sλ is not a trivial source module. The proof is now complete.
∎
Lemma 5.9**.**
Let λ=(2r,1n−2r)⊢n and λ∈/JM(n)p. Then Sλ is not a trivial source module.
Proof.
According to the assumption that λ∈/JM(n)p and Theorem 5.4, there exists a pair of nodes (a,1), (a,2) of λ such that νp(ha,1λ)=νp(ha,2λ) and νp(hb,1λ)=νp(hb,2λ) for all nodes (b,1), (b,2) of λ such that b>a.
When a=1, the desired result follows by Lemma 5.8. When a>1, put u=a−1 and v=2a−2. By Theorem 5.5 and Corollary 3.5, Sλ is a trivial source FSn-module only if Sλu is a trivial source FSn−v-module. Note that λu satisfies all the hypotheses of Lemma 5.8. Therefore, we deduce that Sλu is not a trivial source module, which shows that Sλ is not a trivial source module. The proof is now complete.
∎
Corollary 5.10**.**
Let λ=(2r,1n−2r)⊢n. Then Sλ is a trivial source module if and only if λ∈JM(n)p.
Proof.
One direction is clear by Theorem 2.6 while Lemma 5.9 implies the other direction. The corollary follows.
∎
We close the section by presenting the proof of Theorem B.
One direction is from Theorem 2.6. Note that Sλ is simple if and only if Sλ′ is simple. Therefore, the other direction can be justified by using Lemma 2.7 (iii) and Corollary 5.10. We are done.
∎
The section provides the proof of Theorem C. Theorem C will be deduced from Theorem 6.1 after a necessary preparation. Unlike the former sections, our main tool used here is the Broué correspondence of trivial source FSn-modules.
We state a stronger result than the conjecture of Hudson as follows and prove it after a preparation. The result implies her conjecture obviously.
Theorem 6.1**.**
Let p=2, n≥4 and λ⊢n with 2-weight 2. If Sλ is an indecomposable, non-simple, trivial source module, then Sλ≅Yμ where μ=κ2(λ)+(22).
We list some lemmas to finish the preparation.
Lemma 6.2**.**
Let G, H be finite groups and M, N be an FG-module and an FH-module respectively. If both M and N are self-dual, then M⊠N is also self-dual as an F[G×H]-module.
Proof.
Let BM={m1,…,ms} be a basis of M and BN={n1,…,nt} be a basis of N. For any ϕ∈M∗, ψ∈N∗ and v=∑i=1s∑j=1tki,jmi⊠nj∈M⊠N, view ϕ⊠ψ∈(M⊠N)∗ by setting (ϕ⊠ψ)(v)=∑i=1s∑j=1tki,jϕ(mi)ψ(nj). Note that M∗⊠N∗=(M⊠N)∗ under the viewpoint. So we only need to show that M⊠N≅M∗⊠N∗ as F[G×H]-modules. It is clear since M≅M∗ and N≅N∗. ∎
Lemma 6.3**.**
Let G be a finite group and M be an indecomposable FG-module with a vertex P. If NG(P)≤H≤G, then M is self-dual if and only if GH(M) is self-dual.
Proof.
By properties of GH(M), we have
[TABLE]
where, for any indecomposable direct summand W of the FH-module U or the FG-module V, P is not a vertex of W. When M≅M∗, by (6.1), we get
[TABLE]
Note that ∗ preserves vertices of indecomposable modules. We thus deduce that GH(M)≅GH(M)∗ by (6.2) and the Krull-Schmidt Theorem. If GH(M)≅GH(M)∗, by (6.1) again, we obtain
[TABLE]
By (6.3) and the Krull-Schmidt Theorem, we have M≅M∗. The lemma follows.
∎
Lemma 6.4**.**
Let p=2 and λ be a 2-regular or 2-restricted partition of n. If Sλ is self-dual, then Sλ is simple.
Proof.
Suppose that Sλ is not simple. When λ is 2-regular, Sλ has a simple head Dλ. As Sλ is self-dual, it forces that Sλ has at least two composition factors isomorphic to Dλ. It is an obvious contradiction. When λ is 2-restricted, note that Sλ≅Sλ′ as Sλ is self-dual. We also get a contradiction similarly. The lemma follows.
∎
The following lemma is a straightforward fact on symmetric groups.
Lemma 6.5**.**
Let H≤Sn and r be an integer such that 0<r≤n. Let H act on n. If H fixes n−r+1,…,n, then
[TABLE]
Moreover, NSn(H)/H≅(NSn−r(H)/H)×Sr.
Lemma 6.6**.**
[28, Corollary 2]**
Let P be a Sylow 2-subgroup of Sn. Then we have NSn(P)=P.
We now deal with Theorem 6.1. From now on, write C4, C2×C2 and K4 to denote the subgroups ⟨(1,2,3,4)⟩, ⟨(1,2),(3,4)⟩ and ⟨(1,2)(3,4),(1,3)(2,4)⟩ of S4 respectively. Note that they are exactly all 2-subgroups of S4 of order 4 up to S4-conjugation.
Lemma 6.7**.**
Let p=2 and M be an indecomposable FSn-module. Let λ be a 2-core and w be the 2-weight of Bλ. If Bλ contains M and M is a trivial source module whose vertices are defect groups of Bλ, then M≅Yα≅Sα, where α=λ+(2w)∈JM(n)2.
Proof.
Let P be a Sylow 2-subgroup of S2w. Note that P is also a vertex of M. By Lemmas 6.5 and 6.6, we know that NSn(P)=NS2w(P)×Sn−2w=P×Sn−2w. Moreover, NSn(P)/P≅Sn−2w. Since M is an indecomposable module with a vertex P and a trivial P-source, by Theorem 2.3 (i), we get that M(P) is an indecomposable projective FSn−2w-module. In particular, M(P)≅Yμ as FSn−2w-modules, where μ is a 2-restricted partition of n−2w. Let ν=μ+(2w). By Theorem 2.4, note that Yν is an indecomposable FSn-module with a vertex P and a trivial P-source. By the Sylow Theorem, we can require that P is a Sylow 2-subgroup of SOν. According to Theorem 2.5 and Lemma 6.6, Sn−2w≅NSn(P)/NSOν(P)=NSn(P)/P and Yν(P)≅Yμ. We thus obtain that M≅Yν by Theorem 2.3 (i). It forces that α=ν as Bλ contains M. Note that there does not exist β⊢n such that κ2(β)=λ and β⊳α. So Yα≅Sα by [6, 2.6]. Moreover, Sα is simple by Lemma 6.4.
∎
Lemma 6.8**.**
Let p=2, n≥4 and M be an indecomposable FSn-module. Let λ be a 2-core and Bλ have 2-weight 2. If M is a trivial source module with a vertex C2×C2 and Bλ contains M, then M≅Yα, where α=λ+(22).
Proof.
Notice that M is isomorphic to a Young module since M∣M(22,1n−4). As C2×C2 is a vertex of M, by Theorem 2.4, there exists a 2-restricted partition of n−4, say μ, such that M≅Yν, where ν=μ+(22). Since Bλ contains M and Bλ has 2-weight 2, we get that α=ν. The lemma is shown.
∎
Lemma 6.9**.**
Let p=2. Then FK4↑S4≅2D(3,1)⊕ScS4(K4). In particular, all the indecomposable direct summands of the decomposition of FK4↑S4 are self-dual.
Proof.
Note that NS4(K4)/K4≅S3. By an easy calculation,
FK4↑S4(K4)≅FS3 as FS3-modules. It is well-known that FS3≅Y(13)⊕2Y(2,1) and D(3,1)∣FK4↑S4. As both D(3,1) and ScS4(K4) have the vertex K4, by Lemma 2.2 (i), Theorem 2.3 (i), (iii) and counting dimensions, D(3,1)(K4)≅Y(2,1) and (ScS4(K4))(K4)≅Y(13). The desired isomorphic formula follows by Theorem 2.3 (iii). The second assertion is clear by the isomorphic formula.
∎
Proposition 6.10**.**
Let p=2, n≥4 and H=NSn(K4). Let M be an indecomposable FSn-module with a vertex K4. If M is a trivial source module, then, for some 2-restricted partition λ of n−4, we have GH(M)≅D(3,1)⊠Yλ or ScS4(K4)⊠Yλ. In particular, M is self-dual.
Proof.
By Lemma 6.5, we have H=NS4(K4)×Sn−4=S4×Sn−4. Moreover, H/K4≅S(3,n−4). By Theorem 2.3 (i), note that M(K4)≅Y(2,1)⊠Yλ or Y(13)⊠Yλ as FS(3,n−4)-modules, where λ is a 2-restricted partition of n−4. Furthermore, from [22, Propositions 1.1, 1.2], we know that D(3,1)⊠Yλ and ScS4(K4)⊠Yλ are indecomposable FS(4,n−4)-modules with a vertex K4 and a trivial K4-source. By Lemma 2.2 (ii), we also have
[TABLE]
as FS(3,n−4)-modules. Note that NS(4,n−4)(K4)=S4×Sn−4=H. Therefore, (6.4) and (6.5) are isomorphic formulae for F[H/K4]-modules. From Theorem 2.3 (ii), we get GH(M)≅GH(D(3,1)⊠Yλ) or GH(ScS4(K4)⊠Yλ). However, observe that GH(D(3,1)⊠Yλ)=D(3,1)⊠Yλ and GH(ScS4(K4)⊠Yλ)=ScS4(K4)⊠Yλ. The first assertion thus follows. The second one is clear by Lemmas 6.9, 6.2 and 6.3.
∎
Let P be a vertex of Sλ. We may choose P to be a 2-subgroup of S4. According to the hypotheses and [30, Theorem 1], the order of P is at least 4 and P is not cyclic. The cases where P is a Sylow 2-subgroup of S4 or a 2-subgroup conjugated to C2×C2 are done by Lemmas 6.7 and 6.8.
To prove Theorem 6.1, it suffices to show that P=K4. Suppose that P=K4. By Proposition 6.10, notice that Sλ is self-dual. It implies that λ is neither 2-regular nor 2-restricted by Lemma 6.4. As λ has 2-weight 2, when n>4, it forces that λ=(s+2,s−1,s−2,…,2,13) for some positive integer s. From the fact and [10, Theorem A], we get that P contains C2×C2 up to Sn-conjugation, which is a contradiction. When n=4, we have λ=(22). It is well-known that S(22)≅D(3,1), which contradicts the assumption that Sλ is non-simple. So P=K4. The proof is now complete.
∎
Theorem C is now shown by Theorems 2.6 and 6.1. We end the paper with a corollary which may have its own interest.
Corollary 6.11**.**
Let p=2, n≥4 and λ⊢n with 2-weight 2. Then Sλ is an indecomposable FSn-module with a vertex K4 and a trivial K4-source if and only if n=4 and λ=(22).
Proof.
One direction is clear. For the other direction, notice that K4 can not be Sn-conjugate to the Sylow 2-subgroups of the Young subgroups of Sn. By Theorems 2.4 and C, we thus deduce that λ∈JM(n)2. Due to [19, Main Theorem], it is sufficient to show that λ is neither 2-regular nor 2-restricted. It is well-known that Sλ≅Yλ if λ∈JM(n)2 and λ is 2-regular. Similarly, Sλ≅Yλ′ if λ∈JM(n)2 and λ is 2-restricted. Therefore, as Sλ has a vertex K4, λ is neither 2-regular nor 2-restricted. The desired result thus follows.
∎
Acknowledgments
The author thanks his supervisor Dr. Kay Jin Lim for some suggestions of refining this paper. He also gratefully thanks Professor David Hemmer for letting him know the question of classification of trivial source Specht modules via a private communication in the conference ‘Representation Theory of Symmetric Groups and Related Algebras’ held in Singapore. Finally, he gratefully thanks an anonymous referee for his or her careful reading and helpful suggestions.
Bibliography30
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. L. Alperin, Local Representation Theory, Cambridge Studies in Advanced Mathematics, 𝟏𝟏 11 \mathbf{11} , Cambridge University Press, 1986.
2[2] M. Broué, On Scott modules and p-permutation modules: an approach through the Brauer morphism, Proc. Amer. Math. Soc. 𝟗𝟑 93 \mathbf{93} (1985), 401-408.
3[3] D. W. Burry, Scott modules and lower defect groups, Comm. Algebra 𝟏𝟎 10 \mathbf{10} (1982), 1855-1872.
4[4] S. Danz, B. Külshammer, R. Zimmermann, On vertices of simple modules for symmetric groups of small degrees, J. Algebra 𝟑𝟐𝟎 320 \mathbf{320} (2008), 680-707.
5[5] S. Danz, K. J. Lim, Signed Young modules and simple Specht modules, Adv. Math. 𝟑𝟎𝟕 307 \mathbf{307} (2017), 369-416.
6[6] S. Donkin, On Schur algebras and related algebras, II. J. Algebra 𝟏𝟏𝟏 111 \mathbf{111} (1987), 354-364.
7[7] S. Donkin, H. Geranios, Invariants of Specht modules, J. Algebra 𝟒𝟑𝟗 439 \mathbf{439} (2015), 188-224.
8[8] K. Erdmann, Young modules for symmetric groups, J. Aust. Math. Soc. 𝟕𝟏 71 \mathbf{71} (2001), 201-210.