format: text

text:
# A two-box-shift morphism between Specht modules

## 0 Introduction

### 0.1 Known results

The irreducible modules of the complex group algebra of the symmetric group on $`n`$ letters possess the Specht lattices $`S^\lambda `$ as combinatorially described integral models, indexed by partitions $`\lambda `$ of $`n`$. Let $`d1`$ be an integer. Suppose given a partition $`\lambda `$ of $`n`$ and integers $`1gk\lambda _11`$ such that the shift of $`d`$ boxes situated at the bottom of column $`k+1`$ of $`\lambda `$ downwards to column $`g`$ yields a partition again, which we denote by $`\mu `$. Let $`\lambda ^{}`$ be the partition transposed to $`\lambda `$. The number

$$m_0:=\lambda _g^{}\lambda _{k+1}^{}+(k+1)g+d$$

of steps by which we shift leftwards and downwards is called the box shift length.

For instance, we may shift $`d=2`$ boxes of $`\lambda =(5,4,4,2,1,1)`$ from column $`k+1=4`$ downwards to column $`g=2`$ to obtain the partition $`\mu =(5,3,3,2,2,2)`$. We have $`\lambda ^{}=(6,4,3,3,1)`$, hence the box shift length equals $`m_0=5`$.

Theorem. Based on \[CL 74\], Carter and Payne \[CP 80\] have shown that

$$\text{Hom}_{K𝒮_n}(K_\text{Z}S^\lambda ,K_\text{Z}S^\mu )0,$$

$`K`$ being an infinite field of characteristic $`p`$ such that $`d<p^{v_p(m_0)}`$, i.e. such that the number of shifted boxes is smaller than the $`p`$-part of the box shift length. In case $`d=1`$, this condition on $`p`$ translates to $`p|m_0`$. In case $`d=2`$, it translates for $`p3`$ to $`p|m_0`$, and for $`p=2`$ to $`4|m_0`$.

Theorem. Suppose $`d=1`$. In \[K 99, 4.3.31, cf. 0.7.1\], the existence of an element of order $`m_0`$ in

$$\text{Hom}_{(\text{Z}/(m_0))𝒮_n}(\text{Z}/(m_0)_\text{Z}S^\lambda ,\text{Z}/(m_0)_\text{Z}S^\mu )$$

has been shown via construction of such a morphism.

### 0.2 Results

We maintain the situation from Section 0.1.

Suppose $`d=2`$. Let $`m`$ be either $`m_0`$ or $`m_0/2`$, the latter value being taken in case $`m_0`$ is even, a similar combinatorial integer is even and the diagram of $`\lambda `$ takes a certain shape near the column $`g`$.

Theorem (2.37). There exists a morphism of order $`m`$ in

$$\text{Hom}_{(\text{Z}/(m))𝒮_n}(\text{Z}/(m)_\text{Z}S^\lambda ,\text{Z}/(m)_\text{Z}S^\mu ).$$

As a consequence, we recover the according part of the result of Carter and Payne \[CP 80\]. An account of the construction of this morphism, including the definition of the modulus $`m`$, is given at the end of Section 1.1. In Section 0.3, we attempt to give an informal description of that construction. Some examples may be found in Section 2.4.

The proof by means of our techniques requires consideration of (essentially) $`9^2`$ cases - the base $`9`$ resulting from the structure of the one-step Garnir relations, the exponent $`2`$ being the number of shifted boxes (cf. A.1). Moreover, the connection between the modulus and the box shift length results from the calculation only.

A morphism modulo the box shift length $`m_0`$ itself need not exist. For instance, we obtain

$$\text{Hom}_{\text{Z}𝒮_5}(S^{(2,2,1)},\text{Z}/(5!)_\text{Z}S^{(1,1,1,1,1)})\text{}\text{Hom}_{\text{Z}𝒮_5}(S^{(2,2,1)},\text{Z}/(2)_\text{Z}S^{(1,1,1,1,1)})\text{Z}/2.$$

Let $`d`$ be arbitrary, but suppose $`g=k`$. This is to say, we shift $`d`$ boxes from column $`g+1`$ to column $`g`$.

Theorem (4.9). Let $`\text{ilog}_pd:=\mathrm{max}\{i\text{Z}_0|p^id\}`$. There exists a morphism of order $`m:=m_0{\displaystyle \underset{p\text{ prime, }p|m_0}{}}p^{\mathrm{min}(v_p(m_0),\text{ilog}_p(d))}`$ in

$$\text{Hom}_{(\text{Z}/(m))𝒮_n}(\text{Z}/(m)_\text{Z}S^\lambda ,\text{Z}/(m)_\text{Z}S^\mu ).$$

Again, the according part of the result of Carter and Payne \[CP 80\] is recovered. Roughly speaking, this morphism is given by picking $`d`$ entries from column $`g+1`$ of a given $`\lambda `$-polytabloid, by placing them at the bottom of column $`g`$, and by mapping this $`\lambda `$-polytabloid to an alternating sum of the resulting $`\mu `$-polytabloids over the various possibilities to pick those entries.

Remark. For an abelian group $`A`$ and an integer $`m2`$, we write $`A[m]:=\text{Kern}(A\text{}A)`$. There is an isomorphism

$$\text{Hom}_{(\text{Z}/(m))𝒮_n}(\text{Z}/(m)_\text{Z}S^\lambda ,\text{Z}/(m)_\text{Z}S^\mu )\text{}\text{Ext}_{\text{Z}𝒮_n}^1(S^\lambda ,S^\mu )[m]$$

which translates both results on the existence of a morphism of order $`m`$ into assertions on the existence of an extension of order $`m`$ in $`\text{Ext}^1`$. Cf. Section 0.4.

Remark. Let $`m2`$ be an integer. For arbitrary partitions $`\lambda `$, $`\mu `$ of $`n`$, we dispose of the transposition isomorphism

$$\text{Hom}_{(\text{Z}/(m))𝒮_n}(\text{Z}/(m)_\text{Z}S^\lambda ,\text{Z}/(m)_\text{Z}S^\mu )\text{}\text{Hom}_{(\text{Z}/(m))𝒮_n}(\text{Z}/(m)_\text{Z}S^\mu ^{},\text{Z}/(m)_\text{Z}S^\lambda ^{}),$$

given by dualization, followed by alternation and isomorphic substitution (3.16). Based on the simple assertion (3.2), we give in (3.27) an explicit, but nevertheless not quite satisfactory formula for the transpose of the two-box-shift morphism in (2.37) in terms of tabloids. Whereas the image of a polytabloid under that transpose is known to be an element of the target Specht module, hence known to be expressible as a linear combination of polytabloids, a formula for such an expression is lacking. Some examples are given in Section 3.4, cf. also (4.15).

### 0.3 Construction (informal description)

The following description might serve as an intuitive thread through our formalism concerning the two-box-shift morphism in (2.37). We maintain the situation of the beginning of Section 0.2 and refer to the usual way to depict partitions and tableaux \[J 78\].

We write the Specht lattice $`S^\lambda `$ as a quotient of the free $`\text{Z}𝒮_n`$-module $`F^\lambda `$ on one generator, displayed as having as Z-linear basis the set of $`\lambda `$-tableaux equipped with the action of the $`𝒮_n`$ on the tableau entries. The kernel of the canonical epimorphism $`F^\lambda \text{}S^\lambda `$ is generated, over $`\text{Z}𝒮_n`$, by signed column transpositions and one-step Garnir relations. Given a tableau, a signed column transposition is the sum of the tableau and the tableau having two entries of a column interchanged. A one-step Garnir relation depends on subsets of two subsequent columns of a tableau $`[a]`$ the sizes of which add up to (the length of the left column)$`+1`$. After factoring out the signed column transpositions, such a Garnir relation can be written, up to a scalar, as the alternating sum of the tableaux arising from $`[a]`$ by permutation inside the union of the chosen subsets of the columns, the sign being that of the afforded permutation. Our morphism is constructed as a factorization of a morphism $`(F^\lambda \text{}S^\mu \text{}S^\mu /mS^\mu )`$ over the canonical epimorphism $`(F^\lambda \text{}S^\lambda \text{}S^\lambda /mS^\lambda )`$. To a $`\lambda `$-tableau $`[a]`$, we may apply certain place operations, indexed by double paths, which produce $`\mu `$-polytabloids. A double path is a pair of sequences of positions in the union of the diagrams of $`\lambda `$ and $`\mu `$ that do not intersect, that run strictly from right to left, that start arbitrarily in column $`k+1`$ and that end at the the position of the shifted boxes in column $`g`$. (So at least $`4`$ and at most $`4+2(kg)`$ positions are occupied.) Given such a double path, the place operation it gives rise to is obtained by inserting entries of column $`k+1`$ into the double path from the right and by subsequently pushing entries through along each path separately. In particular, the last two entries forced to move are installed at the positions occupied by the shifted boxes in the diagram of $`\mu `$. Cf. (2.1). Each double path has a weight attached, i.e. a tuple recording the number of positions it occupies in each column, and a sign, depending on the positions it occupies in column $`k+1`$. Sending $`[a]`$ to the accordingly signed sum of the resulting $`\mu `$-polytabloids indexed by double paths of a fixed weight yields a $`\text{Z}𝒮_n`$-linear map from $`F^\lambda `$ to $`S^\mu `$ that annihilates the signed column transpositions. Forming a linear combination of these maps, indexed over the weights, equipped with certain coefficients which are polynomial in the combinatorial data, and dividing by an essentially polynomial factor of redundancy yields a $`\text{Z}𝒮_n`$-linear map $`F^\lambda \text{}S^\mu `$ that annihilates all one-step Garnir relations except for those involving column $`g`$ and column $`g+1`$, which vanish only modulo $`mS^\mu `$. Thus $`(F^\lambda \text{}S^\mu \text{}S^\mu /mS^\mu )`$ factors over a $`\text{Z}𝒮_n`$-linear map $`S^\lambda /mS^\lambda \text{}S^\mu /mS^\mu `$. Since the image of $`F^\lambda \text{}S^\mu `$ has not been contained in a strict multiple $`tS^\mu S^\mu `$, $`t2`$, the resulting morphism $`S^\lambda /mS^\lambda \text{}S^\mu /mS^\mu `$ is of order $`m`$ in its Hom-group.

### 0.4 Motivation

We consider the integral group ring $`\text{Z}𝒮_n`$ as a subring of a product of integral matrix rings via Wedderburn’s embedding, sending a group element $`g𝒮_n`$ to the tuple $`(\rho ^\lambda (g))_\lambda `$ of its operating matrices on the Specht lattices with respect to a choice of integral bases. Let $`m2`$ be an integer. A Z-linear map $`S^\lambda \text{}S^\mu `$ that becomes $`\text{Z}𝒮_n`$-linear modulo $`m2`$, i.e. that satisfies $`f\rho ^\lambda (g)_m\rho ^\mu (g)f`$ for all $`g𝒮_n`$, imposes this congruence as a necessary condition on an element of our product of integral matrix rings to lie in the image of that embedding. More generally, unscrewing the regular lattice into simple lattices via a binary tree of short exact sequences, we obtain a necessary and sufficient system of modular morphisms by means of the correspondence

$$\text{Hom}_{\text{Z}𝒮_n}(X,Y/mY)\text{}\text{Ext}_{\text{Z}𝒮_n}^1(X,Y)[m],$$

where $`X`$ and $`Y`$ are rationally disjoint $`\text{Z}𝒮_n`$-lattices. This correspondence attaches to a morphism $`X\text{}Y/mY`$ the extension obtained as pullback of

$$0\text{}Y\text{}Y\text{}Y/mY\text{}0.$$

Conversely, a retraction up to $`m`$ to the inclusion of an extension of $`X`$ by $`Y`$ yields the corresponding modular morphism as being induced on the cokernels. Since the $`\text{Ext}^1`$-order of a short exact sequence that occurs in that binary tree is not necessarily square-free, modular means modulo prime powers. See \[K 99\] for an elaboration on this theme.

### 0.5 Acknowledgements

I’d like to thank Prof. Rentschler for kind hospitality during the time of the preparation of this article. Large parts of the work have been supported by the EU TMR-network ‘Algebraic Lie Representations’, grant no. ERB FMRX-CT97-0100. I’d like to thank my fellow postdocs in Paris for help of various kinds. I’d like to thank Prof. Steffen König for encouragement, advice and support during and after the time of the preparation of my thesis, upon the methods of which the present result relies.

### 0.6 Leitfaden

## 1 Garnir

### 1.1 Specht lattices

For $`a,b\text{Z}`$, we let $`[a,b]:=\{i\text{Z}|ai\text{ and }ib\}`$.

Let $`n1`$. The symmetric group on the set $`[1,n]`$ is denoted by $`𝒮_n:=\text{Aut}_{\text{Sets}}[1,n]`$. The sign of a permutation $`\sigma 𝒮_n`$ is denoted by $`\epsilon _\sigma `$. Maps are written in various manners, on the right, on the left, using indices etc. The symmetric group acts on the right. Occasionally, we shall allow ourselves to treat tuples consisting of pairwise different entries and single elements as sets. Intervals are to be read as subsets of Z. Conjugation in a group is also written as $`h^g:=g^1hg`$. Given a module $`X`$ over a commutative ring $`R`$ and an element $`rR`$, we shall usually write $`X/r:=X/rX`$ (cf. e.g. 3.14). If $`X`$ and $`Y`$ are modules over an $`R`$-algebra $`A`$, we identify $`\text{Hom}_A(X/r,Y/r)=\text{Hom}_A(X,Y/r)`$ via composition with the residue class map $`X\text{}X/r`$.

Let

$$\begin{array}{ccc}\hfill \text{N}& \text{}& \text{N}_0\hfill \\ \hfill i& \text{}& \lambda _i\hfill \end{array}$$

be a partition of $`n`$, i.e. assume $`_i\lambda _i=n`$ and $`\lambda _i\lambda _{i+1}`$ for $`i\text{N}`$. Usually, we write a partition as a tuple, i.e. $`\lambda =(\lambda _1,\lambda _2,\mathrm{})`$. Sometimes, we abbreviate repeated entries by exponents that indicate their multiplicity, such as e.g. $`(9,2,2,2,1,1)=(9,2^3,1^2)(9,8,1)`$. Let $`[\lambda ]:=\{i\times j\text{N}\times \text{N}|\lambda _ij\}`$ be the diagram of $`\lambda `$. A $`\lambda `$-tableau is a bijection

$$\begin{array}{ccc}\hfill [\lambda ]& \text{}& [1,n]\hfill \\ \hfill i\times j& \text{}& a_{j,i}\hfill \end{array}.$$

The transposed partition of $`\lambda `$ is denoted by $`\lambda ^{}`$, i.e. $`i\times j[\lambda ]j\times i[\lambda ^{}]`$. For a $`\lambda `$-tableau $`[a]`$, we denote by $`[a^{}]`$ the $`\lambda ^{}`$-tableau obtained by composition with $`i\times j\text{}j\times i`$, mapping $`[\lambda ^{}]`$ onto $`[\lambda ]`$. A permutation $`\sigma 𝒮_n`$ acts on the set of $`\lambda `$-tableaux $`T^\lambda `$ via composition $`[a]\text{}[a]\sigma `$. Let $`F^\lambda `$ be the free Z-module on $`T^\lambda `$, endowed with the induced action of the $`𝒮_n`$. Let

$$\begin{array}{ccccccc}\hfill [\lambda ]& \text{}& \text{N}\hfill & ,& \hfill [\lambda ]& \text{}& \text{N}\hfill \\ \hfill i\times j& \text{}& i\hfill & & \hfill i\times j& \text{}& j\hfill \end{array}$$

denote the projections. To a $`\lambda `$-tableau $`[a]`$ we attach a $`\lambda `$-tabloid

$$\{a\}:=\{[a]\}:=[a]^1\pi _R^\lambda \text{N}^{[1,n]}.$$

In general, $`X`$ being a set, an element $`\sigma 𝒮_n`$ acts on $`fX^{[1,n]}`$ via $`(i)(f\sigma ):=(i\sigma ^1)f`$. In particular, the free Z-module on the set of $`\lambda `$-tabloids, denoted by $`M^\lambda `$, carries a structure as a $`\text{Z}𝒮_n`$-lattice, viz. $`\{a\}\sigma =\{[a]\sigma \}`$. Let

$$\begin{array}{ccc}\hfill C_{[a]}& :=& \{\kappa 𝒮_n|[a]^1\pi _C^\lambda =([a]\kappa )^1\pi _C^\lambda \}\hfill \\ \hfill R_{[a]}& :=& \{\rho 𝒮_n|[a]^1\pi _R^\lambda =([a]\rho )^1\pi _R^\lambda \}\hfill \end{array}$$

be the column stabilizer and the row stabilizer of $`[a]`$, respectively. Note that $`C_{[a]\sigma }=(C_{[a]})^\sigma `$ and $`R_{[a]\sigma }=(R_{[a]})^\sigma `$. Let the Specht lattice $`S^\lambda `$ be the $`\text{Z}𝒮_n`$-sublattice of $`M^\lambda `$ generated Z-linearly by the $`\lambda `$-polytabloids

$$a:=[a]:=\underset{\kappa C_{[a]}}{}\{a\}\kappa \epsilon _\kappa M^\lambda .$$

Let $`\zeta [1,n]`$. We denote by $`𝒮_\zeta :=C_{𝒮_n}([1,n]\backslash \zeta )`$ the subgroup of $`𝒮_n`$ consisting of permutations that act merely on $`\zeta `$. For an element $`x`$ of a $`\text{Z}𝒮_n`$-module $`X`$ we denote

$$x\zeta :=\underset{\sigma S_\zeta }{}x\sigma \epsilon _\sigma .$$

Given $`p1`$ and $`1jk\lambda _p^{}`$, we write $`a_{p,[j,k]}:=(a_{p,i})_{i[j,k]}`$ and abbreviate $`a_p:=a_{p,[1,\lambda _p^{}]}`$. Let $`\xi a_p`$, $`\eta a_{p+1}`$ be such that $`\mathrm{\#}\xi +\mathrm{\#}\eta =\lambda _p^{}+1`$. Letting $`𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }`$ denote a chosen set of representatives of right cosets, the expression

$$G_{[a],\xi ,\eta }^{\prime \prime }:=\underset{\sigma 𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }}{}[a]\sigma \epsilon _\sigma $$

is called a one-step Garnir relation. For $`p1`$, $`u,va_p`$, $`uv`$, the expression

$$[a]+[a](u,v)$$

is called a signed column transposition. From \[J 78, 7.2\] and from the proof of \[J 78, 8.4\] we take that the (finite) set

$$\begin{array}{cc}& \{[a]+[a](u,v)|[a]T^\lambda ,p1,u,va_p,uv\}\hfill \\ \hfill & \{G_{[a],\xi ,\eta }^{\prime \prime }|[a]T^\lambda ,p1,s,t1,s+t=\lambda _p^{}+1,\xi =a_{p,[\lambda _p^{}s+1,\lambda _p^{}]},\eta =a_{p+1,[1,t]}\}\hfill \end{array}$$

$`\text{Z}𝒮_n`$-linearly generates the kernel of the epimorphism

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\lambda \hfill \\ \hfill [a]& \text{}& a.\hfill \end{array}$$

Given a $`\text{Z}𝒮_n`$-module $`X`$, its alternated module is written $`X^{}:=X_\text{Z}\text{Z}^{}`$, $`\text{Z}^{}`$ being the abelian group Z, equipped with $`1\sigma :=\epsilon _\sigma `$, $`\sigma 𝒮_n`$. So $`\text{Z}^{}S^{(1^n)}`$. For each partition $`\lambda `$ of $`n`$, we fix a $`\lambda `$-tableau $`[a_\lambda ]`$ and let

$$\{[a_\lambda ^{}]\sigma \}^{}:=(\{a_\lambda ^{}\}1)\sigma M^{\lambda ^{},}$$

for $`\sigma 𝒮_n`$. Note that $`\{a^{}\}^{}\sigma =\{[a^{}]\sigma \}^{}`$ and that $`\{a^{}\}^{}\kappa =\{a^{}\}\epsilon _\kappa `$ for $`[a]T^\lambda `$, $`\sigma 𝒮_n`$, $`\kappa C_{[a]}`$. We obtain a factorization into epimorphisms

$$\left(\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\lambda \hfill \\ \hfill [a]& \text{}& a\hfill \end{array}\right)=\left(\begin{array}{ccccc}\hfill F^\lambda & \text{}& M^{\lambda ^{},}\hfill & \text{}& S^\lambda \hfill \\ \hfill [a]& \text{}& \{a^{}\}^{}\hfill & \text{}& a\hfill \end{array}\right)$$

by first factoring out the signed column transpositions. Using this factorization, we may write

