text:
# 1 Introduction

## 1 Introduction

Let $`U=U_q(𝐠)`$ be the quantum group associated to a semisimple Lie algebra $`𝐠`$ of rank $`n`$. The negative part $`U^{}`$ of $`U`$ has a canonical basis $`𝐁`$ with favourable properties (see Kashiwara  and Lusztig \[11, §14.4.6\]). For example, via action on highest weight vectors it gives rise to bases for all the finite-dimensional irreducible highest weight $`U`$-modules.

Let $`W`$ be the Weyl group of $`𝐠`$, with Coxeter generators $`s_1,s_2,\mathrm{},s_n`$, and let $`w_0`$ be the element of maximal length in $`W`$. Let $`𝐢`$ be a reduced expression for $`w_0`$, i.e. $`w_0=s_{i_1}s_{i_2}\mathrm{}s_{i_k}`$ is reduced. Lusztig obtains a parametrization of the canonical basis $`𝐁`$ for each such reduced expression $`𝐢`$, via a correspondence between a basis of PBW-type associated to $`𝐢`$ and the canonical basis. This gives a bijection

$$\varphi _𝐢:𝐁^k,$$

where $`=\{0,1,2,\mathrm{}\}`$.

Kashiwara, in his approach to the canonical basis (which he calls the global crystal basis), defines certain root operators $`\stackrel{~}{F}_i`$ on the canonical basis (see \[6, §3.5\]) which lead to a parametrization of the canonical basis for each reduced expression $`𝐢`$ by a certain subset $`Y_𝐢`$ of $`^k`$. This gives a bijection $`\psi _𝐢:𝐁Y_𝐢`$. The subset $`Y_𝐢`$ is called the string cone.

In Lusztig’s theory, an important role is played by two specific reduced expressions $`𝐣`$ and $`𝐣^{}`$, which in type $`A_4`$ with Dynkin diagram as in Figure $`1`$ are $`𝐣=(1,3,2,4,1,3,2,4,1,3)`$ and $`𝐣^{}=(2,4,1,3,2,4,1,3,2,4)`$.

Figure $`1`$: Dynkin diagram of type $`A_4`$ $``$$``$$``$$``$      $`1`$$`2`$$`3`$$`4`$

The function $`R_𝐣^𝐣^{}=\varphi _𝐣^{}\varphi _𝐣^1:^k^k`$ was shown by Lusztig to be piecewise-linear, and the regions of linearity of this function were shown to be relevant to understanding the behaviour of the canonical basis.

The function $`S_𝐢^𝐣=\varphi _𝐣\psi _𝐢^1:Y_𝐢^k`$ is useful in relating Kashiwara’s and Lusztig’s parametrizations of $`𝐁`$. These re-parametrization functions have recently been studied using an approach involving totally positive varieties, in the preprint  of Berenstein and Zelevinsky (although not in terms of regions of linearity).

There is no simple way to express the elements of $`𝐁`$ in terms of the natural generators $`F_1,F_2,\mathrm{},F_n`$ of $`U^{}`$. This has been done only in types $`A_1,A_2,A_3`$ and $`B_2`$ (see \[8, §3.4\]\[12, §13\] and ) and appears to become arbitrarily complicated in general. However it seems that there is an interesting subset of $`𝐁`$ whose elements are expressible as monomials in $`F_1,F_2,\mathrm{},F_n`$.

A monomial $`F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}`$, where $`F_i^{(a)}=F_i^a/[a]!`$, is said to be tight if it belongs to $`𝐁`$. Lusztig  described a method which in low rank cases leads to the construction of tight monomials. He defined, for each reduced expression $`𝐢`$ of $`w_0`$, a certain cone $`C_𝐢`$ in $`^k`$ which we shall call the Lusztig cone, and showed that, for types $`A_1,A_2,A_3`$, the above monomial is tight for all $`𝐚C_𝐢`$. In  the second author showed that this is also true in type $`A_4`$. Let

$$M_𝐢=\{F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}:𝐚C_𝐢\}$$

be the set of monomials obtained from elements of $`C_𝐢`$.

There appears to be an intriguing relationship between the Lusztig cones, the regions of linearity of Lusztig’s function $`R_𝐣^𝐣^{}`$, and the tight monomials in the canonical basis. This relationship is not fully understood in general, but the aim of this paper is to describe this relationship in the type $`A_4`$ case. Types $`A_1,A_2,A_3`$ were considered by Lusztig, but the $`A_4`$ case is considerably more complicated, while at the same time being amenable to explicit calculation.

In type $`A_4`$ we can show the following. For each $`𝐚C_𝐢`$ we have

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}modv^{},$$

where $`^{}`$ is the $`𝒜`$-lattice spanned by $`𝐁`$ and $`𝒜`$ is the subring of $`(v)`$ of functions regular at $`v=0`$. Since it has been shown (independently by the second author  and Premat ) that $`C_𝐢Y_𝐢`$, it follows that $`M_𝐢𝐁`$ and that, under the Kashiwara parametrization of $`𝐁`$, we have

$$\psi _𝐢(M_𝐢)=C_𝐢.$$

We can also show that, under Lusztig’s parametrization of $`𝐁`$, we have

$$\varphi _𝐣(M_𝐢)=X_𝐢,$$

where $`X_𝐢`$ is one of the regions of linearity of the piecewise-linear function $`R_𝐣^𝐣^{}`$ and that the transition function

$$S_𝐢^𝐣:C_𝐢X_𝐢$$

is linear for all $`𝐢`$.

The set of all regions of linearity of $`R_𝐣^𝐣^{}`$ in type $`A_4`$ was determined by the first author using the ideas outlined in . These regions are described in the present paper. Each such region is defined by a certain set of inequalities. It turns out that the regions $`X_𝐢`$ are all defined by the minimal possible number of inequalities, and that they give the set of all regions defined by this minimal number of inequalities. We call these the simplicial regions of $`R_𝐣^𝐣^{}`$. We thus have a parametrization of the simplicial regions in terms of the reduced expressions $`𝐢`$ of $`w_0`$ modulo commutation. A graph can be defined on the set of simplicial regions with respect to adjacency, and we further show that this graph is isomorphic to the graph with vertices given by the reduced expressions $`𝐢`$ of $`w_0`$ modulo commutation and edges given by long braid relations.

Thus in type $`A_4`$ there are close relationships between the Lusztig cones $`C_𝐢`$, the tight monomials $`M_𝐢`$, and the regions of linearity $`X_𝐢`$. Examples of N. H. Xi  and M. Reineke  show, however, that these relationships cannot be expected to hold in the same way in type $`A_n`$ for arbitrary $`n`$.

## 2 Parametrizations of the canonical basis

Let $`𝐠`$ be the simple Lie algebra over $``$ of type $`A_n`$ and $`U`$ be the quantized enveloping algebra of $`𝐠`$. Then $`U`$ is a $`(v)`$-algebra generated by the elements $`E_i`$, $`F_i`$, $`K_\mu `$, $`i\{1,2,\mathrm{},n\}`$, $`\mu Q`$, the root lattice of $`𝐠`$. Let $`U^+`$ be the subalgebra generated by the $`E_i`$ and $`U^{}`$ the subalgebra generated by the $`F_i`$.

Let $`W`$ be the Weyl group of $`𝐠`$. It has a unique element $`w_0`$ of maximal length. For each reduced expression $`𝐢`$ for $`w_0`$ there are two parametrizations of the canonical basis $`𝐁`$ for $`U^{}`$. The first arises from Lusztig’s approach to the canonical basis \[11, §14.4.6\], and the second arises from Kashiwara’s approach .

Lusztig’s Approach
There is an $``$-algebra automorphism of $`U`$ which takes each $`E_i`$ to $`F_i`$, $`F_i`$ to $`E_i`$, $`K_\mu `$ to $`K_\mu `$ and $`v`$ to $`v^1`$. We use this automorphism to transfer Lusztig’s definition of the canonical basis in \[8, §3\] to $`U^{}`$.

Let $`T_i`$, $`i=1,2,\mathrm{},n`$, be the automorphism of $`U`$ as in \[10, §1.3\] given by:

