OctoInform Beta

OpenAI preprint, September 2026 · §2. Specht modules and horizontal strips · §2

§2 (setting): dominance, position tensors and block tensors: Row prefix sums, the position action on words, and how signed sums of translates factor over a split the group preserves

Dominance, word spaces and block tensors for symmetric groups.

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

The symmetric group SnS_n acts on the tensor power E⊗nE^{\otimes n}, E=ℂdE=\mathbb{C}^d, by permuting the tensor positions, and Specht modules sit inside it as spans of the translates of polytabloids. The positions are [n]={0,…,n−1}[n]=\{0,\dots,n-1\}, the letters are [d]={0,…,d−1}[d]=\{0,\dots,d-1\}, and EE has the basis e0,…,ed−1e_0,\dots,e_{d-1}.

Block tensors are built from a set partition of the positions into ordered blocks. The initial-letter word gives the kk-th position of every block the letter kk, and summing its translates under the permutations that preserve every block, each with its sign, gives the block tensor of the partition. For the blocks {0,1}\{0,1\} and {2}\{2\} it is e0⊗e1⊗e0−e1⊗e0⊗e0.e_0\otimes e_1\otimes e_0-e_1\otimes e_0\otimes e_0 .(1)

The library defines the block tensor for any subgroup of SnS_n and any word; that of a partition is the case of the group of permutations preserving the labelling of each position by its block. The item also fixes dominance of Young diagrams by row prefix sums, the position product of tensors on complementary sets of positions, and the regrouping of two tensor layers on the same positions into one layer over pair letters, a pair letter being a first-layer letter together with a second-layer letter.

Words, Splittings and Pair Letters

A word of length nn over dd letters is a map w:[n]→[d]w\colon[n]\to[d]. The sector group of a set DD of positions consists of the permutations of [n][n] that map DD onto itself: Stab⁡(D)={g∈Sn:g(i)∈D⇔i∈D for every i∈[n]}.\operatorname{Stab}(D)=\{g\in S_n : g(i)\in D\iff i\in D \text{ for every } i\in[n]\}.(2)✦

For natural numbers pp and qq, with [p]={0,…,p−1}[p]=\{0,\dots,p-1\} and [q]={0,…,q−1}[q]=\{0,\dots,q-1\}, a splitting of the positions into pp and qq is a bijection σ:[n]→[p]⊔[q]\sigma\colon[n]\to[p]\sqcup[q]. The injections ι1:[p]→[n]\iota_1\colon[p]\to[n] and ι2:[q]→[n]\iota_2\colon[q]\to[n] are the restrictions of σ−1\sigma^{-1} to [p][p] and to [q][q]. A word ww of length nn has the left part w∘ι1w\circ\iota_1, a word of length pp, and the right part w∘ι2w\circ\iota_2, a word of length qq.

