format: text

text:
# Particle content of the (𝑘,3)-configurations.

## 1. Introduction

In this paper we construct a bijection between the set of configurations $`𝐚=(a_i)_{i𝐙_0}`$ satisfying the conditions

$`a_i=0\text{ if }i>>0,`$ (1.1)
$`a_i+a_{i+1}+a_{i+2}k,`$ (1.2)
and the set of rigged partitions $`(\lambda ,\rho )`$, where $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ is a partition satisfying $`k\lambda _1\mathrm{}\lambda _n1`$, and $`\rho =(\rho _1,\mathrm{},\rho _n)𝐙_0`$ is a set of integers satisfying

$$\rho _i\rho _{i+1}\text{ if }\lambda _i=\lambda _{i+1}.$$
(1.3)
The set of integers $`\rho `$ is called a rigging of the partition $`\lambda `$.

The bijection preserves degrees, where the degree of a configuration $`𝐚`$ is given by

$$d(𝐚)=\underset{i=0}{\overset{\mathrm{}}{}}ia_i$$
(1.4)
and the degree of a rigged partition $`(\lambda ,\rho )`$ is given by

$$\underset{1i<jn}{}A_{\lambda _i,\lambda _j}+\underset{i=1}{\overset{n}{}}\rho _i\text{ where }A_{l,l^{}}=2\mathrm{m}\mathrm{i}\mathrm{n}(l,l^{})+\mathrm{max}(l+l^{}k,0).$$
(1.5)
Using $`𝐦=(m_1,\mathrm{},m_k)`$, $`m_l=\mathrm{}\{i;\lambda _i=l\}`$, one can write

$`Q(𝐦)`$ $`=`$ $`{\displaystyle \underset{1i<jn}{}}A_{\lambda _i,\lambda _j}`$
$`=`$ $`{\displaystyle \frac{1}{2}}(A𝐦,𝐦){\displaystyle \frac{1}{2}}{\displaystyle \underset{l=1}{\overset{k}{}}}A_{l.l}m_l.`$
The sum over the riggings is easy because we have

$$\underset{\rho _1\mathrm{}\rho _m0}{}q^{\rho _1+\mathrm{}+\rho _m}=\frac{1}{(q)_m}.$$

Therefore, the bijection implies the combinatorial identity,

$$\underset{𝐚}{}q^{d(𝐚)}=\underset{m_1,\mathrm{},m_k=0}{\overset{\mathrm{}}{}}\frac{q^{Q(𝐦)}}{_{l=1}^k(q)_{m_l}},$$
(1.6)
where the summation over $`𝐚`$ is under the conditions (1.1) and (1.2).

We also determine the image of the following two kinds of subsets by the bijection:

the configurations satisfying

$$a_0=a,a_1=b;$$
(1.7)
the configurations satisfying

$$a_i=0\text{ for all }i>N.$$
(1.8)
We denote by $`R(r_1,\mathrm{},r_k)`$ the set of rigged partitions satisfying

$$\rho _ir_{\lambda _i}\text{ for all }1in.$$
(1.9)
In particular, for $`a,b1`$ and $`a+bk`$ we set

