text:
# Geometric Crystal and Tropical 𝑅 For 𝐷⁽¹⁾_𝑛

## 1. Introduction

In this paper we construct a geometric crystal for $`D_n^{(1)}`$ corresponding to the $`D_n^{(1)}`$-crystal in \[KKM\], and study the associated tropical $`R`$. Geometric crystal is a notion introduced by Berenstein and Kazhdan in \[BK\] as an algebro-geometric analogue of the crystal theory \[K1, K2\]. The latter is a theory of quantum groups at $`q=0`$, which involves combinatorial operations described by various piecewise linear functions. In the geometric setting in \[BK\], such a structure corresponds to birational maps described by subtraction-free functions.

Let us illustrate these features in the case of $`A_{n1}^{(1)}`$ based on the constructions in \[BK\] and \[KNY\]. Elements $`x`$ of the crystal $`B_l`$ for the $`l`$-symmetric tensor representation is specified by the coordinates $`x=(x_1,\mathrm{},x_n)_0^n`$ with $`x_1+\mathrm{}+x_n=l`$, where all the indices are considered to be in $`/n`$ \[KKM\]. The action of the Kashiwara operator $`\stackrel{~}{e}_i`$ up to 2-fold tensor product is given, unless they vanish, by

$`\stackrel{~}{e}_i^c(x)=(\mathrm{},x_{i1},x_i+c,x_{i+1}c,x_{i+2},\mathrm{}),`$
$`\stackrel{~}{e}_i^c(xy)=\stackrel{~}{e}_i^{c_1}(x)\stackrel{~}{e}_i^{c_2}(y),`$
$`c_1=\mathrm{max}(x_i+c,y_{i+1})\mathrm{max}(x_i,y_{i+1}),`$
$`c_2=\mathrm{max}(x_i,y_{i+1})\mathrm{max}(x_i,y_{i+1}c).`$
In the geometric crystal, one still has the coordinates $`x=(x_1,\mathrm{},x_n)`$ and the corresponding structure looks

$`e_i^c(x)=(\mathrm{},x_{i1},cx_i,c^1x_{i+1},x_{i+2},\mathrm{}),`$
$`e_i^c(x,y)=(e_i^{c_1}(x),e_i^{c_2}(y)),`$
$`c_1={\displaystyle \frac{cx_i+y_{i+1}}{x_i+y_{i+1}}},c_2={\displaystyle \frac{x_i+y_{i+1}}{x_i+c^1y_{i+1}}}.`$
We call it the geometric Kashiwara operator. Note that the latter $`c_1,c_2`$ contain no minus sign, i.e., they are subtraction-free. The former $`c_1,c_2`$ are piecewise linear and obtained from the latter by replacing $`+,\times ,/`$ with $`\mathrm{max},+,`$, respectively. The procedure, which we call ultradiscretization in this paper, is well defined since the two sides of $`p(q+r)=pq+pr`$ have the coincident image $`p+\mathrm{max}(q,r)=\mathrm{max}(p+q,p+r)`$. The geometric crystal $``$ is actually associated with the coherent family $`\{B_l\}_{l1}`$ \[KKM\] rather than the single crystal $`B_l`$.

To each $`x`$ we assign the $`n`$ by $`n`$ matrix

$$M(x,z)=(\underset{i=1}{\overset{n}{}}\frac{1}{x_i}E_{i,i}\underset{i=1}{\overset{n1}{}}E_{i+1,i}zE_{1,n})^1$$

containing a spectral parameter $`z`$. Then on the product $`M=M(x^{(1)},z)\mathrm{}M(x^{(L)},z)`$ corresponding to $`(x^{(1)},\mathrm{},x^{(L)})^{\times L}`$, one can realize the geometric Kashiwara operator as the multiplications of unipotent matrices:

$$G_i\left(\frac{c1}{z^{\delta _{i0}}\epsilon _i(M)}\right)MG_i\left(\frac{c^11}{z^{\delta _{i0}}\phi _i(M)}\right)=M(e_i^{c_1}(x^{(1)}),z)\mathrm{}M(e_i^{c_L}(x^{(L)}),z),$$

where $`G_i(a)=E+aE_{i,i+1}`$, $`(1in1)`$, $`G_0(a)=E+aE_{n,1}`$ and

$$\epsilon _i(M)=z^{\delta _{i0}}\frac{M_{i+1,i}}{M_{i,i}}|_{z=0},\phi _i(M)=z^{\delta _{i0}}\frac{M_{i+1,i}}{M_{i+1,i+1}}|_{z=0}.$$

The product $`(e_i^{c_1}(x^{(1)}),\mathrm{},e_i^{c_L}(x^{(L)}))^{\times L}`$ corresponds to the element $`\stackrel{~}{e}_i^c(x^{(1)}\mathrm{}x^{(L)})`$ in the tensor product crystal under the ultradiscretization mentioned above.

One of the axioms of the geometric crystal is the relation $`e_i^ce_j^{cd}e_i^d=e_j^de_i^{cd}e_j^c`$ in the case of $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$. The matrix realization reduces its proof to a simple manipulation on the matrices $`G_i`$’s.

In the crystal theory, the isomorphism of tensor products $`B_lB_kB_kB_l`$ is called the combinatorial $`R`$. It is the quantum $`R`$ matrix at $`q=0`$, and plays a fundamental role. To incorporate it into the geometric setting we consider the matrix equation $`M(x,z)M(y,z)=M(x^{}z)M(y^{},z)`$. Explicitly, it is a discrete Toda type equation $`x_iy_i=x_i^{}y_i^{}`$, $`\frac{1}{x_i}+\frac{1}{y_{i+1}}=\frac{1}{x_i^{}}+\frac{1}{y_{i+1}^{}}`$. Given $`x=(x_1,\mathrm{},x_n)`$, call $`\mathrm{}(x)=x_1\mathrm{}x_n`$ the level. It turns out that the equation with the level constraints $`\mathrm{}(x)=\mathrm{}(y^{}),\mathrm{}(y)=\mathrm{}(x^{})`$ characterizes the unique solution:

$`x_i^{}=y_i{\displaystyle \frac{P_i(x,y)}{P_{i1}(x,y)}},y_i^{}=x_i{\displaystyle \frac{P_{i1}(x,y)}{P_i(x,y)}},`$
$`P_i(x,y)={\displaystyle \underset{k=1}{\overset{n}{}}}{\displaystyle \underset{j=k}{\overset{n}{}}}x_{i+j}{\displaystyle \underset{j=1}{\overset{k}{}}}y_{i+j}.`$
We call the rational map $`(x,y)(x^{},y^{})`$ the tropical $`R`$, and simply denote by $`R`$. From the characterization one can derive the geometric analogues of most important properties of the combinatorial $`R`$, e.g., commutativity with geometric Kashiwara operators $`e_i^cR=Re_i^c`$, the inversion relation $`R(R(x,y))=(x,y)`$ showing $`R`$ is birational, the Yang-Baxter relation and so forth. Moreover the ultradiscretization of the tropical $`R`$ yields an explicit piecewise linear formula for the combinatorial $`R`$.

In this paper we show that all the features explained above along type $`A`$ persist also for $`D_n^{(1)}`$. What we do is to start from a new geometric crystal associated with the coherent family of $`D_n^{(1)}`$-crystals in \[KKM\], and develop an elementary approach based on explicit calculations. It is motivated by several recent works; geometrization of canonical bases \[BFZ, BK, L2\], tropical combinatorics and birational representations of affine Weyl groups \[Ki, KNY, NoY, Y\], integrable cellular automata associated to crystals \[HKT1, FOY, HKT2, HKOTY\], discrete soliton equations arising as their tropical evolution equation \[TTMS, HHIKTT, Y\], combinatorial $`R`$ in terms of the bumping algorithm \[HKOT1, HKOT2\], etc. We hope to report on applications of the present result to these issues in near future.

The paper is arranged as follows. In section 2 we begin with the definition and basic facts on geometric crystals following \[BK\]. The geometric $`D_n^{(1)}`$-crystal $``$ is presented, which is parametrized with the $`2n1`$ coordinates $`x=(x_1,\mathrm{},x_n,\overline{x}_{n1},\mathrm{},\overline{x}_1)`$. See section 4.5 for the precise correspondence to the coordinates in the crystal. In section 3 we introduce the $`2n`$ by $`2n`$ matrix $`M(x,z)`$ that realizes the geometric crystal $`^{\times L}`$. It is quadratic in $`z`$ in contrast with the essentially linear one for type $`A`$. At $`z=0`$ it admits a factorization (3.2) and belongs to the lower triangular Borel subgroup of $`D_n`$ as in Proposition 3.6, whereas at $`z=\mathrm{}(x)^1`$ it shrinks to the rank one matrix as in Proposition 3.4. A key in our approach is to make full use of such properties controlled by the spectral parameter of affine nature, which we have been unable to learn in \[BK\]. In section 4 we study the tropical $`R`$. From Theorem 3.13 its uniqueness is immediate, hence our main task is to assure the existence. We shall show that the explicit birational map $`(x,y)(x^{},y^{})`$ in Definition 4.9 is the answer. By the ultradiscretization we then derive a piecewise linear formula for the combinatorial $`R`$ and the associated energy function. Appendix A provides an alternative proof of the relation $`e_i^ce_j^{cd}e_i^d=e_j^de_i^{cd}e_j^c`$ on $`^{\times L}`$. Appendix B contains a proof of $`M(x,z)M(y,z)=M(x^{}z)M(y^{},z)`$ at $`z=0`$.

We remark that our terminology “tropical” in this paper follows the usage in \[Ki, NoY\], which is unfortunately the opposite of \[BK\]. The phrase “ultradiscretization” has been used in many papers inspired by \[TTMS\].

## Acknowledgements

The authors thank M. Noumi, S. Naito, and D. Sagaki for useful discussions. A.K. thanks Shi-shyr Roan for the hospitality at Academia Sinica, Taipei during “Workshop on Solvable Models and Quantum Integrable Systems” in November 2001, where a part of the work was presented. M.O. and Y.Y. are partially supported by Grant-in-Aid for Scientific Research from Ministry of Education, Culture, Sports, Science and Technology of Japan.

## 2. Geometric $`D_n^{(1)}`$-crystal

### 2.1. Geometric crystal

Let g be an affine Lie algebra of simply laced type, i.e., $`\text{g}=A_n^{(1)},D_n^{(1)}`$ or $`E_{6,7,8}^{(1)}`$. Let $`I=\{0,1,\mathrm{},n\}`$ be the index set of vertices of the Dynkin diagram of g. We denote by $`\{\alpha _iiI\}`$ (resp. $`\alpha _i^{}iI\}`$) the set of simple roots (resp. simple coroots). Note that $`\alpha _i^{},\alpha _j=0`$ or $`1`$.

Following \[BK\] we introduce a geometric crystal associated to g. Throughout this paper, variable means a real variable unless otherwise stated. Let $`x=(x_1,x_2,\mathrm{},x_N)`$ be an $`N`$-tuple of variables. For $`iI`$ let $`\epsilon _i(x),\phi _i(x)`$ be rational functions in $`x`$ and set

(2.1)
$$\gamma _i(x)=\phi _i(x)/\epsilon _i(x).$$

For $`iI`$ let $`\times ^N^N:(c,x)e_i^c(x)`$ be a rational mapping, namely, $`e_i^c(x)=(x_1^{},x_2^{},\mathrm{},x_N^{})`$ with each $`x_j^{}`$ ($`1jN`$) being a rational function in $`c`$ and $`x`$. In what follows we consider $`c`$ to be a parameter and $`e_i^c`$ to be a rational transformation on $`^N`$. We also abbreviate the symbol $``$ of composition. For instance we write $`e_i^{c_1}e_j^{c_2}`$ instead of $`e_i^{c_1}e_j^{c_2}`$.

###### Definition 2.1.

A geometric pre-crystal is a family $`=\{x,\epsilon _i,\phi _i,e_i^c\}`$ satisfying

* $`e_i^{c_1}e_i^{c_2}(x)=e_i^{c_1c_2}(x),e_i^1(x)=x`$,
* $`\epsilon _i(e_i^c(x))=c^1\epsilon _i(x),\phi _i(e_i^c(x))=c\phi _i(x)`$,
* $`\gamma _i(e_j^c(x))=c^{\alpha _i^{},\alpha _j}\gamma _i(x)`$.

###### Definition 2.2.

A geometric pre-crystal $``$ is called geometric crystal, if it further satisfies the following relations:

(2.2)
$$e_i^{c_1}e_j^{c_2}=e_j^{c_2}e_i^{c_1}$$

if $`\alpha _i^{},\alpha _j=0`$,

(2.3)
$$e_i^{c_1}e_j^{c_1c_2}e_i^{c_2}=e_j^{c_2}e_i^{c_1c_2}e_j^{c_1}$$

if $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$.

###### Remark 2.3.

The definition of the geometric pre-crystal is slightly different from the original one in \[BK\]. We adopt it in order to make the formulas parallel with those in crystals.

###### Remark 2.4.

As mentioned in \[BK\] Remarks after Lemma 2.1, (2.2)–(2.3) can be thought of as multiplicative analogues of the Verma relations in the universal enveloping algebra $`U(\text{g})`$. See also \[L1\] Proposition 39.3.7 for the version of the quantum enveloping algebra $`U_q(\text{g})`$. The relations in the cases of $`\alpha _i^{},\alpha _j\alpha _j^{},\alpha _i2`$ read as follows:

$$e_i^{c_1}e_j^{c_1^2c_2}e_i^{c_1c_2}e_j^{c_2}=e_j^{c_2}e_i^{c_1c_2}e_j^{c_1^2c_2}e_i^{c_1}$$

if $`\alpha _i^{},\alpha _j=1,\alpha _j^{},\alpha _i=2`$,

$$e_i^{c_1}e_j^{c_1^3c_2}e_i^{c_1^2c_2}e_j^{c_1^3c_2^2}e_i^{c_1c_2}e_j^{c_2}=e_j^{c_2}e_i^{c_1c_2}e_j^{c_1^3c_2^2}e_i^{c_1^2c_2}e_j^{c_1^3c_2}e_i^{c_1}$$

if $`\alpha _i^{},\alpha _j=1,\alpha _j^{},\alpha _i=3`$.

###### Proposition 2.5 (\[BK\]).

Let $``$ be a geometric crystal. Set $`s_i(x)=e_i^{\gamma _i(x)^1}(x)`$. Then $`s_i`$ ($`iI`$) generates a birational action of the Weyl group corresponding to g.

###### Proof.

By definition, $`s_i^2(x)=e_i^c^{}e_i^c(x)`$ with $`c=\gamma _i(x)^1,c^{}=\gamma _i(e_i^{\gamma _i(x)^1}(x))^1`$. From Definition 2.1 (iii), we have

$$c^{}=((\gamma _i(x)^1)^2\gamma _i(x))^1=\gamma _i(x).$$

Thus $`s_i^2(x)=x`$ by Definition 2.1 (i).

Similarly, if $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$, we have

$`s_is_js_i(x)=e_i^{c^{\prime \prime }}e_j^c^{}e_i^c(x),`$
$`s_js_is_j(x)=e_j^{d^{\prime \prime }}e_i^d^{}e_j^d(x),`$
with $`c=d^{\prime \prime }=\gamma _i(x)^1,c^{}=d^{}=\gamma _i(x)^1\gamma _j(x)^1,c^{\prime \prime }=d=\gamma _j(x)^1`$. Thus $`s_is_js_i(x)=s_js_is_j(x)`$ by Definition 2.2.

If $`\alpha _i^{},\alpha _j=0`$, one clearly has $`s_is_j(x)=s_js_i(x)`$. ∎

###### Remark 2.6.

This Weyl group action is an analogue of the one on crystals given in \[K2\].

###### Example 2.7.

Let $`\text{g}=A_n^{(1)},N=n+1,x=(x_1,x_2,\mathrm{},x_{n+1})`$. For $`iI=\{0,1,\mathrm{},n\}`$ we define

$`\epsilon _i(x)`$ $`=`$ $`x_{i+1},\phi _i(x)=x_i,`$
$`e_i^c(x)`$ $`=`$ $`(\mathrm{},cx_i,c^1x_{i+1},\mathrm{}).`$
Here $`x_0`$ should be understood as $`x_{n+1}`$. One can check that $`=\{x,\epsilon _i,\phi _i,e_i^c\}`$ is a geometric crystal. $`s_i(x)`$ is given by

$$s_i(x)=(\mathrm{},\stackrel{i}{x_{i+1}},\stackrel{i+1}{x_i},\mathrm{}).$$

### 2.2. Geometric $`D_n^{(1)}`$-crystal $``$

We are interested in a particular geometric crystal $``$ of type $`D_n^{(1)}`$ given below. Let $`N=2n1`$ and consider a set of variables $`x=(x_1,x_2,\mathrm{},x_n,\overline{x}_{n1},\mathrm{},\overline{x}_1)`$. $`\epsilon _i(x),\phi _i(x),e_i^c(x)`$ ($`iI=\{0,1,\mathrm{},n\}`$) are given as follows.

$`\epsilon _0(x)`$ $`=`$ $`x_1({\displaystyle \frac{x_2}{\overline{x}_2}}+1),\phi _0(x)=\overline{x}_1({\displaystyle \frac{\overline{x}_2}{x_2}}+1),`$
$`\epsilon _i(x)`$ $`=`$ $`\overline{x}_i({\displaystyle \frac{x_{i+1}}{\overline{x}_{i+1}}}+1),\phi _i(x)=x_i({\displaystyle \frac{\overline{x}_{i+1}}{x_{i+1}}}+1)(i=1,\mathrm{},n2),`$
$`\epsilon _{n1}(x)`$ $`=`$ $`x_n\overline{x}_{n1},\phi _{n1}(x)=x_{n1},`$
$`\epsilon _n(x)`$ $`=`$ $`\overline{x}_{n1},\phi _n(x)=x_{n1}x_n,`$
$`e_0^c(x)`$ $`=`$ $`(\xi _2^1x_1,c^1\xi _2x_2,\mathrm{},\xi _2\overline{x}_2,c\xi _2^1\overline{x}_1),`$
$`e_i^c(x)`$ $`=`$ $`(\mathrm{},c\xi _{i+1}^1x_i,c^1\xi _{i+1}x_{i+1},\mathrm{},\xi _{i+1}\overline{x}_{i+1},\xi _{i+1}^1\overline{x}_i,\mathrm{})(i=1,\mathrm{},n2),`$
$`e_{n1}^c(x)`$ $`=`$ $`(\mathrm{},cx_{n1},c^1x_n,\mathrm{}),`$
$`e_n^c(x)`$ $`=`$ $`(\mathrm{},cx_n,c^1\overline{x}_{n1},\mathrm{}),`$
where $`\xi _i={\displaystyle \frac{x_i+c\overline{x}_i}{x_i+\overline{x}_i}}(i=1,\mathrm{},n1).`$
We set

$$\mathrm{}(x)=x_1x_2\mathrm{}x_n\overline{x}_{n1}\overline{x}_{n2}\mathrm{}\overline{x}_1$$

and call it the level. Note that $`\mathrm{}(x)`$ is invariant under the transformation $`e_i^c`$ for any $`i`$ and $`c`$.

###### Remark 2.8.

This $``$ is obtained as a multiplicative analogue of the coherent family of perfect crystals $`\{B_l\}_{l1}`$ of type $`D_n^{(1)}`$ given in \[KKM\]. Of course, $`e_i^c(x)`$ corresponds to $`\stackrel{~}{e}_i^cb`$.

The functions $`\epsilon _i(x),\phi _i(x)`$ of our $``$ satisfy the following good properties, which will be used in the next section.

###### Lemma 2.9.

* If $`\alpha _i^{},\alpha _j=0`$, then

$$\epsilon _i(e_j^c(x))=\epsilon _i(x),\phi _i(e_j^c(x))=\phi _i(x).$$
* If $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$, then there exist rational functions $`\epsilon _{ij}(x),\epsilon _{ji}(x)`$ such that

$`\epsilon _i(x)\epsilon _j(x)=\epsilon _{ij}(x)+\epsilon _{ji}(x),`$
$`\epsilon _{ij}(e_i^c(x))=c^1\epsilon _{ij}(x),\epsilon _{ij}(e_j^c(x))=\epsilon _{ij}(x),`$
$`\epsilon _{ji}(e_i^c(x))=\epsilon _{ij}(x),\epsilon _{ji}(e_j^c(x))=c^1\epsilon _{ji}(x),`$
and $`\phi _{ij}(x),\phi _{ji}(x)`$ such that

$`\phi _i(x)\phi _j(x)=\phi _{ij}(x)+\phi _{ji}(x),`$
$`\phi _{ij}(e_i^c(x))=c\phi _{ij}(x),\phi _{ij}(e_j^c(x))=\phi _{ij}(x),`$
$`\phi _{ji}(e_i^c(x))=\phi _{ij}(x),\phi _{ji}(e_j^c(x))=c\phi _{ji}(x).`$

###### Remark 2.10.

Due to Definition 2.1 (iii) it suffices to check Lemma 2.9 only for $`\phi _i(x)`$ (or $`\epsilon _i(x)`$). The functions $`\epsilon _{ij}(x),\epsilon _{ji}(x)`$ in (b) are obtained as

$$\epsilon _{ij}(x)=\phi _{ji}(x)/(\gamma _i(x)\gamma _j(x)),\epsilon _{ji}(x)=\phi _{ij}(x)/(\gamma _i(x)\gamma _j(x)),$$

once $`\phi _{ij}(x),\phi _{ji}(x)`$ are obtained.

###### Proof of Lemma 2.9..

(a) is easy. For (b) it suffices to give a list of $`\phi _{ij}(x)`$ and $`\phi _{ji}(x)`$ when $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$.

$`\phi _{02}(x)=\overline{x}_1\overline{x}_2({\displaystyle \frac{\overline{x}_3}{x_3}}+1),\phi _{20}(x)=\overline{x}_1x_2({\displaystyle \frac{\overline{x}_3}{x_3}}+1),`$
$`\phi _{i,i+1}(x)=x_i\overline{x}_{i+1}({\displaystyle \frac{\overline{x}_{i+2}}{x_{i+2}}}+1),\phi _{i+1,i}(x)=x_ix_{i+1}({\displaystyle \frac{\overline{x}_{i+2}}{x_{i+2}}}+1)(1in3),`$
$`\phi _{n2,n1}(x)=x_{n2}\overline{x}_{n1},\phi _{n1,n2}(x)=x_{n2}x_{n1},`$
$`\phi _{n2,n}(x)=x_{n2}x_n\overline{x}_{n1},\phi _{n,n2}(x)=x_{n2}x_{n1}x_n.`$
### 2.3. Product

