This paper develops a multiplication formula for certain basis elements in quantum affine algebras related to affine flag varieties, leading to new stabilization algebras and isomorphisms of coideal subalgebras with compatible bases.
Contribution
It introduces a multiplication formula for standard basis elements in quantum affine coideal subalgebras and constructs new stabilization algebras with isomorphic structures.
Findings
01
Established a multiplication formula for standard basis elements.
02
Constructed stabilization algebras from affine flag variety geometry.
03
Proved isomorphisms between coideal subalgebras with compatible bases.
Abstract
We establish a multiplication formula for a tridiagonal standard basis element in the idempotented coideal subalgebras of quantum affine gln arising from the geometry of affine partial flag varieties of type C. We apply this formula to obtain the stabilization algebras K˙nc, K˙n, K˙n and K˙η, which are idempotented coideal subalgebras of quantum affine gln. The symmetry in the formula leads to an isomorphism of the idempotented coideal subalgebras K˙n and K˙n with compatible monomial, standard and canonical bases.
Equations429
[B]∗[A]=S,T∑vhS,Tn(S,T)[AS,TS]b[AS,T],
[B]∗[A]=S,T∑vhS,Tn(S,T)[AS,TS]b[AS,T],
[ab]=1≤i≤b∏v2i−1v2(a−i+1)−1,[a]=[a1], and [a]!=1≤i≤a∏[i].
[ab]=1≤i≤b∏v2i−1v2(a−i+1)−1,[a]=[a1], and [a]!=1≤i≤a∏[i].
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
Affine flag varieties and quantum symmetric pairs, II. Multiplication formula
Zhaobing Fan and Yiqiang Li
School of science, Harbin Engineering University, Harbin, China 150001
We establish a multiplication formula for a tridiagonal standard basis element in the idempotent version, i.e., the Lusztig form, of the coideal subalgebras of
quantum affine gln arising from the geometry of affine partial flag varieties of type C.
We apply this formula to obtain the stabilization algebras K˙nc, K˙n, K˙n and K˙η,
which are idempotented coideal subalgebras of quantum affine gln.
The symmetry in the formula leads to an isomorphism of the idempotented coideal subalgebras K˙n and K˙n with compatible monomial, standard and canonical bases.
In this article, we continue our study in [FLLLWa], joint with Chun-Ju Lai, Li Luo and Weiqiang Wang, of the Schur algebras and their stabilization algebras of affine n-step partial flag varieties of type C.
As the main result in this paper, we establish a multiplication formula for a tridiagonal standard basis element in these algebras.
This result was supposed to be included in loc. cit.
as a critical first step, but was extracted from the loc. cit. partly due to the length of the paper.
Instead, a more conceptual multiplication formula of a new generator, denoted by fA, was used as a substitute in loc. cit.
A third multiplication formula is further secured in [FLLLWb] via a Hecke-algebra approach.
All three formulas look drastically different, have their own advantage, and coexist coherently.
They reflect the richness of (the structure of) these algebras, even though the establishment of each one of them is a painstaking task.
The multiplication formula in this article possesses a remarkable symmetry and, as an application, it
yields an isomorphism of two seemingly-different classes of Schur algebras in [FLLLWa] with compatible monomial, standard and canonical bases.
The proof of the latter isomorphism result is the only one available as far as we know.
As a second application, the multiplication formula in the setting of affine Grassmannian in type C should lead to an explicit formula for parabolic affine Kazhdan-Lusztig polynomials similar to [LW15, Section 7].
We expect our formula to play a role in categorifications of these algebras as well.
In what follows, we discuss in more details the background and results of this article.
0.1. Overview
It is well-known that the convolution algebras of flag varieties provide a natural geometric model for Hecke algebras.
As an important feature from this model, the Kazhdan-Lusztig bases [KL79] of the Hecke algebras can be interpreted as
intersection cohomology complexes therein and from which one can deduce nontrivial properties such as positivity.
Later, Beilinson, Lusztig and MacPherson [BLM90]
observed that partial flag varieties of type A are a geometric setting for quantum
gln.
For other classical partial flag varieties, it is only known recently that
they are governed by coideal subalgebras of quantum gln ([BKLW14, BLW14]).
There is an affinization of the above results making a connection between affine flag varieties of type A and C and
quantum affine gln/sln [GV93, Lu99, Lu00, SV00, Mc12]
and their coideal subalgebras ([FLLLWa]).
More precisely, we provide a description of
the convolution algebra of affine partial flag varieties of type C in the work [FLLLWa].
Among others, we show that it is controlled by certain coideal subalgebra of quantum affine gln
and in turn provides canonical bases for the latter algebras.
As a crucial ingredient, we show that the convolution algebra
admits a set of bar-invariant multiplicative generators, denoted by fA therein, parametrized by
certain tridiagonal matrices. Roughly speaking, the bar-invariant basis fA corresponds to a product of Chevalley generators
in higher-rank convolution algebras in a specific order.
In particular, one can derive a multiplication formula for fA by repetitively applying
the multiplication formulas for Chevalley generators, which turns out to be simple.
This leads to a construction of
the idempotented version of the associated coideal subalgebras of quantum affine gln and their canonical bases
after a suitable stabilization following [BLM90] and [FL14].
There is yet another natural set of multiplicative generators consisting of the tridiagonal
standard basis elements [A],
which are parametrized by the same set of tridiagonal matrices for the generators fA.
The transition matrix of the two bases turns out to be unitriangular.
The purpose of this paper is to establish a multiplication formula for the tridiagonal standard basis elements [A],
which then provides a direct construction of the affine coideal subalgebras of quantum affine gln and their canonical bases in [FLLLWa]
with some further new and interesting symmetries.
0.2. Main results
Since we know essentially the multiplication formula for fA,
the complexity to establish the multiplication formula for a tridiagonal basis element [A]
is incorporated in the transition matrix of the two bases,
which ends up producing coefficients involving terms (vm−1) for various m.
The latter terms vanish in finite types or affine type A since fA and [A] coincide for the necessary matrices in these cases and
hence the transition matrix is the identity matrix.
A rough form of the multiplication formulas is as follows, and we refer to (5), (6), (18),
(25), (77) and (79) for unexplained notations.
Let α=(αi)i∈Z∈NZ such that αi=αi+n for all i∈Z.
If A,B∈Ξn,d satisfy that co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal,
then we have
[TABLE]
where the sum runs over all S,T∈Θn subject to Condition (21),
ro(S)=α and ro(T)=αJ,
A−T+Tˇ∈Θn, and AS,T∈Ξn,d.
In many respects, the way we derive this formula has many similarities to, and is partially based on,
the one on quantum affine gln constructed in [FL15].
Note that the latter formula is first discovered in [DF13] via a Hecke-algebraic approach.
Besides the new construction in [FL15], the identification of the affine type-A analogue of fA and [A] for A bidiagonal indeed gives
an easier way to deduce this formula.
Even though the multiplication formula is rather involved,
we are able to obtain sufficient conditions on when a leading term with coefficient 1 is produced under such multiplication,
which allow us to observe a BLM-type stability property as d goes to ∞.
The stabilization also allows us to formulate a limit algebra K˙nc for the family of the convolution algebras {Sn,dc}d≥1.
The algorithm for the construction of a monomial basis for Sn,dc leads to an algorithm for a monomial basis for K˙nc.
The algebra K˙nc admits a monomial basis and a canonical basis.
One can define another algebra Knc so that K˙nc is identified with
the idempotented version of a coideal subalgebra of quantum affine gln as is shown in [FLLLWa].
Similarly, the other families of convolution algebras {Sn,d}d,{Sn,d}d,
and {Sη,d}d
admit similar stabilizations which lead to limit algebras K˙n,K˙n and K˙η, respectively.
We also establish the counterparts of Theorem B for the algebras K˙n,K˙n and K˙η, which require
some additional work (it follows a strategy similar to [FL14]).
Despite quite complicated, the structure constants in
the multiplication formula in Theorem A manifest remarkable symmetries,
reflecting the shift by half-period in parametrization matrices,
which allow us to show that
There is an isomorphism K˙n≅K˙n with compatible monomial, standard and canonical bases.
Simultaneously, a Hecke-algebraic approach has been developed in a companion paper [FLLLWb], which
reproduces most of the main results of this paper in different forms.
In light of a result in loc. cit.
the algebras denoted by the same notations K˙nc, K˙n, K˙n and K˙η
in the paper and [FLLLWa, FLLLWb] are isomorphic and they are idempotent versions
of coideal subalgebras of quantum affine gln.
Having the three approaches available indicates the rich structures in these algebras arising from geometry.
0.3. The organization
In Section 1, we recall the setting from [FLLLWa] on the convolution algebras Sn,dc, Sn,d, Sn,d and Sη,d.
In Section 2,
we obtain a multiplication formula for a tridiagonal standard basis element in
the convolution algebra Sn,dc. The proof is rather involved taking up the whole long section, and
the formula
is the key to the remaining sections on the structures of Sn,dc which leads to the construction of the limit algebra K˙nc.
In Section 3,
we obtain a monomial basis for the convolution algebra Sn,dc
based on the multiplication formula obtained in Section 2. In particular,
it follows that the standard basis elements parametrized by tridiagonal matrices form a generating set for the algebra Sn,dc.
This multiplication formula admits a remarkable stabilization property which allows us
to construct a limit algebra K˙nc for the family of convolution algebras {Sn,dc}d.
We then construct a monomial basis and canonical basis for K˙nc, as well as a
surjective homomorphism from K˙nc to Sn,dc.
In Section 4,
we adapt the multiplication formula from Section 2 for
the other variants of convolution algebras: Sn,d, Sn,d, Sη,d.
This then allows us to construct the corresponding limit algebras K˙n, K˙n, and K˙η, respectively.
Monomial bases and canonical bases for these algebras are constructed.
0.4. Acknowledgement
The paper is grown out from the Project [FLLLWa, FLLLWb] and thus we thank our collaborators for fruitful collaborations and
their generosity in sharing their ideas and allowing us to publish this paper separately.
We also thank our collaborators Chun-Ju Lai and Li Luo for cross-checking our multiplication formula and are grateful for Weiqiang Wang for his leadership and tuning up an earlier version of this article.
Z. Fan is partially supported by the NSF of China grant 11671108, the NSF of Heilongjiang
Province grant LC2017001 and the Fundamental Research Funds for the central universities
GK2110260131.
Y. Li is partly supported by the National Science Foundation under the grant DMS 1801915.
In this section, we recall the setting from [FLLLWa] and fix some notations.
There is no new result in this section.
1.1. The space of affine flags of type C as symplectic lattice chains
Let N={0,1,2,…} and Z={0,±1,±2,…}.
For a∈Z and b∈N, we define
[TABLE]
Let k be a finite field of q elements.
Let F=k((ε)) be the field of formal Laurent series over k and o=k[[ε]]
the ring of formal power series.
Let V be an F-vector space. A lattice L in V is a free o-module such that L⊗oF=V.
Assume further that V is equipped with a non-degenerate symplectic form (−,−). Hence V is even dimensional, say 2d.
Let Sp(V) be the group of isometries with respect to the form (−,−).
For any lattice L∈V, we set L#={v∈V∣(v,L)⊆o}.
Then the space L# is a lattice of V such that (L#)#=L.
The # operation enjoys the following properties that we shall use freely later on.
For any two lattices L,L′ of V,
(L+L′)#=L#∩L′#
and (L∩L′)#=L#+L′#.
We are interested in the symplectic lattices, which are those homothetic to a lattice Λ such that
εΛ⊆Λ#⊆Λ.
Once and for all, we fix an even number
[TABLE]
Let Xn,dc be the set of all chains L=(Li)i∈Z of symplectic lattices in V subject to the following conditions.
[TABLE]
The group Sp(V) acts naturally on Xn,dc.
Let
[TABLE]
For each λ∈Λn,dc, we set
[TABLE]
where ∣Li/Li−1∣ is the dimension of Li/Li−1 as a k-vector space.
Then we have
[TABLE]
as the union of Sp(V)-orbits in Xn,dc.
From the analysis of [Sa99], [H99] (see also [FLLLWa, Section 3.2]), we see that Xn,dc(λ)
can be naturally identified with the homogeneous space
Sp(V)/P where P is a certain parahoric subgroup.
Hence Xn,dc is a local model of the ind-variety of affine partial flags of type C over k.
1.2. Parametrization matrices
The Sp(V)-action on Xn,dc extends diagonally on the product Xn,dc×Xn,dc.
We recall a parametrization of Sp(V)-orbits in Xn,dc×Xn,dc.
Let
Θn,d
be the set of all matrices A=(aij)i,j∈Z with entries in N such that
[TABLE]
To a matrix A∈Θn,d, we associate its row/column vector
ro(A)=(ro(A)i)i∈Z and co(A)=(co(A)i)i∈Z by
[TABLE]
Let
[TABLE]
We set Eij to be the matrix whose entry at (k,l) is
1 if (k,l)≡(i,j) mod n and zero otherwise.
We also set
[TABLE]
For later use, let
[TABLE]
Clearly, there is a bijection
[TABLE]
To a pair (L,L′)∈Xn,dc×Xn,dc,
we can attach a matrix A∈cΞn,d whose (i,j)-th entry is given by
[TABLE]
From [FLLLWa, Proposition 3.2.2], the correspondence (L,L′)↦A yields a bijection
[TABLE]
We shall denote OA for the Sp(V)-orbit parametrized by A.
Let eA be the characteristic function of OA.
Under the isomorphism (7), we can also parametrize the Sp(V)-orbits in Xn,dc×Xn,dc
by the set Ξn,d.
The notation eA also makes sense for a matrix A∈Ξn,d.
1.3. The convolution algebra Sn,dc
Let Sn,dc be the vector space over Q(v) spanned by the elements eA for A∈cΞn,d.
There is a multiplication on Sn,dc defined by
[TABLE]
where the specialization of the polynomial gA,BC(v) at q is given by
[TABLE]
for any fixed pair (L,L′)∈OC.
It is known that gA,BC=0 for all but finitely many C.
The algebra Sn,dc is the convolution algebra on Xn,dc and is called the Schur algebra in [FLLLWa].
To each A∈cΞn,d, we set
[TABLE]
and
[TABLE]
Clearly, the various elements [A] form a basis for Sn,dc, called the standard basis of Sn,dc.
Define a partial order ≤alg on cΞn,d by
[TABLE]
We write A<algB if further A=B.
By “lower terms (than [B])”, we refer to the terms [A] with A<algB, ro(A)=ro(B) and co(A)=co(B).
There is a bar operator \bar{}on∗∗S∗∗nc,dsatisfying¯v=v−1and¯[A]=[A]+lowerterms.ToeachmatrixA,thereisauniqueelementAin∗∗S∗∗nc,dthatisbar-invariantandA−[A]∈∑B¡algAv−1Z[v−1][B].TheA{}^{\prime}sclearlyformabasisof∗∗S∗∗nc,d,calledthecanonicalbasisof$S^c_n,d.
1.4. Three variants
We now set
[TABLE]
We consider the subset Ξn,d of Ξn,d defined by
[TABLE]
We define an idempotent in Sn,dc by
[TABLE]
where the sum runs over all diagonal matrices in Ξn,d.
We define the subalgebra Sn,d of Sn,dc by
[TABLE]
It is known from [FLLLWa, Section 7.1] that Sn,d inherits from Sn,dc a basis of characteristic functions eA,
a standard basis [A] and a canonical basis {A} parametrized by the set Ξn,d.
On the other hand, we consider the subset Ξn,d of Ξn,d given by
[TABLE]
We define j0 for Ξn,d in exactly the same way as jr in (12) and we set
[TABLE]
It is known again from [FLLLWa, Section 8.1] that Sn,d inherits from Sn,dc a basis of characteristic functions eA,
a standard basis [A] and a canonical basis {A} parametrized by the set Ξn,d.
Finally, we set η=n−1=2r and
[TABLE]
We define
[TABLE]
and we know from [FLLLWa, Section 8.4] that
Sη,d inherits from Sn,dc a basis of characteristic functions eA,
a standard basis [A] and a canonical basis {A} parametrized by the set Ξη,d.
2. Multiplication formula for tridiagonal standard basis elements
In this section, we obtain a multiplication formula in the convolution algebra Sn,dc
for a tridiagonal standard basis element.
The formula
is the key to the remaining sections on the structures of Sn,dc which leads to the construction of the limit algebra K˙c.
The proof of the formula is rather involved, taking up the whole section.
Note that the formulation for the multiplication formulas in this section use the index set cΞn,d in (4) for bases of Sn,dc,
as it is most convenient to use cΞn,d in its proof.
It will be reformulated in terms of Ξn,d in Section 3.
2.1. The formula
Let n=2r+2 with r≥0. We denote
[TABLE]
We also denote
[TABLE]
Where I is the identity matrix.
We define a (row shift) bijection ˇ:Θn→Θn by sending S=(sij) to
[TABLE]
Given A,S,T∈Θn, we set
[TABLE]
If we write AS,T=(aij′)i,j∈Z, then aij′=ai+n,j+n′ for all i,j∈Z.
But aij′ may be negative, so AS,T is not in Θn in general.
Consider the following subset Ξn of Θn:
[TABLE]
Lemma 2.1**.**
Let A∈Ξn and S,T∈Θn be such that AS,T∈Θn.
Then we have AS,T∈Ξn if and only if
S,T satisfy
[TABLE]
Proof.
By substituting i with i−1 in Condition (21), we have
si−1,j−ti−1,j=t−i,−j−s−i,−j.
Denoting AS,T=(aij′), we have thus obtained
[TABLE]
It now follows that aij′=a−i,−j′, whence AS,T∈Ξn.
The above argument can be reversed to establish the opposite direction.
∎
Let
[TABLE]
Recall the quantum v-binomials from (1).
For S=(sij) and AS,T=(aij′), we set
[TABLE]
Given three sequences α=(αi)i∈Z,γ=(γi)i∈Z and β=(βi)i∈Z
in NZ such that their entries are all zeros except at finitely many places,
we define
[TABLE]
where the sum runs over all upper triangular matrices σ=(σij)∈MatZ×Z(N)
such that ro(σ)=β and co(σ)=γ.
Given a sequence a=(ai)i∈Z, we define the sequence
aJ whose i-th entry is a−i for all i∈Z.
We set
[TABLE]
where Si and Ti are the i-th row vectors of S and T, respectively, and n(α,γ,β) is in (24).
To α=(αi)i∈Z∈ZZ, we set
[TABLE]
Recall the subset cΞn,d of Ξn from (4). Given A∈cΞn,d and S,T∈Θn, we denote
[TABLE]
We can now state the general multiplication formulas for the convolution algebra Sn,dc;
for notations AS,T, [AS,TS]c and n(S,T) see (20), (23) and (25).
Theorem 2.2**.**
Let α=(αi)i∈Z∈NZ such that αi=αi+n for all i∈Z.
If A,B∈cΞn,d satisfy co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal, then we have
[TABLE]
where the sum runs over S,T∈Θn subject to
Condition (21), ro(S)=α, ro(T)=α#,
A−T+Tˇ∈Θn, AS,T∈cΞn,d.
We make some remarks before providing the proof of this theorem.
Remark 2.3**.**
The matrix AS,T depends only on A, Si, Ti for i∈[0,r]. Indeed,
by symmetries at (0,0) and (r+1,r+1), the matrix AS,T is completely determined
by the entries aij′ for 0≤i≤r+1.
Furthermore, for 1≤i≤r, the entry aij′ is clearly determined by A and Sk, Tk for k∈[0,r].
For i=0, we use (22) to get
a0j′=a0j+s0,j−t0,j−(s0,−j−t0,−j).
For i=r+1, Condition (21) allows us to rewrite
ar+1,j′=ar+1,j+sr,−j−tr,−j+(sr,j−tr,−j).
Remark 2.4**.**
If S and T satisfy
[TABLE]
for some i∈[0,r] and k, then
the structural constant n(Si,Ti,S−i−1J), and hence n(S,T) as well as the coefficient of eAS,T in (28),
must be zero. This is because the summation
in n(Si,Ti,S−i−1J) is taken over upper triangular matrices
σ such that ro(σ)=S−i−1J and co(σ)=Ti, which is empty if (29) is assumed.
This allows to reduce the general multiplication formula to the special cases available for comparisons.
In particular, the general formula (28) is compatible with the formula for Chevalley generators in [FLLLWa, Lemma 4.3.1].
The remainder of this section is devoted to the proof of Theorem 2.2.
In the proof, we shall work over a finite field Fq, and all the quantum numbers and quantum binomial coefficients
(defined via the indeterminate v)
are understood below at the specialization v=q (i.e., v2=q).
2.2. Toward a proof I: type A counting
Let V be a finite dimensional vector space over Fq.
Let us fix a flag W=(0=W0⊆W1⊆⋯⊆Wm=V) of type w=(wi)1≤i≤m, i.e.,
∣Wi/Wi−1∣=wi for all 1≤i≤m.
To a sequence a=(ai)1≤i≤m∈Nm, we set
[TABLE]
The following lemma can be found in [Sch06, Example 2.4], see also Remark 2.13 for a proof.
Lemma 2.6**.**
We have
#Ya(W)=q∑i>kai(wk−ak)∏1≤i≤m[wiai].
Let σ be an upper triangular matrix such that ro(σ)=w.
Let t=co(σ) and Ft(V) be the set of all flags in V of type t.
Consider the set
[TABLE]
Here W=(Wi)1≤i≤m is a fixed flag of type w.
Lemma 2.7**.**
The cardinality of Ft,σW is given by
[TABLE]
Proof.
We fix j−1 steps F1,⋯,Fj−1 such that
Wi−1∩Fj′+Wi∩Fj′−1Wi∩Fj′=σi,j′ for all 1≤i≤m and 1≤j′≤j−1.
We want to determine the number of choices of Fj such that Fj−1⊆Fj⊆Wj and
Wi−1∩Fj+Wi∩Fj−1Wi∩Fj=σij for all 1≤i≤m.
Via the reduction to Wj/Fj−1, this is the same as counting the number of choices of Fˉj in Wj/Fj−1 such that
[TABLE]
Note that Fj−1Wi+Fj−1−Fj−1Wi−1+Fj−1=wi−Wi−1∩Fj−1Wi∩Fj−1=wi−∑j−1≥lσil.
By Lemma 2.6, this number is equal to
[TABLE]
Taking product over all j and using wk−∑j≥lσkl=∑j<lσkl, we have proved the lemma.
∎
Let
[TABLE]
be two partial flags of V. We set
[TABLE]
To a triple (s,t,t′) in (Nm)3, we define
[TABLE]
be the set of all subspaces U such that V1⊆U⊆V3 and subject to
the following conditions:
[TABLE]
Note that Condition (34-iii) is equivalent to the following condition:
[TABLE]
Notice also that ∣U∣=∣V2∣−∑1≤j≤msj+∑1≤j≤mtj′, if U∈Ys,t,t′.
Recall n(α,γ,β) from (24). To a sequence of length m,
we can regard it as a sequence indexed by Z by setting the value at the undefined positions to be zero.
So the notation n(s,t,t′) for s,t,t′∈Nm is well defined.
Proposition 2.8**.**
The cardinality of Ys,t,t′(V,V′) is given by
[TABLE]
Proof.
We first treat the case when V1=0.
We consider the following two sets:
[TABLE]
We define a map
[TABLE]
It is clear that U∩V2∈Ys′′. Also we have V2U+V2∈Yt′′, thanks to
[TABLE]
So ϕ is well defined.
We shall show that ϕ has constant fiber and hence the cardinality of Ys,t,t′
is reduced to counting the fiber, Ys′′, and Yt′′.
The latter two sets can be identified with Ya(W) in (30),
where (a,W)
is \big{(}(c_{2j}-s_{j})_{1\leq j\leq m},(V_{2}\cap V^{\prime}_{j})_{1\leq j\leq m}\big{)} for Ys′′, and
\big{(}\mathbf{t}^{\prime},(\frac{V_{2}+V_{3}\cap V^{\prime}_{j}}{V_{2}})_{1\leq j\leq m}\big{)} for Yt′′.
So it follows by Lemma 2.6 that
[TABLE]
Let YW,T denote the fiber of a fixed pair (W,T)∈Ys′′×Yt′′ under ϕ.
We shall determine its cardinality.
We recall that the subspaces U in V such that U∩V2=W and V2U+V2=T are parametrized by Hom(T,V2/W).
More precisely, for any x∈Hom(T,V2/W), we can define such a subspace
[TABLE]
in V3 if we fix a linear isomorphism
V3=W⊕V2/W⊕V3/V2.
It is easy to see that for any x∈Hom(T,V2/W), its associated subspace U(x) satisfies Condition (34-i), by definition.
Observing that
[TABLE]
This implies that U(x) satisfies Condition (34-ii) because (U(x)+V2)/V2=T∈Yt′′.
Thus, we have
[TABLE]
Let Ft≡Ft(T) be the set of all partial flags in T of type t.
Let
[TABLE]
be the function defined by
[TABLE]
This is well defined because
[TABLE]
where the last equality is due to (40) and Condition (34-iii*′*).
We shall use π and Ft(T) to compute the cardinality of YW,T.
Consider the flag T′=(Tj′)1≤j≤m associated to T, where
Tj′=T∩V2V2+V3∩Vj′ for all j.
Clearly, we have T′∈Ft′.
Then Ft admits a partition
Ft=⊔σFt,σT′,
where σ runs over all matrices with coefficients in N such that ro(σ)=t′ and co(σ)=t,
and Ft,σT′ is defined in (31).
Let us fix a flag F∈Ft,σT′.
Since Uj(x)⊆Tj′ for all j, we see that the fiber π−1(F) is empty if σ is not upper triangular.
So let us further assume that σ is upper triangular.
By [BLM90], we can decompose T=⊕1≤i,j≤mZij such that ∣Zij∣=σij for all 1≤i,j≤m and
[TABLE]
Meanwhile, we fix a decomposition WV2=⊕1≤j≤m(V2∩Vj−1′+W)/W(V2∩Vj′+W)/W.
We have
[TABLE]
Under the above refinement of the spaces T and V2/W,
the linear maps x in Hom(T,V2/W) can be rewritten as x=⊕1≤i,j,l≤mxijl, where
xijl:Zij→(V2∩Vl−1′+W)/W(V2∩Vl′+W)/W, for all 1≤i,j,l≤m, is the restriction of x to the prescribed subspaces.
Since Zij=0 for all i>j, we have xijl=0 for all i>j.
So U(x) in (39) can be refined to be
[TABLE]
Let us choose and fix a decomposition V3≅W⊕V2/W⊕V3/V2 such that
[TABLE]
By using the descriptions (41), (42),
and the fact that U(x) satisfies Condition (34-i), we see that the subspace U(x) satisfies Condition (34-iii*′*), hence (34-iii), if and only if
[TABLE]
The first condition in the above is equivalent to xijl=0 for all l>j.
Since
Zjj\{0}⊆V2V2+V3∩Vj′\V2V2+V3∩Vj−1′, we see
that zjj+∑1≤l≤mxjjl(zjj)∈Vj−1′ automatically for all zjj∈Zjj−{0}.
Hence the second condition is equivalent to say that ⊕i<jxijj is injective for each j, since ⊕i<jZij⊆Tj−1′⊆Vj−1′.
We then have
[TABLE]
where F is a fixed flag in Ft,σT′.
Observe that the number of xijj such that ⊕i<jxijj is injective, hence of rank tj−σjj is
∏j∏b=0tj−σjj−1(qsj−qb),
if one keeps in mind that the size of the corresponding matrix of ⊕i<jxijj, for each j, is sj×(tj−σjj).
The number of choices for xijl with i,l<j is
q∑b=1j−1σijsb, and the number of choices for xiii for various i is q∑1≤i≤mσiisi.
Thus we have
[TABLE]
Since π−1(F) depends only on σ and s,
we see that the cardinality of the fiber of the restriction YW,T;σ→Ft,σT′ of π, where YW,T;σ:=π−1(Ft,σT′), is constant and given by (43), hence
[TABLE]
where F is any fixed flag in Ft,σT′.
By (43), (44) and (32), we have
[TABLE]
Since YW,T admits a partition YW,T=⊔σYW,T;σ,
where σ runs over all matrices with coefficients in N such that ro(σ)=t′ and co(σ)=t,
its cardinality is given by
[TABLE]
Thus #YW,T is independent of the choice of T and W. Hence ϕ in (37) is surjective and of constant fiber,
which, together with (45), implies that
[TABLE]
Therefore, the proposition follows from (46) and (38) for the case V1=0 (hence c1j=0).
The general case can be reduced to the case V1=0 by taking the quotients with respect to V1.
More precisely, the role of the pair (V,V′) is replaced by
the pair (Vˉ,V′ˉ) where Vˉi=Vi/V1 and Vˉj′=V1Vj′+V1 for all 1≤i≤3 and 1≤j≤m.
As a consequence, we have
[TABLE]
The general case then follows from the case V1=0. The proposition is proved.
∎
Let V∗ be the dual of V. We thus have a canonical pairing ⟨−,−⟩:V∗×V→Fq,(f,u)↦f(u).
Given a subspace U⊆V, we set U♭:={f∈V∗∣f(u)=0,∀u∈U} to be the perpendicular of U with respect to the pairing.
More generally, associated to the flags V=(Vi)0≤i≤4 and V′=(Vi′)0≤i≤m of V in (33)
we define two flags V~=(V~i)0≤i≤4 and V~′=(V~i′)0≤i≤m of V∗ by
[TABLE]
To a sequence s, we set
[TABLE]
(s♭ is a finite analogue of αJ, if we take i∈Z and m=−1.)
Proposition 2.9**.**
The assignment U↦U♭ defines a bijection
[TABLE]
where s′=s+t′−t.
Proof.
Recall that Condition (34-iii) is equivalent to Condition (34-iii*′*), where c2j=c2j(V,V′),
which in turn is the same as the following condition:
[TABLE]
So we have
[TABLE]
On the other hand,
[TABLE]
Thus we have
[TABLE]
where the last equality is due to the definition of s′.
Condition (49) is Condition (34-iii) for U♭ in
Yt′♭,s′♭,s♭(V♭,V′♭).
We note that
[TABLE]
So we have
[TABLE]
Change the index j↔m+1−j, we see that U♭ satisfies Condition (34-i) for Yt′♭,s′♭,s♭(V♭,V′♭).
Tracing backward the above argument, we see that U♭ satisfies Condition (34-ii) for
Yt′♭,s′♭,s♭(V♭,V′♭) can be deduced from Condition (34-i) for U.
So the map defined by U↦U♭ is well defined, and (U♭)♭=U implies that the map is a bijection. The proposition follows.
∎
Corollary 2.10**.**
If Ys,t,t′(V,V′)=\O, then
n(s,t,t′)=n(t′♭,s′♭,s♭) where s−t=s′−t′.
Proof.
The proof of Proposition 2.9 also shows that there are bijections
[TABLE]
for the auxiliary sets in (35) and (36) for Ys,t,t′ in the left and
Yt′♭,s′♭,s♭(V♭,V′♭) in the right.
The corollary then follows from (46).
∎
2.3. Toward a proof II: type C counting
In this section, we assume that V is an even dimensional vector space over Fq equipped with a non-degenerate symplectic form.
As in the previous section, we fix a flag W=(Wi)0≤i≤m of type w=(wi)1≤i≤m.
We require that m=2r+1, and W is isotropic, i.e., Wi⊥=Wm−i for all 0≤i≤m.
For a fixed j, we define
Now we treat the general case. We introduce a new set
[TABLE]
In particular Y~j(V,W;1)=Yj(V,W;1).
Consider the projection
[TABLE]
Fix a flag (Ui)1≤i≤k in Y~j(V,W;k).
Since Uk is isotropic, Uk⊥/Uk inherits a non-degenerate symplectic form from V.
We set Wk=(Wik)1≤i≤m where Wik=UkWi∩Uk⊥+Uk.
Observe that
∣Wik/Wi−1k∣=wi−kδij−kδi,m+1−j for all 1≤i≤m.
Then we have a bijection:
This implies that πk is surjective with constant fiber.
Applying repeatedly (54), we obtain
[TABLE]
The natural projection from
Y~j(V,W;u) to Yj(V,W;u) is surjective
and its fiber is the set of all complete flags in an u-dimensional space over Fq.
Since the cardinality of the latter set is [u]!,
we have #Yj(V,W;u)=#Y~j(V,W;u)/[u]!, from which the lemma follows.
∎
Recall the set Ya(W) in (30), and recall in addition that m=2r+1 and W is isotropic in this section.
Let
where
ξa=∑j<l(wj−aj)al−∑j>l,j+l>m+1ajam+1−l−∑j>r+12aj(aj−1).
Proof.
We set ak=(a1,⋯,ak,0⋯,0) for all 0≤k≤m.
We define a map
[TABLE]
Fix a point Uk∈Yaksp(W), we can form the symplectic space Uk⊥/Uk since Uk is isotropic.
We set Wk=(Wik)1≤i≤m with Wik=(Wi∩Uk⊥)/Uk for all 1≤i≤m in Uk⊥/Uk.
As before, we have
∣Wik/Wi−1k∣=wi−aik−am+1−ik for all 1≤i≤m,
where aik is the i-th entry of ak.
We then have a bijection
where ξj=∑1≤j′<j,j>r+1(wj′−aj′)aj−∑j′<j,j+j′>m+1ajam+1−j′−∑j>r+1aj(aj−1)/2.
So the lemma follows from (57) and that
#Yasp(W)=∏j=1m#πj−1−1(Uj−1) for fixed Uj−1∈Yaj−1sp(W).
∎
Remark 2.13**.**
Lemma 2.6 is a special case of Lemma 2.12 for a=(a1,…,ar−1,0,…,0).
Recall Ys,t,t′(V,V′), Ys′′ and Yt′′ from (34), (35) and (36), respectively.
For V in (33), we further assume that V3⊆V2⊥.
Let
[TABLE]
Proposition 2.14**.**
The cardinality of Ys,t,t′sp(V,V′) in (58) is given by
[TABLE]
where
[TABLE]
Proof.
We treat the V1=0 case first.
Let Yt′′sp={T∈Yt′′∣T⊆T⊥} where T⊥ is taken inside the symplectic space V2⊥/V2.
We have the following commutative diagram.
[TABLE]
where ϕ is defined in (37), the vertical maps are inclusions and ϕsp is the map induced from ϕ.
Now for a pair (W,T) in Ys′′×Yt′′sp, the fiber of (W,T) under ϕ is contained in
Ys,t,t′sp(V,V′) (here we freely use identifications under the inclusions).
This implies that ϕsp is of constant fiber and its fiber is the same as that of ϕ.
Thus #Ys,t,t′sp(V,V′)=#ϕ−1(T,W)⋅#Ys′′⋅#Yt′′sp.
We know #Ys′′ by (38), and #ϕ−1(T,W)=n(s,t,t′) by (45), and by Lemma 2.12,
[TABLE]
where ξt′=∑j<l(c3j−c2j−tj′)tl′−∑j>l>m+1−jtj′tm+1−l′−∑j>r+1tj′(tj′−1)/2.
The proposition for V1=0 follows from these computations.
The general case can be reduced to the V1=0 case by considering the reduction U↦U/V1 as in the proof of Proposition 2.8.
The proposition is proved.
∎
The rest of the section is a description of the duals of the set Yasp(W) and Ys,t,t′sp(V,V′).
Recall Yasp(W) from (56). We set
[TABLE]
Lemma 2.15**.**
The assignment U↦U⊥ defines a bijection
spYa(W)≅Ya^sp(W), where a^=(a^j)1≤j≤m, a^j=wj−am+1−j for all j.
Proof.
Since
∣(U∩Wi)⊥∣=∣U⊥∣+∣Wm−i∣−∣U⊥∩Wm−i∣,
we have
[TABLE]
The lemma is proved.
∎
Recall Ys,t,t′sp(V,V′) from (58). We assume further that there is a non-degenerate symplectic form on V2.
We set
[TABLE]
where U⊥ is taken with respect to the form on V2.
Note that to define spYs,t,t′(V,V′), a form on the whole space V is not needed.
Recall the notations s♭ from (48) and V~ from (47).
Proposition 2.16**.**
We have a bijection Ys,t,t′sp(V,V′)≅spYt′♭,s′♭,s♭(V~,V~′).
Proof.
In the definition of Ys,t,t′sp(V,V′), the assumption that V is equipped with a non-degenerate symplectic form
is not essential. It is still well defined if we assume that V is equipped with a possibly degenerate symplectic form such that V2⊥=V3,
hence V3/V2 inherited a non-degenerate symplectic form from that of V.
With this point, the bijection follows readily from the proof of Proposition 2.9.
∎
2.4. Step 1 of the proof: the piece ZS,T
Recall the setting from Theorem 2.2. Suppose that
eB∗eA=∑gB,AA′eA′, we shall narrow down those A′ which could have nonzero structure constants and interpret the latter as the cardinality of a given set.
Let us fix a periodic chain L of symplectic lattices in Xn,dc(ro(B)) (cf. (2)), for B=(bij)∈cΞn,d.
We consider the set
Here and below ⊆d and ⊇d denote inclusions of codimension d.
Proof.
Since (L,L′′)∈OB, we can decompose V=⊕i,j∈ZMij as Fq-vector spaces
such that εMij=Mi−n,j−n, ∣Mij∣=bij,
Li=⊕k≤ij∈ZMkj and Lj′′=⊕i∈Zl≤jMi,l, for all i,j∈Z.
By the definition of B, we have
[TABLE]
In particular, we have Li−1⊆Li′′⊆Li+1. The second condition in the characterization of Z
is clear. Hence Z is included in the set on the right hand side of the equation in the lemma.
The other direction of inclusion follows from the definition.
∎
Let us fix a second chain L′ in Xn,dc. We set
[TABLE]
We formulate the following condition:
[TABLE]
Associated to S,T∈Θn, we define a subset ZS,T of Z as
[TABLE]
Clearly, {ZS,T} forms a partition of Z.
Lemma 2.18**.**
If ZS,T in (60) is nonempty, then S and T must satisfy Condition (21).
Proof.
For any i,j∈Z, we have
[TABLE]
Thus by the assumption of the pair (S,T) in (59ij), we have
[TABLE]
Moreover, for all j∈Z, we have
[TABLE]
By combining (61) and (62), Condition (21) holds for S and T.
∎
If ZS,T in (60) is nonempty, then ro(S)=α and ro(T)=α# where α# is defined in (26).
Proof.
By definition, we have
[TABLE]
where the second equality follows from the observation that the sequence (Li′′∩Li+Li′′∩Lj′)j∈Z stabilizes
to be Li′′ for j≫0 and to be Li′′∩Li for −j≫0.
Similarly, we have
[TABLE]
The lemma follows.
∎
The following lemma justifies the relevance of the partition Z=⨆ZS,T.
Lemma 2.20**.**
Assume (L,L′′)∈OB and (L′′,L′)∈OA.
If L′′∈ZS,T, then (L,L′)∈OAS,T.
Proof.
Suppose that (L,L′)∈OA′ with A′=(aij′).
We have
[TABLE]
By (63), (61) and the definition of cij in (59), we obtain
[TABLE]
Therefore A′=AS,T.
The lemma is proved.
∎
Summarizing, we have established the following.
Proposition 2.21**.**
Retain the assumptions in Theorem 2.2. Then we have
eB∗eA=∑#ZS,TeAS,T,
where the sum runs over all pairs (S,T) in Θn subject to Condition (21), ro(S)=α and ro(T)=α#,
A−T+Tˇ∈Θn, and AS,T∈cΞn,d.
Proof.
For any pair (L,L′) of symplectic chains, we have
[TABLE]
where the last equality is due to Lemma 2.20.
Lemmas 2.18 and 2.19 guarantee that we can impose the conditions on S and T in the proposition.
∎
2.5. Step 2 of the proof: counting ZS,T
For 0≤i≤r, we introduce an index set Z(i) to be the subset of Z consisting of all integers k∈[−i−1,i] mod n.
Recall from the previous section that we fix a pair (L,L′)∈OAS,T.
Let ZS,T[0,i] be the set of symplectic lattice chains (Lk′′)k∈Z(i) such that Lk′′ satisfies
Lk−1⊆Lk′′⊆Lk+1 and the conditions (59kj) for all k∈Z(i).
We then have the following tower of projections:
[TABLE]
where πi(Lk′′)k∈Z(i)=(Lk′′)k∈Z(i−1) for 0≤i≤r.
We shall show that each πi is of constant fiber and hence the cardinality of ZS,T is a product of the cardinality of the fibers of πi for 0≤i≤r.
So we focus on computing the cardinality of the fiber of πi.
We set
[TABLE]
to be the fiber of Li=(Lki)k∈Z(i−1) under πi for all 0≤i≤r.
Due to the periodicity, i.e., εLm=Lm−n,
the set ZS,Ti(Li), for 1≤i≤r, is in bijection with the set of pairs (L−i−1′′,Li′′) of lattices in VF such that
[TABLE]
(Here VF is a 2d-dimensional symplectic space over F=Fq((ε)).)
The third condition is redundant since it is implied by the first two conditions.
The first condition in (59kj) for k=−i−1 is equivalent to the following condition:
[TABLE]
Indeed, we have
[TABLE]
Thus
[TABLE]
The second condition of (59kj) for k=−i−1 is equivalent to Condition (21) by the argument in the proof of Lemma 2.18.
So the above analysis allows us to identify ZS,Ti(Li) for 1≤i≤r−1 with the set of all lattices L such that
[TABLE]
Recall that we can find a lattice M such that Ln−1⊆M⊆Ln and
M/εM admits a non-degenerate symplectic form over Fq from that on VF over F.
To a lattice L∈VF, we can define L=(L∩M+εM)/εM.
Thus, M, L, and L′ are well defined.
Recall the notation Ys,t,t′(V,V′) from (34). To a matrix M, we write Mi for its i-th row vector.
By Lemma [FLLLWa, Lemma 3.3.3], the assignment L↦L defines a bijection
[TABLE]
where Vi=(Vai)0≤a≤4,
V1i=Li−1i+Li−1, Vki=Li+k−2 for k=2,3, and Vj′=Lj′ for all j∈Z.
Observe that
[TABLE]
where ckj(L,L′) is the ckj in (59) (with i replaced by k) for the pair (L,L′).
So by Proposition 2.8, we have, for 1≤i≤r−1,
[TABLE]
The i=r case in (66) is excluded since
we do not know if L is isotropic, while in other cases it is automatically isotropic because it is contained in the isotropic subspace Lr.
By imposing the condition that L is isotropic, we have a bijection (recall (58))
The remaining case is i=0.
The only difference from the other cases is that L0=∙ does not play a role here.
So we can identify ZS,T0≡ZS,T0(L0) with the set of lattices L such that
[TABLE]
If L−1⊆M, it implies that M#⊆L−1#=L0, and hence
(L0∩M)#=L−1+M#⊆L0.
If further M#⊆M, then (L0∩M)#⊆L0∩M.
On the other hand, if (L0∩M)#⊆L0∩M, we have
M#⊆(L0∩M)#⊆L0∩M⊆M.
So ZS,T0 is in bijection with the set of all lattices L such that
[TABLE]
The symplectic form on VF descends to a non-degenerate symplectic Fq-form on L0/L−1=L0/L0# (but not L1/L−1).
See for example [Lu03, 0.8]. It is assumed that L0 is of
even volume, but it can be generalized to arbitrary volume. Here the volume of a lattice is defined as the volume form on V attached to the symplectic form.
With this information, the condition (L0∩L)#⊆L0∩L is equivalent to
[TABLE]
So
[TABLE]
where the last equality is due to Proposition 2.16 via L↦L#.
By Corollary 2.10, the term n(S−1,T−1,S0J) in (71) can be replaced by n(S0,T0,S−1J).
Hence, by (71),
(67), (68) for r≥1, we see that all πi are surjective with constant fiber, and so
Now we deal the remaining case r=0 for Theorem 2.2, which we will put ∣r=0 whenever appropriate to emphasize this special case.
In this case ZS,T∣r=0 can be identified with the set of lattices such that
[TABLE]
Note that the only difference of the above description of ZS,T∣r=0 from (69) is the extra condition L⊆ε−1L# which holds automatically for the r≥1 case.
If L satisfies the conditions in (72), we have
L⊆L1∩ε−1L#=ε−1(L0#∩L#)=ε−1(L0+L)#.
By taking # and multiplying ε−1 on the first condition in (72), we get L0⊆ε−1L#, so we get
L0⊆ε−1(L0#∩L#).
Hence, we have L0+L⊆ε−1(L0+L)#.
On the other hand, if L0+L⊆ε−1(L0+L)#, we have
L⊆L0+L⊆ε−1(L0+L)#⊆ε−1L#,
that is, L⊆ε−1L#.
So the description (72) is the same as the set of all lattices L such that
[TABLE]
Since L1=ε−1L0#, the quotient space L1/L0 inherits a non-degenerate symplectic Fq-form from VF.
Via the descent L↦L+L0/L0=:L,
the condition L0+L⊆ε−1(L0+L)# is equivalent to the following condition
[TABLE]
So ZS,T∣r=0 is in bijection with the subset Y∣r=0 of
spYS0,T0,S−1J(V0,V′) in (70) defined by the above condition.
The computation of #Y∣r=0 is similar to that of spYS0,T0,S−1J(V0,V′), i.e.,
[TABLE]
where
YS−1J′sp and spYS0′′ are auxiliary sets attached to spYS0,T0,S−1J(V0,V′).
We have
[TABLE]
where ξS−1J=∑j<l(a1j′−s−1,−j)s−1,−l−∑j>l>−js−1,−js−1,l−∑j>1s−1,−j(s−1,−j−1)/2.
Similarly, we have
[TABLE]
where
ξS0J=∑j<l(a0j′−s0,−j)s0,−l−∑j>l>−js0,−js0,l−∑j>1s0,−j(s0,−j−1)/2.
By (73)-(75), we complete the proof of the r=0 case and hence complete the proof of Theorem 2.2.
3. The quantum group K˙nc via the multiplication formula
In this section, we obtain a monomial basis for the convolution algebra Sn,dc
based on the multiplication formula obtained in Section 2.
We observe a stabilization property from this multiplication formula, which allows us
to construct a limit algebra K˙nc for the family of convolution algebras {Sn,dc}d.
We construct a monomial basis and canonical basis for K˙nc, as well as a
surjective homomorphism from K˙nc to Sn,dc.
The index set in (6) for bases of Sn,dc is used
in the formulation of the multiplication formula as well as in further applications in this and later Sections.
3.1. A monomial basis of the convolution algebras
Recall Ξn,d from (6) and the bijection cΞn,d↔Ξn,d from (7).
We first reformulate Theorem 2.2 using the index set Ξn,d.
Set
[TABLE]
Theorem 3.1**.**
Let α=(αi)i∈Z∈NZ such that αi=αi+n for all i∈Z.
If A,B∈Ξn,d satisfy co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal, then we have
[TABLE]
where the sum runs over all S,T∈Θn subject to Condition (21),
ro(S)=α and ro(T)=αJ,
A−T+Tˇ∈Θn, and AS,T∈Ξn,d.
Proof.
Follows by Theorem 2.2 and the bijection between cΞn,d and Ξn,d.
∎
We set
[TABLE]
We now reformulate Theorem 3.1 in terms of the standard basis elements [A].
Theorem 3.2**.**
Let α=(αi)i∈Z∈NZ such that αi=αi+n for all i∈Z.
If A,B∈Ξn,d satisfy co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal,
then we have
[TABLE]
where the sum runs over all S,T∈Θn subject to Condition (21),
ro(S)=α and ro(T)=αJ,
A−T+Tˇ∈Θn, and AS,T∈Ξn,d.
Proof.
By the definition of [A] and Theorem 3.1, we obtain a multiplication formula as stated in the theorem,
where
Then hS,T can be rewritten in the desired form by a direct calculation.
∎
Define a partial order ≤alg on Ξn,d in exactly the same manner as the one on cΞn,d.
Again, by “lower terms (than [A′])”,
we refer to the terms [C] with C<algA′, ro(C)=ro(A′) and co(C)=co(A′).
Proposition 3.3**.**
Let α=(αi)i∈Z∈NZ be such that αi=αi+n for all i.
Let A=(aij) be such that aij=0 if ∣j−i∣≥m for some m>1,
ai,i+m−1≥αi−1 and ai,i−m+1≥αn−i−1 for all i.
Let B∈Ξn,d be such that co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal. Then we have
[TABLE]
where A′=(aij′) is given by
[TABLE]
Proof.
For such a given A=(aij), AS,T is a leading term if S,T satisfy that
[TABLE]
For such S,T, the matrix AS,T is identified with A′ with entries given by (82). It remains to determine the
leading coefficient. Note that
ξA,S,Tb=0,dA′−dA−dB=0, and
[TABLE]
Hence it follows by Theorem 3.2 and (80) that the coefficient for [A′] is 1.
∎
Theorem 3.4**.**
For any A∈Ξn,d, there exist finitely many tridiagonal matrices B(i) such that
[TABLE]
Here the products are taken in a reverse order (such as ⋯∗[B(1)]∗[B(0)] in (83)).
Proof.
For any A=(aij)∈Ξn,d, fix m∈N such that aij=0 for all ∣j−i∣>m.
Let B(0)=(bij) be a diagonal matrix such that bii=∑j=i−mi+maji.
For any i∈[1,m], we define a tridiagonal matrix B(i) such that B(i)−∑1≤j≤nαijEθj,j+1 is diagonal
and αij=∑k=j+i−mjak,j+i.
By the property of the entries of A, we have
αi,n−j=∑k=jj−i+mak,j−i.
By Proposition 3.3, we have the identity (83).
Recall by definition of {B} in Section 1.3, we have {B}=[B]+lower terms.
One further checks that the products of the lower terms arising from {B(i)} produce terms lower than [A],
and hence mA has the desired property.
The theorem follows.
∎
For each A∈Ξn,d, we fix one such choice of mA as given in the proof of Theorem 3.4.
Corollary 3.5**.**
The set {mA∣A∈Ξn,d} forms a basis of Sn,dc.
We shall call the basis {mA∣A∈Ξn,d} a monomial basis of Sn,dc.
3.2. Monomial basis and canonical basis of K˙nc
For A∈MatZ×Z(Z) we set
[TABLE]
where I is the identity matrix.
Set
Ξn
to be the set of all matrices A=(aij)i,j∈Z such that
aij∈N, for all i=j, aii∈Z,
aij=a−i,−j=ai+n,j+n and ∑i=1n∑j∈Zaij is finite.
This is a generalization of the set Ξn:=⊔dΞn,d
by dropping the positivity condition on the diagonal entries.
For any given A∈Ξn, we have pA∈Ξn for p≫0.
For an indeterminate v′, we introduce a commutative ring R=Q(v)[v′,v′−1].
We have the following stabilization result.
Proposition 3.6**.**
Suppose that A1,A2,…,Al(l≥2) are matrices in Ξn
such that co(Ai)=ro(Ai+1).
There exist Z1,…,Zm∈Ξn, Gj(v,v′)∈R and p0∈N such that
[TABLE]
Proof.
The proof is essentially the same as that for [BLM90, Proposition 4.2] by using Theorem 3.2 and Theorem 3.4.
For the reader’s convenience, we shall prove it for l=2.
We first assume that A1 is a tridiagonal matrix.
For any (S,T) satisfying Condition (21), ro(S)=α and ro(T)=αJ, we set
[TABLE]
where hS,T is defined in Theorem 3.2.
We note that hS,T′′ remains the same when A is replaced by pA.
For such S,T, we define
Thus the proposition holds for the case that A1 is a tridiagonal matrix.
We now assume that A1 is an arbitrary matrix.
For any p≥0, there exist tridiagonal matrices B1,…,Bs such that
[TABLE]
By the above proof, there exist Z1,…,Zm and Gj(v,v′) such that
[TABLE]
for large enough p.
In particular, let A2 be a suitable diagonal matrix.
There exist Z1′,⋯,Zm′ and Gj′(v,v′) such that
[TABLE]
for large enough p.
By comparing (88) with (86), we may assume that Z1′=A1, G1′(v,v′)=1, and pZj<pA for j>1 and large enough p.
Therefore,
[TABLE]
By (87) and induction process, [pA1]∗[pA2] is of the required form.
This finishes the proof for the case l=2.
The general case can be completed by induction.
∎
Let A=Z[v,v−1].
We introduce an A-module and a Q(v)-module
[TABLE]
(Here [A] are just symbols.)
By specialization at v′=1, we have the following.
Corollary 3.7**.**
Retain the assumptions in Proposition 3.6.
There is a unique associative A-algebra structure on K˙nc, without unit, where
the product is given by
[TABLE]
By comparing Corollary 3.7 with Theorem 3.2, we obtain the following multiplication formula for K˙nc.
Proposition 3.8**.**
Let α=(αi)i∈Z∈NZ such that αi=αi+n for all i∈Z.
If A,B∈Ξn satisfy co(B)=ro(A) and B−∑1≤i≤nαiEθi,i+1 is diagonal, then we have
[TABLE]
where the sum runs over all S,T∈Θn subject to Condition (21), ro(S)=α, ro(T)=αJ,
A−T+Tˇ∈Θn (19), and AS,T∈Ξn.
Given A,B∈Ξn, we shall denote B⊑A if
pB≤algpA for large enough p∈N, co(B)=co(A), and ro(B)=ro(A).
We write B⊏A if B⊑A and B=A.
By using Proposition 3.8 and a similar argument as for Theorem 3.4, we have the following.
Proposition 3.9**.**
For any A∈Ξn, there exist matrices B(i)∈Ξn
with B(i)−∑1≤j≤nαijEθj,j+1 being diagonal for suitable scalars αij
such that
[TABLE]
We have the following stabilization property for the bar operator from [FLLLWa, Proposition 9.2.7].
Lemma 3.10**.**
For any A∈Ξ~n, there exist T1,…,Tm∈Ξ~n, Hi(v,v′)∈R and p0∈N such that
[TABLE]
By specializing at v′=1, we define a Q-linear map xˉ:K˙nc→K˙nc by letting
vj[A]=v−j∑i=1mHi(v,1)[Ti].
By Lemma 3.10, \ \bar{\phantom{x}}\ is a ring homomorphism whose square is the identity.
From Lemma 3.10, we also have
[A]=[A]+lowerterms,∀A∈Ξ~n.
By using Proposition 3.9, we have
[A]∈[A]+∑C⊏AA[C].
By a similar argument as for [BLM90, Proposition 4.7], we have the following.
Proposition 3.11**.**
For any A∈Ξn, there exists a unique element {A} in K˙nc such that
[TABLE]
By Propositions 3.9 and 3.11, we have the following.
Theorem 3.12**.**
The algebra K˙nc possesses a monomial basis \{m_{A}\big{|}A\in\widetilde{\Xi}_{n}\}
and a canonical basis \{\{A\}\big{|}A\in\widetilde{\Xi}_{n}\}.
3.3. Homomorphism from K˙nc to Sn,dc
By comparing the multiplication formulas in Theorem 3.2
and Proposition 3.8,
we can establish a further connection between K˙nc and Sn,dc.
Note that Ξn,d⊂Ξn,d.
Let Ψ:K˙nc→Sn,dc be an Q(v)-linear map
defined by
[TABLE]
Proposition 3.13**.**
*The map Ψ is a surjective algebra homomorphism.
*
Proof.
The subjectivity follows by definition of Ψ.
We show that Ψ is an algebra homomorphism.
The proof is similar to that for [DF13] or that for [BKLW14, Lemma A.20].
By Proposition 3.9, it is enough to show that
[TABLE]
for all tridiagonal matrices B∈Ξn.
It follows by comparing multiplication formulas in Theorem 3.2
and Proposition 3.8, Equation (89) holds for B,A∈Ξn,d with B tridiagonal.
If A∈Ξn,d, then there exists i∈[1,n] such that aii<0.
By Condition (21) in Lemma 2.1, for any T,S∈Θn
such that AS,T=(aij′)∈Ξn, we have
[TABLE]
and hence, [AS,TS]c=0.
This implies Ψ([B]⋅[A])=0=Ψ([B])Ψ([A]).
If B∈Ξn,d, then there exists i∈[1,n] such that bii<0.
Thanks to co(B)=ro(A), we have ∑jaij=bii+αi−1+αn−1−i.
By Condition (21) in Lemma 2.1 again, for any T,S∈Θn
with AS,T=(aij′)∈Ξn, we have
[TABLE]
There exists k∈Z such that aik′−sik<s−i,−k.
Therefore, [AS,TS]c=0 for any T,S∈Sn,n.
This implies Ψ([B]⋅[A])=0=Ψ([B])Ψ([A]).
The proposition is proved.
∎
4. The algebras K˙n, K˙n and K˙η
In this Section, we adapt the constructions of the monomial basis of Sn,dc in Section 3.1 for
the remaining 3 variants of convolution algebras: Sn,d, Sn,d, and Sη,d.
This then allows us to establish the stabilization properties and construct the corresponding limit algebras K˙n, K˙n, and K˙η, respectively.
Monomial and canonical bases for K˙n, K˙n, and K˙η are also constructed.
We further establish an isomorphism K˙n≅K˙n with compatible monomial, standard and canonical bases.
4.1. Monomial and canonical bases for Sn,d and K˙n
Recall n=2r+2 (for r≥1) is even, and n=n−1=2r+1.
Recall the subset Ξn,d⊂Ξn,d from (11)
and the subalgebra Sn,d=jrSn,dcjr of Sn,dc from Section 1.4.
Note the tridiagonal matrices B with nonzero (r+1,r)th or (r,r+1)th entry are not in Ξn,d,
and so a generating set for the algebra Sn,d does not naively come from that for Sn,dc.
Recall the matrices Eij and Eθij
from Section 1.2.
Theorem 4.1**.**
Let A∈Ξn,d. There exist matrices B(i)∈Ξn,d(i≥0)
with B(i)−∑j∈[1,n]\{r,r+1}ci,jEθj,j+1−ci,r+1Eθr,r+2 being diagonal (for some
scalars ci,j) such that
[TABLE]
Proof.
The construction below is inspired by a similar construction in the proof of [FL14, Theorem 6.3.1], see also [BKLW14, BLW14].
We shall work in the framework of the larger algebra Sn,dc instead of Sn,d.
For A=(aij)∈Ξn,d⊂Ξn,d,
there exist matrices B′(i) (as constructed in the proof of Theorem 3.4 without the prime notation)
such that B′(i)−∑1≤j≤nαijEθj,j+1 is diagonal and
[TABLE]
In this proof we use freely the setup and notations in the proof of Theorem 3.4.
We emphasize that B′(i) for i≥1 are not necessarily in Ξn,d.
Recall from the proof of Theorem 3.4 that m∈N is fixed such that aij=0 for all ∣j−i∣>m
and αij=∑k=j+i−mjak,j+i (for i≥1).
For i≥2, thanks to ar+1,r+i=0 we have
[TABLE]
Moreover, αi,r+1−i=0 for i≥1.
For i≥1, we denote by C(i) (respectively, D(i)) the matrix such that C(i)−∑r+1≤j≤3r+2−iαijEθj,j+1
(respectively, D(i)−∑r+1−i≤j≤rαijEθj,j+1) is a diagonal matrix
and ro(C(i))=ro(B′(i)) (respectively, co(D(i))=co(B′(i))).
It follows by Proposition 3.3 that, for i≥1,
[TABLE]
We note that the decomposition in (92) is highly dependent on the condition αi,r+1−i=0,
and there always exists such a decomposition whenever there exists αij=0.
We set C(0):=B′(0). By Proposition 3.3 and (91), we have, for i≥0,
[TABLE]
where B(i)∈Ξn,d satisfies that B(i)−αi,r+1Eθr,r+2 is a tridiagonal matrix.
(It can be shown by Theorem 3.2 that [D(i+1)]∗[C(i)]∈Ξn,d; but we do not need this stronger fact.)
Therefore, it follows by (92) and (93) that
[TABLE]
where L is the product of lower terms than B(i), which is lower than the leading term in ∏i≥0[B(i)].
The theorem follows now by comparing (90) and (94).
∎
Corollary 4.2**.**
The set {MA∣A∈Ξn,d}
(resp., {′MA∣A∈Ξn,d})
forms a basis of Sn,d.
We call the basis {MA∣A∈Ξn,d} the monomial basis of Sn,d.
Recalling I is the identity matrix, we set
[TABLE]
We set Ξn:=⊔dΞn,d
We extend Ξn to a larger set
Ξn by requiring the diagonal entries to be in Z, instead of N .
For any given A∈Ξn, we have pA∈Ξn for p≫0.
The following stabilization is slightly different from that for K˙nc and is similar to that in [FL14].
For the reader’s convenience, we present the construction here.
Proposition 4.3**.**
Suppose that A1,A2,…,Al∈Ξn(l≥2) are
such that co(Ai)=ro(Ai+1) for all i.
Then there exist Z1,…,Zm∈Ξn, Gj(v,v′)∈R and p0∈N such that
[TABLE]
Proof.
It suffices to prove the proposition for l=2.
Let us first assume that A1 is a tridiagonal matrix in Ξn,d.
For any (S,T) satisfying Condition (21), ro(S)=α and ro(T)=αJ, we define
[TABLE]
where γ(S,T)=∑i=r+1i∈[1,n],i>lsil−∑i=r+1i∈[1,n],i<ltil−∑i=r+1i∈[1,n]sii.
We note that the definition of GS,T(v,v′) is slightly different from the one in the proof of Proposition 3.6.
The difference is that the index i can not be equal to r+1 in γ(S,T) by the definition of pA1.
Thus the proposition holds for the case that A1 is a tridiagonal matrix.
For an arbitrary matrix A1, the argument is exactly the same as the one in the proof of Proposition 3.6.
It is clear that Zj∈Ξn,d since ro(pZj)=ro(pA1) and
co(pZj)=co(pAl).
This finishes the proof.
∎
We introduce an A-module and Q(v)-module
[TABLE]
(Here [A] is just a symbol.)
By specialization at v′=1 in Proposition 4.3, we can define an algebra structure on
AK˙n and K˙n.
Corollary 4.4**.**
Retain the assumption from Proposition 4.3.
There is a unique associative Q(v)-algebra structure on K˙n, without unit, where
the product is given by
[TABLE]
The following theorem for K˙n is a counterpart of Theorem 3.12 for the algebra K˙nc.
Theorem 4.5**.**
(1)
The algebra K˙n is generated by [B], where
B∈Ξn are such that
B−∑j∈[1,n]\{r,r+1}αjEθj,j+1−αr+1Eθr,r+2 is diagonal for suitable scalars αj.
2. (2)
The algebra K˙n possess a monomial basis {MA∣A∈Ξn}, and a canonical basis {{A}∣A∈Ξn}.
3. (3)
There exists a surjective algebra homomorphism Ψ:K˙n→Sn,d such that
Ψ([A])=[A] if A∈Ξn,d and [math] otherwise.
Proof.
Parts (1) and (2) follow by the construction of the monomial basis for Sn,d (Theorem 4.1)
and the stabilization procedure (Proposition 4.3). Part (3) follows formally by the existence of the monomial basis
with a desirable triangularity property under the bar operator (compare Proposition 3.11).
∎
4.2. The algebras of type \imath$$\jmath
The \imath$$\jmath-type is completely parallel to the \jmath$$\imath-type treated above, and so we shall be brief.
Recall the subset Ξn,d⊂Ξn,d from (14)
and the subalgebra Sn,d=j0Sn,dcj0 of Sn,dc from Section 1.4.
Recalling I is the identity matrix, we set
[TABLE]
As an \imath$$\jmath-counterpart of Theorem 4.1, the algebra Sn,d is generated by
[B], for all B∈Ξn,d such that
B−∑j∈[1,n]\{0,n−1}αjEθj,j+1−α0Eθ−1,1 is diagonal
for some suitable scalars αj.
Similarly, we can construct a monomial basis {MA∣A∈Ξn,d} for Sn,d.
Define Ξn in a similar manner as Ξn.
Let AK˙n=spanA{[A]∣A∈Ξn}, and K˙n=Q(v)⊗AAK˙n.
Similar to Proposition 4.3, we can establish a stabilization property for the algebras Sn,d as d↦∞ using (95),
and then we can use the stabilization procedure to construct an algebra structure on K˙n
(similar to Corollary 4.4). As a \imath$$\jmath-counterpart of Theorem 4.5, K˙n admits a monomial basis
{MA∣A∈Ξ} and a canonical basis {{A}∣A∈Ξ}.
There exists a surjective algebra homomorphism Ψ:K˙n→Sn,d such that
Ψ([A])=[A] if A∈Ξn,d and [math] otherwise.
4.3. Isomorphisms between the types \jmath$$\imath and \imath$$\jmath
The similarity between the \jmath$$\imath-type and \imath$$\jmath-type which we have seen above is not accidental and we shall establish various isomorphisms below.
Let us start at the levels of convolution algebras.
To a matrix A∈Ξn,d, we associate τA=(τaij) and τaij=ai+r+1,j+r+1.
Clearly, sending A↦τA defines a permutation of order 2 on Ξn,d.
Proposition 4.6**.**
The assignment [A]↦[τA] defines an involution τd on the algebra Sn,dc.
Proof.
We must show that τd([B]∗[A])=[τB]∗[τA] for all B,A∈Ξd.
By using the monomial basis MA of Sn,dc and by induction on B with respect to the partial order ≤alg,
we only need to prove the equation for B such that B−∑1≤i≤nαiEθi,i+1 is diagonal for some αi.
Note that dA=dτA for all A.
By the multiplication formula (Theorem 3.2), it suffices to check that
[TABLE]
where S,T are from the multiplication formula. Indeed, we have
[TABLE]
where we have used Corollary 2.10 and (21) on the third equality.
Observe that
[TABLE]
Observe also that sending (i,j)↦(−i−r−1,−j−r−1) defines a permutation on the index set J in
[AS,TS]c (see Theorem 3.2).
It follows from these observations that
[TABLE]
The equality ξτA,τS,τTb=ξA,S,Tb follows by using the symmetries on A, S and T, and
the proposition is thus proved.
∎
Proposition 4.7**.**
(1)
The automorphism τd:Sn,dc→Sn,dc commutes with the bar involution.
2. (2)
The involution τd preserves the canonical basis, i.e., τd{A}={τA}, for A∈Ξn,d.
Proof.
Let us go back to the geometric setting of Section 1.
Let J be the anti-diagonal matrix of rank d.
Let us fix a basis for the vector space V
so that the associated matrix of the symplectic form is
(0−JJ0).
Let
σ=(0JεJ0).
For any u,v∈VF, we have
[TABLE]
Hence σ is an element in the group GSp(VF) of symplectic similitude with respect to the form (,)VF.
Note that GSp(VF) acts on the set of symplectic lattices, and hence on Xn,dc.
For any L∈Xn,dc, we set τL=(τLi)i∈Z where τLi=σ(Li+r+1) for all i∈Z.
We have
[TABLE]
Thus we have (τLi)#=τL−i−1, i.e., τL∈Xn,dc. Hence we have defined a bijection
τ:Xn,dc⟶Xn,dc.
Over the algebraic closure Fq,
τ is an isomorphism of ind-varieties and the push forward τ∗=τ! commutes with the Verdier duality.
Since the automorphism τd is the decategorified version of τ∗ and the bar involution is the decategorified version of the Verdier duality,
Part (1) follows.
By Proposition 4.6, we have τd([A])=[τA]. As the bijection on Ξn,d sending A↦τA
preserves the Bruhat ordering, it follows by definition of the canonical basis that τd{A} satisfies the characterization property of
τ{A}, and hence τd{A}={τA}.
∎
Recall Lusztig’s subalgebra Un,d=⟨tˇr,eˇi,fˇi⟩0≤i≤r−1 and
Un,d=⟨t^0,e^i,f^i⟩0≤i≤r−1 of Sn,d and Sn,d, respectively, from [FLLLWa, Sections 7.1 and 8.1].
Theorem 4.8**.**
The involution τd on the algebra Sn,dc restricts to algebra isomorphisms τd:Sn,d⟶≅Sn,d
and τd:Un,d⟶≅Un,d which preserve the canonical bases.
Moreover, the isomorphism τd:Un,d→Un,d
gives rise to the following correspondence of generators:
tˇr↦t^0, eˇi↦f^r−i, fˇi↦e^r−i and kˇi±1↦k^r−i∓1 for all i∈[0,r−1].
Proof.
It follows by Proposition 4.6 that the restriction gives rise to an algebra isomorphism
τd:Sn,d⟶≅Sn,d. A direct verification by definition shows that
τd sends the generators of Un,d to
the corresponding generators of Un,d as stated in the proposition, and
hence we have obtained an algebra isomorphism τd:Un,d→Un,d.
The canonical bases are compatible with the inclusions Sn,d⊂Sn,dc
and Sn,d⊂Sn,dc by the geometric definitions of these algebras.
By [FLLLWa, Propositions 7.3.4 and 8.2.4], the canonical bases are also compatible with the inclusions
Un,d⊂Sn,d and Un,d⊂Sn,d.
Hence the restrictions of τd still preserve the canonical bases by
Proposition 4.7(2).
∎
It is straightforward to define an involution τda on the affine type A convolution algebra Sn,d, similar to the involution τd on Sn,dc.
Then we have the following commutative diagram:
[TABLE]
where d is the coideal imbedding defined in Equation (5.3.9) from [FLLLWa].
Note that the commutativity of the rightmost square can be shown by the trick of imbedding
Sn,dc to a higher rank Lusztig algebra and is then reduced to checking the compatibility on Chevalley generators.
The bijective map τ:Ξn,d→Ξn,d sending A↦τA
can be extended to τ~:Ξ~n→Ξ~n, A↦τA.
By restriction we obtain a bijection τ~:Ξ~n→Ξ~n.
Define a Q(v)-linear map
[TABLE]
Theorem 4.8 on the algebra isomorphism τd:Sn,d⟶≅Sn,d
and the stabilization procedure in Proposition 4.3 for K˙n (and its -counterpart)
quickly lead to the following.
Theorem 4.9**.**
The map τ:K˙n⟶K˙n is an isomorphism of algebras, which preserves the monomial and canonical bases.
4.4. Monomial and canonical bases for algebras of type \imath$$\imath
Recall n=2r+2, n=n−1, and η=n−2=2r, for r≥1.
Recall the subset Ξη,d=Ξn,d∩Ξn,d⊂Ξn,d
from (16) and the subalgebra Sη,d=Sn,d∩Sn,d
from Section 1.
By a similar argument as that for Theorem 4.1, we have the following.
Proposition 4.10**.**
Let A∈Ξη,d. There exist matrices B(i)∈Ξη,d(i≥0)
with B(i)−∑j∈[1,n]\{r,r+1,0,n−1}ci,jEθj,j+1−ci,0Eθ−1,1−ci,r+1Eθr,r+2 being diagonal (for some
suitable scalars ci,j) such that
[TABLE]
Let
[TABLE]
Let Ξη=⊔d∈NΞη,d and extend it to a larger set
Ξη by requiring the diagonal entries in Z instead of N, except at (0,0), (r+1,r+1) mod n.
Let AK˙η=spanA{[A]∣A∈Ξη}, and K˙η=Q(v)⊗AAK˙η.
Similar to Proposition 4.3, we can establish a stabilization property using (98) for the algebras Sη,d as d↦∞,
and then we can use the stabilization procedure to construct an algebra structure on K˙η
(similar to Corollary 4.4). We have the following \imath$$\imath-counterpart of Theorem 4.5.
Proposition 4.11**.**
(1)
The algebra K˙η is generated by [B],
for B∈Ξη such that
B−∑j∈[1,n]\{r,r+1,0,n−1}ci,jEθj,j+1−ci,0Eθ−1,1−ci,r+1Eθr,r+2is diagonal for some
suitable scalars ci,j.
2. (2)
The algebra K˙η admits the monomial basis {MA∣A∈Ξη},
and the canonical basis {{A}∣A∈Ξη}.
3. (3)
There exists a surjective algebra homomorphism Ψ:K˙η→S
such that Ψ([A])=[A] if A∈Ξη,d and [math] otherwise.
By restriction of the involution τd:Sn,dc→Sn,dc, we obtain involutions on the convolution algebra Sη,d and Lusztig algebra Uη,d in [FLLLWa],
respectively.
Thus we have the following commutative diagram, which is a variant of Diagram (97):
[TABLE]
Similar to Theorem 4.8 and Theorem 4.9, we can establish the following.
Proposition 4.12**.**
The involution τd on S (or Uη,d) preserves the standard, monomial and canonical bases.
Moreover, the involution τd induces an involution on K˙η, which preserves the standard, monomial and canonical bases.
Bibliography21
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BBD 82] A.A. Beilinson, J. Bernstein and P. Deligne, Faisceaux pervers , Astérisque 100 (1982).
2[BLM 90] A. Beilinson, G. Lusztig and R. Mc Pherson, A geometric setting for the quantum deformation of G L n 𝐺 subscript 𝐿 𝑛 GL_{n} , Duke Math. J., 61 (1990), 655–677.
3[BKLW 14] H. Bao, J. Kujawa, Y. Li, and W. Wang, Geometric Schur duality of classical type , Transform. Groups, ( 23 ) (2018), 329-389.
4[BLW 14] H. Bao, Y. Li, and W. Wang, A geometric setting for the coideal algebra 𝐔 ˙ ı superscript ˙ 𝐔 italic-ı \dot{\mathbf{U}}^{\imath} and compatibility of canonical bases , Appendix to [ BKLW 14 ] , 15pp. Transform. Groups, ( 23 ) (2018), 329-389.
5[DF 13] J. Du and Q. Fu, Quantum affine 𝔤 𝔩 n 𝔤 subscript 𝔩 𝑛 \mathfrak{gl}_{n} via Hecke algebras , Advances in Mathematics, 282 (2015), 23-46.
6[FL 14] Z. Fan and Y. Li, Geometric Schur duality of classical type, II , Trans. Amer. Math. Soc. Series B 2 (2015), 51–92.
7[FL 15] Z. Fan and Y. Li, Positivity of canonical basis under comultiplication , ar Xiv:1511.02434.
8[FLLL Wa] Z. Fan, C. Lai, Y. Li, L. Luo and W. Wang, Affine flag varieties and quantum symmetric pairs , to appear in Memoirs of AMS. ar Xiv:1602.04383.