OctoInform Beta

OpenAI preprint, September 2026 · §5. Cyclic support of the bands · §5

Proposition 5.3 [Four-row support of the width-two band]: For m≥3m \ge 3, every Specht module SμS^\mu with at most four rows maps nonzero into the cyclic module Um,2U_{m,2} of the staircase band word

Four-row Specht modules occur in the width-two band.

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≥3m \ge 3 and h=m−2h = m - 2. The staircase BmB_m is the Young diagram of the cells (i,j)(i, j), ii the row and jj the column, with i+j<mi + j < m; its rows have lengths m,m−1,…,1m, m - 1, \dots, 1, and it has Nm=m(m+1)/2N_m = m(m+1)/2 cells.✦ Cutting off the smaller staircase BhB_h leaves the band of width two, the antidiagonals i+j=m−2i + j = m - 2 and i+j=m−1i + j = m - 1, with 2m−12m - 1 cells. The band carries a vector of a space of words of length 2m−12m - 1, the staircase band word zh,2z_{h,2}, and Um,2U_{m,2} is the cyclic module it generates under the symmetric group S2m−1S_{2m-1}. The question is which Specht modules SμS^\mu occur in Um,2U_{m,2}, and Proposition 5.3 answers it for the shapes with at most four rows.

Words and Specht Modules

The word space Wn,dW_{n,d} is the complex vector space of functions on the words w:{0,…,n−1}→{0,…,d−1}w\colon \{0, \dots, n-1\} \to \{0, \dots, d-1\}, the tensor power E⊗nE^{\otimes n} of E=ℂdE = \mathbb{C}^d, with ewe_w the basis vector of the word ww.✦ The symmetric group SnS_n acts on it by permuting positions, (gf)(w)=f(w∘g)(gf)(w) = f(w \circ g), so that gew=ew∘g−1g\, e_w = e_{w \circ g^{-1}}.✦ The cyclic module ℂ[Sn]v\mathbb{C}[S_n]\, v of a vector vv is the span of its translates gvgv.✦ For a subgroup GG of SnS_n and a word aa, the antisymmetrized word is altG(a)=∑g∈Gsgn⁡(g)gea,\mathrm{alt}_G(a) = \sum_{g \in G} \operatorname{sgn}(g)\, g\, e_a,(1)✦ with sgn\operatorname{sgn} the sign character of SnS_n.

A tableau tt of shape μ\mu on nn positions is a bijection from the positions to the cells of the Young diagram μ\mu.✦ The row word wtw_t of tt is the word that gives the position ii the row of t(i)t(i), a letter among the ℓ(μ)\ell(\mu) rows of μ\mu.✦ The column stabilizer CtC_t of tt is the subgroup of SnS_n of the permutations gg such that t(g(i))t(g(i)) lies in the column of t(i)t(i) for every position ii.✦ The polytabloid of tt is et=altCt(wt)e_t = \mathrm{alt}_{C_t}(w_t) in Wn,ℓ(μ)W_{n,\ell(\mu)}✦, and the Specht module SμS^\mu is its cyclic module ℂ[Sn]et\mathbb{C}[S_n]\, e_t, on which SnS_n acts by restriction.

The Staircase Band Word

Fix hh and a width ss, and let m=h+sm = h + s. The staircase tableau TmT_m is a tableau of shape BmB_m on NmN_m positions, fixed once and for all.✦ A position is high when TmT_m puts it in a cell of BhB_h.✦ The remaining positions, renumbered 0,…,n−10, \dots, n - 1 with nn the number of cells of the band Bm\BhB_m \setminus B_h, are the band positions, and the band tableau bb is the bijection that sends each band position to its cell under TmT_m.✦ The row stabilizer RbR_b of bb is the subgroup of SnS_n of the permutations that keep every band position in the row of its cell✦, and the column stabilizer CbC_b is the same with columns in place of rows.✦