$$T_i(E_j)=\{\begin{array}{cc}F_jK_j,& \mathrm{if}i=j,\\ E_j,& \mathrm{if}|ij|>1\\ E_iE_j+v^1E_jE_i& \mathrm{if}|ij|=1\end{array}$$

$$T_i(F_j)=\{\begin{array}{cc}K_j^1E_j,& \mathrm{if}i=j,\\ F_j,& \mathrm{if}|ij|>1\\ F_jF_i+vF_iF_j& \mathrm{if}|ij|=1\end{array}$$

$$T_i(K_\mu )=K_{\mu \mu ,\alpha _ih_i},\mathrm{for}\mu Q,$$

where $`\alpha _i`$ are the simple roots and $`h_i`$ the simple coroots of $`𝐠`$.

For each $`i`$, let $`r_i`$ be the automorphism of $`U`$ which fixes $`E_j`$ and $`F_j`$ for $`j=i`$ or $`|ij|>1`$ and fixes $`K_\mu `$ for all $`\mu `$, and which takes $`E_j`$ to $`E_j`$ and $`F_j`$ to $`F_j`$ if $`|ij|=1`$. Let $`T_{i,1}^{\prime \prime }=T_ir_i`$ be the automorphism of $`U`$ as in \[11, §37.1.3\]. Let $`𝐜^k`$, where $`k=\mathrm{}(w_0)`$, and $`𝐢`$ be a reduced expression for $`w_0`$. Let

$$F_𝐢^𝐜:=F_{i_1}^{(c_1)}T_{i_1,1}^{\prime \prime }(F_{i_2}^{(c_2)})\mathrm{}T_{i_1,1}^{\prime \prime }T_{i_2,1}^{\prime \prime }\mathrm{}T_{i_{k1},1}^{\prime \prime }(F_{i_k}^{(c_k)}).$$

Define $`B_𝐢=\{F_𝐢^𝐜:𝐜^k\}`$. Then $`B_𝐢`$ is the basis of PBW-type corresponding to the reduced expression $`𝐢`$. Let $`\overline{}`$ be the $``$-algebra automorphism from $`U`$ to $`U`$ taking $`E_i`$ to $`E_i`$, $`F_i`$ to $`F_i`$, and $`K_\mu `$ to $`K_\mu `$, for each $`i[1,n]`$ and $`\mu Q`$, and $`v`$ to $`v^1`$. Lusztig proves the following result in \[8, §§2.3, 3.2\].

###### Theorem 2.1

(Lusztig)
The $`Z[v]`$-span $``$ of $`B_𝐢`$ is independent of $`𝐢`$. Let $`\pi :/v`$ be the natural projection. The image $`\pi (B_𝐢)`$ is also independent of $`𝐢`$; we denote it by $`B`$. The restriction of $`\pi `$ to $`\overline{}`$ is an isomorphism of $``$-modules $`\pi _1:\overline{}/v`$. Also $`𝐁=\pi _1^1(B)`$ is a $`(v)`$-basis of $`U^{}`$, which is the canonical basis of $`U^{}`$.

Lusztig’s theorem provides us with a parametrization of $`𝐁`$, dependent on $`𝐢`$. If $`b𝐁`$, we write $`\varphi _𝐢(b)=𝐜`$, where $`𝐜^k`$ satisfies $`bF_𝐢^𝐜modv`$. Note that $`\varphi _𝐢`$ is a bijection.

Lusztig considers in  two particular reduced expressions for $`w_0`$. Let the nodes in the Dynkin diagram of $`A_n`$ be labelled as in Figure $`2`$.

Let $`𝐣=135\mathrm{}246\mathrm{}135\mathrm{}246\mathrm{}`$, and let $`𝐣^{}=246\mathrm{}135\mathrm{}246\mathrm{}135\mathrm{}`$, where both expressions have length $`k=\mathrm{}(w_0)`$ — they are both reduced expressions for $`w_0`$. We have bijections $`\varphi _𝐣:𝐁^k`$ and $`\varphi _𝐣^{}:𝐁^k`$.

Lusztig defines in \[8, §2.6\] a function $`R_𝐣^𝐣^{}=\varphi _𝐣^{}\varphi _𝐣^1:^k^k`$. This function was shown by Lusztig to be piecewise linear and its regions of linearity were shown to have significance for the canonical basis, in the sense that elements $`b`$ of the canonical basis with $`\varphi _𝐣(b)`$ in the same region of linearity of $`R_𝐣^𝐣^{}`$ often have similar form.

Kashiwara’s approach

Let $`\stackrel{~}{E}_i`$ and $`\stackrel{~}{F}_i`$ be the Kashiwara operators on $`U^{}`$ as defined in \[6, §3.5\]. Let $`𝒜(v)`$ be the subring of elements regular at $`v=0`$, and let $`^{}`$ be the $`𝒜`$-lattice spanned by arbitrary products $`\stackrel{~}{F}_{j_1}\stackrel{~}{F}_{j_2}\mathrm{}\stackrel{~}{F}_{j_m}1`$ in $`U^{}`$. We denote the set of all such elements by $`S`$. The following results were proved by Kashiwara in .

###### Theorem 2.2

(Kashiwara)
(i) Let $`\pi ^{}:^{}^{}/v^{}`$ be the natural projection, and let $`B^{}=\pi ^{}(S)`$. Then $`B^{}`$ is a $``$-basis of $`^{}/v^{}`$ (the crystal basis).
(ii) Furthermore, $`\stackrel{~}{E}_i`$ and $`\stackrel{~}{F}_i`$ each preserve $`^{}`$ and thus act on $`^{}/v^{}`$. They satisfy $`\stackrel{~}{E}_i(B^{})B^{}\{0\}`$ and $`\stackrel{~}{F}_i(B^{})B^{}`$. Also for $`b,b^{}B^{}`$ we have $`\stackrel{~}{F}_ib=b^{}`$, if and only if $`\stackrel{~}{E}_ib^{}=b`$.
(iii) For each $`bB^{}`$, there is a unique element $`\stackrel{~}{b}^{}\overline{^{}}`$ such that $`\pi ^{}(\stackrel{~}{b})=b`$. The set of elements $`\{\stackrel{~}{b}:bB^{}\}`$ forms a basis of $`U^{}`$, the global crystal basis of $`U^{}`$.

It was shown by Lusztig \[9, 2.3\] that the global crystal basis of Kashiwara coincides with the canonical basis of $`U^{}`$.

There is a parametrization of $`𝐁`$ arising from Kashiwara’s approach, again dependent on a reduced expression $`𝐢`$ for $`w_0`$. Let $`𝐢=(i_1,i_2,\mathrm{},i_k)`$ and $`bB`$. Let $`a_1`$ be maximal such that $`\stackrel{~}{E}_{i_1}^{a_1}b0modv^{}`$; let $`a_2`$ be maximal such that $`\stackrel{~}{E}_{i_2}^{a_2}\stackrel{~}{E}_{i_1}^{a_1}b0modv^{}`$, and so on, so that $`a_k`$ is maximal such that $`\stackrel{~}{E}_{i_k}^{a_k}\stackrel{~}{E}_{i_{k1}}^{a_{k1}}\mathrm{}\stackrel{~}{E}_{i_2}^{a_2}\stackrel{~}{E}_{i_1}^{a_1}b0modv^{}`$. Let $`𝐚=(a_1,a_2,\mathrm{},a_k)`$. We write $`\psi _𝐢(b)=𝐚`$. This is the crystal string of $`b`$ — see \[3, §2\] and the end of Section $`2`$ in ; see also . It is known that $`\psi _𝐢(b)`$ uniquely determines $`b𝐁`$ (see \[16, §2.5\]). We have $`b\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1modv^{}`$. The image of $`\psi _𝐢`$ is a cone which first appears in . We shall call this the string cone $`Y_𝐢=\psi _𝐢(𝐁)`$.

We next define a function which compares Kashiwara’s approach with Lusztig’s approach. Consider the maps

$$Y_𝐢\underset{\psi _𝐢^1}{\overset{}{}}B\underset{\varphi _𝐣}{\overset{}{}}^k$$

where $`𝐣=135\mathrm{}246\mathrm{}135\mathrm{}246\mathrm{}`$. We define $`S_𝐢^𝐣=\varphi _𝐣\psi _𝐢^1:Y_𝐢^k`$, a reparametrization function. We shall show that this function has some interesting properties in the case in which $`𝐠`$ has type $`A_4`$.

## 3 The Lusztig cones and their spanning vectors

Lusztig  introduced certain regions which, in low rank, give rise to canonical basis elements of a particularly simple form. We consider reduced expressions $`𝐢=(i_1,i_2,\mathrm{},i_k)`$ for $`w_0`$. We shall identify this $`k`$-tuple with the reduced expression $`s_{i_1}s_{i_2}\mathrm{}s_{i_k}`$. Given two such reduced expressions we say that $`𝐢𝐢^{}`$ if there is a sequence of commutations (of the form $`s_is_j=s_js_i`$ with $`|ij|>1`$) which, when applied to $`𝐢`$, give $`𝐢^{}`$. This is an equivalence relation on the set of reduced expressions for $`w_0`$, and the equivalence classes are called commutation classes.

The Lusztig cone, $`C_𝐢`$, corresponding to a reduced expression $`𝐢`$ for $`w_0`$ is defined to be the set of points $`𝐚^k`$ satisfying the following inequalities:
(\*) For every pair $`s,s^{}[1,k]`$ with $`s<s^{}`$, $`i_s=i_s^{}=i`$ and $`i_pi`$ whenever $`s<p<s^{}`$, we have

$$(\underset{p}{}a_p)a_sa_s^{}0,$$

where the sum is over all $`p`$ with $`s<p<s^{}`$ such that $`i_p`$ is joined to $`i`$ in the Dynkin diagram.

It was shown by Lusztig  that if $`𝐚C_𝐢`$ then the monomial $`F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}`$ lies in the canonical basis $`𝐁`$, provided $`n=1,2,3`$. The second author  showed that this remains true if $`n=4`$. The Lusztig cones have been studied in the second author’s preprints  and  in type $`A`$ for every reduced expression $`𝐢`$ for the longest word, and have also been studied by Bedard in  for arbitrary finite (simply-laced) type for reduced expressions compatible with a quiver whose underlying graph is the Dynkin diagram. Bedard describes these vectors using the Auslander-Reiten quiver of the quiver and homological algebra, showing they are closely connected to the representation theory of the quiver.

The reduced expression $`𝐢`$ defines an ordering on the set $`\mathrm{\Phi }^+`$ of positive roots of the root system associated to $`W`$. We write $`\alpha ^j=s_{i_1}s_{i_2}\mathrm{}s_{i_{j1}}(\alpha _{i_j})`$ for $`j=1,2,\mathrm{},k`$. Then $`\mathrm{\Phi }^+=\{\alpha ^1,\alpha ^2,\mathrm{}\alpha ^k\}`$. For $`𝐚=(a_1,a_2,\mathrm{},a_k)^k`$, write $`a_{\alpha ^j}=a_j`$. If $`\alpha =\alpha _{ij}:=\alpha _i+\alpha _{i+1}+\mathrm{}+\alpha _{j1}`$ with $`i<j`$, we also write $`a_{ij}`$ for $`a_{\alpha _{ij}}`$.

We can regard $`C_𝐢`$ as a subset of $`^k`$ defined by the inequalities in (\*) above, together with the $`n`$ inequalities $`a_{\alpha _j}0`$ for $`j=1,2,\mathrm{},n`$ (see the paragraph before Lemma 4.2 in ). The number of inequalities in (\*) is $`kn`$, thus we have $`k`$ inequalities altogether defining $`C_𝐢`$. There is therefore a matrix $`P_𝐢M_k()`$ such that

$$C_𝐢=\{𝐚^k:P_𝐢𝐚0\},$$

where, for $`𝐳^k`$, $`𝐳0`$ means that each entry in $`𝐳`$ is nonnegative.

There is a description of $`C_𝐢`$ in  which will be useful to us. We shall need the chamber diagram (chamber ansatz) for $`𝐢`$ defined in \[2, §§1.4, 2.3\]. We take $`n+1`$ strings, numbered from top to bottom, and write $`𝐢`$ from left to right along the bottom of the diagram. Above a letter $`i_j`$ in $`𝐢`$, the $`i_j`$th and $`(i_j+1)`$st strings from the top above $`i_j`$ cross. Thus, for example, in the case $`n=3`$ with $`𝐢=(1,3,2,1,3,2)`$, the chamber diagram is shown in Figure $`3`$.

We denote the chamber diagram of $`𝐢`$ by CD($`𝐢`$). We shall be concerned with the bounded chambers of the diagram. A chamber will be defined as a pair $`(c,𝐢)`$, where $`c`$ is a bounded component of the complement of CD($`𝐢`$). Each chamber $`(c,𝐢)`$ can be labelled with the numbers of the strings passing below it, denoted $`l(c,𝐢)`$. Following , we call such a label a chamber set. For example, the chamber sets corresponding to the $`3`$ bounded chambers in Figure $`3`$ are $`134,3,13`$.

There is another way to think of the set of bounded chambers in a chamber diagram. We recall that a quiver of type $`A_n`$ is a directed graph such that the underlying undirected graph is the Dynkin diagram of type $`A_n`$. Following \[13, §5.1\], we define a partial quiver $`P`$ of type $`A_n`$ to be a quiver of type $`A_n`$ which has some (or none) of its arrows replaced by undirected edges in such a way that the subgraph obtained by deleting undirected edges and vertices incident only with undirected edges is non-empty and connected. We shall now number the edges of a partial quiver of type $`A_n`$ from $`2`$ to $`n`$, starting from the right, as in Figure $`4`$.

If $`P`$ is a partial quiver of type $`A_n`$, we denote by $`l(P)`$ the subset of $`[1,n+1]`$ defined as follows: Let $`l_1(P)=\{j[2,n]:\text{edge }j\text{ of }P\text{ is an }L\}`$ (this means that edge $`j`$ has an arrow pointing to the left). If the rightmost directed edge of $`P`$ is an $`R`$, and this is in position $`i`$, then let $`l_2(P)=[1,i1]`$. Otherwise $`l_2(P)`$ is the empty set. If the leftmost directed edge of $`P`$ is an $`R`$, and this is edge $`j`$, let $`l_3(P)=[j+1,n+1]`$. Otherwise $`l_3(P)`$ is the empty set. We then define $`l(P)=l_1(P)l_2(P)l_3(P)`$.

It is shown in \[13, §5.4\] that the map $`l`$ is a bijection from the set of partial quivers of type $`A_n`$ to the set of all chamber sets. For example, the chamber sets associated to the $`8`$ partial quivers of type $`A_3`$ are shown in Figure $`5`$.

We now consider spanning vectors for the Lusztig cone $`C_𝐢`$. The $`k\times k`$ matrix $`P_𝐢`$ has an inverse $`Q_𝐢`$ with entries in $``$ (see \[13, §4.2\]). We have $`k=\frac{1}{2}n(n+1)`$. Note that $`kn=\frac{1}{2}n(n1)`$ of the rows of $`P_𝐢`$ correspond to inequalities arising from consecutive occurrences of a letter in $`𝐢`$. Each such consecutive pair corresponds naturally to a bounded chamber $`(c,𝐢)`$. Thus for each chamber $`(c,𝐢)`$, there is a corresponding row of $`P_𝐢`$ and therefore a corresponding column of $`Q_𝐢`$. Now the columns of $`Q_𝐢`$ give spanning vectors of $`C_𝐢`$ in the sense that the elements of $`C_𝐢`$ are nonnegative linear combinations of such spanning vectors. We denote this spanning vector by $`𝐚(c,𝐢)`$. The remaining $`n`$ rows of $`P_𝐢`$ correspond to inequalities $`a_{\alpha _j}0`$ for $`\alpha _j`$ a simple root. We denote the corresponding spanning vectors by $`𝐚(j,𝐢)`$. Thus the $`k`$ spanning vectors of $`C_𝐢`$ are:

$`𝐚(c,𝐢)`$ $`\text{(}kn\text{ vectors)},`$
$`𝐚(j,𝐢)`$ $`\text{(}n\text{ vectors)}.`$
It is shown in  how to obtain the spanning vectors $`𝐚(c,𝐢)`$, $`𝐚(j,𝐢)`$. We recall that the coordinates of $`𝐚=(a_1,a_2,\mathrm{},a_k)`$ correspond naturally to the positive roots $`\alpha ^1,\alpha ^2,\mathrm{},\alpha ^k`$, given the reduced expression $`𝐢`$ for $`w_0`$. It is possible to find the spanning vectors by attaching to each positive root $`\alpha ^m`$ a multiplicity $`a_m`$, which will be the appropriate coordinate of the spanning vector $`𝐚`$. It is shown in  that the multiplicity function $`\alpha ^ma_m`$ for $`𝐚(c,𝐢)`$ depends only upon the partial quiver $`P`$ with $`l(P)=l(c,𝐢)`$, and that the multiplicity function for $`𝐚(j,𝐢)`$ depends only upon $`j`$. These multiplicity functions are constructed by the following algorithm.

For $`j[1,n]`$, the multiplicity of a positive root $`\alpha _{pq}=\alpha _p+\alpha _{p+1}+\mathrm{}+\alpha _{q1}`$ is $`1`$ if $`1pj<j+1qn+1`$ and is $`0`$ otherwise. This determines the spanning vector $`𝐚(j,𝐢)`$, whose components are all either $`0`$ or $`1`$.

For a partial quiver $`P`$ the multiplicity of a positive root $`\alpha _{pq}`$ is given as follows. We consider the components of $`P`$, i.e. the maximal connected subquivers all of whose arrows point in the same direction. For each component $`Y`$ of $`P`$ let $`a(Y)`$ be the number of the leftmost edge to the right of $`Y`$ and let $`b(Y)`$ be the number of the rightmost edge to the left of $`Y`$. We have $`a(Y)<b(Y)`$. The component $`Y`$ determines a set $`\mathrm{\Phi }^+(Y)`$ of positive roots $`\alpha _{pq}`$ such that $`1pa(Y)<b(Y)qn+1`$. Let $`m_{pq}`$ be the number of components $`Y`$ of $`P`$ such that $`\alpha _{pq}\mathrm{\Phi }^+(Y)`$. Then the multiplicity $`a_{pq}`$ of $`\alpha _{pq}`$ is given by $`a_{pq}=\frac{1}{2}m_{pq}`$, which is the smallest integer $`m`$ with $`\frac{1}{2}m_{pq}m`$. The multiplicity $`a_{pq}`$ is the coordinate of $`𝐚(c,𝐢)`$ corresponding to the positive root $`\alpha _{pq}`$.

## 4 Transforms of the Lusztig cones and their spanning vectors

We now bring into play the parametrization of the canonical basis $`𝐁`$ arising from Kashiwara’s approach. We recall there is a bijection

$$\psi _𝐢:𝐁Y_𝐢$$

between the canonical basis and the string cone $`Y_𝐢`$. Now it has been shown by the second author  and independently by Premat  that $`C_𝐢Y_𝐢`$, i.e. that the Lusztig cone lies in the string cone. Thus there is a corresponding subset $`\psi _𝐢^1(C_𝐢)`$ of the canonical basis $`𝐁`$.

We also have a bijection

$$\varphi _𝐢:𝐁^k$$

and a transition function

$$S_𝐢^𝐣:Y_𝐢^k$$

given by $`S_𝐢^𝐣=\varphi _𝐣\psi _𝐢^1`$. We consider the question: what is the subset $`S_𝐢^𝐣(C_𝐢)`$ of $`^k`$ corresponding to the Lusztig cone $`C_𝐢`$? We state the following conjecture:

###### Conjecture 4.1

For any reduced expression $`𝐢`$ of $`w_0`$, $`S_𝐢^𝐣(C_𝐢)`$ is a region of linearity of Lusztig’s piecewise-linear function $`R=R_𝐣^𝐣^{}`$.

We now describe an algorithm proved by the authors, as yet unpublished, which gives the transforms $`S_𝐢^𝐣(𝐚(c,𝐢))`$, $`S_𝐢^𝐣(𝐚(j,𝐢))`$ of the spanning vectors of $`C_𝐢`$.

We first define a $`(p,q,r,s)`$-rectangle. Suppose we begin with the array of numbers as in Figure $`6`$.

Let $`(p,q,r,s)^4`$. A $`(p,q,r,s)`$-rectangle is a rectangle in this array, with top vertex on line $`p`$, middle vertices on lines $`q,r`$, and bottom vertex on line $`s`$ and with all vertices lying half-way between two numbers. All lines of the rectangle are at an angle of $`\pm \pi /4`$ to the horizontal. This forces $`p<q<s`$, $`p<r<s`$ and $`p+s=q+r`$. We take only alternate columns of numbers in the rectangle, starting with the first column if $`q`$ is odd, and with the second column if $`q`$ is even. A $`(0,3,5,8)`$-rectangle is shown in Figure $`7`$.

Let $`P`$ be a partial quiver. Let $`Y`$ be a component of $`P`$ and let $`a=a(Y)`$ and let $`b=b(Y)`$ be the integers defined above. Let $`\rho (Y)`$ be a $`(0,a,n+2b,n+ab+2)`$-rectangle if $`Y`$ has type $`L`$, and a $`(ba1,b1,n+1a,n+1)`$-rectangle if $`Y`$ is of type $`R`$.

Now let $`j[1,n]`$. Let $`a=j`$ and $`b=j+1`$. Let $`\rho (j)`$ be a $`(0,a,n+2b,n+ab+2)=(0,j,n+1j,n+1)`$-rectangle (note that this is also a $`(ba1,b1,n+1a,n+1)`$-rectangle).

We define the diagram $`E(P)`$ of $`P`$ in the following way. We go through the components $`Y`$ of $`P`$ one by one, from left to right. It is possible to fit the rectangles $`\rho (Y)`$ together as follows. If a component of type $`L`$ is followed by a component of type $`R`$, the corresponding rectangles share leftmost corners, and if a component of type $`R`$ is followed by a component of type $`L`$, they share rightmost corners. In each case, it is easy to see that when the rectangles are superimposed, sharing a common leftmost or rightmost corner, the overlapping numbers agree. The resulting diagram is defined to be $`E(P)`$. It is convenient to label each rectangle by the corresponding component of $`P`$; on the left hand corner if $`Y`$ is of type $`R`$, and on the right hand corner if $`Y`$ is of type $`L`$.

We also define the diagram $`E(j)`$ for each $`j[1,n]`$. $`E(j)`$ is defined to be the rectangle $`\rho (j)`$.

Example
We consider the case when $`n=6`$ and $`P=LRLL`$. Then $`P`$ has three components, $`L_1=L`$, $`R_1=R`$ and $`L_2=LL`$. The rectangles $`\rho (Y)`$ are as in Figure $`8`$.

These rectangles fit together to give the diagram $`E(P)`$. The left hand corners of $`\rho (L_1),\rho (R_1)`$ match, and so do the right hand corners of $`\rho (R_1),\rho (L_2)`$. The diagram $`E(P)`$ is shown in Figure $`9`$.

If $`P`$ is a partial quiver, the sides of the rectangles $`\rho (Y)`$ for $`Y`$ a component of $`P`$ divide $`E(P)`$ into diagonal rows of smaller rectangles called boxes. Consider the boxes in a diagonal running from top left to bottom right. The number of boxes in such a diagonal will be odd for the first $`p`$ diagonals, starting from the top, for some $`p`$, and even for the remaining diagonals (or vice versa). Let $`G`$ be the line in the diagram dividing the two adjacent diagonals containing an even and an odd number of boxes. Similarly, we can consider the boxes in a diagonal running from top right to bottom left. Again, it is possible to draw a line $`H`$ separating the diagonals with an odd number of boxes from those with an even number. Let $`C`$ be the point of intersection of the lines $`G,H`$. We call $`C`$ the centre of the diagram $`E(P)`$. Let $`V`$ be the vertical line through $`C`$. In our example, the picture is shown in Figure $`10`$.

Let $`X`$ be an extremal left or right corner of $`E(P)`$. Let $`R(X)`$ be the rectangle which has the given corner as a vertex and whose edges through this point extend as far as possible in the figure (the vertex of the rectangle opposite to the given corner point may not be explicitly shown in the figure). The vertical line $`V`$ divides $`R(X)`$ into two parts; let $`\mathrm{\Phi }^+(X)`$ be the set of positive roots obtained from the part of $`R(X)`$ on the same side of $`V`$ as $`X`$, by reading the numbers downwards in vertical lines. Thus $`i,i+1,\mathrm{},j`$ gives the positive root $`\alpha _i+\alpha _{i+1}+\mathrm{}+\alpha _j`$. Let $`\mathrm{\Phi }^+(P)`$ be the union of $`\mathrm{\Phi }^+(X)`$ for all left and right corners $`X`$. Thus in the example in Figure $`9`$ we have:

$`\mathrm{\Phi }^+(L_1)`$ $`=`$ $`\{\alpha _1+\alpha _2\}`$
$`\mathrm{\Phi }^+(L_2)`$ $`=`$ $`\{\alpha _2+\alpha _3+\alpha _4\}`$
$`\mathrm{\Phi }^+(R_1)`$ $`=`$ $`\{\alpha _5,\alpha _3+\alpha _4+\alpha _5+\alpha _6\}`$
$`\mathrm{\Phi }^+(X_0)`$ $`=`$ $`\{\alpha _1+\alpha _2+\alpha _3\}`$
where $`X_0`$ is the only unlabelled left or right corner. Finally,

$$\mathrm{\Phi }^+(P)=\{\alpha _1+\alpha _2,\alpha _2+\alpha _3+\alpha _4,\alpha _5,\alpha _3+\alpha _4+\alpha _5+\alpha _6,\alpha _1+\alpha _2+\alpha _3\}.$$

We also define a set $`\mathrm{\Phi }^+(j)`$ for $`j[1,n]`$. $`\mathrm{\Phi }^+(j)`$ is the set of positive roots obtained from the rectangle $`E(j)=\rho (j)`$ by reading the numbers downwards in vertical lines.

###### Theorem 4.2

(Carter and Marsh). Suppose the coordinates of the vector $`S_𝐢^𝐣(𝐚(c,𝐢))`$ are labelled by the positive roots $`\mathrm{\Phi }^+`$ by means of the reduced expression $`𝐣`$ of $`w_0`$. Let $`P`$ be the partial quiver $`P(c,𝐢)`$. Then the coordinate of $`S_𝐢^𝐣(𝐚(c,𝐢))`$ labelled by $`\alpha \mathrm{\Phi }^+`$ is $`1`$ if $`\alpha \mathrm{\Phi }^+(P)`$ and is $`0`$ if $`\alpha \mathrm{\Phi }^+(P)`$. Also, the coordinate of $`S_𝐢^𝐣(𝐚(j,𝐢))`$ labelled by $`\alpha \mathrm{\Phi }^+`$ is $`1`$ if $`\alpha \mathrm{\Phi }^+(j)`$ and is $`0`$ if $`\alpha \mathrm{\Phi }^+(j)`$.

The proof of this result depends on Theorem 5.17 in , together with the description of the reparametrization function associated with Lusztig’s parametrization provided in . It is hoped that this proof will appear in due course. In the present paper we shall illustrate it in type $`A_4`$.

## 5 Regions of linearity of the function $`R`$ in type $`A_4`$

We shall now consider in detail the case when $`𝐠`$ has type $`A_4`$. The Dynkin diagram will be labelled as in Figure $`1`$. In this case, $`𝐣,𝐣^{}`$ are the reduced words for $`w_0`$ given by

$`𝐣`$ $`=`$ $`(1,3,2,4,1,3,2,4,1,3)`$
$`𝐣^{}`$ $`=`$ $`(2,4,1,3,2,4,1,3,2,4)`$
The piecewise-linear function $`R=R_𝐣^𝐣^{}`$ can be written as a composition of functions corresponding to a sequence of reduced words beginning with $`𝐣`$ and ending with $`𝐣^{}`$ such that consecutive words differ by a braid relation. When $`s_is_j`$ is replaced by $`s_js_i`$ the corresponding pair of components $`a,b`$ is replaced by $`b,a`$. When $`s_is_js_i`$ is replaced by $`s_js_is_j`$ the corresponding triple of components $`a,b,c`$ is replaced by $`a^{},b^{},c^{}`$ where:

$$(a^{},b^{},c^{})=\{\begin{array}{cc}(b+ca,a,b)\hfill & \text{ if }ac\hfill \\ (b,c,b+ac)\hfill & \text{ if }ac.\hfill \end{array}$$

See \[9, §2\]. We list in Table I a sequence of reduced words of this kind from $`𝐣`$ to $`𝐣^{}`$, underlying the long braid relations which are used. These long braid relations are denoted by the letters $`A,B,C,D,E,F,G,H,I,J`$.

Table I
Sequence of reduced words for $`w_0`$.
$`\mathrm{1\; 3\; 2\; 4\; 1\; 3\; 2\; 4\; 1\; 3}`$
$`\mathrm{3\; 1\; 2\; 4\; 1\; 3\; 2\; 4\; 1\; 3}`$
$`3\underset{¯}{\mathrm{1\; 2\; 1}}\mathrm{4\; 3\; 2\; 4\; 1\; 3}`$ $`A`$
$`\mathrm{3\; 2\; 1\; 2\; 4\; 3\; 2\; 4\; 1\; 3}`$
$`\mathrm{3\; 2\; 1\; 4}\underset{¯}{\mathrm{2\; 3\; 2}}\mathrm{4\; 1\; 3}`$ $`B`$
$`\mathrm{3\; 2\; 1\; 4\; 3\; 2\; 3\; 4\; 1\; 3}`$
$`\mathrm{3\; 2\; 1\; 4\; 3\; 2}\underset{¯}{\mathrm{3\; 4\; 3}}1`$ $`C`$
$`\mathrm{3\; 2\; 1\; 4\; 3\; 2\; 4\; 3\; 4\; 1}`$
$`\mathrm{3\; 2\; 1}\underset{¯}{\mathrm{4\; 3\; 4}}\mathrm{2\; 3\; 4\; 1}`$ $`D`$
$`\mathrm{3\; 2\; 1\; 3\; 4\; 3\; 2\; 3\; 4\; 1}`$
$`\underset{¯}{\mathrm{3\; 2\; 3}}\mathrm{1\; 4\; 3\; 2\; 3\; 4\; 1}`$ $`E`$
$`\mathrm{2\; 3\; 2\; 1\; 4}\underset{¯}{\mathrm{3\; 2\; 3}}\mathrm{4\; 1}`$ $`F`$
$`\mathrm{2\; 3\; 2\; 1\; 4\; 2\; 3\; 2\; 4\; 1}`$
$`\mathrm{2\; 3}\underset{¯}{\mathrm{2\; 1\; 2}}\mathrm{4\; 3\; 2\; 4\; 1}`$ $`G`$
$`\mathrm{2\; 3\; 1\; 2\; 1\; 4\; 3\; 2\; 4\; 1}`$
$`\mathrm{2\; 3\; 1\; 2\; 4\; 1\; 3\; 2\; 4\; 1}`$
$`\mathrm{2\; 3\; 1\; 2\; 4\; 3\; 1\; 2\; 4\; 1}`$
$`\mathrm{2\; 3\; 1\; 2\; 4\; 3}\underset{¯}{\mathrm{1\; 2\; 1}}4`$ $`H`$
$`\mathrm{2\; 3\; 1\; 2\; 4\; 3\; 2\; 1\; 2\; 4}`$
$`\mathrm{2\; 3\; 1\; 4}\underset{¯}{\mathrm{2\; 3\; 2}}\mathrm{1\; 2\; 4}`$ $`I`$
$`\mathrm{2\; 3\; 1\; 4\; 3\; 2\; 3\; 1\; 2\; 4}`$
$`\mathrm{2\; 1}\underset{¯}{\mathrm{3\; 4\; 3}}\mathrm{2\; 3\; 1\; 2\; 4}`$ $`J`$
$`\mathrm{2\; 1\; 4\; 3\; 4\; 2\; 3\; 1\; 2\; 4}`$
$`\mathrm{2\; 4\; 1\; 3\; 4\; 2\; 3\; 1\; 2\; 4}`$
$`\mathrm{2\; 4\; 1\; 3\; 2\; 4\; 3\; 1\; 2\; 4}`$
$`\mathrm{2\; 4\; 1\; 3\; 2\; 4\; 1\; 3\; 2\; 4}`$
Let $`v^{10}`$ and let $`R(v)`$ be the image of $`v`$ under $`R=R_𝐣^𝐣^{}`$. Since

$$(a^{},b^{},c^{})=\{\begin{array}{cc}(b,c,b)+(ca,ac,0)\hfill & \text{ if }ac\hfill \\ (b,c,b)+(0,0,ac)\hfill & \text{ if }ac,\hfill \end{array}$$

we consider the function $`g(v)`$ obtained from $`v`$ by applying the map $`(a,b,c)(b,c,b)`$ at each length $`3`$ braid relation and $`(a,b)(b,a)`$ at each length $`2`$ braid relation. We write

$$R(v)=g(v)+\epsilon (v).$$

In our case we write $`v=(a,b,c,d,e,f,g,h,i,j)`$. By following the sequence of steps in Table I we see that $`g(v)=(c,h,e,j,g,h,i,j,g,h)`$.

We also define vectors $`\alpha _X`$ for $`X\{A,B,C,D,E,F,G,H,I,J\}`$, by $`\alpha _X(v)=\xi \eta `$ where $`\xi ,\eta `$ are the first and third components of the triple in the vector to which the braid relation at $`X`$ is applied. These vectors $`\alpha _X`$ can be read off from Table II and are as follows:

$`\alpha _A(v)`$ $`=`$ $`ae`$
$`\alpha _B(v)`$ $`=`$ $`cg`$
$`\alpha _C(v)`$ $`=`$ $`fj`$
$`\alpha _D(v)`$ $`=`$ $`dh`$
$`\alpha _E(v)`$ $`=`$ $`bf`$
$`\alpha _F(v)`$ $`=`$ $`fj`$
$`\alpha _G(v)`$ $`=`$ $`cg`$
$`\alpha _H(v)`$ $`=`$ $`ei`$
$`\alpha _I(v)`$ $`=`$ $`0`$
$`\alpha _J(v)`$ $`=`$ $`fj`$
We note that the vectors $`\alpha _A,\alpha _B,\alpha _C,\alpha _D,\alpha _E,\alpha _H`$ are linearly independent and that the remaining vectors are expressible in terms of these by

$$\alpha _J=\alpha _F=\alpha _C,\alpha _G=\alpha _B,\alpha _I=0.$$

Now for each of the $`10`$ values of $`X`$ we have a choice between $`2`$ linear functions. It may appear from this that the total number of regions of Lusztig’s function $`R`$ is $`2^{10}`$. This is not so, however, for some of the systems of inequalities determining the sequence of choices may be inconsistent. Calculation along the lines outlined in  shows that there are $`204`$ consistent choices. Again it is possible for two different consistent sequences to give the same linear function $`R`$. Thus we obtain an equivalence relation on the set of consistent sequences. Calculation shows that there are $`144`$ equivalence classes. Thus the function $`R`$ in type $`A_4`$ has $`144`$ regions of linearity.

Each region of linearity may be defined by a system of independent inequalities of the form

$`{\displaystyle \underset{X}{}}n_X\alpha _X0`$
or $`{\displaystyle \underset{X}{}}n_X\alpha _X0`$
where $`n_X`$.

Table II
Determination of vector $`g(v)`$.
$`abcdefghij`$
$`bacdefghij`$
$`b\underset{¯}{ace}dfghij`$ $`A`$
$`bcecdfghij`$
$`bced\underset{¯}{cfg}hij`$ $`B`$
$`bcedfgfhij`$
$`bcedfg\underset{¯}{fhj}i`$ $`C`$
$`bcedfghjhi`$
$`bce\underset{¯}{dfh}gjhi`$ $`D`$
$`bcefhfgjhi`$
$`\underset{¯}{bcf}ehfgjhi`$ $`E`$
$`cfceh\underset{¯}{fgj}hi`$ $`F`$
$`cfcehgjghi`$
$`cf\underset{¯}{ceg}hjghi`$ $`G`$
$`cfegehjghi`$
$`cfeghejghi`$
$`cfeghjeghi`$
$`cfeghj\underset{¯}{egi}h`$ $`H`$
$`cfeghjgigh`$
$`cfeh\underset{¯}{gjg}igh`$ $`I`$
$`cfehjgjigh`$
$`ce\underset{¯}{fhj}gjigh`$ $`J`$
$`cehjhgjigh`$
$`chejhgjigh`$
$`chejghjigh`$
$`chejghijgh`$
We list the defining inequalities for the $`144`$ regions in Table III. We use the following notation. The line

$$ABC,BCDEH||A,E,BCDE,BEH,AB^2CDEH$$

will denote the region:

$$\begin{array}{cccc}\alpha _A+\alpha _B+\alpha _C0& & & \alpha _A0\\ \alpha _B+\alpha _C+\alpha _D+\alpha _E+\alpha _H0& & & \alpha _E0\\ & & & \alpha _B+\alpha _C+\alpha _D+\alpha _E0\\ & & & \alpha _B+\alpha _E+\alpha _H0\\ & & & \alpha _A+2\alpha _B+\alpha _C+\alpha _D+\alpha _E+\alpha _H0\end{array}$$

The values of $`R(v)`$ for $`v`$ in each of these $`144`$ regions of linearity can be obtained from Table IV. We have $`R(v)=g(v)+\epsilon (v)`$ where $`g(v)=(c,h,e,j,g,h,i,j,g,h)`$ and $`\epsilon (v)`$ is given in Table IV.

Table III

Regions of linearity of $`R`$.

Table IV

The linear function $`\epsilon (v)`$ on each region.

We note that not all the regions of linearity are defined by the same number of inequalities. There are $`62`$ regions ($`1`$ to $`62`$) defined by $`6`$ inequalities, $`70`$ regions ($`63`$ to $`132`$) defined by $`7`$ inequalities, $`10`$ regions defined by $`8`$ inequalities ($`133`$ to $`142`$) and $`2`$ regions ($`143`$ to $`144`$) defined by $`11`$ inequalities.

We note in particular that the number ($`62`$) of regions defined by the minimum number of inequalities is equal to the number of equivalence classes of reduced expressions for $`w_0`$. We shall show that there is in fact a natural bijection between these two sets.

Now the vectors which parametrize the PBW-basis elements of $`U^{}`$ have all coordinates in $``$. Thus we shall add the inequalities

$$a0,b0,c0,d0,e0,f0,g0,h0,i0,j0$$

to those of Table III.

We define a simplicial region to be the subset of $`^{10}`$ defined by one of the sets of $`6`$ inequalities in Table III together with the above inequalities asserting that all coordinates are nonnegative. Of these 10 latter inequalities there will be $`4`$ from which the remaining $`6`$ follow using the $`6`$ inequalities from Table III. Thus each simplicial region will have $`10`$ walls, $`6`$ of which are given by Table III and the remaining $`4`$ will have form that some coordinate is greater than or equal to zero. The $`62`$ simplicial regions together with their walls are shown in Table V (where, for example, $`abgh`$ indicates the four walls $`a0`$, $`b0`$, $`g0`$ and $`h0`$).

Table V

The simplicial regions and their walls.

In order to define a natural bijection between the set of equivalence relations of reduced words for $`w_0`$ and the set of simplicial regions we consider the transforms under $`S_𝐢^𝐣`$ of the spanning vectors of $`C_𝐢`$ considered in $`\mathrm{\S }4`$. We have one such vector $`v_P`$ for each partial quiver $`P`$ and one vector $`v_j`$ for each $`j=1,2,3,4`$. These vectors $`v_P,v_j`$ can, for example, be calculated by the rectangle algorithm described in $`\mathrm{\S }4`$. These vectors are listed in Table VI.

We consider the incidence properties relating these vectors $`v_P`$ and $`v_j`$ to the walls of the simplicial regions. There are altogether $`32`$ hyperplanes in $`^{10}`$ which arise as walls of simplicial regions. $`22`$ of these are hyperplanes appearing in Table III and $`10`$ are the hyperplanes obtained by putting one coordinate equal to $`0`$. There are $`22`$ vectors of form $`v_P`$ and $`4`$ vectors of form $`v_j`$. These are obtained from the rectangle algorithm which associates with each partial quiver $`P`$ or each $`j\{1,2,3,4\}`$ a set of positive roots. Such a set of positive roots is translated into a vector with components $`0`$ or $`1`$ by means of the ordering

$$(\alpha _1,\alpha _3,\alpha _1+\alpha _2+\alpha _3,\alpha _3+\alpha _4,\alpha _2+\alpha _3,\alpha _1+\alpha _2+\alpha _3+\alpha _4,\alpha _2+\alpha _3+\alpha _4,\alpha _1+\alpha _2,\alpha _4,\alpha _2)$$

determined by the reduced word $`𝐣=(1,3,2,4,1,3,2,4,1,3)`$. In Table VII we indicate which vectors $`v_P`$ and $`v_j`$ lie on which walls of simplicial regions. A cross in a particular position indicates that the given vector does not lie on the given wall.

Table VI

Vectors obtained by the rectangle algorithm.

Table VII

Incidence table: spanning vectors and walls of simplicial regions.

x indicates that the vector lies on the given wall.

|  | L | L | L | R | L | R | R | R | L | L | R | R | - | - | - | - | L | R | - | - | - | - |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
|  | L | L | R | L | R | L | R | R | L | R | L | R | L | L | R | R | - | - | L | R | - | - | 1 | 2 | 3 | 4 |
|  | L | R | L | L | R | R | L | R | - | - | - | - | L | R | L | R | - | - | - | - | L | R |  |  |  |  |
| A | . | x | . | . | x | x | . | x | x | x | x | x | . | x | . | x | x | x | x | x | x | . | x | x | x | x |
| B | x | . | . | x | x | . | . | x | x | x | x | x | x | . | . | x | x | x | . | . | x | x | x | x | x | x |
| C | x | x | x | . | x | . | x | x | x | . | x | x | . | . | x | x | x | . | . | x | x | x | x | x | x | x |
| D | x | x | . | . | . | . | x | x | . | x | x | . | x | x | x | x | . | . | x | x | x | x | x | x | x | x |
| E | x | x | . | x | . | x | x | x | x | x | . | x | x | x | . | . | . | x | x | . | x | x | x | x | x | x |
| H | x | . | x | x | . | . | x | . | x | x | x | x | x | . | x | . | x | x | x | x | . | x | x | x | x | x |
| AB | . | . | x | . | x | . | x | x | x | x | x | x | . | . | x | x | x | x | . | . | x | . | x | x | x | x |
| BC | x | . | . | . | x | x | . | x | x | . | x | x | . | x | . | x | x | . | x | . | x | x | x | x | x | x |
| CD | x | x | . | x | . | x | x | x | . | . | x | . | . | . | x | x | . | x | . | x | x | x | x | x | x | x |
| DE | x | x | x | . | x | . | x | x | . | x | . | . | x | x | . | . | x | . | x | . | x | x | x | x | x | x |
| BE | x | . | x | x | . | . | . | x | x | x | . | x | x | . | x | . | . | x | . | x | x | x | x | x | x | x |
| BH | x | x | . | x | . | x | . | . | x | x | x | x | x | x | . | . | x | x | . | . | . | x | x | x | x | x |
| ABC | . | . | x | x | x | x | x | x | x | . | x | x | x | x | x | x | x | . | x | . | x | . | x | x | x | x |
| BCD | x | . | . | x | . | . | . | x | . | . | x | . | . | x | . | x | . | x | x | . | x | x | x | x | x | x |
| ABE | . | . | . | . | . | . | x | x | x | x | . | x | . | . | . | . | . | x | . | x | x | . | x | x | x | x |
| BDE | x | . | . | . | x | . | . | x | . | x | . | . | x | . | x | . | x | . | . | x | x | x | x | x | x | x |
| BCH | x | x | . | . | . | . | . | . | x | . | x | x | . | . | . | . | x | . | x | . | . | x | x | x | x | x |
| BEH | x | x | x | x | x | x | . | . | x | x | . | x | x | x | x | x | . | x | . | x | . | x | x | x | x | x |
| ABCD | . | . | . | . | . | . | x | x | . | . | x | . | x | x | x | x | . | x | x | . | x | . | x | x | x | x |
| ABDE | . | . | x | . | x | . | x | x | . | x | . | . | . | . | . | . | x | . | . | x | x | . | x | x | x | x |
| BCDH | x | x | . | x | . | x | . | . | . | . | x | . | . | . | . | . | . | x | x | . | . | x | x | x | x | x |
| BDEH | x | x | . | . | . | . | . | . | . | x | . | . | x | x | x | x | x | . | . | x | . | x | x | x | x | x |
| a | . | x | . | . | x | x | . | x | x | x | x | x | . | x | . | x | x | x | x | x | . | x | . | x | x | x |
| b | x | x | . | x | . | x | x | x | x | . | x | x | x | x | . | . | . | x | x | . | x | x | x | x | . | x |
| c | x | . | x | x | x | . | x | x | x | x | x | x | x | . | x | x | x | x | . | x | x | x | x | . | x | x |
| d | x | x | x | . | x | . | x | x | x | x | x | . | x | x | x | x | x | . | x | x | x | x | x | x | x | . |
| e | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | x | . | . | . | x | x | x |
| f | x | x | x | x | x | x | x | x | x | . | . | x | x | x | x | x | x | x | x | x | x | x | x | x | . | x |
| g | x | x | . | x | x | x | . | x | x | x | x | x | x | x | . | x | x | x | x | . | x | x | x | . | x | x |
| h | x | x | . | x | . | x | x | x | . | x | x | x | x | x | x | x | . | x | x | x | x | x | x | x | x | . |
| i | x | . | x | x | . | . | x | . | x | x | x | x | x | . | x | . | x | x | x | x | x | . | . | x | x | x |
| j | x | x | x | . | x | . | x | x | x | x | . | x | . | . | x | x | x | . | . | x | x | x | x | x | . | x |

The incidence table enables us to describe a bijection between equivalence classes of reduced words and simplicial regions. Let $`𝒲`$ be the set of hyperplanes in $`^{10}`$ which arise as walls of simplicial regions. We have seen that $`|𝒲|=22+10=32`$.

###### Proposition 5.1

Let $`𝐢`$ be a reduced expression for $`w_0`$. Let $`𝒫(𝐢)`$ be the set of $`6`$ partial quivers obtained from $`𝐢`$ using the chamber sets as in $`\mathrm{\S }3`$. Consider the $`10`$ vectors $`\{v_P,P𝒫(𝐢);v_j,j=1,2,3,4\}`$. For each vector in the set consider the set of $`9`$ remaining vectors. Then there is a unique hyperplane $`W𝒲`$ such that these $`9`$ vectors lie on $`W`$. Moreover, the set of $`10`$ elements of $`𝒲`$ obtained in this way are the $`10`$ boundary walls of a simplicial region $`X_𝐢`$. The original $`10`$ vectors $`v_P,P𝒫(𝐢);v_j,j=1,2,3,4`$ all lie in $`X_𝐢`$. Also, the map $`𝐢X_𝐢`$ gives a bijection between equivalence classes of reduced words and simplicial regions.

The bijection $`𝐢X_𝐢`$ is described in Table VIII.

###### Corollary 5.2

The vectors $`v_P,P𝒫(𝐢);v_j,j=1,2,3,4`$ are spanning vectors of the region $`X_𝐢`$.

Proof: This follows from the fact that each vector lies in $`X_𝐢`$ and that each wall of $`X_𝐢`$ contains $`9`$ of the $`10`$ vectors. $`\mathrm{}`$

Table VIII

The correspondence between reduced words and simplicial regions.

## 6 The transition function $`S_𝐢^𝐣`$ on the Lusztig cone $`C_𝐢`$

We shall now describe an algorithm for calculating $`S_𝐢^𝐣(𝐚)`$ for $`𝐚C_𝐢`$. As before $`𝐣`$ is the reduced word $`(1,3,2,4,1,3,2,4,1,3)`$. The algorithm is best indicated by an example. We illustrate in the case when $`𝐢=(3,2,1,4,3,2,3,4,1,3)`$. The Lusztig cone for this reduced word $`𝐢`$ is given by

$$C_𝐢=\{𝐚^{10}:P_𝐢𝐚0\},$$

where

$$P_𝐢=\left(\begin{array}{cccccccccc}1& 1& 0& 1& 1& 0& 0& 0& 0& 0\\ 0& 1& 1& 0& 1& 1& 0& 0& 0& 0\\ 0& 0& 1& 0& 0& 1& 0& 0& 1& 0\\ 0& 0& 0& 1& 1& 0& 1& 1& 0& 0\\ 0& 0& 0& 0& 1& 1& 1& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 1& 1& 0& 1\\ 0& 0& 0& 0& 0& 0& 1& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 1\\ 1& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 1& 0\end{array}\right).$$

Thus $`𝐚C_𝐢`$ if and only if $`𝐚=a𝐜_1+b𝐜_2+c𝐜_3+d𝐜_4+e𝐜_5+f𝐜_6+g𝐜_7+h𝐜_8+i𝐜_9+j𝐜_{10}`$, where $`𝐜_1,𝐜_2,\mathrm{}𝐜_{10}`$ are the columns of $`Q_𝐢=P_𝐢^1`$ and $`a0,b0,\mathrm{},j0`$. We have

$$Q_𝐢=\left(\begin{array}{cccccccccc}0& 0& 0& 0& 0& 0& 0& 0& 1& 0\\ 1& 0& 0& 1& 0& 1& 0& 1& 1& 0\\ 1& 1& 0& 1& 1& 1& 1& 1& 1& 0\\ 1& 1& 1& 0& 0& 0& 0& 0& 1& 1\\ 1& 1& 1& 1& 0& 1& 0& 1& 1& 1\\ 1& 1& 1& 1& 1& 1& 1& 1& 1& 1\\ 0& 0& 0& 0& 0& 0& 1& 0& 0& 0\\ 0& 0& 0& 0& 0& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 1\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 0\end{array}\right).$$

Thus a typical point $`𝐚C_𝐢`$ is given by

$`𝐚`$ $`=`$ $`(i,a+d+f+h+i,a+b+d+e+f+g+h+i,a+b+c+i+j,`$
$`a+b+c+d+f+h+i+j,a+b+c+d+e+f+g+h+i+j,g,f+g+h,j,h),`$
where $`a0,b0,\mathrm{},j0`$.

We now consider $`S_𝐢^𝐣(𝐚)`$. We recall that $`S_𝐢^𝐣=\varphi _𝐣\psi _𝐢^1`$ where $`\psi _𝐢:𝐁Y_𝐢`$ and $`\varphi _𝐣:B^k`$ are bijections. Let $`\psi _𝐢^1(𝐚)=b`$ and $`\varphi _𝐢^1(b)=𝐜`$. Then $`S_𝐢^𝐣(𝐚)=𝐜`$. We also recall that

$$b\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1modv^{},\text{ and}$$

$$bF_𝐣^𝐜modv,$$

where $``$ is the $`[v]`$-lattice spanned by $`𝐁`$ and $`^{}`$ is the $`𝒜`$-lattice spanned by $`𝐁`$. Since $`[v]𝒜`$ we have $`^{}`$. Thus

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1F_𝐣^𝐜modv^{}.$$

We shall describe an algorithm for obtaining the vector $`𝐜`$ determined by this condition. This is based on the fact that, since the reduced expression $`𝐣`$ is adapted to the quiver $`Q_1`$ in Figure $`11`$, (in the sense of ), the actions of $`\stackrel{~}{F}_1`$ and $`\stackrel{~}{F}_3`$ on elements $`F_𝐣^𝐜`$, taken$`modv^{}`$, are given by a simple formula. By \[9, Cor. 2.5\] we have

$`\stackrel{~}{F}_1^xF_𝐣^𝐜`$ $``$ $`F_𝐣^𝐜^{}modv^{},`$
$`\stackrel{~}{F}_3^xF_𝐣^𝐜`$ $``$ $`F_𝐣^{𝐜^{\prime \prime }}modv^{},`$
where

$`𝐜^{}`$ $`=`$ $`𝐜+(x,0,0,0,0,0,0,0,0,0),`$
$`𝐜^{\prime \prime }`$ $`=`$ $`𝐜+(0,x,0,0,0,0,0,0,0,0).`$
Similarly, the reduced expression $`𝐣^{}`$ is adapted to the quiver $`Q_2`$ in Figure $`11`$, so the actions of $`\stackrel{~}{F}_2`$ and $`\stackrel{~}{F}_4`$ on elements $`F_𝐣^{}^𝐜,`$ taken mod $`v^{}`$, are given by

$`\stackrel{~}{F}_2^xF_𝐣^{}^𝐜`$ $``$ $`F_𝐣^{}^𝐜^{}modv^{},`$
$`\stackrel{~}{F}_4^xF_𝐣^{}^𝐜`$ $``$ $`F_𝐣^{}^{𝐜^{\prime \prime }}modv^{},`$
where

$`𝐜^{}`$ $`=`$ $`𝐜+(x,0,0,0,0,0,0,0,0,0),`$
$`𝐜^{\prime \prime }`$ $`=`$ $`𝐜+(0,x,0,0,0,0,0,0,0,0).`$
Figure $`11`$: Two quivers of type $`A_4`$.$`Q_1`$$`Q_2`$ $``$$``$$``$$``$      $`1`$$`2`$$`3`$$`4`$.......................................... $``$$``$$``$$``$      $`1`$$`2`$$`3`$$`4`$.......................................... In order to calculate $`\stackrel{~}{F}_3^{a_1}\stackrel{~}{F}_2^{a_2}\stackrel{~}{F}_1^{a_3}\stackrel{~}{F}_4^{a_4}\stackrel{~}{F}_3^{a_5}\stackrel{~}{F}_2^{a_6}\stackrel{~}{F}_3^{a_7}\stackrel{~}{F}_4^{a_8}\stackrel{~}{F}_1^{a_9}\stackrel{~}{F}_3^{a_{10}}1modv^{}`$ we shall write the element being acted on at each stage in the form $`F_𝐣^𝐜`$ or $`F_𝐣^{}^𝐜^{}`$ as appropriate, in order to be able to use the above formulae. The elements can be transformed from form $`F_𝐣^𝐜`$ to $`F_𝐣^{}^𝐜^{}`$ by using the transition function $`R=R_𝐣^𝐣^{}`$ and from form $`F_𝐣^{}^𝐜^{}`$ to $`F_𝐣^𝐜`$ by $`R^1=R_𝐣^{}^𝐣`$. It follows from the description of the transition function in  and the form of $`𝐣`$ and $`𝐣^{}`$ that $`R_𝐣^{}^𝐣=\tau R_𝐣^𝐣^{}\tau `$ where $`\tau =(\mathrm{1\hspace{0.17em}2})(\mathrm{3\hspace{0.17em}4})(\mathrm{5\hspace{0.17em}6})(\mathrm{7\hspace{0.17em}8})(\mathrm{9\hspace{0.17em}10})`$. Thus $`R^1=\tau R\tau `$ where $`\tau (a,b,c,d,e,f,g,h,i,j)=(b,a,d,c,f,e,h,g,j,i)`$.

We now apply this algorithm to our given example where

$$(a_1,a_2,a_3,a_4,a_5,a_6,a_7,a_8,a_9,a_{10})=(i,a+d+f+h+i,a+b+d+e+f+g+h+i,a+b+c+i+j,$$

$$a+b+c+d+f+h+i+j,a+b+c+d+e+f+g+h+i+j,g,f+g+h,j,h).$$

We have

$$\stackrel{~}{F}_3^{a_{10}}1=\stackrel{~}{F}_3^{a_{10}}F_𝐣^\mathrm{𝟎}F_𝐣^{𝐜_\mathrm{𝟏}}modv^{},$$

where $`𝐜_\mathrm{𝟏}=(0,h,0,0,0,0,0,0,0,0)`$. Also,

$$\stackrel{~}{F}_1^{a_9}F_𝐣^{𝐜_\mathrm{𝟏}}F_𝐣^{𝐜_\mathrm{𝟐}}modv^{},$$

where $`𝐜_\mathrm{𝟐}=(j,h,0,0,0,0,0,0,0,0)`$. One can then check that $`𝐜_\mathrm{𝟐}`$ lies in region $`144`$ of $`\mathrm{\S }5`$ and it follows from Table IV that $`F_𝐣^{𝐜_\mathrm{𝟐}}F_𝐣^{}^{𝐜_\mathrm{𝟑}}modv^{},`$ where $`𝐜_\mathrm{𝟑}=(0,0,0,0,0,0,0,0,h,j)`$. Hence $`\stackrel{~}{F}_4^{a_8}F_𝐣^{}^{𝐜_\mathrm{𝟑}}F_𝐣^{}^{𝐜_\mathrm{𝟒}}modv^{},`$ where $`𝐜_\mathrm{𝟒}=(0,f+g+h,0,0,0,0,0,0,h,j)`$.

We now apply $`R_𝐣^{}^𝐣`$ to $`𝐜_\mathrm{𝟒}`$. Applying $`\tau `$ to this vector we obtain $`𝐜_\mathrm{𝟓}=(f+g+h,0,0,0,0,0,0,0,j,h)`$. We check that this vector lies in region $`136`$ of $`\mathrm{\S }5`$. Hence $`R_𝐣^𝐣^{}(𝐜_\mathrm{𝟓})=𝐜_\mathrm{𝟔}`$, where $`𝐜_\mathrm{𝟔}=(0,j,h,0,0,0,0,0,0,f+g)`$. Applying $`\tau `$ again we obtain $`𝐜_\mathrm{𝟕}=(j,0,0,h,0,0,0,0,f+g,0)`$. Hence

$$F_𝐣^{}^{𝐜_\mathrm{𝟒}}F_𝐣^{𝐜_\mathrm{𝟕}}modv^{}.$$

Then

$$\stackrel{~}{F}_3^{a_7}F_𝐣^{𝐜_\mathrm{𝟕}}F_𝐣^{𝐜_\mathrm{𝟖}}modv^{},$$

where $`𝐜_\mathrm{𝟖}=(j,g,0,h,0,0,0,0,f+g,0)`$. This vector lies in region $`139`$ of $`\mathrm{\S }5`$. Hence

$$F_𝐣^{𝐜_\mathrm{𝟖}}F_𝐣^{}^{𝐜_\mathrm{𝟗}}modv^{},$$

where $`𝐜_\mathrm{𝟗}=(0,f+h,0,0,0,0,g,0,h,j)`$. Then

$$\stackrel{~}{F}_2^{a_6}F_𝐣^{}^{𝐜_\mathrm{𝟗}}F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟎}}}modv^{},$$

where $`𝐜_{\mathrm{𝟏𝟎}}=(a+b+c+d+e+f+g+h+i+j,f+h,0,0,0,0,g,0,h,j)`$.

We now apply $`R_𝐣^{}^𝐣`$ to $`𝐜_{\mathrm{𝟏𝟎}}`$. Applying $`\tau `$ we obtain $`𝐜_{\mathrm{𝟏𝟏}}=(f+h,a+b+c+d+e+f+g+h+i+j,0,0,0,0,0,g,j,h)`$. This lies in region $`144`$ of $`\mathrm{\S }5`$. Hence $`R_𝐣^𝐣^{}(𝐜_{\mathrm{𝟏𝟏}})=𝐜_{\mathrm{𝟏𝟐}}`$, where $`𝐜_{\mathrm{𝟏𝟐}}=(0,0,0,0,0,g,j,h,a+b+c+d+e+f+i,f+g)`$. Applying $`\tau `$ again we obtain $`𝐜_{\mathrm{𝟏𝟑}}=(0,0,0,0,g,0,h,j,f+g,a+b+c+d+e+f+i)`$. Hence

$$F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟎}}}F_𝐣^{𝐜_{\mathrm{𝟏𝟑}}}modv^{}.$$