$$G_{[a],\xi ,\eta }^{}:=(G_{[a],\xi ,\eta }^{\prime \prime })\nu _M^\lambda =\frac{1}{\mathrm{\#}\xi !\mathrm{\#}\eta !}\{a^{}\}^{}(\xi \eta ).$$

A $`\lambda `$-tableau $`[a]`$ is called standard if $`a_{j,i}a_{j^{},i^{}}`$ for $`i\times j,i^{}\times j^{}[\lambda ]`$ such that $`ii^{}`$ and $`jj^{}`$. The tuple $`(a|[a]\text{ is a standard }\lambda \text{-tableau})`$ is a Z-linear basis of $`S^\lambda `$ \[J, 8.4\]. Its elements are called standard $`\lambda `$-polytabloids. Let $`[\stackrel{ˇ}{a}_\lambda ]`$ be the standard $`\lambda `$-tableau determined by $`\stackrel{ˇ}{a}_{\lambda ,j,i+1}=\stackrel{ˇ}{a}_{\lambda ,j,i}+1`$ whenever $`i\times j,(i+1)\times j[\lambda ]`$. (We do not require a priori that $`[a_\lambda ]=[\stackrel{ˇ}{a}_\lambda ]`$, a requirement which is convenient for practical purposes, however.)

Account of the result (2.37). The notation deviates from our working notation further down. In particular, the following definitions are valid only in the remainder of this subsection (and will be repeated further down in case they coincide nonetheless).

Let $`1g<k\lambda _11`$ such that

$$\mu _i^{}:=\{\begin{array}{cc}\lambda _i^{}+2\hfill & \text{for }i=g\hfill \\ \lambda _i^{}2\hfill & \text{for }i=k+1\hfill \\ \lambda _i^{}\hfill & \text{else}\hfill \end{array}$$

defines a partition $`\mu `$. (For the case of $`g=k`$, see (2.17)).

A double path $`\gamma `$ is a pair of integers $`l(\delta )1`$ together with a pair of maps

$$\begin{array}{ccc}\hfill \gamma _\delta :[0,l\left(\delta \right)]& \text{}& \left[\lambda \right]\left[\mu \right]\hfill \\ \hfill i& \text{}& \alpha (\delta ,i)\times \beta (\delta ,i),\hfill \end{array}$$

where $`\delta [1,2]`$, subject to the following conditions.

* $`i<i^{}`$ implies $`\beta (\delta ,i)<\beta (\delta ,i^{})`$ for $`\delta [1,2]`$ and $`i,i^{}[0,l\left(\delta \right)]`$.
* $`\gamma _1\left([0,l\left(1\right)]\right)\gamma _2\left([0,l\left(2\right)]\right)=\mathrm{}`$.
* $`\alpha (\delta ,0)\times \beta (\delta ,0)=\left(\lambda _g^{}+\delta \right)\times g`$ for $`\delta [1,2]`$.
* $`\beta (\delta ,l\left(\delta \right))=k+1`$ for $`\delta [1,2]`$.
* $`\alpha (1,l\left(1\right))<\alpha (2,l\left(2\right))`$.

The set of double paths is denoted by $`\mathrm{\Gamma }`$. Suppose given $`\gamma \mathrm{\Gamma }`$. Let $`\epsilon _\gamma :=(1)^{\alpha (1,l(1))+\alpha (2,l(2))}`$. For $`j[g+1,k]`$, we let

$$e(\gamma ,j):=\underset{\delta [1,2]}{}\mathrm{\#}\gamma _\delta ^1\left([1,\lambda _j^{}]\times \left\{j\right\}\right).$$

Let

$$\begin{array}{ccc}\hfill [0,\lambda _{k+1}^{}]& \text{}& [0,\mu _{k+1}^{}]\hfill \\ \hfill i& \text{}& \mathrm{\#}\left([1,i]\backslash \{\alpha (1,l\left(1\right)),\alpha (2,l\left(2\right))\}\right)\hfill \\ \hfill \mathrm{min}\left(\phi ^1\left(\left\{j\right\}\right)\right)& \text{}& j.\hfill \end{array}$$

Given a $`\lambda `$-tableau $`[a]`$, we let the $`\mu `$-tableau $`[a^\gamma ]`$ be defined by

$$\begin{array}{cccc}\hfill a_{j,i}^\gamma & :=& a_{j,i}\hfill & \text{ for }i\times j\left[\mu \right]\backslash \left(\gamma _1\left([0,l\left(1\right)1]\right)\gamma _2\left([0,l\left(2\right)1]\right)\text{N}\times \left\{k+1\right\}\right)\hfill \\ \hfill a_{\beta (\delta ,i),\alpha (\delta ,i)}^\gamma & :=& a_{\beta (\delta ,i+1),\alpha (\delta ,i+1)}\hfill & \text{ for }\delta [1,2],i[0,l\left(\delta \right)1]\hfill \\ \hfill a_{k+1,i}^\gamma & :=& a_{k+1,\psi \left(i\right)}\hfill & \text{ for }i[1,\mu _{k+1}^{}].\hfill \end{array}$$

For $`j[g,k+1]`$, we let

$$X_j:=\left(\lambda _j^{}j\right)\left(\lambda _{k+1}^{}\left(k+1\right)\right).$$

For $`i[0,1]`$, we denote

$$L\left(i\right):=\left\{j[g+1,k1]\right|\lambda _{j+1}^{}=\lambda _j^{}i\}.$$

We write $`[g+1,k]=_{\kappa [1,K]}[p(\kappa ),q(\kappa )]`$ such that $`p(1)=g+1`$, such that $`p(\kappa )q(\kappa )`$, $`[p(\kappa ),q(\kappa )1]L(0)L(1)`$ and $`q(\kappa )L(0)L(1)`$ for $`\kappa [1,K]`$, such that $`q(\kappa )+1=p(\kappa +1)`$ for $`\kappa [1,K1]`$, and such that $`q(K)=k`$. For $`Z\text{Z}`$ and $`i0`$, we write $`Z^{(i)}:=(Z+i1)!/(Z1)!`$. We let

$$R:=\left(\underset{i[0,1]}{}\underset{jL\left(i\right)}{}X_j^{\left(2i\right)}\right)\left(\underset{\stackrel{\kappa [1,K],}{[p\left(\kappa \right),q\left(\kappa \right)1]L\left(1\right)}}{}\mathrm{gcd}(2,X_{q\left(\kappa \right)})\right)$$

and

$$m:=\{\begin{array}{cc}X_g+2\hfill & \text{ in case }[p\left(1\right),q\left(1\right)1]L\left(1\right)\hfill \\ \left(X_g+2\right)/\mathrm{gcd}(2,X_g,X_{g+1})\hfill & \text{ in case }[p\left(1\right),q\left(1\right)1]L\left(1\right)\hfill \end{array}.$$

The $`\text{Z}𝒮_n`$-linear map

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill \left[a\right]& \text{}& \underset{\gamma \mathrm{\Gamma }}{}\left(\underset{j[g+1,k]}{}X_j^{\left(2e(\gamma ,j)\right)}\right)a^\gamma \epsilon _\gamma \hfill \end{array}$$

is divisible by $`R`$, and its quotient by $`R`$ factors $`\text{Z}𝒮_n`$-linearly as

$$\left(\begin{array}{ccccc}\hfill F^\lambda & \text{}& S^\mu \hfill & \text{}& S^\mu /m\hfill \\ & & b\hfill & \text{}& b+mS^\mu \hfill \end{array}\right)=\left(\begin{array}{ccccc}\hfill F^\lambda & \text{}& S^\lambda \hfill & \text{}& S^\mu /m\hfill \\ \hfill \left[a\right]& \text{}& a\hfill & & \end{array}\right).$$

The resulting morphism $`S^\lambda \text{}S^\mu /m`$ is of order $`m`$ as an element of $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$.

### 1.2 A Garnir formula

Let $`\lambda `$ be a partition of $`n`$, let $`[a]`$ be a $`\lambda `$-tableau, let $`1p<q\lambda _1`$, let $`d1`$. Let $`\xi a_p`$, $`s:=\mathrm{\#}\xi `$, $`\overline{\xi }:=a_p\backslash \xi `$ and $`\eta a_q`$, $`t:=\mathrm{\#}\eta `$, $`\overline{\eta }:=a_q\backslash \eta `$, $`u:=\mathrm{\#}\overline{\eta }`$, be such that $`s+t=\lambda _p^{}+1d`$. We choose a disjoint decomposition $`\overline{\xi }=\overline{\xi }_0\overline{\xi }_1`$ such that $`\mathrm{\#}\overline{\xi }_0=d1`$ and $`\mathrm{\#}\overline{\xi }_1=t`$.

###### Lemma 1.1 (cf. \[K 99, 4.3.4\])

Assume given $`x\phi a_p`$, $`y\psi a_q`$. Then

$$\begin{array}{ccc}\hfill a(\phi \psi )& =& \mathrm{\#}\phi a(\phi \psi \backslash x)\mathrm{\#}\psi a(x,y)(\phi \psi \backslash x)\hfill \\ & =& \mathrm{\#}\psi a(\phi \psi \backslash y)\mathrm{\#}\phi a(x,y)(\phi \psi \backslash y).\hfill \end{array}$$

In fact,

$$\begin{array}{ccc}\hfill a(\phi \psi )& =& \underset{z\phi \psi }{}\underset{\sigma 𝒮_{\phi \psi },z\sigma =x}{}a\sigma \epsilon _\sigma \hfill \\ & =& \left(\underset{z\phi \backslash x}{}\underset{\sigma 𝒮_{\phi \psi },z\sigma =x}{}a\sigma \epsilon _\sigma \right)\hfill \\ & +& \left(a(\phi \psi \backslash x)\right)\hfill \\ & +& \left(\underset{z\psi \backslash y}{}\underset{\sigma 𝒮_{\phi \psi },z\sigma =x}{}a\sigma \epsilon _\sigma \right)\hfill \\ & +& \left(\underset{\sigma 𝒮_{\phi \psi },y\sigma =x}{}a\sigma \epsilon _\sigma \right)\hfill \\ & =& \left((\mathrm{\#}\phi 1)a(\phi \psi \backslash x)\right)\hfill \\ & +& \left(a(\phi \psi \backslash x)\right)\hfill \\ & & \left((\mathrm{\#}\psi 1)a(x,y)(\phi \psi \backslash x)\right)\hfill \\ & & \left(a(x,y)(\phi \psi \backslash x)\right).\hfill \end{array}$$

The second equality follows by symmetry.

Suppose given disjoint subsets $`\phi ,\psi [1,n]`$ and a bijection $`\phi \text{}\psi `$. We denote

$$(\phi ,\psi )_\alpha :=\underset{x\phi }{}(x,(x)\alpha )𝒮_n.$$

In case $`\phi a_p`$, $`\psi a_q`$, $`\mathrm{\#}\phi =\mathrm{\#}\psi `$, the element $`a(\phi ,\psi ):=a(\phi ,\psi )_\alpha `$ is independent of the choice of a bijection $`\phi \text{}\psi `$.

###### Lemma 1.2 (\[K 99, 4.3.5\])

In case $`d=1`$ we have

$$a(\xi \eta )=s!t!a(\overline{\xi },\eta ).$$

We calculate

$$\begin{array}{ccc}\hfill a(\xi \eta )& \stackrel{\text{(}\text{1.1}\text{)}}{=}& \frac{t}{s+1}a(x,y)(\xi \eta )\hfill \\ & \stackrel{\text{(}\text{1.1}\text{)}}{=}& \frac{t(t1)}{(s+1)(s+2)}a(x,y)(x^{},y^{})(\xi \eta )\hfill \\ & \stackrel{\text{(}\text{1.1}\text{)}}{=}& \mathrm{}\hfill \end{array}$$

$$\begin{array}{ccc}& \stackrel{\text{(}\text{1.1}\text{)}}{=}& \frac{s!t!}{(s+t)!}a(\overline{\xi },\eta )(\xi \eta )\hfill \\ & =& s!t!a(\overline{\xi },\eta ),\hfill \end{array}$$

where $`\overline{\xi }=\{x,x^{},\mathrm{}\}`$, $`\eta =\{y,y^{},\mathrm{}\}`$.

###### Lemma 1.3

Let $`\phi a_p`$ and $`\psi a_q`$ be given such that $`\mathrm{\#}\phi =\mathrm{\#}\psi `$ and let $`\sigma 𝒮_{a_p}`$. We obtain

$$a(\phi ,\psi )\sigma =a((\phi )\sigma ,\psi )\epsilon _\sigma .$$

Factorization reduces us to the consideration of a transposition $`\sigma =(x,y)`$, where, moreover, we may assume $`x\phi `$ and $`ya_p\backslash \phi `$. Choosing $`z\psi `$, we conclude

$$\begin{array}{ccc}\hfill a(\phi ,\psi )(x,y)& =& a((\phi \backslash x),(\psi \backslash z))(x,z)(x,y)\hfill \\ & =& a((\phi \backslash x),(\psi \backslash z))(y,z)\hfill \\ & =& a((\phi )(x,y),\psi ).\hfill \end{array}$$

###### Lemma 1.4

The formula

$$a(\xi \eta )=\frac{s!}{(d1)!}a(\overline{\xi }_1,\eta )\overline{\xi }$$

holds.

The claimed equality may be reformulated to

$$a(\xi \eta )\overline{\xi }=\frac{s!(t+d1)!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )(\xi \eta )\overline{\xi }.$$

We perform an induction over $`d`$, the case $`d=1`$ being treated in (1.2). We assume $`d2`$ and perform an induction over $`t`$, the case $`t=0`$ being trivial. We assume $`t1`$, choose $`x_0\overline{\xi }_0`$, $`x_1\overline{\xi }_1`$, $`y\eta `$ and denote $`\overline{\xi }_2:=(\overline{\xi }_1)(x_0,x_1)`$. Evaluating in two ways, we obtain

$$\begin{array}{cc}& a(\xi x_1\eta )(\overline{\xi }\backslash x_1)\hfill \\ \stackrel{\text{1., case }d1\text{}t}{=}& \frac{(s+1)!(t+d2)!}{(s+t+1)!(d2)!}a(\overline{\xi }_2,\eta )(\xi x_1\eta )(\overline{\xi }\backslash x_1)\hfill \\ =& \frac{(s+1)!(t+d2)!}{(s+t)!(d2)!}a(\overline{\xi }_2,\eta )(\xi \eta )(\overline{\xi }\backslash x_1)\hfill \\ \stackrel{\text{2., (}\text{1.1}\text{)}}{=}& (s+1)a(\xi \eta )(\overline{\xi }\backslash x_1)\hfill \\ & t\left[a(x_1,y)\left((\xi y)(\eta \backslash y)\right)(\overline{\xi }\backslash x_1)\right]\hfill \\ \stackrel{\text{case }d\text{}t1}{=}& \frac{s+1}{t+d1}a(\xi \eta )\overline{\xi }\hfill \\ & t\left[\frac{(s+1)!(t+d2)!}{(s+t)!(d1)!}a(x_1,y)(\overline{\xi }_1\backslash x_1,\eta \backslash y)\left((\xi y)(\eta \backslash y)\right)(\overline{\xi }\backslash x_1)\right].\hfill \end{array}$$

Therefore,

$$\begin{array}{ccc}\hfill a(\xi \eta )\overline{\xi }& =& \frac{s!(t+d1)!}{(s+t)!(d2)!}a(\overline{\xi }_2,\eta )(\xi \eta )(\overline{\xi }\backslash x_1)\hfill \\ & +& t\frac{s!(t+d1)!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )(\xi \eta )(\overline{\xi }\backslash x_1)\hfill \\ & \stackrel{\text{(}\text{1.3}\text{)}}{=}& (d1)\frac{s!(t+d1)!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )(\xi \eta )(x_0,x_1)(\overline{\xi }_0\overline{\xi }_1\backslash x_1)\hfill \\ & +& t\frac{s!(t+d1)!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )(\xi \eta )(\overline{\xi }_0\overline{\xi }_1\backslash x_1)\hfill \\ & \stackrel{\text{(}\text{1.1}\text{)}}{=}& \frac{s!(t+d1)!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )(\xi \eta )\overline{\xi }.\hfill \end{array}$$

###### Proposition 1.5 (Garnir formula)

Assume given a subset $`\phi _{j[1,p1]}a_j`$. We have

$$a(\phi \xi \eta )=\frac{s!}{(s+t)!(d1)!}a(\overline{\xi }_1,\eta )\overline{\xi }(\phi \xi \eta ).$$

Let $`A`$ be the set of injections of $`\phi `$ into $`\phi \xi \eta `$. We write

$$\begin{array}{ccc}\hfill a(\phi \xi \eta )& =& \underset{\alpha A}{}\underset{\sigma 𝒮_{\phi \xi \eta },\sigma |_\phi =\alpha }{}a\sigma \epsilon _\sigma \hfill \\ \hfill a(\overline{\xi }_1,\eta )\overline{\xi }(\phi \xi \eta )& =& \underset{\alpha A}{}\underset{\sigma 𝒮_{\phi \xi \eta },\sigma |_\phi =\alpha }{}a(\overline{\xi }_1,\eta )\overline{\xi }\sigma \epsilon _\sigma \hfill \end{array}$$

and fix an embedding $`\alpha A`$ in order to compare the summands. We choose a permutation $`\rho 𝒮_{\phi \xi \eta }`$ that restricts to $`\rho |_\phi =\alpha `$. On the one hand, we obtain

$$\begin{array}{ccc}\hfill \underset{\sigma 𝒮_{\phi \xi \eta },\sigma |_\phi =\alpha }{}a\sigma \epsilon _\sigma & \stackrel{\sigma =\sigma ^{}\rho }{=}& \underset{\sigma ^{}𝒮_{\xi \eta }}{}a\sigma ^{}\epsilon _\sigma ^{}\rho \epsilon _\rho \hfill \\ & =& a(\xi \eta )\rho \epsilon _\rho \hfill \\ & \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{s!}{(d1)!}a(\overline{\xi }_1,\eta )\overline{\xi }\rho \epsilon _\rho ,\hfill \end{array}$$

on the other hand, we have

$$\begin{array}{ccc}\hfill \underset{\sigma 𝒮_{\phi \xi \eta },\sigma |_\phi =\alpha }{}a(\overline{\xi }_1,\eta )\overline{\xi }\sigma \epsilon _\sigma & \stackrel{\sigma =\sigma ^{}\rho }{=}& \underset{\sigma ^{}𝒮_{\xi \eta }}{}a(\overline{\xi }_1,\eta )\overline{\xi }\sigma ^{}\epsilon _\sigma ^{}\rho \epsilon _\rho \hfill \\ & =& (s+t)!a(\overline{\xi }_1,\eta )\overline{\xi }\rho \epsilon _\rho ,\hfill \end{array}$$

whence the result follows by comparison. Independence of the right hand side of the choice of $`\overline{\xi }_1`$ can also be seen by application of (1.3) to an appropriate permutation $`\tau 𝒮_{\overline{\xi }}`$, for we have $`()\tau \overline{\xi }=()\overline{\xi }\epsilon _\tau `$.

###### Lemma 1.6

For $`i_0[0,s]`$, we write

$$B_{[a],\xi ,\eta }(i_0):=\underset{s_0[i_0,s]}{}(1)^{s_0}\underset{\stackrel{\xi _0\xi ,}{\mathrm{\#}\xi _0=s_0}}{}\underset{\stackrel{\eta _0\eta ,}{\mathrm{\#}\eta _0=s_0i_0}}{}\underset{\stackrel{\phi _0\overline{\eta },}{\mathrm{\#}\phi _0=i_0}}{}a(\xi _0,\eta _0\phi _0).$$

Let $`i[1,u]`$. We define and obtain

$$\begin{array}{ccc}\hfill C_{[a],\xi ,\eta }(i)& :=& \underset{\stackrel{\phi \overline{\eta },}{\mathrm{\#}\phi =i}}{}a(\xi \eta \phi )\hfill \\ & =& s!(t+i)!\underset{i_0[0,\mathrm{min}(i,s)]}{}\left(\begin{array}{c}ui_0\\ ii_0\end{array}\right)B_{[a],\xi ,\eta }(i_0).\hfill \end{array}$$

We fix a subset $`\phi \overline{\eta }`$ of cardinality $`\mathrm{\#}\phi =i`$. Indexing by subsets that become interchanged by a certain element of $`𝒮_{\xi \eta \phi }`$, we obtain

$$\begin{array}{c}a(\xi \eta \phi )\hfill \\ =s!(t+i)!\underset{i_0[0,\mathrm{min}(i,s)]}{}\underset{s_0[i_0,s]}{}\underset{\stackrel{\xi _0\xi ,}{\mathrm{\#}\xi _0=s_0}}{}\underset{\stackrel{\eta _0\eta ,}{\mathrm{\#}\eta _0=s_0i_0}}{}\underset{\stackrel{\phi _0\phi ,}{\mathrm{\#}\phi _0=i_0}}{}a(\xi _0,\eta _0\phi _0)\epsilon _{(\xi _0,\eta _0\phi _0)}.\hfill \end{array}$$

The number of subsets $`\phi `$ of cardinality $`\mathrm{\#}\phi =i`$ that lie in between $`\phi _0\phi \overline{\eta }`$, where $`\phi _0`$ is a given subset of $`\overline{\eta }`$ of cardinality $`\mathrm{\#}\phi _0=i_0`$, amounts to $`\left(\begin{array}{c}ui_0\\ ii_0\end{array}\right)`$. Whence the result is obtained by collecting

$$\underset{\stackrel{\phi \overline{\eta },}{\mathrm{\#}\phi =i}}{}\underset{\stackrel{\phi _0\phi ,}{\mathrm{\#}\phi _0=i_0}}{}U(\phi _0)=\left(\begin{array}{c}ui_0\\ ii_0\end{array}\right)\underset{\stackrel{\phi _0\overline{\eta },}{\mathrm{\#}\phi _0=i_0}}{}U(\phi _0),$$

$`U(\phi _0)`$ being some expression independent of $`\phi `$.

###### Lemma 1.7

Suppose given in addition a subset $`\psi \xi `$, of cardinality $`\mathrm{\#}\psi =:v`$. For $`i_0[0,sv]`$, we write

$$B_{[a],\xi ,\psi ,\eta }^{}(i_0):=\frac{(1)^{i_0}}{v!t!}\underset{\stackrel{\xi _0\xi \backslash \psi ,}{\mathrm{\#}\xi _0=i_0}}{}\underset{\stackrel{\phi _0\eta ,}{\mathrm{\#}\phi _0=i_0}}{}a(\xi _0,\phi _0)(\psi \eta ).$$

Let $`i[1,u]`$. We define and obtain

$$\begin{array}{ccc}\hfill C_{[a],\xi ,\psi ,\eta }^{}(i)& :=& \underset{\stackrel{\phi \eta ,}{\mathrm{\#}\phi =i}}{}a(\xi \phi )(\psi \eta )\hfill \\ & =& t!s!(i+v)!\underset{i_0[0,\mathrm{min}(i,sv)]}{}\left(\begin{array}{c}ti_0\\ ii_0\end{array}\right)B_{[a],\xi ,\psi ,\eta }^{}(i_0).\hfill \end{array}$$

We fix a subset $`\phi \eta `$ of cardinality $`\mathrm{\#}\phi =i`$ and obtain

$$\begin{array}{cc}& \frac{1}{s!i!}a(\xi \phi )(\psi \eta )\hfill \\ =& \frac{1}{(sv)!i!}\left(\begin{array}{c}i+v\\ v\end{array}\right)a((\xi \backslash \psi )\phi )(\psi \eta )\hfill \\ =& \left(\begin{array}{c}i+v\\ v\end{array}\right)\underset{i_0[0,\mathrm{min}(i,sv)]}{}\underset{\stackrel{\xi _0\xi \backslash \psi ,}{\mathrm{\#}\xi _0=i_0}}{}\underset{\stackrel{\phi _0\phi ,}{\mathrm{\#}\phi _0=i_0}}{}(1)^{i_0}a(\xi _0,\phi _0)(\psi \eta ),\hfill \end{array}$$

whence we conclude as in (1.6) that

$$\begin{array}{cc}& \underset{\stackrel{\phi \eta ,}{\mathrm{\#}\phi =i}}{}a(\xi \phi )(\psi \eta )\hfill \\ =& \underset{\stackrel{\phi \eta ,}{\mathrm{\#}\phi =i}}{}\frac{s!(i+v)!}{v!}\underset{i_0[0,\mathrm{min}(i,sv)]}{}\underset{\stackrel{\xi _0\xi \backslash \psi ,}{\mathrm{\#}\xi _0=i_0}}{}\underset{\stackrel{\phi _0\phi ,}{\mathrm{\#}\phi _0=i_0}}{}(1)^{i_0}a(\xi _0,\phi _0)(\psi \eta )\hfill \\ =& \frac{s!(i+v)!}{v!}\underset{i_0[0,\mathrm{min}(i,sv)]}{}\underset{\stackrel{\xi _0\xi \backslash \psi ,}{\mathrm{\#}\xi _0=i_0}}{}\left(\begin{array}{c}ti_0\\ ii_0\end{array}\right)\underset{\stackrel{\phi _0\eta ,}{\mathrm{\#}\phi _0=i_0}}{}(1)^{i_0}a(\xi _0,\phi _0)(\psi \eta ).\hfill \end{array}$$

## 2 A two-box-shift morphism

### 2.1 Double paths

Let $`\lambda `$ be a partition of $`n`$. We assume given integers $`g,k`$ such that $`1gk\lambda _11`$ and such that

$$\mu _i^{}:=\{\begin{array}{cc}\lambda _i^{}+2\hfill & \text{for }i=g\hfill \\ \lambda _i^{}2\hfill & \text{for }i=k+1\hfill \\ \lambda _i^{}\hfill & \text{else}\hfill \end{array}$$

defines a partition $`\mu `$. A weight $`e`$ is a map

$$\begin{array}{ccc}\hfill [1,\lambda _1]& \text{}& [0,2]\hfill \\ \hfill j& \text{}& e_j\hfill \end{array}$$

that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=2`$ and that maps each $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$. The set of weights is denoted by $`E`$. A pattern $`\mathrm{\Xi }`$ of weight $`e`$ is a subset $`\mathrm{\Xi }[1,2]\times [g,k+1]`$ such that

$$\mathrm{\#}(\mathrm{\Xi }([1,2]\times \{j\}))=e_j$$

for $`j[g,k+1]`$. A double path $`\gamma `$ of weight $`e`$ is an injection from a pattern $`\mathrm{\Xi }`$ of weight $`e`$ to $`[\lambda ][\mu ]`$ of the form

$$\begin{array}{ccc}\hfill \mathrm{\Xi }& \text{}& [\lambda ][\mu ]\hfill \\ \hfill i\times j& \text{}& \overline{\gamma }(j,i)\times j\hfill \end{array}$$

such that

$$\begin{array}{cc}\overline{\gamma }(g,i)=\lambda _g^{}+i\hfill & \text{for }i[1,2]\hfill \\ \overline{\gamma }(k+1,1)<\overline{\gamma }(k+1,2).\hfill & \end{array}$$

Sometimes, we denote its pattern by $`\mathrm{\Xi }_\gamma :=\mathrm{\Xi }`$. Its sign is given by $`\epsilon _\gamma :=(1)^{\overline{\gamma }(k+1,1)+\overline{\gamma }(k+1,2)}`$, not to be confused with the sign of a permutation. The set of double paths of weight $`e`$ is denoted by $`\dot{\mathrm{\Gamma }}(e)`$.

A double path $`\gamma `$ gives rise to a place operation in the following manner. Let

$$\begin{array}{ccc}\hfill [0,\lambda _{k+1}^{}]& \text{}& [0,\mu _{k+1}^{}]\hfill \\ \hfill i& \text{}& \mathrm{\#}\left([1,i]\backslash \{\overline{\gamma }(k+1,1),\overline{\gamma }(k+1,2)\}\right)\hfill \\ \hfill \mathrm{min}(\phi ^1(\{j\}))& \text{}& j.\hfill \end{array}$$

Given a weight $`eE`$, we define an operation of sets

$$\begin{array}{ccccc}\hfill \dot{\mathrm{\Gamma }}(e)& \times & T^\lambda \hfill & \text{}& T^\mu \hfill \\ \hfill \gamma & \times & [a]\hfill & \text{}& [a^\gamma ]\hfill \end{array}$$

by

$$\begin{array}{cccc}\hfill a_{j,i}^\gamma & :=& a_{j,i}\text{ for }i\times j[\mu ]\backslash (\mathrm{\Xi })\gamma \text{ and }jk+1,\hfill & \\ \hfill a_{j,\overline{\gamma }(j,i)}^\gamma & :=& a_{j^{},\overline{\gamma }(j^{},i)}\text{ for }i[1,2]\text{ and for }j[g,k]\text{,}\hfill & \\ & & \text{where }j^{}\text{ is minimal in }[j+1,k+1]\text{ with }i\times j^{}\mathrm{\Xi },\hfill & \\ \hfill a_{k+1,i}^\gamma & :=& a_{k+1,\psi (i)}\text{ for }i[1,\mu _{k+1}^{}].\hfill & \end{array}$$

We define a $`\text{Z}𝒮_n`$-linear map

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill [a]& \text{}& \underset{\gamma \dot{\mathrm{\Gamma }}(e)}{}a^\gamma \epsilon _\gamma .\hfill \end{array}$$

###### Example 2.1

For example, consider the case $`\lambda =(7,7,7,4)`$, $`\mu =(7,6,6,4,1,1)`$, $`g=1`$, $`k=6`$. Let $`e=(2,1,1,1,2,0,2)`$, and let $`\gamma `$ be the (non-ordered) double path of weight $`e`$ given pictorially by

a ‘u’ indicating the $`\gamma `$-image of some $`1\times j`$, a ‘v’ indicating the $`\gamma `$-image of some $`2\times j`$. The operation of $`\gamma `$ yields e.g.

I.e. the double path $`\gamma `$ subsequently pushes $`23\text{}19\text{}15\text{}6\text{}`$ and $`25\text{}18\text{}9\text{}`$.

###### Lemma 2.2 (path switch)

For $`q[g+1,k+1]`$, we dispose of an involution

$$\begin{array}{ccccc}\hfill [1,2]& \times & [g,k+1]\hfill & \text{}& [1,2]\times [g,k+1]\hfill \\ \hfill i& \times & j\hfill & \text{}& \{\begin{array}{cccc}\hfill i(1,2)& \times & j\hfill & \text{for }j[g+1,q1]\hfill \\ \hfill i& \times & j\hfill & \text{else}\hfill \end{array}.\hfill \end{array}$$

The composition $`\iota _p\gamma `$ of this involution, restricted to $`\iota _p^1(\mathrm{\Xi }_\gamma )`$, with a double path $`\gamma `$ furnishes a double path which we denote by $`\iota _p\gamma `$, being a slight abuse of notation. So $`\mathrm{\Xi }_{\iota _p\gamma }=\iota _p^1(\mathrm{\Xi }_\gamma )`$.

Let $`[a]T^\lambda `$, $`eE`$, let $`p[g+1,k]`$ such that $`e_p=2`$, let $`\gamma \dot{\mathrm{\Gamma }}(e)`$, $`u:=a_{p,\overline{\gamma }(p,1)}`$ and $`v:=a_{p,\overline{\gamma }(p,2)}`$. We assert the following equalities.

$$\begin{array}{cccc}\hfill \text{(i)}& \hfill a^\gamma (u,v)& =& a^{\iota _p\gamma }\hfill \\ \hfill \text{(ii)}& \hfill a^{\iota _{p+1}\gamma }& =& a^\gamma \hfill \\ \hfill \text{(iii)}& \hfill ([a]f_e^{\prime \prime })(u,v)& =& [a]f_e^{\prime \prime }\hfill \end{array}$$

The operation of the double path $`\iota _p\gamma `$ on $`[a]`$ can be performed using the operation of $`\gamma `$, but with entries $`u`$ and $`v`$ interchanged, and, moreover, with entries placed by $`\gamma `$ in column $`g`$ interchanged, yielding the sign in (i). Analoguously (ii). Since composition with $`\iota _p`$ is an involution on $`\dot{\mathrm{\Gamma }}(e)`$, multiplication by $`(u,v)`$ attaches a sign to $`[a]f_e^{\prime \prime }`$ by (i), whence (iii).

###### Proposition 2.3

Let $`eE`$. There is a factorization

$$(F^\lambda \text{}S^\mu )=(F^\lambda \text{}M^{\lambda ^{},}\text{}S^\mu ).$$

We need to show that a signed column transposition $`[a]+[a](u,v)`$, $`[a]`$ a $`\lambda `$-tableau, $`p1`$, $`u,va_p`$, $`uv`$, vanishes under $`f_e^{\prime \prime }`$, for which we may assume $`p`$ to lie in $`[g+1,k+1]`$. We abbreviate the double path image of $`\gamma `$ in $`[a]`$ by $`I_\gamma :=((\mathrm{\Xi })\gamma )[a]`$.

Case $`p[g+1,k]`$.

Subcase $`u,vI_\gamma `$. See (2.2, iii).

Subcase $`u=:a_{p,\overline{\gamma }(p,i)}I_\gamma `$, $`v=:a_{p,l}I_\gamma `$. Abbreviating by $`\tau _\gamma `$ the transposition that interchanges the elements $`\overline{\gamma }(p,i)\times p`$ and $`l\times p`$ of $`[\lambda ][\mu ]`$, we conclude from

$$a^\gamma (u,v)=a^{\gamma \tau _\gamma }$$

that the sum over these summands, multiplied by $`(u,v)`$, yields minus the sum over the summands of the subcase $`uI_\gamma ,vI_\gamma `$. In fact, $`\gamma \text{}\gamma \tau _\gamma `$ is a bijection between the sets of double paths occurring in these subcases which preserves the sign.

Subcase $`u,vI_\gamma `$. $`a^\gamma (u,v)=a^\gamma `$ shows these summands to yield zero.

Case $`p=k+1`$. The arguments of the case $`p[g+1,k]`$ work in the subcases $`u,vI_\gamma `$ and $`u,vI_\gamma `$ as well.

Subcase $`u=:a_{k+1,\overline{\gamma }(k+1,i)}I_\gamma `$, $`v=:a_{k+1,l}I_\gamma `$. Writing the transposition $`\tau _\gamma `$ as above, we conclude from

$$a^\gamma (u,v)=(1)^{\overline{\gamma }(p,i)l+1}a^{\gamma \tau _\gamma }$$

that the sum over these summands yields minus the result of the sum over the summands of the subcase $`uI_\gamma ,vI_\gamma `$. In fact, $`\gamma \text{}\gamma \tau _\gamma `$ is a bijection between the sets of double paths occurring in these subcases which changes the sign by $`\epsilon _{\gamma \tau _\gamma }/\epsilon _\gamma =(1)^{l\overline{\gamma }(p,i)}`$.

### 2.2 Morphism, unreduced version

We shall show the vanishing, modulo our modulus, of the required Garnir relations. Rather than giving short versions of all calculations, we give full versions, but only of the two ‘large’ cases (A.1, A.2), and only in Appendix A.

For $`i[g,k+1]`$, we let

$$X_i:=(\lambda _i^{}i)(\lambda _{k+1}^{}(k+1))$$

and denote $`X_i^{(j)}:=(X_i+j1)!/(X_i1)!`$, $`j[0,2]`$. Let $`M^{\lambda ^{},}\text{}S^\mu `$ be the $`\text{Z}𝒮_n`$-linear map defined by

$$f^{}:=\underset{eE}{}\left(\underset{i[g+1,k]}{}X_i^{(2e_i)}\right)f_e^{}.$$

Let $`[a]`$ be a $`\lambda `$-tableau, $`p[g,k]`$, $`\xi a_p`$, $`s:=\mathrm{\#}\xi `$, $`\overline{\xi }:=a_p\backslash \xi `$ and $`\eta a_{p+1}`$, $`t:=\mathrm{\#}\eta `$, $`\overline{\eta }:=a_{p+1}\backslash \eta `$ such that $`s+t=\lambda _p^{}+1`$. Denote $`u:=\mathrm{\#}\overline{\eta }=\lambda _{p+1}^{}t`$.

###### Lemma 2.4 (cf. (A.1))

Suppose $`g<p<k`$ and $`s,t2`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

We fix a map

$$\begin{array}{ccc}\hfill [1,\lambda _1]\backslash \{p,p+1\}& \text{}& [0,2]\hfill \\ \hfill j& \text{}& \stackrel{~}{e}_j\hfill \end{array}$$

that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=2`$, and that maps $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$. For $`\alpha ,\beta [0,2]`$, we denote by $`\stackrel{~}{e}\alpha \beta `$ be the prolongation of $`\stackrel{~}{e}`$ to $`[1,\lambda _1]`$ defined by $`\stackrel{~}{e}\alpha \beta |_{[1,\lambda _1]\backslash \{p,p+1\}}:=\stackrel{~}{e}`$, $`(\stackrel{~}{e}\alpha \beta )_p:=\alpha `$ and $`(\stackrel{~}{e}\alpha \beta )_{p+1}:=\beta `$. We contend that

$$\underset{\alpha ,\beta [0,2]}{}X_p^{(2\alpha )}X_{p+1}^{(2\beta )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}=0,$$

from which the lemma ensues.

There exist elements $`x,y\xi `$, $`xy`$, $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)`$, we let $`x_\gamma :=a_{j,\overline{\gamma }(j,1)}`$, where $`j[p+2,k+1]`$ is minimal with $`1\times j\mathrm{\Xi }_\gamma `$, and $`y_\gamma :=a_{j,\overline{\gamma }(j,2)}`$, where $`j[p+2,k+1]`$ is minimal with $`2\times j\mathrm{\Xi }_\gamma `$. I.e. we pick the entries $`x_\gamma ,y_\gamma `$ that ‘cross the columns’ $`p`$ and $`p+1`$ under the operation of $`\gamma `$. We write

$$\begin{array}{ccc}\hfill U_\gamma & :=& (s+t2)!^1a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\xi \eta )\hfill \\ \hfill V_{1,\gamma }& :=& (s+t1)!^1a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(\xi \eta )\hfill \\ \hfill V_{2,\gamma }& :=& (s+t1)!^1a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(y_\gamma ,y,y^{})(\xi \eta ),\hfill \end{array}$$

and let

$$\begin{array}{ccc}A\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_\gamma \underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ B\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_\gamma (1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ C_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_\gamma (z,x_\gamma )\hfill \\ C_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_\gamma (z,y_\gamma )\hfill \\ D\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\underset{w\overline{\xi }}{}(w,y_\gamma )\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\underset{w\overline{\xi }}{}(w,x_\gamma )\hfill \\ H\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\underset{w^{}\overline{\eta }}{}(w^{},y_\gamma )\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\underset{w^{}\overline{\eta }}{}(w^{},x_\gamma )\hfill \\ F_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\hfill \\ F_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }.\hfill \end{array}$$

Calculations carried out in (A.1) yield the following table.

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}22}^{}& =& 2(su)A+(su)(su1)B+2(su)(su+1)D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}12}^{}& =& 2A2(su)B2(su+1)D+2(su+1)H\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}02}^{}& =& B2H\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}21}^{}& =& 2A+2(su1)B(su1)(C_1+C_2)+4(su)D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}11}^{}& =& 2B+(C_1+C_2)2D+2H+(su)(F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}01}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}20}^{}& =& B(C_1+C_2)+2D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}10}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}00}^{}& =& 0\hfill \end{array}$$

We note that $`su=X_pX_{p+1}`$ and evaluate the linear combination

$$\begin{array}{c}\underset{\alpha ,\beta [0,2]}{}X_p^{(2\alpha )}X_{p+1}^{(2\beta )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}\hfill \\ \begin{array}{cccc}=& 1\hfill & 1\hfill & (2(X_pX_{p+1})A+(X_pX_{p+1})(X_pX_{p+1}1)B\hfill \\ & & & +2(X_pX_{p+1})(X_pX_{p+1}+1)D)\hfill \\ +& X_p\hfill & 1\hfill & (2A2(X_pX_{p+1})B2(X_pX_{p+1}+1)D\hfill \\ & & & +2(X_pX_{p+1}+1)H)\hfill \\ +& X_p(X_p+1)\hfill & 1\hfill & \left(B2H\right)\hfill \\ +& 1\hfill & X_{p+1}\hfill & (2A+2(X_pX_{p+1}1)B\hfill \\ & & & (X_pX_{p+1}1)(C_1+C_2)+4(X_pX_{p+1})D)\hfill \\ +& X_p\hfill & X_{p+1}\hfill & (2B+(C_1+C_2)2D+2H\hfill \\ & & & +(X_pX_{p+1})(F_1+F_2))\hfill \\ +& X_p(X_p+1)\hfill & X_{p+1}\hfill & \left((F_1+F_2)\right)\hfill \\ +& 1\hfill & X_{p+1}(X_{p+1}+1)\hfill & \left(B(C_1+C_2)+2D\right)\hfill \\ +& X_p\hfill & X_{p+1}(X_{p+1}+1)\hfill & \left((F_1+F_2)\right)\hfill \\ +& X_p(X_p+1)\hfill & X_{p+1}(X_{p+1}+1)\hfill & \left(0\right)\hfill \\ =& 0.\hfill & & \end{array}\hfill \end{array}$$

###### Lemma 2.5

Suppose $`g<p<k`$ and $`s=\lambda _p^{}`$, $`t=1`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

Concerning the map $`\stackrel{~}{e}`$ and its prolongations, as well as concerning the integers $`x_\gamma `$, $`y_\gamma `$, we continue to use the notation of (2.4). We fix such a map $`\stackrel{~}{e}`$ and need to show that

$$\underset{\alpha ,\beta [0,2]}{}X_p^{(2\alpha )}X_{p+1}^{(2\beta )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}=0.$$

There exist elements $`x,y\xi `$, $`xy`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)`$, we write

$$\begin{array}{ccc}\hfill V_{1,\gamma }& :=& \frac{1}{(s1)!}a^\gamma \epsilon _\gamma (y_\gamma ,y,\eta )(\xi \eta )\hfill \\ \hfill V_{2,\gamma }& :=& \frac{1}{(s1)!}a^\gamma \epsilon _\gamma (x_\gamma ,x,\eta )(\xi \eta )\hfill \end{array}$$

and let

$$\begin{array}{ccc}A\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\underset{w^{}\overline{\eta }}{}(x_\gamma ,x,w^{})\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\underset{w^{}\overline{\eta }}{}(y_\gamma ,y,w^{})\hfill \\ C_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }(x_\gamma ,x)\hfill \\ C_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }(y_\gamma ,y)\hfill \end{array}$$

$$\begin{array}{ccc}H\hfill & :=& s^1\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\underset{w^{}\overline{\eta }}{}(x_\gamma ,w^{})\hfill \\ & =& s^1\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\underset{w^{}\overline{\eta }}{}(y_\gamma ,w^{}).\hfill \\ F_1\hfill & :=& s^1\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\hfill \\ F_2\hfill & :=& s^1\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\hfill \end{array}$$

Calculations similar to those of (A.1) yield the following table, to be compared to the table of (2.4).

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}22}^{}& =& 2(su)A\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}12}^{}& =& 2A+2(su+1)H\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}02}^{}& =& 2H\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}21}^{}& =& 2A(su1)(C_1+C_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}11}^{}& =& (C_1+C_2)+2H+(su)(F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}01}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}20}^{}& =& (C_1+C_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}10}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}00}^{}& =& 0\hfill \end{array}$$

###### Lemma 2.6

Suppose $`g<p<k`$ and $`s=1`$, $`t=\lambda _p^{}=\lambda _{p+1}^{}`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

Concerning $`\stackrel{~}{e}`$, $`x_\gamma `$, $`y_\gamma `$, we continue to use the notation of (2.4). We fix such a map $`\stackrel{~}{e}`$ and need to show that

$$\underset{\alpha ,\beta [0,2]}{}X_p^{(2\alpha )}X_{p+1}^{(2\beta )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}=0.$$

There exist elements $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)`$, we write

$$\begin{array}{ccc}\hfill U_{1,\gamma }& :=& \frac{1}{(t1)!}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,\xi ,x^{})(y_\gamma ,y^{})(\xi \eta )\hfill \\ \hfill U_{2,\gamma }& :=& \frac{1}{(t1)!}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_\gamma ,\xi ,y^{})(x_\gamma ,x^{})(\xi \eta )\hfill \\ \hfill V_{1,\gamma }& :=& \frac{1}{t!}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,\xi ,x^{})(\xi \eta )\hfill \\ \hfill V_{2,\gamma }& :=& \frac{1}{t!}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(y_\gamma ,\xi ,y^{})(\xi \eta )\hfill \end{array}$$

and let

$$\begin{array}{ccc}B\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_{1,\gamma }(1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_{2,\gamma }(1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ C_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_{1,\gamma }(z,x_\gamma )\hfill \end{array}$$

$$\begin{array}{ccc}C_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}U_{2,\gamma }(z,y_\gamma )\hfill \\ D\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\underset{w\overline{\xi }}{}(w,y_\gamma )\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\underset{w\overline{\xi }}{}(w,x_\gamma )\hfill \\ F_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{1,\gamma }\hfill \\ F_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}00)}{}V_{2,\gamma }\hfill \end{array}$$

Calculations similar to those of (A.1), using the Garnir relation $`B=C_1+C_2`$, yield the following table, to be compared to the table of (2.4).

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}22}^{}& =& 4D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}12}^{}& =& 2B4D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}02}^{}& =& B\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}21}^{}& =& 4D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}11}^{}& =& B2D+(F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}01}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}20}^{}& =& 2D\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}10}^{}& =& (F_1+F_2)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}00}^{}& =& 0\hfill \end{array}$$

Note that $`su=X_pX_{p+1}=1`$.

###### Lemma 2.7

Suppose $`g<p=k`$ and $`s,t2`$, $`\eta =a_{k+1,[1,t]}`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

We fix a map

$$\begin{array}{ccc}\hfill [1,\lambda _1]\backslash \{k\}& \text{}& [0,2]\hfill \\ \hfill j& \text{}& \stackrel{~}{e}_j\hfill \end{array}$$

that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=2`$, and that maps $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$. For $`\alpha [0,2]`$, $`\stackrel{~}{e}\alpha `$ denotes the map which prolongs $`\stackrel{~}{e}`$ to $`[1,\lambda _1]`$ via $`(\stackrel{~}{e}\alpha )_k=\alpha `$. We need to show that

$$\underset{\alpha [0,2]}{}X_k^{(2\alpha )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha }^{}=0.$$

There exist elements $`x,y\xi `$, $`xy`$, $`z\overline{\xi }`$, which we choose and fix. Let $`x^{}:=a_{g+1,1}`$ and $`y^{}:=a_{g+1,2}`$, so that $`x^{},y^{}\eta `$. For $`v,wa_{k+1}`$, $`vw`$, we denote

$$\dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,v,w):=\{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)|a_{k+1,\overline{\gamma }(k+1,1)}=v,a_{k+1,\overline{\gamma }(k+1,2)}=w\}$$

and let

$$\begin{array}{ccc}A\hfill & :=& \frac{1}{(s+t2)!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x,x^{})(y,y^{})(\xi \eta )\underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ B\hfill & :=& \frac{1}{(s+t2)!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}a^\gamma \epsilon _\gamma \hfill \\ & & (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x,x^{})(y,y^{})(\xi \eta )(1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ D\hfill & :=& \frac{1}{(s+t1)!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}\underset{w\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash w,\eta \backslash \{x^{},y^{}\})(x,x^{})(w,y^{})(\xi \eta )\hfill \\ & =& \frac{1}{(s+t1)!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}\underset{w\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash w,\eta \backslash \{x^{},y^{}\})(y,y^{})(w,x^{})(\xi \eta )\hfill \\ H\hfill & :=& \frac{1}{(s+t1)!}\underset{w^{}\overline{\eta }}{}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},w^{})}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x,x^{})(\xi \eta )\hfill \\ & =& \frac{1}{(s+t1)!}\underset{w^{}\overline{\eta }}{}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,y^{},w^{})}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(y,y^{})(\xi \eta ).\hfill \end{array}$$

Calculations similar to those of (A.1) yield the following table.

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& \frac{1}{2}\left(2(su)A+(su)(su1)B+2(su)(su+1)D\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& \frac{1}{2}\left(2A2(su)B2(su+1)D+2(su+1)H\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& \frac{1}{2}\left(B2H\right)\hfill \end{array}$$

Comparison with the table in (2.4) is possible since $`X_{k+1}=0`$.

###### Lemma 2.8

Suppose $`g<p=k`$ and $`s=\lambda _k^{}`$, $`t=1`$, $`\eta =a_{k+1,1}`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

Concerning $`\stackrel{~}{e}`$ and $`\dot{\mathrm{\Gamma }}`$, we continue to use the notation of (2.7). We fix such a map $`\stackrel{~}{e}`$. There exist elements $`x,y\xi `$, $`xy`$, which we choose and fix. We let

$$\begin{array}{ccc}A\hfill & :=& \frac{1}{(s1)!}\underset{w^{}\overline{\eta }}{}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,\eta ,w^{})}{}a^\gamma \epsilon _\gamma (x,\eta )(y,w^{})(\xi \eta )\hfill \\ H\hfill & :=& \frac{1}{s!}\underset{w^{}\overline{\eta }}{}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,\eta ,w^{})}{}a^\gamma \epsilon _\gamma (x,\eta )(\xi \eta )\hfill \end{array}$$

Calculations similar to those of (A.1) yield the following table, to be compared to the table of (2.7).

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& \frac{1}{2}\left(2(su)A\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& \frac{1}{2}\left(2A+2(su+1)H\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& \frac{1}{2}\left(2H\right)\hfill \end{array}$$

###### Lemma 2.9

Suppose $`g<p=k`$ and $`s=1`$, $`t=\lambda _k^{}=\lambda _{k+1}^{}`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

Concerning $`\stackrel{~}{e}`$ and $`\dot{\mathrm{\Gamma }}`$, we continue to use the notation of (2.7). We fix such a map $`\stackrel{~}{e}`$. There exist elements $`x^{}y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. We let

$$\begin{array}{ccc}B\hfill & :=& \frac{1}{(t1)!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(\xi \eta )(1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ D\hfill & :=& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}\underset{w\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash w,\eta \backslash \{x^{},y^{}\})(\xi ,x^{})(w,y^{})(\xi \eta )\hfill \\ & =& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},a,x^{},y^{})}{}\underset{w\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash w,\eta \backslash \{x^{},y^{}\})(\xi ,y^{})(w,x^{})(\xi \eta ).\hfill \end{array}$$

Calculations similar to those of (A.1) yield the following table.

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& \frac{1}{2}\left(4D\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& \frac{1}{2}\left(2B4D\right)\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& \frac{1}{2}\left(B\right)\hfill \end{array}$$

In comparison with the table of (2.7), we note that $`su=1`$.

###### Lemma 2.10 (cf. (A.2))

Suppose $`g=p<k`$ and $`s,t2`$. There exist elements $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we let $`x_\gamma :=a_{j,\overline{\gamma }(j,1)}`$, where $`j[g+2,k+1]`$ is minimal with $`1\times j\mathrm{\Xi }_\gamma `$, and $`y_\gamma :=a_{j,\overline{\gamma }(j,2)}`$, where $`j[g+2,k+1]`$ is minimal with $`2\times j\mathrm{\Xi }_\gamma `$. I.e. we pick the entries $`x_\gamma ,y_\gamma `$ that ‘cross the column’ $`g+1`$ under the operation of $`\gamma `$. The set of maps

$$\begin{array}{ccc}\hfill [1,\lambda _1]\backslash \{g+1\}& \text{}& [0,2]\hfill \\ \hfill j& \text{}& \stackrel{~}{e}_j\hfill \end{array}$$

that send $`g`$ and $`k+1`$ to $`\stackrel{~}{e}_g=\stackrel{~}{e}_{k+1}=2`$, and that map $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$, is denoted by $`\stackrel{~}{E}`$. For $`\stackrel{~}{e}\stackrel{~}{E}`$ and $`\beta [0,2]`$, we denote by $`\stackrel{~}{e}\beta `$ the prolongation of $`\stackrel{~}{e}`$ to $`[g,k+1]`$ by $`(\stackrel{~}{e}\beta )_{g+1}=\beta `$. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we write

$$U_\gamma :=a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})$$

and let

$$\begin{array}{ccc}A_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma \underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (z,x_\gamma )\hfill \\ C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (z,y_\gamma ).\hfill \end{array}$$

We obtain

$$\begin{array}{c}\hfill G_{[a],\xi ,\eta }^{}f^{}=(X_g+2)\underset{\stackrel{~}{e}\stackrel{~}{E}}{}\left(\underset{j[g+2,k]}{}X_j^{(2\stackrel{~}{e}_j)}\right)(2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(X_g+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\\ \hfill X_{g+1}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})).\end{array}$$

Calculations carried out in (A.2) yield the following table.

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& 2(su+2)A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(su+2)(su+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& 2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+2(su+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}(su+1)(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& B_{[a],\xi ,\eta ,\stackrel{~}{e}}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \end{array}$$

We note that $`su=X_gX_{g+1}`$ and evaluate the linear combination

$$\begin{array}{c}\underset{\beta [0,2]}{}X_{g+1}^{(2\beta )}G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}\beta }^{}\hfill \\ \begin{array}{ccc}=& 1\hfill & (2(X_gX_{g+1}+2)A_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ & & +(X_gX_{g+1}+2)(X_gX_{g+1}+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \\ +& X_{g+1}\hfill & (2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+2(X_gX_{g+1}+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ & & (X_gX_{g+1}+1)(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}))\hfill \\ +& X_{g+1}(X_{g+1}+1)\hfill & \left(B_{[a],\xi ,\eta ,\stackrel{~}{e}}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\right)\hfill \end{array}\hfill \\ =2(X_g+2)A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(X_g+2)(X_g+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}X_{g+1}(X_g+2)(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}).\hfill \end{array}$$

###### Lemma 2.11

Suppose $`g=p<k`$ and $`s=\lambda _g^{}`$, $`t=1`$. Concerning $`\stackrel{~}{e}`$, $`x_\gamma `$, $`y_\gamma `$, we let the notation be as in (2.10). For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we write

$$\begin{array}{ccc}\hfill V_{1,\gamma }& :=& a^\gamma \epsilon _\gamma (y_\gamma ,\eta )\hfill \\ \hfill V_{2,\gamma }& :=& a^\gamma \epsilon _\gamma (x_\gamma ,\eta )\hfill \end{array}$$

and let

$$\begin{array}{ccc}A_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}V_{1,\gamma }\underset{w^{}\overline{\eta }}{}(x_\gamma ,w^{})\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}V_{2,\gamma }\underset{w^{}\overline{\eta }}{}(y_\gamma ,w^{})\hfill \\ B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& 0\hfill \\ C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}V_{1,\gamma }\hfill \\ C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}V_{2,\gamma }.\hfill \end{array}$$

We obtain

$$\begin{array}{c}\hfill G_{[a],\xi ,\eta }^{}f^{}=(X_g+2)\underset{\stackrel{~}{e}\stackrel{~}{E}}{}\left(\underset{j[g+2,k]}{}X_j^{(2\stackrel{~}{e}_j)}\right)(2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(X_g+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\\ \hfill X_{g+1}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})).\end{array}$$

Calculations similar to those of (A.2) yield the following table, to be compared to the table of (2.10).

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& 2(su+2)A_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& 2A_{[a],\xi ,\eta ,\stackrel{~}{e}}(su+1)(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& (C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \end{array}$$

###### Lemma 2.12

Suppose $`g=p<k`$ and $`s=1`$, $`t=\lambda _g^{}=\lambda _{g+1}^{}`$. Concerning $`\stackrel{~}{e}`$, $`x_\gamma `$, $`y_\gamma `$, we let the notation be as in (2.10). There exist elements $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we write

$$U_\gamma :=a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})$$

and let

$$\begin{array}{ccc}A_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& 0\hfill \\ B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \\ C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (x_\gamma ,z)\hfill \\ C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)}{}U_\gamma (y_\gamma ,z).\hfill \end{array}$$

We obtain

$$\begin{array}{c}\hfill G_{[a],\xi ,\eta }^{}f^{}=(X_g+2)\underset{\stackrel{~}{e}\stackrel{~}{E}}{}\left(\underset{j[g+2,k]}{}X_j^{(2\stackrel{~}{e}_j)}\right)(2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(X_g+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\\ \hfill X_{g+1}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})).\end{array}$$

Calculations similar to those of (A.2) yield the following table.

$$\begin{array}{ccc}\hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}2}^{}& =& 6B_{[a],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}1}^{}& =& 4B_{[a],\xi ,\eta ,\stackrel{~}{e}}2(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}))\hfill \\ \hfill G_{[a],\xi ,\eta }^{}f_{\stackrel{~}{e}0}^{}& =& B_{[a],\xi ,\eta ,\stackrel{~}{e}}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}})\hfill \end{array}$$

In comparison to the table of (2.10), we note that $`X_gX_{g+1}=1`$.

###### Lemma 2.13

Suppose $`g=p=k`$ and $`s1`$, $`t2`$, $`\eta =a_{g+1,[1,t]}`$. Let $`\gamma ^1`$ be the double path defined by $`\gamma _{g+1,1}^1:=1`$, $`\gamma _{g+1,2}^1:=2`$. Let $`x^{}:=a_{g+1,1}`$ and $`y^{}:=a_{g+1,2}`$, so that $`x^{},y^{}\eta `$. There exists an element $`z\overline{\xi }`$, which we choose and fix. We write

$$U:=a^{\gamma ^1}\epsilon _{\gamma ^1}(\overline{\xi }\backslash z,\eta \backslash \{x,y\})$$

and denote

$$\begin{array}{ccc}\hfill A& :=& U\underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ \hfill B& :=& U(1\underset{w\overline{\xi }\backslash z}{}(w,z))\hfill \end{array}$$

We obtain

$$G_{[a],\xi ,\eta }^{}f^{}=\frac{1}{2}\left((X_g+1)(X_g+2)B+2(X_g+2)A\right),$$

