Cluster algebras of finite type via Coxeter elements and Demazure Crystals of type B,C,D
YUKI KANAKUBO
Division of Mathematics,
Sophia University, Kioicho 7-1, Chiyoda-ku, Tokyo 102-8554,
Japan: [email protected]
Abstract
For a classical group G and a Coxeter element c of the Weyl group, it is known that the coordinate ring C[Ge,c2] of the double Bruhat cell Ge,c2:=B∩B−c2B− has a structure of cluster algebra of finite type, where B and B− are opposite Borel subgroups. In this article, we consider the case G is of type Br, Cr or Dr and describe all the cluster variables in C[Ge,c2] as monomial realizations of certain Demazure crystals.
Keywords : Cluster algebras; Crystals; Double Bruhat cells; Classical groups
1 Introduction
Fomin and Zelevinsky have invented cluster algebras for the study of total positivity and dual semicanonical bases ([4]). It is a commutative ring generated by so-called “cluster
variables”. It is known that the coordinate rings of many algebraic varieties related to semisimple algebraic groups carry cluster algebra structures. For instance, in [1, 8, 9], for simply connected, connected, complex simple algebraic group G and
its Weyl group elements u,v∈W, it is shown that C[Gu,v] is a cluster algebra,
where Gu,v:=BuB∩B−vB− and B, B− are opposite
Borel subgroups. In [6], it is proved that the coordinate rings C[N(w)] and C[Nw] are cluster algebras by using the additive categorification via finite dimensional modules of the preprojective
algebras, where N(w):=N∩(w−1N−w),Nw:=N∩(B−wB−) and N, N− are unipotent radicals. It is also proved that
all the cluster variables are included in the dual semicanonical basis in the coordinate rings.
A cluster algebra is said to be of finite type if it has only finitely many cluster variables. In [5], a complete classification of the cluster algebras of finite type are provided. More precisely, they are classified by the set of Cartan matrices up to coefficients. For a fixed Cartan matrix, all the cluster variables are parametrized by
the set of “almost positive roots”, which is, a union of all positive roots and negative simple roots corresponding to the Cartan matrix. By this classification, the type of each cluster algebra of finite type can be defined as the Cartan-Killing type of the corresponding Cartan matrix. Let c∈W be a Coxeter element such that the length l(c) satisfies
l(c2)=2l(c)=2rank(G). It is known that one can realize a cluster algebra of finite type on the coordinate ring C[Ge,c2] and its type coincides with the Cartan-Killing type of G [1].
One purpose of our study is to reveal relation between cluster variables of the coordinate rings and Kashiwara’s crystal bases ([14, 15]). The crystal bases were introduced for combinatorial study of the integrable modules over quantum groups and have many realizations, e.g., tableaux, paths, monomials, etc. In this article, we will treat the monomial realization, which is defined in [13, 18].
In [10], we treated the initial cluster variables denoted by Δ(k;i) of C[Gu,e] (1≤k≤l(u)−r, u∈W and i is a reduced word of u) in the case G=SLr+1(C). We found explicit formulas for {Δ(k;i)}1≤k≤l(u)−r, which express them by Laurent polynomials with coefficients 1. We also proved that the set of monomials appearing in Δ(k;i) coincides with a monomial realization of certain Demazure crystal. In [11], we considered the case G is a classical algebraic group of type Br, Cr or Dr, and gave explicit formulas for a part of the initial cluster variables {Δ(k;i)} in C[Gu,e]. Just as in the case G=SLr+1(C), the set of monomials appearing in Δ(k;i) coincides with a monomial realization of certain Demazure crystal. In the both papers, we did not treat all the cluster variables but a part of the cluster variables. On the other hand, in [12], we considered the case G=SLr+1(C) (r≥3) and all the cluster variables in the coordinate ring C[Ge,c2] (c is a Coxeter element). As mentioned above, the algebra C[Ge,c2] is a cluster algebra of finite type. We described each cluster variable φ as a Laurent polynomial with coefficients 1 and showed that the set of monomials appearing in φ coincides with a monomial realization of the direct sum of certain Demazure crystals.
In this article, we consider the case G is a classical algebraic group of type Br, Cr or Dr and the coordinate ring C[Ge,c2], where c=(sr⋯s2s1) is a Coxeter element. Our main result is that all the cluster variables in C[Ge,c2] are described as Laurent polynomials with positive integers, and forgetting the coefficients, the set of monomials appearing in each cluster variable coincides with a monomial realization of the direct sum of certain Demazure crystals.
For example, let us consider the case G=SO5(C) (type B2 algebraic group). Monomial realizations of the crystals B(Λ1) and B(Λ2) of type B2 are
[TABLE]
respectively. On the other hand, taking a Coxeter element c=s2s1∈W, specific initial cluster variables in
C[Ge,c2] are given by the generalized minors ΔΛi,s1s2Λi (i=1,2) (see 4.3). Using the biregularly isomorphism xiG:H×(C×)4→Ge,c2 (i:=(2,1,2,1)) in Proposition
3.4, we have
[TABLE]
[TABLE]
where we set a∈H and Y:=(Y1,2,Y1,1,Y2,2,Y2,1)∈(C×)4. Comparing with the above crystal graphs of B(Λ1) and B(Λ2),
we see that the set of monomials {Y1,1,Y2,1Y2,22} (resp. {Y1,2,Y2,2Y1,1,Y2,1Y2,2}) appearing in ΔΛ1,s1s2Λ1∘xiG(a;Y)
(resp. ΔΛ2,s1s2Λ2∘xiG(a;Y))
coincides with the monomial realization of the Demazure crystal B(Λ1)s1 (resp. B(Λ2)s2s1) (see 5.2).
All other cluster variables in C[Ge,c2] are
[TABLE]
[TABLE]
[TABLE]
and the sets of monomials appearing in these Laurent polynomials coincide with monomial realizations of the Demazure crystals B(Λ1)e, B(Λ2)e, B(Λ1+Λ2)s2 and B(Λ1+2Λ2)s2⊕B(Λ1)e, respectively. Note that the set of almost positive roots of type B2 is {−α1,−α2,α1,α2,α1+α2,α1+2α2}. Therefore, the number of the cluster variables in C[Ge,c2] is 6 from the result of [5].
The article is organized as follows. In section 2, we review the explicit forms of fundamental
representations of classical groups. Section 3 is devoted to recall properties of double Bruhat cells. In section 4,
after a concise reminder on cluster algebras, we review isomorphisms between the coordinate rings of double Bruhat cells and cluster algebras A(i). In section 5, we shortly review
the monomial realizations of crystal bases. Section 6 presents our main results, which provide a relation between all the cluster variables in C[Ge,c2] and monomial
realizations of Demazure crystals, and we prove them in section 7.
Acknowledgement. I would like to thank T. Nakashima for his helpful comments and discussions.
2 Fundamental representations
First, we review the fundamental representations of the complex simple Lie algebras g of type Ar, Br, Cr, and Dr [17, 19] for calculations of generalized minors (see Subsection 4.3).
Let I:={1,⋯,r}, A=(aij)i,j∈I
be the Cartan matrix of g, and (h,{αi}i∈I,{hi}i∈I) the associated
root data
satisfying αj(hi)=aij, where
αi∈h∗ is a simple root and
hi∈h is a simple co-root.
Let {Λi}i∈I be the set of the fundamental
weights satisfying Λi(hj)=δi,j, P=⨁i∈IZΛi the weight lattice and P∗=⨁i∈IZhi the dual weight lattice.
2.1 Type Ar
Let g=sl(r+1,C) be the simple Lie algebra of type Ar. The Cartan matrix A=(ai,j)i,j∈I of g is as follows:
[TABLE]
For g=⟨h,ei,fi(i∈I)⟩,
let us describe the vector representation
V(Λ1). Set B(r):={vi∣ i=1,2,⋯,r+1} and define
V(Λ1):=⨁v∈B(r)Cv. The weights of vi (i=1,⋯,r+1) are given by wt(vi)=Λi−Λi−1, where Λ0=Λr+1=0. We define the g-action on V(Λ1) as follows: For i∈I and j (1≤j≤r+1),
[TABLE]
and the other actions are trivial.
Let Λi be the i-th fundamental weight of type Ar.
As is well-known that the fundamental representation
V(Λi) (1≤i≤r)
is embedded in ∧iV(Λ1)
with multiplicity free.
The explicit form of the highest (resp. lowest) weight
vector uΛi (resp. vΛi)
of V(Λi) is realized in
∧iV(Λ1) as follows:
[TABLE]
2.2 Type Cr
Let g=sp(2r,C) be the simple Lie algebra of type Cr. The Cartan matrix A=(ai,j)i,j∈I of g is given by
[TABLE]
Note that αi (i=r) are short roots and αr is the long simple root.
Define the total order on the set JC:={i,i∣1≤i≤r} by
[TABLE]
For g=⟨h,ei,fi(i∈I)⟩,
let us describe the vector representation
V(Λ1). Set B(r):={vi,vi∣i=1,2,⋯,r} and define
V(Λ1):=⨁v∈B(r)Cv. The weights of vi, vi (i=1,⋯,r) are given by wt(vi)=Λi−Λi−1 and wt(vi)=Λi−1−Λi,
where Λ0=0. We define the g-action on V(Λ1) as follows:
[TABLE]
and the other actions are trivial.
Let Λi be the i-th fundamental weight of type Cr.
As is well-known that the fundamental representation
V(Λi) (1≤i≤r)
is embedded in ∧iV(Λ1)
with multiplicity free.
The explicit form of the highest (resp. lowest) weight
vector uΛi (resp. vΛi)
of V(Λi) is realized in
∧iV(Λ1) as follows:
[TABLE]
2.3 Type Br
Let g=so(2r+1,C) be the simple Lie algebra of type Br. The Cartan matrix A=(ai,j)i,j∈I of g is given by
[TABLE]
Note that αi (i=r) are long roots and αr is the short simple root.
Define the total order on the set JB:={i,i∣1≤i≤r}∪{0} by
[TABLE]
For g=⟨h,ei,fi(i∈I)⟩,
let us describe the vector representation
V(Λ1). Set B(r):={vi,vi∣i=1,2,⋯,r}∪{v0} and define
V(Λ1):=⨁v∈B(r)Cv. The weights of vi, vi (i=1,⋯,r) and v0 are as follows:
[TABLE]
[TABLE]
where Λ0=0. We define the g-action on V(Λ1) as follows:
[TABLE]
and the other actions are trivial.
Let Λi (1≤i≤r−1) be the i-th fundamental weight of type Br.
Similar to the Cr case, the fundamental representation
V(Λi)
is embedded in ∧iV(Λ1)
with multiplicity free. In
∧iV(Λ1), the highest (resp. lowest) weight
vector uΛi (resp. vΛi)
of V(Λi) is realized as the same form as in (2.6).
The fundamental representation V(Λr) is called the spin representation. It can be realized as follows: Set
[TABLE]
and define the g-action on Vsp(r) as follows:
[TABLE]
[TABLE]
[TABLE]
Then the module Vsp(r) is isomorphic to V(Λr) as a g-module.
2.4 Type Dr
Let g=so(2r,C) be the simple Lie algebra of type Dr. The Cartan matrix A=(ai,j)i,j∈I of g is given by
[TABLE]
Define the partial order on the set JD:={i,i∣1≤i≤r} by
[TABLE]
Note that there is no order between r and r. For g=⟨h,ei,fi(i∈I)⟩,
let us describe the vector representation
V(Λ1). Set B(r):={vi,vi∣i=1,2,⋯,r} and define
V(Λ1):=⨁v∈B(r)Cv. The weights of vi, vi (i∈I) are as follows:
[TABLE]
[TABLE]
where Λ0=0. We define the g-action on V(Λ1) as follows:
[TABLE]
and the other actions are trivial.
Let Λi (1≤i≤r−2) be the i-th fundamental weight of type Dr. Similar to the Br and Cr cases, the fundamental representation
V(Λi)
is embedded in ∧iV(Λ1)
with multiplicity free. In
∧iV(Λ1), the highest (resp. lowest) weight
vector uΛi (resp. vΛi)
of V(Λi) is realized as the formula (2.6).
The fundamental representations V(Λr−1) and V(Λr) are also called the spin representations. They can be realized as follows: Set
[TABLE]
[TABLE]
and define the g-action on Vsp(±,r) as follows:
[TABLE]
[TABLE]
[TABLE]
Then the module Vsp(+,r) (resp. Vsp(−,r)) is isomorphic to V(Λr) (resp. V(Λr−1)) as a g-module.
3 Factorization theorem
In this section, we shall introduce double Bruhat cells Gu,v and their properties[2, 3]. For l∈Z>0, we set [1,l]:={1,2,⋯,l}.
3.1 Double Bruhat cells
Let G be a classical algebraic group over C, B and B− be two opposite Borel subgroups in G, N⊂B and N−⊂B− be their unipotent radicals,
H:=B∩B− a maximal torus. We set g:=Lie(G) with the triangular decomposition g=n−⊕h⊕n. Let ei, fi (i∈[1,r]) be the generators of n, n−. For i∈[1,r] and t∈C, we set
[TABLE]
Let W:=⟨si∣i=1,⋯,r⟩ be the Weyl group of g, where
{si} are the simple reflections. We identify the Weyl group W with NormG(H)/H. An element
[TABLE]
is in NormG(H), which is a representative of si∈W=NormG(H)/H [19]. For u∈W, let u=si1⋯sin be its reduced expression. Then we write u=si1⋯sin, call l(u):=n the length of u. We have two kinds of Bruhat decompositions of G as follows:
[TABLE]
Then, for u, v∈W,
we define the double Bruhat cell Gu,v as follows:
[TABLE]
Definition 3.1**.**
Let v=sjn⋯sj1 be a reduced expression of v∈W (jn,⋯,j1∈[1,r]). Then the finite sequence i:=(jn,⋯,j1) is called a reduced word for v.
For example, the sequence (3,2,1,3,2,1) is a reduced word of the element s3s2s1s3s2s1 of the Weyl group of type B3 or C3. In this paper, we mainly treat double Bruhat cells of the form Ge,v:=B∩B−vB−.
3.2 Factorization theorem
In this subsection, we shall introduce isomorphisms between double Bruhat cells Ge,v and H×(C×)l(v). For i∈[1,r] and t∈C×, we set αi∨(t):=thi.
For a sequence i=(i1,⋯,in)
(i1,⋯,in∈[1,r]),
we define a map xiG:H×Cn→G as
[TABLE]
Theorem 3.2**.**
[2, 3]** For v∈W and its reduced word i, the map xiG is a biregular isomorphism from H×(C×)l(v) to a Zariski open subset of Ge,v.
For i=(i1,⋯,in)
(i1,⋯,in∈[1,r]), we define a map
xiG:H×(C×)n→Ge,v as
[TABLE]
where a∈H and (t1,⋯,tn)∈(C×)n.
Now, let G be a classical algebraic group of type Br, Cr or Dr, and c∈W be a Coxeter element such that a reduced word i of c2 can be written as
[TABLE]
Remark 3.3**.**
In the rest of the paper, we use double indexed variables Ys,j (s∈Z, j∈[1,r]). If we see the variables Ys,0, Ys,j
(r+1≤j) then
we understand Ys,0=Ys,j=1. For example, if l=1 then Ys,l−1=1.
Proposition 3.4**.**
In the above setting, the map xiG is a biregular isomorphism between H×(C×)2r and a Zariski open subset of Ge,c2.
[Proof.]
Let us prove this proposition in the case G is type Cr. In the case G is type Br or Dr, we can prove it in the same way.
In this proof, we use the notation
[TABLE]
for variables instead of (t1,⋯,t2r)∈(C×)2r.
We define a map
ϕ:H×(C×)2r→H×(C×)2r,
[TABLE]
as
[TABLE]
and for l∈{1,2,⋯,r},
[TABLE]
[TABLE]
Note that ϕ is a biregular isomorphism since we can construct the inverse map ψ:H×(C×)2r→H×(C×)2r,
[TABLE]
of ϕ as follows:
[TABLE]
and Ψ1,l(Y) is defined inductively as
[TABLE]
and
[TABLE]
Then, the map ψ is the inverse map of ϕ.
Let us prove
[TABLE]
which implies that xiG:H×(C×)2r→Ge,c2 is a biregular isomorphism by Theorem 3.2. First, it is known that for 1≤i, j≤r and s, t∈C×,
[TABLE]
where (ai,j)i,j∈I is the Cartan matrix of type Cr. On the other hand, it follows from the definition (3.3) of xiG and (\refmbasea) that
[TABLE]
For each l (1≤l<r), we can move
[TABLE]
to the right of
xl(Φ1,l(Y)) by using the relations (3.8):
[TABLE]
In the same way, we see that
[TABLE]
Similarly, for 1≤l≤r, we can also move ∏i=1lαi∨(Y2,i) to the right of xl(Φ2,l(Y)):
[TABLE]
Thus, we get
[TABLE]
4 Cluster algebras and generalized minors
Following [1, 3, 4, 7], we review the definitions of cluster algebras and their generators called cluster variables. It is known that the coordinate rings of double Bruhat cells have cluster algebra structures, and generalized minors are their initial cluster variables [8, 9]. We will refer to a relation between cluster variables on double Bruhat cells and crystal bases in Sect.6.
We set [1,l]:={1,2,⋯,l} and [−1,−l]:={−1,−2,⋯,−l} for l∈Z>0. For n,m∈Z>0, let x1,⋯,xn,xn+1,⋯,xn+m be commuting variables and F:=C(x1,⋯,xn,xn+1,⋯,xn+m)
be the field of rational functions.
4.1 Cluster algebras of geometric type
In this subsection, we recall the definitions of cluster algebras. Let B~=(bij)1≤i≤n+m, 1≤j≤n be an (n+m)×n integer matrix. The principal part B of B~ is obtained from B~ by deleting the last m rows. For B~ and k∈[1,n], the new (n+m)×n integer matrix μk(B~)=(bij′) is defined by
[TABLE]
One calls μk(B~) the matrix mutation in direction k of B~. If there exists a positive
integer diagonal matrix D such that DB is skew symmetric, we say B is skew symmetrizable. Then we also say B~ is skew symmetrizable. It is easily verified that if B~ is skew symmetrizable then μk(B~) is also skew symmetrizable[7, Proposition3.6]. We can also verify that μkμk(B~)=B~. Define x:=(x1,⋯,xn+m) and we call the pair (x,B~) initial seed and x1,⋯,xn+m initial cluster variables. For k∈[1,n], a new cluster variable xk′ is defined by the following exchange relation.
[TABLE]
Let μk(x) be the set of variables obtained from x by replacing xk by xk′. Ones call the pair (μk(x),μk(B~)) the mutation in direction k of the seed (x,B~) and denote it by μk((x,B~)).
Now, we can repeat this process of mutation and obtain a set of seeds inductively. Hence, each seed consists of an (n+m)-tuple of variables and a matrix. Ones call this (n+m)-tuple and matrix cluster and exchange matrix respectively. Variables in cluster is called cluster variables. In particular, the variables xn+1,⋯,xn+m are called frozen cluster variables.
Definition 4.1**.**
[3, 7]
Let B~ be an integer matrix whose principal part is skew symmetrizable and Σ=(x,B~) a seed. We set A:=Z[xn+1±1,⋯,xn+m±1]. The cluster algebra (of geometric type) A=A(Σ) over A associated with
seed Σ is defined as the A-subalgebra of F generated by all cluster variables in all seeds which can be obtained from Σ by sequences of mutations.
4.2 Cluster algebra A(i)
Let G be a classical algebraic group, g:=Lie(G) and A=(ai,j) be its Cartan matrix. In Definition 3.1, we defined a reduced word i=(jn,⋯,j2,j1) for an element v of Weyl group W. In this subsection, we define a cluster algebra A(i), which is obtained from i. It satisfies that A(i)⊗C is isomorphic to the coordinate ring C[Ge,v] of the double Bruhat cell [1]. Let jk (k∈[1,n]) be the k-th index of i from the right. Let us add r additional entries j−r,⋯,j−1 at the beginning of i by setting j−t=−t (t∈[1,r]).
For l∈[1,n], we denote by l− the largest index k∈[1,n] such that k<l and
jl=jk. For l∈[−1,−r], let l− be the largest index k∈[1,n] such that
∣jl∣=∣jk∣. If such k does not exist, we set l−:=0.
For example, if [−1,−3]∪i=(−3,−2,−1,3,2,1,3,2,1) then, (−1)−=4,
(−2)−=5, (−3)−=6, 4−=1, 5−=2, 6−=3, and 3−=2−=1−=0.
We define a set e(i) as
[TABLE]
Following [1], we define a directed graph Γi as follows. The vertices of Γi are the variables xk (k∈[−1,−r]∪[1,n]). For two vertices xk (k∈[−1,−r]∪[1,n]) and xl (l∈e(i)) with either l<k or k∈[−1,−r], there exists an arrow xk→xl (resp. xl→xk) if and only if l=k− (resp. l−<k−<l and a∣jk∣,∣jl∣<0). For two
vertices xk (k∈[1,n]∖e(i)) and
xl (l∈e(i)) with
k<l, there exists an arrow
xl→xk (resp.
xk→xl) if and only if k=l−
(resp. k−<l−<k and
a∣jl∣,∣jk∣<0). Next, let us define a matrix B~=B~(i).
Definition 4.2**.**
Let B~(i) be an integer matrix with rows labelled by all the indices in [−1,−r]∪[1,n] and columns labelled by all the indices in e(i). For k∈[−1,−r]∪[1,n] and l∈e(i), an entry bkl of B~(i) is determined as follows: If there exists an arrow xk→xl (resp. xl→xk) in Γi, then
[TABLE]
If there exist no arrows between k and l, we set bkl=0. The principal part B(i) of B~(i) is the submatrix (bi,j)i,j∈e(i).
Proposition 4.3**.**
[1]**
B~(i) is skew symmetrizable.
Definition 4.4**.**
[1]
We set x=(xi)i∈[−1,−r]∪[1,n] and define the cluster algebra A(i) over Z[xi±1∣ i∈[−1,−r]∪[1,n]∖e(i)] as A(i):=A((x,B~(i))).
In this definition, we use the notation xi (i∈[−1,−r]∪[1,n]∖e(i)) for frozen cluster variables instead of xn+1,⋯,xn+m in Definition 4.1.
4.3 Generalized minors
Set A(i)C:=A(i)⊗C. It is known that the coordinate ring C[Ge,v] of the double Bruhat cell is isomorphic to A(i)C (Theorem 4.6). To describe this isomorphism explicitly, we need generalized minors.
We set G0:=N−HN, and let x=[x]−[x]0[x]+ with [x]−∈N−, [x]0∈H, [x]+∈N be the corresponding decomposition.
Definition 4.5**.**
For i∈[1,r] and w, w′∈W, the generalized minor Δw′Λi,wΛi is a regular function on G whose restriction to the open set w′G0w−1 is given by Δw′Λi,wΛi(x)=([w′−1xw]0)Λi. Here, Λi is the i-th fundamental weight and w is the one we defined in (3.2).
The generalized minor Δw′Λi,wΛi depends on w′Λi, wΛi and does not depend on w′, w. By definition, for a∈H, x∈G, w∈W, i,j∈I and t∈C,
[TABLE]
where xj(t)∈N is the one in (3.1).
Let ω:g→g be the anti-involution
[TABLE]
and extend it to G by setting
ω(xi(c))=yi(c), ω(yi(c))=xi(c) and ω(t)=t
(t∈H). Here, xi(t) and yi(t) were defined in (3.1). One can calculate the generalized minors as follows. There exists a g (or G)-invariant bilinear form on the
finite-dimensional irreducible
g-module V(λ) such that
[TABLE]
For g∈G,
we have the following simple fact:
[TABLE]
where uΛi is a properly normalized highest weight vector in
V(Λi). Hence, for w, w′∈W, we have
[TABLE]
Note that ω(si±)=si∓.
4.4 Cluster algebras on double Bruhat cells
For a reduced expression v=sjnsjn−1⋯sj1∈W and k∈[1,n], we set
[TABLE]
For k∈[1,n], we define Δ(k;i)(x):=ΔΛjk,v>n−k+1Λjk(x), and for k∈[−1,−r], Δ(k;i)(x):=ΔΛ∣k∣,v−1Λ∣k∣(x). Finally, we set F(i):={Δ(k;i)(x)∣k∈[−1,−r]∪[1,n]}. It is known that the set F(i) is an algebraically independent generating set for the field of rational functions C(Ge,v) [3, Theorem 1.12]. Then, we have the following.
Theorem 4.6**.**
[1, 6, 8, 9]**
The isomorphism of fields φ:F→C(Ge,v) defined by φ(xk)=Δ(k;i) (k∈[−1,−r]∪[1,n]) restricts to an isomorphism of algebras A(i)C→C[Ge,v].
Example 4.7**.**
Let G be a classical algebraic group of type Br, Cr or Dr, v=c2 be the square of a Coxeter element such that whose reduced word i is written as in (\refredwords2). Then for k∈[1,r], we have jr+k=jk=k and the isomorphism is given by
[TABLE]
4.5 Finite type
Let S be the set of seeds of a cluster algebra A. If S is finite, then A is said to be finite type. In this subsection, we shall review the cluster algebras of finite type [5].
Let B=(bij) be an integer square matrix. The Cartan counter part of B is a generalized Cartan matrix A=A(B)=(ai,j) defined as follows:
[TABLE]
Theorem 4.8**.**
[5]**
For a cluster algebra A with the set S of seeds, the following statements are equivalent:
- (i)
The cluster algebra A is of finite type.
2. (ii)
There exists a seed Σ=(y,B~) such that A=A(Σ) and A(B) is a Cartan matrix of finite type, where B is the principal part of B~.
3. (iii)
*Let (y′,B~′) be an arbitrary seed in S and (bi,j) be the principal part of B~′. Then ∣bi,jbj,i∣≤3. *
By this theorem, we can define the type of each cluster algebra of finite type mirroring the Cartan-Killing classification.
Let Φ be the root system associated with a Cartan matrix, with the set of simple roots Π={αi∣ i∈I} and the set of positive roots Φ>0. The set of almost positive roots is defined as Φ≥−1:=Φ>0∪−Π.
Theorem 4.9**.**
[5]**
- (i)
For a cluster algebra A of finite type, the number of the cluster variables included in A is equal to ∣Φ≥−1∣. Here, Φ is the root system associated with the Cartan matrix of the same type as A.
2. (ii)
Let c∈W be a Coxeter element of a classical algebraic group G whose length l(c) satisfies
l(c2)=2l(c)=2rank(G). Then the coordinate ring C[Ge,c2] has a structure of cluster algebra of finite type under the isomorphism in Theorem 4.6, and its type is the Cartan-Killing type of G.
Next, we define the following graph, which is a similar notion to the weighted graph introduced in [5].
Definition 4.10**.**
Let Σ=(y,B~) be a seed with y=(yi)i∈[−1,−r]∪[1,n] and
an (r+n)×∣e(i)∣-skew symmetrizable matrix B~=(bi,j) which satisfies
bi,j∈{−2,−1,0,1,2} (the rows of B~ are labelled by [−1,−r]∪[1,n] as above), where yi=xi for i∈[−1,−r]∪[1,n]∖e(i). We suppose that if i,j∈e(i) then ∣bi,jbj,i∣≤3.
We define Γ(Σ) as the labelled directed graph whose vertices are y−r,⋯,y−1,y1,⋯,yn, and whose arrows and its labels are determined as follows: For i,j∈e(i), there exists the arrow yi→yj2 (resp. yj→yi−2) if and only if bi,j=2 and bj,i=−1
(resp. bi,j=−2 and bj,i=1). Further, there exists the arrow yi→yj if and only if bi,j=1 and bj,i=−1. For i∈[−1,−r]∪[1,n]∖e(i) and j∈e(i), there exists the arrow yi→yj2 (resp. yj→yi−2) if and only if bi,j=2
(resp. bi,j=−2). Further, there exists the arrow yi→yj (resp. yj→yi) if and only if bi,j=1 (resp. bi,j=−1). We call the graph Γ(Σ) mutation diagram of Σ. We understand the arrows yi→yj (i,j∈[−1,−r]∪[1,n]) have the labels 1 and do not denote it.
Note that the graph Γ((x,B~(i))) is obtained from Γi by labelling
arrows properly.
Lemma 4.11**.**
[5, 7]**
Let Σ=(y,B~) be a seed as in Definition 4.10. For k∈e(i), the graph Γ(μk(Σ)) has vertices y−r,⋯,y−1,y1,⋯,yk′,⋯,yn, and edges or subgraphs of Γ(Σ) are transformed to those of Γ(μk(Σ)) by μk as follows:
- (1)
If yi→yk (resp. yk→yi) in Γ(Σ) then yk′→yi (resp. yi→yk′) in Γ(μk(Σ)). If yi→yk±2 in Γ(Σ) then yk′→yi∓2 in Γ(μk(Σ)).
2. (2)
For i,j∈[−1,−r]∪[1,n], we suppose that either i or j (or both) belong to e(i). Then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where the arrow yi⟶yj−2 with i∈/e(i), j∈e(i) implies the arrow yi⟶yj, and the arrow yi⟶yj2 with i∈e(i), j∈/e(i) implies the arrow yi⟶yj.
3. (3)
If two vertices yi and yj are not connected via a two-arrow oriented
path going through yk in Γ(Σ), the arrows between yi and yj and their labels remain unchanged by μk.
We will use this lemma in Sect 7.
Remark 4.12**.**
In the above lemma, we do not mention to several subgraphs. For example, the subgraph
[TABLE]
is not mentioned. But we will not treat these graphs in this article.
Example 4.13**.**
Let us consider the case G=SO5(C) (type B2) and i=(2,1,2,1). The graph Γ((x,B~(i))) is described as
[TABLE]
In general, let us consider the case G=SO2r+1(C) (type Br) and i is the sequence in (\refredwords2).
For k (1≤k≤r−2), vertices and arrows around the vertex xr+k in the graph Γ((x,B~(i))) are
[TABLE]
Vertices and arrows around the vertex x2r in the graph Γ((x,B~(i))) are
[TABLE]
5 Monomial realizations and Demazure crystals
In Sect.6, we shall describe the cluster variables in a cluster algebra of finite type in terms of the monomial realizations of Demazure crystals. Let us recall the notion of crystal base and its monomial realization in this section. Let g be a complex simple Lie algebra and I={1,2,⋯,r} the index set.
5.1 Monomial realizations of crystals
In this subsection, we review the monomial realizations of crystals [13, 15, 18]. First, let us recall the crystals.
Definition 5.1**.**
[14]
A crystal associated with a Cartan matrix A is a set B together with the maps wt:B→P,
ei~, fi~:B∪{0}→B∪{0} and εi,
φi:B→Z∪{−∞}, i∈I, satisfying some properties.
We call {e~i, f~i} the Kashiwara operators. Let Uq(g) be the quantum enveloping algebra [14] associated with a Cartan matrix A, that is, Uq(g) has generators {ei, fi, hi∣ i∈I} over C(q) satisfying some relations, where q is an indeterminate. Let V(λ) (λ∈P+=⊕i∈IZ≥0Λi) be the finite dimensional irreducible representation of Uq(g) which has the highest weight vector vλ, and B(λ) be the crystal base of V(λ). The crystal base B(λ) has a crystal structure.
Let us introduce monomial realizations which realize each element of B(λ) as a certain Laurent monomial. First, fix a cyclic sequence of the indices ⋯(i1,i2,⋯,ir)(i1,i2,⋯,ir)⋯ such that {i1,i2,⋯,ir}=I. And we can associate this sequence with a set of integers p=(pj,i)j,i∈I,j=i such that
[TABLE]
Second, for doubly-indexed variables {Ys,i∣i∈I, s∈Z}, we define the set of monomials
[TABLE]
Finally, we define maps wt:Y→P, εi, φi:Y→Z, i∈I. For Y=s∈Z,i∈I∏Ys,iζs,i∈Y,
[TABLE]
We set
[TABLE]
and define the Kashiwara operators as follows
[TABLE]
where
[TABLE]
Then the following theorem holds:
Theorem 5.2**.**
[13, 18]**
- (i)
For the set p=(pj,i) as above, (Y,wt,φi,εi,f~i,e~i)i∈I is a crystal.
When we emphasize p, we write Y as Y(p).
2. (ii)
If a monomial Y∈Y(p) satisfies εi(Y)=0 for all i∈I,
then the connected component containing Y is isomorphic to B(wt(Y)).
5.2 Demazure crystals
For w∈W and λ∈P+, a Demazure crystal
B(λ)w⊂B(λ) is inductively defined as follows.
Definition 5.3**.**
Let uλ be the highest weight vector of B(λ). For
the identity element e of W, we set
B(λ)e:={uλ}.
For w∈W, if siw<w,
[TABLE]
Theorem 5.4**.**
[16]**
For w∈W, let w=si1⋯sin be an arbitrary reduced
expression. Let uλ be the highest
weight vector of B(λ). Then
[TABLE]
Example 5.5**.**
Let us consider the case of type C2 and cyclic sequence is (2,1). In the notation of (\refasidef), we can write
[TABLE]
In general, if each factor of a monomial Y∈Y has non-negative degree, then εi(Y)=0 for all i∈I={1,2}.
Therefore, we have εi(Y1,1)=0. Hence, we can consider the monomial realization of crystal base B(Λ1) such that the highest weight vector in B(Λ1) is realized by Y1,1:
[TABLE]
Similarly, we get the monomial realization of crystal base B(Λ2) such that the highest weight vector in B(Λ2) is realized by Y1,2:
[TABLE]
Example 5.6**.**
Let us consider the case of type B3 and cyclic sequence is (3,2,1).
In the notation of (\refasidef), we can write
[TABLE]
We can consider the monomial realization of crystal base B(Λ1) such that the highest weight vector in B(Λ1) is realized by Y1,1:
[TABLE]
6 Cluster variables and crystals
Let G be a classical algebraic group of type Br, Cr or Dr. In this section, we describe the cluster variables on a double Bruhat cell by the total sum of monomial realizations of Demazure crystals. In the rest of the paper, we only treat the Coxeter element c∈W such that a reduced word i of c2 can be written as (3.4). Let jk be the k-th index of i from the right, which implies jk=jr+k=k (1≤k≤r). We shall consider the monomial realization associated with the sequence (r,⋯,2,1) (Sect.5.1).
Let V:=((φV)2r,⋯,(φV)r+1,(φV)r,⋯,(φV)1,(φV)−r,⋯,(φV)−1), where (φV)k∈C[Ge,c2] are defined as follows:
[TABLE]
By Theorem 4.6, Example 4.7 and Theorem 4.9, we can regard C[Ge,c2] as a cluster algebra of finite type and V as its initial cluster. Moreover, (φV)2r,⋯,(φV)r+1 and (φV)−r,⋯,(φV)−1 are frozen cluster variables.
Using these notation, we can rewrite the graph (4.5) of type Br as
[TABLE]
Similarly, we can also rewrite (4.6) by using these notation:
[TABLE]
In the rest of the paper, when we write a cluster in C[Ge,c2], we drop frozen variables. For example, V=((φV)r,⋯,(φV)1).
We will order the cluster variables (φV)1,⋯,(φV)r from the right in V as above, and let μk denote the mutation of the k-th cluster variable from the right. For a cluster T in C[Ge,c2], let (φT)k denote the k-th (non-frozen) cluster variable from the right:
[TABLE]
Each cluster variable is a regular function on Ge,c2. On the other hand, by Proposition 3.4, it can be seen as a function on
H×(C×)2r . Then, let us consider the following change of variables:
Definition 6.1**.**
Along (3.4), we set the variables Y∈(C×)2r as
[TABLE]
Then for a∈H and cluster T in C[Ge,c2], we define
[TABLE]
where xiG is as in Proposition 3.4.
Example 6.2**.**
Let us consider the case G=Sp4(C) (type C2) and i=(2,1,2,1).
In the above setting, for k∈[1,r],
[TABLE]
The definition (\refinicluvar) says (φV)1=ΔΛ1,c>32Λ1=ΔΛ1,s1Λ1. Using the bilinear form (\refminor−bilin), it follows from the actions (\refB−wtv), (\refB−f1), (\refB−f2) on the fundamental representation that
[TABLE]
Comparing with (5.3), the set of monomials {Y1,1,Y2,1Y2,2} coincides with the monomial realization of the Demazure crystal B(Λ1)s1 in Example 5.5 (see Theorem 5.4).
Note that the value of (φVG)1(a;Y) was reduced to the calculation of the coefficient of v2 in α1∨(Y2,1)y1(Y2,1)α2∨(Y2,2)y2(Y2,2)α1∨(Y1,1)y1(Y1,1)α2∨(Y1,2)y2(Y1,2)v1. Similarly, the value of (φVG)2(a;Y) was reduced to the calculation of the coefficient of v2∧v1 in α1∨(Y2,1)y1(Y2,1)⋯α2∨(Y1,2)y2(Y1,2)v1∧v2. Hence, to calculate (φVG)2(a;Y), we need
[TABLE]
Just as in the case of (φVG)1(a;Y), one get
[TABLE]
Comparing with (5.4), the set of monomials {Y1,2,Y2,2Y1,12,Y2,1Y1,1,Y2,12Y2,2} is equal to the monomial realization of the Demazure crystal B(Λ2)s1s2 in Example 5.6.
The following theorems are our main results, which mean relations between the cluster variables in C[Ge,c2] and Demazure crystals.
Theorem 6.3**.**
Let G=SO2r+1(C) be the classical algebraic group of type Br. The cluster variables in C[Ge,c2] are the total sums of monomial realizations of certain Demazure crystals. More precisely, each cluster variable is described as follows:
- (i)
For k∈[1,r], we obtain
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) such that the highest weight vector in B(Λk) is realized by Y1,k∈Y. We also obtain
[TABLE]
where μ′ is the monomial realization of B(Λk) such that the highest weight vector in B(Λk) is realized by Y2,k∈Y.
2. (ii)
For k and l with 1≤k≤l≤r−2,
[TABLE]
where μ is the monomial realization of B(Λk+Λl+1) such that the highest weight vector in B(Λk+Λl+1) is realized by Y2,kY1,l+1∈Y.
3. (iii)
For k∈[1,r−1], we obtain
[TABLE]
where μ is the monomial realization of B(Λk+2Λr) such that the highest weight vector is realized by Y2,kY1,r2∈Y, μ′ is the monomial realization of B(Λk−1+Λr−1) such that the highest weight vector is realized by Y1,k−1Y1,r−1∈Y, and C(b) are some positive integers. We also obtain
[TABLE]
where μ′′ is the monomial realization of B(Λk+Λr) such that the highest weight vector is realized by Y2,kY1,r∈Y.
4. (iv)
For j and k with 1≤j<k≤r−1,
[TABLE]
where μ is the monomial realization of B(Λj+Λk+2Λr) such that the highest weight vector is realized by Y2,jY2,kY1,r2∈Y, μ′ is the monomial realization of B(Λj+Λk−1+Λr−1) such that the highest weight vector is realized by Y2,jY1,k−1Y1,r−1∈Y, and C(b) are some positive integers.
Theorem 6.4**.**
Let G=Sp2r(C) be the classical algebraic group of type Cr.
- (i)
For k∈[1,r], we obtain
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) such that the highest weight vector in B(Λk) is realized by Y1,k∈Y, and C(b) are some positive integers. We also obtain
[TABLE]
where μ′ is the monomial realization of B(Λk) such that the highest weight vector in B(Λk) is realized by Y2,k∈Y.
2. (ii)
For k and l with 1≤k≤l≤r−2,
[TABLE]
where μ is the monomial realization of B(Λk+Λl+1) such that the highest weight vector in B(Λk+Λl+1) is realized by Y2,kY1,l+1∈Y.
3. (iii)
For k∈[1,r−1], we obtain
[TABLE]
where μ is the monomial realization of B(Λk+Λr) such that the highest weight vector is realized by Y2,kY1,r∈Y, μ′ is the monomial realization of B(Λk−1+Λr−1) such that the highest weight vector is realized by Y1,k−1Y1,r−1∈Y, and C(b) are some positive integers. We also obtain
[TABLE]
where μ′′ is the monomial realization of B(2Λk+Λr) such that the highest weight vector is realized by Y2,k2Y1,r∈Y, and C′(b) are some positive integers.
4. (iv)
For j and k with 1≤j<k≤r−1,
[TABLE]
where μ is the monomial realization of B(Λj+Λk+Λr) such that the highest weight vector is realized by Y2,jY2,kY1,r∈Y, μ′ is the monomial realization of B(Λj+Λk−1+Λr−1) such that the highest weight vector is realized by Y2,jY1,k−1Y1,r−1∈Y, and C(b) are some positive integers.
Theorem 6.5**.**
Let G=SO2r(C) be the classical algebraic group of type Dr.
- (i)
For k∈[1,r], we obtain
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) such that the highest weight vector in B(Λk) is realized by Y1,k∈Y, and C(b) are some positive integers. Furthermore, we have
[TABLE]
[TABLE]
For k∈[1,r−2],
[TABLE]
where μs′ (1≤s≤r) is the monomial realization of B(Λs) such that the highest weight vector is realized by Y2,s∈Y.
2. (ii)
For k and l with 1≤k≤l≤r−3,
[TABLE]
where μ is the monomial realization of B(Λk+Λl+1) such that the highest weight vector in B(Λk+Λl+1) is realized by Y2,kY1,l+1∈Y.
3. (iii)
For k∈[1,r−2], we obtain
[TABLE]
where μ is the monomial realization of B(Λk+Λr−1+Λr) such that the highest weight vector is realized by Y2,kY1,r−1Y1,r∈Y and C(b) are some integers, μ′ is the monomial realization of B(Λk−1+Λr−2) such that the highest weight vector is realized by Y1,k−1Y1,r−2∈Y.
4. (iv)
For k∈[1,r−2],
[TABLE]
where μ is the monomial realization of B(Λk+Λr) such that the highest weight vector is realized by Y2,kY1,r∈Y.
[TABLE]
where μ′ is the monomial realization of B(Λk+Λr−1) such that the highest weight vector is realized by Y2,kY1,r−1∈Y.
5. (v)
For j and k with 1≤j<k≤r−2,
[TABLE]
where μ is the monomial realization of B(Λj+Λk+Λr−1+Λr) such that the highest weight vector is realized by Y2,jY2,kY1,r−1Y1,r∈Y, and μ′ is the monomial realization of B(Λj+Λk−1+Λr−2) such that the highest weight vector is mapped to Y2,jY1,k−1Y1,r−2∈Y, and C(b) are some positive integers.
Remark 6.6**.**
In Theorem 6.3 (resp. 6.4, 6.5),
we saw explicit formulas of r2+r (resp. r2+r, r2)
cluster variables
in C[Ge,c2].
The number r2+r (resp. r2+r, r2) coincides
with
∣Φ≥−1∣ of type Br
(resp. Cr,Dr).
Thus, by Theorem 4.9, all cluster variables
in C[Ge,c2] appear
in
Theorem 6.3-6.5.
7 The proof of main theorem
In this section, we prove Theorem 6.3, 6.4 and 6.5. Let Σ0:=(V,B~(i)) be the initial seed of C[Ge,c2].
7.1 The proof of Theorem 6.3
First, we shall prove the case G=SO2r+1(C). We start by setting the Laurent monomials as follows:
[TABLE]
where for 1≤l≤r, we set ∣l∣=∣l∣=l.
Proposition 7.1**.**
- (i)
For k∈[1,r],
the initial cluster variables (φVG)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) in Theorem 6.3 (i).
2. (ii)
For k∈[1,r], the frozen cluster variables (φVG)−k(a;Y), (φVG)r+k(a;Y) in C[Ge,c2] are described as
[TABLE]
[Proof.]
First, let k∈[1,r−1], and recall the fundamental representation V(Λk) of type Br in 2.3. By (2.10), (2.11) and (3.2), for i∈[1,r−1], j∈[1,r], we get
[TABLE]
Taking into account these formulas, we obtain
[TABLE]
Just as in Example 6.2, the value of (φVG)k(a;Y) coincides with
[TABLE]
Using (\refB−wtv), (\refB−f1) and (\refB−f2) repeatedly, for i∈[1,k], one obtain
[TABLE]
which means that α1∨(Y1,1)y1(Y1,1)⋯αk∨(Y1,k)yk(Y1,k)v1∧⋯∧vk is a linear combination of v1∧⋯∧vs∧vs+2∧⋯∧vk+1 (0≤s≤k) with the coefficient B(1,1)B(1,2)⋯B(1,s). Similarly, we can also verify that for s (0≤s≤k) the coefficient of v2∧⋯∧vk+1 in α1∨(Y2,1)y1(Y2,1)⋯αr∨(Y2,r)yr(Y2,r)(v1∧⋯∧vs∧vs+2∧⋯∧vk+1) is B(2,s+2)B(2,s+3)⋯B(2,k+1). Hence, we get
[TABLE]
The definition of the monomial realization implies that
[TABLE]
where we use B(1,s)A1,s−1=Y1,s−1Y1,sY1,sY2,sY1,s−1Y2,s+1=B(2,s+1).
Therefore, the conclusion
[TABLE]
follows from Theorem 5.4 and the easy fact B(1,1)B(1,2)⋯B(1,k)=Y1,k. By the same argument, the frozen cluster variable (φVG)−k(a;Y)=ΔΛk,Λk∘xG(a;Y) coincides with the coefficient of v1∧⋯∧vk in
[TABLE]
which equals to aΛkB(1,1)B(1,2)⋯B(1,k)B(2,1)B(2,2)⋯B(2,k)=aΛkY1,kY2,k. The frozen cluster variable (φVG)r+k(a;Y)=ΔΛk,c−2Λk∘xG(a;Y) coincides with the coefficient of
[TABLE]
in (7.4). It is equal to aΛk.
Next, we now turn to the case k=r. We need to recall the spin representation in 2.3. From (2.13), (2.14) and (3.2), we see that
[TABLE]
Just as in the case k<r, the value of (φVG)r(a;Y) coincides with
[TABLE]
From (2.12) and (2.13), we see that α1∨(Y1,1)y1(Y1,1)⋯αr∨(Y1,r)yr(Y1,r)(+,+,+,⋯,+) is a linear combination of (+,+,⋯,+) and (+,⋯,+,−i,+i+1,⋯,+) (1≤i≤r) whose coefficients are Y1,r and Y1,i−1, respectively. Similarly, the coefficient of (−,+,⋯,+,+) in α1∨(Y2,1)y1(Y2,1)⋯αr∨(Y2,r)yr(Y2,r)(+,+,⋯,+,+) is 1, the one in α1∨(Y2,1)y1(Y2,1)⋯αr∨(Y2,r)yr(Y2,r)(+,⋯,+,−i,+i+1,⋯,+) is Y2,iY2,r if i<r, and is Y2,r1 if i=r. Hence, it follows that
[TABLE]
By the same argument, we can prove that (φVG)−r(a;Y)=aΛrY1,rY2,r and (φVG)2r(a;Y)=aΛr.
In the proof, we found the explicit form (7.3) of (φVG)k(a;Y) for k∈[1,r−1], which can be rewritten as
[TABLE]
Thus, we obtain the relation between two cluster variables:
[TABLE]
Lemma 7.2**.**
For k∈[1,r], the cluster variables (φμkμk+1⋯μr(V)G)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
[Proof.]
We prove this statement by induction on (r−k). If r−k=0, so that k=r, then the mutation diagram (6.3) implies that
[TABLE]
Applying Proposition 7.1 (ii), (1) for k=r−1 and (7.1), we obtain
[TABLE]
Next, we consider the the cluster variable (φμr−1μr(V)G)r−1(a;Y). In the rest of this proof, we abbreviate (φTG)s(a;Y) to (φTG)s for s∈[1,r] and clusters T.
By Lemma 4.11, the mutation diagram of μr(Σ0) is as follows:
[TABLE]
Therefore, we get
[TABLE]
where we use Proposition 7.1 (ii) and (7.6) in the second equality.
Next, we assume that r−k>1. It follows from Lemma 4.11 that the arrows incident to the vertex (φV)k in the mutation diagram of μk+1⋯μr−1μr(Σ0) are as follows:
[TABLE]
Thus, we obtain
[TABLE]
where we use Proposition 7.1 (ii), (7.6) and the induction hypothesis in the second equality.
[Proof of Theorem 6.3 (ii)]
For fixed k, we use the induction on (l−k) to prove (6.6). If l−k=0, so that k=l, then the mutation diagram (6.2) means that
[TABLE]
where we use Proposition 7.1 (ii) in the second equality, and (7.6) for k and k+1 in the third equality.
Next, we assume that l−k>0. The vertices and arrows around the vertex (φV)l in the mutation diagram of μl−1⋯μk(Σ0) (l≤r−2) are as follows (Lemma 4.11):
[TABLE]
It follows from this diagram that
[TABLE]
Using the induction hypothesis, the cluster variable (φμl−1⋯μk(V)G)l−1 is
[TABLE]
In conjunction with (1), it follows that (φμl−1⋯μk(V)G)l−1 coincides with
[TABLE]
Applying Proposition 7.1 (ii), (7.6) and this formula to (7.7), we see that
[TABLE]
where we use (1) in the third equality, and Y1,l+1Y2,kA1,l+1−1A1,l−1⋯A1,k−1=Y1,k−1Y2,l+2 in the fourth equality. Hence, we get (6.6) for all l (k≤l≤r−2).
By the same argument as in the proof of Proposition 7.1, the equation (6.7) follows from (6.6).
[Proof of Theorem 6.3 (iii)]
Using Lemma 4.11 repeatedly, we see that the mutation diagram of μr−2⋯μk+1μk(Σ0) is as follows:
[TABLE]
which implies that
[TABLE]
On the other hand, from (1) and (7.1), we have
[TABLE]
Just as in (7.8), we see that
[TABLE]
Substituting (7.11) and (7.12) for (7.10), it follows
[TABLE]
where we use (1) in the third equality. Note that by Theorem 5.4, the monomial realization μ of the Demazure crystal B(2Λr+Λk)sk+1⋯sr−1sr such that the highest weight vector is mapped to Y:=Y1,r2Y2,k is as follows:
[TABLE]
Thus, we see that
[TABLE]
where each coefficient C(b) is either 1 or 2. Similarly, we also see that
[TABLE]
where μ′ is the monomial realization of the crystal base B(Λk−1+Λr−1) in our claim. Hence, we obtain (6.8).
Finally, we prove (6.10). Applying the mutation μr−1 to the diagram (7.9), we obtain the mutation diagram of μr−1μr−2⋯μk+1μk(Σ0):
[TABLE]
This diagram says that
[TABLE]
Using (7.11) and (7.1), the following holds:
[TABLE]
Applying this to (7.17), it is easy to see that
[TABLE]
which means (6.10).
[Proof of Theorem 6.3 (iv).]
We put A:=1+A1,r−1−1+A1,r−1−1A1,r−2−1+⋯+A1,r−1−1A1,r−2−1⋯A1,k+1−1.
It now follows at once from (7.1) and (\refB−lem2pr−7) that
[TABLE]
[TABLE]
To prove (4), we use the induction on (k−j). First, we consider the case k−j=1. Applying the mutation μr to (7.16), one can verify that the vertices and arrows around (φV)k−1 in the mutation diagram of μrμr−1⋯μk+1μk(Σ0) are as follows (Lemma 4.11):
[TABLE]
Therefore, the cluster variable (φμk−1μrμr−1⋯μk+1μk(V)G)k−1 is
[TABLE]
Substituting (7.19), (7.20) and (φVG)k−2=aΛk−2−Λk−1Y2,kY2,k−1(φVG)k−1−aΛk−2Y2,kY1,k−1Y2,k−1 (7.6) for (7.21), we get
[TABLE]
Thus, we obtain (4) for j=k−1.
Next, we consider the case k−j>1. The vertices and arrows around (φV)j in the mutation diagram of μj+1⋯μk−2μk−1μr⋯μk+1μk(Σ0) are as follows:
[TABLE]
By this diagram and the induction hypothesis,
[TABLE]
Hence, we obtain (4). By using (4), it is easy to see that
[TABLE]
Just as in the proof of (7.15), we obtain
[TABLE]
where μ is the monomial realization in our claim, and each coefficient C(b) is either 1 or 2. Similarly, we also obtain
[TABLE]
Therefore, we have (4).
7.2 The proof of Theorem 6.4
Next, let us prove Theorem 6.4. It will be proved in a similar way to Theorem 6.3. Let G=Sp2r. First, we set the Laurent monomials as follows:
[TABLE]
where for 1≤l≤r, set ∣l∣=∣l∣=l. The mutation diagram (Definition 4.10) of the initial seed Σ0 is
[TABLE]
Proposition 7.3**.**
- (i)
For k∈[1,r],
the initial cluster variables (φVG)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) in Theorem 6.4 (i), C(b) are some positive integers.
2. (ii)
For k∈[1,r], the frozen cluster variables (φVG)−k(a;Y), (φVG)r+k(a;Y) in C[Ge,c2] are described as
[TABLE]
[Proof.]
For 1≤k≤r−1, we can prove
[TABLE]
by the same argument as in Proposition 7.1.
Next, let us consider the case k=r. Just as in (7.2), it follows
[TABLE]
Using the bilinear form in 4.3, the cluster variable (φVG)r(a;Y) is described as
[TABLE]
Using (\refC−wtv), (\refC−f1) and (\refC−f2) repeatedly, one obtain
[TABLE]
which means that α1∨(Y1,1)y1(Y1,1)⋯αr∨(Y1,r)yr(Y1,r)v1∧⋯∧vr is a linear combination of v1∧⋯∧vr and v1∧⋯∧vs∧vs+2∧⋯∧vr∧vt+1 (0≤s,t≤r−1) with the coefficients C(1,1)C(1,2)⋯C(1,r) and C(1,1)C(1,2)⋯C(1,s)Y1,t, respectively. Similarly, we see that the coefficient of v2∧⋯∧vr∧v1 in α1∨(Y2,1) y1(Y2,1)⋯αr∨(Y2,r)yr(Y2,r)v1∧⋯∧vr is 1, and the coefficient in α1∨(Y2,1)y1(Y2,1)⋯αr∨(Y2,r)yr(Y2,r)v1∧⋯∧vs∧vs+2∧⋯∧vr∧vt+1 is C(2,s+2)⋯C(2,r)Y2,t+1−1. By the above argument, we obtain
[TABLE]
From Theorem 5.4, the conclusion (φVG)r(a;Y)=aΛr∑b∈B(Λk)c>r2C(b)μ(b) follows, where each coefficient C(b) is either 1 or 2. Thus, we obtain the claim (i). By the same argument, we can also obtain (ii).
By the same way as in (7.6), we see that for k∈[1,r−2],
[TABLE]
Lemma 7.4**.**
For k∈[1,r], the cluster variables (φμkμk+1⋯μr(V)G)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
[Proof.]
Using the mutation diagram (7.24), we can prove this lemma in the same way as Lemma 7.2.
[Proof of Theorem 6.4 (ii) and (iii).]
Our claim (ii) is obtained by the same calculation as in Theorem 6.3 (ii). So let us consider the claim (iii). By Lemma 4.11, the mutation diagram of μr−2⋯μk+1μk(Σ0) is as follows:
[TABLE]
From this diagram, we have
[TABLE]
Using the notation A:=(1+A1,k−1−1+A1,k−1−1A1,k−2−1+⋯+A1,k−1−1A1,k−2−1⋯A1,1−1),
we can write
[TABLE]
Note that by (7.2) and (6.13),
[TABLE]
and by (7.2) and (7.26),
[TABLE]
Substituting (7.29), (7.30) and (7.31) for (7.28), we get
[TABLE]
which implies (6.15).
Next, let us consider the cluster variable (φμrμr−1⋯μk+1μk(V)G)r(a;Y).
The mutation diagram of μr−1⋯μk+1μk(Σ0) is as follows:
[TABLE]
Thus,
[TABLE]
From (7.31) and (7.2), we see that
[TABLE]
Since we know that (φVG)k−1=aΛk−1Y1,k−1A (7.2), from (7.34), one obtain
[TABLE]
By (7.2) and (7.26), we get
[TABLE]
and
[TABLE]
Thus, it follows
[TABLE]
From this explicit formula, the conclusion (6.17) follows.
[Proof of Theorem 6.4 (iv).]
To prove our claim, we use the induction on (k−j). First, let k−j=1. It follows by Lemma 4.11 that the mutation diagram of μrμr−1⋯μk+1μk(Σ0) is
[TABLE]
which means that
[TABLE]
By (7.31) and (7.2), we get
[TABLE]
and (7.35) implies that
[TABLE]
As have seen in (7.27), it follows that
[TABLE]
By using the formulas (\refC−lem3−pr1) and (\refC−lem3−pr2), we get
[TABLE]
where we use (7.2) and (6.16) in the second equality. Thus, we obtain our claim (4) for j=k−1.
Next, we assume k−j>1. The mutation diagram of μj+1⋯μk−2μk−1μrμr−1⋯μk+1μk(Σ0) is the same form as in (7.22), which means
[TABLE]
By the induction hypothesis, we get
[TABLE]
Since the equation (φVG)j−1=aΛj−1−ΛjY2,j+1Y2,j(φVG)j−aΛj−1Y2,j+1Y1,jY2,j holds from (\reftwovarsC), it follows by (7.2) and (7.2) that
[TABLE]
where we use (7.2) in the second equality, and use (7.2) in the third equality. Thus, we get (4), and one can rewrite it as follows:
[TABLE]
where each coefficient C(b) is either 1 or 2. Thus, we obtain
(4) in the same way as (7.15).
7.3 The proof of Theorem 6.5
In this final subsection, we shall prove Theorem 6.5. Let G=SO2r. The mutation diagram of the initial seed Σ0 is
[TABLE]
First, we can prove the following proposition in a similar way to Proposition 7.1 and 7.3.
Proposition 7.5**.**
- (i)
For k∈[1,r],
the initial cluster variables (φVG)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
where μ:B(Λk)→Y is the monomial realization of B(Λk) in Theorem 6.5 (i).
2. (ii)
For k∈[1,r], the frozen cluster variables (φVG)−k(a;Y), (φVG)r+k(a;Y) in C[Ge,c2] are described as
[TABLE]
For k∈[1,r−1], just as in (1), (7.1) and (7.2), we see that
[TABLE]
and
[TABLE]
Considering (7.40), we see that for k∈[1,r−2],
[TABLE]
Lemma 7.6**.**
- (i)
[TABLE]
2. (ii)
For k∈[1,r−2], the cluster variables (φμkμk+1⋯μr−3μr−2μrμr−1(V)G)k(a;Y) in C[Ge,c2] are
described as
[TABLE]
[Proof.]
(i) The mutation diagram (7.39) and the equation (7.40) say that
[TABLE]
Next, the mutation diagram of μr−1(Σ0) is as follows by Lemma 4.11:
[TABLE]
Hence, by a calculation similar to the one of (φμr−1(V)G)r−1, we obtain (φμrμr−1(V)G)r(a;Y)=aΛr−2Y2,r.
(ii) We use the induction on (r−2−k). First, let r−2−k=0, so that k=r−2. The mutation diagram of μrμr−1(Σ0) is
[TABLE]
which yields
[TABLE]
where we use (7.40) in the second equality.
Next, let r−2−k>0. The vertices and arrows around the vertex (φVG)k in the mutation diagram of μk+1μk+2⋯μr−3μr−2μrμr−1(Σ0) are
[TABLE]
Hence,
[TABLE]
where we use the induction hypothesis and (7.40) in the second equality.
[Proof of Theorem 6.5 (ii) and (iii).]
The claim (ii) is obtained by the same calculation as in Theorem 6.3 (ii). So let us consider the claim (iii).
First, by Lemma 4.11, the mutation diagram of μr−3⋯μk+1μk(Σ0) is
[TABLE]
From this diagram,
[TABLE]
Using (6.20) for l=r−3, we obtain
[TABLE]
where we use (7.40) in the second equality. Similarly, using (7.40) and (7.41), we also get
[TABLE]
Applying these formulas to (7.43), it follows
[TABLE]
By this explicit formula, the conclusion (3) follows.
[Proof of Theorem 6.5 (iv)]
The vertices and arrows around (φV)r−1 in the mutation diagram of μr−2μr−3⋯μk+1μk(Σ0) are
[TABLE]
which yields
[TABLE]
It follows from (7.40) and (7.3) that
[TABLE]
Substituting this for (7.46), we see that
[TABLE]
which implies (6.25).
Finally, we consider the cluster variable (φμrμr−1⋯μk+1μk(V)G)r(a;Y). The mutation diagram of μr−1μr−2μr−3⋯μk+1μk(Σ0)
[TABLE]
implies that
[TABLE]
From (7.3), by the same way as in (7.3), we can prove the following:
[TABLE]
Substituting this for (7.48), we obtain
[TABLE]
which means (6.27).
[Proof of Theorem 6.5 (v).]
Using the induction on (k−j), we shall prove (5). First, let k−j=1. The vertices and arrows around (φV)k−1 in the mutation diagram of μrμr−1μr−2⋯μk+1μk(Σ0) are
[TABLE]
means that
[TABLE]
The explicit form (3) of (φμr−2⋯μk+1μk(V)G)r−2 can be rewritten as
[TABLE]
by using (7.40), (6.24) and (6.26). Applying this and (φVG)k−2=aΛk−2−Λk−1Y2,kY2,k−1(φVG)k−1−aΛk−2Y2,kY1,k−1Y2,k−1 (7.42) to (7.49), we obtain
[TABLE]
Next, let us consider the case k−j>1. The vertices and arrows around (φV)j in the mutation diagram of μj+1⋯μk−2μk−1μrμr−1⋯μk+1μk(Σ0) are as follows:
[TABLE]
This diagram says that
[TABLE]
It follows by induction hypothesis that
[TABLE]
Furthermore, we know that (φVG)j−1=aΛj−1−ΛjY2,j+1Y2,j(φVG)j−aΛj−1Y2,j+1Y1,jY2,j. Thus, taking (7.3) and (7.51) into account, we obtain
[TABLE]
which is our desired result. The description (6.29) immediately follows from (5).