Then $`\stackrel{~}{F}_3^{a_5}F_𝐣^{𝐜_{\mathrm{𝟏𝟑}}}F_𝐣^{𝐜_{\mathrm{𝟏𝟒}}}modv^{},`$ where $`𝐜_{\mathrm{𝟏𝟒}}=(0,a+b+c+d+f+h+i+j,0,0,g,0,h,j,f+g,a+b+c+d+e+f+i)`$. This lies in region $`133`$ of $`\mathrm{\S }5`$. Hence

$$F_𝐣^{𝐜_{\mathrm{𝟏𝟒}}}F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟓}}}modv^{},$$

where $`𝐜_{\mathrm{𝟏𝟓}}=(e+g,0,0,f+h,0,a+b+c+d+i+j,g,0,h,j)`$. Thus

$$\stackrel{~}{F}_4^{a_4}F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟓}}}F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟔}}}modv^{},$$

where $`𝐜_{\mathrm{𝟏𝟔}}=(e+g,a+b+c+i+j,0,f+h,0,a+b+c+d+i+j,g,0,h,j)`$.

We now apply $`R_𝐣^{}^𝐣`$ to $`𝐜_{\mathrm{𝟏𝟔}}`$. Applying $`\tau `$ gives $`𝐜_{\mathrm{𝟏𝟕}}=(a+b+c+i+j,e+g,f+h,0,a+b+c+d+i+j,0,0,g,j,h)`$. This lies in region $`142`$ of $`\mathrm{\S }5`$. Hence $`R_𝐣^𝐣^{}(𝐜_{\mathrm{𝟏𝟕}})=𝐜_{\mathrm{𝟏𝟖}}`$, where $`𝐜_{\mathrm{𝟏𝟖}}=(d+f+h,0,a+b+c+i+j,0,0,g,j,h,a+b+c+d+e+f+i,f+g)`$. Applying $`\tau `$ again gives $`𝐜_{\mathrm{𝟏𝟗}}=(0,d+f+h,0,a+b+c+i+j,g,0,h,j,f+g,a+b+c+d+e+f+i)`$. Hence