For letter counts d1d_1 and d2d_2, a pair letter is a pair (a,b)(a,b) of a letter a∈[d1]a\in[d_1] and a letter b∈[d2]b\in[d_2]; there are d1d2d_1d_2 of them. Two words w′:[n]→[d1]w'\colon[n]\to[d_1] and w″:[n]→[d2]w''\colon[n]\to[d_2] on the same positions merge into the word (w′,w″)(w',w'') in pair letters, i↦(w′(i),w″(i))i\mapsto(w'(i),w''(i)).✦ Conversely, a word in pair letters splits into its first-layer word, of the first components, and its second-layer word, of the second components.

The Claim

Definition 1. Let μ\mu and ν\nu be Young diagrams, of the same size or not, and write μi\mu_i for the length of row ii of μ\mu, rows numbered from 00. The kk-th row prefix sum of μ\mu, for k≥0k\ge0, is the number of cells in its first kk rows, |μ|<k=∑i<kμi.|\mu|_{<k}=\sum_{i<k}\mu_i .(3)✦ The diagram μ\mu dominates ν\nu, written μ⊵ν\mu\trianglerighteq\nu, when |ν|<k≤|μ|<kfor every k≥0.|\nu|_{<k}\le|\mu|_{<k}\quad\text{for every } k\ge0 .(4)✦

The word space Wn,dW_{n,d} is the complex vector space of all functions from the words w:[n]→[d]w\colon[n]\to[d] to ℂ\mathbb{C}.✦ A tensor of E⊗nE^{\otimes n} is the function giving its coefficients on the basis, so that ew(0)⊗⋯⊗ew(n−1)e_{w(0)}\otimes\cdots\otimes e_{w(n-1)} is the indicator ewe_w of ww. The position action of SnS_n on Wn,dW_{n,d} is (g⋅x)(w)=x(w∘g)(g∈Sn,x∈Wn,d).(g\cdot x)(w)=x(w\circ g)\qquad(g\in S_n,\ x\in W_{n,d}).(5)✦

Given a representation ρ\rho of a group GG on a complex vector space VV and a vector v∈Vv\in V, the cyclic module ℂ[G]v\mathbb{C}[G]v generated by vv is the span of its translates, ℂ[G]v=span⁡ℂ{ρ(g)v:g∈G}.\mathbb{C}[G]v=\operatorname{span}_{\mathbb{C}}\{\rho(g)v : g\in G\}.(6)✦

The sign character of SnS_n is the homomorphism sgn⁡:Sn→ℂ×\operatorname{sgn}\colon S_n\to\mathbb{C}^{\times} given by sgn⁡(g)=(−1)#{(i,j):i<j,g(i)>g(j)}.\operatorname{sgn}(g)=(-1)^{\#\{(i,j)\,:\,i<j,\ g(i)>g(j)\}} .(7)✦

The fiber group of a map ff from the positions to a set consists of the permutations that preserve ff: Sf={g∈Sn:f∘g=f}.S_f=\{g\in S_n : f\circ g=f\}.(8)✦ The block tensor of a word w:[n]→[d]w\colon[n]\to[d] under a subgroup GG of SnS_n is the signed sum of its translates, vG(w)=∑g∈Gsgn⁡(g)g⋅ew∈Wn,d.v_G(w)=\sum_{g\in G}\operatorname{sgn}(g)\,g\cdot e_w\ \in W_{n,d}.(9)✦

Given a splitting σ\sigma of the positions into pp and qq, the position product of x∈Wp,dx\in W_{p,d} and y∈Wq,dy\in W_{q,d} is the vector x⊠σyx\boxtimes_\sigma y of Wn,dW_{n,d} with (x⊠σy)(w)=x(w∘ι1)y(w∘ι2).(x\boxtimes_\sigma y)(w)=x(w\circ\iota_1)\,y(w\circ\iota_2).(10)✦ The regrouping of two layers is the linear map Φ:Wn,d1⊗Wn,d2→Wn,d1d2\Phi\colon W_{n,d_1}\otimes W_{n,d_2}\to W_{n,d_1d_2} to the word space over pair letters with Φ(x⊗y)(w′,w″)=x(w′)y(w″).\Phi(x\otimes y)(w',w'')=x(w')\,y(w'').(11)✦

Theorem 1. Let σ\sigma be a splitting of the positions into pp and qq, let D=ι1([p])D=\iota_1([p]) be the set of positions it sends to the first part, let ff be a map from the positions to a set, and let w:[n]→[d]w\colon[n]\to[d] be a word. Then vSf∩Stab⁡(D)(w)=vSf∘ι1(w∘ι1)⊠σvSf∘ι2(w∘ι2).v_{S_f\cap\operatorname{Stab}(D)}(w) =v_{S_{f\circ\iota_1}}(w\circ\iota_1)\boxtimes_\sigma v_{S_{f\circ\iota_2}}(w\circ\iota_2).(12)✦

In the paper, the result reads: μ⊵ν\mu\trianglerighteq\nu when every initial sum of μ\mu is at least the corresponding sum of ν\nu, and μt\mu^t is the conjugate of μ\mu; for a finite position set BB and EE with ordered basis e1,…,ede_1,\dots,e_d, E⊗BE^{\otimes B} has the word basis eae_a, a:B→{1,…,d}a\colon B\to\{1,\dots,d\}, with the position action gea=ea∘g−1g\,e_a=e_{a\circ g^{-1}}; and for a set partition LL of BB with blocks of size at most dd, vA=∑π∈Srsgn⁡(π)eπ(1)⊗⋯⊗eπ(r)v_A=\sum_{\pi\in S_r}\operatorname{sgn}(\pi)\,e_{\pi(1)}\otimes\cdots\otimes e_{\pi(r)} on an ordered block AA of size rr and vL=⨂A∈LvAv_L=\bigotimes_{A\in L}v_A, the page’s letter kk being the paper’s ek+1e_{k+1}.

What Is Checked

The definitions and the factorization (12) are stated over Young diagrams with their row lengths, the permutations of [n][n] with their signs, complex functions on words, representations of groups on complex vector spaces, and tensor products over ℂ\mathbb{C}.

The library proves that the fiber group SfS_f and the sector group Stab⁡(D)\operatorname{Stab}(D) are subgroups of SnS_n, and that (5) is a representation of SnS_n on Wn,dW_{n,d}. It proves as well that ℂ[G]v\mathbb{C}[G]v is stable under GG, hence a subrepresentation of VV, and that the regrouping Φ\Phi is a linear isomorphism.