OctoInform Beta

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

Lemma 4.5 [Odd-path support]: For k=2t+1≥5k = 2t+1 \ge 5, every Specht module SμS^\mu with at most four rows occurs in the cyclic module ℂ[Sk]u\mathbb{C}[S_k]u of the odd-path tensor

The odd-path contraction is a twisted matrix product.

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

Take an odd length k=2t+1k = 2t+1 and two layers of letters from {1,2}\{1, 2\} on the positions 1,…,k1, \dots, k. Regrouped by position, the layers give one word in pair letters (a,b)(a, b), and a tensor of (ℂ2⊗ℂ2)⊗k(\mathbb{C}^2 \otimes \mathbb{C}^2)^{\otimes k} becomes a function on such words, with SkS_k permuting the positions. The odd-path tensor uu joins consecutive positions by antisymmetric pairs, alternately in the two layers, so that the positions 1,…,k1, \dots, k form a path. A pair letter (a,b)(a, b) also names an entry of a 2×22 \times 2 matrix, so uu has a contraction with every pure tensor X1⊗⋯⊗XkX_1 \otimes \cdots \otimes X_k of matrices, the sum over all words of the product of the coefficients of uu and of the pure tensor. What is that contraction, and which Specht modules occur in the cyclic module ℂ[Sk]u\mathbb{C}[S_k]u generated by uu?

Words and Specht Modules

For natural numbers nn and dd, the word space Wn,dW_{n,d} is the complex vector space of functions on the words w:{1,…,n}→{1,…,d}w\colon \{1, \dots, n\} \to \{1, \dots, d\}; it is the tensor power (ℂd)⊗n(\mathbb{C}^d)^{\otimes n}, the word ww giving the basis vector ew=ew1⊗⋯⊗ewne_w = e_{w_1} \otimes \cdots \otimes e_{w_n}.✦ The symmetric group SnS_n acts on Wn,dW_{n,d} by permuting positions: a permutation gg sends ff to the function gfgf with (gf)(w)=f(w∘g)(gf)(w) = f(w \circ g), so that gew=ew∘g−1g e_w = e_{w \circ g^{-1}}.✦

Let ρ\rho be a representation of a group GG on a complex vector space VV and vv a vector of VV. The cyclic module ℂ[G]v\mathbb{C}[G]v of vv is the span of the translates ρ(g)v\rho(g)v with g∈Gg \in G.✦

A complex d×ed \times e matrix LL, with rows indexed by {1,…,d}\{1, \dots, d\} and columns by {1,…,e}\{1, \dots, e\}, gives the word map L⊗n:Wn,d→Wn,eL^{\otimes n}\colon W_{n,d} \to W_{n,e}, the nnth tensor power of the linear map ei↦∑jL(i,j)eje_i \mapsto \sum_j L(i, j)\, e_j: (L⊗nx)(b)=∑ax(a)∏i=1nL(ai,bi),(L^{\otimes n} x)(b) = \sum_{a} x(a) \prod_{i=1}^{n} L(a_i, b_i),(1)✦ the sum over all words aa in dd letters, for xx in Wn,dW_{n,d} and a word bb in ee letters.

Let μ\mu be a Young diagram with nn cells and ℓ\ell rows. A tableau 𝔱\mathfrak t of shape μ\mu is a bijection from the positions {1,…,n}\{1, \dots, n\} to the cells of μ\mu.✦ The row word w𝔱w_{\mathfrak t} of 𝔱\mathfrak t is the word in the letters {1,…,ℓ}\{1, \dots, \ell\} that sends a position ii to the row of the cell 𝔱(i)\mathfrak t(i).✦ The column stabilizer C𝔱C_{\mathfrak t} of 𝔱\mathfrak t is the set of permutations gg of the positions such that 𝔱(g(i))\mathfrak t(g(i)) lies in the column of 𝔱(i)\mathfrak t(i) for every position ii.✦ The polytabloid of 𝔱\mathfrak t is the vector e𝔱=∑σ∈C𝔱sgn⁡(σ)σew𝔱∈Wn,ℓ,e_{\mathfrak t} = \sum_{\sigma \in C_{\mathfrak t}} \operatorname{sgn}(\sigma)\, \sigma e_{w_{\mathfrak t}} \in W_{n,\ell},(2)✦ and the Specht module SμS^\mu of 𝔱\mathfrak t is the cyclic module ℂ[Sn]e𝔱\mathbb{C}[S_n]e_{\mathfrak t} in Wn,ℓW_{n,\ell}, with SnS_n acting by restriction.✦

Matrices and the Odd-path Tensor

