Combinatorics of canonical bases revisited: String data in type $A$
Volker Genz, Gleb Koshevoy, Bea Schumann

TL;DR
This paper provides explicit formulas and descriptions for the crystal structure and involutions on string data in type A, offering new insights into the combinatorics of canonical bases and inequalities for string polytopes.
Contribution
It introduces a formula for the crystal structure on integer points of string polytopes and describes the Kashiwara *-involution explicitly for type A.
Findings
Explicit crystal structure formula for string polytopes.
Defining inequalities for Nakashima-Zelevinsky string polytopes.
Explicit description of Kashiwara *-involution in type A.
Abstract
We give a formula for the crystal structure on the integer points of the string polytopes and the -crystal structure on the integer points of the string cones of type for arbitrary reduced words. As a byproduct we obtain defining inequalities for Nakashima-Zelevinsky string polytopes. Furthermore, we give an explicit description of the Kashiwara -involution on string data for a special choice of reduced word.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Combinatorics of canonical bases revisited: String data in type
Volker Genz
Mathematical Institute, Ruhr-University Bochum
,
Gleb Koshevoy
IITP Russian Academy of Sciences, MCCME and Poncelet Center
and
Bea Schumann
Mathematical Institute, University of Cologne
Abstract.
We give a formula for the crystal structure on the integer points of the string polytopes and the -crystal structure on the integer points of the string cones of type for arbitrary reduced words. As a byproduct we obtain defining inequalities for Nakashima-Zelevinsky string polytopes. Furthermore, we give an explicit description of the Kashiwara -involution on string data for a special choice of reduced word.
Introduction
Let be a simple complex Lie algebra of rank and a finite dimensional representation of . Much information of is encoded in a directed graph with arrows colored by , called the crystal graph of [K91]. For instance, this crystal graph is connected if and only if is irreducible, the character of is encoded in the vertices of the crystals graph and there exists a simple notion of the tensor product of two crystal graphs yielding the crystal graph of the tensor product of two representations.
For irreducible, its crystal graph has a unique source corresponding to a highest weight vector of . Making use of this fact, Littelmann [Lit98] and Berenstein-Zelevinsky [BZ93, BZ01] gave a bijection between the vertices of this graph as integer points of a rational convex polytope, called the Littelmann–Berenstein-Zelevinsky string polytope.
The rule for assigning an integer point in the Littelmann–Berenstein-Zelevinsky string polytope to a vertex is as follows. Let be the largest integer such that there are consecutive arrows of color ending in . Let be the source of this sequence of arrows. Let be the length of the longest sequence of arrows of a color ending in and so on. If we pick the colors according to the appearance in a reduced decomposition of the longest Weyl group element of , this procedure ends at the source of the graph. Then the vertex maps to the integer point , called the string datum of .
Littelmann–Berenstein-Zelevinsky string polytopes have a vast amount of applications. They are generalizations of Gelfand-Tsetlin polytopes ([Lit98]), appear as Newton-Okounkov bodies for flag varieties ([FFL17, K15]) and in Gross-Hacking-Keel-Kontsevich’s construction of canonical bases for cluster varieties ([BF16, GKS17]).
We consider the following problem for the string polytope of an irreducible representation associated to the reduced word of the longest Weyl group element of .
Problem 0.1**.**
Give a formula for the operator on the integer points of the string polytope defined as follows. For two integer points and in we have , if the corresponding vertices and in the crystal graph are connected by an arrow of color .
Problem 0.1 is easy to solve for . In this case we have
[TABLE]
There is, however, no obvious solution for arbitrary . For and the reduced word , one can deduce from an explicit construction of the crystal graph ([DKKA07]) that is equal to if and otherwise. In this work we solve Problem 0.1 by establishing a formula for the operator for any in the case that .
For and a reduced word of the longest element of the Weyl group of we define in Section 4 finitely many sequences of positive roots of with certain properties which we call -crossings. These sequences come with an order relation . We further introduce maps , associating to the vectors , .
Our main result reads as follows, where is the standard scalar product on .
Theorem 5.1.
Let be minimal such that is maximal. Then
[TABLE]
Theorem 5.1 is in analogy to the Crossing Formula established in [GKS16, Theorem 2.13, Proposition 2.20], which computes the operator on the polytopes arising from Lusztig’s parametrizations of the crystal graph. Indeed, the two formulae may be viewed as dual since the roles of maximum and minimum and the vectors , interchange. We elaborate on this duality in [GKS19].
Theorem 5.1 gives rise to two applications. The Verma module of of weight [math] has a crystal graph with a unique source. Kashiwara [K93] defined an involution on the vertices of , leading to a second crystal graph with the same set of vertices. Namely, there is an arrow from to of color in if and only if there is an arrow from to of color in .
Associating integer vectors to the vertices of by taking their string data, we obtain a rational polyhedral cone called the string cone [Lit98, BZ93, BZ01] which contains the Littelmann–Berenstein-Zelevinsky string polytope.
A variation of Problem 0.1 now arises, replacing the Littelmann–Berenstein-Zelevinsky string polytope by the string cone and the crystal graph of an irreducible representation by . In Theorem 5.2 we provide a solution to this problem for . Indeed the crystal graph of each irreducible representation is a full subgraph of . Making use of this fact we deduce Theorem 5.2 from Theorem 5.1.
A second crystal graph for the irreducible representation is obtained as a full subgraph of . The set of corresponding string parameters is, due to a result of Fujita-Naito [FN17], again the set of integer points in a rational polytope, called the Nakashima-Zelevinsky string polytope. These polytopes have been found to coincide with Newton-Okounkov bodies for flag varieties [FN17, FO17]. They also appear in [CFL] among Newton-Okounkov bodies inducing semitoric degenerations of Schubert varieties associated to maximal chains in the corresponding Bruhat graphs.
For Nakashima-Zelevinsky polytopes problem 0.1 has been solved in the work of Kashiwara [K93] and Nakashima-Zelevinsky [NZ97, N99]. It is, however, a difficult problem to compute the inequalities which cut the Nakashima-Zelevinsky polytopes out of the string cone. This is so far only known in a few special cases [N99, H05]. Using Theorem 5.2 we obtain these inequalities for all reduced words of the longest Weyl group element of in Theorem 6.1.
The paper is organized as follows. In Section 1 we recall the background on crystals. In Section 2 we recall facts about reduced words for elements of the symmetric group. In Section 3 string cones and Littelmann–Berenstein-Zelevinsky string polytopes, as well as their crystal structures, are discussed.
In Section 4 we introduce the main combinatorial tools of this paper, namely the notion of wiring diagrams and Reineke crossings. The main result (Theorem 5.1), providing a formula for the crystal structure on Littelmann–Berenstein-Zelevinsky string polytopes, is stated in Section 5. We further prove the Dual Crossing Formula for the -crystal structure on the string cone in this section.
In Section 6 Nakashima-Zelevinsky string polytopes are introduced and their defining inequalities are computed.
Section 7 deals with Lusztig’s parametrization of the canonical basis and recalls facts from [GKS16] which are used in the proof of Theorem 5.1 which is presented in Section 8.
In Section 9 we give a description of the piecewise linear Kashiwara -involution on string data. In particular, we obtain a linear isomorphism between the Littelmann–Berenstein-Zelevinsky polytope and the Nakashima-Zelevinsky polytope for a specific reduced word.
Acknowledgement
V. Genz and G. Koshevoy were partially supported by the SFB/TRR 191. V. Genz would like to thank the Independent University of Moscow and the Labaratoire J.-V. Poncelet for their hospitality. G. Koshevoy was supported by the grant RSF 16-11- 10075. He would furthermore like to thank the University of Cologne and the Ruhr-Univerity Bochum for their hospitality. B. Schumann was supported by the SFB/TRR 191. B. Schumann would furthermore like to thank Xin Fang, Peter Littelmann, Valentin Rappel, Christian Steinert and Shmuel Zelikson for helpful discussions.
1. Crystals
1.1. Notation
Let be the natural numbers and , its Cartan subalgebra consisting of the diagonal matrices in . We abbreviate
[TABLE]
and define for the function by . We denote by the set of positive roots of given by
[TABLE]
For , the simple root of is given by . We denote by the cardinality of .
To we associate the fundamental weight of . Let (resp. ) the -span (resp. -span) of the set of fundamental weights of . We call the weight lattice and the set of dominant integral weights.
Let be the - algebra with generators , and the following relations for
[TABLE]
[TABLE]
[TABLE]
[TABLE]
For , let . For we set
[TABLE]
For we denote by the irreducible -module of highest weight .
We finally denote by be the subalgebra generated by .
1.2. Crystals
We recall the definition of crystals from [K94, Section 7]
Definition 1.1**.**
A crystal is a set endowed with the following maps.
[TABLE]
Here [math] is an element not included in . The above maps satisfy the following axioms for and
- (C1)
,
- (C2)
if satisfies then
[TABLE]
- (C3)
if satisfies then
[TABLE]
- (C4)
if and only if ,
- (C5)
if , then .
Here we put for .
Let and be crystals. A map satisfying is called a strict morphism of crystals if commutes with all , () and if for , we have
[TABLE]
for all . An injective strict morphism is called a strict embedding of crystals and a bijective strict morphism is called an isomorphism of crystals.
Definition 1.2**.**
Let and be crystals. The set
[TABLE]
equipped with the following crystal structure is called the tensor product of and . For
[TABLE]
1.3. Crystals of representations
We recall the crystal bases and of and , respectively, from [K91, Sections 2 and 3].
Let . For there exist unique such that
[TABLE]
We define . As vector spaces, we have
[TABLE]
We define the Kashiwara operators , on for by
[TABLE]
Let be the subring of consisting of rational functions without a pole at . Let be the -lattice generated by all elements of the form
[TABLE]
and let be the subsets of all residues of elements of the form (3).
For let be the weight of the corresponding element in . For we furthermore set This endows with the structure of an crystal (see Definition 1.1).
We let be the -anti-automorphism of such that for all . By [K93, Theorem 2.1.1] we have . Clearly preserves the function . We denote by , and the -twisted maps. This endows with a second structure of a crystal. We denote the crystal given by the set and the twisted maps by . By construction induces a crystal isomorphism between and .
For let be the surjection , where is a highest weight vector of . The operators and defined in (2) descend to and we denote by the -lattice generated by all elements of the form
[TABLE]
and by the subsets of all residues of elements of the form (4).
For let be the weight of the corresponding element in . For we furthermore set
[TABLE]
This endows with the structure of a crystal (see Definition 1.1).
We embed into with accordingly shifted weight as follows.
By [K91, Theorem 4] we have inducing a map with the following properties:
- •
for all ,
- •
If we have for all ,
- •
is bijective.
For an integral weight, let be the crystal consisting of one element satisfying , and for all
By [J95, Corollary 5.3.13], [N99, Theorem 3.1]
[TABLE]
is a subcrystal of and induces an isomorphism of crystals . Furthermore,
[TABLE]
2. Symmetric groups, reduced words and wiring diagrams
2.1. Symmetric groups and reduced words
Let be the symmetric group in letters. The group is generated by the simple transpositions () interchanging and .
A reduced expression of is a decomposition of
[TABLE]
into a product of simple transposition with a minimal possible number of factors. We call the length of . For a reduced expression of we write and call a reduced word (for ). The set of reduced words for is denoted by .
The group has a unique longest element of length . We have two operations on the set of reduced words .
Definition 2.1**.**
A reduced word is said to be obtained from by a -move at position if and .
A reduced word is said to be obtained from
[TABLE]
by a -move at position if , and
A pair with is called an inversion for if . Let be the set of inversions for . We have the is equal to the length .
A total ordering on is called a reflection ordering if for any triple we either have or .
It is well known that the sets and are in natural bijection (see e.g. [D93, Proposition 2.13]). Under this bijection the reflection order corresponding to is given by
[TABLE]
where , .
Remark 2.2**.**
Let . The set is in bijection with via the map
[TABLE]
where is defined in Section 1.1. The reflection order corresponding to induces a total ordering on in this case.
3. String parametrizations
3.1. String parametrization
3.1.1. Kashiwara embedding and string parameters
Let and . For we recursively define
[TABLE]
and call the string datum of in direction .
By [Lit94, Lemma 5.3] we have
[TABLE]
where is the element in of highest weight.
By (7) the map is injective. We denote by the image of . Let be the cone spanned by . By [Lit98, Proposition 1.5], [BZ01, Proposition 3.5] is a rational polyhedral cone, called the string cone, and are the integral points of .
Recall the definition of and from Section 1.3. Now let
[TABLE]
We call the -string datum of in direction .
Lemma 3.1**.**
For we have
[TABLE]
Proof.
Let . By (7) we have . Applying to both sides and using that and we get
[TABLE]
Since
[TABLE]
we obtain (8). Now (9) follows by applying (7) to .
Since the crystals and have the same underlying set (see Section 1.3), Equation (10) follows from (8). ∎
3.2. Crystal structures on string data
In this section we equip with two crystal structures isomorphic to .
For and let be a formal symbol. We denote by the crystal, such that for
[TABLE]
By [K93, Theorem 2.2.1] there exists for any a unique strict embedding of crystals given by
[TABLE]
In [K93, Theorem 2.2.1 and its proof] (see also [NZ97, Section 2.4]) the following statement is proved.
Lemma 3.2**.**
Let and . We have
[TABLE]
Lemma 3.2 naturally provides two crystal structures on as follows.
Let . We iterate the map (11) along by setting
[TABLE]
Combining Lemma 3.1 with Lemma 3.2 we obtain the strict embedding
[TABLE]
where . Identifying with via
[TABLE]
yields two crystal structures and on .
From we obtain the following explicit description of the crystal structure on resulting from . Let be the Cartan matrix of . For and we set
[TABLE]
Lemma 3.3**.**
The crystal structure on obtained from via the bijection is given as follows. For and
[TABLE]
where is minimal with and and where is maximal with and .
The crystal structure on obtained from via the bijection is given as follows.
By [Lit98, Proposition 2.3] (see also [BZ93, Theorem 2.7]) we introduce piecewise linear bijections between the string cones associated to reduced words satisfying for
[TABLE]
as follows. If is obtained from by a -move at position we set with
[TABLE]
[TABLE]
[TABLE]
If is obtained from by a -move at position we set
[TABLE]
For arbitrary we define as the composition of the transition maps corresponding to a sequence of and moves transforming into .
Lemma 3.4**.**
Let and with . Setting we have
[TABLE]
Proof.
The statement follows from Lemma 3.2 and (14). ∎
In Theorem 5.2 we give a formula for the crystal structure of Lemma 3.4.
3.3. String polytopes and their crystals structures
Let and . Recall from (5) that the crystal is isomorphic to the subcrystal of . Hence, using (7) we get a bijection between and
[TABLE]
In [Lit98, Proposition 1.5] it is shown that is the set of integer points of the rational polytope
[TABLE]
We call the Littelmann–Berenstein-Zelevinsky string polytope.
By (16) we obtain the following crystal structure isomorphic to on . Denoting by the natural embedding we obtain
Lemma 3.5**.**
For and we have
[TABLE]
In Theorem 5.1 we give a formula for the crystal structure of Lemma 3.5.
4. Wiring diagrams and Reineke crossings
Following [BFZ96], we introduce the notion of a wiring diagram which is a graphical presentation of the reduced word .
Definition 4.1** (wiring diagram).**
Let . The wiring diagram consists of a family of piecewise straight lines, called wires, which can be viewed as graphs of continuous piecewise linear functions defined on the same interval. The wires have labels in the set . Each vertex of (i.e. an intersection of two wires) represents a letter in . If the vertex corresponds to the letter , then is equal to the number of wires running below this intersection. We call the level of the vertex and write
[TABLE]
The word can be read off from by reading the levels of the vertices from left to right.
Example 4.2**.**
Let and . The corresponding wiring diagram is depicted below.
1$$2$$3$$4$$5$$2$$1$$2$$3$$4$$3$$2$$1$$3$$2
The condition implies that two lines with in intersect exactly once.
Each vertex of the wiring diagram , , corresponds to an inversion , where and are the labels of the wires intersecting in that vertex. Thus the vertices of are in bijection with the positive roots by (6). The reflection order on and the induced total order on can be read off of by reading the vertices from left to right. We identify
[TABLE]
such that corresponds to the -th vertex in from left.
Example 4.3**.**
We continue with Example 4.2. The reflection ordering
[TABLE]
corresponding to is depicted in the wiring diagram below.
1$$2$$3$$4$$5$$\scriptstyle{(1,3)}$$\scriptstyle{(3,5)}$$\scriptstyle{(2,3)}$$\scriptstyle{(1,2)}$$\scriptstyle{(2,5)}$$\scriptstyle{(1,4)}$$\scriptstyle{(4,5)}$$\scriptstyle{(2,4)}$$\scriptstyle{(1,5)}
Definition 4.4**.**
Let and be the corresponding wiring diagram. For we denote by the oriented graph obtained from by orienting its wires from left to right if , and from right to left if .
Example 4.5**.**
Let and as in Example 4.2. The oriented graph looks as follows.
1$$2$$3$$4$$5>>>>>>>>>>><<<>****<
An oriented path in is a sequence of vertices of which are connected by oriented edges in .
Definition 4.6** (Reineke crossings).**
For an -crossing is an oriented path in which starts with the leftmost vertex of the wire and ends with the leftmost vertex of the wire . Additionally satisfies the following condition: Whenever lie on the same wire in and the vertex lies on the intersection the wires and , we have
[TABLE]
In other words, the path avoids the following two fragments.
p
>
>
>
p
>
We denote the set of all -Reineke crossings by .
Remark 4.7**.**
Reineke crossings appear as rigorous paths in [GP00].
Example 4.8**.**
Let . The vertices lying on the red path below form the Reineke crossing .
1$$2$$3$$4$$5>>>>>>>>>><<<<<
In the remainder of this section we adopt the following convention: We label each vertex by the wires and that intersect in this edge where is the wire of the oriented edge whose source in is .
Definition 4.9**.**
Let and . We call the set of vertices such that the turning points of .
Example 4.10**.**
For as in Example 4.8 we have .
Using the identification (18) we introduce
Definition 4.11**.**
The maps and are given by
[TABLE]
Example 4.12**.**
Let be as in Example 4.8. We have
[TABLE]
By [GKS16, Proposition 2.2] we have the following order relation on :
Definition 4.13**.**
Let . We say if all vertices of lie in the region of cut out by .
Example 4.14**.**
Let be as in Example 4.8 and . In the picture below the region cut out by is shaded grey while consists of all vertices lying on the red path. Thus .
1$$2$$3$$4$$5>>>>>>>>>><<<<<
5. Dual Crossing Formula for string parametrizations
Let and . In this section we state our main result which is a formula for the crystal structure on the integer points of the Littelmann–Berenstein-Zelevinsky string polytope defined in (17).
Recall the notion of the set of -Reineke crossings from Definition 4.6 and their associated vectors from Definition 4.11. We denote by the standard scalar product on . The crystal structure on from Lemma 3.5 is explicitly computed by
Theorem 5.1**.**
For , and we have
[TABLE]
where is minimal with and is maximal with .
Theorem 5.1 is proved in Section 8. A formula for the -crystal structure on given in Lemma 3.4 can directly deduced from Theorem 5.1:
Theorem 5.2** (Dual Crossing Formula).**
For and we have
[TABLE]
where is minimal with and is maximal with .
Proof.
Since we can find for each a such that . Thus the claim follows from Lemma 3.5 and Theorem 5.1. ∎
Remark 5.3**.**
The -crystal structure on the string cone is dual to the crystal structure on Lusztig data, which is governed by the Crossing Formula 7.3 recalled below. By duality we understand the following: Maximum and minimum swap place as do the maps and .
The -crystal structure on Lusztig data is described by the -Crossing Formula [GKS16, Theorem 2.20], which is completely analogous to the Crossing Formula for Lusztig data. In [GKS16, Theorem 4.4] we show that is polar to the set
[TABLE]
i.e. the vectors of the -crystal structure on Lusztig data provide defining inequalities for . For the special case of reduced words adapted to quivers (23) was obtained in [Z13].
Similarly, the set of Lusztig data is polar to
[TABLE]
i.e. the vectors of the crystal structure (13) on provide defining inequalities for the cone of Lusztig data .
6. Defining inequalities of Nakashima-Zelevinsky string polytopes
Theorem 5.1 provides a formula for the crystal structure on the Littelmann–Berenstein-Zelevinsky string polytope . Switching the roles of and in the definition of one arrives at
[TABLE]
Building up on [NZ97], and its crystal structure is defined in [N99].
By Lemma 3.4 the set consists of the integer points of the Nakashima-Zelevinsky string polytope
[TABLE]
where on is defined as in (15). By [FN17] the convex polytope is rational. In this section we solve the problem of deriving defining inequalities for
The Dual Crossing Formula (Theorem 5.2) immediately implies
Theorem 6.1**.**
The set is explicitly described by
[TABLE]
Using the explicit description of defining inequalities of obtained in [GP00] we obtain defining inequalities of . We recall the result of [GP00] for the convenience of the reader.
Using the notation of Section 4 let be the wiring diagram associated to . For let be the graph obtained from by reversing all arrows. For an -rigorous path is an oriented path in which starts with the rightmost vertex of the wire and ends with the rightmost vertex of the wire . Additionally satisfies the following condition: Whenever lie on the same wire in and the vertex lies on the intersection the wires and , we have
[TABLE]
We denote the set of all -rigorous paths by .
For we define the set of turning points and the vector as in Definitions 4.9 and 4.11, respectively.
As a direct consequence of [GP00, Corollary 5.8] and Theorem 6.1 we obtain
Corollary 6.2**.**
The Nakashima-Zelevinsky string polytope is explicitly described by
[TABLE]
For the sake of completeness we recall the crystal structure on . For we consider the function on defined in (12). Analogously to Lemma 3.5 we have
Lemma 6.3** ([N99]).**
The following defines a crystal structure on isomorphic to . For and
[TABLE]
where is minimal with and and where is maximal with and .
7. The Crossing Formula on Lusztig data
The main ingredient in the proof of Theorem 5.1 is the Crossing Formula proved in [GKS16], which we recall in this section.
7.1. Lusztig’s parametrization of the canonical basis
Lusztig [L90] associated to a reduced word a PBW-type basis of as follows. Let be the total ordering of corresponding to via Remark 2.2. We set
[TABLE]
where acts via the braid group action defined in [Lu90, Section 1.3]. The divided powers for are defined in (1). Then the PBW-type basis
[TABLE]
is in natural bijection with the canonical basis of (see [L90, Proposition 2.3, Theorem 3.2]).
Definition 7.1**.**
We call , the -Lusztig datum of the element .
7.2. Crystal structures on Lusztig’s parametrizations
Let and be two reduced words for . A piecewise linear bijection from the set of -Lusztig data to the set of -Lusztig data is defined in [L90, Section 2.1] using the fact that any reduced word can be obtained from any other reduced word by applying a sequence of - and -moves given in Definition 2.1.
Let with corresponding total ordering of as in Remark 2.2. The crystal structure on -Lusztig data obtained from via the bijection
[TABLE]
is given as follows (see [L93], also [BZ01, Proposition 3.6]).
Proposition 7.2**.**
Let and with . For an -Lusztig datum and
[TABLE]
The main result of [GKS16] is the Crossing Formula for the crystal structure from Proposition 7.2. Using (5) this leads for to a formula for the crystal structure on isomorphic to :
Theorem 7.3** ([GKS16, Theorem 2.13, Proposition 2.20]).**
For , and we have
[TABLE]
where is minimal with and is maximal with .
8. Proof of Theorem 5.1
We fix as well as and set
[TABLE]
8.1. A bijection between string and Lusztig data
Let be the Cartan matrix of . For we define
[TABLE]
By [MG03, MG03, Corollaire 3.5], [CMMG04, Lemma 6.3] (see also [GKS17, Lemma 6.4, Lemma 7.4, Proposition 8.2]) we have
Proposition 8.1**.**
The map restricts to a bijection
[TABLE]
Further, for any .
The bijection between and intertwines the crystal structures given in Lemma 3.5 and Proposition 7.2 as follows.
Lemma 8.2**.**
For we have on
[TABLE]
Proof.
Clearly, (25) and (26) hold for and thus by Proposition 8.1 for arbitrary .
By (26) and the crystal axiom (C3) in Definition 1.1 it is enough to show (27) for the highest weight element of . By (25) we have for
[TABLE]
i.e. is the lowest weight element of . Thus
[TABLE]
∎
8.2. Reineke crossings and the bijection
For we attach in Definition 4.11 to the vectors , . In [G18, Theorem 3.11] it is shown that the map relates and as follows:
Proposition 8.3** ([G18]).**
For we have on .
In this section we use Proposition 8.3 to show
Proposition 8.4**.**
For , and we have
[TABLE]
For this we define for the function
[TABLE]
To prove Proposition 8.4 we use
Lemma 8.5**.**
For and we have .
Proof of Proposition 8.4.
From Proposition 8.3 we obtain
[TABLE]
By Lemma 8.5 we have
[TABLE]
Furthermore, since ,
[TABLE]
Thus, by Lemma 8.5
[TABLE]
Combining (28), (29) and (30) yields
[TABLE]
∎
It remains to prove Lemma 8.5. Recall the notion of the level of a vertex of from Definition 4.1. For each vertex of , we define
[TABLE]
and
[TABLE]
Here we understand ”headed upwards” and ”headed downwards” with respect to a small neighborhood around the vertex .
We give an example for this notion.
Example 8.6**.**
Let . And the Reineke crossing from Example 4.8 colored red below. We have
[TABLE]
1$$2$$3$$4$$5>>>>>>>>>><<<<<
Note that, by definition, for , we have , and . Thus, Lemma 8.5 is now a direct consequence of
Lemma 8.7**.**
For we have
Proof.
Assume that the vertex of lies at the intersection of wires and , where is the oriented wire with source .
We assume first , hence the wire is oriented from left to right in . We proceed by a case by case analysis.
Locally around there are two possibilities for :
q
>
>
pq
>
>
p
In the left case, we have , and . In the right case, we have , and .
Locally around there are two possibilities for :
p
>
>
qp
>
>
q
The left case cannot appear since is an -Reineke crossing. In the right case, we have , and .
Locally around there are two possibilities for :
i
>
q
>
i
>
q
>
In the both cases, we have , and .
The argument for the assumption is symmetrical. ∎
8.3. Proof of the Dual Crossing Formula
Proof of Theorem 5.1.
Equation (20) was established in Lemma 3.5.
We prove (19). By Lemma 8.2 and the crystal axiom (C1) in Definition 1.1
[TABLE]
By Proposition 8.1 we have . Using Theorem 7.3 to compute the value of on this Lusztig-datum we obtain
[TABLE]
where (32) follows from Proposition 8.4. By Lemma 8.2
[TABLE]
Plugging (32) and (33) into (31) yields (19).
We next prove (21). If the claim follows from Lemma 8.2.
Assume now that . By Lemma 8.2 we have
[TABLE]
By Proposition 8.1 we have that and by Lemma 8.2 that . Thus by Theorem 7.3
[TABLE]
where is minimal with . By Proposition 8.4 is independent of . Thus, is minimal with
[TABLE]
where we used (19) in the last equality. Furthermore, by (34) and (35)
[TABLE]
and (21) follows from Proposition 8.3.
The proof of (22) works analogously to the proof of (21). ∎
9. Kashiwara -involution on String data
In this section we denote by and the set of -string data equipped with the crystal structure inherited from and , respectively, via the bijection (see (13) and (15)). We denote by and the set of -Lusztig data with the crystal structure inherited from and , respectively, via the bijection defined in (24). We write . Using from the crystal and from we define the polytopes
[TABLE]
The integral points of and are and respectively.
For a reduced word we define
[TABLE]
For the Kashiwara -involution introduced in Section 1.3 on string data is given by the isomorphism of crystals
[TABLE]
In general the map (36) is piecewise linear. We show that (36) is linear for and .
Using the Crossing Formula [GKS16, Theorem 2.13] we compute : If is a maximal subword of of the form we have for
[TABLE]
From the -Crossing Formula [GKS16, Theorem 2.20] we compute
[TABLE]
Since and are related by a sequence of -moves the isomorphism of crystals sending -Lusztig data to -Lusztig data is linear. We thus obtain the linear isomorphism of crystals
[TABLE]
Since is an isomorphism of crystals as well, we obtain for the linear isomorphism of crystals
[TABLE]
and the unimodular isomorphismus of polytopes
[TABLE]
For arbitrary we obtain the piecewise linear isomorphisms
[TABLE]
and the piecewise linear volume preserving bijections
[TABLE]
By [BZ01, Proposition 3.3 (iii)] the -involution is given on Lusztig data by the linear map
[TABLE]
For we thus have the following commutative diagrams of isomorphisms of crystals which are linear for .
[TABLE]
Furthermore, the following are commutative diagrams of volume preserving piecewise linear bijections which are linear for .
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BFZ 96] Arkady Berenstein, Sergey Fomin, and Andrei Zelevinsky. Parametrizations of canonical bases and totally positive matrices. Adv. in Math. , 122 (1996), 49–149.
- 2[BZ 93] Arkady Berenstein and Andrei Zelevinsky. String bases for quantum groups of type A r subscript 𝐴 𝑟 A_{r} . In I. M. Gelfand Seminar , volume 16 of Adv. Soviet Math. , pages 51–89. Amer. Math. Soc., Providence, RI, 1993.
- 3[BZ 01] Arkady Berenstein and Andrei Zelevinsky. Tensor product multiplicities, canonical bases and totally positive varieties. Invent. Math. , 143(1):77–128, 2001.
- 4[BF 16] Lara Bossinger and Ghislain Fourier. String cone and Superpotential combinatorics for flag varieties and Schubert varieties. preprint 2016. arxiv:1611.06504
- 5[CMMG 04] Philippe Caldero, Robert Marsh R, Sophie Morier-Genoud. Realisation of Lusztig cones. Representation Theory , 8: 458–478, 2004.
- 6[CFL] Rocco Chirivì, Xin Fang, Peter Littelmann. Semitoric degenerations via Newton-Okounkov bodies, LS-algebras and standard monomial theory. In preparation.
- 7[DKKA 07] V.I.Danilov, A.V.Karzanov, G.A.Koshevoy. Combinatorics of regular A 2 subscript 𝐴 2 A_{2} -crystals. Journal of Algebra , 310 (2007), 218–234.
- 8[FFL 17] Xin Fang, Ghislain Fourier, and Peter Littelmann. Essential bases and toric degenerations arising from birational sequences. Adv. Math Volume 312, 107–149, 2017.
