OctoInform Beta

OpenAI preprint, September 2026 · §2. Specht modules and horizontal strips · §2

Lemma 2.2 [Pieri rule]: The map is equivariant for the permutations keeping the positions of ν\nu among themselves, and the strip contraction pairs the two polytabloids nontrivially

A horizontal strip λ/ν\lambda/\nu maps SλS^\lambda onto SνS^\nu..

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let ν⊆λ\nu \subseteq \lambda be Young diagrams with aa and nn cells, and let SnS_n permute nn positions, aa of which carry the cells of ν\nu and the other n−an - a the cells of λ/ν\lambda/\nu. The permutations that keep the positions of ν\nu among themselves form a subgroup Sa×Sn−aS_a \times S_{n-a}. The question is when Sν⊠𝟏S^\nu \boxtimes \mathbf{1}, the Specht module of ν\nu with Sn−aS_{n-a} acting trivially, is a quotient of the restriction of SλS^\lambda to this subgroup, the question the Pieri rule answers. For ν=(2)\nu = (2) and n=4n = 4 it asks for which λ\lambda the trivial representation of S2×S2S_2 \times S_2 is a quotient of SλS^\lambda.

In the library the two Specht modules are spans of polytabloids in spaces of words, and a pair of tableaux places the positions of ν\nu among those of λ\lambda.

Words, Tableaux and Specht Modules

Positions are 0,…,n−10, \dots, n-1 and letters 0,…,d−10, \dots, d-1. A word of length nn over dd letters is a map ww from the positions to the letters, and the space of words Wn,dW_{n,d} is the complex vector space of functions from words to ℂ\mathbb{C}, which is E⊗nE^{\otimes n} for E=ℂdE = \mathbb{C}^d, with ewe_w the basis vector of the word ww.✦ The permutation action on words is the action of SnS_n on Wn,dW_{n,d} given by (gf)(w)=f(w∘g),gew=ew∘g−1.(g f)(w) = f(w \circ g), \qquad g\, e_w = e_{w \circ g^{-1}}.(1)✦

A Young tableau tt of shape λ\lambda on nn positions is a bijection from the positions 0,…,n−10, \dots, n-1 to the cells of the Young diagram λ\lambda, the cell (i,j)(i, j) lying in row ii and column jj, both counted from 00.✦ For a tableau tt of shape λ\lambda on nn positions, the row word wtw_t is the word that sends each position ii to the row of the cell t(i)t(i), a letter among 0,…,ℓ(λ)−10, \dots, \ell(\lambda) - 1, where ℓ(λ)\ell(\lambda) is the number of rows of λ\lambda.✦ The column stabilizer CtC_t of a tableau tt on nn positions is the set of permutations g∈Sng \in S_n such that t(g(i))t(g(i)) lies in the same column as t(i)t(i) for every position ii.✦

The polytabloid of a tableau tt of shape λ\lambda on nn positions is the vector et=∑σ∈Ctsgn⁡(σ)σewt∈Wn,ℓ(λ),e_t = \sum_{\sigma \in C_t} \operatorname{sgn}(\sigma)\, \sigma\, e_{w_t} \in W_{n, \ell(\lambda)},(2)✦ where ewte_{w_t} stands for the tabloid {t}\{t\}. The cyclic subrepresentation ℂ[G]v\mathbb{C}[G]v of a vector vv of a complex representation of a group GG is the span of the translates gvg v, g∈Gg \in G.✦ The Specht module SλS^\lambda of a tableau tt of shape λ\lambda on nn positions is the cyclic subrepresentation ℂ[Sn]et\mathbb{C}[S_n]\, e_t of Wn,ℓ(λ)W_{n, \ell(\lambda)}, on which SnS_n acts by restricting (1).✦

Horizontal Strips and the Strip Contraction

For Young diagrams ν\nu and λ\lambda, the skew shape λ/ν\lambda/\nu is a horizontal strip when ν⊆λ\nu \subseteq \lambda and no two cells of λ\lambda outside ν\nu lie in the same column.✦

For ν⊆λ\nu \subseteq \lambda, a tableau ss of shape ν\nu on aa positions and a tableau tt of shape λ\lambda on nn positions, the inclusion of positions of ss into tt is the map ι\iota from the positions 0,…,a−10, \dots, a-1 to the positions 0,…,n−10, \dots, n-1 that sends kk to the position of tt carrying the cell s(k)s(k): ι(k)=t−1(s(k)).\iota(k) = t^{-1}(s(k)).(3)✦ The inclusion of row letters of ν⊆λ\nu \subseteq \lambda is the map from the letters 0,…,ℓ(ν)−10, \dots, \ell(\nu) - 1 to the letters 0,…,ℓ(λ)−10, \dots, \ell(\lambda) - 1 that sends each letter to itself.✦