whence the map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$ modulo $`X_g+2`$ in case $`X_g+2`$ is odd, modulo $`(X_g+2)/2`$ in case $`X_g+2`$ is even.

Calculations similar to those of (A.2) yield

$$G_{[a],\xi ,\eta }^{}f^{}=\frac{1}{2}\left((su+1)(su+2)B+2(su+2)A\right).$$

Note that $`su=X_g`$.

###### Lemma 2.14

Suppose $`g=p=k`$ and $`s=\lambda _g^{}`$, $`t=1`$, $`\eta =a_{g+1,1}`$. For $`i[2,\lambda _{g+1}^{}]`$, we let $`\gamma ^i`$ be the double path defined by $`\gamma _{g+1,1}^i:=1`$, $`\gamma _{g+1,2}^i:=i`$. Let

$$A:=\underset{i[2,\lambda _{g+1}^{}]}{}a^{\gamma ^i}\epsilon _{\gamma ^i}$$

We obtain

$$G_{[a],\xi ,\eta }^{}f^{}=(X_g+2)A,$$

whence the map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$ modulo $`X_g+2`$.

Calculations similar to those of (A.2) yield

$$G_{[a],\xi ,\eta }^{}f^{}=(su+2)A.$$

###### Remark 2.15

Suppose $`g=p=k`$. The application $`M^{\lambda ^{},}\text{}S^\mu `$ maps $`\{(\stackrel{ˇ}{a}_\lambda )^{}\}^{}`$ to a linear combination with coefficients $`\pm 1`$ of standard $`\mu `$-polytabloids.

See Subsection 1.1 for the definition of the $`\lambda `$-tableau $`[\stackrel{ˇ}{a}_\lambda ]`$.

We summarize.

###### Proposition 2.16 (provisional version of (2.37))

Suppose $`g<k`$. The $`\text{Z}𝒮_n`$-linear map $`M^{\lambda ^{},}\text{}S^\mu `$ factors over

where $`m^{}`$ is an integer that divides the element

$$\begin{array}{c}\hfill G_{[a],\xi ,\eta }^{}f^{}=(X_g+2)\underset{\stackrel{~}{e}\stackrel{~}{E}}{}\left(\underset{j[g+2,k]}{}X_j^{(2\stackrel{~}{e}_j)}\right)(2A_{[a],\xi ,\eta ,\stackrel{~}{e}}+(X_g+1)B_{[a],\xi ,\eta ,\stackrel{~}{e}}\\ \hfill X_{g+1}(C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}+C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}))\end{array}$$

of $`S^\mu `$ for any $`\lambda `$-tableau $`[a]`$ and any pair of subsets $`\xi a_g`$, $`\eta a_{g+1}`$ such that $`\mathrm{\#}\xi +\mathrm{\#}\eta =\lambda _p^{}+1`$. The set $`\stackrel{~}{E}`$ is defined in (2.10). The elements $`A_{[a],\xi ,\eta ,\stackrel{~}{e}}`$, $`B_{[a],\xi ,\eta ,\stackrel{~}{e}}`$, $`C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}`$, $`C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}`$ of $`S^\mu `$ are defined in (2.10, 2.11, 2.12), the definition depending on whether $`\xi `$ resp. $`\eta `$ contains $`2`$ elements.

This is the conclusion we draw from (2.10, 2.11, 2.12) concerning the modulus $`m^{}`$ and from (2.4, 2.5, 2.6, 2.7, 2.8, 2.9) concerning the vanishing of the remaining Garnir relations under $`f^{}`$. The assertion is provisional in that we have neither specified $`m^{}`$ nor commented on the possible divisibility of $`M^{\lambda ^{},}\text{}S^\mu `$ yet.

###### Proposition 2.17 (to be included in (2.37), cf. (4.9), cf. \[K 99, 4.4.3\])

Suppose $`g=k`$. The $`\text{Z}𝒮_n`$-linear map $`M^{\lambda ^{},}\text{}S^\mu `$ factors over

where $`m:=X_g+2`$ in case $`X_g`$ is odd and $`m:=(X_g+2)/2`$ in case $`X_g`$ is even. The resulting morphism $`S^\lambda \text{}S^\mu /m`$ is of order $`m`$ in $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$.

The assertions follow by (2.13, 2.14, 2.15).

We recall that in this case the double path formalism yields

$$\begin{array}{ccc}\hfill M^{\lambda ^{},}& \text{}& S^\mu \hfill \\ \hfill \{a^{}\}^{}& \text{}& \underset{1v<w\lambda _{g+1}^{}}{}(1)^{v+w}a^{v,w},\hfill \end{array}$$

where we let

$$\begin{array}{ccc}\hfill [0,\lambda _{g+1}^{}]& \text{}& [0,\mu _{g+1}^{}]\hfill \\ \hfill i& \text{}& \mathrm{\#}\left([1,i]\backslash \{v,w\}\right)\hfill \\ \hfill \mathrm{min}(\phi ^1(\{j\}))& \text{}& j\hfill \end{array}$$

in order to define the $`\mu `$-tableau $`[a^{v,w}]`$ by

$$\begin{array}{cccc}\hfill a_{j,i}^{v,w}& :=& a_{j,i}\hfill & \text{for }(j[1,\lambda _1]\backslash \{g,g+1\}\text{ and }i[1,\mu _j^{}])\text{ or }(j=g\text{ and }i[1,\lambda _g^{}])\hfill \\ \hfill a_{g,\lambda _g^{}+1}^{v,w}& :=& a_{g+1,v}\hfill & \\ \hfill a_{g,\lambda _g^{}+2}^{v,w}& :=& a_{g+1,w}\hfill & \\ \hfill a_{g+1,i}^{v,w}& :=& a_{g+1,\psi (i)}\hfill & \text{for }i[1,\mu _{g+1}^{}].\hfill \end{array}$$

### 2.3 Morphism, reduced version

To achieve that the image of our morphism from $`M^{\lambda ^{},}`$ to $`S^\mu `$ gets is not contained in some $`tS^\mu S^\mu `$, $`t2`$, we have to divide $`f^{}`$ by a factor of redundancy.

We assume $`g<k`$ throughout this section. For $`gpqk+1`$, we let $`𝒳[p,q]`$ denote the set of partial patterns, i.e. the set of intermediate sets

$$[1,2]\times (\{g,k+1\}[p,q])\mathrm{\Xi }[1,2]\times [p,q].$$

For $`p>q`$ we let $`𝒳[p,q]:=\mathrm{}`$. For $`prsq`$ and $`\mathrm{\Xi }𝒳[p,q]`$, we let $`\mathrm{\Xi }_{[r,s]}:=\mathrm{\Xi }([1,2]\times [r,s])𝒳[r,s]`$. The partial weight of $`\mathrm{\Xi }`$ is defined to be the map

$$\begin{array}{ccc}\hfill [p,q]& \text{}& [0,2]\hfill \\ \hfill r& \text{}& e_{\mathrm{\Xi },r}=\mathrm{\#}\mathrm{\Xi }_{[r,r]}.\hfill \end{array}$$

Sometimes, we shall write this map as a tuple $`e_\mathrm{\Xi }=(e_{\mathrm{\Xi },p},\mathrm{},e_{\mathrm{\Xi },q})`$. An ordered double path of weight $`e`$ is a double path $`\gamma `$ that in addition satisfies the condition

$$\overline{\gamma }(p,1)<\overline{\gamma }(p,2)\text{ for }p[g+1,k].$$

Given a pattern $`\mathrm{\Xi }𝒳[g,k+1]`$, we let $`\dot{\mathrm{\Gamma }}(\mathrm{\Xi })`$ be the set of double paths $`\gamma `$ of partial pattern $`\mathrm{\Xi }_\gamma =\mathrm{\Xi }`$, and we let $`\stackrel{}{\mathrm{\Gamma }}(\mathrm{\Xi })`$ be the set of ordered double paths $`\gamma `$ of partial pattern $`\mathrm{\Xi }_\gamma =\mathrm{\Xi }`$. We define $`\text{Z}𝒮_n`$-linear maps

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill [a]& \text{}& \underset{\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma \hfill \\ \hfill [a]& \text{}& \underset{\gamma \stackrel{}{\mathrm{\Gamma }}(\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma .\hfill \end{array}$$

We allow ourselves to write e.g. for the partial pattern $`\{1\times u,\mathrm{\hspace{0.33em}2}\times u,\mathrm{\hspace{0.33em}2}\times (u+1)\}𝒳[u,u+1]`$ etc. as long as no confusion concerning $`u`$ can arise. So ‘$`+`$’ stands for ‘coordinate contained’ and ‘$``$’ stands for ‘coordinate not contained’.

Suppose given a $`\lambda `$-tableau $`[a]`$ and a double path $`\gamma `$. We let $`x_\gamma :=a_{j,\overline{\gamma }(j,1)}`$, $`j[g+2,k+1]`$ being minimal with $`1\times j\mathrm{\Xi }_\gamma `$, and $`y_\gamma :=a_{j,\overline{\gamma }(j,2)}`$, $`j[g+2,k+1]`$ being minimal with $`2\times j\mathrm{\Xi }_\gamma `$. We fix positions $`uv[1,\lambda _{g+1}^{}]`$. For a $`\lambda `$-tableau $`[a]`$ and a partial pattern $`\mathrm{\Xi }𝒳[g+2,k+1]`$, we write $`x^{}:=a_{g+1,u}`$, $`y^{}:=a_{g+1,v}`$ and let

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill [a]& \text{}& \underset{\gamma \dot{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})\hfill \\ \hfill [a]& \text{}& \underset{\gamma \dot{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})\hfill \\ \hfill [a]& \text{}& \underset{\gamma \dot{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (y_\gamma ,y^{})\hfill \\ \hfill [a]& \text{}& \underset{\gamma \stackrel{}{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})\hfill \end{array}$$

$$\begin{array}{ccc}\hfill [a]& \text{}& \underset{\gamma \stackrel{}{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})\hfill \\ \hfill [a]& \text{}& \underset{\gamma \stackrel{}{\mathrm{\Gamma }}(\text{}\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma (y_\gamma ,y^{}).\hfill \end{array}$$

For instance, in this definition, it is understood that $`\text{}=\{1\times g,\mathrm{\hspace{0.33em}2}\times g\}[1,2]\times [g,g+1]`$. We note that $`A_\mathrm{\Xi }^{u,v}=A_\mathrm{\Xi }^{v,u}`$.

For $`i[0,1]`$, let $`L(i):=\{j[g+1,k1]|\lambda _{j+1}^{}=\lambda _j^{}i\}`$ be the set of $`i`$-steps. Let

$$[g,k]=L(0)L(1)\overline{L}$$

be a disjoint union. A partial pattern $`\mathrm{\Xi }𝒳[p,q]`$, $`gpqk+1`$, is called bulky in case there is some $`u[p,q1]L(0)`$ such that

$$\mathrm{\Xi }_{[u,u+1]}\{\text{},\text{},\text{},\text{},\text{},\text{},\text{}\},$$

or in case there is some $`u[p,q1]L(1)`$ such that

$$\mathrm{\Xi }_{[u,u+1]}=\text{}.$$

Let $`𝒳_{\text{nb}}[p,q]𝒳[p,q]`$ be the subset of nonbulky partial patterns in $`𝒳[p,q]`$.

###### Lemma 2.18

Let $`m^{}`$ be a number dividing the elements

$$\begin{array}{cc}\hfill (X_g+2)2& \underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}(\underset{j[g+2,k]}{}X_j^{(2e_{\mathrm{\Xi },j})})A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill (X_g+2)(X_g+1)& \underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}(\underset{j[g+2,k]}{}X_j^{(2e_{\mathrm{\Xi },j})})A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill (X_g+2)X_{g+1}& \underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}(\underset{j[g+2,k]}{}X_j^{(2e_{\mathrm{\Xi },j})})(A_\mathrm{\Xi }^{u,}+A_\mathrm{\Xi }^{,u})\hfill \end{array}$$

of $`\text{Hom}_{\text{Z}𝒮_n}(F^\lambda ,S^\mu )`$ for any choice of $`uv[1,\lambda _{g+1}^{}]`$ resp. of $`u[1,\lambda _{g+1}^{}]`$. Then there is a factorization

$$(M^{\lambda ^{},}\text{}S^\mu \text{}S^\mu /m^{})=(M^{\lambda ^{},}\text{}S^\lambda \text{}S^\mu /m^{}).$$

Let $`[a]`$ be a $`\lambda `$-tableau, let $`\xi a_g`$, $`\eta a_{g+1}`$ such that $`\mathrm{\#}\xi +\mathrm{\#}\eta =\lambda _p^{}+1`$. Let $`\stackrel{~}{e}`$ be a map from $`[1,\lambda _1]\backslash \{g+1\}`$ to $`[0,2]`$ that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=2`$, and that maps $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$.

Case $`\mathrm{\#}\xi 2`$, $`\mathrm{\#}\eta 2`$. Writing $`a_{g+1,u}:=x^{}`$ and $`a_{g+1,v}:=y^{}`$, we obtain, in the notation of (2.10), including choices invoved,

$$\begin{array}{ccc}\hfill A_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(\underset{w^{}\overline{\eta }}{}(w^{},z))\right)A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill B_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(1\underset{w\overline{\xi }\backslash z}{}(w,z))\right)A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(x^{},z)\right)A_\mathrm{\Xi }^{,v}\hfill \\ & =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(y^{},z)\right)A_\mathrm{\Xi }^{,u}\hfill \\ \hfill C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(y^{},z)\right)A_\mathrm{\Xi }^{u,},\hfill \end{array}$$

where the multitransposition $`(\overline{\xi }\backslash z,\eta \backslash \{x,y\})`$ is to be read as with respect to and independent of a choice of a bijection (cf. Section 1.2).

Case $`\mathrm{\#}\xi =\lambda _g^{}`$, $`\mathrm{\#}\eta =1`$. Writing $`\{a_{g+1,u}\}:=\eta `$, we obtain, in the notation of (2.11),

$$\begin{array}{ccc}\hfill A_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\underset{v[1,\lambda _{g+1}^{}],a_{g+2,v}\overline{\eta }}{}\left([a]\right)A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill B_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& 0\hfill \\ \hfill C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a]\right)A_\mathrm{\Xi }^{,u}\hfill \\ \hfill C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a]\right)A_\mathrm{\Xi }^{u,}.\hfill \end{array}$$

Case $`\mathrm{\#}\xi =1`$, $`\mathrm{\#}\eta =\lambda _g^{}=\lambda _{g+1}^{}`$. Writing $`a_{g+1,u}:=x^{}`$ and $`a_{g+1,v}:=y^{}`$, we obtain, in the notation of (2.12),

$$\begin{array}{ccc}\hfill A_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& 0\hfill \\ \hfill B_{[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(1\underset{w\overline{\xi }\backslash z}{}(w,z))\right)A_\mathrm{\Xi }^{u,v}\hfill \\ \hfill C_{1,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(x^{},z)\right)A_\mathrm{\Xi }^{,v}\hfill \\ & =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(y^{},z)\right)A_\mathrm{\Xi }^{,u}\hfill \\ \hfill C_{2,[a],\xi ,\eta ,\stackrel{~}{e}}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1],e_\mathrm{\Xi }=\stackrel{~}{e}|_{[g+2,k+1]}}{}\left([a](\overline{\xi }\backslash z,\eta \backslash \{x,y\})(y^{},z)\right)A_\mathrm{\Xi }^{u,},\hfill \end{array}$$

where $`(\overline{\xi }\backslash z,\eta \backslash \{x,y\})`$ is to be read as with respect to and independent of a choice of a bijection.

The lemma now follows from (2.16).

###### Lemma 2.19

Let $`\mathrm{\Xi }𝒳_{\text{nb}}[g,k+1]`$. The image

$$[\stackrel{ˇ}{a}_\lambda ]\stackrel{}{f}_\mathrm{\Xi }^{\prime \prime }$$

is a linear combination of standard $`\mu `$-polytabloids with coefficients $`\pm 1`$. For a pair of different nonbulky patterns, the corresponding pair of sets of occurring standard $`\mu `$-polytabloids is disjoint.

The summand $`\pm (\stackrel{ˇ}{a}_\lambda )^\gamma `$ is a standard polytabloid after having ordered its columns downwards increasingly provided $`\mathrm{\Xi }_\gamma `$ is not bulky. Different ordered double paths yield different fillings of the columns, hence the coefficients remain $`\pm 1`$ and, moreover, the asserted disjointness holds.

For $`gpqk`$, a tuple of integers $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[p,q]}`$ is called a reduced tuple of coefficients if the following conditions hold, expressed using the involution introduced in (2.2).

* For $`\mathrm{\Xi }𝒳[p,q]`$, the invariance $`\vartheta _{(\mathrm{\Xi })\iota _{q+1}}=\vartheta _\mathrm{\Xi }`$ holds. Given, in addition, $`r[p,q]`$ with $`e_{\mathrm{\Xi },r}=2`$, the invariance $`\vartheta _{(\mathrm{\Xi })\iota _{r+1}}=\vartheta _\mathrm{\Xi }`$ holds.
* In case $`\mathrm{\Xi }𝒳[p,q]`$ is bulky, the coefficient $`\vartheta _\mathrm{\Xi }`$ vanishes, in case not, it does not vanish.

We note that the tuple $`({\displaystyle \underset{j[p,q]}{}}X_j^{(2e_{\mathrm{\Xi },j})})_{\mathrm{\Xi }𝒳[g,p]}`$ satisfies $`(\text{I}_{p,q})`$ but in general not $`(\text{II}_{p,q})`$. Let it be remarked that e.g. $`(\text{II}_{p,p+1})`$ implies that $`\vartheta _{\text{}}\vartheta _{\text{}}`$ if $`p[g+1,k1]`$ and $`\lambda _p^{}=\lambda _{p+1}^{}`$, whereas $`e_{\text{}}e_{\text{}}`$.

###### Lemma 2.20

Let $`p[g+1,k]`$, let $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,p]}`$ (resp. $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g+2,p]}`$) be a tuple of integers satisfying $`(\text{I}_{g,p})`$ (resp. $`(\text{I}_{g+2,p})`$), let $`\mathrm{\Phi }𝒳[p+1,k+1]`$. Then

$$\begin{array}{ccc}\hfill \underset{\mathrm{\Xi }𝒳[g,p]}{}\vartheta _\mathrm{\Xi }f_{\mathrm{\Xi }\mathrm{\Phi }}^{\prime \prime }& =& \underset{\mathrm{\Xi }𝒳[g,p]}{}\left(_{j[g+1,p]}e_{\mathrm{\Xi },j}!\right)\vartheta _\mathrm{\Xi }\stackrel{}{f}_{\mathrm{\Xi }\mathrm{\Phi }}^{\prime \prime }\hfill \\ \hfill \underset{\mathrm{\Xi }𝒳[g+2,p]}{}\vartheta _\mathrm{\Xi }A_{\mathrm{\Xi }\mathrm{\Phi }}^{u,v}& =& \underset{\mathrm{\Xi }𝒳[g+2,p]}{}\left(_{j[g+2,p]}e_{\mathrm{\Xi },j}!\right)\vartheta _\mathrm{\Xi }\stackrel{}{A}_{\mathrm{\Xi }\mathrm{\Phi }}^{u,v},\hfill \end{array}$$

respectively, and likewise for $`A^{u,}`$, $`A^{,v}`$ instead of $`A^{u,v}`$.

This follows, separately for each partial weight $`e_\mathrm{\Xi }`$, from (2.2, ii).

###### Lemma 2.21

Let $`pL(0)`$, $`\mathrm{\Psi }𝒳[g,p1]`$, $`\mathrm{\Phi }𝒳[p+2,k+1]`$. We obtain

$$\begin{array}{cccc}\hfill \text{(i)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }2f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }2f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }+2f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(ii)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(iii)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{(\mathrm{\Psi })\iota _p\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(iii}\text{}\text{)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{(\mathrm{\Psi })\iota _p\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(iv)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(iv}\text{}\text{)}& \hfill f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0\hfill \\ \hfill \text{(v)}& \hfill 2f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }& =& 0.\hfill \end{array}$$

Equation (i) still holds in case $`pL(1)`$. Equations (i-v) continue to hold for $`pL(0)[g+2,k1]`$, $`f^{\prime \prime }`$ replaced by $`A^{u,v}`$, $`A^{u,}`$ or $`A^{,v}`$ and $`\mathrm{\Psi }𝒳[g,p1]`$ replaced by $`\mathrm{\Psi }𝒳[g+2,p1]`$.

Equation (i) ensues from the Garnir relation that arises, for a given double path $`\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi }\text{}\mathrm{\Phi })`$, from the join of the elements in column $`p`$ in the image of $`\gamma `$ with column $`p+1`$.

We deduce (ii) from the Garnir relation that arises, for a given double path $`\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi }\text{}\mathrm{\Phi })`$, from the join of a single element in column $`p`$ in the image of $`\gamma `$ with column $`p+1`$, using (2.2 ii) to obtain $`f_{(\mathrm{\Psi })\iota _p\text{}\mathrm{\Phi }}^{\prime \prime }=f_{(\mathrm{\Psi }\text{}\mathrm{\Phi })\iota _{p+1}}^{\prime \prime }=f_{\mathrm{\Psi }\text{}\mathrm{\Phi }}^{\prime \prime }`$.

Assertion (iii) follows using the Garnir relation that arises, for a given double path $`\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi }\text{}\mathrm{\Phi })`$, from the join of the element in column $`p`$ in the image of $`\gamma `$ with column $`p+1`$.

Similarly, (iv) can be seen via the Garnir relation that arises, for a given double path $`\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi }\text{}\mathrm{\Phi })`$, to the join of the element in column $`p`$ in the image of $`\gamma `$ with column $`p+1`$.

As a consequence of (i) and (ii), we obtain (v).

###### Lemma 2.22

Suppose $`g+1L(0)`$, $`\mathrm{\Phi }𝒳[g+3,k+1]`$. We obtain

$$\begin{array}{cccc}\hfill \text{(i)}& \hfill A_\text{}\mathrm{\Phi }^{u,v}2A_\text{}\mathrm{\Phi }^{u,v}2A_\text{}\mathrm{\Phi }^{u,v}+2A_\text{}\mathrm{\Phi }^{u,v}& =& 0\hfill \\ \hfill \text{(ii)}& \hfill A_\text{}\mathrm{\Phi }^{u,v}A_\text{}\mathrm{\Phi }^{u,v}A_\text{}\mathrm{\Phi }^{u,v}& =& 0\hfill \\ \hfill \text{(iii)}& \hfill A_\text{}\mathrm{\Phi }^{u,}A_\text{}\mathrm{\Phi }^{u,}A_\text{}\mathrm{\Phi }^{,u}& =& 0\hfill \\ \hfill \text{(iii}\text{}\text{)}& \hfill A_\text{}\mathrm{\Phi }^{,v}A_\text{}\mathrm{\Phi }^{v,}A_\text{}\mathrm{\Phi }^{,v}& =& 0\hfill \\ \hfill \text{(iv)}& \hfill A_\text{}\mathrm{\Phi }^{u,}A_\text{}\mathrm{\Phi }^{u,}& =& 0\hfill \\ \hfill \text{(iv}\text{}\text{)}& \hfill A_\text{}\mathrm{\Phi }^{,v}A_\text{}\mathrm{\Phi }^{,v}& =& 0\hfill \\ \hfill \text{(v)}& \hfill 2A_\text{}\mathrm{\Phi }^{u,v}A_\text{}\mathrm{\Phi }^{u,v}& =& 0.\hfill \end{array}$$

Equation (i) still holds in case $`g+1L(1)`$.

###### Lemma 2.23

Let $`pL(0)`$, let $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,p]}`$ be a reduced tuple of coefficients, let $`\mathrm{\Phi }𝒳[p+2,k+1]`$. There is a reduced tuple of coefficients $`(\widehat{\vartheta }_{\widehat{\mathrm{\Xi }}})_{\widehat{\mathrm{\Xi }}𝒳[g,p+1]}`$ such that

$$\underset{\mathrm{\Xi }𝒳[g,p]}{}\underset{\xi 𝒳[p+1,p+1]}{}\vartheta _\mathrm{\Xi }\mathrm{\#}\xi !X_{p+1}^{(2\mathrm{\#}\xi )}\stackrel{}{f}_{\mathrm{\Xi }\xi \mathrm{\Phi }}^{\prime \prime }=\underset{\widehat{\mathrm{\Xi }}𝒳[g,p+1]}{}\widehat{\vartheta }_{\widehat{\mathrm{\Xi }}}\stackrel{}{f}_{\widehat{\mathrm{\Xi }}\mathrm{\Phi }}^{\prime \prime }$$

Fixing a partial pattern $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g,p1]`$, $`\widehat{\vartheta }`$ can be obtained from $`\vartheta `$ letting

$$\begin{array}{ccc}\hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill X_p(X_p+1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p+1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p+1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p1)(X_p+1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p1)(X_p+1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill 2\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p1)X_p\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}.\end{array}$$

In case $`pL(0)[g+2,k+1]`$, the assertion holds for $`\stackrel{}{A}^{u,v}`$, $`\stackrel{}{A}^{u,}`$ or $`\stackrel{}{A}^{,v}`$ instead of $`\stackrel{}{f}^{\prime \prime }`$, the reduced tuples of coefficients being indexed by $`\mathrm{\Xi }𝒳[g+2,p]`$ on the left hand side and by $`\widehat{\mathrm{\Xi }}𝒳[g+2,p+1]`$ on the right hand side.

Up to a rescaling, we rewrite summands of the left hand side using (2.21), to which the roman numbers refer. To this end, we substitute $`X_{p+1}=X_p1`$ and suppose $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g,p1]`$ be given.

$$\begin{array}{ccc}\hfill \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}((X_p1)X_pf_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }& & \\ \hfill +(X_p1)(f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }+f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })+f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })& \stackrel{\text{(ii, v)}}{=}& \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\frac{1}{2}X_p(X_p+1)f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }\hfill \\ \hfill \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\left((X_p1)X_pf_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }+(X_p1)f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }\right)& \stackrel{\text{(vi)}}{=}& \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}(X_p1)(X_p+1)f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }\hfill \\ \hfill \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}(\frac{1}{2}(X_p1)(f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }+f_{(\stackrel{ˇ}{\mathrm{\Xi }})\iota _p\text{}\mathrm{\Phi }}^{\prime \prime })& & \\ \hfill +f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })& \stackrel{\text{(iii)}}{=}& \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\frac{1}{2}(X_p+1)f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }\hfill \end{array}$$

For the last equation we made use of $`(\text{I}_{g,p})`$ in order to have $`\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\vartheta _{(\stackrel{ˇ}{\mathrm{\Xi }})\iota _p\text{}}`$.

The rewriting of the summands having in column $`p`$ proceeds by symmetry. Summands of index $`\mathrm{\Xi }=\stackrel{ˇ}{\mathrm{\Xi }}\text{}`$ remain unchanged. We pass to $`\stackrel{}{f}^{\prime \prime }`$ by inserting a factor $`2`$ where necessary. So we obtain an array of equations whose left hand sides add up to yield the left hand side of the equation we claimed. After substitution of $`\vartheta `$ by $`\widehat{\vartheta }`$ according to the table above, we sum up the corresponding right hand sides to obtain the right hand side of the equation we claimed.

The arguments are valid verbatim for $`\stackrel{}{A}^{u,v}`$, $`\stackrel{}{A}^{u,}`$, $`\stackrel{}{A}^{,v}`$ instead of $`\stackrel{}{f}^{\prime \prime }`$, except that we replace $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g,p1]`$ by $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g+2,p1]`$ and need to suppose that $`pg+2`$.

###### Lemma 2.24

Suppose $`g+1L(0)`$, let $`\mathrm{\Phi }𝒳[g+3,k+1]`$. We obtain

$$\begin{array}{ccc}\hfill \underset{\xi 𝒳[g+2,g+2]}{}\mathrm{\#}\xi !X_{g+2}^{(2\mathrm{\#}\xi )}\stackrel{}{A}_{\xi \mathrm{\Phi }}^{u,v}& =& X_{g+1}(X_{g+1}+1)\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,v}\hfill \\ \hfill \underset{\xi 𝒳[g+2,g+2]}{}\mathrm{\#}\xi !X_{g+2}^{(2\mathrm{\#}\xi )}(\stackrel{}{A}_{\xi \mathrm{\Phi }}^{u,}+\stackrel{}{A}_{\xi \mathrm{\Phi }}^{,u})& =& (X_{g+1}+1)(\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,}+\stackrel{}{A}_\text{}\mathrm{\Phi }^{,u})\hfill \\ & +& (X_{g+1}1)(X_{g+1}+1)(\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,}+\stackrel{}{A}_\text{}\mathrm{\Phi }^{,u})\hfill \end{array}$$

This results from (2.22) by the argument in (2.23).

###### Lemma 2.25

Let $`pL(1)`$, let $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,p]}`$ be a reduced tuple of coefficients, let $`\mathrm{\Phi }𝒳[p+2,k+1]`$. There is a reduced tuple of coefficients $`(\widehat{\vartheta }_{\widehat{\mathrm{\Xi }}})_{\widehat{\mathrm{\Xi }}𝒳[g,p+1]}`$ such that

$$\underset{\mathrm{\Xi }𝒳[g,p]}{}\underset{\xi 𝒳[p+1,p+1]}{}\vartheta _\mathrm{\Xi }\mathrm{\#}\xi !X_{p+1}^{(2\mathrm{\#}\xi )}\stackrel{}{f}_{\mathrm{\Xi }\xi \mathrm{\Phi }}^{\prime \prime }=\underset{\widehat{\mathrm{\Xi }}𝒳[g,p+1]}{}\widehat{\vartheta }_{\widehat{\mathrm{\Xi }}}\stackrel{}{f}_{\widehat{\mathrm{\Xi }}\mathrm{\Phi }}^{\prime \prime }$$

Fixing a partial pattern $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g,p1]`$, $`\vartheta `$ and $`\widehat{\vartheta }`$ are related by

$$\begin{array}{ccc}\hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill X_p(X_p3)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill X_p(X_p2)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill 2\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)(X_p1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill 2\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\end{array}$$

$$\begin{array}{ccc}\hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)(X_p1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill 2\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}=\widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\\ \hfill \widehat{\vartheta }_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& =& \hfill (X_p2)(X_p1)\vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}\end{array}$$

In case $`pL(1)[g+2,k+1]`$, the assertion holds for $`\stackrel{}{A}^{u,v}`$, $`\stackrel{}{A}^{u,}`$ or $`\stackrel{}{A}^{,v}`$ instead of $`f^{\prime \prime }`$, the reduced tuples of coefficients being indexed by $`\mathrm{\Xi }𝒳[g+2,p]`$ on the left and by $`\widehat{\mathrm{\Xi }}𝒳[g+2,p+1]`$ on the right hand side.

We rewrite summands of the left hand side using (2.21 i). To this end, we substitute $`X_{p+1}=X_p2`$ and suppose $`\stackrel{ˇ}{\mathrm{\Xi }}𝒳[g,p1]`$ be given.

$$\begin{array}{ccc}\hfill \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}((X_p2)(X_p1)f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }& & \\ \hfill +(X_p2)(f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }+f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })+f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })& \stackrel{\text{(i)}}{=}& \vartheta _{\stackrel{ˇ}{\mathrm{\Xi }}\text{}}((X_p2)X_p(f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime }+f_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })\hfill \\ & & \frac{1}{2}(X_p3)X_pf_{\stackrel{ˇ}{\mathrm{\Xi }}\text{}\mathrm{\Phi }}^{\prime \prime })\hfill \end{array}$$

All the other summands remain unchanged.

###### Lemma 2.26

Suppose $`g+1L(1)`$, let $`\mathrm{\Phi }𝒳[g+3,k+1]`$. We obtain

$$\underset{\xi 𝒳[g+2,g+2]}{}\mathrm{\#}\xi !X_{g+2}^{(2\mathrm{\#}\xi )}\stackrel{}{A}_{\xi \mathrm{\Phi }}^{u,v}=X_{g+1}(X_{g+1}3)\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,v}+X_{g+1}(X_{g+1}2)(\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,v}+\stackrel{}{A}_\text{}\mathrm{\Phi }^{u,v}).$$

This results from (2.22), cf. (2.25).

Henceforth, we denote by $`\vartheta `$ the tuple of tuples $`\vartheta =((\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,r]})_{r[g,k]}`$ of integers such that the entry $`\vartheta _{\text{}}=1`$ furnishes the tuple in case $`r=g`$, such that each entry $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,r]}`$ is a reduced tuple of coefficients, such that for $`r[g,k1]`$ the tuples $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,r]}`$ and $`(\vartheta _\mathrm{\Xi })_{\mathrm{\Xi }𝒳[g,r+1]}`$ are related by the formulas in (2.23) (resp. 2.25) in case $`rL(0)`$ (resp. $`rL(1)`$), and such that in the remaining case $`r\overline{L}`$ the equation

$$\vartheta _{\mathrm{\Xi }\xi }=\mathrm{\#}\xi !X_{r+1}^{(2\mathrm{\#}\xi )}\vartheta _\mathrm{\Xi }$$

holds ‘unchanged’ for $`\mathrm{\Xi }𝒳[g,r]`$, $`\xi 𝒳[r+1,r+1]`$. We reindex the tuple for $`r=k`$ by $`\vartheta _\mathrm{\Xi }:=\vartheta _{\mathrm{\Xi }_{[g,k]}}`$ for $`\mathrm{\Xi }𝒳[g,k+1]`$. Furthermore, for $`r,s[g+1,k]`$, we let

$$R_{[r,s]}:=\underset{i[0,1]}{}\underset{jL(i)[r,s]}{}X_j^{(2i)},$$

in which a product is to be read to be equal to $`1`$ if no factor is present. For $`r\text{Z}`$, we write

$$\dot{r}:=\mathrm{gcd}(r,2).$$

###### Lemma 2.27

Let $`g+1rqk`$ such that $`r1\overline{L}`$, let $`\mathrm{\Psi }𝒳[g,r1]`$, $`\mathrm{\Xi }𝒳[r,q]`$ such that $`\mathrm{\Psi }\mathrm{\Xi }`$ is nonbulky. Then $`\vartheta _\mathrm{\Psi }R_{[r,q1]}`$ divides $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}`$. If, moreover, $`\mathrm{\Xi }_{[r,r]}=\text{}`$, then $`2\vartheta _\mathrm{\Xi }R_{[r,q1]}`$ divides $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}`$.

We perform an induction on $`q`$ to prove the assertion that $`\vartheta _\mathrm{\Psi }R_{[r,q1]}`$ divides $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}`$ and that the quotient $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/(\vartheta _\mathrm{\Psi }R_{[r,q1]})`$ is divisible by $`X_q^{(2e_{\mathrm{\Xi },q})}`$. The factor $`2`$ in the second assertion then follows from the start of the induction.

At $`q=r`$, we have $`R_{[r,r1]}=1`$, and the quotient $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/(\vartheta _\mathrm{\Psi }R_{[r,q1]})`$ equals $`\mathrm{\#}\mathrm{\Xi }!X_r^{(2\mathrm{\#}\mathrm{\Xi })}`$ since $`r1\overline{L}`$.

We assume our assertion to hold for $`q1r`$. Let $`\stackrel{ˇ}{\mathrm{\Xi }}:=\mathrm{\Xi }_{[r,q1]}`$.

Case $`q1\overline{L}`$. We have $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}=\mathrm{\#}\mathrm{\Xi }_{[q,q]}!X_q^{(2e_{\mathrm{\Xi },q})}`$ and $`R_{[r,q1]}=R_{[r,q2]}`$.

Case $`q1L(0)`$. We have $`X_q=X_{q1}1`$ and $`R_{[r,q1]}=X_{q1}(X_{q1}+1)R_{[r,q2]}`$. By assumption, $`\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}/(R_{[r,q2]}\vartheta _\mathrm{\Psi })`$ is integral and divisible by $`X_{q1}^{(2e_{\mathrm{\Xi },q1})}`$. We need to see that

$$(\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}})(\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}/(R_{[r,q2]}\vartheta _\mathrm{\Psi }))$$

is divisible by $`X_{q1}(X_{q1}+1)X_q^{(2e_{\mathrm{\Xi },q})}`$. The left hand side factor of that expression taken from the table in (2.23), the assertion follows separately for each nonbulky subset $`\mathrm{\Xi }_{[q1,q]}`$.

Case $`q1L(1)`$. We have $`X_q=X_{q1}2`$ and $`R_{[r,q1]}=X_{q1}R_{[r,q2]}`$. By assumption, $`\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}/(R_{[r,q2]}\vartheta _\mathrm{\Psi })`$ is integral and divisible by $`X_{q1}^{(2e_{\mathrm{\Xi },q1})}`$. We need to see that

$$(\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}})(\vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}/(R_{[r,q2]}\vartheta _\mathrm{\Psi }))$$

is divisible by $`X_{q1}X_q^{(2e_{\mathrm{\Xi },q})}`$. The left hand side factor of that expression taken from the table in (2.25), the assertion follows separately for each nonbulky subset $`\mathrm{\Xi }_{[q1,q]}`$.

###### Lemma 2.28

Let $`g+1rqk`$ such that $`r1\overline{L}`$ and $`[r,q1]L(1)`$, let $`\mathrm{\Psi }𝒳_{\text{nb}}[g,r1]`$. As ideal of coefficients, we obtain

$$\left(\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}|\mathrm{\Xi }𝒳[r,q]\right)=\left(\vartheta _\mathrm{\Psi }R_{[r,q1]}\dot{X}_q\right)\text{Z}.$$

We shall perform the following calculations.

* For $`\mathrm{\Xi }𝒳_{\text{nb}}[r,q]`$ of partial weight $`e_\mathrm{\Xi }=(1,1,\mathrm{},1)`$, we have $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}=\vartheta _\mathrm{\Psi }R_{[r,q1]}X_q`$.
* For $`\mathrm{\Xi }𝒳_{\text{nb}}[r,q]`$ of partial weight $`e_\mathrm{\Xi }=(1,1,\mathrm{},1,2)`$, we have $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}=\vartheta _\mathrm{\Psi }R_{[r,q1]}2`$.
* Conversely, $`\vartheta _\mathrm{\Psi }R_{[r,q1]}2`$ or $`\vartheta _\mathrm{\Psi }R_{[r,q1]}X_q`$ divides $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}`$ for any $`\mathrm{\Xi }𝒳_{\text{nb}}[r,q]`$.

Ad (a). We perform an induction on $`q`$, starting with $`q=r`$, $`R_{[r,r1]}=1`$ and $`\vartheta _\mathrm{\Psi }\text{}=\vartheta _\mathrm{\Psi }\text{}=\vartheta _\mathrm{\Psi }X_q`$. Assume the assertion known for $`\stackrel{ˇ}{\mathrm{\Xi }}:=\mathrm{\Xi }_{[r,q1]}`$. We calculate

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}\text{}}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Psi }\stackrel{ˇ}{\mathrm{\Xi }}}(X_{q1}2)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,q2]}X_{q1}(X_{q1}2)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,q1]}X_q,\hfill \end{array}$$

dito for $`\xi \backslash \widehat{\mathrm{\Xi }}=\text{}`$

Ad (b). The argument for (a) can be applied, except that we obtain a factor $`2`$ instead of a factor $`(X_{q1}2)=X_q`$ in the last step.

Ad (c). We compare to the proof of (2.27). We need to show that there exists a step in the induction in which the quotient $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/(R_{[r,q1]}\vartheta _\mathrm{\Psi })`$ is divisible by $`2`$ or by $`X_q`$. In case $`e_{\mathrm{\Xi },r}=2`$, a factor $`2`$ enters at $`r`$ already, so that we may assume $`e_{\mathrm{\Xi },r}1`$. In case $`e_{\mathrm{\Xi },q}1`$, a factor $`X_q`$ enters at $`q`$, so that we may assume $`e_{\mathrm{\Xi },q}=2`$. Since $`\mathrm{\Xi }`$ is not bulky, necessarily or occurs as a subpattern of $`\mathrm{\Xi }`$. But then a factor $`2`$ enters at the induction step that adjoins the right column of that subpattern (2.25).