$$F_𝐣^{}^{𝐜_{\mathrm{𝟏𝟔}}}F_𝐣^{𝐜_{\mathrm{𝟏𝟗}}}modv^{}.$$

We have $`\stackrel{~}{F}_1^{a_3}F_𝐣^{𝐜_{\mathrm{𝟏𝟗}}}F_𝐣^{𝐜_{\mathrm{𝟐𝟎}}}modv^{},`$ where $`𝐜_{\mathrm{𝟐𝟎}}=(a+b+d+e+f+g+h+i,d+f+h,0,a+b+c+i+j,g,0,h,j,f+g,a+b+c+d+e+f+i)`$. This lies in region $`104`$. Hence

$$F_𝐣^{𝐜_{\mathrm{𝟐𝟎}}}F_𝐣^{}^{𝐜_{\mathrm{𝟐𝟏}}}modv^{},$$

where $`𝐜_{\mathrm{𝟐𝟏}}=(0,a+b+c+i+j,e+g,0,f+h,c+j,g,a+b+d+i,h,j)`$. Thus

$$\stackrel{~}{F}_2^{a_2}F_𝐣^{}^{𝐜_{\mathrm{𝟐𝟏}}}F_𝐣^{}^{𝐜_{\mathrm{𝟐𝟐}}}modv^{},$$

