OctoInform Beta

OpenAI preprint, September 2026 · The companion preprint: Universal Tensor Squares for Symmetric Groups · Universal Tensor Squares for Symmetric Groups, §2

Lemma 2.2 [Young support]: For τ⊵θ\tau \trianglerighteq \theta of equal size, an intertwiner from words to SτS^\tau can be chosen nonzero at any word of content θ\theta

Specht modules of dominating shapes occur in permutation 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 AA be a finite list of positive integers with sum nn, and let θ\theta be the partition of nn whose parts are the entries of AA in decreasing order. The Young subgroup SA=∏a∈ASaS_A = \prod_{a \in A} S_a of SnS_n is the stabilizer of a word of length nn whose letters occur with the multiplicities listed by AA, and the induced module Ind⁡SASn𝟏\operatorname{Ind}_{S_A}^{S_n} \mathbf{1} is the permutation module on the orbit of that word. The question is which Specht modules occur in it.

The library answers it for the Young diagrams τ\tau of size nn that dominate θ\theta, that is, whose sums of the first kk row lengths are at least those of θ\theta for every kk, and relates dominance to conjugation of diagrams.

Words and Specht Modules

A word of length nn over dd letters is a map ww from the positions {0,…,n−1}\{0, \dots, n-1\} to the letters {0,…,d−1}\{0, \dots, d-1\}. The word space Wn,dW_{n,d} is the complex vector space of functions on these words; it is the tensor power E⊗nE^{\otimes n} of E=ℂdE = \mathbb{C}^d, each tensor taken to its coefficient function, and ewe_w is the function equal to 11 at ww and 00 at every other word.✦ The permutation action on words is the representation 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)✦ An intertwiner from the permutation action on words to a representation VV of SnS_n is a linear map Wn,d→VW_{n,d} \to V that commutes with the action of SnS_n on Wn,dW_{n,d} and with its action on VV.

The rows of a Young diagram μ\mu are numbered from 00: μi\mu_i is the length of row ii, zero for i≥ℓ(μ)i \ge \ell(\mu), where ℓ(μ)\ell(\mu) is the number of rows, and |μ||\mu| is the number of cells. A word ww over ℓ(θ)\ell(\theta) letters has content θ\theta up to a permutation π\pi of the letters if #{i:w(i)=π(j)}=θj(0≤j<ℓ(θ)),\#\{\, i : w(i) = \pi(j) \,\} = \theta_j \qquad (0 \le j < \ell(\theta)),(2) and has content θ\theta when this holds with π\pi the identity. The words in the orbit of the setting have content θ\theta up to the permutation of the letters that sorts AA.

A Young tableau tt of shape μ\mu on nn positions is a bijection from the positions {0,…,n−1}\{0, \dots, n-1\} to the cells of the Young diagram μ\mu, a cell (i,j)(i, j) lying in row ii and column jj, both numbered from 00.✦ The tableau TμT_\mu of shape μ\mu is the canonical tableau of μ\mu, a Young tableau of shape μ\mu on |μ||\mu| positions fixed once and for all.✦ For a tableau tt of shape μ\mu on nn positions, the row word wtw_t of tt is the word over ℓ(μ)\ell(\mu) letters that sends each position ii to the row of the cell t(i)t(i)✦, and the column stabilizer CtC_t of tt is the subgroup of SnS_n of the permutations gg such that, for every position ii, the cell t(g(i))t(g(i)) lies in the same column as t(i)t(i).✦ The polytabloid of tt is the vector of Wn,ℓ(μ)W_{n,\ell(\mu)} et=∑σ∈Ctsgn⁡(σ)σewt.e_t = \sum_{\sigma \in C_t} \operatorname{sgn}(\sigma)\, \sigma\, e_{w_t}.(3)✦

For a representation ρ\rho of a group GG on a complex vector space VV and a vector v∈Vv \in V, the cyclic module ℂ[G]v\mathbb{C}[G]v is the subrepresentation of VV spanned by the translates ρ(g)v\rho(g)v with g∈Gg \in G.✦ The Specht module SμS^\mu of a Young tableau tt of shape μ\mu on nn positions is the cyclic module ℂ[Sn]et\mathbb{C}[S_n]e_t of its polytabloid under the permutation action on Wn,ℓ(μ)W_{n,\ell(\mu)}✦, and the Specht representation of tt is the action of SnS_n on SμS^\mu by the restriction of (1).✦

Dominance and Conjugation

For a Young diagram μ\mu and k≥0k \ge 0, the size ∑i<kμi\sum_{i < k} \mu_i of the first kk rows of μ\mu is the number of its cells in rows 0,…,k−10, \dots, k-1.✦ A Young diagram μ\mu dominates a Young diagram ν\nu of any size, written μ⊵ν\mu \trianglerighteq \nu, if ∑i<kνi≤∑i<kμifor every k≥0.\sum_{i < k} \nu_i \le \sum_{i < k} \mu_i \qquad \text{for every } k \ge 0.(4)✦ The conjugate μt\mu^t of μ\mu is the Young diagram whose cells are the (j,i)(j, i) with (i,j)(i, j) a cell of μ\mu.

The Claim

Theorem 1. Let θ\theta and τ\tau be Young diagrams with the same number of cells such that τ⊵θ\tau \trianglerighteq \theta, and write ℓ=ℓ(θ)\ell = \ell(\theta) and N=|τ|N = |\tau|.

For a Young tableau tt of shape τ\tau on nn positions and a word ww of length nn over ℓ\ell letters whose content is θ\theta up to a permutation of the letters, as in (2), there is an intertwiner FF from the permutation action on Wn,ℓW_{n,\ell} to the Specht representation of tt with F(ew)≠0.F(e_w) \neq 0.(5)✦

There are a word uu of length NN over ℓ\ell letters with content θ\theta and a nonzero linear functional φ\varphi on the Specht module SτS^\tau of TτT_\tau such that φ(gx)=φ(x)for all x∈Sτ and all g∈SN with u∘g=u.\varphi(g x) = \varphi(x) \qquad \text{for all } x \in S^\tau \text{ and all } g \in S_N \text{ with } u \circ g = u.(6)✦

The conjugate diagrams satisfy θt⊵τt.\theta^t \trianglerighteq \tau^t.(7)✦

In the paper, the result reads: for a finite list AA of positive integers with sum nn, the module Ind⁡SASn𝟏\operatorname{Ind}_{S_A}^{S_n} \mathbf{1} contains exactly the SνS^\nu whose column heights h1≥h2≥⋯h_1 \ge h_2 \ge \cdots satisfy ∑j≤khj≤PA(k)=∑a∈Amin⁡(k,a)\sum_{j \le k} h_j \le P_A(k) = \sum_{a \in A} \min(k, a) for every k≥1k \ge 1, the constituent SθS^\theta indexed by the decreasing rearrangement θ\theta of AA has multiplicity one, and a component containing every shape of size mm with at most rr rows contains the support of the induced trivial module of a balanced division of mm into rr parts.

What Is Checked

The claim is stated over Young diagrams with the dominance order (4) and conjugation, over words with the permutation action (1) on the word space, and over the Specht module of a Young tableau, built from its row word, its column stabilizer and its polytabloid (3), with the canonical tableau TτT_\tau in (6).

The library proves that (1) is a representation of SnS_n and that the column stabilizer CtC_t is a subgroup of SnS_n. It proves as well that the span of the translates of a vector is stable under the group, which makes the Specht module of every tableau a subrepresentation of the action on words.