OctoInform Beta

OpenAI preprint, September 2026 · §6. Completion of the induction · §6

§6 (proof of Theorem 1.1): If for every m≥1m \ge 1 each SμS^\mu occurs in the cyclic module ℂ[SNm]zm\mathbb{C}[S_{N_m}]z_m, then every Kronecker coefficient g(Bm,Bm,μ)g(B_m, B_m, \mu) is positive

Saxl’s conjecture follows from its cyclic form.

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

For a natural number mm, the staircase BmB_m is the Young diagram with rows of lengths m,m−1,…,1m, m-1, \dots, 1.✦ With cells (i,j)(i, j) numbered from 00, ii the row and jj the column, Bm={(i,j):i+j<m},B_m = \{(i, j) : i + j < m\},(1) and BmB_m has Nm=m(m+1)/2N_m = m(m+1)/2 cells.

Saxl’s conjecture is about the tensor square SBm⊗SBmS^{B_m} \otimes S^{B_m} of the Specht module of the staircase, with the symmetric group SNmS_{N_m} acting diagonally: which irreducible representations SμS^\mu of SNmS_{N_m} occur in it, for m≥1m \ge 1?

The library states the conjecture through Kronecker coefficients, and a cyclic form of it in which the tensor square is replaced by the cyclic module of one vector zmz_m, built from two polytabloids of BmB_m in a space of words whose letters are pairs.

Words, Tableaux and Specht Modules

A word of length nn in 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, a tensor being taken to its coefficient function, and ewe_w is the basis vector of the word ww.✦ The symmetric group SnS_n of the positions acts on Wn,dW_{n,d} by (πf)(w)=f(w∘π),πew=ew∘π−1.(\pi f)(w) = f(w \circ \pi), \qquad \pi\, e_w = e_{w \circ \pi^{-1}}.(2)✦

For a representation VV of a group GG and a vector vv of VV, the cyclic module ℂ[G]v\mathbb{C}[G]v is the subspace of VV spanned by the translates hvhv, h∈Gh \in G.✦

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 canonical tableau of a Young diagram μ\mu with nn cells is the tableau of shape μ\mu on nn positions inverse to a numbering of the cells of μ\mu by the positions, fixed once and for all.✦ For a tableau tt of shape μ\mu, the row word wtw_t is the word in ℓ(μ)\ell(\mu) letters, ℓ(μ)\ell(\mu) being the number of rows of μ\mu, that sends each position ii to the row of the cell t(i)t(i).✦ The column stabilizer CtC_t of a tableau tt is the set of permutations π\pi of the positions such that t(π(i))t(\pi(i)) lies in the same column as t(i)t(i) for every position ii.✦ The polytabloid of a tableau tt of shape μ\mu 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(\mu)}.(3)✦

The Specht module SμS^\mu of a tableau tt of shape μ\mu on nn positions is the cyclic module ℂ[Sn]et\mathbb{C}[S_n]e_t inside Wn,ℓ(μ)W_{n,\ell(\mu)}, a representation of SnS_n under the restriction of (2).

For tableaux aa, bb and tt on the same nn positions, of shapes α\alpha, β\beta and μ\mu, the Kronecker coefficient g(α,β,μ)g(\alpha, \beta, \mu) is the complex dimension of the space of intertwiners from SμS^\mu to Sα⊗SβS^\alpha \otimes S^\beta, on which SnS_n acts diagonally: g(α,β,μ)=dim⁡ℂHom⁡Sn(Sμ,Sα⊗Sβ).g(\alpha, \beta, \mu) = \dim_{\mathbb{C}} \operatorname{Hom}_{S_n}(S^\mu, S^\alpha \otimes S^\beta).(4)✦

The Staircase Cyclic Module

The staircase tableau TmT_m is the canonical tableau of BmB_m, on NmN_m positions.✦ The transpose τm\tau_m of the staircase is the map on the cells of BmB_m that sends (i,j)(i, j) to (j,i)(j, i).✦ The row staircase tableau RmR_m is the tableau τm∘Tm\tau_m \circ T_m of shape BmB_m.✦ Since BmB_m has mm rows, the polytabloids eTme_{T_m} and eRme_{R_m} lie in WNm,mW_{N_m, m}.

A pair letter, for dd and ee letters, is a letter in dd together with a letter in ee, read as one of dede letters through the standard numbering of pairs. The merged word (a,b)(a, b) of a word aa in dd letters and a word bb in ee letters on the same nn positions is the word over pair letters whose letter at each position ii is (a(i),b(i))(a(i), b(i)).✦ The first factor w′w' and the second factor w″w'' of a word ww over pair letters are the words in dd and in ee letters whose letters at each position ii are the two components of w(i)w(i).

The uncurrying UU is the map from the families f=(fb)f = (f_b) of vectors of Wn,dW_{n,d}, indexed by the words bb in ee letters, to Wn,deW_{n,de} given by (Uf)(w)=fw″(w′)(Uf)(w) = f_{w''}(w'); its map back takes zz in Wn,deW_{n,de} to the family whose member at bb is the function a↦z(a,b)a \mapsto z(a, b).✦ The regrouping Φ:Wn,d⊗Wn,e→Wn,de\Phi \colon W_{n,d} \otimes W_{n,e} \to W_{n,de} is the identification of the tensor product with such families, followed by UU; on pure tensors it reads Φ(x⊗y)(w)=x(w′)y(w″).\Phi(x \otimes y)(w) = x(w')\, y(w'').(5)✦

The staircase vector zmz_m is the vector of WNm,m2W_{N_m, m^2}, whose letters are the pairs of letters from {0,…,m−1}\{0, \dots, m-1\}, given by zm=Φ(eRm⊗eTm).z_m = \Phi(e_{R_m} \otimes e_{T_m}).(6)✦ The staircase cyclic module is the cyclic module ℂ[SNm]zm\mathbb{C}[S_{N_m}]z_m inside WNm,m2W_{N_m, m^2}, under the action (2).✦

The Claim

Theorem 1. Let each Specht module below be that of the canonical tableau of its shape. Assume the cyclic Saxl conjecture: for every m≥1m \ge 1 and every Young diagram μ\mu with NmN_m cells, there is a nonzero intertwiner of representations of SNmS_{N_m} from SμS^\mu to the staircase cyclic module ℂ[SNm]zm\mathbb{C}[S_{N_m}]z_m.✦ Then Saxl’s conjecture holds: for every m≥1m \ge 1 and every Young diagram μ\mu with NmN_m cells, g(Bm,Bm,μ)>0.g(B_m, B_m, \mu) > 0.(7)✦

What Is Checked

The claim is stated over the staircase (1) with its tableaux TmT_m and RmR_m, the polytabloids (3) and the Specht modules they generate under the action (2), the Kronecker coefficient (4), and the cyclic module of the vector zmz_m of (6).

The library proves that the set (1) is a Young diagram, and that the transpose τm\tau_m maps it onto itself and is its own inverse. It also proves that the column stabilizer CtC_t is a subgroup of SnS_n, that a cyclic module ℂ[G]v\mathbb{C}[G]v is stable under GG, and that the uncurrying UU and the regrouping Φ\Phi are linear isomorphisms.