###### Lemma 2.29

Let $`g+1rqk`$ such that $`r1\overline{L}`$, $`[r,q1]L(0)L(1)`$ and $`[r,q1]L(0)\mathrm{}`$, let $`\mathrm{\Psi }𝒳_{\text{nb}}[g,r1]`$. As ideal of coefficients, we obtain

$$\left(\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}|\mathrm{\Xi }𝒳[r,q]\right)=\left(\vartheta _\mathrm{\Psi }R_{[r,q1]}\right)\text{Z}.$$

Let $`s:=\mathrm{max}(L(0)[r,q1])+1[r+1,q]`$. We shall show the following assertions.

* For $`t[s,q]`$ and a partial pattern $`\mathrm{\Xi }(q,t)𝒳_{\text{nb}}[r,q]`$ of partial weight

$$e_{\mathrm{\Xi }(q,t)}=\{\begin{array}{cc}2\hfill & \text{ for }j[s,t]\hfill \\ 1\hfill & \text{ for }j[r,q]\backslash [s,t],\hfill \end{array}$$

which is a slight abuse of notation since $`\mathrm{\Xi }(q,t)`$ does not only depend on $`q`$ and $`t`$, we have

$$\vartheta _{\mathrm{\Psi }\mathrm{\Xi }(q,t)}=\{\begin{array}{cc}\pm \vartheta _\mathrm{\Psi }R_{[r,q1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{q1}2)\hfill & \text{ for }t[s,q1]\hfill \\ \pm \vartheta _\mathrm{\Psi }R_{[r,q1]}\left(\underset{j[s,q1]}{}(X_j3)\right)\hfill & \text{ for }t=q,\hfill \end{array}$$

the sign $`\pm `$ indicating that the equation holds up to sign.
* In case $`s[r+1,q2]`$, for $`\mathrm{\Xi }𝒳_{\text{nb}}[r,q]`$ of partial weight

$$e_{\mathrm{\Xi },j}=\{\begin{array}{cc}2\hfill & \text{ for }j\{s,q\}\hfill \\ 1\hfill & \text{ for }j[r,q]\backslash \{s,q\},\hfill \end{array}$$

we have

$$\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}=\vartheta _\mathrm{\Psi }R_{[r,q1]}2.$$
* Assertions (a) and (b) imply the lemma.

Ad (c). The inclusion $``$ follows from (2.27). In case $`s=q`$, the lemma follows from $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }(q,q)}=\vartheta _\mathrm{\Psi }R_{[r,q1]}`$. In case $`s=q1`$, the lemma follows from

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(q,q1)}& =& \pm \vartheta _\mathrm{\Psi }R_{[r,q1]}(X_{q1}2)\hfill \\ \hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(q,q)}& =& \pm \vartheta _\mathrm{\Psi }R_{[r,q1]}(X_{q1}3).\hfill \end{array}$$

In case $`s[r+1,q2]`$, it suffices to show that

$$𝔞:=\left(2,\underset{j[s,q1]}{}(X_j3),\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{q1}2)|t[s,q1]\right)=(1).$$

We perform an induction on $`t`$ from $`t=q1`$ downwards to $`t=s`$, contending that $`{\displaystyle \underset{j[s,t1]}{}}(X_j3)𝔞`$. In fact,

$$\left(\underset{j[s,t]}{}(X_j3)\right)\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{q1}2)=\left(\underset{j[s,t1]}{}(X_j3)\right)(X_tX_{q1}1)$$

and $`X_tX_{q1}=2(tq+1)`$.

Ad (a). Let $`\overline{q}[r,q]`$. For $`t\overline{q}+1`$, let $`\mathrm{\Xi }(\overline{q},t)𝒳_{\text{nb}}[r,\overline{q}]`$ denote a partial pattern of the same partial weight as $`\mathrm{\Xi }(\overline{q},\overline{q})`$. We perform an induction on $`\overline{q}`$ running from $`r`$ to $`q`$ to prove the assertion that

$$\vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}=\{\begin{array}{cc}\vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}X_{\overline{q}}\hfill & \text{ for }\overline{q}[r,s1]\hfill \\ \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}\left(\underset{j[s,\overline{q}1]}{}(X_j3)\right)\hfill & \text{ for }\overline{q}[s,t]\hfill \\ \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2)\hfill & \text{ for }\overline{q}[t+1,q].\hfill \end{array}$$

To begin with, we recall our situation, viz. $`r<r+1st`$ and $`r\overline{q}`$.

For $`\overline{q}=r`$, we have $`R_{[r,r1]}=1`$ and $`e_{\mathrm{\Xi }(\overline{q},t),r}=1`$, whence we obtain

$$\vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}=\vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}X_{\overline{q}}$$

since $`r1\overline{L}`$.

Assume the assertion to be true for $`r\overline{q}1s2`$.

Case $`\overline{q}1L(0)`$. We calculate

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}& \stackrel{(\text{2.23})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}1)(X_{\overline{q}1}+1)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}1)(X_{\overline{q}1}+1)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}X_{\overline{q}}.\hfill \end{array}$$

Case $`\overline{q}1L(1)`$. We calculate

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},s)}& \stackrel{(\text{2.25})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}2)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}X_{\overline{q}}.\hfill \end{array}$$

Assume the assertion to be true for $`\overline{q}1=s1`$. Note that $`\overline{q}1L(0)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}& \stackrel{(\text{2.23})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}+1)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}+1)\hfill \\ & =& \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}.\hfill \end{array}$$

Assume the assertion to be true for $`s\overline{q}1t1`$. Note that $`\overline{q}1L(1)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}& \stackrel{(\text{2.25})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}X_{\overline{q}1}(X_{\overline{q}1}3)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}\left(\underset{j[s,\overline{q}2]}{}(X_j3)\right)X_{\overline{q}1}(X_{\overline{q}1}3)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}\left(\underset{j[s,\overline{q}1]}{}(X_j3)\right).\hfill \end{array}$$

Assume the assertion to be true for $`\overline{q}1=t`$. Note that $`\overline{q}1L(1)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}& \stackrel{(\text{2.25})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}\left(\underset{j[s,\overline{q}2]}{}(X_j3)\right)X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2).\hfill \end{array}$$

Assume the assertion to be true for $`t+1\overline{q}1`$. Note that $`\overline{q}1L(1)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q},t)}& \stackrel{(\text{2.25})}{=}& \vartheta _{\mathrm{\Psi }\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}2)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}2]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}2}2)(X_{\overline{q}1}2)\hfill \\ & =& \pm \vartheta _\mathrm{\Psi }R_{[r,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2).\hfill \end{array}$$

Ad (b). We modify the last step in the proof of the formula for $`\vartheta _{\mathrm{\Psi }\mathrm{\Xi }(q,s)}`$ in (a) according to (2.25), i.e. we replace the factor $`(X_{q1}2)`$ by the factor $`2`$.

A subinterval $`[r,s]`$ of $`[g+1,k]`$ is called connected if $`[r,s1]L(0)L(1)`$. A maximal connected subinterval with respect to the ordering given by inclusion is called a component. We write $`[g+1,k]`$ as a disjoint decomposition into components

$$[g+1,k]=\underset{\kappa [1,K]}{}[p(\kappa ),q(\kappa )],$$

where $`p(\kappa )q(\kappa )`$ for $`\kappa [1,K]`$, $`p(1)=g+1`$, $`q(\kappa )+1=p(\kappa +1)`$ for $`\kappa [1,K1]`$ and $`q(K)=k`$. So $`\{q(\kappa )|\kappa [1,K]\}=\overline{L}\backslash \{g\}`$.

###### Lemma 2.30

The ideal of coefficients may be factored as

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,k+1]\right)=\underset{\kappa [1,K]}{}𝔱_\kappa ,$$

where for $`\kappa [1,K]`$ we denote

$$𝔱_\kappa :=\left(\vartheta _{\mathrm{\Psi }\mathrm{\Xi }}/\vartheta _\mathrm{\Psi }|\mathrm{\Xi }𝒳[p(\kappa ),q(\kappa )]\right)\text{Z}$$

for some choice of a partial pattern $`\mathrm{\Psi }𝒳_{\text{nb}}[g,p(\kappa )1]`$, a choice which does not affect these quotients.

This factorization follows by the independence of choice just mentioned.

###### Proposition 2.31

Let the factor of redundancy be

$$R:=R_{[g+1,k]}\left(\underset{\stackrel{\kappa [1,K],}{[p(\kappa ),q(\kappa )1]L(1)}}{}\dot{X}_{q(\kappa )}\right).$$

The ideal of coefficients is given by

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,k+1]\right)=\left(R\right)\text{Z}.$$

In particular, the $`\text{Z}𝒮_n`$-linear map

$$M^{\lambda ^{},}\text{}S^\mu $$

is divisible exactly by $`R`$, i.e. any matrix representing $`f^{}`$ linearly over Z has $`R`$ as greatest common divisor of its entries.

The assertion on the ideal of coefficients ensues from (2.28, 2.29, 2.30). We conclude by (2.23, 2.25) that the linear combination

$$f^{\prime \prime }=\underset{\mathrm{\Xi }𝒳[g,k+1]}{}\left(\underset{j[g+1,k]}{}(e_{\mathrm{\Xi },j}!X_j^{(2e_{\mathrm{\Xi },j})})\right)\stackrel{}{f}_\mathrm{\Xi }^{\prime \prime }:F^\lambda \text{}S^\mu ,$$

cf. (2.20), can be rewritten as

$$f^{\prime \prime }=\underset{\mathrm{\Xi }𝒳[g,k+1]}{}\vartheta _\mathrm{\Xi }\stackrel{}{f}_\mathrm{\Xi }^{\prime \prime },$$

whose coefficients are divisible by $`R`$ and vanish for $`\mathrm{\Xi }`$ bulky. Applying $`f^{\prime \prime }`$ to the tableau $`[\stackrel{ˇ}{a}_\lambda ]`$, we see by (2.19) that $`f^{\prime \prime }`$ is divisible exactly by $`R`$. The assertion remains true for $`f^{}`$, being the factorization of $`f^{\prime \prime }`$ over the epimorphism $`F^\lambda \text{}M^{\lambda ^{},}`$.

The modulus remains to be taken under consideration.

###### Lemma 2.32

We may rewrite

$$\begin{array}{ccc}\hfill 2\underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}\left(\underset{j[g+2,k]}{}(e_{\mathrm{\Xi },j}!X_j^{(2e_{\mathrm{\Xi },j})})\right)\stackrel{}{A}_\mathrm{\Xi }^{u,v}& =& \underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}\vartheta _\text{}\mathrm{\Xi }\stackrel{}{A}_\mathrm{\Xi }^{u,v}\hfill \\ \hfill X_{g+1}\underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}\left(\underset{j[g+2,k]}{}(e_{\mathrm{\Xi },j}!X_j^{(2e_{\mathrm{\Xi },j})})\right)(\stackrel{}{A}_\mathrm{\Xi }^{u,}+\stackrel{}{A}_\mathrm{\Xi }^{,u})& & \\ \hfill =\underset{\mathrm{\Xi }𝒳[g+2,k+1]}{}\left(\vartheta _\text{}\mathrm{\Xi }\stackrel{}{A}_\mathrm{\Xi }^{u,}+\vartheta _\text{}\mathrm{\Xi }\stackrel{}{A}_\mathrm{\Xi }^{,u}\right)& & \end{array}$$

This ensues from (2.24, 2.23, 2.26, 2.25).

###### Lemma 2.33

Let $`g+1qk`$, let $`\xi =\text{}`$ or $`\xi =\text{}`$ in $`𝒳[g+1,g+1]`$. Suppose $`[g+1,q1]L(1)`$. As ideal of coefficients, we obtain

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,q],\mathrm{\Xi }_{[g+1,g+1]}=\xi \right)=\left(R_{[g+1,q1]}\dot{X}_q\right).$$

Consequently, by comparison with (2.31),

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,p+1],\mathrm{\Xi }_{[g+1,g+1]}=\xi \right)=\left(R\right).$$

Consider the partial weights indexing generators of the ideal of coefficients having no restriction imposed on column $`g+1`$. According to assertions (a) and (b) of the proof of (2.28), they can be chosen to have column $`g+1`$ equal to $`\xi `$.

###### Lemma 2.34

Let $`g+1qk`$, let $`\xi =\text{}`$ or $`\xi =\text{}`$ in $`𝒳[g+1,g+1]`$. Suppose $`[g+1,q1]L(0)L(1)`$ such that $`[g+1,q1]L(0)\mathrm{}`$. As ideal of coefficients we obtain

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,q],\mathrm{\Xi }_{[g+1,g+1]}=\xi \right)=\left(R_{[g+1,q1]}\right).$$

Whence, by comparison with (2.31), we have

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,p+1],\mathrm{\Xi }_{[g+1,g+1]}=\xi \right)=\left(R\right).$$

Consider the partial weights indexing generators of the ideal of coefficients having no restriction imposed on column $`g+1`$. According to assertions (a) and (b) of the proof of (2.29), they can be chosen to have column $`g+1`$ equal to $`\xi `$.

###### Lemma 2.35

Let $`g+1qk`$. Suppose $`[g+1,q1]L(1)`$. As ideal of coefficients, we obtain

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,q],\mathrm{\Xi }_{[g+1,g+1]}=\text{}\right)=\left(2R_{[g+1,q1]}\right).$$

Therefore, by comparison with (2.31),

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,k+1],\mathrm{\Xi }_{[g+1,g+1]}=\text{}\right)=\left(2R/\dot{X}_{q(1)}\right).$$

Note that $`\dot{X}_{q(1)}=\dot{X}_{g+1}`$.

We claim the following assertions.

* For $`t[g+1,q]`$, we let $`\mathrm{\Xi }(g,t)𝒳_{\text{nb}}[g,q]`$ denote a partial pattern of partial weight

$$e_{\mathrm{\Xi }(q,t),j}=\{\begin{array}{cc}2\hfill & \text{ for }j[g,t]\hfill \\ 1\hfill & \text{ for }j[t+1,q]\hfill \end{array}$$

and obtain

$$\vartheta _{\mathrm{\Xi }(q,t)}=\{\begin{array}{cc}\pm 2R_{[g+1,q1]}\left(\underset{j[g+1,t1]}{}(X_j3)\right)(X_{q1}2)\hfill & \text{ for }t[g+1,q1]\hfill \\ \pm 2R_{[g+1,q1]}\left(\underset{j[g+1,q1]}{}(X_j3)\right)\hfill & \text{ for }t=q.\hfill \end{array}$$
* In case $`qg+3`$, for $`\mathrm{\Xi }𝒳_{\text{nb}}[g,q]`$ of partial weight $`e_\mathrm{\Xi }=(2,2,1,\mathrm{},1,2)`$, we have

$$\vartheta _\mathrm{\Xi }=4R_{[g+1,q1]}.$$
* Assertions (a) and (b) imply the lemma.

(a, b, c) follow by the arguments of (2.29).

###### Lemma 2.36

Let $`g+1qk`$. Suppose $`[g+1,q1]L(0)L(1)`$, $`[g+1,q1]L(0)\mathrm{}`$. As ideal of coefficients, we obtain

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,q],\mathrm{\Xi }_{[g+1,g+1]}=\text{}\right)=\left(2R_{[g+1,q1]}\right).$$

So, by comparison with (2.31),

$$\left(\vartheta _\mathrm{\Xi }|\mathrm{\Xi }𝒳[g,k+1],\mathrm{\Xi }_{[g+1,g+1]}=\text{}\right)=\left(2R\right).$$

Denote

$$\begin{array}{cccc}\hfill p& :=& \mathrm{min}\left(([g+1,q1]L(1))\{q\}\right)\hfill & [g+1,q]\hfill \\ \hfill s& :=& \mathrm{max}\left([g+1,q1]L(0)\right)+1\hfill & [g+2,q]\hfill \end{array}$$

so that we are in the situation $`g<g+1psq`$, more precisely, $`p=s`$ or $`ps2`$.

We shall show the following assertions.

* For $`t[s,q]`$ and a partial pattern $`\mathrm{\Xi }(q,t)𝒳_{\text{nb}}[g,q]`$ of partial weight

$$e_{\mathrm{\Xi }(q,t),j}=\{\begin{array}{cc}2\hfill & \text{ for }j[g,p]\hfill \\ 1\hfill & \text{ for }j[p+1,s1]\hfill \\ 2\hfill & \text{ for }j[s,t]\hfill \\ 1\hfill & \text{ for }j[t+1,q],\hfill \end{array}$$

we obtain

$$\vartheta _{\mathrm{\Xi }(q,t)}=\{\begin{array}{cc}\pm 2R_{[g+1,q1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{q1}2)\hfill & \text{ for }t[s,q1]\hfill \\ \pm 2R_{[g+1,q1]}\left(\underset{j[s,q1]}{}(X_j3)\right)\hfill & \text{ for }t=q.\hfill \end{array}$$
* In case $`s[g+2,q2]`$, for $`\mathrm{\Xi }𝒳_{\text{nb}}[g,q]`$ of partial weight

$$e_{\mathrm{\Xi },j}=\{\begin{array}{cc}2\hfill & \text{ for }j[g,p]\hfill \\ 1\hfill & \text{ for }j[p+1,s1]\hfill \\ 2\hfill & \text{ for }j=s\hfill \\ 1\hfill & \text{ for }j[s+1,q1]\hfill \\ 2\hfill & \text{ for }j=q,\hfill \end{array}$$

we obtain

$$\vartheta _\mathrm{\Xi }=4R_{[g+1,q1]}.$$
* Assertions (a) and (b) imply the lemma.

Ad (c). As in (2.29).

Ad (a). We perform an induction on $`\overline{q}[g+1,q]`$ to prove

$$\vartheta _{\mathrm{\Xi }(\overline{q},t)}=\{\begin{array}{cc}2R_{[g+1,\overline{q}1]}\hfill & \text{ for }\overline{q}[g+1,p]\hfill \\ 2R_{[g+1,\overline{q}1]}X_{\overline{q}}\hfill & \text{ for }\overline{q}[p+1,s1]\hfill \\ \pm 2R_{[g+1,\overline{q}1]}\left(\underset{j[s,\overline{q}1]}{}(X_j3)\right)\hfill & \text{ for }\overline{q}[s,t]\hfill \\ \pm 2R_{[g+1,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2)\hfill & \text{ for }\overline{q}[t+1,q],\hfill \end{array}$$

where $`e_{\mathrm{\Xi }(\overline{q},t)}=e_{\mathrm{\Xi }(\overline{q},\overline{q})}`$ for $`t\overline{q}+1`$. We recall that $`g<g+1pst`$.

We begin the induction by remarking that for $`\overline{q}=g+1`$ we have $`R_{[g+1,g]}=1`$, $`e_{\mathrm{\Xi }(\overline{q},t),g+1}=2`$, and thus $`\vartheta _{\mathrm{\Xi }(\overline{q},t)}=2R_{[g+1,\overline{q}1]}`$, as required.

Case I, $`ps2`$.

Assume the assertion known for $`\overline{q}1[g+1,p1]`$. Note that $`\overline{q}1L(0)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.23}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}X_{\overline{q}1}(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}1]}.\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1=p`$. Note that $`\overline{q}1L(1)`$ since $`p<s`$, and that therefore $`[g+1,q1]L(1)\mathrm{}`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& 2R_{[g+1,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& 2R_{[g+1,\overline{q}1]}X_{\overline{q}}.\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1[p+1,s2]`$. In case $`\overline{q}1L(0)`$, we obtain

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.23}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}1)(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}1)(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}1]}X_{\overline{q}}.\hfill \end{array}$$

In case $`\overline{q}1L(1)`$, we obtain

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}2)\hfill \\ & =& 2R_{[g+1,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& 2R_{[g+1,\overline{q}1]}X_{\overline{q}}.\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1=s1`$. Note that $`\overline{q}1L(0)`$, so

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.23}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}2]}X_{\overline{q}1}(X_{\overline{q}1}+1)\hfill \\ & =& 2R_{[g+1,\overline{q}1]}.\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1[s,t1]`$. Note that $`\overline{q}1L(1)`$, thus

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}(X_{\overline{q}1}3))\hfill \\ & =& \pm 2R_{[g+1,\overline{q}2]}\left(\underset{j[s,\overline{q}2]}{}(X_j3)\right)X_{\overline{q}1}(X_{\overline{q}1}3)\hfill \\ & =& \pm 2R_{[g+1,\overline{q}1]}\left(\underset{j[s,\overline{q}1]}{}(X_j3)\right).\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1=t`$. Note that $`\overline{q}1L(1)`$, and consequently

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& \pm 2R_{[g+1,\overline{q}2]}\left(\underset{j[s,t1]}{}(X_j3)\right)X_{\overline{q}1}(X_{\overline{q}1}2)\hfill \\ & =& \pm 2R_{[g+1,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2).\hfill \end{array}$$

Assume the assertion known for $`\overline{q}1[t+1,q1]`$. Note that $`\overline{q}1L(1)`$, whence

$$\begin{array}{ccc}\hfill \vartheta _{\mathrm{\Xi }(\overline{q},t)}& \stackrel{\text{(}\text{2.25}\text{)}}{=}& \vartheta _{\mathrm{\Xi }(\overline{q}1,t)}(X_{\overline{q}1}2)\hfill \\ & =& \pm 2R_{[g+1,\overline{q}2]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}2}2)(X_{\overline{q}1}2)\hfill \\ & =& \pm 2R_{[g+1,\overline{q}1]}\left(\underset{j[s,t1]}{}(X_j3)\right)(X_{\overline{q}1}2).\hfill \end{array}$$

Case II, $`p=s`$. I.e. $`L(0)[g+1,q1]=[g+1,p1]`$, $`L(1)[g+1,q1]=[s,q1]`$.

The case $`\overline{q}[g+1,p]`$ follows from the argument for $`\overline{q}1[g+1,p1]`$ in Case I. The case $`\overline{q}[s+1,t]`$ follows from the argument for $`\overline{q}1[s,t1]`$ in Case I. The case $`\overline{q}[t+1,q]`$ follows from the arguments for $`\overline{q}1=t`$ and for $`\overline{q}1[t+1,q1]`$ in Case I.

Ad (b). We modify the last step in the proof of (a) according to (2.25), i.e. we replace the factor $`(X_{q1}2)`$ by the factor $`2`$.

###### Theorem 2.37

Suppose $`g<k`$. Let

$$m:=\{\begin{array}{ccc}X_g+2\hfill & \text{ if }\hfill & [p(1),q(1)1]L(1)\hfill \\ (X_g+2)/\mathrm{gcd}(2,X_g,X_{g+1})\hfill & \text{ if }\hfill & [p(1),q(1)1]L(1).\hfill \end{array}$$

Note that if $`g+1\overline{L}`$, the case $`\mathrm{}=[p(1),q(1)1]L(1)`$ applies. The integer

$$X_g+2=(\lambda _g^{}g)(\lambda _{k+1}^{}(k+1))+2$$

allows an interpretation as box shift length. The quotient $`f^{}/R`$ is integral and factors over

The morphism $`f`$ has order $`m`$ as an element of $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$. Recall that $`f^{}`$ maps

$$\begin{array}{ccc}\hfill M^{\lambda ^{},}& \text{}& S^\mu \hfill \\ \hfill \{a^{}\}^{}& \text{}& \underset{eE}{}(\underset{i[g+1,k]}{}X_i^{(2e_i)})\underset{\gamma \dot{\mathrm{\Gamma }}(e)}{}a^\gamma \epsilon _\gamma .\hfill \end{array}$$

The map $`f`$ operates accordingly, division taking place before going modulo $`m`$. Alternatively, by (2.31) we may write

$$\begin{array}{ccc}\hfill S^\lambda & \text{}& S^\mu /m\hfill \\ \hfill a& \text{}& \underset{\mathrm{\Xi }𝒳[g,k+1]}{}(\vartheta _\mathrm{\Xi }/R)\underset{\gamma \dot{\mathrm{\Gamma }}(\mathrm{\Xi })}{}a^\gamma \epsilon _\gamma ,\hfill \end{array}$$

the coefficients $`\vartheta _\mathrm{\Xi }/R`$ being integral.

Suppose $`g=k`$. The formula given for $`f^{}`$ in case $`g<k`$ holds in case $`g=k`$ as well, $`E`$ consisting of a single element, $`R=1`$ and $`m=(X_g+2)/\mathrm{gcd}(2,X_g)`$. We have the factorization diagram as above, the resulting morphism $`S^\lambda \text{}S^\mu /m`$ being of order $`m`$. Cf. (2.17).

Suppose $`g<k`$. By (2.31), the ideal generated by Z-linear matrix coefficients of $`f^{}/R`$ is $`(1)\text{Z}`$. In case $`[p(1),q(1)1]L(1)`$, the integer $`mR`$ divides each of the required expressions in (2.18) by (2.32) and by the ideals of coefficients calculated in (2.34, 2.36). In case $`[p(1),q(1)1]L(1)`$, the integer $`mR`$ divides each of the required expressions in (2.18) by (2.32) and by the ideals of coefficients calculated in (2.33, 2.35).

Suppose $`g=k`$. Concerning the assertion, we refer to (2.17) (alternatively, to 4.9). This case behaves as if the first component lay in $`L(1)`$ since $`X_{g+1}=0`$.

###### Remark 2.38

In the situation of (2.37), Carter and Payne \[CP 80\] have shown that

$$\text{Hom}_{K𝒮_n}(K_\text{Z}S^\lambda ,K_\text{Z}S^\mu )0,$$

$`K`$ being an infinite field of characteristic $`p`$ such that $`p`$ divides $`X_g+2`$ in case $`p3`$, respectively, such that $`4`$ divides $`X_g+2`$ in case $`p=2`$. This part of their result is recovered by (2.37).

###### Question 2.39

I do not know a description of $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /n!)`$ as an abelian group. See Section (2.4) for some examples.

### 2.4 Vertical examples

In the examples that follow, calculated by means of linear algebra (<sup>1</sup><sup>1</sup>1I thank the computer staff at the Fakultät für Mathematik in Bielefeld (‘root’) for kind cooperation.), we omit to denote the brackets that indicate polytabloids.

###### Example 2.40

Let $`\lambda =(3,3)`$, $`\mu =(2,2,1,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_6}(S^\lambda ,S^\mu /6!)\text{}\text{Hom}_{\text{Z}𝒮_6}(S^\lambda ,S^\mu /4)\text{Z}/4,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_6}(S^\lambda /4,S^\mu /4)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 4\hfill & 6\hfill \end{array}& \text{}& 2\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & \\ 4\hfill & \end{array}\left(\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 4\hfill \\ 3\hfill & \\ 6\hfill & \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 5\hfill \\ 4\hfill & \\ 6\hfill & \end{array}\right)\left(\begin{array}{cc}1\hfill & 6\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & \\ 3\hfill & \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 6\hfill \\ 5\hfill & \\ 4\hfill & \end{array}\right)2\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & \\ 6\hfill & \end{array}.\hfill \end{array}$$

###### Example 2.41

Let $`\lambda =(3,2,2)`$, $`\mu =(3,1,1,1,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_7}(S^\lambda ,S^\mu /7!)\text{}\text{Hom}_{\text{Z}𝒮_7}(S^\lambda ,S^\mu /6)\text{Z}/2\times \text{Z}/3,$$

generators of $`\text{Hom}_{\text{Z}𝒮_7}(S^\lambda /6,S^\mu /6)`$ being given by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 4\hfill & 7\hfill \\ 2\hfill & 5\hfill & \\ 3\hfill & 6\hfill & \end{array}& \text{}& 3\left(\underset{\left[b\right]\text{ standard }\mu \text{-tableau}}{}b\right)\hfill \end{array}$$

(cf. 3.19 below) and by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 4\hfill & 7\hfill \\ 2\hfill & 5\hfill & \\ 3\hfill & 6\hfill & \end{array}& \text{}& 2\left(\begin{array}{ccc}1\hfill & 6\hfill & 7\hfill \\ 2\hfill & & \\ 3\hfill & & \\ 4\hfill & & \\ 5\hfill & & \end{array}\begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & & \\ 3\hfill & & \\ 4\hfill & & \\ 6\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 4\hfill & 7\hfill \\ 2\hfill & & \\ 3\hfill & & \\ 5\hfill & & \\ 6\hfill & & \end{array}\right).\hfill \end{array}$$

###### Example 2.42

Let $`\lambda =(3,3,1,1)`$, $`\mu =(2,2,1,1,1,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /8!)\text{}\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /6)\text{Z}/6,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_8}(S^\lambda /6,S^\mu /6)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & 6\hfill & 8\hfill \\ 3\hfill & & \\ 4\hfill & & \end{array}& \text{}& 2\begin{array}{cc}1\hfill & 7\hfill \\ 2\hfill & 8\hfill \\ 3\hfill & \\ 4\hfill & \\ 5\hfill & \\ 6\hfill & \end{array}\left(\begin{array}{cc}1\hfill & 7\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & \\ 4\hfill & \\ 5\hfill & \\ 8\hfill & \end{array}+\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 7\hfill \\ 3\hfill & \\ 4\hfill & \\ 6\hfill & \\ 8\hfill & \end{array}\right)\left(\begin{array}{cc}1\hfill & 8\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & \\ 4\hfill & \\ 7\hfill & \\ 5\hfill & \end{array}+\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 8\hfill \\ 3\hfill & \\ 4\hfill & \\ 7\hfill & \\ 6\hfill & \end{array}\right)2\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & \\ 4\hfill & \\ 7\hfill & \\ 8\hfill & \end{array}.\hfill \end{array}$$

###### Example 2.43

Let $`\lambda =(4,4)`$, $`\mu =(3,3,1,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /8!)\text{}\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /5)\text{Z}/5,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_8}(S^\lambda /5,S^\mu /5)`$ is given by

$$\begin{array}{c}\begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill & 8\hfill \end{array}\text{}\hfill \\ 2\begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & 6\hfill & 8\hfill \\ 3\hfill & & \\ 4\hfill & & \end{array}\left(\begin{array}{ccc}1\hfill & 6\hfill & 7\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 5\hfill & & \\ 3\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 7\hfill \\ 2\hfill & 6\hfill & 8\hfill \\ 5\hfill & & \\ 4\hfill & & \end{array}\right)\left(\begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 3\hfill & & \\ 6\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 7\hfill \\ 2\hfill & 5\hfill & 8\hfill \\ 4\hfill & & \\ 6\hfill & & \end{array}\right)\hfill \\ \left(\begin{array}{ccc}1\hfill & 5\hfill & 8\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 7\hfill & & \\ 3\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 6\hfill & 5\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 7\hfill & & \\ 3\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 8\hfill \\ 2\hfill & 5\hfill & 6\hfill \\ 7\hfill & & \\ 4\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 6\hfill & 8\hfill \\ 7\hfill & & \\ 4\hfill & & \end{array}\right)\hfill \\ \left(\begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 3\hfill & & \\ 8\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 6\hfill & 5\hfill \\ 2\hfill & 4\hfill & 7\hfill \\ 3\hfill & & \\ 8\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 7\hfill \\ 2\hfill & 5\hfill & 6\hfill \\ 4\hfill & & \\ 8\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 6\hfill & 7\hfill \\ 4\hfill & & \\ 8\hfill & & \end{array}\right)\hfill \\ 2\begin{array}{ccc}1\hfill & 3\hfill & 7\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 5\hfill & & \\ 6\hfill & & \end{array}\left(\begin{array}{ccc}1\hfill & 3\hfill & 8\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 7\hfill & & \\ 5\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 7\hfill & & \\ 6\hfill & & \end{array}\right)\left(\begin{array}{ccc}1\hfill & 3\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 5\hfill & & \\ 8\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 4\hfill & 7\hfill \\ 6\hfill & & \\ 8\hfill & & \end{array}\right)2\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 7\hfill & & \\ 8\hfill & & \end{array}.\hfill \end{array}$$

Note that $`R=6`$, $`\overline{m}=1`$ and

$$\begin{array}{ccc}\hfill \vartheta _{\text{}}& =& 12\hfill \\ \hfill \vartheta _{\text{}}=\vartheta _{\text{}}& =& 6\hfill \\ \hfill \vartheta _{\text{}}=\vartheta _{\text{}}& =& 6\hfill \\ \hfill \vartheta _{\text{}}& =& 12\hfill \\ \hfill \vartheta _{\text{}}=\vartheta _{\text{}}& =& 6\hfill \\ \hfill \vartheta _{\text{}}& =& 12.\hfill \end{array}$$

###### Example 2.44

Let $`\lambda =(3,3,2)`$, $`\mu =(2,2,2,1,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /8!)\text{}\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /5)\text{Z}/5,$$

$`R=2`$, and a generator of $`\text{Hom}_{\text{Z}𝒮_8}(S^\lambda /5,S^\mu /5)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 4\hfill & 7\hfill \\ 2\hfill & 5\hfill & 8\hfill \\ 3\hfill & 6\hfill & \end{array}& \text{}& \left(\begin{array}{cc}1\hfill & 7\hfill \\ 2\hfill & 8\hfill \\ 3\hfill & 6\hfill \\ 4\hfill & \\ 5\hfill & \end{array}+\begin{array}{cc}1\hfill & 7\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 8\hfill \\ 4\hfill & \\ 6\hfill & \end{array}+\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 7\hfill \\ 3\hfill & 8\hfill \\ 5\hfill & \\ 6\hfill & \end{array}\right)\left(\begin{array}{cc}1\hfill & 7\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 6\hfill \\ 4\hfill & \\ 8\hfill & \end{array}+\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 7\hfill \\ 3\hfill & 6\hfill \\ 5\hfill & \\ 8\hfill & \end{array}+\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 7\hfill \\ 6\hfill & \\ 8\hfill & \end{array}\right)\hfill \\ & & \left(\begin{array}{cc}1\hfill & 8\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 6\hfill \\ 7\hfill & \\ 4\hfill & \end{array}+\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 8\hfill \\ 3\hfill & 6\hfill \\ 7\hfill & \\ 5\hfill & \end{array}+\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 8\hfill \\ 7\hfill & \\ 6\hfill & \end{array}\right)3\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 6\hfill \\ 7\hfill & \\ 8\hfill & \end{array}.\hfill \end{array}$$

###### Example 2.45

Let $`\lambda =(3,3,1,1)`$, $`\mu =(2,2,2,2)`$. Then

$$\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /8!)\text{}\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /3)\text{Z}/3,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_8}(S^\lambda /3,S^\mu /3)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{ccc}1\hfill & 5\hfill & 7\hfill \\ 2\hfill & 6\hfill & 8\hfill \\ 3\hfill & & \\ 4\hfill & & \end{array}& \text{}& \begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & 7\hfill \\ 4\hfill & 8\hfill \end{array}.\hfill \end{array}$$

###### Example 2.46

Let $`\lambda =(4,3)`$, $`\mu =(2,2,2,1)`$. Then

$$\text{Hom}_{\text{Z}𝒮_7}(S^\lambda ,S^\mu /7!)\text{}\text{Hom}_{\text{Z}𝒮_7}(S^\lambda ,S^\mu /4)\text{Z}/4,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_7}(S^\lambda /4,S^\mu /4)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill & \end{array}& \text{}& 2\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & 7\hfill \\ 4\hfill & \end{array}+\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 4\hfill \\ 3\hfill & 7\hfill \\ 6\hfill & \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 5\hfill \\ 4\hfill & 7\hfill \\ 6\hfill & \end{array}+\begin{array}{cc}1\hfill & 6\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & 7\hfill \\ 3\hfill & \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 6\hfill \\ 5\hfill & 7\hfill \\ 4\hfill & \end{array}+2\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & 7\hfill \\ 6\hfill & \end{array}.\hfill \end{array}$$

###### Example 2.47

Let $`\lambda =(4,4)`$, $`\mu =(2,2,2,2)`$. Then

$$\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /8!)\text{}\text{Hom}_{\text{Z}𝒮_8}(S^\lambda ,S^\mu /4)\text{Z}/4,$$

and a generator of $`\text{Hom}_{\text{Z}𝒮_8}(S^\lambda /4,S^\mu /4)`$ is given by

$$\begin{array}{ccc}\hfill \begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill & 8\hfill \end{array}& \text{}& 2\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & 7\hfill \\ 4\hfill & 8\hfill \end{array}+\begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 4\hfill \\ 3\hfill & 7\hfill \\ 6\hfill & 8\hfill \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 5\hfill \\ 4\hfill & 7\hfill \\ 6\hfill & 8\hfill \end{array}+\begin{array}{cc}1\hfill & 6\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & 7\hfill \\ 3\hfill & 8\hfill \end{array}+\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 6\hfill \\ 5\hfill & 7\hfill \\ 4\hfill & 8\hfill \end{array}+2\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & 7\hfill \\ 6\hfill & 8\hfill \end{array}.\hfill \end{array}$$

###### Question 2.48

I do not know a generic morphism that specializes to the morphism in (2.46) or to the morphism in (2.47).

## 3 Semistandard morphisms

The following considerations are based on methods of James \[J 78, 13\] and follow a hint of Ringel. We transpose our morphism from (2.37), cf. (3.16, 3.27), where transposition is given by dualization, followed by alternation and isomorphic substitution. Moreover, we establish a connection from the morphisms from $`M^{\lambda ,}`$ to $`S^\mu `$ exhibited in Section 2.1 to those of the form $`\mathrm{\Theta }_\phi ^{}\nu _S^\mu `$ (3.25, 3.26), where the morphisms of type $`\mathrm{\Theta }_\phi `$ occur in \[J 78, 13.13\].

Informal remark. The original aim to give upper bounds on the Hom-groups is still out of reach (cf. 2.39). It could perhaps be approached by showing that the method that has been sufficient to construct our morphism (2.37) is also necessary in some sense. The connection we establish is to be seen as the first step of this approach, namely that the construction of our building blocks $`f_e^{\prime \prime }`$ in Section 2.1 has been necessary in some sense, except at the prime $`2`$ in certain cases (3.12), and that there is a also reason to exclude bulky patterns by means of a reduced tuple of coefficients (3.28). For a particular case in which this aim could be achieved at least in the regular case, see (4.9).

### 3.1 Correspondoids

We shall recall the Carter-Lusztig-James construction of the semistandard basis of $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,M^\mu )`$ \[J 78, 13.13\], $`\lambda `$ and $`\mu `$ partitions of $`n`$, in our slightly modified language convenient for the purpose of dualization (cf. 3.2). Moreover, we shall give a recipe for the transposition (3.16).