For an injection ii of aa positions into nn positions and an injection jj of dd letters into ee letters, the word restriction Ri,j:Wn,e→Wa,dR_{i,j}\colon W_{n,e} \to W_{a,d} is the linear map (Ri,jf)(b)=∑c∘i=j∘bf(c),(R_{i,j} f)(b) = \sum_{c \circ i = j \circ b} f(c),(4)✦ bb a word of length aa over dd letters and cc running over the words of length nn over ee letters. The strip contraction R:Wn,ℓ(λ)→Wa,ℓ(ν)R\colon W_{n,\ell(\lambda)} \to W_{a,\ell(\nu)} is the word restriction along ι\iota and the inclusion of row letters; it contracts with the all-ones functional at each position of tt that carries a cell of λ/ν\lambda/\nu. The standard bilinear form on Wa,dW_{a,d} is ⟨x,y⟩=∑bx(b)y(b)\langle x, y \rangle = \sum_b x(b)\, y(b), the sum running over the words bb of length aa over dd letters.

The Claim

Theorem 1. Let ν\nu and λ\lambda be Young diagrams such that λ/ν\lambda/\nu is a horizontal strip, let ss be a tableau of shape ν\nu on aa positions and tt a tableau of shape λ\lambda on nn positions, with Specht modules SνS^\nu and SλS^\lambda, and let ι\iota be the inclusion of positions of ss into tt and RR the strip contraction. Then, with gg running over SnS_n and hh over SaS_a, there is a linear map F:Sλ→SνF\colon S^\lambda \to S^\nu with F≠0,F(gx)=hF(x)(x∈Sλ,g∘ι=ι∘h),F \neq 0, \qquad F(g\, x) = h\, F(x) \quad (x \in S^\lambda,\ g \circ \iota = \iota \circ h),(5)✦ there is a linear map F′:Sλ→SνF'\colon S^\lambda \to S^\nu with F′(Sλ)=Sν,F′(gx)=hF′(x)(x∈Sλ,g∘ι=ι∘h),F'(S^\lambda) = S^\nu, \qquad F'(g\, x) = h\, F'(x) \quad (x \in S^\lambda,\ g \circ \iota = \iota \circ h),(6)✦ and the polytabloids of tt and ss satisfy ⟨Ret,es⟩≠0.\langle R\, e_t,\ e_s \rangle \neq 0.(7)✦

In the paper, the result reads: for ν⊢a\nu \vdash a and b≥0b \ge 0, Ind⁡Sa×SbSa+b(Sν⊠𝟏)≅⨁λSλ\operatorname{Ind}_{S_a \times S_b}^{S_{a+b}}(S^\nu \boxtimes \mathbf{1}) \cong \bigoplus_\lambda S^\lambda, the sum over the partitions λ⊢a+b\lambda \vdash a + b with λ⊇ν\lambda \supseteq \nu and λ/ν\lambda/\nu a horizontal strip, every summand occurring once.

The pairs (g,h)(g, h) in (6) run over the permutations gg in the subgroup Sa×Sn−aS_a \times S_{n-a} that keeps ι(0),…,ι(a−1)\iota(0), \dots, \iota(a-1) among themselves, each with its restriction hh, so Sν⊠𝟏S^\nu \boxtimes \mathbf{1} is a quotient of the restriction of SλS^\lambda and, by Frobenius reciprocity, SλS^\lambda occurs in the paper’s induced module with b=n−ab = n - a.

What Is Checked

The claims (5), (6) and (7) are stated over Young diagrams ν\nu and λ\lambda with λ/ν\lambda/\nu a horizontal strip, tableaux ss and tt of these shapes with the inclusion of positions ι\iota, the Specht modules SνS^\nu and SλS^\lambda spanned by polytabloids in spaces of words under the permutation action, and the strip contraction RR with the standard bilinear form.

The library shows that the permutation action on words is a representation of SnS_n and that ℂ[G]v\mathbb{C}[G]v is invariant under GG. It shows as well that the column stabilizer CtC_t is a subgroup of SnS_n and that the inclusion of positions ι\iota is injective. It shows too that the inclusion of row letters is injective.