Linearity of Generalized Cactus Groups
Abstract.
Cactus groups are traditionally defined based on symmetric groups, and pure cactus groups are particular subgroups of cactus groups. Mostovoy [Mos19] showed that pure cactus groups embed into right-angled Coxeter groups. We generalize this result to cactus groups associated with arbitrary finite Coxeter groups and we investigate some representations of generalized cactus groups and deduce the linearity of generalized cactus groups.
1. Introduction
For an integer the cactus group is the group generated by for with relations
There is a homomorphism given by where reverses the order of elements and leaves the rest unchanged. The kernel of is the pure cactus group
The subject of cactus groups has generated much interest. Mostovoy showed that the pure cactus group embeds into the diagram group a right-angled Coxeter group, and is residually nilpotent, see [Mos19]. Davis, Januszkiewicz, and Scott studied the connection between cactus groups and the fundamental groups of blow-ups in [DJS03]. Henriques and Kamnitzer introduced actions of cactus groups on tensor products of crystals and coboundary categories similar to the action of braid groups on braided categories, see [HK06]. Losev studied the case of cactus group defined from the Weyl group of a Lie algebra and the action of the cactus group on the Weyl group, see [Los19], and Bonnafé extended Losev’s construction to any Coxeter group instead of a Weyl group, see [Bon15].
In a Coxeter system a nonempty subset is connected if the subgroup of generated by is finite, and there is no way to write where and are disjoint nonempty sets and Set to be the family of all connected subsets of
Definition 1.1.
The generalized cactus group is generated by subject to relations:
Here is the longest element in There is a surjective homomorphism given by The kernel of is the generalized pure cactus group. Our main result is that the generalized pure cactus group can be embedded into a right-angled Coxeter group. Given a Coxeter group and the family of connected subsets of we introduce the right-angled Coxeter group generated by associated with a Coxeter matrix
In this setting, the group acts on by where We prove the generalized cactus group defined on embeds into and thereby show that
Theorem 1.2.
The generalized pure cactus group defined by the Coxeter system embeds into the right-angled Coxeter group
Finally, we construct two representations of the generalized cactus group. The generalized cactus group is a special case of the group of all lifts of the -action on the blow-up of a reflection tiling to its universal cover [DJS03]. We adapt the representation of in [DJS03] to construct a representation of generalized cactus groups.
We construct another representation of generalized cactus groups from the geometrical representation of Coxeter groups in light of Theorem 1.2. Furthermore, this representation restricts to a faithful representation on the generalized cactus group. This shows
Theorem 1.3.
Generalized cactus groups are linear groups.
2. Generalized Cactus Groups
2.1. Definition
The notion of cactus group can be generalized by replacing symmetric groups with general Coxeter groups. Geometrically, it is a special case of the group introduced by David, Januszkiewicz and Scott as the group of all lifts of the -action on the blow-up of a reflection tiling to its universal cover in [DJS03].
Let be a finitely generated Coxeter group and be its associated Coxeter matrix. A spherical subgroup of is a finite subgroup generated by some We denote its longest element by following [Hum90]. A nonempty subset is connected if is finite and there is no way to write such that and are nonempty and Let denote the family of all connected subsets of
Definition 2.1.
The generalized cactus group is generated by subject to relations:
Since is the longest element of , it follows that is still a subset of for In particular if then and commutes with
Similar to the case of cactus group, there is a homomorphism given by Indeed, since it is the longest element in . If then commutes with . When there is and the longest element in is Call the kernel of the generalized pure cactus group
Proposition 2.2.
When has type there is an isomorphism
Proof.
When has type it is isomorphic to the Coxeter system where associated by an Coxeter matrix given by
Identify subsets of with subsets of via and let be the generalized cactus group on If and are subsets of where for all and then and every generator of commutes with every generator in Hence and it follows that consists of connected intervals where
Let be the cactus group generated by for We claim that the map given by is a group isomorphism.
We show first that is a homomorphism. Firstly there is If then by the above discussion,
If then the longest element generated by is Then
Conjugating by gives the corresponding relations in and therefore is indeed a group homomorphism.
Define by We have If then every element in commutes with every element in Since they are connected intervals, this implies and then If , then the relation in corresponds to the relation in which is valid. It follows that is also a group homomorphism. Hence is isomorphic to because and ∎
2.2. Embedment of the Generalized Pure Cactus Group
Our main theorem in this section is that the generalized pure cactus group can be embedded into a right-angled Coxeter group, generalizing the approach taken by Mostovoy in [[]Proposition 2]Mos:
Theorem 2.3.
Suppose is the generalized cactus group defined on the Coxeter system Then the generalized pure cactus group embeds into a right-angled Coxeter group.
We set up a technical lemma before giving the proof. Let be a right-angled Coxeter group and a subgroup of Let be a subset of and a family of involutions in satisfying
-
(1)
for all and
-
(2)
Given with either
or
-
(3)
for all
Let be the subgroup of generated by Let be the group generated by for all subject to relations
-
(1)
when and
-
(2)
for all
Lemma 2.4.
The map defined by is a group isomorphism.
Proof.
We show first is a group homomorphism. Because are involutions, there is Now suppose and Then
Hence is indeed a group homomorphism. It is also surjective as generates To show injectivity, let and let Note that only depends on for We shall give a lemma first:
Lemma 2.5.
Let be a word in
-
(1)
If there is an such that then there is another word such that for and for
-
(2)
If commutes with then there is another word such that for and
Proof.
Assume Then and then since the ’s are bijective involutions and is fixed by Then take for and for Then
Moreover, for and since and they are involutions.
Now assume and commute and then Hence commutes with after applying Then either or If the former is true, then and take
Then there are for and for since Finally, there is and since and is fixed under Similarly, if the latter is true, take
This proves Lemma 2.5. ∎
Now suppose Then Since is a word in the right-angled Coxeter system there is a sequence of tuples of elements of
such that
and is the empty tuple representing such that for each either there exists an such that and
(1) |
or there exists a such that and commute and
(2) |
Analyze as an example. If (1) holds for then for some and by part 1 of Lemma 2.5, corresponds to some If (2) holds for then and commute for some and corresponds to some by part 2 of Lemma 2.5. By using the same argument inductively, we can conclude that Hence is an isomorphism. This proves Lemma 2.4. ∎
Now we give the proof of Theorem 2.3:
Proof.
Define Let be the Coxeter matrix whose entries are given by for each pair where
Let be the right-angled Coxeter group on generators associated to the Coxeter matrix For each there is a group automorphism generated by since conjugation does not affect inclusion relations between subsets of and commutativity relations between elements of Given put Note that is an involution as is.
Lemma 2.6.
Let We have
-
(1)
-
(2)
If then and
-
(3)
If then and
-
(4)
and if and only if or or with
Proof.
(1) is clear. For (2), assume Then and then since conjugation is bijective. Hence Furthermore, because is generated by a generating set of is since is the longest element. Then Finally, is conjugation by the longest element in which is It follows immediately that
(3) can be shown by two similar arguments in which and respectively.
Sufficiency in (4) follows from (2) and (3). Now assume and The only nontrivial case is by definition of the Coxeter matrix In this case, (2) implies In particular, This completes the proof. ∎
We conclude the proof of theorem 2.3 by showing the following lemma:
Lemma 2.7.
There is a monomorphism defined by It restricts to a monomorphism
Proof.
There is a monomorphism where is the group generated by as in Lemma 2.4. This proves the first part.
To show the second part, observe that the following diagram commutes:
in which
Because is injective, the kernel of lies inside the kernel of the projection, which is isomorphic to This completes the proof. ∎
As an example, the usual cactus group defined on the Coxeter group coincides with the corresponding generalized cactus group It follows from Theorem 2.3 that embeds into where is the diagram group and embeds into for an appropriate Coxeter system see [Mos19]. Furthermore, there is a bijection from to the set of subsets with given by
and
It follows that there is a group isomorphism and a commutative diagram
3. Representations of Generalized Cactus Groups
3.1. Geometrical Representation of Coxeter Groups
Let be a Coxeter system and its associated Coxeter matrix. A representation of can be constructed as follows. Let with standard basis Define a bilinear form on by
For any there is a representation of (in particular the Tits representation when ) generated by where
To show is a representation, it suffices to show has order for Clearly preserves the bilinear form Let Then
and If then For all the equation has a positive real root Set and assume (this is true for all but finitely many ). Then
Hence using the second equation which can be rewritten into we can obtain
where and If then and can never be the identity. If then and cannot be the identity, either. Thus has order
When we use the identification by identifying to 1 and to where Then acts by a rotation of and thus has order Hence is a representation.
Moreover, a faithful representation of on is given by for all basis vectors It is possible to construct a representation of from and
Proposition 3.1.
Let be given by Then is a representation of
Proof.
Since is an automorphism and preserves the Coxeter matrix, preserves the bilinear form As and are representations of and respectively, we need to check respects the product structure induced by the semi-direct product. It suffices to check that for any and
In fact, for any basis vector there is
Hence is a representation. ∎
When the bilinear form is the canonical bilinear form induced by the Coxeter matrix The following result is classical but we could not find a reference. The injectivity of is for example in [[]Corollary 5.4]Hum.
Lemma 3.2.
When the representation is faithful.
Proof.
Suppose If then there exists such that Let Then [[]Theorem 5.4]Hum shows that for all Then But a contradiction. Hence and then since is faithful. This shows faithfulness of ∎
Now pick a so that is nondegenerate. Theorem 1 shows that can be embedded into the semi-direct product Define to be the vector space on basis over The space embeds into through the map Through this map, the bilinear form on agrees with the bilinear form on generated by
Let be the representation of on constructed previously. By restricting to and its isomorphic image in becomes a representation of
Corollary 3.3.
The representation of on is faithful. Therefore, generalized cactus groups are linear groups.
3.2. Another Linear Representation
This section is motivated by sections 5.10, 6.1, and 6.2 in [DJS03]. The generalized cactus group and certain representations can be constructed from a geometrical viewpoint as in [DJS03]. Here we give a direct algebraic construction. Let be a Coxeter system and let be the generalized cactus group on For set
Let be the Coxeter matrix indexed by with entries given by A representation of can be constructed as in [DJS03] . Let be the real vector space spanned by a basis Define
Note that Let denote the subspace spanned by the set
For each define a symmetric bilinear form on by
is the standard inner product on and is the canonical inner product associated to the Coxeter matrix It follows that and is a nonzero polynomial in Hence is nondegenerate on for sufficiently large Let be the orthogonal complement of Then we have an orthogonal decomposition
Now define by
Proposition 3.4.
The map extends to a representation of
Proof.
It suffices to show the relations in still hold with replaced by
-
(a)
-
(b)
if and
-
(c)
if
since is an involution. To show (b) and (c), we give the following lemma:
Lemma 3.5.
-
(1)
If then and
-
(2)
If then and where
Proof.
For (1), note first that is orthogonal to Moreover, for any we have and the same is true with replaced by Hence is orthogonal to Then and is fixed by
Furthermore, suppose Then and by the previous argument. Moreover, is also a subset of and then by the same argument with replaced by This implies both and are fixed by and then is identity on
For (2), if then and the vector is orthogonal to Let and We have and It follows that
Hence is orthogonal to Then and
For the second part, suppose Then and
Note that Then
since Hence A similar argument shows that and then as is an involution. ∎
Case (b) now follows from the commutative diagram implied by part (1) of the lemma:
Part (2) of the lemma gives a similar commutative diagram for case (c):
This completes the proof. ∎
When is orthogonal to and and Lemma 5 implies the images of the standard basis under any for lie in the set when Hence the representation cannot be faithful when is infinite, nor will be faithful when restricted to an infinite subgroup of (for example the generalized pure cactus group ).
3.3. Examples of Generalized Cactus Groups
In this section, we analyze a few examples of generalized cactus groups and their representations.
3.3.1. Type
The cactus group is defined on the Coxeter group and is generated by and with
Then can be generated by and and the representation is given by involutions
and then is irreducible where
Furthermore, the group embeds into by Theorem 2.3. Then the representation is given by
The subspace is invariant under and a stable vector of is Hence there is a quotient representation of on the quotient space with basis and Under this basis, the quotient representation is given by
The quotient representation is isomorphic to the representation with a change in parameter to
3.3.2. Type
The dihedral group of order is generated by with an associated Coxeter matrix
and The longest element in is if is even and if is odd.
Let be the generalized cactus group on generated by and Then is isomorphic to when to when and is even, and to (hence to ) when is odd.
Let be an odd integer, and then admits the same representation on as does. However, the basis of the vector space consists of the vectors for indexed by the subgroups for (as is a conjugation of ) and for . Using the notation in the previous section where and we have
and
There are two subrepresentations of spanned by for and respectively. A stable subspace of is spanned by for and a stable vector of is
Acknowledgements
The author would like to warmly thank Professor Raphaël Rouquier for supporting this work. This project was partly funded by NSF Grant DMS-1702305 as part of the 2021 Summer REU Program at UCLA.
References
- [BB05] Anders Bjorner and Francesco Brenti “Combinatorics of Coxeter Groups” Springer, Berlin, Heidelberg, 2005
- [BCP97] Wieb Bosma, John Cannon and Catherine Playoust “The Magma algebra system. I. The user language” Computational algebra and number theory (London, 1993) In J. Symbolic Comput. 24.3-4, 1997, pp. 235–265 DOI: 10.1006/jsco.1996.0125
- [Bon15] Cédric Bonnafé “Cells and Cacti” In International Mathematics Research Notices 2016.19, 2015, pp. 5775–5800 DOI: 10.1093/imrn/rnv324
- [Dav12] Michael Davis “The Geometry and Topology of Coxeter Groups. (LMS-32):” Princeton University Press, 2012
- [DJS03] M Davis, T Januszkiewicz and R Scott “Fundamental groups of blow-ups” In Advances in Mathematics 177.1, 2003, pp. 115–179
- [HK06] André Henriques and Joel Kamnitzer “Crystals and coboundary categories” In Duke Mathematical Journal 132.2 Duke University Press, 2006, pp. 191–216 DOI: 10.1215/S0012-7094-06-13221-0
- [Hum90] James E. Humphreys “Reflection Groups and Coxeter Groups”, Cambridge Studies in Advanced Mathematics Cambridge University Press, 1990
- [Los19] Ivan Losev “Cacti and cells” In J. Eur. Math. Soc. 21.6, 2019, pp. 1729–1750
- [Mos19] Jacob Mostovoy “The pure cactus group is residually nilpotent” In Archiv der Mathematik 113, 2019, pp. 229–235
- [Tit69] Jacques Tits “Le problème des mots dans les groupes de Coxeter” In Symposia Mathematica Academic Press, 1969, pp. 175–185