The row rotation ρ\rho is the permutation of the cells of BmB_m that turns every row meeting BhB_h cyclically by ss steps, bringing the band cells of the row to its start, and fixes the other rows.✦ The column rotation γ\gamma is the row rotation conjugated by the transposition (i,j)↦(j,i)(i, j) \mapsto (j, i) of cells; it brings the band cells of every column meeting BhB_h to its top.✦ In the mm letters 0,…,m−10, \dots, m - 1, the band row word and the band column word are xh,sR=altRb(aR),xh,sC=altCb(aC),x^R_{h,s} = \mathrm{alt}_{R_b}(a^R), \qquad x^C_{h,s} = \mathrm{alt}_{C_b}(a^C),(2) where the word aRa^R gives the band position jj the column of the cell ρ(b(j))\rho(b(j)), and the word aCa^C gives it the row of the cell γ(b(j))\gamma(b(j)).

A pair letter is a first-layer letter together with a second-layer letter, each among mm letters, so there are m2m^2 pair letters; a word ww over them is a pair of words (w′,w″)(w', w'') in mm letters, its first and second layers, and regrouping the layers by position identifies Wn,m⊗Wn,mW_{n,m} \otimes W_{n,m} with Wn,m2W_{n,m^2}. The staircase band word zh,sz_{h,s} is the image of xh,sR⊗xh,sCx^R_{h,s} \otimes x^C_{h,s}, zh,s(w)=xh,sR(w′)xh,sC(w″),z_{h,s}(w) = x^R_{h,s}(w')\, x^C_{h,s}(w''),(3) and Um,s=ℂ[Sn]zh,sU_{m,s} = \mathbb{C}[S_n]\, z_{h,s} is its cyclic module in Wn,m2W_{n,m^2}.

Words as Matrix Products

With the two letters 0,10, 1 in each layer, a pair letter x∈{0,1,2,3}x \in \{0, 1, 2, 3\} is a pair of bits (a,b)(a, b) with x=2a+bx = 2a + b✦, and it stands for the matrix unit Ex=EabE_x = E_{ab} of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}), whose rows and columns are indexed by {0,1}\{0, 1\}.✦ The upper left entry of a matrix XX is X00X_{00}. The algebra Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) has the basis M1,…,M4=I,Z,T,JM_1, \dots, M_4 = I, Z, T, J, where Z=(100−1),T=(0110),J=(01−10).Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}, \qquad T = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad J = \begin{pmatrix} 0 & 1 \\ -1 & 0 \end{pmatrix}.(4)✦ Conjugation by QQ is the linear map X↦QXQ−1X \mapsto QXQ^{-1} of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C})✦, where Q=(1112),Q−1=(2−1−11).Q = \begin{pmatrix} 1 & 1 \\ 1 & 2 \end{pmatrix}, \qquad Q^{-1} = \begin{pmatrix} 2 & -1 \\ -1 & 1 \end{pmatrix}.(5) For q∈ℕq \in \mathbb{N}, the twist DqD_q is the linear map of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) that sends XX to its adjugate when qq is even and fixes XX when qq is odd.

The twisted chain product of nn matrices at offset pp is the multilinear map (X0,…,Xn−1)↦Dp(X0)Dp+1(X1)⋯Dp+n−1(Xn−1)(X_0, \dots, X_{n-1}) \mapsto D_p(X_0)\, D_{p+1}(X_1) \cdots D_{p+n-1}(X_{n-1})✦, and the chain functional Φn,p:Wn,4→Mat2(ℂ)\Phi_{n,p}\colon W_{n,4} \to \mathrm{Mat}_2(\mathbb{C}) is the linear map that applies it to the matrix units of the letters: Φn,p(x)=∑wx(w)Dp(Ew0)Dp+1(Ew1)⋯Dp+n−1(Ewn−1).\Phi_{n,p}(x) = \sum_{w} x(w)\, D_p(E_{w_0})\, D_{p+1}(E_{w_1}) \cdots D_{p+n-1}(E_{w_{n-1}}).(6) For r≥0r \ge 0, the path band word βr\beta_r is the vector of W2r+1,4W_{2r+1,4} whose value at a word ww with letters wq=(aq,bq)w_q = (a_q, b_q) is βr(w)=δa0,0δb2r,0∏i=0r−1Jb2ib2i+1Ja2i+1a2i+2.\beta_r(w) = \delta_{a_0,0}\, \delta_{b_{2r},0} \prod_{i=0}^{r-1} J_{b_{2i} b_{2i+1}}\, J_{a_{2i+1} a_{2i+2}}.(7)✦

