Derived equivalence classification of -cluster tilted algebras of type
Abstract.
We use the maximal faces of the -cluster complex of type introduced in [11] to describe the quivers of -cluster tilted algebras of type . We then classify connected components of -cluster tilted algebras of type up to derived equivalence using tilting complexes directly related to the combinatorics of the -cluster complex of type . This generalizes a result of Buan and Vatne [9].
Key words and phrases:
-cluster tilted algebras, derived equivalence2000 Mathematics Subject Classification:
Primary: 16G10; Secondary: 18E30, 05E991. Introduction
Cluster categories were introduced in [6] as a representation theoretic framework for cluster algebras of Fomin and Zelevinsky [12]. Independently, in [14] Iyama defines maximal -orthogonal modules for Artin algebras, , and presents a classification of maximal 1-orthogonal modules for finite type self-injective algebras of tree class and . Motivated by a generalized version of the combinatorics related to cluster algebras, -cluster categories were defined as a generalization of cluster categories [21], [22]. The cluster categories and their generalizations have been the subject of much recent research.
The -cluster category is defined to be where is a finite dimensional hereditary algebra over a field (which we take to be algebraically closed) whose corresponding quiver has no loops or oriented 2-cycles; is the Auslander-Reiten (AR) translate in the bounded derived category ; denotes the suspension functor present in the triangulated structure of and denotes its -th power, that is .
In -cluster categories one can define -cluster tilting objects as follows [21].
Definition 1.1.
An -cluster tilting object in is an object satisfying the following conditions.
-
(1)
, , if and only if .
-
(2)
, , if and only if .
It is the endomorphism algebras of these -cluster tilting objects, , called -cluster tilted algebras, that we study in this paper. We focus on the case where is an hereditary algebra of Dynkin type .
Our aim is to generalize a result of Buan and Vatne, [9], on the derived equivalence classification of 1-cluster tilted algebras of type .
In section 2 we give a local description of -cluster tilted algebras of type as quivers with relations using the combinatorics of -cluster complexes [11, section 4] which can be related to -cluster tilting objects. More precisely, it can be proven that the maximal faces, or facets, of the generalized cluster complex correspond bijectively to the -cluster tilting objects in [21], [18]. Then, the combinatorial model for the generalized cluster complex in type can be used to determine the -cluster tilted algebra corresponding to a given -cluster tilting object.
This description of the -cluster tilted algebras based on the combinatorial model for the generalized cluster complex enables us to prove that -cluster tilted algebras of type are gentle and that if the quiver of an -cluster tilted algebra of type contains cycles they must be of length and must have full relations, that is the composition of any two consecutive arrows in the cycle must be a relation. These -cycles play a crucial rΓ΄le when considering derived equivalences of -cluster tilted algebras. Details of these statements can be found in section 2.
Our main theorem can be stated as follows.
Theorem 1.2.
Two connected components of an -cluster tilted algebra of type are derived equivalent if and only if their quivers have the same number of oriented -cycles with full relations.
The statement of theorem 1.2 must allow for the possibility that for the -cluster tilted algebras of type may be disconnected. That these algebras can be disconnected follows from the combinatorial description in section 2. This is one of the noticeable differences between the and cases, since 1-cluster tilted algebras of type are connected [9].
After section 2 the paper is structured as follows. In section 3 we provide tilting complexes which prove that there exist derived equivalences between -cluster tilted algebras which preserve -cycles with full relations. In this section we also describe how these tilting complexes are related to the combinatorial model of -cluster tilted algebras in type . Then we use [5, thm 4.1,cor 4.3], which states that the Cartan matrix of a gentle algebra is unimodular equivalent to a diagonal matrix determined by the cycles with full relations which appear in the description of that algebra as a quiver with relations, to identify the necessary conditions for derived equivalence of two connected components of an -cluster tilted algebra of type . The form of the diagonal matrix is restated in section 3.
Finally, in section 4, we give the algorithm which uses the results of section 3 to mutate any connected component of an -cluster tilted algebra to a particular -cluster tilted algebra, referred to as the normal form (to be defined in section 3), in such a way that a derived equivalence is achieved.
2. -cluster tilted algebras
We begin with a brief summary of the combinatorial background from [11, section 4],[14, section 4], [19].
The -co-ordinate system, on the translation quiver is defined as shown in the diagram below.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x1.png)
Remark 2.1.
This co-ordinate system is similar to the idea of the -th power of the translation quiver defined by Baur and Marsh in [4].
We now recall the definition of the mesh category associated to the translation quiver . The objects of this category are the vertices of and morphisms are the arrows of , subject to the mesh relations. For each arrow denote by the unique arrow . Notice that the uniqueness of follows from the bijection between the arrows starting at and the arrows ending at . The mesh relations are given by,
for each vertex .
Next for a vertex , where and , and as the vertices of enclosed by and on the boundary of the regions specified in the following figure.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x2.png)
Remark 2.2.
For any by the left boundary of we mean the set of all vertices on the boundary of to the left of the vertices and . The right boundary of is the set of all vertices on the boundary of to the right of and . We define left and right boundaries of similarly. Notice also that the regions and on describe the set of vertices from which (respectively, to which) there is a non-zero morphism in the mesh category associated to .
Define the following automorphisms on :
, | ||||
Further, .
Remark 2.3.
These automorphisms were considered by Iyama in [14] for .
Results by D. Happel show that for a quiver of Dynkin type the AR-quiver of the bounded derived category is isomorphic as a stable translation quiver to [13, I,5.6]. From this result it follows that as defined above in type is the action of the inverse of the suspension in expressed in terms of the -co-ordinate system. Also the automorphism on is the action of the AR-translate in expressed in terms of the -co-ordinate system. It is also proven in [13, I,5.6] that for a quiver of Dynkin type the mesh category is equivalent to , where is of type . Here denotes the subcategory of whose objects are the indecomposable objects of and whose morphisms are the irreducible morphisms between indecomposable objects in .
We can construct the quotient translation quiver by identifying the vertices of with their -shifts.
Now we present some polygonal combinatorics which appears in [11] in connection with the generalized cluster complexes of type . We denote by a (regular convex) -gon where .
Definition 2.4.
An -allowable diagonal in is a chord joining two non-adjacent boundary vertices which divides into two smaller polygons and which can themselves be subdivided into -gons by non-crossing chords.
We label the vertices of from 0 to in an anti-clockwise direction, then we denote diagonals in by where meets the at the vertices labeled and .
Remark 2.5.
In type the regular polygon will be an -gon. Notice however that the definition of -allowable diagonals and also the next lemma 2.6 do not require us to choose a specific value for .
The following lemma is easy to prove.
Lemma 2.6.
A regular convex -gon, , can be divided into convex -gons by non-crossing diagonals if, and only if, .
Lemma 2.6 implies that an -gon, , can be divided into -gons by non-crossing -allowable diagonals.
Remark 2.7.
We can define a simplicial complex with vertex set the -allowable diagonals of . Two -allowable diagonals are compatible if they do not cross in the interior of . The -cluster complex of type is isomorphic as a simplicial complex to the clique complex with respect to the above notion of compatibility for the set of -allowable diagonals of an -gon [11, sec. 4.1]. The original definition of -cluster complex of type given in [11] by Fomin and Reading in terms of βgeneralizedβ root systems.
Proposition 2.8.
There is a bijection
given by where denotes the set of vertices of the translation quiver and denotes the set of all -allowable diagonals of a regular convex -gon.
Also, we have that the subset,
(where is the canonical projection) is the set of -allowable diagonals crossing in .
Remark 2.9.
Notice that if any collection of -allowable diagonals in a division of share a given vertex then when considered as vertices of under they must have a common co-ordinate. This will be used in the proof of 2.16.
The next result appears in [6, sec. 1] (for , but which holds for any value of ) relates the mesh category associated to the quotient translation quiver to the full subcategory category of .
Proposition 2.10.
Let be any quiver of Dynkin type . Then is equivalent to the mesh category associated with .
Remark 2.11.
Notice also that it follows from the mesh relations and the equivalence in proposition 2.10 that the spaces in the -cluster category of type are at most one dimensional.
From now on let denote a regular convex polygon with vertices. Any division of by -allowable diagonals will be assumed to be maximal and all -cluster-tilted algebras will be of type . We will denote by the -cluster category . Given a division, , of a regular convex -gon into -gons by non-crossing -allowable diagonals we describe a finite quiver, . We also describe a set of relations, , in the path algebra, , and show the algebra is isomorphic to an -cluster-tilted algebra. We will show that all -cluster-tilted algebras can be realized in this way.
Let denote the set of -allowable diagonals in a division of . The vertices of the quiver
are in one-to-one correspondence with the elements of . For any two vertices and in , there is an arrow if and only if:
-
(1)
the corresponding -allowable diagonals, and share a vertex in the -gon.
-
(2)
and are edges of the same -gon in the division.
-
(3)
follows in a clockwise direction.
Example 2.12.
Here is shown for a particular division of a (5+1)+2=8-gon.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x3.png)
In [21] the following statement is proven.
Proposition 2.13.
There exists a bijection between the maximal divisions of by -allowable diagonals and the -cluster-tilting objects in the cluster category .
The result also follows from [18, thm 1.01].
For a given division of let denote the corresponding -cluster-tilting object under the bijection of proposition 2.13 and let denote the -cluster-tilted algebra.
Proposition 2.14.
The quiver is the quiver, , where .
Proof.
For an -allowable diagonal in let denote the indecomposable object of which corresponds to the vertex of the mesh category associated with .
Since by proposition 2.8 we have a bijection and, by proposition 2.10, the category is equivalent to the mesh category of it follows that if two -allowable diagonals and share a vertex of then there must be a non-zero map, say, between the corresponding indecomposable summands and of the -cluster-tilting object, . Indeed, if two -allowable diagonals, and , share a vertex of then they correspond under to vertices, and say, of which have a common co-ordinate. We assume without loss that .
Then will be irreducible if and only if and are part of the same -gon in the division of . Notice that if and lie in different -gons but, as we assume, share a vertex of then a third -allowable diagonal, , must exist which also meets at the vertex shared by and . There would then exist non-zero maps from to and from to , but since there is a common co-ordinate we must have that the composition of the non-zero maps and is equal to .
The definition of ensures that the non-zero map between exists if follows in a clockwise direction around the -gon.
Notice that it is not possible for other arrows to exist since they would have to correspond to irreducible morphisms on the mesh category.
β
Next we define . Given consecutive arrows in we define the path to be zero if , and are in the same -gon in the division of . Let denote the ideal in the path algebra generated by such relations.
Example 2.15.
Here are two examples showing the quiver and relations for two different 2-allowable divisions of a -gon.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x4.png)
The following proposition was known for the case [10], here we state the result for .
Proposition 2.16.
The algebra k/ is isomorphic to the -cluster-tilted algebra .
Remark 2.17.
In the proof of the proposition whenever we refer to we mean , that is we regard the region as a subset of . Also, when we refer to an -allowable diagonal we will use the same notation for the -allowable diagonal as the vertex of
Proof.
Suppose that , and are -allowable diagonals which are part of the same -gon arranged as follows,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x5.png)
so that and share a vertex of , and share a vertex of but , and have no common vertex.
We know by proposition 2.14 that there are arrows and in corresponding to irreducible maps between the indecomposable summands and , and and respectively.
We claim that the composition of these irreducible maps between is zero in the -cluster category. It is enough to show that , the claim then follows from proposition 2.10.
Since and share a co-ordinate we have that lies on the left boundary of and similarly, lies on the left boundary of . Notice that since , and have no common vertex it follows that cannot lie on the part of the left boundary of which overlaps with the left boundary of . Now since does not cross we have that so that lies on the left boundary of but cannot lie in any part of . Therefore the composition must be equal to zero in and so in we have .
It follows from the above that . Finally, we claim that . To see that this is the case it is enough to show that no commutativity relations exist in and that the composition of two arrows in not in the same -gon is not a relation.
First we consider commutativity relations. Suppose that an -cluster-tilting object has two indecomposable summands and so that there exist two distinct non-zero paths between the corresponding vertices, and of . Then the mesh relations dictate that or vice versa, which is impossible since and do not cross.
Now suppose that and are two arrows in such that the path is defined and and lie in different -gons in some division of . Then we must have that and have a common vertex so that and lie on the left boundary of . Hence the composition is not a relation in .
β
We have now proven that / is isomorphic to the -cluster-tilted algebra corresponding to . Since every -cluster-tilting object can be described by a division of [21] every -cluster-tilted algebra can be realized in this way.
Remark 2.18.
Notice that in the proof of proposition 2.16 if then the -allowable diameters , and must form a triangle so that there exists an irreducible map making a three cycle. We collect the following easy consequences of 2.16,
-
(1)
the only possible cycles which can occur in / are -cycles with full relations, that is all paths of length two in any -cycle are relations.
-
(2)
for -cluster-tilted algebras of type , , relations can occur outwith cycles.
-
(3)
there can exist at most consecutive relations outwith a cycle.
It is known for 1-cluster-tilted algebras of Dynkin type that the relations are determined by the quiver [8]. The next example shows that this is not the case for -cluster-tilted algebras of type , .
Example 2.19.
This example shows that the quiver can arise as the quiver of two different 2-cluster-tilted algebras of type .
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x6.png)
Note that the figure in example 2.15 provides two more examples.
3. Tilting complexes and elementary moves
The remainder of this paper will demonstrate theorem 1.2.
We begin with the following observation.
Proposition 3.1.
-cluster-tilted algebras of type are gentle for any .
Proof.
The result follows from considerations of the possible divisions of , the regular -gon. Let be a division. It is clear that there can be at most two arrows starting or ending at a given vertex of . The following figures make the other required properties clear.
β
Remark 3.2.
See [2], for example, for the definition of a gentle algebra.
Suppose that we have some division of . Notice that each -allowable diagonal, , is a common edge of two -gons and that for a given (as in figure the next example) there are -allowable diagonals of which we view as anti-clockwise βrotationsβ of inside the two -gons of which it is an edge. This is a generalization of the well know concept of quadrilateral exchange in triangulations of polygons, indeed quadrilateral exchange is the case.
It is clear that for any given -allowable diagonal, , there exist distinct -allowable diagonals which could replace and provide a distinct division of .
Example 3.3.
The next figure shows an example of the possible replacement 2-allowable diagonals for in a regular hexagon.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x10.png)
Definition 3.4.
Suppose that is a maximal division of by -allowable diagonals. Fix a presentation of in the plane. For any chosen -allowable diagonal, , in we define an operation . This operation βrotatesβ in an anti-clockwise direction inside the two -gons in the division of of which it is a common edge. Thus we have,
and
where are the -allowable diagonals which are the βrotationsβ of . Every , , can replace and achieve a distinct division of as described above. Further we define, . We call and elementary polygonal moves.
For the most part we will be interested in applying or which can be thought of as βrotationsβof an -allowable diagonal in the anti-clockwise and clockwise directions respectively. Given a division of we can apply the elementary polygonal moves to the -allowable diagonals in the division to create distinct divisions. As in section 2 an -cluster-tilted algebra can be associated with the original division and with the new division and we say that we have mutated the algebra corresponding to the original division to the algebra corresponding to the new division.
Remark 3.5.
can be thought of as the quiver mutation operation in a 1-cluster-tilted algebra of type via the approach of [10]. Since for 1-cluster-tilted algebras of Dynkin type the quiver determines the relations [8], it is possible to define without reference to relations for 1-cluster-tilted algebras. For -cluster-tilted algebras of Dynkin type this is no longer possible since the quiver does not determine the relations (as we have seen in example 2.15).
Example 3.6.
We illustrate the algebra mutation induced by the elementary polygonal moves with an example. The algebra mutation shown is achieved by applying at the vertex circled in the first quiver.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x11.png)
In the above figure the numbers 1-6 denote where the division continues arbitrarily, the labels denote the corresponding parts of the quiver with relations. The edges in the polygonal configurations shown in bold typeface are edges of .
We now wish to show that using the elementary polygonal moves we can induce algebra mutations such that the original and new -cluster-tilted algebras are derived equivalent. The following theorem, due to Bessenrodt and Holm [5] plays a crucial role in determining when this is possible.
Theorem 3.7.
[5, thm 4.1,cor 4.3] Let be a gentle algebra with and being the number of cycles of even length with full relations and the number of cycles of odd length with full relations respectively. Then the Cartan matrix, , is unimodular equivalent to a diagonal matrix of the form:
where there are 2βs and 0βs on the diagonal
Recall that the Cartan matrix for a finite dimensional algebra is given by where . Here is a principle idempotent and are the indecomposable projectives.
With the above conventions the columns of the Cartan matrix are the dimension vectors of the indecomposable projective right modules. For an -cluster tilted algebra of type we have the following basic properties of the Cartan matrix which follow from the combinatorial descriptions in section 2.
-
β’
The entries of are either 0 or 1.
-
β’
There are at most entries which are 1 in any given row or column. In the case where there are entries which are 1 in some column then the -cluster tilted algebra in question is isomorphic to the path algebra of the linear orientation of the Dynkin diagram .
-
β’
For a vertex in a cycle there are at least two entries which are 1 in the -th row.
It is well known that the unimodular equivalence class of the Cartan matrix of a finite dimensional algebra is a derived invariant. Therefore since the -cluster-tilted algebras of type are gentle we have, by theorem 3.7, that any two -cluster-tilted algebras which are derived equivalent have the same number of -cycles. Hence in order to mutate an -cluster-tilted algebra and induce a derived equivalence we must ensure that we preserve the number of -cycles.
Remark 3.8.
It is not always possible to induce a derived equivalence by applying the elementary polygonal moves, for example applying at the circled vertex in figure in example 3.6 would not preserve the number of cycles and so the mutated algebra would not be derived equivalent to the original algebra.
It is our aim to show that each connected component of an -cluster-tilted algebra with a given number, of -cycles is derived equivalent to the following normal form having the same number of -cycles.
Definition 3.9.
We define the normal form to be the following finite dimensional algebra given as a quiver with relations:
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x12.png)
In the normal form shown the vertices in the region labeled A are called vertices of type A while those in the region labeled B are called vertices of type B. The vertices which connect cycles to each other or to the linear part of the quiver are not included in either region A or region B (the same holds for the extreme left vertex).
The cycles are -cycles and have full relations (see section 2). The number of -cycles is , for some . The total number of vertices is .
If is even then there are vertices of types A and B per cycle. If is odd there are vertices of type B and vertices of type A per -cycle.
We remark that there are other possible choices for the normal form in which the number of vertices of types A and B would be different.
To prove our claim that all connected components of -cluster-tilted algebras are derived equivalent to the quiver with relations specified by the normal form we employ mutations induced by the elementary polygonal moves which result in derived equivalent original and mutated algebras.
Shortly we give a list containing local descriptions of some algebra mutations induced by the elementary polygonal moves which preserve the number of -cycles occurring in the quiver of an -cluster-tilted algebra. We will use these extensively in section 4. Before presenting the list some explanation of the information contained in the figures below is required.
Denote by the original -cluster-tilted algebra and by the mutated algebra. Each figure contains four diagrams. Two of these are parts of quivers with relations, the first of which is some local situation in . The circled vertex in this first diagram denotes the vertex of the quiver at which the algebra mutation corresponding to the elementary move takes place. The second of the quiver diagrams shows the resultant local situation in . The curved dotted line appearing in both quiver diagrams indicates an -cycle.
The third and fourth diagrams are the local polygonal configurations corresponding to and respectively. The dashed line in the fourth diagram illustrates the new position of the -allowable diagonal corresponding to the mutation vertex after the application of an elementary polygonal move.
The edges which appear in bold typeface correspond to boundary edges of . It should be noted that one edge in bold typeface may correspond to as many as edges of . Each figure is general in the sense that it is independent of the values of and , though of course we assume is large enough to allow the configurations we show to exist.
In some figures we may make further assumptions on the quiver of , if this is the case then these assumptions will be stated in a short remark.
The which sometimes appears below the numbering denotes a mutation which has arisen from at the mutation vertex.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x13.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x14.png)
There is no relation involving an arrow in and the arrow going into the mutation vertex (and not in the cycle) which is shown.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x15.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x16.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x17.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x18.png)
In the two figures immediately above we assume that there is no relation involving an arrow in and the arrow into, or our of, the mutation vertex.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x19.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x20.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x21.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x22.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x23.png)
Here we assume there is no relation between an arrow from and the arrow going into the mutation vertex (which is not in the cycle) and that there is no relation between the arrow going out of the mutation vertex (which is not in the cycle) and any arrow in .
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x24.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x25.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x26.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x27.png)
There is no relation involving an arrow in and the arrow going out of the mutation vertex (and not in the cycle) which is shown.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x28.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x29.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x30.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x31.png)
In the two figures immediately above we assume that there is no relation involving an arrow in and the arrow into, or our of, the mutation vertex.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x32.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x33.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x34.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x35.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x36.png)
Here we assume there is no relation between an arrow from and the arrow going into the mutation vertex (which is not in the cycle) and that there is no relation between the arrow going out of the mutation vertex (which is not in the cycle) and any arrow in .
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x37.png)
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x38.png)
There are two groups of diagrams. The first group are those numbered (i) to (xiii). The second consists of the remaining figures (xiv) to (xxvi). The two groups will be used at different stages in the algorithm described in section 4 which reduces any connected component of an -cluster-tilted algebra of type to our chosen normal form in definition 3.9.
Remark 3.10.
Notice that in the above list some of the figures may be viewed as simplified versions of another figure. For example figure (i) is a simplified version of figure (iii). To realize figure (i) from figure (iii) we delete the parts of the quiver which are not needed, namely and the arrow into . In more complex examples such simplifications may not be immediately apparent. We include the longer list to facilitate checking the algorithm in section 4.
In order to demonstrate that in each of the local algebra mutations above the original and mutated algebras are derived equivalent we now provide explicit tilting complexes which achieve this. There are two such complexes, one corresponding to each of the elementary polygonal moves in definition 3.4.
Before stating the next theorem we must define the notations used. Let be an -cluster-tilted algebra and let denote the finitely generated projective right -module, where is the primitive idempotent corresponding to (the set of vertices of ).
Suppose we mutate to via an elementary polygonal move, then we distinguish certain vertices in . We denote by the mutation vertex. If there exist arrows in whose target is then we label the source and the arrow , where (since is gentle there can be at most two ingoing and two outgoing arrows). We denote by , , the targets of any arrows out of and label such arrows . Since the -cluster-tilted algebras in this case are gentle we may adopt the convention that should the paths and exist they are zero.
Further, should there exist an arrow such that then we label the source of by . Similarly, if there exists an arrow such that then we label the target of by .
Next, denotes the full subcategory of finitely generated projective right -modules; denotes the homotopy category of bounded complexes of finitely generated projective right -modules; and is the bounded derived category of finitely generated -modules. Our last notational convention is that given an arrow between any two vertices , the map between the projective indecomposable -modules induced by left multiplication by will also be denoted .
Part of the proof of theorem 3.12 (and part of the proof of theorem 3.15) involves determining the existence of maps between certain indecomposable summands of a tilting complex. In order to do this we use Happelβs alternating sum formula [13, chapter III, 1.3, 1.4].
Theorem 3.11.
[13] For a finite dimensional -algebra let and be complexes in . Then,
. In particular if and are direct summands of a tilting complex then,
The next two results prove that when the elementary polygonal move defined in definition 3.4 is applied in the figures labeled (i)-(v),(viii)-(xiii),(ixx) and (xxi) above there is a derived equivalence between the initial algebra and the new algebra .
Theorem 3.12.
Suppose is a connected -cluster-tilted algebra of type in which we can perform at a given vertex, , and preserve the number of -cycles and connectedness. Then then following complex, , in , where is in degree 1, is a tilting complex.
Moreover, the endomorphism algebra, , of can be obtained from using the following algorithm:
-
(1)
reverse all arrows going into the mutation vertex.
-
(2)
if there exist arrows (which is non-zero by definition), there must exist an arrow in and the arrow does not exist in , .
-
(3)
if there exist arrows such that the composition is zero, the arrow factors over in , .
-
(4)
relations in around the mutated vertex are described by the following diagrams. If arrows and relations exist around the mutation vertex in as shown in the first diagram then the second diagram shows the new arrows and relations between the corresponding vertices of .
Remark 3.13.
In the last part of the algorithm to determine the endomorphism algebra of the tilting complex in theorem 3.12 it should be noted that we do not suggest that the local configurations shown must exist at the mutation vertex, rather we show the arrows and relation which, if they exist, are altered by the mutation. The second diagram describes the new configuration of arrows and relations. It is clear that the mutations in figures (i)-(v),(viii)-(xiii),(ixx) and (xxi) satisfy the conditions of theorem 3.12.
Proof.
First we prove that is indeed a tilting complex. In other words we prove that , for all (recall implies , for all [17, 2.5]) and that the subcategory generates as a triangulated category (see [17, 3.2] for definition of tilting complex).
The indecomposable direct summands of are:
where the βs are in degree zero for and is in degree 1.
Obviously, for some and . It is also clear that for all .
Note that for -cluster categories of Dynkin type the dimension of the non-zero spaces in the -cluster category is at most 1 by remark 2.11. When proving that certain spaces are zero in we consider basis elements and show they are homotopic to zero. For two vertices and of such that there is a non-zero path from to in we always choose the map induced by the path as our basis of .
Consider for all and let be a basis. Since must start with either or we have that the diagram,
commutes if and only if is the zero map. Therefore, for all .
Next consider for all and let be a basis. Since must end with either
or we have that chain map,
is homotopic to zero via the homotopy where and is the inclusion , . Thus, for all .
Finally, we examine . Since the maps and are a basis for the homotopies,
ββββββ |
ββββββ |
show that . Hence, , for all , .
Now we check that generates as a triangulated category.
It is clear that the stalk complexes,
(where denotes the complex concentrated in degree with the only non-zero term)
are in , , and therefore are in the triangulated category generated by . We require that are also in the triangulated category generated by .
Consider the morphism ,
The mapping cone, , of (see [17, section 2.3] for definition) is,
where is in degree -1. So that,
Define the following maps and :
Then is:
so that is homotopic to zero by the following map,
where .
It is clear that . Hence, in .
It now follows that generates as a triangulated category and so we have proven that is a tilting complex.
Since has finitely many indecomposable summands the endomorphism algebra, , of can be expressed as a finite quiver with relations denoted by . The vertices of the quiver are in one-to-one correspondence with the indecomposable summands, , of . To see that the endomorphism algebra is described by the algorithm in the statement of theorem 3.12 we examine each step separately. Let denote the Cartan matrix of and let , where , be the Cartan matrix of .
reverse all arrows going into the mutation vertex
Given an arrow there is a morphism of complexes given by:
where is the projection map. There is an arrow in the quiver of corresponding to the morphisms since it is not possible for this morphism to factor non-trivially through another summand of .
Indeed if the morphism above factors non-trivially through another summand of then there will exist some vertex in such that and .
Theorem 3.11 states that , where the βs denote entries of the Cartan matrix of , and that .
Suppose that . Now there are two possible cases. If then it is possible that , to see this consider two 3-cycles which share a vertex. Mutating at this shared vertex gives and . If then we must have that and . Therefore, and so the morphism corresponds to an arrow in the quiver of .
A similar argument shows that the morphism corresponds to an arrow in the quiver of .
if there exist arrows , there must exist an arrow in .
Suppose that there is a non-zero path in . Then we have the following morphism:
We claim this morphism corresponds to an arrow in the quiver . Again we must be sure that the morphism does not factor through another summand of . We look for a such that and . There are two cases.
First let . Then by theorem 3.11 . Hence the morphism does not factor through .
Now suppose that and that . There must be a non-zero path to in . Such a path must be through and but cannot end at either of these vertices (since ). Therefore no non-zero path from this back to exists so .
Hence we have shown that the morphism does not factor. Again, the same argument can be applied to non-zero paths in .
if there exist arrows , the arrow factors over in
If is the map induced by the arrow in then the morphism:
can be factored,
We must show that the morphism
corresponds to an arrow in . If this morphism were to factor non-trivially over a summand of then there exists some such that and .
Suppose that then we must have that (otherwise the quiver of would have a cycle which is not oriented) so that .
Similarly for arrows in such that the composition is zero.
other arrows
All other arrows in are transferred directly to since theorem 3.11 gives that for .
relations
To see that the relations described in theorem 3.12 occur in we check them individually. We demonstrate the relations in between arrows between the vertices . The same arguments apply to the description of the relations between arrows between the vertices .
Let denote the arrow in the quiver of such that the path . Then the arrow induces a morphism,
such that the composition,
is zero.
Next let denote the arrow in the quiver of such that the path . Then the arrow induces a morphism ,
so that the composition ,
is zero.
Consider the composition of ,
We have the following homotopy,
Hence the composition is zero in and, hence, in .
We can now describe all relations in the endomorphism algebra of the complex . Since the class of gentle algebras is closed under derived equivalence, [20], is gentle. Therefore is generated by zero relations of length two and we have that for each arrow in the quiver of there exists at most one arrow such that and at most one arrow such that .
Relations between the vertices of not labeled by
, are the same as those for . Indeed, let be two such vertices. The indecomposable summands of corresponding to these vertices are stalk complexes of the form,
where are the indecomposable projectives corresponding to vertices in .
For such , theorem 3.11 gives the entries of the Cartan matrix are . Hence, zero relations between arrows connecting vertices not labeled , in the quiver of are exactly the same as those between arrows connecting vertices not labeled , in .
Since we have already described the arrows and relations between the vertices of labeled , it only remains to check relations which are compositions of arrows coming into , and the arrow and relations which are compositions of the arrow and arrows out of .
Suppose that the path is zero in then the following composition of morphisms,
(which corresponds to arrows) is zero in . Also if there is a zero path then the composition of morphisms,
(which corresponds to arrows) is zero in . Similarly for .
Note that since is gentle any relations involving arrows into, or out of, vertices labeled must be those we have already described. Hence we have described all possible relations in .
This concludes the proof of 3.12.
β
The next result relates the elementary moves and the associated algebra mutations to the tilting complex just defined.
Proposition 3.14.
Let be an -cluster-tilted algebra which has a local configuration of type (i)-(vi), (viii)-(x) or (xv). Then the mutated algebra is isomorphic to , where is the tilting complex in theorem 3.12. Hence and are derived equivalent.
Proof.
We are required to prove that the elementary polygonal move performed at the mutation vertex of produces an algebra which is isomorphic to .
We will show that the algorithm in theorem 3.12 describes exactly how to produce from .
To see that the arrows going into are reversed consider the following local situation,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x40.png)
Here we have labeled the -allowable diagonals with the notations of theorem 3.12. We make no assumptions on the division of beyond what is shown, and as such we only show the three possible -allowable diagonals of relevance to this step. The same is true for the local configurations which correspond to the second and third parts of the algorithm in theorem 3.12.
Next we examine the second step of the algorithm which states that if the path exists in then we must have an arrow in the quiver of , the mutated algebra and the arrow does not exist in . Again we show the local configuration of relevance in the division of , the regular -gon.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x41.png)
Finally, if the following vertices and arrows exist in ,
where , and , . Then we have the following local configurations in before and after the application of ,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x42.png)
so that the relations in the last part of the algorithm in the statement of theorem 3.12 are satisfied.
Hence we have shown that and are isomorphic algebras.
β
Thus we have demonstrated that in the local configurations labeled (i)-(vi),(viii)-(x),(xv) we have a derived equivalence between the algebra and the mutated algebra .
It remains to prove the same result for moves (vi),(vii),(xiv)-(xviii),(xx), and (xxii)-(xxvi) which are applications of the elementary polygonal move defined in definition 3.4. The following two results achieve this. We will keep the notations used in theorem 3.12.
Theorem 3.15.
Suppose is a connected -cluster-tilted algebra of type in which we can perform at a given vertex, , and preserve the number of -cycles and connectedness. Then the following complex, in , where is in degree 0, is a tilting complex.
Moreover, the endomorphism algebra, , of can be obtained from using the following algorithm:
-
(1)
reverse all arrows outgoing from the mutation vertex.
-
(2)
if there exist arrows , there must exist an arrow in and the arrow does not exist in , .
-
(3)
if there exist arrows , the arrow factors over in , .
-
(4)
relations in around the mutated vertex are described by the following diagrams. If arrows and relations exist around the mutation vertex in as shown in the first diagram then the second diagram shows the new arrows and relations between the corresponding vertices of .
Remark 3.16.
Proof.
The proof is exactly analogous to the proof of theorem 3.12. β
The next result is the analogue of proposition 3.14.
Proposition 3.17.
Let be an -cluster-tilted algebra which has a local configuration of type (vi),(vii),(xiv)-(xviii),(xx), and (xxii)-(xxvi). Then, if denotes the mutated algebra, is isomorphic to , where is the tilting complex in 3.15. Hence and are derived equivalent.
We have now proven that in the algebra mutations described in the local configurations (i)-(xviii) and are derived equivalent.
Now we describe a very useful tilting complex. Suppose the following local configuration in an -cluster-tilted algebra ,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x44.png)
where there are no paths between the regions of labeled and ; is a relation for ; and there are no arrows (other than those shown) incident at vertices . We assume also that in the configuration shown the string of consecutive relations is maximal, that is if there is an arrow such that the composition,
is a relation then there must be some other arrow incident at vertex . Also, if there is an arrow such that the composition,
is a relation there must exist another arrow incident at vertex . Notice that vertices 0 and lie in regions and respectively.
For a vertex we define to be the stalk complex,
where is in degree 0. For a vertex we define to be the stalk complex,
where is in degree q. Next for define to be the complex,
Then we have the following proposition.
Proposition 3.18.
Let be an -cluster-tilted algebra where the local configuration described above exists. Then we have a tilting complex whose indecomposable summands are , and , . The endomorphism algebra, , is given by preserving all arrows and relations between the vertices of regions and and making the changes shown in the following figure to the arrows and relations between vertices .
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x45.png)
Remark 3.19.
This tilting complex will be used in section 4 to help reduce the connected components of -cluster-tilted algebras to the normal form. Its key feature is that it removes the relations , .
Proof.
First we prove that , . It suffices to show that , .
Let be a vertex in the region . Then we claim that for ,
for all vertices . If then it is clear that . If then since there are no non-zero paths from to in .
Also for a vertex we claim that for ,
for all vertices . If then clearly . If then we have since there are no non-zero paths from region to region .
Now consider , . If then since there are no non-zero paths from an vertex in to vertices . If then clearly . It remains to check that .
First, for any two vertices and of such that there is a non-zero path in from to we choose the map between and induced by the path to be a basis of . We can always do this since the spaces in the -cluster categories of type have dimension at most 1.
So, if there exists a non-zero path from some vertex to vertex 1 as follows,
then we have the following homotopy,
where is a basis of and and . Hence,
and we have proven that , .
Next we show that , , and . If then the claim is clearly true. If then since there are no non-zero paths in from vertices to any vertex in region .
We also have that , . If then it is clear that . If then since there are no non-zero paths in from vertices to any vertex in region . Next consider, for any vertex . If then it is clear that . If then we have that since there are no non-zero paths in from the vertices in region to vertices
.
It remains to prove that , . For or there are no possible non-zero morphisms so in these cases .
Next we consider . There are two separate cases.
First let and let be a non-zero morphism. We now prove that is homotopic to zero. Let , be the first non-zero component of the map . We can assume that this is the case by scaling the morphism appropriately.
The following figure illustrates the construction of the homotopy. The component of the homotopy must be the zero map, therefore to satisfy the definition of a homotopy must be the identity. There are now two possibilities for either it is zero, in which case , or it is not, in which case . In both cases we have that is a scalar multiple of the identity so we can write . We can continue to construct the components of the homotopy in this manner, at each stage we can deduce that where . The next figure shows the homotopy we have described.
Eventually we encounter the following situation.
So we have that setting , defines a homotopy and therefore since was arbitrary .
Now we consider the second case, that is assume now that . By theorem 3.11 we have that,
where is the degree term of and is the degree term of .
It follows that,
where the are entries of the Cartan matrix of . Note that for we have if . Also, if .
Therefore, if we have that .
We have now proven that , . Arguments similar to those used in theorems 3.12 and 3.15 give that generates as a triangulated category and so is a tilting complex.
Next we must describe . First we note that arrows and relations between vertices of the quiver of corresponding to the s are the same as the arrows and relations between vertices of type in the quiver of . Similarly, the vertices of the quiver corresponding to the s are the same as the arrows and relations between vertices of type in . To see this let denote the entries of the Cartan matrix of and consider . By theorem 3.11 we have that . Also for theorem 3.11 gives .
Next consider the following morphism , ,
By theorem 3.11 we can easily deduce that (the argument is similar to the argument above which shows that ). Therefore we can assume that is a basis for .
If is to correspond to an arrow in we must show that it does not factor over another summand of .
If were to factor over a summand of then there would exist some such that and . Note that for any there are no non-zero morphisms , hence its is not possible for to factor over any .
Now let and consider . Then by theorem 3.11 . There are two possible cases. The first is that and the second is that . In either case so that does not factor over any .
It remains to show that does not factor over any , , . Let and consider a morphism . We claim that this morphism is zero. Suppose that is non-zero and that is the last non-zero component of the morphism , then by scaling we can assume that is the identity. The following diagram shows that cannot be a morphism and hence we have a contradiction.
It follows that
the map does not factor over , . Similarly, the map cannot factor over , and so we have proven that corresponds to an arrow in the quiver of , .
Next consider the non-zero morphism ,
If this morphism were to factor over a summand of then there would exist some such that and . It is clear that if is a vertex in region or if then . Now let be a vertex in region . Then by theorem 3.11 we have that . Hence it is not possible that and , since this would create an configuration in , the quiver of , which would contradict the description of -cluster-tilted algebras in section 2.
It remains to state that there are no relations in of the form for some and that any relation of the form in is preserved in . Both of these statements are clear when we consider the following compositions of morphisms. We have scaled the morphisms where we can.
We have now completed the proof of the proposition since by [20] we know that is gentle, so there are no other possible relations to describe. β
This complex and the derived equivalence it induces will be important in our reduction of a connected component to the normal form.
Example 3.20.
We include explicit examples of one of each of the three types of tilting complexes we have outlined in this section. The figures are followed by the relevant tilting complex.
An example of the tilting complex in theorem 3.12.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x46.png)
An example of the tilting complex in theorem 3.15.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x47.png)
An example of the tilting complex in theorem 3.18.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x48.png)
We give the indecomposable summands for the tilting complex relating to the above figure.
and the terms are in degree 0.
and the terms are in degree 4.
where the term always lies in degree zero.
4. Reduction to Normal Form
In this section we provide the procedure to reduce any connected component of an -cluster-tilted algebra, , to the normal form, defined in definition 3.9, using the local mutations (i)-(xxvi) from section 3. Once this procedure has been demonstrated, we will have proven theorem 1.2.
Theorem 4.1.
Every connected component with -cycles and simple modules is derived equivalent to the normal form,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x49.png)
where there are cycles and a total of vertices.
Proof.
Let be as in theorem 4.1. The following algorithm proves theorem 1.2 when combined with theorems 3.12, 3.15 and proposition 3.18.
We assume that the quiver of contains at least one -cycle. We will see later how to deal with a connected component which has no -cycles.
Since every -cluster-tilted algebra, can be described by a maximal division of a regular convex -gon, , by -allowable diagonals (see section 2) it follows that in the quiver, , of there exists a -cycle which is connected by paths in to other -cycles through at most one vertex. Such a cycle will be called an initial cycle. Notice that initial cycles need not be unique and if has only one cycle this cycle is clearly initial.
It is important to note that in the following that whenever we apply the elementary polygonal move in the polygon and consider the corresponding algebra mutation we achieve a derived equivalence via theorem 3.12. Similarly, whenever we apply the elementary polygonal move in and consider the corresponding algebra mutation we achieve a derived equivalence via theorem 3.15.
Now choose an initial cycle and label the vertices as follows. The vertex which is (potentially) connected to other cycles will be labeled 0 and the other vertices are labeled in an anti-clockwise direction around the cycle (that is, in the opposite direction to the orientation which we take to be clockwise).
Starting at vertex initiate the following algorithm:
-
(1)
if there exists an arrow into vertex which is not part of the initial cycle then perform at this vertex. That is, apply the elementary move , defined in definition 3.4, to the -allowable diagonal corresponding to vertex in the division of which is associated with . The possible local configurations and resultant algebras relevant to this step are shown in figures (ii) and (x)-(xiii).
Remark 4.2.
Note that figure (xiii) shows two -cycles which share a vertex. The mutation vertex is this shared vertex and the mutation shown corresponds to . This situation is actually a special case of figure (xi), namely the case where the quivers labeled and join together. Figure (xii) is also a special case of figure (xi). The list of figures is extended for clarity, since it may not be immediately apparent that some figures are special cases of the others. For example, figures(i), (iii) and (iv) could also be united into a single diagram.
-
(2)
if there exists no such arrow, but there exists an arrow out of which is again not part of the initial cycle perform at the target of this outgoing arrow, except where we encounter the configurations shown in (vi) and (vii). In the these cases we must apply . The possible local configurations and resultant algebras relevant to this step are shown in figures (i), (iii), (iv), (v), (vi), (vii), (viii) and (ix). There is one other situation which can occur and must be treated slightly differently. Suppose that the following local situation occurs:
Namely, from vertex we have an oriented path of length where in which each composition of two consecutive arrows is a zero relation.
We can apply proposition 3.18 to achieve a derived equivalence with an algebra with the following local configuration:and elsewhere has the same quiver with relations as our original algebra.
-
(3)
repeat steps one and two until there are no arrows into or out of which are not part of the initial cycle.
-
(4)
repeat the first three steps for vertex , unless in which case stop.
Remark 4.3.
Suppose at a given vertex of the initial cycle we have an arrow out of which is not part of the initial cycle then the application of the second step always serves to create a situation where there is an arrow into which is not part of the initial cycle and so the first step can then be applied.
The algorithm halts when there are no arrows which are not part of the chosen initial cycle into or out of vertex .
To complete the procedure we only use local moves (i)-(xiii), as listed in section 3, and proposition 3.18. After the application of the above steps only vertex 0 has any arrows incident or outgoing which are not part of the initial cycle. We say that we have cleared the initial cycle.
Now assume that further -cycles exist in . We must choose and be able to clear the second -cycle.
It is convenient to choose an -cycle which is closest to the initial cycle (that is, this second cycle is linked to the initial cycle by a shortest un-oriented path in the quiver, but in general the next procedure works for an arbitrary choice).
Once the second -cycle has been chosen label its vertices as follows. Label the vertex which is connected to the initial cycle with 0. Next label the remaining vertices following the clockwise orientation of the cycle. Define vertices of type to be those which are numbered if is odd and those which are numbered if is even. Define vertices of type to be those labeled if is even and to be those labeled if is odd.
Remark 4.4.
We must ensure that our algorithm produces a quiver with the same arrangement of -cycles as in the normal form defined in definition 3.9. The above definition of vertices of types and will coincide with the definition of vertices of types and in definition 3.9. This is not clear now, but will become apparent in due course.
The algorithm used to clear the initial cycle is, in general, no longer sufficient to clear our chosen second cycle. However, it can still be applied to vertices in the second cycle of type . We must describe what to do at vertex 0 and at vertices of type in the second cycle.
At vertex 0 in the second cycle it is our aim to describe a procedure which results in the initial cycle and second cycle sharing a vertex, but which leaves the initial cycle otherwise unaffected. This procedure is made slightly more complicated by this requirement.
At vertex 0 in the second cycle initiate the following steps:
-
(1)
if there exists an arrow into the vertex 0 in the second cycle which is not part of the initial or second cycle then apply at 0 in the second cycle. If the arrow is the last arrow in a chain of consecutive relations, , then the index . If the arrow is not the last arrow in a chain of relations then . The possible figures relevant to this step are (ii), (x), (xi), (xii) and (xiii).
Remark 4.5.
We saw in section 2 that outwith an -cycle there can be at most consecutive relations.
-
(2)
if there exists an arrow out of the vertex 0 in the second cycle which is not part of the initial or second cycle then apply at 0 in the second cycle. If the arrow is the first arrow in a chain of consecutive relations, , then the index . If the arrow is not the last arrow in a relation then . The possible figures relevant to this step are (xvi), (xxiii)-(xxvi).
-
(3)
repeat steps one and two until there are no arrows into or out of 0 which are not part of the initial cycle or second cycle.
The result is that now the quiver of consists of the initial -cycle which is connected at one vertex to the second -cycle. In the initial cycle there are no arrows into or out of vertices which are not part of the initial cycle (with the sole exception of the vertex connected to the second cycle). Notice that, unlike the initial cycle, the second -cycle can be connected to many other -cycles.
Next, to clear the vertices of type (that is vertex , or , if is odd or even respectively) we apply exactly the same procedure as when clearing the initial cycle. We always begin with and proceed to where or if is odd or even respectively.
Once the process has been applied at all vertices of type there will be no arrows into or out of these vertices which are not part of the second cycle.
We require a different set of instructions to clear the vertices of type without affecting the already cleared initial cycle.
Starting at vertex initiate the following procedure.
-
(1)
If at vertex there is an arrow out of which is not part of the second cycle then apply at . The possible local configurations and resultant algebras relevant to this step are shown in figures (xiv), (xv) and (xxiii)-(xxvi).
-
(2)
If there exists no such arrow, but there is an arrow into vertex which is not part of the second cycle then apply at the tail of this incoming arrow, except where we encounter the configurations shown in (ixx) and (xxi) where we must apply at the tail of the arrow. The possible local configurations and resultant algebras relevant to this step are shown in figures (xvi)-(xxii).
Note that not all configurations can be cleared from vertex using the above steps. In particular if we have a local configuration of the following type:Namely, into vertex we have an oriented path of length where in which each composition of two consecutive arrows is a zero relation.
We can apply proposition 3.18 to achieve a derived equivalence with an algebra with the following local configuration:and elsewhere has the same quiver with relations as our original algebra.
-
(3)
repeat steps (1) and (2) for vertex , where if is odd and if is even.
Once we have applied the above algorithm for vertices of type to the second cycle we have shown that is derived equivalent to an algebra whose quiver has two -cycles which share a vertex. These two cycles are connected to other parts of the quiver only through one vertex of the second cycle in such a way that vertices of type and coincide with the definitions in 3.9.
Now we simply choose a third cycle (if it exists) in exactly the same way as we chose the second cycle. The same reduction algorithm can be applied to the third cycle. Indeed, we may continue to choose and clear cycles as described above until there are no more -cycles. Therefore, we have been able to apply successive mutations to to achieve,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x54.png)
so that is derived equivalent to this algebra. Let denote the above algebra.
Finally, it remains to prove that we can reduce the portion of the quiver which contains no -cycles to the linear orientation with no relations, whilst maintaining derived equivalence at each step. We restrict to using the mutations induced by the elementary polygonal moves and and so ensuring a derived equivalence at each stage by theorems 3.12 and 3.15 respectively. Notice that this part of the algorithm is the only part needed if has no -cycles, a possibility we have ignored till now.
Since is gentle (see results in section 2) and, by our reduction algorithm, is derived equivalent to we have, by [20], that is gentle. Therefore, the quiver of which contains no -cycles is a tree. Since it is a finite quiver, we must have that there are a finite number of end points of the underlying tree. In order to show that we can reduce the cycle-free part of the quiver of to the linear orientation on (where and in the number of cycles in the quiver of ) we will need the following argument.
Suppose that we have some orientation on the graph . The path algebra of such a quiver (where we assume that there are no relations) certainly describes an -cluster-tilted algebra which has some corresponding division of the -gon, . We claim that by using and we can mutate the given orientation on to an orientation where all arrows are oriented in the same direction.
Remark 4.6.
For our purposes we will need to consider both possible orientations where all arrows are in the same direction. This will become clear in due course.
First assume we have the following configuration occurring in some orientation of ,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x55.png)
Then we apply successively to the vertices to get,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x56.png)
Remark 4.7.
Notice that it is always possible to ensure the existence of the arrow in the left to right direction via a source/sink mutation if required. The effect of this series of mutations is to interchange the position of one arrow oriented from left to right with a collection of consecutive arrows oriented from right to left.
Repetition of this process will result in a configuration of the form,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x57.png)
Now apply to the vertex to get,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x58.png)
Next repeat the first step, that is, apply in turn to . The result is,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x59.png)
but now we have effectively reduced the number of arrows oriented from right to left by 1. Hence, we can eventually achieve the orientation of where all arrows are oriented from left to right.
The proof that we mutate to the orientation where all arrows are oriented from right to left is similar, simply reverse the orientations of the arrows in the relevant figures above and apply in place of . Notice that we never mutate at the left endpoint of . This means that we can use this process to reduce the cycle-free part of to the linear orientation if it has no zero relations.
Now we are ready to discuss relations in the cycle-free part of the quiver of and how to reduce the number of them. First, notice that in the cycle free part of the quiver we have that,
The equality holds where each relation occurs at a vertex of valency greater than 2. If relations occur around vertices of valency two then we will have an inequality.
Take any endpoint, , in the cycle-free part of the quiver of and consider the following local situations which could occur,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x60.png)
where consists of some orientation of for some which has no relations and and are arbitrary. Note that , and might all be empty, we do not discount this possibility. In effect we are considering the first relation encountered as we proceed back up the levels of the tree from an arbitrary endpoint.
We have the following algorithm for situations on the left in the above figure.
It has been demonstrated above that we can choose to orient as follows and maintain a derived equivalence. Therefore, we can assume that has the form shown in the following figure.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x61.png)
Now for each arrow in apply once at vertex . The result is that we have mutated to,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x62.png)
and maintained the derived equivalence.
Now perform at vertex to get,
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x63.png)
It is important to note that at no stage during these mutations have we created any relations in the cycle-free part of the quiver and at each stage we have ensured a derived equivalence.
Now, if in the initial configuration the vertex had valency greater than 2 then we have removed a relation and reduced the number of endpoints, if the vertex had valency 2 then we have removed a relation, but the number of endpoints is preserved. Therefore, we preserve the inequality ().
For the second situation where in the initial configuration we reverse the orientation of all arrows we can achieve the same result by applying in place of .
Finally, one can now continue to choose end points and eliminate relations. Notice that eventually the number of end points will be 1 and the number of relations will be zero. In order to achieve an orientation of the cycle-free part of the quiver in which all arrows are oriented in the same direction we apply the arguments above.
β
Remark 4.8.
Some remarks should be made following the proof of the theorem.
It should be noted that at no stage in the algorithm do we mutate to an algebra which is not an -cluster-tilted algebra, however in general it is certainly possible to do so. Using the inverse of the derived equivalence of proposition 3.18 it is possible for an -cluster-tilted algebra to be derived equivalent to an algebra which is not -cluster-tilted. For example, the first algebra shown here is a 4-cluster-tilted algebra and is derived equivalent to the second algebra. The second algebra is, however, not a 4-cluster-tilted algebra since it has 4 consecutive relations not in a cycle, contrary to remark 2.18.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/ade74f5a-665a-4b90-8e2a-9540d3299d71/x64.png)
So while it is known that any algebra derived equivalent to an -cluster-tilted algebra of type is gentle, by [20] it may not necessarily be -cluster-tilted. Hence the class of -cluster-tilted algebras of type is not closed under derived equivalence.
Also note that, whilst developed independently, the final part of the algorithm which removes relations from the cycle-free part of the quiver of features an argument similar to that used in [1] where generalized tilted algebras of type are considered. Our method was developed from a derived equivalence viewpoint as opposed to the classical tilting theory approach in [1] and is motivated by the polygonal combinatorics which does not feature in [1].
Acknowledgements
I would like to thank my Ph.D. supervisor Dr. Thorsten Holm for many helpful discussions while preparing this paper.
References
- [1] I. Assem and D. Happel, Generalized tilted algebras of type , Comm. Alg. 9 (1981), 2101-2125.
- [2] I. Assem and A. SkowroΕski, Iterated tilted algebras of type , Math. Z. 195 (1987), 269-290.
- [3] D. Avella-Alaminos and C. Geiss, Combinatorial derived invariants for gentle algebras, J. Pure Appl. Alg. to appear, arXiv:math.RT/0607173.
- [4] K. Baur and R.J. Marsh, A geometric description of m-cluster categories, Trans. Amer. Math. Soc. to appear, arXiv:math/0607151.
- [5] C. Bessenrodt and T. Holm, q-Cartan matrices and combinatorial invariants of derived categories for skewed-gentle algebras, Pacific J. Math. 229 (2007), No.1, 25-48.
- [6] A.B. Buan, R.J. Marsh, M. Reineke, I. Reiten and G. Todorov, Tilting theory and cluster combinatorics, Adv. Math. 204 (2006), 572-618.
- [7] A.B. Buan, R.J. Marsh and I. Reiten, Cluster tilted algebras of finite representation type., J. Algebra 306 (2006), 412-431.
- [8] A.B. Buan, R.J. Marsh and I. Reiten, Cluster tilted algebras of finite representation type, J. Algebra 306 (2006), 412-431.
- [9] A.B. Buan and D. F. Vatne, Cluster-tilted algebras of type , J. Algebra 319 (2008), 2723-2738.
- [10] P. Caldero, F. Chapoton, and R. Schiffler, Quivers with relations arising from clusters ( case), Trans. Amer. Math. Soc. 358 (2006), 1347-1364.
- [11] S. Fomin and N. Reading, Generalized cluster complexes and Coxeter combinatorics, Int. Math. Res. Not. 44 (2005), 2709-2757.
- [12] S. Fomin and A. Zelevinsky, Cluster algebras I. Foundations, J. Amer. Math. Soc. 15 (2002), 497-529.
-
[13]
D. Happel, Triangulated categories in the representation theory of finite
dimensional algebras, LMS Lecture Note Series, no. 119, Cambridge University Press, 1988. - [14] O. Iyama, Higher dimensional Auslander-Reiten theory on maximal orthogonal subcategories, Adv. Math. 210 (2007), no. 1, 22 - 50.
- [15] B. Keller, On triangulated orbit categories, Documenta Math. 10 (2005), 551-581.
- [16] B. Keller and I. Reiten,Acyclic Calabi-Yau categories are cluster categories (with an appendix by Michel Van den Bergh), preprint (2006) math.RT/0610594.
- [17] S. KΓΆnig and A. Zimmermann, Derived equivalences for group rings, Lecture Notes in Mathematics, no. 1685, Springer-Verlag, 1998.
- [18] G. Murphy, PhD thesis, University of Leeds.
- [19] C. Riedtmann, Algebren, DarstellungskΓΆcher, Uberlagerungen und zurΓΌck, Comment. Math. Helvetici 55 (1980) 199-224.
- [20] J. SchrΓΆer and A. Zimmermann, Stable endomorphism algebras of modules over special biserial algebras, Math. Z. 244 (2003), no. 3, 515-530.
- [21] H. Thomas, Defining an -cluster category, J. Algebra to appear, arXiv:math.RT/0607173.
- [22] B. Zhu, Generalized cluster complexes via quiver representations, J. Alg. Comb. 27 (2008), 25-54.