In this section we write maps on the right. Inverse images of subsets are written on the left. Given a $`\text{Z}𝒮_n`$-lattice $`X`$, we denote its dual by $`X^{}=\text{Hom}_\text{Z}(X,\text{Z})`$, and, accordingly, we denote the dual of a morphism $`X\text{}Y`$ of $`\text{Z}𝒮_n`$-lattices by $`X^{}\text{}Y^{}`$. Let $`\lambda `$ and $`\mu `$ be arbitrary partitions of $`n`$. A correspondence from $`\mu `$ to $`\lambda `$ is a bijection

$$[\mu ]\text{}[\lambda ].$$

The set of correspondences from $`\mu `$ to $`\lambda `$ is denoted by $`\mathrm{\Phi }^{\mu ,\lambda }`$. We denote by

$$\{\phi \}:=\phi ^1\pi _R^\mu :[\lambda ]\text{}\text{N}$$

what is called a $`\lambda `$-tableau of type $`\mu `$ in \[J 78, 13.1\] and what in our context might also be called the correspondoid attached to the correspondence $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$. The set of correspondoids from $`\mu `$ to $`\lambda `$ is denoted by $`\{\mathrm{\Phi }^{\mu ,\lambda }\}`$. James uses the bijection from the set of correspondoids $`\{\mathrm{\Phi }^{\mu ,\lambda }\}`$ to the set of $`\mu `$-tabloids that, for a fixed $`\lambda `$-tableau $`[a]`$, is given by

$$\{\phi \}=\phi ^1\pi _R^\mu \text{}[a]^1\phi ^1\pi _R^\mu =\{\phi [a]\}$$

as identification. Let

$$\begin{array}{ccc}\hfill R_\lambda & :=& \{\rho \mathrm{\Phi }^{\lambda ,\lambda }|\rho \pi _R^\lambda =\pi _R^\lambda \}\hfill \\ \hfill C_\lambda & :=& \{\kappa \mathrm{\Phi }^{\lambda ,\lambda }|\kappa \pi _C^\lambda =\pi _C^\lambda \}\hfill \end{array}$$

be the row stabilizer resp. the column stabilizer of $`\lambda `$. Given a correspondence $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$, we write