The matrix space Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) is the space of complex 2×22 \times 2 matrices, with rows and columns indexed by 11 and 22.✦ A pair letter is a pair (a,b)(a, b) of letters a,b∈{1,2}a, b \in \{1, 2\}, aa from the first layer and bb from the second; it stands for the matrix unit EabE_{ab}, with entry 11 in row aa and column bb and 00 elsewhere.✦ The letters 1,…,41, \dots, 4 are read as the pair letters (1,1),(1,2),(2,1),(2,2)(1,1), (1,2), (2,1), (2,2) in this order, the pair letter (a,b)(a, b) being the letter 2(a−1)+b2(a-1)+b, and the words in pair letters form the word space Wn,4W_{n,4}. The pure tensor X1⊗⋯⊗XnX_1 \otimes \cdots \otimes X_n of matrices X1,…,XnX_1, \dots, X_n in Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) is the vector of Wn,4W_{n,4} whose coefficient on the word with pair letters (a1,b1),…,(an,bn)(a_1, b_1), \dots, (a_n, b_n) is (X1)a1b1⋯(Xn)anbn(X_1)_{a_1 b_1} \cdots (X_n)_{a_n b_n}.✦

Fix the matrices Z=(100−1),T=(0110),J=(01−10),Q=(1112),Q−1=(2−1−11).Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}, \quad T = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \quad J = \begin{pmatrix} 0 & 1 \\ -1 & 0 \end{pmatrix}, \quad Q = \begin{pmatrix} 1 & 1 \\ 1 & 2 \end{pmatrix}, \quad Q^{-1} = \begin{pmatrix} 2 & -1 \\ -1 & 1 \end{pmatrix}.(3) The matrices M1=IM_1 = I, M2=ZM_2 = Z, M3=TM_3 = T, M4=JM_4 = J form a basis of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}).✦ Conjugation by QQ is the linear map X↦QXQ−1X \mapsto Q X Q^{-1} of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) to itself.✦

The twist DqD_q, for a natural number qq, is the map of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) to itself that sends XX to its adjugate when qq is even and fixes XX when qq is odd, the adjugate of (αβγδ)\begin{pmatrix} \alpha & \beta \\ \gamma & \delta \end{pmatrix} being (δ−β−γα)\begin{pmatrix} \delta & -\beta \\ -\gamma & \alpha \end{pmatrix}.✦ For a natural number pp, the twisted chain product at offset pp is the multilinear map sending nn matrices X1,…,XnX_1, \dots, X_n to Dp(X1)Dp+1(X2)⋯Dp+n−1(Xn)D_p(X_1)\, D_{p+1}(X_2) \cdots D_{p+n-1}(X_n).✦ The chain functional Γp\Gamma_p at offset pp is the linear map Wn,4→Mat2(ℂ)W_{n,4} \to \mathrm{Mat}_2(\mathbb{C}) given by Γp(x)=∑wx(w)Dp(Ew1)Dp+1(Ew2)⋯Dp+n−1(Ewn),\Gamma_p(x) = \sum_{w} x(w)\, D_p(E_{w_1})\, D_{p+1}(E_{w_2}) \cdots D_{p+n-1}(E_{w_n}),(4)✦ the sum over the words ww in pair letters, each letter wiw_i read as its matrix unit.

For k=2t+1k = 2t+1, the odd-path tensor uu of length kk is the vector of Wk,4W_{k,4} whose coefficient on the word ww with pair letters (a1,b1),…,(ak,bk)(a_1, b_1), \dots, (a_k, b_k) is the following, with δ\delta the Kronecker delta and JijJ_{ij} the entry of JJ in row ii and column jj: u(w)=δa11δbk1∏i=1tJb2i−1b2iJa2ia2i+1,u(w) = \delta_{a_1 1}\, \delta_{b_k 1} \prod_{i=1}^{t} J_{b_{2i-1} b_{2i}}\, J_{a_{2i} a_{2i+1}},(5)✦

For a natural number pp and a finite sequence a1,…,aca_1, \dots, a_c of lengths, the block product Pp(a1,…,ac)P_p(a_1, \dots, a_c) is the matrix Pp(a1,…,ac)=Rp1(a1)Rp2(a2)⋯Rpc(ac),pj=p+a1+⋯+aj−1,P_p(a_1, \dots, a_c) = R_{p_1}(a_1)\, R_{p_2}(a_2) \cdots R_{p_c}(a_c), \qquad p_j = p + a_1 + \cdots + a_{j-1},(6) where Rq(a)∈Mat2(ℂ)R_q(a) \in \mathrm{Mat}_2(\mathbb{C}) is the segment matrix of length aa at offset qq, the signed sum over the permutations π\pi of {1,…,a}\{1, \dots, a\} of the twisted products of the basis matrices placed on the positions q,…,q+a−1q, \dots, q+a-1, Rq(a)=∑π∈Sasgn⁡(π)Dq(Mπ(1))Dq+1(Mπ(2))⋯Dq+a−1(Mπ(a)),R_q(a) = \sum_{\pi \in S_a} \operatorname{sgn}(\pi)\, D_q\bigl(M_{\pi(1)}\bigr)\, D_{q+1}\bigl(M_{\pi(2)}\bigr) \cdots D_{q+a-1}\bigl(M_{\pi(a)}\bigr), with Mi=JM_i = J for every i≥4i \ge 4; the block product of the empty sequence is II.

