Path Subgroupoids of Weyl groupoids,
Rainbow Boomerang Graphs
and Verma modules for
Nichols algebras of diagonal type
Abstract
We extend the exchange property of Weyl groupoids in the sense of Heckenberger and Yamane to a newly introduced class called path subgroupoids of Weyl groupoids. This extension allows us, in particular, to interpret the fact that odd reflections of basic Lie superalgebras satisfy the exchange property as a consequence of the combinatorics of the Weyl groupoid.
We also establish an analogous statement within the same framework for Nichols algebras of diagonal type, generalizing our previous results on homomorphisms between Verma modules sharing same characters but associated with different Borel subalgebras in the case of basic Lie superalgebras.
1 Introduction
1.1 Background and motivation
The Weyl groupoids in the sense of Heckenberger and Yamane [20, 19, 11], introduced with the classification of Nichols algebras of diagonal type [18, 1] in mind, are recognized as a good generalization of Conway-Coxeter’s frieze patterns [19, 12, 10] (Example 2.11) and root systems of basic Lie superalgebras [6, 19, 5] (Remark 3.12).
Importantly, they inherit the favorable properties of Weyl groups. For instance, they retain properties such as the exchange property, the existence and uniqueness of the longest element, and the existence of Hamiltonian cycles in their Cayley graphs [22, 33].
On the other hand, as observed in [15, Proposition 3.5.3], even when considering odd reflections of basic Lie superalgebras [30], they still satisfy a similar exchange property. In [21], the exchange property was utilized to study homomorphisms between Verma modules.
The goal of this work is to unify the exchange property of Weyl groupoids with that of odd reflections. Furthermore, through this approach, we explain analogous results of [21] for Verma modules of Nichols algebras of diagonal type, showing that they can be understood in the same framework as in the case of basic Lie superalgebras. This unified perspective will also be useful for future studies of other algebraic structures that can be understood within the Weyl groupoid framework [4].
The root systems of basic Lie superalgebras are known to serve as fundamental concrete examples of Weyl groupoids, particularly through the classification of Weyl proupoids [13]. Technically, the Weyl groupoid of a basic Lie superalgebra is better described by a more informative object, namely a non-simply connected Weyl groupoid [19]. For example, the simply connected Weyl groupoid of depends only on . However, the formulation given in [19] posed certain difficulties when applied to actual studies of basic Lie superalgebras. Extending the formulation of [19], we introduce supplementary concepts to address these issues.
In [21], the exchange property was formulated in terms of edge-colored graphs by introducing the class of rainbow boomerang graphs (Proposition 2.26). We utilize this framework to achieve the aforementioned unification.
This paper is structured as follows.
In Section 2.1, following Heckenberger and Yamane, we discuss the foundations of Weyl groupoids, paying particular attention to simply connectedness due to its relevance to our setting.
In Section 2.2, we introduce the class of path subgroupoids and explain, using the rainbow boomerang graph, that the exchange property holds within this class.
In Section 3, we explain that the groupoid generated by the odd reflections of basic Lie superalgebras forms a path subgroupoid by referencing the convenient formulation of [6].
In Section 4, we study the composition of homomorphisms between Verma modules with the same character for Nichols algebras of diagonal type. We demonstrate that, in this setting, the structure closely resembles the case of basic Lie superalgebras [21].
1.2 Acknowledgements
I would like to express my heartfelt gratitude to my supervisor, Syu Kato, for his patient and extensive guidance, as well as for his helpful suggestions and constructive feedback. The author is also grateful to Istvan Heckenberger for his valuable discussions, comments and helpful advices. I would also like to sincerely thank Yoshiyuki Koga and Hiroyuki Yamane for engaging in insightful discussions on related topics. The author would like to thank the Kumano Dormitory community at Kyoto University for their generous financial and living assistance.
2 Weyl groupoids
2.1 Basics and examples
See [19, Section 9,10] for basic material about Weyl groupoids.
Definition 2.1.
[19] An edge-colored graph with vertex set is called a semi Cartan graph (also known as a Cartan scheme) if it is equipped with:
-
•
a non-empty finite set of colors,
-
•
and a label set , where each is a generalized Cartan matrix of size (in the sense of [24]),
satisfying the following conditions:
-
(CG1)
is properly colored (i.e., edges emanating from the same vertex have distinct colors) and -regular (i.e., each vertex is incident to exactly edges).
-
(CG2)
If two vertices and are connected by an edge of color , then the -th row of equals the -th row of .
The underlying edge-colored graph of a semi Cartan graph is called the exchange graph and is denoted by . When illustrating , we omit loops for simplicity, thanks to (CG1).
The size of is called the rank of .
For , define as the vertex connected to by an edge of color . Then, is an involution on .
For each , consider a copy of associated with . The standard basis of is denoted by .
The standard basis of is also denoted by . We define a standard isomorphism for each , which maps to for .
For each and , define by the mapping:
When the context is clear, the subscript in may be omitted. Additionally, it is sometimes expressed as a composition with the identity map at a vertex to emphasize the starting or ending points of the mapping.
Remark 2.2.
Our (CG1) is equivalent to (CG1) in [19].
Definition 2.3 (Semi Weyl Groupoid).
The semi Weyl groupoid of is the category with objects , where the morphisms from to are elements of of the form
We denote the set of such morphisms as . The composition of morphisms is defined by the natural composition of these maps.
By the above construction, the semi Weyl groupoid indeed becomes a groupoid due to (CG2). For a general connected groupoid , note that the group structure of does not depend on the choice of . An element of can be regarded as an element of via and .
Definition 2.4 (Real Roots).
[19] For each , define the set of real roots as subsets of of the form:
Let the set of positive real roots be defined as:
A semi Cartan graph is said to be finite when .
Definition 2.5.
[19] A semi Cartan graph is called a Cartan graph if it satisfies the following conditions:
-
(CG3)
For all , .
-
(CG4)
If and for all , then . In particular, we have .
A semi Weyl groupoid arising from a (finite) Cartan graph is called a (finite) Weyl groupoid.
Remark 2.6.
Remark 2.7.
In existing literature, such as [19], groupoids arising from semi Cartan graphs are also referred to as Weyl groupoids. On the other hand, there is a convention of using the term Weyl groupoid where generalized root system would be more appropriate. Indeed, as in the case of classical BC types, groupoids associated with distinct Cartan graphs can be isomorphic. While adhering to this convention, we distinguish groupoids associated with semi Cartan graphs, which are not Cartan graphs, by calling them semi Weyl groupoids to avoid confusion.
Lemma 2.8 ([19], Lemma 9.1.19).
Let be a semi Cartan graph satisfying (CG3). Then provides a bijection between the sets
Theorem 2.9 ([19] Theorem 9.3.5).
Let be a Cartan graph and . Define
and
Then, .
Remark 2.10.
[19] A semi Cartan graph is called standard if is independent of .
For a standard Cartan graph :
This result and the term ”real root” are from Kac [24] and are consistent with the definitions provided therein.
In particular, the Weyl groupoid arising from a finite Cartan graph with a single vertex can be identified with the Weyl group of type .
Example 2.11.
From the semi Cartan graph of rank two above, considering (CG2), the sequence naturally corresponds to it. Determining the real root system of this semi Cartan graph can be confirmed to be equivalent to considering a frieze with this sequence as the quiddity sequence. In this case, the frieze is as follows, confirming that it is a finite Cartan graph.
For example, when the top-left vertex of the graph above is denoted as , the set
corresponds to the bold column in the following frieze. Similarly, it can be confirmed that the real root system of the adjacent vertex corresponds to the sequence shifted by one position. Furthermore, the frieze extended to negative entries can also be interpreted in terms of negative roots.
By a similar argument, it can be seen that a connected (simply connected) finite Cartan graphs of rank two is equivalent to the concept of frieze patterns. In particular, according to the classification results of Conway and Coxeter [9], the isomorphism classes are parametrized by the triangulations of regular polygons. In particular, the current example corresponds to a triangulation of regular pentagon.
Definition 2.12.
A morphism of vertex-labeled edge-colored graphs is a graph morphism that preserves both the labels of the vertices and the colors of the edges.
Below, let the semi Cartan graph be connected. Consider a vertex-labeled edge-colored graph morphism between semi Cartan graphs with the same color set . We call a covering.
Proposition 2.13 ([19], Proposition 10.1.5).
Let be a covering. Then there exists a natural functor on the semi-Weyl groupoid:
which induces an injective homomorphism
for each vertex .
Definition 2.14.
[19] A semi-Cartan graph is called simply connected if the map is an isomorphism for every covering .
Equivalently, is simply connected if
Proposition 2.15 ([19], Proposition 10.1.6).
Let be a Cartan graph. For and a subgroup , there exists a covering and a vertex such that:
Moreover, such a covering is unique up to isomorphism, and
In particular, a simply connected covering of , as a Cartan graph, always exists and is unique up to isomorphism.
Example 2.16.
By (CG4), the vertex set of a connected simply connected Cartan graph can be identified with a set , where is fixed. Clearly, a connected Cartan graph is loopless if and only if it is simply connected. If is standard, then , as a graph, is the same as the Cayley graph of the Weyl group. By [22, 33], a simply connected Cartan graph is Hamiltonian (i.e. there exist a path that visits every vertex of a graph exactly once and returns to the starting vertex).
Example 2.17.
The isomorphism classes of connected standard Cartan graphs of type correspond to the conjuate classes of subgroups of via the following Galois correspondence:
In more detail, the graph:
is represented as:
which is the Cartan graph of in the sense of Theorem 3.8. The corresponding Weyl group is isomorphic to .
Additionally, the graph:
is represented as:
which is the Cartan graph of in the sense of Theorem 3.8. The corresponding Weyl group is isomorphic to .
2.2 Path subgroupoids and rainbow boomerang graph
Below, let the semi Cartan graph be connected.
Definition 2.18.
The path subgroupoid of a semi Cartan graph is defined as the subgroupoid of the semi Weyl groupoid generated by morphisms of the form:
where . For , the set of morphisms between and in this subgroupoid is denoted by .
For , we define:
and
This definition does not depend on the choice of .
A semi Cartan graph is said to be path simply connected if
Moreover, if satisfies (CG3), this condition is equivalent to the following: For a fixed point and any , holds.
Furthermore, if is finite, this condition is also equivalent to .
Lemma 2.19.
path simply connected semi Cartan graph is multiedge free
Proof. If there were two edges with the labels and between two nodes and , then we would have:
Thus, we have : .
Example 2.20.
The following finite Cartan graph is multiedge-free but not path-simply connected.
Example 2.21.
The path subgroupoid of a simply connected Weyl groupoid is the Weyl groupoid itself. Hence, by the definition of simply connectedness, it is path simply connected.
Example 2.22.
semi Cartan trees are trivially path simply connected.
Definition 2.23.
When is path simply connected, for , let be the unique element in . Define as
and as
For instance, if is simply connected, then .
Definition 2.24.
For a path simply connected Cartan graph , we define the edge-colored graph as follows:
-
•
Underlying graph: The underlying graph of , with loops removed.
-
•
Color set : For a fixed ,
-
•
Coloring: Replace each edge between and colored with an edge colored by a unique such that (see Lemma 2.8).
Below, following [21], we recall the definition of a rainbow boomerang.
Definition 2.25.
[21, Definition 2.3]([Rainbow Boomerang Graph] A edge-colored graph which is properly colored (i.e. for each vertex the insident edges have distinct colors) is called a rainbow boomerang graph when a walk is shortest if and only if it is rainbow.
The following is the property of our interest.
Proposition 2.26 (Exchange property: Proposition 2.10 in [21]).
Let be a rainbow boomerang graph. Let be a positive integer. If there exists a rainbow walk and an edge , then there exists a rainbow walk such that .
Corollary 2.27.
[21, Corollary 2.13] For a connected rainbow boomerang graph and a color of , the edge-colored graph obtained by removing all edges of color from consists of two connected components, each of which is a rainbow boomerang graph.
Theorem 2.28.
of a path simply connected Cartan graph is a rainbow boomerang graph.
Proof. In the simply connected case, this follows immediately from Theorem 2.9.
In general, if is connected and path-simply connected, then under the natural identification of with the root system of , the edge-colored graph obtained from by removing edges with colors belonging to is a disjoint union of copies of , with the number of components equal to the order of the group of automorphisms of an object of by Proposition 2.15. Consequently, is a rainbow booerang graph by Corollary 2.27.
Example 2.29.
By appropriately removing edges from the Cayley graph of the symmetric group on 4 elements with respect to its simple reflections, we obtain a disjoint union of four finite Young lattices . This is consistent with the fact that the order of the Weyl group of is 4.
Example 2.30.
Let be a finite Cartan graph of rank 2. Then, is multiedge-free (if , this is the case) if and only if is path simply connected. In this case, is one of the following:
-
•
a line segment ;
-
•
a cycle graph of length () .
3 Non simply connected Weyl groupoids of basic Lie superalgebras
From now on, our will be a direct sum of one of the finite-dimensional basic Lie superalgebras from the following list:
For concrete definitions, we refer to [29][Chapters 1-4].
We denote the even and odd parts of as and , respectively.
Definition 3.1 ([29, 7]).
A Cartan subalgebra and the Weyl group of the reductive Lie algebra are denoted by and , respectively.
A basic Lie superalgebra has a supersymmetric, superinvariant, even bilinear form , which induces a -invariant bilinear form on via duality.
The root space associated with is defined as
The set of roots is defined as Each is either purely even or purely odd and is one-dimensional (our list does not include and ). Therefore, the notions of even roots and odd roots are well defined. An odd root is said to be isotropic if . The sets of all even roots, even positive roots, odd roots and odd isotropic roots are denoted by , ), and , respectively.
Definition 3.2 ([29, 7]).
We fix a Borel subalgebra of . The set of all Borel subalgebras of that contain is denoted by .
For a Borel subalgebra , we express the triangular decomposition of as
where .
The sets of positive roots, odd positive roots, and odd isotropic positive roots corresponding to are denoted by , , and , respectively. The set of simple roots (basis) corresponding to is denoted by . We define . We define
Theorem 3.3 (Odd reflection [29] 3.5).
For , define by
for . (When there is no risk of confusion, is abbreviated as .) A Borel subalgebra exists, with the corresponding basis given by
The linear transformation of induced by an odd reflection does not necessarily map a Borel subalgebra to another Borel subalgebra.
The following is well-known:
Proposition 3.4 ([29, 7]).
Each pair of elements due to transferred to each other by a finite number of odd reflections.
Definition 3.5.
The edge-colored graph is defined as follows:
-
•
Vertex set: .
-
•
Color set: For a fixed , the set .
-
•
Edges and colors: An edge is drawn between two vertices if they are related by an odd reflection. The edge is assigned a color corresponding to the unique such that belongs to the positive root system of one vertex but not the other.
Since the positive root systems associated with different Borel subalgebras are in one-to-one correspondence, the structure of the edge-colored graph does not depend on the choice of .
Definition 3.6 ([6, 30]).
Let , and consider a total ordering on . We call the pair an ordered root basis. This ordering is denoted by
For a composition of odd reflections , we define the ordered root basis
by
In this way, the ordered root bases are mapped to each other under odd reflections.
Definition 3.7.
Recall Definition 3.6. Given a fixed ordered root basis , we define as an edge-colored graph with the following structure:
-
•
Vertex set : Each vertex represents an ordered root basis obtained from through a finite sequence of odd reflections.
-
•
Color set : The total orbdered set as Definition 3.6.
-
•
Edges: Draw an edge of color between vertices that are related by an odd reflection corresponding to the -th simple root. Additionally, assign a loop of color at a vertex if the -th simple root is non-isotropic for that vertex.
Theorem 3.8.
Under the above settings, for each , there exists a unique family of generalized Cartan matrices , such that the vertex labeling by this family of matrices makes a finite connected Cartan graph, and for each , there is an additive bijection
given by mapping .
We denote the Cartan graph constructed above by .
Corollary 3.9 ([6] Remark 2.18).
If , then . In particular, can be identified with .
Proof. This directly follows from (CG4) and Theorem 3.8.
Theorem 3.10.
is path simply connected. Furthermore, in the sense of Definition 3.1 can be identified with the root system in the sense of Definition 2.18.
As edge-colored graphs, in the sense of Definition 3.5 is isomorphic to in the sense of Definition 2.24.
In particular, is a connected rainbow boomerang graph.
Proof. This directly follows from Theorem 3.8.
Remark 3.11.
Here are a few remarks about the above facts:
-
1.
By this construction, is indeed the exchange graph of .
-
2.
The set is a subset of , and is a subset of . We strictly distinguish between these two.
-
3.
The map is a linear transformation from to , while the odd reflection is a map from to .
-
4.
The equality holds unless or .
-
5.
By the above, does not depend on the choice of and is uniquely determined by .
-
6.
For a vertex in , the automorphism group can be identified with the Weyl group ([6, Proposition 2.15]).
-
7.
As noted in [6], similar considerations make sense in the broader setting of regular symmetrizable contragredient Lie superalgebras, which are not necessarily finite-dimensional.
Remark 3.12.
While it may not be explicitly stated in the literature, it seems reasonable to expect that the classification of basic Lie superalgebras by Kac [23] could, conceptually (albeit highly nontrivially), be rederived as a consequence of Heckenberger’s results [18] (see also [34], Introduction). Indeed, as noted in ([5] Lemma5.1), when the inner product of simple roots is a rational number, one can canonically establish an isomorphism with the Cartan graph of a Nichols algebra of diagonal type with generic parameters. From the list in [1], only two exceptions exist beyond those associated with basic Lie superalgebras. This allows for a contemporary explanation of all cases except .
Example 3.13.
Let be a -graded vector space, where (the even part) is spanned by and (the odd part) is spanned by .
The space is spanned by basis elements , defined by:
The general linear Lie superalgebra is defined as the Lie superalgebra spanned by all with , under the supercommutator:
where if acts within or (even), and if it maps between and (odd).
The Cartan subalgebra is given by .
Let be associated with dual basis elements for . Then we have .
The bilinear form is computed as follows:
Define for . The sets of roots are as follows:
For the even part , we fix the standard Borel subalgebra as:
We assume that the Borel subalgebras we consider all contain .
When , we can identify with .
According to [6], fixing the total order determined by
is defined as an edge-colored graph with the following structure [6]:
-
•
Vertex set : (Young diagrams fitting in a m×n rectangle.)
-
•
Color set : ;
-
•
Edges: There is an edge of color between vertices and if and only if and are related by adding or subtracting a box at coordinates in French notation, with .
Furthermore, the graph is the labeled graph obtained by labeling each vertex of with .
Example 3.14.
In , we have the following identifications:
Example 3.15.
The edge-colored graph (excluding loops) is as follows.
.
Example 3.16.
Let . See [8] for more information on this type of Lie superalgebra.
The vector space has an orthogonal basis with respect to the inner product , where
The sets of roots are as follows:
The exchange graph is described as follows.
The Cartan graph is defined as follows.
The corresponding positive root systems for each vertex are:
For example, the following correspondences hold:
we also note that
4 Simply connected Weyl groupoids of Nichols algebras of diagonal type
We retain the setting of the previous section.
4.1 Nichols algebras of diagonal type
The braided monoidal category (resp. ) of Yetter-Drinfeld modules (resp. finite-dimensional Yetter-Drinfeld modules) over a group , as well as the Nichols algebra over them, are discussed in detail in [14, 19].
Example 4.1.
-
1.
Let be the trivial group. In this case,
as braided tensor categories, where denotes the symmetic tensor category of finite-dimensional vector spaces.
-
2.
Let be a full subcategory of consisting of -graded vector spaces such that (resp. ) is a direct sum of the trivial (resp. sign) representations of .
Then, is a symmetric tensor category with braiding given by:
where and denote the degrees (parities) of and .
Definition 4.2.
denotes the tensor category of finite-dimensional -graded vector spaces.
Consider the forgetful functor as underlying tensor categories (but not as braided tensor categories!):
Define
Let , and set . We denote as the canonical -basis of .
For a bicharacter , there exists a direct sum
of one-dimensional Yetter-Drinfeld modules such that the following holds:
We write .
This ’s Nichols algebra is denoted by . Such Nichols algebras are called of diagonal type. The algebra and coalgebra structures of are fully determined by the braiding matrix . The number is called the rank of .
inherits a natural -grading . This grading is compatible with both the algebra and coalgebra structures of , by the construction of as a Nichols algebra. By these definitions, is a bimonoid object in .
Example 4.3 (Classification of rank 1 Nichols algebras [19] Example 1.10.1).
When , a bicharacter can be identified with an element . The graded algebra is classified as follows:
Example 4.4 ([19] Theorem 16.2.5).
Let be a symmetrized generalized Cartan matrix. If and is not a root of unity, then we have .
Here, represents the positive part of the quantum group associated with Kac-Moody Lie algebra . This result was first proven by Lusztig in [28] in the case of finite type.
Using the theory of Lyndon words, a PBW-type basis for a Nichols algebra can be constructed.
Theorem 4.5 ([1] 2.6, [25]).
For a bicharacter , there exists a totally ordered set such that for each , there exists a homogeneous element satisfying:
is a basis for .
Proposition 4.6 ([2] Lemma 2.18).
If , we define . Then does not depend on the choice of the ordered set .
Corollary 4.7.
If , then there is a -graded Yetter-Drinfeld module isomorphism
Proof. This follows from Example 4.3 and Theorem 4.5.
Corollary 4.8.
if and only if and for all .
4.2 Lusztig autmorphisms of small quantum groups
In this subsection, we introduce the algebras in which we are interested in. We will follow [32].
Definition 4.9.
We denote as the Hopf algebra generated by the symbols , and , with , subject to the relations:
for all and .
The counit is defined as
Let be the algebra antiautomorphism of defined by
for all .
Let be the defining relation of the Nichols algebra of diagonal type, generated by , which is determined by the braiding matrix .
Let be the Hopf algebra obtained by quotienting by and .
We have that is a -graded Hopf algebra with
The multiplication of induces a linear isomorphism
where
are -graded subalgebras of . We remark that .
Remark 4.10.
We do not require an explicit presentation of the defining relations of or the coproduct and antipode structures. All we need is the following remarkable Lusztig automorphism, which creates distinctions from the highest weight theory of more general Hopf algebras with trianglar decomposition [31].
Theorem 4.11 ([17, 16, 5]).
Let be a bicharacter such that is finite-dimensional. Then, there exists a simply connected finite Cartan graph with a vertex set consisting of bicharacters with finite-dimensional Nichols algebras. For each vertex , there is an additive bijection between (in the sense of Proposition 4.6) and (in the sense of Definition 2.4).
Moreover, for , there exists an algebra isomorphism
satisfying
Example 4.12.
The representation theory of a small quantum group corresponding to the rank 2 Nichols algebra of type is described in detail ([3]). For this , is the Cartan graph given in Example 2.11, and it is known that such objects do not arise from (modular) contragredient Lie (super) algebras. The -degree of the PBW basis of can be easily read from the frieze pattern in Example 2.11.
Remark 4.13.
is the simply connected cover of the small Cartan graph of in the sense of [19]. For the Nichols algebra of super type with the same Weyl groupoid as the basic Lie superalgebra , we have .
Definition 4.14.
For a bicharacter with finite-dimensional Nichols algebra, we define the rainbow boomerang graph (Definition 2.24). Note that is simply connected, so it is trivially path simply connected.
4.3 Homomorphisms between Verma modules
For , we set
In particular, for .
Definition 4.15.
Fix a bicharacter If , then the triangular decomposition of induces a new triangular decomposition on . Explicitly,
since .
Given , we consider as a -graded -module concentrated in degree with the action
Osing this, we introduce the -graded -module
We also define an analog of the Weyl vector. (It differs from the one for [32] by a factor of .) Specifically, we define:
Remark 4.16.
Instead of our special , we could consider a more general situation. However, by [32, Proposition 5.5], all blocks are equivalent to the block containing our Verma module (the principal block). Thus, for simplicity, we restrict our discussion to this case.
Our Verma module corresponds to so called a type I representation when is of the classical Drinfeld-Jimbo type.
We consider the category , where morphisms respects this -grading. (This is the module category of a monoid object in the category of in the sense of [14].)
Let be a -graded vector space. The formal character of is defined as:
The following can be shown in the same way as in [21]. Note that
Proposition 4.17.
[32, Lemma 6.1] Let and . For a pair of vertices in and , the following statements hold:
-
1.
.
-
2.
.
-
3.
.
Definition 4.18.
For , we denote a nonzero homomorphism from to by . Let the highest weight vector of be .
Definition 4.19.
For and , we recall the quantum numbers
.
Proposition 4.20.
[32, Section 7.1] For , exactly one of the following holds:
-
1.
and are isomorphisms.
-
2.
Proof. By the Lusztig automorphism, the case of positive roots can be reduced to that of simple roots, so we may assume . (This is formalized in [32, Section 7.3][Section 7.3] by constructing a suitable category equivalence.)
From the defining relations, we can compute:
(1) |
, we calculate as follows:
Similarly, we have
Finally, we observe:
by the identity .
Remark 4.21.
The ability to provide a more detailed description of the Verma module associated with the bicharacter corresponding to the longest element is a phenomenon unique to the finite-dimensional case, which led to stronger results ([32, Lemma 6.4])
Here, following [21], we define the quotient of the rainbow boomerang graph.
Definition 4.22.
[21, Definition 2.14] Let be an edge-colored graph with color set . Let . We define an equivalence relation on as follows: For , we say if there exists a walk from to consisting only of edges with colors in . We denote the equivalence class of by .
We define the edge-colored graph as follows:
-
•
The vertex set is , the set of equivalence classes under .
-
•
The color set is .
-
•
There is an edge of color between and in if and only if there exist and such that there is an edge of color between and in .
Given a walk in :
we define the induced walk in as:
where if , and represents an empty walk if .
Proposition 4.23.
[21, Propositlon 2.15] The graph is a rainbow boomerang graph.
Definition 4.24.
We identify the color set of with .
For , let denote the collection of roots in such that
We set .
The following is exactly the same as in [21, Corollary 3.27].
Proposition 4.25.
The vertex set of can be identified with the isomorphism classes of .
Definition 4.26.
Let be a walk in . Take for .
The corresponding composition of nonzero homomorphisms
is denoted by .
The following theorem is an analogue of [21, Theorem 4.9], which we have been aiming for.
Theorem 4.27.
Let . For a walk in , the following are equivalent:
-
1.
.
-
2.
is rainbow.
-
3.
is shortest.
Proof. Using the discussion in this subsection, the argument proceeds exactly as in Section 4 in [21].
References
- Andruskiewitsch and Angiono [2017] Nicolás Andruskiewitsch and Iván Angiono. On finite dimensional nichols algebras of diagonal type. Bulletin of Mathematical Sciences, 7:353–573, 2017.
- Andruskiewitsch and Angiono [2008] Nicolás Andruskiewitsch and Iván Ezequiel Angiono. On nichols algebras with generic braiding. In Modules and comodules, pages 47–64. Springer, 2008.
- Andruskiewitsch et al. [2018] Nicolás Andruskiewitsch, Iván Angiono, Adriana Mejía, and Carolina Renz. Simple modules of the quantum double of the nichols algebra of unidentified diagonal type ufo(7). Communications in Algebra, 46(4):1770–1798, 2018.
- Angiono [2024] Iván Angiono. Root systems in lie theory: From the classic definition to nowadays. Notices of the American Mathematical Society, May 2024. doi: 10.1090/noti2906. Communicated by Han-Bom Moon.
- Azam et al. [2015] Saeid Azam, Hiroyuki Yamane, and Malihe Yousofzadeh. Classification of finite-dimensional irreducible representations of generalized quantum groups via weyl groupoids. Publications of the Research Institute for Mathematical Sciences, 51(1):59–130, 2015.
- Bonfert and Nehme [2024] Lukas Bonfert and Jonas Nehme. The weyl groupoids of and . Journal of Algebra, 641:795–822, 2024.
- Cheng and Wang [2012] Shun-Jen Cheng and Weiqiang Wang. Dualities and representations of Lie superalgebras. American Mathematical Soc., 2012.
- Cheng and Wang [2019] Shun-Jen Cheng and Weiqiang Wang. Character formulae in category for exceptional lie superalgebras . Transformation Groups, 24(3):781–821, 2019.
- Conway and Coxeter [1973] John H Conway and Harold SM Coxeter. Triangulated polygons and frieze patterns. The Mathematical Gazette, 57(400):87–94, 1973.
- Cuntz [2014] Michael Cuntz. Frieze patterns as root posets and affine triangulations. European Journal of Combinatorics, 42:167–178, 2014.
- Cuntz and Heckenberger [2009a] Michael Cuntz and István Heckenberger. Weyl groupoids with at most three objects. Journal of pure and applied algebra, 213(6):1112–1128, 2009a.
- Cuntz and Heckenberger [2009b] Michael Cuntz and István Heckenberger. Weyl groupoids of rank two and continued fractions. Algebra & Number Theory, 3(3):317–340, 2009b.
- Cuntz and Heckenberger [2015] Michael Cuntz and István Heckenberger. Finite weyl groupoids. Journal für die reine und angewandte Mathematik (Crelles Journal), 2015(702):77–108, 2015.
- Etingof et al. [2015] Pavel Etingof, Shlomo Gelaki, Dmitri Nikshych, and Victor Ostrik. Tensor categories, volume 205. American Mathematical Soc., 2015.
- Gorelik et al. [2022] Maria Gorelik, Vladimir Hinich, and Vera Serganova. Root groupoid and related lie superalgebras. arXiv preprint arXiv:2209.06253, 2022.
- Heckenberger [2010] I Heckenberger. Lusztig isomorphisms for drinfel’d doubles of bosonizations of nichols algebras of diagonal type. Journal of algebra, 323(8):2130–2182, 2010.
- Heckenberger [2006] István Heckenberger. The weyl groupoid of a nichols algebra of diagonal type. Inventiones mathematicae, 164(1):175–188, 2006.
- Heckenberger [2009] István Heckenberger. Classification of arithmetic root systems. Advances in Mathematics, 220(1):59–124, 2009.
- Heckenberger and Schneider [2020] István Heckenberger and Hans-Jürgen Schneider. Hopf algebras and root systems, volume 247. American Mathematical Soc., 2020.
- Heckenberger and Yamane [2008] István Heckenberger and Hiroyuki Yamane. A generalization of coxeter groups, root systems, and matsumoto’s theorem. Mathematische Zeitschrift, 259:255–276, 2008.
- Hirota [2025] Shunsuke Hirota. Categorification of rainbow paths on odd reflection graphs through homomorphisms between verma supermodules. arXiv preprint arXiv:2502.14274, 2025.
- Inoue and Yamane [2023] Takato Inoue and Hiroyuki Yamane. Hamiltonian cycles for finite weyl groupoids. arXiv preprint arXiv:2310.12543, 2023.
- Kac [1977] Victor G Kac. Lie superalgebras. Advances in mathematics, 26(1):8–96, 1977.
- Kac [1990] Victor G Kac. Infinite-dimensional Lie algebras. Cambridge university press, 1990.
- Kharchenko [2015] Vladislav Kharchenko. Quantum lie theory. Lecture Notes in Mathematics, 2150, 2015.
- Laugwitz and Sanmarco [2023] Robert Laugwitz and Guillermo Sanmarco. Finite-dimensional quantum groups of type super a and non-semisimple modular categories. arXiv preprint arXiv:2301.10685, 2023.
- Lusztig [1990] George Lusztig. Quantum groups at roots of 1. Geometriae Dedicata, 35(1):89–113, 1990.
- Lusztig [2010] George Lusztig. Introduction to quantum groups. Springer Science & Business Media, 2010.
- Musson [2012] Ian Malcolm Musson. Lie superalgebras and enveloping algebras, volume 131. American Mathematical Soc., 2012.
- Serganova [2011] Vera Serganova. Kac–moody superalgebras and integrability. Developments and trends in infinite-dimensional Lie theory, pages 169–218, 2011.
- Vay [2018] Cristian Vay. On hopf algebras with triangular decomposition. arXiv preprint arXiv:1808.03799, 2018.
- Vay [2023] Cristian Vay. Linkage principle for small quantum groups. arXiv preprint, 2023. arXiv:2310.00103.
- Yamane [2021a] Hiroyuki Yamane. Hamilton circuits of cayley graphs of weyl groupoids of generalized quantum groups. arXiv preprint arXiv:2103.16126, 2021a.
- Yamane [2021b] Hiroyuki Yamane. Typical irreducible characters of generalized quantum groups. Journal of Algebra and Its Applications, 20(01):2140014, 2021b.
Shunsuke Hirota
Department of Mathematics, Kyoto University
Kitashirakawa Oiwake-cho, Sakyo-ku, 606-8502, Kyoto
E-mail address: [email protected]