$$r_\phi :=\mathrm{\#}(R_\lambda \phi ^1R_\mu \phi )$$

Note that $`r_\phi =r_{\phi ^1}`$. Given a correspondence $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$ and a $`\lambda `$-tableau $`[a]`$, conjugation with the tableau $`[a]`$ yields a bijection $`R_\lambda \phi ^1R_\mu \phi \text{}R_{[a]}R_{\phi [a]}`$.

###### Lemma 3.1

Let $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$ be a correspondence. The map

$$\begin{array}{ccc}\hfill M^\lambda & \text{}& M^\mu \hfill \\ \hfill \{a\}& \text{}& r_\phi ^1\underset{\rho R_{[a]}}{}\{\phi [a]\}\rho =r_\phi ^1\underset{\rho R_\lambda }{}\{\phi \rho [a]\}\hfill \end{array}$$

is well defined and $`\text{Z}𝒮_n`$-linear. For $`\rho R_\mu `$ and $`\rho ^{}R_\lambda `$, we have $`\mathrm{\Theta }_{\rho \phi \rho ^{}}=\mathrm{\Theta }_\phi `$. In particular, $`\mathrm{\Theta }_\phi `$ and $`\mathrm{\Theta }_{\phi ^1}`$ both depend only on the correspondoid $`\{\phi \}`$.

First, we note that the element $`{\displaystyle \underset{\rho R_{[a]}}{}}\{\phi [a]\}\rho M^\mu `$ is divisible by $`r_\phi =\mathrm{\#}(R_{[a]}R_{\phi [a]})`$ since $`\{\phi [a]\}\rho =\{\phi [a]\}\rho _0\rho `$ for $`\rho _0R_{[a]}R_{\phi [a]}`$. Furthermore, since $`R_{[a]\sigma }=(R_{[a]})^\sigma `$ for $`\sigma 𝒮_n`$, the map

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& M^\mu \hfill \\ \hfill [a]& \text{}& r_\phi ^1\underset{\rho R_{[a]}}{}\{\phi [a]\}\rho \hfill \end{array}$$

is $`\text{Z}𝒮_n`$-linear. Finally, since $`{\displaystyle \underset{\rho R_{[a]}}{}}\{\phi [a]\}\rho ={\displaystyle \underset{\rho R_{[a]\sigma }}{}}\{\phi [a]\sigma \}\rho `$ for $`\sigma R_{[a]}`$, this map factors over

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& M^\lambda \hfill \\ \hfill [a]& \text{}& \{a\}.\hfill \end{array}$$

Suppose given $`\rho R_\mu `$ and $`\rho ^{}R_\lambda `$. We have

$$\begin{array}{ccc}\hfill \{a\}\mathrm{\Theta }_{\rho \phi \rho ^{}}& =& r_{\rho \phi \rho ^{}}^1\underset{\rho ^{\prime \prime }R_\lambda }{}\{\rho \phi \rho ^{}\rho ^{\prime \prime }[a]\}\hfill \\ & =& r_\phi ^1\underset{\rho ^{\prime \prime }R_\lambda }{}\{\phi \rho ^{\prime \prime }[a]\}\hfill \\ & =& \{a\}\mathrm{\Theta }_\phi .\hfill \end{array}$$

A $`𝒮_n`$-invariant bilinear form on $`M^\lambda `$ is given by

$$(\{a\},\{b\})=\{\begin{array}{cc}1\hfill & \text{ for }\{a\}=\{b\}\hfill \\ 0\hfill & \text{ for }\{a\}\{b\},\hfill \end{array}$$

$`\{a\},\{b\}`$ being $`\lambda `$-tabloids. The resulting dualization isomorphism is denoted by

$$\begin{array}{ccc}\hfill M^\lambda & \text{}& M^{\lambda ,}\hfill \\ \hfill \{a\}& \text{}& (\{a\},).\hfill \end{array}$$

We also write such a $`\lambda `$-cotabloid as $`\{a\}^{}:=(\{a\},)`$.

###### Lemma 3.2

Given a correspondence $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$, the diagram

commutes.

The dual of $`\mathrm{\Theta }_\phi `$ sends the $`\mu `$-cotabloid $`\{b\}^{}`$ to the map

$$\begin{array}{ccc}\hfill M^\lambda & \text{}& \text{Z}\hfill \\ \hfill \{a\}& \text{}& (\{b\},\{a\}\mathrm{\Theta }_\phi )\hfill \\ & =& r_\phi ^1\underset{\rho R_{[a]}}{}(\{b\},\{\phi [a]\}\rho )\hfill \\ & =& r_\phi ^1\underset{\rho R_{[a]}}{}\underset{\sigma R_{[b]}}{}\left\{\begin{array}{cc}1\hfill & \text{for }[b]\sigma =\phi [a]\rho \hfill \\ 0\hfill & \text{else}\hfill \end{array}\right\}\hfill \\ & =& r_{\phi ^1}^1\underset{\sigma R_{[b]}}{}\underset{\rho R_{[a]}}{}\left\{\begin{array}{cc}1\hfill & \text{for }\phi ^1[b]\sigma =[a]\rho \hfill \\ 0\hfill & \text{else}\hfill \end{array}\right\}\hfill \\ & =& r_{\phi ^1}^1\underset{\sigma R_{[b]}}{}(\{\phi ^1[b]\}\sigma ,\{a\})\hfill \\ & =& (\{b\}\mathrm{\Theta }_{\phi ^1},\{a\}).\hfill \end{array}$$

We denote the inclusion that is given by the definition of the Specht lattice by $`S^\lambda \text{}M^\lambda `$.

###### Remark 3.3

Let $`\nu `$ be still another partition of $`n`$, let $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$, let $`\psi \mathrm{\Phi }^{\nu ,\mu }`$ and let $`[a]`$ be a $`\lambda `$-tableau. We obtain

$$\{a\}\mathrm{\Theta }_\phi \mathrm{\Theta }_\psi =\underset{\rho R_\mu }{}\frac{r_{\psi \rho \phi }}{r_\phi r_\psi }\{a\}\mathrm{\Theta }_{\psi \rho \phi }.$$

In fact,

$$\begin{array}{ccc}\hfill \{a\}\mathrm{\Theta }_\phi \mathrm{\Theta }_\psi & =& r_\phi ^1\left(\underset{\rho ^{}R_{[a]}}{}\{\phi [a]\rho ^{}\}\right)\mathrm{\Theta }_\psi \hfill \\ & =& r_\phi ^1r_\psi ^1\underset{\rho ^{}R_{[a]}}{}\underset{\rho R_{\phi [a]\rho ^{}}}{}\{\psi \phi [a]\rho ^{}\rho \}\hfill \\ & =& r_\phi ^1r_\psi ^1\underset{\rho R_{\phi [a]}}{}\underset{\rho ^{}R_{[a]}}{}\{(\psi \phi [a]\rho [a]^1\phi ^1\phi )[a]\}\rho ^{}\hfill \\ & =& r_\phi ^1r_\psi ^1\underset{\rho R_{\phi [a]}}{}r_{\psi \phi [a]\rho [a]^1\phi ^1\phi }\{a\}\mathrm{\Theta }_{\psi \phi [a]\rho [a]^1\phi ^1\phi }\hfill \\ & =& r_\phi ^1r_\psi ^1\underset{\rho R_\mu }{}r_{\psi \rho \phi }\{a\}\mathrm{\Theta }_{\psi \rho \phi }.\hfill \end{array}$$

###### Remark 3.4

$`X`$ being a $`\text{Z}𝒮_n`$-lattice, we may identify

$$\begin{array}{ccc}\hfill X^,& \text{}& X^,\hfill \\ \hfill fa& \text{}& (xb\text{}xfab)\hfill \\ \hfill (x\text{}(x1)g)1& \text{}& g.\hfill \end{array}$$

###### Proposition 3.5 (\[J 78, 6.7\])

The map

$$\begin{array}{ccc}\hfill S^\lambda ^{}& \text{}& S^{\lambda ,,}\hfill \\ \hfill a_\lambda ^{}\sigma & \text{}& (\{(a_\lambda ^{})^{}\}^{}|_{S^\lambda }1)\sigma ,\hfill \end{array}$$

where $`\sigma 𝒮_n`$, is a well defined $`\text{Z}𝒮_n`$-linear isomorphism. The diagram

commutes.

We abbreviate $`[a]=[(a_\lambda ^{})^{}]`$ in the course of the proof and claim that the kernels of the maps

$$\begin{array}{ccc}\hfill M^\lambda & \text{}& S^{\lambda ^{},}\hfill \\ \hfill \{a\}\sigma & \text{}& a^{}\sigma \epsilon _\sigma \hfill \\ \hfill M^\lambda & \text{}& S^{\lambda ,}\hfill \\ \hfill \{a\}\sigma & \text{}& (\{a\}\sigma )\delta ^\lambda \iota ^{\lambda ,}=\{a\sigma \}^{}|_{S^\lambda }\hfill \end{array}$$

coincide. Suppose given an element $`{\displaystyle \underset{\sigma 𝒮_n}{}}x_\sigma \{a\}\sigma M^\lambda `$, $`x_\sigma \text{Z}`$. To be contained in the kernel of $`\alpha `$ means

$$\begin{array}{ccc}\hfill 0& =& \underset{\sigma 𝒮_n}{}x_\sigma a^{}\sigma \epsilon _\sigma \hfill \\ & =& \underset{\sigma 𝒮_n,\rho R_{[a]}}{}x_\sigma \{a^{}\}\rho \epsilon _\rho \sigma \epsilon _\sigma \hfill \\ & =& \underset{\sigma 𝒮_n,\rho R_{[a]}}{}x_{\rho ^1\sigma }\{a^{}\}\sigma \epsilon _\sigma .\hfill \end{array}$$

Comparing coefficients, this is equivalent to saying that for all $`\tau 𝒮_n`$ we obtain

$$\underset{\kappa C_{[a]},\rho R_{[a]}}{}x_{\rho ^1\kappa \tau }\epsilon _{\kappa \tau }=0.$$

To be contained in the kernel of $`\beta `$ amounts to

$$\begin{array}{ccc}\hfill 0& =& (\underset{\sigma 𝒮_n}{}x_\sigma \{a\}\sigma ,a\tau )\hfill \\ & =& (\underset{\sigma 𝒮_n}{}x_\sigma \{a\}\sigma \tau ^1\underset{\kappa C_{[a]}}{}\kappa \epsilon _\kappa ,\{a\})\hfill \\ & =& (\underset{\kappa C_{[a]},\rho 𝒮_n}{}x_{\rho \kappa ^1\tau }\{a\}\rho \epsilon _\kappa ,\{a\})\hfill \end{array}$$

for all $`\tau 𝒮_n`$, i.e. that for all $`\tau 𝒮_n`$

$$\underset{\kappa C_{[a]},\rho R_{[a]}}{}x_{\rho \kappa ^1\tau }\epsilon _\kappa =0.$$

Since $`\alpha `$ is surjective, we may conclude that the map $`S^{\lambda ^{},}\text{}S^{\lambda ,}`$ is well defined and injective. To prove surjectivity, it remains to be shown that $`\beta =\delta ^\lambda \iota ^{\lambda ,}`$ is surjective, i.e. that $`\iota ^\lambda `$ is a pure monomorphism. But the tuple of standard tableaux gives a basis of the Specht module over $`\text{F}_p`$ for any prime $`p`$ \[J 78, 8.4\].

###### Lemma 3.6

Denoting evaluation by $`X\text{}X^{}`$, $`X`$ a $`\text{Z}𝒮_n`$-lattice, we may dualize to obtain

$$\begin{array}{ccccccccc}\hfill (M^\lambda & \text{}& M^{\lambda ,}\hfill & \text{}& M^{\lambda ,})\hfill & =& (M^\lambda \hfill & \text{}& M^{\lambda ,})\hfill \\ \hfill (S^\lambda & \text{}& S^{\lambda ,}\hfill & \text{}& S^{\lambda ^{},,})\hfill & =& (S^\lambda \hfill & \text{}& S^{\lambda ^{},,}),\hfill \end{array}$$

provided $`[a_\lambda ^{}]=[(a_\lambda )^{}]`$. Ignoring this condition, the second equality holds up to sign.

Suppose given $`\lambda `$-tableaux $`[a]`$ and $`[b]`$. Let $`\sigma =[a][b]^1`$. We have

$$(\{a\},b)=\{\begin{array}{cc}0\hfill & \text{for }\sigma R_\lambda C_\lambda \hfill \\ \epsilon _\kappa \hfill & \text{for }\sigma =\rho \kappa ,\rho R_\lambda ,\kappa C_\lambda .\hfill \end{array}$$

Therefore,

$$\text{(\#)}(\{a\},b)=\epsilon _\sigma (\{b^{}\},a^{}).$$

We abbreviate $`[a]=[(a_\lambda ^{})^{}]=[a_\lambda ]`$. The map $`S^\lambda ^{}\text{}S^{\lambda ,,}`$ sends $`a^{}\tau `$ to $`(\{[a]\tau \},)\epsilon _\tau `$, where $`\tau 𝒮_n`$, so that the composition sends

$$\begin{array}{ccccc}\hfill S^\lambda & \text{}& S^{\lambda ,}\hfill & \text{}& S^{\lambda ^{},,}\hfill \\ \hfill a& \text{}& a\text{eva}\hfill & \text{}& \left(a^{}\tau 1\text{}\epsilon _\tau (\{[a]\tau \},a)\stackrel{\text{(\#)}}{=}(\{a^{}\},a^{}\tau )\right).\hfill \end{array}$$

A correspondoid $`\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}`$ is called semistandard in case the following conditions hold.

* For $`i\times j,i\times j^{}[\lambda ]`$ with $`j<j^{}`$, we have $`(i\times j)\{\phi \}(i\times j^{})\{\phi \}`$.
* For $`i\times j,i^{}\times j[\lambda ]`$ with $`i<i^{}`$, we have $`(i\times j)\{\phi \}<(i^{}\times j)\{\phi \}`$.

Let $`\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\{\mathrm{\Phi }^{\mu ,\lambda }\}`$ denote the subset of semistandard correspondoids.

We attach to each correspondence $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$ its column distribution

$$\begin{array}{ccccc}\hfill \text{N}& \times & \text{N}\hfill & \text{}& \text{N}\hfill \\ \hfill j& \times & k\hfill & \text{}& |\phi |_{k,j}:=\mathrm{\#}\left(\{\phi \}^1(j)(\text{N}\times \{k\})\right).\hfill \end{array}$$

The map from the correspondences to the column distribution factors over the correspondoids, $`(\phi \text{}|\phi |)=(\phi \text{}\{\phi \}\text{}|\phi |)`$. For $`\phi \mathrm{\Phi }^{\mu ,\lambda }`$, $`\rho R_\mu `$ and $`\kappa C_\lambda `$, we have $`|\rho \phi \kappa |=|\phi |`$ because $`\{\rho \phi \kappa \}=\{\phi \kappa \}`$ and because of the bijection, $`j\times k\text{N}\times \text{N}`$,

$$\{\phi \}^1(j)(\text{N}\times \{k\})\text{}\{\phi \kappa \}^1(j)(\text{N}\times \{k\})$$

which is given by restriction of $`\kappa `$. Note that the column distribution may be regarded as column equivalence class in the sense of \[J 78, 13.8\].

A total order on the set of column distributions can be defined as follows. We order $`\text{N}\times \text{N}`$ lexicographically via $`j\times k<j^{}\times k^{}`$ if $`j<j^{}`$ or ($`j=j^{}`$ and $`k<k^{}`$). Suppose given correspondences $`\phi ,\stackrel{~}{\phi }\mathrm{\Phi }^{\mu ,\lambda }`$, $`|\phi ||\stackrel{~}{\phi }|`$. Let $`j\times k`$ be minimal with $`|\phi |_{k,j}|\stackrel{~}{\phi }|_{k,j}`$. We say that $`|\phi |<|\stackrel{~}{\phi }|`$ in case $`|\phi |_{k,j}<|\stackrel{~}{\phi }|_{k,j}`$.

The following arguments, needed to obtain (3.12), are taken from \[J 78\], and we reproduce them here in a slightly adapted manner. I thank M. Härterich for an explanation.

###### Lemma 3.7

For $`\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}`$ and $`\rho R_\lambda `$, we have $`|\phi ||\phi \rho |`$.

Suppose $`|\phi ||\phi \rho |`$ and let $`j\times k`$ be minimal with $`|\phi |_{k,j}|\phi \rho |_{k,j}`$. By induction on $`j^{}\times k^{}`$, we see that

$$()\{\phi \rho \}^1(j^{})(\text{N}\times \{k^{}\})=\{\phi \}^1(j^{})(\text{N}\times \{k^{}\})$$

for $`1\times 1j^{}\times k^{}<j\times k`$. In fact, assume that the two inverse images of the value $`j^{}`$ in column $`k^{}`$ differ in spite of having the same cardinality. Then there exists $`i\times k^{}[\lambda ]`$, $`i\times k^{\prime \prime }:=(i\times k^{})\rho ^1`$, such that $`j^{}=(i\times k^{\prime \prime })\{\phi \}(i\times k^{})\{\phi \}=:j^{\prime \prime }`$. Assume that $`j^{}>j^{\prime \prime }`$. But since $`i\times k^{}\{\phi \}^1(j^{\prime \prime })\backslash \{\phi \rho \}^1(j^{\prime \prime })`$, this yields a contradiction to ($``$) by induction hypothesis, so that we obtain $`j^{}<j^{\prime \prime }`$.

Let $`i\times k^{(s)}:=(i\times k^{})\rho ^s`$ for $`s0`$. We claim that $`(i\times k^{(s)})\{\phi \}=j^{}`$ for all $`s1`$, thus deriving a contradiction that establishes $`()`$. We perform an induction on $`s`$. But $`(i\times k^{(s)})\{\phi \}=j^{}`$ implies by semistandardness of $`\{\phi \}`$ that $`k^{(s)}<k^{}`$. Thus ($``$) applies by induction hypothesis and shows that $`(i\times k^{(s+1)})\{\phi \}=(i\times k^{(s)})\{\phi \rho \}=j`$.

Assume that $`|\phi |_{k,j}<|\phi \rho |_{k,j}`$. Then there exists $`i\times k[\lambda ]`$, $`i\times k^{}:=(i\times k)\rho ^1`$, such that $`j=(i\times k^{})\{\phi \}(i\times k)\{\phi \}=:j^{}`$. Assume that $`j>j^{}`$. But since $`i\times k\{\phi \}^1(j^{})\backslash \{\phi \rho \}^1(j^{})`$, this yields a contradiction to ($``$) and shows $`j<j^{}`$.

Let $`i\times k^{(s)}:=(i\times k)\rho ^s`$ for $`s0`$. We claim that $`(i\times k^{(s)})\{\phi \}=j`$ for all $`s1`$, thus deriving a contradiction that shows $`|\phi ||\phi \rho |`$. We perform an induction on $`s`$. But $`(i\times k^{(s)})\{\phi \}=j`$ implies by semistandardness of $`\{\phi \}`$ that $`k^{(s)}<k`$. Thus ($``$) shows that $`(i\times k^{(s+1)})\{\phi \}=(i\times k^{(s)})\{\phi \rho \}=j`$.

###### Lemma 3.8

Restricted to $`\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}`$, the map $`\{\phi \}\text{}|\phi |`$ becomes injective.

To determine a semistandard correspondoid $`\{\phi \}`$, it suffices to know the set of its values on column $`k`$ for each $`k1`$, which can be written as $`\{j\text{N}||\phi |_{k,j}1\}`$.

###### Lemma 3.9

Assume $`\lambda `$ to be a $`2`$-regular partition of $`n`$, i.e. assume that $`i<i^{}`$ implies $`\lambda _i>\lambda _i^{}`$ for $`i,i^{}[1,\lambda _1^{}]`$. Suppose given $`\kappa ,\kappa ^{}C_\lambda `$. Let

$$\begin{array}{ccc}\hfill [\lambda ]& \text{}& [\lambda ]\hfill \\ \hfill i\times k& \text{}& i\times (\lambda _ik).\hfill \end{array}$$

If $`\kappa \iota \kappa ^{}R_\lambda `$ then $`\kappa =1`$, hence also $`\kappa ^{}=1`$.

Assume that $`\kappa 1`$, i.e. assume given some position $`i\times k[\lambda ]`$ such that $`i\times k(i\times k)\kappa `$. First, we choose $`i`$ minimal such that there exists a $`k`$ such that $`i\times k(i\times k)\kappa `$. Having chosen our $`i`$, we choose $`k`$ maximal such that $`i\times k(i\times k)\kappa `$. We write $`i^{}\times k:=(i\times k)\kappa `$ and remark that $`i<i^{}`$. We obtain

$$\begin{array}{ccccccccccccccc}\hfill i& \times & k\hfill & \text{}& \hfill i^{}& \times & k\hfill & \text{}& \hfill i^{}& \times & (\lambda _i^{}k)\hfill & \text{}& \hfill i^{\prime \prime \prime }& \times & (\lambda _i^{}k)\hfill \\ \hfill i& \times & (k+\lambda _i\lambda _i^{})\hfill & \text{}& \hfill i& \times & (k+\lambda _i\lambda _i^{})\hfill & \text{}& \hfill i& \times & (\lambda _i^{}k)\hfill & \text{}& \hfill i^{\prime \prime }& \times & (\lambda _i^{}k),\hfill \end{array}$$

where $`i^{\prime \prime }i^{\prime \prime \prime }`$, contradicting $`\kappa \iota \kappa ^{}R_\lambda `$.

###### Lemma 3.10

Suppose given $`\sigma R_\lambda C_\lambda `$. There exists a transposition $`\kappa _\sigma C_\lambda `$ such that $`\sigma \kappa _\sigma \sigma ^1R_\lambda `$.

Assume that the conclusion does not hold, i.e. that $`\sigma ^1`$ sends different entries of each given column to different rows. We claim that this implies that $`\sigma R_\lambda C_\lambda `$. Given a permutation $`\tau `$ of $`[\lambda ]`$, we let $`k_\tau `$ be the maximal column position $`k0`$ such that $`\tau `$ becomes the identity when restricted to $`[\lambda ](\text{N}\times [1,k])`$. We perform a downwards induction on $`k_\sigma `$, starting with $`k_\sigma =\lambda _1`$.

Different entries of column $`k_\sigma +1`$ are mapped to different rows. Hence there is a column permutation $`\kappa C_\lambda `$ acting trivially except perhaps in column $`k_\sigma +1`$ such that $`(i\times (k_\sigma +1))\kappa \sigma ^1\pi _R^\lambda =i`$ for $`i[1,\lambda _{k_\sigma +1}^{}]`$. Thus there is a row permutation $`\rho R_\lambda `$ such that $`k_{\kappa \sigma ^1\rho }>k_{\sigma ^1}`$, i.e. $`k_{\rho ^1\sigma \kappa ^1}>k_\sigma `$. By induction, $`\rho ^1\sigma \kappa ^1R_\lambda C_\lambda `$ ensues.

###### Lemma 3.11

Suppose given a semistandard correspondoid $`\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}`$ and a $`\lambda `$-tableau $`[a]`$. Writing

$$a\mathrm{\Theta }_\phi =\underset{\{\psi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}z_\psi \{\psi [a]\}M^\mu ,$$

we obtain $`z_{\{\phi \}}=1`$ and $`z_{\{\psi \}}=0`$ for $`|\psi |>|\phi |`$.

Note that

$$\begin{array}{ccc}\hfill a\mathrm{\Theta }_\phi & =& \underset{\kappa C_{[a]}}{}\underset{\rho (R_\lambda \phi ^1R_\mu \phi )\backslash R_\lambda }{}\{\phi \rho [a]\}\kappa \epsilon _\kappa \hfill \\ & =& \underset{\kappa C_\lambda }{}\underset{\rho (R_\lambda \phi ^1R_\mu \phi )\backslash R_\lambda }{}\{\phi \rho \kappa [a]\}\epsilon _\kappa .\hfill \end{array}$$

Since $`\{\phi \}`$ is semistandard, we have $`|\phi |\stackrel{\text{(}\text{3.7}\text{)}}{}|\phi \rho |=|\phi \rho \kappa |`$ for $`\rho R_\lambda `$, $`\kappa C_\lambda `$.

The equality $`\{\phi \}=\{\phi \rho \kappa \}`$ is equivalent to the existence of a $`\rho ^{}R_\mu `$ such that $`\kappa =\rho (\phi ^1\rho ^{}\phi )`$. This condition supposed to hold and given $`i\times k[\lambda ]`$, we obtain

$$i\times k\text{}i\times k^{}\text{}i^{}\times k,$$

where $`(i\times k^{})\{\phi \}=(i^{}\times k)\{\phi \}`$. Note that the resulting map $`i\text{}i^{}`$ is a bijection for each $`k`$. We perform an induction on $`k`$ to show that $`ii^{}`$. Suppose $`ii^{}`$ and hence $`i=i^{}`$ for $`k_0<k`$ (supposition possibly empty). Therefore, $`(i\times k_0)\{\phi \}=(i^{}\times k_0)\{\phi \}=(i\times k_0^{})\{\phi \}`$. Since $`\{\phi \}`$ is semistandard, this inhibits $`(i\times k)\{\phi \}>(i\times k^{})\{\phi \}`$, for this would mean that $`\rho `$ could not act on the set

$$\left\{i\times k_1\right|k_1[1,\lambda _i],(i\times k_1)\{\phi \}=(i\times k^{})\{\phi \}\}\{i\}\times [1,k1],$$

the inclusion given by semistandardness of $`\{\phi \}`$. Thus $`(i\times k)\{\phi \}(i\times k^{})\{\phi \}=(i^{}\times k)\{\phi \}`$, hence, by semistandardness of $`\{\phi \}`$, $`ii^{}`$, forcing $`i=i^{}`$ for all $`i\times k[\lambda ]`$. We conclude that $`\kappa =1`$ and that thus $`\phi ^1\rho ^{}\phi `$ inverts $`\rho `$ so that $`\rho `$ represents the trivial coset.

Let $`m0`$. $`\lambda `$ is called $`2`$-singular if there exists an $`i1`$ such that $`\lambda _i=\lambda _{i+1}>0`$. The case of $`m1`$, $`m(2)`$ and $`\lambda `$ being $`2`$-singular shall be called the singular case. The complementary case shall be called the regular case, comprising in particular the case $`m=0`$.

###### Theorem 3.12 (Carter, Lusztig \[CL 74, 3.5\], James \[J 78, 13.13\])

In the regular case, the tuple

$$\left(\mathrm{\Theta }_\phi |_{S^\lambda }_\text{Z}\text{Z}/m|\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\right)$$

furnishes a $`\text{Z}/m`$-linear basis of $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /m,M^\mu /m)`$.

In the singular case, the tuple

$$\left(2\mathrm{\Theta }_\phi |_{S^\lambda }_\text{Z}\text{Z}/m|\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\right)$$

furnishes a $`\text{Z}/(m/2)`$-linear basis of $`2\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /m,M^\mu /m)`$.

We claim that the respective tuple is linearly independent. Suppose given a $`\lambda `$-tableau $`a`$. We write down a matrix whose positions are indexed by $`\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\times \{\mathrm{\Phi }^{\mu ,\lambda }\}`$, and whose entry at position $`\{\phi \}\times \{\psi \}`$ is given by the multiplicity of the $`\mu `$-tabloid $`\{\psi [a]\}`$ in $`a\mathrm{\Theta }_\phi M^\mu `$. It suffices to show that the $`\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\times \{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}`$-part of our matrix is unipotent. But this follows from (3.11) in view of (3.8).

We claim that the respective tuple generates. Suppose given a morphism $`S^\lambda /m\text{}M^\mu /m`$ such that $`\mathrm{\Theta }0`$ in the regular case resp. such that $`2\mathrm{\Theta }0`$ in the singular case. We fix a $`\lambda `$-tableau $`[a]`$ and write

$$a\mathrm{\Theta }=\underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \}}\{\phi [a]\},$$

where all elements of $`S^\lambda `$ and of $`M^\mu `$ which occur in this expression and in the remainder of the proof are to be read as representing their residue classes modulo $`m`$. Suppose given $`\{\psi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}`$ that allows for $`\{\psi \tau \}=\{\psi \}`$ for some $`i\times k,i^{}\times k[\lambda ]`$, $`ii^{}`$, $`\tau :=(i\times k,i\times k^{})`$. We wish to see that $`x_{\{\psi \}}=0`$ in the regular case and that $`2x_{\{\psi \}}=0`$ in the singular case. In both cases, we may compare the coefficients of

$$\begin{array}{ccc}\hfill \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \tau \}}\{\phi [a]\}& =& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \}}\{\phi [a]\}(a_{k,i},a_{k,i^{}})\hfill \\ & =& a(a_{k,i},a_{k,i^{}})\mathrm{\Theta }\hfill \\ & =& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \}}\{\phi [a]\}\hfill \end{array}$$

to obtain

$$x_{\{\psi \}}=x_{\{\psi \tau \}}=x_{\{\psi \}}.$$

Now suppose the partition $`\lambda `$ to be $`2`$-regular. We need to see that $`x_{\{\psi \}}=0`$. Let $`\iota `$ be the permutation of $`[\lambda ]`$ defined by $`i\times k\text{}i\times (\lambda _ik)`$, $`i\times k[\lambda ]`$. We abbreviate $`\iota ^{[a]}:=[a]^1\iota [a]𝒮_n`$ and calculate

$$\begin{array}{ccc}\hfill \underset{\kappa ^{}C_{[a]}}{}a\iota ^{[a]}\kappa ^{}\epsilon _\kappa ^{}& =& \underset{\kappa ,\kappa ^{}C_{[a]}}{}\{a\}\kappa \iota ^{[a]}\kappa ^{}\epsilon _{\kappa \kappa ^{}}\hfill \\ & =& \underset{\kappa ,\kappa ^{}C_\lambda }{}\{\kappa \iota \kappa ^{}[a]\}\epsilon _{\kappa \kappa ^{}},\hfill \end{array}$$

where $`\kappa C_\lambda `$ has a sign $`\epsilon _\kappa `$ as a permutation of $`[\lambda ]`$, i.e. as an element of $`𝒮_{[\lambda ]}`$. Writing the resulting expression in the form $`{\displaystyle \underset{\sigma R_\lambda \backslash 𝒮_{[\lambda ]}}{}}y_\sigma \{\sigma [a]\}`$, $`y_\sigma \text{Z}`$, where we choose our coset representatives $`\sigma `$ to lie in $`C_\lambda `$ whenever (uniquely) possible, we obtain

$$y_\sigma =\underset{\kappa ,\kappa ^{}C_\lambda ,\kappa \iota \kappa ^{}R_\lambda \sigma }{}\epsilon _{\kappa \kappa ^{}}.$$

In case $`\sigma C_\lambda `$, the condition on the indexing elements yields $`\kappa =1`$, $`\kappa ^{}=\sigma `$ and thus $`y_\sigma =\epsilon _\sigma `$ (3.9). In case $`\sigma R_\lambda C_\lambda `$, we obtain, using (3.10), and choosing a fixed system of representatives of $`C_\lambda /\kappa _\sigma `$,

$$\begin{array}{ccc}\hfill y_\sigma & =& \underset{\kappa ,\kappa ^{}C_\lambda ,\kappa \iota \kappa ^{}R_\lambda \sigma }{}\epsilon _{\kappa \kappa ^{}}\hfill \\ & =& \underset{\kappa C_\lambda ,\kappa ^{}C_\lambda /\kappa _\sigma ,\kappa \iota \kappa ^{}R_\lambda \sigma }{}\epsilon _{\kappa \kappa ^{}}+\underset{\kappa C_\lambda ,\kappa ^{}C_\lambda /\kappa _\sigma ,\kappa \iota \kappa ^{}\kappa _\sigma R_\lambda \sigma }{}\epsilon _{\kappa \kappa ^{}\kappa _\sigma }\hfill \\ & =& 0.\hfill \end{array}$$

Hence

$$\underset{\kappa ^{}C_{[a]}}{}a\iota ^{[a]}\kappa ^{}\epsilon _\kappa ^{}=a,$$

and therefore

$$\begin{array}{ccc}\hfill a\mathrm{\Theta }& \stackrel{\text{1.}}{=}& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \}}\{\phi [a]\}\hfill \\ & \stackrel{\text{2.}}{=}& \underset{\kappa C_{[a]}}{}a\mathrm{\Theta }\iota ^{[a]}\kappa \epsilon _\kappa \hfill \\ & =& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \}}\left(\underset{\kappa C_\lambda }{}\{\phi \kappa [a]\}\epsilon _\kappa \right).\hfill \end{array}$$

For $`\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}`$ and $`\kappa C_\lambda `$, the equality $`\{\psi \}=\{\phi \kappa \}`$ is equivalent to $`\phi \kappa \psi ^1R_\mu `$. Hence, as multiplicity of $`\{\psi [a]\}`$ in $`{\displaystyle \underset{\kappa C_\lambda }{}}\{\phi \kappa [a]\}`$ we get, choosing a fixed system of representatives for $`C_\lambda /\tau `$,

$$\begin{array}{ccc}\hfill \underset{\kappa C_\lambda ,\phi \kappa \psi ^1R_\mu }{}\epsilon _\kappa & =& \underset{\kappa C_\lambda /\tau ,\phi \kappa \psi ^1R_\mu }{}\epsilon _\kappa +\underset{\kappa C_\lambda /\tau ,\phi \kappa \tau \psi ^1R_\mu }{}\epsilon _{\kappa \tau }\hfill \\ & =& 0.\hfill \end{array}$$

Therefore, a comparison of 1. and 2. yields $`x_{\{\psi \}}=0`$.

Given $`\kappa C_\lambda `$, we obtain

$$\begin{array}{ccc}\hfill \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}x_{\{\phi \kappa ^1\}}\{\phi [a]\}& =& a\mathrm{\Theta }[a]^1\kappa [a]\hfill \\ & =& a\mathrm{\Theta }\epsilon _\kappa \hfill \\ & =& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}\epsilon _\kappa x_{\{\phi \}}\{\phi [a]\},\hfill \end{array}$$

whence, up to sign, $`x_{\{\phi \}}`$ depends only on $`|\phi |`$. Let $`|\phi |`$ be the maximal column distribution such that $`x_{\{\phi \}}0`$ in the regular case, resp. such that $`2x_{\{\phi \}}0`$ in the singular case. By our assertion on $`x_{\{\psi \}}`$, we may assume that $`(i\times k)\{\phi \}<(i^{}\times k)\{\phi \}`$ for $`i\times k,i^{}\times k\lambda `$, $`i<i^{}`$. In order to show that $`\{\phi \}`$ is semistandard, we assume the contrary, i.e. the existence of positions $`i\times k,i\times (k+1)[\lambda ]`$ such that $`(i\times k)\{\phi \}>(i\times (k+1))\{\phi \}`$. Let $`\xi :=a_{k,[i,\lambda _i^{}]}`$, let $`\eta :=a_{k+1,[1,i]}`$. For $`\sigma `$ in $`𝒮_{\xi \eta }`$ but not in $`𝒮_\xi \times 𝒮_\eta `$, we have $`|\phi |<|\phi [a]\sigma [a]^1|`$ since the minimal value of $`\{\phi \}`$ changing columns under $`\sigma `$ cannot move to the right. Summing up over cosets, a Garnir relation gives

$$\begin{array}{ccc}\hfill 0& =& \underset{\sigma 𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }}{}a\mathrm{\Theta }\sigma \hfill \\ & =& \underset{\{\chi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}}{}\left(\underset{\sigma 𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }}{}x_{\{\chi ([a]\sigma ^1[a]^1)\}}\right)\{\chi [a]\},\hfill \end{array}$$

whence $`{\displaystyle \underset{\sigma 𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }}{}}x_{\{\phi ([a]\sigma ^1[a]^1)\}}=0`$. For each $`\sigma `$ in $`𝒮_{\xi \eta }`$ but not in $`𝒮_\xi \times 𝒮_\eta `$, maximality of $`|\phi |`$ forces $`x_{\{\phi ([a]\sigma [a]^1)\}}=0`$ in the regular case, resp. $`2x_{\{\phi ([a]\sigma [a]^1)\}}=0`$ in the singular case, contradicting $`x_{\{\phi \}}0`$ in the regular case, resp. $`2x_{\{\phi \}}0`$ in the singular case. Hence $`\{\phi \}`$ is semistandard, and its column distribution $`|\phi |`$ shall be called the leading term of $`\mathrm{\Theta }`$. Given a correspondoid $`\{\chi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}`$, we write $`\overline{\mathrm{\Theta }}_\chi :=\mathrm{\Theta }_\chi |_{S^\lambda }_\text{Z}\text{Z}/m`$.

We consider the regular case. By (3.11), the difference $`\mathrm{\Theta }x_{\{\phi \}}\overline{\mathrm{\Theta }}_\phi `$ has either a strictly smaller leading term than $`\mathrm{\Theta }`$ or it vanishes. Both alternatives allow to assume, by induction on the leading term of $`\mathrm{\Theta }`$, or, respectively, directly, that $`\mathrm{\Theta }x_{\{\phi \}}\overline{\mathrm{\Theta }}_\phi `$ is in the linear span of the tuple given above in the regular case.

We consider the singular case. By (3.11), the difference $`\mathrm{\Theta }x_{\{\phi \}}\overline{\mathrm{\Theta }}_\phi `$ has either a strictly smaller leading term than $`\mathrm{\Theta }`$ or it vanishes under multiplication with $`2`$. Both alternatives allow to assume, by induction on the leading term of $`\mathrm{\Theta }`$ or, respectively, directly, that $`2\mathrm{\Theta }x_{\{\phi \}}2\overline{\mathrm{\Theta }}_\phi `$ is in the linear span of the tuple given above in the singular case.

###### Corollary 3.13

In the regular case, the tuple

$$\left(\mathrm{\Theta }_{\phi ^1}^{}\nu _S^\lambda ^{}_\text{Z}\text{Z}/m|\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\right)$$

furnishes a $`\text{Z}/m`$-linear basis of $`\text{Hom}_{\text{Z}𝒮_n}(M^{\mu ,}/m,S^\lambda ^{}/m)`$.

In the singular case, the tuple

$$\left(2\mathrm{\Theta }_{\phi ^1}^{}\nu _S^\lambda ^{}_\text{Z}\text{Z}/m|\{\phi \}\{\mathrm{\Phi }^{\mu ,\lambda }\}_{\text{sst}}\right)$$

furnishes a $`\text{Z}/(m/2)`$-linear basis of $`2\text{Hom}_{\text{Z}𝒮_n}(M^{\mu ,}/m,S^\lambda ^{}/m)`$.

We write $`()^{}:=\text{Hom}_\text{Z}(,\text{Z}/m)`$, neglect to denote $`()_\text{Z}\text{Z}/m`$ for maps and obtain $`\text{Z}/m`$-linear isomorphisms

$$\begin{array}{ccc}\hfill \text{Hom}_{\text{Z}𝒮_n}(S^\lambda /m,M^\mu /m)& \hfill \text{}& \text{Hom}_{\text{Z}𝒮_n}(M^\mu /m,S^{\lambda ,}/m)\hfill \\ \hfill \iota ^\lambda \mathrm{\Theta }_\phi & \hfill \text{}& ^\mu \mathrm{\Theta }_\phi ^{}\iota ^{\lambda ,}\stackrel{\text{(}\text{3.2}\text{)}}{=}\mathrm{\Theta }_{\phi ^1}^\lambda \iota ^{\lambda ,}\hfill \\ & \hfill \mathrm{}\text{}& \text{Hom}_{\text{Z}𝒮_n}(M^{\mu ,}/m,S^\lambda ^{}/m)\hfill \\ & \hfill \mathrm{}\text{}& \mathrm{\Theta }_{\phi ^1}^{}^{\lambda ,}\iota ^{\lambda ,,}(\delta ^\lambda )^1\stackrel{\text{(}\text{3.5}\text{)}}{=}\mathrm{\Theta }_{\phi ^1}^{}\nu _S^\lambda ^{}\hfill \end{array}$$

which send the bases of (3.12) to the tuples just described.

###### Corollary 3.14

In the regular case, the induced maps

$$\begin{array}{ccc}\hfill \text{Hom}_{\text{Z}𝒮_n}(M^\lambda /m,M^\mu /m)& \text{}& \text{Hom}_{\text{Z}𝒮_n}(S^\lambda /m,M^\mu /m)\hfill \\ \hfill \text{Hom}_{\text{Z}𝒮_n}(M^{\mu ,}/m,M^{\lambda ,}/m)& \text{}& \text{Hom}_{\text{Z}𝒮_n}(M^{\mu ,}/m,S^\lambda ^{}/m)\hfill \end{array}$$

are surjective. In the singular case, their cokernels are annihilated by multiplication by $`2`$. Or, slightly more precise, when passing to $`2\text{Hom}`$, the maps become surjective.

###### Question 3.15

I do not know a basis of $`\text{Hom}_{\text{F}_2𝒮_n}(S^\lambda /2,M^\mu /2)`$ in case $`\lambda `$ is $`2`$-singular.

###### Proposition 3.16

Suppose given a $`\text{Z}𝒮_n`$-linear map of the form

$$\begin{array}{ccc}\hfill S^\lambda /m& \text{}& S^\mu /m\hfill \\ \hfill a& \text{}& \underset{\{\phi \}\{\mathrm{\Phi }^{\mu ^{},\lambda ^{}}\}}{}x_{\{\phi \}}\{a^{}\}^{}\mathrm{\Theta }_\phi ^{}\nu _S^\mu ,\hfill \end{array}$$

where $`x_{\{\phi \}}\text{Z}/m`$. Neglecting to denote $`()_\text{Z}\text{Z}/m`$ for maps and using the isomorphism $`\delta `$ from (3.5), we obtain the transposition isomorphism

$$\begin{array}{ccc}\hfill \text{Hom}_{\text{Z}𝒮_n}(S^\lambda /m,S^\mu /m)& \text{}& \text{Hom}_{\text{Z}𝒮_n}(S^\mu ^{}/m,S^\lambda ^{}/m)\hfill \\ \hfill f& \text{}& f^\text{t}:=\delta ^\mu f^,(\delta ^\lambda )^1.\hfill \end{array}$$

This definition can be rephrased via the formula

$$b^{}f^\text{t}=\underset{\{\phi \}\{\mathrm{\Phi }^{\mu ^{},\lambda ^{}}\}}{}x_{\{\phi \}}b^{}\mathrm{\Theta }_{\phi ^1},$$

note that $`\mathrm{\Theta }_{\phi ^1}`$ is applicable to $`b^{}S^\mu ^{}/mM^\mu ^{}/m`$. We have $`(f^\text{t})^\text{t}=f`$.

We dualize via $`()^{}:=\text{Hom}_\text{Z}(,\text{Z}/m)`$ to obtain the following diagram.

The commutativity on top follows from (3.2). On the left and on the right, commutativity follows by dualizing the commutativity in (3.5) in the sense of (3.6). The commutativity in the back is the dualized assumption on $`f`$ and the commutativity at the bottom is the definition of $`f^\text{t}`$. The claimed formula is equivalent to the commutativity in the front face. Moreover, (3.6) allows to conclude that

$$\begin{array}{ccc}\hfill (f^\text{t})^\text{t}& =& \delta ^\lambda ^{}f^{\text{t},,}(\delta ^\mu ^{})^1\hfill \\ & =& \delta ^\lambda ^{}(\delta ^{\lambda ,,})^1f^{}\delta ^{\mu ,,}(\delta ^\mu ^{})^1\hfill \\ & =& \text{eva}f^{}\text{eva}^1\hfill \\ & =& f.\hfill \end{array}$$

###### Question 3.17 (main technical obstacle)

Given $`S^\lambda /m\text{}S^\mu /m`$ as in (3.16), I do not know a formula for $`S^\mu ^{}/m\text{}S^\lambda ^{}/m`$ in terms of a factorization over $`M^{\mu ,}/m\text{}S^\mu ^{}/m`$ of a linear combination of maps of the form $`\mathrm{\Theta }_\psi ^{}\nu _S^\lambda ^{}`$, $`\{\psi \}\{\mathrm{\Phi }^{\lambda ,\mu }\}`$. I.e., I do not know a formula ‘in terms of polytabloids instead of tabloids’.

### 3.2 Remarks on transposition in characteristic $`2`$

Given an integer $`a1`$, we denote by $`a_2:=2^{v_2(a)}`$ its $`2`$-part. From the more general assertion in (4.2) below, but nevertheless readable independently, we take that for $`b1`$ we have $`v_2(\left(\begin{array}{c}a\\ i\end{array}\right))>0`$ for all $`i[1,b]`$ if and only if $`b<a_2`$. We say that a partition $`\lambda `$ of $`n`$ is $`2`$-convergent if $`\lambda _{p+1}^{}<(\lambda _p^{}+1)_2`$ for all $`p[1,\lambda _11]`$. For instance, if $`n=8`$, the list of $`2`$-convergent partitions is $`(1^8)^{}`$, $`(3,1^5)^{}`$, $`(3^2,1^2)^{}`$, $`(5,1^3)^{}`$, $`(3^2,2)^{}`$, $`(7,1)^{}`$, $`(8)^{}`$. Let $`[x]=[\mathrm{1\hspace{0.33em}2}\mathrm{}n]`$ denote the standard $`(n)`$-tableau.

###### Lemma 3.18 (cf. \[J 78, 24.4\], \[K 99, 4.3.35\])

Let $`\lambda `$ be a partition of $`n`$. We have

$$dim\text{Hom}_{\text{F}_2𝒮_n}(S^\lambda /2,S^{(n)}/2)=\{\begin{array}{cc}1\hfill & \text{ if }\lambda \text{ is }2\text{-convergent}\hfill \\ 0\hfill & \text{ else. }\hfill \end{array}$$

In case $`\lambda `$ is $`2`$-convergent, the nonzero morphism is of the form

$$\begin{array}{ccc}\hfill S^\lambda /2& \text{}& S^{(n)}/2\hfill \\ \hfill a& \text{}& x\hfill \end{array}$$

By transposition (3.16), we conclude that

$$dim\text{Hom}_{\text{F}_2𝒮_n}(S^{(n)}/2,S^\lambda /2)=\{\begin{array}{cc}1\hfill & \text{ if }\lambda ^{}\text{ is }2\text{-convergent}\hfill \\ 0\hfill & \text{ else. }\hfill \end{array}$$

By $`𝒮_n`$-linearity, a morphism $`S^\lambda /2\text{}S^{(n)}/2`$, if existent, is necessarily of the form just given. It remains to be seen that this map is well defined if and only if $`\lambda `$ is $`2`$-convergent.

Welldefinedness may be rephrased as the existence of a factorization of the map

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^{(n)}/2\hfill \\ \hfill [a]& \text{}& x\hfill \end{array}$$

over $`F^\lambda \text{}S^\lambda `$. A one-step Garnir relation

$$G_{[a],\xi ,\eta }^{\prime \prime }=\underset{\sigma 𝒮_\xi \times 𝒮_\eta \backslash 𝒮_{\xi \eta }}{}[a]\sigma \epsilon _\sigma ,$$

where $`\xi a_p`$ and $`\eta a_{p+1}`$ are subsets such that $`\mathrm{\#}\xi +\mathrm{\#}\eta =\lambda _p^{}+1`$ (cf. Section 1.1), is mapped to the element $`\left(\begin{array}{c}\lambda _p^{}+1\\ \mathrm{\#}\eta \end{array}\right)xS^{(n)}/2`$. Thus the map is well defined if and only if $`\left(\begin{array}{c}\lambda _p^{}+1\\ i\end{array}\right)_20`$ for all $`p[1,\lambda _11]`$ and for all $`i[1,\lambda _{p+1}^{}]`$.

###### Lemma 3.19

Let $`\lambda `$ be a partition of $`n`$. Let $`\chi ^\lambda `$ be the characteristic function of the subset $`C_{[a_\lambda ]}R_{[a_\lambda ]}𝒮_n`$, i.e. $`\chi _\sigma ^\lambda =1`$ for $`\sigma C_{[a_\lambda ]}R_{[a_\lambda ]}`$, and $`\chi _\sigma ^\lambda =0`$ for $`\sigma 𝒮_n\backslash C_{[a_\lambda ]}R_{[a_\lambda ]}`$. Let $`P^\lambda 𝒮_n`$ be the subset of permutations $`\sigma `$ for which $`[a_\lambda ]\sigma `$ is a standard tableau. We suppose given a nonzero $`\text{F}_2𝒮_n`$-linear map (unique if existent, cf. 3.18)

$$\begin{array}{ccc}\hfill S^{(n)}/2& \text{}& S^\lambda /2\hfill \\ \hfill x& \text{}& \underset{\tau P^\lambda }{}u_\tau ^\lambda a_\lambda \tau .\hfill \end{array}$$

For each $`\sigma P^\lambda `$, we obtain

$$1_2\underset{\tau P^\lambda }{}u_\tau ^\lambda \chi _{\tau \sigma ^1}^\lambda .$$

Moreover, $`(\chi _{\tau \sigma ^1}^\lambda )_{\tau \times \sigma P^\lambda \times P^\lambda }\text{GL}_{\text{rk}S^\lambda }(\text{F}_2)`$.

Note that the transpose of $`u^\lambda `$ maps each polytabloid to the nonzero element (3.18).

Disregarding alternation, we obtain on the one hand, $`\sigma 𝒮_n`$,

$$x\text{}\underset{\tau P^\lambda }{}u_\tau ^\lambda (\{a_\lambda \}\sigma ,a_\lambda \tau )$$

and on the other hand

$$x\text{}(\{x\},x)=1.$$

It remains to be shown that $`(\{a_\lambda \}\sigma ,a_\lambda \tau )_2\chi _{\tau \sigma ^1}^\lambda `$ for $`\tau ,\sigma P^\lambda `$. But $`(\{a_\lambda \}\sigma ,a_\lambda \tau )_21`$ is equivalent to the existence of $`\kappa C_{[a_\lambda ]}`$ and $`\rho R_{[a_\lambda ]}`$ such that $`[a_\lambda ]\rho =[a_\lambda ]\kappa \tau \sigma ^1`$. The invertibility of the matrix $`(\chi _{\tau \sigma ^1}^\lambda )_{\tau \times \sigma P^\lambda \times P^\lambda }`$ follows from (3.5). Cf. \[K 99, 6.2.8\].

For instance, in case $`\lambda =(3,2)`$, $`[a_\lambda ]=[\stackrel{ˇ}{a}_\lambda ]`$, and thus $`P^{(3,2)}=\{1,(45),(23),(23)(45),(2453)\}`$, this invertible matrix over $`\text{F}_2`$ turns out to be

$$(\chi _{\tau \sigma ^1}^{(3,2)})_{\tau \times \sigma P^{(3,2)}\times P^{(3,2)}}=\left[\begin{array}{ccccc}1\hfill & 0\hfill & 0\hfill & 0\hfill & 0\hfill \\ 0\hfill & 1\hfill & 0\hfill & 0\hfill & 0\hfill \\ 0\hfill & 0\hfill & 1\hfill & 0\hfill & 0\hfill \\ 0\hfill & 0\hfill & 0\hfill & 1\hfill & 0\hfill \\ 1\hfill & 0\hfill & 0\hfill & 0\hfill & 1\hfill \end{array}\right].$$

In case $`\lambda `$ is a hook partition, i.e. in case $`\lambda _i1`$ for $`i2`$, the matrix $`(\chi _{\tau \sigma ^1}^\lambda )_{\tau \times \sigma P^\lambda \times P^\lambda }`$ is the identity matrix. In particular, we recover \[K 99, 4.2.11\] by composition of a morphism as in (3.18) and the transpose, as given by (3.19), of a morphism as in (3.18). Cf. (3.31).

### 3.3 Paths as correspondoids

In order to transpose the vertical two-box-shift morphism in (2.37) via (3.16) to obtain a horizontal two-box-shift morphism, we translate the language of double paths to the language of correspondoids (3.25, 3.26) in order to be able to use our transposition formula (3.16) to obtain the provisional result (3.27, cf. 3.29). We shall use a slightly modified and generalized variant of the setup given in Section 2.1.

In this section maps are written on the right, with some exceptions made. Suppose given a partition $`\lambda `$ of $`n`$, an integer $`d1`$ and integers $`1gk\lambda _11`$ such that

$$\mu _i^{}:=\{\begin{array}{cc}\lambda _i^{}+d\hfill & \text{for }i=g\hfill \\ \lambda _i^{}d\hfill & \text{for }i=k+1\hfill \\ \lambda _i^{}\hfill & \text{else}\hfill \end{array}$$

defines a partition $`\mu `$. A weight $`e`$ is a map

$$\begin{array}{ccc}\hfill [1,\lambda _1]& \text{}& [0,d]\hfill \\ \hfill j& \text{}& e_j\hfill \end{array}$$

that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=d`$, and that maps $`j`$ to $`e_j=0`$ in case $`j[1,\lambda _1]\backslash [g,k+1]`$. A pattern $`\mathrm{\Xi }`$ of weight $`e`$ is a subset $`\mathrm{\Xi }[1,d]\times [g,k+1]`$ that has

$$\mathrm{\#}\left(\mathrm{\Xi }([1,d]\times \{j\})\right)=e_j$$

for $`j[g,k+1]`$. A $`d`$-fold path $`\gamma `$ of weight $`e`$ is an injection from a pattern $`\mathrm{\Xi }`$ of weight $`e`$ to $`[\lambda ][\mu ]`$ of the form

$$\begin{array}{ccc}\hfill \mathrm{\Xi }& \text{}& [\lambda ][\mu ]\hfill \\ \hfill i\times j& \text{}& \overline{\gamma }(j,i)\times j\hfill \end{array}$$

such that

$$\overline{\gamma }(g,i)=\lambda _g^{}+i\text{ for }i[1,d].$$

Sometimes, we denote its pattern by $`\mathrm{\Xi }_\gamma :=\mathrm{\Xi }`$. The set of $`d`$-fold paths of weight $`e`$ is denoted by $`\mathrm{\Gamma }(e)`$.

An ordered $`d`$-fold path of weight $`e`$ is a $`d`$-fold path $`\gamma `$ for which the application

$$\{i[1,d]|i\times j\mathrm{\Xi }_\gamma \}\text{}[1,\lambda _j^{}]$$

is increasing for each $`j[g+1,k+1]`$. The set of ordered $`d`$-fold paths of weight $`e`$ is denoted by $`\stackrel{}{\mathrm{\Gamma }}(e)`$.

Suppose given a weight $`e`$. For a $`d`$-fold path $`\gamma `$ of weight $`e`$, we let the successor permutation be defined by

$$\begin{array}{ccc}\hfill \mathrm{\Xi }_\gamma & \text{}& \mathrm{\Xi }_\gamma \hfill \\ \hfill i\times j& \text{}& \{\begin{array}{cc}i\times \mathrm{min}\{j^{}[j+1,k+1]|i\times j^{}\mathrm{\Xi }_\gamma \}\hfill & \text{ for }j[g,k]\hfill \\ i\times g\hfill & \text{ for }j=k+1.\hfill \end{array}\hfill \end{array}$$

Since $`\gamma `$ is an injection, we may define the permutation

$$[\lambda ^{}][\mu ^{}]\text{}[\lambda ^{}][\mu ^{}]$$

as the completion to a commutative diagram

in which the unlabeled arrows denote inclusions. Thus, roughly speaking, $`\widehat{\gamma }`$ is the identical prolongation of $`\text{suc}_\gamma `$ operating via $`\gamma `$. Given a $`d`$-fold path $`\gamma `$ of weight $`e`$, the permutation $`\sigma (\gamma )`$ of $`[\lambda ^{}][\mu ^{}]`$ is defined as being determined by the rule

$$\begin{array}{ccc}\hfill [\lambda ^{}][\mu ^{}]& \text{}& [\lambda ^{}][\mu ^{}]\hfill \\ \hfill j\times i& \text{}& \{\begin{array}{cccc}\hfill j& \times & i\hfill & \text{for }jk+1\hfill \\ \hfill (k+1)& \times & \overline{\gamma }(k+1,i\mu _{k+1}^{})\hfill & \text{for }j=k+1\text{ and }i[\mu _{k+1}^{}+1,\lambda _{k+1}^{}]\hfill \end{array}\hfill \end{array}$$

and by the requirement that its restriction to $`\{k+1\}\times [1,\mu _{k+1}^{}]`$ be of constant value $`k+1`$ in the first component and strictly increasing in the second component. Hence, the $`[\mu _{k+1}^{}+1,\lambda _{k+1}^{}]`$-part of the row $`k+1`$ of $`[\lambda ^{}][\mu ^{}]`$ is mapped under $`\sigma (\gamma )`$ to the image of $`\gamma \tau `$, whereas its $`[1,\mu _{k+1}^{}]`$-part is distributed, in a strictly increasing manner, over the complement of this image in that row. We define an element $`\stackrel{ˇ}{\gamma }\mathrm{\Phi }^{\mu ^{},\lambda ^{}}`$ as the completion to a commutative diagram

the unlabeled arrows denoting inclusions.

Given $`\kappa C_\lambda `$, we denote its transposition by $`\kappa ^{}R_\lambda ^{}`$, mapping $`j\times i[\lambda ^{}]`$ to $`(j\times i)\kappa ^{}:=(i\times j)\kappa \tau `$. The permutation of $`[\lambda ][\mu ]`$ that restricts to $`\kappa `$ on $`[\lambda ]`$ and to the identity on $`[\mu ]\backslash [\lambda ]`$ is denoted by $`\widehat{\kappa }`$. Similarly, the identical prolongation of $`\kappa ^{}`$ to a permutation of $`[\lambda ^{}][\mu ^{}]`$ is denoted by $`\widehat{\kappa }^{}`$. Likewise for $`\mu `$ instead of $`\lambda `$.

###### Lemma 3.20

Let $`\gamma `$ be a $`d`$-fold path of weight $`e`$, let $`\kappa C_\lambda `$. We note that the composition $`\gamma \widehat{\kappa }`$ is again a $`d`$-fold path of weight $`e`$, of the same pattern as $`\gamma `$, and obtain

$$\begin{array}{ccc}\hfill (\gamma \widehat{\kappa })\widehat{}& =& (\widehat{\kappa }^{})^1\widehat{\gamma }\widehat{\kappa }^{}\hfill \\ \hfill (\gamma \widehat{\kappa })\stackrel{ˇ}{}& =& (\kappa _0^{})^1\stackrel{ˇ}{\gamma }\kappa ^{}\hfill \end{array}$$

for some $`\kappa _0C_\mu `$.

The first equality holds since right conjugation of a cycle product in the symmetric group is performed by an application of the conjugating element to the cycle entries. To see the second equality, we consider the diagram

in which $`\kappa _0^1`$ is the completion by restriction and in which the unlabeled arrows denote inclusions. Note that $`\sigma (\gamma \widehat{\kappa })\widehat{\kappa }^1\sigma (\gamma )^1`$ restricts identically to the row k+1 of $`[\lambda ^{}][\mu ^{}]`$.

For each weight $`e`$, we fix a $`d`$-fold path $`\gamma _e`$ of weight $`e`$ and write

$$\epsilon (e):=\epsilon _{\sigma (\gamma _e)}\epsilon _{[a_\mu ^{}]^1\stackrel{ˇ}{\gamma }_e[a_\lambda ^{}]}.$$

###### Lemma 3.21

The sign $`\epsilon (e)`$ is independent of the choice of $`\gamma _e`$. More precisely, given a $`d`$-fold path $`\gamma `$ of weight $`e`$, we obtain

$$\epsilon _{\stackrel{ˇ}{\gamma }_e^1\stackrel{ˇ}{\gamma }}=\epsilon _{\sigma (\gamma _e)}\epsilon _{\sigma (\gamma )}.$$

Note that $`\epsilon _{\stackrel{ˇ}{\gamma }\stackrel{ˇ}{\gamma }_e^1}=\epsilon _{\sigma (\gamma )\widehat{\gamma }\widehat{\gamma }_e^1\sigma (\gamma _e)^1}`$ since $`\sigma (\gamma )\widehat{\gamma }\widehat{\gamma }_e^1\sigma (\gamma _e)^1`$ restricts to the identity on $`[\lambda ^{}]\backslash [\mu ^{}]`$. Moreover, we claim that $`\epsilon _{\widehat{\gamma }}`$ depends only on the weight of $`\gamma `$. First of all, it depends only on the pattern of $`\gamma `$, since this pattern determines the cycle type of $`\widehat{\gamma }`$. The sign of this cycle type in turn depends only on the cardinality $`_{j[g,k+1]}e_j`$ of that pattern, since the number of cycles of length $`2`$ that occur in $`\widehat{\gamma }`$ equals $`d`$. Altogether, after a reordering we obtain $`\epsilon _{\stackrel{ˇ}{\gamma }_e^1\stackrel{ˇ}{\gamma }}=\epsilon _{\sigma (\gamma )}\epsilon _{\sigma (\gamma _e)}`$.

###### Lemma 3.22

Given a $`d`$-fold path $`\gamma `$ of weight $`e`$ and a $`\lambda `$-tableau $`[a]`$, we obtain

$$(\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu =(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}\epsilon (e)\epsilon _{[a]^1[a_\lambda ]}S^\mu .$$

We may conclude

$$\begin{array}{ccc}\hfill (\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu & =& (\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{[a_\mu ^{}]^1\stackrel{ˇ}{\gamma }[a^{}]}\hfill \\ & =& (\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{[a_\mu ^{}]^1\stackrel{ˇ}{\gamma }_e[a_\lambda ^{}]}\epsilon _{[a_\lambda ^{}]^1[a^{}]}\epsilon _{[a^{}]^1\stackrel{ˇ}{\gamma }_e^1\stackrel{ˇ}{\gamma }[a^{}]}\hfill \\ & \stackrel{\text{(}\text{3.21}\text{)}}{=}& (\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon (e)\epsilon _{[a]^1[a_\lambda ]}\epsilon _{\sigma (\gamma )}.\hfill \end{array}$$

###### Lemma 3.23

Let $`\gamma `$ be a $`d`$-fold path of weight $`e`$. For $`\xi 𝒮_d`$ and $`j[g+1,k+1]`$ we let $`\xi `$ operate on the columns $`j`$ via

$$\begin{array}{ccc}\hfill \mathrm{\Xi }_\gamma & \text{}& [1,d]\times [g,k+1]\hfill \\ \hfill i\times j^{}& \text{}& \{\begin{array}{cccc}\hfill i& \times & j^{}\hfill & \text{ for }j^{}\{g\}[j+1,k+1]\hfill \\ \hfill (i)\xi & \times & j^{}\hfill & \text{ for }j^{}[g+1,j].\hfill \end{array}\hfill \end{array}$$

We suppose in addition that $`\xi _j`$ restricts identically to $`[1,d]\times \{j\}\backslash \mathrm{\Xi }_\gamma `$. Then the composition $`\left((\mathrm{\Xi }_\gamma )\xi _j\text{}\mathrm{\Xi }_\gamma \text{}[\lambda ][\mu ]\right)`$ is a $`d`$-fold path of weight $`e`$. Given a $`\lambda `$-tableau $`[a]`$, we obtain

$$(\{(\xi _j^1\gamma )\stackrel{ˇ}{}[a^{}]\}1)\nu _S^\mu =\{\begin{array}{cc}(\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu \hfill & \text{ for }j[g+1,k]\hfill \\ (\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu \epsilon _\xi \hfill & \text{ for }j=k+1.\hfill \end{array}$$

We may suppose $`\xi `$ to be a transposition, $`\xi =(s,t)`$, $`s\times j,t\times j\mathrm{\Xi }_j`$, $`st`$. In case $`j[g+1,k]`$ we obtain, composing with transpositions permuting $`[\mu ^{}]`$,

$$((s,t)_j\gamma )\stackrel{ˇ}{}=\stackrel{ˇ}{\gamma }((s\times g)\gamma ,(t\times g)\gamma )((s\times j)\gamma ,(t\times j)\gamma ),$$

yielding the required equality by two column permutations applied to the resulting polytabloid.

In case $`j=k+1`$, we obtain

$$((s,t)_{k+1}\gamma )\stackrel{ˇ}{}=\stackrel{ˇ}{\gamma }((s\times g)\gamma ,(t\times g)\gamma ),$$

yielding the required equality by a single column permutation applied to the resulting polytabloid.

Given a weight $`e`$, we write

$$\begin{array}{ccc}\hfill e!& :=& \underset{j[1,\lambda _1]\backslash \{g\}}{}e_j!\hfill \\ \hfill \lambda ^{}!& :=& \underset{j[1,\lambda _1]\backslash \{g\}}{}\lambda _j^{}!\hfill \\ \hfill (\lambda ^{}e)!& :=& \underset{j[1,\lambda _1]\backslash \{g\}}{}(\lambda _j^{}e_j)!\hfill \end{array}$$

###### Corollary 3.24

Let $`e`$ be a weight, let $`[a]`$ be a $`\lambda `$-tableau. We obtain

$$\underset{\gamma \mathrm{\Gamma }(e)}{}(\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu \epsilon _{\sigma (\gamma )}=e!\underset{\gamma \stackrel{}{\mathrm{\Gamma }}(e)}{}(\{\stackrel{ˇ}{\gamma }[a^{}]\}1)\nu _S^\mu \epsilon _{\sigma (\gamma )}.$$

We rewrite this sum columnwise from right to left in that we use (3.23) to impose an ordering condition on $`\gamma `$ in column $`j`$, starting in column $`j=k+1`$ and ending in column $`j=g+1`$. So we obtain a factor $`e_j!`$ in column $`j`$.

Given a weight $`e`$, we let

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill [a]& \text{}& [a]𝔣_e^{\prime \prime }:=\underset{\gamma \stackrel{}{\mathrm{\Gamma }}(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}.\hfill \end{array}$$

###### Remark 3.25 (connection to Section 2.1)

In case of $`d=2`$, we obtain that the set of ordered double paths, defined in Section 2.1, and the set of ordered $`2`$-fold paths, defined here, coincide. Moreover, $`[a]`$ being a $`\lambda `$-tableau, $`e`$ being a weight, we obtain

$$[a]f_e^{\prime \prime }=\frac{e!}{2}[a]𝔣_e^{\prime \prime },$$

the left hand side written in the notation of Section 2.1, the right hand side written in the notation introduced here.

The set $`\mathrm{\Gamma }(e)`$ is the disjoint union of $`\dot{\mathrm{\Gamma }}(e)`$ and $`(1,2)_{k+1}\dot{\mathrm{\Gamma }}(e)`$. We may rewrite the right hand side as

$$\begin{array}{ccc}\hfill \left(\underset{j[g+1,k]}{}e_j!\right)\underset{\gamma \stackrel{}{\mathrm{\Gamma }}(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}& \stackrel{\text{(}\text{3.24}\text{)}}{=}& (e_{k+1}!)^1\underset{\gamma \mathrm{\Gamma }(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}\hfill \\ & \stackrel{\text{(}\text{3.23}\text{)}}{=}& \underset{\gamma \dot{\mathrm{\Gamma }}(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _\gamma \hfill \\ & =& [a]f_e^{\prime \prime },\hfill \end{array}$$

where $`\epsilon _\gamma =(1)^{\overline{\gamma }(k+1,1)+\overline{\gamma }(k+1,2)}`$ as introduced in Section 2.1, and where for the last equality we translate $`[a^\gamma ]=(\stackrel{ˇ}{\gamma }[a^{}])^{}`$.

###### Proposition 3.26

Let $`e`$ be a weight. We may reformulate

$$[a]𝔣_e^{\prime \prime }=\frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\{a^{}\}^{}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }}^{}\nu _S^\mu \epsilon (e),$$

where $`\gamma \mathrm{\Gamma }(e)/C_\lambda `$ signifies that $`\gamma `$ runs over a set of orbit representatives of $`\mathrm{\Gamma }(e)`$ under the operation of $`C_\lambda `$ in the sense of (3.20). In particular, there is a factorization

$$(F^\lambda \text{}S^\mu )=(F^\lambda \text{}M^{\lambda ,}\text{}S^\mu ).$$

Given a $`d`$-fold path $`\gamma `$ of weight $`e`$, the stabilizer $`\{\kappa C_\lambda |\gamma \widehat{\kappa }=\gamma \}`$ of $`\gamma `$ in $`C_\lambda `$ has cardinality $`(\lambda ^{}e)!\lambda _g^{}`$. So we calculate

$$\begin{array}{ccc}\hfill [a]𝔣_e^{\prime \prime }& =& \underset{\gamma \stackrel{}{\mathrm{\Gamma }}(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}\hfill \\ & \stackrel{\text{(}\text{3.24}\text{)}}{=}& \frac{1}{e!}\underset{\gamma \mathrm{\Gamma }(e)}{}(\stackrel{ˇ}{\gamma }[a^{}])^{}\epsilon _{\sigma (\gamma )}\hfill \\ & =& \frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}r_{\stackrel{ˇ}{\gamma }}^1\underset{\kappa C_\lambda }{}(\gamma \widehat{\kappa })\stackrel{ˇ}{}[a^{}])^{}\epsilon _{\sigma (\gamma )}\hfill \\ & \stackrel{\text{(}\text{3.22}\text{)}}{=}& \frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}r_{\stackrel{ˇ}{\gamma }}^1\underset{\kappa C_\lambda }{}(\{(\gamma \widehat{\kappa })\stackrel{ˇ}{}[a^{}]\}1)\nu _S^\mu \epsilon (e)\epsilon _{[a]^1[a_\lambda ]}\hfill \end{array}$$

$$\begin{array}{ccc}& \stackrel{\text{(}\text{3.20}\text{)}}{=}& \frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\left(\left(r_{\stackrel{ˇ}{\gamma }}^1\underset{\kappa ^{}R_\lambda ^{}}{}\{\stackrel{ˇ}{\gamma }\kappa ^{}[a^{}]\}\right)1\right)\nu _S^\mu \epsilon (e)\epsilon _{[a]^1[a_\lambda ]}\hfill \\ & \stackrel{\text{(}\text{3.1}\text{)}}{=}& \frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\left(\{a^{}\}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }}1\right)\nu _S^\mu \epsilon (e)\epsilon _{[a]^1[a_\lambda ]}\hfill \\ & =& \frac{1}{e!(\lambda ^{}e)!\lambda _g^{}}\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\{a^{}\}^{}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }}^{}\nu _S^\mu \epsilon (e).\hfill \end{array}$$

###### Corollary 3.27 (to 2.37 via 3.26)

Let $`d=2`$. The transpose in the sense of (3.16) of the morphism given in (2.37) is obtained as a factorization

where

$$[b^{}]f^{\text{t},0}:=\underset{eE}{}\frac{1}{(\lambda ^{}e)!2R\lambda _g^{}}\left(\underset{i[g+1,k]}{}X_i^{(2e_i)}\right)\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}b^{}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }^1}\epsilon (e),$$

and where $`f`$, $`E`$, $`R`$, $`m`$ and $`X_i`$ are defined as for (2.37).

Given $`t,T2`$, Z-lattices $`X`$ and $`Y`$ and a Z-linear map $`X/t\text{}Y/t`$, we denote

$$(X/(tT)\text{}Y/(tT)):=(X/(tT)\text{}X/t\text{}Y/t\text{}Y/(tT)).$$

Let $`M:=R\lambda ^{}!2\lambda _g^{}`$ play the role of a large enough integer and consider the morphism

$$\begin{array}{ccc}\hfill S^\lambda /(mM)& \text{}& S^\mu /(mM)\hfill \\ \hfill a& \text{}& \lambda ^{}!2\lambda _g^{}\underset{eE}{}\left(\underset{i[g+1,k]}{}X_i^{(2e_i)}\right)\{a^{}\}^{}f_e^{}\hfill \\ & \stackrel{\text{(}\text{3.25}\text{}\text{3.26}\text{)}}{=}& \lambda ^{}!\lambda _g^{}\underset{eE}{}\left(\underset{i[g+1,k]}{}X_i^{(2e_i)}\right)\{a^{}\}^{}𝔣_e^{}\hfill \\ & \stackrel{\text{(}\text{3.26}\text{)}}{=}& \underset{eE}{}\frac{\lambda ^{}!}{(\lambda ^{}e)!}\left(\underset{i[g+1,k]}{}X_i^{(2e_i)}\right)\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\{a^{}\}^{}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }}^{}\nu _S^\mu \epsilon (e).\hfill \end{array}$$

For $`\phi \mathrm{\Phi }^{\mu ^{},\lambda ^{}}`$, the coefficient $`x_{\{\phi \}}`$ in the sense of (3.16) can be written as

$$x_{\{\phi \}}=\underset{eE}{}\frac{\lambda ^{}!}{(\lambda ^{}e)!}(\underset{i[g+1,k]}{}X_i^{(2e_i)})\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}\left\{\begin{array}{cc}1\hfill & \text{ for }\left\{\stackrel{ˇ}{\gamma }\right\}=\left\{\phi \right\}\hfill \\ 0\hfill & \text{ else }\hfill \end{array}\right\}\epsilon (e).$$

Thus, by (3.16), the transpose of $`S^\lambda /(mM)\text{}S^\mu /(mM)`$ maps

$$\begin{array}{ccc}\hfill S^\mu ^{}/(mM)& \hfill \text{}& S^\lambda ^{}/(mM)\hfill \\ \hfill b^{}& \hfill \text{}& \underset{eE}{}\frac{\lambda ^{}!}{(\lambda ^{}e)!}(\underset{i[g+1,k]}{}X_i^{(2e_i)})\underset{\gamma \mathrm{\Gamma }(e)/C_\lambda }{}r_{\stackrel{ˇ}{\gamma }}b^{}\mathrm{\Theta }_{\stackrel{ˇ}{\gamma }^1}\epsilon (e)\hfill \end{array}$$

Finally, there is a commutative diagram

with vertical injections given by multiplication by $`M`$, so that $`f^\text{t}M=(fM)^\text{t}`$.

###### Remark 3.28

Consider the set $`\stackrel{}{\mathrm{\Gamma }}_0(e)`$ of ordered $`d`$-fold paths $`\gamma `$ of weight $`e`$ that have $`\overline{\gamma }(j,i)[\lambda _j^{}e_j,\lambda _j^{}]`$ for $`i\times j\mathrm{\Xi }_{[g+1,k+1]}`$, i.e. that have their positions sitting at the bottoms of the columns. We say that a correspondoid $`\{\phi \}\{\mathrm{\Phi }^{\mu ^{},\lambda ^{}}\}`$ is semistandard up to row permutation if there exists a row permutation $`\rho R_\mu ^{}`$ such that $`\{\rho \phi \}\{\mathrm{\Phi }^{\mu ^{},\lambda ^{}}\}_{\text{sst}}`$ becomes semistandard. Note that $`\mathrm{\Theta }_\phi =\mathrm{\Theta }_{\rho \phi }`$ by (3.1). For $`\gamma \stackrel{}{\mathrm{\Gamma }}_0(e)`$, the correspondoid $`\{\stackrel{ˇ}{\gamma }^1\}`$ is semistandard up to row permutation as long as $`\mathrm{\Xi }_\gamma `$ is not bulky in the sense introduced at the beginning of Section 2.3. Cf. the bases in (3.13), cf. the reduced tuple of coefficients employed in (2.37).

Note that $`\stackrel{}{\mathrm{\Gamma }}_0(e)`$ is a set of representatives of $`\mathrm{\Gamma }(e)/C_\lambda `$.

###### Question 3.29

I do not know a formula for the transpose $`f^\text{t}`$ given in (3.27) in terms of $`\lambda ^{}`$-polytabloids. Cf. (3.17).

### 3.4 Horizontal examples

We shall transpose some examples of Section 2.4 with respect to the convention that $`[a_\lambda ]=[\stackrel{ˇ}{a}_\lambda ]`$ for all partitions $`\lambda `$, cf. Section 1.1. Again, we omit to denote the brackets that indicate polytabloids, moreover, we omit commas in cycles. If possible (cf. 3.13), we sort the resulting linear combination of polytabloids into images under $`\mathrm{\Theta }_\phi ^{}\nu _S^\lambda ^{}`$ for various (implicitely present) correspondoids $`\{\phi \}`$. The formula in (3.27) does not suffice to give the coefficients of this expression (cf. 3.17, 4.15).

###### Example 3.30

Let $`\lambda =(3,3)`$, $`\mu =(2,2,1,1)`$. The transpose of the morphism given in (2.40) is

$$\begin{array}{ccc}\hfill S^\mu ^{}/4& \text{}& S^\lambda ^{}/4\hfill \\ \hfill \begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 6\hfill \\ 2\hfill & 4\hfill & & \end{array}& \text{}& \begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 6\hfill \end{array}\left(1\left(34\right)\right)+2\begin{array}{cc}1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 5\hfill & 6\hfill \end{array}.\hfill \end{array}$$

###### Example 3.31

Let $`\lambda =(3,2,2)`$, $`\mu =(3,1,1,1,1)`$. The transposes of the morphisms given in (2.41) are

$$\begin{array}{ccc}\hfill S^\mu ^{}/3& \text{}& S^\lambda ^{}/3\hfill \\ \hfill \begin{array}{ccccc}1\hfill & 4\hfill & 5\hfill & 6\hfill & 7\hfill \\ 2\hfill & & & & \\ 3\hfill & & & & \end{array}& \text{}& \begin{array}{ccc}1\hfill & 4\hfill & 6\hfill \\ 2\hfill & 5\hfill & 7\hfill \\ 3\hfill & & \end{array}\begin{array}{ccc}1\hfill & 4\hfill & 5\hfill \\ 2\hfill & 6\hfill & 7\hfill \\ 3\hfill & & \end{array}.\hfill \end{array}$$

and

$$\begin{array}{ccc}\hfill S^\mu ^{}/2& \text{}& S^\lambda ^{}/2\hfill \\ \hfill \begin{array}{ccccc}1\hfill & 4\hfill & 5\hfill & 6\hfill & 7\hfill \\ 2\hfill & & & & \\ 3\hfill & & & & \end{array}& \text{}& \begin{array}{ccc}1\hfill & 2\hfill & 6\hfill \\ 3\hfill & 4\hfill & 7\hfill \\ 5\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 4\hfill & 5\hfill \\ 2\hfill & 6\hfill & 7\hfill \\ 3\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 6\hfill & 7\hfill \\ 4\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 5\hfill \\ 3\hfill & 6\hfill & 7\hfill \\ 4\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 4\hfill \\ 2\hfill & 6\hfill & 7\hfill \\ 5\hfill & & \end{array}\hfill \\ & & +\begin{array}{ccc}1\hfill & 2\hfill & 4\hfill \\ 3\hfill & 6\hfill & 7\hfill \\ 5\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 3\hfill \\ 4\hfill & 6\hfill & 7\hfill \\ 5\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 5\hfill \\ 3\hfill & 4\hfill & 7\hfill \\ 6\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 4\hfill \\ 2\hfill & 5\hfill & 7\hfill \\ 6\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 4\hfill \\ 3\hfill & 5\hfill & 7\hfill \\ 6\hfill & & \end{array}\hfill \\ & & +\begin{array}{ccc}1\hfill & 2\hfill & 3\hfill \\ 4\hfill & 5\hfill & 7\hfill \\ 6\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 5\hfill \\ 3\hfill & 4\hfill & 6\hfill \\ 7\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 3\hfill & 4\hfill \\ 2\hfill & 5\hfill & 6\hfill \\ 7\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 4\hfill \\ 3\hfill & 5\hfill & 6\hfill \\ 7\hfill & & \end{array}+\begin{array}{ccc}1\hfill & 2\hfill & 3\hfill \\ 4\hfill & 5\hfill & 6\hfill \\ 7\hfill & & \end{array}.\hfill \end{array}$$

Let us consider the morphism $`u^{\mu ,\text{t}}u^\lambda ^{}`$. Using $`[a_\lambda ^{}]=[\stackrel{ˇ}{a}_\lambda ^{}]`$, we obtain, in the notation of (3.19),

$$\begin{array}{c}P^\lambda ^{}=\{1,(56),(34),(34)(56),(354),(3564),(3654),(364),(37654),(3764),(234),(234)(56),\hfill \\ (2354),(23564),(23654),(2364),(237654),(23764),(24)(356),(24)(36),(24)(376)\}𝒮_7.\hfill \end{array}$$

Hence, with respect to the ordering of $`P^\lambda ^{}`$ just indicated, the matrix $`(\chi _{\tau \sigma ^1}^\lambda ^{})_{\tau \times \sigma P^\lambda ^{}\times P^\lambda ^{}}`$ takes the form

$$\left[\begin{array}{ccccccccccccccccccccc}\hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 1& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0\\ \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1& \hfill 0& \hfill 1& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 0& \hfill 1\end{array}\right].$$

By labelling our morphism as $`u^{\mu ,\text{t}}u^\lambda ^{}`$, we implicitely claimed the tuple $`(u_\tau ^\lambda ^{})_{\tau P^\lambda ^{}}`$ to be represented by the vector

$$[0,1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,1,1,1,1,1].$$

But this row vector yields a row vector of constant entry $`1`$ by right multiplication with that matrix, which confirms this claim.

Furthermore, as remarked after (3.19), the matrix $`(\chi _{\tau \sigma ^1}^\mu )_{\tau \times \sigma P^\mu \times P^\mu }`$ equals the identity matrix.

###### Example 3.32

Let $`\lambda =(3,3,1,1)`$, $`\mu =(2,2,1,1,1,1)`$. The transpose of the morphism given in (2.42) is

$$\begin{array}{ccc}\hfill S^\mu ^{}/6& \text{}& S^\lambda ^{}/6\hfill \\ \hfill \begin{array}{cccccc}1\hfill & 3\hfill & 5\hfill & 6\hfill & 7\hfill & 8\hfill \\ 2\hfill & 4\hfill & & & & \end{array}& \text{}& \begin{array}{cccc}1\hfill & 4\hfill & 7\hfill & 8\hfill \\ 2\hfill & 5\hfill & & \\ 3\hfill & 6\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 7\hfill & 8\hfill \\ 2\hfill & 4\hfill & & \\ 5\hfill & 6\hfill & & \end{array}\hfill \\ & & \begin{array}{cccc}1\hfill & 4\hfill & 6\hfill & 8\hfill \\ 2\hfill & 5\hfill & & \\ 3\hfill & 7\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 6\hfill & 8\hfill \\ 2\hfill & 4\hfill & & \\ 5\hfill & 7\hfill & & \end{array}\hfill \\ & & \begin{array}{cccc}1\hfill & 4\hfill & 5\hfill & 8\hfill \\ 2\hfill & 6\hfill & & \\ 3\hfill & 7\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 8\hfill \\ 2\hfill & 4\hfill & & \\ 6\hfill & 7\hfill & & \end{array}\hfill \\ & & \begin{array}{cccc}1\hfill & 4\hfill & 6\hfill & 7\hfill \\ 2\hfill & 5\hfill & & \\ 3\hfill & 8\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 6\hfill & 7\hfill \\ 2\hfill & 4\hfill & & \\ 5\hfill & 8\hfill & & \end{array}\hfill \\ & & \begin{array}{cccc}1\hfill & 4\hfill & 5\hfill & 7\hfill \\ 2\hfill & 6\hfill & & \\ 3\hfill & 8\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & & \\ 6\hfill & 8\hfill & & \end{array}\hfill \\ & & \begin{array}{cccc}1\hfill & 4\hfill & 5\hfill & 6\hfill \\ 2\hfill & 7\hfill & & \\ 3\hfill & 8\hfill & & \end{array}\left(1\left(34\right)\right)2\begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 6\hfill \\ 2\hfill & 4\hfill & & \\ 7\hfill & 8\hfill & & \end{array}.\hfill \end{array}$$

###### Example 3.33

Let $`\lambda =(4,4)`$, $`\mu =(3,3,1,1)`$. The transpose of the morphism given in (2.41) is

$$\begin{array}{ccc}\hfill S^\mu ^{}/5& \text{}& S^\lambda ^{}/5\hfill \\ \hfill \begin{array}{cccc}1\hfill & 4\hfill & 7\hfill & 8\hfill \\ 2\hfill & 5\hfill & & \\ 3\hfill & 6\hfill & & \end{array}& \text{}& \begin{array}{cc}1\hfill & 5\hfill \\ 2\hfill & 6\hfill \\ 3\hfill & 7\hfill \\ 4\hfill & 8\hfill \end{array}\left(1\left(45\right)\left(46\right)\right)3\begin{array}{cc}1\hfill & 4\hfill \\ 2\hfill & 5\hfill \\ 3\hfill & 6\hfill \\ 7\hfill & 8\hfill \end{array}.\hfill \end{array}$$

###### Example 3.34

Let $`\lambda =(3,3,2)`$, $`\mu =(2,2,2,1,1)`$. The transpose of the morphism given in (2.41) is

$$\begin{array}{ccc}\hfill S^\mu ^{}/5& \text{}& S^\lambda ^{}/5\hfill \\ \hfill \begin{array}{ccccc}1\hfill & 3\hfill & 5\hfill & 7\hfill & 8\hfill \\ 2\hfill & 4\hfill & 6\hfill & & \end{array}& \text{}& \begin{array}{ccc}1\hfill & 4\hfill & 7\hfill \\ 2\hfill & 5\hfill & 8\hfill \\ 3\hfill & 6\hfill & \end{array}\left(1\left(34\right)\right)2\begin{array}{ccc}1\hfill & 4\hfill & 6\hfill \\ 2\hfill & 5\hfill & 8\hfill \\ 3\hfill & 7\hfill & \end{array}\left(1\left(34\right)\right)\left(1\left(56\right)\right)\hfill \\ & & \begin{array}{ccc}1\hfill & 3\hfill & 6\hfill \\ 2\hfill & 4\hfill & 8\hfill \\ 5\hfill & 7\hfill & \end{array}\left(1\left(56\right)\right)+\begin{array}{ccc}1\hfill & 4\hfill & 6\hfill \\ 2\hfill & 5\hfill & 7\hfill \\ 3\hfill & 8\hfill & \end{array}\left(1\left(34\right)\right)\left(1\left(56\right)\right)\hfill \\ & & \begin{array}{ccc}1\hfill & 3\hfill & 6\hfill \\ 2\hfill & 4\hfill & 7\hfill \\ 5\hfill & 8\hfill & \end{array}\left(1\left(56\right)\right)+2\begin{array}{ccc}1\hfill & 3\hfill & 5\hfill \\ 2\hfill & 4\hfill & 6\hfill \\ 7\hfill & 8\hfill & \end{array}.\hfill \end{array}$$

###### Example 3.35

Let $`\lambda =(3,3,1,1)`$, $`\mu =(2,2,2,2)`$. The transpose of the morphism given in (2.45) is

$$\begin{array}{ccc}\hfill S^\mu ^{}/3& \text{}& S^\lambda ^{}/3\hfill \\ \hfill \begin{array}{cccc}1\hfill & 3\hfill & 5\hfill & 7\hfill \\ 2\hfill & 4\hfill & 6\hfill & 8\hfill \end{array}& \text{}& \begin{array}{cccc}1\hfill & 4\hfill & 6\hfill & 8\hfill \\ 2\hfill & 5\hfill & & \\ 3\hfill & 7\hfill & & \end{array}\left(1\left(34\right)\right)\left(1\left(56\right)\right)\left(1\left(78\right)\right)\hfill \\ & & \begin{array}{cccc}1\hfill & 3\hfill & 6\hfill & 8\hfill \\ 2\hfill & 4\hfill & & \\ 5\hfill & 7\hfill & & \end{array}\left(1\left(56\right)\right)\left(1\left(78\right)\right).\hfill \end{array}$$

###### Remark 3.36

The morphisms in (2.46, 2.47) are transposed to their respective negative, $`g^\text{t}=g`$. For instance, the morphism $`S^{(4,3)}/4\text{}S^{(2,2,2,1)}/4`$ given in (2.46) can be obtained as

$$\nu _S^\lambda g_4(2\mathrm{\Theta }_{\phi _1}^{}\mathrm{\Theta }_{\phi _2}^{}+2\mathrm{\Theta }_{\phi _3}^{})\nu _S^\mu ,$$

$$\{\phi _1\}:=\left\{\begin{array}{cc}1\hfill & 3\hfill \\ 1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 2\hfill & \end{array}\right\},\{\phi _2\}:=\left\{\begin{array}{cc}1\hfill & 2\hfill \\ 1\hfill & 3\hfill \\ 2\hfill & 4\hfill \\ 3\hfill & \end{array}\right\},\{\phi _3\}:=\left\{\begin{array}{cc}1\hfill & 2\hfill \\ 1\hfill & 2\hfill \\ 3\hfill & 4\hfill \\ 3\hfill & \end{array}\right\}.$$

which allows to apply (3.16) directly and to compare linear combinations of tabloids.

## 4 Two columns, several boxes

We shall generalize (2.17), treating the case of essentially two columns and two shifted boxes, to the case of essentially two columns and an arbitrary number of shifted boxes.

###### Lemma 4.1

Let $`x,y0`$. As polynomials in the free variable $`t`$, we obtain

$$\underset{j[0,x]}{}(1)^{xj}\left(\begin{array}{c}y+j\\ j\end{array}\right)\left(\begin{array}{c}t\\ xj\end{array}\right)=\left(\begin{array}{c}yt+x\\ x\end{array}\right)\text{Q}[t],$$

where

$$\left(\begin{array}{c}f\left(t\right)\\ z\end{array}\right):=z!^1\underset{i[0,z1]}{}(f(t)i)$$

for $`f(t)\text{Q}[t]`$, $`z0`$. So, in particular, $`\left(\begin{array}{c}f\left(t\right)\\ 0\end{array}\right)=1`$.

We name the claimed equality $`\text{Eq}(x,y)`$ and shall prove the following assertions.

* $`\text{Eq}(0,y)`$ holds for $`y0`$.
* $`\text{Eq}(x,0)`$ holds for $`x0`$.
* $`\text{Eq}(x,y1)`$ and $`\text{Eq}(x1,y)`$ together imply $`\text{Eq}(x,y)`$ for $`x,y1`$.

Ad (i). $`\text{Eq}(0,y)`$ writes $`1=1`$.

Ad (ii). $`\text{Eq}(x,0)`$ writes

$$\underset{j[0,x]}{}(1)^j\left(\begin{array}{c}t\\ j\end{array}\right)=\left(\begin{array}{c}xt\\ x\end{array}\right).$$

Proceeding by induction on $`x`$ and using (i) we are reduced to consider differences, i.e. to see that

$$(1)^x\left(\begin{array}{c}t\\ x\end{array}\right)=\left(\begin{array}{c}\left(tx+1\right)\\ x\end{array}\right).$$

Ad (iii). The right hand side of $`\text{Eq}(x,y)`$ equals

$$\begin{array}{ccc}\hfill \left(\begin{array}{c}yt+x\\ x\end{array}\right)& =& \left(\begin{array}{c}yt+\left(x1\right)\\ \left(x1\right)\end{array}\right)+\left(\begin{array}{c}\left(y1\right)t+x\\ x\end{array}\right)\hfill \\ & \stackrel{\text{by assumption}}{=}& \underset{j[0,x1]}{}(1)^{x1j}\left(\begin{array}{c}y+j\\ j\end{array}\right)\left(\begin{array}{c}t\\ x1j\end{array}\right)+\underset{j[0,x]}{}(1)^{xj}\left(\begin{array}{c}y1+j\\ j\end{array}\right)\left(\begin{array}{c}t\\ xj\end{array}\right)\hfill \\ & =& \underset{j[1,x]}{}(1)^{xj}\left(\begin{array}{c}y+j1\\ j1\end{array}\right)\left(\begin{array}{c}t\\ xj\end{array}\right)+\underset{j[0,x]}{}(1)^{xj}\left(\begin{array}{c}y+j1\\ j\end{array}\right)\left(\begin{array}{c}t\\ xj\end{array}\right)\hfill \\ & =& \underset{j[0,x]}{}(1)^{xj}\left(\begin{array}{c}y+j\\ j\end{array}\right)\left(\begin{array}{c}t\\ xj\end{array}\right),\hfill \end{array}$$

being the left hand side.

###### Lemma 4.2

Let $`1kx`$. We have

$$\mathrm{gcd}(\left(\begin{array}{c}x\\ 1\end{array}\right),\left(\begin{array}{c}x\\ 2\end{array}\right),\mathrm{},\left(\begin{array}{c}x\\ k\end{array}\right))=x\underset{p\text{ prime, }p|x}{}p^{\mathrm{min}(v_p(x),\text{ilog}_p(k))},$$

where

$$\text{ilog}_p(k):=\mathrm{max}\{i0|p^ik\}=\mathrm{max}v_p([1,k]).$$

Let $`p`$ be a prime, let $`j[0,x]`$. For an integer $`w0`$, written $`p`$-adically as $`w={\displaystyle \underset{i0}{}}w_ip^i`$, $`w_i[0,p1]`$, we denote its Quersumme by $`q_p(w):={\displaystyle \underset{i0}{}}w_i`$. We obtain

$$v_p(j!)=\underset{i0}{}w_i\frac{p^i1}{p1}=\frac{jq_p(j)}{p1},$$

and thus

$$v_p(\left(\begin{array}{c}x\\ j\end{array}\right))=(p1)^1(q_p(xj)(q_p(x)q_p(j))).$$

In particular, in case $`jp^{v_p(x)}`$ we get $`q_p(xj)=(q_p(x)1)+(p1)(v_p(x)v_p(j)1)+p1q_p(j)`$, whence

$$v_p(\left(\begin{array}{c}x\\ j\end{array}\right))=v_p(x)v_p(j).$$

Thus the minimal such valuation for $`j[1,k]`$ takes the value claimed above.

Let $`n1`$, $`d1`$. Assume given a partition $`\lambda `$ of $`n`$ and an integer $`g[1,\lambda _11]`$ such that

$$\mu _i^{}:=\{\begin{array}{cc}\lambda _i^{}+d\hfill & \text{for }i=g\hfill \\ \lambda _i^{}d\hfill & \text{for }i=g+1\hfill \\ \lambda _i^{}\hfill & \text{else}\hfill \end{array}$$

defines a partition $`\mu `$. Let $`Z^{}`$ be the set of injective maps

$$[1,d]\text{}[1,\lambda _{g+1}^{}].$$

Let $`ZZ^{}`$ be the subset of strictly monotone maps. Let the sign of $`\zeta Z`$ be given by $`\epsilon _\zeta :=(1)^{_{i[1,d]}\zeta (i)}`$. For $`\zeta ^{}Z^{}`$ there is a unique factorization $`\zeta ^{}(i)=\stackrel{}{\zeta }^{}(i\sigma )`$, $`i[1,d]`$, with $`\sigma 𝒮_d`$ and $`\stackrel{}{\zeta }^{}Z`$. Let the sign of $`\zeta ^{}Z^{}`$ be given by $`\epsilon _\zeta ^{}:=\epsilon _\sigma \epsilon _\stackrel{}{\zeta }^{}`$. Suppose given a $`\lambda `$-tableau $`[a]`$ and an injection $`\zeta ^{}Z^{}`$. We let

$$\begin{array}{ccc}\hfill [0,\lambda _{g+1}^{}]& \text{}& [0,\mu _{g+1}^{}]\hfill \\ \hfill i& \text{}& \mathrm{\#}\left([1,i]\backslash \zeta ^{}([1,d])\right)\hfill \\ \hfill \mathrm{min}(\phi ^1(\{j\}))& \text{}& j\hfill \end{array}$$

and define the $`\mu `$-tableau $`[a^\zeta ^{}]`$ by

$$\begin{array}{cccc}\hfill a_{j,i}^\zeta ^{}& :=& a_{j,i}\hfill & \text{for }(j[1,\lambda _1]\backslash \{g,g+1\}\text{ and }i[1,\mu _j^{}])\text{ or }(j=g\text{ and }i[1,\lambda _g^{}])\hfill \\ \hfill a_{g,\lambda _g^{}+i}^\zeta ^{}& :=& a_{g+1,\zeta ^{}(i)}\hfill & \text{for }i[1,d]\hfill \\ \hfill a_{g+1,i}^\zeta ^{}& :=& a_{g+1,\psi (i)}\hfill & \text{for }i[1,\mu _{g+1}^{}].\hfill \end{array}$$

Using this place operation, we define the $`\text{Z}𝒮_n`$-linear map

$$\begin{array}{ccc}\hfill F^\lambda & \text{}& S^\mu \hfill \\ \hfill [a]& \text{}& \underset{\zeta Z}{}a^\zeta \epsilon _\zeta =\frac{1}{d!}\underset{\zeta ^{}Z^{}}{}a^\zeta ^{}\epsilon _\zeta ^{}.\hfill \end{array}$$

For a $`\lambda `$-tableau $`[a]`$ and for an injection $`\zeta ^{}Z^{}`$, we denote the ‘$`[a]`$-realization’ of $`\zeta ^{}`$ by

$$([1,d]\text{}[1,n]):=\left([1,d]\text{}[1,\lambda _{g+1}^{}]\text{}([1,\lambda _{g+1}^{}]\times \{g+1\})\text{}[\lambda ]\text{}[1,n]\right).$$

###### Lemma 4.3

We have a factorization

$$(F^\lambda \text{}S^\mu )=(F^\lambda \text{}M^{\lambda ^{},}\text{}S^\mu ).$$

We need to show that given $`v,wa_{g+1}`$, $`vw`$, and a $`\lambda `$-tableau $`[a]`$, we have $`([a](v,w))f^{\prime \prime }=[a]f^{\prime \prime }`$. Suppose given $`\zeta Z`$. In case $`v,w\zeta _{[a]}([1,d])`$ or in case $`v,w\zeta _{[a]}([1,d])`$, we obtain $`a^\zeta \epsilon _\zeta (v,w)=a^\zeta \epsilon _\zeta `$. The maps $`\zeta Z`$ that satisfy $`v\zeta _{[a]}([1,d])`$, $`w\zeta _{[a]}([1,d])`$ furnish a subset $`Z_{10}Z`$, the maps $`\zeta Z`$ that satisfy $`v\zeta _{[a]}([1,d])`$, $`w\zeta _{[a]}([1,d])`$ furnish a subset $`Z_{01}Z`$. We have a bijection $`\iota `$ that sends $`\zeta Z_{10}`$ to the map $`\iota (\zeta )Z_{01}`$ determined by $`\iota (\zeta )_{[a]}\left([1,d]\right)=(\zeta _{[a]}\left([1,d]\right))(v,w)`$. We claim that

$$a^\zeta \epsilon _\zeta (v,w)=a^{\iota (\zeta )}\epsilon _{\iota (\zeta )},$$

thus proving the lemma. Let $`v=:a_{g+1,i}`$, let $`w=:a_{g+1,j}`$ and assume $`i<j`$. Comparing both sides, the entries in column $`g`$ of $`[\mu ]`$ yield a sign $`(1)^{\mathrm{\#}([i+1,j1]\zeta ([1,d]))}`$, the entries in column $`g+1`$ of $`[\mu ]`$ yield a sign $`(1)^{\mathrm{\#}([i+1,j1]\backslash \zeta ([1,d]))}`$, so, altogether, the entries yield a sign $`(1)^{ji1}`$. On the other hand, the quotient of the signs of the maps is $`\epsilon _{\iota (\zeta )}/\epsilon _\zeta =(1)^{ji}`$.

###### Remark 4.4

Let the correspondence $`\phi \mathrm{\Phi }^{\lambda ^{},\mu ^{}}`$ be defined by

$$\begin{array}{cccc}\hfill [\lambda ^{}]& \text{}& [\mu ^{}]\hfill & \\ \hfill j\times i& \text{}& j\times i\hfill & \text{ for }j\times i[\lambda ^{}][\mu ^{}]\hfill \\ \hfill (g+1)\times (\mu _{g+1}^{}+i)& \text{}& g\times (\lambda _{g+1}^{}+i)\hfill & \text{ for }i[1,d]\hfill \end{array}$$

The semistandard correspondoid $`\{\phi \}`$ is in fact the only element in $`\{\mathrm{\Phi }^{\lambda ^{},\mu ^{}}\}_{\text{sst}}`$ (cf. after 3.6). With respect to $`[a_\lambda ^{}]=[\stackrel{ˇ}{a}_\lambda ^{}]`$ and $`[a_\mu ^{}]=[\stackrel{ˇ}{a}_\mu ^{}]`$, we obtain $`f^{}=\mathrm{\Theta }_{\phi ^1}^{}\nu _S^\mu `$, which reproves (4.3) by means of (3.1).

From (3.14, 3.13) we take the following assertions. Suppose given $`\stackrel{~}{m}1`$.

In case $`\mu ^{}`$ is $`2`$-regular, the map

$$\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},M^{\mu ^{},}/\stackrel{~}{m})\text{}\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},S^\mu /\stackrel{~}{m})$$

is surjective. In particular, the group $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /\stackrel{~}{m},S^\mu /\stackrel{~}{m})`$ is cyclic since we may embed

$$\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /\stackrel{~}{m},S^\mu /\stackrel{~}{m})\text{}\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},S^\mu /\stackrel{~}{m}).$$

A generator is a factorization of some multiple of $`f^{}_\text{Z}\text{Z}/\stackrel{~}{m}`$ over $`\nu _S^\lambda `$.

In case $`\mu ^{}`$ is $`2`$-singular, the map

$$2\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},M^{\mu ^{},}/\stackrel{~}{m})\text{}\mathrm{\hspace{0.33em}\hspace{0.33em}2}\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},S^\mu /\stackrel{~}{m})$$

is surjective. In particular, the group $`2\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /\stackrel{~}{m},S^\mu /\stackrel{~}{m})`$ is cyclic since we may embed

$$2\text{Hom}_{\text{Z}𝒮_n}(S^\lambda /\stackrel{~}{m},S^\mu /\stackrel{~}{m})\text{}\mathrm{\hspace{0.33em}\hspace{0.33em}2}\text{Hom}_{\text{Z}𝒮_n}(M^{\lambda ^{},}/\stackrel{~}{m},S^\mu /\stackrel{~}{m}).$$

A generator is a factorization of some multiple of $`2f^{}_\text{Z}\text{Z}/\stackrel{~}{m}`$ over $`\nu _S^\lambda `$.

Let $`\xi a_g`$, $`s:=\mathrm{\#}\xi `$, $`\overline{\xi }:=a_g\backslash \xi `$, $`t[1,\lambda _{g+1}^{}]`$, $`\eta :=a_{g+1,[1,t]}`$, $`\overline{\eta }:=a_{g+1,[t+1,\lambda _{g+1}^{}]}`$ be such that $`s+t=\lambda _g^{}+1`$. Let $`u:=\mathrm{\#}\overline{\eta }=\lambda _{g+1}^{}t`$.

For $`x[0,\mathrm{min}(d,t)]`$, we denote

$$\begin{array}{ccc}\hfill Z^{}[x]& :=& \{\zeta ^{}Z^{}|\zeta ^{}(i)=i\text{ for }i[1,x],\zeta ^{}(i)t+1\text{ for }i[x+1,d]\}\hfill \\ \hfill Z[x]& :=& ZZ^{}[x]\hfill \\ \hfill \mathrm{\Lambda }([a],x)& :=& \frac{1}{s!t!}\underset{\zeta Z[x]}{}a^\zeta \epsilon _\zeta (\xi \eta )\hfill \\ & =& \frac{1}{s!t!(dx)!}\underset{\zeta ^{}Z^{}[x]}{}a^\zeta ^{}\epsilon _\zeta ^{}(\xi \eta )\hfill \end{array}$$

so that we can recover

$$G_{[a],\xi ,\eta }^{}f^{}=\underset{x[0,\mathrm{min}(d,t)]}{}\left(\begin{array}{c}t\\ x\end{array}\right)\mathrm{\Lambda }([a],x).$$

For $`0xy\mathrm{min}(d,t)`$, there is a rectification map

$$\begin{array}{ccc}\hfill Z^{}[x]& \text{}& Z^{}[y]\hfill \\ \hfill \zeta ^{}& \text{}& \zeta ^{}[y]\hfill \end{array}$$

defined by $`\zeta ^{}[y](i):=i`$ for $`i[1,y]`$ and $`\zeta ^{}[y](i):=\zeta ^{}(i)`$ for $`i[y+1,d]`$. In case $`td`$, we denote by $`\zeta [d]`$ the unique element in $`Z[d]=Z^{}[d]`$, mapping each $`i[1,d]`$ to $`i[1,\lambda _{g+1}^{}]`$.

###### Lemma 4.5

Suppose $`td`$. Let $`\overline{\xi }=\overline{\xi }_1\overline{\xi }_2`$ be a disjoint decomposition such that $`\mathrm{\#}\overline{\xi }_1=d1`$ and such that $`\mathrm{\#}\overline{\xi }_2=td`$. Let $`\eta _2:=a_{g+1,[d+1,t]}`$. We obtain, in the notation of (1.6),

$$G_{[a],\xi ,\eta }^{}f^{}=\epsilon _{\zeta [d]}\underset{i[0,d1]}{}(1)^i\left(\begin{array}{c}su+d\\ di\end{array}\right)B_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(i),$$

independent of the chosen bijection $`\overline{\xi }_2\text{}\eta _2`$.

Given $`d_1[0,d]`$ and a map $`\zeta Z[dd_1]`$, we denote

$$\begin{array}{ccc}\hfill \eta _1& :=& a_{g+1,[dd_1+1,d]}\hfill \\ \hfill \overline{\eta }_1(\zeta )& :=& \zeta _{[a]}([dd_1+1,d]).\hfill \end{array}$$

We obtain

$$\begin{array}{ccc}\hfill \mathrm{\Lambda }([a],dd_1)& =& \frac{1}{s!t!}\underset{\zeta Z[dd_1]}{}a^\zeta \epsilon _\zeta (\xi \eta )\hfill \\ & \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{(s+dd_1)!}{s!t!(d1)!}\underset{\zeta Z[dd_1]}{}a^\zeta \epsilon _\zeta (\overline{\xi }_2,\eta _2)(\overline{\eta }_1(\zeta ),\eta _1)(\overline{\xi }\overline{\eta }_1(\zeta ))\hfill \\ & =& (1)^{d_1}\frac{(s+dd_1)!}{s!t!(d1)!}\underset{\stackrel{\overline{\eta }_1\overline{\eta },}{\mathrm{\#}\overline{\eta }_1=d_1}}{}a^{\zeta [d]}\epsilon _{\zeta [d]}(\overline{\xi }_2,\eta _2)(\overline{\xi }\overline{\eta }_1)\hfill \\ & \stackrel{\text{(cf. }\text{1.6}\text{)}}{=}& (1)^{d_1}\frac{(s+dd_1)!}{s!t!(d1)!}\epsilon _{\zeta [d]}C_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(d_1)\hfill \\ & \stackrel{\text{(}\text{1.6}\text{)}}{=}& (1)^{d_1}\frac{(s+dd_1)!(d1)!(td+d_1)!}{s!t!(d1)!}\epsilon _{\zeta [d]}\hfill \\ & & \underset{i[0,\mathrm{min}(d_1,d1)]}{}\left(\begin{array}{c}ui\\ d_1i\end{array}\right)B_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(i),\hfill \end{array}$$

whence our one-step Garnir relation is mapped to

$$\begin{array}{cc}& G_{[a],\xi ,\eta }^{}f^{}\hfill \\ \hfill =& \epsilon _{\zeta [d]}\underset{d_1[0,d]}{}\underset{i[0,\mathrm{min}(d_1,d1)]}{}\left(\begin{array}{c}t\\ dd_1\end{array}\right)(1)^{d_1}\frac{(s+dd_1)!(td+d_1)!}{s!t!}\left(\begin{array}{c}ui\\ d_1i\end{array}\right)\hfill \\ & B_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(i)\hfill \\ \hfill =& \epsilon _{\zeta [d]}\underset{i[0,d1]}{}\left(\underset{j[0,di]}{}(1)^{i+dij}\left(\begin{array}{c}s+j\\ j\end{array}\right)\left(\begin{array}{c}ui\\ dij\end{array}\right)\right)B_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(i)\hfill \\ \hfill \stackrel{\text{(}\text{4.1}\text{)}}{=}& \epsilon _{\zeta [d]}\underset{i[0,d1]}{}(1)^i\left(\begin{array}{c}su+d\\ di\end{array}\right)B_{[a^{\zeta [d]}](\overline{\xi }_2,\eta _2)_\alpha ,\overline{\xi }_1,\overline{\xi }_2}(i).\hfill \end{array}$$

###### Lemma 4.6

Suppose $`2d1\lambda _{g+1}^{}`$. Let $`m_0:=\lambda _g^{}\lambda _{g+1}^{}+d+1`$ be the box shift length, let

$$m:=m_0\underset{p\text{ prime, }p|m_0}{}p^{\mathrm{min}(v_p(m_0),\text{ilog}_p(d))},$$

In case $`\mu ^{}`$ is $`2`$-regular, the injection

$$\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)\text{}\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /n!)$$

is surjective. In case $`\mu ^{}`$ is $`2`$-singular, the cokernel of the injection

$$\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)\text{}\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /n!)$$

is annihilated by multiplication by $`2`$.

Consider (4.5) in the case $`[a]=[\stackrel{ˇ}{a}_\lambda ]`$, $`t=d`$, $`\xi =a_{g,[1,s]}`$, $`\overline{\xi }_1=\overline{\xi }`$ and $`\overline{\xi }_2=\mathrm{}`$. We obtain

$$\begin{array}{ccc}\hfill G_{[\stackrel{ˇ}{a}_\lambda ],\xi ,\eta }^{}f^{}& =& \epsilon _{\zeta [d]}\underset{i[0,d1]}{}(1)^i\left(\begin{array}{c}su+d\\ di\end{array}\right)B_{[(\stackrel{ˇ}{a}_\lambda )^{\zeta [d]}],\overline{\xi },\mathrm{}}(i)\hfill \\ & \stackrel{\text{(}\text{1.6}\text{)}}{=}& \epsilon _{\zeta [d]}\underset{i[0,d1]}{}\left(\begin{array}{c}m_0\\ di\end{array}\right)\underset{\stackrel{\overline{\xi }_0\overline{\xi },}{\mathrm{\#}\overline{\xi }_0=i}}{}\underset{\stackrel{\phi _0\overline{\eta },}{\mathrm{\#}\phi _0=i}}{}(\stackrel{ˇ}{a}_\lambda )^{\zeta [d]}(\overline{\xi }_0,\phi _0).\hfill \end{array}$$

Since $`s=\lambda _g^{}+1d\mu _{g+1}^{}+1`$, the elements $`(\stackrel{ˇ}{a}_\lambda )^{\zeta [d]}(\overline{\xi }_0,\phi _0)`$ occurring in this expression are standard up to column permutation, i.e. up to sign. Moreover, they are pairwise different because of different column fillings. We note that each $`i[0,d1]`$ indexes a nonzero summand of this expresseion, namely a nonzero linear combination of different standard polytabloids equipped with coefficients $`\pm \left(\begin{array}{c}m_0\\ di\end{array}\right)`$, since we assumed $`2d1\lambda _{g+1}^{}`$, i.e. since $`d1\mathrm{\#}\overline{\eta }`$ leaves space for a subset $`\phi _0\overline{\eta }`$ of cardinality $`i`$. Therefore, by (4.2), the element $`G_{[\stackrel{ˇ}{a}_\lambda ],\xi ,\eta }^{}f^{}S^\mu `$ is exactly divisible by $`m`$.

Suppose given a $`\text{Z}𝒮_n`$-linear map $`S^\lambda \text{}S^\mu /n!`$. Let $`S^\mu \text{}S^\mu /n!`$ denote the residue class morphism.

Suppose $`\mu ^{}`$ to be $`2`$-regular. By (4.4), there is an integer $`z`$ such that $`\nu _S^\lambda \stackrel{~}{f}=zf^{}\phi `$. Thus $`zG_{[\stackrel{ˇ}{a}_\lambda ],\xi ,\eta }^{}f^{}`$ is divisible by $`n!`$, and so $`zm`$ is divisible by $`n!`$. Hence, each element in the image of $`\stackrel{~}{f}`$ is contained in $`(n!/m)S^\lambda /n!S^\lambda `$, i.e. there exists a factorization

$$(S^\lambda \text{}S^\mu /n!)=(S^\lambda \text{}S^\mu /m\text{}S^\mu /n!).$$

Suppose $`\mu ^{}`$ to be $`2`$-singular. By (4.4), there is an integer $`z`$ such that $`2\nu _S^\lambda \stackrel{~}{f}=2zf^{}\phi `$. Thus $`2zG_{[\stackrel{ˇ}{a}_\lambda ],\xi ,\eta }^{}f^{}`$ is divisible by $`n!`$, and so $`2zm`$ is divisible by $`n!`$. Hence, each element in the image of $`2\stackrel{~}{f}`$ is contained in $`(n!/m)S^\lambda /n!S^\lambda `$, i.e. there exists a factorization

$$(S^\lambda \text{}S^\mu /n!)=(S^\lambda \text{}S^\mu /m\text{}S^\mu /n!).$$

###### Lemma 4.7

Suppose $`td1`$. We obtain, in the notation of (1.7),

$$G_{[a],\xi ,\eta }^{}f^{}=\epsilon _{\zeta [d]}\underset{i[0,t1]}{}(1)^i\left(\begin{array}{c}su+d\\ ti\end{array}\right)B_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(i).$$

Given $`d_0[0,t]`$ and an injection $`\zeta ^{}Z^{}[d_0]`$, we denote

$$\begin{array}{ccc}\hfill \eta _1& :=& \zeta _{[a]}^{}([1,d_0])=a_{g+1,[1,d_0]}\hfill \\ \hfill \overline{\eta }_1(\zeta ^{})& :=& \zeta _{[a]}^{}([d_0+1,t])\hfill \\ \hfill \overline{\eta }_2(\zeta ^{})& :=& \zeta _{[a]}^{}([t+1,d])\hfill \\ \hfill \overline{\eta }_2& :=& a_{g+1,[t+1,d]}.\hfill \end{array}$$

Given $`\zeta ^{}Z^{}[t]`$, we get

$$()a^\zeta ^{}\epsilon _\zeta ^{}=a^{\zeta ^{}[d]}\sigma \epsilon _\sigma \epsilon _{\zeta ^{}[d]}$$

for any permutation $`\sigma 𝒮_{\overline{\eta }}`$ that maps $`(a_{g+1,i})\sigma =\zeta _{[a]}^{}(i)`$ for $`i[t+1,d]`$. Note that $`\mathrm{\#}\{\sigma 𝒮_{\overline{\eta }}|(a_{g+1,i})\sigma =\zeta _{[a]}^{}(i)\text{ for }i[t+1,d]\}=(ud+t)!`$.

For $`d_0[0,t]`$, we obtain

$$\begin{array}{cc}& \mathrm{\Lambda }([a],d_0)\hfill \\ =& \frac{1}{s!t!(dd_0)!}\underset{\zeta ^{}Z^{}[d_0]}{}a^\zeta ^{}\epsilon _\zeta ^{}(\xi \eta )\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{(s+d_0)!}{s!t!(dd_0)!(d1)!}\underset{\zeta ^{}Z^{}[d_0]}{}a^\zeta ^{}\epsilon _\zeta ^{}(\eta \backslash \eta _1,\overline{\eta }_1(\zeta ^{}))(\overline{\xi }\overline{\eta }_1(\zeta ^{})\overline{\eta }_2(\zeta ^{}))\hfill \\ =& (1)^{td_0}\frac{(s+d_0)!(td_0)!}{s!t!(dd_0)!(d1)!}\underset{\zeta ^{}Z^{}[t]}{}\underset{\stackrel{\overline{\eta }_1\overline{\eta }\backslash \overline{\eta }_2\left(\zeta ^{}\right),}{\mathrm{\#}\overline{\eta }_1=td_0}}{}a^\zeta ^{}\epsilon _\zeta ^{}(\overline{\xi }\overline{\eta }_1\overline{\eta }_2(\zeta ^{}))\hfill \end{array}$$

$$\begin{array}{cc}\stackrel{()}{=}& (1)^{td_0}\frac{(s+d_0)!(td_0)!}{s!t!(dd_0)!(d1)!(ud+t)!}\underset{\stackrel{\overline{\eta }_1\overline{\eta }\backslash \overline{\eta }_2,}{\mathrm{\#}\overline{\eta }_1=td_0}}{}a^{\zeta [d]}\epsilon _{\zeta [d]}(\overline{\xi }\overline{\eta }_1\overline{\eta }_2)\overline{\eta }\hfill \\ \stackrel{\text{(cf. }\text{1.7}\text{)}}{=}& (1)^{td_0}\epsilon _{\zeta [d]}\frac{(s+d_0)!(td_0)!}{s!t!(dd_0)!(d1)!(ud+t)!}C_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(td_0)\hfill \\ \stackrel{\text{(}\text{1.7}\text{)}}{=}& (1)^{td_0}\epsilon _{\zeta [d]}\frac{(s+d_0)!(td_0)!}{s!t!(dd_0)!(d1)!(ud+t)!}\hfill \\ & \left(ud+t\right)!\left(d1\right)!\left(dd_0\right)!\underset{i[0,\mathrm{min}(td_0,t1)]}{}\left(\begin{array}{c}ud+ti\\ td_0i\end{array}\right)B_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(i),\hfill \end{array}$$

whence

$$\begin{array}{cc}& G_{[a],\xi ,\eta }^{}f^{}\hfill \\ \hfill =& \epsilon _{\zeta [d]}\underset{d_0[0,t]}{}\underset{i[0,\mathrm{min}(td_0,t1)]}{}\left(\begin{array}{c}t\\ d_0\end{array}\right)(1)^{td_0}\frac{(s+d_0)!(td_0)!}{s!t!}\hfill \\ & \left(\begin{array}{c}ud+ti\\ td_0i\end{array}\right)B_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(i)\hfill \\ \hfill =& \epsilon _{\zeta [d]}\underset{i[0,t1]}{}\left(\underset{d_0[0,ti]}{}(1)^{i+tid_0}\left(\begin{array}{c}s+d_0\\ d_0\end{array}\right)\left(\begin{array}{c}ud+ti\\ tid_0\end{array}\right)\right)B_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(i)\hfill \\ \hfill \stackrel{\text{(}\text{4.1}\text{)}}{=}& \epsilon _{\zeta [d]}\underset{i[0,t1]}{}(1)^i\left(\begin{array}{c}su+d\\ ti\end{array}\right)B_{[a^{\zeta [d]}],\overline{\xi }\overline{\eta }_2,\overline{\eta }_2,\overline{\eta }\backslash \overline{\eta }_2}^{}(i).\hfill \end{array}$$

###### Remark 4.8

The morphism $`F^\lambda \text{}S^\mu `$ maps $`[\stackrel{ˇ}{a}_\lambda ]`$ to a linear combination of standard $`\mu `$-polytabloids with coefficients $`\pm 1`$.

We summarize.

###### Theorem 4.9

Let $`m_0:=\lambda _g^{}\lambda _{g+1}^{}+d+1`$ be the box shift length, let

$$m:=m_0\underset{p\text{ prime, }p|m_0}{}p^{\mathrm{min}(v_p(m_0),\text{ilog}_p(d))},$$

where $`\text{ilog}_p(k)=\mathrm{max}\{i0|p^ik\}`$. The $`\text{Z}𝒮_n`$-linear map $`M^{\lambda ^{},}\text{}S^\mu `$ factors over

The resulting morphism $`S^\lambda \text{}S^\mu /m`$ is of order $`m`$ in $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$.

In case $`\mu ^{}`$ is $`2`$-regular, the group $`\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$ is generated by $`f`$.

In case $`\mu ^{}`$ is $`2`$-singular, the group $`2\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)`$ is generated by $`2f`$.

In case $`2d1\lambda _{g+1}^{}`$ and $`\mu ^{}`$ is $`2`$-regular, there is an isomorphism

$$\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)\text{}\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /n!).$$

In case $`2d1\lambda _{g+1}^{}`$ and $`\mu ^{}`$ is $`2`$-singular, the cokernel of the inclusion

$$\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /m)\text{}\text{Hom}_{\text{Z}𝒮_n}(S^\lambda ,S^\mu /n!),$$

is annihilated by multiplication with $`2`$.

This follows by (4.5, 4.7, 4.2, 4.8, 4.4, 4.6).

###### Example 4.10

We have $`\text{Hom}_{\text{Z}𝒮_8}(S^{(2^3,1^2)},S^{(1^8)}/8!)=0`$.

###### Question 4.11

In case $`2d1>\lambda _{g+1}^{}`$, I do not know of a counterexample to the assertions in (4.9) that presuppose $`2d1\lambda _{g+1}^{}`$.

###### Remark 4.12

In the situation of (4.9), Carter and Payne \[CP 80\] have shown that

$$\text{Hom}_{K𝒮_n}(K_\text{Z}S^\lambda ,K_\text{Z}S^\mu )0,$$

$`K`$ being an infinite field of characteristic $`p`$ such that $`\text{ilog}_pd<v_p(m_0)`$. This part of their result is recovered by (4.9).

###### Corollary 4.13 (to (4.9) via (3.16, 4.4))

The transpose in the sense of (3.16) of the morphism given in (4.9), interpreted as $`S^\lambda /m\text{}S^\mu /m`$, is given by

$$\begin{array}{ccc}\hfill S^\mu ^{}/m& \text{}& S^\lambda ^{}/m\hfill \\ \hfill b^{}& \text{}& b^{}\mathrm{\Theta }_\phi ,\hfill \end{array}$$

where the correspondoid $`\{\phi \}\{\mathrm{\Phi }^{\lambda ^{},\mu ^{}}\}`$ is given by

$$\begin{array}{cccc}\hfill [\mu ^{}]& \text{}& \text{N}\hfill & \\ \hfill j\times i& \text{}& j\hfill & \text{ for }j\times i[\lambda ^{}][\mu ^{}]\hfill \\ \hfill g\times (\lambda _g^{}+i)& \text{}& g+1\hfill & \text{ for }i[1,d]\hfill \end{array}$$

All assertions on the Hom-groups in (4.9) have a counterpart, obtained by isomophic transport via the transposition isomorphism (3.16).

This follows by (4.9, 3.16) using (4.4). Concerning $`\mathrm{\Theta }_\phi `$, we refer to (3.1).

###### Question 4.14

I do not know a formula for the transpose $`f^\text{t}`$ in (4.13) in terms of $`\lambda ^{}`$-polytabloids. Cf. (3.17, 4.15).

###### Example 4.15 (a fixed point, cf. \[J 78, 24.4\], \[K 99, 4.4.1\])

Consider the case $`n4`$, $`d=2`$, $`\lambda =(2^2,1^{n4})`$ and $`\mu =(1^n)`$. The modulus becomes $`m=n1`$ if $`n1`$ is odd and $`m=(n1)/2`$ if $`n1`$ is even. We obtain

$$\begin{array}{ccc}\hfill [\mu ^{}]& \text{}& \text{N}\hfill \\ \hfill 1\times i& \text{}& \{\begin{array}{cc}1\hfill & \text{for }i[1,n2]\hfill \\ 2\hfill & \text{for }i[n1,n],\hfill \end{array}\hfill \end{array}$$

which allows to calculate the transpose as mapping

$$\begin{array}{ccc}\hfill S^\mu ^{}/m& \text{}& S^\lambda ^{}/m\hfill \\ \hfill x& \text{}& \underset{i,j[1,n],i<j}{}\{i,j\},\hfill \end{array}$$

where $`[x]`$ is the unique standard $`\mu ^{}`$-tableau and where we denote a $`\lambda ^{}`$-tabloid by its second row. Similarly, for a $`\lambda ^{}`$-polytabloid, we omit to denote the entries in the first row from column three onwards. I.e. we let a $`\lambda ^{}`$-polytabloid be determined by the first two entries of the first and of the second row - which is not to be confused with a $`(2,2)`$-polytabloid. Let

$$A:=\underset{j[4,n]}{}(j2)\begin{array}{cc}1& 3\\ 2& j\end{array}\underset{i,j[3,n],i<j}{}\begin{array}{cc}1& 2\\ i& j\end{array}S^\lambda ^{}.$$

For $`k[3,n]`$, $`l[4,n]`$, $`k<l`$, we obtain the following list of values of the scalar product in $`M^\lambda ^{}`$.

$$\begin{array}{cccccc}(A,\{k,l\})\hfill & =& +& 0\hfill & & 1\hfill \\ (A,\{1,l\})\hfill & =& & (l2)\hfill & +& (l3)\hfill \\ (A,\{2,l\})\hfill & =& +& (l2)\hfill & +& (nl)\hfill \\ (A,\{2,3\})\hfill & =& & (n2)(n1)/2+1\hfill & +& (n3)\hfill \\ (A,\{1,2\})\hfill & =& +& 0\hfill & & (n2)(n3)/2\hfill \\ (A,\{1,3\})\hfill & =& +& (n2)(n1)/21\hfill & +& 0.\hfill \end{array}$$

Hence, written in polytabloids, our map turns out to be

$$\begin{array}{ccc}\hfill S^\mu ^{}/m& \text{}& S^\lambda ^{}/m\hfill \\ \hfill x& \text{}& \underset{j[4,n]}{}(j2)\begin{array}{cc}1& 3\\ 2& j\end{array}\underset{i,j[3,n],i<j}{}\begin{array}{cc}1& 2\\ i& j\end{array}.\hfill \end{array}$$

## Appendix A Two lemmata

We present full versions of the two main lemmata of Section 2.2. For sake of completeness of the full versions, there is a certain overlap, concerning notation and conclusion, with their abridged versions (2.4, 2.10). We maintain the notation of Section 2.2.

###### Lemma A.1 (full version of (2.4))

Suppose $`g<p<k`$ and $`s,t2`$. The map $`f^{}`$ annihilates $`G_{[a],\xi ,\eta }^{}`$.

We fix a map

$$\begin{array}{ccc}\hfill [1,\lambda _1]\backslash \{p,p+1\}& \text{}& [0,2]\hfill \\ \hfill j& \text{}& \stackrel{~}{e}_j\hfill \end{array}$$

that maps $`g`$ and $`k+1`$ to $`e_g=e_{k+1}=2`$, and that maps $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$. For $`\alpha ,\beta [0,2]`$, we denote by $`\stackrel{~}{e}\alpha \beta `$ be the prolongation of $`\stackrel{~}{e}`$ to $`[1,\lambda _1]`$ defined by $`\stackrel{~}{e}\alpha \beta |_{[1,\lambda _1]\backslash \{p,p+1\}}:=\stackrel{~}{e}`$, $`\left(\stackrel{~}{e}\alpha \beta \right)_p:=\alpha `$ and $`\left(\stackrel{~}{e}\alpha \beta \right)_{p+1}:=\beta `$. We contend that

$$\underset{\alpha ,\beta [0,2]}{}X_p^{\left(2\alpha \right)}X_{p+1}^{\left(2\beta \right)}G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}=0,$$

from which the lemma ensues.

Given $`\alpha ,\beta [0,2]`$, given a subset $`\stackrel{~}{\mathrm{\Xi }}[1,2]\times \{p,p+1\}`$ with

$$\begin{array}{ccc}\hfill \mathrm{\#}\left(\stackrel{~}{\mathrm{\Xi }}\left([1,2]\times \left\{p\right\}\right)\right)& =& \alpha \hfill \\ \hfill \mathrm{\#}\left(\stackrel{~}{\mathrm{\Xi }}\left([1,2]\times \left\{p+1\right\}\right)\right)& =& \beta ,\hfill \end{array}$$

and given prescribed inverse images $`\xi ^{},\eta ^{}[1,2]`$ ‘within $`\stackrel{~}{\mathrm{\Xi }}`$’, i.e. such that

$$()\begin{array}{ccc}\hfill \xi ^{}\times \left\{p\right\}& & \stackrel{~}{\mathrm{\Xi }}\left([1,2]\times \left\{p\right\}\right)\hfill \\ \hfill \eta ^{}\times \left\{p+1\right\}& & \stackrel{~}{\mathrm{\Xi }}\left([1,2]\times \left\{p+1\right\}\right),\hfill \end{array}$$

we let

$$\begin{array}{ccccc}\hfill \dot{\mathrm{\Gamma }}(\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})& :=& \hfill \{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}\alpha \beta \right)& |& \mathrm{\Xi }_\gamma \left([1,2]\times \{p,p+1\}\right)=\stackrel{~}{\mathrm{\Xi }},\hfill \\ & & & & \gamma ^1\left(\xi \right)=\xi ^{}\times \left\{p\right\},\gamma ^1\left(\eta \right)=\eta ^{}\times \{p+1\}\}\hfill \end{array}$$

and form the partial sum

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{}):=\frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})}{}a^\gamma \epsilon _\gamma \left(\xi \eta \right)$$

so that we can recover

$$()G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}=\underset{\stackrel{~}{\mathrm{\Xi }}[1,2]\times \{p,p+1\}}{}\underset{\xi ^{},\eta ^{}[1,2]\text{ subject to }()}{}\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{}).$$

There exist elements $`x,y\xi `$, $`xy`$, $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)`$, we let $`x_\gamma :=a_{j,\overline{\gamma }(j,1)}`$, where $`j[p+2,k+1]`$ is minimal with $`1\times j\mathrm{\Xi }_\gamma `$, and $`y_\gamma :=a_{j,\overline{\gamma }(j,2)}`$, where $`j[p+2,k+1]`$ is minimal with $`2\times j\mathrm{\Xi }_\gamma `$. I.e. we pick the entries $`x_\gamma ,y_\gamma `$ that ‘cross the columns’ $`p`$ and $`p+1`$ under the operation of $`\gamma `$. We write

$$\begin{array}{ccc}\hfill U_\gamma & :=& \left(s+t2\right)!^1a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x,x^{})(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ \hfill V_{1,\gamma }& :=& \left(s+t1\right)!^1a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})\left(\xi \eta \right)\hfill \\ \hfill V_{2,\gamma }& :=& \left(s+t1\right)!^1a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(y_\gamma ,y,y^{})\left(\xi \eta \right),\hfill \end{array}$$

and let

$$\begin{array}{ccc}A\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}U_\gamma \underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ B\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}U_\gamma \left(1\underset{w\overline{\xi }\backslash z}{}(w,z)\right)\hfill \\ C_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}U_\gamma (z,x_\gamma )\hfill \\ C_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}U_\gamma (z,y_\gamma )\hfill \\ D\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{1,\gamma }\underset{w\overline{\xi }}{}(w,y_\gamma )\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{2,\gamma }\underset{w\overline{\xi }}{}(w,x_\gamma )\hfill \\ H\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{1,\gamma }\underset{w^{}\overline{\eta }}{}(w^{},y_\gamma )\hfill \\ & =& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{2,\gamma }\underset{w^{}\overline{\eta }}{}(w^{},x_\gamma )\hfill \\ F_1\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{1,\gamma }\hfill \\ F_2\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}V_{2,\gamma }.\hfill \end{array}$$

The equalities herein follow by the argument of (2.2 i) and by the independence of of the respective expressions of the choice of $`x,y,x^{},y^{}`$.

Calculation of $`\mathrm{\Lambda }`$-values. We shall distinguish subcases and subsubcases according to the summation in $`()`$.

To distinguish subcases, e.g. $`\left[\begin{array}{cc}+& \\ +& +\end{array}\right]`$ designates the subset $`\stackrel{~}{\mathrm{\Xi }}=\{1\times p,\mathrm{\hspace{0.33em}2}\times p,\mathrm{\hspace{0.33em}2}\times \left(p+1\right)\}`$; in general, the first factor of an element of $`[1,2]\times \{p,p+1\}`$ counts rows, the second counts columns, and a plus sign $`+`$ denotes its appearance in $`\stackrel{~}{\mathrm{\Xi }}`$.

To distinguish subsubcases, we denote e.g. by $`\left[\begin{array}{cc}& \\ +& \end{array}\right]`$ the configuration $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ +& +\end{array}\right]`$, $`\xi ^{}=\left\{1\right\}`$ and $`\eta ^{}=\left\{2\right\}`$; in general, the sign $``$ in the left column means that its row number is an element of $`\xi ^{}`$, the sign $``$ in the right column means that its row number is an element of $`\eta ^{}`$. Concerning the underlying set $`\stackrel{~}{\mathrm{\Xi }}`$, the symbols $``$ and $`+`$ are synonymous.

Case $`f_{\stackrel{~}{e}22}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ +& +\end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\{1,2\})\hfill \\ =& \frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}(e,\stackrel{~}{\mathrm{\Xi }},\{1,2\},\{1,2\})}{}a^\gamma \epsilon _\gamma \left(\xi \eta \right)\hfill \\ =& \frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1y_1\xi ,x_1^{}y_1^{}\eta }{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x_1^{})(y_\gamma ,y_1,y_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{s\left(s1\right)t\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)t\left(t1\right)s!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x,x^{})(y_\gamma ,y,y^{})\left(\xi \eta \right)\overline{\xi }\hfill \\ =& s\left(s1\right)B.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{1\right\})\hfill \\ =& \frac{s\left(s1\right)t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)t\left(s1\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x^{})(y_\gamma ,y,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_1^{},y^{})\left(\xi \eta \right)\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \frac{s1}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x^{})(y_\gamma ,y,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_1^{},y^{})(y_1^{},y_\gamma )\left(\xi \eta \right)\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \frac{s1}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \left(s1\right)\left(uBA\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& \\ & +\end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{2\right\})=\left(s1\right)\left(uBA\right).$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{\right\})\hfill \\ =& \frac{s\left(s1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)\left(s2\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_1^{},y^{})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \frac{1}{t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_1^{},y^{})(x_1^{},x_\gamma )(y_1^{},y_\gamma )\hfill \\ & \left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \frac{1}{t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \left(u1\right)\left(uB2A\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ +& \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\{1,2\})\hfill \\ =& \frac{st\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{st\left(t1\right)\left(s+1\right)!\left(t2\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1,y^{})(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\hfill \\ =& \frac{s\left(s+1\right)}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& \left(s+1\right)sD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ +& +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{1\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1,y_1^{})(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(y_1^{},y^{})\left(\xi \eta \right)\hfill \\ =& \frac{s}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1,y^{},y_1^{})(y_1^{},y^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{su}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& suD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ +& \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{2\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+11\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1,y^{})(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{s}{\left(s+11\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x_1^{})(y_\gamma ,y_1)(x_1^{},x^{})(x_\gamma ,x_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{su}{\left(s+11\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& suD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ +& +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y_1,y_1^{})(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_1^{},y^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x_1^{})(y_\gamma ,y_1,y^{},y_1^{})(x_1^{},x^{})(y_1^{},y^{})(x_\gamma ,x_1^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{u\left(u1\right)}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& u\left(u1\right)D.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& \\ +& \end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\{1,2\})=\left(s+1\right)sD.$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & +\end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& +\\ +& \end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{1\right\})=suD.$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& \\ +& +\end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{2\right\})=suD.$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& +\\ & +\end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& +\\ +& +\end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{\right\})=u\left(u1\right)D.$$

Subsubcases $`\left[\begin{array}{cc}+& \\ +& \end{array}\right]`$, $`\left[\begin{array}{cc}+& \\ +& +\end{array}\right]`$, $`\left[\begin{array}{cc}+& +\\ +& \end{array}\right]`$, $`\left[\begin{array}{cc}+& +\\ +& +\end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}22}^{}=2\left(su\right)A+\left(su\right)\left(su1\right)B+2\left(su\right)\left(su+1\right)D$$

Case $`f_{\stackrel{~}{e}12}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ & +\end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\{1,2\})\hfill \\ =& \frac{st\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{st\left(t1\right)s!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\overline{\xi }\hfill \\ =& \frac{s}{\left(t2\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\overline{\xi }\hfill \\ =& sB.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{1\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& sH.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{2\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{st\left(s1\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}\right)\hfill \\ =& \frac{1}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(x_1^{},x_\gamma )\left(\xi \eta \right)\left(\overline{\xi }x_1^{}\right)\hfill \\ =& \frac{1}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}\right)\hfill \\ =& uBA.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})(x_1^{},x^{})(x_1^{},x_\gamma )\left(\xi \eta \right)\hfill \\ =& \frac{u1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& \left(u1\right)H.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\{1,2\})\hfill \\ =& \frac{t\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{t\left(t1\right)\left(s+1\right)!\left(t2\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x^{})(y_\gamma ,y^{})(\overline{\xi }\backslash x_1,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\hfill \\ =& \frac{s+1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1)(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ =& \left(s+1\right)D.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\left\{2\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x_1^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{ts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x_1^{})(y_\gamma ,y^{})(\overline{\xi }\backslash x_1,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1,x^{},x_1^{})(y_\gamma ,y,y^{})(x_1^{},x^{})(x_1^{},x_\gamma )\left(\xi \eta \right)\hfill \\ =& \frac{u}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1)(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ =& uD.\hfill \end{array}$$

Subsubcases $`\left[\begin{array}{cc}+& \\ & +\end{array}\right]`$, $`\left[\begin{array}{cc}+& +\\ & +\end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& +\\ +& +\end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ & +\end{array}\right]`$.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}12}^{}=2A2\left(su\right)B2\left(su+1\right)D+2\left(su+1\right)H.$$

Case $`f_{\stackrel{~}{e}02}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& +\\ & +\end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\{1,2\})\hfill \\ =& \frac{t\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{t\left(t1\right)s!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\overline{\xi }\hfill \\ =& \frac{1}{\left(t2\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\overline{\xi }\hfill \\ =& B.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\left\{1\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{ts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& H.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& \\ & +\end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\left\{2\right\})=H.$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & +\end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}02}^{}=B2H.$$

Case $`f_{\stackrel{~}{e}21}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ +& \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{1\right\})\hfill \\ =& \frac{s\left(s1\right)t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)t\left(s1\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y)(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})\left(\xi \eta \right)\left(\overline{\xi }y_\gamma \right)\hfill \\ =& \frac{\left(s1\right)}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }y_\gamma \right)\hfill \\ =& \left(s1\right)\left(BC_2\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{\right\})\hfill \\ =& \frac{s\left(s1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y)\left(\xi \eta \right)\text{ }\hfill \end{array}$$

$$\begin{array}{cc}\stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)\left(s2\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y)(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \frac{1}{t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y)\hfill \\ & (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_\gamma ,y^{})(x_1^{},x_\gamma )\left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \frac{1}{t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \left(uBuC_2A\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ +& \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{1\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1)(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ =& \frac{s}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& sD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ +& \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x,x_1^{})(y_\gamma ,y_1)(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x_1^{})(y_\gamma ,y_1)(x_1^{},x^{})(x_\gamma ,x_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{u}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& uD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{1\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x^{})(y_\gamma ,y)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x^{})(y_\gamma ,y)(\overline{\xi }\backslash x_1,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ =& \frac{s}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1)(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ =& sD.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1,x_1^{})(y_\gamma ,y)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x_1,x_1^{})(y_\gamma ,y)(\overline{\xi }\backslash x_1,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi },x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1,x^{},x_1^{})(y_\gamma ,y,y^{})(x_1^{},x^{})(x_\gamma ,x_1^{})\left(\xi \eta \right)\hfill \\ =& \frac{u}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1)(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ =& uD.\hfill \end{array}$$

Subsubcases $`\left[\begin{array}{cc}+& \\ +& \end{array}\right]`$, $`\left[\begin{array}{cc}+& +\\ +& \end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ +& +\end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ +& \end{array}\right]`$.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}21}^{}=2A+2\left(su1\right)B\left(su1\right)\left(C_1+C_2\right)+4\left(su\right)D.$$

Case $`f_{\stackrel{~}{e}11}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{1\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{sts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& sF_1.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(\overline{\xi },\eta \backslash x^{})(x_1^{},x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x_1^{})(\overline{\xi },\eta \backslash x^{})(x_1^{},x^{})(x_1^{},x_\gamma )\left(\xi \eta \right)\hfill \\ =& \frac{u}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})\left(\xi \eta \right)\hfill \\ =& uF_1.\hfill \end{array}$$

Subsubcases $`\left[\begin{array}{cc}+& \\ & \end{array}\right]`$, $`\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& \\ +& +\end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& +\\ & \end{array}\right]`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ & +\end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{2\right\})\hfill \\ =& \frac{st}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{st\left(s1\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})\left(\xi \eta \right)\left(\overline{\xi }x_\gamma \right)\hfill \\ =& \frac{1}{\left(t1\right)!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }x_\gamma \right)\hfill \\ =& \left(BC_1\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\left\{2\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1)(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{ts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1)(y_\gamma ,y^{})(\overline{\xi }\backslash x_1,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{x_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash y^{})(x_\gamma ,x_1)(y_\gamma ,y,y^{})\left(\xi \eta \right)\hfill \\ =& D.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})(x_\gamma ,x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y_1^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& H.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & +\end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& +\\ +& \end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ & +\end{array}\right]`$.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}11}^{}=2B+\left(C_1+C_2\right)2D+2H+\left(su\right)\left(F_1+F_2\right).$$

Case $`f_{\stackrel{~}{e}01}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\},\left\{1\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})\left(\xi \eta \right)\hfill \end{array}$$

$$\begin{array}{cc}\stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{ts!\left(t1\right)!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& F_1.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& \\ & +\end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& +\\ & \end{array}\right]`$.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}01}^{}=\left(F_1+F_2\right).$$

Case $`f_{\stackrel{~}{e}20}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ +& \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\},\left\{\right\})\hfill \\ =& \frac{s\left(s1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)\left(s2\right)!}{s!t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x)(y_\gamma ,y)(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\left(\overline{\xi }x_\gamma y_\gamma \right)\hfill \\ =& \frac{1}{t!\left(s+t2\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(y_\gamma ,y,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\left(\xi \eta \right)\left(\overline{\xi }x_\gamma y_\gamma \right)\hfill \\ =& BC_1C_2.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ +& \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(y_\gamma ,y_1)(\overline{\xi }\backslash y_1,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}\underset{y_1\overline{\xi }}{}a^\gamma \epsilon _\gamma (\overline{\xi },\eta \backslash x^{})(x_\gamma ,x,x^{})(y_\gamma ,y_1)\left(\xi \eta \right)\hfill \\ =& D.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{cc}& \\ +& \end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\},\left\{\right\})=D.$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ +& \end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}20}^{}=B\left(C_1+C_2\right)+2D.$$

Case $`f_{\stackrel{~}{e}10}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}& \\ & \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\},\left\{\right\})\hfill \\ =& \frac{s}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.5}\text{)}}{=}& \frac{s\left(s1\right)!t!}{s!t!\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x)(\overline{\xi },\eta \backslash x^{})(x_\gamma ,x^{})\left(\xi \eta \right)\hfill \\ =& \frac{1}{\left(s+t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}00\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x,x^{})(\overline{\xi },\eta \backslash x^{})\left(\xi \eta \right)\hfill \\ =& F_1.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\xi ^{},\eta ^{})=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$. The $`\mathrm{\Lambda }`$-value is zero by the Garnir relations.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}& \\ +& \end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{cc}+& \\ & \end{array}\right]`$.

Summing up $`\mathrm{\Lambda }`$-values over subcases and subsubcases, we obtain

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}10}^{}=\left(F_1+F_2\right).$$

Case $`f_{\stackrel{~}{e}00}^{}`$. The Garnir relations yield

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}00}^{}=0.$$

We note that $`su=X_pX_{p+1}`$ and evaluate the linear combination

$$\begin{array}{c}\underset{\alpha ,\beta [0,2]}{}X_p^{\left(2\alpha \right)}X_{p+1}^{\left(2\beta \right)}G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\alpha \beta }^{}\hfill \\ \begin{array}{cccc}=& 1\hfill & 1\hfill & (2(X_pX_{p+1})A+(X_pX_{p+1})(X_pX_{p+1}1)B\hfill \\ & & & +2(X_pX_{p+1})(X_pX_{p+1}+1)D)\hfill \\ +& X_p\hfill & 1\hfill & (2A2(X_pX_{p+1})B2(X_pX_{p+1}+1)D\hfill \\ & & & +2(X_pX_{p+1}+1)H)\hfill \\ +& X_p\left(X_p+1\right)\hfill & 1\hfill & \left(B2H\right)\hfill \\ +& 1\hfill & X_{p+1}\hfill & (2A+2(X_pX_{p+1}1)B\hfill \\ & & & (X_pX_{p+1}1)(C_1+C_2)+4(X_pX_{p+1})D)\hfill \\ +& X_p\hfill & X_{p+1}\hfill & (2B+(C_1+C_2)2D+2H\hfill \\ & & & +(X_pX_{p+1})(F_1+F_2))\hfill \\ +& X_p\left(X_p+1\right)\hfill & X_{p+1}\hfill & \left(\left(F_1+F_2\right)\right)\hfill \\ +& 1\hfill & X_{p+1}\left(X_{p+1}+1\right)\hfill & \left(B\left(C_1+C_2\right)+2D\right)\hfill \\ +& X_p\hfill & X_{p+1}\left(X_{p+1}+1\right)\hfill & \left(\left(F_1+F_2\right)\right)\hfill \\ +& X_p\left(X_p+1\right)\hfill & X_{p+1}\left(X_{p+1}+1\right)\hfill & \left(0\right)\hfill \\ =& 0.\hfill & & \end{array}\hfill \end{array}$$

###### Lemma A.2 (full version of (2.10))

Suppose $`g=p<k`$ and $`s,t2`$. There exist elements $`x^{},y^{}\eta `$, $`x^{}y^{}`$, $`z\overline{\xi }`$, which we choose and fix. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we let $`x_\gamma :=a_{j,\overline{\gamma }(j,1)}`$, where $`j[g+2,k+1]`$ is minimal with $`1\times j\mathrm{\Xi }_\gamma `$, and $`y_\gamma :=a_{j,\overline{\gamma }(j,2)}`$, where $`j[g+2,k+1]`$ is minimal with $`2\times j\mathrm{\Xi }_\gamma `$. I.e. we pick the entries $`x_\gamma ,y_\gamma `$ that ‘cross the column’ $`g+1`$ under the operation of $`\gamma `$. The set of maps

$$\begin{array}{ccc}\hfill [1,\lambda _1]\backslash \left\{g+1\right\}& \text{}& [0,2]\hfill \\ \hfill j& \text{}& \stackrel{~}{e}_j\hfill \end{array}$$

that send $`g`$ and $`k+1`$ to $`\stackrel{~}{e}_g=\stackrel{~}{e}_{k+1}=2`$, and that map $`j[1,\lambda _1]\backslash [g,k+1]`$ to $`e_j=0`$, is denoted by $`\stackrel{~}{E}`$. For $`\stackrel{~}{e}\stackrel{~}{E}`$ and $`\beta [0,2]`$, we denote by $`\stackrel{~}{e}\beta `$ the prolongation of $`\stackrel{~}{e}`$ to $`[g,k+1]`$ by $`(\stackrel{~}{e}\beta )_{g+1}=\beta `$. For $`\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e}0)`$, we write

$$U_\gamma :=a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})$$

and let

$$\begin{array}{ccc}A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}U_\gamma \underset{w^{}\overline{\eta }}{}(w^{},z)\hfill \\ B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}U_\gamma \left(1\underset{w\overline{\xi }\backslash z}{}(w,z)\right)\hfill \\ C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}U_\gamma (z,x_\gamma )\hfill \\ C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill & :=& \underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}U_\gamma (z,y_\gamma ).\hfill \end{array}$$

We obtain

$$\begin{array}{c}\hfill G_{\left[a\right],\xi ,\eta }^{}f^{}=(X_g+2)\underset{\stackrel{~}{e}\stackrel{~}{E}}{}\left(\underset{j[g+2,k]}{}X_j^{\left(2\stackrel{~}{e}_j\right)}\right)(2A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+(X_g+1)B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\\ \hfill X_{g+1}(C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}})).\end{array}$$

Having fixed a map $`\stackrel{~}{e}\stackrel{~}{E}`$, we need to evaluate the expression

$$\underset{\beta [0,2]}{}X_{g+1}^{\left(2\beta \right)}G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\beta }^{}.$$

Given $`\beta [0,2]`$, given a subset $`\stackrel{~}{\mathrm{\Xi }}[1,2]\times \left\{g+1\right\}`$ of cardinality $`\mathrm{\#}\stackrel{~}{\mathrm{\Xi }}=\beta `$ and given a subset $`\eta ^{}[1,2]`$ such that

$$()\eta ^{}\times \left(g+1\right)\stackrel{~}{\mathrm{\Xi }},$$

we let

$$\dot{\mathrm{\Gamma }}(\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\eta ^{}):=\left\{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}\beta \right)\right|\mathrm{\Xi }_\gamma \left([1,2]\times \left\{g+1\right\}\right)=\stackrel{~}{\mathrm{\Xi }},\gamma ^1\left(\eta \right)=\eta ^{}\times \left\{g+1\right\}\}$$

