A geometric realization of the $m$-cluster categories of type $\tilde{D_n}$
Lucie Jacquet-Malo

TL;DR
This paper provides a geometric model for the $m$-cluster categories of type $ ilde{D_n}$ using polygons with inner polygons, linking algebraic mutations to geometric flips.
Contribution
It introduces a geometric realization of $m$-cluster categories of type $ ilde{D_n}$ via polygonal arcs and demonstrates the compatibility of mutations with geometric flips.
Findings
Geometric realization of $m$-cluster categories using polygons with inner polygons.
Mutation of quivers corresponds to flips in the polygonal model.
Explicit example for type $ ilde{D_7}$ illustrates the theory.
Abstract
We show that a subcategory of the -cluster category of type is isomorphic to a category consisting of arcs in an -gon with two central -gons inside of it. We show that the mutation of colored quivers and -cluster-tilting objects is compatible with the flip of an -angulation. In the final part of this paper, we detail an example of a quiver of type .
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 · Homotopy and Cohomology in Algebraic Topology · Advanced Topics in Algebra
A geometric realization of the -cluster categories of type
Lucie JACQUET-MALO
Abstract.
We show that a (non-full) subcategory of the -cluster category of type is isomorphic to a category consisting of arcs in an -gon with two central -gons inside of it. We show that the mutation of colored quivers and -cluster-tilting objects is compatible with the flip of an -angulation. In the final part of this paper, we detail an example of a quiver of type .
Lucie Jacquet-Malo
Keywords: Cluster algebras, -cluster categories, tame quivers, .
**MSC classification: Primary: 18E30 ; Secondary: 13F60, 05C62 **
Contents
- 1 Preliminaries
- 2 Geometric realization and flips
- 3 Construction of the category of -diagonals
- 4 Colored quivers and -angulations
- 5 Equivalence of categories
- 6 About non-self-crossing arcs and -rigid objects
- 7 An example
Introduction
Cluster algebras, defined by Fomin and Zelevinsky in [FZ02], are commutative rings which have many connections with various fields of mathematics, such as Calabi-Yau algebras, integrable systems, Poisson geometry and quiver representations. Cluster categories were invented in order to get a better understanding of the link between quiver representations and cluster algebras. For a gentle introduction to cluster algebras, see [Fom10] and [FZ03].
Let be an acyclic quiver and let be an integer. The cluster category associated with was introduced by Buan, Marsh, Reineke, Reiten and Todorov in [BMR*+*06] in order to categorify cluster algebras. The higher cluster category of defined by Keller in [Kel05] and Thomas in [Tho07] plays a role similar to that of cluster categories but with respect to the combinatorics of -clusters, defined by Fomin and Reading in [FR05]. More precisely, there is a bijection between the -clusters of a root system and the -cluster-tilting objects of the -cluster category. Wraalsen, and Zhou, Zhu in their respective papers [Wra09] and [ZZ09] also generalized many of the properties of cluster-tilting objects in cluster categories to the case of -cluster-tilting objects in higher cluster categories. In particular, any -rigid object having nonisomorphic indecomposable summands has exactly complements (i.e. nonisomorphic indecomposable objects such that is an -cluster-tilting object).
Acyclic cluster categories, as defined in [BMR*+*06] are orbit categories of bounded derived categories of representations of hereditary algebras. It is thus remarkable that some of those categories can be described combinatorially. This fact is largely due the theory of Auslander and Reiten. Such a geometric description first appeared in the paper [CCS06] by Caldero, Chapoton and Schiffler, for a quiver of type , and for . It was later generalized to all Dynkin types: in the article of Schiffler [Sch08] for type and in the article of Lamberti [Lam15], in type . Then Baur and Marsh generalized this method to higher cluster categories of type (in [BM08]), and of type (in [BM07]). They proved that the Auslander-Reiten quiver of the higher cluster category could be realized considering elementary moves of so-called -arcs in a polygon for type , and a punctured polygon for type .
Similar geometric descriptions for Euclidean quivers are not so well-behaved. Indeed, the components of the Auslander-Reiten quiver are infinite so that the infinite radical of the -cluster category does not vanish.
Unfortunately, drawing a quiver from an -angulation did not give coherent results in terms of compatibility. To be precise, if , then the Gabriel quiver of the -angulation cannot determine the quiver of the flip of this -angulation. Thus, in order to find back the new quiver corresponding to the flip, Buan and Thomas (cf [BT09]) introduced additionnal arrows, and built colored quivers, which means quivers where is associated a number with each arrow. This, with the new mutation of colored quivers, can be explicitly described from the mutation of -cluster-tilting objects.
The case of -cluster categories of type has been treated by Torkildsen in [Tor12]. Recently, Baur and Torkildsen in [BT15] have given a complete geometric realization of the cluster category of type including the geometric description of the infinite radical.
Our aim in this paper is to give a geometric description in type . Let be an -gon with two -gons inside of it. We define -admissible arcs, -angulations and their flip. We associate, in the spirit of Buan and Thomas in [BT09], a colored quiver with an -angulation of . We prove in Theorem 4.10 that the flip of an -angulation induces Buan-Thomas mutation of the associated colored quiver (see [BT09]). Moreover, we build a geometric category (consisting of arcs in ), which is equivalent to a (non-full) subcategory of the -cluster category of type (see Theorem 5.3) consisting of transjective and regular non homogeneous objects. The morphisms belonging to the infinite radical do not appear in the category. Each -rigid indecomposable object of corresponds to some arc with no self-crossing in our geometric description.
In the companion paper [JM], we build a bijection between -angulations and -cluster-tilting objects of the -cluster category of type . We prove that, under this bijection, flips of -angulations correspond to mutations of -cluster-tilting objects. Our proofs apply to types , , as well.
The paper is organized as follows.
In section we recall some important notions on -cluster categories, rigid objects and colored quivers.
Let be an -gon with two -gons inside of it. In section , we define the notion of -diagonals in .
The definitions given in section lead us to build a new category of -diagonals in section .
In section , we associate a colored quiver with an -angulation of . In Theorem 4.10, we show the compatibility between flips of -angulations and mutations of colored quivers.
Section is devoted to the study of the category of -diagonals. We construct a bijection between arcs in and -rigid indecomposable objects in the -cluster category.
In section we focus on the indecomposable -rigid objects in the -cluster category . We show that the bijection above induces a bijection between -rigid objects and arcs which do not cross themselves. We give a bijection between -cluster-tilting objects and -angulations in [JM].
Finally, we give a detailed example illustrating some of our results, where is a quiver of type , and . This corresponds to the case of a decagon with two inner boundary components inside of it.
Acknowledgements
This article is part of my PhD thesis under the supervision of Yann Palu and Alexander Zimmermann. I would like to thank Yann Palu warmly for introducing me to the subject of cluster categories, and for his patience and kindness. Finally, I would like to thank the anonymous reviewer for his kind report and for his many advises that help improving the first version of this article.
1. Preliminaries
Notations:
Throughout this paper, the letter denotes a field. We fix a positive integer .
We denote by the category of finitely generated right modules over the path algebra of a finite acyclic quiver . For an object , we denote by the additive category spanned by . For any further information about representation theory of associative algebras, see [ASS06].
1.1. Higher cluster categories
In 2006, in order to categorify the notion of cluster algebras, Buan, Marsh, Reineke, Reiten and Todorov in [BMR*+*06] defined the cluster category of an acyclic quiver in the following way:
If is an acyclic quiver, let be the bounded derived category of the category of . The category is the orbit category of the derived category under the functor , where the letter stands for the Auslander-Reiten translation and the functor is the shift functor.
Cluster categories give a categorification of clusters in a cluster algebra in terms of tilting objects. To be precise, the cluster variables of the algebra are in correspondence with the indecomposable rigid objects in , and the clusters are in correspondence with the basic cluster-tilting objects in .
It is known from [BMR*+*06] that is Krull-Schmidt. Keller in [Kel05] has shown that it is a triangulated category. Since and become isomorphic in , we have that is -Calabi-Yau.
We can also define the higher cluster category
[TABLE]
Again, the higher cluster category is Krull-Schmidt, -Calabi-Yau, and triangulated.
Definition 1.1**.**
Let be an object in the category . Then is -rigid if
[TABLE]
Definition 1.2**.**
[KR08]** Let be an object in the category . Then is -cluster-tilting when we have the following equivalence:
[TABLE]
Definition 1.3**.**
[ZZ09]** Let be an object in the category . Then is almost complete -cluster-tilting if there exists an indecomposable object which do not belong to such that is an -cluster-tilting object. The object is called a complement for .
Theorem 1.4**.**
[ZZ09]**[Wra09]** Let be an object in the category . If is an almost complete -cluster-tilting object, then there exist exactly non isomorphic complements for .
If corresponds to the number of vertices of , it is known from [Zhu08], that is an -cluster-tilting object if and only if has indecomposable direct summands (up to isomorphism) and is -rigid. So, for a basic -cluster-tilting object, where each is indecomposable, let us define the almost complete -rigid object (where is an indecomposable summand of ). There are, up to isomorphism, complements of the almost complete -cluster-tilting object , denoted by , for . Iyama and Yoshino in [IY08] showed the following Theorem:
Theorem 1.5**.**
[IY08, Lemma 5.7]** There are exchange triangles:
[TABLE]
where . Here, the are in , the maps (respectively ) are minimal left (respectively right) -approximations, hence, not split monomorphism or split epimorphism.
For a definition of left and right approximation, see [AS81].
Definition 1.6**.**
The left-mutation of at , for , is the -cluster-tilting object
[TABLE]
We will often write instead of , whenever there is no possible confusion with .
1.2. Mutation of colored quivers
In this section, we let be an -cluster-tilting object, and be some -cluster-tilting object which is obtained by mutation of . Unfortunately, if is the Gabriel quiver associated with , there does not exist any quiver mutation such that . Then, in order to overcome this problem, Buan and Thomas in [BT09] defined a graded version of , called the colored quiver associated with . For a precise example of the lack of information given by the Gabriel quiver, see [Bua11].
Definition 1.7**.**
[BT09]** Given a positive integer , a colored quiver consists of the data of a quiver and of an application which associates with an arrow its color. Let be the number of arrows from to of color . If there is an arrow from to of color , then we write .
We require our colored quivers to satisfy the following conditions:
- (1)
for all . 2. (2)
monochromaticity: if then for all . 3. (3)
symmetry: .
The operation we are about to define is an involution called the mutation of a colored quiver at a vertex.
Definition 1.8**.**
[BT09]** Let be a colored quiver, and let be a vertex of . We define the new quiver with the same vertices, and the new number of arrows given by:
[TABLE]
They also showed in [BT09] that mutating a colored quiver in this way is equivalent to the following procedure:
- (1)
For any \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{k\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} , and any integer in , draw an arrow \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{j} and an arrow \textstyle{j\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(m-c)}$$\textstyle{i} . 2. (2)
If the condition of monochromaticity is not satisfied anymore from one vertex to one vertex , then remove the same number of arrows of each color, in order to restore the condition. 3. (3)
For any arrow \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{k} , add to the color , and for any arrow \textstyle{k\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{j} , subtract to the color .
With each -cluster-tilting object in the -cluster category, we associate a corresponding colored quiver such that:
- (1)
The vertices of are the integers from to where is the number of indecomposable summands of . 2. (2)
The number is the multiplicity of in in the exchange triangle (1).
We note that the subquiver of with same vertices but only [math]-colored arrows is the Gabriel quiver of the endomorphism algebra of .
We now state the main Theorem about colored quivers and -cluster-tilting objects, a proof of which can be found in [BT09]:
Theorem 1.9**.**
[BT09, Theorem 2.1]** Let and be -cluster-tilting objects, where there is an exchange triangle . Then
[TABLE]
In particular, the colored quiver only depends on the colored quiver .
2. Geometric realization and flips
In this section we introduce the geometric realization inspired from [CP15a] and [CP15b]. We define the flip of an -angulation, and build a colored quiver from an -angulation. The main Theorem of the section, namely Theorem 4.10, states the compatibility between the flip of an -angulation and the mutation of the associated colored quiver.
Let and be integers. Let be an -gon with two central -gons and inside of it (cf figure 1). We set that (respectively ) is the leftmost (respectively the rightmost) -gon in the interior of . We replace each vertex of and by a disk, which we henceforth call a thick vertex. If , then the surface considered is a disk with marked points on its border, with two thick vertices in its interior.
Considering that there is a realization of Dynkin type using tagged arcs, we could have used such arcs, with two punctures inside of the polygon in order to build a geometric realization of type . However, this sort of realization is not compatible with the mutation of colored quivers associated with the -angulations.
Definition 2.1**.**
Let us number the vertices of the polygon from to clockwise. Then, an admissible arc between and is defined in the following way:
- (1)
If , then an admissible arc is an oriented path from to , lying inside of , which does not cross any of the two inner polygons, satisfying one of the following conditions:
- •
Either the arc crosses the space between both central polygons and cuts the figure into a -gon and a -gon, for some (* is entirely determined by ). This arc is of type .*
- •
Either, the arc is homotopic to a boundary path, and cuts the figure into a -gon with both central polygons inside of it and a -gon (where is still entirely determined by ). This arc is of type . 2. (2)
If , there are four types of admissible arcs :
- •
A path ending in , and the other end of the path tangent to one of the thick vertices placed around .
- •
A path ending in , and the other end of the path tangent to one of the thick vertices placed around .
- •
A path starting and ending at , going around or , called a loop.
- •
A path starting and ending at , going around or , called a tagged loop.
All these arcs are of type 3.** 3. (3)
Any arc being tangent to two disks, one arising from , and one from is admissible. This arc is of type 4.
Note that any admissible arc can have some self-crossings. We will see at the end of the paper in Lemma 6.1 that the admissible arcs without any self-crossing are in bijection with the rigid objects.
Definition 2.2**.**
Consider one moment an arc starting at an arbitrary vertex of , and ending at a thick vertex or . This arc is called to be left tangent at if it is , tangent to a thick vertex, and if there exists a neighborhood of this thick vertex such that this one is situated at the right of the vertex. We similarly define right tangency.
Note that we only consider unoriented arcs, the order of and is not important. For convenience, we will nevertheless use the terminology "from to ".
Definition 2.3**.**
We call a Dehn twist an application which, with an arc, associates another arc, obtained by the action of rotating (respectively ). It means that if we consider an arc hung to (respectively ), applying a Dehn twist of (respectively ) makes roll around (respectively ) only (see figure 5). We can define Dehn twist in both clockwise and counterclockwise directions.
We now define -diagonals.
Definition 2.4**.**
Let and be two admissible arcs of the same type. We say that these arcs are equivalent when:
- •
If and are of type , or , then they are said to be equivalent if they are homotopic.
- •
If and are of type and hang to the same vertex and to the same inner polygon (say for instance, but is similar), then they are said to be equivalent if they are homotopic, or, if there exist a Dehn twist such that . In this case, we add in the class of equivalence a tagged loop (respectively a loop) if the arcs is left tangent (respectively right tangent), drawn in figure 2, around , ending at the same vertex as .**
Remark 2.5**.**
The reader can wonder why we do not replace and by punctures, as Baur and Marsh did for case in [BM07]. The problem is that, if , there cannot exists any definition of the an -angulation which leads to a compatibility between flip of the -angulation and the colored quiver mutation.
Definition 2.6**.**
An -diagonal is an equivalence class of admissible arcs, up to homotopy.
Whenever it is clear, we indifferently identify the term of equivalence class and well-chosen representative. Moreover, there can be for the reader a confusion between the equivalence relation on arcs and the homotopy equivalence relation. Note that all the arcs are considered up to homotopy, and that the -diagonals are classes under the equivalence relation defined in 2.4.
Remark 2.7**.**
If , then, there exist an infinity of classes of arcs tangents to the left or . Indeed, the -diagonals car roll around and , and this leads to two different classes of arcs. See figure 3 for an illustration.
In figure 5, we can see an example of two arcs corresponding to the same -diagonal, where we have applied a Dehn twist to one of the polygons.
Definition 2.8**.**
We call by -angle, a figure with sides, made of:
- •
Sides of
- •
Sides of or
- •
-diagonals.
Definition 2.9**.**
- •
Two -diagonals are said to be noncrossing if each of them are non self-crossing and if there exist representatives in their homotopy class which do not cross each other in the interior of the surface.
- •
An -angulation is a set of noncrossing -diagonals, such that there exist representative admissible arcs which cut the figure into -angles. Such a choice of representatives is called a good set of representatives.**
For instance, in order to show that two -diagonals (one of type ) do not cross, one can, if needed, replace by the loop the arc of type , since the loop belongs to this equivalence class (see figure 7 for an example). If the arc is left tangent, we can replace it by a tagged loop. If it is right tangent, we replace it by the untaggeed loop.
Remark 2.10**.**
Many articles used tagged and untagged arcs instead of left and right arcs. Indeed, if we consider isolated arcs (not belonging to an -angulation), it is more comfortable to use tagged and untagged arcs. Nevertheless, as one of the aims of the article is to show compatibility between the flip of an -angulation and the colored quiver mutation, we remain using left and right tangency since the result cannot be showed using tagged and untagged arcs.
See figure 6 for the example of an -angulation.
Lemma 2.11**.**
Let be an -angulation. Let and be two good sets of representatives for . Then there exists a Dehn twist on and such that, after exchanging some choices of tagged or untagged loops if necessary, for all , up to homotopy. For any , the arcs and represent the same class of objects.
Remark 2.12**.**
Sometimes, it is necessary to play with the representatives of the equivalence classes of -diagonals. Here, for instance, to show the lemma, we are allowed to (and we will have to) replace an arc by a loop. Indeed, if there are two arcs of type ending at the same vertex, tangent on both sides of (respectively ), then replace the left tangent by a tagged loop. That does not change the -diagonal, since both arcs belong to the same class of equivalence.
Proof.
We may assume that all the loops which appear in the good sets of representatives are tagged loops. We are only interested in the arcs attached to . The case is similar for .
Let be an arc an extremity of which is a thick vertex of . Let be a Dehn twist such that . Let be the neighbor of according to . Let such that . Then the number of sides of between and is the same as the number of sides between and . Indeed, the sets and are -angulations, and the other extremity of and (respectively and ) is a vertex of (respectively ). Then to respect the notion of -angles in an -angulation, it means that if is the number of edges of between and , is also the number of edges of between and . Then .
We can reproduce this process until we have treated all the arcs ending on . ∎
We now introduce the twist which will be used in order to define the flip of an -angulation at some -diagonal.
Remark 2.13**.**
In a set of good representatives for an -angulation, either there is a unique non-loop arc of type , incident with (respectively ), and a loop (tagged, if is right tangent, untagged if is left-tangent), or there are no loops.
Definition 2.14**.**
Let be an -angulation and a good set of representatives. Let , linking the vertices and . If is of type , which means, linking a vertex to an inner polygon (say , the issue is exactly the same for ) and surrounded by a loop (this loop can only appear at , because there are no crossings), then replace this loop by the corresponding arc tangent to (left-tangent if it is tagged, right-tangent if it is untagged), and replace by a loop.
We are now in the good situation to define the twist of in , whatever the type of .
Definition 2.15**.**
Given a set of good representatives of an -angulation and an -diagonal in such a set, the twist of is defined as follows:
- •
Step 1: If is the unique -diagonal in incident with either or (in which case, we have an -angle whose sides in are and a loop ), consider instead a different set of good representatives given by replacing by a loop and by an arc incident with (or ), tagged if is left-tanget, untagged if not.
- •
Step 2: By orienting in the clockwise direction the two -angles for which is a side, let and be the sides of these -angles which follow . The twist of is then given by the concatenation .
If is even, then the side of the tangency does not change with the twist. If is odd, then change the side of the tangency of both arcs.
Remark 2.16**.**
The question of parity is already present in the paper of Baur and Marsh on case , in [BM07, Remark 3.4]. Remember that a left-tangent arc is associated with a tagged loop, and a right-tangent arc is associated with an untagged loop. Then in order to stay coherent with the tagged arcs in case .
We note that, after applying the twist, the set of representatives is still a good one.
Definition 2.17**.**
Consider an -angulation. Choose a good set of representatives for . Let be an arc in it. From Remark 2.12, we may assume that is a loop if necessary. The flip of the -angulation at is defined by where is given by , the twist of .
Lemma 2.18**.**
The definition of a flip is independent of the choice of good representatives.
Proof.
This result comes from the fact that the definition of a twist is independent of the choice of good representatives.
Here, we note that we choose a set of good representatives in which the arc corresponding to the -diagonal is a loop. As explained in Remark 2.12, this is always possible.
Let and be two good sets of representatives for . There exists such that for all , , and commutes with the twist .
In fact, applying the twist to consists in "slipping" clockwise. The Lemma 2.11 says that "slipping along" a side of does not depend on the choice of representatives in a class under Dehn twist. ∎
Remark 2.19**.**
- (1)
Note that the twist has an inverse, which consists in moving the arc counterclockwise. Then the flip is also invertible. 2. (2)
We note that the twist is not the same as the Dehn twist. 3. (3)
A flip does not change the number of -diagonals in the -angulation.
The twist is defined on the -diagonals, which is a class of equivalence under Dehn twist, and the flip is defined on an -angulation, which is a set of -diagonal. Nonetheless, we will sometimes apply them on arcs, implicitly assuming that we have chosen a good set of representatives.
Definition 2.20**.**
For any and , we define the initial -angulation in the following way: From the vertex of , we draw:
- (1)
An arc going to , tangent to one of its thick vertices (which one does not matter, thanks to the equivalence under Dehn twist). 2. (2)
A tagged loop around . 3. (3)
An arc going to , tangent to one of its thick vertices (which one does not matter, thanks to the equivalence under Dehn twist). 4. (4)
A tagged loop around . 5. (5)
The arcs of type connect vertex wth vertex , with .**
It is obvious that the arcs drawn from the previous definition form a good set of representatives for the initial -angulation. See figure 12 for an example of initial -angulation.
Note that we do not have to label the loops, since their labels are automatically deduced from the other arc ending in the corresponding inner polygon.
Lemma 2.21**.**
Every -angulation can be obtained from the initial -angulation by a finite sequence of flips.
Proof.
We know that there are at least five -diagonals (as ). We are going to proceed by reduction. The first aim is to hang to each inner polygon and , exactly one -diagonal and one loop to reduce to a well-known case. We treat the case of , the case of being similar.
If there is a loop, then, do nothing. Else, there cannot be less than two arcs ending at . Indeed, we can argue that if there was only one arc ending at (or no arc at all), then the set of noncrossing -diagonals is not maximal, since we can add a loop for example, which would not cross any of the present arcs.
If there are more than two arcs ending at , first remark that there is no loop (else, this set of -diagonals would not give an -angulation). Then note that there cannot be two arcs ending at the same vertex of . Else, we could replace one of them by a loop, and this is impossible. Choose one thick vertex where one arc, named ends. There exists (at least) one arc ending at . Flip it times in order for it to be hung to . Apply a finite sequence of flips to the eventual other arcs hung to , , so as they become of type or by slipping along or .
We are then we are reduced to the case of figure 13 (which is not completed by the other arcs of the -angulation).
The remaining arcs form an -angulation of the -gon defined by both loops and the boundary -gon. This is the geometric description of Dynkin type , that we can study in [BM08, Section 1]. In that case, all -angulations are related by a sequence of flips. This proves the result.
∎
Corollary 2.22**.**
Any two -angulations are related by a finite sequence of flips.
This Corollary gives a different proof to the fact that -cluster-tilting mutation in the -cluster category of type is transitive (assuming -angulations are in bijection with -cluster-tilting objects, according to [JM]). The transitivity of cluster-tilting mutation in the hereditary case was proved in [ZZ09].
Corollary 2.23**.**
Any -angulation contains exactly -diagonals. If it is given by a good set of representatives, then it has -angles.
We can also apply the "flip" on a maximal set of non-crossing -diagonals. For an -diagonal, we can set exactly the same way we did for -angulations.
Proposition 2.24**.**
A set of -diagonals is an -angulation if and only if it is a maximal set of noncrossing -diagonals.
Proof.
On the one hand, a maximal set of noncrossing -diagonals cuts the polygon into -angles. Indeed, let us fix a maximal set of noncrossing -diagonals.
- •
If contains two loops, then, these two loops cut the figure into a -gon. This reduces to case (since the polygon in the description in [BM08] in type contains sides). As the set is maximal, it cuts the figure into -angles.
- •
If only contains one loop, then the loop cuts the figure into a -gon, with one thick vertex. This is the geometric realization of Baur and Marsh in [BM07] for a category of Dynkin type (Baur and Marsh use the system of punctures instead of the inner polygons, but this does not change the proof). As the set is maximal, it cuts the figure into -angles.
- •
If has no loops, then we use the following argument to create loops. There are several cases:
- –
There are two arcs ending to (for instance), and ending at the same vertex of , then it suffices to replace one of them by a loop.
- –
There are two arcs ending to (for instance), but ending at a different vertex of . Say that ends in and ends in . Then we can apply several times the twist to in order to hang it to the same vertex as , . It suffices then to replace by a loop.
- –
There is one arc only ending to . This would contradict the maximality of the number of )diagonals, since we can add a loop.
- –
If there are arcs ending to , applying the twist several times to one of them make it slips along on arc, and become of other type. Then we are led to the case , and we conclude by induction on , the initialization being the previous case.
- •
If contains an arc from to , then any maximal set of noncrossing -diagonals must contain two arcs with endpoints in and , and similarly two arcs with endpoints in and . Then we can reduce to the case where there arc two loops (one around and one around ).
If contains an arc from to , the maximality of implies that there exist one arc from a vertex of to and one arc from to (indeed, if this was not the case, we have only -diagonals linking different vertices of , plus an arc from to . We then can add an -diagonal from a vertex of to , which does not cross th others and is admissible, and this contradicts the maximality). Then, we apply the twist to as many times as necessary to hang one of its ends to the polygon . Then, we come to the previous case.
Note that two arcs linking to are not compatible (as in [FST08], for the case where ).
This finally shows that cuts the figure into -angles.
On the other hand, let be a set of noncrossing -diagonals, cutting the picture into -angles. We first note that the -diagonals do not cross. In addition, the set is maximal. Indeed, if it was not the case: Let us add a noncrossing arc in an -gon, then it cannot be an -diagonal:
If , then we cannot cut any triangle without being homotopic to one of the edges. Else, the only way to cut an -angle by forming a -gon is to form a triangle. This is impossible given the definition of an -diagonal. ∎
Corollary 2.25**.**
A set of -diagonals is an -angulation if and only if it is a set of noncrossing -diagonals.
Proof.
It suffices to show that if there exist noncrossing -diagonals, then this number is maximal. Let be a set of good representatives of noncrossing -diagonals. If there is an -diagonal which is not crossing all the -diagonals of , as there are -angles, this -diagonal cuts an -angle, and this gives a contradiction. ∎
Lemma 2.26**.**
Any set of noncrossing -diagonals, can be completed to an -angulation.
Proof.
Suppose is a set of noncrossing -diagonals. If the set is maximal, then it is already an -angulation. Else, we can add an new -diagonal . We repeat the operation with until the set is maximal. The process ends since has a finite number of sides, and once we have cut into -angles, we cannot go further. ∎
3. Construction of the category of -diagonals
We are now able to construct a new category, , equivalent to a subcategory of the higher cluster category of type by using the -diagonals. More explicitly, we are going to draw an Auslander-Reiten quiver and we will see that it is isomorphic to a subquiver of the Auslander-Reiten quiver of . We will also remark that the indecomposables of correspond to the rigid indecomposables of the higher cluster category.
Before starting with the construction of the category we define what will be the generators the morphisms of : the elementary moves.
3.1. Elementary moves
Elementary moves are applications that send an -diagonal to another one. They should not be confused with flips.
Let be a quiver of type . We want the elementary moves to correspond to the arrows in the Auslander-Reiten quiver of .
We now recall the length of an -diagonal of type from definition 2.6.
Definition 3.1**.**
Let be two integers between and . The length of the boundary path from to , denoted by is the number of edges between and counted clockwise.
Definition 3.2**.**
Let be the polygon considered in section 2. Let us number the vertices of clockwise. Let be an -diagonal from to . The translation of is defined as follows:
- (1)
If and is of type or , then is the unique new arc obtained by by composing with the boundary paths and , linking and , and of the same type. 2. (2)
If , the arc is of type then is the new arc tangent to the same vertex of the inner polygon, ending at . If is odd, then change the side of the tangency. To be clear, one can obtain by moving the endpoint in the clockwise direction times. 3. (3)
If links both inner polygons, it means that is of type , from to for instance, the new arc links and modulo (where indices are considered). The side of the tangency changes only if is odd. To be clear, one can obtain by moving the endpoint in the clockwise direction times.
For the last point, the new arc is uniquely defined, because it does not depends on the eventual Dehn twist of or , but only of the relative position before applying .
This definition of a translation is the inverse of the Auslander-Reiten translation.
Applying or several times to an arc of type makes the arc "roll around" both central polygons.
From now and al throughought the paper, we cal by the boundary component linking to clockwise.
Here in figure 15 and figure 14, we can see examples of a translation:
We now define elementary moves, which will correspond to arrows in the Auslander-Reiten quiver of as shown in figure 17.
Let us recall that the Auslander-Reiten quiver of is defined as follows:
- (1)
The vertices of are the isomorphism classes of indecomposable objects in . 2. (2)
Between two representants and , the arrows are in bijective correspondence with the vectors of a basis of , the irreducible morphisms from to .
Definition 3.3**.**
Let be an -diagonal. We define an elementary move from to an arc by giving all possibilities given from the type of .
- •
If is of type , an elementary move is given by fixing an endpoint , and moving the other endpoint around the boundary component times in the clockwise direction. The resulting arc is either of type if , of type , if .
- •
If is of type , an elementary move is given by fixing an endpoint , and moving the other endpoint around the boundary component times in the clockwise direction. The resulting arc is also of type .
- •
If is of type , the representative of its equivalence classgiven by a loop is chosen before performing the elementary move. Then, fixing an endpoint in (notice that the other endpoint is hung at the same vertex), move , times, in order to find , which is of type .
- •
If is of type , an elementary move is given by fixing an endpoint on (respectively ), and moving the other endpoint , which is on (respectively ) to (respectively ), at vertex . The resulting arc is of type .
Here is the tabular of elementary moves in the three first cases for a polygon with sides (where e-m stands for "elementary move" and the -diagonal is black whereas is red). For sake of clarity, we have not drawn the disks on each thick vertex of the central polygons. The dotted lines hide edges.
The remaining cases in the definition will be treated in section .
[TABLE]
in the -cluster category
3.2. The category of -diagonals
In this section, we will make use of the elementary moves defined above in order to generate the morphism of a category of -diagonals. Let us just give a Lemma before starting.
Lemma 3.4**.**
If and are two -diagonals, then there exists an elementary move if and only if there exists one .
Proof.
There are several cases to examine. We can always reduce to the case where or are not loops. Note that if is of type or , there exists an elementary move from to if and only if is also an arc of type or .
- (1)
Let us first study the case of arcs of type or .
- (a)
If is of type .
Then let be its only vertex. To be compatible with the definition of an elementary move, it is necessary for to be of type . Let be the other vertex of (the first one being , since both arcs have to share an oriented angle).
By definition, . If is the extremity of the -diagonal , then . So and and share an oriented angle. Thus there exists 2. (b)
If is of type . There are two sub-cases:
- (i)
If is of type .
Let and be the vertices of , where is also the one of .
Then . So, if and are the vertices of then (and ). Thus there exists . 2. (ii)
If is of type .
Let and be the vertices of and and the ones of . We have .
So, if and are the vertices of , we have and . Thus there exists . 2. (2)
Now, if and are of type or .
- (a)
If is homotopic to the boundary path (type ). Then must be also homotopic to the boundary path. Let and be the vertices of , where is also the one of . Then, . So, if and are the vertices of then (and ). Thus there exists . 2. (b)
If is from a thick vertex of to a thick vertex of (of type ), then is of the same type. Let and be the vertices of , where is also the one of . Then, . So, if and are the vertices of then (and ). Thus there exists
The converse is similar. ∎
Definition 3.5**.**
The quiver is defined as follows:
- (1)
The vertices are the -diagonals. 2. (2)
There is an arrow between two -diagonals and when there is an elementary move from to .
The category is defined to be the additive mesh category of .
It means that the category is the additive Krull-Schmidt category where:
- (1)
The indecomposable objects of are the -diagonals of definition 2.6. So the objects of are the finite direct sums of -diagonals. 2. (2)
The set of morphisms between two indecomposable objects and is given by the -vector space generated by the paths from to in by the subvector-space generated (elements in the ideal generated by) mesh relations. 3. (3)
The composition is induced by the concatenation of paths in .
Mesh relations: By the previous Lemma, we know that if we have , then we also have . Then the mesh relations are the relations:
[TABLE]
We will see that is equivalent to a sub-category of the higher cluster category .
Let us recall a definition.
Definition 3.6**.**
A stable translation quiver is a quiver without any loops or multiple edges, together with a bijection , such that for all vertices , the number of arrows from to is equal to the number of arrows from to .
Corollary 3.7** (Corollary of Lemma 3.4).**
The quiver ( is a stable translation quiver.
Proof.
By definition, is defined on all vertices, and has a clear inverse.
Let be a vertex in . Given a vertex , we have to show that if there is an arrow from to , then there is an arrow from to . This is exactly the Lemma 3.4.
In addition, the quiver does not have any loops (there cannot be any elementary move from to ) nor multiple arrows with the condition of the length in the definition of an elementary move. ∎
Figure 17 illustrates a small part of the Auslander-Reiten quiver of .
We can find on a slice of the Auslander-Reiten quiver of the following initial -angulation. In fact, each arc of the initial -angulation corresponds to the image in the -cluster category of a preprojective indecomposable representation.
Remark 3.8**.**
We note that, on the previous pictures, we have only drawn part of the first transjective component of the Auslander-Reiten quiver of , but there are copies of it, where we can find the -diagonals shifted times (see definition 5.1). Indeed, between the tubes, there are copies of the preinjective and preprojective components. On figure 18 we can see how the preprojective, regular and preinjective components of a Auslander-Reiten quiver of type are set. We can see the first shift of the preprojective objects, and also the first shift of the regular objects.
3.3. Mesh relations
It is possible to make use of the -diagonals so as to easily picture mesh relations. There are several types of mesh relations that can thus be described depending on the number of paths from to .
The first type of relation is of the following form:
[TABLE]
It is easy to see that, if we call by and the extremities of both arcs of type different from , then the arc of type links to . This is a general case.
The second one is of this shape:
[TABLE]
The third one is of this shape:
[TABLE]
If is the -diagonal at the left from to , then the -diagonal at the right is from to . They are of same length .
The upper two pictures in the middle column (or the lower two if we are situated at the bottom of the Auslander-Reiten quiver) on the figures 17 and 32 are arcs tangent to one side of a central polygon, and the other extremity is at the vertex shared by both and (as and , they share one vertex). Finally the lowest (or uppermost) picture is an -diagonal of type 1, and . The bases of the tube will be described in the next section.
3.4. The case of regular modules
Now that we have set the category of -diagonals and that we visualize what happens in the transjective component of the Auslander-Reiten quiver, we are interested in the case of non-homogeneous tubes, and their correspondences in terms of arcs. We are going to focus on arcs of type and . Indeed, these remaining diagonals have the particularity of being cyclic. If we apply several times to them, they come to their first position at a rank . This cannot be the case of the types of -diagonals defined in 2.6 (because they wrap around the central polygons).
In figure 19, we can see the other types of diagonals. Note that we only have drawn the first ones, but there are also their successive images under (of which there are a finite number because they are cyclic).
Definition 3.9**.**
Let . We denote by (respectively ) the connected components in the quiver composed by the -th shift of , for the -diagonal of type at the center of the figure 19 (respectively at the right of the figure). The arrows correspond to the elementary moves we can draw.
We denote by the connected components in the quiver composed by the -th shift of , , where is the -diagonal of type ending at .
These diagonals have to figure in the Auslander-Reiten quiver of , and we can see them in the non-homogeneous tubes (it means in the regular part of the quiver).
In case , as we can see in [CB], there are three types of non-homogeneous tubes, two of period , and one of period .
We have to notice, that we have copies of each tube, it means we have non-homogeneous tubes. The first tube contains the first picture of figure 19 and all its images under . There are copies of this tube, which correspond to the successive shifts of the arcs. This is the same process for the second and third tube.
[TABLE]
It is known in [CB] that in a tube of size , only the first layers contain rigid objects. Graphically this corresponds to noncrossing arcs. It means that in , for the example of the only tube of size , the lowest lines are made of noncrossing arcs. Then the arc crosses itself, and this does not correspond anymore to an -rigid object in the higher cluster category, and this is the same for the shifted arcs in the successive copies of this first tube. Then with an arc situated on the first lines of the tube, we associate the -rigid object which actually takes place in the Auslander-Reiten quiver of .
In order to make sure that an arc corresponds to a unique -rigid object in the tube, we have to choose a convention. Let be the initial -angulation. Let be the red -diagonal in figure 20. Then the vertex of associated with is from the isomorphism of Theorem 5.3. Let . We only need to associate an -rigid object in order to find all the objects of the tube of size . We choose to associate with the simple object at vertex .
To be precise, we set at the base of the first tube of size the flip of the arc corresponding to the preprojective at the first slice of the Auslander-Reiten quiver. This arc is thus associated with the simple regular module which corresponds to the mutation of the preprojective. This means that we have mutated the object in the -angulation containing the arcs corresponding to the sum of the indecomposable projective objects.
For the tubes of size , we set the only arcs linking both central polygons without self-crossing (see figure 19).
With all the definitions of -diagonals, and -angulations on the polygon, we are now able to associate a quiver with an -angulation. We will see that the flip of an -angulation is compatible with quiver mutation at the same vertex.
4. Colored quivers and -angulations
First, we indicate how to associate a quiver with an -angulation and then we will see how to draw a colored quiver from an -angulation.
Definition 4.1**.**
Let be an -angulation. We choose a good set of representatives. We define the quiver associated with in the following way:
- (1)
The vertices of are in bijective correspondence with the -diagonals of . 2. (2)
Between two vertices and (corresponding to two -diagonals in ), we draw an arrow from to when both diagonals share an oriented angle. We require to be consecutive to clockwise. 3. (3)
If either is a loop and an arc inside of it, then forget (respectively ) to draw the incident arrows of (respectively ). Do not forget to draw an arrow from to .**
Remark 4.2**.**
Even if we have chosen a good set of representatives, the definition is independent of the choice of such set.
Remark 4.3**.**
From there, we call -diagonals and vertices by the same name. It should be clear from the context whether we talk about polygons or quivers.
This implies that from Lemma 2.11 is well-defined, because it is independent of the choice of a good system of representatives. Indeed, the Dehn twist does not affect the order of the -diagonals. More precisely, if we apply and two Dehn twists to the polygons and , let us recall and the images if and by . The end of (respectively ) hung to si the same as the one of (respectively ). Then the order is the same, and there is an arrow if is consecutive to (which is the same as being consecutive to ).
For example in case , if we take the following triangulation (figure 21):
Now, following the rule, we associate the following quiver with this triangulation:
[TABLE]
Let us now mutate this quiver at vertex . We obtain this new quiver :
[TABLE]
We remark that if we flip the previous triangulation at the -diagonal , we obtain the new triangulation of figure 22.
It is noticeable that the quiver arising from the new triangulation corresponds to the mutation at of the quiver . This is a result showed in [FST08] for .
Proposition 4.4** ([FST08], Proposition ).**
Let be any triangulation. Let be the quiver associated with as before. If is the new triangulation flipped at from , then the quiver associated with corresponds to the mutation at vertex of .
We will later exhibit a proof for the case of colored quivers of mutation-type . We now describe how to associate a colored quiver with an -angulation.
Lemma 4.5**.**
If , then the -diagonals of are in bijection with the tagged arcs in [FST08] for the twice punctured -gon and the obvious bijection respects the noncrossing conditions.
Proof.
Let be the set of all -diagonals in our setup. Let be the set of all tagged arcs in the setup of [FST08]. Define a bijection as follows :
- •
If links two vertices of , then send it to the same arc in .
- •
If is a left/right tangent to a thick vertex, send it to the corresponding plain/notched arc in .
∎
Definition 4.6**.**
Let be an -angulation, where we have taken a good set of representatives (here again, the definition does not depends ont such a choice). We define the colored quiver associated with in the following way:
- (1)
The vertices of are in bijection with the -diagonals of . 2. (2)
If and form two sides of the same polygon, then we draw an arrow from to . The color of the corresponding arrow is the number of edges between both -diagonals, counted clockwise from . 3. (3)
If either is a loop and an arc inside of it, then forget (respectively ) to draw the incident arrows of (respectively ). In this case, do not forget to draw an arrow from to of color [math], and an arrow from to of color .**
Example 4.7**.**
For example, the colored quiver associated with figure 23 is the following one:
[TABLE]
We note that if we only draw the arrows of color [math], then we find the classical quiver associated with the -angulation as in Definition 4.1.
Proposition 4.8**.**
There is an equivalent definition: the vertices are similarly defined, and for and two vertices, and an integer,
[TABLE]
Proof.
We only have to show that the arrows are the same. If and form two sides of the polygon, with a color , it means that if we apply the twist to , then there will be edges between and . Then if we apply the twist times, there will be no edge between and , and they will share an oriented angle.
On the other hand, if and share an oriented angle, it suffices to apply the inverse of the twist times to make sure that and form two sides of a polygon, and that there are edges between and . ∎
Lemma 4.9**.**
The quiver fulfills the conditions asked for colored quivers in section 1.2. It has no loops, is monochrome and symmetric.
Proof.
By definition, the quiver contains no loops (i.e. no arrows from to ).
If there is an arrow from to of color , it means that and share two sides of an -angle. If we count from to , there are edges between them. But, as we are considering -angles, it means that from to there are edges. So there is an arrow from to of color . Then the symmetry is respected.
Now it remains to show that the quiver is monochrome. We divide this proof into three cases.
First case: . The possible colors are either [math] or . If we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(1)}$$\textstyle{j} and \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} . Then, we have an oriented angle from to , and, with the symmetry of the figure, an arrow \textstyle{j\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{i} , then an oriented angle from to . This leads to a digon and not a triangle, as it must be the case with . This leads to a contradiction, and there is only one possible color for arrows: the quiver is monochrome.
If is a loop starting in , around for instance, and linking to , then there is no arrow between and by definition. If is another -diagonal, then the situation is the same as above: two arrows of different color incident to would create a digon.
Second case: . If we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{j} and \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c^{\prime})}$$\textstyle{j} , it means that and share two -gons, one with edges between and , and the other one with edges. So we are in the type of situation of figure 26).
Let (respectively ) be the vertices along the dotted edges cutting on the side of (respectively ) the figure into two parts, one of type and one of type . On the figure, we can visualize in red and in blue. Let and (respectively and ) be the number of vertices as shown in figure 26 in (respectively in ).
Then, by making a computation on the total number of vertices, we are led to a contradiction.
Indeed, we have the following equations:
[TABLE]
Then we have that
[TABLE]
So
[TABLE]
This leads to and this is impossible.
Third case: . Consider three different possible sub-cases.
First sub-case: if we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} and \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(1)}$$\textstyle{j} it means that and belong to a triangle, which is impossible since .
Second sub-case: if we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} and \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(2)}$$\textstyle{j} , it means that we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} and \textstyle{j\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{i} which is also impossible.
Third sub-case: if we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(1)}$$\textstyle{j} and \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(2)}$$\textstyle{j} , this reduces to the first case, since we have \textstyle{j\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(1)}$$\textstyle{i} and \textstyle{j\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{i} .
We thus have shown that there is no way to have two arrows from to of different colors This show the Lemma. ∎
Theorem 4.10**.**
Let be any -angulation. Let be the colored quiver associated with the -angulation . If is the new -angulation flipped at from , then the colored quiver associated with is the mutation at vertex of the colored quiver (see figures 24 and 25 for an illustration).
Proof.
Let be an -angulation, let be the associated colored quiver, and let be a vertex of .
We want to show that . Let us call by the new -angulation obtained from by flipping the arc . There is an evident bijection between the vertices of and . Let and be two vertices of (and of )).
Let (respectively ) be the number of arrows of color from to in (respectively ). Let us show that .
First case: If , then and . Consequently .
Second case: If , then and . Consequently .
Third case (see figure 27): Assume that, in , we have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(c)}$$\textstyle{k\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} and and are not two sides of the same -angle. Then . We notice that we cannot have two arrows from to of color [math]. We are in a situation of the following type:
i$$a$$k$$j
Let then be the common vertex of and . Let be the other vertex of (where or can be central polygons). Then and have as a common vertex. As, in , and have one common vertex , then and have one common vertex. As a consequence, . There is no loss because there are not any arrows from to of color different from . We note that there can be two arrows of different colors appearing from to , but as this is forbidden, we remove them, and this confirms that there are no two such arcs in . This case is symmetric to the case where and share a common vertex.
Fourth case: Assume that we are in a situation of the following type:
i$$k$$a$$j
It means that we have a quiver:
[TABLE]
Then , because the arrows get erased. Moreover, under the notations of the third case, and have as a common vertex, and and do not share a common polygon anymore. Then . ∎
Example 4.11**.**
Let us draw an example in figure 27.
We have \textstyle{i\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{k\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{(0)}$$\textstyle{j} . When we mutate , we obtain the figure in the right. The quiver becomes
[TABLE]
(where we do not note the inverse arrow for sake of clarity).
Now let us mutate at vertex . The -angulation becomes:
If we mutate the colored quivers, since two arrows of different colors are drawn from to (one of color and one of color ), they are removed and the quiver becomes of color . This exactly corresponds to the quiver of the -angulation.
5. Equivalence of categories
In this section, assuming that is still a quiver of type , we build an additive functor from the category to the -cluster category.
Definition 5.1**.**
Let be the polygon considered in section 2. Let us number the vertices of clockwise. Let be an -diagonal from to . The shift of is defined as follows:
- (1)
If and is of type or , then is the unique new arc obtained by composing with the boundary paths and , linking and , and of the same type. 2. (2)
If , is of type , then is the new arc tangent to the same vertex of the inner polygon, ending at . If is odd, then change the side of the tangency. (see figure 28). 3. (3)
If is of type , which means it links both inner polygons, from to for instance, the new arc links and . The side of the tangency changes only if is odd (see figure 29).
Definition 5.2**.**
If is an integer in , then we define as the connected component in the quiver of Definition 3.5 containing the -th shift of the initial -angulation, the first component being the one corresponding to the initial -angulation, and the following ones corresponding to the initial -angulation where has been applied.
Let be the component in the Auslander-Reiten quiver of , containing objects of type where is a projective indecomposable object and is an integer.
Theorem 5.3**.**
Let . Then we have an isomorphism between both components:
[TABLE]
Proof.
For , we fix an orientation for our quivers. The orientation we choose is the one of the quiver corresponding to the initial -angulation:
[TABLE]
Let be the initial -angulation in the first copy of the quiver . It corresponds to the -cluster-tilting object at the initial slice of the Auslander-Reiten quiver of . With the -diagonal (at vertex ), we associate the projective module . Then we associate with the elementary moves of -diagonals, the irreducible morphisms in the cluster category. Indeed, according to the tabular of section 3.1, there is an elementary move from to when both share an oriented angle. As it has been told in Definition 4.1, in the quiver it means that there is an arrow from to . So there is an irreducible morphism from to .
Now that we have treated the case of the initial slice in the first copy, still calling the -diagonal at vertex in this slice, we note that every -diagonal in the component in the quiver is of the form , for some and . So it is natural to define
[TABLE]
Therefore, there is a bijection between the arcs of and the indecomposables of the transjective components in the Auslander-Reiten quiver of containing the image of the indecomposable projective objects.
Indeed, there are two things to show: First, for any arc , there is a unique way to write it . If we had in a component , then , so because of the type of the diagonal (if it is tangent one or another side of the central polygon, or if it is of type , with length , etc…), and if it would mean that there is the same -diagonal at two different vertices in the quiver , which is impossible. Second, if is an indecomposable in the -th component of , it can be written , and this has a unique antecedent by , which is .
As a matter of conclusion, is bijective on the objects. Let us show that it is also a bijection on the elementary moves. Suppose that is an elementary move. Then there exist , such that and (i.e and , where when there is an elementary move or where there is an elementary move . In the first case, there is an irreducible morphism from to thus from to and from to . In the second case, there is an irreducible morphism from to thus from to and from , thus an arrow .
This proves the statement. ∎
Definition 5.4**.**
Let . We recall that (respectively ) is the connected components in the quiver composed by the -th shift of the two types of -diagonals of type . Let be the connected components in the quiver composed by the -th shift of the -diagonals of type .
Let and be the -th shift of the tubes of size in the Auslander-Reiten quiver of . Let be the -th shift of the tube of size .
Theorem 5.5**.**
Under the notations of the previous definition, we have the isomorphism between the pairs of components
[TABLE]
Proof.
We only state the proof for the bijection , the others are similar.
We first note that the components of the quiver are of the same size and shape. Indeed, is a non-homogeneous tube of size . Moreover, the tube is also of size (because the -diagonals are cyclic of order ). We know from [JM] that the simple module at the base of the first tube corresponds to the arc of type and of size starting at vertex . Then there is a 1-1 correspondence between the elementary moves and the irreducible morphisms. ∎
6. About non-self-crossing arcs and -rigid objects
We know by Theorem 5.3 that an arc in the geometric realization can be interpreted as an object in the -cluster-category. We use the following notation: if is an arc in the category let be the object associated in the -cluster category.
Lemma 6.1**.**
Let be the set of equivalence class of -diagonals with no selfcrossing. The application
[TABLE]
is a bijection.
Proof.
With each arc which does not cross itself we associate by Theorem 5.3 an -rigid object . Then .
Indeed, first, if belongs to the preprojective part of the Auslander-Reiten quiver, it belongs in particular to a slice of it which forms a quiver of type . If we add all the arcs forming this quiver, we obtain an -angulation. In the Auslander-Reiten quiver of , by Theorem 5.3, this slice corresponds to an -cluster-tilting object, made of the sum of all -rigid objects at the vertices of the slice. Then, with is associated an -rigid object , and as is in this part of the Auslander-Reiten quiver of , it does not cross itself.
Second, if belongs to a tube, then if it does not cross itself, it is at the base of it, and by the previous section, this corresponds to an -rigid object (because in the case of a tube of size , is situated at one of the first lines). Conversely, if is -rigid, then it is at the base (in the first lines) of the tube of size , it means that it corresponds to an arc of the first lines, which does not cross itself.
We have thus shown that is an arc which does not cross itself if and only if . ∎
Remark 6.2**.**
We can extend this bijection to the arcs in the non-homogeneous tubes including arcs with a self-crossing. Indeed, the arcs at the base of the tube are the arcs of lenght . If we number the levels in the tube, by starting at [math] for the arcs of length , then the arcs at level are the arcs of length . This can be easily visualized in figure 36.
In [JM, Theorem 4.5], it is shown that there is a bijection between -angulations and -cluster-tilting objects.
7. An example
Let us resume this paper with a complete study of an Euclidean quiver of type , and its -cluster category, taking and . So we study the following category
[TABLE]
where is the following quiver:
[TABLE]
7.1. Quadrangulations of the decagon and colored quiver
The geometric realization shown in figure 30 for this quiver is a decagon with two squares inside of it.
We are now drawing eight -diagonals in order to cut the decagon in quadrangles. This is in figure 31 the initial -angulation from which we will build later the translation quiver isomorphic to a sub-quiver of the Auslander-Reiten quiver of .
If we follow the rules of Definition 4.1, we associate with this quadrangulation the quiver at the beginning of this section.
Moreover, if we associate the colored quiver with this quadrangulation according to Definition 4.6, we obtain this one.
[TABLE]
Now we know that mutating a colored quiver corresponds to flipping an arc in an -angulation, we can flip in any way the quadrangulation, draw the corresponding colored quiver, and note that the colored quivers are related by mutation at the corresponding vertex.
7.2. -diagonals and the preprojective component of the Auslander-Reiten quiver of
From the initial quadrangulation, we extract the arcs and put them in the first component of the Auslander-Reiten quiver of .
As the preprojective component of the Auslander-Reiten quiver is of the following form (where we have associated the vertices with the types of the arcs we are working with), we just have to apply and the shift functor to the arcs to be able to complete the preprojective component and obtain the result in figure 32.
[TABLE]
Note that there are two copies of this component, and the other one is about the same but all the arcs have been shifted once clockwise.
The preprojective component is infinite, and as we apply the Auslander-Reiten translation several times, the arcs wrap around the inner polygons.
7.3. -diagonals in the non-homogeneous tubes of the Auslander-Reiten quiver of
Concerning the regular modules, there are three types of non-homogeneous tubes: The first type, containing tubes of size and the two other types of tubes (each one containing copies of it) of size . The one of size corresponds to the following cyclic arc (in figure 33) and its images under the shift.
Indeed, if we apply five times, the arc returns to the origin, so it is cyclic of order . The two remaining arcs corresponding to the tubes of order are the ones of figure 34, plus their successive images under the shift.
Here we draw the tube of size corresponding to the first picture of figure 34.
[TABLE]
The arc appearing at the leftmost second level is the one of figure 35.
Note that in this tube, only the first line corresponds to rigid objects. The upper arcs cross themselves and thus no not correspond to rigid objects anymore.
The following picture gives the tube of size , with the corresponding arcs. We can notice that in the first four ranks, the arcs do not cross since they match to a rigid object, and this is not the case anymore from rank .
NB: In order to have clear pictures, we have replaced the inner boundary component inside of , which should be a monogon, with a simple disk.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AS 81] M. Auslander and O. Smalo. Almost split sequences in subcategories. Journal of Algebra , 69(2):426–454, 1981.
- 2[ASS 06] Ibrahim Assem, Daniel Simson, and Andrzej Skowroński. Elements of the representation theory of associative algebras. Vol. 1 , volume 65 of London Mathematical Society Student Texts . Cambridge University Press, Cambridge, 2006. Techniques of representation theory.
- 3[BM 07] Karin Baur and Robert J. Marsh. A geometric description of the m 𝑚 m -cluster categories of type D n subscript 𝐷 𝑛 D_{n} . Int. Math. Res. Not. IMRN , (4):Art. ID rnm 011, 19, 2007.
- 4[BM 08] Karin Baur and Robert J. Marsh. A geometric description of m 𝑚 m -cluster categories. Trans. Amer. Math. Soc. , 360(11):5789–5803, 2008.
- 5[BMR + 06] Aslak Bakke Buan, Robert Marsh, Markus Reineke, Idun Reiten, and Gordana Todorov. Tilting theory and cluster combinatorics. Adv. Math. , 204(2):572–618, 2006.
- 6[BT 09] Aslak Bakke Buan and Hugh Thomas. Coloured quiver mutation for higher cluster categories. Adv. Math. , 222(3):971–995, 2009.
- 7[BT 15] Karin Baur and Edmund André Torkildsen. A geometric realization of tame categories. 2015.
- 8[Bua 11] Aslak Bakke Buan. An introduction to higher cluster categories. Bull. Iranian Math. Soc. , 37(2):137–157, 2011.
