This paper proves the existence of crystal pseudobases for certain Kirillov-Reshetikhin modules in exceptional affine types, using bilinear form evaluations and global bases of extremal weight modules.
Contribution
It establishes the existence of crystal pseudobases for near adjoint node modules in exceptional types, extending previous results to new cases.
Findings
01
Existence of crystal pseudobases for specific modules in types E6, E7, E8, F4, and E6^{(2)}.
02
Application of Kang et al.'s criterion using bilinear form evaluations.
03
Use of global bases of extremal weight modules to facilitate proofs.
Abstract
We prove that, in types E6,7,8(1), F4(1) and E6(2), every Kirillov--Reshetikhin module associated with the node adjacent to the adjoint one (near adjoint node) has a crystal pseudobase, by applying the criterion introduced by Kang et.al. In order to apply the criterion, we need to prove some statements concerning values of a bilinear form. We achieve this by using the global bases of extremal weight modules.
Tables1
Table 1. Table 1. Explicit forms of θ 1 subscript 𝜃 1 \theta_{1} and θ J subscript 𝜃 𝐽 \theta_{J}
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.
Full text
Existence of Kirillov–Reshetikhin crystals
for near adjoint nodes in exceptional types
Katsuyuki Naoi
Institute of Engineering
Tokyo University of Agriculture and Technology
2-24-16 Naka-cho, Koganei-shi, Tokyo 184-8588, JAPAN
We prove that, in types E6,7,8(1), F4(1) and E6(2), every Kirillov–Reshetikhin module associated with the node adjacent to
the adjoint one (near adjoint node) has a crystal pseudobase,
by applying the criterion introduced by Kang et al.
In order to apply the criterion, we need to prove some statements concerning values of a bilinear form.
We achieve this by using the global bases of extremal weight modules.
Let g be an affine Kac–Moody Lie algebra, and denote by Uq′(g) the associated quantum affine algebra without the degree operator.
Kirillov–Reshetikhin (KR for short) modules are a distinguished family of finite-dimensional simple Uq′(g)-modules (see, for example, [CP94]).
In this article KR modules are denoted by Wr,ℓ, where r is a node of the Dynkin diagram of g except
the node [math] prescribed in [Kac90] and ℓ is a positive integer.
KR modules are known to have several good properties, such as their q-characters satisfy the T (Q, Y)-system relations, fermionic formulas for their graded characters, and so on (see [HKO*+*99, Nak03, Her06, Her10],
for example, and references therein).
Another important (conjectural) property of a KR module is the existence of a crystal base in the sense of Kashiwara, which was presented in [HKO*+*99, HKO*+*02].
In this article, we mainly consider a slightly weaker version of the conjecture, the existence of a crystal pseudobase (crystal base modulo signs, see
Subsection 2.2).
If a given KR module Wr,ℓ is multiplicity free as a Uq(g0)-module, it is known to have a crystal pseudobase,
where g0 is the subalgebra of g whose Dynkin diagram is obtained from that of g by removing [math].
In nonexceptional types, in which all Wr,ℓ are multiplicity free, this was shown by Okado and Schilling [OS08].
Recently this was also proved for all multiplicity free Wr,ℓ of exceptional types by Biswal and the second author [BS20]
in a similar fashion.
On the other hand, if Wr,ℓ is not multiplicity free, then the conjecture has been solved in only a few cases so far.
Kashiwara showed for all affine types that all fundamental modules Wr,1 have crystal bases [Kas02], and in types G2(1) and D4(3), the first author verified the existence of a crystal pseudobase for all Wr,ℓ [Nao18].
We say a node r is near adjoint if the distance from [math] is precisely 2.
The goal of this paper is to show the conjecture for all KR modules associated with near adjoint nodes in exceptional types.
This has already been done in [Nao18] for types G2(1) and D4(3),
and our main theorem below covers all remaining types.
Theorem 1**.**
Assume that g is either of type En(1)(n=6,7,8), F4(1), or E6(2), and r is the near adjoint node.
Then for every ℓ∈Z>0, the KR module Wr,ℓ has a crystal pseudobase.
In particular, since a KR module Wr,ℓ in type E6(1) is multiplicity free if r is not the near adjoint node,
Theorem Theorem 1 solves the conjecture for all KR modules of this type.
As with previous works [OS08, Nao18, BS20], Theorem Theorem 1 is proved
by applying the criterion for the existence of a crystal pseudobase introduced in [KKM*+*92].
In our cases, however, this is much more involved and we need a new idea, which we will explain below.
By the criterion, the existence of a crystal pseudobase is reduced to showing that certain vectors
are almost orthonormal with respect to a prepolarization (bilinear form having some properties) and satisfy additional conditions concerning the values of the prepolarization.
In the previous works these statements were proved by directly calculating the values of the prepolarization (although in [Nao18]
the amount of calculations was reduced using an induction argument on ℓ).
However, this appears to be quite difficult to do in our cases.
Hence we apply a more sophisticated method using the global basis of an extremal weight module introduced by Kashiwara [Kas94].
For example, it is previously known that a global basis is almost orthonormal [Nak04], and therefore
the required almost orthonormality of given vectors is deduced by connecting them with a global basis.
The other conditions are also proved in a similar spirit.
Besides the KR modules treated in this paper,
there are several families of Wr,ℓ for which the existence of crystal pseudobases remain open:
r=3,5 in type E7(1), 3≤r≤7 in type E8(1), and r=3 in types F4(1) and E6(2),
where the labeling of nodes are given in Figure 1 in Subsection 3.1.
We hope to study these in our future work.
The paper is organized as follows.
In Section 2, we recall the basic notions needed in the proof of the main theorem.
In Subsection 3.1, we reduce the main theorem to three statements (C1)–(C3),
and these are proved in Subsections 3.2–3.4.
In Subsection 3.4, we use a certain relation (3.4.15) in Wr,ℓ,
whose proof is postponed to Appendix A since, while straightforward, it is slightly lengthy and technical.
Acknowledgments
The authors would like to thank Rekha Biswal for helpful discussions.
This work benefited from computations using SageMath [Sage19].
The first author was supported by JSPS Grant-in-Aid for Young Scientists (B) No. 16K17563.
The second author was partially supported by the Australian Research Council DP170102648.
Index of notation
We provide for the reader’s convenience a brief index of the notation which is used repeatedly in this paper:
Subsection 2.1: g, I, C=(cij)i,j∈I, αi, hi, Λi, δ, P, P+, Q, Q+, W, si, I0,
ϖi, P∗, d,
Let g be an affine Kac–Moody Lie algebra not of type A2n(2) over Q with index set I={0,1,⋯,n} and Cartan matrix C=(cij)i,j∈I.
We assume that the index [math] coincides with the one prescribed in [Kac90]
(we do not assume this for the other indices,
and in fact later we use another labeling, see Figure 1 in Subsection 3.1).
Let αi and hi (i∈I) be the simple roots and simple coroots respectively,
Λi (i∈I) the fundamental weights, δ the generator of null roots,
P=⨁iZΛi⊕Zδ the weight lattice, P+=⨁i∈IZ≥0Λi⊕Zδ the set of dominant weights,
Q=⨁i∈IZαi the root lattice, Q+=∑i∈IZ≥0αi⊆Q,
W the Weyl group with reflections si (i∈I),
and (,) a nondegenerate W-invariant bilinear form on P satisfying (α0,α0)=2.
Set I0=I∖{0}, and
[TABLE]
where K∈P∗=Hom(P,Z) is the canonical central element. Let d∈P∗ be the element satisfying
⟨d,Λi⟩=0 (i∈I) and ⟨d,δ⟩=1.
Set Pcl=P/Zδ,
and let cl:P↠Pcl be the canonical projection.
For simplicity of notation, we will write αi, ϖi for cl(αi), cl(ϖi)
when there should be no confusion.
Let q be an indeterminate.
Set qi=q(αi,αi)/2,
[TABLE]
for i∈I, m∈Z, n∈Z≥0.
Choose a positive integer D such that (αi,αi)/2∈ZD−1 for all i∈I, and set qs=q1/D.
Let Uq(g) be the quantum affine algebra, which is an associative Q(qs)-algebra generated by
ei, fi (i∈I), qh (h∈D−1P∗) with certain defining relations (see, for example, [Kas02]).
Denote by Uq′(g) the quantum affine algebra without the degree operator,
that is, the subalgebra of Uq(g) generated by ei, fi (i∈I) and qh (h∈D−1Pcl∗).
Let Uq(n+) (resp. Uq(n−)) be the subalgebra generated by ei (resp. fi) (i∈I).
For i∈I and n∈Z, set ei(n)=ein/[n]i! if n≥0, and ei(n)=0 otherwise.
Define fi(n) analogously.
We define a Q-grading Uq(g)=⨁α∈QUq(g)α by
[TABLE]
If 0=X∈Uq(g)α, we write wtP(X)=α.
For a proper subset J⊂I, denote by gJ the corresponding simple Lie subalgebra,
and by Uq(gJ) (resp. Uq(n+,J), Uq(n−,J)) the Q(qs)-subalgebra of Uq(g) generated by ei,fi,q±D−1hi
(resp. ei, fi) with i∈J.
Set ti=q(αi,αi)hi/2 for i∈I, and denote by Δ the coproduct of Uq(g) defined by
[TABLE]
for h∈D−1P∗, i∈I, m∈Z>0.
For a Uq(g)-module (resp. Uq′(g)-module) M and λ∈P (resp. λ∈Pcl), write
[TABLE]
and if v∈Mλ with v=0, we write wtP(v)=λ (resp. wtPcl(v)=λ).
We will omit the subscript P or Pcl when no confusion is likely.
We say a Uq(g)-module (or Uq′(g)-module) M is integrable if M=⨁λMλ
and the actions of ei and fi (i∈I) are locally nilpotent.
Throughout the paper we will repeatedly use the following assertions.
For i,j∈I such that i=j and r,s∈Z≥0, it follows from the Serre relations that
[TABLE]
where Uq(n+)α=Uq(n+)∩Uq(g)α.
For i,j∈I such that cij=cji=−1 and r,s,t∈Z≥0, we have
[TABLE]
see [Lus93, Lemma 42.1.2].
Given a Uq(g)-module M, v∈Mλ and r,s∈Z≥0, we have
[TABLE]
for i∈I, and ei(r)fj(s)=fj(s)ei(r) for i,j∈I such that i=j,
see [loc. cit., Corollary 3.1.9].
2.2. Crystal (pseudo)bases and global bases
Let M be an integrable Uq(g)-module (or Uq′(g)-module).
For i∈I, we have
[TABLE]
Endomorphisms e~i,f~i (i∈I) on M called the Kashiwara operators
are defined by
[TABLE]
for u∈kerei∩Mλ with 0≤n≤⟨hi,λ⟩.
These operators also satisfy that
[TABLE]
for v∈kerfi∩Mμ with 0≤n≤−⟨hi,μ⟩.
Let A be the subring of Q(qs) consisting of rational functions without poles at qs=0.
A free A-submodule L of M is called a crystal lattice of M if
M≅Q(qs)⊗AL, L=⨁λLλ where Lλ=L∩Mλ, and e~i, f~i (i∈I)
preserve L.
(i) L is a crystal lattice of M, (ii) B is a Q-basis of L/qsL,
(iii) B=⨆λBλ where B_{\lambda}=B\cap\big{(}L_{\lambda}/q_{s}L_{\lambda}), (iv) e~iB⊆B∪{0},
f~iB⊆B∪{0},
(v) for b,b′∈B and i∈I, f~ib=b′ if and only if e~ib′=b.
(2) (L,B) is called a crystal pseudobase of M if they satisfy the conditions (i), (iii)–(v), and
(ii’) B=B′⊔(−B′) with B′ a Q-basis of L/qsL.
Recall that, if M1 and M2 are integrable Uq(g)-modules and (Li,Bi) is a crystal base of Mi (i=1,2),
then (L1⊗AL2,B1⊗B2) is a crystal base of M1⊗M2, where B1⊗B2={b1⊗b2∣bi∈Bi}⊆(L1⊗AL2)/qs(L1⊗AL2).
Let a denote the automorphism of Q(qs) sending qs to qs−1, and set A={a∣a∈A}.
We also denote by a the involutive Q-algebra automorphism of Uq(g) defined by
[TABLE]
for i∈I, h∈D−1P∗, a(qs)∈Q(qs) and x∈Uq(g).
Let Uq(g)Q be the Q[qs,qs−1]-subalgebra of Uq(g) generated by ei(n), fi(n), qh for
i∈I, n∈Z>0, h∈D−1P∗.
(1) Let V be a vector space over Q(qs), L0 a free A-submodule, L∞ a free A-submodule,
and VQ a free Q[qs,qs−1]-submodule.
We say that (L0,L∞,VQ) is balanced if each of L0, L∞, and VQ generates V as a
Q(qs)-vector space, and the canonical map
[TABLE]
is an isomorphism.
(2) Let M be an integrable Uq(g)-module with a crystal base (L,B),
a be an involution of M (called a bar involution)
satisfying xu=xu for x∈Uq(g) and u∈M,
and MQ a Uq(g)Q-submodule of M such that
[TABLE]
Assume that (L,L,MQ) is balanced, where L={u∣u∈L}.
Then, letting G be the inverse of L∩L∩MQ→∼L/qsL,
the set
[TABLE]
forms a basis of M
called a global basis of M (with respect to the bar involution a ).
Note that the global basis B is an A-basis of L.
2.3. Polarization
A Q(qs)-bilinear pairing (,) between Uq(g)-modules (resp. Uq′(g)-modules) M and N
is said to be admissible if it satisfies
[TABLE]
for h∈D−1P∗ (resp. h∈D−1Pcl∗), i∈I, m∈Z>0, u∈M, v∈N.
A bilinear form (,) on M is called a prepolarization if it is symmetric and satisfies (2.3.1) for u,v∈M.
A prepolarization is called a polarization if it is positive definite with respect to the following total order on Q(qs):
[TABLE]
and f≥g if f=g or f>g.
Throughout the paper, we use the notation ∥u∥2=(u,u) for u∈M.
2.4. Extremal weight modules
For an arbitrary Λ∈P, let V(Λ) be the extremal weight module [Kas94]
with generator vΛ, which is an integrable
Uq(g)-module generated by vΛ of weight Λ with certain defining relations.
If Λ belongs to the W-orbit of a dominant (resp. antidominant) weight, say Λ∘, then V(Λ) is a simple highest (resp. lowest) weight module
with highest (resp. lowest) weight Λ∘.
In [loc. cit.], it was shown for any Λ∈P that V(Λ) has a crystal base \big{(}L(\Lambda),B(\Lambda)\big{)}
and \big{(}L(\Lambda),\overline{L(\Lambda)},V(\Lambda)_{\mathbb{Q}}\big{)} is balanced,
where the bar involution is defined by xvΛ=xvΛ
for x∈Uq(g), and V(Λ)Q=Uq(g)QvΛ.
We denote by
[TABLE]
the associated global basis.
Let Uq(g)Z denote the Z[qs,qs−1]-subalgebra of Uq(g) generated by ei(n),fi(n) (i∈I, n∈Z>0)
and qh (h∈D−1P∗),
and set V(Λ)Z=Uq(g)ZvΛ⊆V(Λ).
The following proposition is due to [Kas91] for highest and lowest weight cases, and [Nak04]
for level zero cases.
Proposition 2.4.1**.**
*Let Λ∈P.
(1) There exists a polarization (,) on V(Λ) such that
∥vΛ∥2=1.
(2) We have \big{(}L(\Lambda),L(\Lambda)\big{)}\subseteq A, and (e~iu,v)≡(u,f~iv) mod qsA for u,v∈L(Λ) and i∈I.
(3)B(Λ) is an almost orthonormal basis with respect to (,), that is,*
[TABLE]
(4)* We have*
[TABLE]
Let Λ1,Λ2∈P+.
By [Lus92] (see also [Kas94]), the triple
[TABLE]
in the tensor product V(Λ1)⊗V(−Λ2) is balanced.
Here the bar involution is defined by
[TABLE]
Denote the associated global basis by
[TABLE]
It is easily checked from the definition that
[TABLE]
By the construction of the global basis of an extremal weight module in [Kas94, Subsection 8.2], the following lemma is obvious.
Lemma 2.4.2**.**
Let Λ∈P, and suppose that Λ1,Λ2∈P+ satisfy Λ1−Λ2=Λ.
There exists a unique surjective Uq(g)-module homomorphism Ψ from V(Λ1)⊗V(−Λ2) to V(Λ) mapping
vΛ1⊗v−Λ2 to vΛ, and
Ψ maps the subset {X∈B(Λ1,−Λ2)∣Ψ(X)=0} bijectively to B(Λ).
2.5. Kirillov–Reshetikhin modules
Given a Uq′(g)-module M, we define a Uq(g)-module Maff=Q(qs)[z,z−1]⊗M
by letting ei and fi (i∈I) act by zδ0i⊗ei and z−δ0i⊗fi respectively,
and qD−1d on zk⊗M by the scalar multiplication by qsk.
Set Ma=Maff/(z−a)Maff for nonzero a∈Q(qs), which is again a Uq′(g)-module.
We denote by ιa:M→∼Ma the Q(qs)-linear (not Uq′(g)-linear) isomorphism defined by
ιa(v)=pa(1⊗v),
where pa:Maff→Ma is the projection.
If no confusion is likely, we will write ι for ιa sometimes.
Let r∈I0.
In [Kas02], a Uq′(g)-module automorphism zr of weight δ
is constructed on the level-zero fundamental extremal weight module V(ϖr),
which preserves the global basis B(ϖr).
Set
[TABLE]
which is a finite-dimensional simple integrable Uq′(g)-module called a fundamental module.
Note that Waffr,1≅V(ϖr).
Let p:V(ϖr)→Wr,1 be the canonical projection, and define a bilinear form (,) on Wr,1 by
[TABLE]
Since (u,v)=(zru,zrv) holds for u,v∈V(ϖr) by [Nak04, Lemma 4.7], this is a well-defined polarization on Wr,1.
Let L(W^{r,1})=p\big{(}L(\varpi_{r})\big{)}.
It follows from Proposition 2.4.1 that
[TABLE]
Fix r∈I0 and ℓ∈Z>0.
Let w1∈Wr,1 denote a vector such that wtPcl(w1)=ϖr and
∥w1∥2=1.
Hereafter we write ιk for ιqk (k∈D−1Z).
Set
[TABLE]
Let
[TABLE]
and denote by wℓ a vector of W defined by
[TABLE]
The Uq′(g)-submodule Wr,ℓ=Uq′(g)wℓ⊆W
is called the Kirillov–Reshetikhin module (KR module for short) associated with r,ℓ.
Proposition 2.5.1**.**
*Let r∈I0, ℓ∈Z>0.
(1)Wr,ℓ is a finite-dimensional simple integrable Uq′(g)-module.
(2) The weight space Wℓϖrr,ℓ is 1-dimensional and spanned by wℓ.
(3) The weight set {λ∈Pcl∣Wλr,ℓ=0} coincides with the intersection of
ℓϖr−∑i∈I0Z≥0αi and the convex hull of the W-orbit of ℓϖr.
(4) The vector wℓ∈Wr,ℓ satisfies*
[TABLE]
Proof.
The assertion (1) is proved in [OS08, Proposition 3.6]. The assertions (2) and (3) follow from [Kas02, Theorem 5.17],
and (4) is proved from (3).
∎
Next we shall recall how to define a prepolarization on Wr,ℓ.
There exists a unique Uq′(g)-module homomorphism
[TABLE]
mapping ιm(ℓ−1)(w1)⊗⋯⊗ιm(1−ℓ)(w1) to wℓ, and its image is
Wr,ℓ (see [OS08]).
The following lemma is proved straightforwardly.
Lemma 2.5.2**.**
Assume that ℓ∈Z>0, Mk, Nk(1≤k≤ℓ) are Uq′(g)-modules, and (,)k:Mk×Nk→Q(qs)(1≤k≤ℓ) are admissible pairings.
Then the Q(qs)-bilinear pairing (,):(M1⊗⋯⊗Mℓ)×(N1⊗⋯⊗Nℓ)→Q(qs) defined by
[TABLE]
is admissible.
The lemma gives an admissible pairing (,)0 between Wqm(ℓ−1)r,1⊗⋯⊗Wqm(1−ℓ)r,1
and Wqm(1−ℓ)r,1⊗⋯⊗Wqm(ℓ−1)r,1, which defines a bilinear form (,) on Wr,ℓ
by
[TABLE]
By [KKM*+*92, Proposition 3.4.3], (,) is a nondegenerate prepolarization on Wr,ℓ, and ∥wℓ∥2=1 holds.
We will use the following lemma later,
whose proof is similar to that of [Nao18, Lemma 3.6]
Lemma 2.5.3**.**
Let r∈I0 and ℓ∈Z>0, and set
[TABLE]
There are unique Uq′(g)-module homomorphisms R1:W1→Wr,ℓ and R2:Wr,ℓ→W2 satisfying
[TABLE]
respectively, and for any u,v∈W1 we have
[TABLE]
where (,)1 is the admissible pairing between W1 and W2 obtained from Lemma 2.5.2.
2.6. Criterion for the existence of a crystal pseudobase
Following the previous works [OS08, Nao18, BS20], we will prove Theorem Theorem 1 by applying a criterion
for the existence of a crystal pseudobase introduced in [KKM*+*92].
We write g0=gI0 for short.
We identify the weight lattice P0 of g0 with the subgroup ⨁i∈I0Zϖi of Pcl,
and set P0+=∑i∈I0Z≥0ϖi.
For λ∈P0+, denote by V0(λ) the simple integrable Uq(g0)-module with highest weight λ.
Let AZ and KZ be the subalgebras of Q(qs) defined respectively by
[TABLE]
Let Uq′(g)KZ denote the KZ-subalgebra of Uq′(g) generated by ei,fi,qh (i∈I,h∈D−1Pcl∗).
Proposition 2.6.1** ([KKM*+*92, Propositions 2.6.1 and 2.6.2]).**
Assume that M is a finite-dimensional integrable Uq′(g)-module
having a prepolarization (,) and a Uq′(g)KZ-submodule MKZ such that (MKZ,MKZ)⊆KZ.
We further assume that there exist weight vectors uk∈MKZ(1≤k≤m) satisfying the following conditions:
(i)
wt(uk)∈P0+* for 1≤k≤m and M\cong\bigoplus_{k=1}^{m}V_{0}\big{(}\mathrm{wt}(u_{k})\big{)} as Uq(g0)-modules,*
2. (ii)
(uk,ul)∈δkl+qsA* for 1≤k,l≤m,*
3. (iii)
∥eiuk∥2∈qi−2⟨hi,wt(uk)⟩−2qsA* for all i∈I0 and 1≤k≤m.*
Then (,) is a polarization, and the pair (L,B) with
[TABLE]
where (,)0 is the Q-valued bilinear form on L/qsL induced by (,), is a crystal pseudobase of M.
From [KKM*+*92], we know the Uq′(g)KZ-submodule WKZr,ℓ=Uq′(g)KZwℓ⊆Wr,ℓ satisfies
\big{(}W^{r,\ell}_{K_{\mathbb{Z}}},W^{r,\ell}_{K_{\mathbb{Z}}}\big{)}\subseteq K_{\mathbb{Z}}.
Hence if we show for M=Wr,ℓ the existence of weight vectors u1,…,um satisfying (i)–(iii),
Theorem Theorem 1 follows from Proposition 2.6.1.
We will show this in the next section with an explicit construction of the vectors u1,…,um.
In the rest of this paper, assume that g is either of type En(1) (n=6,7,8), F4(1) or E6(2)
and the nodes of the Dynkin diagram is labeled as in Figure 1.
We have
[TABLE]
From now on, for i∈I such that qi=q we write [m] for [m]i, [n]! for [n]i!, and [mn]
for [mn]i.
Note that in all types r=2 is the unique near adjoint node.
In the sequel, we will consider W2,ℓ only and, hence, write Wℓ for W2,ℓ.
Let us prepare several notation.
Define two subsets I01 and J of I by I01=I0∖{1}, and
[TABLE]
Let R⊆Q denote the root system of g0, and R+=R∩Q+ the set of positive roots.
For a subset L⊂I0 denote by RL the root subsystem of R generated by the simple roots corresponding
to the elements of L, and let RL+=RL∩R+.
We write R1=RI01.
Let θ1 be the highest short root of R1 if g is of type E6(2), and the highest root of R1 otherwise.
Define θJ∈RJ similarly (see Table 1).
For i∈I and k∈Z, set
[TABLE]
For p∈Z and a sequence r=(rkrk−1⋯r1) of elements of I (in this paper we always read such sequences from right to left),
we use the abbreviations
[TABLE]
Set
[TABLE]
and choose a sequence i=(iLiL−1⋯i1i0) of elements of I01 satisfying
[TABLE]
Similarly, choose a sequence j=(jL′jL′−1⋯j1j0) of elements of J satisfying
[TABLE]
In the rest of this paper, we fix i=(iL⋯i0) and j=(jL′⋯j0)
satisfying these conditions.
For 0≤k1≤k2≤L, denote by i[k2,k1] the subsequence (ik2ik2−1⋯ik1) of i,
and let i[k2,k1] be the empty set if k2<k1.
We define j[k2,k1] similarly.
For a sequence r=(rℓrℓ−1⋯r1) of elements of I, set sr=srℓ⋯sr1∈W,
and let sr be the identity element of W if r is the empty set.
Let hα∈P∗ (α∈R) denote the coroots,
and Λi∨∈P∗⊗ZQ (i∈I) elements satisfying ⟨Λi∨,αj⟩=δij for i,j∈I.
Lemma 3.1.1**.**
(1)* Neither of the subsequences i[L,1] and j[L′,1] contains 2.
(2) We have ⟨hi,θ1⟩=0 for all i∈J.
(3) For any p∈Z≥0, we have*
[TABLE]
*In particular, \mathrm{wt}_{P}\big{(}E_{\bm{i}}^{(p)}\big{)}=p\theta_{1} and \mathrm{wt}_{P}\big{(}E_{\bm{j}}^{(p)}\big{)}=p\theta_{J} hold.
(4) Both si and sj are reduced expressions.
(5) If α∈R+ satisfies si[L,1]−1(α)∈−R+
(resp. sj[L′,1]−1(α)∈−R+),
then we have ⟨hα,θ1⟩>0 (resp. ⟨hα,θJ⟩>0).
(6) For any p∈Z≥0,
Ei(p) (resp. Ej(p)) does not depend on the choice of i (resp. j).*
Proof.
The assertion (1) is obvious since ⟨Λ2∨,θ1⟩=⟨Λ2∨,θJ⟩=1 (see Table 1),
and (2) is checked directly. The assertion (3) is easily seen from the conditions on i and j.
We will show the assertion (4) for si (the proof for sj is similar).
By the condition on i, we have for any 0≤k≤L that
[TABLE]
Since ⟨hi,θ1⟩≥0 for all i∈I01 and si[L,k+1](αik)∈R1, this implies that
si[L,k+1](αik) is a positive root for any k, which implies that si is reduced.
Let us show the assertion (5) for si[L,1] (the proof for sj[L′,1] is similar).
There exists 1≤k≤L such that α=si[L,k+1](αik), and we have
[TABLE]
as required.
Finally, let us show the assertion (6) for Ei(p) (the proof for Ej(p) is similar).
If g is either of type F4(1) or E6(2), i=(43) is the unique choice.
Hence we may assume that g is of type En(1) (n=6,7,8).
Assume that i′=(iL0′,…,i0′) is another choice.
Since ∑k=0Lαik=∑k=0L0αik′=θ1, we have L0=L.
Let r be the smallest number such that ir=ir′, and let s be the smallest number such that r<s and ir=is′.
Then since
[TABLE]
and ik′=ir for r≤k<s,
we have ⟨hir,αik′⟩=0 for r≤k<s.
Hence setting
[TABLE]
we have Ei′(p)=Ei′′(p).
By repeating this argument we can show that Ei′(p)=Ei(p), and hence the assertion (6) is proved.
∎
For p=(p1,p2,…,p6)∈Z6, we write
[TABLE]
and define a map wt:Z6→P0 by
[TABLE]
where we set
[TABLE]
For ℓ∈Z>0, define a finite subset Sℓ⊆Z≥06 by
[TABLE]
Note that if p∈Sℓ, then wtPcl(Epwℓ)=wt(p)+ℓϖ2∈P0+.
As stated in the final part of the previous section, Theorem Theorem 1 is proved once we show the following.
Proposition 3.1.2**.**
For any ℓ∈Z>0, the vectors {Epwℓ∣p∈Sℓ}⊆Wℓ satisfy the following
conditions:
(C1)
W^{\ell}\cong\bigoplus_{\bm{p}\in S_{\ell}}V_{0}\big{(}\mathrm{wt}(\bm{p})+\ell\varpi_{2}\big{)}* as Uq(g0)-modules,*
2. (C2)
(Epwℓ,Ep′wℓ)∈δp,p′+qsA* for p,p′∈Sℓ,*
3. (C3)
∥eiEpwℓ∥2∈qi−2⟨hi,wt(p)⟩−2ℓδi2−2qsA* for i∈I0 and p∈Sℓ.*
By [Nak03, Her06, DFK08], the multiplicities of a KR module are known to
coincide with the cardinalities of highest weight rigged configurations.
In our cases, explicit formulas for the number of them have been obtained using the Kleber algorithm [Kle98],
and hence we have the following.
In this and next subsections, we need to consider prepolarizations on several types of modules
(extremal weight modules, KR modules, or tensor products of them) simultaneously.
Therefore, when we would like to indicate what prepolarization we are considering, we will occasionally write (,)M and ∥∥M2 for (,)
and ∥∥2 on a module M.
We begin with the following lemma.
Lemma 3.3.1**.**
Let M be a Uq′(g)-module with a prepolarization (,), and u∈Mλ for some λ∈Pcl.
Assume that f0u=e1u=f1u=0.
Then for any p,p′∈Z≥06 with p=p′, (Epu,Ep′u)=0 holds.
Proof.
Set p=(p1,…,p6) and p′=(p1′,…,p6′).
We may assume that p6≥p6′.
By the admissibility, we have
[TABLE]
where c is a certain integer and εi=(i0,…,0,1,0,…,0) (1≤i≤6) is the standard basis of Z6.
Since e1(a)e0(b)u=0 if a>b by (2.1.1), it follows from (2.1.3) that
[TABLE]
with c′∈Z, and hence we may (and do) assume that p6=p6′=0.
If we further assume that p5=p5′, then p=p′ implies wtPcl(Epu)=wtPcl(Ep′u),
which forces (Epu,Ep′u)=0.
Hence we may assume that p5>p5′.
In this case, we have
[TABLE]
with c′′∈Z, and by applying (2.1.1) and (2.1.3), it is easily proved that
[TABLE]
Since f0Ep−p5ε5u=0, (3.3.1) implies (Epu,Ep′u)=0, and the assertion is proved.
∎
Since the vector wℓ∈Wℓ satisfies the assumption of the lemma,
(Epwℓ,Ep′wℓ)=0 follows if p=p′.
In order to verify (C2) in Proposition 3.1.2, it remains to show ∥Epwℓ∥2∈1+qsA for p∈Sℓ.
Lemma 3.3.2**.**
For any p=(p1,…,p6)∈Z≥06 such that p1−p5+p6≤3ℓ,
we have ∥Epwℓ∥2∈(1+qA)∥Ep−p6ε6wℓ∥2.
Proof.
We have
[TABLE]
Since f0Ep−p6ε6wℓ=0 holds, it follows from (2.1.3)
that
[TABLE]
The lemma is proved.
∎
In the sequel, we regard Z5 as a subgroup of Z6 via Z5∋p↪(p,0)∈Z6.
Hence for p=(p1,…,p5)∈Z5, we have
[TABLE]
For ℓ∈Z>0, set
[TABLE]
By the lemma, the proof of the assertion ∥Epwℓ∥2∈1+qsA for p∈Sℓ is reduced to the case
p∈Sℓ.
An idea for the proof of this assertion is to use the
almost orthonormality of B(ℓϖ2), the global basis of the extremal weight module V(ℓϖ2).
To do this we need to show that Epvℓϖ2∈±B(ℓϖ2)∪{0} for
p∈Z≥05.
For this purpose, we prepare several lemmas.
Lemma 3.3.3**.**
*Let Λ∈P and i∈I, and assume that u∈±B(Λ).
(1) If*
[TABLE]
*then we have ei(n)u∈±B(Λ)∪{0} for all n>0.
(2) In particular, if fiu=0 then ei(n)u∈±B(Λ)∪{0} for all n>0.*
Proof.
Let us prove the assertion (1) (note that (2) is just a special case).
Since u∈±B(Λ), it follows from Proposition 2.4.1 (4)
that ei(n)u is bar-invariant and ei(n)u∈V(Λ)Z
for any n>0.
Hence, again by the same proposition, it suffices to show that ∥ei(n)u∥2∈1+qsA for n>0 such that
ei(n)u=0.
Set
[TABLE]
Let λ∈P be the weight of u, and set λi=⟨hi,λ⟩∈Z.
Write
[TABLE]
Here we set N=max{k∈Z≥0∣uk=0}.
By Proposition 2.4.1 (2),
it follows for every uk that
[TABLE]
We shall show that uk∈qik(λi+k)L1 for every k by the descending induction.
For 0≤n≤N+λi, we have
[TABLE]
by the assumption.
Since fi(k+N+λi)uk=0 for k<N, (3.3.4) with n=N+λi implies [2N+λiN]ifi(2N+λi)uN∈L1.
Hence we have uN∈qiN(N+λi)L1 by (3.3.3), and the induction begins.
Next let k0 be an integer such that max(0,−λi)≤k0<N.
By (3.3.4) with n=k0+λi, we have
[TABLE]
It is easily checked from the admissibility that fi(k+k0+λi)uk’s are pairwise orthogonal with respect to the polarization,
and then it follows from (3.3.5) that fi(2k0+λi)uk0∈qk0(k0+λi)L1,
since the induction hypothesis implies for k>k0 that
[TABLE]
Hence uk0∈qik0(k0+λi)L1 holds by (3.3.3), as required.
Now assume that 0<n≤N.
It follows from (2.1.3) that
[TABLE]
and since we have
[TABLE]
by the above argument, (3.3.6) and the pairwise orthogonality of fi(l)uk’s imply ei(n)u∈L1.
Since ei(n)u=0 for n>N, this completes the proof.
∎
Lemma 3.3.4**.**
*Let p=(p1,p2,p3,p4)∈Z≥04. In V(−ℓΛ0), we have the following:
(1) For any 1≤k≤L, we have*
[TABLE]
(2)* For any i∈I01 such that ⟨hi,θ1⟩=0, we have fiEi(p3)e1(p2)e0(p1)v−ℓΛ0=0.
(3) For any 1≤k≤L′, we have*
[TABLE]
(4)* For any i∈J such that ⟨hi,θJ⟩=0, we have fiEj(p4)Ei(p3)e1(p2)e0(p1)=0.*
Proof.
Set v=e1(p2)e0(p1)v−ℓΛ0 and Λ=wtP(v)=−ℓΛ0+p1α0+p2α1.
(1) We have
[TABLE]
and since si[k−1,1]−1(αik) is a positive root in RI0∖{1,2} by Lemma 3.1.1 (1) and (4),
the right-hand side does not belong to −ℓΛ0+Q+.
Hence fikEi[k−1,0](p3)v=0 holds. Since ⟨hik,wt(Ei[k−1,0](p3)v)⟩=−cgp3,
we also have eik(cgp3+1)Ei[k−1,0](p3)v=0, and the proof of (1) is complete.
(2) We have
[TABLE]
and si[L,1]−1(αi)∈R1+ by Lemma 3.1.1 (5).
Moreover, we have si[L,1]−1(αi)=α2 since αi=θ1, and hence the right-hand side of (3.3.7) does not
belong to −ℓΛ0+Q+, which implies (2).
(3) Set W=Uq(gJ)Ei(p3)v.
The assertion (2), together with Lemma 3.1.1 (2), implies that Wλ=0 unless
λ∈Λ+p3θ1+Q+.
Using this, the assertion (3) is proved by a similar argument to that of (1).
Finally the proof of the assertion (4) is similar to that of (2).
∎
Lemma 3.3.5**.**
*Let ℓ∈Z>0.
(1) For any (p1,…,p5)∈Z≥05, the vector*
[TABLE]
*in V(−ℓΛ0) belongs to ±B(−ℓΛ0)∪{0}.
(2) For any p=(p1,…,p5)∈Z≥05, Epv−ℓΛ0∈V(−ℓΛ0)
belongs to ±B(−ℓΛ0)∪{0}.*
Proof.
Obviously,
[TABLE]
holds.
Then the assertion (1) is proved by applying Lemma 3.3.3 (2) repeatedly using Lemma 3.3.4.
For any n>0, it is easily seen using (2.1.3) that
[TABLE]
which belongs to ±B(−ℓΛ0)∪{0} by (1).
Hence it follows from Lemma 3.3.3 that Epv−ℓΛ0∈±B(−ℓΛ0)∪{0}.
The assertion (2) is proved.
∎
Now we prove the following.
Proposition 3.3.6**.**
Let ℓ∈Z>0.
For any p∈Z≥05, the vector Epvℓϖ2∈V(ℓϖ2) belongs to ±B(ℓϖ2)∪{0}.
and then Lemma 2.4.2 implies that Epvℓϖ2∈±B(ℓϖ2)∪{0} as required,
since ϖ2=Λ2−3Λ0.
∎
Next we will show that ∥Epvℓϖ2∥V(ℓϖ2)2=∥Epw1⊗ℓ∥(W1)⊗ℓ2 for p∈Z≥05.
Before doing that we prepare a lemma,
which is also used in the next subsection.
Lemma 3.3.7**.**
Let M1,…,Mn be integrable Uq′(g)-modules, λ=(λ1,…,λn) an n-tuple of elements of Pcl,
and u_{k}\in\big{(}M_{k})_{\lambda_{k}}(1≤k≤n).
Assume that each uk satisfies eiuk=0 for i∈I0.
Then for any p∈Z≥05, the vector Ep(u1⊗⋯⊗un)∈M1⊗⋯⊗Mn can be written in the form
[TABLE]
where m(p1,…,pn:λ)∈D−1Z are certain numbers depending only on p1,…,pn and λ.
Proof.
By the definition of the coproduct, Ep(u1⊗⋯⊗un) is a sum of vectors of the form
[TABLE]
Since e1(bk)e0(ak)uk=0 if bk>ak by (2.1.1) and ∑kak=∑kbk=p1,
the vector (3.3.9) becomes [math] unless ak=bk for all k.
Take a sufficiently large positive integer ℓ.
For any k, there is a Uq(n+)-module homomorphism from V(−ℓΛ0) to Mk mapping v−ℓΛ0 to uk, which follows from the well-known fact that
V(−ℓΛ0) is generated by v−ℓΛ0 as a Uq(n+)-module with relations
[TABLE]
Then since ∑kgkt=2p2 if g is of type F4(1) and t=0 and ∑kgkt=p2 otherwise,
we see from Lemma 3.3.4 (1) that the vector (3.3.9) becomes [math] unless
cggk0=gk1=⋯=gkL for all k.
By a similar argument using Lemma 3.3.4 (3), we also see that the vector (3.3.9) with
cggk0=gk1=⋯=gkL
becomes [math] unless cghk0=hk1=⋯=hkL′ for all k. The proof is complete.
∎
Proposition 3.3.8**.**
*Let ℓ∈Z>0 and p∈Z≥05.
(1) We have ∥Epvℓϖ2∥V(ℓϖ2)2=∥Epw1⊗ℓ∥(W1)⊗ℓ2.
(2) If Epw1⊗ℓ=0, we have ∥Epw1⊗ℓ∥2∈1+qsA.*
Proof.
(1) First we show the following:
[TABLE]
By [Nak04], there exists an injective Uq(g)-module homomorphism Φ from V(ℓϖ2) to
V(ϖ2)⊗ℓ mapping vℓϖ2 to vϖ2⊗ℓ.
Although Φ does not preserve the values of the polarizations in general,
the relations between (,)V(ℓϖ2) and (,)V(ϖ2)⊗ℓ are explicitly described in [loc. cit.], which we recall here.
Define a Q(qs)[t±1]-valued bilinear form ((,))t on V(ϖ2) by
[TABLE]
where z2 is the automorphism on V(ϖ2) in Subsection 2.5.
Define a Q(qs)[t1±1,…,tℓ±1]-valued bilinear form ((,)) on V(ϖ2)⊗ℓ by
[TABLE]
Then by [Nak04, Proposition 4.10], it holds for u,v∈V(ℓϖ2) that
[TABLE]
where [f]1 denotes the constant term in f.
For p,p′∈Z≥05 such that p=p′, we have (Epw1,Ep′w1)W1=0 by Lemma 3.3.1.
Then by (2.5.1), this, together with the weight consideration, implies
[TABLE]
Hence in particular, it follows that
[TABLE]
which implies
((Epvϖ2⊗ℓ,Ep′vϖ2⊗ℓ))=(Epvϖ2⊗ℓ,Ep′vϖ2⊗ℓ)V(ϖ2)⊗ℓ
by Lemma 3.3.7.
Now Equation (3.3.11) implies for p∈Z≥05 that
and then ∥Epvϖ2⊗ℓ∥V(ϖ2)⊗ℓ2=∥Epw1⊗ℓ∥(W1)⊗ℓ2
follows by Lemma 3.3.7.
The assertion (1) is proved.
(2) Since (,)(W1)⊗ℓ is positive definite, v∈(W1)⊗ℓ satisfies
∥v∥2=0 if and only if v=0.
Hence the assertion (2) follows from (1), Proposition 3.3.6 and Proposition 2.4.1 (3).
∎
Proposition 3.3.9**.**
Let ℓ∈Z>0.
If p∈Sℓ, then Epw1⊗ℓ=0, and hence ∥Epw1⊗ℓ∥2∈1+qsA follows
from Proposition 3.3.8.
Proof.
Let us prove the assertion by the induction on ℓ.
First assume that ℓ=1.
In this case, we have
[TABLE]
If p∈S1∖{ε1+ε2}, Epvϖ2=0 is checked from the following elementary
fact: for an integrable Uq′(g)-module M, λ∈Pcl and i∈I,
Hence we have e2e1e0w1=0, and then Eε1+ε2w1=0 is proved by applying (3.3.13).
Thus the case ℓ=1 is proved.
Assume ℓ>1.
By Lemma 3.3.7, Epw1⊗ℓ can be written in the form
[TABLE]
and for the vectors {Ep1w1∣p1∈Z≥05 such that Ep1w1=0}
are linearly independent by Lemma 3.3.1,
it is enough to show the existence of p1 satisfying
[TABLE]
If p1<p4+ℓ, then p1=0 satisfies (3.3.14) by the induction hypothesis since
p∈Sℓ−1.
Assume that p1=p4+ℓ, and set k0=max{1≤k≤5∣pk=0}.
If k0=2, set p1=(k02,1,…,1,0,…,0).
That Ep1w1=0 follows from (3.3.13),
and it is easily checked that p−p1∈Sℓ−1. Therefore (3.3.14) holds.
Finally if k0=2, p1=(1,1,0,0,0) satisfies (3.3.14).
The proof is complete.
∎
The following lemma connects values of the prepolarizations on (W1)⊗ℓ and Wℓ.
Lemma 3.3.10**.**
Let ℓ∈Z>0, and X,Y∈Uq′(g).
Suppose that the images of X,Y under the ℓ-iterated coproduct Δ(ℓ):Uq′(g)→Uq′(g)⊗ℓ are written in the forms
[TABLE]
respectively, where N1,N2∈Z≥0, fk,gk∈Q(qs), and Xk,j,Ym,j∈Uq′(g) are vectors homogeneous with respect to the Q-grading.
We further assume that, for any 1≤k≤N1 and 1≤m≤N2,
[TABLE]
Then we have (Xw1⊗ℓ,Yw1⊗ℓ)(W1)⊗ℓ=(Xwℓ,Ywℓ)Wℓ.
For an arbitrary homogeneous vector Z∈Uq′(g)β and k∈Z, we have
[TABLE]
Hence setting wtP(Xk,j)=βk,j and wtP(Ym,j)=γm,j, it follows that
[TABLE]
and
[TABLE]
Then we have
[TABLE]
by the assumption, and the assertion is proved.
∎
Now the following proposition, together with Proposition 3.3.9, completes the proof of (C2) in Proposition 3.1.2.
Proposition 3.3.11**.**
Let ℓ∈Z>0. For any p∈Z≥05, we have ∥Epw1⊗ℓ∥(W1)⊗ℓ2=∥Epwℓ∥Wℓ2.
Proof.
It suffices to show that X=Y=Ep satisfy the assumptions of Lemma 3.3.10.
The vector Δ(ℓ)(Ep) can be written in the form ∑kqsmkqHk1Ek1⊗⋯⊗qHkℓEkℓ,
where mk∈Z, Ekj are some products of ei(m)’s and Hkj∈D−1Pcl∗.
By Lemma 3.3.7, qHk1Ek1w1⊗⋯⊗qHkℓEkℓw1=0 unless Ekj=Epj (1≤j≤ℓ)
for some pj∈Z≥05, and then ∏j(qHkjEkjw1,qHmjEmjw1)=0 implies
Ekj=Emj for all j by Lemma 3.3.1.
Hence (3.3.15) is obviously satisfied, and the proof is complete.
∎
First we show the case i=1.
The proof is similar to [Nao18, proof of Eq. (3.3) with i=1].
We reproduce it here for the reader’s convenience.
Lemma 3.4.1**.**
For any p∈Sℓ, we have
[TABLE]
Proof.
Set
[TABLE]
We have
[TABLE]
where we have used the fact ∥Epwℓ∥2∈1+qsA by (C2) (which we have already proved).
Hence it suffices to show that ∥f1Epwℓ∥2∈A.
Set r=3ℓ−p1+p5.
It is easily checked that f0(k)f1Ep−p6ε6wℓ=0 for k>1, and hence we have
[TABLE]
It follows that
[TABLE]
Moreover, it is easily checked that
[TABLE]
and hence it also follows that
[TABLE]
Hence ∥f1Epwℓ∥2∈A follows from (3.4), and the proof is complete.
∎
When we show (C3) for i∈I0∖{1}, as we did in the proof of (C2),
we may assume that \bm{p}\in\overline{S}_{\ell}\big{(}=S_{\ell}\cap\mathbb{Z}_{\geq 0}^{5}\big{)} by the following lemma.
Lemma 3.4.2**.**
For any p=(p1,…,p6)∈Z≥06 such that p1−p5+p6≤3ℓ and i∈I0∖{1},
we have ∥eiEpwℓ∥2∈(1+qA)∥eiEp−p6ε6wℓ∥2.
Proof.
Since eiEpwℓ=e0(p6)eiEp−p6ε6wℓ, the same proof for Lemma 3.3.2 holds here.
∎
Our next goal is to give estimates for the values ∥eiEpw1⊗ℓ∥2 (i∈I0∖{1}).
For this purpose, let us prepare some lemmas.
The proof of the following lemma is almost the same with that of Lemma 3.3.3, with L1 replaced by L(Λ).
Lemma 3.4.3**.**
*Let Λ∈P and i∈I, and assume that u∈V(Λ) is a weight vector.
If fi(n)u∈L(Λ) for all n∈Z≥0, then ei(n)u∈L(Λ) for all n>0.
Lemma 3.4.4**.**
Let Λ,λ∈P, i∈I, and u∈V(Λ)λ, and assume that
[TABLE]
*for some a,b∈D−1Z. Set ri=(αi,αi)/2.
(1)
We have*
[TABLE]
(2)* Further assume that ⟨hi,λ⟩≤0 and fi(2)u=0.
Then we have*
[TABLE]
Proof.
Set λi=⟨hi,λ⟩∈Z, and write
[TABLE]
We have
[TABLE]
and since fi(k+1)uk’s are pairwise orthogonal with respect to (,), it follows from Proposition 2.4.1 (4) that
[k+1]ifi(k+1)uk∈qbL(Λ) for every k.
Then since fi(k+1)uk=0 for k≥max(0,−λi+1) such that uk=0, we have
and hence if λi≥0, (3.4.2) implies eiu∈qb−riλiL(Λ) and the assertion (1) holds.
When λi<0, we need to show further that
[TABLE]
Similarly as above, we see that u∈qaL(Λ) implies uk∈qaL(Λ) for all k,
and hence (3.4.3) follows.
The proof of (1) is complete.
Under the assumption of (2), we may put N=−λi+1 and we have
ei(n)u=fi(−λi−n)u−λi+[n+1]ifi(−λi+1−n)u−λi+1, which belongs to
qmin(a,b−ri(λi+n−1))L(Λ).
Hence (2) is also proved.
∎
Lemma 3.4.5**.**
Assume that the sequence i satisfies the following condition: there exists 1≤m≤L such that
im,im+1,…,iL are pairwise distinct, c2im<0, and cikik+1=−1 for m≤k≤L−1.111
If g is not of type E6(1), this condition, together with the condition (3.1.2) on i,
uniquely determines the sequence (iL,iL−1,…,im) (see Figure 1 and Table 1).
In type E6(1), on the other hand, there are two possibilities; (5,3) or (6,4).
Let ℓ∈Z>0 and (p1,p2,p3,p4)∈Z≥04, and set
[TABLE]
(1)* We have*
[TABLE]
(2)* We have vk∈±B(−ℓΛ0)∪{0} for m≤k≤L.
(3) If g is not of type E6(2), we have*
[TABLE]
On the other hand if g is of type E6(2), we have
[TABLE]
Proof.
The assertion (1) is easily proved using (2.1.3) and Lemma 3.3.4 (1).
(2) Set v=e1(p2)e0(p1)v−ℓΛ0 and Λ=wtP(v)=−ℓΛ0+p1α0+p2α1,
and fix m≤k≤L.
By (the proof of) Lemma 3.3.5, we have
[TABLE]
For each k<k′≤L, we have
[TABLE]
by the assumption on i.
We have ⟨hiL,θ1⟩>0 by the condition (3.1.2) on i,
and then it is easily checked that ⟨hir,θ1⟩=0 for m≤r≤L−1 (see Figure 1 and Table 1).
Hence (3.4) does not belong to −ℓΛ0+Q+ by Lemma 3.1.1 (5),
which implies fik′ei[k′−1,k](cgp3−1)Ei[k−1,0](p3)v=0 for all k′.
Now the assertion (2) follows from (3.4.5) by applying Lemma 3.3.3 (2) repeatedly.
(3) First assume that g is not of type E6(2).
We shall prove the assertion by the induction on k.
In the case k=m, since vm∈±B(−ℓΛ0)∪{0} by (2) it suffices to show that f2vm=0, and as above, this is done by checking
si[L,1]−1wtP(f2vm)∈/−ℓΛ0+Q+.
Hence the induction begins.
Assume that k>m.
It follows from Lemma 3.3.4 (2) that
[TABLE]
and
[TABLE]
Hence we have Ei[k−2,m](p4)e2(p4)vk∈±B(−ℓΛ0)∪{0}.
Since
[TABLE]
(3.4.4) is now proved from the induction hypothesis and Lemma 3.3.3.
Next assume that g is of type E6(2). In this case i=(432), L=2, m=1 and
[TABLE]
We have
[TABLE]
(note that v1=0 if p3>p2),
and hence it follows from Lemma 3.4.4 (2) that e2(p4)v1∈qmin(0,p3−p4−1)L(−ℓΛ0).
On the other hand, since f2v2=0 we have e2(p4)v2∈±B(−ℓΛ0)∪{0},
and then e3(p4)e2(p4)v2∈qmin(0,p3−p4−1)L(−ℓΛ0) also follows since
f3(p)e2(p4)v2=δp1e2(p4)v1 for p∈Z>0.
The proof is complete.
∎
Lemma 3.4.6**.**
*Let ℓ∈Z>0 and p=(p1,…,p5)∈Z≥05.
(1) We have*
[TABLE]
(2)* If g is not of type E6(2) and i∈I0∖{1,2}, we have*
[TABLE]
(3)* If g is of type E6(2), we have*
[TABLE]
Proof.
(1) It suffices to show that f2Epv−ℓΛ0∈q−p1+p4L(−ℓΛ0)
by Lemmas 3.3.5 and 3.4.4.
Since f2Ej(p3)Ei(p2)E10(p1)v−ℓΛ0=0 by Lemma 3.3.4 (4),
it follows from the weight consideration that Epv−ℓΛ0=0 if p4>p1,
and hence we may assume that p4≤p1.
By a direct calculation, we have
[TABLE]
which belongs to q−p1+p4L(−ℓΛ0), as required.
(2) It suffices to show that fiEpv−ℓΛ0∈L(−ℓΛ0).
The proof is divided into three cases.
First assume that ⟨hi,θ1⟩=⟨hi,θJ⟩=0.
In this case Lemma 3.3.4 implies fiEpv−ℓΛ0=0, and hence the assertion holds.
Next assume that ⟨hi,θJ⟩>0.
By Lemma 3.1.1 (6), we may assume that the sequence j is chosen so that
jL′=i.
For each n∈Z≥0, set
Hence by Lemma 3.4.3, it suffices to show that e2(p4)vn∈±B(−ℓΛ0)∪{0}⊆L(−ℓΛ0) for any n.
We have vn∈±B(−ℓΛ0)∪{0} by (the proof of) Lemma 3.3.5.
Since α2+αi is a positive root (see Table 1), we have
[TABLE]
and the same argument as in the proof of Lemma 3.3.4 (3) shows that this implies f2vn=0.
Hence e2(p4)vn∈±B(−ℓΛ0)∪{0} holds, as required.
Finally assume that ⟨hi,θ1⟩>0.
We may assume that the sequence i is chosen so that iL=i, and the assumption of Lemma 3.4.5 is satisfied.
Let m be as in the assumption.
Further, we may also assume that the sequence j is chosen so that jk=im+k−1 for 1≤k≤L−m.
For each n∈Z≥0, set
[TABLE]
As above it is enough to show for any n that
[TABLE]
It follows from Lemma 3.4.5 (3) that Ej[L−m,0](p3)un∈±B(−ℓΛ0)∪{0}.
We easily see from Figure 1 and Table 1 that
[TABLE]
Then, since jL−m=iL−1,
we have cijk=0 for L−m<k≤L′, and hence we have
[TABLE]
by Lemma 3.3.4.
Similarly, f2Ej(p3)un=0 is proved.
Now (3.4.8) is shown using Lemma 3.3.3, and the proof of (2) is complete.
(3) We shall prove
[TABLE]
which implies the former assertion by Lemma 3.4.4,
and for this it is enough to show for any n∈Z≥0 that
(note that the left-hand side is [math] if p3>p1−n),
(3.4) follows from Lemma 3.4.4, as required.
The latter assertion is proved in a similar manner using Lemma 3.4.5.
∎
Now we obtain the following estimates for ∥eiEpw1⊗ℓ∥2.
Proposition 3.4.7**.**
*Let ℓ∈Z>0 and p=(p1,…,p5)∈Z≥05.
(1) We have*
[TABLE]
(2)* If i∈I0∖{1,2}, we have*
[TABLE]
Proof.
By (2.4.1), Lemma 2.4.2, [Nak04, Theorem 1 (2)] and the definition of L(W1), we have
[TABLE]
where Ψ:V(ℓΛ2)⊗V(−3ℓΛ0)→V(ℓϖ2) is the homomorphism given in the lemma,
Φ:V(ℓϖ2)↪V(ϖ2)⊗ℓ is the one satisfying Φ(vℓϖ2)=vϖ2⊗ℓ,
and p:V(ϖ2)↠W1 is the canonical projection.
The assertions follow from this and Lemma 3.4.6.
∎
Let M1,…,Mn and uk∈(Mk)λk (1≤k≤n) be as in Lemma 3.3.7.
We see that the vector eiEp(u1⊗⋯⊗un) for i∈I and p∈Z≥05
can be written in the form
[TABLE]
with some m(p1,…,pn:λ,i,k)∈D−1Z.
Now the following lemma, together with Proposition 3.4.7 (2), completes the proof of (C3) for i∈I0∖{1,2}.
Lemma 3.4.8**.**
*Let i∈I0∖{1,2}.
(1) If p,p′∈Z≥05 satisfy (eiEpw1,Ep′w1)=0, then we have wtP(eiEp)=wtP(Ep′).
(2) For any p∈Z≥05 and ℓ∈Z>0, we have*
[TABLE]
Proof.
Since (eiEpw1,Ep′w1)=0 implies wtP(eiEp)∈wtP(Ep′)+Zδ, in order to prove (1) it is enough to show that
(eiEpw1,Ep′w1)=0 if p5=p5.
Since ej,fj (j=0,1) commute with ei, this follows from the same argument as in the proof of Lemma 3.3.1.
Then we see from Lemma 3.3.1 and (3.4.10) that
X=Y=eiEp satisfy the assumptions of Lemma 3.3.10,
and hence the assertion (2) is proved.
∎
It remains to prove (C3) for i=2 and p∈Sℓ, which is more involved.
We will prove the following stronger statement,
and the proof will occupy the rest of this paper.
Proposition 3.4.9**.**
Let ℓ∈Z>0.
For any p=(p1,p2,p3,p4,p5)∈Z≥05, we have
[TABLE]
Lemma 3.4.10**.**
Let ℓ∈Z>0.
If p∈Z≥05 satisfies (W1)⊗ℓ∋Epw1⊗ℓ=0,
then p1≤3ℓ and pj≤min(2ℓ,p1) for j∈{2,3,4}.
Proof.
By Lemma 3.3.7, it is enough to show the assertion for ℓ=1.
In this case, since ⟨h0,ϖ2⟩=−3 and f0w1=0, p1≤3 follows.
Moreover, since
[TABLE]
we have e2(p1+1)e10(p1)w1=0,
which implies p2≤p1.
We easily see using Lemma 3.3.4 (2) that
[TABLE]
and then the existence of the map p∘Ψ:V(Λ2)⊗V(−3Λ0)→W1 implies that
f2(2)Ei(p2)e10(p1)w1=0.
Hence p3≤p1 is proved by the weight consideration. Similarly p4≤p1 is proved from Lemma 3.3.4 (4).
Finally we have to show that pj≤2 for j∈{2,3,4} even if p1=3.
Similarly as above, these are deduced from the fact that f2e10(3)w1=0, and this fact follows since w1 is an extremal weight vector
(see [Kas02, Theorem 5.17]). The proof is complete.
∎
In the sequel, we use the symbol
[TABLE]
The difficulty in the case i=2 is that the statements of Lemma 3.4.8 for i=2 do not hold in general.
Instead, we have the following.
Lemma 3.4.11**.**
Let ℓ∈Z>0, and assume that either w=w1⊗ℓ∈(W1)⊗ℓ or w=wℓ∈Wℓ.
For any p,p′∈Z≥05, we have
[TABLE]
Proof.
By the weight consideration, it is enough to show that (e2Epw,Ep′w)=0 holds if p5<p5′ or p5−1>p5′.
If p5<p5′, the proof is similar to that of Lemma 3.3.1.
Assume that p5−1>p5′. It follows from (2.1.2) that
[TABLE]
As in Lemma 3.3.1, it can be proved using p5−1>p5′ that
[TABLE]
and hence the right-hand side of (3.4.12) is zero. The proof is complete.
∎
We shall prove Proposition 3.4.9 by the induction on ℓ.
By Proposition 3.4.7 (1) with ℓ=1, we have
[TABLE]
for any p∈Z≥05, and hence the induction begins.
Throughout the rest of this section, fix ℓ∈Z>0 and assume that (3.4.11) holds for this ℓ.
Our goal is to prove (3.4.11) with ℓ replaced by ℓ+1, that is,
[TABLE]
From now on, we write
[TABLE]
for short (the right-hand side is defined in Lemma 3.3.7).
For any p∈Z≥05 we have
[TABLE]
Lemma 3.4.12**.**
For p1,p2∈Z≥05 with pk=(pk1,…,pk5), we have
[TABLE]
Proof.
Given weight vectors u1,u2 of some Uq′(g)-modules,
it follows for i∈I and p∈Z≥0 that
[TABLE]
In particular, if ei(p1+1)u1=0, ei(p2+1)u2=0 and ⟨hi,wt(u2)⟩=−p2, it follows that ei(p1+p2)(u1⊗u2)=ei(p1)u1⊗ei(p2)u2.
Using these equalities, the assertion is obtained straightforwardly by calculating the coefficient of Ep1w1⊗Ep2w1⊗ℓ
in Ep1+p2w1⊗(ℓ+1).
∎
Lemma 3.4.13**.**
Let p1,p2∈Z≥05, and assume that Ep1w1=0
and Ep2w1⊗ℓ=0.
Then m(p1,p2)≥0 holds.
Proof.
Let p=p1+p2.
By (3.4.14) and Lemma 3.3.1, it follows that
[TABLE]
Then Proposition 3.3.8 (2) implies that, if Ep1′w1 and
Ep2′w1⊗ℓ are both nonzero, then m(p1′,p2′)≥0. Hence the assertion is proved.
∎
Here all the sums are over the set {p1,p2∈Z≥05∣p1+p2=p}.
Now it suffices to show that Z1+Z2+Z3+Z4 belongs to the subset of Q(qs) in (3.4.13).
First we shall show that Z2 does.
For k∈Z, write
[TABLE]
Lemma 3.4.14**.**
*Let p∈Z≥05, and set k=p1−p4−ℓ+1.
(1) The vector (f2Ep−[k]+Ep−ε4)vℓϖ2∈V(ℓϖ2)
belongs to ±B(ℓϖ2)∪{0}.
(2) We have (f2Ep−[k]+Ep−ε4)w1⊗ℓ∈L(W1)⊗ℓ.*
Proof.
(1) By Lemma 2.4.2, it is enough to show that (f2Ep−[k]+Ep−ε4)(vℓΛ2⊗v−3ℓΛ0)
belongs to ±B(ℓΛ2,−3ℓΛ0)∪{0}.
The bar-invariance is obvious, and it is easily checked that
[TABLE]
We have f2vℓΛ2∈B(ℓΛ2), Epv−3ℓΛ0∈±B(−3ℓΛ0)∪{0} by Lemma 3.3.5, and
[TABLE]
since p1−p4+1<0 implies Ep−ε4v−3ℓΛ0=0 (see the proof of Lemma 3.4.6 (1)).
Hence we have (f2Ep−[k]+Ep−ε4)(vℓΛ2⊗v−3ℓΛ0)∈±B(ℓΛ2,−3ℓΛ0)∪{0}, as required.
The assertion (2) follows from (1) since the map p⊗ℓ∘Φ:V(ℓϖ2)→(W1)⊗ℓ
sends L(ℓϖ2) to L(W1)⊗ℓ.
∎
We need the following relation in Wℓ: there exists a certain element cℓ∈±1+qsA such that
[TABLE]
for p∈Z≥05.
It is a rather straightforward computation, but we will give a proof in Appendix A (Proposition A.1) as it is somewhat lengthy and technical.
Lemma 3.4.15**.**
*Let p∈Z≥05.
(1) We have*
[TABLE]
(2)* When ℓ=1, the following stronger statement holds:*
and hence it follows from Proposition 3.3.8 and (2.5.2) that
[TABLE]
Now the assertion (1) is proved since cℓ∈±1+qsA.
(2) We may assume that Ep−aw1=0, and hence that p4≤p1−1 by Lemma 3.4.10.
Then by (1), it is enough to consider the case p1−p4≥2.
First assume that p1−p4=2.
By (3.4.16) and (3.4.18), it suffices to show that
[TABLE]
and we may assume that the two vectors are both nonzero.
Since the two vectors f2Ep−a+ε4(vΛ2⊗v−3Λ0) and vΛ2⊗Ep−av−3Λ0
both belong to
±B(Λ2,−3Λ0) and are obviously linearly independent,
we see from Lemma 2.4.2 that
f2Ep−a+ε4vϖ2 and Ep−avϖ2 both belong to ±B(ϖ2) and are linearly independent.
Moreover since their P-weights are the same,
(f2Ep−a+ε4vϖ2,z2kEp−avϖ2)=0 if k=0.
Hence (3.4.19) follows from Proposition 2.4.1 (3) and (2.5.1).
It remains to show the assertion in the case p1−p4=3, that is, p1=3 and p4=0.
By the admissibility, we have
[TABLE]
Since Epw1 and f2Ep−aw1 both
belong to L(W1) and Ep−aw1=0 implies p5≥1, this belongs to
q2A. The proof is complete.
∎
Now we show the following proposition, which assures that Z2 belongs to the set in (3.4.13).
Proposition 3.4.16**.**
Let p1,p2∈Z≥05, and set p=p1+p2.
Then we have
[TABLE]
where p=(p1,…,p5) and x(p2)=−⟨h2,wt(Ep2wℓ)⟩.
Proof.
Set pi=(pi1,…,pi5) (i=1,2).
It is directly checked from Lemma 3.4.12 that
[TABLE]
We may assume that Ep1−aw1=0 and Ep2+awℓ=0.
By the induction hypothesis, it follows from Proposition 2.6.1 that the prepolarization (,)Wℓ is positive definite,
and hence Ep2+awℓ=0 implies
Ep2+aw1⊗ℓ=0 by Proposition 3.3.11.
Then it follows from Lemmas 3.4.13 and 3.4.15 that
[TABLE]
The assertion is proved.
∎
Next we shall show that Z1 belongs to the set in (3.4.13).
Lemma 3.4.17**.**
*Assume that p∈Z≥05 satisfies Epw1⊗ℓ=0.
(1) If p1>p4+ℓ, then Ep+ε4w1⊗ℓ=0.
(2) If p4>p5,
then either Ep−ε4w1⊗ℓ=0 or Ep+ε5w1⊗ℓ=0 holds.*
Proof.
(1) First consider the case ℓ=1.
By (the proof of) Lemma 3.4.14 (1) and Lemma 2.4.2, the vector (f2Ep+ε4−[p1−p4−1]Ep)w1 is either [math],
or not proportional to Epw1.
In both cases we have f2Ep+ε4w1=0, and hence the assertion (1) is proved for ℓ=1.
Assume that ℓ>1.
Obviously, Epw1⊗ℓ=0 implies Ep1w1⊗⋯⊗Epℓw1=0 for some p1,…,pℓ∈Z≥05
such that p=p1+⋯+pℓ.
The assumption implies that there exists some k such that pk1−pk4>1, and then Epk+ε4w1=0 holds by the argument for
ℓ=1.
Since the nonzero vectors of the form Ep1′w1⊗⋯⊗Epℓ′w1 are linearly independent by Lemma 3.3.1,
this implies that Ep+ε4w1⊗ℓ is nonzero.
The assertion is proved.
(2) First assume that ℓ=1.
If p5=0, Ep−ε4w1=0 obviously holds, and hence we may assume p5≥1.
That Epw1=0 implies p4≤2 by Lemma 3.4.10,
which forces p4=2 and p5=1.
If
[TABLE]
then Ep+ε5w1=0 follows, and hence we may assume that p1>p2+p3.
If p3=0, since (2.1.2) implies e1Ei(p2)e10(p1)w1=0,
we have
[TABLE]
which implies Ep−ε4w1=0.
It is also checked similarly that Ep−ε4w1=0 holds if p2=0.
The remaining case is p=(3,1,1,2,1) only, and in this case E(3,1,1,1,1)w1=0 is proved from (3.3.13) and
[TABLE]
The proof for ℓ=1 is complete.
Then the same argument used in the proof of (1) also works here, and (2) for general ℓ is proved.
∎
Lemma 3.4.18**.**
*Let p1,p2∈Z≥05 be such that Ep1w1=0 and Ep2w1⊗ℓ=0.
(1) If p11>p14+1, then m(p1,p2)≥−p21+p24+ℓ.
(2) If p24>p25, then we have m(p1,p2)≥−p14+p15.*
Proof.
(1) By Lemma 3.4.17 (1), we have Ep1+ε4w1=0, and hence m(p1+ε4,p2)≥0 follows
from Lemma 3.4.13.
Since we have
(2) By Lemma 3.4.17 (2), we have either Ep2−ε4w1⊗ℓ=0 or Ep2+ε5w1⊗ℓ=0, and hence either m(p1,p2−ε4)≥0 or m(p1,p2+ε5)≥0 holds.
Since we have
[TABLE]
in both cases m(p1,p2)≥−p14+p15 holds, and the proof is complete.
∎
Now the following proposition implies that Z1 belongs to the set in (3.4.13).
Proposition 3.4.19**.**
Assume that p1,p2∈Z≥05 satisfy Ep1w1=0 and Ep2wℓ=0.
Setting p=p1+p2, we have
[TABLE]
Proof.
Set
[TABLE]
Since ∥Ep1w1∥2∈1+qsA by Proposition 3.3.8 and ∥e2Ep2wℓ∥2∈q2N2−1A by (3.4.11) with p replaced by p2 (which we are assuming to hold), it suffices to show that
[TABLE]
If N2=0, this follows from Lemma 3.4.13.
Moreover if N2=−p24+p25<0, this holds since
[TABLE]
by Lemma 3.4.18 (2).
Finally assume that N2=p21−p24−ℓ.
If p11≤p14+1, then (3.4.22) holds since
[TABLE]
On the other hand if p11>p14+1, (3.4.22) follows from Lemma 3.4.18 (1).
The proof is complete.
∎
Finally, we shall show that Z3+Z4 belongs to the set in (3.4.13),
which completes the proof of Proposition 3.4.9.
By a similar calculation that we did for ∥e2Epwℓ+1∥2, we have
[TABLE]
where
[TABLE]
We have W4=Z4 by Proposition 3.3.11.
Moreover, the equality
[TABLE]
is proved for any p2 by checking X=Ep2 and Y=e2Ep2−ε4 satisfy the assumptions of Lemma
3.3.10, and hence W3=Z3 follows.
On the other hand, the left-hand side ∥e2Epw1⊗(ℓ+1)∥2 belongs to q2min(0,−p4+p5) by Proposition 3.4.7 (1).
Hence in order to show that Z3+Z4(=W3+W4) belongs to the set in (3.4.13),
it is enough to prove that both W1 and W2 do.
The assertion for W1 is deduced from the following lemma.
Lemma 3.4.20**.**
For any p1,p2∈Z≥0, we have
[TABLE]
where we set p=p1+p2.
Proof.
We may assume that Ep1w1=0 and Ep2w1⊗ℓ=0.
We have ∥Ep1w1∥2∈1+qsA by Proposition 3.3.8,
and ∥e2Ep2w1⊗ℓ∥2∈q2min(0,−p24+p25)A by Proposition 3.4.7 (1).
If −p24+p25≥0, the assertion follows from Lemma 3.4.13.
Otherwise we have m(p1,p2)≥−p14+p15 by Lemma 3.4.18 (2), and hence
the assertion is proved.
∎
The assertion for W2 is easily proved from the following lemma and (3.4.20).
Lemma 3.4.21**.**
For any p∈Z≥05, we have
[TABLE]
Proof.
We proceed by the induction on ℓ.
The assertion for the base case of ℓ=1 follows from Lemma 3.4.15 (2).
Assume (3.4.23) for a fixed ℓ and any p.
Our task is to prove this with ℓ replaced by ℓ+1.
We have
holds.
On the other hand, Ep2w1⊗ℓ=0 implies p21≥p24 by Lemma 3.4.10.
Since
[TABLE]
by Lemma 3.4.12, it also follows from the induction hypothesis that
[TABLE]
The proof is complete.
∎
Appendix A
The goal of this appendix is to show the following.
Proposition A.1**.**
Let ℓ∈Z>0.
There exists an element cℓ∈±1+qsA such that
[TABLE]
for any p∈Z≥05.
A fundamental tool for the proof is the braid group action on Uq(g) introduced by Lusztig.
For i∈I, let Ti=Ti,1′′ be the algebra automorphism of Uq(g) in [Lus93, Chapter 37].
For a sequence ip⋯i1 of elements of I, write Tip⋯i1=Tip⋯Ti1.
Here we collect the properties of Ti; for the proofs, see [Lus90, Lus93].
Lemma A.2**.**
(a)
For i∈I and α∈Q, we have TiUq(g)α=Uq(g)si(α).
2. (b)
For i,j∈I and p∈Z>0, we have
[TABLE]
3. (c)
For i,j∈I, we have cijcji+2TiTj⋯=cijcji+2TjTi⋯.
4. (d)
If ip⋯i1 is a reduced word, then Tip⋯i2(ei1)∈Uq(n+).
Moreover, if we further assume that sip⋯si2(αi1)=αj for some j∈I,
then we have Tip⋯i2(ei1)=ej.
5. (e)
Let i,j∈I be such that cij=cji=−1 and p∈Z>0. Then we have
[TABLE]
6. (f)
Let M be an integrable Uq(g)-module, and i∈I. There is a Q(qs)-linear automorphism Ti
(denoted by Ti,1′′ in **[Lus93]**) satisfying Ti(Xm)=Ti(X)Ti(m) for X∈Uq(g) and m∈M.
Moreover if m∈Mλ for λ∈D−1P and fim=0, we have
[TABLE]
for p∈Z≥0, where we set λi=⟨hi,λ⟩.
Lemma A.3**.**
The word ji=(jL′⋯j0iL⋯i0) is reduced.
Proof.
For any 0≤k≤L, we have
[TABLE]
which implies sjsi[L,k+1](αik)∈R1+.
This, together with Lemma 3.1.1 (4), implies the assertion.
∎
In the sequel, we write i0=i[L,1] and j0=j[L′,1] for short.
Lemma A.4**.**
Let M be an integrable Uq(g)-module, v∈M∖{0}, and p∈Z>0.
(1)
If eiv=0(i∈{1}⊔J∖{2}) and e1e2v=0, then Tj(e1)v=0.
2. (2)
If eiv=0(i∈{1}⊔J∖{2}), then Tj01(e2(p))v=E1j(p)v=(−q)pTj(e1(p))v.
3. (3)
If eiv=0(i∈J∖{2}), then Tj0(e2(p))v=Ej(p)v.
4. (4)
We have Ti01(e2)=e1Ti0(e2)−q−1Ti0(e2)e1.
5. (5)
If eiv=0(i∈I0), then Ti1(e0)v=Ei10v.
6. (6)
We have e1Ti0(e2(p))=Ti0(e2(p−1))Ti01(e2)+q−pTi0(e2(p))e1.
7. (7)
If e1v=0, then e1Tj0(e2(p))v=Tj0(e2(p−1))Tj01(e2)v.
8. (8)
If eiv=0(i∈I01), then Ti0(e2)e1(p)v=e1(p−1)Ti(e1)v.
9. (9)
If eiv=0(i∈I0), then Ti(e1)e0(p)v=e0(p−1)Ti1(e0)v.
10. (10)
*We have Tj(e1)e0(p)=e0(p−1)Tj1(e0)+q−pe0(p)Tj(e1).
*
11. (11)
We have Tj(e1)e1(p)=qpe1(p)Tj(e1).
12. (12)
We have e1Tj1(e0)Ti1(e0)=Tj1(e0)Ti1(e0)e1.
13. (13)
If eiv=0(i∈I0∖{1,2}), then Ti0(e2(p))v=Ei(p)v=apTji0(e2(p))v with some nonzero a∈Q(qs).
Proof.
Let us prepare some notation.
For a subset L⊆I and Λ∈−P+, denote by VL(Λ) the Uq(gL)-submodule of V(Λ) generated by vΛ, which is isomorphic to the simple
lowest weight Uq(gL)-module whose lowest weight is the restriction of Λ on ∑i∈LD−1hi.
Let us prove the assertion (1).
Set J′={1}⊔J, and ℓ=max{m∈Z≥0∣e2(m)v=0}.
By the well-known fact for the defining relations (see the proof of Lemma 3.3.7),
there is a Uq(n+,J′)-module homomorphism from VJ′(−ℓΛ2) to M mapping v−ℓΛ2 to v.
Hence we may assume that v=v−ℓΛ2,
and then the assertion (1) is proved as follows: By Lemma A.2(b) and (f),
[TABLE]
Next we shall prove the assertion (2).
As above, we may assume that v=v−ℓΛ2 for some ℓ∈Z>0.
The first equality is proved using Lemma A.2(f) as follows:
and since f1Tj0(e2(k))v=0, e1(p)Tj0(e2(k))v=0 holds unless k=p.
Now the second equality is proved similarly as above.
The proofs of the assertions (3)–(5) are similar.
The assertion (6) is proved as follows: By Lemma A.2(b) and (e), we have
The assertion (11) is proved as follows: By Lemma A.2(e), we have
[TABLE]
The assertion (12) is proved as follows: Since s2s1(α2)=α1, from Lemma A.2(d), it follows that
[TABLE]
Finally let us show the assertion (13).
As above, setting ℓ=max{m∈Z≥0∣e2(m)v=0}, we may assume that v=v−ℓΛ2,
and the first equality is proved similarly.
To prove the other one, note first that \mathrm{wt}_{P}\big{(}T_{\bm{j}\bm{i}_{0}}(e_{2}^{(p)})\big{)}=p\theta_{1}, and
[TABLE]
which is proved by taking the classical limit and applying the Poincaré–Birkhoff–Witt theorem.
Moreover, since
[TABLE]
we have Tji0(e2(p))v=0 if and only if 0≤p≤ℓ.
Hence for each 1≤p≤ℓ there is some nonzero ap∈Q(qs) such that apTji0(e2(p))v=Ei(p)v,
and Tji0(e2(p))v=Ei(p)v=0 if p>ℓ.
It remains to prove that ap=a1p, which we show by the induction on p. The case p=1 is trivial.
Assume that p>1.
By Lemma 3.3.4 and weight considerations, we see that eiEi(p−1)v=0 for i∈I0∖{1,2},
and hence it follows from the induction hypothesis that
[TABLE]
(note that E_{\bm{i}}^{(p)}\neq\Big{(}E_{\bm{i}}^{(1)}\Big{)}^{(p)} by our convention (3.1.1)).
Hence it suffices to show that Ei(1)Ei(p−1)v=[p]Ei(p)v.
It is proved by a direct calculation that
[TABLE]
which implies Ei(1)Ei(p−1)v=[p]Ei(p)v by (A.1).
The proof of (13) is complete.
∎
Lemma A.5**.**
For any ℓ∈Z>0 and (p1,p2,p3)∈Z≥03, we have
[TABLE]
Proof.
If p1<p2, the left-hand side is [math] by (2.1.1), and so is the right-hand side since
[TABLE]
Hence we may assume that p1≥p2.
Set
[TABLE]
We have
[TABLE]
by Lemma 3.3.4 and (2.1.2), and therefore we have the following;
[TABLE]
where a number over an equality indicates which assertion of Lemma A.4 is used there.
Since eiw=0 for i∈I0∖{2} and e1e2w=0, we have the following;
[TABLE]
Finally, we have
[TABLE]
The assertion is proved.
∎
Proof of Proposition A.1. By (2.1.2) and Lemma A.5, we have
[TABLE]
Hence it suffices to show that Eawℓ=cℓf2wℓ holds for some cℓ∈±1+qsA.
We see from Proposition 3.1.2 (C1) that dimWℓϖ2−α2ℓ=1,
and hence we have Eawℓ=cℓf2wℓ for some cℓ∈Q(qs).
Now cℓ∈±1+qsA follows since both ∥Eawℓ∥2 and ∥f2wℓ∥2 belong to 1+qsA.
The proof is complete. ∎
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BS 20] R. Biswal and T. Scrimshaw. Existence of Kirillov–Reshetikhin crystals for multiplicity free nodes. Publ. Res. Inst. Math. Sci. , 56(4):761-778, 2020.
2[CP 94] V. Chari and A. Pressley. A guide to quantum groups , Cambridge University Press, Cambridge, 1994.
3[DFK 08] P. Di Francesco and R. Kedem. Proof of the combinatorial Kirillov-Reshetikhin conjecture. Int. Math. Res. Not. IMRN , (7):Art. ID rnn 006, 57, 2008.
4[Her 06] D. Hernandez. The Kirillov-Reshetikhin conjecture and solutions of T 𝑇 T -systems. J. Reine Angew. Math. , 596:63–87, 2006.
5[Her 10] David Hernandez. Kirillov–Reshetikhin conjecture: the general case. Int. Math. Res. Not. IMRN , (1):149–193, 2010.
6[HKO + 99] G. Hatayama, A. Kuniba, M. Okado, T. Takagi, and Y. Yamada. Remarks on fermionic formula. In Recent developments in quantum affine algebras and related topics (Raleigh, NC, 1998) , volume 248 of Contemp. Math. , pages 243–291. Amer. Math. Soc., Providence, RI, 1999.
7[HKO + 02] G. Hatayama, A. Kuniba, M. Okado, T. Takagi, and Z. Tsuboi. Paths, crystals and fermionic formulae. In Math Phys odyssey, 2001 , volume 23 of Prog. Math. Phys. , pages 205–272. Birkhäuser Boston, Boston, MA, 2002.
8[Kac 90] V.G. Kac. Infinite-dimensional Lie algebras . Cambridge University Press, Cambridge, third edition, 1990.