OctoInform Beta

OpenAI preprint, September 2026 · §1. Introduction · §1

§1 (setting): Specht modules, Kronecker coefficients and the staircase: Polytabloid translates span the Specht module, a Kronecker coefficient is positive exactly when a nonzero intertwiner exists, and the staircase ρm\rho_m has m(m+1)/2m(m+1)/2 cells

Specht modules in tensor space and Kronecker coefficients.

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

Saxl’s conjecture asserts that when nn is the size of a staircase partition, every irreducible representation of the symmetric group SnS_n occurs in the tensor square of the Specht module of that partition. Its terms are Specht modules, Kronecker coefficients and staircases, and in the library the Specht modules live inside the tensor powers of ℂd\mathbb{C}^d, where dd is the number of letters.

Words, Tableaux and Polytabloids

Fix nn positions 0,1,…,n−10, 1, \dots, n-1 and dd letters 0,1,…,d−10, 1, \dots, d-1, and let SnS_n be the group of permutations of the positions. A word is a map ww from the positions to the letters. The word space Wn,dW_{n,d} is the complex vector space of functions on words; a function ff is the coefficient function of the tensor ∑wf(w)ew\sum_w f(w)\, e_w of E⊗nE^{\otimes n}, E=ℂdE = \mathbb{C}^d, where ew=ew(0)+1⊗⋯⊗ew(n−1)+1e_w = e_{w(0)+1} \otimes \cdots \otimes e_{w(n-1)+1} for the standard basis e1,…,ede_1, \dots, e_d of EE. The group SnS_n acts on Wn,dW_{n,d} by permuting the tensor factors: (σf)(w)=f(w∘σ),σew=ew∘σ−1.(\sigma f)(w) = f(w \circ \sigma), \qquad \sigma\, e_w = e_{w \circ \sigma^{-1}}.(1)✦

For a representation of a group GG on a complex vector space VV and a vector v∈Vv \in V, the cyclic submodule ℂ[G]v\mathbb{C}[G]v is the subrepresentation of VV spanned by the translates hvhv, h∈Gh \in G.✦

The cells of a Young diagram μ\mu are pairs (i,j)(i, j), row ii and column jj, counted from 00; |μ||\mu| is the number of cells of μ\mu and ℓ(μ)\ell(\mu) its number of rows. A tableau tt of shape μ\mu on nn positions is a bijection from the positions to the cells of μ\mu, position kk sitting in cell t(k)t(k).✦ The row word wtw_t of tt is the word with letters 0,…,ℓ(μ)−10, \dots, \ell(\mu)-1 that sends each position kk to the row of t(k)t(k).✦ The column stabilizer CtC_t of tt is the subgroup of SnS_n of the permutations σ\sigma such that t(σ(k))t(\sigma(k)) lies in the column of t(k)t(k) for every position kk.✦ The polytabloid ete_t 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}.(2)✦

The Claim

Definition 1. Let tt be a tableau of shape μ\mu on nn positions. The Specht module StS^t of tt is the cyclic submodule of Wn,ℓ(μ)W_{n,\ell(\mu)} generated by its polytabloid, St=ℂ[Sn]et,S^t = \mathbb{C}[S_n]\, e_t,(3) a representation of SnS_n under the action (1); tableaux of the same shape give the same Specht module, written SμS^\mu. For a Young diagram μ\mu with |μ|=n|\mu| = n, the canonical tableau of μ\mu is a fixed tableau of shape μ\mu on nn positions, tμ:{0,…,n−1}→∼μ(|μ|=n).t_\mu \colon \{0, \dots, n-1\} \xrightarrow{\ \sim\ } \mu \qquad (|\mu| = n).(4)✦ For Young diagrams α\alpha, β\beta, λ\lambda and tableaux of these shapes on the same nn positions, the Kronecker coefficient is the dimension of the space of intertwiners g(α,β,λ)=dim⁡ℂHom⁡Sn(Sλ,Sα⊗Sβ),g(\alpha, \beta, \lambda) = \dim_{\mathbb{C}} \operatorname{Hom}_{S_n}\bigl(S^\lambda,\, S^\alpha \otimes S^\beta\bigr),(5)✦ where SnS_n acts on Sα⊗SβS^\alpha \otimes S^\beta diagonally, σ(x⊗y)=σx⊗σy\sigma(x \otimes y) = \sigma x \otimes \sigma y. Its positivity is the existence of a nonzero intertwiner: g(α,β,λ)>0⇔Hom⁡Sn(Sλ,Sα⊗Sβ)≠0.g(\alpha, \beta, \lambda) > 0 \iff \operatorname{Hom}_{S_n}\bigl(S^\lambda,\, S^\alpha \otimes S^\beta\bigr) \neq 0.(6)✦ For a natural number mm, the staircase ρm\rho_m is the Young diagram of the cells (i,j)(i, j) with i+j<mi + j < m✦, and its size is |ρm|=m(m+1)2.|\rho_m| = \frac{m(m+1)}{2}.(7)✦

In the paper, the result reads: for a partition α⊢n\alpha \vdash n, SαS^\alpha is the irreducible complex representation of SnS_n, g(α,β,λ)=dim⁡Hom⁡Sn(Sλ,Sα⊗Sβ)g(\alpha, \beta, \lambda) = \dim \operatorname{Hom}_{S_n}(S^\lambda, S^\alpha \otimes S^\beta) with SnS_n acting diagonally, Nm=m(m+1)/2N_m = m(m+1)/2 and ρm=(m,m−1,…,1)\rho_m = (m, m-1, \dots, 1).

What Is Checked

The definition is stated over the word space Wn,dW_{n,d} with the action (1), over Young diagrams and their tableaux, and over the cyclic submodule ℂ[G]v\mathbb{C}[G]v, the row word wtw_t, the column stabilizer CtC_t and the polytabloid (2).

Of these constructions the library proves that (1) is a representation of SnS_n and that CtC_t is a subgroup of SnS_n; it proves as well that ℂ[G]v\mathbb{C}[G]v is stable under GG and that the cells (i,j)(i, j) with i+j<mi + j < m form a Young diagram.