where $`𝐜_{\mathrm{𝟐𝟐}}=(a+d+f+h+i,a+b+c+i+j,e+g,0,f+h,c+j,g,a+b+d+i,h,j)`$.

We now apply $`R_𝐣^{}^𝐣`$ to $`𝐜_{\mathrm{𝟐𝟐}}`$. Applying $`\tau `$ gives $`𝐜_{\mathrm{𝟐𝟑}}=(a+b+c+i+j,a+d+f+h+i,0,e+g,c+j,f+h,a+b+d+i,g,j,h)`$. This lies in region $`49`$. Hence $`R_𝐣^𝐣^{}(𝐜_{\mathrm{𝟐𝟑}})=𝐜_{\mathrm{𝟐𝟒}}`$, where $`𝐜_{\mathrm{𝟐𝟒}}=(0,b+e+g,b+c+j,d+f+h,a+i,g,j,h,a+b+c+d+e+f+i,f+g)`$. Applying $`\tau `$ again gives $`𝐜_{\mathrm{𝟐𝟓}}=(b+e+g,0,d+f+h,b+c+j,g,a+i,h,j,f+g,a+b+c+d+e+f+i)`$. Thus

$$F_𝐣^{}^{𝐜_{\mathrm{𝟐𝟐}}}F_𝐣^{𝐜_{\mathrm{𝟐𝟓}}}modv^{}.$$

Thus $`\stackrel{~}{F}_3^{a_1}F_𝐣^{𝐜_{\mathrm{𝟐𝟓}}}F_𝐣^{𝐜_{\mathrm{𝟐𝟔}}}modv^{},`$ where $`𝐜_{\mathrm{𝟐𝟔}}=(b+e+g,i,d+f+h,b+c+j,g,a+i,h,j,f+g,a+b+c+d+e+f+i)`$.