A complex matrix LL with rows indexed by dd letters and columns by ee letters gives the word map ωL:Wn,d→Wn,e\omega_L\colon W_{n,d} \to W_{n,e}, the intertwiner that is the nn-th tensor power of the linear map ek↦∑lL(k,l)ele_k \mapsto \sum_l L(k, l)\, e_l.✦ Matrices N0,…,Nd−1N_0, \dots, N_{d-1} in Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) give the word map ωN:Wn,d→Wn,4\omega_N\colon W_{n,d} \to W_{n,4} of the matrix L(k,(a,b))=(Nk)abL(k, (a, b)) = (N_k)_{ab}, which reads the letter kk as the matrix NkN_k. The pairing of two vectors of Wn,eW_{n,e} is ⟨y,u⟩=∑wy(w)u(w)\langle y, u \rangle = \sum_w y(w)\, u(w).

Let r1,…,rkr_1, \dots, r_k be column lengths with sum nn, and number the cells of these columns c0,…,cn−1c_0, \dots, c_{n-1}, column after column and each column from top to bottom.✦ For a Young diagram μ\mu with nn cells and columns of lengths r1,…,rkr_1, \dots, r_k, the column tableau tμt_\mu of μ\mu is the tableau of shape μ\mu that sends the position qq to the cell cqc_q, for q=0,…,n−1q = 0, \dots, n - 1. A tuple π=(π1,…,πk)\pi = (\pi_1, \dots, \pi_k) of Sr1×…×SrkS_{r_1} \times \dots \times S_{r_k} permutes the cells within each column, πj\pi_j moving the rows of the jj-th, and its sign is sgn⁡(π)=∏jsgn⁡(πj)\operatorname{sgn}(\pi) = \prod_j \operatorname{sgn}(\pi_j).✦

For column lengths r1,…,rkr_1, \dots, r_k, an offset pp and matrices N0,N1,…N_0, N_1, \dots in Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}), the segment product Segp(r1,…,rk;N)\mathrm{Seg}_p(r_1, \dots, r_k; N) is the matrix given by the ordered product, from j=1j = 1 to j=kj = k, Segp(r1,…,rk;N)=∏j=1k∑σ∈Srjsgn⁡(σ)Dpj(Nσ(0))Dpj+1(Nσ(1))⋯Dpj+rj−1(Nσ(rj−1)),\mathrm{Seg}_p(r_1, \dots, r_k; N) = \prod_{j=1}^{k} \sum_{\sigma \in S_{r_j}} \operatorname{sgn}(\sigma)\, D_{p_j}(N_{\sigma(0)})\, D_{p_j+1}(N_{\sigma(1)}) \cdots D_{p_j+r_j-1}(N_{\sigma(r_j-1)}),(8)✦ where pj=p+r1+…+rj−1p_j = p + r_1 + \dots + r_{j-1} and SrS_r permutes {0,…,r−1}\{0, \dots, r - 1\}. The block product Πp(r1,…,rk)\Pi_p(r_1, \dots, r_k) is the ordered product, from j=1j = 1 to j=kj = k, of the segment matrices of length rjr_j at the offset pjp_j, the segment matrix being the signed sum of (8) taken with the basis matrices M1,…,M4M_1, \dots, M_4 of (4) as the matrices N0,…,N3N_0, \dots, N_3.✦

The Claim

Theorem 1. Let h≥1h \ge 1 and m=h+2m = h + 2, let μ\mu be a Young diagram with at most four rows, and let tt be a tableau of shape μ\mu on the 2m−12m - 1 positions of the band of width two. Then there is a nonzero intertwiner from the Specht module SμS^\mu of tt to the cyclic module Um,2U_{m,2} of the staircase band word zh,2z_{h,2}: Hom⁡S2m−1(Sμ,Um,2)≠0.\operatorname{Hom}_{S_{2m-1}}\bigl(S^\mu, U_{m,2}\bigr) \neq 0.(9)✦

What Is Checked

The claim is stated over the Specht module of a tableau of shape μ\mu and the cyclic module Um,2U_{m,2} of the staircase band word zh,2z_{h,2} of (3), inside the permutation representation of S2m−1S_{2m-1} on W2m−1,m2W_{2m-1,m^2}.