Let μ\mu be a Young diagram with nn cells and ℓ≤4\ell \le 4 rows. The map Φμ:Wn,ℓ→Wn,4\Phi_\mu\colon W_{n,\ell} \to W_{n,4} of μ\mu is the word map (1) of the ℓ×4\ell \times 4 matrix whose entry in row ii and column (a,b)(a, b) is (QMiQ−1)ab(Q M_i Q^{-1})_{ab}.

The Claim

Theorem 1. Let t≥0t \ge 0, k=2t+1k = 2t+1 and uu the odd-path tensor of length kk. For all matrices X1,…,XkX_1, \dots, X_k in Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}), ∑wu(w)(X1⊗⋯⊗Xk)(w)=(−1)t(D1(X1)D2(X2)⋯Dk(Xk))11,\sum_{w} u(w)\, (X_1 \otimes \cdots \otimes X_k)(w) = (-1)^t \bigl(D_1(X_1)\, D_2(X_2) \cdots D_k(X_k)\bigr)_{11},(7)✦ the sum over all words ww of length kk in pair letters.

For every finite sequence a1,…,aca_1, \dots, a_c of integers between 11 and 44, (QP1(a1,…,ac)Q−1)11≠0.\bigl(Q\, P_1(a_1, \dots, a_c)\, Q^{-1}\bigr)_{11} \neq 0.(8)✦

For every Young diagram μ\mu with nn cells and at most four rows, there is a tableau 𝔰\mathfrak s of shape μ\mu such that (Γ1(Φμe𝔰))11≠0.\bigl(\Gamma_1(\Phi_\mu\, e_{\mathfrak s})\bigr)_{11} \neq 0.(9)✦

If t≥2t \ge 2, μ\mu is a Young diagram with kk cells and at most four rows, and SμS^\mu is the Specht module of a tableau of shape μ\mu, then Hom⁡Sk(Sμ,ℂ[Sk]u)≠0,\operatorname{Hom}_{S_k}\bigl(S^\mu, \mathbb{C}[S_k]u\bigr) \neq 0,(10)✦ where ℂ[Sk]u\mathbb{C}[S_k]u is the cyclic module of uu in Wk,4W_{k,4}.

In the paper, the result reads: for k=2t+1k = 2t+1 with t≥0t \ge 0 and uu the pair-letter tensor whose first layer has pairs on (2,3),(4,5),…,(k−1,k)(2,3), (4,5), \dots, (k-1,k) and the letter 11 at position 11 and whose second layer has pairs on (1,2),(3,4),…,(k−2,k−1)(1,2), (3,4), \dots, (k-2,k-1) and the letter 11 at position kk, every ordered list a1,…,aca_1, \dots, a_c with 1≤ai≤41 \le a_i \le 4 and a1+⋯+ac=ka_1 + \cdots + a_c = k has some common ordered basis of Mat2(ℂ)\mathrm{Mat}_2(\mathbb{C}) for which the dual polytabloid with columns of lengths a1,…,aca_1, \dots, a_c placed consecutively has nonzero contraction with uu, in particular ℂ[Sk]u\mathbb{C}[S_k]u contains every partition of kk with at most four rows, and for finitely many such paths and column lists one common generic basis makes all these contractions nonzero.

What Is Checked

The claim is stated over the word spaces Wn,dW_{n,d} with SnS_n permuting positions, the pair letters and their matrix units, pure tensors of matrices, the odd-path tensor uu of (5), the matrices of (3) with the basis M1,…,M4M_1, \dots, M_4 and conjugation by QQ, the twists DqD_q and the chain functional Γ1\Gamma_1 of (4), the block products of (6), the word maps of (1), and the tableaux, polytabloids (2), Specht modules and cyclic modules built on them.

Of these constructions the library proves that the action on Wn,dW_{n,d} is a representation of SnS_n, that the column stabilizer C𝔱C_{\mathfrak t} is a subgroup of SnS_n, that a cyclic module ℂ[G]v\mathbb{C}[G]v is stable under GG, that every word map L⊗nL^{\otimes n} commutes with the action of SnS_n, and that conjugation by QQ, each twist DqD_q and each chain functional Γp\Gamma_p are linear.