Thus we finally arrive at the conclusion that

$$\stackrel{~}{F}_3^{a_1}\stackrel{~}{F}_2^{a_2}\stackrel{~}{F}_1^{a_3}\stackrel{~}{F}_4^{a_4}\stackrel{~}{F}_3^{a_5}\stackrel{~}{F}_2^{a_6}\stackrel{~}{F}_3^{a_7}\stackrel{~}{F}_4^{a_8}\stackrel{~}{F}_1^{a_9}\stackrel{~}{F}_3^{a_{10}}1F_𝐣^𝐜modv^{},$$

where $`𝐜=(b+e+g,i,d+f+h,b+c+j,g,a+i,h,j,f+g,a+b+c+d+e+f+i)`$.

This procedure can be carried out for each reduced expression $`𝐢`$ for $`w_0`$, i.e. for representatives of the $`62`$ commutation classes of such reduced expressions. This was carried out by computer and in each case the coordinates of $`𝐜`$ are seen to be positive linear combinations of $`a,b,c,d,e,f,g,h,i,j`$. Thus we have obtained:

###### Proposition 6.1

Let $`𝐢`$ be a reduced expression for $`w_0`$ in type $`A_4`$. Then $`S_𝐢^𝐣(C_𝐢)=X_𝐢`$. Moreover the map $`S_𝐢^𝐣:C_𝐢X_𝐢`$ is linear.

Proof: We know from Corollary 5.2 that $`S_𝐢^𝐣`$ maps the spanning vectors of $`C_𝐢`$ to spanning vectors of $`X_𝐢`$. Since $`S_𝐢^𝐣`$ is linear on $`C_𝐢`$ it follows that $`S_𝐢^𝐣(C_𝐢)=X_𝐢`$$`\mathrm{}`$

## 7 An Isomorphism of Graphs

We shall now show that the bijection given by $`𝐢X_𝐢`$ in Proposition 5.1 between equivalence classes of reduced words for $`w_0`$ and simplicial regions is an isomorphism of graphs.

We first introduce a graph structure on the set of equivalence classes of reduced words for $`w_0`$. We say that two such classes are adjacent if there exist reduced words $`𝐢,𝐣`$ in these classes such that $`𝐣`$ can be obtained from $`𝐢`$ by applying a long braid relation.

For example, the classes containing the reduced words $`(2,3,1,2,1,3,4,3,2,1)`$,
$`(2,3,1,2,3,4,3,2,1,2)`$ are adjacent. For the former is equivalent to $`(2,3,1,2,3,4,3,1,2,1)`$, which can be obtained from the latter by applying the long braid relation $`212121`$.

Secondly, we introduce a graph structure on the set of simplicial regions. Two simplicial regions are said to be adjacent if they have a common wall with equation $`Q=0`$ and there is a bijection between their remaining walls such that corresponding walls have equations $`Q_i=0`$, $`Q_i+\lambda _iQ=0`$ for some $`\lambda _i`$.

For example, the simplicial regions $`28`$ and $`41`$ are adjacent. We see from Table V that their walls are as follows:

$`28`$ $`[AB,C,BE,H][CD,ABE]`$ $`cefh`$
$`41`$ $`[AB,BE,H][C,D,ABE]`$ $`cehj.`$
The common wall is taken as $`C`$, i.e. $`\alpha _C=0`$. The bijection between the remaining walls satisfies $`CDD`$, $`fj`$ and $`XX`$ for all other walls $`X`$. This bijection is of the required form since $`\alpha _C(v)=fj`$.

We shall obtain an isomorphism of graphs by showing that $`𝐢`$, $`𝐣`$ are adjacent if and only if $`X_𝐢,X_𝐣`$ are adjacent. We first need the following property of a pair of reduced words:

###### Proposition 7.1

Two classes of reduced words $`[𝐢],[𝐢^{}]`$ for $`w_0`$ differ by a simple long braid relation if and only if their two families of chamber sets differ by just one chamber set.

We illustrate this proposition with the reduced words $`(2,3,1,2,3,4,3,1,2,1)`$
and $`(2,3,1,2,3,4,3,2,1,2)`$, which differ by a long braid relation $`121212`$. Their respective chamber diagrams are shown in Figure $`12`$,

and their respective chamber sets are:

$$25,15,245,125,1245,1235,$$

and

$$25,15,245,125,1245,124.$$

Proof: First suppose that the reduced words $`𝐢,𝐢^{}`$ differ by a single long braid relation. Consider the crossings in their respective chamber diagrams. The only difference in the order of the crossings is in a set of three consecutive crossings. We may assume

$`𝐢`$ $`=`$ $`\mathrm{}k,k+1,k,\mathrm{}`$
$`𝐢^{}`$ $`=`$ $`\mathrm{}k+1,k,k+1,\mathrm{}`$
where the dotted letters are the same in $`𝐢,𝐢^{}`$. The corresponding crossings have form:

$`𝐢:`$ $`\mathrm{}(pq),(pr),(qr)\mathrm{}`$
$`𝐢^{}:`$ $`\mathrm{}(qr),(pr),(pq)\mathrm{}`$
where the dotted crossings are the same for $`𝐢,𝐢^{}`$, and $`p<q<r`$. Now the three crossings $`(pq),(pr),(qr)`$ bound a chamber in each chamber diagram. This chamber has form as shown in Figure $`13`$.

The chamber sets corresponding to this chamber in CD$`(𝐢)`$ and CD$`(𝐢^{})`$ are different, but all other chamber sets in CD$`(𝐢)`$, CD$`(𝐢^{})`$ are the same. Thus the families of chamber sets in CD$`(𝐢)`$, CD$`(𝐢^{})`$ differ by just one chamber set.

Now suppose conversely that the chamber sets in CD$`(𝐢)`$, CD$`(𝐢^{})`$ differ by just one chamber set. Let $`C`$ be the chamber in CD$`(𝐢)`$ whose chamber set does not appear in CD$`(𝐢)`$. We note that each crossing $`(ij)`$ appears just once in each chamber diagram and, if $`i<j`$, the chamber set for the chamber on the left of $`(ij)`$ gives the chamber set on the right of $`(ij)`$ replacing $`j`$ by $`i`$.

(a) Suppose first that chambers $`C,C^{}`$ occupy the same positions in their respective chamber diagrams. Let the left and right hand crossings of $`C`$ be $`(ij),(kl)`$, respectively, with $`i<j`$, $`k<l`$. Since all other crossings are the same in the two chamber diagrams, the left and right hand end crossings of $`C^{}`$ must be $`(kl),(ij)`$, respectively. In CD$`(𝐢)`$ string $`k`$ is above string $`j`$ at crossing $`(ij)`$, whereas string $`j`$ is above string $`k`$ at crossing $`(kl)`$. Thus the crossing $`(jk)`$ must be above chamber $`C`$ in CD$`(𝐢)`$. A similar argument show that crossing $`(jk)`$ is below chamber $`C^{}`$ in CD$`(𝐢^{})`$. Since crossing $`(jk)`$ appears in the same row in both chamber diagrams we obtain a contradiction. Thus $`C,C^{}`$ cannot occupy the same positions in CD$`(𝐢)`$, CD$`(𝐢^{})`$ respectively.

(b) Consider the sequence of chambers in the row of CD$`(𝐢)`$ containing C. This sequence has form

$$\mathrm{}C_1,C,C_2,\mathrm{}$$

and their chamber sets have form

$$\mathrm{}S(C_1),S(C),S(C_2),\mathrm{}.$$

When $`C`$ is removed, we know that $`S(C_1),S(C_2)`$ will be consecutive chamber sets in the same row of CD$`(𝐢^{})`$. Thus $`S(C_1),S(C_2)`$ differ by a single number, i.e.

$$|S(C_1)S(C_2)|=|S(C_1)|1=|S(C_2)|1.$$

This implies that the left and right hand end crossings of $`C`$ must have form

$`(ij),(jk)`$ $`\text{for}i<j<k,`$
$`\text{or }(jk),(ij)`$ $`\text{for}i<j<k.`$
So, in passing from $`\mathrm{},C_1,C,C_2,\mathrm{}`$ to $`\mathrm{},C_1,C_2,\mathrm{},`$ crossings $`(ij)`$ and $`(jk)`$ are removed and crossing $`(ik)`$ is added. Since the set of crossings in CD$`(𝐢)`$, CD$`(𝐢^{})`$ is the same, the crossing $`(ik)`$ must be removed from CD$`(𝐢)`$ in adjoining $`C^{}`$ and crossings $`(ij)`$ and $`(jk)`$ added. Thus the row of CD$`(𝐢^{})`$ containing $`C^{}`$ is the row of CD$`(𝐢)`$ containing the crossing $`(ik)`$.

(c) Suppose the left and right end crossings of $`C`$ are $`(ij),(jk)`$ respectively with $`i<j<k`$. Then the crossing $`(ik)`$ must be below the level of $`C`$ in CD$`(𝐢)`$. Alternatively, if the left and right end crossings of $`C`$ are $`(jk),(ij)`$, respectively with $`i<j<k`$, the crossing $`(ik)`$ will be above the level of $`C`$ in CD$`(𝐢)`$. These two possibilities are illustrated in Figure $`14`$.

$`i`$$`j`$$`k`$$`j`$............................................................................................................................................................................................................................................................................................................................................................................................................................................$`(ik)`$Case $`1`$$`C`$$`j`$$`k`$$`j`$$`i`$............................................................................................................................................................................................................................................................................................................................................................................................................................................$`(ik)`$$`C^{}`$$`i`$$`j`$$`k`$$`j`$............................................................................................................................................................................................................................................................................................................................................................................................................................................$`(ik)`$Case $`2`$$`C^{}`$$`j`$$`k`$$`j`$$`i`$............................................................................................................................................................................................................................................................................................................................................................................................................................................$`(ik)`$$`C`$Figure $`14`$: The possibilities for crossing $`(ik)`$.

(d) We next show that crossing $`(ik)`$ in CD$`(𝐢)`$ lies either in the row immediately below that of $`(ij),(jk)`$, or the row immediately above.

It will be sufficient to consider Case $`1`$ and show that $`(ik)`$ is in the row below $`(ij),(jk)`$. A similar argument will work in Case $`2`$. So suppose if possible that $`(ik)`$ is not in the line immediately below $`(ij)`$ and $`(jk)`$. Then there will be a crossing $`(im)`$ with $`i<m`$ between $`(ij)`$ and $`(ik)`$. Crossing $`(jm)`$ cannot occur between $`(ij)`$ and $`(jk)`$ since then $`(ij)`$ and $`(jk)`$ could not bound the same chamber. So there must be a crossing $`(mk)`$ between $`(ik)`$ and $`(jk)`$. Also all crossings involving $`m`$ between $`(im)`$ and $`(mk)`$ are on a level below the level of $`C`$. See Figure $`15`$.

$`i`$$`j`$$`k`$$`j`$............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................$`(im)`$$`(mk)`$$`(ik)`$Figure $`15`$: All crossings involving $`m`$ between $`(im)`$ and $`(mk)`$ are on a level below the level of $`C`$.

Now consider the chamber diagram CD$`(𝐢^{})`$. The crossings involving $`m`$ in CD$`(𝐢^{})`$ are in the same positions as in CD$`(𝐢)`$ since $`m\{i,j,k\}`$. Crossing $`(ik)`$ lies to the right of $`(im)`$ and to the left of $`(mk)`$ in CD$`(𝐢^{})`$. Now string $`i`$ remains below string $`m`$ to the right of $`(im)`$ and string $`k`$ remains below string $`m`$ to the left of $`(mk)`$ in CD$`(𝐢^{})`$. Thus crossing $`(ik)`$ lies below string $`m`$ in CD$`(𝐢^{})`$. Since all crossings involving $`m`$ between $`(im)`$ and $`(mk)`$ are on a level below that of $`C`$, the level of crossing $`(ik)`$ in CD$`(𝐢^{})`$ is below the level of $`C`$ in CD$`(𝐢)`$. But the level of $`(ik)`$ in CD$`(𝐢^{})`$ is the same as the level of $`C`$ in CD$`(𝐢)`$, so we have a contradiction. Thus crossing $`(ik)`$ in CD$`(𝐢)`$ lies on the line below $`(ij)`$ and $`(jk)`$. In Case $`2`$ $`(ik)`$ lies on the line above $`(ij)`$ and $`(jk)`$.

(e) We show next there is no crossing involving $`j`$ between $`(ij)`$ and $`(jk)`$ in CD$`(𝐢)`$. Suppose we are in Case $`1`$. If there is a crossing $`(mj)`$ with $`m<j`$ between $`(ij)`$ and $`(jk)`$ then crossing $`(mk)`$ would be to the right of $`(mj)`$ and the left of $`(jk)`$. But then $`(ij)`$ and $`(jk)`$ could not bound the same chamber. Similarly if there is a crossing $`(jm)`$ with $`j<m`$ between $`(ij)`$ and $`(jk)`$ then crossing $`(im)`$ would be to the right of $`(ij)`$ and to the left of $`(jm)`$. Then $`(ij)`$ and $`(jk)`$ could not bound the same chamber. A similar argument applies in Case $`2`$.

(f) Now we show there is no crossing involving $`i`$ between $`(ij)`$ and $`(ik)`$ and no crossing involving $`k`$ between $`(ik)`$ and $`(jk)`$. Suppose we are in Case $`1`$. Suppose there were a crossing $`(im)`$, $`i<m`$, between $`(ij)`$ and $`(ik)`$. Then string $`m`$ remains below string $`j`$ and above string $`i`$ between $`(im)`$ and $`(jk)`$. Since string $`i`$ is in the row below string $`j`$ at the crossing $`(ik)`$, by (e), we have a contradiction. Similarly there is no crossing $`(mk)`$, $`m<k`$, between $`(ik)`$ and $`(jk)`$. A similar argument holds in Case $`2`$.

(g) We now know that the chambers $`C`$ and $`C^{}`$ are as in Figure $`16`$.

In Case $`1`$ we may choose a total order on the crossings in CD$`(𝐢)`$ and CD$`(𝐢^{})`$ compatible with the diagrams of the form

$`\mathrm{}(ij),(ik),(jk),\mathrm{}`$ inCD$`(𝐢)`$
$`\mathrm{}(jk),(ik),(ij),\mathrm{}`$ $`\text{in}\text{CD}(𝐢^{}),`$
where the crossings agree apart from the given triples. The crossings in this order give rise to reduced words