The same conclusion holds for the path band word βr\beta_r of (7): for r≥2r \ge 2, a Young diagram μ\mu with at most four rows and a tableau tt of shape μ\mu on 2r+12r + 1 positions, Hom⁡S2r+1(Sμ,ℂ[S2r+1]βr)≠0.\operatorname{Hom}_{S_{2r+1}}\bigl(S^\mu, \mathbb{C}[S_{2r+1}]\, \beta_r\bigr) \neq 0.(10)✦

Let SS be a subrepresentation of Wn,dW_{n,d}, let xx be a vector of SS, let LL be a complex matrix with rows indexed by dd letters and columns by ee letters, and let uu be a vector of Wn,eW_{n,e} with real coefficients. Then ⟨ωLx,u⟩≠0⇒Hom⁡Sn(S,ℂ[Sn]u)≠0.\langle \omega_L x, u \rangle \neq 0 \quad \Longrightarrow \quad \operatorname{Hom}_{S_n}\bigl(S, \mathbb{C}[S_n]\, u\bigr) \neq 0.(11)✦

The chain functional at offset one reads the pairing with the path band word: for r≥0r \ge 0 and xx in W2r+1,4W_{2r+1,4}, Φ2r+1,1(x)00=(−1)r⟨x,βr⟩.\Phi_{2r+1,1}(x)_{00} = (-1)^r \langle x, \beta_r \rangle.(12)✦ On the polytabloid of a column tableau it gives the segment product (8) of the column lengths: for a Young diagram μ\mu with nn cells and columns of lengths μ1t,…,μkt\mu^t_1, \dots, \mu^t_k, an offset pp and matrices N0,N1,…N_0, N_1, \dots in Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}), Φn,p(ωN(etμ))=Segp(μ1t,…,μkt;N).\Phi_{n,p}\bigl(\omega_N(e_{t_\mu})\bigr) = \mathrm{Seg}_p(\mu^t_1, \dots, \mu^t_k; N).(13)✦ For any column lengths r1,…,rkr_1, \dots, r_k, the segment product is the signed sum over the tuples π\pi of Sr1×…×SrkS_{r_1} \times \dots \times S_{r_k} of the twisted products along the permuted cells, ∑πsgn⁡(π)∏q=0n−1Dp+q(Nrow⁡π(cq))=Segp(r1,…,rk;N),\sum_{\pi} \operatorname{sgn}(\pi) \prod_{q=0}^{n-1} D_{p+q}\bigl(N_{\operatorname{row}\pi(c_q)}\bigr) = \mathrm{Seg}_p(r_1, \dots, r_k; N),(14)✦ with row⁡(c)\operatorname{row}(c) the row of a cell cc and the factors in the order of qq. For a Young diagram μ\mu with nn cells and at most four rows, with the letter of row ii read as QMi+1Q−1QM_{i+1}Q^{-1}, some tableau ss of shape μ\mu on nn positions gives Φn,1(ωN(es))00≠0,Ni=QMi+1Q−1.\Phi_{n,1}\bigl(\omega_N(e_s)\bigr)_{00} \neq 0, \qquad N_i = Q M_{i+1} Q^{-1}.(15)✦

On the matrices, the twists commute with conjugation by QQ, Dq(QXQ−1)=QDq(X)Q−1(q∈ℕ,X∈Mat2(ℂ)),D_q(QXQ^{-1}) = Q\, D_q(X)\, Q^{-1} \qquad (q \in \mathbb{N},\ X \in \mathrm{Mat}_2(\mathbb{C})),(16)✦ and each basis matrix keeps a nonzero upper left entry after conjugation by QQ: (QMiQ−1)00≠0(i=1,…,4).(Q M_i Q^{-1})_{00} \neq 0 \qquad (i = 1, \dots, 4).(17)✦ For lengths r1,…,rkr_1, \dots, r_k between 11 and 44 and every offset pp, the block product is a nonzero multiple of a basis matrix, Πp(r1,…,rk)=cMifor some c≠0 and some i∈{1,…,4},\Pi_p(r_1, \dots, r_k) = c\, M_i \quad \text{for some } c \neq 0 \text{ and some } i \in \{1, \dots, 4\},(18)✦ and some invertible matrix PP gives the block product at offset one a nonzero upper left entry after conjugation: (PΠ1(r1,…,rk)P−1)00≠0.\bigl(P\, \Pi_1(r_1, \dots, r_k)\, P^{-1}\bigr)_{00} \neq 0.(19)✦