This paper studies the structure of Lakshmibai-Seshadri paths for a specific class of hyperbolic Kac-Moody algebras of rank 2, proving connectivity of the crystal graph and providing explicit descriptions.
Contribution
It establishes the connectivity of the crystal graph for Lakshmibai-Seshadri paths of a particular weight in hyperbolic Kac-Moody algebras of rank 2 and offers explicit characterizations.
Findings
01
The crystal graph of Lakshmibai-Seshadri paths is connected.
02
Explicit descriptions of paths of shape λ are provided.
03
The results apply to hyperbolic Kac-Moody algebras of rank 2.
Abstract
Let g be a hyperbolic Kac-Moody algebra of rank 2, and set λ:=Λ1−Λ2, where Λ1,Λ2 are the fundamental weights for g; note that λ is neither dominant nor antidominant. Let B(λ) be the crystal of all Lakshmibai-Seshadri paths of shape λ. We prove that (the crystal graph of) B(λ) is connected. Furthermore, we give an explicit description of Lakshmibai-Seshadri paths of shape λ.
Equations106
A=(2−b−a2)(a,b∈Z≥0,ab>4).
A=(2−b−a2)(a,b∈Z≥0,ab>4).
A=(2−b−a2),wherea,b∈Z>0andab>4,
A=(2−b−a2),wherea,b∈Z>0andab>4,
xm:={(r2r1)kr1(r2r1)kif m=2k with k∈Z≥0,if m=2k+1 with k∈Z≥0.
xm:={(r2r1)kr1(r2r1)kif m=2k with k∈Z≥0,if m=2k+1 with k∈Z≥0.
ym:={(r1r2)kr2(r1r2)kif m=2k with k∈Z≥0,if m=2k+1 with k∈Z≥0.
ym:={(r1r2)kr2(r1r2)kif m=2k with k∈Z≥0,if m=2k+1 with k∈Z≥0.
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Nonlinear Waves and Solitons
Full text
Lakshmibai-Seshadri paths for
hyperbolic Kac-Moody algebras of rank 2
Dongxiao Yu
Abstract
Let g be a hyperbolic Kac-Moody algebra of rank 2, and set λ:=Λ1−Λ2, where Λ1,Λ2 are the fundamental weights for g; note that λ is neither dominant nor antidominant. Let B(λ) be the crystal of all Lakshmibai-Seshadri paths of shape λ. We prove that (the crystal graph of) B(λ) is connected. Furthermore, we give an explicit description of Lakshmibai-Seshadri paths of shape λ.
Graduate School of Pure and Applied Sciences, University of Tsukuba,
Let g be a symmetrizable Kac-Moody algebra over C with h the Cartan subalgebra. We denote by W the Weyl group of g. Let P be an integral weight lattice of g, P+ the set of dominant integral weights, and −P+ the set of antidominant weights.
In [L1, L2], Littelmann introduced the notion of Lakshmibai-Seshadri (LS for short) paths of shape λ∈P, and gave the set B(λ) of all LS paths of shape λ a crystal structure.
Kashiwara [Ka3] and Joseph [J] proved independently that if λ∈P+ (resp., λ∈−P+), then B(λ) is isomorphic, as a crystal, to the crystal basis of the integrable highest (resp., lowest) weight module of highest weight (resp., lowest weight) λ.
Since B(λ)=B(wλ) for every λ∈P and w∈W by the definition of LS paths, we can easily see that if λ∈P satisfies Wλ∩P+=∅ (resp., Wλ∩(−P+)=∅), then B(λ) is isomorphic, as a crystal, to the crystal basis of an integrable highest (resp., lowest) module.
Here are natural questions: How are the crystal structure of B(λ) and its relation to the representation theory in the case that λ∈P satisfies Wλ∩(P+∪(−P+))=∅ ?
If g is of finite type, then there is no λ∈P such that Wλ∩(P+∪(−P+))=∅; it is well-known that Wλ∩P+=∅ for any λ∈P.
Assume that g is of affine type, and let c∈h be the canonical central element of g. Then, Wλ∩(P+∪(−P+))=∅ if and only if (λ=0, and) ⟨λ,c⟩=0. Naito and Sagaki proved in [NS1] and [NS2] that if λ is of the form: λ=mϖi, where m∈Z≥1 and ϖi is the level-zero fundamental weight (note that ⟨ϖi,c⟩=0), then B(mϖi) is isomorphic, as a crystal, to the crystal basis B(mϖi) of the extremal weight module of extremal weight mϖi over the quantum affine algebra Uq(g).
Here, (for an arbitrary symmetrizable Kac-Moody algebra g and an arbitrary integral weight λ∈P for g,) the extremal weight module of extremal weight λ is the integrable Uq(g)-module generated by a single element vλ with the defining relation that “vλ is an extremal weight vector of weight λ”; this module was introduced by Kashiwara [Ka1, §8] as a natural generalization of integrable highest (or lowest) weight modules, and has a crystal basis B(λ) ([Ka1, §8]). Then, in [NS3], they determined the crystal structure of B(λ) for general λ∈P such that ⟨λ,c⟩=0, and in [INS], they proved that there exists a canonical surjective (not bijective in general) strict morphism of crystals from B(λ) onto B(λ).
So, in this paper, we consider the case where g=g(A) is a hyperbolic Kac-Moody algebra of rank 2, associated to the generalized Cartan matrix
[TABLE]
Let Λ1,Λ2 be the fundamental weights for g, and set λ:=Λ1−Λ2. In Proposition 3.1.1, we prove that Wλ∩(P+∪(−P+))=∅ if a,b≥2; in fact, if a=1 (resp., b=1), then Wλ∩P+=∅ (resp., Wλ∩(−P+)=∅); see Remark 3.1.2. Then we prove the following theorem.
Theorem 1**.**
The crystal graph of B(Λ1−Λ2) is connected.
Our weight λ=Λ1−Λ2 can be considered as an analog of the level-zero fundamental weight for a (rank 2) affine Lie algebra. So, in a future work, we will study, as in the affine case, the relation between B(Λ1−Λ2) and the crystal basis B(Λ1−Λ2) of the extremal weight module of extremal weight Λ1−Λ2. In (the proof of B(λ)≅B(λ) for λ∈P+ in [Ka3] and [J], and) the proof of B(ϖi)≅B(ϖi) in [NS1] and [NS2], the connectedness of these crystals played very important roles. Therefore, Theorem 1 will be strongly related to the representation theory.
Finally, in the case where a,b≥2, we give an explicit description of LS paths of shape Λ1−Λ2.
Theorem 2**.**
Assume that a,b≥2. An LS path of shape λ=Λ1−Λ2 is of the form (i) or (ii):
(i) (xm+s−1λ,…,xm+1λ,xmλ;σ0,σ1,…,σs), where m≥0,s≥1, and 0=σ0<σ1<⋯<σs=1 satisfy the condition that pm+s−uσu∈Z for 1≤u≤s−1.
(ii) (ym−s+1λ,…,ym−1λ,ymλ;δ0,δ1,…,δs), where m≥s−1,s≥1, and 0=δ0<δ1<⋯<δs=1 satisfy the condition that qm−s+u+1δu∈Z for 1≤u≤s−1.
Here, the elements xm,ym∈W,m≥0, are defined in (2.2), (2.3), and the sequences {pm}m≥0 and {qm}m≥0 are defined in (3.1), (3.2).
This paper is organized as follows. In Section 2, we fix our notation, and recall the definitions and several properties of LS paths. In Section 3, after showing some lemmas, we give a proof of Theorem 1. In Section 4, we give the explicit description of LS paths of shape λ=Λ1−Λ2 (Theorem 2), after showing some technical lemmas.
2 Preliminaries.
2.1 Hyperbolic Kac-Moody algebra of rank 2.
Let
[TABLE]
be a hyperbolic generalized Cartan matrix of rank 2. Let g=g(A) be the Kac-Moody algebra associated to A over C. Denote by h the Cartan subalgebra of g, {α1,α2}⊂h∗:=HomC(h,C) the set of simple roots, and {α1∨,α2∨}⊂h the set of simple coroots; we set I={1,2}.
We denote by W=⟨r1,r2⟩ the Weyl group of g, where ri is the simple reflection in αi for i=1,2; note that W={xm,ym∣m∈Z≥0}, where
[TABLE]
[TABLE]
Let Δre+ denote the set of positive real roots.
We see that
[TABLE]
where Zeven≥0 denotes the set of even nonnegative integers.
where the sequences {cj}j≥0 and {dj}j≥0 are defined by
[TABLE]
For a positive real root β∈Δre+, we denote by β∨ the dual root of β, and by rβ∈W the reflection in β.
Let Λ1,Λ2∈h∗ be the fundamental weights for g, i.e., ⟨Λi,αj∨⟩=δi,j for i,j=1,2, and set P:=ZΛ1⊕ZΛ2.
Let P+:=Z≥0Λ1+Z≥0Λ2⊂P be the set of dominant integral weights, and −P+ the set of antidominant integral weights.
2.2 Lakshmibai-Seshadri paths.
Let us recall the definition of Lakshmibai-Seshadri paths from [L2, §4].
Definition 2.2.1**.**
Let λ∈P be an integral weight. For μ,ν∈Wλ, we write μ≥ν if there exist a sequence μ=μ0,μ1,…,μr=ν of elements in Wλ and a sequence β1,β2,…,βr of positive real roots such that μk=rβk(μk−1) and ⟨μk−1,βk∨⟩<0 for k=1,2,…,r. The sequence μ0,μ1,…,μr above is called a chain for (μ,ν). If μ≥ν, then we define dist(μ,ν) to be the maximal length r of all possible chains for (μ,ν).
Remark 2.2.2**.**
Let μ,ν∈Wλ be such that μ>ν with dist(μ,ν)=1. Then there exists a unique β∈Δre+ such that rβ(μ)=ν.
Let λ∈P. The Hasse diagram of Wλ is, by definition, the Δre+-labeled, directed graph with vertex set Wλ, and edges of the following form: νβμ for μ,ν∈Wλ and β∈Δre+ such that μ>ν with dist(μ,ν)=1 and ν=rβ(μ).
Definition 2.2.3**.**
Let λ∈P,μ,ν∈Wλ with μ>ν, and 0<σ<1 a rational number. A σ-chain for (μ,ν) is, by definition, a decreasing sequence μ=μ0>μ1>⋯>μr=ν of elements in Wλ such that dist(μk−1,μk)=1 and σ⟨μk−1,βk∨⟩∈Z<0 for all k=1,2,…,r, where βk is the unique positive real root such that μk=rβk(μk−1).
Definition 2.2.4**.**
Let λ∈P. Let (ν;σ) be a pair of a sequence ν: ν1>ν2>⋯>νs of elements in Wλ and a sequence σ:0=σ0<σ1<⋯<σs=1 of rational numbers, where s≥1. The pair (ν;σ) is called a Lakshmibai-Seshadri (LS for short) path of shape λ, if for each k=1,2,…,s−1, there exists a σk-chain for (νk,νk+1). We denote by B(λ) the set of all LS paths of shape λ.
We identify π=(ν1,ν2,…,νs;σ0,σ1,…,σs)∈B(λ) with the following piecewise-linear continuous map π:[0,1]→R⊗ZP:
[TABLE]
Now, we endow B(λ) with a crystal structure as follows ; for the axiom of crystal, see [HK, Definition 4.5.1].
First, we define wt(π):=π(1) for π∈B(λ); we know from [L2, Lemma 4.5] that π(1)∈P. Next, for π∈B(λ) and i∈I, we define
in particular, miπ is a nonpositive integer, and Hiπ(1)−miπ is a nonnegative integer.
We define eiπ as follows: If miπ=0, then we set eiπ:=0, where 0 is an extra element not contained in any crystal. If miπ≤−1, then we set
Let π∈B(λ), and i∈I. If ⟨κ(π),αi∨⟩>0, then κ(fimax(π))=riκ(π). If ⟨ι(π),αi∨⟩<0, then ι(eimax(π))=riι(π).
3 Connectedness of the crystal B(Λ1−Λ2).
3.1 An integral weight whose Weyl group orbit does not intersect with neither P+ nor −P+.
If λ∈P+ (resp., λ∈−P+), then B(λ) is isomorphic, as a crystal, to the crystal basis of the integrable highest (resp., lowest) weight module of highest (resp., lowest) weight λ (see Kashiwara [Ka1] and Joseph [J]). Also, we see by the definition of LS paths that B(wλ)=B(λ) for every λ∈P and w∈W. Hence, if λ∈P satisfies Wλ∩P+=∅(resp.,Wλ∩(−P+)=∅), then B(λ) is isomorphic to the crystal basis of an integrable highest (resp., lowest) weight module. So, we focus on the case that λ∈P satisfies Wλ∩(P+∪(−P+))=∅. The following proposition gives a “fundamental” example of such λ.
Proposition 3.1.1**.**
Assume that a,b=1 in (2.1). If λ=Λ1−Λ2, then Wλ∩(P+∪(−P+))=∅.
Remark 3.1.2**.**
If a=1, then we have y1(Λ1−Λ2)=r2(Λ1−Λ2)=Λ2∈P+. If b=1, then we have x1(Λ1−Λ2)=r1(Λ1−Λ2)=−Λ1∈−P+.
Keep the setting in Proposition 3.1.1. We define {pm}m∈Z≥0 and {qm}m∈Z≥0 by:
[TABLE]
[TABLE]
Then we see that 1=p0=p1≤p2<p3<⋯ and 1=q0=q1≤q2<q3<⋯; note that p1=p2 if and only if b=2, and q1=q2 if and only if a=2. Proposition 3.1.1 follows immediately from the following lemmas and the fact that W={xm,ym∣m∈Z≥0} (see (2.2) and (2.3)).
Lemma 3.1.3**.**
Keep the setting in Proposition 3.1.1. For m∈Z≥0,
[TABLE]
[TABLE]
Proof.
We give a proof only for (3.3); the proof for (3.4) is similar. We show (3.3) by induction on m. If m=0 or m=1, then (3.3) is obvious. Assume that m>1. If m is even, then
[TABLE]
Since m is even, we have bpm+1−pm=pm+2 by the definition (3.1). Therefore, we obtain
xm+1λ=−pm+1Λ1+pm+2Λ2, as desired.
If m is odd, then
[TABLE]
Since m is odd, we have apm+1−pm=pm+2 by the definition (3.2). Therefore, we obtain
xm+1λ=pm+2Λ1−pm+1Λ2, as desired.
∎
3.2 Connectedness.
Theorem 3.2.1**.**
The crystal graph of B(Λ1−Λ2) is connected.
If a=1 or b=1, then B(Λ1−Λ2) is connected by Remark 3.1.2, together with the argument preceding Proposition 3.1.1. Therefore, in what follows, we assume that a,b=1.
In order to prove Theorem 3.2.1 in this case, we need some lemmas; we set λ=Λ1−Λ2.
Lemma 3.2.2**.**
Let m∈Z≥0, and β∈Δre+.
(1) Assume that m is even. Then, ⟨xmλ,β∨⟩∈Z<0 if and only if β=xl(α2) or yl+1(α1) for some l∈Zeven≥0.
(2) Assume that m is odd. Then, ⟨xmλ,β∨⟩∈Z<0 if and only if β=yl(α1) or xl+1(α2) for some l∈Zeven≥0.
Proof.
We give a proof only for part (1); the proof for part (2) is similar. First we show the “if” part of part (1). Let l∈Zeven≥0. We have ⟨xmλ,xl(α2∨)⟩=⟨xl−1xmλ,α2∨⟩. Here, if m≥l (resp., m≤l), then xl−1xm is equal to xm−l (resp., yl−m). Therefore, by (3.3), we have ⟨xmλ,xl(α2∨)⟩=−pm−l∈Z<0 (resp., =−ql−m+1∈Z<0). Similarly, we can show that ⟨xmλ,yl+1(α1∨)⟩<0.
Next, we show that the “only if ” part of part (1); by (2.4), it suffices to show that if β=xl+1(α2) or yl(α1) for l∈Zeven≥0, then ⟨xmλ,β∨⟩>0. We have ⟨xmλ,xl+1(α2∨)⟩=⟨xl+1−1xmλ,α2∨⟩=⟨xm+l+1λ,α2∨⟩. By (3.3), we have ⟨xmλ,xl+1(α2∨)⟩=pm+l+2>0. Similarly, we can show that ⟨xmλ,yl(α1∨)⟩>0. This completes the proof of the lemma.
∎
The next lemma can be shown in exactly the same way as Lemma 3.2.2.
Lemma 3.2.3**.**
Let m∈Z≥0 and β∈Δre+.
(1) Assume that m is even. Then, ⟨ymλ,β∨⟩∈Z<0 if and only if β=xl(α2) or yl+1(α1) for some l∈Zeven≥0.
(2) Assume that m is odd. Then, ⟨ymλ,β∨⟩∈Z<0 if and only if β=yl(α1) or xl+1(α2) for some l∈Zeven≥0.
Lemma 3.2.4**.**
(1) For m∈Z≥1, we have xmλ>xm−1λ with dist(xmλ,xm−1λ)=1. And rixmλ=xm−1λ, where i=\begin{cases}2&(\text{if mis even}),\\
1&(\text{ifm is odd}).\end{cases}
(2) For m∈Z≥1, we have ym−1λ>ymλ with dist(ym−1λ,ymλ)=1. And rjymλ=ym−1λ, where j=\begin{cases}1&(\text{if mis even}),\\
2&(\text{ifm is odd}).\end{cases}
Proof.
We give a proof only for part (1); the proof for part (2) is similar.
We see from Lemma 3.2.2 that ⟨xmλ,αi∨⟩<0. Therefore, we obtain that xmλ>rixmλ=xm−1λ. Since ⟨xm−1λ,αi∨⟩>0, we see by [L2, §4 Lemma 4.1] that dist(rixmλ,xm−1λ)=dist(xmλ,xm−1λ)−1. Since dist(rixmλ,xm−1λ)=dist(xm−1λ,xm−1λ)=0, we obtain dist(xmλ,xm−1λ)=1, as desired.
∎
Proposition 3.2.5**.**
The Hasse diagram of Wλ is
[TABLE]
Proof.
Let μ,ν∈Wλ be such that μ>ν with dist(μ,ν)=1, and let β∈Δre+ be the (unique) positive real root such that ν=rβμ; by Lemma 3.2.4, it suffices to show that β=α1 or α2. By Lemma 3.2.2, if μ=xmλ and m is even, then β=xl(α2) or yl+1(α1) for some l∈Zeven≥0. Assume that β=xl(α2) for some l∈Zeven≥0; note that rβ=(r2r1)2lr2(r1r2)2l. We see from Lemma 3.2.4 that there exist a directed path
[TABLE]
of length 2l+1 from μ to ν in the Hasse diagram of Wλ. Because dist(μ,ν)=1 by assumption, we obtain l=0, and hence β=α2.
Assume that β=yl+1(α1) for some l∈Zeven≥0; note that r2(r1r2)2lr1(r2r1)2lr2.
By the same reasoning as above, there exists a direct path of length 2l+3>1 from μ to ν in the Hasse diagram of Wλ. However, this contradicts the assumption that dist(μ,ν)=1.
Similarly, we can show that if μ=xmλ and m is odd, then β=α1. Also, we can show the assertion for the case that μ=ymλ in exactly the same way as above. This completes the proof of the proposition.
∎
Lemma 3.2.6**.**
For any rational number 0<σ<1 and any μ,ν∈Wλ such that μ>ν, there does not exist a σ-chain μ=μ0>⋯>μr=ν for (μ,ν) such that μk=λ for some 0≤k≤r.
Proof.
Suppose that μk=λ for some 0≤k≤r. Note that r≥1 since μ>ν. If k<r (resp., k>0), then it follows from Proposition 3.2.5 that μk+1=r2λ (resp., μk−1=r1λ) since dist(μk,μk+1)=1 (resp., dist(μk−1,μk)=1) by the assumption of the σ-chain. Thus, we obtain σ=−σ⟨λ,α2∨⟩∈Z (resp., σ=σ⟨λ,α1∨⟩∈Z), which contradicts the assumption 0<σ<1. If k=0 or k=r, it is clear that σ=−σ⟨λ,α2∨⟩∈Z or σ=−σ⟨r1λ,α1∨⟩∈Z by Proposition 3.2.5. This also contradicts the assumption. Thus, the lemma has been proved.
∎
The next proposition follows immediately from Lemma 3.2.6 and the definition of LS paths.
Proposition 3.2.7**.**
Let π=(ν1,…,νs;σ0,…,σs)∈B(λ). If νu=λ for some 1≤u≤s, then s=1 and π=(λ;0,1).
We show that every π∈B(λ) is connected to (λ;0,1)∈B(λ) in the crystal graph of B(λ). Assume first that ι(π)=xmλ for some m∈Z≥0. We show by induction on m that π is connected to (λ;0,1). If m=0, then the assertion follows immediately from Proposition 3.2.7. Assume that m>0. Define
[TABLE]
note that ⟨xmλ,αi∨⟩<0 and rixmλ=xm−1λ (see Lemma 3.2.4). By Lemma 2.2.6, ι(eimaxπ)=riι(π)=rixmλ=xm−1λ.
By the induction hypothesis, eimaxπ is connected to (λ;0,1), and hence so is π.
Assume next that ι(π)=ymλ for some m∈Z≥0. Since κ(π)≤ι(π) by the definition of an LS path, we see by Proposition 3.2.5 that κ(π)=ykλ for some k≥m. Hence it suffices to show that if π∈B(λ) satisfies that κ(π)=ykλ for some k∈Z≥0, then π is connected to (λ;0,1). If k=0, then the assertion follows immediately from Proposition 3.2.7. Assume that k>0. Define
[TABLE]
note that ⟨ykλ,αj∨⟩>0 and rjykλ=yk−1λ. By Lemma 2.2.6,
κ(fjmaxπ)=rjκ(π)=rjykλ=yk−1λ.
By the induction hypothesis, fjmaxπ is connected to (λ;0,1), and hence so is π.
Thus, we have proved Theorem 3.2.1.
∎
4 Explicit descriptions of the LS paths and the root operators.
4.1 Explicit description of the LS paths.
Throughout this section, we assume that a,b=1 in (2.1). Recall that the sequences {pm}m∈Z≥0 and {qm}m∈Z≥0 are defined in (3.1) and (3.2), respectively.
Lemma 4.1.1**.**
For each k≥0, the numbers pk and pk+1 are relatively prime. Also, the numbers qk and qk+1 are relatively prime.
Proof.
We give a proof only for pk and pk+1; the proof for qk and qk+1 is similar.
Suppose that the assertion is false, and let m be the minimum k≥0 such that pk and pk+1 have a common divisor greater than 1. Let d∈Z>1 be a common divisor of pm and pm+1. Since
[TABLE]
we can deduce that pm and pm−1 have the same common divisor d, which contradicts the minimality of m. Thus, we have proved the lemma.
∎
Theorem 4.1.2**.**
(1) Let 0<σ<1 be a rational number, and let μ,ν∈Wλ be such that μ>ν. If μ=μ0>μ1>⋯>μt=ν is a σ-chain for (μ,ν), then t=1.
(2) An LS path π of shape λ=Λ1−Λ2 is either of the form (i) or (ii):
(i) (xm+s−1λ,…,xm+1λ,xmλ;σ0,σ1,…,σs), where m≥0,s≥1, and 0=σ0<σ1<⋯<σs=1 satisfy the condition that pm+s−uσu∈Z for 1≤u≤s−1.
(ii) (ym−s+1λ,…,ym−1λ,ymλ;δ0,δ1,…,δs), where m≥s−1,s≥1, and 0=δ0<δ1<⋯<δs=1 satisfy the condition that qm−s+u+1δu∈Z for 1≤u≤s−1.
Proof.
(1) Suppose that t≥2. Assume first that μ0=xmλ; by Lemma 3.2.6, we have m≥3. Since dist(μ0,μ1)=dist(μ1,μ2)=1 by the definition of a σ-chain, we see by Proposition 3.2.5 that μ1=xm−1λ and μ2=xm−2λ. Take i,j∈{1,2} such that μ1=riμ0 and μ2=rjμ1. Then, by Lemma 3.1.3,
[TABLE]
Since −pm and −pm−1 are relatively prime (see Lemma 4.1.1), there does not exist a 0<σ<1 satisfying the condition that both −σpm and −σpm−1 are integers. This contradicts our assumption that μ=μ0>μ1>⋯>μt=ν is a σ-chain for (μ,ν). Similarly, we can get a contradiction also in the case of μ0=ymλ for some m∈Z≥1. Thus, we have proved (1).
(2) Let π=(ν1,…,νs;σ0,…,σs)∈B(λ). Assume first that νs=xmλ for some m≥0. Since ν1>ν2>⋯>νs=xmλ by the definition of an LS path, we see by Proposition 3.2.5 that
[TABLE]
for some k1>k2>⋯>ks−1>m. Here we recall that there exists a σs−1-chain for (νs−1,νs)=(xks−1λ,xmλ) by the definition of an LS path.
By (1), we see that the length of this σs−1-chain is equal to 1, which implies that dist(νs−1,νs)=dist(xks−1λ,xmλ)=1. Hence it follows from Proposition 3.2.5 that ks−1=m+1. Take i∈I such that xmλ=rixm+1λ. Then, by the definition of a σs−1-chain, we have σs−1⟨xm+1λ,αi∨⟩∈Z. Since ⟨xm+1λ,αi∨⟩=−pm+1 by (3.3), we obtain pm+1σs−1∈Z. By repeating this argument, we deduce that ku=m+s−u and pm+s−uσu∈Z for every 1≤u≤s−1. Hence, π is of the form (i).
Assume next that νs=ymλ for some m≥0. Suppose that (s≥2 and) there exists 1≤u≤s−1 such that νu+1=ykλ for some k≥0, but νu=xlλ for some l≥0. By the definition of an LS path, there exists a δu-chain for (νu,νu+1). Then, by (1), the length of this δu-chain is equal to 1, which implies that dist(νu,νu+1)=dist(xlλ,ykλ)=1. By the Hasse diagram in Proposition 3.2.5, we see that (l,k)=(1,0) or (0,1) Since x0λ=y0λ=λ, it follows form Proposition 3.2.7 that s=1, which contradicts s≥2. Therefore, we conclude that
[TABLE]
where 0≤k1<k2<⋯<ks−1<ks=m. By the same argument as above, we deduce that ku=m−s+u and qm−s+u+1δu∈Z. Hence, π is of the form (ii). This completes the proof of Theorem 4.1.2.
∎
4.2 Explicit description of the root operators.
As an application of Theorem 4.1.2, we give an explicit description of the root operators ei and fi,i=1,2. First, let π∈B(λ) be of the form (i) in Theorem 4.1.2(2).
We set
Note that ±⟨xuλ,αi∨⟩>0 if and only if ∓⟨xuλ,αi∨⟩>0 for each u∈Z≥0. Thus we see (cf. (2.5)) that
[TABLE]
Let us give an explicit description of fiπ. We set
[TABLE]
if u0=s, then fiπ=0. Assume that 0≤u0≤s−1; we see that σu0 is equal to t0 in (2.9). By fact (2.10), we deduce that t1 in (2.9) is equal to
[TABLE]
which satisfies σu0<σu0′≤σu0+1; notice that if σu0′=σu0+1, then u0=s−1, and hence σu0′=σs=1.
We have
[TABLE]
Similary, we give an explicit description of eiπ as follows. We set
[TABLE]
if u1=0, then eiπ=0. Assume that 1≤u1≤s; we see that σu1 is equal to t1 in (2.7). By fact (2.8), we deduce that t1 in (2.7) is equal to
[TABLE]
which satisfies σu1−1≤σu1′≤σu1; notice that if σu1′=σu1−1, then u1=1 and hence σu1′=σ0=0.
We have
[TABLE]
Note that x−1λ=y1λ.
Example 4.2.1**.**
Let
[TABLE]
note that m=2 and s=3 in Theorem 4.1.2 (i).
Let us compute fiπ,i=1,2, using formula (4.1).
If i=1, then we have u0=2,σu0′=p33 if a=2 and u0=0,σu0′=p51 if a≥3. (Note that p33=1 if b=3.) Thus,
[TABLE]
remark that if a=2, then b>3. If i=2, then we have u0=1,σu0′=p42. Thus,
[TABLE]
Next, let π∈B(λ) be of the form (ii) in Theorem 4.1.2 (2). By a similar argument to above, we have the following explicit descriptions of fiπ and eiπ.
We set
Let us give an explicit description of fiπ. We set
[TABLE]
if v0=s, then fiπ=0. Assume that 0≤v0≤s−1. we set
[TABLE]
We have
[TABLE]
Note that y−1λ=x1λ.
Similarly, we give an explicit description of eiπ as follows. We set
[TABLE]
if v1=0, then eiπ=0. Assume that 1≤v1≤s. We set
[TABLE]
We have
[TABLE]
Acknowledgment.
The author is grateful to Professor Daisuke Sagaki, her supervisor, for suggesting the topic treated in this paper and lending his expertise especially through the study of the connectedness of LS paths as a crystal graph. Also, she thanks the referee for giving her valuable comments.
Bibliography13
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[HK] J. Hong, S.-J. Kang, Introduction to Quantum Groups and Crystal Bases, Graduate Studies in Mathematics, 42, American Mathematical Society, USA, 2002.
2[INS] M. Ishii, S. Naito, D.Sagaki, Semi-infinite Lakshmibai-Seshadri path model for level-zero extremal weight modules over quantum affine algebras, Adv. Math., 2016, pp. 967–1009.
3[J] A. Joseph, Quantum Groups and Their Primitive Ideals, Ergebnisse der Mathemtik und ihrer Grenzgebiete (3), 29, Springer-Verlag, Berlin, 1995.
4[Ka 1] M. Kashiwara, Crystal bases of modified quantized enveloping algebra, Duke Math., 73, 1994, pp.383–413.
5[Ka 2] M. Kashiwara, On crystal bases, CMS Conf. Proc., 16, 1995, pp.155–197.
6[Ka 3] M. Kashiwara, Similarity of crystal bases, (English summary) Lie algebras and their representation (Seoul, 1995), Contemp. Math., 194, 1996, pp.177–186.
7[Ka 4] M. Kashiwara, On level-zero representation of quantized affine algebras, Duke Math., 112, 2002, pp.117–175.
8[Kac] V. G. Kac, Infinite Dimensional Lie Algebras, 3rd ed., Cambridge University Press, Cambridge, UK, 1990.