$`\mathrm{}`$ $`s_ps_{p+1}s_p`$ $`\mathrm{}`$
$`\mathrm{}`$ $`s_{p+1}s_ps_{p+1}`$ $`\mathrm{}`$
commutation equivalent to $`𝐢,𝐢^{}`$ respectively and differing by a long braid relation. A similar agreement holds in Case $`2`$, so the proposition is proved.

###### Proposition 7.2

Let $`𝐢,𝐢^{}`$ be reduced words for $`w_0`$. Their commutation classes $`[𝐢],[𝐢^{}]`$ are adjacent if and only if the simplicial regions $`X_𝐢,X_𝐢^{}`$ are adjacent.

Proof: Suppose $`[𝐢],[𝐢^{}]`$ are adjacent. Then $`𝐢,𝐢^{}`$ both determine $`6`$ partial quivers and these two sets of $`6`$ have $`5`$ in common, by Proposition 7.1. Let these partial quivers be

$`𝒫(𝐢)`$ $`=`$ $`\{P_1,P_2,P_3,P_4,P_5,P_6\},\text{ and}`$
$`𝒫(𝐢^{})`$ $`=`$ $`\{P_1,P_2,P_3,P_4,P_5,P_6^{}\}.`$
Then, by Proposition 5.1, $`X_𝐢`$ has spanning vectors $`\{v_P,P𝒫(𝐢),v_1,v_2,v_3,v_4\}`$ and $`X_𝐢^{}`$ has spanning vectors $`\{v_P,P𝒫(𝐢^{}),v_1,v_2,v_3,v_4\}`$. Let $`W`$ be the common wall of $`X_𝐢,X_𝐢^{}`$, spanned by vectors $`v_{P_1},v_{P_2},v_{P_3},v_{P_4},v_{P_5}`$ and $`v_1,v_2,v_3,v_4`$. Let $`W_i`$, $`i=1,2,\mathrm{},9`$, be the walls of $`X_𝐢`$ containing all spanning vectors of $`X_𝐢`$ except one, where the omitted spanning vector is not $`v_{P_6}`$. Let $`W_i^{}`$, $`i=1,2,\mathrm{},9`$, be the corresponding walls of $`X_𝐢^{}`$. Let $`W`$ be given by equation $`Q=0`$ and $`W_i`$ by equation $`Q_i=0`$. Then we have

$$W_iW_i^{}=W_iW\text{ and}$$

$$W_iW=\{𝐱:Q(𝐱)=0,Q_i(𝐱)=0\}.$$

Since $`W_iWW_i^{}`$, the corresponding ideals $`I(W_iW)`$, $`I(W_i^{})`$ satisfy $`I(W_i^{})I(W_iW)`$. Let $`W_i^{}`$ have equation $`Q_i^{}=0`$. Then $`Q_i^{}`$ lies in the ideal generated by $`Q`$ and $`Q_i`$. The only linear polynomials in this ideal are those of the form $`\lambda Q+\lambda _iQ_i`$ with $`\lambda ,\lambda _i`$. Thus $`Q_i^{}`$ has form $`\lambda Q+\lambda _iQ_i`$. Now $`W_i^{}`$ is not equal to $`W`$ so $`\lambda _i0`$. Without loss of generality we may choose $`\lambda _i=1`$, so $`Q_i^{}=Q_i+\lambda Q`$ for some $`\lambda `$. This shows that the simplicial regions $`X_𝐢,X_𝐢^{}`$ are adjacent.

Conversely, suppose $`𝐢,𝐢^{}`$ are reduced words such that the regions $`X_𝐢,X_𝐢^{}`$ are adjacent. Thus they have a common wall $`W`$ given by equation $`Q=0`$ and a $`11`$ correspondence between their remaining walls

$$W_iW_i^{}i=1,2,\mathrm{},9,$$

where $`W_i`$ has equation $`Q_i=0`$ and $`W_i^{}`$ has equation $`Q_i+\lambda _iQ=0`$ for $`\lambda _i`$. Let $`L_i,L_i^{}`$ be the $`1`$-dimensional subspaces of $`^{10}`$ given by

$$L_i=_{j,ji}W_jW,L_i^{}=_{j,ji}W_j^{}W.$$

Both $`L_i`$ and $`L_i^{}`$ are given by the equations $`Q=0`$, $`Q_j=0`$, $`j\{1,2,\mathrm{},9\}`$, $`ji`$. Thus $`L_i=L_i^{}`$. Hence the regions $`X_𝐢,X_𝐢^{}`$ have $`9`$ common spanning vectors, since a spanning vector has all coordinates $`0`$ or $`1`$ so is determined by the $`1`$-dimensional subspace containing it. Four of these common spanning vectors are the vectors $`v_1,v_2,v_3,v_4`$ of Proposition 5.1. The remaining spanning vectors of $`X_𝐢,X_𝐢^{}`$ have form $`v_P`$, for $`P𝒫(𝐢)`$, $`P𝒫(𝐢^{})`$ respectively. Since distinct partial quivers $`P`$ give distinct vectors $`v_P`$ we see that $`𝒫(𝐢)`$ and $`𝒫(𝐢^{})`$ must have $`5`$ partial quivers in common. Thus by Proposition 7.1 the commutation classes $`[𝐢]`$ and $`[𝐢^{}]`$ of reduced words must be adjacent. $`\mathrm{}`$

This proposition shows that the correspondence $`[𝐢]X_𝐢`$ is an isomorphism of graphs. This graph, with $`62`$ vertices, is shown in Figure $`17`$. There is an involution $`\iota `$ on the set of reduced expressions for $`w_0`$, taking a reduced expression $`𝐢=(i_1,i_2,\mathrm{},i_{10})`$ to $`(5i_1,5i_2,\mathrm{},5i_{10})`$ (thus applying the graph automorphism of the Dynkin diagram of type $`A_4`$). This induces an involution on the set of commutation classes of reduced expressions, and thus on the set of simplicial regions. We have numbered the simplicial regions in such a way that $`\iota `$ takes region $`m`$ to region $`63m`$, for $`m=1,2,\mathrm{}62`$. In fact, $`\iota `$ induces an automorphism of the graph of simplicial regions.

## 8 A Correspondence of Monomials

We shall now show how monomials in the Kashiwara operators given by vectors in a Lusztig cone are related to the corresponding monomials in divided powers in the generators $`F_i`$ of $`U^{}`$. To do this we shall relate both to elements of a basis in $`U^{}`$ of PBW-type. For this purpose we shall need to consider root vectors of $`U^{}`$. We follow ideas of Xi in .

Let $`𝐥=(l_1,l_2,\mathrm{},l_k)`$ be the reduced expression for $`w_0`$ given by

$$(l_1,l_2,\mathrm{},l_k)=(n,n1,n,n2,n1,n,\mathrm{},1,2,\mathrm{},n).$$

The elements of the corresponding basis $`B_𝐥`$ of PBW-type are:

$$F_𝐥^𝐜=F_{l_1}^{(c_1)}T_{l_1,1}^{\prime \prime }(F_{l_2}^{(c_2)})\mathrm{}T_{l_1,1}^{\prime \prime }T_{l_2,1}^{\prime \prime }\mathrm{}T_{l_{k1},1}^{\prime \prime }(F_{l_k}^{(c_k)}).$$

The corresponding sequence of positive roots is:

$$\alpha _{l_1},s_{l_1}(\alpha _{l_2}),s_{l_1}s_{l_2}(\alpha _{l_3}),\mathrm{},s_{l_1}s_{l_2}\mathrm{}s_{l_{k1}}(\alpha _{l_k}).$$

We write $`\alpha _{ij}=\alpha _i+\mathrm{}+\alpha _{j1}`$ for $`i<j`$. For each $`p`$ with $`1pk`$ we have $`s_{l_1}s_{l_2}\mathrm{}s_{l_{p1}}(\alpha _{l_p})=\alpha _{ij}`$ for some $`i<j`$, and each $`\alpha _{ij}`$ appears in this way for precisely one $`p`$. We then define

$$F_{ij}=T_{l_1,1}^{\prime \prime }T_{l_2,1}^{\prime \prime }\mathrm{}T_{l_{p1},1}^{\prime \prime }(F_{l_p}).$$

Each $`F_{ij}`$ is an element of $`U^{}`$ of weight $`\alpha _{ij}`$. The elements $`F_{ij}`$ will be called the root vectors of $`U^{}`$.

###### Lemma 8.1

We have:

$$F_{ij}=(1)^{ji1}T_i^1T_{i+1}^1\mathrm{}T_{j2}^1F_{j1}$$

for $`i<j`$.

Proof: Let $`p`$ be the positive integer such that $`s_{l_1}s_{l_2}\mathrm{}s_{l_{p1}}(\alpha _{l_p})=\alpha _{ij}`$. Then we have:

$$s_{l_1}s_{l_2}\mathrm{}s_{l_p}=s_ns_{n1}s_n\mathrm{}s_{i+1}s_{i+2}\mathrm{}s_ns_is_{i+1}\mathrm{}s_{n+i+1j}.$$

It is readily checked that the word

$$s_{j2}s_{j3}\mathrm{}s_is_ns_{n1}s_n\mathrm{}s_{i+1}s_{i+2}\mathrm{}s_ns_is_{i+1}\mathrm{}s_{n+i+1j}$$

is reduced and that this element of $`W`$ transforms $`\alpha _{n+i+1j}`$ into $`\alpha _{j1}`$. It follows from Lusztig \[8, §1.3(c)\], that

$$T_{j2,1}^{\prime \prime }T_{j3,1}^{\prime \prime }\mathrm{}T_{i,1}^{\prime \prime }T_{n,1}^{\prime \prime }T_{n1,1}^{\prime \prime }T_{n,1}^{\prime \prime }\mathrm{}T_{n+i+1j}^{\prime \prime }(F_{n+i+1j})=F_{j1}.$$

This asserts that:

$$T_{j2,1}^{\prime \prime }T_{j3,1}^{\prime \prime }\mathrm{}T_{i,1}^{\prime \prime }(F_{ij})=F_{j1},$$

and so

$`F_{ij}`$ $`=`$ $`(T_{i,1}^{\prime \prime })^1(T_{i+1,1}^{\prime \prime })^1\mathrm{}(T_{j2,1}^{\prime \prime })^1(F_{j1})`$
$`=`$ $`r_i^1T_i^1r_{i+1}^1T_{i+1}^1\mathrm{}r_{j2}^1T_{j2}^1(F_{j1})`$
since $`T_{i,1}^{\prime \prime }=T_ir_i`$. It follows, using the definition of $`r_i`$, that

$$F_{ij}=(1)^{ji1}T_i^1T_{i+1}^1\mathrm{}T_{j2}^1(F_{j1}),$$

as required. $`\mathrm{}`$

###### Lemma 8.2

We have

$$F_{ij}=F_iF_{i+1,j}vF_{i+1,j}F_i,$$

for $`i+1<j`$.

Proof: First note that

$$F_{i,i+2}=T_i^1(F_{i+1})=F_iF_{i+1}vF_{i+1}F_i.$$

Assuming the required result inductively for $`F_{i^{},j^{}}`$ with $`j^{}i^{}<ji`$ we have:

$`F_{ij}`$ $`=`$ $`T_i^1F_{i+1,j}`$
$`=`$ $`T_i^1(F_{i+1}F_{i+2,j}vF_{i+2,j}F_{i+1})`$
$`=`$ $`(F_iF_{i+1}vF_{i+1}F_i)F_{i+2,j}vF_{i+2,j}(F_iF_{i+1}vF_{i+1}F_i)`$
$`=`$ $`F_i(F_{i+1}F_{i+2,j}vF_{i+2,j}F_{i+1})v(F_{i+1}F_{i+2,j}vF_{i+2,j}F_{i+1})F_i`$
$`=`$ $`F_iF_{i+1,j}vF_{i+1,j}F_i.\mathrm{}`$
We now obtain commutation relations between root vectors and their divided powers analagous to those obtained by Xi in \[19, §5.6\]:

###### Proposition 8.3

