Proposition 3.1.1. We have .
Given and , we have
Given commuting with , we have .
There is an isomorphism of -modules
with
In this section, we define and study variations of the nil affine Hecke algebra of . From §3.1.5 onwards, all additive structures will be defined over .
We discuss here the case of general Coxeter groups. The results will be used only for types and .
We refer to [Hu, §5 and §7.1–7.3] for basic properties of Coxeter groups and Hecke algebras. Recall that a Coxeter group is the data of a group with a subset such that has a presentation with generating set and relations
A reduced expression of an element is a decomposition such that for and such that is minimal with this property. The integer is the length of .
The Chevalley-Bruhat (partial) order on is defined as follows. Let and let be a reduced decomposition. We say that if there is and an increasing injection such that . This is independent of the choice of the reduced decomposition of .
Let where and are indeterminates with and if and are conjugate in .
The Hecke algebra of is the -algebra generated by with relations
Given a reduced decomposition , we put . This element is independent of the choice of the reduced decomposition of . The set is a basis of .
Let be the algebra automorphism defined by for .
Let be a subset of . We denote by the subgroup of generated by . The group , together with , is a Coxeter group and the length function on is the restriction of that on [Hu, §1.10].
We put where and are indeterminates with and if and are conjugate in . There is a morphism of rings .
We denote by the -subalgebra of generated by . There is an isomorphism of -algebras .
We assume for the remainder of §3.1.2 that is finite. In this case, there is a unique element of with maximal length [Hu, §1.8] and we denote by its length. We have and . There is an automorphism of algebras
We denote by the longest element of and by its length. We denote by (resp. ) the set of elements such that has minimal length in (resp. ). Note that [Hu, Proposition 1.10].
We assume in §3.1.3 that is finite.
Given , we define an -linear map
The next proposition shows this is relative Frobenius form (cf eg [Rou1, §2.3.2]).
Proposition 3.1.1. We have .
Given and , we have
Given commuting with , we have .
There is an isomorphism of -modules
with
Proof. Define and , so that . We have .
Let . There is a unique decomposition where , and [Hu, Proposition 1.10]. Furthermore, unless . We have .
There is a unique decomposition with , and has minimal length in . We have where and has minimal length in . Furthermore, if and only if and . It follows that
This shows the first statement of the lemma.
We have , hence
This shows the second statement of the lemma.
Let . We have . Since is a linear combination of elements with and , it follows that if , then is a linear combination of elements with and , hence of elements with . So, if , then .
Assume now . We have because . We deduce that . This shows the third statement of the lemma.
Let . We have . Let . Note that or is a linear combination of ’s with . It follows that if if or and . We have also .
Since is a free right -module with basis , we deduce that is surjective. Since is an -module morphism between free -modules of the same finite rank, it follows that it is an isomorphism. This shows the fifth statement of the lemma.
Let and . Let . If , then and . If , then . If , then . So, we have shown that . It follows by induction on that for all .
Consider now commuting with . Let . We have
It follows that , hence . This completes the proof of the lemma. ∎
We put . We define an -linear map
We have .
We put . We have an isomorphism of -modules
with
Consider with or . We define an -bimodule with underlying -module . We put if and if .
If , then the right action of is by right multiplication and the left action of is by left multiplication by .
If , then the left action of is by left multiplication and the right action of is by right multiplication by .
Note that is free of finite rank as a left module and as a right module.
There is an isomorphism of -bimodules
The next result follows immediately from Proposition 3.1.1.
Corollary 3.1.2. The map is an isomorphism of -bimodules
The results above can be formulated in terms of dual bases. Note that is a basis of the free right -module , while is a basis of the free left -module .
We have
We deduce that the basis when (resp. when ) of the free left -module is dual to the basis when (resp. when ) of the free right -module , via the pairing providing the isomorphism of Corollary 3.1.2.
The counit of the adjoint pair is given by the morphism of -bimodules
while the unit is given by the morphism of -bimodules
We define the nil Hecke algebra of as the -algebra . This is the -algebra generated by with relations
This is a -graded algebra with in degree for .
The multiplication is given as follows:
| (3.1.1) |
Consider the filtration of the group algebra where is spanned by group elements with , for . The associated -graded algebra is and is the image of in the degree homogeneous component of .
Let . We define a linear map by
Proposition 3.1.3. The map defines a structure of differential graded algebra on .
Consider now and with . We have by the result above. It follows that .
We deduce that for all .
Since for , it follows that by induction that . ∎
The following corollary shows that the computation of can be done using the Leibniz rule, given a reduced decomposition of . The terms that do not vanish are exactly the terms given in the original definition of .
Corollary 3.1.4. Let be a reduced expression of . We have
We have if and only if is reduced, i.e., if and only if .
Given with reduced, we have .
Proof. The first statement follows from Proposition 3.1.3. The second statement is a property of the multiplication of ’s.
For the third statement, let us assume . We have reduced, hence is not reduced, a contradiction. ∎
Remark 3.1.5. Note that the algebra is acyclic if .
Note also that one can introduce a family of commuting differentials for modulo conjugacy by setting if is conjugate to and otherwise.
The specialization over at of the bimodules of §3.1.3 acquire a structure of differential graded bimodules, using the differential graded structure of . We keep the same notation for those differential graded specialized bimodules and for the maps and .
Proposition 3.1.6. If is finite, then
is a morphism of differential graded -modules and Corollary 3.1.2 provides an isomorphism of differential graded -bimodules
Proof. Let . There is a unique decomposition where , and .
We have . If and , then . It follows that
∎
Let be the pointed -graded monoid with underlying pointed set and multiplication given by (3.1.1). This is the pointed monoid associated to the filtration on given by and there is an identification making into a differential graded pointed monoid.
Fix . The symmetric group is a Coxeter group with generating set .
Its differential nil Hecke algebra is the -algebra generated by with relations
| (3.2.1) |
and with differential given by .
The algebra has a basis .
Let . We denote by the extended affine symmetric group: this is the subgroup of the group of permutations of with elements those bijections such that for all .
Given with , we denote by the element of defined by
Note that , and .
The symmetric group identifies with the subgroup of of permutations such that . We have a surjective morphism sending to the induced permutation of . We identify its kernel with via the injective morphism
We have .
Assume . Let be the Coxeter group of type : it is generated by with relations
Consider the semi-direct product of by an infinite cyclic group generated by an element , with relation .
Lemma 3.2.1. There is an isomorphism of groups
Proof. Denote by the map of the lemma. By [Lus, §3.6] (cf also [BjBr, Proposition 8.3.3]), the restriction of to induces an isomorphism with the subgroup of of elements such that . It is immediate to check that extends to a morphism of groups .
Consider and let . Note that . Put . We have , so is surjective. Let . We have . So, if , then , hence . This shows that is injective. ∎
We will identify and via the isomorphism of Lemma 3.2.1.
We put , so that . We also put .
The permutations of can be described as collections of strands in going leftwards from integer points on the vertical line to integer points on the vertical line . Thanks to their -periodicity, those permutations that are elements of can also be encoded in a collection of strands drawn on a cylinder, going from right to left, by passing to the quotient of the vertical strip by the vertical action by translation of .
Here are some elements of :
![]() |
The multiplication of and in corresponds to the concatenation of the diagram of put to the left of the diagram of as in the following example:
![]() |
The defining relations for are depicted as follows
![]() |
![]() |
![]() |
![]() |
The elements of correspond to diagrams whose strands do not go in the back of the cylinder, hence can be drawn on a rectangle. For example, above can be represented as follows:
![]() |
Assume now again that . We extend the length function on the Coxeter group to one on by setting for and . Note that the action of on preserves lengths. Similarly, we extend the Chevalley-Bruhat order on by setting if and and we consider the corresponding order on . Note that the action of on preserves the order, hence if and only if .
Lemma 3.2.2. Let and . Assume . Let such that and .
Let and . We have and .
Proof. Multiplying if necessary and by a power of , we can assume , and are in .
Let and be two reduced decompositions. The Exchange Lemma [Hu, Theorem 5.8] shows that there is such that .
If , then and this contradicts . So, . We have . We deduce that has length and the lemma follows. ∎
Given , we put . This set has a diagonal action of by translation. We put . The canonical map is bijective.
The next lemma is a variation on classical results (cf [Sh, Lemma 4.2.2], [BjBr, Proposition 8.3.6] and [BjBr, §2.2]).
Lemma 3.2.3. Let . We have for all and
If , then .
Assume and is a reduced decomposition of . Given , let with .
The set is a subset of . This induces a bijection
Proof. Consider a pair with and such that and for . Given with , we have , a contradiction. It follows that . We have
We deduce by induction on that .
We prove the statements on by induction on . By induction, the statements hold for . In particular, . It follows that . Assume . It follows that , hence , a contradiction. It follows that , hence
The last statement of the lemma follows now by induction.
Consider now . Up to translating diagonally by , we can assume there is such that and . So , hence . The lemma follows. ∎
Lemma 3.2.4. Given , we have and if and only if there is such that and
or and
given with , we have or .
Proof. Consider and let . Consider integers with .
If , then if and only if .
Assume now . We have three possibilities:
, : we have if and only if or (and then )
, : we have if and only if or (and then ).
, with : we have if and only if or (and then ).
We deduce there is an injective map given by
and
Note that .
Let us now prove the lemma. We have and for some . Assume and . We have , and . It follows that there is a reduced decomposition and such that . Let and . We have and (Lemma 3.2.3).
The discussion above shows that and . The lemma follows. ∎
Example 3.2.5. The elements of are in bijection with intersection points between strands of a “good diagram” representing . Here, we define a strand diagram to be good if no more than two strands intersect at a given point and if the diagram minimizes the total number of intersection points. Similarly, the elements of correspond to intersections in an unfolded good strand diagram.
These descriptions can be deduced from Lemma 6.2.3 below, that shows those statements hold for pairs of strands. Now, the intersection point set for a good diagram is the disjoint union over intersection sets between pairs of strands, and a good diagram minimizes the intersection number among good diagrams if and only of each pair of strands minimizes its intersection number.
For example:
![]() |
We let act on the differential graded algebra by . Let . For , it is the differential graded -algebra generated by and with relations
and differential , . The element has degree , while has degree . Note that , a differential graded algebra in degree with .
Let , and . We put . We also put for . The set is a basis of .
Remark 3.2.6. Define a filtration on with the subspace spanned by group elements with . The associated graded algebra is .
We put .
Remark 3.2.7. The group is more classically described as a semi-direct product (cf §3.2.2) coming from its description as the extended affine Weyl group of . The nil affine Hecke algebra of associated with this description (cf e.g. [Rou2, §2.2.2]) is not isomorphic to . When considering invertible (instead of ) parameters, the two algebras are isomorphic.
Example 3.2.8. An element of will be representated by a good strand diagram for . The multiplication of and is obtained by concatenating the diagrams of and (as in the multiplication of and ). If the corresponding diagram is good, then , where is represented by the concatenated diagram. Otherwise, . For example:
![]() |
Let be the submonoid of of permutations such that . Note that is stable under left and right multiplication by .
There is a decomposition .
We have for , hence restricts to an isomorphism from the submonoid of generated by to .
Let , an -subspace of containing .
Proposition 3.2.9. is a differential graded subalgebra of .
The algebra has a presentation with generators and relations
Let be the -algebra with generators and relations
Given , we put . Given non-empty with elements , we put . Note that .
There is a morphism of algebras and we denote by the image of for .
Example 3.2.10. The elements of correspond to strand diagrams where the strands wind positively around the cylinder. The relation is illustrated below:
![]() |
We describe some elements and the image of in :
![]() |
The element corresponds to the following element of :
![]() |
Lemma 3.2.11. The set with , and , for generates as a -vector space.
Proof. Let and . We have
Consider non-empty with elements . We put and .
Consider . Fix such that . Let us show that
| (3.2.2) |
We have
If , then and we deduce the first two equalities in (3.2.2). Assume now . We have and the third equality in (3.2.2) follows. The last equality from the fact that given , we have
We deduce that for some with and and .
Fix with . We have
Consider as in the lemma. Let be minimal such that . We put if there is no such . Define if and otherwise. Put . Recall that . We have
where for , and for .
We deduce that the set of the lemma is stable under right multiplication by for and by . Since contains , it follows that is a generating family for as an -vector space. ∎
Remark 3.2.12. An example of the description of in the proof of Lemma 3.2.11 is given below:
![]() |
Proof of Proposition 3.2.9. Let be the subalgebra of generated by . This is a differential graded subalgebra of . Given , let . Let , . We show by induction on that .
Assume for some . We have and , hence by induction . We deduce that .
Otherwise, we have , hence since . It follows that and , hence by induction. So .
We have shown that . Since is stable under right multiplication by and by for , it follows that .
There is a surjective morphism of algebras . Given a non-empty subset of , we put
We have for and if (where we put and ).
Let be the set of families where , and for .
Given and , we have and that element is either or .
We define a map . Let . Let . We put and we define inductively for by . We put . We have
We define a map . Let . We define by and we put . The maps and are inverse bijections. We deduce that the map sending to the class of is bijective. It follows that the map is bijective.
If for some and , then the bijectivty of the map above shows that the image of is the span of a proper subset of a basis of , contradicting the surjectivity of .
This shows that the elements are distinct basis elements of , hence is an isomorphism. ∎
Remark 3.2.13. The same method as the one used in the proof of Proposition 3.2.9 shows that is the free -monoid on a generator with relations for and .
Given , we put . This is the quotient of the free pointed monoid generated by by the relations (3.2.1). The differential is given by . Note that and .
We define to be the differential graded pointed monoid with underlying differential pointed set and multiplication, grading and differential that of .
We define to be its differential graded pointed submonoid with non-zero elements those that stabilize .
Original source: arXiv:2009.09627v2