OctoInform Beta

OpenAI preprint, September 2026 · §3. The triangular cyclic module and dominance · §3

Theorem 3.1 [Cyclic staircase support]: For m≥1m \ge 1, the Specht module of any tableau on Nm=m(m+1)/2N_m = m(m+1)/2 positions maps nontrivially into the cyclic module WmW_m of two tensored staircase polytabloids

The staircase cyclic module contains every Specht module.

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 m≥1m \ge 1, let BmB_m be the staircase, the Young diagram with rows of lengths m,m−1,…,1m, m-1, \dots, 1, and let Nm=m(m+1)/2N_m = m(m+1)/2 be its number of cells. Saxl’s conjecture is about the tensor square of the Specht module of BmB_m as a representation of SNmS_{N_m}. The theorem concerns one vector of that tensor square: the tensor product of the polytabloids of a tableau of shape BmB_m and of its transpose.

A Specht module SS occurs in a representation VV of a symmetric group SnS_n when the space Hom⁡Sn(S,V)\operatorname{Hom}_{S_n}(S, V) of intertwiners S→VS \to V is nonzero. The question is which Specht modules of SNmS_{N_m} occur in the cyclic module WmW_m that this one vector generates.

Words, Tableaux and Specht Modules

A word on nn positions 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 (ℂd)⊗n(\mathbb{C}^d)^{\otimes n} is the complex vector space of functions from words to ℂ\mathbb{C}, the tensor power of E=ℂdE = \mathbb{C}^d with each tensor read as its coefficient function; eae_a denotes the basis vector of the word aa.✦ The permutation action of the symmetric group SnS_n of the positions on the space of words is (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)✦

For a representation ρ\rho of a group GG on a complex vector space VV and a vector vv of VV, the cyclic module ℂ[G]v\mathbb{C}[G]v is the subspace of VV spanned by the translates ρ(g)v\rho(g)v, g∈Gg \in G, with the action of GG restricted to it.✦

A Young tableau tt of shape μ\mu on nn positions is a bijection from the positions to the cells of the Young diagram μ\mu, the cell (i,j)(i, j) lying in row ii and column jj, both counted from 00.✦ The canonical tableau tμt_\mu of a Young diagram μ\mu with nn cells is a Young tableau of shape μ\mu on nn positions fixed once and for all.✦

Let tt be a Young tableau of shape μ\mu on nn positions, and ℓ(μ)\ell(\mu) the number of rows of μ\mu. 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).✦ The column stabilizer CtC_t of tt is the set of permutations gg in SnS_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 tt is the vector of (ℂℓ(μ))⊗n(\mathbb{C}^{\ell(\mu)})^{\otimes n} et=∑σ∈Ctsgn⁡(σ)σewt,e_t = \sum_{\sigma \in C_t} \operatorname{sgn}(\sigma)\, \sigma\, e_{w_t},(2)✦ and the Specht module StS^t of tt is the cyclic module ℂ[Sn]et\mathbb{C}[S_n]\, e_t of its polytabloid under the permutation action (1).✦

The Staircase Cyclic Module

In coordinates, BmB_m consists of the cells (i,j)(i, j) with i+j<mi + j < m.✦ The staircase tableau TmT_m is the canonical tableau of BmB_m, on NmN_m positions.✦ The row staircase tableau Tm′T_m' of shape BmB_m puts each position in the transpose (j,i)(j, i) of the cell (i,j)(i, j) where TmT_m puts it.✦

The merged word (a,b)(a, b) of a word aa over dd letters and a word bb over ee letters on the same positions is the word over the dede pair letters whose letter at each position ii is the pair (a(i),b(i))(a(i), b(i)).✦ The first factor w1w_1 and the second factor w2w_2 of a word ww over pair letters are the words of the first and of the second entries of its letters, so that w=(w1,w2)w = (w_1, w_2). The regrouping of two tensor layers by position is the linear map (ℂd)⊗n⊗(ℂe)⊗n→(ℂde)⊗n,x⊗y↦(w↦x(w1)y(w2)).(\mathbb{C}^d)^{\otimes n} \otimes (\mathbb{C}^e)^{\otimes n} \to (\mathbb{C}^{de})^{\otimes n}, \qquad x \otimes y \mapsto \bigl(w \mapsto x(w_1)\, y(w_2)\bigr).(3)✦

The staircase generator zmz_m is the image of eTm′⊗eTme_{T_m'} \otimes e_{T_m} under the regrouping (3), a vector of (ℂm2)⊗Nm(\mathbb{C}^{m^2})^{\otimes N_m} whose pair letters have both entries among the mm rows of BmB_m, used as letters.✦ The staircase cyclic module WmW_m is the cyclic module ℂ[SNm]zm\mathbb{C}[S_{N_m}]\, z_m of the staircase generator under the permutation action (1).✦

The Claim

Theorem 1 (Cyclic staircase support). Let m≥1m \ge 1 and let λ\lambda be a Young diagram with NmN_m cells. The Specht module of the canonical tableau tλt_\lambda has a nonzero intertwiner into the staircase cyclic module: Hom⁡SNm(Stλ,Wm)≠0.\operatorname{Hom}_{S_{N_m}}\bigl(S^{t_\lambda}, W_m\bigr) \neq 0.(4)✦ In particular, for every Young diagram μ\mu with NmN_m cells the Specht module of tμt_\mu occurs in WmW_m, which is the cyclic Saxl conjecture for BmB_m: {μ:|μ|=Nm}⊆{μ:Stμ occurs in Wm}.\{\mu : |\mu| = N_m\} \subseteq \{\mu : S^{t_\mu} \text{ occurs in } W_m\}.(5)✦ More generally, for every Young tableau tt of shape λ\lambda on NmN_m positions, the Specht module of tt has a nonzero intertwiner into WmW_m: Hom⁡SNm(St,Wm)≠0.\operatorname{Hom}_{S_{N_m}}\bigl(S^{t}, W_m\bigr) \neq 0.(6)✦

What Is Checked

The claim is stated over the Specht modules StS^t of Young tableaux on NmN_m positions, the canonical ones among them, built from row words, column stabilizers and polytabloids (2) in the space of words under the permutation action (1), and over the staircase cyclic module WmW_m, the cyclic module of the staircase generator zmz_m formed from the polytabloids of Tm′T_m' and TmT_m by the regrouping (3).

The library proves that (1) is a representation of SnS_n and that CtC_t is a subgroup of SnS_n; for any representation of a group, it proves that the span of the translates of a vector is a subrepresentation. It also proves that the cells (i,j)(i, j) with i+j<mi + j < m form a Young diagram on which the transpose (i,j)↦(j,i)(i, j) \mapsto (j, i) is a bijection equal to its own inverse, and that the regrouping (3) is a linear isomorphism.