OctoInform Beta

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

Lemma 2.1 [Alternating blocks as polytabloids]: The polytabloid ete_t is the alternating sum of the row word over the column stabilizer, and ℂ[Sn]et\mathbb{C}[S_n]e_t depends only on the shape

Polytabloids in a tensor power span irreducible Specht modules.

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 μ\mu be a partition of nn with ℓ\ell rows, numbered from 00, and let E=ℂℓE = \mathbb{C}^{\ell} with basis e0,…,eℓ−1e_0, \dots, e_{\ell-1}. A tabloid of shape μ\mu records only the row in which each of the positions 0,…,n−10, \dots, n-1 lies, so it is a word of length nn in the letters 0,…,ℓ−10, \dots, \ell-1 that uses the letter rr as often as row rr has cells. The permutation module MμM^\mu is thus the span in E⊗nE^{\otimes n} of the basis tensors of these words, with SnS_n permuting the tensor factors, and the Specht module SμS^\mu sits inside E⊗nE^{\otimes n}. Which tensor is then the polytabloid ete_t of a tableau tt, and is the cyclic module ℂ[Sn]et\mathbb{C}[S_n]e_t irreducible and the same for every tableau of shape μ\mu?

Words, Tableaux and Polytabloids

A word of length nn over dd letters is a map aa from the positions {0,…,n−1}\{0, \dots, n-1\} to the letters {0,…,d−1}\{0, \dots, d-1\}. The space of words is the complex vector space of functions from words to ℂ\mathbb{C}.✦ It is the tensor power E⊗nE^{\otimes n} of E=ℂdE = \mathbb{C}^d: a function ff is the tensor ∑af(a)ea\sum_a f(a)\, e_a, where ea=ea(0)⊗…⊗ea(n−1)e_a = e_{a(0)} \otimes \dots \otimes e_{a(n-1)}, so that f(a)f(a) is the coefficient of ff on the basis word eae_a. The permutation action of the symmetric group SnS_n of the positions on the space of words is the representation of SnS_n on E⊗nE^{\otimes n} given, for g∈Sng \in S_n, a function ff on words and a word aa, by (gf)(a)=f(a∘g),gea=ea∘g−1.(g f)(a) = f(a \circ g), \qquad g\, e_a = e_{a \circ g^{-1}}.(1)✦

The sign character of SnS_n is the multiplicative character sgn⁡:Sn→ℂ\operatorname{sgn} \colon S_n \to \mathbb{C} that sends each permutation to its sign ±1\pm 1.✦ For a subgroup HH of SnS_n and a word aa, the alternating sum of aa over HH is the vector of E⊗nE^{\otimes n} alt⁡H(a)=∑g∈Hsgn⁡(g)gea.\operatorname{alt}_H(a) = \sum_{g \in H} \operatorname{sgn}(g)\, g\, e_a.(2)✦

Let μ\mu be a Young diagram with nn cells (i,j)(i, j), numbered from 00 with ii the row and jj the column, and let ℓ\ell be its number of rows, the length of its first column. A Young tableau tt of shape μ\mu is a bijection from the positions {0,…,n−1}\{0, \dots, n-1\} to the cells of μ\mu, t(i)t(i) being the cell of position ii.✦ The column stabilizer CtC_t of tt is the subgroup of SnS_n of the permutations that keep each position in its column, Ct={g∈Sn:t(g(i)) lies in the column of t(i) for every position i}.C_t = \{\, g \in S_n : t(g(i)) \text{ lies in the column of } t(i) \text{ for every position } i \,\}.(3)✦ The row word wtw_t of tt is the word of length nn over ℓ\ell letters that sends each position ii to the row of t(i)t(i); its basis vector ewte_{w_t} stands for the tabloid {t}\{t\}.✦ The polytabloid ete_t of tt is the vector of E⊗nE^{\otimes n}, E=ℂℓE = \mathbb{C}^{\ell}, et=∑σ∈Ctsgn⁡(σ)σewt.e_t = \sum_{\sigma \in C_t} \operatorname{sgn}(\sigma)\, \sigma\, e_{w_t}.(4)✦

The cyclic subrepresentation ℂ[G]v\mathbb{C}[G]v of a complex representation VV of a group GG generated by a vector vv of VV is the linear span of the translates gvgv, g∈Gg \in G.✦ The Specht module StμS^\mu_t of tt is the cyclic subrepresentation ℂ[Sn]et\mathbb{C}[S_n]e_t of E⊗nE^{\otimes n} generated by its polytabloid✦, and the Specht representation of tt is the representation of SnS_n on StμS^\mu_t restricted from (1).✦

The Claim

Theorem 1. Let μ\mu be a Young diagram with nn cells and ℓ\ell rows, let E=ℂℓE = \mathbb{C}^{\ell}, and let ss and tt be Young tableaux of shape μ\mu. Then et=alt⁡Ct(wt),e_t = \operatorname{alt}_{C_t}(w_t),(5)✦ et(wt)=1,e_t(w_t) = 1,(6)✦ and et≠0.e_t \neq 0.(7)✦ Moreover, Stμ is an irreducible representation of Sn,S^\mu_t \text{ is an irreducible representation of } S_n,(8)✦ and Ssμ=Stμ.S^\mu_s = S^\mu_t.(9)✦

In the paper, the result reads: if LL is a family of blocks AA, subsets of a set BB, with alternating block tensor vLv_L, and θi=#{A∈L:|A|≥i}\theta_i = \#\{A \in L : |A| \ge i\}, so that the block sizes are the column lengths of θ\theta, then ℂ[SB]vL≅Sθ\mathbb{C}[S_B]\, v_L \cong S^\theta, where SBS_B is the symmetric group of BB, and the same assertion holds for any ordered basis of a dual vector space.

The theorem takes for blocks the columns of tt, with the letter rr on row rr, so that θ=μ\theta = \mu and vLv_L is the polytabloid ete_t.

What Is Checked

The claim is stated over a Young diagram μ\mu and Young tableaux of shape μ\mu, the space of words E⊗nE^{\otimes n} with the permutation action of SnS_n, the sign character, the column stabilizer CtC_t, the row word wtw_t, the alternating sum over a subgroup, the polytabloid ete_t, the cyclic subrepresentation generated by a vector, and the Specht module StμS^\mu_t with the Specht representation on it.

The library proves that the column stabilizer CtC_t is a subgroup of SnS_n and that the permutation action on words is a representation of SnS_n. It also proves that the linear span of the translates of a vector in a representation of a group GG is stable under GG.