Let $`_1=\{x=(x_1,\mathrm{},x_{N_1}),\epsilon _i,\phi _i,e_i^c\},_2=\{y=(y_1,\mathrm{},y_{N_2}),`$ $`\epsilon _i,\phi _i,e_i^c\}`$ be geometric pre-crystals. For brevity we use the same symbols $`\epsilon _i,\phi _i,e_i^c`$ for different geometric pre-crystals, since they are distinguished by the sets of variables. Now consider the set of variables $`(x,y)=(x_1,\mathrm{},x_{N_1},y_1,\mathrm{},y_{N_2})`$. We define a new structure of a geometric pre-crystal $`_1\times _2`$ on $`(x,y)`$ by

(2.4) $`\epsilon _i(x,y)`$ $`=`$ $`\epsilon _i(x)+\epsilon _i(x)\epsilon _i(y)/\phi _i(x),`$
(2.5) $`\phi _i(x,y)`$ $`=`$ $`\phi _i(y)+\phi _i(x)\phi _i(y)/\epsilon _i(y),`$
(2.6) $`e_i^c(x,y)`$ $`=`$ $`(e_i^{c_1}(x),e_i^{c_2}(y)),`$
(2.7) where $`c_1={\displaystyle \frac{c\phi _i(x)+\epsilon _i(y)}{\phi _i(x)+\epsilon _i(y)}},c_2={\displaystyle \frac{\phi _i(x)+\epsilon _i(y)}{\phi _i(x)+c^1\epsilon _i(y)}}.`$
###### Remark 2.11.

These are analogues of formulas for the tensor product of crystals \[K1\] given by

(2.8) $`\epsilon _i(xy)`$ $`=`$ $`\mathrm{max}(\epsilon _i(x),\epsilon _i(x)+\epsilon _i(y)\phi _i(x)),`$
(2.9) $`\phi _i(xy)`$ $`=`$ $`\mathrm{max}(\phi _i(y),\phi _i(x)+\phi _i(y)\epsilon _i(y)),`$
(2.10) $`\stackrel{~}{e}_i^c(xy)`$ $`=`$ $`\stackrel{~}{e}_i^{c_1}(x)\stackrel{~}{e}_i^{c_2}(y),`$
(2.12) where $`c_1=\mathrm{max}(c+\phi _i(x),\epsilon _i(y))\mathrm{max}(\phi _i(x),\epsilon _i(y)),`$
$`c_2=\mathrm{max}(\phi _i(x),\epsilon _i(y))\mathrm{max}(\phi _i(x),c+\epsilon _i(y)).`$
In (2.10) $`c`$ can be a negative integer, in which case we understand $`\stackrel{~}{e}_i^c=\stackrel{~}{f}_i^c`$.

###### Lemma 2.12.

Assume that the functions $`\epsilon _i,\phi _i`$ for both $`_1`$ and $`_2`$ satisfy the properties in Lemma 2.9. Then those for $`_1\times _2`$ also satisfy the same property.

###### Proof.

If $`\alpha _i^{},\alpha _j=0`$, the statement is clear. Suppose $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$. Due to Remark 2.10 it suffices to construct desired functions $`\phi _{ij}(x,y),\phi _{ji}(x,y)`$. Define

$$\phi _{ij}(x,y)=\phi _{ij}(y)+\phi _i(x)\phi _j(y)\gamma _i(y)+\phi _{ij}(x)\gamma _i(y)\gamma _j(y)$$

and $`\phi _{ji}(x,y)`$ by interchanging $`i`$ and $`j`$. To illustrate we calculate $`\phi _{ij}(e_i^c(x,y))`$. Let $`c_1,c_2`$ be as in (2.7). Using Definition 2.1 (iii) and the assumption,

$`\phi _{ij}(e_i^c(x,y))`$ $`=`$ $`c_2\phi _{ij}(y)+{\displaystyle \frac{c_1\phi _i(x)(c_2\phi _{ij}(y)+\phi _{ji}(y))}{c_2^1\epsilon _i(y)}}+c_1\phi _{ij}(x)c_2^2\gamma _i(y)c_2^1\gamma _j(y)`$
$`=`$ $`c_2(\phi _{ij}(y)+{\displaystyle \frac{c\phi _i(x)\phi _{ij}(y)}{\epsilon _i(y)}})+c({\displaystyle \frac{\phi _i(x)\phi _{ji}(y)}{\epsilon _i(y)}}+\phi _{ij}(x)\gamma _i(y)\gamma _j(y))`$
$`=`$ $`c(\phi _{ij}(y)+{\displaystyle \frac{\phi _i(x)\phi _{ij}(y)}{\epsilon _i(y)}})+c({\displaystyle \frac{\phi _i(x)\phi _{ji}(y)}{\epsilon _i(y)}}+\phi _{ij}(x)\gamma _i(y)\gamma _j(y))`$
$`=`$ $`c\phi _{ij}(x,y).`$
The other cases are similar. ∎

We now consider a multiple product. Let $`_1,\mathrm{},_L`$ be geometric pre-crystals such that $`_l=\{x^l=(x_1^l,\mathrm{},x_{N_l}^l)\}`$ ($`l=1,\mathrm{},L`$). Let us set $`𝒙=(x^1,\mathrm{},x^L)`$. Then $`\epsilon _i,\phi _i,e_i^c`$ of the $`L`$-fold product of geometric pre-crystals $`_1\times \mathrm{}\times _L`$ is given by

(2.13) $`\epsilon _i(𝒙)`$ $`={\displaystyle \frac{_{k=1}^L\left(_{j=1}^k\epsilon _i(x^j)\right)\left(_{j=k}^{L1}\phi _i(x^j)\right)}{_{j=1}^{L1}\phi _i(x^j)}},`$
(2.14) $`\phi _i(𝒙)`$ $`={\displaystyle \frac{_{k=1}^L\left(_{j=2}^k\epsilon _i(x^j)\right)\left(_{j=k}^L\phi _i(x^j)\right)}{_{j=2}^L\epsilon _i(x^j)}},`$
(2.15) $`e_i^c(𝒙)`$ $`=(e_i^{c_1}(x^1),\mathrm{},e_i^{c_L}(x^L)),`$
(2.16) $`\text{with}c_l`$ $`={\displaystyle \frac{_{k=1}^Lc^{\theta (kl)}\left(_{j=2}^k\epsilon _i(x^j)\right)\left(_{j=k}^{L1}\phi _i(x^j)\right)}{_{k=1}^Lc^{\theta (kl1)}\left(_{j=2}^k\epsilon _i(x^j)\right)\left(_{j=k}^{L1}\phi _i(x^j)\right)}}.`$
Here $`\theta (s)=1`$ if $`s`$ is true and $`=0`$ otherwise. Note that the product is associative, $`e_i^c(x^1,x^2,x^3)=(e_i^{c_1c_2}(x^1,x^2),e_i^{c_3}(x^3))=(e_i^{c_1}(x^1),e_i^{c_2c_3}(x^2,x^3))`$.

## 3. Realization by unipotent matrices

### 3.1. Matrix $`M(x,z)`$

Let us introduce $`2n`$ by $`2n`$ matrices $`G_i(a)`$ for $`0in`$ by

