
TL;DR
This paper develops a theory of p-cells in Hecke algebras for positive characteristic, extending Kazhdan-Lusztig cell theory, with explicit descriptions in type A and decompositions in types B and C.
Contribution
It introduces a p-cell theory parallel to characteristic zero, utilizing star-operations, and provides explicit classifications in finite types A, B, and C.
Findings
Explicit description of p-cells in type A using Robinson-Schensted correspondence
Decomposition of Kazhdan-Lusztig cells into p-cells for p > 2 in types B and C
Numerical consequences of star-operations for p-canonical bases
Abstract
Parallel to the very rich theory of Kazhdan-Lusztig cells in characteristic , we try to build a similar theory in positive characteristic. We study cells with respect to the -canonical basis of the Hecke algebra of a crystallographic Coxeter system (see arXiv:1510.01556(2)). Our main technical tool are the star-operations introduced by Kazhdan-Lusztig which have interesting numerical consequences for the -canonical basis. As an application, we explicitely describe -cells in finite type (i.e. for symmetric groups) using the Robinson-Schensted correspondence. Moreover, we show that Kazhdan-Lusztig cells in finite types and decompose into -cells for .
| right cells | two-sided cells | |
| KL-cells: | ||
| -cells: |
| right cells | two-sided cells | |
| KL-cells: | ||
| -cells: | ||
| -cells: |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
false
The ABC of p-Cells
Lars Thorge Jensen
Abstract
Parallel to the very rich theory of Kazhdan-Lusztig cells in characteristic [math], we try to build a similar theory in positive characteristic. We study cells with respect to the -canonical basis of the Hecke algebra of a crystallographic Coxeter system (see [JW17]). Our main technical tool are the star-operations introduced by Kazhdan-Lusztig in [KL79] which have interesting numerical consequences for the -canonical basis. As an application, we explicitely describe -cells in finite type (i.e. for symmetric groups) using the Robinson-Schensted correspondence. Moreover, we show that Kazhdan-Lusztig cells in finite types and decompose into -cells for .
Contents
1 Introduction
The Hecke algebra of a crystallographic Coxeter system admits several geometric or algebraic categorifications (see [KL79, EW16]). In these cases the resulting canonical basis gives rise to the famous Kazhdan-Lusztig basis (see [KL80, EW14]) in the characteristic [math] setting. The original motivation for the Kazhdan-Lusztig basis was to explicitly construct representations of the Hecke algebra (see [Lus18, comments on [37]]). This naturally led Kazhdan and Lusztig to study cells in the Hecke algebra with respect to the Kazhdan-Lusztig basis and the corresponding cell modules.
In [JW17] the -canonical basis for the Hecke algebra of a crystallographic Coxeter system was introduced. It should be thought of as a positive characteristic analogue of the Kazhdan-Lusztig basis. The -canonical basis shares strong positivity properties with the Kazhdan-Lusztig basis (similar to the ones described by the Kazhdan-Lusztig positivity conjectures), but it loses many of its combinatorial properties. For this reason, it is much harder to compute the -canonical basis which is only known in small examples.
Even without explicit knowledge of the -canonical basis, one may obtain a first approximate description of the multiplicative structure by studying the left, right or two-sided cell preorder with respect to the -canonical basis. Replacing the Kazhdan-Lusztig basis by the -canonical basis in the definition of the left (resp. right or two-sided) cells leads to the notion of left (resp. right or two-sided) -cells. In this paper, we introduce -cell theory which we hope will eventually turn out to be as influential as Kazhdan-Lusztig cell theory. It is current work of progress to describe -cells in affine Weyl groups of small rank. For affine Weyl groups -cells are closely related to tensor ideals of tilting modules (see for example [And04, AHR17, AHR18]).
The first properties of -cells that we prove in Section 3 are the following: Left and right -cells are related by taking inverses (see Lemma 3.6), just like for Kazhdan-Lusztig cells. The set of elements with a fixed left descent set decomposes into right -cells (see Lemma 3.4). We also study which automorphisms of the Hecke algebra are well-behaved with respect to the -canonical basis (see Proposition 3.7). The most important result of this section is a certain compatibility of -cells with parabolic subgroups: We show that any right -cell preorder relation in a finite, standard parabolic subgroup induces right -cell preorder relations in each right -coset (see Theorem 3.9).
In [KL79, Theorem 1.4], Kazhdan and Lusztig show that in type the cell modules give the irreducible modules of the Hecke algebra for generic parameter . In their proof, they introduce the Kazhdan-Lusztig star-operations, generalizing the (dual) Knuth operations for symmetric groups to pairs of simple reflections and in a Coxeter group with of order . The study of the consequences of the star-operations for the structure coefficients leads to an explicit description of the Kazhdan-Lusztig cells in symmetric groups (see [KL79, §5]). The Kazhdan-Lusztig cells in type can be characterized via the Robinson-Schensted correspondence (see [Ari00]), which gives a bijection between the symmetric group and pairs of standard tableaux of the same shape with boxes: The Kazhdan-Lusztig right cell of a given element is given by the set of elements in that have the same -symbol as under the Robinson-Schensted correspondence.
In an attempt to explicitly describe -cells for symmetric groups, we studied the consequences of the Kazhdan-Lusztig star-operations for the -canonical basis. We deduce many interesting relations for the structure coefficients of the -canonical basis and for the base change coefficients between the -canonical and the Kazhdan-Lusztig basis. The reader is invited to compare these with the results in [KL79, §4] and [Lus85, §10.4]. If a -canonical basis element differs from the corresponding Kazhdan-Lusztig basis element, then these identities often allow to deduce the non-triviality of other -canonical basis elements (see [LW18, Remark 5.2. (9)] for an example). Another consequence is that -cells coincide with Kazhdan-Lusztig cells in symmetric groups for all primes (see Theorem 4.33) and in particular that they are independent of . This is particularly interesting since the -canonical basis does differ from the Kazhdan-Lusztig basis for many primes (see [Wil17a]).
Thus, in type the -canonical basis of each cell module gives after extending scalars to and specializing to a basis of the corresponding complex irreducible representation of the symmetric group. Letting vary, we obtain a very interesting family of bases that merits further study. The relation between Specht modules, the Kazhdan-Lusztig cell representations, and their corresponding natural bases was further studied for the Hecke algebra as well as for the group algebra of symmetric groups in [Mat94, GM88, MP05].
Supported by the results in finite type , one may hope that Kazhdan-Lusztig cells always decompose into -cells. Unfortunately, this is not the case as we show in Section 3.4.3. However, we believe that the corresponding statement may still be true for good for the corresponding algebraic group. In Section 3.3, we develop a simple criterion when Kazhdan-Lusztig right cells decompose into right -cells, which reduces the question to minimal elements with respect to the weak right Bruhat order in each cell.
In a series of papers [Gar90, Gar92, Gar93, Gar], Garfinkle generalizes the Robinson-Schensted correspondence to types , and . She develops combinatorial algorithms to associate to a Weyl group element a pair of standard domino tableaux of the same shape from which can be reconstructed. (Note that the definition of a standard domino tableau depends on the type.) The main difference to the situation in type is that the partition of the Weyl group into sets with the same left domino tableau is finer than the partition into Kazhdan-Lusztig left cells (see [McG96, §3]). For this reason, Garfinkle groups the set of dominoes in a tableau into cycles and classifies them as “open” or “closed”. For each open cycle, she defines an involutive algorithm called “moving a tableau through an open cycle” that changes only the positions of the dominoes in the open cycle. Based on this, she defines an equivalence relation on the set of standard domino tableaux by declaring two to be equivalent if one can be obtained from the other by moving through a particular subset of open cycles. (In type only the open cycle containing the domino with label is excluded.) One of the main results is that two elements in a Weyl group of type lie in the same Kazhdan-Lusztig left cell if and only if their corresponding left standard domino tableaux are equivalent (see [Gar93, Corollary 3.5.6. and Theorem 3.5.9.]). Unpublished work of Garfinkle (see [Gar]), Pietraho and McGovern extends this result to type . Moreover, Garfinkle shows that a generalization of Vogan’s -invariant gives a complete invariant for Kazhdan-Lusztig left cells. Based on our results on the Kazhdan-Lusztig star operations, we can show that the equivalence classes with respect to this generalized -invariant give a refinement of the left -cells under small assumptions on . This implies, that Kazhdan-Lusztig left cells decompose into left -cells in finite types and for .
1.1 Structure of the Paper
Section 2
We introduce notation and recall important results about the Hecke algebra and the -canonical basis.
Section 3
We define -cells and prove some of their elementary properties. The most important results are the compatibility of -cells with parabolic subgroups and a criterion for Kazhdan-Lusztig cells to decompose into -cells. We also give interesting examples of -cells and state a conjecture resulting from extensive computer calculations.
Section 4
We introduce the Kazhdan-Lusztig star operations. Then we study in detail consequences for base change and structure coefficients of the -canonical basis and for -cells. After introducing Vogan’s generalized -invariant, we show that left -cells give a refinement of the -equivalence classes under small assumptions on . In the end, we show that -cells in finite type are given by the Robinson-Schensted correspondence.
1.2 Acknowledgements
Since this paper is part of the author’s PhD-thesis, I would like to thank my supervisor Geordie Williamson - his constant support, his inspiring mathematical vision and his enthusiasm were crucial for the success of my PhD project. Moreover, I am grateful to the Max-Planck Institute for Mathematics for the perfect working conditions and the financial support for my research visit in Sydney. The project was started at the School of Mathematics and Statistics at the University of Sydney and finished at the Max-Planck Institute for Mathematics in Bonn. I would also like to thank Simon Riche for detailed comments and Monty McGovern for providing a preliminary version of [Gar] and of his joint work in progress with Thomas Pietraho.
2 Background
2.1 Coxeter Systems and Generalized Cartan Matrices
Let be a finite set and be a matrix with entries in such that and for all . Denote by the group generated by subject to the relations for with . We say that is a Coxeter system and is a Coxeter group. The Coxeter group comes equipped with a length function and the Bruhat order (see [Hum90] for more details). A Coxeter system is called crystallographic if for all . We denote the identity of by . For we define its left descent set via
[TABLE]
The right descent set of is given by .
Define an expression to be a finite sequence of elements in . We denote by
[TABLE]
the set of all expressions in . For an expression denote its length by . For two expressions and in , we write for their concatenation. The multiplication gives a canonical map , . An expression in is called reduced if . For an expression in a subexpression of is a sequence where for all . The sequence is called the associated -sequence. We usually decorate as follows: For denote by the first terms and set . Assign to a decoration where stands for Up and for Down as follows:
[TABLE]
We often write the decorated sequence as . The sequence of elements , , , , is called the Bruhat stroll associated to . The defect of is defined to be
[TABLE]
Example 2.1*.*
To illustrate the definitions, consider for example the case with (i.e. type ). The reduced expression admits two decorated -sequences expressing :
[TABLE]
From now on, fix a generalized Cartan matrix (see [Tit89, §1.1]). Let be an associated Kac-Moody root datum (see [Tit89, §1.2] for the definition). Then is a finitely generated free abelian group, and for we have elements and of and respectively that satisfy for all .
To we associate a crystallographic Coxeter system as follows: Choose a set of simple reflections of cardinality and fix a bijection , . For we define to be , , , , or if is [math], , , , or respectively.
Fix a commutative ring . In both cases, yields a balanced, potentially non-faithful realization of the Coxeter system over . Set and note that is isomorphic to . A realization obtained in this way is called a Cartan realization (see [AMRW17a, §10.1]). Throughout, we will assume our realization to satisfy:
Assumption 2.2** (Demazure Surjectivity).**
The maps and are surjective for all .
This is automatically satisfied if is invertible in or if the Coxeter system is of simply-laced type and of rank .
We denote by the symmetric algebra of over and view it as a graded ring with in degree . Given a graded -bimodule , we denote by the shifted bimodule with .
2.2 The Hecke Algebra
The Hecke algebra is the free -algebra with as basis, called the standard basis, and multiplication determined by:
[TABLE]
There is a unique -linear involution on satisfying and . The Kazhdan-Lusztig basis element is the unique element in that is invariant under . This is Soergel’s normalization from [Soe97] of a basis introduced originally in [KL79]. For a sequence in , we write for the element . After fixing a reduced expression of every element , the set gives a basis of , called the Bott-Samelson basis.
Let be the -linear anti-involution on satisfying for and thus .
2.3 The Diagrammatic Category of Soergel Bimodules
In this section, we introduce the diagrammatic category of Soergel bimodules. The main reference for this is [EW16] (see also [Eli16] in the dihedral case and [EK10] in type ).
Let be the diagrammatic category of Bott-Samelson bimodules as introduced in [JW17, §2.3]. It is a diagrammatic, strict monoidal category enriched over -graded left -modules.
Let be the Karoubian envelope of the graded version of the additive closure of , in symbols . We call the diagrammatic category of Soergel bimodules. In other words, in the passage from to we first allow direct sums and grading shifts (restricting to degree preserving homomorphisms) and then the taking of direct summands. The following properties can be found in [EW16, Lemma 6.24, Theorem 6.25 and Corollary 6.26]:
Theorem 2.3** (Properties of ).**
Let be a complete, local, integral domain (e.g. a field or the -adic integers ).
- (i)
* is a Krull-Schmidt category.* 2. (ii)
For all there exists a unique indecomposable object which is a direct summand of for any reduced expression of and which is not isomorphic to a grading shift of any direct summand of any expression for . In particular, the object does not depend up to isomorphism on the reduced expression of . 3. (iii)
The set gives a complete set of representatives of the isomorphism classes of indecomposable objects in up to grading shift. 4. (iv)
There exists a unique isomorphism of -algebras
[TABLE]
sending to for all , where denotes the split Grothendieck group of . (We view as a -algebra as follows: the monoidal structure on induces a unital, associative multiplication and acts via for an object of .)
It should be noted that we do not have a diagrammatic presentation of as determining the idempotents in is usually extremely difficult.
2.4 The -canonical Basis
In this section, we recall the definition of the -canonical basis and its elementary properties (see [JW17]). Instead of a based root datum, we use a generalized Cartan matrix as input, but all the results from [JW17] still hold in this slightly more general setting. Let be a field of characteristic . Note that the -canonical basis depends on , but not on the explicit choice of . Since the numerical input for the algorithm to calculate the -canonical basis (as described in [JW17, §3]) reduces to the generalized Cartan matrix , the -canonical basis does not depend on the choice of Kac-Moody root datum associated to .
Definition 2.4**.**
Define for all where is the isomorphism of -algebras introduced earlier.
We will frequently use the following elementary properties of the -canonical basis which can be found in [JW17, Proposition 4.2] unless stated otherwise:
Proposition 2.5**.**
For all we have:
- (i)
, i.e. is self-dual, 2. (ii)
* with ,* 3. (iii)
* with self-dual ,* 4. (iv)
* and thus in particular as well as ,* 5. (v)
* unless and ,* 6. (vi)
* with self-dual ,* 7. (vii)
* for (see [EW14]) and (i.e. there are only finitely many primes for which ).*
Denote by the coefficient of in the Kazhdan-Lusztig polynomial .
The following result (see [JW17, Lemma 4.3]) shows the remnant of the multiplication formula for the Kazhdan-Lusztig basis. Note that for all as the corresponding Schubert variety is smooth.
Lemma 2.6**.**
For and we have:
[TABLE]
3 General -Cell Theory
3.1 First Results
In this section, we want to give the definition of -cells. This notion is an obvious generalization of a notion introduced by Kazhdan-Lusztig in [KL79].
Definition 3.1**.**
For we say that appears with non-zero coefficient in if the coefficient of is non-zero when expressing in the -canonical basis.
Define a preorder (resp. ) on as follows: (resp ) if and only if appears with non-zero coefficient in (resp. ) for some . Define to be the preorder generated by and , in other words we have: if and only if appears with non-zero coefficient in for some .
Restricting and in the definitions above to any set of generators of as a -algebra, one gets a set of generating relations for the corresponding -cell preorders (see [Wil03, Proposition 4.1.1]). The following definition introduces some notation for the relations generating the -cell preorder obtained from the generating set which we will use in Section 4.2.
Definition 3.2**.**
Let . We write (resp. ) if (resp. ) is non-zero for some . In addition, we write if or holds.
For the sake of completeness, we will state explicitly that these elementary relations generate the -cell-preorder (see [AHR17, Lemma 5.3] for a proof):
Lemma 3.3**.**
For the following holds: if and only if there exists a chain . Similarly for the left (resp. two-sided) -cell preorder.
In the remainder of the section, we will prove some elementary properties of -cells. In most cases we will focus on right -cells and not state the version for left -cells explicitly.
In [KL79, Proposition 2.4] Kazhdan-Lusztig observed that a Kazhdan-Lusztig right cell preorder relation implies an inclusion of left descent sets. The following result shows that the compatibility between cells and descent sets carries over to the more general setting. More precisely, the set of all elements with a fixed left descent set is a union of right -cells. The result can also be found in [AHR17, Lemma 5.4]:
Lemma 3.4**.**
For with we have . In particular, gives and for any the set is a union of right -cells.
Proof.
Due to Lemma 3.3 it is enough to consider the case where we multiply with for . We have on the one hand:
[TABLE]
On the other hand we can write:
[TABLE]
Proposition 2.5(v) shows that all occurring with non-zero on the right hand side satisfy . [KL79, Proposition 2.4] shows that implies . Observe that the set of with non-zero structure coefficient is a subset of the set of all indexing a summand with non-zero coefficient on the right hand side (due to Proposition 2.5(iii) and (vi)). Putting all of this together gives the result. ∎
Corollary 3.5**.**
* is a left, right, and -sided -cell for all primes .*
It is well known for Kazhdan-Lusztig cells that left and right cells are closely related via taking inverses. Using the -linear anti-involution on together with Proposition 2.5(iv) we obtain the corresponding result for -cells which will allow us to pass from left to right -cells:
Lemma 3.6**.**
For all we have:
[TABLE]
Next, we want to consider the question which automorphisms of our Coxeter system induce automorphisms on that are well-behaved with respect to the -canonical basis. Let be an automorphism of Coxeter systems (in particular we have ) which leaves the generalized Cartan matrix invariant when permuting simultaneously the corresponding rows and columns (i.e. for all ). Then induces a -linear automorphism of via for which we will also denote by by slight abuse of notation. Therefore, maps to by the defining property of the Kazhdan-Lusztig basis.
Proposition 3.7**.**
In the setting given above we have for all :
- (i)
, 2. (ii)
* and ,* 3. (iii)
, 4. (iv)
* and .*
Proof.
Observe that induces a monoidal, -linear equivalence of and thus of which on the -spaces merely permutes the colours in the diagrams (given by ) and the variables of the polynomials in decorating the regions according to the action of . Since the numerical input for the algorithm to calculate the -canonical basis (as described in [JW17, §3]) reduces to we see immediately that this equivalence sends to and thus on the level of Grothendieck groups to . This proves (i).
Recall that maps to and to for all . For this reason, (ii) follows from (i) by rewriting in the Kazhdan-Lusztig basis (resp. standard basis), applying , using (i) and comparing coefficients in the Kazhdan-Lusztig basis (resp. standard basis). (i) implies (iii) in a similar way and (iv) follows from (iii). ∎
Suppose that our based root datum is irreducible. In this case, the last proposition can be applied to all automorphisms of the (extended) Dynkin diagram of our root system. In finite type conjugation by the longest element in the finite Weyl group is also covered by the last proposition. Indeed, it follows from [Dav08, Remark 13.1.8] that for irreducible finite Coxeter groups the longest element is central except in types for , with odd, , and for odd where denotes the dihedral group of order . In all these cases, conjugation by gives the obvious automorphism of the corresponding Coxeter graph. After restricting to crystallographic Coxeter systems, only simply-laced types remain and so any automorphism of the Coxeter graph gives an automorphism of the Dynkin diagram of the same type in the obvious way (as the graphs are isomorphic).
Definition 3.8**.**
Let be a subset. Call finitary if the corresponding parabolic subgroup is finite. Define to be the set of representatives of minimal length of cosets in .
The following result is the main result of this section and generalizes the parabolic compatibility for Kazhdan-Lusztig cells (see [Lus03, Proposition 9.11]) to the setting of -cells:
Theorem 3.9** (Parabolic compatibility of right -cells).**
Let be a finitary subset. Then for the following holds:
[TABLE]
As a corollary to the proof of Theorem 3.9 we get:
Corollary 3.10**.**
In the setting of Theorem 3.9 we have:
[TABLE]
Remark 3.11*.*
Let be a finite standard parabolic subgroup and a right -cell. Theorem 3.9 implies immediately that the cell module associated to when restricted to decomposes into cell modules for (see [BV83, Proposition 3.11] and [Roi98, Proposition 1]).
3.2 Proof of Theorem 3.9 and Corollary 3.10
First we will prove Theorem 3.9: For all elements in choose a reduced expression . We have a bijection
[TABLE]
such that (see [BB05, Proposition 2.4.4]). Therefore, for and the concatenation of the corresponding reduced expressions and gives a reduced expression of . Choose and arbitrarily. In the following we sometimes identify a subexpression with its associated -sequence.
Lemma 3.12**.**
For all we have a decoration- and defect-preserving bijection:
[TABLE]
Proof.
It is easy to see that is well-defined and injective. Leaving out any letter of in a subexpression of leads to a Bruhat stroll ending in a right coset with as is of minimal length in . Thus, is surjective.
For the definition of the Bruhat graph we refer the reader to [Dye91, Definition 1.1]. The induced Bruhat graph on (as a subgraph of the Bruhat graph of ) is isomorphic to the one of (see [Dye91, Theorem 1.4]). This follows for example from the subword property (see [BB05, Theorem 2.2.2]). Thus any subexpression of expressing will have a decoration starting with symbols (as is a reduced expression) and the remaining expression will be decorated in the same way as would be decorated as a subexpression of expressing . Since the ones in a subexpression do not contribute to the defect, this immediately implies:
[TABLE]
where on the left (resp. right) hand side the defect is calculated as a subexpression of (resp. ). ∎
This bijection matches up the combinatorial data used to define the light leaves and thus allows us to compare the corresponding local intersection forms. Consider the local intersection forms of at (resp. of at ) and the matrices representing them with respect to the light leaves bases (see [JW17, §3]). For two subexpressions of expressing we get in :
[TABLE]
This implies that the multiplicity of and its grading shifts in which is given by coincides with the multiplicity of and its grading shifts in which is given by .
Choose any total order on refining the Bruhat order and preserving elements in the same coset in as blocks of adjacent elements. Note that our choices above have fixed a reduced expression for any element . Denote by the base change matrix from the Bott-Samelson basis to the -canonical basis of . is an upper-triangular, invertible matrix with entries in and ones on the diagonal. The above considerations show that the base change matrix from the Bott-Samelson to the -canonical basis of looks as follows:
[TABLE]
Note that this form is preserved by taking inverses. This means that when expressing in terms of the Bott-Samelson basis gives all coefficients for terms indexed by for . Using this allows us to partly decouple the terms and . When calculating for we can simply express both terms in the Bott-Samelson basis, perform the calculation where only the structure coefficients for the Bott-Samelson basis of come into play and rewrite it in terms of the -canonical basis. This immediately implies the following result as we have full control over the situation in the top coset :
Corollary 3.13**.**
For all and a minimal coset representative of we have:
[TABLE]
The last corollary proves Theorem 3.9 since elementary relations obtained from for and generate the right -cell preorder in (see Lemma 3.3).
Next, we will prove Corollary 3.10:
Recall the following lemma which in the case of a reduced expression describes how to express the Bott-Samelson basis element in terms of the standard basis (see [EW16, Lemma 2.10]):
Lemma 3.14**.**
For any expression in we have:
[TABLE]
Recall that we have chosen a total order on in the proof of Theorem 3.9. Denote by the base change matrix from the Bott-Samelson basis to the standard basis of . Then is an upper-triangular, invertible matrix with entries in and ones on the diagonal. The defect-preserving bijection from Lemma 3.12 shows that the base change matrix from the Bott-Samelson to the standard basis of looks as follows:
[TABLE]
Multiplying the base change matrix from the -canonical to the Bott-Samelson basis with the base change matrix from the Bott-Samelson to the standard basis finishes the proof of Corollary 3.10.
3.3 Decomposition Criterion for Kazhdan-Lusztig Cells
In this section, we want to study the interplay between the weak right Bruhat order (see [BB05, Definition 3.1.1] for the definition) and the right -cell preorder. This will allow us to formulate a simple criterion as to when -cells decompose into Kazhdan-Lusztig cells.
In the next few results we will focus on right cells, but a similar version for left cells can easily be formulated. Throughout this section, we assume that has finitely many right Kazhdan-Lusztig cells. This is known for finite and affine Weyl groups by [Lus87, Theorem 2.2 (a)], but there are examples of crystallographic Coxeter groups with infinitely many right Kazhdan-Lusztig cells (see [Bé89, Bel04]).
For , let be a reduced expression. Set for all . Since there exists a maximal such that for all with we have . In this setting we have the following result:
Lemma 3.15**.**
All with non-zero satisfy: .
Proof.
The claim follows as for is a linear combination of Kazhdan-Lusztig basis elements indexed by elements in . ∎
Observe that always holds. So if , then and lie in the same Kazhdan-Lusztig right cell.
Corollary 3.16**.**
If and lie in the same Kazhdan-Lusztig right cell, then for with non-zero we have .
Definition 3.17**.**
Let be an arbitrary subset. is called right-connected if for every two elements , there exists a sequence , , , in such that (i.e. and differ by a simple reflection on the right) for all . It follows that decomposes as a disjoint union of its right-connected components, i.e. the maximal right-connected subsets.
Call an element right-minimal if cannot be reached from any other element via a sequence , , , in as above satisfying in addition . Observe that an element is right-minimal if and only if it is minimal with respect to the weak right Bruhat order.
Similarly we define left-connected and left-minimal using multiplication by simple reflections on the left, as well as -connected and -minimal.
The following observation follows immediately from the definition of a right-minimal element, but shows their most important property:
Lemma 3.18**.**
Let be an arbitrary subset. For all there exists a right-minimal element such that and .
At this point we should mention the following conjecture by Lusztig which he originally formulated for (affine) Weyl groups in [HK83, p. 14]. It still appears to be open in finite type and in general affine type:
Conjecture 3.19**.**
Every Kazhdan-Lusztig right cell in a Coxeter group is right-connected.
In finite type, the conjecture is known to hold for all dihedral groups, in type (see [KL79, §5]), (see [Gar93, Theorem 3.5.9]) and in all exceptional types , , , , and (see [GH15, Example 7.3]). In affine type, it has been verified in affine rank (see [Lus85, Theorem 11.3]), for of type with (see [Shi86, Theorem 18.2.1]), for Kazhdan-Lusztig right cells contained in the lowest Kazhdan-Lusztig two-sided cell (see [Shi88, Corollary 1.2]), for Kazhdan-Lusztig right cells contained in the Kazhdan-Lusztig two-sided cell of elements with a unique reduced expression (see [Lus83, Proposition 3.8]) and some other special cases (see for example [Xi89], [Shi02, Theorem 4.8] and [Shi06]).
In the rest of the section we want to apply these notions to compare Kazhdan-Lusztig and -cells by looking at minimal elements. We will focus on right cells even though there are similar results about left (resp. two-sided) cells. Using a similar idea as in Corollary 3.16 we obtain the following result:
Corollary 3.20**.**
Let be a Kazhdan-Lusztig right cell and the set of right-minimal elements in . Assume for all and the following:
[TABLE]
Then for all and with we have .
Definition 3.21**.**
Let be a set equipped with a preorder . A subset is called a lower set if for and any with we have as well.
Observe that any lower set in the right -cell preorder can be written as a union of right -cells. For this reason the following result is the starting point of our criterion:
Lemma 3.22**.**
Let be a Kazhdan-Lusztig right cell that satisfies the assumptions of Corollary 3.20 and . Then implies . If is minimal in the Kazhdan-Lusztig right cell preorder, then is a lower set in the right -cell preorder and we have
[TABLE]
as -submodules of .
Proof.
Assume that occurs with non-zero coefficient in for some . Write . If occurs with non-zero coefficient in the product then we have by definition . If occurs with non-zero coefficient in one of the products , then we have and by Corollary 3.20 that .
Denote by the set of right-minimal elements in . Our arguments above show that we have the following inclusions:
[TABLE]
The equalities on the left and right hand side follow from Lemma 3.18. In particular, is contained in the left hand side. Thus, if is minimal in the Kazhdan-Lusztig right cell preorder, we actually have equality which implies the claim as the left hand side obviously is a lower set in the -cell preorder. In this case, Corollary 3.20 shows that for any the -canonical basis element can be written in terms of Kazhdan-Lusztig basis elements indexed by elements in which implies the statement about the span of the -canonical and the Kazhdan-Lusztig basis elements. ∎
Lemma 3.23**.**
Let be a Kazhdan-Lusztig right cell. Assume that all Kazhdan-Lusztig right cells smaller or equal than in the Kazhdan-Lusztig right cell preorder satisfy the assumption of Corollary 3.20. Then is a lower set in the right -cell preorder and we have
[TABLE]
as -submodules of . Moreover, decomposes as a union of right -cells.
Proof.
We proceed by induction on the height of in the Kazhdan-Lusztig right cell preorder. By assumption the height of any cell in the right cell preorder is finite.
Lemma 3.22 gives the induction start. Let be of height . By induction for all predecessors of in the Kazhdan-Lusztig right cell preorder we know our claim holds for . Therefore, we may pass to the quotient
[TABLE]
where becomes the smallest cell. Note that this quotient is a right -module that is free as a -module and admits a -canonical as well as a Kazhdan-Lusztig basis. Denote by
[TABLE]
the projection to the quotient. Applying amounts to forgetting all basis elements indexed by elements in when expressing an element in the Hecke algebra in the -canonical or Kazhdan-Lusztig basis. For this reason, the action of on this right module captures a lot of information about the -cell as well as the Kazhdan-Lusztig cell structure in the following sense: For we have if and only if there exists an element such that occurs with non-trivial coefficient in . A similar statement holds for the Kazhdan-Lusztig cell structure. This allows us to conclude as in the proof of Lemma 3.22. ∎
3.4 (Counter-)Examples
In this section, we will give some examples of the -cell structure of finite Weyl groups. In this section we will only give the Dynkin diagram and consider the corresponding Cartan matrix as input. One may obtain a Kac-Moody root datum from any based root datum of the corresponding connected semi-simple algebraic group.
We will restrict to those examples that give counterexamples to obvious generalizations of known results from Kazhdan-Lusztig cell theory. All results in this section were obtained using computer calculations. Denote by the longest element in the corresponding finite Weyl group.
3.4.1 Type
We label the simple reflections as follows:
[TABLE]
The following diagrams show the right (resp. two-sided) cells and the corresponding preorders in type :
Lusztig showed in [Lus83, Proposition 3.8] that the set of non-trivial elements in a Coxeter group that have a unique reduced expression always forms a Kazhdan-Lusztig two-sided cell and for any the set gives a Kazhdan-Lusztig right cell. The example above shows that both statements do not hold for -cells in general.
Observe that in characteristic [math] we have for (see [Lus03, Corollary 11.7]) the following equivalences
[TABLE]
and the same statement for the left and two-sided cell preorder. The example above also shows that the analogous statement does not hold for -cells.
3.4.2 Type
We label the simple reflections as follows:
[TABLE]
The following diagrams show the right (resp. two-sided) cells and the corresponding preorders in type using the notation from the last subsection. In particular, , and are defined as in Section 3.4.1.
3.4.3 Kazhdan-Lusztig cells do not decompose into -cells
In this section, we will present the smallest example where Kazhdan-Lusztig cells do not decompose into -cells. This happens in type for . We label the simple reflections as follows (also note their colours):
[TABLE]
Explicit computer calculation gives the following Kazhdan-Lusztig right cells:
[TABLE]
For these right Kazhdan-Lusztig cells exhibit the following decomposition behaviour into right -cells:
[TABLE]
The Hasse-diagrams of the cell preorders look as follows. We display Kazhdan-Lusztig right cells on the left and right -cells on the right. In these diagrams the cells that are depicted at one height form a two-sided cell.
[TABLE]
Finally, let us try to explain the non-trivial decomposition behaviour. For the elements in we have:
[TABLE]
The subquotient is a module for the Hecke algebra and the action on the -canonical basis of this module can be encoded in the following graph:
[TABLE]
Note that we omitted all edge labels equal to and all loops labelled with . The strongly connected components of this graph give the right -cells , and . From this we see that neither two-sided nor right Kazhdan-Lusztig cells decompose into the corresponding -cells in this example.
In this case we cannot apply the decomposition criterion from Section 3.3 because the Kazhdan-Lusztig right cell does not satisfy the assumptions of Corollary 3.20.
In type the right (and two-sided) Kazhdan-Lusztig cells do decompose into right (resp. two-sided) -cells, whereas in type they do not. This calculation together with Proposition 3.24 below and Corollary 4.26 completely settles the question of when right Kazhdan-Lusztig cells decompose into right -cells in types and . In summary, right Kazhdan-Lusztig cells in types and decompose into right -cells for or and in type .
Proposition 3.24**.**
Suppose the Kazhdan-Lusztig right cells of do not decompose into right -cells for some . Let be a crystallographic Coxeter group that contains as standard parabolic subgroup. Then the Kazhdan-Lusztig right cells of do not decompose into -cells.
Proof.
By assumption we may find two distinct right Kazhdan-Lusztig cells and a right -cell for some such that and are non-empty. By Theorem 3.9 we may find right Kazhdan-Lusztig cells and a right -cell such that for and .
Observe that for the set is non-empty as it contains . Therefore, it is enough to show that and are disjoint. Let be the set of representatives of minimal length of cosets in . To conclude we need to recall a result about the induction of Kazhdan-Lusztig cells (see [Gec03, Theorem 1] for the version for left cells):
Theorem 3.25** (Induction of right Kazhdan-Lusztig cells).**
Let be a standard parabolic subgroup, and let be a right Kazhdan-Lusztig cell of . Then is a union of right cells of .
Since we have for , the claim follows from the fact that and are disjoint. ∎
4 Left and Right Star Operations
4.1 Definition and Numerical Consequences
In the section, we will prove consequences of the Kazhdan-Lusztig star-operations for the -canonical basis. The star-operations were originally introduced in [KL79, §4], generalizing (dual) Knuth operations from the symmetric group to pairs of simple reflections in general Coxeter groups with . In the literature, there does not seem to exist a consensus on how to generalize the star-operations to the case . We propose the following generalization as in [BG15, Remark 4.3]:
Definition 4.1**.**
Let be two simple reflections. Define:
[TABLE]
Set . For denote by the alternating word in and starting in of length . Recall that denotes the set of representatives of minimal length of cosets in (see Definition 3.8). Any coset in contains a unique element and can be partitioned in the following sets:
[TABLE]
For the element is the unique element of maximal length in the coset. The set for some is called a right -string (also for ) and contained in . The element is the -th element in this string.
It is easy to see that actually any element lies in a right -string and can thus be written as for some and where is the element of minimal length in the right coset .
Assume . Then the right star operation is an involution on sending for and as above to . The left star operation is an involution on defined analogously.
It follows immediately that the left and right star operations are related via:
[TABLE]
Fix for the rest of the section two simple reflections with . The multiplication formula for the Kazhdan-Lusztig basis does not easily generalize to the -canonical basis. However it will still be important to understand the structure coefficients of the -canonical basis a little bit better. The next lemma states a crucial observation that will be used frequently below.
Lemma 4.2**.**
Let with . The coefficient of in is given by
[TABLE]
where is the Kronecker delta.
Proof.
Rewrite the product as follows:
[TABLE]
If is not in the right descent set of , the coefficient in front of has to be zero. By Proposition 2.5(v) the formula stated above also gives zero in this case. Thus, we assume from now on. Since lies in , this implies that does not lie in the right descent set of . Consider an element with such that occurs with non-zero coefficient in . Observe that could be . By Proposition 2.5(v) implies . Since the right descent sets differ, and cannot coincide. In particular, does not have in its right descent set and thus also lies in . (Otherwise could not occur with non-zero coefficient in .) Recall the following important fact about the -coefficients (from [KL79, (2.3.f)]):
Lemma 4.3**.**
Let and . Then we have:
[TABLE]
Moreover, in this case.
If holds, then we may apply this lemma to and the simple reflection to get that . Otherwise, we have (due to the multiplication formula from [KL79, (2.3.b)]) and again . In both cases, we see that and lie in the same right -string and the coefficient of in is
[TABLE]
Definition 4.4**.**
The weak right Bruhat graph of is the labelled, directed graph with vertex set and edge set
[TABLE]
For and the edge is labelled by .
The reader may picture the formula from Lemma 4.2 as follows: Consider the subgraph of the weak right Bruhat graph on the vertices and only edges labelled by or . In order to get the coefficient of in we simply have to slide the coefficients up along an edge labelled by and down along an edge labelled by and sum them up if two coefficients collide at a vertex in the process. Here, up and down are meant with respect to the weak right Bruhat order.
For the rest of the section, we will assume:
[TABLE]
This ensures that for we have (see [JW17, §5.1, §5.2 and §5.6]) and thus Kazhdan-Lusztig cells and -cells in coincide.
Proposition 4.5**.**
Let and be two right -strings consisting of elements. Then we have the following relations among the coefficients :
[TABLE]
Proof.
Comparing Laurent polynomials coefficient-wise induces a partial order which we will use in the following. For with , rewrite in terms of the -canonical basis to get:
[TABLE]
Express this in the Kazhdan-Lusztig basis and use Lemma 4.2 to see that we have the following inequality for which is actually satisfied with equality:
[TABLE]
We want to use a weaker form of this inequality together with the fact that we understand the structure coefficients in the right -coset of (see Corollary 3.13). Let be the simple reflection such that for . Write (resp. ) for the shortest (resp. longest) element in the right -coset of . Similarly for and . We can restrict the sum on the left hand side of (4) to and . From Corollary 3.13 and the explicit knowledge of the structure constants of the Kazhdan-Lusztig basis in the dihedral case we deduce:
[TABLE]
Using this in inequality (4) and letting and in their right -string vary, we obtain for :
[TABLE]
Surprisingly enough, any solution to this system of inequalities satisfies all inequalities with equality. We will solve this system of linear inequalities for and leave the cases to the reader. To simplify notation, write for all and view them as indeterminates. The set of inequalities can be partitioned into two sets of inequalities which can be solved completely independently:
[TABLE]
First, let us consider :
[TABLE]
Consider the following chain of inequalities:
[TABLE]
This implies that the inequalities (i), (iv), (vii), (x) and (xiii) are all satisfied with equality, which in turn implies:
[TABLE]
Next, consider the following chain:
[TABLE]
This shows that the inequalities (iii), (v), (ix) and (xi) are also satisfied with equality, from which we deduce:
[TABLE]
Finally, we have
[TABLE]
and
[TABLE]
which imply using and respectively
[TABLE]
Using and finishes the argument.
Next, we solve :
[TABLE]
In this case we argue as follows:
[TABLE]
We use this in the last inequality of the following chain:
This implies that and the inequalities (i’), (iii’), (iv’), (vi’), (vii’), (ix’), (x’) and (xii’) are satisfied with equality. Moreover, we have the following equivalences:
[TABLE]
The last four inequalities can be used as follows:
[TABLE]
This gives and finishes the argument.
Finally, observe that the space of solutions for these (in)equalities is a free -module of rank and we can choose as a basis. In other words, the solution is uniquely determined after fixing these Laurent polynomials. From all these equalities, the reader can easily deduce the relations given in the proposition where we expressed each coefficient in terms of our chosen basis of the solution space. ∎
Remark 4.6*.*
In the proof Proposition 4.5 we have introduced a set of (in)equalities governing the base change coefficients between two -strings and and shown that its of space of solutions is a free -module of rank . Of course, not every solution gives a possible set of base change coefficients as these coefficients have to satisfy more constraints: Proposition 2.5(iii) shows that these coefficients are self-dual and have non-negative integers as coefficients. Moreover, due to Proposition 2.5(v) these coefficients satisfy parity vanishing for fixed and arbitrary . This is also the underlying reason why we could partition the set of inequalities in two sets.
Corollary 4.7**.**
For one has:
[TABLE]
Proof.
Note that asks only for (in the notation of the proof of Proposition 4.5) for whereas we have shown many more relations among these coefficients in the last proposition. ∎
In the proof of Proposition 4.5 we have seen that when translating by for with the available coefficient of in for is completely subsumed by the neighbouring elements of in its right -string. This implies the following about the structure coefficients:
Corollary 4.8**.**
Let with . Then vanishes unless and are neighbouring elements in the same right -string.
The next result will allow us to apply the star-operations to the study of -cells. It is a generalization of [Lus85, (10.4.1), (10.4.2) and (10.4.3)]:
Proposition 4.9**.**
Let (resp. ) be two right -strings consisting of elements. For any all the relations stated in Proposition 4.5 hold with replaced by .
Proof.
Lemma 4.11 below shows that all elements in lie in the same right -cell. We therefore deduce from Lemma 3.4 that all elements in have the same left descent set and satisfy for .
Write (resp. ) for the shortest (resp. longest) element in the right -coset of . Similarly for and . We are interested in the structure coefficients for . To simplify notation, write .
Fix arbitrary. We may assume without loss of generality and thus . The main idea is to express in the -canonical basis in different ways and to analyze the coefficients in front of basis elements indexed by elements in . Depending on which multiplication in we first carry out, we get two ways to express this product in terms of the -canonical basis. On the one hand we have:
[TABLE]
Consider an element with . The version of Lemma 3.4 for left cells implies and in particular is not minimal in its right -coset. This implies:
[TABLE]
Assume (otherwise does not contain any -canonical basis elements indexed by elements in ). Combining Corollary 4.8 and Corollary 3.13 we have full control over the -canonical basis elements indexed by elements in that occur in . Therefore, the only -canonical basis elements that are indexed by elements in and that occur with non-trivial coefficient in (5) are the following:
[TABLE]
On the other hand we can rewrite the product as follows:
[TABLE]
Consider an element with . It follows that has in its right descent set. The version of Lemma 3.4 for left cells shows that can only contribute -canonical basis elements indexed by elements in if lies in itself. (Observe that Corollary 4.8 together with the fact that elements in have the same left descent set implies that the sum cannot contribute any -canonical basis elements indexed by elements in .) Using Corollary 4.8 and Corollary 3.13 again, we see that the only -canonical basis elements that are indexed by elements in and that occur with non-trivial coefficient in (6) are the following:
[TABLE]
Comparing coefficients in front of we get:
[TABLE]
Letting and vary, we see that the ’s satisfy precisely the inequalities (i) - (xiii) and (i’) - (xii’) (with equality). ∎
Corollary 4.10**.**
Let and such that . Then we have
[TABLE]
where is the right star-operation with respect to .
Using the -linear anti-involution on we can translate all the results in this section about right strings and right star-operations into results about left strings and left star-operations.
inlineinlinetodo: inlineUnderstand the structure coefficients in for and in for and check what holds in these cases!
4.2 Consequences for -Cells
As we have seen in the last section one needs some assumptions on for the left and right star-operations to be well-behaved. Therefore, we keep these assumptions throughout this subsection. Fix for the rest of the section two simple reflections with . Throughout the section we consider the right star-operation with respect to .
Under these assumptions, the -cells in any finite Weyl group of rank coincide with the Kazhdan-Lusztig cells. Therefore, Theorem 3.9 implies for :
Lemma 4.11**.**
Let be any right -string. Then all elements of lie in the same right -cell of .
In particular, we have the following result:
Corollary 4.12**.**
For all , and lie in the same right -cell.
The following important result follows from Corollary 4.10:
Theorem 4.13**.**
For we have:
[TABLE]
In particular, if and lie the same left -cell, then the same holds for and .
Definition 4.14**.**
For with and we denote by the right -string through . Define to be the neighbouring elements of in .
View as a map where denotes the power set of . We define to be the map sending to . For , the map is defined inductively in a similar fashion.
Actually, one can characterize precisely the possible left -cell preorder relations among elements in right -strings:
Proposition 4.15**.**
Let (resp. ) be two right -strings consisting of elements. Up to possibly interchanging the roles of and , the set of left -cell preorder relations between the elements of these two strings is one of the following:
[TABLE]
for , where is a permutation of .
Proof.
The proof strategy is as follows: By applying Proposition 4.9 to the relation via , we get other elementary left -cell relations between the elements in and . The idea is to encode them in a function such that
[TABLE]
The claim of the proposition is that there is a normal form of arbitrary finite compositions of such functions. If is another such function, their composition sends to . This is simply the composition of multi-valued functions.
In order to simplify notation, we will identify the -th element in a right -string with its position . This allows us to view any such as a map . The composition of such functions is to be understood in a similar fashion. One needs to keep track of the start and end string of the whole composition in order to retranslate the function into the set of left -cell relations. Using Corollary 4.10 we see that such a map is already fully determined by the images of .
We will prove the statement for and leave the other cases to the reader. Apart from the identity consider the following maps where we identify by slight abuse of notation the permutation with the induced map :
[TABLE]
Using Proposition 4.9 it is easy to check that any elementary left -cell relation implies relations encoded by one of the functions above, for example implies relations encoded by either , or . Analyzing the relations among compositions of these functions, one has:
[TABLE]
Using these relations, we see that any finite composition of these maps can be reduced to one of the following compositions
[TABLE]
These correspond precisely to the cases with at least one relation stated in the proposition. ∎
Remark 4.16*.*
It should be noted that for some of these cases coincide. For example for , the permutation is trivial and there are only three distinct cases: The permuted case coincides with the trivial case. Moreover, the zig-zag case does not contain any relations and the permuted neighbour case does not exist. For , there are four distinct cases: The zig-zag case reduces to the permuted case and the permuted neighbour case does not exist.
The normal forms given in the proof of Proposition 4.15 allow us to deduce the following equivalences, which show how rigid the combinatorics in this situation are. The reader should compare these equivalences with Proposition 4.9 which only deals with the generating relations for the -cell preorder. It is a generalization of [Shi94, Proposition 4.6 and Remark 4.7]:
Corollary 4.17**.**
Let (resp. ) be two right -strings consisting of elements. In addition to for and we get the following equivalences:
[TABLE]
We can now generalize [Lus85, Proposition 10.7] as follows:
Proposition 4.18**.**
Let and be a union of left -cells such that . Then the following holds:
- (i)
* is a union of left -cells.* 2. (ii)
If is a left -cell, then is a union of at most left -cells. 3. (iii)
If is a left -cell, then is a left -cell as well.
Proof.
For two left -cells and contained in we have:
[TABLE]
Therefore, we may assume without loss of generality that is a left -cell. It is enough to prove that is a union of left -cells.
Let and such that . Then there exists a sequence
[TABLE]
of elements in (by Lemma 3.4) that all lie in the same left -cell as and . Consider the right -strings of all the elements in the sequence and note that contains an element . Since each -string is contained in a right -cell (see Lemma 4.11), the elements have the same left descent set. Thus for all the elements satisfy where is the simple reflection used to get from to . Express in the -canonical basis and remember the elements in indexing -canonical basis elements with non-trivial coefficients. This gives the elementary left -cell relations between and induced by . By combining the various elementary left -cell relations between and induced by along the sequence , we obtain for any a possibly empty set of elements in such that if and only if . The proof of Proposition 4.15 shows that for the image of stabilizes in the sense that . The element shows that there is an element in which implies and finishes the proof of (i).
We claim that any left -cell in intersects non-trivially. Let and . Use a sequence as above relating and to construct . Proposition 4.15 shows that there exist such that . Using the stabilization of as above, we get for and in particular lies in . This finishes the proof of the claim and shows that is a union of at most left -cells giving (ii).
(iii) is an immediate consequence of Theorem 4.13. ∎
Remark 4.19*.*
Analyzing the situation more carefully allows us to say more about the number of left -cells in . Let . Consider constructed as in the last proof for a sequence relating and . The proof of Proposition 4.15 shows that for stabilizes to one of the following maps:
[TABLE]
Finally, let vary over all potential sequences and vary over the elements in . If there exists an element and a sequence relating and such that stabilizes to , then is a left -cell (note that is always non-empty as all elements in have the same right descent set and this is not the case for all elements in ). inlineinlinetodo: inlineFind necessary and sufficient conditions for this to hold! Possible: contains elements whose positions in their strings do not sum up to ? contains more than one odd-numbered or more than one even-numbered element in a string?
Another situation, in which we can say more about the number of -cells in is the following: If and there exists a string such that contains only one odd-numbered element of , then decomposes into at least left -cells for descent set reasons. Therefore, under these assumptions contains precisely two right -cells if .
The definition of a -graph from [KL79, §1] describes a based representation of the Hecke algebra. A typical example is given by a Kazhdan-Lusztig cell module equipped with the Kazhdan-Lusztig basis, for which the -graph describes the action of the generating set of the Hecke algebra. In order to allow -graphs to also describe -cell modules, we need to slightly generalize the original definition, in which we use the generating set of the Hecke algebra instead:
Definition 4.20**.**
A coloured -graph is a directed graph with vertices and edges together with the following decorations:
- •
for each vertex a subset of ,
- •
for each edge a family of Laurent polynomials
[TABLE]
subject to the conditions below. Let be the free -module with basis . For define a -linear endomorphism of as follows
[TABLE]
where the sum is finite due to the second condition below. Then a coloured -graph is required to satisfy:
- (i)
the morphism , extends to a morphism of -algebras, 2. (ii)
for each pair there are only finitely many edges with .
It is immediate that we can associate to each left -cell a coloured -graph as defined above with as vertex set. For each we set and use edges to encode the structure coefficients for the -canonical basis for . Observe that right star operations do not modify the left descent set. This combined with Proposition 4.18 (iii) and Corollary 4.10 implies the following result:
Lemma 4.21**.**
Let be a left -cell contained in . Then the left -cell module associated to is isomorphic to the left -cell module associated to where is the right star-operation associated to and . In particular, the coloured -graphs and are isomorphic as decorated, directed graphs.
4.3 Vogan’s Generalized -Invariant
Vogan defined in [Vog79, Definition 3.10] an invariant of Kazhdan-Lusztig left cells in the setting of primitive ideals for semi-simple Lie algebras. This became known as Vogan’s generalized -invariant and was generalized in [BG15, Definition 5.1] to arbitrary Coxeter groups. (Observe that only pairs of simple reflections with matter in the following definition.) inlineinlinetodo: inlineGeneralize to ?! No real advantage! Only for .
Definition 4.22**.**
Since for consists of one or two elements, we use the following convention: We consider as a multiset with two identical elements in the following if is of cardinality .
We define a sequence of equivalence relations for as follows. For we write:
[TABLE]
We say that and have the same generalized -invariant if holds for all . We call the set
[TABLE]
the -equivalence class of .
Remark 4.23*.*
Observe that the last definition admits an obvious generalization allowing the case . For our current applications, we do not need this generality. Thus we exclude this case just like Vogan did in the original definition.
The following result shows that left -cells give a refinement of the -equivalence classes. It is a generalization of [BG15, Theorem 5.2]:
Theorem 4.24**.**
Assume if there exist with . Let be a left -cell. Then all elements in have the same generalized -invariant. In particular, any -equivalence class decomposes into left -cells.
Proof.
The proof of [BG15, Theorem 5.2] works after replacing all Kazhdan-Lusztig related constructions by their -canonical analogues with the following modifications: First add a zeroth case in which there exists a right -string such that for some minimal element in its right -coset. In this case, consists of a single left -cell, which allows us to conclude. Finally in the second case, use the left -cell preorder relations for the roles of and swapped instead of appealing to [Lus85, Corollary 6.3]. ∎
Corollary 4.25**.**
Assume if there exist with . Assume that two elements in have the same generalized -invariant if and only if they belong to the same Kazhdan-Lusztig left cell (i.e. the generalized -invariant gives a complete invariant of Kazhdan-Lusztig left cells). Then Kazhdan-Lusztig left cells decompose into left -cells.
In [Vog79, Theorem 6.5], Vogan shows that the generalized -invariant gives a complete invariant in finite type . The same holds in finite types (see [Gar93, Theorem 3.5.9] based on [Gar92, Gar93, Definitions 2.1.3. - 2.1.7., 3.2.1. and 3.4.1.]) and finite type (see [Ton95]). Therefore, we have:
Corollary 4.26**.**
The Kazhdan-Lusztig left cells in finite type decompose into left -cells. The same holds in finite types and for and in finite type .
Even though we currently can only calculate the full -canonical basis in types and for and in these groups only -torsion occurs, the last result is in particular of interest due to [Wil17a, Wil17]. In these papers Williamson shows that there is torsion in the local integral intersection cohomology of Schubert varieties in the flag variety of the general linear group that grows exponentially in the rank. This implies that the -canonical basis does not coincide with the Kazhdan-Lusztig basis for arbitrarily large primes in type (and that the primes for which this occurs grow exponentially in the rank). Since type embeds into type and this gives many interesting examples for which the -canonical basis and the Kazhdan-Lusztig basis differ for large primes .
In [Vog79, Remark following Proposition 4.4] Vogan mentions that the generalized -invariant is not a complete invariant in type . Similarly in type for (see the introduction of [Gar90]).
As proposed by [Vog80, §4] and [BG15, Remark 5.3] we could have defined an invariant as follows:
Definition 4.27**.**
As in Definition 4.27 we define a sequence of equivalence relations for as follows. For we write:
[TABLE]
where is the right star-operation with respect to . As above we say that and have the same generalized -invariant if holds for all . We call the set
[TABLE]
the -equivalence class of .
In this case, Theorem 4.13 immediately implies that the partition of into left -cells gives a refinement of the -equivalence classes:
Corollary 4.28**.**
Assume (resp. ) if there exist with (resp. ). Let be a left -cell. Then all elements in have the same generalized -invariant. In particular, any -equivalence class decomposes into left -cells.
In [GH15, Conjecture 6.9] Geck and Halls propose a slight variation of Vogan’s original conjecture (see [Vog79, Conjecture 3.11]) which goes as follows:
Conjecture 4.29**.**
For any finite Coxeter group two elements belong to the same Kazhdan-Lusztig left cell if and only if and lie in the same Kazhdan-Lusztig two-sided cell and in the same -equivalence class.
They verified their conjecture in all types and for and in all exceptional types. Moreover, they mention that in type the Kazhdan-Lusztig left cells are precisely the -equivalence classes. From this, we deduce that for the Kazhdan-Lusztig left cells in type decompose into left -cells. Our explicit computer calculations show that the -canonical basis and the Kazhdan-Lusztig basis in type only differ for and for the Kazhdan-Lusztig left cells do not decompose into left -cells.
4.4 -Cells in Type
Kazhdan-Lusztig cells in type can be characterized using the Robinson-Schensted correspondence. This result is usually attributed to [KL79, §4] even though the result is not stated in this form and depends on results of Joseph and Vogan in the setting of primitive ideals. The first combinatorial proof is due to [GM88] and [Ari00]. In this section we transfer almost verbatim Ariki’s proof to the modular setting. Since we feel that the proof is not as well documented as it should be, we decided to give the proof here.
Throughout this section we assume that we used the Cartan matrix in finite type as input. In this case can be identified with the symmetric group together with the set of simple transpositions. Letting act on on the left, we can write any element uniquely as which we call string notation.
Recall the definition of the elementary Knuth transformation for : Let be two elements of the symmetric group in string notation. Write if and differ only on the substrings and and these substrings are related to each other in either of the following two ways
[TABLE]
where . We say that and are Knuth equivalent if they are related by a sequence of elementary Knuth transformations for various . The following result follows immediately from the definitions:
Lemma 4.30**.**
* is the subset of elements in to which can be applied. Moreover, for all where is the right star-operation defined with respect to .*
The Robinson-Schensted correspondence (see [BB05, §A.3.3] or [Ful97, §4.1]) gives a bijection between the symmetric group and pairs of standard tableaux of the same shape with boxes. The row-bumping algorithm gives a way to explicitly calculate the image of under the Robinson-Schensted correspondence. We will need the following important classical result about the Robinson-Schensted correspondence (see [Ful97, §4.1, Corollary to Symmetry Theorem]):
Theorem 4.31** (Symmetry Theorem for ).**
If corresponds to , then corresponds to under the Robinson-Schensted correspondence.
Moreover, we need the following result by Knuth (see [Knu70, Theorem 6]):
Theorem 4.32**.**
Let . Then and are Knuth equivalent if and only if .
The goal is to prove the following theorem which is known for Kazhdan-Lusztig cells (see [Wil03, Theorem 5.4.1 and Corollary 5.4.2] or [BB05, Chapter 6, Exercise 11]):
Theorem 4.33**.**
For we have:
[TABLE]
In particular, Kazhdan-Lusztig cells and -cells of coincide.
Remark 4.34*.*
To prove the characterization of the left -cell cells we only need the following ingredients: For the direction we need Lemma 3.6 and Corollary 4.12. The other direction is more involved and relies on the version of Lemma 3.4 for left cells and crucially on Theorem 4.13.
Proof.
We will first deal with the statement about left -cells:
By Theorem 4.31 we have which implies by Theorem 4.32 that and are related by a sequence of elementary Knuth transformations (i.e. right start operations with respect to different subsets of consisting of two neighbouring simple reflections). Successive applications of Corollary 4.12 show that . This is equivalent to by Lemma 3.6.
Denote the shape of (resp. ) by (resp. ) and let (resp. ) be the column superstandard tableau (see [BB05, §A3.5] for the definition) of shape (resp. ). The Robinson-Schensted correspondence gives elements with and -symbols and respectively. The implication we proved above gives and which implies by our assumption . In order to show consider the elements corresponding to and respectively (under the Robinson-Schensted correspondence). Theorem 4.32 implies that the elements and as well as and are related by sequences of Knuth moves:
[TABLE]
Lemma 3.4 for the left -cell preorder shows that the elements and have the same right descent set, so the same right star-operations or Knuth moves (see Lemma 4.30) can be applied to both elements. By Theorem 4.13 we have and . Therefore, we can repeat the argument to see that the following elements are well-defined:
[TABLE]
Moreover, we have as well as and thus and . Using Theorem 4.32 we see that and .
Denote the column lengths of (resp. ) by (resp. ). It follows from the row-bumping algorithm that is the longest element in the parabolic subgroup of , i.e. in string notation the element
[TABLE]
From and the characterization of right descent sets for elements in in terms of inversions, we deduce that in the string notation for the first letters are decreasing as well as the next letters and so on. Similarly, we may use that is the longest element in the parabolic subgroup of and to deduce that in the string notation of the first letters are decreasing, the next letters are in decreasing order, etc.
Applying the row-bumping algorithm to to calculate , we obtain the inequality . Using instead, we get the opposite inequality giving . Moreover, this shows that when inserting the next letters of , no row bumping occurs in the first column (otherwise we would have ) and thus we have . Again, we may use to get the opposite inequality and to show . Repeating the argument, we get and thus (by the definition of the column superstandard tableau and the fact that encodes the order in which boxes are added in the course of the row-bumping algorithm). This shows as well as by unravelling the sequences of Knuth moves. Finally, the Robinson-Schensted correspondence gives and finishes the proof of the characterization of left -cells in terms of -symbols.
Using Theorem 4.31 and Lemma 3.6 we obtain the version for right -cells. Finally, we prove the statement about two-sided -cells:
Theorem 4.32 shows that any two elements of with the same -symbol can be related by a sequence of elementary Knuth transformations. Dually, any two elements with the same -symbol are linked by a sequence of elementary dual Knuth transformations, which we did not introduce, but which correspond to left star-operations. Given an element we can thus transform its and symbols using Knuth transformations and their duals into any pair of given standard tableaux of the same shape. Denote by the shape of and let be the column superstandard tableau of shape . The statement about left and right -cells shows that lies in the same two-sided -cell as the element corresponding to under the Robinson-Schensted correspondence. From this, the reader easily deduces the direction .
Given an element , denote by the shape of . Let be as defined above. We claim that implies .
Note that is the longest element in a standard parabolic subgroup of . Thus we have
[TABLE]
As and have the same shape, the direction implies and . The relation together with (9) gives us for all :
[TABLE]
Therefore, any element satisfies .
Finally, this finishes the proof of the direction by using the characterization of the Kazhdan-Lusztig two-sided cells in terms of the shape of the -symbols.∎
Remark 4.35*.*
Even though Kazhdan-Lusztig left (resp. right) cells coincide with left (resp. right) -cells, it is not known whether the corresponding preorders coincide as well. Leonardo Patimo has a short proof of the fact that the dominance order on partitions is generated by the weak Bruhat order. This implies that the Kazhdan-Lusztig two-sided cell preorder coincides with the two-sided -cell preorder.
Theorem 4.31 implies that the involutions in are precisely those elements that satisfy . This is the only missing observation for the next result:
Corollary 4.36**.**
Each left -cell contains a unique involution. Each two-sided -cell contains the longest element in a standard parabolic subgroup. Let (resp. ) be a left (resp. right) -cell. Then we have:
[TABLE]
Let be a permutation of . Recall Frame, Robinson and Thrall’s hook length formula for the number of standard tableaux of shape ([Ful97, §4.3]):
[TABLE]
where denotes the number of boxes in the hook of in , i.e. in formulas . The following corollary shows that the hook length formula gives the answer to some counting problems related to -cells:
Corollary 4.37**.**
Let be a two-sided -cell. Denote by the shape of the and -symbols of the elements in . Then the following holds:
- (i)
The number of left (or right) -cells in is given by . 2. (ii)
For any left (or right) -cell contained in , the corresponding -cell module is free of rank over .
Observe that the preorder is by definition generated by and . It is in general not clear though whether is also generated by and . For the Kazhdan-Lusztig cell preorder this follows using certain properties of Lusztig’s -function (see [Lus03, Conjectures 14.2 P9 and P10]).
Corollary 4.38**.**
The cell preorder is generated by and in type .
As a consequence of Lemma 4.21, we get the following result which is known for Kazhdan-Lusztig left cell modules (see [BB05, Theorem 6.5.2]) and for which the proof works exactly as in characteristic [math]:
Corollary 4.39**.**
Let and be left -cells in the same two-sided -cell. Then the corresponding left cell modules are isomorphic.
We want to conclude with some interesting questions that merit further study. We hope to come back to them in another paper:
- •
In type , the -canonical basis for various primes gives a family of interesting bases of each Kazhdan-Lusztig cell module. Which bases of the corresponding irreducible representation of do they specialize to? In [Wil15, §1 and §2.3] Williamson explains that any -canonical basis element of a right (or two-sided) cell module that differs from the corresponding Kazhdan-Lusztig basis element provides an example of a reducible characteristic variety of a simple highest weight module for .
- •
In Type , the generalized -invariant can be strengthened to give a complete invariant of Kazhdan-Lusztig cells. This is verified in [Gar] together with work of McGovern and Pietraho. Can one show that all elements of a left -cell have the same strengthened generalized -invariant to get that Kazhdan-Lusztig cells decompose into -cells in type ?
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AHR 17] Pramod N. Achar, William Hardesty and Simon Riche “On the Humphreys Conjecture on support varieties of tilting modules”, 2017 eprint: ar Xiv:1707.07740
- 2[AHR 18] Pramod N. Achar, William Hardesty and Simon Riche “Conjectures on tilting modules and antispherical p 𝑝 p -cells”, 2018 eprint: ar Xiv:1812.09960
- 3[AMRW 17a] Pramod N. Achar, Shotaro Makisumi, Simon Riche and Geordie Williamson “Free-monodromic mixed tilting sheaves on flag varieties”, 2017 eprint: ar Xiv:1703.05843
- 4[And 04] Henning Haahr Andersen “Cells in affine Weyl groups and tilting modules” In Representation theory of algebraic groups and quantum groups 40 , Adv. Stud. Pure Math. Math. Soc. Japan, Tokyo, 2004, pp. 1–16
- 5[Ari 00] Susumu Ariki “Robinson-Schensted correspondence and left cells” In Combinatorial methods in representation theory (Kyoto, 1998) 28 , Adv. Stud. Pure Math. Kinokuniya, Tokyo, 2000, pp. 1–20
- 6[BV 83] Dan Barbasch and David Vogan “Primitive ideals and orbital integrals in complex exceptional groups” In J. Algebra 80.2 , 1983, pp. 350–382 DOI: 10.1016/0021-8693(83)90006-6 · doi ↗
- 7[Bé89] Robert Bédard “Left V-cells for hyperbolic Coxeter groups” In Comm. Algebra 17.12 , 1989, pp. 2971–2997 DOI: 10.1080/00927878908823889 · doi ↗
- 8[Bel 04] Mikhail Belolipetsky “Cells and representations of right-angled Coxeter groups” In Selecta Math. (N.S.) 10.3 , 2004, pp. 325–339 DOI: 10.1007/s 00029-004-0355-9 · doi ↗