and form the partial sum

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\eta ^{}):=\frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}(\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\eta ^{})}{}a^\gamma \epsilon _\gamma \left(\xi \eta \right)$$

so that we can recover

$$G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\beta }^{}=\underset{\stackrel{~}{\mathrm{\Xi }}[1,2]\times \left\{g+1\right\}}{}\underset{\eta ^{}[1,2]\text{ subject to }()}{}\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\stackrel{~}{\mathrm{\Xi }},\eta ^{}).$$

Calculation of $`\mathrm{\Lambda }`$-values. To distinguish subcases and subsubcases, we adapt the according notation of (A.1).

Case $`f_{\stackrel{~}{e}2}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{c}+\\ +\end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}\\ \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\{1,2\})\hfill \\ =& \frac{t\left(t1\right)}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{t\left(t1\right)\left(s+2\right)!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})\overline{\xi }\hfill \\ =& \left(s+2\right)\left(s+1\right)B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}.\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}\\ +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{t\left(s+1\right)!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_1^{},y^{})\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \frac{\left(s+1\right)}{\left(t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(y_\gamma ,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_1^{},y^{})(y_1^{},y_\gamma )\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \frac{\left(s+1\right)}{\left(t1\right)!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})\left(\overline{\xi }y_1^{}\right)\hfill \\ =& \left(s+1\right)\left(uB_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}+\\ \end{array}\right]`$. By symmetry, we obtain from subsubcase $`\left[\begin{array}{c}\\ +\end{array}\right]`$

