A geometric $q$-character formula for snake modules
Bing Duan, Ralf Schiffler

TL;DR
This paper proves a geometric $q$-character formula for snake modules in certain quantum affine algebras, providing new combinatorial and algebraic insights into their structure and relation to cluster algebras.
Contribution
It establishes the geometric $q$-character formula for snake modules in types A and B, and explores their cluster algebra properties and combinatorial formulas.
Findings
Proved the geometric $q$-character formula for snake modules in types A and B.
Showed snake modules correspond to cluster monomials with square-free denominators.
Established factoriality of cluster algebras for types A, D, E.
Abstract
Let be the category of finite dimensional modules over the quantum affine algebra of a simple complex Lie algebra . Let be the subcategory introduced by Hernandez and Leclerc. We prove the geometric -character formula conjectured by Hernandez and Leclerc in types and for a class of simple modules called snake modules introduced by Mukhin and Young. Moreover, we give a combinatorial formula for the -polynomial of the generic kernel associated to the snake module. As an application, we show that snake modules correspond to cluster monomials with square free denominators and we show that snake modules are real modules. We also show that the cluster algebras of the category are factorial for Dynkin types .
| 1 | 2 | 2 | 1 | 1 | 1 | 1 | 2 | 3 | |
| 12 | 18 | 30 | 9 | 4 |
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.
A geometric -character formula for snake modules
Bing Duan
School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, P. R. China.
and
Ralf Schiffler
Department of Mathematics, University of Connecticut, Storrs, CT 06269-3009, USA
Abstract.
Let be the category of finite dimensional modules over the quantum affine algebra of a simple complex Lie algebra . Let be the subcategory introduced by Hernandez and Leclerc. We prove the geometric -character formula conjectured by Hernandez and Leclerc in types and for a class of simple modules called snake modules introduced by Mukhin and Young. Moreover, we give a combinatorial formula for the -polynomial of the generic kernel associated to the snake module. As an application, we show that snake modules correspond to cluster monomials with square free denominators and we show that snake modules are real modules. We also show that the cluster algebras of the category are factorial for Dynkin types .
Key words and phrases:
cluster algebra; quantum affine algebra; snake module; geometric character formula
2010 Mathematics Subject Classification:
13F60, 17B37
The first author was supported by China Scholarship Council as a Joint PHD student to visit Department of Mathematics at the University of Connecticut and he would like to thank Department of Mathematics for hospitality during his visit. He was also partially supported by the National Natural Science Foundation of China (Grant No. 11771191).
The second author was supported by NSF CAREER Grant DMS-1254567, NSF Grant DMS-1800860 and by the University of Connecticut.
1. Introduction
Let be a simple complex Lie algebra and let be the corresponding quantum affine algebra with quantum parameter not a root of unity. Denote by the category of finite dimensional -modules. The simple modules in have been classified in [CP91, CP94] by Chari and Pressley in terms of Drinfeld polynomials. In [FR98], Frenkel and Reshetikhin attached a -character to every module in and showed that the simple modules are determined up to isomorphism by their -characters. Moreover, the simple modules are parametrized by the highest dominant monomials in their -characters.
Cluster algebras were introduced in [FZ02] by Fomin and Zelevinsky as a tool for studying canonical bases in Lie theory. A cluster algebra is a commutative algebra with a distinguished set of generators, the cluster variables. These cluster variables are constructed by a recursive method called mutation, which is determined by the choice of a quiver without loops and 2-cycles. Given a cluster algebra , every cluster variable can be expressed as a Laurent polynomial with integer coefficients with respect to any given cluster [FZ02] and this Laurent polynomial has positive coefficients [LS15]. A cluster monomial is a product of cluster variables from the same cluster. It was proved in [CKLP13] that the set of all cluster monomials is linearly independent.
1.1. Category
A connection between representations of quantum affine algebras and cluster algebras was discovered by Hernandez and Leclerc in [HL10], where a monoidal categorification of certain cluster algebras was given. One significant aspect of a monoidal categorification is that, if it exists, it implies the positivity of the cluster variables and the linear independence of the cluster monomials, see [HL10, Proposition 2.2].
The monoidal categorification is realized as a subcategory of the category as follows. Let be the vertex set of the Dynkin diagram of for Dynkin types and be a partition of such that every edge connects a vertex of with a vertex of . Let , , be the full subcategory of whose objects satisfy the following property. For any composition factor of and every , the roots of the -th Drinfeld polynomial of belong to , where if and if .
For Dynkin types and , it has been shown in [HL10] that the category is a monoidal categorification of a cluster algebra of the same Dynkin type. This result was extended to Dynkin types by Nakajima in [Nak11], see also [HL13]. In [Q17], Qin proved that every cluster monomial corresponds to a simple module in for Dynkin types .
A simple module in is said to be real if is simple [Le03], and is said to be prime if it cannot be written as a non-trivial tensor product of modules [CP97].
1.2. Category
In [HL16], Hernandez and Leclerc considered a much larger subcategory of which contains, up to spectral shifts, all the simple finite-dimensional -modules. They showed that the Grothendieck ring of has a cluster algebra structure [HL16, Theorem 5.1], and they proposed two conjectures.
Conjecture 1.1**.**
[HL16, Conjecture 5.2]* The cluster monomials of the cluster algebra are in bijection with the isomorphism classes of real simple objects in .*
The second conjecture uses the theory of quivers with potentials developed in [DWZ08, DWZ10]. In [HL16, Section 5.2.2], Hernandez and Leclerc associated to every simple -module a so-called generic kernel , which is a module over the Jacobian algebra of the quiver with potential. They showed that, up to normalization, the truncated -character of a Kirillov-Reshetikhin module is equal to the -polynomial of the associated generic kernel, and they conjectured the following generalization.
Conjecture 1.2**.**
[HL16, Conjecture 5.3]* Up to normalization, the truncated -character of a real simple module in is equal to the -polynomial of the associated generic kernel.*
1.3. Snake modules
In this paper, we prove both conjectures in Dynkin types and for snake modules, a class of simple -modules introduced by Mukhin and Young in [MY12a, MY12b]. In [MY12a], they introduced a purely combinatorial method to compute -characters for snake modules of types and , and in [MY12b], they used snake modules to construct extended -systems for types and . In [DLL19], it was shown that all prime snake modules are real and that they correspond to some cluster variables in the cluster algebra constructed by Hernandez and Leclerc.
Our first main theorem is the following.
Theorem 1.3**.**
(Theorem 3.2 and Remark 3.4) Let be a prime snake module in . Then up to normalization, the truncated -character of is equal to the -polynomial of the associated generic kernel . More precisely,
[TABLE]
Replacing the module by a direct sum, we obtain a similar geometric character formula for arbitrary snake module of types and .
This proves Conjecture 1.2 for snake modules and gives a geometric algorithm for the truncated -characters. As a slight generalization of Theorem 3.4 of [DLL19], we show in Theorem 4.2 that snake modules are real modules.
Then in Theorem 3.9 and Remark 3.10 (3), we give a combinatorial formula for the -polynomial of the generic kernel associated to a snake module as a sum over certain non-overlapping paths in a subset of the -grid determined by . This result uses the model of Mukhin and Young [MY12a, MY12b]. As a consequence, we also obtain a combinatorial method to find the dimension vector of as well as all its submodules. Furthermore we show that is always rigid and it is indecomposable if the snake module is prime.
As an application, we prove Conjecture 1.1 for snake modules in the first part of the following theorem.
Theorem 1.4**.**
(Theorems 4.1 and 4.4) The truncated -character of a snake module is a cluster monomial. Moreover the denominator of this cluster monomial is square free and is parametrized by the support of as a representation of the quiver with potential.
It is natural to ask whether all cluster variables with square free denominators correspond to snake modules. This is not the case. However, the only counter examples we found are modules whose truncated -characters are not equal to their ordinary -characters.
Lastly, the study of square free denominators led us to questions of factorization in the cluster algebra. Applying the results of [ELS18], we include a proof that the cluster algebras of Hernandez-Leclerc are factorial for Dynkin types .
This paper is organized as follows. In Section 2, we briefly review basic materials on cluster algebras, quantum affine algebras, snake modules, and Hernandez and Leclerc’s results. Section 3 is on our geometric character formula for snake modules and Section 4 is devoted to the study of denominator vectors of cluster monomials corresponding to snake modules. In the last section, we prove that the cluster algebras are factorial for Dynkin types .
2. Preliminaries
2.1. Quivers and cluster algebras
We recall the definition of the cluster algebras introduced in [HL16]. Let be an indecomposable Cartan matrix of finte type. Then there exists a diagonal matrix with positive entries such that is symmetric. Let . Thus
[TABLE]
Let be the infinite quiver with vertex set and arrows if and . It needs to be pointed out that has two isomorphic connected components, see Lemma 2.2 of [HL16]. We pick one of the two components and denote it by with vertex set . We consider the full subquiver of with vertex set , see Figure 1.
Let and let be the cluster algebra defined by the initial seed . The cluster algebra is a cluster algebra of infinite rank.
Let be a new set of indeterminates over . For , we define to be the unique positive integer satisfying
[TABLE]
In other words, is the th vertex in its column, counting from the top.
For , we perform the substitution
[TABLE]
Note that
[TABLE]
for .
Let be the same quiver as but with vertex set . Let be the full subquiver of with vertex set , see Figure 2.
In this paper, we let be of type or . We work in the full subcategory of whose objects have all their composition factors of the form , where is a monomial in the variables .
2.2. Quantum affine algebras
Let be a simple complex Lie algebra whose Dynkin diagram has vertex set and be the dual Coxeter number of , see Table 1. Let be the corresponding untwisted affine Lie algebra which is realized as a central extension of the loop algebra . Let be the Drinfeld-Jimbo quantum enveloping algebra (quantum affine algebra for short) of with parameter not a root of unity, see [CP94].
Let be the quantum enveloping algebra. Recall that a -module is of type 1 if it is a direct sum of its weight subspaces. A -module is said to be of type 1 if the central element acts as the identity on , and if is of type 1 as a module . Let be the category of finite-dimensional -modules of type 1. Every finite-dimensional simple -module can be obtained from a type 1 module by twisting with an automorphism of , see [CP94, CP95a].
Let be the Grothendieck ring of . Let be the free abelian multiplicative group of monomials in infinitely many formal variables . The -character of an object in is defined as an injective ring homomorphism from to the ring of Laurent polynomial in infinitely many formal variables.
In this paper, we will be concerned only with polynomials involving the subset of variables , , . For simplicity of notation, we write for .
A monomial in is called dominant (respectively, anti-dominant) if it does not contain a factor (respectively, ) with . Following [FR98], for , define
[TABLE]
where the are the entries of the Cartan matrix. It follows that is a Laurent monomial in the variables with , see Section 2.3.2 of [HL13].
For any simple object in , it was shown by Frenkel and Mukhin [FM01] that the -character can be expressed as
[TABLE]
where is a monomial in the variables , , with positive powers, hence is a dominant monomial, and each is a product of factors . The monomial is called the highest weight monomial of . There is a partial order on defined by
[TABLE]
Then is maximum with respect to .
Every simple object in can be parametrized by the highest weight monomial occurring in its -character [CP91, FR98]. The highest weight monomial is dominant, but in general the highest weight monomial is not the only dominant monomial occurring in -characters. Given a dominant monomial , one can construct the corresponding simple module .
A simple module is called special or minuscule if is the only dominant monomial occurring in , see Definition 10.1 of [Nak04] or Section 5.2.2 of [HL10]. It is anti-special if there is exactly one anti-dominant monomial occurring in its -character. Clearly, a special or anti-special module must be simple. A simple module is called thin if any weight space of the simple module has no dimension greater than 1.
Following [HL10], define the truncated -character to be the Laurent polynomial obtained from by deleting all the monomials involving variables . In other words, . By Proposition 3.10 of [HL16], is an injective ring homomorphism from the Grothendieck ring of to .
2.3. Paths
Define a subset and an injective mapping as follows.
[TABLE]
Following [MY12a, MY12b], for every , a set of paths is defined as follows. Here a path is a finite sequence of points in the plane . We write if is a point of the path . In our diagrams, we connect consecutive points of a path by line segments for illustrative purposes only.
The following is the case of type . For all , let
[TABLE]
In other words, a path in must start at and end at and each step between them can either go up one unit or go down one unit. So .
Note that the cardinality of is equal to the number of Young tableaux that fit in an rectangle.
The sets of upper and lower corners of a path are defined as follows (see Figure 3):
[TABLE]
The following is the case of type . Fix an such that , for all , the set is defined as follows.
For all ,
[TABLE]
For all ,
[TABLE]
In other words, a path in must start at or at and then it can either go up or go down until . So .
For all , , let
[TABLE]
In other words, a path in , , must start at (respectively, ) and end at (respectively, ). It is not hard to get .
The sets of upper and lower corners of a path , where is the number of points in the path , are defined as follows:
[TABLE]
These definitions are illustrated in Figures 4 and 5.
In order to subsequently describe our -polynomials, it is helpful to define the notion of cell. We call a region in a cell if it is a minimal region enclosed by paths. For every cell, we define the coordinate of the cell as follows. If the cell is a square or a square missing a corner, its coordinate is defined as the coordinate of the intersection of two diagonals. If the cell is a right triangle, its coordinate is defined as the coordinate of the midpoint of its hypotenuse. It is obvious that for any , our cell coordinate is an element of .
We also need the following notations in this paper. For all , let be the highest path which is the unique path in with no lower corners and the lowest path which is the unique path in with no upper corners. Let be paths. We say that is strictly above or is strictly below if
[TABLE]
2.4. Snake modules
A simple module is called a Kirillov-Reshetikhin module if is of the form
[TABLE]
and is usually denoted by .
For completeness we recall the definition of snake module introduced by Mukhin and Young in [MY12a, MY12b]. Let . A point is said to be in snake position with respect to if
[TABLE]
The point is in minimal snake position to if is equal to the given lower bound. The point is in prime snake position to if
[TABLE]
A finite sequence , , , of points in is called a snake (respectively, prime snake, minimal snake) if for all , the point is in snake position (respectively, prime snake position, minimal snake position) with respect to [MY12a, MY12b].
The simple module is called a snake module (respectively, prime snake module, minimal snake module) if for some snake (respectively, prime snake, minimal snake) [MY12a, MY12b]. In this case, we say that is the snake of .
Theorem 2.1**.**
[DLL19, Section 4.1]* The snake modules of type or are precisely the -modules with highest weight monomial*
[TABLE]
where , for ; furthermore , where for ,
[TABLE]
where is the Kronecker delta, and we use the convention . In particular is a prime snake module if satisfies the following bounded conditions:
[TABLE]
Example 2.2**.**
- (1)
Every Kirillov-Reshetikhin module is a snake module, by taking in Theorem 2.1.
- (2)
Minimal affinizations introduced in [C95] (see also [ZDLL16]) are snake modules, by taking or and in Theorem 2.1.
- (3)
For examples of snake modules which are not Kirillov-Reshetikhin modules or minimal affinizations see Examples 3.5–3.7.
A graphic interpretation is that in , the upper bound of the integer is the minimum distance from the columns with vertex labelings and to the leftmost column and the rightmost column respectively. The value of is associated to the multiplicity of the left and right operators defined in Section 5.5 of [DLL19].
Let , , be a snake of length and . We say that a -tuple of paths is non-overlapping if is strictly above for all . Let
[TABLE]
Mukhin and Young have proved the following theorem.
Theorem 2.3** ([MY12a, Theorem 6.1]; [MY12b, Theorem 6.5]).**
Let , , be a snake of length . Then
[TABLE]
where the mapping is defined by
[TABLE]
Moreover, the module is thin, special and anti-special.
Remark 2.4**.**
A snake module is prime if and only if for all the paths and are overlapping.
In view of Theorem 2.3, the -characters of snake modules of types and with length are given by a set of -tuples of non-overlapping paths, the path in each -tuple is non-overlapping. This property is called the non-overlapping property.
For any two paths , can be obtained from by a sequence of moves, see Lemma 5.8 of [MY12a]. We say that if .
In the following we list some known facts about snake modules.
Theorem 2.5**.**
[MY12b, Proposition 3.1]* A snake module is prime if and only if its snake is prime. Every snake module can be uniquely written as a tensor product of prime snake modules (up to permutation).*
Theorem 2.6**.**
[DLL19, Theorem 3.4,Theorem 5.9]* Prime snake modules are real and they correspond to some cluster variables in the cluster algebra .*
Moreover, in Theorem 4.1 of [MY12b], Mukhin and Young introduced a set of 3-term recurrence relations satisfied by -characters of prime snake modules, called extended -system, which generalizes the usual -system. Moreover, in Theorem 4.1 of [DLL19], the authors introduced a system of equations satisfied by -characters of prime snake modules, called -system, which contains the usual -system. In fact the equations in the -system can be interpreted as cluster transformations in the cluster algebra where the initial cluster variables correspond to certain Kirillov-Reshetikhin modules.
2.5. Quivers with potentials
Following [HL16], for every with , and every , we have in an oriented cycle with length :
[TABLE]
A potential is defined as the formal (infinite) sum for all these oriented cycles up to cyclic permutations, see Section 3 of [DWZ08]. Hence in , all the cyclic derivatives of , introduced in Definition 3.1 of [DWZ08], are finite sums of paths. Indeed, a given arrow of can only occur in a finite number of summands.
Let be the set of all cyclic derivatives of . Let be the two-sided ideal of the path algebra generated by . Following [DWZ10, HL16], one defines the Jacobian algebra . Then is an infinite-dimensional -algebra.
Let be a finite-dimensional -module, and be a dimension vector. Let be the quiver Grassmannian of . Thus is the variety of submodules of with dimension vector . This is a projective complex variety. Denote by its Euler characteristic. Following [DWZ10, HL16], define the -polynomial of as a polynomial in the indeterminates , , as follows:
[TABLE]
It was shown in [DWZ10] that for any finite-dimensional , is a monic polynomial with constant term equal to .
Following Section 4.5.2 of [HL16], let and let be the full subquiver of with vertex set
[TABLE]
Let be the sum of all cycles in the potential which only involve vertices of , called a truncation of . Let be the two-sided ideal of generated by all cyclic derivatives of and let
[TABLE]
be the truncated Jacobian algebra at height . Denote by the natural projection.
It has been shown in Proposition 4.17 of [HL16] that for any , is finite-dimensional and the quiver with potential is rigid, namely, every cycle is cyclically equivalent to an element of .
2.6. -characters and -polynomials
Let be a dominant monomial in the variables for . Following [FZ07, HL16], for each , define
[TABLE]
It was shown in Lemma 4.15 of [HL16] that for , so is a monomial in the variables , by (2.2).
Using [FZ07, Corollary 6.3], Hernandez and Leclerc gave the following formula for a cluster variable in terms of its -polynomial and -vector. Every cluster variable of has the following form
[TABLE]
On the other hand, in [FM01], the truncated -character is expressed as
[TABLE]
where is a polynomial with integer coefficients in the variables and has constant term . Thus, by [HL16], if is a cluster variable of , then , where the integer vector is the -vector of .
Let be the indecomposable injective -module at vertex . Motivated by quivers with potentials [DWZ10] and cluster character [Pal08, Pal12], Hernandez and Leclerc defined the following notion of generic kernel.
Definition 2.7**.**
[HL16, Definition 4.5 and Section 5.2.2]* Let be the kernel of a generic -module homomorphism from the injective -module to the injective -module , where*
[TABLE]
The support of is the collection of all points such that the -component of is nonzero. We denote by the support of .
In [HL16], Hernandez and Leclerc proposed the following conjecture.
Conjecture 2.8**.**
[HL16, Conjecture 5.3]* Let be a real simple -mdoule in . Then up to normalization, the truncated -character of is equal to the -polynomial of the associated generic kernel. More precisely,*
[TABLE]
where the variables of the -polynomial are evaluated as in (2.2).
In Theorem 4.8 of [HL16], Hernandez and Leclerc proved Conjecture 2.8 for Kirillov-Reshetikhin modules, that is, up to renormalizing, the truncated -character of the Kirillov-Reshetikhin module is equal to the -polynomial of the generic kernel , where is the kernel of a generic -module homomorphism from to . We will prove Conjecture 2.8 for snake modules in Theorem 3.2.
2.7. A formula for the lowest weight monomial
Recall that as defined in Section 2.1. As a generalization of Remark 4.14 of [HL16], we can calculate the dimension vectors of the -module for . Indeed, by Lemma 6.8 and Corollary 6.9 of [FM01], the lowest monomial of is equal to , where is the involution of defined by , where is the longest element in the Weyl group of . Using Theorem 4.8 of [HL16], we can calculate the lowest monomial, which corresponds to the term in the -polynomial for the trivial submodule . Thus
[TABLE]
where is the dimension vector of .
In the next section, we will introduce a combinatorial method to calculate the dimension vector of the -module associated to the snake module .
3. A geometric character formula for snake modules
In this section, we show that the geometric character formula conjectured by Hernandez and Leclerc holds for snake modules of types and . We give a combinatorial formula for the -polynomial of the generic kernel associated to the snake module . As a consequence, we obtain a combinatorial method to compute the dimension vector of as well as all its submodules.
3.1. A geometric character formula for snake modules
We first give a description of the -vector for arbitrary prime snake module .
Proposition 3.1**.**
Let be a prime snake module with highest weight monomial of the form (2.7). Then we can rewrite
[TABLE]
where
[TABLE]
Here as in (2.7).
Proof.
From Theorem 2.1, it follows that every prime snake module is a -module with highest weight monomial of the form (2.7). Thus is a product of terms of the form
[TABLE]
Because of (2.4), for any ,
[TABLE]
is a Kirillov-Reshitikhin module. Now the result follows from Theorem 2.6 and Proposition 4.16 of [HL16]. ∎
We are now ready for the main result of this section. The following theorem gives a positive answer to the Hernandez-Leclerc Conjecture (Conjecture 2.8) for snake modules.
Theorem 3.2**.**
Let be a prime snake module in . Then up to normalization, the truncated -character of is equal to the -polynomial of the associated generic kernel . More precisely,
[TABLE]
where is a polynomial in the variables (2.2).
Proof.
Recall that is the cluster algebra defined in Section 2.1. We use the characterization of from Theorem 2.1. The fact that implies that each index of in the formula (2.7) is a vertex in . This implies that for some integer ,
[TABLE]
In particular, the second coordinate of (3.1) is non-positive. Thus for all .
By Theorem 2.6, the truncated -character is a cluster variable of . By Proposition 3.1, the -vector of is given by
[TABLE]
where we use that , because of (3.1).
For , let and . We denote by the same quiver as , but with vertices labeled by . Clearly, the cluster variable is a Laurent polynomial in the variables of for some , and can be regarded as a cluster variable of the cluster algebra defined by the initial seed .
The rest of the proof is similar to the proof of Theorem 4.8 in [HL16]. Since the quiver with potential is rigid, we can apply the theory of [DWZ08, DWZ10] and deduce that the -polynomial of coincides with the polynomial associated with a certain -module . Futhermore is rigid by [FK10, Am09].
By Remark 4.1 of [P12], is the kernel of a generic element of the homomorphism space between two injective -modules corresponding to the negative and positive components of the -vector of . More precisely, let be the injective -module at vertex , then is the kernel of a generic element of , where
[TABLE]
It was shown in [HL16] that our -module does not change when increases and that in the direct limit
[TABLE]
The -module is the kernel of a generic element of . Thus . ∎
From the proof of Theorem 3.2 we obtain the following corollay.
Corollary 3.3**.**
Let be a prime snake module in . Then the generic kernel is rigid and indecomposable.
Remark 3.4**.**
By Theorem 2.5, every snake module of type or type is isomorphic to a tensor product of prime snake modules defined uniquely up to permutation. On the other hand, if and are two finite-dimensional -modules, then by Proposition 3.2 of [DWZ10] we have . Therefore, replacing the module in Theorem 3.2 by a direct sum, we obtain a similar geometric character formula for arbitrary snake module of types and .
We present several examples to illustrate Theorem 3.2.
Example 3.5**.**
In type , let , , , , , , and . Then . We get
[TABLE]
Thus by Definition 2.7
[TABLE]
The module has dimension 13 and is displayed in Figure 6. In Figure 6, all vertices carry a vector space of dimension . Applying Theorem 3.2, we can compute its -character as follows. There are 160 submodules in .
[TABLE]
Starting from the initial seed , the following sequence of mutations produces (in the last step) the cluster variable corresponding to .
[TABLE]
Example 3.6**.**
In type , let , , , , , and . Then . We get
[TABLE]
Thus by Definition 2.7
[TABLE]
The module has dimension 8 and is displayed in Figure 7. In Figure 7, all vertices carry a vector space of dimension . Applying Theorem 3.2, we can compute its -character as follows. There are 35 submodules in .
[TABLE]
Starting from the initial seed , the following sequence of mutations produces (in the last step) the cluster variable corresponding to .
[TABLE]
Example 3.7**.**
In type , let , , , , , and . Then . We get
[TABLE]
Thus by Definition 2.7
[TABLE]
The module has dimension 6 and is displayed in Figure 8. In Figure 8, all vertices carry a vector space of dimension . Applying Theorem 3.2, we can compute its -character as follows. There are 15 submodules in .
[TABLE]
Starting from the initial seed , the following sequence of mutations produces (in the last step) the cluster variable corresponding to .
[TABLE]
3.2. Combinatorial character formula
Recall from Section 2.3 that for , we denote by (respectively, ) the unique highest (respectively, lowest) path in . For an arbitrary path , we let denote the symmetric difference between and , defined as . Then the set encloses the union of some consecutive cells.
Remark 3.8**.**
In type , the mapping defines a bijection between and the set of all Young diagrams inside an rectangle.
We define the height monomial of a path by
[TABLE]
where runs over all the cell coordinates in and we use the convention: if . In particular, .
Recall that for any snake , ,
[TABLE]
Theorem 3.9**.**
Let be a prime snake module and be the generic kernel associated to . Then
[TABLE]
Proof.
By Theorem 3.2, we have
[TABLE]
and Theorem 2.3 gives a formula for in terms of paths
[TABLE]
Note that equation (3.2) uses the truncated -character whereas equation (3.3) uses the complete -character . First we prove the statement in the case where .
Applying Lemma 5.10 of [MY12a] and using induction, we have
[TABLE]
where , , is a sequence of cell coordinates determined by the symmetric difference , . Therefore
[TABLE]
Moreover, since is the highest path in , Theorem 2.3 implies that contains no negative powers. Since is special, its highest weight monomial is the unique dominant monomial in , and thus
[TABLE]
Thus equations (3.2)–(3.6) imply
[TABLE]
Now suppose . Then we have to modify the above argument as follows. Equation (3.3) is replaced by
[TABLE]
In other words, we require that for each path the upper and lower corners lie in . Moreover, in equation (3.5), we replace by where
[TABLE]
Then
[TABLE]
∎
Remark 3.10**.**
- (1)
Theorem 3.9 allows us to calculate the dimension vector of the -module in a combinatorial way using all -tuples of non-overlapping paths. We will explain this in the next section.
- (2)
Theorem 3.9 provides a combinatorial approach to find all submodules of , see Examples 3.14-3.16.
- (3)
Using Proposition 3.2 of [DWZ10], for any two finite-dimensional -modules and , we have
[TABLE]
Replacing the -module in Theorem 3.9 by a direct sum of such modules, we obtain a similar combinatorial formula for arbitrary snake modules.
Corollary 3.11**.**
If is a snake module and is the associated generic kernel, then for all dimension verctors we have
[TABLE]
Proof.
Using Theorem 3.9 and the definition of the -polynomial, it suffices to show that for any two -tuples of non-overlapping paths, we have . This holds because are disjoint paths and each is determined by . ∎
Remark 3.12**.**
Corollary 3.11 holds for any thin and real module if the Conjecture 13.2 of [HL10] or Conjecture 5.2 of [HL13] or Conjecture 9.1 of [Le10] holds.
3.3. Generic kernel
Recall that is a collection of paths defined in Section 2.3. Let
[TABLE]
Let be a collection of paths associated to a snake module of the form (2.7) in . For any snake , , let
[TABLE]
Let be the set of all the cell coordinates in the set , where is a minimal path in for each and .
Note that when , the set is the set of all the cell coordinates in the set .
Definition 3.13**.**
Let be the full subquiver of with vertex set .
If we assign a vector space whose dimension is equal to the multiplicity of cells with coordinate occurring in the multiset to every point , then by Theorem 3.9, the generic kernel is a representation of . In general is not unique, not even up to isomorphism, but its -polynomial is unique. In particular, the linear maps associated with arrows satisfy relations in the Jacobian ideal .
The following several examples hold that .
Example 3.14**.**
In type , let . Then is displayed in Figure 9 (Here is drawn opposite as Figure 6, because of the definition of paths). For each vertex , we find it convenient to always label the dimension of the vector space at the vertex . The dimension associated with a vertex is the multiplicity of cells with coordinate occurring in the multiset
[TABLE]
The maps associated with arrows are , whose sign is deduced from the defining relations of the Jacobian algebra .
In the sense of Theorem 3.9, finding all possible submodules of is equivalent to finding all 4-tuple sets of non-overlapping paths in .
Example 3.15**.**
In type , let . Then is displayed in Figure 10 (Here is drawn opposite as Figure 7, because of the definition of paths). For each vertex , we label the dimension of the vector space at the vertex . The dimension associated with a vertex is the multiplicity of cells with coordinate occurring in the multiset
[TABLE]
The maps associated with arrows are , whose sign is deduced from the defining relations of the Jacobian algebra .
In the sense of Theorem 3.9, finding all possible submodules of is equivalent to finding all pairs of non-overlapping paths in .
Example 3.16**.**
In type , let . Then is displayed in Figure 11 (Here is drawn opposite as Figure 8, because of the definition of paths). For each vertex , we label the dimension of the vector space at the vertex . The dimension associated with a vertex is the multiplicity of cells with coordinate occurring in the multiset
[TABLE]
The maps associated with arrows are , whose sign is deduced from the defining relations of the Jacobian algebra .
In the sense of Theorem 3.9, finding all possible submodules of is equivalent to finding all pairs of non-overlapping paths in .
The following is an example where the dimensions of are larger than .
Example 3.17**.**
In type , let . Then is a Kirillov-Reshetikhin module and is displayed in Figure 12. For each vertex , we label the dimension of the vector space at the vertex . The dimension associated with a vertex is the multiplicity of cells with coordinate occurring in the multiset . In Figure 12, almost all vertices carry a vector space of dimension 1, except the vertex which carries a vector space of dimension 2.
Starting from the initial seed , the following sequence of mutations produces (in the last step) the cluster variable corresponding to .
[TABLE]
Remark 3.18**.**
The dimension of at a vertex can be arbitrary large in the sense that given any integer there is a snake module and a vertex such that the generic kernel is of dimension at least at . Therefore Corollary 3.11 is non-trival.
The following is an example that .
Example 3.19**.**
In type , let . Then is a Kirillov-Reshetikhin module and is displayed in Figure 13. By definition, we have
[TABLE]
where and
[TABLE]
Note that is a path in the set , so it cannot go through points with .
For each vertex , we label the dimension of the vector space at the vertex . The dimension associated with a vertex is the multiplicity of cells with coordinate occurring in the multiset . In Figure 13, all vertices carry a vector space of dimension 1.
Starting from the initial seed , the sequence of mutations produces (in the last step) the cluster variable corresponding to .
4. Denominator vector
In this section, we show that every snake module corresponds to a cluster monomial with square free denominator in the cluster algebra and that snake modules are real modules.
Theorem 4.1**.**
Let be an arbitrary snake module. Then the truncated -character is a cluster monomial in , and its denominator is square free as a monomial in the initial cluster variables .
Proof.
By Theorem 2.5, we can write as a tensor product of prime snake modules. Let be the generic kernel associated to and let be the full subquiver of whose vertices are in the support of . Thus is the generic kernel associated to . To show that corresponds to a cluster monomial we need to prove that is a rigid object in the cluster category [Am09, FK10].
Let be the set of paths associated to . By Theorem 2.3 and Remark 2.4, we know that for any , the sets and are non-overlapping. By our construction in Section 3.3, this implies that the quivers and are disjoint and there are no arrows in which connect and .
Definition 2.7 and Proposition 3.1 imply that for the prime snake module , we have
[TABLE]
By Section 3.3, the support of is contained in . Thus the socle points in cannot be in the support of . Otherwise, the set for and would be overlapping (there is at least a common vertex ). This is a contradiction to the fact that is not prime, see Remark 2.4.
Therefore
[TABLE]
Similarly, .
Consider the injective resolution
[TABLE]
Then is a quotient of which is zero by (4.1). Thus
[TABLE]
Similarly, .
By Corollary 3.3, we have that for any . In [Am09], and are compatible if and only if
[TABLE]
where is the (generalized) cluster category of the Jacobian algebra .
Applying
[TABLE]
we see that and are compatible for all , and hence snake modules are cluster monomials.
Next we prove the statement about square free denominators using the Mukhin-Young’s formulas in Theorem 2.3. By Theorem 3.9 and its proof, we have
[TABLE]
For any -tuple of non-overlapping paths, either or by Theorem 2.3,
[TABLE]
where the last equation is obtained by performing the change of variables (2.1). It is obvious that
[TABLE]
is a fraction with square free denominator in the initial cluster variables .
For any , the expression
[TABLE]
is still a fraction with square free denominator. Otherwise either for some or for some in the first term also appear in the denominator of the second term. If , then and overlap at least at the vertex . If , then and overlap at least at a vertex , where or . This is a contradiction. Similarly we deal with .
Therefore (by induction) is a Laurent polynomial with square free denominator in the initial cluster variables. ∎
Recall that prime snake modules are prime, real modules, see Theorem 2.5. As a slight generalization, we have the following theorem.
Theorem 4.2**.**
Snake modules are real simple modules.
Proof.
We assume that is a snake module. Then with prime by Theorem 2.5. We only need to show that snake modules are real.
Using the fact that is a ring homomorphism, we have
[TABLE]
By Theorem 3.4 of [DLL19], we have the fact that for every , has only one dominant monomial .
Using Theorem 2.3 and Remark 2.4, for any , we see that
[TABLE]
are non-overlapping. So monomials with negative exponents occurring in cannot be canceled by any monomial occurring in . Thus
[TABLE]
has only one dominant monomial . This shows that is simple, and thus is real. ∎
Remark 4.3**.**
- (1)
From Proposition 3.1, it follows that for different snake modules, the corresponding cluster monomials have different -vectors with respect to a given initial seed.
- (2)
Combining Theorem 4.1 and Theorem 4.2, we give a partial answer of Conjecture 1.1.
Recall that is the cluster algebra introduced by Hernandez and Lerclec in [HL16], also see Section 2.1. In [HL16], Hernandez and Leclerc applied the method of cluster mutations to give an algorithm for computing the -characters of Kirillov-Reshetikhin modules by successive approximations.
An explicit formula of the expansion for snake modules even Kirillov-Reshetikhin modules in terms of the initial cluster variables is usually very complicated. In the following theorem, we give explicitly the denominator of the cluster monomial associated to a snake module .
Theorem 4.4**.**
Suppose that is a snake module. Then the denominator of the cluster monomial associated to is
[TABLE]
Proof.
We first show that for any , the variable appears in the denominator of the cluster monomial associated to .
We assume without loss of generality that for some snake . The cluster monomial of is given by the truncated -character after the change of variables (2.1). For any such that , there exists a path such that is the unique lower corner of . We choose such that is maximal. Define by
[TABLE]
Then the -tuple is a set of non-overlapping paths, because is a path between and .
Using equation (3.7), we have
[TABLE]
After performing the change of variables (2.1), the variable appears in the denominator of . Thus the product (4.4) appears in the denominator of the cluster monomial .
On the other hand, for any -tuple of non-overlapping paths, we have the following: If , , appears in the denominator of , then or for some by equation (4.2). For the lower corner , we have , by Remark (3.10) (1). For the upper corner , we need to modify our path by replacing the point by the point . Note that , so the modified path is still in . Now Remark (3.10) (1) implies . ∎
We illustrate this result in our five running examples. Note that for each vertex in the support of , as shown in Figures 9–13, we have a contribution in the denominator. Here in type and and in type .
Example 4.5**.**
In type , let . Then by Theorem 4.4,
[TABLE]
Example 4.6**.**
In type , let . Then by Theorem 4.4,
[TABLE]
Example 4.7**.**
In type , let . Then by Theorem 4.4,
[TABLE]
Example 4.8**.**
In type , let . Then by Theorem 4.4,
[TABLE]
Example 4.9**.**
In type , let . Then by Theorem 4.4,
[TABLE]
It is natural to ask whether all cluster variables with square free denominator are always prime snake modules. The answer is No. The following example shows that there exists a module that is not a snake module and such that its truncated -character corresponds to a cluster variable with square free denominator.
Example 4.10**.**
In type , let . This is not a snake module. Because the second coordinates in the indices do not form an increasing sequence. By Example 12.2 of [HL10], we have
[TABLE]
Thus by Theorem 5.1 of [HL16]
[TABLE]
On the right hand side of the equation, every truncated -character is known by the Frenkel-Mukhin algorithm, so
[TABLE]
The corresponding cluster variable is
[TABLE]
which has a square free denominator.
Finally, we point out that there exists a module beyond snake modules in for which Hernandez and Leclerc’s conjectural geometric formula holds.
Example 4.11**.**
In type , let . By [HL10], we know that corresponds to a cluster variable in (up to scalar), equivalently, its truncated -character is a cluster variable in . Let
[TABLE]
By Example 12.2 of [HL10], we have
[TABLE]
With the exception of , those modules are minimal affinizations [C95], and we can compute their -characters by the Frenkel-Mukhin algorithm.
On the other hand, the formula in Theorem 3.2 holds for . The module has dimension 10 and is displayed in Figure 14. In Figure 14, almost all vertices carry a vector space of dimension 1, except the vertex which carries a vector space of dimension 2. The maps associated with the arrows incident to have the following matrices:
[TABLE]
All other arrows carry linear maps with , whose sign is easily deduced from the defining relations of the Jacobian algebra . There are 70 submodules in .
Then
[TABLE]
in agreement with Hernandez and Leclerc’s conjectural geometric formula and its denominator is not square free. Indeed, there exists a submodule of whose support at vertices , , such that
[TABLE]
Moreover, the simple module is not special, because there are two dominant monomials and in . The simple module is not thin, because some terms in the -character have coefficient .
Using the method introduced in Section 3.3, we obtain the dimension vector of as follows.
[TABLE]
Comparing Example 4.10 with Example 4.11, we reformulate the following classification question.
In the cluster algebra , are cluster variables with square free denominators in bijection with prime snake modules and some other prime real modules whose truncated -characters are not equal to their -characters?
5. Factorial cluster algebras
In this section, we apply the results of [ELS18] to show that the cluster algebra is factorial for Dynkin types .
Following Section 4.2 of [HL10], let be a quiver with vertex set subject to the following two conditions:
- (1)
The full subquiver on is an orientation of the associated Dynkin diagram of type or , oriented in such a way that every vertex in is a source and every vertex of is a sink;
- (2)
For every , one adds a frozen vertex and an arrow if and an arrow if .
Obviously, the defining quiver is an acyclic quiver. Let be the cluster algebra defined by the initial seed . Then is the cluster algebra of type in [HL10]. Let be the cluster variables obtained from the initial seed by one single mutation. Then, for each , we have , where is a binomial in the initial seed. Recall from [ELS18] that two vertices are called partners if and have a non-trivial common factor. Partnership is an equivalence relation and the equivalence classes are called partner sets.
Theorem 5.1**.**
The cluster algebra is factorial for Dynkin types .
Proof.
By Corollary 5.2 of [ELS18], we only need to show that every partner set in is a singleton. This holds because for every the exchange polynomial is a polynomial in the variable . ∎
We give an example to explain Theorem 5.1.
Example 5.2**.**
Let be of type . We choose and . The quiver is as follows.
[TABLE]
Here the vertices with boxes are frozen vertices and its associated exchange matrix is
[TABLE]
The exchange polynomials are
[TABLE]
The polynomials are pairwise coprime and hence every partner set in is a singleton.
Remark 5.3**.**
In Section 7.1 of [GLS13], Geiss, Leclerc, and Schröer proved that the cluster algebra associated to Dynkin type is a factorial cluster algebra. They also showed that the cluster variables in a factorial cluster algebra are prime elements. In [ELS18, Theorem 3.10], it was shown that if is a factorial cluster algebra and is a non-initial cluster variable, then the associated -polynomial is prime.
It is natural to ask whether the cluster algebras, with , are factorial. The argument in the proof of Theorem 5.1 does not work in this case, because we don’t know whether these cluster algebras are of acyclic type.
Acknowledgements
We would like to thank A. Garcia Elsener for explaining the results of [ELS18] to us.
References