$$R[a,b]=\{\begin{array}{cc}R(\underset{a}{\underset{}{0,\mathrm{},0}},\underset{b}{\underset{}{1,\mathrm{},b}},\underset{kab}{\underset{}{b+2,\mathrm{},2k2ab}})\hfill & \text{if }a,b>0;\hfill \\ \mathrm{}\hfill & \text{if }a=1\text{ or }b=1.\hfill \end{array}$$
(1.10)
The subset corresponding to (1.7) is given by

$$R[a,b]\backslash (R[a1,b+2]R[a,b1]),$$
(1.11)
where $`R[a1,b+2]=R[a1,ka+1]`$ for $`a+b=k`$ is understood. The rigged partitions corresponding to (1.8) are characterized by

$$\rho _i\lambda _iN\underset{ji}{}A_{\lambda _i,\lambda _j}.$$
(1.12)
The character of the set of rigged partitions restricted by (1.9) and (1.12) is given by

$$\underset{m_1,\mathrm{},m_k=0}{\overset{\mathrm{}}{}}q^{Q(𝐦)+_{i=1}^kr_im_i}\underset{\genfrac{}{}{0pt}{}{1lk}{m_l0}}{}\left[\genfrac{}{}{0pt}{}{lN\underset{i=1}{\overset{k}{}}A_{l,i}m_i+A_{l,l}r_l+m_l}{m_l}\right].$$
(1.13)
Here $`\left[\genfrac{}{}{0pt}{}{m}{n}\right]`$ is the $`q`$ binomial coefficient

$$\left[\genfrac{}{}{0pt}{}{m}{n}\right]=\{\begin{array}{cc}_{i=1}^n\frac{(1q^{mn+i})}{1q^i}\hfill & \text{if }0nm;\hfill \\ 0\hfill & \text{otherwise}.\hfill \end{array}$$

We denote the character corresponding to the subset $`R[a,b]`$ and the restriction (1.8) by $`\chi _{a,b}^{(k)}[N]`$.

In conclusion, the bijections give the following polynomial identities.

$$\underset{𝐚}{}q^{d(𝐚)}=\{\begin{array}{cc}\chi _{a,b}^{(k)}[N]\chi _{a1,b+2}^{(k)}[N]\chi _{a,b1}^{(k)}[N]+\chi _{a1,b+1}^{(k)}[N]\hfill & \text{if }a,b>0;\hfill \\ \chi _{a,0}^{(k)}[N]\chi _{a1,2}^{(k)}[N]\hfill & \text{if }a>0,b=0;\hfill \\ \chi _{0,b}^{(k)}[N]\chi _{0,b1}^{(k)}[N]\hfill & \text{if }a=0,b>0;\hfill \\ \chi _{0,0}^{(k)}[N]\hfill & \text{if }a=b=0.\hfill \end{array}$$
(1.14)
where the summation over $`𝐚`$ is under the conditions (1.1), (1.2), (1.7) and (1.8).

In general, for $`r1`$, a configuration $`𝐚`$ is called a $`(k,r)`$-configuration if it satisfies

$$a_i+\mathrm{}+a_{i+r1}k.$$
(1.15)
Let us discuss some physical background for this. We can think of $`a_i`$ as the number of particles in the energy level $`i`$. If $`k=r=1`$, the restriction (1.15) can be considered as Pauli’s exclusion principle. The case $`(k,r)=(1,2)`$ appeared in \[B\] in the study of the hard hexagon model in statistical mechanics on the two-dimensional lattice. By the corner transfer matrix method, the computation of the one point functions for the two-dimensional lattice model reduced to the computation of the one-dimensional configuration sums with the condition $`(k,r)=(1,2)`$ in (1.2). The case of general value of $`k`$ (with $`r=2`$) appeared in \[ABF\].

In representation theory, the $`(k,r)`$-configurations appeared in \[P\] as labels parametrizing a set of monomial basis in the level $`k`$ irreducible highest weight representations of the affine Lie algebras $`\widehat{𝔰𝔩}_r`$. Very recently, a connection to Macdonald’s polynomials was found \[FJMM\],

In \[ABF\] and also in \[P\], $`(k,r)`$-configurations are used as labels of basis of certain infinite dimensional graded vector spaces. The grading is given by (1.4). The statistical sum (1.6) $`_𝐚q^{d(𝐚)}`$ gives the character of these spaces. If $`r=2`$, by changing slightly the definition of configurations (this is not essential), we have the identity

$$\underset{\genfrac{}{}{0pt}{}{\{a_i\}_{i1},a_i0}{a_i+a_{i+1}k}}{}q^{_{i1}ia_i}=\underset{m_1,\mathrm{},m_k=0}{\overset{\mathrm{}}{}}\frac{q^{\frac{1}{2}(G𝐦,𝐦)}}{_{l=1}^k(q)_{m_l}},$$
(1.16)
where

$$G_{l,l^{}}=2\mathrm{min}(l,l^{}).$$
(1.17)
This is the sum side of Gordon’s generalization of Roger-Ramanujan identities (see Theorem 7.5 of , the case $`i=k`$).

In \[KKMM\], similar formulas for the characters in conformal field theory are studied extensively. The Gordon type formulas are called fermionic formulas, and formulas in the other side of the corresponding identities are called bosonic formulas. In this paper, we give a fermionic formula for the $`(k,3)`$-configurations. In \[FJMMT\], we give a different fermionic formula for the $`(k,3)`$-configurations. The fermionic formulas for the general $`(k,r)`$-configurations are not known. On the other hand, a bosonic formula for the general $`(k,r)`$-configurations is given in \[FJLMM\].

Our method for computing the one-dimensional configuration sum is to construct a bijection between configurations $`𝐚`$ and rigged partitions $`(\lambda ,\rho )`$. The notion of rigged configurations, i.e., a sequence of partitions with riggings, was introduced by \[KKR\] in the study of Bethe Ansatz. In this paper, we consider a single partition $`\lambda `$ with rigging $`\rho `$. We use the term ‘rigged partition’ for this reason.

Let us explain the meaning of rigged partitions for one-dimensional configurations. As we have explained, the physical interpretation of $`a_i`$ is the number of particles in the energy level $`i`$. Our bijection gives another way of describing a configuration as a union of particles. Let us call them as quasi-particles in distinction with particles in the first interpretation. In Section 2 and after, we simply use the term ‘particle’ since we discuss only the second interpretation.

If $`k=1`$, particles and quasi-particles are the same. In this case, if $`r2`$, the condition (1.2) can be understood as a repulsive interaction between particles: two particles cannot occupy two energy levels which are closer than $`r`$. Namely, the interaction between the particles is a two-body interaction. The lowest energy in the $`m`$-particle sector is given by $`rm(m1)/2`$, and the fermionic formula read as

$$\underset{m=1}{\overset{\mathrm{}}{}}\frac{q^{\frac{r}{2}m(m1)}}{(q)_m}.$$

For $`k2`$, we introduce quasi-particles. The condition (1.2) means no $`k+1`$ particles occupy energy levels in an interval of width $`r`$. This is a $`(k+1)`$-body interaction. However, for $`r=2,3`$, by introducing $`k`$ kinds of quasi-particles, we can reform it to a two-body interaction between the quasi-particles. We construct a bijection between the $`(k,r)`$-admissible configurations $`(r=2,3)`$, and the set of rigged partitions $`(\lambda ,\rho )`$. In the sector where the quasi-particle content is given by $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ $`(k\lambda _1\mathrm{}\lambda _n1)`$, the lowest energy is given by $`_{1i<jk}G_{\lambda _i,\lambda _j}`$ where $`G_{l,l^{}}`$ is given by (1.17) for $`r=2`$, or $`G_{l,l^{}}`$ replaced by $`A_{l,l^{}}`$ for $`r=3`$. These are two-body interactions. In fact, it is even more. If we renormalize the energy in each sector, i.e., if we subtract the lowest energy, the sum over $`\rho `$ is the same as in the case of free bosons. In this way, we can reduce the system of single kind of particles with the $`(k+1)`$-body interaction to the system of $`k`$ kinds of free particles.

Let us consider the case $`r=2`$. The lowest energy configuration in the $`2`$-particle sector is

$`a_0,a_1,a_2,a_3,\mathrm{}`$
$`2,0,0,0,\mathrm{}.`$
We consider this as a weight $`2`$ quasi-particle of energy $`0`$. We increase the energy of this quasi-particle one by one as follows.

$`1,1,0,0,\mathrm{},`$
$`0,2,0,0,\mathrm{},`$
$`0,1,1,0,\mathrm{},`$
$`0,0,2,0,\mathrm{}.`$
Similarly, we can define a configuration corresponding to single quasi-particle of weight $`l`$ with energy $`d`$. We associate it with a rigged partition $`(\lambda ,\rho )`$ such that $`\lambda =(l)`$ and $`\rho _1=d`$. For example, for $`k3`$, the $`(k,2)`$-admissible configuration

$$0,0,2,1,0,\mathrm{}$$
(1.18)
corresponds to the rigged partition with $`\lambda =(3)`$ and $`\rho _1=7`$. Because of the condition $`a_i+a_{i+1}k`$, the weight of a quasi-particle is at most $`k`$.

In general, we define the quasi-particle content of a $`(k,2)`$-admissible configuration $`𝐚`$ as follows. Set $`l=\mathrm{max}(a_i+a_{i+1})`$, and let $`i_1`$ be the largest integer such that $`a_{i_1}+a_{i_1+1}=l`$. We consider that the configuration contains a weight $`l`$ quasi-particle at $`(i_1,i_1+1)`$. The configuration given by

$$(M_+𝐚)_i=\{\begin{array}{cc}a_{i_1}1\text{ if }i=i_1,\hfill & \\ a_{i_1+1}+1\text{ if }i=i_1+1,\hfill & \\ a_i\text{ otherwise}.\hfill & \end{array}$$

is also $`(k,2)`$-admissible and satisfies $`\mathrm{max}((M_+𝐚)_i+(M_+𝐚)_{i+1}))=l`$. We call the mapping $`M_+`$ the right move. For example,

$`3,0,1,1,0,\mathrm{},`$
$`2,1,1,1,0,\mathrm{},`$
$`1,2,1,1,0,\mathrm{},`$
$`1,1,2,1,0,\mathrm{},`$
$`1,1,1,2,0,\mathrm{},`$
$`1,1,0,3,0,\mathrm{}.`$
In this example, the right move increases the energy of the weight $`3`$ quasi-particle. At first, this particle has the energy $`0`$. After $`5`$ steps, its energy increased to $`9`$. We observe an acceleration of the increment of the energy: $`95=4`$. This is equal to the energy shift of the weight $`2`$ particle: at first the energy is $`5`$, and after the heavy particle passes, it decreases to $`1`$. In general, the energy shift when a weight $`l`$-particle passes a weight $`l^{}`$-particle $`(l^{}<l)`$, is given by $`G_{l,l^{}}`$.

Let us define the quasi-particle content $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ and the corresponding energies $`\rho =(\rho _1,\mathrm{},\rho _n)`$ of the configuration $`𝐚`$ inductively as follows. The integer $`l`$ is as above. Suppose that after $`t`$ steps of right moves, the weight $`l`$ particle with the highest energy is separated from the rest of the configuration. Namely, for some $`j`$, $`(M_+^t𝐚)_j+(M_+^t𝐚)_{j+1}=l`$ and $`(M_+^t𝐚)_i=0`$ for all $`i>j+1`$. Set $`d=j(M_+^t𝐚)_j+(j+1)(M_+^t𝐚)_{j+1}`$. This is the energy of this weight $`l`$ particle. Let $`(\lambda _2,\mathrm{},\lambda _n)`$ and $`(\rho _2,\mathrm{},\rho _n)`$ be the quasi-particle content and the corresponding energies for the rest. Then, we set $`\lambda _1=l`$ and $`\rho _1=td_{i=2}^nG_{l,\lambda _i}`$.

We have sketched the bijection proof of the identity (1.16). In Sections 2 and 3, we construct a similar bijection for the $`(k,3)`$-configurations.

## 2. Particle content and rigging

A sequence of non-negative integers $`𝐚=(a_i)_{i𝐙}`$ is called a configuration. We write $`(𝐚)_i`$ to denote $`a_i`$ in $`𝐚`$. A configuration is called finite if $`a_i=0`$ except for finitely many $`i`$, and positively supported if $`a_i=0`$ for all $`i<0`$. We define the energy $`E(𝐚)`$ and the length $`|𝐚|`$ of a finite configuration $`𝐚`$ by

$`E(𝐚)={\displaystyle \underset{i}{}}ia_i,`$ (2.1)
$`|𝐚|={\displaystyle \underset{i}{}}a_i.`$ (2.2)
For integer $`k,r`$ such that $`k0`$ and $`r1`$, a configuration $`𝐚`$ is called $`(k,r)`$-admissible if the following conditions are valid for all $`i`$.

$$a_i+\mathrm{}+a_{i+r1}k.$$

In this paper we consider the case $`r=3`$ where we have

$$a_i+a_{i+1}+a_{i+2}k.$$
(2.3)
For an integer $`l`$ such that $`0lk`$, a $`(k,3)`$-admissible configuration $`𝐚`$ is called of maximal weight $`l`$ if the following conditions are valid for all $`i`$.

$`a_i+a_{i+1}l,`$ (2.4)
$`a_{i1}+2a_i+2a_{i+1}+a_{i+2}k+l.`$ (2.5)
If $`2lk`$, the condition (2.5) follows from (2.4).

###### Definition 2.1.

We denote by $`C^{(k)}`$ the set of finite and $`(k,3)`$-admissible configurations. We denote by $`C^{(k,l)}`$ the subset of $`C^{(k)}`$ consisting of the configurations of maximal weight less than or equal to $`l`$.

We abbreviate $`C^{(k,l)}\backslash C^{(k,l1)}`$ to $`\underset{¯}{C}^{(k,l)}`$. The subset of $`C^{(k)}`$ consisting of the positively supported configurations is denoted by $`C_{\mathrm{pos}}^{(k)}`$. We set $`C_{\mathrm{pos}}^{(k,l)}=C_{\mathrm{pos}}^{(k)}C^{(k,l)}`$.

For $`𝐚C^{(k)}`$, we set

$$S[j,𝐚]=a_j+a_{j+1},L[j,𝐚]=a_{j1}+2a_j+2a_{j+1}+a_{j+2}.$$
(2.6)
A configuration $`𝐚`$ belongs to $`\underset{¯}{C}^{(k,l)}`$ if and only if $`S[i,𝐚]=l`$ or $`L[i,𝐚]=k+l`$ is valid for some $`i`$. It is possible that $`S[i,𝐚]=l`$ and $`L[i,𝐚]=k+l`$ occur at the same time.

###### Definition 2.2.

We define a mapping $`M_+:\underset{¯}{C}^{(k,l)}\underset{¯}{C}^{(k,l)}`$ called the right move. Let $`𝐚\underset{¯}{C}^{(k,l)}`$ and let $`i_1`$ be the largest integer such that $`S[i_1,𝐚]=l`$ or $`L[i_1,𝐚]=k+l`$ is valid. We say that the configuration $`𝐚`$ contains a particle of weight $`l`$ at the highest position $`i_1`$. We define a configuration $`M_+𝐚`$ by

$$(M_+𝐚)_j=\{\begin{array}{cc}a_{i_1+1}+1\text{ if }j=i_1+1;\hfill & \\ a_{i_1}1\text{ if }j=i_1;\hfill & \\ a_j\text{ otherwise}.\hfill & \end{array}$$
(2.7)
###### Proposition 2.3.

If $`𝐚\underset{¯}{C}^{(k,l)}`$ then $`M_+𝐚`$ belongs to $`\underset{¯}{C}^{(k,l)}`$. We have

$$E(M_+𝐚)=E(𝐚)+1,|M_+𝐚|=|𝐚|.$$
(2.8)
###### Proof.

For notational simplicity, we write $`i=i_1`$. We also set $`b_j=(M_+𝐚)_j`$ for all $`j`$. We show that $`a_i>0`$ so that $`b_i0`$. Suppose $`a_i=0`$. If $`S[i,𝐚]=l`$, then $`a_{i+1}=l`$. This is a contradiction because $`S[i+1,𝐚]=l`$ then holds. If $`L[i,𝐚]=k+l`$, then we have $`a_{i1}+2a_{i+1}+a_{i+2}=k+l`$. Since $`a_{i1}+a_{i+1}k`$, we have $`a_{i+1}+a_{i+2}l`$. This is a contradiction.

We show that $`a_{i+1}+a_{i+2}+a_{i+3}<k`$ so that $`b_{i+1}+b_{i+2}+b_{i+3}k`$. If $`a_{i+1}+a_{i+2}+a_{i+3}=k`$, then we have $`a_i+a_{i+1}+a_{i+2}<l`$ because $`a_i+2a_{i+1}+2a_{i+2}+a_{i+3}<k+l`$. This is a contradiction because neither $`S[i,𝐚]=l`$ nor $`L[i,𝐚]=k+l`$ holds.

After these observations it is easy to see that $`𝐛`$ belongs to $`\underset{¯}{C}^{(k,l)}`$. The equations (2.8) are obvious by the definition (2.7). ∎

###### Example 2.4.

The following table shows the right moves of a configuration $`𝐚C^{(3,3)}`$ given by

$$a_i=\{\begin{array}{cc}3\text{ if }i=0;\hfill & \\ 1\text{ if }i=3;\hfill & \\ 0\text{ otherwise}.\hfill & \end{array}$$

$$3001210112011111102110121003.$$

One of our goals is to define a particle content of a $`(k,3)`$ configuration. In Example 2.4 we can think of the particle content of $`𝐚`$ to be one particle of weight $`3`$ and another particle of weight $`1`$. In the sequence of right moves the heavy particle passes the light particle from the left to the right. The position of the light particle shifts by $`3`$ in energy. At the same time, the right move of the heavy particle is accelerated by the existence of the light particle by $`3`$. At the first position, the energy of the heavy particle is $`0`$. After the $`6`$ steps, it already reaches to the energy $`9`$. Since the total energy difference is equal to the number of steps, the energy shift of the light particle and the difference between the energy shift of the heavy particle and the number od steps, are equal, i.e., $`3`$ in the above example.

###### Proposition 2.5.

Let $`𝐚C^{(k,l)}`$. Suppose that $`i_1`$ is the highest position of weight $`l`$ particle in $`𝐚`$. If we have $`S[i_1,𝐚]=l`$, after several right moves the highest position will changes to $`i_1+1`$ $`(`$and we have $`S[i_1+1,𝐚]=l`$ or $`L[i_1+1,𝐚]=k+l)`$. If $`L[i_1,𝐚]=k+l`$, the highest position changes to either $`i_1+1`$ $`(`$and we have $`S[i_1+1,𝐚]=l`$ or $`L[i_1+1,𝐚]=k+l)`$, or to $`i_1+2`$ $`(`$and we have $`L[i_1+2,𝐚]=k+l)`$.

###### Proof.

While the highest position is $`i_1`$, the right move is nothing but $`1,+1`$ at the $`i_1`$-th and the $`(i_1+1)`$-th column. Therefore, when the highest position changes at $`𝐛=M_+^t𝐚`$, the change is such that $`S[i_1+1,𝐛]=l`$, $`L[i_1+1,𝐛]=k+l`$ or $`L[i_1+2,𝐛]=k+l`$. The change from $`S[i_1,M_+^{t1}𝐚]=l`$ to $`L[i_1+2,𝐛]=k+l`$ is prohibited by the following lemma. ∎

###### Lemma 2.6.

Let $`𝐚C^{(k,l)}`$, and suppose that

$$a_{i+1}+2a_{i+2}+2a_{i+3}+a_{i+4}=k+l$$
(2.9)
for some $`i`$. If we have $`a_i+a_{i+1}=l`$, then we have $`a_{i+3}+a_{i+4}=l`$. Similarly, if $`a_{i+4}+a_{i+5}=l`$, then we have $`a_{i+1}+a_{i+2}=l`$.

###### Proof.

We prove the first statement. By symmetry, the second statement follows.

We have $`a_i+2a_{i+1}+2a_{i+2}+a_{i+3}k+l`$. Since $`a_i+a_{i+1}=l`$, we have $`a_{i+1}+2a_{i+2}+a_{i+3}k`$. From (2.9), we have $`a_{i+3}+a_{i+4}l`$. Since $`𝐚C^{(k,l)}`$, we have $`a_{i+3}+a_{i+4}l`$, and the assertion follows. ∎

Let us formulate the particle content of a configuration in general. We set

$$A_{l,l^{}}=2\mathrm{min}(l,l^{})+(l+l^{}k)_+.$$
(2.10)
Here, $`(x)_+=\mathrm{max}(x,0)`$. The energy shift when a heavy particle of weight $`l`$ passes a light particle of weight $`l^{}`$ is equal to $`A_{l,l^{}}`$. We will clarify this statement in the below.

We say a configuration $`𝐚\underset{¯}{C}^{(k,l)}`$ contains a free particle of weight $`l`$ at the highest position $`i`$ if $`S[i,𝐚]=l`$ is valid with $`a_i0`$, and $`a_j=0`$ for all $`ji+2`$. Note that the right moves of such a configuration is simple. Namely, after several changes $`1,+1`$ at the $`i`$-th and the $`(i+1)`$-th column, the position of the free particle changes to $`i+1`$, and we have $`(a_i,a_{i+1},a_{i+2})=(0,l,0)`$. Then, it changes to $`i+2`$ and so on, each time $`l`$ right moves are added. We define the energy of the free particle to be $`d=ia_i+(i+1)a_{i+1}`$.

###### Proposition 2.7.

Let $`𝐚\underset{¯}{C}^{(k,l)}`$. If $`t`$ is large enough, then $`M_+^t𝐚`$ contains a free particle of weight $`l`$ at the highest position $`i`$ for some $`i`$. Suppose that $`(M_+^t𝐚)_i=c`$ where $`1cl`$. By the definition the energy of this particle is $`d=ic+(i+1)(lc)`$. The difference $`s=dt`$ is independent of the choice of $`t`$.

###### Proof.

Let $`i_0`$ be such that

$$a_{i_01}0,a_j=0\text{ for all }ji_0.$$
(2.11)
Consider the right moves of $`𝐚`$. Since the energy of $`𝐚`$ increases by $`1`$ in each move, in finite steps, the condition (2.11) will break down. Suppose that the breakdown happens in the move from $`M_+^{t_0}𝐚`$ to $`M_+^{t_0+1}𝐚`$. It happens necessarily in such a way that $`(a_{i_01},a_{i_0})`$ changing from $`(l,0)`$ to $`(l1,1)`$. At this stage, the configurations contain a free particle of weight $`l`$ at the highest position $`i_01`$. The value $`s`$ is independent of $`t`$ because both $`t`$ and $`d`$ increases by $`1`$ in each step. ∎

###### Proposition 2.8.

Let $`1l^{}<lk`$. Suppose that a configuration $`𝐚`$ is such that for some $`j_1,j_2`$ where $`j_1<<j_2`$ we have $`a_i=0`$ if $`ij_1,j_1+1,j_2,j_2+1`$ and

$$a_{j_1}+a_{j_1+1}=l^{},a_{j_2}+a_{j_2+1}=l.$$

If $`t`$ is sufficiently large, then $`M_{}^t𝐚`$ is such that $`(M_{}^t𝐚)_i=0`$ if $`ij_3,j_3+1,j_4,j_4+1`$ where $`j_3<<j_4`$ is given by

$`a_{j_3}+a_{j_3+1}=l,a_{j_4}+a_{j_4+1}=l^{},`$
$`j_3a_{j_3}+(j_3+1)a_{j_3+1}=j_2a_{j_2}+(j_2+1)a_{j_2+1}tA_{l.l^{}},`$
$`j_4a_{j_4}+(j_4+1)a_{j_4+1}=j_1a_{j_1}+(j_1+1)a_{j_1+1}+A_{l.l^{}}.`$
In particular, $`j_4`$ is independent of $`t`$.

###### Proof.

For notational simplicity we set $`c=a_{j_1}`$. Note that $`0cl^{}`$. The original configuration has a weight $`l`$ particle at the highest position $`j_2`$. For small $`t`$ the change from $`M_{}^t𝐚`$ to $`M_{}^{t+1}𝐚`$ is such that the energy of this particle decreases by $`1`$.

Case $`l+l^{}k`$. The weight $`l`$ particle moves until the configuration becomes of the form

$$\mathrm{},0,c,l^{}c,ll^{}+c,l^{}c,0,\mathrm{}.$$

We have $`0+2c+2(l^{}c)+(ll^{}+c)=l+l^{}+c<k+l`$ and $`(l^{}c)+(ll^{}+c)=l`$. The configuration further changes to

$$\mathrm{},0,c,lc,c,l^{}c,0,\mathrm{}.$$

Case $`l+l^{}k+c`$. The weight $`l`$ particle moves until the configuration becomes of the form

$$\mathrm{},0,c,l^{}c,0,kl^{}+c,l+l^{}kc,0,\mathrm{}.$$

We have $`(l^{}c)+20+2(kl^{}+c)+(l+l^{}kc)=k+l`$. The configuration further changes to

$$\mathrm{},0,c,l^{}c,ll^{},kl+c,l+l^{}kc,0,\mathrm{},$$

where $`c+2(l^{}c)+2(ll^{})+kl+c=k+l`$, and further to

$$\mathrm{},0,c,lc,0,kl+c,l+l^{}kc,0,\mathrm{}.$$

Case $`k+c>l+l^{}>k`$. The weight $`l`$ particle moves until the configuration becomes of the form

$$\mathrm{},0,c,l^{}c,k+c2l^{},l+2l^{}kc,0,\mathrm{}.$$

We have $`c+2(l^{}c)+2(k+c2l^{})+l+2l^{}kc=k+l`$. The configuration changes to

$$\mathrm{},0,c,lc,k+cll^{},l+2l^{}kc,0,\mathrm{}.$$

In all cases, the last configuration has a free particle at the lowest position, and the after is simple. We can easily check that the energy shift is equal to $`A_{l,l^{}}`$. ∎

###### Definition 2.9.

Let $`𝐚C^{(k)}`$. We define a partition $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ and a set of integer $`\rho =(\rho _1,\mathrm{},\rho _n)`$ inductively with respect to the length of configuration. We call $`\lambda `$ the particle content of $`𝐚`$, and $`\rho `$ the rigging of $`\lambda `$.

The inductive procedure is as follows. Let $`l`$ be such that $`𝐚\underset{¯}{C}^{(k,l)}`$. We set $`\lambda _1=l`$. Let $`i_0,t_0`$ and $`s_1=s`$ be as in Proposition 2.7. We define a new configuration $`\overline{𝐚}=(\overline{a}_i)`$ of smaller length by

$$\overline{a}_i=\{\begin{array}{cc}(M_+^{t_0}𝐚)_i\text{ if }ii_02;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$
(2.12)
Let $`\overline{\lambda }=(\lambda _2,\mathrm{},\lambda _n)`$ and $`\overline{\rho }=(\rho _2,\mathrm{},\rho _n)`$ be the particle content and its rigging. We set

$$\rho _1=s_1\underset{a=2}{\overset{m}{}}A_{\lambda _1,\lambda _a}.$$
(2.13)
After this procedure, we define $`\lambda =(\lambda _1,\overline{\lambda })`$ and $`\rho =(\rho _1,\overline{\rho })`$.

We write the particle content $`\lambda `$, alternatively by $`𝐦=(m_1,\mathrm{},m_k)`$ where $`\lambda =(k^{m_k},\mathrm{},1^{m_1})`$. Namely, $`m_l`$ is the number of particles in $`𝐚`$ that are of weight $`l`$.

The following statement is obvious by the definition.

###### Lemma 2.10.

Let $`𝐚C^{(k)}`$, and let $`(\lambda ,\rho )`$ be its particle content and the rigging. Let $`(\mu ,s)`$ be the particle content and its rigging of $`M_+𝐚`$. Then, we have $`\mu =\lambda `$ and $`s_i=\rho _i+\delta _{i,1}`$.

Let us explain the reason for the subtraction in the definition of $`\rho _1`$. Suppose that a configuration $`𝐚C^{(k,l)}`$ is such that $`a_i=0`$ for $`i<0`$, and $`a_0=l`$. Suppose further that $`i_1`$ in the definition of $`M_+`$ is equal to $`0`$. Namely, it contains a particle of weight $`l`$ at the highest position $`0`$. We will show that the difference between the energy shift and the number of steps when this particle moves to the right and becomes free, is given by $`_{a=2}^mA_{\lambda _1,\lambda _a}`$. Suppose that after $`t`$ steps of right moves the weight $`l`$ particle becomes free and reaches the energy $`d`$. Then, the difference $`s_1=dt`$ is equal to the above sum. Namely, we have $`\rho _1=0`$ by the definition. In general, we will prove that the positivity of the rigging in this normalization is equivalent to the positivity of its support, i.e., $`𝐚C_{\mathrm{pos}}^{(k)}`$.

By the definition it is obvious that the particle content $`\lambda `$ is a partition, i.e., $`\lambda _i\lambda _{i+1}`$ for all $`i`$. It is less obvious but true that the rigging satisfies the condition

$$\rho _i\rho _{i+1}\text{ if }\lambda _i=\lambda _{i+1}.$$

To prove this statement (see Proposition 2.15), we prepare a few propositions.

In Definition 2.2, we defined the integer $`i_1`$ for a configuration $`𝐚\underset{¯}{C}^{(k,l)}`$, which is the position of the highest (or first) particle of weight $`l`$ in $`𝐚`$. The right move of $`𝐚`$ is nothing but to move this particle to the right. After finite steps, this particle becomes free. Then, we have removed this particle from the configuration to obtain $`\overline{𝐚}`$ in (2.12). This is equivalent to applying the right move $`M_+`$ to $`𝐚`$ infinitely many times:

$$\overline{𝐚}=M_+^{\mathrm{}}𝐚.$$

Applying the same procedure to $`\overline{𝐚}`$ and so on, we obtain $`i_2,\mathrm{},i_{m_l}`$, which are by definition the positions of the second particle of weight $`l`$, and so on. This is an inductive procedure using many steps of right moves. However, we can define these numbers without using right moves.

Suppose we find the integer $`i_1`$ from the configuration $`𝐚`$ as explained above. Instead of moving the configuration, we consider the cut-off $`𝐛`$ of $`𝐚`$ at $`i_1`$:

$$b_i=\{\begin{array}{cc}a_i\text{ if }ii_11;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$
(2.14)
If $`𝐛\underset{¯}{C}^{(k,l)}`$, we define $`\overline{i}_2`$ to be the position of the first particle of weight $`l`$ in $`𝐛`$. Continuing further while the cut-off particle still belongs to $`\underset{¯}{C}^{(k,l)}`$, we can define the numbers $`\overline{i}_3,\mathrm{},\overline{i}_{\overline{m}_l}`$. Now, we state the proposition.

###### Proposition 2.11.

We follow the above setting. Then, we have the equalities

$$\overline{m}_l=m_l,\overline{i}_a=i_a(2am_l).$$

###### Proof.

It is enough to show that the position of the second particle of weight $`l`$ is invariant by the right move. Let us prove this statement. Let $`𝐚C^{(k,l)}`$ is such that the first particle of weight $`l`$ is at the position $`i`$ (i.e., $`i_1=i`$). If the position of the first particle of weight $`l`$ does not change for $`M_+𝐚`$, the statement is clear. We have two other cases, either the position of the first particle changes to $`i+1`$ or to $`i+2`$. In the former, the cut-off configuration obtained from $`M_+𝐚`$ is of the form

$$\mathrm{},a_{i2},a_{i1},a_i1,0,0,\mathrm{}.$$

Since $`𝐚C^{(k,l)}`$, this configuration satisfy neither $`S_j`$ ($`ji1`$) nor $`L_j`$ ($`ji2`$). Therefore, the highest position of the weight $`l`$ particle is the same as that of the cut-off configuration obtained from $`𝐚`$. In the latter, we have $`L_{i+2}`$ for $`M_+𝐚`$, and by Proposition 2.5, we have $`a_i+a_{i+1}<l`$. The cut-off configuration obtained from $`M_+𝐚`$ is of the form

$$\mathrm{},a_{i2},a_{i1},a_i1,a_{i+1}+1,0,\mathrm{}.$$

It is again easy to check that neither $`S_j`$ ($`ji1`$) nor $`L_j`$ ($`ji2`$) is valid for this configuration. ∎

For a configuration $`𝐚C^{(k,l)}`$, we can thus define the number of the weight $`l`$ particles $`m_l`$, and their positions $`i_1,\mathrm{},i_{m_l}`$. We denote by $`C_m^{(k,l)}`$ the set of configurations in $`C^{(k,l)}`$ such that $`m_l=m`$.

We use the following lemma in the proof of Proposition 3.1.

###### Lemma 2.12.

Suppose that $`𝐚C_m^{(k,l)}`$. Let $`i_1,\mathrm{},i_m`$ be the positions of the weight $`l`$ particles in $`𝐚`$. Let $`𝐜`$ be the configuration obtained from $`𝐚`$ by the cut-off from the left at the column $`i_m+1`$. Namely,

$$(𝐜)_i=\{\begin{array}{cc}a_i\text{ if }ii_m+2;\hfill & \\ 0\text{ otherwise}.\hfill & \end{array}$$

Then, the number of the weight $`l`$ particle in $`𝐜`$ is $`m1`$, and their positions are $`i_1,\mathrm{},i_{m1}`$.

###### Proof.

In Proposition 2.11 we have shown that the number and the positions of the weight $`l`$ particles are determined by the cut-off procedure. The claim of this lemma is that the cut-off from the left in the definition of $`𝐜`$ does not affect this procedure until we locate the $`(m1)`$-th weight $`l`$ particle in $`𝐜`$. To prove this it is enough to show that if $`L[i_{m1},𝐚]=k+l`$ then $`L[i_{m1},𝐜]=k+l`$. This is clear if $`i_m+1<i_{m1}1`$. Otherwise, we have $`i_m+2=i_{m1}`$, and therefore, $`S[i_m,𝐚]=l`$ and $`L[i_m+2,𝐚]=k+l`$. By Lemma 2.6 this imples $`S[i_{m1}+1,𝐚]=l`$. This is a contradiction. ∎

The right move $`M_+`$ moves the first particle which is located at the position $`i_1`$. The change is $`(a_{i_1},a_{i_1+1})(a_{i_1}1,a_{i_1+1}+1)`$. The number of the weight $`l`$ particles is invariant by this change. The position of the first particle is either unchanged or moves to $`i_1+1`$ or $`i_1+2`$. The positions of the other particles are unchanged. It is natural to think of moves of other particles of weight $`l`$. We want to define $`M_+^{(c)}`$ ($`1cm_l`$), which changes $`(a_{i_c},a_{i_c+1})`$ to $`(a_{i_c}1,a_{i_c+1}+1)`$. However, this is not always possible because this change may break down the condition $`𝐚C^{(k,l)}`$. In Proposition 2.3, we proved that for $`c=1`$ the condition $`𝐚C^{(k,l)}`$ is preserved. The following proposition gives an alternative answer for the case $`c2`$.

###### Lemma 2.13.

Let $`𝐚C_m^{(k,l)}`$. For $`2cm`$ the configuration

$$𝐚^{(c)}=M_+^{(c)}M_+^{(c1)}\mathrm{}M_+^{(1)}𝐚$$

belongs to $`C_m^{(k,l)}`$.

###### Proof.

Suppose that $`𝐚^{(c1)}`$ belongs to $`C^{(k,l)}`$. Set $`𝐚^{(c1)}=(b_i)_{i𝐙}`$. By Proposition 2.11, the position of the $`c`$-th particle of weight $`l`$ for $`𝐛`$ is equal to $`i_c`$, i.e., the same as $`𝐚`$. We want to show that the change of $`(b_{i_c},b_{i_c+1})`$ to $`(b_{i_c}1,b_{i_c+1}+1)`$ does not break the conditions (2.4) and (2.5). Since the argument is the same for all $`c2`$, let us consider the case $`c=2`$. For simplicity we write $`i=i_1`$ and $`i^{}=i_2`$. We have $`𝐚,𝐛=M_+𝐚C^{(k,l)}`$ where

$$b_j=\{\begin{array}{cc}a_{i+1}+1\text{ if }j=i+1,\hfill & \\ a_i1\text{ if }j=i,\hfill & \\ a_j\text{otherwise}.\hfill & \end{array}$$

We set

$$c_j=\{\begin{array}{cc}b_{i^{}+1}+1\text{ if }j=i^{}+1,\hfill & \\ b_i^{}1\text{ if }j=i^{},\hfill & \\ b_j\text{otherwise}.\hfill & \end{array}$$

We must show that

$$S[j,𝐜]l,L[j,𝐜]k+l.$$

First consider $`S[j,𝐜]`$. Since $`𝐛C^{(k,l)}`$, we have to consider only the case $`j=i^{}+1`$, where $`S[j,𝐜]=S[j,𝐛]+1`$. If $`i^{}+2<i`$, the positions $`(i^{}+1,i^{}+2)`$ used in $`S[i^{}+1,𝐜]`$ are below the cut-off point of $`𝐚`$ (see (2.14)) in the definition of the position of the second particle. Therefore, by Proposition 2.3, we have $`S[j,𝐜]l`$. In this way, the remaining case is $`i^{}=i2`$ and $`j=i1`$. In this case, we have $`S[j,𝐜]=S[j,𝐚]`$ and the assertion follows.

Next consider $`L[j,𝐜]`$. The cases $`j=i^{}+1,i^{}+2`$ are in question since we have $`L[j,𝐜]=L[j,𝐛]+1`$ for them. Again, if the positions $`(j1,j,j+1,j+2)`$ are below the cut-off point, i.e., if $`j+2<i`$ we have $`L[j,𝐜]k+l`$ by using Proposition 2.3. The remaining cases are $`(i^{},j)=(i2,i1),(i2,i),(i3,i2),(i3,i1)`$. In the first two cases, we have $`a_{i2}+a_{i1}=l`$ since otherwise we must have the condition for the weight $`l`$ particle in the form $`a_{i3}+2a_{i2}+2a_{i1}+a_i=k+l`$, but the position $`i`$ is above the cut-off point. One can check that except for the second case, we have $`L[j,𝐜]=L[j,𝐚]`$ and therefore, the assertion follows in these cases. Finally, suppose that $`L[j,𝐜]=k+l+1`$ in the second case. It implies that $`L[i,𝐚]=k+l`$. Recall that $`a_{i2}+a_{i1}=l`$. By Lemma 2.6 we have $`a_{i+1}+a_{i+2}=l`$. This is a contradiction because we assumed that the first particle in $`𝐚`$ is at $`i`$.

The invariance of $`m_l`$ follows from Proposition 2.11. ∎

###### Lemma 2.14.

Suppose that $`𝐚C_m^{(k,l)}`$. For $`2cm`$ and for all $`s1`$, the mapping $`(M_+^{(c)})^s\mathrm{}(M_+^{(1)})^s𝐚`$ is well-defined on $`C_m^{(k,l)}`$, and we have the equality

$$(M_+^{(c)})^s\mathrm{}(M_+^{(1)})^s𝐚=(M_+^{(c)}\mathrm{}M_+^{(1)})^s𝐚.$$

###### Proof.

The well-definedness for $`s=1`$ is proved in Lemma 2.13. Set $`A=M_+^{(c)}`$ and $`B=M_+^{(c1)}\mathrm{}M_+^{(1)}`$. We will show that $`(AB)^s=A^sB^s`$. Then, the statement of the lemma follows by induction. It is enough to show that $`AB=BA`$ on the image $`BC_m^{(k,l)}`$ since the assertion is obtained by repeated use of this commutativity. Let $`𝐚C_m^{(k,l)}`$. By Proposition 2.11 the position of the $`c`$-th weight $`l`$ particle is the same for $`𝐚,B𝐚,B^2𝐚`$. The positions of the first $`c1`$ weight $`l`$ particles are the same for $`B𝐚`$ and $`AB𝐚`$ because the change caused by $`A`$ does not alter the configuration in the region where the first $`c1`$ weight $`l`$ particles exist. Therefore, the change from $`B𝐚`$ to $`AB^2𝐚`$ and that from $`B𝐚`$ to $`BAB𝐚`$ are the same. ∎

Recall the cut-off procedure to determine the positions of the weight $`l`$ particles for a configuration $`𝐚C_m^{(k,l)}`$. We say the weight $`l`$ particles in $`𝐚`$ are free if at each step of the cut-off procedure we find the highest weight $`l`$ particle is free.

###### Proposition 2.15.

Let $`(\lambda ,\rho )`$ be the particle content and its rigging of a configuration $`𝐚C^{(k)}`$. The rigging satisfies the condition

$$\rho _i\rho _{i+1}\text{ if }\lambda _i=\lambda _{i+1}.$$
(2.15)
###### Proof.

Suppose that $`𝐚C_m^{(k,l)}`$. By Lemma 2.14

$$𝐚[t]=(M_+^{(m)})^t\mathrm{}(M_+^{(1)})^t𝐚$$

belongs to $`C^{(k,l)}`$. By Proposition 2.7, if $`t`$ is large enough, in $`𝐚[t]`$ the weight $`l`$ particles are free. Let $`d_1,\mathrm{},d_m`$ be their energies. By the definition $`\rho _i\rho _{i+1}=d_id_{i+1}A_{l,l}`$ for all $`i`$. Therefore, the assertion follows from the following lemma. ∎

###### Lemma 2.16.

Suppose that $`𝐚C^{(k,l)}`$. Suppose that for $`i,i^{}`$ such that $`ii^{}+2`$ we have $`a_i+a_{i+1}=l`$, $`a_i^{}+a_{i^{}+1}=l`$ and $`a_j=0`$ if $`ji,i+1,i^{},i^{}+1`$. Set $`d=ia_i+(i+1)a_{i+1}`$ and $`d^{}=i^{}a_i^{}+(i^{}+1)a_{i^{}+1}`$. Then we have

$$dd^{}A_{l,l}.$$

###### Proof.

Recall that $`A_{l,l}=2l+(2lk)_+`$. Set $`a_i=a0`$ and $`a_i^{}=b0`$. We consider three cases.

Case 1: $`i^{}i4`$. We have $`dd^{}4l+ba`$. Since $`alk`$, we have $`4l+ba2l+(2lk)_+`$.

Case 2: $`i^{}=i3`$. We have $`dd^{}=3l+ba`$. We have $`3l+ba2l`$ because $`al`$. We use the condition (2.5) for the sequence $`lb,0,a,la`$. It gives $`3l+ba4lk`$. The assertion follows from these two inequalities.

Case 3: $`i^{}=i2`$. We have $`dd^{}=2l+ba`$. We have the sequence $`b,lb,a,la`$. Since $`lb+al`$ we have $`2l+ba2l`$. The condition (2.5) gives $`2l+ba4lk`$. The assertion follows from these two inequalities. ∎

Conversely, we have

###### Lemma 2.17.

Let $`d_i`$ $`(1im)`$ be a set of integers satisfying $`d_id_{i+1}A_{l,l}`$ for $`1im1`$. We choose $`j_i,c_i`$ $`(1im)`$ such that $`1c_il`$ and

$$j_ic_i+(j_i+1)(lc_i)=d_i.$$

Then the $`2m`$ integers $`j_i,j_i+1`$ $`(1im)`$ are distinct. We define a configuration $`𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m)`$ by

$$(𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m))_j=\{\begin{array}{cc}c_i\text{ if }j=j_i;\hfill & \\ lc_i\text{ if }j=j_i+1;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$

Then, the configuration $`𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m)`$ belongs to $`C_m^{(k,l)}`$.

###### Proof.

First we prove that $`j_i,j_i+1`$ ($`1im`$) are distinct. It is enough to show that $`j_{i+1}+1<j_i`$. Without loss of generality we assume that $`i=1`$. Note that $`A_{l,l}2l>0`$. Therefore, $`j_2<j_1`$. Let us show that $`j_2+1<j_1`$. Suppose that $`j_2+1=j_1`$, then we have $`A_{l,l}d_1d_2=c_2+lc_1<2l`$. This is a contrdiction.

Set $`𝐚=𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m)`$ We must check the inequalities $`S[i,𝐚]=l`$ and $`L[i,𝐚]=k+l`$. The possible cases where these inequalities are broken are

$`S[j_11,𝐚]=(lc_2)+c_1>l,`$
$`L[j_11,𝐚]=c_2+2(lc_2)+2c_1+(lc_1)>k+l,`$
$`L[j_12,𝐚]=lc_3+2c_2+2(c_2l)+c_1>k+l,`$
$`L[j_11,𝐚]=lc_2+20+2c_1+(lc_1)>k+l,`$
$`L[j_12,𝐚]=c_2+2(lc_2)+20+c_1>k+l,`$
$`L[j_12,𝐚]=0+2c_2+2(c_2l)+c_1>k+l,`$
$`L[j_11,𝐚]=lc_2+2c_1+2(c_1l)+0>k+l.`$
For notational simplicity we used the indices $`i=1,2,3`$ for $`c_i`$.

In each case, it is easy to lead to a contradiction to the assumption $`d_id_{i+1}A_{l,l}=\mathrm{max}(2l,4lk)`$. ∎

## 3. Bijection between configurations and rigged partitions

A pair of partition $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ and its rigging $`\rho =(\rho _1,\mathrm{},\rho _n)`$ is called a rigged partition. Here $`n`$ is a non-negative integer, $`\lambda _i`$ are integers satisfying $`\lambda _1\mathrm{}\lambda _n>0`$ and $`\rho _i`$ are integers satisfying the condition (2.15). There is a unique element with $`n=0`$, which we denote by $`\mathrm{}`$. The integer $`n`$ is specified for each $`\lambda `$. In this sense we write $`n=\mathrm{}(\lambda )`$. We denote by $`R^{(l)}`$ the set of rigged partitions satisfying $`\lambda _1l`$. We denote by $`R_{\mathrm{pos}}^{(l)}`$ the subset of $`R^{(l)}`$ satisfying $`\rho _i0`$. We set $`R_{\mathrm{pos}}^{(l)}=R^{(l)}R_{\mathrm{pos}}^{(l)}`$. Note that there is a natural embedding

$$R^{(k)}R^{(k1)}\mathrm{}R^{(1)}R^{(0)}=\{\mathrm{}\}.$$

In the previous section we defined a mapping

$$\iota :C^{(k,l)}R^{(l)}.$$
(3.1)
We will show that this is a bijection.

In the definition of $`(\lambda ,\rho )`$ for a configuration $`𝐚C^{(k,l)}`$, we used right moves. We can define left moves and the related objects similarly. For example, the left move $`M_{}`$ moves the weight $`l`$ particle in $`𝐚\underset{¯}{C}^{(k,l)}`$ at the lowest position to the left. To be precise, let $`j_1`$ be the smallest integer such that (2.4) or (2.5) is valid for $`i=j_1`$. We define $`𝐛=M_{}𝐚`$ by

$$b_i=\{\begin{array}{cc}a_{j_1}+1\text{ if }i=j_1;\hfill & \\ a_{j_1+1}1\text{ if }i=j_1+1;\hfill & \\ a_i\text{ otherwise.}\hfill & \end{array}$$

We define the cut-off $`𝐜`$ of $`𝐚\underset{¯}{C}^{(k,l)}`$ from the left at $`j_1+1`$ by

$$c_i=\{\begin{array}{cc}a_i\text{ if }ij_1+2;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$

Using the cut-off from the left, we can inductively determine the number of the weight $`l`$ particles $`m_l^{}`$ and their positions $`j_1,\mathrm{},j_{m_l^{}}`$. We can also define the mappings $`M_{}^{(c)}`$ by changing $`(a_{j_c},a_{j_c+1})`$ to $`(a_{j_c}+1,a_{j_c+1}1)`$.

###### Proposition 3.1.

Suppose that $`𝐚C^{(k,l)}`$. Let $`m`$ and $`i_1(𝐚),\mathrm{},i_m(𝐚)`$ be the number and the positions of the weight $`l`$ particles in $`𝐚`$ with respect to the right move, and let $`m^{}`$ and $`j_1(𝐚),\mathrm{},j_m^{}(𝐚)`$ be the number and the positions of the weight $`l`$ particles in $`𝐚`$ with respect to the left move. We define the sets of integers $`𝐢(𝐚)=\{i_1(𝐚),\mathrm{},i_m(𝐚)\}`$ and $`𝐣(𝐚)=\{j_1(𝐚),\mathrm{},j_m^{}(𝐚)\}`$. Then we have $`m=m^{}`$ and the equality of the sets

$$𝐣(M_+^{(m)}\mathrm{}M_+^{(1)}𝐚)=𝐢(𝐚).$$
(3.2)
Moreover, we have

$$M_{}^{(m)}\mathrm{}M_{}^{(1)}M_+^{(m)}\mathrm{}M_+^{(1)}𝐚=𝐚.$$
(3.3)
###### Proof.

Set $`𝐛=M_+^{(m)}\mathrm{}M_+^{(1)}𝐚`$. First we show that $`j_1(𝐛)=i_m(𝐚)`$. Set $`i=i_m(𝐚)`$. Then, we have $`S[i,𝐚]=l`$ or $`L[i,𝐚]=k+l`$. Since $`S[i,𝐛]=S[i,𝐚]`$ and $`L[i,𝐛]=L[i,𝐚]`$, we have $`S[i,𝐛]=l`$ or $`L[i,𝐛]=k+l`$. Therefore, in order to prove $`j_1(𝐛)=i_m(𝐚)`$, it is enough to show that $`S[j,𝐛]<l`$ and $`L[j,𝐛]<k+l`$ for $`j<i`$. Since $`i`$ is the lowest position of the weight $`l`$ particle with respect to the right move, we have $`S[j,𝐛]<l`$ if $`ji2`$ and $`L[j,𝐛]<k+l`$ if $`ji3`$. The remaining cases are $`S[i1,𝐛]<l`$, $`L[i2,𝐛]<k+l`$ and $`L[i1,𝐛]<k+l`$. Since $`b_i=a_i1`$ and $`b_{i+1}=a_{i+1}+1`$ these inequalities follow from $`S[i1,𝐚]l`$, $`L[i2,𝐚]k+l`$ and $`L[i1,𝐚]k+l`$.

Now, we prove (3.2) by induction on the length $`|𝐚|`$ of $`𝐚`$ given by (2.2). Then, the equality (3.3) follows by the definition of these mappings.

Let us consider the configuration $`𝐜`$:

$$𝐜_i=\{\begin{array}{cc}a_j\hfill & \text{if }j>i_m+2;\hfill \\ 0\hfill & \text{otherwise}.\hfill \end{array}$$

We have $`|𝐜|<|𝐚|`$. By Lemma 2.12, the number of the weight $`l`$ particles in $`𝐜`$ with respect to the right move is $`m1`$, and their positions are the same as $`i_1(𝐚),\mathrm{},i_{m1}(𝐚)`$. Therefore, if we define $`𝐝`$ by

$$𝐝_i=\{\begin{array}{cc}b_j\hfill & \text{if }j>i_m+2;\hfill \\ 0\hfill & \text{otherwise},\hfill \end{array}$$

we have $`𝐝=M_+^{(m1)}\mathrm{}M_+^{(1)}𝐜`$. By the definition the positions of the weight $`l`$ particles in $`𝐝`$ with respect to the left move is $`j_2(𝐛),\mathrm{},j_m^{}(𝐛)`$. Applying the induction hypothesis to $`𝐜`$, we obtain $`m=m^{}`$ and $`\{i_1(𝐚),\mathrm{},i_{m1}(𝐚)\}=\{j_2(𝐛),\mathrm{},j_m(𝐛)\}`$. Noting that $`j_1(𝐛)=i_m(𝐚)`$, we obtain (3.2). ∎

By symmetry, we have

###### Corollary 3.2.

The mappings $`M_+^{(m)}\mathrm{}M_+^{(1)}`$ and $`M_{}^{(m)}\mathrm{}M_{}^{(1)}`$ on $`C_m^{(k,l)}`$ are inverse to each other.

The inverse mapping to $`\iota `$,

$$\kappa :R^{(l)}C^{(k,l)},$$
(3.4)
is defined by using the left move.

We construct $`\kappa `$ inductively on $`l`$ starting from $`\kappa (\mathrm{})=\mathrm{𝟎}`$. Here $`\mathrm{𝟎}`$ is the configuration such that $`a_i=0`$ for all $`i`$.

Suppose that $`l>0`$ Denote by $`R_m^{(l)}`$ the subset of $`R^{(l)}`$ satisfying the condition that $`\mathrm{}(\lambda )m`$ and $`\lambda _1=\mathrm{}=\lambda _m=l>\lambda _{m+1}`$. If $`\mathrm{}(\lambda )=m`$ we formally set $`\lambda _{m+1}=0`$ in this condition. For $`(\lambda ,\rho )R_m^{(l)}`$, we define $`(\overline{\lambda },\overline{\rho })`$ by $`\overline{\lambda }=(\lambda _{m+1},\mathrm{},\lambda _n)`$ and $`\overline{\rho }=(\rho _{m+1},\mathrm{},\rho _n)`$. We have $`(\overline{\lambda },\overline{\rho })R^{(l1)}`$. Suppose we have constructed $`\kappa `$ on $`R^{(l1)}`$. Set $`\overline{𝐚}=\kappa (\overline{\lambda },\overline{\rho })C^{(k,l1)}`$.

We construct a configuration from $`\overline{𝐚}`$ by adding $`m`$ free particles of weight $`l`$ at appropriate energies. Then, we use $`(M_{}^{(m)}\mathrm{}M_{}^{(1)})^t`$ to bring them to the correct positions. In Example 2.4, the configuration $`(\mathrm{}3001\mathrm{})`$ is mapped to the rigged partition $`\lambda =(3,1)`$ and $`\rho =(0,0)`$. Let us consider the mapping $`\kappa `$ on this $`(\lambda ,\rho )`$. We have $`\overline{\lambda }=1`$ and $`\overline{\rho }=0`$. Therefore, we have $`\overline{𝐚}=(\mathrm{}1000\mathrm{})`$. We add a weight $`3`$ particle at the energy $`9`$. We obtain $`(\mathrm{}1003\mathrm{})`$. By applying $`(M_{}^{(1)})^6`$ to this configuration, we obtain $`(\mathrm{}3001\mathrm{})`$.

We now formulate this construction formally. Set

$$s_i=\rho _i+\underset{j>i}{}A_{l,\lambda _j}\text{ for }1im.$$
(3.5)
For a sufficiently large $`t`$ we set $`d_i=s_i+t`$. The condition (2.15) implies $`d_id_{i+1}A_{l,l}`$ for $`1im1`$. By Lemma 2.17 we can construct the configuration $`𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m)C_m^{(k,l)}`$. If $`t`$ is large enough, the sum $`𝐛=\overline{𝐚}+𝐚_{\mathrm{free}}(d_1,\mathrm{},d_m)`$ also belongs to $`C_m^{(k,l)}`$. We define

$$\kappa (\lambda ,\rho )=(M_{}^{(m)}\mathrm{}M_{}^{(1)})^t𝐛.$$
(3.6)
We have

###### Proposition 3.3.

The mappings $`\iota `$ and $`\kappa `$ are inverse to each other. They give bijections between $`C^{(k,l)}`$ and $`R^{(l)}`$.

###### Proof.

We have already shown the well-definedness of these mappings. Corollary 3.2 implies that they are inverse to each other. ∎

###### Proposition 3.4.

The energy and the length of a configuration $`𝐚`$ is given by the following formulas in terms of the corresponding rigged partition $`(\lambda ,\rho )=\iota (𝐚)`$.

$`E(𝐚)`$ $`=`$ $`E_0(\lambda )+E_1(\rho ),`$ (3.7)
where $`E_0(\lambda )={\displaystyle \underset{1i<j\mathrm{}(\lambda )}{}}A_{\lambda _i,\lambda _j},E_1(\rho )={\displaystyle \underset{1i\mathrm{}(\lambda )}{}}\rho _i,`$ (3.8)
$`|𝐚|`$ $`=`$ $`{\displaystyle \underset{1i\mathrm{}(\lambda )}{}}\lambda _i.`$ (3.9)
The proof is straightforward.

Let $`m_\alpha `$ be the number of parts $`\alpha `$ in $`\lambda `$, i.e., $`\lambda =(k^{m_k},(k1)^{m_{k1}},\mathrm{},1^{m_1})`$. Using the sequence $`m_i`$ $`(1ik)`$, we can write $`E_0(\lambda )`$ as

$$E_0(\lambda )=\frac{1}{2}(A𝐦,𝐦)\underset{1\alpha k}{}\frac{1}{2}A_{\alpha ,\alpha }m_\alpha .$$

The identity (1.6) follows from this once we establish the bijection between $`C_{\mathrm{pos}}^{(k,l)}`$ and $`R_{\mathrm{pos}}^{(l)}`$. For the proof of the bijection, the key fact is the following fact on the energy shift when a heavy particle passes a configuration containing only lighter particles.

Fix $`1l^{}<lk`$. Let $`𝐚`$ be a configuration in $`C^{(k,l^{})}`$. For a sufficiently large $`j_1`$ we define $`𝐚[j_1]C^{(k,l)}`$ by

$$(𝐚[j_1])_i=\{\begin{array}{cc}l\text{ if }i=j_1;\hfill & \\ a_i\text{ otherwise.}\hfill & \end{array}$$
(3.10)
If $`t`$ is sufficiently large, we can find a configuration $`𝐚^{}=(a_i^{})_{i𝐙}C^{(k)}`$ and integers $`j_2`$ and $`c`$ $`(1cl)`$ such that $`a_i^{}=0`$ for $`ij_2+1`$ and

$$(M_{}^t𝐚[j_1])_i=\{\begin{array}{cc}0\text{ if }i<j_2;\hfill & \\ c\text{ if }i=j_2;\hfill & \\ lc\text{ if }i=j_2+1;\hfill & \\ a_i^{}\text{ otherwise}.\hfill & \end{array}$$

The configuration $`𝐚^{}`$ is independent of the choice of $`(j_1,t)`$. We denote the mapping $`𝐚𝐚^{}`$ by $`P_l`$. We often drop $`l`$ when we fix it. The first statement is

###### Proposition 3.5.

In the above setting, we have

$$P_l:C^{(k,l^{})}C^{(k,l^{})}.$$

The second statement is how the particle content and the rigging change from $`𝐚`$ to $`𝐚^{}=P𝐚`$.

###### Proposition 3.6.

In the above setting, we set $`\iota (𝐚)=(\lambda ,\rho )`$ and $`\iota (𝐚^{})=(\mu ,\rho ^{})`$. Then we have

$`\mu =\lambda ,`$ (3.11)
$`\rho _i^{}=\rho _i+A_{l,\lambda _i}.`$ (3.12)
Let us repeat what we assert in these propositions. The left moves $`M_{}^t`$ push down the weight $`l`$ particle from the energy $`j_1l`$ to $`j_2c+(j_2+1)(lc)`$. Differently speaking, the weight $`l`$ particle passes the configuration $`𝐚C^{(k,l^{})}`$ and change it to $`𝐚^{}C^{(k,l^{})}`$. The particle content of the configuration $`𝐚`$ does not change. The energy shift of the $`j`$-th particle, which has the weight $`\lambda _j`$, is given by $`A_{l,\lambda _j}`$. The sum of these energy shifts is equal to the difference between the number of steps $`t`$ and the energy shift of the weight $`l`$ partcle:

$$(j_1j_21)l+ct=\underset{i=1}{\overset{\mathrm{}(\lambda )}{}}A_{l,\lambda _i}.$$

Proof of Propositions 3.5 and 3.6 for $`l=k`$ or $`l+l^{}k`$. The proof is easy because the change from $`𝐚`$ to $`𝐚^{}`$ is just a parallel shift of $`3`$ or $`2`$ columns, respectively. Without loss of generality, we assume that $`a_i=0`$ if $`i<1`$ or $`i>N`$. If $`l=k`$, the left moves of the configuration $`𝐚`$ proceed as follows.

$`\mathrm{},0,a_1,\mathrm{},a_{N2},a_{N1},a_N,0,0,k,0,0,\mathrm{}`$
$``$ $`\mathrm{},0,a_1,\mathrm{},a_{N2},a_{N1},a_N,0,ka_N,a_N,0,0,\mathrm{}`$
$``$ $`\mathrm{},0,a_1,\mathrm{},a_{N2},a_{N1},a_N,ka_Na_{N1},a_{N1},a_N,0,0,\mathrm{}`$
$``$ $`\mathrm{}`$
$``$ $`\mathrm{},0,a_1,a_2,ka_1a_2,a_1,a_2,\mathrm{}`$
$``$ $`\mathrm{},0,a_1,ka_1,0,a_1,a_2,\mathrm{}`$
$``$ $`\mathrm{},0,k,0,0,a_1,a_2,\mathrm{}`$
Note that $`A_{k,j}=3j`$ for all $`j`$, and this is consistent with the energy shift caused by the parallel shift of $`3`$ columns.

If $`l+l^{}2k`$, the left moves proceed as follows.

$`\mathrm{},0,a_1,\mathrm{},a_{N2},a_{N1},a_N,0,l,0,0,\mathrm{}`$ (3.13)
$``$ $`\mathrm{},0,a_1,\mathrm{},a_{N2},a_{N1},a_N,la_N,a_N,0,0,\mathrm{}`$
$``$ $`\mathrm{}`$
$``$ $`\mathrm{},0,a_1,la_1,a_1,a_2,\mathrm{},`$
$``$ $`\mathrm{},0,l,0,a_1,a_2,\mathrm{},`$
Note that $`A_{l,j}=2j`$ for all $`1jl^{}`$, and this is consistent with the energy shift caused by the parallel shift of $`2`$ columns. ∎

The proof for the case where $`1l^{}<l<k`$ requires a lengthy calculation. In the rest of this section, we prepare notations, and give the main steps of the proof. The case checking is given in Appendix.

The main idea is to trace how the weight $`l`$ particle moves from the right of the configuration $`𝐚C^{(k,l^{})}`$ to the left, and changes $`𝐚`$ to $`𝐚^{}=P𝐚`$. The totality of the configurations which interpolate between $`𝐚`$ and $`𝐚^{}`$ are of the form $`M_{}^j𝐚[j_1]`$ in the notation of (3.10). Here $`j_1`$ is sufficiently large, and $`j`$ can be an arbitrary non-negative integer. In fact, the configuration depends only on $`d=lj_1j`$. Let us denote it by $`𝐚^{(d)}`$. Formally speaking, we have $`𝐚^{(\mathrm{})}=𝐚`$ and $`𝐚^{(\mathrm{})}=𝐚^{}`$.

###### Definition 3.7.

For each $`d𝐙`$, we define the position of the weight $`l`$ particle in the configuration $`𝐚^{(d)}`$ to be the integer $`i=i(d,𝐚)`$ determined by the following condition:

the equality $`S[i,𝐚^{(d)}]=l`$ or $`L[i,𝐚^{(d)}]=k+l`$ holds,
but neither $`S[j,𝐚^{(d)}]=l`$ nor $`L[j,𝐚^{(d)}]=k+l`$ holds for $`j<i`$.
A configuration $`𝐚^{(d)}`$ is called a node at $`i`$ if

$$d=\mathrm{min}\{d^{};i(d^{},𝐚)=i\}.$$

A node at $`i`$ is denoted by $`S_i`$ if $`S[i,𝐚^{(d)}]=l`$ holds, and by $`L_i`$ if $`L[i,𝐚^{(d)}]=k+l`$. The history for $`𝐚𝐚^{}`$ is the sequence of the nodes among the configurations $`𝐚^{(d)}`$. Sometimes, we consider the history as a sequence of $`S_i`$ and $`L_i`$ forgetting their contents as configurations.

The following properties are clear by the definition.

The history contains $`S_i`$ if $`|i|`$ is sufficiently large. In general, $`S_i`$ and $`L_i`$ mix. A node can be $`S_i`$ and $`L_i`$ at the same time. It is also possible that neither $`S_i`$ nor $`L_i`$ is a node After a node $`S_i`$ the history proceeds to either $`S_{i1}`$ or $`L_{i1}`$. After a node $`L_i`$ (and when it is not $`S_i`$), the history proceeds to either $`S_{i1}`$, $`L_{i1}`$ or $`L_{i2}`$. Suppose $`𝐚^{(d_1)}`$ is a node at $`i`$, and $`𝐚^{(d_2)}`$ is the next node in the history. Then, for all $`ji,i+1`$, $`(𝐚^{(d)})_j`$ is constant for $`d_2dd_1`$. Moreover, for $`d_2+1dd_1`$

$$(𝐚^{(d1)})_i=(𝐚^{(d)})_i+1,(𝐚^{(d1)})_{i+1}=(𝐚^{(d)})_{i+1}1.$$

###### Example 3.8.

$`k=4,l=3,l^{}=2`$ Consider $`𝐚C^{(4,2)}`$ such that

$$a_i=\{\begin{array}{cc}1\text{ if }i=0,1,2;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$

We have $`\iota (𝐚)=(\lambda ,\rho )=((2,1),(1,0))`$. The history proceeds as

$`S_3`$ $`:`$ $`\mathrm{},0,1,1,1,0,3,0,\mathrm{}`$
$`L_2`$ $`:`$ $`\mathrm{},0,1,1,1,1,2,0,\mathrm{}`$
$`S_1`$ $`:`$ $`\mathrm{},0,1,1,2,0,2,0,\mathrm{}`$
$`S_0`$ $`:`$ $`\mathrm{},0,1,2,1,0,2,0,\mathrm{}`$
$`S_1`$ $`:`$ $`\mathrm{},0,3,0,1,0,2,0,\mathrm{}`$
We obtain $`𝐚^{}`$ such that $`\iota (𝐚^{})=(\mu ,\rho ^{})=((2,1),(6,2))`$. Observe that the energy shifts are given by $`A_{3,2}=5`$ and $`A_{3,1}=2`$.

The idea of the proof is to compare the history for the case of $`𝐚`$ with that of $`M_+𝐚`$. Suppose that $`𝐚C_m^{(k,l^{})}`$. If $`t`$ is sufficiently large, the highest weight $`l^{}`$ particle in $`M_+^t𝐚`$ is free, and the rest of the configuration belongs to either $`C_{m1}^{(k,l^{})}`$ or $`C^{(k,l^{}1)}`$. Therefore, we can reduce the problem to smaller $`m`$ or $`l^{}`$. Repeating this reduction, we can finally reduce the problem to the case when $`l+l^{}k`$, which we have already proved.

Let us prepare another notational point. In the history, for a fixed $`i`$, the value of $`𝐚_i^{(d)}`$ changes twice, in general, when the history proceeds. In the above example, the value at the column $`4`$ is $`0`$ before the history reaches the node $`S_3`$. At the node $`S_3`$, it changes to $`3`$, and at the node $`L_2`$, it further changes to $`2`$. After that the value is unchanged.

The initial value is $`a_i`$ and the final value is $`a_i^{}`$. We denote by $`a_i^{\prime \prime }`$ the intermediate value. If the node $`S_i`$ (or $`L_i`$) follows after $`S_{i+1}`$ or $`L_{i+1}`$, it is of the form

$$\mathrm{},a_{i1},a_i,a_{i+1}^{\prime \prime },a_{i+2}^{},$$

If $`L_i`$ follows after $`L_{i+2}`$, the values at the $`(i+2)`$-th and the $`(i+1)`$-th columns change only once. In this case, the node $`L_i`$ is of the form

$$\mathrm{},a_{i1},a_i,a_{i+1},a_{i+2}^{},\mathrm{}.$$

We give another example.

###### Example 3.9.

Let $`k=5`$, $`l=4`$ and $`l^{}=3`$. We consider $`𝐚`$ given by

$$a_i=\{\begin{array}{cc}1\text{ if }i=0,2,3;\hfill & \\ 2\text{ if }i=1;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$

We have $`\iota (𝐚)=(\lambda ,\rho )=((3,2),(2,1))`$. To see this we consider the right moves:

$`\mathrm{},0,1,2,1,1,0,\mathrm{}`$
$`\mathrm{},0,1,1,2,1,0,\mathrm{}`$
$`\mathrm{},0,1,1,0,3,0,\mathrm{}`$
Therefore, we have $`\lambda _1=3`$, $`\rho _1=dtA_{3,2}=934=2`$, and $`\lambda _2=2`$, $`\rho _2=1`$.

The history proceeds as

$`S_5`$ $`:`$ $`\mathrm{}0,1,2,1,1,0,0,4,0,\mathrm{}`$
$`S_4`$ $`:`$ $`\mathrm{}0,1,2,1,1,0,4,0,0,\mathrm{}`$
$`L_3`$ $`:`$ $`\mathrm{}0,1,2,1,1,2,2,0,0,\mathrm{}`$
$`L_1`$ $`:`$ $`\mathrm{}0,1,2,1,2,1,2,0,0,\mathrm{}`$
$`S_0`$ $`:`$ $`\mathrm{}0,1,3,0,2,1,2,0,0,\mathrm{}`$
$`S_1`$ $`:`$ $`\mathrm{}0,4,0,0,2,1,2,0,0,\mathrm{}.`$
Note that $`\iota (𝐚^{})=((3,2),(10,6))`$ From this, we observe that the energy shift of the weight $`3`$ particle is $`A_{4,3}=8`$, and that of the weight $`2`$ particle is $`A_{4,2}=5`$.

We start the proof of Propositions 3.5 and 3.6 for the case where $`1l^{}<l<k`$ and $`k<l+l^{}`$.

The proof of Proposition 3.5 is a case checking on each possible history for $`𝐚P𝐚`$.

Let us set up the cases to be checked. Without loss of generality, we can assume that

$$a_i=0\text{ for all }i0\text{ and }a_10.$$
(3.14)
In the below until we finish the proof of Proposition 3.5, we keep this assumption.

By the definition it is obvious that

$$\text{each node in the history belongs to }C_1^{(k,l)}.$$
(3.15)
Namely, the number of the weight $`l`$ particles is always $`1`$.

###### Lemma 3.10.

The history contains the nodes $`S_i`$ for all $`i1`$.

###### Proof.

First we prove that the history contains the node $`S_1`$. If not, the abbreviated history goes through $`L_1`$ or $`L_0L_2`$. The former implies $`2a_1+2a_2^{\prime \prime }+a_3^{}=k+l`$. (Here we consider the case $`L_1S_2`$ or $`L_1L_2`$. However, the proof goes similarly for $`L_1L_3`$.) Since we have $`a_1+a_2^{\prime \prime }+a_3^{}k`$, we have $`a_1+a_2^{\prime \prime }l`$. This implies $`S_1`$.

The latter implies $`2a_1+a_2^{}=k+l`$. Since $`a_1+a_2^{}l`$, we have $`a_1=k`$. This implies $`kl`$. This is a contradiction.

At $`S_1`$, the configuration is of the form

$$\mathrm{},0,a_1,la_1,\mathrm{}.$$

It is now obvious that the history contains $`S_i`$ for $`i0`$. ∎

###### Lemma 3.11.

The history does not contain the sequence of nodes $`L_1L_3`$. Therefore, it contains one of the following.

$$(\mathrm{i})S_2(\mathrm{ii})L_2S_3(\mathrm{iii})L_2L_3(\mathrm{iv})L_2L_4.$$

###### Proof.

By Lemma 3.10, the history must contain the node $`S_1`$. Therefore, if the history contains the sequence $`L_1L_3`$, it contains the sequence $`S_1L_3`$. By Lemma 2.6, this implies $`a_4^{}+a_5^{}=l`$ in addition to $`a_1+a_2=l`$. This is a contradiction to (3.15). ∎

We prove that if $`𝐚C^{(k,l^{})}`$ then $`𝐚^{}=P𝐚C^{(k,l^{})}`$ by induction. The induction goes on the length of $`𝐚`$. We prepare induction steps as lemmas. Note that we give the proof of the lemmas inside the big induction loop. Recall also that we assume (3.14).

###### Lemma 3.12.

In the setting as above, suppose that the history contains a node $`S_j`$ for some $`j2`$ $`(`$or $`L_j`$ for some $`j3)`$. Then, the configuration $`\overline{𝐚}^{}=(\overline{a}_i^{})_{i𝐙}`$ given by

$$\overline{a}_i^{}=\{\begin{array}{cc}a_i^{}\text{ if }ij+2;\hfill & \\ 0\text{ otherwise,}\hfill & \end{array}$$

belongs to $`C^{(k,l^{})}`$.

###### Proof.

At $`S_j`$ we have

$$S_j:\mathrm{},a_{j1},a_j,la_j,a_{j+2}^{},\mathrm{}.$$

Consider a configuration $`\overline{𝐚}C^{(k,l^{})}`$ given by

$$\overline{a}_i=\{\begin{array}{cc}a_i\text{ if }ij;\hfill & \\ 0\text{ otherwise.}\hfill & \end{array}$$

Since $`a_10`$, we have $`|\overline{𝐚}|<|𝐚|`$. Therefore, by induction hypothesis, we have $`P\overline{𝐚}C^{(k,l^{})}`$. The history for a weight $`l`$ particle passing $`\overline{𝐚}`$ from the right to the left, is obtained from that for $`𝐚`$ by cutting $`a_i`$ for $`ij1`$, before it proceeds beyond $`S_j`$, where we have

$$S_j:\mathrm{},0,a_j,la_j,a_{j+2}^{},\mathrm{}.$$

Therefore, $`P\overline{𝐚}`$ is obtained from $`P𝐚`$ by cutting $`a_i^{}`$ for $`ij+1`$. In other words, $`\overline{𝐚}^{}=P\overline{𝐚}`$. The statement follows from $`P\overline{𝐚}C^{(k,l^{})}`$.

The proof for the second statement is similar. We have

$$L_j:\mathrm{},a_{j1},a_j,a_{j+1}^{\prime \prime },a_{j+2}^{},\mathrm{}.$$

If the history goes as $`L_jL_{j+2}`$ we have $`a_{j+1}`$ in place of $`a_{j+1}^{\prime \prime }`$. We use the convention $`a_{j+1}^{\prime \prime }=a_{j+1}`$ in that case. We consider a configuration $`\overline{𝐚}C^{(k,l^{})}`$ given by

$$\overline{a}_i=\{\begin{array}{cc}a_i\text{ if }ij1;\hfill & \\ 0\text{ otherwise,}\hfill & \end{array}$$

and apply the induction hypothesis to this configuration. Until

$$L_j:\mathrm{},0,a_{j1},a_j,a_{j+1}^{\prime \prime },a_{j+2}^{},\mathrm{},$$

the history is the same. Since $`a_j+a_{j+1}^{\prime \prime }+a_{j+2}^{}k`$, we have $`a_{j1}+a_j+a_{j+1}^{\prime \prime }l`$. Therefore, the history proceeds to

$$S_{j1}:\mathrm{},0,a_{j1},la_{j1},a_{j1}+a_j+a_{j+1}^{\prime \prime }l,a_{j+2}^{},\mathrm{}.$$

As before, from this it follows that $`\overline{𝐚}^{}`$ belongs to $`C^{(k,l^{})}`$. ∎

Summarizing Lemmas 3.11 and 3.12, for the proof of Proposition 3.5 it is enough to show the following inequalities:

$`S[3,𝐚^{}]l^{}\text{ for (i–iv,)}`$ (3.16)
$`L[4,𝐚^{}]k+l^{}\text{ for (i–iv),}`$ (3.17)
$`S[4,𝐚^{}]l^{}\text{ for (ii-iv),}`$ (3.18)
$`L[5,𝐚^{}]k+l^{}\text{ for (ii-iv),}`$ (3.19)
$`S[5,𝐚^{}]l^{}\text{ for (iv),}`$ (3.20)
$`L[6,𝐚^{}]k+l^{}\text{ for (iv).}`$ (3.21)
The case (3.16) for (i) follows from Lemma 5.1. The case (3.17) for (i) follows from Lemma 5.2 The case (3.19) for (ii) follows from Lemma 5.2. The case (3.16) and (3.17) for (ii) follows from Lemma 5.4. The (3.18) for (ii) and (iii) follows from Lemma 5.3. The cases (3.16) and (3.17) for (iii) follows from Lemma 5.5. The case (3.19) for (iii) follows from Lemma 5.6. The rest follow from Lemma 5.7.

Proposition 3.5 is proved.

We show the commutativity of the mappings $`P_l`$ and $`M_+`$ on $`C^{(k,l^{})}`$. This is a key step in the proof of Proposition 3.6.

###### Proposition 3.13.

Suppose that $`𝐚C^{(k,l^{})}`$. Then, we have $`P_lM_+𝐚=M_+P_l𝐚`$.

This is obvious if $`l=k`$ or $`l+l^{}k`$ because, in these cases, as we have noted in the proof of Propositions 3.5 and 3.6, the mapping $`P_l`$ is a parallel shift. In the below, we assume that $`1l^{}<l<k`$ and $`k<l+l^{}`$.

We use induction in the proof of this proposition. We use the length $`|𝐚|`$ as an induction parameter. If $`|𝐚|=0`$ , the assertion is clear.

Before going into the details, let us describe the steps in the proof and prepare the setting. Without loss of generality, we assume that $`𝐚\underset{¯}{C}^{(k,l^{})}`$ and the highest position of the weight $`l^{}`$ particles in $`𝐚`$ is $`i=1`$, i.e.,

$$S[1,𝐚]=l^{}\text{ or }L[1,𝐚]=k+l^{},$$
(3.22)
and

$$\text{neither }S[i,𝐚]=l^{}\text{ nor }L[i,𝐚]=k+l^{}\text{ holds for }i>1.$$
(3.23)
In order to know about $`M_+P𝐚`$, we need to know the highest position $`i^{}`$ of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$. We show that $`i^{}=3,4`$ or $`5`$ depending only on the history for $`𝐚𝐚^{}`$. In order to know about $`PM_+𝐚`$, we compare $`(M_+𝐚)^{(d)}`$ with $`𝐚^{(d)}`$. The comparison is not very difficult because $`M_+𝐚`$ is obtained from $`𝐚`$ by changing $`(a_1,a_2)`$ to $`(a_11,a_2+1)`$. The main point is to know how the change of $`(a_1,a_2)`$ to $`(a_11,a_2+1)`$ makes a difference in $`(M_+𝐚)^{(d)}`$ compared with $`𝐚^{(d)}`$. Two configurations are the same except at the columns $`1`$ and $`2`$, before the node $`S_i`$ or $`L_i`$ with $`i4`$ appear in the history for $`𝐚𝐚^{}`$. This is because before that happens we have

$$(𝐚^{(d)})_j=a_j\text{ and }(M_+𝐚)_j^{(d)}=(M_+𝐚)_j\text{ for }j5,$$

and therefore, the difference at the columns $`1`$ and $`2`$ makes no difference between $`(M_+𝐚)^{(d)}`$ and $`𝐚^{(d)}`$ in the region $`i6`$.

In the proof, we will see also that after the node $`S_i`$ or $`L_i`$ with $`i0`$ appear in the history, $`(M_+𝐚^{(d)})_j=(𝐚^{(d)})_j`$ for $`j2`$. Namely, the difference at the columns $`1`$ and $`2`$ disappear. Therefore, the comparison is necessary only in the finite region of $`i`$. Possible histories (considered as sequences of $`S_i`$ or $`L_i`$) in this finite region is finite. We will check all these cases one by one.

###### Proposition 3.14.

We follow the above setting. Consider the history for $`𝐚𝐚^{}`$. It does not contain $`S_2`$ nor $`L_2L_3L_5`$.

We prove this proposition in Lemmas 5.85.13.

Since the history does not contain $`S_2`$, it contains $`L_2`$ or $`L_1L_3`$. Since $`L_2L_3L_5`$ is also out, we have the following cases.

(A) $`L_2S_3S_4`$ where $`L_3`$ is not a node,
(B) $`L_2S_3L_4`$ where $`L_3`$ is not a node,
(C) $`L_2L_3S_4`$,
(D) $`L_2L_3L_4`$,
(E) $`L_2L_4`$,
(F) $`L_1L_3`$,
where in all cases, $`S_2`$ is not a node.

###### Remark 3.15.

In Cases (E) and (F), the history does not contain $`S_2`$ by the definition. In other cases, we assume that $`S_2`$ is not contained.

Case (A).

The assumption that $`L_3`$ is not a node is equivalent to $`a_2+a_3<kl`$ because we have $`a_2+2a_3+2a_4^{\prime \prime }+a_5^{}<k+l`$ and $`a_3+a_4^{\prime \prime }=a_4^{\prime \prime }+a_5^{}=l`$.

###### Lemma 3.16.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2S_3S_4.$$

We also assume that $`L_3`$ is not contained. The history continues to either

$$S_1:\mathrm{},a_0,a_1,a_2^{\prime \prime },a_3^{},\mathrm{},$$

or

$$L_1:\mathrm{},a_0,a_1,a_2^{\prime \prime },a_3^{},\mathrm{},$$

or

$$L_0:\mathrm{},a_0,a_1,a_2^{},a_3^{},\mathrm{}.$$

For simplicity of notation let us denote $`a_2^{\prime \prime }=a_2^{}`$ in the last case.

In all cases, the history for $`M_+𝐚PM_+𝐚`$ contains the node

$$S_4:\mathrm{},a_11,a_2+1,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},$$

and it continues as

$`S_3`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3^{\prime \prime }1,a_4^{}+1,a_5^{},a_6^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},a_11,a_2^{\prime \prime }+1,a_3^{}1,a_4^{}+1,a_5^{},a_6^{},\mathrm{}.`$
The mapping $`M_{}`$ brings the last configuration to

$$\mathrm{},a_1,a_2^{\prime \prime },a_3^{}1,a_4^{}+1,a_5^{},a_6^{},\mathrm{},$$

and, after this, two histories are identical except for the difference at the third and fourth columns, i.e., $`(a_3^{},a_4^{})`$ or $`(a_3^{}1,a_4^{}+1)`$.

###### Proof.

Before $`S_4`$ two histories are the same. In particular, the last node before $`S_4`$ is $`S_5`$ or $`L_5`$. In both cases, the change takes place at the columns $`5`$ and $`6`$.

To see that $`S_4`$ appears as a node, it is enough to show that $`a_2+1+2a_3+2a_4+a_5^{\prime \prime }<k+l`$. If $`a_2+1+2a_3+2a_4+a_5^{\prime \prime }=k+l`$, since $`a_4+a_5^{\prime \prime }=l`$, we have $`a_2+2a_3+a_4=k1`$. By Lemma 5.9 we have $`a_2+a_3kl`$. Therefore, we have $`a_3+a_4l1l^{}`$. This is a contradiction.

Now, we assume that $`a_2+a_3<kl`$. To see that $`S_3`$ appears as a node, we must show that

$`a_2+1+2a_3+2a_4^{\prime \prime }+a_5^{}k+l,`$ (3.24)
$`a_11+2(a_2+1)+2a_3+a_4^{\prime \prime }<k+l.`$ (3.25)
Since $`L_3`$ is not contained in the history, we have (3.24). If $`a_11+2(a_2+1)+2a_3+a_4^{\prime \prime }=k+l`$, since $`a_4^{\prime \prime }+a_5^{}=l`$, by Lemma 2.6 we have $`a_1+a_2=l`$. This is a contradiction. We have shown (3.25).

To see that $`L_2`$ appears as a node, we need $`(a_11)+2(a_2+1)+2(a_3^{\prime \prime }1)+a_4^{}+1=k+l`$, $`(a_2+1)+(a_3^{\prime \prime }1)l`$ and $`a_0+2(a_11)+2(a_2+1)+a_3^{\prime \prime }1<k+l`$. These are obvious.

To see that $`S_1`$ appears as a node, first note that by Lemma 5.16 we have $`a_1+a_2^{\prime \prime }=l`$ or $`a_1+a_2^{}=l`$. We have also $`a_0+2(a_11)+2(a_2^{\prime \prime }+1)+a_3^{}1<k+l`$ and $`a_1+2a_0+2(a_11)+a_2+1<k+l`$. Thus we have the node $`S_1`$.

Finally, in one step, the columns $`(a_11,a_2^{\prime \prime }+1)`$ change to $`(a_1,a_2^{\prime \prime })`$, and two histories coincide after that except for the third and the fourth columns. ∎

###### Proposition 3.17.

We follow the setting as given by $`(\text{3.22})`$ and $`(\text{3.23})`$. Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2S_3S_4.$$

Suppose also that $`L_3`$ does not appear as a node. Then we have $`PM_+𝐚=M_+P𝐚`$. The highest position of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$ is at the column $`3`$.

###### Proof.

We define a configuration $`\stackrel{~}{𝐚}C^{(k,l^{}1)}`$ by a cut-off from $`𝐚`$:

$$\stackrel{~}{a}_i=\{\begin{array}{cc}a_i\text{ if }i2;\hfill & \\ 0\text{ otherwise,}\hfill & \end{array}$$

and consider the history corresponding to this configuration.

We have the node

$$L_2:\mathrm{},a_1,a_2,a_3^{\prime \prime },a_4^{},\mathrm{}.$$

Therefore, $`a_1+2a_2+2a_3^{\prime \prime }+a_4^{}=k+l`$, and since $`a_1+a_2+a_3^{\prime \prime }k`$ we have $`a_2+a_3^{\prime \prime }+a_4^{}l`$. The history for $`\stackrel{~}{𝐚}P\stackrel{~}{𝐚}`$ contains the node

$$S_3:\mathrm{},0,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{}.$$

Since $`P\stackrel{~}{𝐚}C^{(k,l^{}1)}`$, this implies that the configuration $`\stackrel{~}{𝐚}^{}`$ given by

$$\stackrel{~}{a}_i^{}=\{\begin{array}{cc}a_i^{}\text{ if }i5;\hfill & \\ 0\text{ otherwise},\hfill & \end{array}$$

belongs to $`C^{(k,l^{}1)}`$.

Now, we show that $`PM_+𝐚=M_+P𝐚`$. By Lemma 3.16 we know that $`PM_+𝐚`$ is obtained from $`P𝐚`$ by changing $`(a_3^{},a_4^{})`$ to $`(a_3^{}1,a_4^{}+1)`$. On the other hand, by Lemma 5.16 we have $`a_3^{}+a_4^{}=l^{}`$. Therefore, to prove $`PM_+𝐚=M_+P𝐚`$ it is enough to show that $`S[i,𝐚^{}]<l^{}`$ and $`L[i,𝐚^{}]<k+l^{}`$ for $`i4`$. The former for $`i5`$ and the latter for $`i6`$ follow from $`\stackrel{~}{𝐚}^{}C^{(k,l^{}1)}`$, and the rest follows from $`PM_+𝐚C^{(k,l^{})}`$. ∎

Case (B).

###### Lemma 3.18.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence $`L_2S_3L_4`$, but not $`L_3`$. The history for $`M_+𝐚PM_+𝐚`$ contains the node

$$L_4:\mathrm{},a_11,a_2+1,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{}.$$

If $`a_1+2a_2+2a_3+a_4^{\prime \prime }<k+l1`$, it continues as

$`S_3`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3^{\prime \prime }1,a_4^{}+1,a_5^{},a_6^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},a_11,a_2^{\prime \prime }+1,a_3^{}1,a_4^{}+1,a_5^{},a_6^{},\mathrm{}.`$
If $`a_1+2a_2+2a_3+a_4^{\prime \prime }=k+l1`$, we have $`a_3^{\prime \prime }=a_3+1`$ and $`a_4^{}=a_4^{\prime \prime }1`$, and the part of the history, $`L_2S_3`$, is replaced by only

$$L_2:\mathrm{},a_11,a_2+1,a_3^{\prime \prime }1,a_4^{}+1,a_5^{},a_6^{},\mathrm{}.$$

In both cases, the mapping $`M_{}`$ brings the configuration $`S_1`$ to

$$\mathrm{},a_1,a_2^{\prime \prime },a_3^{}1,a_4^{}+1,a_5^{},a_6^{},\mathrm{},$$

and, after this, two histories are identical except for the difference at the third and fourth columns, i.e., $`(a_3^{},a_4^{})`$ or $`(a_3^{}1,a_4^{}+1)`$.

###### Proof.

To see that $`L_4`$ is a node, we need to show $`a_2+1+2a_3+2a_4+a_5^{\prime \prime }<k+l`$. We have $`a_2+2a_3+2a_4+a_5^{\prime \prime }<k+l`$ because $`L_4`$ is a node in the history for $`𝐚𝐚^{}`$. Suppose that $`a_2+2a_3+2a_4+a_5^{\prime \prime }=k+l1`$. We have $`a_2+2a_3+2(a_4+1)+a_5^{\prime \prime }1=k+l`$. Since $`a_2+2a_3+2a_4^{\prime \prime }+a_5^{}k+l`$, we have $`a_4^{\prime \prime }=a_4+1`$. This is a contradiction because $`a_3+a_4=a_3+a_4^{\prime \prime }1=l1l^{}`$.

Now, we use that the history for $`𝐚𝐚^{}`$ has the node $`S_3`$ but not $`L_3`$. The only obstruction for the existence of the node $`S_3`$ in the history for $`M_+𝐚PM_+𝐚`$, is the value of $`a_11+2(a_2+1)+2a_3+a_4^{\prime \prime }=a_1+2a_2+2a_3+a_4^{\prime \prime }+1k+l`$. If $`a_1+2a_2+2a_3+a_4^{\prime \prime }<k+l1`$, we have $`a_11+2(a_2+1)+2a_3+a_4^{\prime \prime }<k+l`$. Therefore, the history for $`M_+𝐚PM_+𝐚`$ has the node $`S_3`$. After this node the argument is the same as in Lemma 3.16. If $`a_1+2a_2+2a_3+a_4^{\prime \prime }=k+l1`$, the history has the node

$$L_2:\mathrm{},a_11,a_2+1,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{}.$$

We have $`a_1+2a_2+2(a_3+1)+a_4^{\prime \prime }1=k+l`$ and $`a_1+2a_2+2a_3^{\prime \prime }+a_4^{}+1=k+l`$. Therefore, we have $`a_3^{\prime \prime }=a_3+1`$ and $`a_4^{}=a_4^{\prime \prime }1`$. The statement follows from this observation. ∎

###### Remark 3.19.

If $`a_1+2a_2+2a_3+a_4^{\prime \prime }=k+l1`$ in Lemma 3.18, the node $`L_2`$ can be also written as

$$\mathrm{},a_11,a_2+1,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{}.$$

In other words, we can think of the history as containing the sequence $`L_2S_3`$, where the number of steps from $`S_3`$ to $`L_2`$ is $`0`$. A similar statement holds in some of other cases below. We do not repeat the remark.

###### Proposition 3.20.

We follow the setting as given by $`(\text{3.22})`$ and $`(\text{3.23})`$. Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2S_3L_4.$$

We also assume that $`L_3`$ does not appear as a node. Then we have $`PM_+𝐚=M_+P𝐚`$. The highest position of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$ is at the column $`3`$.

###### Proof.

We use Lemmas 5.16 and 3.18. After the node $`S_3`$ the proof is the same as that of Proposition 3.17. ∎

Cases (C) and (D).

###### Lemma 3.21.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2L_3S_4(\text{or }L_4).$$

We assume that $`S_2`$ does not appear as a node. If the history continues as $`L_0L_2`$, we formally set $`a_2^{\prime \prime }=a_2^{}`$. If the history contains $`L_4L_6`$, we formally set $`a_5^{\prime \prime }=a_5`$.

If $`a_2+2a_3+2a_4+a_5^{\prime \prime }<k+l1`$, the history for $`M_+𝐚PM_+𝐚`$ contains the sequence

$`S_4\text{ or }L_4`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4^{\prime \prime }1,a_5^{}+1,a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3^{\prime \prime },a_4^{}1,a_5^{}+1,a_6^{},\mathrm{},`$
$`S_1\text{ or }L_1`$ $`:`$ $`\mathrm{},a_11,a_2^{\prime \prime }+1,a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{}.`$
If $`a_2+2a_3+2a_4+a_5^{\prime \prime }=k+l1`$, then we have $`a_4^{\prime \prime }1=a_4`$ and $`a_5^{}+1=a_5^{\prime \prime }`$, and the part of the history, $`L_3S_4(\text{or }L_4)`$, is replaced by only $`L_3`$.

In both cases, the mapping $`M_{}`$ brings the configuration $`S_1(\text{or }L_1)`$ to

$$\mathrm{},a_1,a_2^{\prime \prime },a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{},$$

and after this, two histories coincide except for the fourth and the fifth columns.

###### Proof.

Since the history for $`𝐚𝐚^{}`$ has the node $`S_4`$(or $`L_4`$), we have $`a_2+2a_3+2a_4+a_5^{\prime \prime }k+l1`$. If $`a_2+2a_3+2a_4+a_5^{\prime \prime }k+l2`$, i.e., $`(a_2+1)+2a_3+2a_4+a_5^{\prime \prime }<k+l`$, the history for $`M_+𝐚PM_+𝐚`$ also has $`S_4`$(or $`L_4`$) as a node, and, since $`(a_11)+2(a_2+1)+a_3+(a_4^{\prime \prime }1)<k+l`$, it proceeds to $`L_3`$. If $`a_2+2a_3+2a_4+a_5^{\prime \prime }=k+l1`$, we have $`a_2+2a_3+2(a_4+1)+(a_5^{\prime \prime }1)=k+l`$ and $`(a_2+1)+2a_3+2a_4+a_5^{\prime \prime }=k+l`$. It implies that $`a_4^{\prime \prime }=a_4+1`$ and $`a_5^{}=a_5^{\prime \prime }1`$, and the history contains $`L_3`$ without $`S_4`$(or $`L_4`$). In both cases, using the assumption that the history for $`𝐚𝐚^{}`$ contains $`L_2`$ but not $`S_2`$, we have $`a_0+2(a_11)+2(a_2+1)+a_3^{\prime \prime }<k+l`$ and $`(a_2+1)+a_3^{\prime \prime }l`$. Therefore, the history for $`M_+𝐚PM_+𝐚`$ proceeds to $`L_2`$.

Next, we show that it further proceeds to $`S_1`$(or $`L_1`$), i.e., it does not proceeds to

$$L_0:\mathrm{},a_1,a_0,a_11,a_2^{\prime \prime }+2,a_3^{}1,\mathrm{}.$$

There are three cases of the history for $`𝐚𝐚^{}`$: (i) $`S_1L_2`$, (ii) $`L_1L_2`$ and (iii) $`L_0L_2`$. The cases (i) and (ii) is straightforward. The case (iii) follows from Lemma 5.18.

The rest of proof is the same as Lemma 3.16. ∎

###### Proposition 3.22.

We follow the setting as given by $`(\text{3.22})`$ and $`(\text{3.23})`$. Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2L_3S_4(\text{or }L_4).$$

We also assume that $`S_2`$ does not appear as a node. Then we have $`PM_+𝐚=M_+P𝐚`$. The highest position of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$ is at the column $`4`$.

###### Proof.

Since we have Lemmas 5.19, 5.20 and 3.21, it is enough to repeat the argument in the proof of Proposition 3.17. ∎

Case (E).

###### Lemma 3.23.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence $`L_2L_4`$ We assume that $`S_2`$ does not appear as a node. If the history continues as $`L_0L_2`$, we formally set $`a_2^{\prime \prime }=a_2^{}`$. If the history contains $`L_4L_6`$, we formally set $`a_5^{\prime \prime }=a_5`$.

The history for $`M_+𝐚PM_+𝐚`$ contains the sequence

$`L_4`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_11,a_2+1,a_3,a_4^{}1,a_5^{}+1,a_6^{},\mathrm{},`$
$`S_1\text{ or }L_1`$ $`:`$ $`\mathrm{},a_11,a_2^{\prime \prime }+1,a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{}.`$
The mapping $`M_{}`$ brings the configuration $`S_1(\text{or }L_1)`$ to

$$\mathrm{},a_1,a_2^{\prime \prime },a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{},$$

and after this, two histories coincide except for the fourth and the fifth columns.

###### Proof.

We show that $`(a_2+1)+2a_3+2a_4+a_5^{\prime \prime }<k+l`$. If $`(a_2+1)+2a_3+2a_4+a_5^{\prime \prime }=k+l`$, we have $`a_2+2a_3+2(a_4+1)+(a_5^{\prime \prime }1)=k+l`$. This implies $`a_4^{}=a_4+1`$ and $`a_5^{}=a_5^{\prime \prime }1`$. Then, we have $`a_1+2a_2+2a_3+a_4=a_1+2a_2+2a_3+a_4^{}1=k+l1k+l^{}`$. This is a contradiction. This implies that the history for $`M_+𝐚PM_+𝐚`$ has $`L_4`$ as a node.

Setting formally $`a_3^{\prime \prime }=a_3`$ and $`a_4^{\prime \prime }=a_4^{}`$, we can repeat the rest of the proof of Lemma 3.21. ∎

###### Proposition 3.24.

We follow the setting as given by $`(\text{3.22})`$ and $`(\text{3.23})`$. Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_2L_4.$$

Then we have $`PM_+𝐚=M_+P𝐚`$. The highest position of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$ is at the column $`4`$.

###### Proof.

Since we have Lemmas 5.21 and 3.23, it is enough to repeat the argument in the proof of Proposition 3.17. ∎

Case (F).

###### Lemma 3.25.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_1L_3S_4(\text{or }L_4).$$

If the history contains $`L_4L_6`$, we formally set $`a_5^{\prime \prime }=a_5`$.

If $`a_2+2a_3+2a_4+a_5^{\prime \prime }<k+l1`$, the history for $`M_+𝐚PM_+𝐚`$ contains the sequence

$`S_4\text{ or }L_4`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3,a_4^{\prime \prime }1,a_5^{}+1,a_6^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{}.`$
If $`a_2+2a_3+2a_4+a_5^{\prime \prime }=k+l1`$, then we have $`a_4^{\prime \prime }1=a_4`$ and $`a_5^{}+1=a_5^{\prime \prime }`$, and the part of the history, $`L_3S_4(\text{or }L_4)`$, is replaced by only $`L_3`$.

In both cases, the mapping $`M_{}`$ brings the configuration $`L_1`$ to

$$\mathrm{},a_0,a_1,a_2,a_3^{},a_4^{}1,a_5^{}+1,a_6^{},\mathrm{},$$

and after this, two histories coincide except for the fourth and the fifth columns.

###### Proof.

The proof is the same as Lemma 3.21 until the history for $`M_+𝐚PM_+𝐚`$ reaches the node $`L_3`$. Now, to see that it proceeds to the node $`L_1`$, it is enough to show that $`a_2+a_3^{}<l`$. The proof for this statement is the same as Lemma 5.11 by setting $`a_3^{\prime \prime }=a_3^{}`$. After this node, the statement of the lemma is clear. ∎

###### Lemma 3.26.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_1L_3L_5.$$

If the history contains $`L_5L_7`$, we formally set $`a_6^{\prime \prime }=a_6`$.

The history for $`M_+𝐚PM_+𝐚`$ contains the sequence

$`L_5`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3,a_4,a_5,a_6^{\prime \prime },a_7^{},\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3,a_4,a_5^{}1,a_6^{}+1,a_7^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_11,a_2+1,a_3^{},a_4^{},a_5^{}1,a_6^{}+1,a_7^{},\mathrm{}.`$
The mapping $`M_{}`$ brings the configuration $`L_1`$ to

$$\mathrm{},a_0,a_1,a_2,a_3^{},a_4^{},a_5^{}1,a_6^{}+1,a_7^{},\mathrm{},$$

and after this, two histories coincide except for the fifth and the sixth columns.

The proof is straightforward.

###### Proposition 3.27.

We follow the setting as given by $`(\text{3.22})`$ and $`(\text{3.23})`$. Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$$L_1L_3.$$

Then we have $`PM_+𝐚=M_+P𝐚`$. If the history contains the sequence $`L_3S_4(\text{or }L_4)`$ $`(`$resp., $`L_3L_5)`$, the highest position of the weight $`l^{}`$ particles in $`𝐚^{}=P𝐚`$ is at the column $`4`$ $`(`$resp., $`5)`$.

###### Proof.

Since we have Lemmas 3.25 through 3.26, it is enough to repeat the argument in the proof of Proposition 3.17. ∎

By Propositions 3.17 through 3.27, we have finished the proof of Proposition 3.13.

Proof of Proposition 3.6. We use an induction on the number of the weight $`l^{}`$ particles of $`𝐚`$. We also use an induction on the position of the highest weight $`l^{}`$ particle: if the assertion is valid for $`M_+𝐚`$ then it is valid for $`𝐚`$ by Lemma 2.10 and Proposition 3.13. In Proposition 2.7 we have shown that the right moves on a configuration $`𝐚`$ separate a weight $`l^{}`$ particle at the highest position. Taking this separation large enough the mapping $`P`$ on $`M_+^t𝐚`$ can be separately given for the weight $`l^{}`$ free particle, and the rest, which has less weight $`l^{}`$ particles. Since the phase shift for a free particle is given by Proposition 2.8, the proof is over. ∎

Finally we prove

###### Theorem 3.28.

The mappings $`\iota `$ and $`\kappa `$ give the bijections between $`C_{\mathrm{pos}}^{(k,l)}`$ and $`R_{\mathrm{pos}}^{(l)}`$.

###### Proof.

We will show

$$\iota (C_{\mathrm{pos}}^{(k,l)})R_{\mathrm{pos}}^{(l)},$$
(3.26)
and

$$\kappa (R_{\mathrm{pos}}^{(l)})C_{\mathrm{pos}}^{(k,l)}.$$
(3.27)
Suppose that $`𝐚`$ and $`(\lambda ,\rho )`$ are mapped by the bijections $`\iota `$ and $`\kappa `$ to each other. The positivity for $`𝐚C_{\mathrm{pos}}^{(k,l)}`$ is that

$$a_j=0\text{ for all }j<0,$$
(3.28)
and the positivity for $`(\lambda ,\rho )R_{\mathrm{pos}}^{(l)}`$ is that

$$\rho _i0\text{ for all }1i\mathrm{}(\lambda ).$$
(3.29)
We use an induction on $`l`$ and the number of the weight $`l`$ particles, which we denote by $`m_l`$. Suppose that $`m_l>1`$ for $`𝐚C_{\mathrm{pos}}^{(k,l)}`$. The right move $`M_+`$ does not change the condition (3.28). We also have that $`\rho _i\rho _{i+1}`$ if $`\lambda _i=\lambda _{i+1}`$. Therefore, $`\iota (𝐚)R^{(l)_{\mathrm{pos}}}`$ follows by induction. Therefore, for the proof of (3.26), we can assume that $`m_l=1`$.

The mapping $`\kappa `$ is defined in (3.6). Note that (see Lemma 2.14)

$$(M_{}^{(m_l)})^s\mathrm{}(M_{}^{(1)})^s𝐚=(M_{}^{(m_l)}\mathrm{}M_{}^{(1)})^s𝐚.$$

Suppose that $`m_l>1`$. By the definition if the configuration $`(M_{}^{(1)})^s𝐚`$ is positively supported then $`(M_{}^{(m_l)}\mathrm{}M_{}^{(1)})^s𝐚`$ is also positively supported. Therefore, for the proof of (3.27), we can assume that $`m_l=1`$.

In the case $`m_l=1`$ the bijectivity follows from Proposition 3.6 by the following reason. It is enough to show the equivalence of the condition

$$a_i=\{\begin{array}{cc}0(i1);\hfill & \\ l\text{ if }i=0,\hfill & \end{array}$$

for $`𝐚`$ and the condition $`\rho _1=0`$ for $`(\lambda ,\rho )`$. Let $`\overline{𝐚}`$ and $`(\overline{\lambda },\overline{\rho })`$ be the configuration and the corresponding rigged partition obtained from $`𝐚`$ and $`(\lambda ,\rho )`$ by removing the weight $`l`$ particle to the far right. Since the energy shift when a weight $`l`$ particle passing the configuration $`\overline{𝐚}`$ is given by $`_{i2}A_{l,\lambda _i}`$, and this is exactly the difference of $`\rho _1`$ and $`s_1`$ in (2.13) and (3.5), the above equivalence follows. ∎

## 4. Polynomial characters

The purpose of this section is to derive fermionic character formulas for the set of configurations with initial and boundary conditions.

We consider the $`(k,3)`$-configurations. The initial conditions are specified by two integers $`a`$ and $`b`$ such that $`0a,bk`$: we set

$$C_{a,b}^{(k,l)}=\{𝐚C_{\mathrm{pos}}^{(k,l)};a_0=a,a_1=b\}.$$
(4.1)
The problem is to determine the image of this set by the mapping $`\iota `$. Note that (4.1) is empty unless $`a+bl`$.

For a sequence of non-negative integers $`𝐫=(r_1,\mathrm{},r_l)`$ we define a subset $`R^{(l)}(𝐫)`$ of $`R_{\mathrm{pos}}^{(l)}`$ as follows.

$$R^{(l)}(𝐫)=\{(\lambda ,\rho )R^{(l)};\rho _ir_{\lambda _i}\text{ for all }i\}.$$
(4.2)
Let $`J`$ be a subset of $`I=\{1,\mathrm{},l\}`$. We define

$$R^{(l)}(𝐫)_J=R^{(l)}(𝐫)\backslash R^{(l)}(𝐫(J)),$$

where

$$𝐫(J)_i=\{\begin{array}{cc}r_i+1\hfill & \text{if }iJ;\hfill \\ r_i\hfill & \text{otherwise}.\hfill \end{array}$$

In general, for a sequence of nonempty subsets $`J_mI`$ $`(1mn)`$, we set

$$R^{(l)}(𝐫)_{J_1,\mathrm{},J_n}=R^{(l)}(𝐫)\backslash \left(\underset{m=1}{\overset{n}{}}R^{(l)}(𝐫(J_m))\right).$$

We have

$$R^{(l)}(𝐫)=R^{(l)}(𝐫(J))R^{(l)}(𝐫)_J.$$

Suppose that $`J_1,J_2,J_3,\mathrm{},J_nI`$ are such that $`(J_1J_2)(_{m=3}^nJ_m)=\mathrm{}`$. The following equalities are clear by the definition.

$`R^{(l)}(𝐫)_J^{}=R^{(l)}(𝐫)_{J_1,J^{}}R^{(l)}(𝐫(J_1))_J^{},`$ (4.3)
$`R^{(l)}(𝐫)_{J_1J_2,J^{}}=R^{(l)}(𝐫)_{J_1,J^{}}R^{(l)}(𝐫(J_1))_{J_2,J^{}}\text{ if }J_1J_2=\mathrm{},`$ (4.4)
$`R^{(l)}(𝐫)_{J_1,J_2,J^{}}=R^{(l)}(𝐫)_{J_1J_2,J^{}}{\displaystyle R^{(l)}(𝐫(J_1J_2))_{J_1\backslash J_2,J_2\backslash J_1,J^{}}},`$ (4.5)
where we used $`J^{}`$ to mean $`J_3,\mathrm{},J_n`$ for notational simplicity. For example,

$$R^{(l)}(𝐫)_J^{}=R^{(l)}(𝐫)_{J_3,\mathrm{},J_n}.$$

If $`J_1J_2I`$, we have

$$R^{(l)}(𝐫)_{J_1,J_2}=R^{(l)}(𝐫)_{J_1}.$$
(4.6)
###### Theorem 4.1.

Let $`[a,b]_l`$ $`(0a,bl;a+bl)`$ be the image of $`C_{a,b}^{(k,l)}`$ by the mapping $`\iota `$. This is independent of $`k`$, and is given by

$$[a,b]_l=\{\begin{array}{cc}R^{(l)}(𝐫_{a,b})_{[a,a+b],[a+b,l]}\hfill & \text{if }a0,\hfill \\ R^{(l)}(𝐫_{a,b})_{[b,l]}\hfill & \text{if }a=0\text{ and }b0,\hfill \\ R^{(l)}(𝐫_{a,b})\hfill & \text{if }a=0\text{ and }b=0,\hfill \end{array}$$
(4.7)
where

$$𝐫_{a,b}=(\underset{a}{\underset{}{0,\mathrm{},0}},\underset{b}{\underset{}{1,\mathrm{},b}},\underset{lab}{\underset{}{b+2,\mathrm{},2l2ab}}),$$

and $`[l_1,l_2]=\{l_1,l_1+1\mathrm{},l_2\}`$ for $`1l_1l_2l`$.

For a subset $`R`$ of $`R^{(k)}`$ we denote by $`\chi (R)`$ its character

$$\chi (R)=\underset{(\lambda ,\rho )R}{}q^{d(\lambda ,\rho )},$$

where $`d(\lambda ,\rho )`$ is given by (1.5).

###### Corollary 4.2.

We have the following identities for the characters.

$`\chi ([a,b]_l)=`$ $`\chi (R^{(l)}(\underset{a}{\underset{}{0,\mathrm{},0}},\underset{b}{\underset{}{1,\mathrm{},b}},\underset{lab}{\underset{}{b+2,\mathrm{},2l2ab}}))`$ (4.8)
$`\chi (R^{(l)}(\underset{a1}{\underset{}{0,\mathrm{},0}},1,\underset{b}{\underset{}{2,\mathrm{},b+1}},\underset{lab}{\underset{}{b+2,\mathrm{},2l2ab}}))`$
$`\chi (R^{(l)}(\underset{a}{\underset{}{0,\mathrm{},0}},\underset{b1}{\underset{}{1,\mathrm{},b1}},b+1,\underset{lab}{\underset{}{b+3,\mathrm{},2l2ab+1}}))`$
$`+\chi (R^{(l)}(\underset{a1}{\underset{}{0,\mathrm{},0}},1,\underset{b1}{\underset{}{2,\mathrm{},b}},b+1,\underset{lab}{\underset{}{b+3,\mathrm{},2l2ab+1}})),`$
where terms with $`\underset{1}{\underset{}{}}`$ is understood as $`0`$. The second and the last term cancels each other if $`a+b=l`$ except for $`a=l`$.

We prove this theorem by induction on $`l`$. In the following we abbreviate $`R^{(l)}(𝐫)`$ to $`(𝐫)`$. For $`l=1`$, the statement of the theorem is that

$$[0,0]_1=(2),[0,1]_1=(1)\backslash (2),[1,0]_1=(0)\backslash (1).$$

This is obvious because for $`𝐚C^{(k,1)}`$ the lowest position of the (weight $`1`$) particles in $`𝐚`$ is equal to $`\rho _m`$ where $`\iota (𝐚)=((1^m),\rho )`$. This is the base of the induction.

Note also that the theorem implies that the first two elements in the configuration $`𝐚=(a_0,a_1,\mathrm{})C^{(k,l)}`$, i.e., $`a_0`$ and $`a_1`$, are uniquely determined by the set of integers $`\rho _{m_i}^{(i)}`$ $`(1il)`$, where we use the notation $`\lambda =(\underset{m_l}{\underset{}{l,\mathrm{},l}},\mathrm{},\underset{m_1}{\underset{}{1,\mathrm{},1}})`$ and $`\rho =(\rho _1^{(l)},\mathrm{},\rho _{m_l}^{(l)},\mathrm{},\rho _1^{(1)},\mathrm{},\rho _{m_1}^{(1)})`$ for $`𝐚C^{(k,l)}`$ with $`\iota (𝐚)=(\lambda ,\rho )`$, and we set formally $`\rho _0^{(i)}=\mathrm{}`$ when $`m_i=0`$. This statement is also obvious by the following reason. Since our construction of the bijections proceed inductively on $`l`$, it is enough to show this statement for $`i=l`$. By Proposition 2.11 the values $`\rho _j^{(l)}`$ for $`j<m_l`$ are uniquely determined by $`(a_2,a_3,\mathrm{})`$. Conversely, the position of the second lowest particles does not effect the values of $`a_0`$ and $`a_1`$.

By the definition the subsets $`[a,b]_l`$ are disjoint and the union is equal to $`R^{(l)}`$. Therefore, the subsets in the right hand side of (4.7) must enjoy the same property. This statement will be directly checked in the proof of the theorem. In the following we use the notation $`A+B`$ to mean the union of $`A`$ and $`B`$, and that $`A`$ and $`B`$ are disjoint.

The induction proceeds by the following recursion relation for the subsets $`[a,b]_l`$. We define operations of constructing a subset of $`R^{(l)}`$ out of a subset $`U`$ of $`R^{(l1)}`$. For $`(\lambda ,\rho )R^{(l)}`$ we set $`(\overline{\lambda },\overline{\rho })R^{(l1)}`$ by dropping the parts $`\lambda _i`$ (and $`\rho _i`$) such that $`\lambda _i=l`$. We set

$$Uc=\{(\lambda ,\rho )R^{(l)};(\overline{\lambda },\overline{\rho })U,\rho _{m_l}^{(l)}c\},U\underset{¯}{c}=(Uc)\backslash (U(c+1)).$$

###### Proposition 4.3.

The subsets $`[a,b]_l`$ are determined by the following recursion relations.

$$[a,b]_l=\{\begin{array}{cc}[a,b]_{l1}(2l2ab)+_{c=0}^{b1}\left([a,c]_{l1}\underset{¯}{(2l2ab)}\right)\hfill & \text{if }a+b<l;\hfill \\ _{c=0}^a_{d=0}^{lc1}\left([c,d]_{l1}\underset{¯}{(la)}\right)\hfill & \text{if }a+b=l.\hfill \end{array}$$
(4.9)
###### Proof.

We use the notation $`(\overline{\lambda },\overline{\rho })`$ as above. Set $`\overline{𝐚}=\kappa (\overline{\lambda },\overline{\rho })`$. Suppose that

$$\overline{𝐚}=(c,d,\mathrm{}).$$

As we have remarked, it is enough to consider the configurations where the number of weight $`l`$ particles is $`1`$. Consider the left moves of a configuration $`𝐛`$ obtained from $`\overline{𝐚}`$ by adding a weight $`l`$ particle at a sufficiently large energy. We know that in finite, say $`t`$, steps, the weight $`l`$ particle reaches the energy $`0`$. Namely, the configuration $`M_{}^{t_0}𝐛`$ is such that $`(l,0,\mathrm{})`$. The values of the rigging corresponding to this particle is $`0`$ by the definition. Let us consider how the configuration changes from $`(c,d,\mathrm{})`$ to $`(l,0,\mathrm{})`$. The change from $`M_{}^t𝐛`$ to $`M_{}^{t+1}𝐛`$ is such that $`+1`$ at a column, say the $`i`$-th column, and $`1`$ at the $`(i+1)`$-th column. We have $`i=0`$ if and only if $`(M_{}^t𝐛)_0+(M_{}^t𝐛)_1=l`$ since $`(M_{}^t𝐛)_1=0`$. Therefore, we have

$$((M_{}^t𝐛)_0,(M_{}^t𝐛)_1)=\{\begin{array}{cc}(c,d)\hfill & \text{if }tt_02l+2c+d;\hfill \\ (c,tt_0+2l2c)\hfill & \text{if }t_02l+2c+dtt_0l+c;\hfill \\ (l+tt_0,t_0t)\hfill & \text{if }t_0l+ct.\hfill \end{array}$$

Therefore, a configuration $`𝐚=(a,b,\mathrm{})`$ appears in this sequence if and only if

$$\{\begin{array}{cc}a=c\text{ and }bd\hfill & \text{for }a+b<l;\hfill \\ ac\hfill & \text{for }a+b=l.\hfill \end{array}$$

Counting the number of steps for $`(a,b,\mathrm{})`$ to reach $`(l,0,\mathrm{})`$, we obtain the value of the rigging. If $`a+b<l`$, the change of the first two columns is such that

$$(a,b)(a,b+1)\mathrm{}(a,la)(a+1,la1)\mathrm{}(l,0).$$

Namely, $`(a,b)`$ reaches $`(l,0)`$, where the rigging is $`0`$, by $`2l2ab`$ steps. This observation gives (4.9) in the case $`a+b<l`$. The case $`a+b=l`$ is similar. ∎

Proofs of Theorem 4.1. It is enough to show that the right hand side of (4.7) satisfies the recursion relation (4.9).

Case $`a+b<l`$. Recall that we abbreviate $`R^{(l)}(𝐫)`$ to $`(𝐫)`$. We first sum $`[a,0]_{l1}`$ with $`[a,1]_{l1}`$. By using (4.5), we decomposes $`[a,1]_{l1}`$.

$`(\underset{a}{\underset{}{0,\mathrm{},0}},1,3,\mathrm{},2l2a3)_{[a,a+1],[a+1,l1]}`$
$`=(\underset{a}{\underset{}{0,\mathrm{},0}},1,3,\mathrm{},2l2a3)_{[a+1,a+1]}+(\underset{a}{\underset{}{0,\mathrm{},0}},2,3,\mathrm{},2l2a3)_{[a,a],[a+2,l1]}.`$
(4.10)
By using (4.3), we sum the second term in the right hand side with $`[a,0]_{l1}`$.

$`(\underset{a}{\underset{}{0,\mathrm{},0}},2,4,\mathrm{},2l2a)_{[a,a]}+(\underset{a}{\underset{}{0,\mathrm{},0}},2,3,\mathrm{},2l2a3)_{[a,a],[a+2,l1]}`$
$`=(\underset{a}{\underset{}{0,\mathrm{},0}},2,3,\mathrm{},2l2a3)_{[a,a]}.`$
By using (4.4), we sum the first term in the right hand side of (4.10) with this.

$`(\underset{a}{\underset{}{0,\mathrm{},0}},1,3,\mathrm{},2l2a3)_{[a+1,a+1]}+(\underset{a}{\underset{}{0,\mathrm{},0}},2,3,\mathrm{},2l2a3)_{[a,a]}`$
$`=(\underset{a}{\underset{}{0,\mathrm{},0}},1,3,5,\mathrm{},2l2a3)_{[a,a+1]}.`$
Therefore, we obtain

$$[a,0]_{l1}+[a,1]_{l1}=(\underset{a}{\underset{}{0,\mathrm{},0}},1,3,5,\mathrm{},2l2a3)_{[a,a+1]}.$$

We repeat a similar summation until we obtain

$`[a,0]_{l1}\underset{¯}{(2l2ab)}+\mathrm{}+[a,b1]_{l1}\underset{¯}{(2l2ab)}`$
$`=(\underset{a}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},b1,b+1,b+3,\mathrm{},2l2ab1,2l2ab)_{[a,a+b1],[l,l]}.`$
(4.11)
Finally, we sum this result with

$`[a,b]_{l1}(2l2ab)`$
$`=(\underset{a}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},b1,b,b+2,\mathrm{},2l2ab)_{[a+b,a+b]}`$
$`+(\underset{a}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},b1,b+1,b+2,\mathrm{},2l2ab)_{[a,a+b1],[a+b+1,l1]}.`$ (4.12)
If $`a+b=l1`$, we must drop the second term from the right hand side of this identity. By using (4.4), we sum (4.11) with this second term and obtain

$$(\underset{a}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},b1,b+1,b+2,\mathrm{},2l2ab2,2l2ab)_{[a,a+b1],[a+b+1,l]}.$$

We sum this result with the first term in the right hand side of (4.12) and obtain $`[a,b]_l`$.

Case $`a+b=l`$. Similarly, if $`c>0`$, we have

$$\underset{d=0}{\overset{lc2}{}}[c,d]_{l1}=(\underset{c}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},l2c,lc)_{[c,l2]}.$$

By using (4.4), we sum this result with

$$[c,l1c]_{l1}=(\underset{c}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},l2c,l1c)_{[l1,l1]},$$

and obtain

$$(\underset{c}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},l2c,l1c)_{[c,l1]}.$$

By using (4.3), we first obtain

$$\underset{d=0}{\overset{l2}{}}[0,d]_{l1}=(1,2,\mathrm{},l1),$$

and then obtain

$$\underset{c=0}{\overset{a}{}}\underset{d=0}{\overset{lc1}{}}[c,d]_{l1}=(\underset{a}{\underset{}{0,\mathrm{},0}},1,2,\mathrm{},l1a).$$

We obtain (4.9) for $`a+b=l`$ from this. ∎

Now, we consider configurations zero at the boundary, i.e., above certain energy level. Set

$$C_{\mathrm{pos}}^{(k,l)}[N]=\{𝐚C_{\mathrm{pos}}^{(k,l)};a_i=0\text{ for all }i>N\}.$$
(4.13)
The following theorem describes the image of this finite set in $`R^{(l)}`$ by the bijection $`\iota `$.

###### Theorem 4.4.

A configuration $`𝐚`$ belongs to $`C_{\mathrm{pos}}^{(k,l)}[N]`$ if and only if the corresponding rigged partition $`(\lambda ,\rho )=\iota (𝐚)`$ satisfies

$$\rho _i\lambda _iN\underset{ji}{}A_{\lambda _i,\lambda _j}.$$
(4.14)
To prove this theorem, we prepare a few lemmas. Proofs are straightforward.

###### Lemma 4.5.

Suppose that $`𝐚C_{\mathrm{pos}}^{(k,l)}`$ and $`(\lambda ,\rho )=\iota (𝐚)`$. Let $`𝐛`$ be the configuration obtained from $`𝐚`$ by the parallel shift$`:`$ $`b_i=a_{i1}`$. Set $`(\lambda ^{},\rho ^{})=\iota (𝐛)`$. Then, we have

$$\lambda _i^{}=\lambda _i,\rho _i^{}=\rho _i+\lambda _i.$$

###### Lemma 4.6.

Let $`1l^{}<lk`$. Suppose $`𝐚C^{(k,l^{})}`$ is such that $`a_i=0`$ for all $`i<0`$. Then, we have $`P_l𝐚_i=0`$ for all $`i<2`$.

Proof of Theorem 4.4. Let $`\lambda =(\lambda _1,\mathrm{},\lambda _n)`$ and $`\rho =(\rho _1,\mathrm{},\rho _n)`$. We assume that $`\lambda _1=l`$. Suppose that $`𝐚C_m^{(k,l)}`$, i.e., $`\lambda _1=\mathrm{}=\lambda _m=l>\lambda _{m+1}`$, where $`1mn`$.

Proof of “only if” part. We use an induction on $`l`$. If $`l=0`$, there is nothing to prove. We assume that $`𝐚C_{\mathrm{pos}}^{(k,l)}[N]`$. First we show that $`\rho _1lN_{i=2}^nA_{l,\lambda _i}`$. For some $`t`$ the right move $`𝐚^{}=M_+^t𝐚`$ becomes

$$a_i^{}=\{\begin{array}{cc}0\hfill & \text{if }iN\text{ or }i<0;\hfill \\ l\hfill & \text{if }i=N.\hfill \end{array}$$

By the definition of the mapping $`\iota `$ we have

$$\rho _1=lNt\underset{i=2}{\overset{n}{}}A_{l,\lambda _i}.$$

Therefore, we have (4.14) for $`i=1`$. Since $`\lambda _i\lambda _1`$ for all $`2im`$, we have (4.14) for all $`2im`$.

Now, we will show (4.14) for $`m+1in`$. Recall the procedure of finding $`\lambda `$ and $`\rho `$. We bring all the weight $`l`$ particles in $`𝐚`$ to a free position by the right move $`(M_+^{(m)})^t\mathrm{}(M_+^{(1)})^t`$ for a sufficiently large $`t`$. The rest of the configuration $`𝐚^{\prime \prime }`$ is independent of $`t`$, and it is supported in the finite interval $`\{0,\mathrm{},N2m\}`$. By the definition

$$((\lambda _{m+1},\mathrm{},\lambda _n),(\rho _m+1,\mathrm{},\rho _n))=\iota (𝐚^{\prime \prime }).$$

Now, let the weight $`l`$ particles in $`(M_+^{(m)})^t\mathrm{}(M_+^{(1)})^t𝐚`$ pass the configuration $`𝐚^{\prime \prime }`$ from the right to the left one by one. The configuration $`𝐚^{\prime \prime }`$ belongs to $`C^{(k,l1)}`$. By Lemma 4.6, the resulting configuration is supported in the interval $`\{2m,\mathrm{},N\}`$. Using Proposition 3.6 and Lemma 4.5, and also the induction hypothesis, we obtain

$$\rho _i+mA_{l,\lambda _i}2m\lambda _i\lambda _i(N2m)\underset{\genfrac{}{}{0pt}{}{m+1jn}{ji}}{}A_{\lambda _i\lambda _i}.$$

This is nothing but (4.14) for $`m+1in`$.

Proof of “if” part. We use induction on $`l`$. Assume that

$$\rho _i\{\begin{array}{cc}lN(m1)A_{l,l}\underset{j=m+1}{\overset{n}{}}A_{l,\lambda _j}\hfill & \text{ if }im;\hfill \\ \lambda _iNmA_{\lambda _i,l}\underset{\genfrac{}{}{0pt}{}{m+1jn}{ji}}{}A_{\lambda _i,\lambda _j}\hfill & \text{ if }im+1.\hfill \end{array}$$
(4.15)
We move the weight $`l`$ particles to the far left. Denote by $`𝐚^{\prime \prime \prime }`$ the rest of the configuration. By Proposition 3.6, we see that the particle content of $`𝐚^{\prime \prime \prime }`$ is $`(\lambda _{m+1},\mathrm{},\lambda _n)`$, and the rigging is $`(\rho _{m+1}+mA_{\lambda _i,l},\mathrm{},\rho _n+mA_{\lambda _i,l})`$. The assumption (4.15) implies

$$\rho _i+mA_{\lambda _i,l}\lambda _iN\underset{\genfrac{}{}{0pt}{}{m+1jn}{ji}}{}A_{\lambda _i,\lambda _j}.$$

Therefore, by the induction hypothesis, we have

$$a_i^{\prime \prime \prime }=0\text{ for all }i>N.$$
(4.16)
Next, starting from the original configuration $`𝐚`$, we move the weight $`l`$ particle at the highest position to the far right, say to the energy, say $`d`$. Because of (4.16), in the process of reaching the level $`d`$, this particle must go through the energy $`lN`$. In other words, before this moment in the up-going process the whole configuration is supported in the region $`iN`$. After that, the further move breaks the support condition, and the weight $`l`$ particle reaches the energy $`d`$. By the definition of the rigging, in order to get back to $`𝐚`$, we must move this particle to the left by

$$d\rho _1(m1)A_{l,l}\underset{j=m+1}{\overset{n}{}}A_{l,\lambda _j}$$

steps. From (4.15), we see that the number of steps is greater than or equal to $`dlN`$. This implies the original configuration $`𝐚`$ belongs to $`C_{\mathrm{pos}}^{(k,l)}[N]`$. ∎

The polynomial identities (1.14) follow from Theorems 4.1 and 4.4. Set

$$C_{a,b}^{(k,l)}[N]=C_{\mathrm{pos}}^{(k,l)}[N]C_{a,b}^{(k,l)}.$$

###### Theorem 4.7.

Suppose that $`N0`$, $`1lk`$, $`0a,b`$ and $`a+bl`$. We have the following identities.

$$\underset{𝐚C_{a,b}^{(k,l)}[N]}{}q^{d(𝐚)}=\{\begin{array}{cc}\chi _{a,b}^{(k,l)}[N]\chi _{a1,b+2}^{(k,l)}[N]\chi _{a,b1}^{(k,l)}[N]+\chi _{a1,b+1}^{(k,l)}[N],\hfill & \text{if }b>0;\hfill \\ \chi _{a,0}^{(k,l)}[N]\chi _{a1,2}^{(k,l)}[N]\hfill & \text{if }b=0,\hfill \end{array}$$
(4.17)
where $`\chi _{a,b}^{(k,l)}[N]`$ is given by

$$\underset{m_1,\mathrm{},m_k=0}{\overset{\mathrm{}}{}}q^{Q(𝐦)+_{i=1}^kr_im_i}\underset{\genfrac{}{}{0pt}{}{1jk}{m_j0}}{}\left[\genfrac{}{}{0pt}{}{jN\underset{i=1}{\overset{k}{}}A_{j,i}m_i+A_{j,j}r_j+m_j}{m_j}\right]$$
(4.18)
with

$`Q(𝐦)`$ $`=`$ $`{\displaystyle \frac{1}{2}}(A𝐦,𝐦){\displaystyle \frac{1}{2}}{\displaystyle \underset{j=1}{\overset{k}{}}}A_{j,j}m_j,𝐦=(m_1,\mathrm{},m_k),`$
$`(r_1,\mathrm{},r_k)`$ $`=`$ $`(\underset{a}{\underset{}{0,\mathrm{},0}},\underset{b}{\underset{}{1,\mathrm{},b}},\underset{kab}{\underset{}{b+2,\mathrm{},2k2ab}}),`$
and the summation is restricted to $`m_{l+1}=\mathrm{}=m_k=0`$. We understand $`\chi _{a1,b+2}^{(k,l)}[N]=\chi _{a1,ka+1}^{(k,l)}[N]`$ if $`a+b=k`$, and $`\chi _{a,b}^{(k,l)}[N]=0`$ if $`a=1`$.

## 5. Appendix

The appendix contains Lemmas used in the proof of Propositions 3.5 and 3.6.

Fix $`1l^{}<lk`$. Recall Definition 2.1 of the set of configurations $`C^{(k,l^{})}`$. We consider an element $`𝐚`$ in $`C^{(k,l^{})}`$, and $`𝐚^{}=P𝐚C^{(k,l)}`$ (see Proposition 3.5).

In the below we use frequently the equality $`a_i+a_{i+1}^{\prime \prime }=a_i^{\prime \prime }+a_{i+1}^{}`$.

###### Lemma 5.1.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$`S_2`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3^{\prime \prime },a_4^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},\mathrm{}.`$
Then, we have $`a_3^{}+a_4^{}l^{}`$.

###### Proof.

We have $`a_1+2a_2+2a_3^{\prime \prime }+a_4^{}k+l`$. Since $`a_2+a_3^{\prime \prime }=l`$, we have $`a_1+a_4^{}kll^{}`$. Since $`a_1=a_3^{}`$ we have $`a_3^{}+a_4^{}l^{}`$. ∎

###### Lemma 5.2.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$$S_i:\mathrm{},a_{i1},a_i,a_{i+1}^{\prime \prime },a_{i+2}^{},a_{i+3}^{},a_{i+4}^{}\mathrm{}.$$

Then, we have $`a_{i+1}^{}+2a_{i+2}^{}+2a_{i+3}^{}+a_{i+4}^{}<k+l^{}`$.

###### Proof.

We have $`a_{i+1}+2a_{i+2}^{\prime \prime }+2a_{i+3}^{}+a_{i+4}^{}k+l`$. Since $`a_{i+1}+a_{i+2}^{\prime \prime }=a_{i+1}^{\prime \prime }+a_{i+2}^{}`$, $`a_i+a_{i+1}^{\prime \prime }=l`$ and $`a_{i+1}^{}<a_{i+1}^{\prime \prime }`$, we have $`a_{i+1}+(la_i)+a_{i+1}^{}+2a_{i+2}^{}+2a_{i+3}^{}+a_{i+4}^{}<k+l`$. Therefore, we have $`a_{i+1}^{}+2a_{i+2}^{}+2a_{i+3}^{}+a_{i+4}^{}<k+a_i+a_{i+1}k+l^{}`$. ∎

###### Lemma 5.3.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$$L_i:\mathrm{},a_{i1},a_i,a_{i+1}^{\prime \prime },a_{i+2}^{},a_{i+3}^{},\mathrm{}.$$

Then, we have $`a_{i+2}^{}+a_{i+3}^{}a_{i1}+a_i`$. If, in addition, the history contains

$$L_{i+1}:\mathrm{},a_{i1},a_i,a_{i+1},a_{i+2}^{\prime \prime },a_{i+3}^{},\mathrm{},$$

then we have $`a_{i+2}^{}+a_{i+3}^{}=a_{i1}+a_i`$.

###### Proof.

If $`L_i`$, we obtain $`a_{i1}+2a_i+2a_{i+1}^{\prime \prime }+a_{i+2}^{}=k+l`$ and $`a_i+2a_{i+1}^{\prime \prime }+2a_{i+2}^{}+a_{i+3}^{}k+l`$. Therefore, we obtain $`a_{i+2}^{}+a_{i+3}^{}a_{i1}+a_i`$. If $`L_i`$ and $`L_{i+1}`$, we have

$`a_i+2a_{i+1}+2a_{i+2}^{\prime \prime }+a_{i+3}^{}`$ $`=`$ $`k+l,`$
$`2(a_{i+1}^{\prime \prime }+a_{i+2}^{})`$ $`=`$ $`2(a_{i+1}+a_{i+2}^{\prime \prime }),`$
$`k+l`$ $`=`$ $`a_{i1}+2a_i+2a_{i+1}^{\prime \prime }+a_{i+2}^{}.`$
Summing up, we obtain $`a_{i+2}^{}+a_{i+3}^{}=a_{i1}+a_i`$. ∎

###### Lemma 5.4.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$`S_3`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},a_6^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},\mathrm{}.`$
Then, we have $`a_3^{}+a_4^{}a_1+a_2`$ and $`a_4^{}+2a_5^{}+a_6^{}<k`$.

###### Proof.

We have $`a_3^{}=a_2+a_3^{\prime \prime }a_2^{\prime \prime }=a_2+a_3^{\prime \prime }(la_1)`$ and $`a_4^{}la_3^{\prime \prime }`$. Therefore, we have $`a_3^{}+a_4^{}a_1+a_2`$.

We have

$`a_4^{}+2a_5^{}+a_6^{}+l`$ $`=`$ $`a_3+a_4^{\prime \prime }+a_4^{}+2a_5^{}+a_6^{}`$
$`<`$ $`a_3+2a_4^{\prime \prime }+2a_5^{}+a_6^{}`$
$``$ $`k+l.`$
Therefore, we have $`a_4^{}+2a_5^{}+a_6^{}<k`$. ∎

###### Lemma 5.5.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$`L_3`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},a_6^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},\mathrm{}.`$
Then, we have $`a_3^{}+a_4^{}a_1+a_2`$ and $`a_3^{}+2a_4^{}+2a_5^{}+a_6^{}k+l^{}`$.

###### Proof.

By Lemma 5.3 we obtain $`a_5^{}+a_6^{}a_2+a_3`$. Since the change from $`L_2`$ to $`S_1`$ is a multiple of $`(1,+1)`$ at the columns indexed with $`2`$ and $`3`$, we have $`a_2+a_3^{\prime \prime }=a_2^{\prime \prime }+a_3^{}`$. Also, $`S_1`$ implies $`a_1+a_2^{\prime \prime }=l`$. On the other hand, we have $`a_3^{\prime \prime }+a_4^{}l`$. Therefore, we have $`a_3^{}+a_4^{}a_2+a_3^{\prime \prime }(la_1)+la_3^{\prime \prime }=a_1+a_2`$, and also $`k+l=a_1+2a_2+2a_3^{\prime \prime }+a_4^{}=a_1+a_2^{\prime \prime }+a_3^{}+a_2+a_3^{\prime \prime }+a_4^{}=l+a_3^{}+a_2+a_3^{\prime \prime }+a_4^{}`$. Therefore, we have $`a_3^{}+a_4^{}+a_5^{}+a_6^{}ka_2a_3^{\prime \prime }+a_2+a_3`$. Using $`a_3^{\prime \prime }a_3`$ we have $`a_3^{}+a_4^{}+a_5^{}+a_6^{}k`$. By Lemma 5.3 we obtain $`a_4^{}+a_5^{}a_1+a_2l^{}`$, and the second assertion of the lemma follows. ∎

###### Lemma 5.6.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$`L_3`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},a_6^{},a_7^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},a_6^{},a_7^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},a_7^{},\mathrm{}.`$
Then, we have $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}k+l^{}`$.

###### Proof.

There are three cases: in addition, the history contains $`S_4`$, $`L_4`$ or $`L_5`$.

Case $`S_4`$. We have

$`2a_6^{}+a_7^{}`$ $``$ $`kl+a_4,`$
$`a_4^{}+a_5^{}`$ $``$ $`l^{},`$
$`a_5^{}`$ $`=`$ $`la_4^{\prime \prime }.`$
Summing up, we obtain $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}k+l^{}+a_4a_4^{\prime \prime }k+l^{}`$.

Case $`L_4`$. By Lemma 5.3, we obtain $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}a_1+2a_2+2a_3+a_4k+l^{}`$.

Case $`L_5`$. We have $`a_4^{\prime \prime }=a_4`$. Then, we have $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}=a_4+2a_5^{}+2a_6^{}+a_7^{}+a_4^{}a_4k+l+a_4^{}a_4`$. Since $`a_3+a_4=a_3^{\prime \prime }+a_4^{}`$, we have $`a_4^{}a_4=2a_3+a_42a_3^{\prime \prime }a_4^{}`$. Therefore, we obtain $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}k+l+(a_1+2a_2+2a_3+a_4)(a_1+2a_2+2a_3^{\prime \prime }+a_4^{})=a_1+2a_2+2a_3+a_4k+l^{}`$. ∎

###### Lemma 5.7.

Suppose that the history for $`𝐚𝐚^{}`$ contains

$`L_4`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },a_6^{},a_7^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},0,a_1,a_2,a_3,a_4^{},a_5^{},a_6^{},a_7^{},\mathrm{},`$
$`S_1`$ $`:`$ $`\mathrm{},0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},a_7^{},\mathrm{}.`$
Then, we have $`(\text{3.16}`$$`\text{3.21})`$.

###### Proof.

First, note that $`a_3^{}=a_2+a_3a_2^{\prime \prime }=a_1+a_2+a_3l`$. Therefore, we have $`a_3^{}+a_4^{}=a_3+a_4^{}+a_3^{}a_3l+a_1+a_2l=a_1+a_2l^{}`$. By Lemma 5.3, we obtain $`a_4^{}+a_5^{}a_1+a_2`$.

We have $`a_3+2a_4+2a_5^{\prime \prime }+a_6^{}=k+l`$. This implies

$$a_3+2a_4+a_5^{\prime \prime }k,$$
(5.1)
and also $`a_5^{}+a_6^{}=k+l(a_3+a_4+a_4^{}+a_5^{\prime \prime })=a_1+2a_2+2a_3+a_4+a_4^{}(a_3+2a_4+a_4^{}+a_5^{\prime \prime })k+l^{}(a_3+2a_4+a_5^{\prime \prime })`$. Using (5.1), we obtain $`a_5^{}+a_6^{}l^{}`$.

We have $`a_3^{}+2a_4^{}+2a_5^{}+a_6^{}=a_3+2a_4^{}+2a_5^{}+a_6^{}+a_3^{}a_3k+l+a_2(la_1)=k+a_1+a_2k+l^{}`$.

Note that $`a_5^{}a_5^{\prime \prime }=a_4a_4^{}=a_1+2a_2+2a_3+a_4(a_1+2a_2+2a_3+a_4^{})l^{}l`$. Using this, we have $`a_4^{}+2a_5^{}+2a_6^{}+a_7^{}a_4+2a_5^{\prime \prime }+2a_6^{}+a_7^{}+a_5^{}a_5^{\prime \prime }k+l^{}`$, and $`a_5^{}+2a_6^{}+2a_7^{}+a_8^{}=a_5^{\prime \prime }+2a_6^{}+2a_7^{}+a_8^{}+a_5^{}a_5^{\prime \prime }k+l^{}`$. ∎

###### Lemma 5.8.

If the history contains $`S_2`$, then we have $`a_0+2a_1+2a_2+a_3<k+l^{}`$.

###### Proof.

Note that $`a_2+a_3<l^{}`$ by (3.23). Then, we have $`a_0+2a_1+2a_2+a_3=a_0+2a_1+2a_2+a_3^{\prime \prime }+(a_2+a_3)(a_2+a_3^{\prime \prime })<k+l+l^{}l=k+l^{}`$. ∎

###### Lemma 5.9.

Suppose that the history contains

$`S_{i+1}`$ $`:`$ $`\mathrm{},a_{i1},a_i,a_{i+1},a_{i+2}^{\prime \prime },a_{i+3}^{},\mathrm{},`$
$`S_i`$ $`:`$ $`\mathrm{},a_{i1},a_i,a_{i+1}^{\prime \prime },a_{i+2}^{},a_{i+3}^{},\mathrm{}.`$
Then, we have $`a_{i1}+a_ikl`$.

###### Proof.

Note that $`a_{i+1}^{\prime \prime }=la_i`$ and $`a_{i+2}^{}=a_i`$. We have $`a_{i1}+2a_i+2(la_i)+a_ik+l`$, i.e., $`a_{i1}+a_ikl`$. ∎

###### Lemma 5.10.

The history does not contain $`S_2S_3`$:

$`S_3`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`S_2`$ $`:`$ $`\mathrm{},a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},\mathrm{}.`$
###### Proof.

By Lemma 5.8 we have $`a_0+2a_1+2a_2+a_3<k+l^{}`$. By Lemma 5.9 we have $`a_1+a_2kl<l^{}`$. This is a contradiction to (3.22). ∎

###### Lemma 5.11.

The history does not contain $`S_2L_3`$:

$`L_3`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`S_2`$ $`:`$ $`\mathrm{},a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},\mathrm{}.`$
###### Proof.

By Lemma 5.8 we have $`a_0+2a_1+2a_2+a_3<k+l^{}`$. Note that $`a_2+a_3<l^{}`$ and $`a_4^{\prime \prime }+a_5^{}l`$. We have $`a_1+a_2=a_1+2a_2+2a_3^{\prime \prime }+a_4^{}(a_2+a_3^{\prime \prime })(a_3^{\prime \prime }+a_4^{})k+ll(a_3+a_4^{\prime \prime })=a_2+2a_3+2a_4^{\prime \prime }+a_5^{}l(a_3+a_4^{\prime \prime })<l^{}+ll=l^{}`$. This is a contradiction to (3.22). ∎

###### Lemma 5.12.

Suppose that $`a_1+a_2=l^{}`$, then, the history does not contain $`L_3L_5`$:

$`L_5`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4,a_5,a_6^{\prime \prime },a_7^{}\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4,a_5^{},a_6^{},a_7^{}\mathrm{}.`$
###### Proof.

By (3.23) we have $`a_1+2a_2+2a_3+a_4=l^{}+a_2+2a_3+a_4<k+l^{}`$. Therefore, we have $`a_2+2a_3+a_4<k`$. Since $`a_2+2a_3+2a_4+a_5^{}=k+l`$, we have $`a_4+a_5^{}>l`$. This is a contradiction. ∎

###### Lemma 5.13.

The history does not contain $`L_2L_3L_5`$:

$`L_5`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4,a_5,a_6^{\prime \prime },a_7^{}\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_1,a_2,a_3,a_4,a_5^{},a_6^{},a_7^{}\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},a_6^{},a_7^{}\mathrm{}.`$
###### Proof.

By Lemma 5.12, if $`a_1+a_2=l^{}`$, then the history does not contain $`L_3L_5`$. Therefore, becauase of (3.22), we can assume that $`a_0+2a_1+2a_2+a_3=k+l^{}`$. Then, we have $`a_3^{\prime \prime }a_3=a_0+2a_1+2a_2+a_3^{\prime \prime }(a_0+2a_1+2a_2+a_3)ll^{}`$. On the other hand, since $`a_3+a_4=a_3^{\prime \prime }+a_4^{}`$ we have $`a_3^{\prime \prime }a_3=a_1+2a_2+2a_3^{\prime \prime }+a_4^{}(a_1+2a_2+2a_3+a_4)>ll^{}`$. This is a contradiction. ∎

###### Lemma 5.14.

If the history contains $`S_3`$, then we have $`a_1+a_2=l^{}`$.

###### Proof.

The condition $`S_3`$ implies $`a_3+a_4^{\prime \prime }=l`$ and $`a_1+2a_2+2a_3+a_4^{\prime \prime }<k+l`$. Therefore, we have $`a_1+2a_2+a_3<k`$, and hence $`a_0+2a_1+2a_2+a_3<k+l^{}`$. By (3.22) we have $`a_1+a_2=l^{}`$. ∎

###### Lemma 5.15.

If the history contains the nodes $`L_1`$ and $`L_4`$,

$`L_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},\mathrm{},`$
then we have $`L[4,𝐚^{}]=L[1,𝐚]`$.

###### Proof.

We have $`L[1,𝐚]L[4,𝐚^{}]=L[1,𝐚](a_0+2a_1+2a_2^{\prime \prime }+a_3^{})+a_3+2a_4+2a_5^{\prime \prime }+a_6^{}L[4,𝐚^{}]=2(a_2+a_3+a_4+a_5^{\prime \prime })2(a_2^{\prime \prime }+a_3^{}+a_4^{}+a_5^{})=0`$. The last equality follows from the observation that the moves between $`L_4`$ and $`L_1`$ are the move of $`1`$ inside the columns $`2`$ to $`5`$. ∎

###### Lemma 5.16.

Suppose that the history contains $`L_2S_3`$. It continues as $`S_1L_2`$ or $`L_1L_2`$ or $`L_0L_2`$. If $`L_1L_2`$ we have $`a_1+a_2^{\prime \prime }=l`$ at $`L_1`$. Similarly, if $`L_0L_2`$ we have $`a_1+a_2^{}=l`$ at $`L_0`$. In all cases, we have $`a_3^{}+a_4^{}=a_1+a_2=l^{}`$.

###### Proof.

By Lemma 5.14 we have $`a_1+a_2=l^{}`$.

Suppose that the history goes as

$`S_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},\mathrm{}.`$
We have $`a_1+2a_2+2a_3^{\prime \prime }+a_4^{}=k+l`$. Using $`a_1+a_2=l^{}`$ and $`a_3^{\prime \prime }+a_4^{}=l`$, we have $`a_2+a_3^{\prime \prime }=a_2^{\prime \prime }+a_3^{}=kl^{}`$. Therefore, we have $`a_1+a_2^{\prime \prime }=a_0+2a_1+2a_2^{\prime \prime }+a_3^{}(a_0+a_1)(a_2^{\prime \prime }+a_3^{})k+ll^{}(kl^{})=l`$. Therefore, we have $`a_1+a_2^{\prime \prime }=l`$.

Suppose that the history goes as

$`S_3`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3,a_4^{\prime \prime },\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},\mathrm{},`$
$`L_0`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2^{},a_3^{},a_4^{},\mathrm{},`$
and that $`a_1+a_2^{}<l`$. Since $`a_1+2a_0+2a_1+a_2^{}=k+l`$, we have $`a_1+2a_0+a_1>k`$. Since $`a_1+2a_0+2a_1+a_2k+l^{}`$, we have $`a_1+a_2<l^{}`$. This is a contradiction.

Now, we show that $`a_3^{}+a_4^{}=a_1+a_2`$ in all cases. Setting $`a_2^{\prime \prime }=a_2^{}`$ in the last case, we have $`a_2^{\prime \prime }=la_1`$ in all cases. Then, we have $`a_3^{}+a_4^{}=a_2+a_3^{\prime \prime }a_2^{\prime \prime }+a_3+a_4^{\prime \prime }a_3^{\prime \prime }=a_1+a_2`$. ∎

###### Lemma 5.17.

Suppose that the history contains $`L_2S_3S_4`$,

$`S_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`S_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},a_6^{},\mathrm{}.`$
Then, we have $`a_2+a_3kl`$. If $`a_2+a_3=kl`$, we have $`a_4^{}+a_5^{}=l^{}`$.

###### Proof.

By Lemma 5.14 we have $`a_1+a_2=l^{}`$. We have $`a_4^{}=a_3+a_4^{\prime \prime }a_3^{\prime \prime }=l(ka_12a_2)`$ and $`a_5^{}=a_4+a_5^{\prime \prime }a_4^{\prime \prime }=a_3`$. Therefore, we obtain $`a_4^{}+a_5^{}=lk+a_1+2a_2+a_3=lk+l^{}+a_2+a_3`$. Since $`a_4^{}+a_5^{}l^{}`$ we have $`a_2+a_3kl`$. Moreover, if $`a_2+a_3=kl`$, we have $`a_4^{}+a_5^{}=l^{}`$. ∎

###### Lemma 5.18.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`L_3`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},\mathrm{},`$
$`L_0`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2^{},a_3^{},a_4^{},a_5^{},\mathrm{}.`$
If $`a_1+a_2=l^{}`$, then we have $`a_1+a_2^{}=l`$. If $`a_0+2a_1+2a_2+a_3=k+l^{}`$, then we have $`a_0+2a_1+2a_2^{}+a_3^{}=k+l`$.

###### Proof.

Assume that $`a_1+a_2=l^{}`$. From $`a_1+2a_0+2a_1+a_2k+l^{}`$ we have $`a_1+2a_0+a_1k`$. Therefore, we obtain $`a_1+a_2^{}=k+l(a_1+2a_0+a_1)l`$, and $`a_1+a_2^{}=l`$.

Assume that $`a_0+2a_1+2a_2+a_3=k+l^{}`$. If $`a_0+2a_1+2a_2^{}+a_3^{}<k+l`$, we have $`k+l(k+l^{})>a_0+2a_1+2a_2^{}+a_3^{}(a_0+2a_1+2a_2+a_3)=a_2^{}a_2+a_3^{\prime \prime }a_3a_2^{}a_2`$. On the other hand, we have $`k+l(k+l^{})a_1+2a_0+2a_1+a_2^{}(a_1+2a_0+2a_1+a_2)=a_2^{}a_2`$. This is a contradiction. ∎

###### Lemma 5.19.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`S_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},\mathrm{}.`$
Then, we have $`S[4,𝐚^{}]=S[1,𝐚]=l^{}`$.

###### Proof.

By Lemma 5.3 we have $`a_4^{}+a_5^{}=a_1+a_2`$. Suppose that $`a_1+a_2<l^{}`$. Then, we have $`a_0+2a_1+2a_2+a_3=k+l^{}`$. There are three cases: (i) $`S_1L_2`$, (ii) $`L_1L_2`$ and (iii) $`L_0L_2`$.

We lead to a contradiction in all cases.We obtain the following equalities successively:

$`a_5^{\prime \prime }=la_4,`$
$`a_4^{\prime \prime }=ka_22a_3,a_5^{}=lk+a_2+2a_3,`$
$`a_3^{\prime \prime }=la_1a_2+a_3,a_4^{}=kl+a_12a_3.`$
Case (i). We have $`a_3^{}=a_2+a_3^{\prime \prime }a_2^{\prime \prime }=la_1+a_3(la_1)=a_3`$. Since $`a_0+2a_1+2a_2^{\prime \prime }+a_3^{}k+l`$, we have $`a_0+a_3=a_0+a_3^{}kl`$. This implies $`2(a_1+a_2)=k+l^{}(a_0+a_3)l+l^{}`$, which is a contradiction.

Case (ii). We have $`a_2^{\prime \prime }=k+la_02a_1(a_2+a_3^{\prime \prime })=ka_0a_1a_3`$. This implies $`0a_2^{\prime \prime }a_2=ka_0a_1a_2a_3=k(k+l^{})+a_1+a_2=a_1+a_2l^{}`$, which is a contradiction.

Case (iii). We formally set $`a_2^{\prime \prime }=a_2^{}`$. Then, by Lemma 5.18, we have $`a_0+2a_1+2a_2^{\prime \prime }+a_3^{}=k+l`$. We can follow the proof for Case (ii). ∎

###### Lemma 5.20.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`L_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{\prime \prime },a_4^{},a_5^{},\mathrm{}.`$
Then, we have $`S[4,𝐚^{}]=S[1,𝐚]=l^{}`$ or $`L[4,𝐚^{}]=k+l^{}`$.

###### Proof.

The proof goes exactly the same as Lemma 5.19 for the first paragraph. Then, we continue as follows.

Case (i). We have $`ll^{}a_0+2a_1+2a_2^{\prime \prime }+a_3^{}(a_0+2a_1+2a_2+a_3)=a_2^{\prime \prime }a_2+a_3^{\prime \prime }a_3a_1+a_2^{\prime \prime }(a_1+a_2)>ll^{}`$. This is a contradiction.

Case (ii). By Lemma 5.15, we have $`L[4,𝐚^{}]=L[1,𝐚]=k+l^{}`$. ∎

###### Lemma 5.21.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence $`L_2L_4`$. Then, we have $`L[4,𝐚^{}]=k+l^{}`$.

###### Proof.

We set $`a_5^{\prime \prime }=a_5`$ if the history contains $`L_4L_6`$. There are three cases: (i) $`S_1L_2`$, (ii) $`L_1L_2`$ and (iii) $`L_0L_2`$. Setting $`a_2^{\prime \prime }=a_2^{}`$ in (iii), we have the sequence

$`L_4`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },a_6^{},\mathrm{},`$
$`L_2`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2,a_3,a_4^{},a_5^{},a_6^{},\mathrm{},`$
$`S_1\text{ or }L_1\text{ or }L_0`$ $`:`$ $`\mathrm{},a_1,a_0,a_1,a_2^{\prime \prime },a_3^{},a_4^{},a_5^{},a_6^{},\mathrm{}.`$
Case (i). We have $`a_3^{}=a_2+a_3(la_1)`$. Therefore, we have $`L[4,𝐚^{}]=a_1+a_2+a_3l+2a_4+2a_5^{\prime \prime }+a_6^{}=a_1+a_2+k`$. If $`a_1+a_2=l^{}`$ we have $`L[4,𝐚^{}]=k+l^{}`$.

Suppose that $`a_1+a_2<l^{}`$. We have $`L[1,𝐚]=k+l^{}`$, and, therefore, $`ll^{}a_0+2a_1+2a_2^{\prime \prime }+a_3^{}(a_0+2a_1+2a_2+a_3)=a_2^{\prime \prime }a_2+a_3^{\prime \prime }a_3a_2^{\prime \prime }a_2=a_1+a_2^{\prime \prime }(a_1+a_2)>ll^{}`$. This is a contradiction.

Case (ii). By Lemma 5.15 we have $`L[4,𝐚^{}]=L[1,𝐚]`$. Therefore, if $`L[1,𝐚]=k+l^{}`$, we have $`L[4,𝐚^{}]=k+l^{}`$. If $`L[1,𝐚]<k+l^{}`$ we have $`a_1+a_2=l^{}`$. Therefore we have $`a_2^{\prime \prime }a_2=a_1+a_2^{\prime \prime }(a_1+a_2)ll^{}`$. Since $`a_2^{\prime \prime }+a_3^{}=a_2+a_3`$, we have $`a_2^{\prime \prime }a_2=a_0+2a_1+2a_2^{\prime \prime }+a_3^{}(a_0+2a_1+2a_2+a_3)>ll^{}`$. This is a contradiction.

Case (iii). We have $`a_2^{\prime \prime }=k+l(a_1+2a_0+2a_1)`$, and, therefore, $`a_3^{}=L[0,𝐚]+a_3(k+l)`$. This implies $`L[4,𝐚^{}]=L[0,𝐚]+a_3(k+l)+2a_4+2a_5^{\prime \prime }+a_6^{}=L[0,𝐚]`$. We will show that $`L[0,𝐚]=k+l^{}`$.

We have

$$a_2^{\prime \prime }a_2=a_1+2a_0+2a_1+a_2^{\prime \prime }(a_1+2a_0+2a_1+a_2)ll^{}.$$
(5.2)
If $`L[1,𝐚]=k+l^{}`$, we have $`a_2^{\prime \prime }a_2=a_0+2a_1+2a_2^{\prime \prime }+a_3^{}(a_0+2a_1+2a_2+a_3)ll^{}`$. Otherwise, we have $`S[1,𝐚]=l^{}`$ and $`a_2^{\prime \prime }a_2=a_1+a_2^{\prime \prime }(a_1+a_2)ll^{}`$. Therefore, in both cases, we have the equality at the end of (5.2), and, in particular, we have $`L[0,𝐚]=k+l^{}`$. ∎

###### Lemma 5.22.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`S_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{},a_4^{},a_5^{},\mathrm{}.`$
Then, we have $`S[4,𝐚^{}]=L[1,𝐚]k=l^{}`$.

###### Proof.

We have the following equalities.

$`a_3^{}=k+l(a_0+2a_1+2a_2),`$
$`a_4^{\prime \prime }=ka_22a_3,`$
$`a_4^{}=a_0+2a_1+a_2a_3l,`$
$`a_5^{}=lk+a_2+2a_3.`$
Therefore, we have $`S[4,𝐚^{}]=L[1,𝐚]k`$.

If $`L[1,𝐚]=k+l^{}`$, the proof is over. Otherwise, we have $`a_1+a_2=l^{}`$. Then, we have $`k+la_1+2a_2+2a_3^{}+a_4^{}=2k+l(a_0+a_1+a_2+a_3)`$. therefore, we have $`L[1,𝐚]k+l^{}`$. This is a contradiction. ∎

###### Lemma 5.23.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`L_4`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{\prime \prime },\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4^{\prime \prime },a_5^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{},a_4^{},a_5^{},\mathrm{}.`$
Then, we have $`L[4,𝐚^{}]=L[1,𝐚]=k+l^{}`$ or $`S[4,𝐚^{}]=S[1,𝐚]=l^{}`$.

###### Proof.

By Lemma 5.15 we have $`L[4,𝐚^{}]=L[1,𝐚]`$. If $`L[1,𝐚]=k+l^{}`$, the proof is over. Otherwise, we have $`a_1+a_2=l^{}`$. Then, we have $`k+l(a_1+a_2)+a_2+2a_3^{}+a_4^{}=l^{}+k+l(a_4^{}+a_5^{})`$. Therefore, we have $`a_4^{}+a_5^{}l^{}`$. This implies $`S[4,𝐚^{}]=l^{}`$. ∎

###### Lemma 5.24.

Suppose that the history for $`𝐚𝐚^{}`$ contains the sequence

$`L_5`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5,a_6^{\prime \prime },a_7^{},\mathrm{},`$
$`L_3`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3,a_4,a_5^{},a_6^{},a_7^{},\mathrm{},`$
$`L_1`$ $`:`$ $`\mathrm{},a_0,a_1,a_2,a_3^{},a_4^{},a_5^{},a_6^{},a_7^{},\mathrm{}.`$
Then, we have $`L[5,𝐚^{}]=k+l^{}`$.

###### Proof.

By Lemma 5.12 we have $`L[1,𝐚]=k+l^{}`$. Therefore, we have $`a_3^{}a_3=a_0+2a_1+2a_2+a_3^{}L[1,𝐚]=ll^{}`$. Hence we have $`a_4^{}a_4=l^{}l`$. This implies $`L[5,𝐚^{}]=a_4+2a_5+2a_6^{\prime \prime }+a_7^{}+(a_4^{}a_4)=k+l+l^{}l=k+l^{}`$. ∎

Acknowledgments. B.F. is partially supported by the grants, CRDF RP1-2254, INTAS 00-55, RFBR 00-15-96579. M.J. is partially supported by the Grant-in-Aid for Scientific Research (B2) no.14340040, and T.M. is partially supported by the Grant-in-Aid for Scientific Research (A) no. 13304010, Japan Society for the Promotion of Science. E.M. is partially supported by NSF grant DMS-0140460.