$$\mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{2\right\})=\left(s+1\right)\left(uB_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right).$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}+\\ +\end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\})\hfill \\ =& \frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1^{})(y_\gamma ,y_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{s!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1^{})(y_\gamma ,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_1^{},y^{})\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma \hfill \\ & (x_\gamma ,x_1^{})(y_\gamma ,y_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_1^{},y^{})(x_1^{},x_\gamma )(y_1^{},y_\gamma )\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}y_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})\left(\overline{\xi }x_1^{}y_1^{}\right)\hfill \\ =& \left(u1\right)uB_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}2\left(u1\right)A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}.\hfill \end{array}$$

Case $`f_{\stackrel{~}{e}1}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{c}+\\ \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}\\ \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{1\right\})\hfill \\ =& \frac{t}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{t\left(s+1\right)!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma (x_\gamma ,x^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(y_\gamma ,y^{})\left(\overline{\xi }y_\gamma \right)\hfill \\ =& \left(s+1\right)\left(B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right).\hfill \end{array}$$

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}+\\ \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\})\hfill \\ =& \frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1^{})\left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{s!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_\gamma ,y^{})\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (x_\gamma ,x_1^{})(\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_1^{},x^{})(y_\gamma ,y^{})(x_\gamma ,x_1^{})\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \frac{1}{t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}\underset{x_1^{}\overline{\eta }}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})\left(\overline{\xi }x_1^{}y_\gamma \right)\hfill \\ =& \left(uB_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}uC_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right).\hfill \end{array}$$

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{c}\\ +\end{array}\right]`$. Obtained, by symmetry, from subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{c}+\\ \end{array}\right]`$.

Case $`f_{\stackrel{~}{e}0}^{}`$.

Subcase $`\stackrel{~}{\mathrm{\Xi }}=\left[\begin{array}{c}\\ \end{array}\right]`$.

Subsubcase $`(\stackrel{~}{\mathrm{\Xi }},\eta ^{})=\left[\begin{array}{c}\\ \end{array}\right]`$. We calculate

$$\begin{array}{cc}& \mathrm{\Lambda }(\left[a\right],\stackrel{~}{e},\text{},\left\{\right\})\hfill \\ =& \frac{1}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma \left(\xi \eta \right)\hfill \\ \stackrel{\text{(}\text{1.4}\text{)}}{=}& \frac{s!}{s!t!}\underset{\gamma \dot{\mathrm{\Gamma }}\left(\stackrel{~}{e}0\right)}{}a^\gamma \epsilon _\gamma (\overline{\xi }\backslash z,\eta \backslash \{x^{},y^{}\})(x_\gamma ,x^{})(y_\gamma ,y^{})\left(\overline{\xi }x_\gamma y_\gamma \right)\hfill \\ =& B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}.\hfill \end{array}$$

We note that $`su=X_gX_{g+1}`$ and evaluate the linear combination

$$\begin{array}{c}\underset{\beta [0,2]}{}X_{g+1}^{\left(2\beta \right)}G_{\left[a\right],\xi ,\eta }^{}f_{\stackrel{~}{e}\beta }^{}\hfill \\ \begin{array}{ccc}=& 1\hfill & (2(X_gX_{g+1}+2)A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ & & +(X_gX_{g+1}+2)(X_gX_{g+1}+1)B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}})\hfill \\ +& X_{g+1}\hfill & (2A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+2(X_gX_{g+1}+1)B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\hfill \\ & & (X_gX_{g+1}+1)(C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}))\hfill \\ +& X_{g+1}\left(X_{g+1}+1\right)\hfill & \left(B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\left(C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right)\right)\hfill \end{array}\hfill \\ =2\left(X_g+2\right)A_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+\left(X_g+2\right)\left(X_g+1\right)B_{\left[a\right],\xi ,\eta ,\stackrel{~}{e}}X_{g+1}\left(X_g+2\right)\left(C_{1,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}+C_{2,\left[a\right],\xi ,\eta ,\stackrel{~}{e}}\right).\hfill \end{array}$$

## Appendix B References

Carter, R.W., Lusztig, G.

* On the Modular Representations of the General Linear and Symmetric Groups, Math. Z. 136, p. 139-242, 1974.

Carter, R.W., Payne, M.T.J.

* On homomorphisms between Weyl modules and Specht modules, Math. Proc. Camb. Phil. Soc. 87, p. 419-425, 1980.

Garnir, H.

* Théorie de la répresentation linéaire des groupes symétriques, Thèse, Mém. Soc. Roy. Sc. Liège, (4), 10, 1950.

James, G.D.

* The Representation Theory of the Symmetric Groups, SLN 682, 1978.

Künzer, M.

* Ties for the $`\text{Z}𝒮_n`$, thesis, http://www.mathematik.uni-bielefeld.de/$``$kuenzer, Bielefeld, 1999.

Specht, W.

* Die irreduziblen Darstellungen der Symmetrischen Gruppe, Math. Z. 39, p. 696-711, 1935.

Invariant address:

Matthias Künzer

Fakultät für Mathematik

Universität Bielefeld

Postfach 100131

D-33501 Bielefeld

kuenzer@mathematik.uni-bielefeld.de