$`\text{(a) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`F_{rs}^{(N)}F_{pq}^{(M)},\mathrm{if}q<r\mathrm{or}r<p<q<s,`$
$`\text{(b) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`v^{MN}F_{rs}^{(N)}F_{pq}^{(M)},\mathrm{if}r<p<q=s,`$
$`\text{(c) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`v^{MN}F_{rs}^{(N)}F_{pq}^{(M)},\mathrm{if}p=r<q<s\mathrm{or}p<r<q=s,`$
$`\text{(d) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`{\displaystyle \underset{0t\mathrm{min}(M,N)}{}}v^{(Mt)(Nt)}F_{rs}^{(Nt)}F_{ps}^{(t)}F_{pq}^{(Mt)},\mathrm{if}q=r,\text{ and}`$
$`\text{(e) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`F_{rs}^{(N)}F_{pq}^{(M)},\mathrm{if}s<p\mathrm{or}p<r<s<q.`$
$`\text{(f) }F_{pq}^{(M)}F_{rs}^{(N)}`$ $`=`$ $`{\displaystyle \underset{0t\mathrm{min}(M,N)}{}}v^{\frac{1}{2}t(t1)}(v^1v)^t[t]!F_{rq}^{(t)}F_{rs}^{(Nt)}F_{pq}^{(Mt)}F_{ps}^{(t)},\mathrm{if}p<r<q<s.`$
Note that (e) is a restatement of (a). Using the relations (a)–(e) we may now obtain our main result of this section:

###### Theorem 8.4

Suppose $`𝐢`$ is a reduced expression for $`w_0`$, and suppose $`𝐚C_𝐢`$. Then we have

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}modv^{}.$$

Proof: Let $`b=F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}U^{}`$. Then it is shown by Marsh in \[14, §4.1\] that in type $`A_4`$ for $`𝐚C_𝐢`$ we have $`b𝐁`$. So there is a unique $`𝐜^k`$ such that $`bF_𝐥^𝐜modv`$ (with $`𝐥`$ as above).

Since $`b`$ and $`B_𝐥`$ is a $`[v]`$-basis of $``$, $`b`$ is a linear combination of elements $`F_𝐥^𝐝`$ for $`𝐝^k`$, with coefficients in $`[v]`$. We shall obtain information about this expression for $`b`$ by means of an algorithm.

This algorithm is as follows. It deals with expressions of the form

$$\underset{𝐩=(p_1,p_2,\mathrm{},p_t)P}{}\lambda _{𝐩,𝐚}F_{\gamma _1}^{(f_1)}F_{\gamma _2}^{(f_2)}\mathrm{}F_{\gamma _u}^{(f_u)}$$

where $`\gamma _1,\gamma _2,\mathrm{},\gamma _u`$ are positive roots, $`P`$ is a subset of $`^t`$ defined by certain linear inequalities, $`𝐚=(a_1,a_2,\mathrm{},a_k)`$ is as above, $`f_1,f_2,\mathrm{},f_u`$ are certain linear functions in $`a_1,a_2,\mathrm{},a_k`$ and $`p_1,p_2,\mathrm{},p_t`$, and $`\lambda _{𝐩,𝐚}[v]`$.

The element $`F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}`$ is an expression of this form with just one summand, and the algorithm starts with this expression.

Let $`\alpha ^p=s_{l_1}s_{l_2}\mathrm{}s_{l_{p1}}(\alpha _{l_p})`$. Then $`\alpha ^1,\alpha ^2,\mathrm{},\alpha ^k`$ is the total ordering on the positive roots determined by $`𝐥`$. We write $`\alpha ^p<\alpha ^q`$ if $`p<q`$. The aim of the algorithm is to transform $`F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}`$ into an expression of the above general form in which the positive roots appearing satisfy $`\gamma _1<\gamma _2<\mathrm{}<\gamma _u`$. Consider adjacent pairs $`F_{\gamma _i}^{(f_i)}F_{\gamma _{i+1}}^{(f_{i+1})}`$ in each monomial in the sum, where $`\gamma _i\gamma _{i+1}`$. Find the first adjacent pair for which $`\gamma _i>\gamma _{i+1}`$. Then, by using one of the relations (a)–(e) of Proposition 8.3 it is possible to rewrite $`F_{\gamma _i}^{(f_i)}F_{\gamma _{i+1}}^{(f_{i+1})}`$. In fact just one of these relations can be used. Applying this procedure to the first adjacent pair in each monomial gives us another expression of the same general form, so that the algorithm can be repeated.

Whenever an adjacent pair $`F_{\gamma _i}^{(f_i)}F_{\gamma _{i+1}}^{(f_{i+1})}`$ is obtained with $`\gamma _i=\gamma _{i+1}`$ it is replaced by the equivalent expression $`\left[\begin{array}{c}f_i+f_{i+1}\\ f_i\end{array}\right]F_{\gamma _i}^{(f_i+f_{i+1})}`$.

If the algorithm terminates we shall have an expression of $`b`$ as a $`[v]`$-combination of elements in $`B_𝐥`$. It is not a priori clear that the algorithm will terminate. However, the algorithm was implemented in Maple for each reduced expression $`𝐢`$ for $`w_0`$ in type $`A_4`$, and did in fact terminate in each case. The implementation did not calculate the coefficients $`\lambda _{𝐩,𝐚}`$ explicitly, but it did calculate the smallest power of $`v`$ appearing in each $`\lambda _{𝐩,𝐚}`$ (which by construction must appear with coefficient $`1`$). This number is a quadratic expression in $`p_1,p_2,\mathrm{},p_t,a_1,a_2,\mathrm{},a_k`$.

Next, consider the monomial

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1$$

in the Kashiwara root operators $`\stackrel{~}{F}_i`$. It was shown in $`\mathrm{\S }6`$ that the map $`S_𝐢^𝐣`$ is linear on $`C_𝐢`$, where $`𝐣=(1,3,2,4,1,3,2,4,1,3)`$ and $`𝐢`$ is any reduced expression for $`w_0`$. In fact, a similar calculation, using Maple, shows that $`S_𝐢^𝐣`$ is linear on $`C_𝐢`$ for all pairs of reduced expressions $`𝐢,𝐣`$. In particular, $`S_𝐢^𝐥`$ is linear on $`C_𝐢`$ for all $`𝐢`$. It turns out that $`𝐥`$ appears to be a reduced expression for which the calculation of $`S_𝐢^𝐥`$ is as simple as possible. Using Theorem 5.5 in the paper  by the second author, we have a description of this map, giving us $`S_𝐢^𝐥(𝐚)=𝐜`$ such that

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1F_𝐥^𝐜modv^{}.$$

The coefficient of $`F_𝐥^𝐜`$ in the expression for $`b`$ obtained by the above algorithm was then checked and seen to lie in $`1+v[v]`$. It follows from Lusztig \[8, §§2.3, 3.2\] that the coefficients of all other terms $`F_𝐥^𝐝`$ in the sum must lie in $`v[v]`$, and thus that $`bF_𝐥^𝐜modv`$, and so $`bF_𝐥^𝐜modv^{}`$ (by \[9, §2.3\]). It follows that $`b=F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_k}^{a_k}1modv^{}`$ as required. $`\mathrm{}`$

We now give an example to demonstrate the above proof. We take $`𝐢=(3,2,1,4,3,2,3,4,1,3)`$, and $`𝐚C_𝐢`$. The corresponding monomial is

$$b=F_3^{(a_1)}F_2^{(a_2)}F_1^{(a_3)}F_4^{(a_4)}F_3^{(a_5)}F_2^{(a_6)}F_3^{(a_7)}F_4^{(a_8)}F_1^{(a_9)}F_3^{(a_{10})},$$

The ordering on the set of positive roots induced by $`𝐥=(4,3,4,2,3,4,1,2,3,4)`$ is

$$(\alpha _{45},\alpha _{35},\alpha _{34},\alpha _{25},\alpha _{24},\alpha _{23},\alpha _{15},\alpha _{14},\alpha _{13},\alpha _{12}).$$

We begin the algorithm by writing $`b`$ in the form

$$b=F_{34}^{(a_1)}F_{23}^{(a_2)}F_{12}^{(a_3)}F_{45}^{(a_4)}F_{34}^{(a_5)}F_{23}^{(a_6)}F_{34}^{(a_7)}F_{45}^{(a_8)}F_{12}^{(a_9)}F_{34}^{(a_{10})},$$

The first adjacent pair of root vectors appearing in the wrong order is $`F_{12}^{(a_3)}F_{45}^{(a_4)}`$. Applying relation (a) of Proposition 8.3 we obtain

$$b=F_{34}^{(a_1)}F_{23}^{(a_2)}F_{45}^{(a_4)}F_{12}^{(a_3)}F_{34}^{(a_5)}F_{23}^{(a_6)}F_{34}^{(a_7)}F_{45}^{(a_8)}F_{12}^{(a_9)}F_{34}^{(a_{10})}.$$

Next apply relation (a) to the adjacent pair $`F_{23}^{(a_2)}F_{45}^{(a_4)}`$ and obtain

$$b=F_{34}^{(a_1)}F_{45}^{(a_4)}F_{23}^{(a_2)}F_{12}^{(a_3)}F_{34}^{(a_5)}F_{23}^{(a_6)}F_{34}^{(a_7)}F_{45}^{(a_8)}F_{12}^{(a_9)}F_{34}^{(a_{10})}.$$

Now we apply relation (d) to the adjacent pair $`F_{34}^{(a_1)}F_{45}^{(a_4)}`$ and obtain

$$b=v^{(a_1p_1)(a_4p_1)}F_{45}^{(a_4p_1)}F_{35}^{(p_1)}F_{34}^{(a_1p_1)}F_{23}^{(a_2)}F_{12}^{(a_3)}F_{34}^{(a_5)}F_{23}^{(a_6)}F_{34}^{(a_7)}F_{45}^{(a_8)}F_{12}^{(a_9)}F_{34}^{(a_{10})},$$

where the sum is over those $`p_1`$ satisfying $`0p_1\mathrm{min}(a_1,a_4)`$. Continuing the algorithm in this way we obtain, after 25 steps,

$$b=\underset{(p_1,p_2,\mathrm{}p_{10})P}{}\lambda _{𝐩,𝐚}F_{45}^{(f_1)}F_{35}^{(f_2)}F_{34}^{(f_3)}F_{25}^{(f_4)}F_{24}^{(f_5)}F_{23}^{(f_6)}F_{15}^{(f_7)}F_{14}^{(f_8)}F_{13}^{(f_9)}F_{12}^{(f_{10})},$$

where

$`𝐟`$ $`=`$ $`(f_1,f_2,f_3,f_4,f_5,f_6,f_7,f_8,f_9,f_{10})=(a_4+a_8p_1p_6p_7p_8,p_1+p_8,`$
$`a_1+a_5+a_7+a_{10}p_1p_2p_4p_5p_8p_9p_{10},p_7,p_2+p_5p_7+p_{10},`$
$`a_2+a_6p_2p_3p_5p_{10},p_6,p_4p_6+p_9,p_3p_4p_9,a_3+a_9p_3).`$
The lowest power of $`v`$ in $`\lambda _{𝐩,𝐚}`$ is $`𝐱T𝐱^t`$ where $`𝐱=(a_1,a_2,\mathrm{},a_{10},p_1,p_2,\mathrm{},p_{10})`$ and

$$T=\left(\begin{array}{cccccccccccccccccccc}0& 0& 0& 1& 1& 0& 1& 1& 0& 1& 1& 1& 0& 1& 1& 1& 1& 1& 1& 1\\ 0& 0& 0& 0& 1& 1& 1& 0& 0& 1& 0& 1& 1& 1& 1& 0& 0& 0& 1& 1\\ 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 0& 0& 1& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 0& 0& 0& 0& 0& 0& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 0& 0& 1& 1& 0& 1& 0& 0& 0& 1& 1& 1& 1& 1& 1& 1\\ 0& 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 0& 0& 1& 1& 0& 0& 0& 1& 1\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 1& 0& 0& 0& 0& 0& 1& 1& 1& 1& 1\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 1& 1& 0& 1& 1& 0& 1& 1& 1& 0& 1& 1& 1& 1& 0& 1& 1\\ 0& 0& 0& 0& 1& 1& 1& 0& 0& 1& 0& 1& 1& 1& 0& 0& 0& 1& 1& 0\\ 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 0& 0& 1& 0& 1& 0& 0& 0& 0& 1\\ 0& 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 0& 0& 1& 0& 0& 1& 1& 0& 1\\ 0& 0& 0& 0& 0& 0& 1& 0& 0& 1& 0& 0& 0& 1& 1& 0& 0& 1& 1& 0\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 1& 0& 0& 0& 0& 0& 1& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 1& 0& 0& 0& 0& 0& 1& 1& 0& 1& 0\\ 0& 0& 0& 0& 0& 0& 0& 1& 0& 1& 0& 0& 0& 0& 0& 1& 1& 1& 1& 1\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 1& 0& 0& 0& 0& 0& 0& 0& 0& 1& 0\\ 0& 0& 0& 0& 0& 0& 0& 0& 0& 1& 0& 0& 0& 0& 0& 0& 0& 0& 1& 1\end{array}\right).$$

Here $`P`$ is the set of $`(p_1,p_2,\mathrm{},p_{10})^{10}`$ satisfying $`p_1a_1,p_1a_4,p_2a_2,p_2a_5,p_3a_3,p_3a_6,p_4p_3,p_4a_7,p_5p_2p_3+a_2+a_6,p_5p_4+a_7,p_6p_4,p_6a_8,p_7p_2+p_5,p_7p_6+a_8,p_8p_1p_2p_4p_5+a_1+a_5+a_7,p_8p_6p_7+a_8,p_9p_3p_4,p_9a_{10},p_{10}p_2p_3p_5+a_2+a_6,p_{10}p_9+a_{10}.`$

The function $`S_𝐢^𝐥(𝐚)=𝐜`$ is given in this example by

$$𝐜=(a_1+a_4,a_1,a_2+a_5,a_7+a_8,a_2+a_7a_8,a_3+a_6,a_7,a_{10},a_3a_7a_{10},a_9).$$

It can be checked that if $`𝐩`$ is taken as $`(a_1,a_2,a_3,a_7,0,a_7,a_8a_7,0,a_{10},0)`$ then $`𝐩`$ satisfies the inequalities as given above and $`𝐟=𝐜`$. Furthermore, $`𝐱T𝐱^t=0`$, so that $`\lambda _{𝐩,𝐚}1+v[v]`$. Since for any $`𝐩`$ satisfying the above inequalities we must have $`\lambda _{𝐚,𝐩}[v]`$ and the coefficient of the lowest power of $`v`$ in $`\lambda _{𝐚,𝐩}`$ is always $`1`$, it follows that the coefficient of $`F_𝐥^𝐜`$ in the above sum, when terms in the same PBW basis element are collected together, is of the form $`e+vh`$, where $`h[v]`$ and $`e,e0`$. Since $`b𝐁`$, we know by \[8, §§2.3, 3.2\] that $`b`$ has a unique expression as a $`[v]`$-combination of elements $`F_𝐥^𝐝`$ as $`𝐝`$ varies, in which precisely one of the coefficients lies in $`1+v[v]`$. It follows that $`e=1`$ and $`bF_𝐥^𝐜modv`$, whence $`bF_𝐥^𝐜modv^{}`$ by \[9, §2.3\]. But we know that

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_{10}}^{a_{10}}F_𝐥^𝐜modv^{},$$

since $`S_𝐢^𝐥(𝐚)=𝐜`$. It follows that

$$\stackrel{~}{F}_{i_1}^{a_1}\stackrel{~}{F}_{i_2}^{a_2}\mathrm{}\stackrel{~}{F}_{i_{10}}^{a_{10}}1F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_{10}}^{(a_{10})}modv^{}.\mathrm{}$$

As a consequence of Theorem 8.4 we may deduce the relationships between the set $`M_𝐢`$ of tight monomials, the Lusztig cone $`C_𝐢`$, and the simplicial region of linearity $`X_𝐢`$ of the piecewise-linear function $`R_𝐣^𝐣^{}`$.

###### Theorem 8.5

For each reduced expression $`𝐢`$ for $`w_0`$ let $`M_𝐢=\{F_{i_1}^{(a_1)}F_{i_2}^{(a_2)}\mathrm{}F_{i_k}^{(a_k)}:𝐚C_𝐢\}`$. Suppose we have type $`A_4`$. Then $`M_𝐢𝐁`$. Moreover, under Kashiwara’s parametrization of $`𝐁`$ we have $`\psi _𝐢(M_𝐢)=C_𝐢`$ and under Lusztig’s parametrization of $`𝐁`$ we have $`\varphi _𝐣(M_𝐢)=X_𝐢`$.

Proof: We recall that $`M_𝐢𝐁`$ was shown in . Theorem 8.4 shows that $`\psi _𝐢(M_𝐢)=C_𝐢`$. Proposition 6.1 shows that $`S_𝐢^𝐣(C_𝐢)=X_𝐢`$. Now $`S_𝐢^𝐣=\varphi _𝐣\psi _𝐢^1`$. Since $`\psi _𝐢^1(C_𝐢)=M_𝐢`$ it follows that $`\varphi _𝐣(M_𝐢)=X_𝐢`$$`\mathrm{}`$

Acknowledgements

The research for this paper was supported in part by EPSRC research grant ref. GR/K55233 (the second author was an EPSRC research assistant of Professor K. A. Brown at the University of Glasgow, Scotland). It was typeset in .