Cluster multiplication theorem in the quantum cluster algebra of type A2(2)
Liqian Bai, Xueqing Chen, Ming Ding and Fan Xu
Department of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, P. R. China
[email protected] (L.Bai)
Department of Mathematics,
University of Wisconsin-Whitewater
800 W. Main Street, Whitewater, WI.53190. USA
[email protected] (X.Chen)
School of Mathematical Sciences and LPMC,
Nankai University, Tianjin, P. R. China
[email protected] (M.Ding)
Department of Mathematical Sciences
Tsinghua University
Beijing 100084, P. R. China
[email protected](F.Xu)
Abstract.
The objective of the present paper is to prove cluster multiplication theorem in the quantum cluster algebra of type A2(2). As corollaries, we obtain
bar-invariant Z[q±21]-bases established in [6], and naturally deduce the positivity of the elements in these
bases. One bar-invariant basis as the triangular basis of this quantum cluster algebra is also explicitly described.
Key words and phrases:
quantum cluster algebra, cluster multiplication theorem, positivity
Liqian Bai was supported by NPU (No. 3102017OQD033), Ming Ding was supported by NSF of China (No. 11771217) and Specialized Research Fund for the Doctoral Program of Higher Education (No. 20130031120004) and Fan Xu was supported by NSF of China (No. 11471177).
1. Introduction
The concept of cluster algebras was introduced by Fomin and Zelevinsky [16][17] in order
to develop an algebraic framework for understanding total positivity and canonical bases in semisimple algebraic groups.
As a noncommutative analogue of cluster algebras, quantum cluster algebras were defined by Berenstein and Zelevinsky in [3].
Under the specialization q=1, the quantum cluster algebras are degenerated to cluster algebras.
For the classical cluster algebras, Sherman and Zelevinsky [26] firstly
gave the cluster multiplication formula in rank 2 cluster algebras of finite and affine types.
For the general case, the cluster categories were introduced in [2] as the categorification of acyclic cluster algebras.
Cluster algebras have a close link to quiver representations via cluster categories.
The link is explicitly characterized by the Caldero-Chapoton map [5] and the
Caldero-Keller multiplication theorems [7][8]. The
Caldero-Chapoton map associates the objects in the cluster
categories to some Laurent polynomials, in particular, sends indecomposable rigid
objects to cluster variables. The remarkable Caldero-Keller multiplication
theorems show the multiplication rules between images of objects
under the Caldero-Chapoton map. For
simply laced Dynkin quivers, Caldero and Keller constructed a
cluster multiplication formula (of finite type) between two
generalized cluster variables in [7]. On the
one hand, this multiplication is similar to the multiplication in a dual Hall algebra
and unifies homological and geometric properties of cluster
categories and combinatorial properties of cluster algebras. Since cluster algebras were introduced in order to study
canonical bases, it is important to construct integral bases of
cluster algebras. In the cluster theory, the Caldero-Chapoton map and the Caldero-Keller cluster multiplication theorem open a new
way to construct cluster algebras from 2-Calabi-Yau categories and play a
very important role to obtain structural results such as bases with good properties,
positivity conjecture, denominator conjecture and so on [7][13][15].
The cluster multiplication formula of finite type was generalized to
affine type in [18] and to any type in [27]. Palu [21] further extended the formula to
2-Calabi-Yau categories with cluster tilting objects. In [12], the full generalization of the Caldero-Chapoton map was obtained for quivers with potentials. Following this link, some good bases have been constructed for finite and affine cluster algebras [7][9][15].
It is natural to ask the question: what are the quantum analogue of the link? Recently,
Rupel [25] defined a quantum version of the
Caldero-Chapoton map for the quantum cluster algebras over finite fields associated with valued acyclic quivers
and he conjectured that cluster variables could be expressed as images of
indecomposable rigid objects under the quantum Caldero-Chapoton
formula. A key ingredient of the conjecture is to confirm the
mutation rules between quantum cluster variables given by
[3]. Most recently, the conjecture has been proved by Qin
[22] for acyclic equally valued quivers. There the author
constructed a quantum cluster multiplication formula and then
confirmed the mutation rules between quantum cluster
variables. Note that Qin verified the formula for the usual quantum cluster algebras through
the existence of counting polynomials instead of working over the finite field.
The quantum Caldero-Chapoton maps are further generalized in [11][10].
In [14], Ding and Xu proved a multiplication theorem
for acyclic quantum cluster algebras which
generalized the quantum cluster multiplication formula in
[22] and could be viewed as a quantum analogue of the
one-dimensional Caldero-Keller multiplication theorem discussed in [8].
Compared to the role which the Caldero-Keller multiplication
theorems play for cluster algebras, the quantum multiplication theorem is
worthy of highlighting and also reflects the information and the
difficulty to prove the more general quantum analog of the
Caldero-Keller multiplication theorems. By using this multiplication theorem, it is not too difficult to
construct some good ZP-bases in quantum cluster
algebras of finite and affine types. By specializing q and
coefficients to 1, these bases induce the good bases for cluster
algebras of finite [7] and affine types [15],
respectively.
One may expect to explicitly express the multiplication of two basis elements in terms of basis elements in quantum cluster algebras, i.e., to get structure constants clearly and explicitly. Ding and Xu [13] gave the cluster multiplication formula in the quantum cluster algebra of the Kronecker quiver.
By using the multiplication formula, they constructed bar-invariant bases of the quantum cluster algebra of Kronecker quiver as quantum analogues of the canonical basis, semicanonical basis and dual semicanonical basis of the corresponding cluster algebra. As a byproduct, they also proved positivity of the elements in these bases. In this paper, we construct a nontrivial cluster multiplication formula in the quantum cluster algebra of the non-simply-laced valued quiver A2(2), which is parallel to the results obtained for Kornecker quiver but is not a trivial generalization. This formula yields some important properties of quantum cluster algebra of type A2(2). For example, we construct three integral bases of this quantum cluster algebra. It is worthy of highlighting that the basis B we obtained coincide with “quantum greedy basis” (or “quantum atomic basis”, “quantum theta basis”) defined in [20]. In general, quantum greedy basis does not have positive structure constants. But it does in this case following from the main result Theorem 3.3 of the paper . Whether quantum greedy bases exist or not for general cases are still not known.
The basis S is closely related to the dual canonical basis of a quantum unipotent cell (subset of the dual canonical basis of the Uq(n)), when the valued quiver is attached some correct frozen variables. In the last section, we prove that S is the triangular basis in the sense of Qin [23], or the triangular basis in the sense of Berenstein-Zelevinsky [4]. Note that Qin [24] proved that both definitions of the triangular bases are equivalent for the seeds associated with
acyclic quivers and for the seeds associated with bipartite skew-symmetrizable matrices. The basis D is similar to the quantum generic basis (quantum dual semi-canonical basis) in [19]. To construct explicit multiplication formula is still open for general cases.
2. Preliminaries
For the terminology related to quantum cluster algebras, one can refer to [3] for more details, to quantum cluster algebra of type A2(2), refer to [6].
In this paper, we consider the valued quiver associated to the compatible pair (Λ,B) where
[TABLE]
Note that \Lambda^{T}B=\left(\begin{array}[]{cc}4&0\\
0&1\\
\end{array}\right).
Now let q denote the formal variable and F be the skew field of fractions of the quantum torus T=Z[q±21]⟨X1,X2 ∣ X1X2=qX2X1⟩. The quantum cluster algebra Aq(1,4) is the Z[q±21]-subalgebra of F generated by the cluster variables Xk for k∈Z, recursively defined by
[TABLE]
Note that Xk∈T by the well-known quantum Laurent phenomenon [3].
For each (a,b)∈Z2, if we set X(a,b)=q−21abX1aX2b, then
X(a,b)X(c,d)=q−21(bc−ad)X(a+c,b+d). The Z-linear bar-involution on the based quantum torus T is defined as follows:
[TABLE]
In [6], the authors constructed three kinds of bar-invariant Z[q±21]-bases of the quantum cluster algebra Aq(1,4) by using the standard monomials discussed in [3]. We now briefly recall some notations and results in [6].
We define that
[TABLE]
Let
[TABLE]
where Fn(x) and Sn(x) are well-known Chebyshev polynomials defined by
[TABLE]
[TABLE]
and Fn(x)=Sn(x)=0 for n<0.
The homomorphism σ2:Aq(1,4)→Aq(1,4) defined by Xm↦Xm+2 and q±21↦q±21 is an automorphism of Aq(1,4) [6, Section 4]. Note that σ2(Xδ)=Xδ.
We can define a partial order ≤ on Z2 as follows:
(r1,r2)≤(s1,s2) if r1≤s1 and r2≤s2 for (r1,r2),(s1,s2)∈Z2. Moreover if there exists some i∈{1,2} such that ri<si, we will write (r1,r2)<(s1,s2). In [6], the authors showed that every element in {Xn (n∈Z∖{1,2}),Fn(Xδ)(n≥1),Sn(Xδ)(n≥1)} has a minimal non-zero term X(a,b) according to the partial order ≤. The vector (−a,−b) associated to this minimal non-zero term X(a,b) of the corresponding element will be called the denominator vector. Then by using the standard monomials, they proved that B, S and D are bar-invariant Z[q±21]-bases of the quantum cluster algebra Aq(1,4). Unfortunately, the structure constants and the positivity are not presented in this construction. This motivated our study for the multiplication formulas.
3. Cluster multiplication theorem and positive bases
In this section, we mainly prove the cluster multiplication theorem of the quantum cluster algebra Aq(1,4). Since the element Xδ stated in previous section plays a crucial importance in the cluster multiplication theorem, we firstly address another expression of this element.
Lemma 3.1**.**
In Aq(1,4), we have that
Xδ=q−1X42X1−q−2(q−1X3+q−21+q21)X22.
Proof.
Note that X3=X(−1,4)+X(−1,0) and X4=X(−1,3)+X(−1,−1)+X(0,−1), then we have that
[TABLE]
∎
The following proposition is a special case discussed in [1], here we give an alternative proof by using the above lemma.
Proposition 3.2**.**
The quantum cluster algebra Aq(1,4) is the Z[q±21]-algebra generated by {Xm,Xm+1,Xm+2,Xm+3} for any m∈Z.
Proof.
By the definition of Xδ, we know that Xδ∈Z[q±21]⟨X0,X1,X2,X3⟩. We have that Xδ∈Z[q±21]⟨X1,X2,X3,X4⟩ by Lemma 3.1. Then through the automorphism σ2, we can deduce that Xδ∈Z[q±21]⟨Xm,Xm+1,Xm+2,Xm+3⟩ for any m∈Z.
Note that for any n∈Z, we have that X2nXδ=q−21X2n−2+q21X2n+2 (see [6, Proposition 4.2]). Then we can deduce that X2n∈Z[q±21]⟨Xm,Xm+1,Xm+2,Xm+3⟩ for any n∈Z. Since X2n−2X2n=q21X2n−1+1, we obtain that all cluster variables belong to Z[q±21]⟨Xm,Xm+1,Xm+2,Xm+3⟩. Thus
Aq(1,4)=Z[q±21]⟨Xm,Xm+1,Xm+2,Xm+3⟩.
∎
For each n∈Z, we denote by
[TABLE]
Let x∈R, we have the floor function ⌊x⌋:=max{m∈Z ∣ m≤x} and the ceiling function ⌈x⌉:=min{m∈Z ∣ m≥x}.
For any m>n≥1, it is easy to show that (see [6, Proposition 4.2]):
[TABLE]
The following cluster multiplication theorem is the main result of the present paper.
Theorem 3.3**.**
In Aq(1,4), we have that
-
(1)
-
(i)
if m is even and n is positive, then
[TABLE]
2. (ii)
if m is odd and n is positive, then
[TABLE]
2. (2)
if m is even and n is positive, then
[TABLE]
3. (3)
if m is even and n is positive odd, then
[TABLE]
and
[TABLE]
4. (4)
if m is odd and n is positive, then
[TABLE]
where
[TABLE]
and aj=2j(j−1), bj=2j(j−1)+⌈2j⌉ for positive integer j.
Proof.
(1) In order to prove (3.1), it suffices to show that
[TABLE]
We will prove the claim by induction on n. When n=1, it follows from [6, Proposition 4.2]. When n=2, we have that
[TABLE]
Assume that X2Fn(Xδ)=q−2nX2−2n+q2nX2+2n for n≥2. Then
[TABLE]
To prove (3.2), it suffices to show that
[TABLE]
When n=1, we have that X1Xδ=q−1X02+qX22 by [6, Proposition 4.2]. When n=2, we have that
[TABLE]
Assume that (3.7) is true. Note that X1Fn+1(Xδ)=X1Fn(Xδ)Xδ−X1Fn−1(Xδ). When n is even,
[TABLE]
The proof for the odd n is similar.
(2) For n≥0, it suffices to show that
[TABLE]
When n=1, it is the exchange relation. When n=2, we have that
[TABLE]
Assume that (3.8) is true. Now we calculate X2X4+2n. Note that
[TABLE]
we have X2n+4=q−21X2+2nXδ−q−1X2n.
When n is even, it follows that
[TABLE]
Note that X2+n2Xδ=q−1Xn+1+qXn+3+(q21+q−21).
Therefore, we have that
[TABLE]
Similarly, we can prove the statement for odd n.
(3) To prove (3), it suffices to show that for a positive odd integer n, we have that
[TABLE]
When n=1, it is trivial. When n=3, note that X4=q−21X2Xδ−q−1X0 by (3.1). It follows that
[TABLE]
Since X4Xδ=q−21X2+q21X6 and X6=q−21X4Xδ−q−1X2, when n=5, we have that
[TABLE]
Assume that (3) is true. Note that X1X3+n=q−21X1X1+nXδ−q−1X1Xn−1.
If n≡0 (mod 3), then
[TABLE]
and
[TABLE]
We then get
[TABLE]
Note that ⌊6n−2⌋=6n−3, ⌈6n−2⌉=6n+3, ⌊6n⌋=6n−3, ⌈6n⌉=6n+3, ⌊6n+2⌋=6n−3 and ⌈6n+2⌉=6n+3 since n≡0 (mod 3). Then we have
[TABLE]
It follows that
[TABLE]
Hence
[TABLE]
If n≡1 (mod 3), then
[TABLE]
[TABLE]
It follows that
[TABLE]
Note that ⌊6n−2⌋=6n−7, ⌈6n−2⌉=6n−1, ⌊6n⌋=6n−1, ⌈6n⌉=6n+5, ⌊6n+2⌋=6n−1 and ⌈6n+2⌉=6n+5, therefore
[TABLE]
It follows that
[TABLE]
Hence
[TABLE]
If n≡2 (mod 3), then
[TABLE]
and
[TABLE]
Note that
[TABLE]
Since ⌊6n−2⌋=6n−5, ⌈6n−2⌉=6n+1, ⌊6n⌋=6n−5, ⌈6n⌉=6n+1, ⌊6n+2⌋=6n+1, ⌈6n+2⌉=6n+7, we have that
[TABLE]
Note that
[TABLE]
and
[TABLE]
It follows that
[TABLE]
This completes the proof of (3). The proof of (3) is similar to the proof of (3).
(4) To prove (4), it suffices to prove that
[TABLE]
When n=1, we have that X1X3=q2X24+1 which is the exchange relation. When n=2, note that
X3F2(Xδ)=q−2X1+q2X5+(q−23+q−21+q21+q23)
by (3.2), then we have that
[TABLE]
Note that
- q−1X23X−2=q−2X22X02+q−21X22Xδ,
- qX23X6=q2X22X42+q21X22Xδ,
- X22X02=q−21X2X1X0+X2X0=q−2X12+(q−23+q−21)X1+1,
- X22Xδ=X2(q−21X0+q21X4)=q−1X1+qX3+(q−21+q21),
- X22X42=q21X2X3X4+X2X4=q2X32+(q21+q23)X3+1.
It follows that
[TABLE]
Assume that (3.13) is true. We have that
[TABLE]
If n is even, then
[TABLE]
For convenience, we set
[TABLE]
Then we have
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
It follows that
[TABLE]
[TABLE]
Since
[TABLE]
[TABLE]
and
[TABLE]
we have that
[TABLE]
Note that
[TABLE]
Therefore
[TABLE]
We need to show that
[TABLE]
Note that cn+1,n−1=i=1∑n−1ai(q−2(n−i)−3+q2(n−i)−5)+i=1∑n−2bi(q−2(n−i)−2+q2(n−i)−6)+bn−1q−4.
Let Pn:=k=1∑n−1l=1∑4min(k,n−k)(q−4+l+q−3+l+q−2+l+q−1+l).
We consider the coefficients of qx in the left hand side of (3.14) for 0≤x≤2n. When n=2, we have that c3,1=q−4 and P2=q−3+2q−2+3q−1+4+3q+2q2+q3. Thus c3,3=1+q4+c3,1+P2.
When n=4, c5,3=q−8+q−7+2q−6+3q−5+5q−4+3q−3+2q−2+q−1+1 and P4=3q−3+6q−2+9q−1+12+10q+8q2+6q3+4q4+3q5+2q6+q7. Hence c5,5=q4+q8+c5,3+P4.
Let n≥6, we have that
- (i)
when x≥2n−7, the coefficients of qx in cn+1,n−1 are [math]. The coefficients of qx in Pn are [math] for x≥2n. For 0≤x≤2n−4, the coefficients of qx in the polynomial Pn are 4n−4−2x;
2. (ii)
it is easy to see that the coefficients of q2n−4, q2n−3,q2n−2,q2n−1 and q2n in Pn are 4, 3, 2, 1 and [math], respectively. Thus the coefficients of q2n−4,q2n−3,q2n−2,q2n−1 and q2n in the left hand side of (3.14) are 5,3,2,1 and 1, respectively;
3. (iii)
when 0≤x≤2n−8 and x≡0 (mod 4), the coefficients of qx in cn+1,n−1 are bn−3−2x, then the coefficients of qx in the left hand side of (3.14) are bn−3−2x+(4n−4−2x)=bn+1−2x since bn−3−2x=21(n2−(6+x)n+(41x2+3x+10)) and bn+1−2x=21(n2+(2−x)n+(41x2−x+2));
4. (iv)
when 0≤x≤2n−8 and x≡2 (mod 4), the coefficients of qx in cn+1,n−1 are bn−3−2x, then the coefficients of qx in the left hand side of (3.14) are bn−3−2x+(4n−4−2x)=bn+1−2x since bn−3−2x=21(n2−(6+x)n)+(41x2+3x+9) and bn+1−2x=21(n2+(2−x)n+(41x2−x+1));
5. (v)
when 1≤x≤2n−7 and x are odd, the coefficients of qx in cn+1,n−1 are an−2x+5, so the coefficients of qx in the left hand side of (3.14) are an−2x+5+(4n−4−2x)=21(n2−(x+6)n+(41x2+3x+435))+(4n−4−2x)=21(n2+(2−x)n+(41x2−x+43))=an+23−x;
6. (vi)
the coefficient of q2n−6 in Pn and cn+1,n−1 are 8 and [math] respectively. It follows that the coefficient of q2n−6 in the left hand side of (3.14) is b4=8. The coefficient of q2n−5 in Pn and cn+1,n−1 are 6 and [math] respectively. Thus the coefficient of q2n−5 in the left hand side of (3.14) is a4=6.
It follows that the coefficients of qx in the left hand side of (3.14) are
[TABLE]
We consider the coefficients of q−x for 1≤x≤2n.
We have that
- (i)
when 4≤x≤2n, the coefficients of q−x in the polynomial Pn are [math];
2. (ii)
when x=1,2,3, the coefficients of q−1,q−2,q−3 in the polynomial Pn are 3(n−1), 2(n−1) and n−1 respectively. Note that the coefficients of q−1,q−2,q−3 in cn+1,n−1 are an−2,bn−2 and an−1 respectively. Hence the coefficients of q−1,q−2,q−3 in the left hand side of (3.14) are an+1,bn and an respectively;
3. (iii)
when x=4,6,8,…,2n, the coefficients of q−x in cn+1,n−1 are bn+1−2x. Thus the coefficients of q−x in the left hand side of (3.14) are bn+1−2x for x=4,6,8,…,2n;
4. (iv)
when x=5,7,…,2n−1, the coefficients of q−x in cn+1,n−1 are an−2x−3. We obtain that the coefficients of q−x in the left hand side of (3.14) are an−2x−3 for x=5,7,…,2n−1.
Hence the coefficients of q−x in the left hand side of (3.14) are
[TABLE]
The identity (3.14) is true. This proceeds the induction and finishes the proof.
If n is odd, by a similar detailed calculation, we can proceed the proof. Thus we can draw the conclusion that (4) is true.
The entire proof of the theorem is now completed.
∎
Remark 3.4**.**
According to the definition of bar-invariant and Theorem 3.3, we can easily obtain
the similar cluster multiplication formulas for Fn(Xδ)Xm and XnXm in other cases.
As an immediate consequence of the above theorem, we can naturally obtain the following result proved in [6] by a simple way.
Corollary 3.5**.**
The sets B, S and D are bar-invariant Z[q±21]-bases of Aq(1,4).
Proof.
Since there exist unipotent transformations between Fn(Xδ), Sn(Xδ) and Xδn for n≥1, we only need to prove that the set B is a
bar-invariant Z[q±21]-basis of Aq(1,4). It suffices to show that B are linearly independent. Note that the denominator vectors of Fn(Xδ) in Aq(1,4) are (n,2n) for n∈N which are bijective to the set of positive imaginary roots of the corresponding Lie algebra denoted by Φ+im. By [26, Proposition 3.1], there exists a bijection between the set of all denominator vectors of cluster monomials and Q−Φ+im with Q:=Z2 being a lattice of rank
2 with a fixed basis of two simple roots {α1,α2}. Thus the denominator vectors of cluster monomials and Fn(Xδ) are different from each other. Assume that S is a finite set and
[TABLE]
for Xα∈B and aα∈Z[q±21]∖{0}. Let V(S) denote the set of denominator vectors of Xα for α∈S and let ≤ be the partial order on V(S) inherited from Z2. There exists β∈S such that the denominator vector of Xβ is a maximal denominator vector in (V(S),≤). We can then deduce that aβ=0 which is a contradiction. Therefore B is linearly independent.
∎
Recall that an element Y∈Aq(1,4) is positive if the coefficients in its Laurent expansion in the cluster variables from {Xm,Xm+1} belong to N[q±21].
The following result can be deduced from Theorem 3.3.
Corollary 3.6**.**
The elements in the Z[q±21]-bases B, S and D of Aq(1,4) are positive.
Proof.
By the definitions of Chebyshev polynomials Fn(x) and Sn(x), we only need to prove the positivity of the elements in B. Using the fact that σ2 is an automorphism, it suffices to prove the positivity in the clusters {X1,X2} and {X2,X3}. Note that
[TABLE]
Hence X−2,X−1,X0,X1,X2,Xδ and F2(Xδ) are positive elements in {X1,X2}. Suppose that X−n,X−n+1,…,X−2,X−1,X0,X1,X2,…,Xn−1,Xn,Xδ,F2(Xδ),…, and Fn(Xδ) are positive. By Theorem 3.3, when n is odd, we have
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
when n is even, we have
[TABLE]
We deduce that X−n−2,X−n−1,Xn+1 and Xn+2 are positive in {X1,X2}. According to Theorem 3.3, we have that
[TABLE]
It follows that Fn+1(Xδ) is positive in {X1,X2}. By induction, each element in B is positive in {X1,X2}. Similarly, each element in B is positive in {X2,X3}. The proof is completed.
∎
A Z[q±21]-basis C of Aq(1,4) is called the canonical basis of Aq(1,4) if every positive element of Aq(1,4) is the N[q±21]-linear combination of elements of C.
Theorem 3.7**.**
The basis B is the canonical basis of Aq(1,4).
Proof.
Let Y be a positive element of Aq(1,4). Since B is a Z[q±21]-basis of Aq(1,4), we have Y=Z∈B∑aZZ for aZ∈Z[q±21]∖{0}. It suffices to prove that each aZ equals some coefficient in the Laurent expansion of Y with respect to Xm and Xm+1 for m∈Z.
First of all, we consider the coefficient of the cluster monomial q−21abXmaXm+1b, where a,b∈N. Since σ2 is an automorphism, it suffices to show that the coefficient aX(c,d) of X(c,d) in Y=Z∈B∑aZZ equals the coefficient of X(c,d) in the Laurent expansion of Y with respect to {X1,X2} (showing that the coefficient of the cluster monomial q−21cdX2cX3d in Y=Z∈B∑aZZ equals the coefficient of q−21cdX2cX3d in the Laurent expansion of Y with respect to {X2,X3} uses the same method). For m=1, let
[TABLE]
be the Laurent expansion of the cluster monomial q−21abXmaXm+1b with respect to X1 and X2, where Mcd(q)∈Z[q±21]. For n≥1, let
[TABLE]
be the Laurent expansion of Fn(Xδ) with respect to X1 and X2, where Nef(q)∈Z[q±21]. By Corollary 3.6, Mcd(q), Nef(q)∈N[q±21]. We only need to show that if c,d,e,f∈N then Mcd(q)=Nef(q)=0. If there exists some Mcd(q)=0 for some c,d∈N, then Mcd(1)>0 which contradicts the statement in [26, Proposition 3.6]. Thus Mcd(q)=0 for c,d≥0. If there exists some Nef(q)=0 for e,f∈N, then Nef(1)>0 which contradicts the statement in [26, Proposition 5.2(2)]. Hence Nef(q)=0 for e,f≥0.
It remains to consider the coefficient of Fn(Xδ) in Y=Z∈B∑aZZ for n≥1. Without loss of generality, we can assume that the cluster variables Xm occurring in Y=Z∈B∑aZZ satisfy that m≥3 since σ2 is an automorphism. It suffices to show that, the coefficient of the cluster monomial X(n,−2n) (n≥1) in the Laurent expansion of Fn(Xδ) with respect to the cluster {X1,X2} is 1, but the coefficients of X(n,−2n) in the Laurent expansions of Fk(Xδ) or q−21n1n2Xmn1Xm+1n2 for k=n and m≥3 are [math]. Let R1(q) denote the coefficient of X(n,−2n) in the Laurent expansion of Fk(Xδ) with respect to {X1,X2}. Note that R1(q)∈N[q±21] since Fn(Xδ) is positive. Using the fact that Fn(Xδ) is bar-invariant and R1(1)=1 by [26, Proposition 5.1], it follows that R1(q)=1. Let R2(q)∈N[q±21] denote the coefficient of X(n,−2n) in the Laurent expansion of Fk(Xδ) with respect to {X1,X2}. If R2(q)=0, then R2(1)=0, which contradicts [26, Proposition 5.2(1)]. Thus R2(q)=0. Let R3(q)∈N[q±21] denote the coefficient of X(n,−2n) in the Laurent expansion of q−21Xmn1Xm+1n2 with respect to {X1,X2}. If R3(q)=0, then R3(1)=0, which contracts the statement in [26, Corollary 3.7]. Hence R3(q)=0. This finishes the proof.
∎
4. triangular bases
In [4], the choice of the exchange matrix and the skew-symmetric matrix are B=\left(\begin{array}[]{cc}0&-b\\
c&0\\
\end{array}\right) for b,c>0 and \Lambda=\left(\begin{array}[]{cc}0&-1\\
1&0\\
\end{array}\right), respectively. Though our exchange matrix B and the skew-symmetric matrix Λ differ from those of [4] by a sign, let v=q−21 to reconcile the formal variables q and v, then Theorem 3.3 is still true.
The following theorem is a version of Lusztig’s Lemma.
Theorem 4.1**.**
[4, Theorem 1.1]**.
Let (L,≺) be a partially order set and satisfy that the lengths of chains with the top element u∈L in L are bounded from above. Let A be a free Z[q±21]-module spanned by the basis {Eu ∣ u∈L}. The bar-involution on A is the Z-linear map x↦x such that fx=fx for f∈Z[q±21] and x∈A, where f(q21)=f(q−21). If
[TABLE]
for u∈L, then there exists a unique element Cu∈A satisfies that
[TABLE]
[TABLE]
More precisely, (4.3) can be replaced by
[TABLE]
Then {Cu ∣ u∈L} is a Z[q±21]-basis in A.
Let A be the quantum cluster algebra associated with an acyclic quantum seed. By [4, Theorem 1.4, Theorem 1.6], the basis {Cu ∣ u∈L} of A is uniquely determined by (4.2) and (4.3). The basis {Cu ∣ u∈L} is called the canonical triangular basis in A (see [4, Section 1] for more detail).
For x∈Z, the function [x]+ is defined by [x]+=x if x>0 and [x]+=0 otherwise.
In the rest of this section, we set L=Z2 and A=Aq(1,4). For (a,b),(a′,b′)∈Z2, recall that the partial order ≺ on Z2 used in [4, (6.16)] is defined by:
[TABLE]
Using the same argument as in [4, Section 2], it follows that Aq(1,4) satisfies the condition (4.1) for the partial order ≺.
The standard monomials in Aq(1,4) are defined by
[TABLE]
for a,b∈Z ([4, Section 1]). As in [4], the crystal lattice A+⊂Aq(1,4) is defined by
[TABLE]
Recall that in [4] for the the quantum cluster algebra of Kronecker type Aq(2,2), for a,b∈Z, Berenstein and Zelevinsky defined the elements
[TABLE]
Similarly, we define the elements E(a,b)′ and μ1E(a,b) in Aq(1,4) as follows
[TABLE]
A new partial order ⪯ on Z2 is defined by:
[TABLE]
Remark 4.2**.**
The partial order ⪯ is used to prove Lemma 4.3 and Lemma 4.8 and the partial order ≺ is used in Lusztig’s Lemma.
Lemma 4.3**.**
For a,b∈Z, we have that
- (1)
q21aE(a,b)X0−E(a,b−1)∈(a′,b′)⪯(a+1,b−1)⨁q−21Z[q−21]E(a′,b′);
2. (2)
q21bX3E(a,b)−E(a−1,b)∈(a′,b′)⪯(a−1,b+4)⨁q−21Z[q−21]E(a′,b′);
3. (3)
q21bE(a,b)X1−E(a+1,b)∈(a′,b′)⪯(a+1,b+4)⨁q−21Z[q−21]E(a′,b′);
4. (4)
q−21aX4E(a,b)−E(a,b−1)∈(a′,b′)⪯(a−1,b−1)⨁q−21Z[q−21]E(a′,b′)* if b>0;*
5. (5)
q−21(a−b)X4E(a,b)−E(a−1,b−1)∈(a′,b′)⪯(a−1,b+3)⨁q−21Z[q−21]E(a′,b′)* if a>0 and b≤0;*
6. (6)
q−21(a−b)X4E(a,b)−E(a−1,b−1)∈(a′,b′)⪯(a,b)⨁q−21Z[q−21]E(a′,b′)* if a≤0 and b≤0.*
Proof.
(1) (i) If a≥0,b>0, then
[TABLE]
(ii) If a≥0,b≤0, then
[TABLE]
(iii) If a<0,b≤0, then
[TABLE]
(iv) If a<0,b>0, then
[TABLE]
(2) (i) If a≤0,b≥0, then
[TABLE]
(ii) If a≤0,b<0, then
[TABLE]
(iii) If a>0,b≥0, then
[TABLE]
(iv) If a>0,b=−1, then
[TABLE]
(v) If a>0,b=−2, then
[TABLE]
(vi) If a>0,b=−3, then
[TABLE]
(vii) If a>0,b≤−4, then
[TABLE]
(3) (i) If a≥0,b≥0, then
[TABLE]
(ii) If a≥0,b<0, then
[TABLE]
(iii) If a<0,b≥0, then
[TABLE]
(iv) If a=−1,b<0, then
[TABLE]
When a=−1,b=−1, we have that
[TABLE]
When a=−1,b=−2, we have that
[TABLE]
When a=−1,b=−3, we have that
[TABLE]
When a=−1,b≤−4, we have that
[TABLE]
(v) If a≤−2,b<0, then
[TABLE]
When a=−2,b=−1, we have that
[TABLE]
When a≤−2, by repeatedly using (4.9) and (4.10), we know that q2aE(a+1,4+b) is a term of q2a−21(a+1)bE(a+1,4)X0−b. We only need to consider the expansion of
[TABLE]
with respect to the standard monomials E(c,d).
Note that
[TABLE]
By applying (4.25) repeatedly, we have that
[TABLE]
and every term kq−21αE(c,d) (k∈N∖{0}) in q2a−21(a+1)bE(a+1,4)X0−b−q2aE(a+1,4+b) satisfies the conditions that α≥−4a>0, c≥a+1 and d≥4+b. Namely
[TABLE]
(4) (i) If a>0,b>0, then
[TABLE]
(ii) If a≤0,b>0, then
[TABLE]
(5) (i) If a>0,b=0, then
[TABLE]
(ii) If a>0,b=−1, then
[TABLE]
(iii) If a>0,b=−2, then
[TABLE]
(iv) If a>0,b≤−3, then
[TABLE]
(6) Through a direct calculation, we have that
[TABLE]
We will prove the statement by induction on both value a and b. For fixed a≤0,b≤0, assume that
[TABLE]
Note that
[TABLE]
and
[TABLE]
Let kq−21αE(c,d) (k∈Z∖{0}) be a term in Δ. Note that α+1−b+d≥α+1>0. By Lemma 4.3(2), we have that
[TABLE]
It follows that
[TABLE]
Note that α+c+1−a≥α+1>0. By Lemma 4.3(1), we have that
[TABLE]
Thus
[TABLE]
The proof is completed.
∎
Lemma 4.4**.**
Let a,b∈Z<0 and kq−21αE(c,d) (k∈N∖{0}) be a term in q21bE(a,b)X1−E(a+1,b). Then we have that c≤a−b+1 if d≥0 and c−d≤a−b+1 if d<0.
Proof.
By (4.21), (4.22), (4) and (4), it follows that (c,d)∈{(0,3),(1,3)} if a=−1, b=−1; (c,d)∈{(0,2),(1,2),(2,2)} if a=−1, b=−2; (c,d)∈{(0,1),(1,1),(2,1),(3,1)} if a=−1 and b=−3; (c,d)∈{(0,b+4),(1,b+4),(2,b+4),(3,b+4),(4,b+4)} if a=−1 and b≤−4.
When a≤−2 and b<0, q21bE(a,b)X1−E(a+1,b)=q2a−21(a+1)bE(a+1,4)X0−b. By (4.25), it follows that c∈{a+1,…,a−b+1}, and we obverse that there exists some nonnegative integer n≤−a−1 such that
[TABLE]
If d=4+4n+b≥0, then c≤(a+1)+n+(−b−n)=a−b+1.
If d=4+4n+b<0, then c≤(a+1)+n+(4+3n)=a+5+4n, it follows that c−d≤a−b+1. Thus c≤a−b+1 if d≥0 and c−d≤a−b+1 if d<0.
∎
By using (4.26) and (4.27), we obtain the following lemma.
Lemma 4.5**.**
For a∈Z and b∈Z>0, every term q−21αE(c,d) in q−21aX4E(a,b)−E(a,b−1) satisfies that c=a−1 and d≥b−1≥0.
Lemma 4.6**.**
For a∈Z>0 (respectively, a∈Z≤0) and b∈Z≤0, every term kq−21αE(c,d) (k∈Z∖{0}) in q−21(a−b)X4E(a,b)−E(a−1,b−1) satisfies that c≥a−1 (respectively, c≥a), c≤a−b if d≥0 and c−d≤a−b if d<0.
Proof.
(1) When a>0, by using the identities (4.28), (4.29), (4.30) and (4), we have that (c,d)=(a−1,3) if b=0; (c,d)∈{(a−1,2),(a,2)} if b=−1; (c,d)∈{(a−1,1),(a,1),(a+1,1)} if b=−2; (c,d)∈{(a−1,b+3),(a,b+3),(a+1,b+3),(a+2,b+3)} if b≤−3. It is easy to see that c≥a−1, c<a−b if d≥0 and c−d<a−b if d<0.
(2) When a≤0, we will prove the statement by induction. By Lemma 4.3(6), it follows that c≥a. When a=0, note that
[TABLE]
and
[TABLE]
for n≥3. It is easy to see that c≤n=a−b if d≥0, c−d≤a−b if d<0.
Note that q21X4E(−1,0)=E(−2,−1)−q−4E(−1,3). When a=−m≤−1 and b=0, we have that
[TABLE]
From now on, we assume that a,b≤−1 for the rest of the proof. When a=b=−1, we have that
[TABLE]
When a=−m,b=−1, we have that
[TABLE]
For a=−m∈Z<0 and b=−n∈Z<0, assume that every term kq−21αE(c,d) in
[TABLE]
satisfies that c≤n−m if d≤0 and c−d≤n−m if d<0.
When a=−m and b=−n−1, we have that
[TABLE]
Let k′q−21α′E(c′,d′) (k′∈Z∖{0}) be a term in q−2m+1(kq−21αE(c,d))X0. When c≥0,d>0, it follows that (c′,d′)∈{(c,d−1),(c+1,d−1)} by (4.7), i.e., d′≥0 and c≤c′≤c+1≤n+1−m. If d≤0 then (c′,d′)=(c,d−1) by (4.8) and (4.9), i.e., c′=c, d′<0 and c′−d′=c−d+1≤n−m+1. If c<0,d>0, then (c′,d′)∈{(c,d−1),(c+1,d+3),(c+1,d−1)} by (4.10), i.e., d′≥0 and c≤c′≤c+1≤n−m+1.
The proof is completed.
∎
By [4, Theorem 3.1, Proposition 4.1], we have the following lemma.
Lemma 4.7**.**
For each (a,b)∈Z2, we have that
[TABLE]
where φ:Z2→Z2 defined by φ(a,b)=(a,−4[−a]+−b) is a bijection.
Similarly, let ψ:Z2→Z2 be a map defined by ψ(a,b)=(−a−[−b]+,b). It is easy to see that ψ is a bijection.
Lemma 4.8**.**
For each (a,b)∈Z2, we have that
[TABLE]
Proof.
Let a1,a2∈Z≥0, it is clear that
[TABLE]
We need only consider μ1E(a1,−a2)−E(−a1−a2,−a2) and μ1E(−a1,−a2)−E(a1−a2,−a2).
(1) When a1=1,a2=0, we have that μ1E(1,0)=X3=E(−1,0). When a1=0,a2=1,
[TABLE]
When a1=1,a2=1, we have that
[TABLE]
We will prove the statement by induction on both a1 and a2. Assume that
[TABLE]
i.e., every term kq−21αE(c,d) (k∈Z∖{0}) in C1 satisfies [−c]+≤a1+a2 and [−d]+≤a2.
(i) By Lemma 4.3(2), we have that
[TABLE]
and q−21(α+a2)X3E(c,d)=q−21(α+a2+d)(q21dX3E(c,d)). Note that α+a2+d≥α>0, by Lemma 4.3(2), we have that q−21(α+a2)X3E(c,d)∈(a′,b′)⪯(c−1,d)⨁q−21Z[q−21]E(a′,b′).
Thus
[TABLE]
(ii) Note that
[TABLE]
By Lemma 4.3(6),
[TABLE]
When d≥0, we have that q−21(α−a1)X4E(c,d)=q−21(α−a1−c)(q−21cX4E(c,d)). When d<0, we have that q−21(α−a1)X4E(c,d)=q−21(α−a1−c+d)(q−21(c−d)X4E(c,d)). By Lemma 4.6, we know that c≤−a1 if d≥0, and c−d≤−a1 if d<0. Thus α−a1−c≥α>0 if d≥0, and α−a1−c+d≥α>0 if d<0. By using the induction hypothesis and Lemma 4.3(4), (5), (6), we have that
[TABLE]
Hence μ1E(a1,−a2−1)−E(−a1−a2−1,−a2−1)∈(a′,b′)⪯(−a1−a2−1,−a2−1)⨁q−21Z[q−21]E(a′,b′).
(2) When a1=0,a2>0, we have that
[TABLE]
by (1). When a1>0,a2=0, we have that μ1E(−a1,0)=X1a1=E(a1,0).
When a1=a2=1, we have that μ1E(−1,−1)=X0+q−2X23=E(0,−1)+q−2E(0,3).
When a1=1,a2=2, we have that μ1E(−1,−2)−E(−1,−2)=q−4E(−1,2)−q−4E(1,2).
When a1=2,a2=1, we have that μ1E(−2,−1)−E(1,−1)=q−4E(1,3).
When a1=2,a2=2, we have that
[TABLE]
When a1=3,a2=1, we have that μ1E(−3,−1)−E(2,−1)=q−6E(2,3).
When a1=3,a2=2, we have that
[TABLE]
We will proceed the proof by induction on both a1 and a2.
(i) When a1≥a2≥1, we assume that
[TABLE]
and every term k1q−21αE(c,d) (k1∈Z∖{0}) in C2 satisfies that c≥0, c≤a1 if d≥0 and c−d≤a1 if d<0. Note that
[TABLE]
By (4.18) and (4.19), q−21(a2+α)E(c,d)X1=q−21(a2+α+d)E(c+1,d).
Note that a2+α+d≥α>0 and c+1>c≥0. Thus
[TABLE]
For a1≥a2≥1, it follows that
[TABLE]
and every term k1′q−21α′E(c′,d′)=k1q−21(a2+α+d)E(c+1,d) in μ1E(−a1−1,−a2)−E(a1+1−a2,−a2) satisfies that c′=c+1>0, c′≤a1+1 if d′=d≥0 and c′−d′≤a1+1 if d′=d<0.
(ii) When a2>a1≥1, we assume that
[TABLE]
and every term k2q−21βE(e,f) (k2∈Z∖{0}) in C3 satisfies that e≤a1 if f≥0 and e−f≤a1 if f<0. Note that
[TABLE]
By Lemma 4.3(3), we obtain that
[TABLE]
Note that a2+β+f>0 since [−f]+≤a2 and β>0. Then we have that
[TABLE]
We obtain that q−21a2C3X1∈(a′,b′)⪯(a1+1−a2,−a2)⨁q−21Z[q−21]E(a′,b′).
Let k2′q−21β′E(e′,f′) (k2∈Z∖{0}) be a term in μ1E(−a1−1,−a2)−E(a1−a2+1,−a2).
When k2′q−21β′E(e′,f′) is a term in q−21a2E(a1−a2,−a2)X1−E(a1+1−a2,−a2), we obtain that e′≤a1+1 if f′≥0 and e′−f′≤a1+1 if f′<0, by Lemma 4.4.
Now we consider the case that k2′q−21β′E(e′,f′) is a term in k2q−21(a2+β)E(e,f)X1, where k2q−21βE(e,f) is a term in C3. Note that a2+β+f≥β>0 and
[TABLE]
When e≥0, we have (e′,f′)=(e+1,f) by (4.18) and (4.19). When e<0 and f≥0, we have (e′,f′)=(e+1,f) or (e+1,f+4) by (4.20). When e<0 and f<0, we obtain that e′≤e−f+1≤a1+1 if f′≥0 and e′−f′≤e−f+1≤a1+1 if f′<0 by Lemma 4.4.
Hence
[TABLE]
for a2>a1≥1, and every term k2′q−21β′E(e′,f′) in μ1E(−a1−1,−a2)−E(a1+1−a2,−a2) satisfies that e′≤a1+1 if f′≥0, e′−f′≤a1+1 if f′<0.
(iii) When a1>a2≥1, we assume that
[TABLE]
and every term k3q−21γE(g,h) (k3∈Z∖{0}) in C4 satisfies that g≥a1−a2, g≤a1 if h≥0 and g−h≤a1 if h<0. We obverse that
[TABLE]
and q−21a1X4E(a1−a2,−a2)∈E(a1−a2−1,−a2−1)+(a′,b′)⪯(0,3−a2)⨁q−21Z[q−21]E(a′,b′) by Lemma 4.3(5).
Similar to the proof of Case (2)(ii), according to Lemma 4.5 and Lemma 4.6, we can prove that every term k3′q−21γ′E(g′,h′) in μ1E(−a1,−a2−1)−E(a1−a2−1,−a2−1) satisfies the conditions that g′≥a1−a2−1≥0, g′≤a1 if h′≥0, g′−h′≤a1 if h′<0 and
[TABLE]
for a1>a2≥1.
(iv) When a2≥a1≥1, we assume that
[TABLE]
and every term k4q−21δE(i,j) (k4∈Z∖{0}) in C5 satisfies that i≤a1 if j≥0 and i−j≤a1 if j<0. Then
[TABLE]
and q−21a1X4E(a1−a2,−a2)∈E(a1−a2−1,−a2−1)+(a′,b′)⪯(a1−a2,−a2)⨁q−21Z[q−21]E(a′,b′) by Lemma 4.3(6).
Let k4′q−21δ′E(i′,j′) (k4′∈Z∖{0}) be a term in μ1E(−a1,−a2−1)−E(a1−a2−1,−a2−1). Similar to the proof of Case (2)(ii), according to Lemma 4.3(5), (6), Lemma 4.5 and Lemma 4.6, it follows that
[TABLE]
and every term k4′q−21δ′E(i′,j′) in q−21a1X4C5 satisfies that i′≤a1 if j′≥0 and i′−j′≤a1 if j′<0.
In a summary, we obtain that
[TABLE]
and every term k4′q−21δ′E(i′,j′) in μ1E(−a1,−a2−1)−E(a1−a2−1,−a2−1) satisfies that i′≤a1 if j′≥0 and i′−j′≤a1 if j′<0.
This completes the proof of Lemma 4.8.
∎
For n∈Z, the notation α(n) is defined by
[TABLE]
Recall that C(a,b) is the element of the canonical triangular basis for any a,b∈Z.
Proposition 4.9**.**
For n∈Z and a1,a2∈Z≥0, we have
[TABLE]
Proof.
Through a direct calculation, we obtain that σ−2(μ1E(a,b))=E(a,b)′. Recall that φ and ψ are bijective. By Lemma 4.8, μ1Eψ(a,b)−E(a,b)∈q−21A+. Thus Eψ(a,b)′−σ−2(E(a,b))∈q−21A+. By Lemma 4.7, we obtain that
[TABLE]
By Lemma 4.8, E(a,b)′−σ−2(Eψ(a,b))∈q−21A+. It follows that Eφ(a,b)−σ−2(Eψ(a,b))∈q−21A+ and E(a,b)−σ−2(Eψφ(a,b))∈q−21A+. Hence
[TABLE]
Using (4.32) and (4.33), it follows that
[TABLE]
and
[TABLE]
According to the definition of the triangular basis, it follows that
[TABLE]
for a1,a2∈Z≥0
From (4.34), (4.35) and (4.36), it is deduced that Ca1α(n)+a2α(n+1)=q−21a1a2Xna1Xn+1a2 for a1,a2∈Z≥0 and n∈Z.
∎
Now we need only consider C(−n,−2n) for positive integers n.
Lemma 4.10**.**
If n is a positive integer, then
[TABLE]
Proof.
We will prove the lemma by induction on n. When n=1, by [6, Lemma 3.6], we have that
[TABLE]
When n is even, by the induction hypothesis,
[TABLE]
A direct calculation shows that
[TABLE]
Note that
[TABLE]
Thus
[TABLE]
When n is odd, by the induction hypothesis,
[TABLE]
We have that
[TABLE]
and
[TABLE]
Hence we obtain that
[TABLE]
The proof is completed. ∎
Lemma 4.11**.**
For n∈Z≥0, we have that C(−n,−2n)=Sn(Xδ).
Proof.
We will prove the statement by induction on n. It is trivial for n=0. For n=1, by Theorem 3.3, we have that
[TABLE]
Therefore C(−1,−2)=Xδ. Assume that C(−r,−2r)=Sr(Xδ) for 0≤r≤n. When n is even, we have that
[TABLE]
By Proposition 4.9, we know that Xn+22=C2α(n+2)=C(−n,2−2n) and Xn+1=Cα(n+1)=C(1−n,4−2n). By using Lemma 4.3(1), (3) and the condition (4.4) in Lusztig’s Lemma, we obtain that
[TABLE]
and
[TABLE]
For n≥2, q−nE(−n,2−2n)X02=q−2n(q−2nE(−n,2−2n)X0)X0=q−2nE(−n,1−2n)X0=E(−n,−2n) and q−(n+2)E(1−n,4−2n)X1∈q−3(E(2−n,4−2n)+q−21A+)⊆q−21A+ by (4.9) and Lemma 4.3(3). Hence we have that
[TABLE]
and
[TABLE]
For 1≤k≤2n+1, it is clearly that
[TABLE]
By using the induction hypothesis, we have that q−2k(q−21+q21)2Sn−2k(Xδ)∈q−21A+ for 1≤k≤2n. When n is even, we have that
[TABLE]
When n is odd, we have that
[TABLE]
Xn+2=Cα(n+2)=C(−n,2−2n), Xn+12=C2α(n+2)=C(1−n,4−2n)
and
Xn+3−2k2=C2α(n+3−2k)=C(2k−n−1,4k−2n)
for 1≤k≤2n+1. The rest of the proof is quite similar to that given above for the case of n being even and so is omitted.
Since Sn(Xδ) is bar-invariant, we are led to the conclusion that C(−n,−2n)=Sn(Xδ) for n∈Z≥0.
∎
Proposition 4.9 and Lemma 4.11 imply the following theorem.
Theorem 4.12**.**
The basis S={q−21abXmaXm+1b ∣ m∈Z,(a,b)∈Z≥02}∪{Sn(Xδ)} is the triangular basis in Aq(1,4).
Acknowledgments
The first draft of the paper was written during X. Chen’s visit at Nankai University from May 19 to June 18, 2017. He thanks Nankai University for the hospitality
and for creating ideal working environment. We appreciate Prof. Fan Qin’s comments on the relation between the bases obtained in our paper and some other existed bases.