$$G_i(a)=E+\{\begin{array}{cc}a(E_{i,i+1}+E_{2ni,2n+1i})\hfill & \text{for}\mathrm{\hspace{0.33em}1}in1,\hfill \\ a(E_{n1,n+1}+E_{n,n+2})\hfill & \text{for}i=n,\hfill \\ a(E_{2n1,1}+E_{2n,2})\hfill & \text{for}i=0.\hfill \end{array}$$

Here $`E`$ is the identity matrix, $`E_{ij}`$ is the $`(i,j)`$ matrix unit, and $`a`$ is a parameter. $`G_i(a)`$’s have the following properties.

(3.1) $`G_i(a)G_i(b)=G_i(a+b),`$
(3.2) $`G_i(a)G_j(b)=G_j(b)G_i(a)\text{ if }\alpha _i^{},\alpha _j=0,`$
(3.3) $`G_i(a)G_j(b)G_i(c)=G_j(a^{})G_i(b^{})G_j(c^{})\text{ if }\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1,`$
where $`a^{}=bc/(a+c),b^{}=a+c,c^{}=ab/(a+c)`$.

Let $`=\{x=(x_1,\mathrm{},\overline{x}_1),\epsilon _i,\phi _i,e_i^c\}`$ be the geometric $`D_n^{(1)}`$-crystal given in the previous section. In this subsection we introduce a $`2n`$ by $`2n`$ matrix $`M(x,z)`$ that satisfies

$$G_i\left(\frac{c1}{z^{\delta _{i0}}\epsilon _i(x)}\right)M(x,z)G_i\left(\frac{c^11}{z^{\delta _{i0}}\phi _i(x)}\right)=M(e_i^c(x),z)$$

for any $`i`$ ($`0in`$) and an extra parameter $`z`$. We call $`z`$ the spectral parameter.

We give an explicit form of $`M(x,z)`$. Matrix elements in the first column $`M(x,z)_{i,1}`$ are given as follows.

(3.4)
$$M(x,z)_{i,1}=\{\begin{array}{cc}x_1/\overline{x}_1\hfill & \text{for}i=1,\hfill \\ x_1\mathrm{}x_{i1}(1+x_i/\overline{x}_i)\hfill & \text{for}\mathrm{\hspace{0.33em}2}in1,\hfill \\ x_1\mathrm{}x_{n1}x_n\hfill & \text{for}i=n,\hfill \\ x_1\mathrm{}x_{n1}\hfill & \text{for}i=n+1,\hfill \\ \mathrm{}(x)/(\overline{x}_1\mathrm{}\overline{x}_{2ni})\hfill & \text{for}n+2i2n.\hfill \end{array}$$

Given the first column as above we define the other matrix elements of $`M(x,z)`$ by the relations (3.5)-(3.10).

(3.5)
$$M(x,z)_{i,j+1}=\frac{M(x,z)_{i,j}}{x_j}+\{\begin{array}{cc}(\mathrm{}(x)z1)/\overline{x}_j\hfill & \text{for}i=j,\hfill \\ \mathrm{}(x)z1\hfill & \text{for}i=j+1,\hfill \\ 0\hfill & \text{for}ij,j+1,\hfill \end{array}$$

for $`1jn2`$.

(3.6)
$$M(x,z)_{i,n}=\frac{M(x,z)_{i,n1}}{x_{n1}}+\{\begin{array}{cc}(\mathrm{}(x)z1)/\overline{x}_{n1}\hfill & \text{for}i=n1,\hfill \\ \mathrm{}(x)z1\hfill & \text{for}i=n+1,\hfill \\ 0\hfill & \text{for}in1,n+1.\hfill \end{array}$$

(3.7)
$$M(x,z)_{i,n+1}=\frac{M(x,z)_{i,n1}}{x_{n1}x_n}+\{\begin{array}{cc}(\mathrm{}(x)z1)/(\overline{x}_{n1}x_n)\hfill & \text{for}i=n1,\hfill \\ \mathrm{}(x)z1\hfill & \text{for}i=n,\hfill \\ 0\hfill & \text{for}in1,n.\hfill \end{array}$$

(3.8)
$$M(x,z)_{i,2n}=z\frac{\overline{x}_1M(x,z)_{i,1}}{x_1}+\{\begin{array}{cc}\frac{\overline{x}_1}{x_1}(1\mathrm{}(x)z)\hfill & \text{for}i=2n,\hfill \\ z(\mathrm{}(x)z1)\hfill & \text{for}i=1,\hfill \\ 0\hfill & \text{for}i1,2n.\hfill \end{array}$$

Let us denote $`1+\overline{x}_i/x_i`$ by $`\overline{X}_i`$.

(3.9)
$$M(x,z)_{i,2n1}=z\overline{x}_1\overline{X}_2M(x,z)_{i,1}+\{\begin{array}{cc}\overline{x}_1\overline{X}_2(1\mathrm{}(x)z)\hfill & \text{for}i=2n,\hfill \\ \frac{\overline{x}_2}{x_2}(1\mathrm{}(x)z)\hfill & \text{for}i=2n1,\hfill \\ 0\hfill & \text{for}i2n1,2n.\hfill \end{array}$$

(3.10)
$$M(x,z)_{i,2nj}=\overline{x}_j\frac{\overline{X}_{j+1}M(x,z)_{i,2n+1j}}{\overline{X}_j}+\{\begin{array}{cc}\overline{x}_j\frac{\overline{X}_{j+1}}{\overline{X}_j}(1\mathrm{}(x)z)\hfill & \text{for}i=2n+1j,\hfill \\ \frac{\overline{x}_{j+1}}{x_{j+1}}(1\mathrm{}(x)z)\hfill & \text{for}i=2nj,\hfill \\ 0\hfill & \text{for}i2n+1j,2nj,\hfill \end{array}$$

for $`2jn2`$. For later use we also present matrix elements in the last row.

(3.11)
$$M(x,z)_{2n,i}=\{\begin{array}{cc}\mathrm{}(x)/(x_1\mathrm{}x_{i1})\hfill & \text{for}\mathrm{\hspace{0.33em}1}in,\hfill \\ \overline{x}_1\mathrm{}\overline{x}_{n1}\hfill & \text{for}i=n+1,\hfill \\ \overline{x}_1\mathrm{}\overline{x}_{2ni}(1+\overline{x}_{2n+1i}/x_{2n+1i})\hfill & \text{for}n+2i2n1,\hfill \\ \overline{x}_1/x_1\hfill & \text{for}i=2n.\hfill \end{array}$$

It can be seen that each matrix element is a polynomial in $`z`$ of degree at most $`2`$. We denote the coefficients of $`M(x,z)`$ of degree $`0,1,2`$ by $`A(x),B(x),C(x)`$. Hence we have

$$M(x,z)=A(x)+zB(x)+z^2C(x).$$

###### Example 3.1 ($`n=4`$ case).

$`x=(x_1,x_2,x_3,x_4,\overline{x}_3,\overline{x}_2,\overline{x}_1)`$. We use the notations $`[1]=x_1,[2]=x_2,\mathrm{},[\overline{1}]=\overline{x}_1`$, and $`[(2)]=1+x_2/\overline{x}_2,[(\overline{3})]=1+\overline{x}_3/x_3`$, etc. For instance, $`[34\overline{3}]=x_3x_4\overline{x}_3`$ and $`[1(\overline{2})]=x_1(1+\overline{x}_2/x_2)`$. Define $`8\times 8`$ matrices $`A(x),B(x),C(x)`$ as follows.

$$A(x)=\left(\begin{array}{cccccccc}\hfill \frac{[1]}{[\overline{1}]}& & & & & & & \\ \hfill \left[1(2)\right]& \hfill \frac{[2]}{[\overline{2}]}& & & & & & \\ \hfill \left[12(3)\right]& \hfill \left[2(3)\right]& \hfill \frac{[3]}{[\overline{3}]}& & & & & \\ \hfill \left[1234\right]& \hfill \left[234\right]& \hfill \left[34\right]& \hfill [4]& & & & \\ \hfill \left[123\right]& \hfill \left[23\right]& \hfill [3]& & \hfill \frac{1}{[4]}& & & \\ \hfill \left[1234\overline{3}\right]& \hfill \left[234\overline{3}\right]& \hfill \left[34\overline{3}\right]& \hfill \left[4\overline{3}\right]& \hfill [\overline{3}]& \hfill \frac{[\overline{3}]}{[3]}& & \\ \hfill \left[1234\overline{3}\overline{2}\right]& \hfill \left[234\overline{3}\overline{2}\right]& \hfill \left[34\overline{3}\overline{2}\right]& \hfill \left[4\overline{3}\overline{2}\right]& \hfill \left[\overline{3}\overline{2}\right]& \hfill \left[(\overline{3})\overline{2}\right]& \hfill \frac{[\overline{2}]}{[2]}& \\ \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[34\overline{3}\overline{2}\overline{1}\right]& \hfill \left[4\overline{3}\overline{2}\overline{1}\right]& \hfill \left[\overline{3}\overline{2}\overline{1}\right]& \hfill \left[(\overline{3})\overline{2}\overline{1}\right]& \hfill \left[(\overline{2})\overline{1}\right]& \hfill \frac{[\overline{1}]}{[1]}\end{array}\right),$$

$`B(x)`$ $`=`$ $`(\begin{array}{cccccc}\hfill 0& \hfill \left[1234\overline{3}\overline{2}\right]& \hfill \left[134\overline{3}\overline{2}\right]& \hfill \left[14\overline{3}\overline{2}\right]& \hfill \left[1\overline{3}\overline{2}\right]& \hfill \left[1(\overline{3})\overline{2}\right]\\ & \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[1(2)34\overline{3}\overline{2}\overline{1}\right]& \hfill \left[1(2)4\overline{3}\overline{2}\overline{1}\right]& \hfill \left[1(2)\overline{3}\overline{2}\overline{1}\right]& \hfill \left[1(2)(\overline{3})\overline{2}\overline{1}\right]\\ & & \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[12(3)4\overline{3}\overline{2}\overline{1}\right]& \hfill \left[12(3)\overline{3}\overline{2}\overline{1}\right]& \hfill \left[12(3)(\overline{3})\overline{2}\overline{1}\right]\\ & & & & \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[1234(\overline{3})\overline{2}\overline{1}\right]\\ & & & \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& & \hfill \left[123(\overline{3})\overline{2}\overline{1}\right]\\ & & & & & \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]\\ & & & & & \end{array}`$
$`\begin{array}{cc}\hfill \left[1(\overline{2})\right]& \\ \hfill \left[1(2)(\overline{2})\overline{1}\right]& \hfill \left[(2)\overline{1}\right]\\ \hfill \left[12(3)(\overline{2})\overline{1}\right]& \hfill \left[2(3)\overline{1}\right]\\ \hfill \left[1234(\overline{2})\overline{1}\right]& \hfill \left[234\overline{1}\right]\\ \hfill \left[123(\overline{2})\overline{1}\right]& \hfill \left[23\overline{1}\right]\\ \hfill \left[1234\overline{3}(\overline{2})\overline{1}\right]& \hfill \left[234\overline{3}\overline{1}\right]\\ \hfill \left[1234\overline{3}\overline{2}\overline{1}\right]& \hfill \left[234\overline{3}\overline{2}\overline{1}\right]\\ & \hfill 0\end{array}),C(x)=(\begin{array}{cccc}\hfill 0& \hfill \mathrm{}& \hfill 0& \left[1234\overline{3}\overline{2}\overline{1}\right]\\ \hfill 0& \hfill \mathrm{}& \hfill \mathrm{}& 0\\ \hfill \mathrm{}& & & \mathrm{}\\ \hfill 0& \hfill \mathrm{}& \hfill \mathrm{}& 0\end{array}).`$
The matrix $`M(x,z)`$ for $`D_4^{(1)}`$ is given by $`M(x,z)=A(x)+zB(x)+z^2C(x).`$

Before going into the main theorem (Theorem 3.11) we present several properties of the matrix $`M(x,z)=A(x)+zB(x)+z^2C(x)`$. The only nonzero element of $`C(x)`$ is $`C(x)_{1,2n}`$ that is equal to $`\mathrm{}(x)`$. The matrix $`A(x)`$ is lower triangular. Explicit expressions for the nonzero elements of $`A(x)`$ are given as follows:

* $`A(x)_{i,i}=x_i/\overline{x}_i(1in1),=x_n(i=n),=1/x_n(i=n+1),=\overline{x}_{2n+1i}/x_{2n+1i}(n+2i2n)`$.
* For $`2in1,1ji1`$, we have $`A(x)_{i,j}=x_j\mathrm{}x_{i1}(1+x_i/\overline{x}_i)`$ and $`A(x)_{2n+1j,2n+1i}=\overline{x}_j\mathrm{}\overline{x}_{i1}(1+\overline{x}_i/x_i).`$
* For $`1jn1`$ we have $`A(x)_{n,j}=x_j\mathrm{}x_n,A(x)_{n+1,j}=x_j\mathrm{}x_{n1},`$ $`A(x)_{2n+1j,n}=\overline{x}_j\mathrm{}\overline{x}_{n1}x_n,`$ and $`A(x)_{2n+1j,n+1}=\overline{x}_j\mathrm{}\overline{x}_{n1}.`$
* For $`1i,jn1`$ we have $`A(x)_{2n+1i,j}=(x_j\mathrm{}x_n)\times (\overline{x}_i\mathrm{}\overline{x}_{n1}).`$

###### Lemma 3.2.

Let $`F_i(a)={}_{}{}^{t}G_{i}^{}(a)`$ and

$$d(x)=\text{diag}(x_1/\overline{x}_1,\mathrm{},x_{n1}/\overline{x}_{n1},x_n,1/x_n,\overline{x}_{n1}/x_{n1},\mathrm{},\overline{x}_1/x_1).$$

Then the matrix $`A(x)`$ has the following factorization.

$`A(x)`$ $`=`$ $`F_1(\overline{x}_1)F_2(\overline{x}_2)\mathrm{}F_{n2}(\overline{x}_{n2})F_n(\overline{x}_{n1})d(x)`$
$`\times `$ $`F_{n1}(x_{n1})F_{n2}(x_{n2})\mathrm{}F_2(x_2)F_1(x_1)`$
###### Proof.

$`F_1(\overline{x}_1)^1A(x)F_1(x_1)^1`$ is given by deleting the elements in the 1st column and the $`2n`$-th row of $`A(x)`$ except the diagonal elements. To illustrate we take the $`n=4`$ case. See Example 3.1.

$$F_1(\overline{x}_1)^1A(x)F_1(x_1)^1=\left(\begin{array}{cccccccc}\hfill \frac{[1]}{[\overline{1}]}& & & & & & & \\ & \hfill \frac{[2]}{[\overline{2}]}& & & & & & \\ & \hfill \left[2(3)\right]& \hfill \frac{[3]}{[\overline{3}]}& & & & & \\ & \hfill \left[234\right]& \hfill \left[34\right]& \hfill [4]& & & & \\ & \hfill \left[23\right]& \hfill [3]& & \hfill \frac{1}{[4]}& & & \\ & \hfill \left[234\overline{3}\right]& \hfill \left[34\overline{3}\right]& \hfill \left[4\overline{3}\right]& \hfill [\overline{3}]& \hfill \frac{[\overline{3}]}{[3]}& & \\ & \hfill \left[234\overline{3}\overline{2}\right]& \hfill \left[34\overline{3}\overline{2}\right]& \hfill \left[4\overline{3}\overline{2}\right]& \hfill \left[\overline{3}\overline{2}\right]& \hfill \left[(\overline{3})\overline{2}\right]& \hfill \frac{[\overline{2}]}{[2]}& \\ & & & & & & & \hfill \frac{[\overline{1}]}{[1]}\end{array}\right).$$

Similarly, $`F_2(\overline{x}_2)^1F_1(\overline{x}_1)^1A(x)F_1(x_1)^1F_2(x_2)^1`$ is given by deleting the elements in the 2nd column and the $`(2n1)`$-th row of $`F_1(\overline{x}_1)^1A(x)F_1(x_1)^1`$ except the diagonal elements. This process continues until we obtain $`d(x)`$. For example, the final step for the $`n=4`$ case goes as

$`\left(\begin{array}{cccc}1& & & \\ & 1& & \\ \left[\overline{3}\right]& & 1& \\ & \left[\overline{3}\right]& & 1\end{array}\right)`$ $`\left(\begin{array}{cccc}\hfill \frac{[3]}{[\overline{3}]}& & & \\ \hfill \left[34\right]& \hfill [4]& & \\ \hfill \left[3\right]& & \hfill \frac{1}{[4]}& \\ \hfill \left[34\overline{3}\right]& \hfill \left[4\overline{3}\right]& \hfill [\overline{3}]& \hfill \frac{[\overline{3}]}{[3]}\end{array}\right)\left(\begin{array}{cccc}1& & & \\ \left[3\right]& 1& & \\ & & 1& \\ & & \left[3\right]& 1\end{array}\right)`$
$`=\left(\begin{array}{cccc}\hfill \frac{[3]}{[\overline{3}]}& & & \\ & \hfill [4]& & \\ & & \hfill \frac{1}{[4]}& \\ & & & \hfill \frac{[\overline{3}]}{[3]}\end{array}\right).`$
###### Remark 3.3.

We note that the sequence $`(1,2,\mathrm{},n2,n,n1,\mathrm{},1)`$ extracted from the indices of $`F`$ in the right hand side of (3.2) is essentially the same as the one given in \[KMOTU, HKT2\].

###### Proposition 3.4.

(3.15)
$$M(x,\mathrm{}(x)^1)=\frac{1}{\mathrm{}(x)}𝒟_2(x)P𝒟_1(x),$$

where

$`𝒟_1(x)`$ $`=`$ $`\text{diag}(A(x)_{2n,1},A(x)_{2n,2},\mathrm{},A(x)_{2n,2n}),`$
$`𝒟_2(x)`$ $`=`$ $`\text{diag}(A(x)_{1,1},A(x)_{2,1},\mathrm{},A(x)_{2n,1}),`$
and $`P`$ is the matrix with all the entries being 1.

###### Corollary 3.5.

$$B(x)=𝒟_2(x)P𝒟_1(x)\mathrm{}(x)A(x)\mathrm{}(x)^1C(x).$$

Set $`T=(\delta _{i+j,n+1}(1)^{i1})_{1i,jn}`$ and define a $`2n`$ by $`2n`$ matrix $`S`$ by

(3.16)
$$S=\left(\begin{array}{cc}& T\\ {}_{}{}^{t}T& \end{array}\right).$$

It is clear that $`S^1=^tS=S`$.

###### Proposition 3.6.

$`M(x,z)S^tM(x,z)S=(1z\mathrm{}(x))^2E`$.

###### Proof.

For brevity we write $`M(x,z)=M`$, $`A(x)=A`$, $`B(x)=B`$, $`C(x)=C`$, $`𝒟_1(x)=𝒟_1`$, $`𝒟_2(x)=𝒟_2`$, and $`\mathrm{}(x)=\mathrm{}`$. For any $`2n`$ by $`2n`$ matrix $`X`$ we denote $`S^tXS`$ by $`\stackrel{ˇ}{X}`$. Then we have

$$M\stackrel{ˇ}{M}=A\stackrel{ˇ}{A}+z(A\stackrel{ˇ}{B}+B\stackrel{ˇ}{A})+z^2(A\stackrel{ˇ}{C}+B\stackrel{ˇ}{B}+C\stackrel{ˇ}{A}).$$

First we see that $`A\stackrel{ˇ}{A}=E`$ since $`A`$ has the factorization (3.2) and any factor $`X`$ thereof satisfies $`X\stackrel{ˇ}{X}=E`$. By Corollary 3.5 we have $`B=𝒟_2P𝒟_1\mathrm{}A\mathrm{}^1C.`$ Let us denote $`\mathrm{}^1C=(\delta _{i,1}\delta _{j,2n})_{1i,j2n}`$ by $`H`$. Then we have

$`A\stackrel{ˇ}{B}`$ $`=A\stackrel{ˇ}{𝒟_1}\stackrel{ˇ}{P}\stackrel{ˇ}{𝒟_2}\mathrm{}EAH,`$
$`B\stackrel{ˇ}{A}`$ $`=𝒟_2P𝒟_1\stackrel{ˇ}{A}\mathrm{}EH\stackrel{ˇ}{A}.`$
Here we have used $`A\stackrel{ˇ}{A}=E`$ and $`\stackrel{ˇ}{H}=H`$. It is easy to see that $`A\stackrel{ˇ}{𝒟_1}\stackrel{ˇ}{P}\stackrel{ˇ}{𝒟_2}=H\stackrel{ˇ}{A}`$, $`𝒟_2P𝒟_1\stackrel{ˇ}{A}=AH`$, and thereby $`A\stackrel{ˇ}{B}+B\stackrel{ˇ}{A}=2\mathrm{}E`$.

It remains to check the desired relation for one special value of $`z`$ other than $`z=0`$. Let us put $`z=\mathrm{}^1`$. By Proposition 3.4 we have $`M\stackrel{ˇ}{M}=\mathrm{}^2𝒟_2P𝒟_1\stackrel{ˇ}{𝒟_1}\stackrel{ˇ}{P}\stackrel{ˇ}{𝒟_2}.`$ By using $`A\stackrel{ˇ}{A}=E`$ we see $`P𝒟_1\stackrel{ˇ}{𝒟_1}\stackrel{ˇ}{P}=O,`$ where $`O`$ is the zero matrix. The proof is completed. ∎

###### Corollary 3.7.

$`detM(x,z)=(1z\mathrm{}(x))^{2n}`$.

On the set of variables of the geometric crystal $``$ we introduce involutive automorphisms $`\sigma _1`$, $`\sigma _n`$ and $`\tau `$ by

(3.17) $`\sigma _1`$ $`:x_1\overline{x}_1,`$
(3.18) $`\sigma _n`$ $`:x_{n1}x_{n1}x_n,\overline{x}_{n1}\overline{x}_{n1}x_n,x_n1/x_n,`$
(3.19) $`\tau `$ $`:x_i\overline{x}_i,\overline{x}_ix_i,(1in2)`$
$`x_{n1}\overline{x}_{n1}x_n,\overline{x}_{n1}x_{n1}x_n,x_n1/x_n.`$
Note that $`\sigma _1`$, $`\sigma _n`$ and $`\tau `$ are mutually commutative. For simplicity we write $`x^{\sigma _1}`$ to mean $`\sigma _1(x)`$, etc. We can easily check

###### Lemma 3.8.

(3.20) $`\epsilon _1(x^{\sigma _1})=\epsilon _0(x),\phi _1(x^{\sigma _1})=\phi _0(x),e_1^c(x^{\sigma _1})=(e_0^c(x))^{\sigma _1},`$
(3.21) $`\epsilon _{n1}(x^{\sigma _n})=\epsilon _n(x),\phi _{n1}(x^{\sigma _n})=\phi _n(x),e_{n1}^c(x^{\sigma _n})=(e_n^c(x))^{\sigma _n}.`$
The other $`\epsilon _i`$ and $`\phi _i`$ are invariant under $`\sigma _1`$ and $`\sigma _n`$.

Let us introduce the $`2n`$ by $`2n`$ matrices:

(3.22) $`J_1(z)`$ $`=zE_{1,2n}+z^1E_{2n,1}+_{i=2}^{2n1}E_{i,i},`$
(3.23) $`J_n`$ $`=E_{n,n+1}+E_{n+1,n}+_{i=1}^{n1}(E_{i,i}+E_{2n+1i,2n+1i}),`$
(3.24) $`J`$ $`=_{i=1}^{2n}E_{i,2n+1i}.`$
The following lemma is immediate.

###### Lemma 3.9.

(3.25) $`J_1(z)G_1(a)`$ $`=G_0({\displaystyle \frac{a}{z}})J_1(z),`$
(3.26) $`J_nG_{n1}(a)`$ $`=G_n(a)J_n.`$
###### Lemma 3.10.

(3.27) $`J_1(z)M(x,z)J_1(z)`$ $`=M(x^{\sigma _1},z),`$
(3.28) $`J_nM(x,z)J_n`$ $`=M(x^{\sigma _n},z),`$
(3.29) $`J^tM(x,z)J`$ $`=M(\tau (x),z).`$
###### Proof.

First we prove (3.27). In this case, only the first and $`2n`$-th rows and columns are changed. Let us consider $`J_1(z)A(x)J_1(z)`$. All the elements in the first column and the $`2n`$-th row of this matrix are zero except the $`(1,1)`$ and $`(2n,2n)`$ elements. And we have

$`\left(J_1(z)A(x)J_1(z)\right)_{1,i}`$ $`=\{\begin{array}{cc}\overline{x}_1/x_1\hfill & \text{for}i=1,\hfill \\ \mathrm{}(x)z^2\hfill & \text{for}i=2n,\hfill \\ A(x)_{2n,i}z\hfill & \text{for}i1,2n,\hfill \end{array}`$
$`\left(J_1(z)A(x)J_1(z)\right)_{i,2n}`$ $`=\{\begin{array}{cc}\mathrm{}(x)z^2\hfill & \text{for}i=1,\hfill \\ x_1/\overline{x}_1\hfill & \text{for}i=2n,\hfill \\ A(x)_{i,1}z\hfill & \text{for}i1,2n.\hfill \end{array}`$
Note that $`\overline{x}_1/x_1=A(x^{\sigma _1})_{1,1}`$, $`A(x)_{2n,i}=B(x^{\sigma _1})_{1,i}(i1,2n)`$, $`x_1/\overline{x}_1=A(x^{\sigma _1})_{2n,2n}`$, and $`A(x)_{i,1}=B(x^{\sigma _1})_{i,2n}(i1,2n)`$. Here we have used

$`B(x)_{1,i}`$ $`=\{\begin{array}{cc}0\hfill & \text{for}i=1,2n,\hfill \\ A(x^{\sigma _1})_{2n,i}\hfill & \text{for}i1,2n,\hfill \end{array}`$
$`B(x)_{i,2n}`$ $`=\{\begin{array}{cc}0\hfill & \text{for}i=1,2n,\hfill \\ A(x^{\sigma _1})_{i,1}\hfill & \text{for}i1,2n,\hfill \end{array}`$
which is obtained from Corollary 3.5. Let us consider $`J_1(z)B(x)J_1(z)`$. From Corollary 3.5 we find $`B(x)_{2n,i}=B(x)_{i,1}=0`$ for $`1i2n`$. Therefore all elements in the first row and the $`2n`$-th column of this matrix are zero. And we have

$`\left(J_1(z)B(x)J_1(z)\right)_{2n,i}`$ $`=\{\begin{array}{cc}0\hfill & \text{for}i=1,2n,\hfill \\ B(x)_{1,i}z^1\hfill & \text{for}i1,2n,\hfill \end{array}`$
$`\left(J_1(z)B(x)J_1(z)\right)_{i,1}`$ $`=\{\begin{array}{cc}0\hfill & \text{for}i=1,2n,\hfill \\ B(x)_{i,2n}z^1\hfill & \text{for}i1,2n.\hfill \end{array}`$
Note that $`B(x)_{1,i}=A(x^{\sigma _1})_{2n,i}`$ and $`B(x)_{i,2n}=A(x^{\sigma _1})_{i,1}`$ for $`i1,2n`$. Let us consider $`J_1(z)C(x)J_1(z)`$. The only nonzero element of this matrix is the $`(2n,1)`$ element that takes the value $`\mathrm{}(x)z^2`$. Putting all the above relations together we obtain (3.27).

Next let us consider (3.28). From (3.2) we have

$`J_nA(x)J_n`$ $`=`$ $`F_1(\overline{x}_1)F_2(\overline{x}_2)\mathrm{}F_{n2}(\overline{x}_{n2})F_{n1}(\overline{x}_{n1})d(x^{\sigma _n})`$
$`\times `$ $`F_n(x_{n1})F_{n2}(x_{n2})\mathrm{}F_2(x_2)F_1(x_1).`$
Since $`F_{n1}(\overline{x}_{n1})d(x^{\sigma _n})=d(x^{\sigma _n})F_{n1}(x_{n1}x_n)`$ and $`d(x^{\sigma _n})F_n(x_{n1})=F_n(`$

$`\overline{x}_{n1}x_n)d(x^{\sigma _n})`$ we obtain $`J_nA(x)J_n=A(x^{\sigma _n})`$. Note that $`F_{n1}`$ and $`F_n`$ are commutative. Clearly we have $`J_nC(x)J_n=C(x)=C(x^{\sigma _n})`$. Then by Corollary 3.5 we obtain $`J_nB(x)J_n=B(x^{\sigma _n})`$. The relation (3.28) is proved.

Finally we show (3.29). From (3.2) we have

$`J^tA(x)J`$ $`=`$ $`F_1(x_1)F_2(x_2)\mathrm{}F_{n2}(x_{n2})F_{n1}(x_{n1})d(\tau (x))`$
$`\times `$ $`F_n(\overline{x}_{n1})F_{n2}(\overline{x}_{n2})\mathrm{}F_2(\overline{x}_2)F_1(\overline{x}_1).`$
Since $`F_{n1}(x_{n1})d(\tau (x))=d(\tau (x))F_{n1}(\overline{x}_{n1}x_n)`$ and $`d(\tau (x))F_n(\overline{x}_{n1})=F_n(x_{n1}`$

$`x_n)d(\tau (x))`$ we obtain $`J^tA(x)J=A(\tau (x))`$. Clearly we have $`J^tC(x)J=C(x)=C(\tau (x))`$. Then by Corollary 3.5 we can obtain $`J^tB(x)J=B(\tau (x))`$. The relation (3.29) is proved. ∎

The following theorem states that the transformation $`e_i^c`$ of the geometric $`D_n^{(1)}`$-crystal $``$ is realized as the multiplications of unipotent matrices.

###### Theorem 3.11.

For $`0in`$ we have

(3.30)
$$G_i\left(\frac{c1}{z^{\delta _{i0}}\epsilon _i(x)}\right)M(x,z)G_i\left(\frac{c^11}{z^{\delta _{i0}}\phi _i(x)}\right)=M(e_i^c(x),z).$$

###### Proof.

First note that the $`i=n`$ case can be derived from the $`i=n1`$ case as follows.

$`M(e_n^c(x),z)`$ $`=J_nM(e_{n1}^c(x^{\sigma _n}),z)J_n`$
$`=J_nG_{n1}\left({\displaystyle \frac{c1}{\epsilon _{n1}(x^{\sigma _n})}}\right)M(x^{\sigma _n},z)G_{n1}\left({\displaystyle \frac{c^11}{\phi _{n1}(x^{\sigma _n})}}\right)J_n`$
$`=G_n\left({\displaystyle \frac{c1}{\epsilon _n(x)}}\right)J_nM(x^{\sigma _n},z)J_nG_n\left({\displaystyle \frac{c^11}{\phi _n(x)}}\right)`$
$`=G_n\left({\displaystyle \frac{c1}{\epsilon _n(x)}}\right)M(x,z)G_n\left({\displaystyle \frac{c^11}{\phi _n(x)}}\right).`$
Here we have used (3.21),(3.26), (3.28). In a similar way the $`i=0`$ case can be derived from the $`i=1`$ case by using (3.20),(3.25),(3.27). Thus we can assume $`1in1`$. The identity to be proved is of degree 2 with respect to $`z`$. However, it is easy to see that the coefficients of $`z^2`$ in the both hand sides coincide. Thus it remains to check the identity with two distinct values of $`z`$, which we take to be $`\mathrm{}(x)^1`$ and $`0`$.

First let us put $`z=\mathrm{}(x)^1`$. From Proposition 3.4 the identity to be proved reads as

(3.31)
$$G_i\left(\frac{c1}{\epsilon _i(x)}\right)𝒟_2(x)P𝒟_1(x)G_i\left(\frac{c^11}{\phi _i(x)}\right)=𝒟_2(e_i^c(x))P𝒟_1(e_i^c(x)).$$

This equality indeed holds since we have

(3.32) $`G_i\left({\displaystyle \frac{c1}{\epsilon _i(x)}}\right)𝒟_2(x)P`$ $`=`$ $`𝒟_2(e_i^c(x))P,`$
(3.33) $`P𝒟_1(x)G_i\left({\displaystyle \frac{c^11}{\phi _i(x)}}\right)`$ $`=`$ $`P𝒟_1(e_i^c(x)),`$
or equivalently

$`A(e_i^c(x))_{k,1}=\{\begin{array}{cc}A(x)_{k,1}+A(x)_{k+1,1}\frac{c1}{\epsilon _i(x)}\hfill & \text{for}k=i,2ni,\hfill \\ A(x)_{k,1}\hfill & \text{otherwise},\hfill \end{array}`$
$`A(e_i^c(x))_{2n,k}=\{\begin{array}{cc}A(x)_{2n,k1}\frac{c^11}{\phi _i(x)}+A(x)_{2n,k}\hfill & \text{for}k=i+1,2n+1i,\hfill \\ A(x)_{2n,k}\hfill & \text{otherwise}.\hfill \end{array}`$
One can check them from (3.4) and (3.11).

Next let us put $`z=0`$. We consider the $`i=1`$ case. The other cases are similar. The identity to be proved reads as

(3.34)
$$G_1\left(\frac{c1}{\epsilon _1(x)}\right)A(x)G_1\left(\frac{c^11}{\phi _1(x)}\right)=A(e_1^c(x)).$$

Substitute the factorized form of $`A(x)`$ (3.2) into the left hand side. Exchange the leftmost two matrices as

$$G_1\left(\frac{c1}{\epsilon _1(x)}\right)F_1(\overline{x}_1)=F_1(\xi _2^1\overline{x}_1)\stackrel{~}{G}_1\left(\frac{c1}{\epsilon _1(x)}\right).$$

Here $`\stackrel{~}{G}_1(a)`$ is the matrix whose 1st and $`(2n1)`$-th (resp. 2nd and $`2n`$-th) diagonal elements are $`\xi _2`$ (resp. $`\xi _2^1`$) and the other matrix elements are the same as those of $`G_1(a)`$. Recall $`\xi _2`$ is defined in section 2.2. Then the next step is to exchange the second and third matrices as

$$\stackrel{~}{G}_1\left(\frac{c1}{\epsilon _1(x)}\right)F_2(\overline{x}_2)=F_2(\xi _2\overline{x}_2)\stackrel{~}{G}_1\left(\frac{c1}{\epsilon _1(x)}\right).$$

Similarly, for the rightmost three matrices we have

$$F_2(x_2)F_1(x_1)G_1\left(\frac{c^11}{\phi _1(x)}\right)=\widehat{G}_1\left(\frac{c^11}{\phi _1(x)}\right)F_2(c^1\xi _2x_2)F_1(c\xi _2^1x_1).$$

Here $`\widehat{G}_1(a)`$ is the matrix whose 1st and $`(2n1)`$-th (resp. 2nd and $`2n`$-th) diagonal elements are $`c\xi _2^1`$ (resp. $`c^1\xi _2`$) and the other matrix elements are the same as those of $`G_1(a)`$. The other $`F_i`$’s commute with $`\stackrel{~}{G}_1`$ and $`\widehat{G}_1`$. Thus the left hand side of (3.34) leads to

$$F_1(\xi _2^1\overline{x}_1)F_2(\xi _2\overline{x}_2)\mathrm{}\stackrel{~}{G}_1\left(\frac{c1}{\epsilon _1(x)}\right)d(x)\widehat{G}_1\left(\frac{c^11}{\phi _1(x)}\right)\mathrm{}F_2(c^1\xi _2x_2)F_1(c\xi _2^1x_1).$$

Thanks to

$$d(x)\widehat{G}_1\left(\frac{c^11}{\phi _1(x)}\right)=\stackrel{~}{G}_1\left(\frac{c1}{\epsilon _1(x)}\right)^1d(e_1^c(x)),$$

we obtain the right hand side of (3.34).

The proof is completed. ∎

### 3.2. Product of $`M(x,z)`$

Throughout this subsection we consider the $`L`$-fold product $`^{\times L}`$ of the geometric $`D_n^{(1)}`$-crystal $``$ given in section 2.2. Our main theorem here is Theorem 3.16 which states that $`^{\times L}`$ also becomes a geometric crystal.

###### Theorem 3.12.

Let $`𝐱=(x^1,\mathrm{},x^L)`$ the set of variables of $`^{\times L}`$ and set $`e_i^c(𝐱)=(y^1,\mathrm{},y^L)`$. Then we have

$$M(y^1,z)\mathrm{}M(y^L,z)=G_i\left(\frac{c1}{z^{\delta _{i0}}\epsilon _i(𝒙)}\right)M(x^1,z)\mathrm{}M(x^L,z)G_i\left(\frac{c^11}{z^{\delta _{i0}}\phi _i(𝒙)}\right),$$

for $`0in`$.

###### Proof.

From Theorem 3.11 we have

$$M(y^l,z)=M(e_i^{c_l}(x^l),z)=G_i\left(\frac{c_l1}{z^{\delta _{i0}}\epsilon _i(x^l)}\right)M(x^l,z)G_i\left(\frac{c_l^11}{z^{\delta _{i0}}\phi _i(x^l)}\right),$$

for $`1lL`$. Using (2.13)–(2.16) we can check

$`{\displaystyle \frac{c_{l1}^11}{\phi _i(x^{l1})}}+{\displaystyle \frac{c_l1}{\epsilon _i(x^l)}}=0\text{for }2lL,`$
$`{\displaystyle \frac{c_11}{\epsilon _i(x^1)}}={\displaystyle \frac{c1}{\epsilon _i(𝒙)}},{\displaystyle \frac{c_L^11}{\phi _i(x^L)}}={\displaystyle \frac{c^11}{\phi _i(𝒙)}},`$
which finish the proof. ∎

The following theorem plays a crucial role in the subsequent part of this paper. It asserts that we can retrieve components $`x^l`$ from the product of matrices $`M(x^1,z)\mathrm{}M(x^L,z)`$.

###### Theorem 3.13.

Let $`𝐱=(x^1,\mathrm{},x^L)`$ and $`𝐲=(y^1,\mathrm{},y^L)`$ be sets of variables of $`^{\times L}`$. Suppose

$`\mathrm{}(x^i)`$ $`=`$ $`\mathrm{}(y^i)(1iL),`$
$`\mathrm{}(x^i)`$ $``$ $`\mathrm{}(x^j)(ij),`$
and

(3.35)
$$M(x^1,z)\mathrm{}M(x^L,z)=M(y^1,z)\mathrm{}M(y^L,z).$$

Then we have $`x^i=y^i(1iL)`$.

###### Proof.

Denote $`\mathrm{}(x^1)=\mathrm{}(y^1)`$ by $`a^1`$. Let us put $`z=a`$ in (3.35). Using Proposition 3.4 we obtain

$`𝒟_2(y^1)^1𝒟_2(x^1)P`$
$`=P𝒟_1(y^1)M(y^2,a)\mathrm{}M(y^L,a)M(x^L,a)^1\mathrm{}M(x^2,a)^1𝒟_1(x^1)^1.`$
Here we used the property that $`detM(x,z)0`$ unless $`z=\mathrm{}(x)^1`$. See Corollary 3.7. We see that the both sides of this equation should be a scalar multiple of $`P`$. From the $`2n`$-th row of the left hand side we see that the scalar should be $`1`$. Hence we have $`𝒟_2(x^1)=𝒟_2(y^1)`$, that implies $`x^1=y^1`$. In the same way we can deduce $`x^i=y^i`$ for all $`i`$. ∎

We prepare lemmas. Let $`𝒙=(x^1,\mathrm{},x^L)`$ be the set of variables of $`^{\times L}`$. Define $`𝒙^{\sigma _a}=((x^1)^{\sigma _a},\mathrm{},(x^L)^{\sigma _a})`$ for $`a=1,n`$.

###### Lemma 3.14.

$`\epsilon _1(𝒙^{\sigma _1})=\epsilon _0(𝒙),\phi _1(𝒙^{\sigma _1})=\phi _0(𝒙),`$
$`\epsilon _{n1}(𝒙^{\sigma _n})=\epsilon _n(𝒙),\phi _{n1}(𝒙^{\sigma _n})=\phi _n(𝒙).`$
###### Proof.

The $`L=1`$ case is given in Lemma 3.8. By (2.13) and (2.14) we see that the claim is also true for $`L2`$. ∎

###### Lemma 3.15.

$`e_1^c(𝒙^{\sigma _1})`$ $`=(e_0^c(𝒙))^{\sigma _1},`$
$`e_{n1}^c(𝒙^{\sigma _n})`$ $`=(e_n^c(𝒙))^{\sigma _n}.`$
###### Proof.

Denote the left (resp. right) hand side of the second relation by $`𝒚=(y^1,\mathrm{},y^L)`$ (resp. $`𝒘=(w^1,\mathrm{},w^L)`$). We have

$`M(y^1,z)\mathrm{}M(y^L,z)`$
$`=G_{n1}\left({\displaystyle \frac{c1}{\epsilon _{n1}(𝒙^{\sigma _n})}}\right)M((x^1)^{\sigma _n},z)\mathrm{}M((x^L)^{\sigma _n},z)G_{n1}\left({\displaystyle \frac{c^11}{\phi _{n1}(𝒙^{\sigma _n})}}\right)`$
$`=G_{n1}\left({\displaystyle \frac{c1}{\epsilon _n(𝒙)}}\right)J_nM(x^1,z)\mathrm{}M(x^L,z)J_nG_{n1}\left({\displaystyle \frac{c^11}{\phi _n(𝒙)}}\right)`$
$`=J_nG_n\left({\displaystyle \frac{c1}{\epsilon _n(𝒙)}}\right)M(x^1,z)\mathrm{}M(x^L,z)G_n\left({\displaystyle \frac{c^11}{\phi _n(𝒙)}}\right)J_n`$
$`=M(w^1,z)\mathrm{}M(w^L,z).`$
Here we have used Lemma 3.9, 3.10, 3.14 and Theorem 3.12. Now Theorem 3.13 tells $`𝒚=𝒘`$. The first relation is similar. ∎

Our main theorem in this section is

###### Theorem 3.16.

$`^{\times L}`$ is a geometric crystal. Namely,

(3.36)
$$e_j^de_i^c(𝒙)=e_i^ce_j^d(𝒙)$$

for $`\alpha _i^{},\alpha _j=0`$, and

(3.37)
$$e_i^de_j^{cd}e_i^c(𝒙)=e_j^ce_i^{cd}e_j^d(𝒙)$$

for $`\alpha _i^{},\alpha _j=\alpha _j^{},\alpha _i=1`$.

###### Proof.

We prove (3.37) first. Denote the left (resp. right) hand side of (3.37) by $`𝒚=(y^1,\mathrm{},y^L)`$ (resp. $`𝒘=(w^1,\mathrm{},w^L)`$). It suffices to prove $`M(y^1,z)\mathrm{}M(y^L,z)=M(w^1,z)\mathrm{}M(w^L,z)`$ by Theorem 3.13. Let us define

(3.38) $`P`$ $`=G_i\left({\displaystyle \frac{d1}{\epsilon _i(e_j^{cd}e_i^c(𝒙))}}\right)G_j\left({\displaystyle \frac{cd1}{\epsilon _j(e_i^c(𝒙))}}\right)G_i\left({\displaystyle \frac{c1}{\epsilon _i(𝒙)}}\right),`$
(3.39) $`P^{}`$ $`=G_j\left({\displaystyle \frac{c1}{\epsilon _j(e_i^{cd}e_j^d(𝒙))}}\right)G_i\left({\displaystyle \frac{cd1}{\epsilon _i(e_j^d(𝒙))}}\right)G_j\left({\displaystyle \frac{d1}{\epsilon _j(𝒙)}}\right),`$
(3.40) $`Q`$ $`=G_i\left({\displaystyle \frac{d^11}{\phi _i(e_j^{cd}e_i^c(𝒙))}}\right)G_j\left({\displaystyle \frac{(cd)^11}{\phi _j(e_i^c(𝒙))}}\right)G_i\left({\displaystyle \frac{c^11}{\phi _i(𝒙)}}\right),`$
(3.41) $`Q^{}`$ $`=G_j\left({\displaystyle \frac{c^11}{\phi _j(e_i^{cd}e_j^d(𝒙))}}\right)G_i\left({\displaystyle \frac{(cd)^11}{\phi _i(e_j^d(𝒙))}}\right)G_j\left({\displaystyle \frac{d^11}{\phi _j(𝒙)}}\right).`$
For notational simplicity we have supposed $`i,j0`$. Otherwise the associated arguments should be divided by $`z`$. From Theorem 3.12 we have

$`M(y^1,z)\mathrm{}M(y^L,z)`$ $`=PM(x^1,z)\mathrm{}M(x^L,z)Q^1,`$
$`M(w^1,z)\mathrm{}M(w^L,z)`$ $`=P^{}M(x^1,z)\mathrm{}M(x^L,z)Q_{}^{}{}_{}{}^{1}.`$
We show $`Q=Q^{}`$ only, for $`P=P^{}`$ follows from this by using (2.1) and Definition 2.1 (iii). From (3.3) it suffices to check

$`\phi _i(𝒙)\phi _j(e_i^c(𝒙))=\phi _i(e_j^d(𝒙))\phi _j(e_i^{cd}e_j^d(𝒙)),`$
$`\phi _j(e_i^c(𝒙))\phi _i(e_j^{cd}e_i^c(𝒙))=\phi _j(𝒙)\phi _i(e_j^d(𝒙)),`$
$`{\displaystyle \frac{c^11}{\phi _i(𝒙)}}+{\displaystyle \frac{d^11}{\phi _i(e_j^{cd}e_i^c(𝒙))}}={\displaystyle \frac{(cd)^11}{\phi _i(e_j^d(𝒙))}}.`$
Let us prove the first identity. Using Lemma 2.9 (b) for the multiple product case we have

$`\phi _j(e_i^{cd}e_j^d(𝒙))`$ $`={\displaystyle \frac{\phi _{ij}(e_i^{cd}e_j^d(𝒙))+\phi _{ji}(e_i^{cd}e_j^d(𝒙))}{\phi _i(e_i^{cd}e_j^d(𝒙))}}`$
$`={\displaystyle \frac{cd\phi _{ij}(𝒙)+d\phi _{ji}(𝒙)}{cd\phi _i(e_j^d(𝒙))}}.`$
Therefore

$`\phi _i(e_j^d(𝒙))\phi _j(e_i^{cd}e_j^d(𝒙))`$ $`=c^1(c\phi _{ij}(𝒙)+\phi _{ji}(𝒙))`$
$`=c^1\phi _i(e_i^c(𝒙))\phi _j(e_i^c(𝒙))`$
$`=\phi _i(𝒙)\phi _j(e_i^c(𝒙)).`$
The proof of the second identity is similar. Let us consider the third one. By similar calculation we have

$$\phi _i(e_j^d(𝒙))=\frac{\phi _{ij}(𝒙)+d\phi _{ji}(𝒙)}{d\phi _j(𝒙)},\phi _i(e_j^{cd}e_i^c(𝒙))=\frac{\phi _{ij}(𝒙)+d\phi _{ji}(𝒙)}{d}\times \frac{c\phi _i(𝒙)}{c\phi _{ij}(𝒙)+\phi _{ji}(𝒙)}.$$

Therefore the identity to be proved is written as

$$\frac{c^11}{\phi _i(𝒙)}+\frac{(d^11)d}{\phi _{ij}(𝒙)+d\phi _{ji}(𝒙)}\frac{c\phi _{ij}(𝒙)+\phi _{ji}(𝒙)}{c\phi _i(𝒙)}=\frac{((cd)^11)d\phi _j(𝒙)}{\phi _{ij}(𝒙)+d\phi _{ji}(𝒙)},$$

or equivalently

$$(c^11)(\phi _{ij}(𝒙)+d\phi _{ji}(𝒙))+(1d)(\phi _{ij}(𝒙)+c^1\phi _{ji}(𝒙))=(c^1d)\phi _i(𝒙)\phi _j(𝒙).$$

This equality holds since $`\phi _i(𝒙)\phi _j(𝒙)=\phi _{ij}(𝒙)+\phi _{ji}(𝒙)`$.

The proof of (3.36) is much simpler due to Lemma 2.9 (a) for the multiple product case. The proof is completed. ∎

We present an alternative proof of this theorem in appendix A.

## 4. Tropical $`R`$

### 4.1. Definition and basic properties

Let $`M(x,z)=A(x)+zB(x)+z^2C(x)`$ be the $`2n`$ by $`2n`$ matrix defined in the previous section. Consider the relation

(4.1)
$$M(x,z)M(y,z)=M(x^{},z)M(y^{},z).$$

Given $`x,y`$, we regard it as a system of simultaneous equations for the $`4n2`$ unknowns $`x^{},y^{}`$ containing a generic parameter $`z`$.

###### Theorem 4.1.

There is a unique solution of (4.1) under the constraints $`\mathrm{}(x)=\mathrm{}(y^{})\mathrm{}(y)=\mathrm{}(x^{})`$. The map $`(x,y)(x^{},y^{})`$ is a birational transformation.

###### Definition 4.2.

The unique solution $`(x^{},y^{})`$ of (4.1) specified in Theorem 4.1 is denoted by $`R(x,y)`$, and the birational transformation $`(x,y)R(x,y)`$ is called the tropical $`R`$ for the geometric $`D_n^{(1)}`$-crystal $``$.

In Theorem 4.1 uniqueness is immediate from Theorem 3.13. To show the existence, we introduce an explicit birational transformation $`\stackrel{~}{R}`$ in section 4.2. We then prove in section 4.3 that $`\stackrel{~}{R}`$ actually solves (4.1), hence $`R=\stackrel{~}{R}`$.

Here we exhibit basic properties of the tropical $`R`$ by assuming its existence. Let $`x=(x_1,\mathrm{},\overline{x}_1)`$ and $`y=(y_1,\mathrm{},\overline{y}_1)`$ be sets of variables for the geometric $`D_n^{(1)}`$-crystal $``$. On the pair $`(x,y)`$ we introduce mutually commuting involutive automorphisms:

(4.2)
$$(x,y)^{\sigma _1}=(x^{\sigma _1},y^{\sigma _1}),(x,y)^{\sigma _n}=(x^{\sigma _n},y^{\sigma _n}),(x,y)^{}=(x^{},y^{})$$

in terms of $`\sigma _1,\sigma _n`$ specified in (3.17) and (3.18). The automorphism $``$ is the only one that mixes $`x`$ and $`y`$ and defined as

(4.3) $``$ $`:x_i\overline{y}_i,\overline{x}_iy_i(1in1),x_ny_n.`$
###### Lemma 4.3.

Set

$$J_{}=E_{n,n}+E_{n+1,n+1}+\underset{i=1}{\overset{n1}{}}(E_{i,2n+1i}+E_{2n+1i,i}).$$

Then we have

$`J_{}^tM(y,z)J_{}=M(x^{},z),J_{}^tM(x,z)J_{}=M(y^{},z),`$
$`J_{}𝒟_1(y)J_{}=𝒟_2(x^{}),J_{}𝒟_1(x)J_{}=𝒟_2(y^{}).`$
###### Proof.

By noting that $`x^{}=\tau (y^{\sigma _n})`$, $`y^{}=\tau (x^{\sigma _n})`$, and $`J_{}=JJ_n`$, the first two relations follow from (3.28) and (3.29). The latter relations are derived by considering the 1st column of the former. ∎

Let us present basic properties of $`R`$.

###### Proposition 4.4.

(4.4) $`R((x,y)^{\sigma _1})`$ $`=(R(x,y))^{\sigma _1},`$
(4.5) $`R((x,y)^{\sigma _n})`$ $`=(R(x,y))^{\sigma _n},`$
(4.6) $`R((x,y)^{})`$ $`=(R(x,y))^{}.`$
###### Proof.

Write the left (resp. right) side of (4.4) as $`((x^{\sigma _1})^{},(y^{\sigma _1})^{})`$ (resp. $`((x^{})^{\sigma _1},(y^{})^{\sigma _1})`$). Then we have

$`M((x^{\sigma _1})^{},z)M((y^{\sigma _1})^{},z)`$ $`=M(x^{\sigma _1},z)M(y^{\sigma _1},z)`$
$`=J_1(z)M(x,z)M(y,z)J_1(z)`$
$`=J_1(z)M(x^{},z)M(y^{},z)J_1(z)`$
$`=M((x^{})^{\sigma _1},z)M((y^{})^{\sigma _1},z).`$
Here we have used Lemma 3.10. Due to Theorem 3.13 we have (4.4). (4.5) can be shown similarly. Write the left (resp. right) side of (4.6) as $`((x^{})^{},(y^{})^{})`$ (resp. $`((x^{})^{},(y^{})^{})`$). Then we have

$`M((x^{})^{},z)M((y^{})^{},z)`$ $`=M(x^{},z)M(y^{},z)`$
$`=J_{}^tM(y,z)^tM(x,z)J_{}`$
$`=J_{}^t(M(x,z)M(y,z))J_{}`$
$`=J_{}^t(M(x^{},z)M(y^{},z))J_{}`$
$`=J_{}^tM(y^{},z)^tM(x^{},z)J_{}`$
$`=M((x^{})^{},z)M((y^{})^{},z).`$
Here we have used Lemma 4.3. Again Theorem 3.13 implies (4.6). ∎

###### Proposition 4.5.

$`\epsilon _i(R(x,y))=\epsilon _i(x,y),\phi _i(R(x,y))=\phi _i(x,y)`$.

###### Proof.

For $`1in1`$, Lemma A.3 states that

$`\epsilon _i(x,y)`$ $`={\displaystyle \frac{(M(x,0)M(y,0))_{i+1,i}}{(M(x,0)M(y,0))_{i,i}}},`$
$`\phi _i(x,y)`$ $`={\displaystyle \frac{(M(x,0)M(y,0))_{i+1,i}}{(M(x,0)M(y,0))_{i+1,i+1}}},`$
hence the claim follows. The case $`i=0`$ is reduced to $`i=1`$ as

$`\epsilon _0(R(x,y))`$ $`=\epsilon _0((R(x^{\sigma _1},y^{\sigma _1}))^{\sigma _1})`$
$`=\epsilon _1(R(x^{\sigma _1},y^{\sigma _1}))`$
$`=\epsilon _1(x^{\sigma _1},y^{\sigma _1})`$
$`=\epsilon _0(x,y).`$
Here we have used Lemma 3.14 and Proposition 4.4. Similarly $`i=n`$ case follows from $`i=n1`$ case. ∎

###### Proposition 4.6.

$$e_i^cR=Re_i^c.$$

###### Proof.

For $`e_i^c(x,y)=(e_i^{c_1}(x),e_i^{c_2}(y))`$ we write

$$R(e_i^c(x,y))=((e_i^{c_1}(x))^{},(e_i^{c_2}(y))^{}),$$

and for $`R(x,y)=(x^{},y^{})`$,

$$e_i^c(R(x,y))=(e_i^{c_1^{}}(x^{}),e_i^{c_2^{}}(y^{})),$$

where $`c_1^{}=\frac{c\phi _i(x^{})+\epsilon _i(y^{})}{\phi _i(x^{})+\epsilon _i(y^{})},c_2^{}=\frac{\phi _i(x^{})+\epsilon _i(y^{})}{\phi _i(x^{})+c^1\epsilon _i(y^{})}.`$ By using Theorem 3.12 and Proposition 4.5 we have

$`M((e_i^{c_1}(x))^{},z)M((e_i^{c_2}(y))^{},z)=M(e_i^{c_1}(x),z)M(e_i^{c_2}(y),z)`$
$`=G_i\left({\displaystyle \frac{c1}{z^{\delta _{i0}}\epsilon _i(x,y)}}\right)M(x,z)M(y,z)G_i\left({\displaystyle \frac{c^11}{z^{\delta _{i0}}\phi _i(x,y)}}\right)`$
$`=G_i\left({\displaystyle \frac{c1}{z^{\delta _{i0}}\epsilon _i(x^{},y^{})}}\right)M(x^{},z)M(y^{},z)G_i\left({\displaystyle \frac{c^11}{z^{\delta _{i0}}\phi _i(x^{},y^{})}}\right)`$
$`=M(e_i^{c_1^{}}(x^{}),z)M(e_i^{c_2^{}}(y^{}),z).`$
Then Theorem 3.13 tells $`((e_i^{c_1}(x))^{},(e_i^{c_2}(y))^{})=(e_i^{c_1^{}}(x^{}),e_i^{c_2^{}}(y^{}))`$. ∎

###### Proposition 4.7.

$`R(R(x,y))=(x,y)`$.

###### Proof.

Writing $`R(x,y)=(x^{},y^{})`$ and $`R(x^{},y^{})=(x^{\prime \prime },y^{\prime \prime })`$, we get $`M(x,z)M(y,z)=M(x^{},z)M(y^{},z)=M(x^{\prime \prime },z)M(y^{\prime \prime },z)`$ by definition. Then $`(x,y)=(x^{\prime \prime },y^{\prime \prime })`$ owing to Theorem 3.13. ∎

Finally we prove the Yang-Baxter equation. Let $`\times \times `$ be the 3-fold product of the geometric $`D_n^{(1)}`$-crystal $``$. Denote by $`R_{12}`$ (resp. $`R_{23}`$) the birational map on $`\times \times `$ that acts on the first (resp. last) two components as $`R`$ and the other single component trivially.

###### Proposition 4.8.

We have $`R_{12}R_{23}R_{12}=R_{23}R_{12}R_{23}`$ as a birational map on $`\times \times `$.

###### Proof.

Let $`(x^1,x^2,x^3)\times \times `$. Writing $`(u^1,u^2,u^3)=R_{12}R_{23}R_{12}(x^1,x^2,x^3)`$ and $`(v^1,v^2,v^3)=R_{23}R_{12}R_{23}(x^1,x^2,x^3)`$, one has

$`M(u^1,z)M(u^2,z)M(u^3,z)`$ $`=M(x^1,z)M(x^2,z)M(x^3,z)`$
$`=M(v^1,z)M(v^2,z)M(v^3,z).`$
Thus $`(u^1,u^2,u^3)=(v^1,v^2,v^3)`$ follows from Theorem 3.13. ∎

### 4.2. Birational map $`\stackrel{~}{R}`$

Let $`V_0=(A(x)A(y))_{2n,1}`$. Explicitly we have

(4.7) $`V_0`$ $`=\mathrm{}(x){\displaystyle \frac{y_1}{\overline{y}_1}}+\mathrm{}(x){\displaystyle \underset{m=2}{\overset{n1}{}}}\left({\displaystyle \underset{i=1}{\overset{m1}{}}}{\displaystyle \frac{y_i}{x_i}}\right)\left(1+{\displaystyle \frac{y_m}{\overline{y}_m}}\right)+\left({\displaystyle \underset{i=1}{\overset{n1}{}}}\overline{x}_iy_i\right)x_ny_n`$
$`+\mathrm{}(y){\displaystyle \frac{\overline{x}_1}{x_1}}+\mathrm{}(y){\displaystyle \underset{m=2}{\overset{n1}{}}}\left({\displaystyle \underset{i=1}{\overset{m1}{}}}{\displaystyle \frac{\overline{x}_i}{\overline{y}_i}}\right)\left(1+{\displaystyle \frac{\overline{x}_m}{x_m}}\right)+\left({\displaystyle \underset{i=1}{\overset{n1}{}}}\overline{x}_iy_i\right).`$
Define $`V_i(1in1)`$ by

(4.8) $`V_i={\displaystyle \frac{\overline{y}_i}{\overline{x}_i}}V_{i1}+(\mathrm{}(x)\mathrm{}(y))\left(1+{\displaystyle \frac{\overline{y}_i}{x_i}}\right),(1in2)`$
(4.9) $`V_{n1}={\displaystyle \frac{\overline{y}_{n1}}{\overline{x}_{n1}}}V_{n2}+(\mathrm{}(x)\mathrm{}(y))\left({\displaystyle \frac{1}{y_n}}+{\displaystyle \frac{\overline{y}_{n1}}{x_{n1}}}\right).`$
Define $`W_i(1in1)`$ by

(4.10) $`W_i=V_iV_i^{}+(\mathrm{}(y)\mathrm{}(x))V_i^{}+(\mathrm{}(x)\mathrm{}(y))V_i,(1in2)`$
(4.11) $`W_{n1}=V_{n1}V_{n1}^{}.`$
Here $`V_i^{}=V_i((x,y)^{})`$, and similar notations will be used for $`\sigma _1,\sigma _n`$ from now on.

###### Definition 4.9.

A rational transformation specified below is denoted by $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$:

$`x_1^{}=y_1{\displaystyle \frac{V_0^{\sigma _1}}{V_1}},\overline{x}_1^{}=\overline{y}_1{\displaystyle \frac{V_0}{V_1}},`$
$`x_i^{}=y_i{\displaystyle \frac{V_{i1}W_i}{V_iW_{i1}}},\overline{x}_i^{}=\overline{y}_i{\displaystyle \frac{V_{i1}}{V_i}},(2in1)`$
$`x_n^{}=y_n{\displaystyle \frac{V_{n1}}{V_{n1}^{}}},`$
$`y_1^{}=x_1{\displaystyle \frac{V_0}{V_1^{}}},\overline{y}_1^{}=\overline{x}_1{\displaystyle \frac{V_0^{\sigma _1}}{V_1^{}}},`$
$`y_i^{}=x_i{\displaystyle \frac{V_{i1}^{}}{V_i^{}}},\overline{y}_i^{}=\overline{x}_i{\displaystyle \frac{V_{i1}^{}W_i}{V_i^{}W_{i1}}},(2in1)`$
$`y_n^{}=x_n{\displaystyle \frac{V_{n1}^{}}{V_{n1}}}.`$
To provide an explicit formula for $`V_i`$’s, we introduce

$`\theta _{i,j}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x){\displaystyle \underset{k=j+1}{\overset{i}{}}}{\displaystyle \frac{\overline{y}_k}{\overline{x}_k}}\hfill & \text{for}1ji,\hfill \\ \mathrm{}(y){\displaystyle \underset{k=i+1}{\overset{j}{}}}{\displaystyle \frac{\overline{x}_k}{\overline{y}_k}}\hfill & \text{for}i+1jn2,\hfill \end{array}`$
$`\theta _{i,j}^{}(x,y)`$ $`=\mathrm{}(x)\left({\displaystyle \underset{k=1}{\overset{i}{}}}{\displaystyle \frac{\overline{y}_k}{\overline{x}_k}}\right)\left({\displaystyle \underset{k=1}{\overset{j}{}}}{\displaystyle \frac{y_k}{x_k}}\right)\text{for}j=1,\mathrm{},n2,`$
$`\eta _{i,j}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x)\left({\displaystyle \underset{k=j+1}{\overset{i}{}}}{\displaystyle \frac{\overline{y}_k}{\overline{x}_k}}\right)\left({\displaystyle \frac{\overline{y}_j}{x_j}}\right)\hfill & \text{for}1ji,\hfill \\ \mathrm{}(y)\left({\displaystyle \underset{k=i+1}{\overset{j}{}}}{\displaystyle \frac{\overline{x}_k}{\overline{y}_k}}\right)\left({\displaystyle \frac{\overline{y}_j}{x_j}}\right)\hfill & \text{for}i+1jn1,\hfill \\ \mathrm{}(y)\left({\displaystyle \underset{k=i+1}{\overset{n1}{}}}{\displaystyle \frac{\overline{x}_k}{\overline{y}_k}}\right)x_n\hfill & \text{for}j=n,\hfill \end{array}`$
$`\eta _{i,j}^{}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x)\left({\displaystyle \underset{k=1}{\overset{i}{}}}{\displaystyle \frac{\overline{y}_k}{\overline{x}_k}}\right)\left({\displaystyle \underset{k=1}{\overset{j}{}}}{\displaystyle \frac{y_k}{x_k}}\right)\left({\displaystyle \frac{x_j}{\overline{y}_j}}\right)\text{for}1jn1,\hfill & \\ \mathrm{}(x)\left({\displaystyle \frac{\mathrm{}(x)}{\mathrm{}(y)}}\right)^{\delta _{i,n1}}\left({\displaystyle \underset{k=1}{\overset{i}{}}}{\displaystyle \frac{\overline{y}_k}{\overline{x}_k}}\right)\left({\displaystyle \underset{k=1}{\overset{n1}{}}}{\displaystyle \frac{y_k}{x_k}}\right)\left({\displaystyle \frac{1}{x_n}}\right)\text{for}j=n.\hfill & \end{array}`$
###### Proposition 4.10.

For $`0in1`$ one has

$$V_i=\underset{j=1}{\overset{n2}{}}\left(\theta _{i,j}(x,y)+\theta _{i,j}^{}(x,y)\right)+\underset{j=1}{\overset{n}{}}\left(\eta _{i,j}(x,y)+\eta _{i,j}^{}(x,y)\right).$$

###### Proof.

For $`i=0`$ the above expression agrees with (4.7). Note that $`\eta _{0,n}(x,y)=\left(_{i=1}^{n1}\overline{x}_iy_i\right)x_ny_n`$ and $`\eta _{0,n}^{}(x,y)=\left(_{i=1}^{n1}\overline{x}_iy_i\right)`$. For $`1in2`$ the recursion relation (4.8) is valid since the nonzero contribution to the difference $`V_iV_{i1}\overline{y}_i/\overline{x}_i`$ only comes from $`\theta _{i,i}(x,y)\frac{\overline{y}_i}{\overline{x}_i}\theta _{i1,i}(x,y)=\mathrm{}(x)\mathrm{}(y)`$ and $`\eta _{i,i}(x,y)\frac{\overline{y}_i}{\overline{x}_i}\eta _{i1,i}(x,y)=(\mathrm{}(x)\mathrm{}(y))\frac{\overline{y}_i}{x_i}`$. Similarly (4.9) is checked by $`\eta _{n1,n1}(x,y)\frac{\overline{y}_{n1}}{\overline{x}_{n1}}\eta _{n2,n1}(x,y)=(\mathrm{}(x)\mathrm{}(y))\frac{\overline{y}_{n1}}{x_{n1}}`$ and $`\eta _{n1,n}^{}(x,y)\frac{\overline{y}_{n1}}{\overline{x}_{n1}}\eta _{n2,n}^{}(x,y)=(\mathrm{}(x)\mathrm{}(y))\frac{1}{y_n}`$. ∎

Proposition 4.10 with $`i=n1`$ reads

(4.12) $`V_{n1}`$ $`=x_1y_1x_n\left({\displaystyle \underset{m=2}{\overset{n1}{}}}x_m\overline{y}_m\right)+\mathrm{}(y){\displaystyle \underset{m=2}{\overset{n1}{}}}\left({\displaystyle \underset{i=m}{\overset{n}{}}}{\displaystyle \frac{x_i}{y_i}}\right)\left(1+{\displaystyle \frac{y_m}{\overline{y}_m}}\right)+\mathrm{}(y)x_n`$
$`+\overline{x}_1\overline{y}_1x_n\left({\displaystyle \underset{m=2}{\overset{n1}{}}}x_m\overline{y}_m\right)+\mathrm{}(x){\displaystyle \underset{m=2}{\overset{n1}{}}}\left({\displaystyle \underset{i=m}{\overset{n1}{}}}{\displaystyle \frac{\overline{y}_i}{\overline{x}_i}}\right)\left(1+{\displaystyle \frac{\overline{x}_m}{x_m}}\right)+\mathrm{}(x){\displaystyle \frac{1}{y_n}},`$
from which $`V_{n1}=V_{n1}^{\sigma _1}=(V_{n1}^{})^{\sigma _n}`$ is easily seen. Similarly from (4.7) one finds $`V_0=V_0^{\sigma _n}=V_0^{}`$. Starting from these properties one can use (4.8)–(4.11) to figure out the transformation property of $`V_i,W_i`$ under the commuting automorphisms $`\sigma _1,\sigma _n`$ and $``$. The result is summarized in

The transformation properties under $`\stackrel{~}{R}`$ will be shown in Lemma 4.17.

###### Proposition 4.11.

(4.13) $`\stackrel{~}{R}((x,y)^{\sigma _1})`$ $`=(\stackrel{~}{R}(x,y))^{\sigma _1},`$
(4.14) $`\stackrel{~}{R}((x,y)^{\sigma _n})`$ $`=(\stackrel{~}{R}(x,y))^{\sigma _n},`$
(4.15) $`\stackrel{~}{R}((x,y)^{})`$ $`=(\stackrel{~}{R}(x,y))^{}.`$
###### Proof.

Apply Table 1 to Definition 4.9. ∎

###### Lemma 4.12.

$`W_1=V_0V_0^{\sigma _1}`$.

###### Proof.

Consider the identities $`V_0=\frac{\overline{x}_1}{\overline{y}_1}V_1+(\mathrm{}(y)\mathrm{}(x))\frac{\overline{x}_1}{\overline{y}_1}\left(1+\frac{\overline{y}_1}{x_1}\right),`$ $`V_0^{\sigma _1}=\frac{\overline{y}_1}{\overline{x}_1}V_1^{}+(\mathrm{}(x)\mathrm{}(y))\frac{\overline{y}_1}{\overline{x}_1}\left(1+\frac{\overline{x}_1}{y_1}\right),`$ which are equivalent to (4.8) and $`\sigma _1`$ of (4.8) with $`i=1`$. Thus we obtain $`V_0V_0^{\sigma _1}V_1V_1^{}(\mathrm{}(y)\mathrm{}(x))V_1^{}(\mathrm{}(x)\mathrm{}(y))V_1=(\mathrm{}(y)\mathrm{}(x))\frac{\overline{y}_1}{x_1}V_1^{}+(\mathrm{}(x)\mathrm{}(y))\frac{\overline{x}_1}{y_1}V_1(\mathrm{}(x)\mathrm{}(y))^2\left(1+\frac{\overline{y}_1}{x_1}\right)\left(1+\frac{\overline{x}_1}{y_1}\right).`$ The right hand side vanishes due to (4.8) and $``$ of (4.8) for $`i=1`$. ∎

###### Lemma 4.13.

(4.16)
$$W_i=\frac{x_i\overline{y}_i}{\overline{x}_iy_i}V_{i1}V_{i1}^{}+(\mathrm{}(x)\mathrm{}(y))\frac{\overline{y}_i}{y_i}V_{i1}^{}+(\mathrm{}(y)\mathrm{}(x))\frac{x_i}{\overline{x}_i}V_{i1},$$

for $`1in1`$.

###### Proof.

For $`i=1`$ this relation reduces to $`V_0^{\sigma _1}=\frac{x_1\overline{y}_1}{\overline{x}_1y_1}+(\mathrm{}(x)\mathrm{}(y))\frac{\overline{y}_1}{y_1}+(\mathrm{}(y)\mathrm{}(x))\frac{x_1}{\overline{x}_1},`$ which follows from (4.8) and $`\sigma _1`$ of (4.8) with $`i=1`$. For $`2in2`$ the relation is shown by substituting (4.8) and $``$ of (4.8) into (4.10). Next consider $`i=n1`$ case. From (4.9) and $``$ of (4.9) one has $`\text{LHS}\text{RHS}=(\mathrm{}(x)\mathrm{}(y))\frac{x_{n1}}{y_{n1}y_n}V_{n2}^{}+(\mathrm{}(y)\mathrm{}(x))\frac{\overline{y}_{n1}}{\overline{x}_{n1}x_n}V_{n2}(\mathrm{}(x)\mathrm{}(y))^2\left(1+\frac{x_{n1}}{\overline{y}_{n1}y_n}\right)\left(1+\frac{\overline{y}_{n1}}{x_{n1}x_n}\right).`$ The right hand side vanishes because of (4.9) and $`\sigma _n`$ of (4.9). ∎

###### Lemma 4.14.

(4.17)
$$\left(\frac{1}{x_i}+\frac{1}{\overline{y}_i}\right)W_i=\frac{1}{y_i}V_iV_{i1}^{}+\frac{1}{\overline{x}_i}V_{i1}V_i^{}(1in2).$$

###### Proof.

For $`i=1`$ this relation reduces to $`\left(\frac{1}{x_1}+\frac{1}{\overline{y}_1}\right)V_0^{\sigma _1}=\frac{V_1^{}}{\overline{x}_1}+\frac{V_1}{y_1},`$ which follows from $`\sigma _1`$ of (4.8) and $`\sigma _1`$ of (4.8) with $`i=1`$. To see the other cases, substitute (4.8) and $``$ of (4.8) into the right hand side of (4.17). The result is the right hand side of (4.16) multiplied by $`\left(\frac{1}{x_i}+\frac{1}{\overline{y}_i}\right)`$. ∎

###### Remark 4.15.

We call a rational function subtraction-free, if its denominator and numerator are polynomials with nonnegative coefficients. From Proposition 4.10, Lemma 4.12, 4.14 and (4.11), all the functions $`V_i,W_i`$ appearing in Definition 4.9 are subtraction-free Laurent polynomials in $`x,y`$. Thus $`\stackrel{~}{R}`$ is also subtraction-free. This property will be used in section 4.5.

###### Proposition 4.16.

$`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ solves the equation $`A(x)A(y)=A(x^{})A(y^{})`$.

A proof by a direct but lengthy calculation is available in appendix B.

###### Lemma 4.17.

$`V_0,V_0^{\sigma _1},V_{n1},V_{n1}^{},W_i(1in1)`$ are invariant under $`\stackrel{~}{R}`$. $`\stackrel{~}{R}`$ acts as $`V_iW_i/V_i^{}`$ and $`V_i^{}W_i/V_i(1in1)`$.

###### Proof.

Proposition 4.16 tells that $`V_0=(A(x)A(y))_{2n,1}`$ is invariant. Then Proposition 4.11 tells $`V_0^{\sigma _1}`$ and thereby $`W_1=V_0V_0^{\sigma _1}`$ are also invariant. Consider $`V_1`$ and $`V_1^{}`$. By applying $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ to (4.8) with $`i=1`$ we have $`\stackrel{~}{R}(V_1)=\frac{\overline{y}_1^{}}{\overline{x}_1^{}}V_0+(\mathrm{}(x^{})\mathrm{}(y^{}))\left(1+\frac{\overline{y}_1^{}}{x_1^{}}\right)=\frac{V_0^{\sigma _1}}{V_1^{}}\left[\frac{\overline{x}_1}{\overline{y}_1}V_1+(\mathrm{}(y)\mathrm{}(x))\frac{\overline{x}_1}{V_0^{\sigma _1}}\left(\frac{V_1^{}}{\overline{x}_1}+\frac{V_1}{y_1}\right)\right].`$ By substituting (4.17) and (4.8) with $`i=1`$ into its right hand side we find $`\stackrel{~}{R}(V_1)=V_0^{\sigma _1}V_0/V_1^{}=W_1/V_1^{}`$. Hence by Proposition 4.11 we also have $`\stackrel{~}{R}(V_1^{})=W_1/V_1`$.

The claim for $`V_i`$ and $`V_i^{}`$ with $`2in2`$ is proved by induction on $`i`$. Suppose that the claim is true for $`V_{i1}`$. By applying $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ to (4.8) we have $`\stackrel{~}{R}(V_i)=\frac{\overline{y}_i^{}}{\overline{x}_i^{}}\frac{W_{i1}}{V_{i1}^{}}+(\mathrm{}(x^{})\mathrm{}(y^{}))(1+\frac{\overline{y}_i^{}}{x_i^{}})=\frac{W_i}{V_{i1}V_i^{}}[\frac{\overline{x}_i}{\overline{y}_i}V_i+(\mathrm{}(y)\mathrm{}(x))\frac{\overline{x}_i}{W_i}(\frac{V_{i1}V_i^{}}{\overline{x}_i}`$

$`+\frac{V_{i1}^{}V_i}{y_i})].`$ By substituting (4.17) and (4.8) into the right hand side we obtain $`\stackrel{~}{R}(V_i)=W_i/V_i^{}`$. Hence by Proposition 4.11 we also have $`\stackrel{~}{R}(V_i^{})=W_i/V_i`$ for $`2in2`$.

Let us consider $`W_i`$ for $`2in1`$. By applying $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ to (4.16) we have $`\stackrel{~}{R}(W_i)=\frac{y_i\overline{x}_i}{\overline{y}_ix_i}\frac{(W_i)^2}{V_{i1}V_{i1}^{}}+(\mathrm{}(y)\mathrm{}(x))\frac{\overline{x}_i}{x_i}\frac{W_i}{V_{i1}}+(\mathrm{}(x)\mathrm{}(y))\frac{y_i}{\overline{y}_i}\frac{W_i}{V_{i1}^{}}.`$ Dividing both hand sides by $`W_i`$ and substituting (4.16) into the right hand side we find $`\stackrel{~}{R}(W_i)/W_i=1`$ for $`2in1`$.

From (4.9) and its $`\sigma _n`$, the identity $`V_{n1}\left(\frac{1}{x_{n1}x_n}+\frac{1}{\overline{y}_{n1}}\right)=\frac{V_{n2}}{\overline{x}_{n1}}+\frac{V_{n2}^{}}{y_{n1}y_n}`$ can be derived. Applying $`\stackrel{~}{R}`$ to this and using the identity once again we get $`\stackrel{~}{R}(V_{n1})=V_{n1}`$. The $`\stackrel{~}{R}`$ also leaves $`V_{n1}^{}`$ invariant since $`\stackrel{~}{R}`$ and $``$ are commutative. ∎

###### Remark 4.18.

From the explicit formulas (4.7) and (4.12) we find that $`V_0^{\sigma _1}=(A(x)C(y))_{1,2n}+(B(x)B(y))_{1,2n}+(C(x)A(y))_{1,2n}`$, $`V_{n1}=(A(x)B(y))_{n,n+1}+(B(x)A(y))_{n,n+1}`$, and $`V_{n1}^{}=(A(x)B(y))_{n+1,n}+(B(x)A(y))_{n+1,n}`$. Therefore they are invariant under the tropical $`R`$, and thus should be so also under $`\stackrel{~}{R}`$.

###### Proposition 4.19.

$`\stackrel{~}{R}(\stackrel{~}{R}(x,y))=(x,y).`$

###### Proof.

Let us illustrate the $`x_2`$ case. The other cases are similar. Under $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ $`x_2`$ becomes $`x_2^{}=y_2V_1W_2/(V_2W_1)`$. By applying it once again it changes into $`y_2^{}\frac{R(V_1)R(W_2)}{R(V_2)R(W_1)}=x_2\frac{V_1^{}}{V_2^{}}\frac{(W_1/V_1^{})W_2}{(W_2/V_2^{})W_1}=x_2.`$

Proposition 4.19 is the inversion relation of $`\stackrel{~}{R}`$, and will play a role in the proof of Lemma 4.25.

Set

(4.18)
$$\stackrel{~}{V}_j=\frac{1}{V_j^{}}\left(W_j+\frac{\overline{x}_{j+1}}{x_{j+1}}W_{j+1}\right),(1jn2).$$

###### Lemma 4.20.

$`\stackrel{~}{V}_1`$ $`=`$ $`V_0{\displaystyle \frac{\overline{y}_1}{\overline{x}_1}}\overline{Y}_2+(\mathrm{}(x)\mathrm{}(y))\left[{\displaystyle \frac{\overline{y}_2}{y_2}}\overline{X}_2+{\displaystyle \frac{\overline{y}_1}{x_1}}\overline{Y}_2\right],`$
$`\stackrel{~}{V}_j`$ $`=`$ $`\stackrel{~}{V}_{j1}{\displaystyle \frac{\overline{y}_j}{\overline{x}_j}}{\displaystyle \frac{\overline{Y}_{j+1}}{\overline{Y}_j}}+(\mathrm{}(x)\mathrm{}(y))\left[{\displaystyle \frac{\overline{y}_{j+1}}{y_{j+1}}}\overline{X}_{j+1}+{\displaystyle \frac{\overline{y}_j}{\overline{x}_j}}{\displaystyle \frac{\overline{X}_j}{\overline{Y}_j}}\overline{Y}_{j+1}\right],`$
$`(2jn2)`$
where $`\overline{X}_i=1+\overline{x}_i/x_i`$, $`\overline{Y}_i=1+\overline{y}_i/y_i`$ for $`1in1`$.

###### Proof.

From (4.10) and (4.16) we get

$$\stackrel{~}{V}_j=\overline{Y}_{j+1}V_j+(\mathrm{}(x)\mathrm{}(y))\left(\frac{\overline{x}_{j+1}\overline{y}_{j+1}}{x_{j+1}y_{j+1}}1\right).$$

This allows us to write $`V_j`$ in terms of $`\stackrel{~}{V}_j`$. Substitution of them into (4.8) leads to the desired relations. ∎

###### Remark 4.21.

The equation (4.18) gives an alternative definition of $`W_j`$’s in terms of $`\stackrel{~}{V}_j`$’s. Given $`W_1`$ and $`\stackrel{~}{V}_j`$’s one can determine all the other $`W_j`$’s from (4.18). This fact will be used in the proof of Lemma 4.23.

### 4.3. Proof of Theorem 4.1

As mentioned after Definition 4.2, Theorem 4.1 is established at the same time with the explicit form $`R=\stackrel{~}{R}`$ once it is shown that $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$ solves the defining equation (4.1) of the tropical $`R`$. In view of $`B(x)C(y)+C(x)B(y)=C(x)C(y)=O`$, we have the expansion

$`M(x,z)M(y,z)`$ $`=A(x)A(y)+z(A(x)B(y)+B(x)A(y))`$
$`+z^2(A(x)C(y)+B(x)B(y)+C(x)A(y)).`$
Since the equation (4.1) is quadratic with respect to $`z`$, it suffices to check it for three distinct values of $`z`$. We have already done it at $`z=0`$ in Proposition 4.16. In what follows we treat the cases $`z=\mathrm{}(x)^1`$ and $`z=\mathrm{}(y)^1`$.

Let us put $`z=\mathrm{}(x)^1=\mathrm{}(y^{})^1`$ in (4.1). Proposition 3.4 leads to

(4.19)
$$P𝒟_1(x)M(y,\mathrm{}(x)^1)𝒟_1(y^{})^1=𝒟_2(x)^1M(x^{},\mathrm{}(x)^1)𝒟_2(y^{})P.$$

Thus the both sides is a scalar multiple of $`P`$. Denoting the scalar by $`\alpha `$ we see that (4.19) is equivalent to the simultaneous equations

(4.20) $`P𝒟_1(x)M(y,\mathrm{}(x)^1)=\alpha P𝒟_1(y^{}),`$
(4.21) $`M(x^{},\mathrm{}(x)^1)𝒟_2(y^{})P=\alpha 𝒟_2(x)P.`$
Equation (4.21) will be considered later (Lemma 4.25).

###### Lemma 4.22.

The following $`y_i^{}`$’s and $`\overline{y}_i^{}`$’s solve the equation (4.20).

(4.22) $`y_i^{}={\displaystyle \frac{Q_i}{Q_{i+1}}}(1in),\overline{y}_1^{}=\mathrm{}(x){\displaystyle \frac{Q_{2n}}{Q_2}},`$
(4.23) $`{\displaystyle \frac{\overline{y}_i^{}}{y_i^{}}}={\displaystyle \frac{_{k=1}^i(1)^kQ_kQ_{2n+1k}}{_{k=1}^{i1}(1)^kQ_kQ_{2n+1k}}},(2in1)`$
where $`Q_i=(A(x)M(y,\mathrm{}(x)^1))_{2n,i}`$.

###### Proof.

All elements in the $`i`$th column of the LHS (resp. RHS) of (4.20) are equal to $`Q_i`$ (resp. $`\alpha A(y^{})_{2n,i}`$). Considering the first column fixes the scalar as $`\alpha =Q_1/A(y^{})_{2n,1}=Q_1/\mathrm{}(x)`$. Taking the ratios of the $`i`$th and the $`i+1`$th column for $`1in`$ leads to $`y_i^{}=\frac{Q_i}{Q_{i+1}}`$. Similarly the second column and the last column imply $`\overline{y}_1^{}=\mathrm{}(x)\frac{Q_{2n}}{Q_2}`$, and the $`(2n1)`$th column does $`Q_{2n1}=\alpha \left(1+\frac{\overline{y}_2^{}}{y_2^{}}\right)\overline{y}_1^{}=\left(1+\frac{\overline{y}_2^{}}{y_2^{}}\right)\frac{Q_1Q_{2n}}{Q_2}`$. Therefore we have $`1+\frac{\overline{y}_2^{}}{y_2^{}}=\frac{Q_2Q_{2n1}}{Q_1Q_{2n}}`$ or equivalently (4.23) for $`i=2`$. Now let us show

(4.24)
$$1+\frac{\overline{y}_i^{}}{y_i^{}}=(1)^{i+1}\frac{Q_iQ_{2n+1i}}{_{k=1}^{i1}(1)^kQ_kQ_{2n+1k}},$$

or equivalently (4.23) for $`3in1`$. This claim is checked by induction on $`i`$. We have already shown $`i=2`$ case. Assume the identity (4.23) with $`i`$ replaced by $`i1`$. Then we have

$$\frac{Q_{2n+1i}}{Q_{2n+2i}}=\frac{\left(1+\frac{\overline{y}_i^{}}{y_i^{}}\right)\frac{\overline{y}_{i1}^{}}{y_{i1}^{}}}{\left(1+\frac{\overline{y}_{i1}^{}}{y_{i1}^{}}\right)}y_{i1}^{}=\frac{\left(1+\frac{\overline{y}_i^{}}{y_i^{}}\right)_{k=1}^{i1}(1)^kQ_kQ_{2n+1k}}{(1)^{i+1}Q_{i1}Q_{2n+2i}}\frac{Q_{i1}}{Q_i},$$

which is equivalent to (4.24). ∎

###### Lemma 4.23.

The $`y_i^{}`$’s and $`\overline{y}_i^{}`$’s specified in Lemma 4.22 coincide with those given by $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ in Definition 4.9.

###### Proof.

Set

$`{}_{}{}^{\mathrm{}}V_{0}^{}=Q_1,^{\mathrm{}}V_i^{}=x_1\mathrm{}x_iQ_{i+1}(1in1),`$
$`{}_{}{}^{\mathrm{}}V_{n1}^{}=x_1\mathrm{}x_{n1}x_nQ_{n+1},^{\mathrm{}}V_0^{\sigma _1}=\mathrm{}(x){\displaystyle \frac{x_1}{\overline{x}_1}}Q_{2n},`$
$`{}_{}{}^{\mathrm{}}W_{i}^{}=\mathrm{}(x){\displaystyle \frac{x_1\mathrm{}x_i}{\overline{x}_1\mathrm{}\overline{x}_i}}(1)^i{\displaystyle \underset{k=1}{\overset{i}{}}}(1)^kQ_kQ_{2n+1k}(1in1).`$
We show that these quantities coincide with the same symbols without .

First note $`{}_{}{}^{\mathrm{}}V_{0}^{}=(A(x)A(y))_{2n,1}=V_0`$ from (4.7). It is not difficult to see that $`{}_{}{}^{\mathrm{}}V_{0}^{}`$, $`{}_{}{}^{\mathrm{}}V_{0}^{\sigma _1}`$, $`{}_{}{}^{\mathrm{}}V_{i}^{}`$, and $`{}_{}{}^{\mathrm{}}V_{n1}^{}`$ satisfy the same recursion relations as those without . For instance consider

$${}_{}{}^{\mathrm{}}V_{i}^{}\frac{x_i}{y_i}^{\mathrm{}}V_{i1}^{}=x_1\mathrm{}x_i\underset{k=1}{\overset{2n}{}}A(x)_{2n,k}\left[M(y,\mathrm{}(x)^1)_{k,i+1}\frac{M(y,\mathrm{}(x)^1)_{k,i}}{y_i}\right].$$

By using (3.5) and $`A(x)_{2n,i}=\mathrm{}(x)/(x_1\mathrm{}x_{i1})`$, this becomes

$${}_{}{}^{\mathrm{}}V_{i}^{}=\frac{x_i}{y_i}^{\mathrm{}}V_{i1}^{}+(\mathrm{}(y)\mathrm{}(x))\left(1+\frac{x_i}{\overline{y}_i}\right),$$

which is $``$ of (4.8). The other cases are similar. Note that $`V_0^{\sigma _1}`$ is related to $`V_1^{}`$ by $`\sigma _1`$ of (4.8) and $`V_{n1}`$ to $`V_{n2}^{}`$ by $`\sigma _n`$ of (4.9). By repeated use of the recursion relations, $`{}_{}{}^{\mathrm{}}V_{0}^{\sigma _1}`$, $`{}_{}{}^{\mathrm{}}V_{i}^{}`$’s and $`{}_{}{}^{\mathrm{}}V_{n1}^{}`$ are related to $`{}_{}{}^{\mathrm{}}V_{0}^{}`$ in the same way as those without  are to $`V_0`$, proving the coincidence.

So far we have considered $`{}_{}{}^{\mathrm{}}V_{0}^{}`$, $`{}_{}{}^{\mathrm{}}V_{0}^{\sigma _1}`$, $`{}_{}{}^{\mathrm{}}V_{i}^{}`$, and $`{}_{}{}^{\mathrm{}}V_{n1}^{}`$. Next we treat $`{}_{}{}^{\mathrm{}}W_{i}^{}`$. Note $`{}_{}{}^{\mathrm{}}W_{1}^{}=^{\mathrm{}}V_0^{\mathrm{}}V_0^{\sigma _1}=V_0V_0^{\sigma _1}=W_1`$. To verify $`{}_{}{}^{\mathrm{}}W_{i}^{}=W_i`$ for $`i2`$ we define $`{}_{}{}^{\mathrm{}}\stackrel{~}{V}_{j}^{}=\frac{\mathrm{}(x)}{\overline{x}_1\mathrm{}\overline{x}_j}Q_{2nj}`$ for $`1jn2`$. Then

$${}_{}{}^{\mathrm{}}\stackrel{~}{V}_{j}^{}=\frac{1}{{}_{}{}^{\mathrm{}}V_{j}^{}}\left({}_{}{}^{\mathrm{}}W_{j}^{}+\frac{\overline{x}_{j+1}}{x_{j+1}}^{\mathrm{}}W_{j+1}\right)$$

holds for $`1jn2`$. This is (4.18). Since we have already shown $`{}_{}{}^{\mathrm{}}W_{1}^{}=W_1`$ and $`{}_{}{}^{\mathrm{}}V_{j}^{}=V_j^{}`$, it suffices to show $`{}_{}{}^{\mathrm{}}\stackrel{~}{V}_{j}^{}=\stackrel{~}{V}_j`$ to verify $`{}_{}{}^{\mathrm{}}W_{i}^{}=W_i`$ for $`i2`$. (See Remark 4.21.) Thus it remains to check that $`{}_{}{}^{\mathrm{}}V_{0}^{}`$ and $`{}_{}{}^{\mathrm{}}\stackrel{~}{V}_{j}^{}`$’s satisfy the recursion relations in Lemma 4.20. For instance consider

$${}_{}{}^{\mathrm{}}\stackrel{~}{V}_{j}^{}^{\mathrm{}}\stackrel{~}{V}_{j1}\frac{\overline{y}_j}{\overline{x}_j}\frac{\overline{Y}_{i+1}}{\overline{Y}_i}=\frac{\mathrm{}(x)}{\overline{x}_1\mathrm{}\overline{x}_j}\underset{k=1}{\overset{2n}{}}A(x)_{2n,k}(y,\mathrm{}(x)^1)_{k,j},$$

where $`(y,z)_{k,j}=M(y,z)_{k,2nj}\overline{y}_j\frac{\overline{Y}_{i+1}}{\overline{Y}_i}M(y,z)_{k,2n+1j}.`$ By using (3.10) and $`A(x)_{2n,2n+1j}=\overline{x}_1\mathrm{}\overline{x}_{j1}\left(1+\overline{x}_j/x_j\right)`$ we obtain the desired relation. ∎

Let us proceed to $`z=\mathrm{}(y)^1`$ case. Setting $`z=\mathrm{}(y)^1=\mathrm{}(x^{})^1`$ in (4.1) leads to

(4.25)
$$𝒟_2(x^{})^1M(x,\mathrm{}(y)^1)𝒟_2(y)P=P𝒟_1(x^{})M(y^{},\mathrm{}(y)^1)𝒟_1(y)^1.$$

As (4.19), (4.25) is equivalent to the simultaneous equations

(4.26) $`M(x,\mathrm{}(y)^1)𝒟_2(y)P=\beta 𝒟_2(x^{})P,`$
(4.27) $`P𝒟_1(x^{})M(y^{},\mathrm{}(y)^1)=\beta P𝒟_1(y)`$
for some scalar $`\beta `$. Equation (4.27) will be considered later (Lemma 4.25).

###### Lemma 4.24.

The relation $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ solves the equation (4.26) with $`\beta =Q_1^{}/\mathrm{}(y)`$.

###### Proof.

Take the transposition of (4.20) and multiply $`J_{}`$’s from the both sides. Due to Lemma 4.3 the result becomes

$$M(x^{},\mathrm{}(x)^1)𝒟_2(y^{})P=\alpha 𝒟_2((x^{})^{})P.$$

From Proposition 4.11 we know $`(x^{})^{}=(x^{})^{}`$. Thus replacing $`(x,y)`$ with $`(x,y)^{}`$ in this relation yields (4.26). ∎

###### Lemma 4.25.

The relation $`\stackrel{~}{R}(x,y)=(x^{},y^{})`$ also solves (4.21) with $`\alpha =V_0/\mathrm{}(x)`$ and (4.27) with $`\beta =V_0/\mathrm{}(y)`$.

###### Proof.

Recall $`Q_1=Q_1^{}=V_0`$ and its invariance under $`\stackrel{~}{R}`$ (Lemma 4.17). Due to Proposition 4.19 we can exchange $`(x,y)`$ with $`(x^{},y^{})`$ in (4.20) and (4.26), which become (4.27) and (4.21), respectively. Then the claim follows from Lemmas 4.23 and 4.24. ∎

###### Proof of Theorem 4.1.

Lemmas 4.22, 4.23, 4.24, and 4.25 establish that $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$ solves the equation (4.1) at $`z=\mathrm{}(x)^1`$ and $`\mathrm{}(y)^1`$. With the $`z=0`$ case verified in Proposition 4.16, we conclude that it solves (4.1) for any $`z`$ as argued in the beginning of the present subsection. The level constraints $`\mathrm{}(x)=\mathrm{}(y^{})\mathrm{}(y)=\mathrm{}(x^{})`$ are obviously satisfied. Due to Theorem 3.13 there is no other solution. ∎

### 4.4. Properties of $`V_i,W_i`$ under $`e_i^c`$

Here we list the transformation property of the functions $`V_i,W_i`$ under $`e_i^c`$. Set

$`\omega _i={\displaystyle \frac{c\phi _i(x)+\epsilon _i(y)}{\phi _i(x)+\epsilon _i(y)}},\psi _i={\displaystyle \frac{c\phi _i(x)+c\epsilon _i(y)}{c\phi _i(x)+\epsilon _i(y)}}(0in),`$
$`\mathrm{\Omega }_i=\{\begin{array}{cc}\frac{x_{i+1}+\omega _i\overline{x}_{i+1}}{x_{i+1}+\overline{x}_{i+1}}\hfill & (1in1),\hfill \\ \frac{x_2+\omega _0\overline{x}_2}{x_2+\overline{x}_2}\hfill & (i=0),\hfill \end{array}\mathrm{\Psi }_i=\{\begin{array}{cc}\frac{y_{i+1}+\psi _i\overline{y}_{i+1}}{y_{i+1}+\overline{y}_{i+1}}\hfill & (1in1),\hfill \\ \frac{y_2+\psi _0\overline{y}_2}{y_2+\overline{y}_2}\hfill & (i=0).\hfill \end{array}`$
For a function $`F=F((x,y))`$ in the variables $`(x,y)`$ we write $`R(F)=F(R(x,y))`$ and $`e_i^c(F)=F(e_i^c(x,y))`$.

###### Proposition 4.26.

Let $`(x^{},y^{})=R(x,y)`$. Then we have

$$V_0(e_i^c(x,y))=V_0(x,y)\left(\frac{c\phi _0(x^{})+\epsilon _0(y^{})}{\phi _0(x^{})+\epsilon _0(y^{})}\frac{c\phi _0(x)+\epsilon _0(y)}{c\phi _0(x)+c\epsilon _0(y)}\right)^{\delta _{i0}}.$$

###### Proof.

First suppose $`1in`$. From Theorem 3.12 the relation $`(\stackrel{~}{x},\stackrel{~}{y})=e_i^c(x,y)`$ implies $`M(\stackrel{~}{x},z)M(\stackrel{~}{y},z)=G_i(a)M(x,z)M(y,z)G_i(b)`$ for some $`a,b`$. But $`V_0=(M(x,z)M(y,z))_{2n,1}`$ is unchanged by the multiplication of the $`G_i`$’s, proving $`e_i^cV_0=V_0`$. To show the $`i=0`$ case, note from Lemma 3.15 that $`e_0^c((x,y)^{\sigma _1})=(e_1^c(x,y))^{\sigma _1}`$. Thus we have $`e_0^c(V_0^{\sigma _1})=V_0(e_0^c((x,y)^{\sigma _1}))=V_0((e_1^c(x,y))^{\sigma _1})=(e_1^cV_0)^{\sigma _1}=V_0^{\sigma _1}`$. Therefore, $`e_0^cR\left(\frac{x_1}{\overline{x}_1}\right)=e_0^c\left(\frac{y_1}{\overline{y}_1}\frac{V_0^{\sigma _1}}{V_0}\right)=\frac{y_1}{\overline{y}_1\psi _0}\frac{V_0^{\sigma _1}}{e_0^c(V_0)}`$ and $`Re_0^c\left(\frac{x_1}{\overline{x}_1}\right)=R\left(\frac{x_1}{\overline{x}_1\omega _0}\right)=\frac{y_1}{\overline{y}_1R(\omega _0)}\frac{V_0^{\sigma _1}}{V_0}.`$ Now the assertion follows from $`e_0^cR=Re_0^c`$ (Proposition 4.6). ∎

Proposition 4.26 indicates that $`V_0`$ is a tropical analogue of the energy function in crystal theory, which will be argued in Remark 4.29.

Similar properties can be derived for the other $`V_i,W_i`$ with the help of Proposition 4.6 and Definition 4.9. Besides Table 2, the result is summarized as

$$e_i^c(V_j)=\{\begin{array}{cc}V_j\hfill & (ji),\hfill \\ V_i\frac{R(\mathrm{\Omega }_i)}{\mathrm{\Psi }_i}\hfill & (j=i),\hfill \end{array}e_i^c(W_j)=\{\begin{array}{cc}W_j\hfill & (ji),\hfill \\ W_i\frac{R(\omega _i)}{\psi _i}\hfill & (j=i),\hfill \end{array}$$

for $`2jn2`$ and $`0in`$. For instance the $`j=i`$ case of the former (resp. the latter) relation can be obtained by applying $`e_i^cR=Re_i^c`$ on $`\overline{x}_1\mathrm{}\overline{x}_i`$ (resp. $`(\overline{x}_1\mathrm{}\overline{x}_i)/(x_1\mathrm{}x_i)`$).

### 4.5. Piecewise linear formula for the combinatorial $`R`$

Suppose a rational function $`F=F(x,y;c)`$ is subtraction-free in the sense of Remark 4.15 with respect to the variables $`x=(x_1,x_2,\mathrm{},\overline{x}_1)`$, $`y=(y_1,y_2,\mathrm{},\overline{y}_1)`$ and $`c`$. By ultradiscretization of $`F`$ we mean the expression obtained by replacing $`+,\times ,/`$ with $`\mathrm{max},+,`$, respectively in $`F`$. (It is called “tropicalization” in \[BK\] on the contrary.) The procedure is well-defined particularly because the both sides of $`p(q+r)=pq+pr`$ have the equal image $`p+\mathrm{max}(q,r)=\mathrm{max}(p+q,p+r)`$. A way to substantiate it is to consider the limit $`lim_{ϵ+0}ϵ\mathrm{log}F(e^{x/ϵ},e^{y/ϵ};e^{c/ϵ})`$ after replacing $`x,y,c`$ by the real positive arrays $`e^{x/ϵ}:=(e^{x_1/ϵ},e^{x_2/ϵ},\mathrm{},e^{\overline{x}_1/ϵ})`$, $`e^{y/ϵ}:=(e^{y_1/ϵ},e^{y_2/ϵ},\mathrm{},e^{\overline{y}_1/ϵ})`$ and $`e^{c/ϵ}`$ \[TTMS\]. Note that ultradiscretized functions are piecewise linear. In this subsection we use the same symbol to stand for the original (tropical) and the ultradiscretized (piecewise linear) objects, supposing no confusion might arise.

###### Example 4.27.

$$F=\frac{c\phi _0(x)+\epsilon _0(y)}{\phi _0(x)+\epsilon _0(y)}=\frac{c\overline{x}_1(1+\overline{x}_2/x_2)+y_1(1+y_2/\overline{y}_2)}{\overline{x}_1(1+\overline{x}_2/x_2)+y_1(1+y_2/\overline{y}_2)}$$

is subtraction-free. Its ultradiscretization reads

$$F=\mathrm{max}(c+\overline{x}_1+(\overline{x}_2x_2)_+,y_1+(y_2\overline{y}_2)_+)\mathrm{max}(\overline{x}_1+(\overline{x}_2x_2)_+,y_1+(y_2\overline{y}_2)_+),$$

where $`(x)_+:=\mathrm{max}(x,0)`$. Moreover if $`c=1`$,

$$F=\theta \left(\overline{x}_1+(\overline{x}_2x_2)_+y_1+(y_2\overline{y}_2)_+\right).$$

Let $`(x^{},y^{})=R(x,y)`$ be the ultradiscretization of our tropical $`R`$. Namely,

(4.28)
$$\begin{array}{cc}& x_1^{}=y_1+V_0^{\sigma _1}V_1,\overline{x}_1^{}=\overline{y}_1+V_0V_1,\hfill \\ & x_i^{}=y_i+V_{i1}+W_iV_iW_{i1},\overline{x}_i^{}=\overline{y}_i+V_{i1}V_i,(2in1)\hfill \\ & x_n^{}=y_n+V_{n1}V_{n1}^{},\hfill \\ & y_1^{}=x_1+V_0V_1^{},\overline{y}_1^{}=\overline{x}_1+V_0^{\sigma _1}V_1^{},\hfill \\ & y_i^{}=x_i+V_{i1}^{}V_i^{},\overline{y}_i^{}=\overline{x}_i+V_{i1}^{}+W_iV_i^{}W_{i1},(2in1)\hfill \\ & y_n^{}=x_n+V_{n1}^{}V_{n1}.\hfill \end{array}$$

Here $`V_i,W_i`$ are given by

(4.29) $`V_i=\mathrm{max}(\{\theta _{i,j}(x,y),\theta _{i,j}^{}(x,y)|1jn2\}`$
$`\{\eta _{i,j}(x,y),\eta _{i,j}^{}(x,y)|1jn\}),`$
$`W_1=V_0+V_0^{\sigma _1},W_{n1}=V_{n1}+V_{n1}^{},`$
$`W_i=\mathrm{max}(V_i+V_{i1}^{}y_i,V_{i1}+V_i^{}\overline{x}_i)+\mathrm{min}(x_i,\overline{y}_i),(2in2),`$
where

$`\theta _{i,j}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x)+{\displaystyle \underset{k=j+1}{\overset{i}{}}}(\overline{y}_k\overline{x}_k)\hfill & \text{for}1ji,\hfill \\ \mathrm{}(y)+{\displaystyle \underset{k=i+1}{\overset{j}{}}}(\overline{x}_k\overline{y}_k)\hfill & \text{for}i+1jn2,\hfill \end{array}`$
$`\theta _{i,j}^{}(x,y)`$ $`=\mathrm{}(x)+{\displaystyle \underset{k=1}{\overset{i}{}}}(\overline{y}_k\overline{x}_k)+{\displaystyle \underset{k=1}{\overset{j}{}}}(y_kx_k)\text{for}j=1,\mathrm{},n2,`$
$`\eta _{i,j}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x)+{\displaystyle \underset{k=j+1}{\overset{i}{}}}(\overline{y}_k\overline{x}_k)+\left(\overline{y}_jx_j\right)\hfill & \text{for}1ji,\hfill \\ \mathrm{}(y)+{\displaystyle \underset{k=i+1}{\overset{j}{}}}(\overline{x}_k\overline{y}_k)+\left(\overline{y}_jx_j\right)\hfill & \text{for}i+1jn1,\hfill \\ \mathrm{}(y)+{\displaystyle \underset{k=i+1}{\overset{n1}{}}}(\overline{x}_k\overline{y}_k)+x_n\hfill & \text{for}j=n,\hfill \end{array}`$
$`\eta _{i,j}^{}(x,y)`$ $`=\{\begin{array}{cc}\mathrm{}(x)+{\displaystyle \underset{k=1}{\overset{i}{}}}(\overline{y}_k\overline{x}_k)+{\displaystyle \underset{k=1}{\overset{j}{}}}(y_kx_k)+\left(x_j\overline{y}_j\right)\text{for}1jn1,\hfill & \\ \mathrm{}(x)+\delta _{i,n1}\left(\mathrm{}(x)\mathrm{}(y)\right)+{\displaystyle \underset{k=1}{\overset{i}{}}}(\overline{y}_k\overline{x}_k)+{\displaystyle \underset{k=1}{\overset{n1}{}}}(y_kx_k)x_n\text{for}j=n,\hfill & \end{array}`$
$$\mathrm{}(x)=\underset{k=1}{\overset{n}{}}x_k+\underset{k=1}{\overset{n1}{}}\overline{x}_k,\mathrm{}(y)=\underset{k=1}{\overset{n}{}}y_k+\underset{k=1}{\overset{n1}{}}\overline{y}_k.$$

The operations $`\sigma _1,\sigma _n`$ and $``$ in (4.28) are still defined by (4.2) and (4.3).

Let us recall the $`D_n^{(1)}`$-crystal $`B_l(l_{>0})`$ from \[KKM\]. It is a finite set

$$B_l=\{(\zeta _1,\mathrm{},\zeta _n,\overline{\zeta }_n,\mathrm{},\overline{\zeta }_1)_0^{2n}\underset{i=1}{\overset{n}{}}(\zeta _i+\overline{\zeta }_i)=l,\zeta _n\overline{\zeta }_n=0\}$$

endowed with certain maps $`\stackrel{~}{e}_i,\stackrel{~}{f}_i(0in)`$ as described in section 5.4 of the mentioned paper. The set $`B_l`$ is in one to one correspondence with another set

$`B_l^{}=\{(x_1,\mathrm{},x_n,\overline{x}_{n1},\mathrm{},\overline{x}_1)`$ $`^{2n1}x_i,\overline{x}_i0\text{ for }1in1,`$
$`x_n\mathrm{min}(x_{n1},\overline{x}_{n1}),{\displaystyle \underset{i=1}{\overset{n1}{}}}(x_i+\overline{x}_i)+x_n=l\}`$
via $`x_i=\zeta _i,\overline{x}_i=\overline{\zeta }_i(1in2),x_{n1}=\zeta _{n1}+\overline{\zeta }_n,x_n=\zeta _n\overline{\zeta }_n,\overline{x}_{n1}=\overline{\zeta }_{n1}+\overline{\zeta }_n,\zeta _n=\mathrm{max}(0,x_n),\overline{\zeta }_n=\mathrm{max}(0,x_n),\zeta _{n1}=x_{n1}+\mathrm{min}(0,x_n),\overline{\zeta }_{n1}=\overline{x}_{n1}+\mathrm{min}(0,x_n)`$. Note that $`x_n`$ can be negative. Below we give the explicit crystal structure of $`B_l^{}`$, which is also obtained by ultradiscretizing the geometric crystal structure of $``$ in section 2.2.

$`\epsilon _0(x)`$ $`=`$ $`x_1+(x_2\overline{x}_2)_+,\phi _0(x)=\overline{x}_1+(\overline{x}_2x_2)_+,`$
$`\epsilon _i(x)`$ $`=`$ $`\overline{x}_i+(x_{i+1}\overline{x}_{i+1})_+,\phi _i(x)=x_i+(\overline{x}_{i+1}x_{i+1})_+(i=1,\mathrm{},n2),`$
$`\epsilon _{n1}(x)`$ $`=`$ $`x_n+\overline{x}_{n1},\phi _{n1}(x)=x_{n1},`$
$`\epsilon _n(x)`$ $`=`$ $`\overline{x}_{n1},\phi _n(x)=x_{n1}+x_n,`$
$`\stackrel{~}{e}_0^c(x)`$ $`=`$ $`(x_1\xi _2,x_2+\xi _2c,\mathrm{},\overline{x}_2+\xi _2,\overline{x}_1\xi _2+c),`$
$`\stackrel{~}{e}_i^c(x)`$ $`=`$ $`(\mathrm{},x_i\xi _{i+1}+c,x_{i+1}+\xi _{i+1}c,\mathrm{},\overline{x}_{i+1}+\xi _{i+1},\overline{x}_i\xi _{i+1},\mathrm{})`$
$`(i=1,\mathrm{},n2),`$
$`\stackrel{~}{e}_{n1}^c(x)`$ $`=`$ $`(\mathrm{},x_{n1}+c,x_nc,\mathrm{}),`$
$`\stackrel{~}{e}_n^c(x)`$ $`=`$ $`(\mathrm{},x_n+c,\overline{x}_{n1}c,\mathrm{}),`$
where $`\xi _i=\mathrm{max}(x_i,\overline{x}_i+c)\mathrm{max}(x_i,\overline{x}_i)(i=1,\mathrm{},n1).`$
Here $`c`$ is an integer. If $`c`$ is negative, we understand $`\stackrel{~}{e}_i^c`$ as $`\stackrel{~}{f}_i^c`$. Also, if $`\stackrel{~}{e}_i^c(x)`$ does not belong to $`B_l^{}`$, one should assume it to be $`0`$.

We are interested in the bijection $`R:B_l^{}B_k^{}B_k^{}B_l^{}`$ which commutes with $`\stackrel{~}{e}_i^c`$. It is called the combinatorial $`R`$. See Remark 2.11 for the action of $`\stackrel{~}{e}_i^c`$ on the tensor product. Below we write $`(x,y)`$ for an element $`xy`$ of $`B_l^{}B_k^{}`$. We remark that the combinatorial $`R:B_lB_kB_kB_l`$ has been given in terms of a certain insertion procedure \[HKOT2\].

###### Theorem 4.28.

Restriction of (4.28) to $`xB_\mathrm{}_1^{},yB_\mathrm{}_2^{}`$ yields an explicit formula $`(x,y)(x^{},y^{})`$ for the combinatorial $`R:B_\mathrm{}_1^{}B_\mathrm{}_2^{}B_\mathrm{}_2^{}B_\mathrm{}_1^{}`$.

###### Proof.

Set

$$\stackrel{~}{B}_l^{}=\{(x_1,\mathrm{},x_n,\overline{x}_{n1},\mathrm{},\overline{x}_1)^{2n1}\underset{i=1}{\overset{n1}{}}(x_i+\overline{x}_i)+x_n=l\}.$$

Let $`E_i^c`$ be the map on $`\stackrel{~}{B}_\mathrm{}_1^{}\stackrel{~}{B}_\mathrm{}_2^{}`$ obtained by ultradiscretizing $`e_i^c`$ on $`\times `$, let $`R_0`$ be the map $`\stackrel{~}{B}_\mathrm{}_1^{}\stackrel{~}{B}_\mathrm{}_2^{}\stackrel{~}{B}_\mathrm{}_2^{}\stackrel{~}{B}_\mathrm{}_1^{}`$ given by ultradiscretizing the tropical $`R`$, and let $`R:B_\mathrm{}_1^{}B_\mathrm{}_2^{}B_\mathrm{}_2^{}B_\mathrm{}_1^{}`$, be the combinatorial $`R`$. We are to show $`R(x,y)=R_0(x,y)`$ if $`(x,y)B_\mathrm{}_1^{}B_\mathrm{}_2^{}`$.

First recall that $`R`$ is uniquely characterized by

* $`R((\mathrm{}_1,0,\mathrm{},0),(\mathrm{}_2,0,\mathrm{},0))=((\mathrm{}_2,0,\mathrm{},0),(\mathrm{}_1,0,\mathrm{},0))`$,
* If $`(x,y),\stackrel{~}{e}_i^c(x,y)B_\mathrm{}_1^{}B_\mathrm{}_2^{}`$, then $`R\stackrel{~}{e}_i^c(x,y)=\stackrel{~}{e}_i^cR(x,y)`$.

Let us check (i) for $`R_0`$. Assume $`x=x_0=(\mathrm{}_1,0,\mathrm{},0)`$, $`y=y_0=(\mathrm{}_2,0,\mathrm{},0)`$. Then we have $`\theta _{i,j}=\mathrm{}_1(1ji),=\mathrm{}_2(i+1jn2)`$; $`\theta _{i,j}^{}=\mathrm{}_2(1jn2)`$; $`\eta _{i,j}=0(j=1,i0),=\mathrm{}_2\mathrm{}_1(j=1,i=0),=\mathrm{}_1(1<ji),=\mathrm{}_2(i+1jn)`$, and $`\eta _{i,j}^{}=\mathrm{}_1+\mathrm{}_2(j=1),=\mathrm{}_2(1<jn1\text{or}j=n,in1),=\mathrm{}_1(j=n,i=n1)`$. Therefore we have $`V_0=V_0^{\sigma _1}=V_i=V_i^{}=\mathrm{}_1+\mathrm{}_2`$ and $`W_i=2(\mathrm{}_1+\mathrm{}_2)`$ for $`1in1`$. Thus we obtain $`R(x_0,y_0)=((\mathrm{}_2,0,\mathrm{},0),(\mathrm{}_1,0,\mathrm{},0))`$.

For $`(x,y)B_\mathrm{}_1^{}B_\mathrm{}_2^{}`$ let $`m`$ be the minimum such that $`\stackrel{~}{e}_{i_p}^{c_p}\mathrm{}\stackrel{~}{e}_{i_1}^{c_1}(x_0,y_0)B_\mathrm{}_1^{}B_\mathrm{}_2^{}`$ ($`1pm`$), $`(x,y)=\stackrel{~}{e}_{i_m}^{c_m}\mathrm{}\stackrel{~}{e}_{i_1}^{c_1}(x_0,y_0)`$ for some integers $`c_1,\mathrm{},c_m`$. We prove $`R=R_0`$ on $`B_\mathrm{}_1^{}B_\mathrm{}_2^{}`$ by induction on $`m`$. The $`m=0`$ case is proven above. Assume the $`m1`$ case. Note that

$`E_i^c(x,y)=\stackrel{~}{e}_i^c(x,y)\text{ if }(x,y),\stackrel{~}{e}_i^c(x,y)B_\mathrm{}_1^{}B_\mathrm{}_2^{},`$
$`E_i^cR_0(x,y)=R_0E_i^c(x,y)\text{ for }(x,y)\stackrel{~}{B}_\mathrm{}_1^{}\stackrel{~}{B}_\mathrm{}_2^{}.`$
The second equality is obtained by ultradiscretizing Proposition 4.6. Thus we get

$`R_0(x,y)`$ $`=`$ $`R_0E_{i_m}^{c_m}\stackrel{~}{e}_{i_{m1}}^{c_{m1}}\mathrm{}\stackrel{~}{e}_{i_1}^{c_1}(x_0,y_0)`$
$`=`$ $`E_{i_m}^{c_m}R_0\stackrel{~}{e}_{i_{m1}}^{c_{m1}}\mathrm{}\stackrel{~}{e}_{i_1}^{c_1}(x_0,y_0)`$
$`=`$ $`\stackrel{~}{e}_{i_m}^{c_m}R\stackrel{~}{e}_{i_{m1}}^{c_{m1}}\mathrm{}\stackrel{~}{e}_{i_1}^{c_1}(x_0,y_0)`$
$`=`$ $`R(x,y).`$
The proof is completed. ∎

###### Remark 4.29.

By the ultradiscretization of Proposition 4.26, we have

$`V_0(\stackrel{~}{e}_i(x,y))`$ $`=V_0(x,y)+\left(\theta (\phi _0(x^{})\epsilon _0(y^{}))\theta (\phi _0(x)<\epsilon _0(y))\right)\delta _{i0}`$
$`=\{\begin{array}{cc}V_0(x,y)+1\hfill & \text{ if }i=0,\phi _0(x)\epsilon _0(y),\phi _0(x^{})\epsilon _0(y^{}),\hfill \\ V_0(x,y)1\hfill & \text{ if }i=0,\phi _0(x)<\epsilon _0(y),\phi _0(x^{})<\epsilon _0(y^{}),\hfill \\ V_0(x,y)\hfill & \text{ otherwise},\hfill \end{array}`$
where $`\phi _0(x)=\overline{x}_1+(\overline{x}_2x_2)_+,\epsilon _0(y)=y_1+(y_2\overline{y}_2)_+`$. See Example 4.27. This recursion relation is known to characterize an important function on $`B_{\mathrm{}(x)}^{}B_{\mathrm{}(y)}^{}`$ called the energy function up to an additive constant. See \[NaY, Definition 3.2\]. Thus we conclude that (4.7) is the tropical analogue of the energy function. In our formula (4.29), it is so normalized that $`\mathrm{min}\{V_0(x,y)(x,y)B_{\mathrm{}(x)}^{}B_{\mathrm{}(y)}^{}\}=|\mathrm{}(x)\mathrm{}(y)|`$. If we put $`\mathrm{}(x)=\mathrm{}(y)=0`$, the expression (4.29) with $`i=0`$ reduces to the one in \[KKM\] associated to the crystal $`B_{\mathrm{}}B_{\mathrm{}}`$.

## Appendix A Alternative proof of Theorem 3.16

Let $`X=_{1ji2n}x_{i,j}E_{i,j}`$ be a lower triangular matrix satisfying

(A.1)
$$XS^tXS=S^tXSX=E,$$

where $`S`$ is the matrix given by (3.16).

###### Lemma A.1.

$`G_k(u)XG_k(v)^1`$ for $`1kn1`$ is lower-triangular if and only if

(A.2) $`ux_{k+1,k+1}`$ $`=vx_{k,k}+uvx_{k+1,k},`$
(A.3) $`ux_{2n+1k,2n+1k}`$ $`=vx_{2nk,2nk}+uvx_{2n+1k,2nk}.`$
###### Proof.

Put $`X^{}=G_k(u)XG_k(v)^1`$. The elements of the matrix $`X^{}=(x_{i,j}^{})`$ read

$`x_{i,j}^{}`$ $`=x_{i,j}+u(\delta _{i,k}x_{k+1,j}+\delta _{i,2nk}x_{2n+1k,j})v(\delta _{k,j1}x_{i,k}+\delta _{2n+1k,j}x_{i,2nk})`$
$`uv(\delta _{i,k}\delta _{j,k+1}x_{k+1,k}+\delta _{i,2nk}\delta _{j,k+1}x_{2n+1k,k}+\delta _{i,2nk}\delta _{j,2n+1k}x_{2n+1k,2nk}).`$
The only non-zero upper-triangular elements are

$`x_{k,k+1}^{}`$ $`=ux_{k+1,k+1}vx_{k,k}uvx_{k+1,k},`$
$`x_{2nk,2n+1k}^{}`$ $`=ux_{2n+1k,2n+1k}vx_{2nk,2nk}uvx_{2n+1k,2nk}.`$
Hence the relations (A.2) and (A.3) follow. ∎

Note that the following parameterization solves the relation (A.2):

(A.4)
$$u=\frac{x_{k,k}}{x_{k+1,k}}(c1),v=\frac{x_{k+1,k+1}}{x_{k+1,k}}\frac{(c1)}{c}.$$

It also solves the relation (A.3) due to (A.1). In view of this, we define the action $`e_i^c(1in1)`$ on $`X`$ by

(A.5)
$$e_i^c(X)=G_i\left(\frac{x_{i,i}}{x_{i+1,i}}(c1)\right)XG_i\left(\frac{x_{i+1,i+1}}{x_{i+1,i}}\frac{(c1)}{c}\right)^1.$$

Note that we have $`e_i^c(X)S^te_i^c(X)S=S^te_i^c(X)Se_i^c(X)=E`$.

###### Proposition A.2.

$$e_i^de_{i+1}^{cd}e_i^c(X)=e_{i+1}^ce_i^{cd}e_{i+1}^d(X)\text{for }\mathrm{\hspace{0.33em}1}in2.$$

###### Proof.

Setting $`Y=e_i^c(X),Z=e_{i+1}^{cd}(Y),Y^{}=e_{i+1}^d(X),Z^{}=e_i^{cd}(Y^{}),`$ we introduce

(A.6)
$$\begin{array}{cc}& u_1=\frac{X_{i,i}}{X_{i+1,i}}(c1),u_2=\frac{Y_{i+1,i+1}}{Y_{i+2,i+1}}(cd1),u_3=\frac{Z_{i,i}}{Z_{i+1,i}}(d1),\hfill \\ & u_1^{}=\frac{X_{i+1,i+1}}{X_{i+2,i+1}}(d1),u_2^{}=\frac{Y_{i,i}^{}}{Y_{i+1,i}^{}}(cd1),u_3^{}=\frac{Z_{i+1,i+1}^{}}{Z_{i+2,i+1}^{}}(c1),\hfill \\ & v_1=\frac{X_{i+1,i+1}}{X_{i+1,i}}\frac{(c1)}{c},v_2=\frac{Y_{i+2,i+2}}{Y_{i+2,i+1}}\frac{(cd1)}{cd},v_3=\frac{Z_{i+1,i+1}}{Z_{i+1,i}}\frac{(d1)}{d},\hfill \\ & v_1^{}=\frac{X_{i+2,i+2}}{X_{i+2,i+1}}\frac{(d1)}{d},v_2^{}=\frac{Y_{i+1,i+1}^{}}{Y_{i+1,i}^{}}\frac{(cd1)}{cd},v_3^{}=\frac{Z_{i+2,i+2}^{}}{Z_{i+2,i+1}^{}}\frac{(c1)}{c}.\hfill \end{array}$$

From (A.5) we know

$`e_i^de_{i+1}^{cd}e_i^c(X)=G_i(u_3)G_{i+1}(u_2)G_i(u_1)X\left(G_i(v_3)G_{i+1}(v_2)G_i(v_1)\right)^1,`$
$`e_{i+1}^ce_i^{cd}e_{i+1}^d(X)=G_{i+1}(u_3^{})G_i(u_2^{})G_{i+1}(u_1^{})X\left(G_{i+1}(v_3^{})G_i(v_2^{})G_{i+1}(v_1^{})\right)^1.`$
A direct calculation leads to

$$\begin{array}{c}u_1=\frac{x_{i,i}}{x_{i+1,i}}(c1),u_2=\frac{x_{i+1,i}x_{i+1,i+1}}{w_1}(cd1),u_3=\frac{x_{i,i}}{x_{i+1,i}}\frac{w_1}{w_2}(d1),\hfill \\ u_1^{}=\frac{x_{i+1,i+1}}{x_{i+2,i+1}}(d1),u_2^{}=\frac{x_{i,i}x_{i+2,i+1}}{w_2}(cd1),u_3^{}=\frac{x_{i+1,i+1}}{x_{i+2,i+1}}\frac{w_2}{w_1}(c1),\hfill \\ w_1=(1c)x_{i+2,i}x_{i+1,i+1}+cx_{i+1,i}x_{i+2,i+1},\hfill \\ w_2=(d1)x_{i+2,i}x_{i+1,i+1}+x_{i+1,i}x_{i+2,i+1}.\hfill \end{array}$$

Then the relations

$$u_1^{}=\frac{u_2u_3}{u_1+u_3},u_2^{}=u_1+u_3,u_3^{}=\frac{u_1u_2}{u_1+u_3},$$

can be checked, and from (3.3),

(A.7)
$$G_i(u_3)G_{i+1}(u_2)G_i(u_1)=G_{i+1}(u_3^{})G_i(u_2^{})G_{i+1}(u_1^{}).$$

Similarly, one can check

(A.8)
$$G_i(v_3)G_{i+1}(v_2)G_i(v_1)=G_{i+1}(v_3^{})G_i(v_2^{})G_{i+1}(v_1^{}).$$

###### Lemma A.3.

Let $`X=\left(X_{i,j}\right)_{1i,j2n}=A(x^1)\mathrm{}A(x^L)`$. Then we have

$$\frac{X_{i+1,i}}{X_{i,i}}=\epsilon _i(𝒙),\frac{X_{i+1,i}}{X_{i+1,i+1}}=\phi _i(𝒙)\text{for }\mathrm{\hspace{0.33em}1}in1.$$

###### Proof.

We prove by induction on $`L`$. If $`L=1`$ the claim can be checked directly. Suppose $`L>1`$. Let $`\stackrel{~}{X}=\left(\stackrel{~}{X}_{i,j}\right)_{1i,j2n}=A(x^1)\mathrm{}A(x^{L1})`$. Since $`\stackrel{~}{X}`$ and $`A(x^L)`$ are lower-triangular we have

$`X_{i,i}`$ $`=\stackrel{~}{X}_{i,i}A(x^L)_{i,i},`$
$`X_{i+1,i}`$ $`=\stackrel{~}{X}_{i+1,i}A(x^L)_{i,i}+\stackrel{~}{X}_{i+1,i+1}A(x^L)_{i+1,i},`$
$`X_{i+1,i+1}`$ $`=\stackrel{~}{X}_{i+1,i+1}A(x^L)_{i+1,i+1}.`$
Denote $`(x^1,\mathrm{},x^{L1})`$ by $`\stackrel{~}{𝒙}`$. Suppose

$$\frac{\stackrel{~}{X}_{i+1,i}}{\stackrel{~}{X}_{i,i}}=\epsilon _i(\stackrel{~}{𝒙}),\frac{\stackrel{~}{X}_{i+1,i}}{\stackrel{~}{X}_{i+1,i+1}}=\phi _i(\stackrel{~}{𝒙}).$$

Then we have

$`{\displaystyle \frac{X_{i+1,i}}{X_{i,i}}}`$ $`={\displaystyle \frac{\stackrel{~}{X}_{i+1,i}}{\stackrel{~}{X}_{i,i}}}+{\displaystyle \frac{\stackrel{~}{X}_{i+1,i+1}A(x^L)_{i+1,i}}{\stackrel{~}{X}_{i,i}A(x^L)_{i,i}}}=\epsilon _i(\stackrel{~}{𝒙})+{\displaystyle \frac{\epsilon _i(\stackrel{~}{𝒙})\epsilon _i(x^L)}{\phi _i(\stackrel{~}{𝒙})}}=\epsilon _i(𝒙),`$
$`{\displaystyle \frac{X_{i+1,i}}{X_{i+1,i+1}}}`$ $`={\displaystyle \frac{A(x^L)_{i+1,i}}{A(x^L)_{i+1,i+1}}}+{\displaystyle \frac{\stackrel{~}{X}_{i+1,i}A(x^L)_{i,i}}{\stackrel{~}{X}_{i+1,i+1}A(x^L)_{i+1,i+1}}}=\phi _i(x^L)+{\displaystyle \frac{\phi _i(\stackrel{~}{𝒙})\phi _i(x^L)}{\epsilon _i(x^L)}}=\phi _i(𝒙).`$
###### Proof of Theorem 3.16.

We concentrate on the nontrivial case (3.37) with $`i<j`$. Note that $`(i,j)=(0,2)`$ case reduces to $`(i,j)=(1,2)`$ as

$`e_0^de_2^{cd}e_0^c(𝒙)`$ $`=(e_1^de_2^{cd}e_1^c(𝒙^{\sigma _1}))^{\sigma _1}`$
$`=(e_2^ce_1^{cd}e_2^d(𝒙^{\sigma _1}))^{\sigma _1}`$
$`=e_2^ce_0^{cd}e_2^d(𝒙).`$
Similarly $`(i,j)=(n2,n)`$ case reduces to $`(i,j)=(n2,n1)`$. Thus it suffices to prove the relations $`P=P^{}`$ and $`Q=Q^{}`$ $`(1in2)`$ for $`P,P^{},Q`$ and $`Q^{}`$ specified in (3.38)-(3.41).

Let $`𝒙=(x^1,\mathrm{},x^L)`$ and $`X=A(x^1)\mathrm{}A(x^L)`$. Since $`X`$ is lower triangular and satisfies (A.1), we can apply Lemma A.2 keeping all the notations in its proof. Then (A.7) and (A.8) are nothing but $`P=P^{}`$ and $`Q=Q^{}`$, respectively. Let us show the former for example. By Lemma A.3 we have $`u_1=\frac{c1}{\epsilon _i(𝒙)}`$ and $`u_1^{}=\frac{d1}{\epsilon _{i+1}(𝒙)}`$. Next we are to show $`u_2=\frac{cd1}{\epsilon _{i+1}(e_i^c(𝒙))}`$ and $`u_2^{}=\frac{cd1}{\epsilon _i(e_{i+1}^d(𝒙))}`$. We illustrate the way along $`u_2`$. Setting $`e_i^c(𝒙)=(y^1,\mathrm{},y^L)`$, we get

$`Y=e_i^c(X)`$ $`=G_i\left(u_1\right)XG_i\left(v_1\right)^1`$
$`=G_i\left(u_1\right)A(x^1)\mathrm{}A(x^L)G_i\left(v_1\right)^1`$
$`=A(y^1)\mathrm{}A(y^L),`$
where the last equality is due to Theorem 3.12. Now Lemma A.3 tells that $`\frac{Y_{i+2,i+1}}{Y_{i+1,i+1}}=\epsilon _{i+1}(e_i^c(𝒙)).`$ The remaining relations are similarly verified. ∎

## Appendix B Proof of Proposition 4.16

Set $`I=A(x)A(y)`$, which should not be confused with the identity matrix $`E`$.

###### Lemma B.1.

(B.1) $`0`$ $`={\displaystyle \underset{m=i}{\overset{n}{}}}I_{m,i}I_{2n+1m,i}(1)^m,(1in)`$
(B.2) $`I_{j,i}`$ $`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right)\left(1+{\displaystyle \frac{x_j}{\overline{x}_j}}\right)\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}x_m\right)+y_i\left(I_{j,i+1}\delta _{j,i+1}\right),`$
$`(1ij1n2)`$
(B.3) $`I_{n,n1}`$ $`={\displaystyle \frac{y_{n1}}{\overline{y}_{n1}}}x_{n1}x_n+y_{n1}I_{n,n},`$
(B.4) $`I_{n,i}`$ $`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right)\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}x_m\right)+y_iI_{n,i+1},(1in2)`$
(B.5) $`I_{j,i}`$ $`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right)\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}x_m\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{x}_m\right)+y_iI_{j,i+1},`$
$`(1i2njn2)`$
(B.6) $`I_{2n+1i,i}`$ $`=y_i\overline{x}_i\left({\displaystyle \frac{1}{x_i}}+{\displaystyle \frac{1}{\overline{y}_i}}\right)\left(x_ix_n{\displaystyle \underset{m=i+1}{\overset{n1}{}}}x_m\overline{x}_m+\overline{y}_iy_n{\displaystyle \underset{m=i+1}{\overset{n1}{}}}y_m\overline{y}_m\right)`$
$`+y_i\overline{x}_iI_{2ni,i+1}.(1in2)`$
###### Proof.

From Proposition 3.6, one has $`IS^tIS=E`$. In particular $`_{m=i}^{2n+1i}I_{m,i}I_{2n+1m,i}`$ $`S_{m,2n+1m}=0`$, which is equivalent to (B.1).

To show (B.2), (B.4) and (B.5), we consider

$`I_{j,i}y_iI_{j,i+1}`$ $`={\displaystyle \underset{k=1}{\overset{2n}{}}}A(x)_{j,k}\left(A(y)_{k,i}y_iA(y)_{k,i+1}\right)`$
$`=A(x)_{j,i}{\displaystyle \frac{y_i}{\overline{y}_i}}+A(x)_{j,i+1}y_i`$
$`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right){\displaystyle \frac{A(x)_{j,i}}{x_i}}y_i\delta _{j,i+1},`$
where (3.5) is used twice. Repeated use of (3.5) leads to $`A(x)_{j,i}=A(x)_{j,1}/(x_{i1}\mathrm{}x_1)`$. Substituting the explicit form (3.4) of $`A(x)_{j,1}`$ we obtain the desired relations.

Note that $`I_{n,n1}=A(x)_{n,n}A(y)_{n,n1}+A(x)_{n,n1}A(y)_{n1,n1}=x_ny_{n1}y_n+x_{n1}x_n\frac{y_{n1}}{\overline{y}_{n1}}`$. (B.3) follows from this and $`I_{n,n}=x_ny_n`$.

Let us consider (B.6). From (3.5) and (3.29) it follows that

$`A(x)_{2n+1i,k}`$ $`=A(x)_{2ni,k}\overline{x}_i+\{\begin{array}{cc}\overline{x}_i/x_i\hfill & \text{for}k=2n+1i,\hfill \\ \overline{x}_i\hfill & \text{for}k=2ni,\hfill \\ 0\hfill & \text{for}k2n+1i,2ni,\hfill \end{array}`$
$`A(y)_{k,i}`$ $`=A(y)_{k,i+1}y_i+\{\begin{array}{cc}y_i/\overline{y}_i\hfill & \text{for}k=i,\hfill \\ y_i\hfill & \text{for}k=i+1,\hfill \\ 0\hfill & \text{for}ki,i+1.\hfill \end{array}`$
Substitute these relations into $`I_{2n+1i,i}=_{k=1}^{2n}A(x)_{2n+1i,k}A(y)_{k,i}.`$ The result reads

$`I_{2n+1i,i}y_i\overline{x}_iI_{2ni,i+1}`$ $`=\overline{x}_iy_i\left(A(x)_{2ni,i}{\displaystyle \frac{1}{\overline{y}_i}}+A(x)_{2ni,i+1}\right)`$
$`+\overline{x}_iy_i\left(A(y)_{2n+1i,i+1}{\displaystyle \frac{1}{x_i}}+A(y)_{2ni,i+1}\right)`$
$`=\overline{x}_iy_i\left({\displaystyle \frac{1}{x_i}}+{\displaystyle \frac{1}{\overline{y}_i}}\right)\left(A(x)_{2ni,i}+A(y)_{2n+1i,i+1}\right),`$
where $`A(x)_{2ni,i+1}=A(x)_{2ni,i}/x_i`$ and $`A(y)_{2ni,i+1}=A(y)_{2n+1i,i+1}/\overline{y}_i`$ are used in the last equality. It remains to show $`A(x)_{2ni,i}=x_ix_n_{m=i+1}^{n1}x_m\overline{x}_m`$ and $`A(y)_{2n+1i,i+1}=\overline{y}_iy_n_{m=i+1}^{n1}y_m\overline{y}_m`$. Repeated use of (3.5) leads to $`A(x)_{2ni,i}=A(x)_{2ni,1}/(x_{i1}\mathrm{}x_1)`$. The former relation is derived by substituting (3.4) into $`A(x)_{2ni,1}`$ here. The latter follows from the former by (3.29). ∎

###### Lemma B.2.

(B.7) $`I_{j,i}`$ $`=I_{2n+1i,2n+1j}^{\sigma _n}`$ $`(1i,jn),`$
(B.8) $`I_{n+1,i}`$ $`=I_{n,i}^{\sigma _n}`$ $`(1in1).`$
###### Proof.

From the proof of Lemma 4.3, we know $`(x,y)=\tau ((x^{\sigma _n},y^{\sigma _n})^{})`$. Therefore by using (3.29) we have $`A(x)A(y)=J^tA(y^{\sigma _n})^tA(x^{\sigma _n})J=J^t(A(x^{\sigma _n})A(y^{\sigma _n}))J.`$ This yields the former relation. The latter relation follows from $`A(x)A(y)=J_nA(x^{\sigma _n})A(y^{\sigma _n})J_n`$ due to (3.28). ∎

The following expressions can be checked directly:

(B.9) $`I_{n+1,n}`$ $`=0,`$
(B.10) $`I_{i,i}`$ $`={\displaystyle \frac{x_iy_i}{\overline{x}_i\overline{y}_i}}(1in1),I_{n,n}=x_ny_n,`$
(B.11) $`I_{n,n1}`$ $`=x_{n1}x_ny_{n1}y_n\left({\displaystyle \frac{1}{x_{n1}}}+{\displaystyle \frac{1}{\overline{y}_{n1}y_n}}\right),`$
(B.12) $`I_{n+2,n1}`$ $`=y_{n1}y_n\overline{x}_{n1}\left(\overline{y}_{n1}+x_{n1}x_n\right)\left({\displaystyle \frac{1}{x_{n1}}}+{\displaystyle \frac{1}{\overline{y}_{n1}y_n}}\right).`$
###### Lemma B.3.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. Then we have

$$1+\frac{x_j^{}}{\overline{x}_j^{}}=\frac{V_{j1}}{W_{j1}}\left[\left(1+\frac{x_j}{\overline{x}_j}\right)V_{j1}^{}+(\mathrm{}(y)\mathrm{}(x))\left(\frac{x_jy_j}{\overline{x}_j\overline{y}_j}1\right)\right],$$

for $`2jn1`$.

###### Proof.

By definition of $`\stackrel{~}{R}`$ we obtain

(B.13)
$$1+\frac{x_j^{}}{\overline{x}_j^{}}=\frac{1}{W_{j1}}\left(W_{j1}+\frac{y_j}{\overline{y}_j}W_j\right).$$

In the parentheses of the right side, apply (4.10) to (4.16) to rewrite $`W_{j1}`$ and $`W_j`$. ∎

###### Lemma B.4.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. Then we have

(B.14)
$$y_i^{}\left(1+\frac{x_i^{}}{\overline{y}_i^{}}\right)=y_i\left(1+\frac{x_i}{\overline{y}_i}\right)\frac{W_i}{V_iV_i^{}},$$

for $`1in2`$.

###### Proof.

First we suppose $`2in2`$. By definition of $`\stackrel{~}{R}`$ we have

(B.15) $`1+{\displaystyle \frac{x_i^{}}{\overline{y}_i^{}}}`$ $`=`$ $`{\displaystyle \frac{y_i}{V_iV_{i1}^{}}}\left({\displaystyle \frac{V_iV_{i1}^{}}{y_i}}+{\displaystyle \frac{V_{i1}V_i^{}}{\overline{x}_i}}\right)`$
$`=`$ $`{\displaystyle \frac{y_i}{V_iV_{i1}^{}}}\left({\displaystyle \frac{1}{x_i}}+{\displaystyle \frac{1}{\overline{y}_i}}\right)W_i,`$
where the last step is due to (4.17). Multiplying the both sides by $`y_i^{}=x_i\frac{V_{i1}^{}}{V_i^{}}`$ we get the desired relation. For $`i=1`$, we have

(B.16) $`1+{\displaystyle \frac{x_1^{}}{\overline{y}_1^{}}}`$ $`=`$ $`{\displaystyle \frac{y_1}{V_1}}\left({\displaystyle \frac{V_1}{y_1}}+{\displaystyle \frac{V_1^{}}{\overline{x}_1}}\right)`$
$`=`$ $`{\displaystyle \frac{y_1}{V_1}}\left({\displaystyle \frac{1}{x_1}}+{\displaystyle \frac{1}{\overline{y}_1}}\right)V_0^{\sigma _1},`$
where the last step is due to $`\sigma _1`$ and $`\sigma _1`$ of (4.8). Now multiply the both sides by $`y_1^{}=x_1\frac{V_0}{V_1^{}}`$ and simplify the result by Lemma 4.12. ∎

###### Lemma B.5.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. Then we have

(B.17)
$$y_i^{}=y_i\left[1+\frac{\mathrm{}(x)\mathrm{}(y)}{V_i^{}}\left(1+\frac{x_i}{\overline{y}_i}\right)\right],$$

for $`1in2`$.

###### Proof.

This identity is a consequence of $`y_i^{}=x_i\frac{V_{i1}^{}}{V_i^{}}`$ and $``$ of (4.8). ∎

It is straightforward to check

###### Lemma B.6.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. Then we have

$`\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}x_m^{}\right)`$ $`=\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}y_m\right){\displaystyle \frac{V_iW_{j1}}{V_{j1}W_i}},(1ij1n2)`$
$`\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}x_m^{}\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{x}_m^{}\right)`$ $`=\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}y_m\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{y}_m\right){\displaystyle \frac{V_iV_{2nj}}{W_i}}.`$
$`(n+1j2n1)`$
###### Lemma B.7.

Let $`i,j`$ be integers such that $`1ij1n2`$. Suppose $`I_{j,i+1}`$ is invariant under $`\stackrel{~}{R}`$. Then $`I_{j,i}`$ is also invariant under $`\stackrel{~}{R}`$.

###### Proof.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. By applying Lemmas B.3, B.4, B.5 and B.6, the relation (B.2) is written as

$`I_{j,i}(x^{},y^{})`$ $`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right){\displaystyle \frac{1}{V_i^{}}}\left[\left(1+{\displaystyle \frac{x_j}{\overline{x}_j}}\right)V_{j1}^{}+(\mathrm{}(y)\mathrm{}(x))\left(I_{j,j}1\right)\right]\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}y_m\right)`$
(B.18) $`+y_i\left[1+{\displaystyle \frac{\mathrm{}(x)\mathrm{}(y)}{V_i^{}}}\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right)\right]\left(I_{j,i+1}\delta _{j,i+1}\right).`$
Thus it reduces to the following Lemma. ∎

###### Lemma B.8.

$`\left[\left(1+{\displaystyle \frac{x_j}{\overline{x}_j}}\right)V_{j1}^{}+(\mathrm{}(y)\mathrm{}(x))\left(I_{j,j}1\right)\right]\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}y_m\right)`$
(B.19) $`=\left({\displaystyle \underset{m=i+1}{\overset{j1}{}}}x_m\right)\left(1+{\displaystyle \frac{x_j}{\overline{x}_j}}\right)V_i^{}+(\mathrm{}(y)\mathrm{}(x))\left(I_{j,i+1}\delta _{j,i+1}\right),`$
for $`1ij1n2`$.

###### Proof.

By applying (B.2) and $``$ of (4.8) this is transformed into the same relation with $`i`$ replaced by $`i1`$. Thus it suffices to check (B.19) for $`i=j1`$, which is straightforward. ∎

###### Lemma B.9.

Let $`i`$ be an integer such that $`1in2`$. Suppose $`I_{n,i+1}`$ is invariant under $`\stackrel{~}{R}`$. Then $`I_{n,i}`$ is also invariant under $`\stackrel{~}{R}`$.

###### Proof.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. By applying Lemmas B.4, B.5 and B.6, the relation (B.4) is written as

(B.20)
$$I_{n,i}(x^{},y^{})=y_i\left(1+\frac{x_i}{\overline{y}_i}\right)\frac{V_{n1}}{V_i^{}}\left(\underset{m=i+1}{\overset{n}{}}y_m\right)+y_i\left[1+\frac{\mathrm{}(x)\mathrm{}(y)}{V_i^{}}\left(1+\frac{x_i}{\overline{y}_i}\right)\right]I_{n,i+1}.$$

Thus it reduces to the following Lemma. ∎

###### Lemma B.10.

For $`1in2`$

(B.21)
$$\left(\underset{m=i+1}{\overset{n}{}}y_m\right)V_{n1}=\left(\underset{m=i+1}{\overset{n}{}}x_m\right)V_i^{}+(\mathrm{}(y)\mathrm{}(x))I_{n,i+1}.$$

###### Proof.

By using (B.4) and $``$ of (4.8) this is transformed into the same relation with $`i`$ replaced by $`i1`$. Thus it suffices to check (B.21) for $`i=n2`$, which reads

$$y_{n1}y_nV_{n1}=x_{n1}x_nV_{n2}^{}+(\mathrm{}(y)\mathrm{}(x))I_{n,n1}.$$

This follows from (B.11) and $`\sigma _n`$ of (4.9). ∎

###### Lemma B.11.

Let $`i,j`$ be integers such that $`1i2njn2`$. Suppose $`I_{j,i+1}`$ is invariant under $`\stackrel{~}{R}`$. Then $`I_{j,i}`$ is also invariant under $`\stackrel{~}{R}`$.

###### Proof.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. By applying Lemmas B.4, B.5 and B.6, the relation (B.5) is written as

$`I_{j,i}(x^{},y^{})`$ $`=y_i\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right){\displaystyle \frac{V_{2nj}}{V_i^{}}}\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}y_m\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{y}_m\right)`$
(B.22) $`+y_i\left[1+{\displaystyle \frac{\mathrm{}(x)\mathrm{}(y)}{V_i^{}}}\left(1+{\displaystyle \frac{x_i}{\overline{y}_i}}\right)\right]I_{j,i+1}.`$
Thus it reduces to the following Lemma. ∎

###### Lemma B.12.

$`V_{2nj}\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}y_m\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{y}_m\right)`$ $`=V_i^{}\left({\displaystyle \underset{m=i+1}{\overset{n}{}}}x_m\right)\left({\displaystyle \underset{m=2n+1j}{\overset{n1}{}}}\overline{x}_m\right)`$
(B.23) $`+(\mathrm{}(y)\mathrm{}(x))I_{j,i+1},`$
for $`1i2njn2`$.

###### Proof.

By applying $``$ of (4.8) and (B.5) this is transformed into the same relation with $`i`$ replaced by $`i1`$. Thus it suffices to check (B.23) for $`i=2nj`$, which is done in the next Lemma. ∎

###### Lemma B.13.

(B.24)
$$V_i\left(y_n\underset{m=i+1}{\overset{n1}{}}y_m\overline{y}_m\right)=V_i^{}\left(x_n\underset{m=i+1}{\overset{n1}{}}x_m\overline{x}_m\right)+(\mathrm{}(y)\mathrm{}(x))I_{2ni,i+1},$$

for $`1in2`$.

###### Proof.

By applying (4.8), $``$ of (4.8) and (B.6) this is transformed into the same relation with $`i`$ replaced by $`i1`$. Thus it suffices to check (B.24) for $`i=1`$. Consider the trivial identity:

$$V_0\left(y_n\underset{m=1}{\overset{n1}{}}y_m\overline{y}_m\right)=V_0\left(x_n\underset{m=1}{\overset{n1}{}}x_m\overline{x}_m\right)+(\mathrm{}(y)\mathrm{}(x))I_{2n,1}.$$

The $`i=1`$ case of (B.24) is shown by applying (4.8), $``$ of (4.8) and (B.6) to this identity. ∎

###### Lemma B.14.

Let $`i`$ be an integer such that $`1in`$. Then $`I_{i,i}`$ is invariant under $`\stackrel{~}{R}`$.

###### Proof.

This is clear from (B.10). ∎

###### Lemma B.15.

$`I_{n,n1}`$ is invariant under $`\stackrel{~}{R}`$.

###### Proof.

Let $`(x^{},y^{})=\stackrel{~}{R}(x,y)`$. From (B.3) and Theorem B.14 we have

(B.25)
$$I_{n,n1}(x^{},y^{})=\frac{x_{n1}}{\overline{x}_{n1}}y_{n1}y_n\frac{V_{n2}}{V_{n1}^{}}+x_{n1}\frac{V_{n2}^{}}{V_{n1}^{}}I_{n,n}.$$

By using $`\sigma _n`$ and $``$ of (4.9) we recover the right hand side of (B.3). ∎

###### Proof of Proposition 4.16.

It should be shown that all $`I_{j,i}`$’s are invariant under $`\stackrel{~}{R}`$. In view of $`I_{n+1,n}=0`$, $`I_{j,i}=0(j<i)`$, (B.7) and Proposition 4.11, it suffices to check the case $`i+j2n+1`$. Suppose $`1jn1`$. Then the claim follows from Lemmas B.7 and B.14. Suppose $`j=n`$. Then the claim follows from Lemmas B.9, B.14 and B.15. Suppose $`j=n+1`$ and $`1in1`$. Then the claim follows from $`j=n`$ due to (B.8) and Proposition 4.11. We have already proved the invariance of $`I_{n1,n1},I_{n,n1}`$ and $`I_{n+1,n1}`$. Because of the identity (B.1), $`I_{n+2,n1}`$ in (B.12) is also invariant. Then the claim for $`j=n+2`$ follows from Lemma B.11. Similarly the invariance of $`I_{na,na},I_{na+1,na},\mathrm{},I_{n+a,na}(1an1)`$ implies the invariance of $`I_{n+a+1,na}`$ by (B.1), and the claim for $`j=n+a+1,1ina`$ follows from Lemma B.11. By induction on $`a`$ the proof is completed. ∎