OctoInform Beta

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

Lemma 2.1 [Dual-polytabloid test]: For xx in a subrepresentation SS of a word space and uu real, (L⊗nx,u)≠0(L^{\otimes n}x, u)\neq 0 gives a nonzero intertwiner S→ℂ[Sn]uS\to\mathbb{C}[S_n]u

A nonzero pairing gives a nonzero map into a cyclic 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

Take a tensor uu in the nnth tensor power of ℂe\mathbb{C}^e. The symmetric group SnS_n permutes its tensor positions, and the question is which Specht modules SθS^\theta, for partitions θ\theta of nn, occur in the cyclic module ℂ[Sn]u\mathbb{C}[S_n]u that uu generates. That SθS^\theta occurs means that there is a nonzero intertwiner from SθS^\theta to ℂ[Sn]u\mathbb{C}[S_n]u. Theorem 1 below produces one.

Word Spaces, Word Maps and Pairings

A word of length nn over 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 all functions from these words to ℂ\mathbb{C}; it is (ℂd)⊗n(\mathbb{C}^d)^{\otimes n}, a tensor taken to its coefficient function on words and the letter aa standing for the basis vector ea+1e_{a+1}.✦ Its standard basis consists of the functions ewe_w, equal to 1 at the word ww and 0 at every other word. The permutation action of SnS_n on Wn,dW_{n,d} is the representation in which a permutation gg of the positions sends a function ff to the function gfgf with (gf)(w)=f(w∘g),so thatgew=ew∘g−1.(gf)(w)=f(w\circ g),\qquad\text{so that}\quad g\,e_w=e_{w\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 linear span in VV of the translates ρ(g)v\rho(g)v with g∈Gg\in G.✦ A vector uu of Wn,eW_{n,e} has real coefficients when it equals its complex conjugate u‾:w↦u(w)¯\bar u\colon w\mapsto\overline{u(w)}. A subrepresentation SS of Wn,dW_{n,d} is closed under conjugation when x‾\bar x lies in SS for every xx in SS.

For a complex d×ed\times e matrix LL, with rows indexed by the letters {0,…,d−1}\{0,\dots,d-1\} and columns by the letters {0,…,e−1}\{0,\dots,e-1\} of a second alphabet, the word map of LL is the linear map L⊗n:Wn,d→Wn,eL^{\otimes n}\colon W_{n,d}\to W_{n,e} given by (L⊗nx)(b)=∑ax(a)∏i=0n−1L(ai,bi),(L^{\otimes n}x)(b)=\sum_{a}x(a)\prod_{i=0}^{n-1}L(a_i,b_i),(2)✦ for every word bb of length nn in ee letters, the sum running over all words aa of length nn in dd letters. It is the nnth tensor power of the linear map ℂd→ℂe\mathbb{C}^d\to\mathbb{C}^e sending ek+1e_{k+1} to ∑lL(k,l)el+1\sum_l L(k,l)\,e_{l+1}.

The pairing on Wn,dW_{n,d} is the bilinear form (x,y)=∑wx(w)y(w).(x,y)=\sum_w x(w)\,y(w).(3)

For a subrepresentation SS of Wn,dW_{n,d} with dual representation S*S^*, the pairing map of SS is the linear map ΦS:S→S*\Phi_S\colon S\to S^* sending xx to the linear form y↦(x,y)y\mapsto(x,y) on SS.✦ The ambient pairing of a subrepresentation SS of Wn,dW_{n,d} is the linear map AS:Wn,d→S*A_S\colon W_{n,d}\to S^* sending a vector xx of Wn,dW_{n,d} to the linear form y↦(x,y)y\mapsto(x,y) on SS.✦ The self-duality of a subrepresentation SS of Wn,dW_{n,d} closed under conjugation is its pairing map ΦS\Phi_S taken as an isomorphism of representations S→S*S\to S^*.✦

The projection of Wn,dW_{n,d} onto a subrepresentation SS closed under conjugation is the orthogonal projection PS:Wn,d→SP_S\colon W_{n,d}\to S given by the ambient pairing followed by the inverse of the self-duality: PS=ΦS−1∘AS,(PSx,y)=(x,y)for all x∈Wn,d,y∈S.P_S=\Phi_S^{-1}\circ A_S,\qquad (P_Sx,y)=(x,y)\quad\text{for all } x\in W_{n,d},\ y\in S.(4)✦

The Claim

Theorem 1. Let SS be a subrepresentation of Wn,dW_{n,d}, let LL be a complex d×ed\times e matrix, and let uu be a vector of Wn,eW_{n,e} with real coefficients. If some vector xx of SS satisfies (L⊗nx,u)≠0(L^{\otimes n}x,u)\neq 0, then there is an intertwiner f:S→ℂ[Sn]u,f≠0.f\colon S\to\mathbb{C}[S_n]u,\qquad f\neq 0.(5)✦

In the paper, the result reads: for a finite set BB, a vector zz of E⊗BE^{\otimes B} with E=ℂDE=\mathbb{C}^D and a partition θ\theta of |B||B| with at most DD rows, SθS^\theta occurs in ℂ[SB]z\mathbb{C}[S_B]z if and only if zz has a nonzero contraction with a dual block tensor whose blocks are the columns of θ\theta, for some placement of the blocks and some common ordered basis of E*E^*; if such a contraction exists for a fixed placement, it is nonzero for a generic ordered basis, and finitely many separately nonzero contractions can be made nonzero simultaneously with a common generic basis; there zz and SBS_B stand for the page’s uu and SnS_n.

The theorem gives the “if” direction of that equivalence, for any subrepresentation SS in place of SθS^\theta and for uu with real coefficients, the contraction becoming the pairing of uu with the image of a vector of SS under a word map.

What Is Checked

The claim is stated over the word spaces Wn,dW_{n,d} and Wn,eW_{n,e} with the permutation action (1) of SnS_n, a subrepresentation SS of Wn,dW_{n,d}, the word map (2) of a complex d×ed\times e matrix, the pairing (3), and the cyclic module ℂ[Sn]u\mathbb{C}[S_n]u of a vector uu with real coefficients.

The library proves that the word map, the pairing map, the ambient pairing and the projection PSP_S of (4) commute with the action of SnS_n, and that a cyclic module ℂ[G]v\mathbb{C}[G]v is stable under GG. It also proves that the pairing map ΦS\Phi_S of a subrepresentation closed under conjugation is injective.