The Setting
Take an odd length and two layers of letters from on the positions . Regrouped by position, the layers give one word in pair letters , and a tensor of becomes a function on such words, with permuting the positions. The odd-path tensor joins consecutive positions by antisymmetric pairs, alternately in the two layers, so that the positions form a path. A pair letter also names an entry of a matrix, so has a contraction with every pure tensor of matrices, the sum over all words of the product of the coefficients of and of the pure tensor. What is that contraction, and which Specht modules occur in the cyclic module generated by ?
Words and Specht Modules
For natural numbers and , the word space is the complex vector space of functions on the words ; it is the tensor power , the word giving the basis vector .✦ The symmetric group acts on by permuting positions: a permutation sends to the function with , so that .✦
Let be a representation of a group on a complex vector space and a vector of . The cyclic module of is the span of the translates with .✦
A complex matrix , with rows indexed by and columns by , gives the word map , the th tensor power of the linear map : (1)✦ the sum over all words in letters, for in and a word in letters.
Let be a Young diagram with cells and rows. A tableau of shape is a bijection from the positions to the cells of .✦ The row word of is the word in the letters that sends a position to the row of the cell .✦ The column stabilizer of is the set of permutations of the positions such that lies in the column of for every position .✦ The polytabloid of is the vector (2)✦ and the Specht module of is the cyclic module in , with acting by restriction.✦
Matrices and the Odd-path Tensor
The matrix space is the space of complex matrices, with rows and columns indexed by and .✦ A pair letter is a pair of letters , from the first layer and from the second; it stands for the matrix unit , with entry in row and column and elsewhere.✦ The letters are read as the pair letters in this order, the pair letter being the letter , and the words in pair letters form the word space . The pure tensor of matrices in is the vector of whose coefficient on the word with pair letters is .✦
Fix the matrices (3) The matrices , , , form a basis of .✦ Conjugation by is the linear map of to itself.✦
The twist , for a natural number , is the map of to itself that sends to its adjugate when is even and fixes when is odd, the adjugate of being .✦ For a natural number , the twisted chain product at offset is the multilinear map sending matrices to .✦ The chain functional at offset is the linear map given by (4)✦ the sum over the words in pair letters, each letter read as its matrix unit.
For , the odd-path tensor of length is the vector of whose coefficient on the word with pair letters is the following, with the Kronecker delta and the entry of in row and column : (5)✦
For a natural number and a finite sequence of lengths, the block product is the matrix (6) where is the segment matrix of length at offset , the signed sum over the permutations of of the twisted products of the basis matrices placed on the positions , with for every ; the block product of the empty sequence is .
Let be a Young diagram with cells and rows. The map of is the word map (1) of the matrix whose entry in row and column is .
The Claim
Theorem 1. Let , and the odd-path tensor of length . For all matrices in , (7)✦ the sum over all words of length in pair letters.
For every finite sequence of integers between and , (8)✦
For every Young diagram with cells and at most four rows, there is a tableau of shape such that (9)✦
If , is a Young diagram with cells and at most four rows, and is the Specht module of a tableau of shape , then (10)✦ where is the cyclic module of in .
In the paper, the result reads: for with and the pair-letter tensor whose first layer has pairs on and the letter at position and whose second layer has pairs on and the letter at position , every ordered list with and has some common ordered basis of for which the dual polytabloid with columns of lengths placed consecutively has nonzero contraction with , in particular contains every partition of 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 with permuting positions, the pair letters and their matrix units, pure tensors of matrices, the odd-path tensor of (5), the matrices of (3) with the basis and conjugation by , the twists and the chain functional 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 is a representation of , that the column stabilizer is a subgroup of , that a cyclic module is stable under , that every word map commutes with the action of , and that conjugation by , each twist and each chain functional are linear.