WorksMathematics
Derived tame monomial algebras
Abstract
We prove that a finite-dimensional connected monomial algebra over an algebraically closed field is derived tame if and only if every finite connected convex subcategory of its universal cover has non-negative Euler form. Derived tameness is also equivalent to tameness of its repetitive category and trivial extension. For one-cycle algebras, this condition is equivalent to the non-negativity on of explicitly computable polynomials in . This gives a finite algorithm for deciding derived tameness. We also construct an infinite family of derived-tame one-cycle string algebras with minimal cubic relations, no two of which are derived equivalent.
Introduction
Brüstle and Geiss independently proved that a finite tree algebra is derived tame if and only if its Euler form is non-negative [6, 12]. For triangular monomial algebras, Novoa and de la Peña proved that derived tameness is equivalent to the tameness of the trivial extension [11 Theorem 2.1], and that these conditions hold precisely when every finite convex subcategory of the universal cover has a non-negative Euler form [11 Corollary 3.2]. Derived-tame quadratic string algebras and Nakayama algebras were classified in [9] and [3], respectively. Bekkert and Merklen described the indecomposable objects in the derived categories of gentle algebras [4].
Theorem A extends the local Euler criterion and the equivalences in [11 Theorem 2.1 and Corollary 3.2] to all finite-dimensional connected monomial algebras, accommodating arbitrary oriented cycles and algebras with infinite global dimension. When the global dimension is infinite, the usual Ext formula need not define an Euler form on . To overcome this limitation, our proof operates locally on finite connected convex full subcategories of the universal cover. As finite tree subcategories, each has finite global dimension, ensuring that the local Euler form is well-defined. Under the local Euler condition (), the repetitive categories are tame by the theorem of Geiss and Krause [10]. Lemma 2.1 then extends this tameness to the repetitive category of the cover, and the covering theorem establishes tameness of , yielding derived tameness of .
The local Euler criterion involves infinitely many finite convex subcategories. For a one-cycle algebra, Theorem 3.1 replaces these checks by a finite computation from the quiver and its monomial relations. The deck group is , so nonzero paths between vertex lifts define a Hermitian Laurent polynomial matrix. The relation between the Euler and Cartan forms, together with a Fourier calculation, reduces the local Euler condition to positive semidefiniteness of this matrix on the unit circle. A rational parametrization of the circle then gives polynomials in whose non-negativity on decides derived tameness. Their degrees are bounded in terms of the longest nonzero path. The criterion applies to one-cycle monomial algebras with relations of arbitrary length, including non-quadratic string algebras. When the unique cycle is not oriented, Corollary 3.3 gives test polynomials of degree at most for .
The two main results are as follows. Let be an algebraically closed field and let be finite-dimensional, basic and connected. Write for its universal bound-quiver cover, for its repetitive category, and for its trivial extension. We call one-cycle if . The underlying undirected graph retains any loops and multiple edges of ; in the one-cycle case, its cycle may have any orientation. For a finite tree algebra , its Euler form is non-negative if for every .
Theorem A. For a finite-dimensional connected monomial algebra , the following conditions are equivalent:
is derived tame;
every finite connected convex full subcategory has non-negative Euler form;
is tame;
is tame;
is tame.
When the underlying graph has a cycle, these conditions are also equivalent to the condition that every finite connected convex full subcategory of is derived equivalent to a semichain algebra (Proposition 2.6).
Theorem B. Let be a finite-dimensional connected one-cycle monomial algebra, and form from the path counts in (1) using spanning-tree lifts. Let be the arrow ideal, and set , and . Now, define
The following conditions are equivalent:
is derived tame;
is positive semidefinite for every ;
for every and .
Each lies in and has degree at most when nonzero. These polynomials are computable from and a finite list of monomial generators of , and their non-negativity gives a finite test for derived tameness.
Acknowledgments
Zheng Xin is grateful to his supervisor, Prof. Wen Chang, for his academic guidance and support. Zheng Xin also thanks Marlon Pimenta Fonseca for patiently and thoroughly answering all his questions during his study of [9].
Derived tameness and tree algebras
Throughout this paper, denotes an algebraically closed field and is the standard duality. Unless otherwise stated, all algebras are assumed to be finite-dimensional, basic, and connected. We work with finitely generated right modules; for an algebra , we denote by the category of finitely generated right -modules, by its bounded derived category, and write for the homotopy category of right-bounded complexes of finitely generated projective -modules with bounded cohomology. Composition of paths in quivers is written from left to right. The sets of vertices and arrows of are denoted by and , respectively. Its underlying undirected graph retains loops and multiple edges.
Let be a finite quiver, let be the arrow ideal, and let be an admissible ideal ( for some ) generated by paths. The algebra is called a monomial algebra.
The classes of paths outside , including the trivial paths , form a basis of . We call these classes the nonzero paths of . Every nonzero path has length less than . This basis will be used in the covering arguments and in the matrices of § 5.
Definition 1.1. Let be a monomial algebra.
(1) We call a string algebra if at most two arrows start and at most two arrows end at each vertex, and every arrow has at most one successor with and at most one predecessor with . Only composable pairs of arrows are considered; see [5].
(2) We call gentle if it is a string algebra, is generated by paths of length two, and every arrow has at most one successor and at most one predecessor whose composition belongs to .
(3) We call triangular if has no oriented cycles.
(4) We call a tree algebra if the underlying undirected graph of is a tree.
Definition 1.2. [2 Definition 1.2] Let be a finite-dimensional algebra.
(1) The vector rank of a bounded complex of projective -modules is the sequence , where records the multiplicity of each indecomposable projective in .
(2) A rational family of minimal complexes over is a bounded complex of projective -modules, where (), such that . Its specialization at (for and ) is the complex of -modules
(3) The algebra is derived tame if, for each vector rank , all indecomposable minimal complexes of rank , except for finitely many isomorphism classes, are isomorphic to for some and some family belonging to a finite set of rational families.
(4) The algebra is derived wild if there exists a bounded complex of projective -modules, where , such that the functor
preserves indecomposability and reflects isomorphism classes.
The definition above is equivalent to the formulation in terms of cohomology dimensions in [10], see the discussion preceding [2 Definition 1.2]. We also use the tame–wild dichotomy [2 Theorem 1.3] and invariance of derived tameness under derived equivalence [10 Theorem 5.1].
Definition 1.3. A -linear category is called locally bounded if
(1) distinct objects of are non-isomorphic;
(2) every endomorphism ring of an object is local;
(3) every morphism space is finite-dimensional; and
(4) each object has nonzero morphisms to or from only finitely many objects.
Write for the set of objects. A finite-dimensional -module has a dimension vector of finite support.
Definition 1.4. Let be a locally bounded -linear category. A one-parameter family of -modules is a representation over a ring , where , such that has finite support, every is a finite free -module, and all structure maps are -linear. For with , its fibre at is
The dimension vector of the family is the vector of the ranks of its components. We call tame if, for each fixed dimension vector, all but finitely many indecomposable -modules are fibres of finitely many one-parameter families. Representation-finite categories are included in this definition.
Definition 1.5. A full subquiver of is called convex if every oriented path in whose endpoints lie in is entirely contained in , including paths that belong to (equivalently, paths that are zero modulo ). The associated convex full subcategory has the induced quiver and the induced relations.
Lemma 1.6. For a finite-dimensional connected monomial algebra , the universal covering quiver is a locally finite tree, and its deck group is free of rank . The covering category is locally bounded. Every finite set of its vertices lies in a finite connected convex full subcategory of finite global dimension.
Proof. A monomial relation does not identify distinct paths in the homotopy relation defining . Thus is the fundamental group of the underlying graph. The universal graph cover, with the lifted relations, gives the bound-quiver cover [9 Remark 2.5]. Its deck group acts freely on vertices, and .
Each vertex of the covering tree is incident with finitely many arrows, and every nonzero path has length less than . Only finitely many nonzero paths can therefore start or end at a fixed vertex. Thus is locally bounded.
Given a nonempty finite set of vertices, take the union of the undirected paths joining them. The result is a finite connected subtree. Every oriented path between its vertices lies in this subtree, so the corresponding full subcategory is convex. Order the vertices so that every arrow goes from a smaller index to a larger one. The composition factors of then lie at vertices with larger indices. Induction, starting at the last vertex, shows that each simple -module has finite projective dimension. Hence has finite global dimension.
For any finite-dimensional basic algebra , put . This group is free on the classes of the simple modules, so . The class of a bounded complex is the alternating sum of the classes of its cohomology modules. This identifies with , so derived equivalence preserves its rank even when the global dimension is infinite.
For a finite tree algebra , the global dimension is finite. Its Euler pairing and quadratic form are therefore given by
The sum is finite and defines a bilinear form on . We write if it is non-negative on every element of , including vectors with negative coordinates in the basis of simple classes. This is equivalent to non-negativity on , since homogeneity gives non-negativity on rational vectors and continuity extends it to real vectors.
For and , the semichain algebra is the incidence algebra of a poset with levels. The first levels contain two incomparable elements each; the remaining levels are singletons. Every element of an earlier level is smaller than every element of a later level. Recall that the incidence algebra has basis for , with and all other basis products zero. We use the connected members of this family [6 p. 302], excluding .
Theorem 1.7. A finite connected tree algebra is derived tame if and only if . In that case is derived equivalent to a semichain algebra, a hereditary algebra of type or with , or a tubular algebra. Semichain algebras are derived tame.
If and contains a convex subcategory of one of these exceptional or tubular derived types, then itself has one of these types; in particular, .
The classification is due to Brüstle [6 Theorems 1.1 and 1.2]. The assertion about convex subcategories follows from [1 Proposition 2.1]. The hereditary types have at most nine vertices, and the tubular types have Grothendieck group ranks 6, 8, 9, 10. These ranks give the bound used in Proposition 2.6.
A covering criterion for derived tameness
For a locally bounded category , the repetitive category has objects and morphism spaces
For a bound-quiver category, is the space of paths from to modulo the relations. Each layer is a copy of . Composition within a layer is that of , and composition between adjacent layers uses the natural bimodule structure on . The product of two morphisms in the dual spaces is zero.
The trivial extension of a finite-dimensional algebra is . Its underlying vector space is , with multiplication
The layer translation gives .
The next lemma uses finite quotient categories to study modules with fixed support in a repetitive category.
Lemma 2.1. Let be locally bounded. Suppose that every finite subset of is contained in a finite full subcategory for which is tame. Then is locally bounded and tame.
Proof. The displayed morphism spaces show that is locally bounded. Fix a finite set and choose containing the projection of to . Since is full, is the full subcategory of on . Both categories have the same full subcategory on .
Let be the ideal of generated by morphisms that factor through an object of outside . Define in the same way using . Every factorization in is also a factorization in , so
The ideal acts as zero on every -module supported on . Conversely, a -module extends by zero to , since compositions through objects outside act as zero by the definition of . Restriction and extension by zero therefore give an equivalence
It preserves dimensions, isomorphism classes and indecomposability. The same statement holds for and .
For a one-parameter family with dimension vector supported on , each component outside has free rank zero and hence vanishes. The action therefore factors through . Restriction and extension by zero commute with tensoring over , so the equivalence also applies to families and their specializations.
For a fixed total dimension, there are only finitely many dimension vectors on . Since is tame, the equivalence gives finitely many one-parameter families, with finitely many exceptions, for the indecomposable -modules of that dimension. Thus is tame. To pass to , choose -bases for each family. If infinitely many fibres are annihilated by , every matrix entry describing its action vanishes at infinitely many allowed parameter values. These entries lie in , so they vanish identically and the family is a -family. Each remaining family contributes only finitely many -modules, which are added to the finite exceptional set. Hence is tame. Applying this argument to the support of each dimension vector of proves that is tame. □
We use two comparison theorems. Let be a Galois covering of locally bounded categories, with torsion-free. Then
by [8 Corollary 10.7(1)]; see also [DO00, Theorem 9.1(1)].
Geiss and Krause [10 Theorem 5.3] proved that
The converse holds when .
Lemma 2.2. The universal covering of a finite-dimensional monomial algebra induces a Galois covering
where for .
Proof. Nonzero paths form bases of the morphism spaces of and . On each layer define by . On adjacent layers, send the functional dual to a lifted path to the functional dual to .
Since the algebras are monomial, a product of two nonzero paths is either another nonzero path or zero. Write for the functional dual to a nonzero path . With our convention on path multiplication, the dual bimodule actions are
The remaining paths and may be trivial. Each path has a unique lift once its starting vertex is fixed, and its subpaths lift with it, so these products agree under . Products of two dual morphisms are zero in both repetitive categories. Hence preserves composition.
For lifts of , respectively, path lifting gives
Only finitely many summands are nonzero, by local boundedness. Dualizing these isomorphisms with and interchanged gives the covering isomorphisms between adjacent layers. For other pairs of layers both sides are zero. The group acts freely on objects, and its orbits are indexed by . Hence is a Galois covering and . □
Proof of Theorem A. (i)(ii). Suppose that (ii) fails for some . By Theorem 1.7 and the tame–wild dichotomy, is derived wild. Derived wildness passes from a finite full subcategory of the monomial universal cover to [9 Lemma 2.8(a)]. Thus is derived wild, contrary to (i).
(ii)(iii). Let be a finite set of vertices of . By Lemma 1.6, it lies in a finite connected convex tree subcategory of finite global dimension. The assumed Euler condition and Theorem 1.7 show that is derived tame. Since has finite global dimension, the Geiss–Krause theorem shows that is tame. Lemma 2.1 gives tameness of .
(iii)(iv). The deck group is free, hence torsion-free. The equivalence follows from the covering theorem and Lemma 2.2.
(iv)(i). This is the Geiss–Krause implication stated above.
(iv)(v). The layer translation acts freely, and its group is isomorphic to . Apply the same covering theorem to . □
Remark 2.3. When , the covering quiver is an infinite tree. Theorem A then involves infinitely many finite connected convex full subcategories. A single such subcategory whose Euler form takes a negative value proves derived wildness, as the next corollary shows. For one-cycle algebras, § 5 gives a finite test for the local Euler condition.
Corollary 2.4. Let be a finite-dimensional connected monomial algebra. The following conditions are equivalent:
is derived wild;
there is a finite connected convex full subcategory whose Euler form takes a negative value;
(iii) there is a finite connected convex full subcategory that is derived wild and whose proper connected convex full subcategories are all derived tame.
Proof. Theorem Theorem A and the derived tame–wild dichotomy give (i)⇔(ii). If (ii) holds, then Theorem 1.7 and the dichotomy give a finite connected convex full subcategory that is derived wild. Choose one with the least number of vertices. Each of its proper connected convex full subcategories is convex in and has fewer vertices, so it is derived tame. This proves (iii). Conversely, Theorem 1.7 shows that the Euler form of the subcategory in (iii) takes a negative value, giving (ii).
Example 2.5. Let , where is the quiver

Figure 1.
Every path of length five contains as a subpath, so is finite-dimensional. Its underlying graph has six vertices and six edges, hence is one-cycle.
Choose a lift of vertex 0. The lift of ending at and the four lifts of starting there form the following subtree of the universal cover:

Figure 2.
It defines a finite connected convex full subcategory . No lifted relation is contained in this subtree, so is the path algebra of the displayed five-armed star. Let have coordinate 2 at the centre and 1 at each leaf. Since is hereditary,
Thus is derived wild by Corollary 2.4.
When the underlying graph has a cycle, the next proposition adds a semichain condition to the equivalent conditions of Theorem A.
Proposition 2.6. Let be a finite-dimensional connected monomial algebra with . Every finite connected convex full subcategory of has non-negative Euler form if and only if every such subcategory is derived equivalent to a semichain algebra.
Proof. Assume the local Euler condition. The covering group is infinite, since it is free of positive rank. Its free action on vertices implies that the covering tree is infinite.
Suppose that a finite connected convex subcategory has one of the exceptional or tubular derived types in Theorem 1.7. Choose a finite set of covering vertices with and take the union of the undirected paths joining them. By Lemma 1.6, the resulting full subcategory is finite, connected and convex, contains , and has . Since remains convex in and , the extension property in Theorem 1.7 gives rank . This contradicts rank . The
classification in Theorem 1.7 now shows that every finite connected convex subcategory is derived equivalent to a semichain algebra.
Conversely, suppose every finite connected convex subcategory is derived equivalent to a semichain algebra. Semichain algebras are derived tame, and derived equivalence preserves derived tameness. Theorem 1.7 therefore gives the local Euler condition. □
Remark 2.7. The rank bound explains the conclusion of Proposition 2.6. The exceptional hereditary and tubular derived types in Theorem 1.7 have Grothendieck group rank at most ten. Under the local Euler condition, the same bound holds for every finite connected convex full extension of a subcategory of one of these types. In the infinite covering tree, such extensions have arbitrarily many vertices. The finite-tree classification therefore leaves only the semichain derived-equivalence classes.
A polynomial criterion for one-cycle monomial algebras
Throughout this section, is a finite-dimensional connected one-cycle monomial algebra, with covering group . We use its nonzero paths to form a matrix that tests the Euler forms of the finite convex subcategories of .
Set and choose a lift of each vertex . Every vertex of the cover has a unique expression . For , define
These counts include the trivial paths, so each has integer entries. Only finitely many are nonzero, since every nonzero path has length less than and the covering quiver is locally finite. Put
For , the matrix is Hermitian, and its positive semidefiniteness is tested over . Its coefficients are determined by integer path counts, independently of the characteristic of .
The matrices can be computed directly from and a finite set of monomial generators of . A path is nonzero in exactly when it contains no member of as a subpath. Starting from the trivial paths, we form paths of length by appending arrows to the nonzero paths of length and discarding those that contain a member of . This process lists all nonzero paths by length and terminates at the first empty list, since is finite-dimensional. A one-cycle quiver has an arrow, and , so this first occurs at some length . At that point , while the preceding list is nonempty. Hence , so the procedure also computes .
Spanning-tree lifts. Choose a spanning tree of the underlying graph and a lift to the covering tree. From now on, take its vertices as the lifts . The unique arrow outside , together with the unique undirected path in joining its endpoints, gives a generator of the fundamental group. Consequently, its lift starting in ends in for a generator of the deck group. Give this arrow weight and every tree arrow weight . A path from to of total weight then lifts from to . Thus counts the nonzero paths from to of weight . Every path has weight or . Since every nonzero path has length less than , these spanning-tree lifts give unless .
Theorem 3.1. Let be a finite-dimensional connected one-cycle monomial algebra, with and . Form as in (1), using the spanning-tree lifts above. Set and define
and
The following conditions are equivalent:
(i) every finite connected convex full subcategory of has non-negative Euler form;
(ii) for every ;
(iii) for every and .
Each lies in , and when . These polynomials can be computed from the quiver and its monomial relations, giving a finite test for the three conditions.
Proof. 1. Euler forms and path counts. Let be a finite connected convex subcategory of . Since its quiver is acyclic, we can order its vertices as so that every arrow goes from a smaller index to a larger one. Let count the nonzero paths from to , and write for the simple at . For the right projective , the multiplicity of is . Thus the Cartan matrix, whose columns are the projective classes in the basis of simple classes, is . If is the Euler matrix in this basis, then gives , hence .
The matrix is upper triangular with diagonal entries , so is invertible. For any , set . Then
where holds since is a scalar. Since is an automorphism of , for all if and only if for all .
For the relation between the Euler and Cartan forms, see [1 §1.6, proof of Lemma 1].
2. Vectors of finite support. Let be a finitely supported family with , and set
Assign to the vertex . Applying gives a bijection from paths between and to paths between and . By Lemma 1.6, the support of lies in a finite connected convex subtree, which contains every path between its vertices. Its path-count form on is therefore .
Conversely, every vector on a finite convex subcategory gives such a family. By 3.4, the local Euler condition is equivalent to for all finitely supported real families.
3. The unit-circle condition. Define so that . For any complex sequence with finite support, yields . Thus, non-negativity over real sequences is equivalent to non-negativity over complex sequences.
For , orthogonality of characters on gives
If for all , then .
Conversely, assume for all finitely supported sequences. Given any and , define for and otherwise. Counting pairs with yields:
Since only finitely many are non-zero, taking gives . As and were arbitrary, on the entire unit circle .
4. A finite polynomial test. For the spanning-tree lifts, when . With and as in (2), the terms with exponents and , for , become
It follows that the entries of lie in and have degree at most . For all real , the factor is positive and is Hermitian.
In (3), the coefficient is the sum of the principal minors of order of ; equivalently, it is the th elementary symmetric function of the eigenvalues of . Each entry has degree at most , so and when is nonzero. Since is Hermitian for all real , its eigenvalues and each are real on . The imaginary part of is therefore a polynomial vanishing on , so .
For a fixed real , let be the eigenvalues of . If they are all non-negative, then the coefficients of are non-negative. Conversely, if all are non-negative, the right side of (3.3) is strictly positive for . A negative eigenvalue would give the positive root , a contradiction. Thus
As runs through , covers the unit circle except for , and as . If for all real , then for every , continuity gives
Consequently,
A nonzero real polynomial is non-negative on exactly when its leading coefficient is positive and every real root has even multiplicity. Indeed, an odd-multiplicity real root changes the sign, while an even-multiplicity root does not. The zero polynomial is non-negative as well. For a polynomial in , these conditions can be checked by square-free factorization and exact real-root isolation. The criterion thus reduces to finite polynomial tests with the stated degree bounds. □
Remark 3.2. The choice of lifts does not affect the criterion. If and , then
Since is unitary on the unit circle, and are positive semidefinite at the same points. With fixed, similarity also gives
This is an identity of rational functions in , so the determinant coefficients are the same polynomials . The spanning-tree lifts ensure that the entries of themselves are polynomials of degree at most . Replacing by replaces by and leaves the unit-circle condition unchanged.
Theorems A and 3.1 together prove Theorem B.
Corollary 3.3. Let be a finite-dimensional connected one-cycle monomial algebra whose unique cycle is not oriented. Using spanning-tree lifts, define
Then and whenever . Moreover, is derived tame if and only if for all and .
Proof. The quiver has no oriented cycles, so a directed path visits each vertex at most once. It therefore uses the unique arrow outside the spanning tree at most once. Hence for and . It follows that
Its entries lie in and have degree at most two. The coefficient is the sum of its principal minors of order , so it has degree at most when nonzero. Since is Hermitian for real , these coefficients are real on and therefore belong to .
For the matrix and coefficients in Theorem 3.1, we have
The factors are positive for real , so the two sets of polynomial inequalities are equivalent. Theorem B now gives the result. □
Applications to one-cycle monomial algebras
We first apply the criterion to truncated cycles and to path algebras of acyclic orientations of a cycle. We then consider a string algebra with a minimal cubic relation, give a second proof of its derived tameness by flat deformation, and construct its finite cyclic covers.
Proposition 4.1. [3 Lemma 3.2] Let be an oriented cycle on vertices and let , where . Then is derived tame if and only if .
Proof. The universal cover is the oriented infinite line with all paths of length zero, independently of . By Theorem A, it suffices to take . In that case the matrix has one entry:
For this equals . For , choose ; then
The result follows from Theorem B. □
For , the polynomial test in Theorem 3.1 with gives
This polynomial is negative for , although . Thus a test at alone does not decide positive semidefiniteness on the unit circle.
We next consider a cycle whose arrows do not form an oriented cycle, with no relations.
Proposition 4.2. [11 §1.4(a)] Let be an acyclic orientation of a cycle. Then is derived tame.
Proof. Put and . Choose a spanning tree of the underlying graph. Give the unique arrow outside this tree weight 1, and give every tree arrow weight 0, as in § 5. Define
The entries of count paths of length , with each path contributing raised to its total weight.
Since has no oriented cycles, every path has length less than . Thus is finite-dimensional and . There are no relations, so the path-count matrix is
Fix with , and write . Then is invertible and
where denotes conjugate transpose. Hence
Every vertex of the underlying graph has degree two. Consequently, for ,
This proves that is positive semidefinite. Since is invertible, is positive semidefinite for every . It shows that is derived tame by Theorem B. □
Remark 4.3. In the setting of Proposition 4.2, the matrix in (3.1) is positive definite for and , while has corank one.
Indeed, suppose that the sum of squares in the proof vanishes. Every tree arrow has weight zero, so its endpoints have equal coordinates. Since the spanning tree is connected, all coordinates of have a common value . The remaining arrow gives . If , then , so is positive definite. If , its kernel consists of the constant vectors and has dimension one. The invertible congruence used in the proof preserves positive definiteness and the dimension of the kernel, so both conclusions hold for .
In contrast to Proposition 4.1, where cubic relations on an oriented cycle yield derived wildness, a cubic relation located along a tree branch outside the central cycle does not destroy derived tameness. The following example illustrates this phenomenon.
Example 4.4. Let be the quiver

Figure 3.
With -subscripts read modulo 6, put
Then is a derived-tame one-cycle string algebra with a minimal cubic relation.
Proof. The graph has 13 vertices and 13 edges, with at most two arrows entering and at most two arrows leaving each vertex. Its nonzero length-two paths are
In this list, each arrow has at most one nonzero successor and at most one nonzero predecessor, so is a string algebra. Every path of length four is zero. Both length-two subpaths of are nonzero, so this is a minimal cubic relation. Thus the ideal is admissible and the algebra is not quadratic.
Proof by the matrix criterion. We compute the matrix in Theorem 3.1. Give weight 1 and all other arrows weight 0. In the vertex order , write
The only nonzero paths between cycle vertices are the trivial paths and the arrows . Thus has diagonal 2, entries for , , , and all other entries zero. Write for the all-ones matrix and for the standard basis vectors of . The remaining blocks are
The blocks of come from the paths within the three branches. For example, the branch on 7, 8, 9 has the paths , and , so its block is . The first block of counts the paths from 1 and 6 to 7 and 8; the relation excludes paths from either vertex to 9. The second block counts the paths from 2 and 3 to 10 and 11. The third block comes from paths in the opposite direction, from 12 and 13 to 5 and 6, through the term in . All paths contributing to the second and third blocks have weight zero.
The matrix has eigenvalue once and eigenvalue 1 with multiplicity , and
Thus is positive definite. The Schur complement of is . For and , we have
Thus it remains to check that is positive semidefinite. The identities
give the following contributions to : on indices , and on each of and . After subtraction from , all entries containing cancel. Thus
Thus on the entire unit circle, and is derived tame by Theorem B.
Proof by a flat deformation. We adapt the local construction in [11 Lemma 2.4] and verify flatness directly. Add an arrow to obtain , and set
A -basis is
To verify this basis, use the rules , and . The only arrow entering vertex is , and no arrow leaves vertex . Thus every path of length at least two that contains has as a subpath and reduces to zero. Every reduction either gives zero or shortens the path, so the reduction process terminates.
The only overlapping left sides occur in , and reducing either pair gives zero. Reductions on disjoint subpaths commute. Also, reduces first to and then to zero. Hence the displayed paths are exactly the irreducible paths, and every element has a unique normal form as a -linear combination of them. Since there are such paths, is free of rank over and the family is flat.
For , eliminating identifies with . The zero fibre is
The zero fibre is gentle: at most two arrows start and at most two end at each vertex, and its nonzero paths of length two are precisely those in . This list and the displayed relations give each arrow at most one nonzero and one zero successor, with the same bounds for predecessors. Since is derived tame [4] and every nonzero fibre is isomorphic to , [2 Corollary 1.5] implies that is derived tame.
Remark 4.5
Let be a one-cycle monomial algebra. Write for the vertices on its unique cycle and put . Assume , and choose the arrow of weight on the cycle. Suppose that no nonzero path with both endpoints in passes through this arrow. With the vertices ordered as , write
Every path contributing to has weight zero, so is a constant real symmetric matrix. If is positive definite, the completion of the square used in Example 4.4 gives
This reduces the test to a matrix of order .
To check positive definiteness of , suppose further that every nonzero path with both endpoints in stays in , and let be the algebra of the induced bound subquiver on . Then is a product of finite tree algebras and . By (4), applied to each component, is positive definite if and only if the Euler form of is positive definite. In particular, this holds if each component is a directed path with no relations: then is a direct sum of matrices . These conditions hold in Example 4.4.
Finite cyclic covers preserve derived tameness. Applying the following proposition to Example 4.4 gives an infinite family.
Proposition 4.6. Let be a finite-dimensional connected one-cycle monomial algebra, with universal cover and deck group . For , let . Then is a finite-dimensional connected one-cycle monomial algebra, and
Proof. The quotient quiver is connected and has vertices and arrows. Its relations are the lifts of the monomial relations of , so every nonzero path has length less than and is finite-dimensional and monomial. The identity shows that it is one-cycle.
The projection is a bound-quiver covering with deck group . Its source has a tree as its underlying graph and is therefore simply connected. Hence it is the universal cover of . Thus and have the same local Euler condition, and Theorem A gives the equivalence. □
Corollary 4.7. For each , there is a derived-tame one-cycle string algebra with vertices, dimension , and minimal cubic relations. No two algebras in this family are derived equivalent.
Proof. Let be the algebra in Example 4.4, and take as in Proposition 4.6. An explicit presentation has vertices
For each , copy all arrows of the example except , and replace that arrow by
Write , , and for the resulting arrows. The relations are
The covering preserves the number of arrows at each vertex and the allowed continuations of each arrow, so is a string algebra. Both length-two subpaths of each cubic relation are nonzero, giving distinct minimal cubic relations. Every path of length four is zero.
Each nonzero path of , including a trivial path, has exactly lifts to this quiver. Thus . Derived tameness follows from Proposition 4.6. Since derived equivalence preserves the rank of the Grothendieck group, the equality distinguishes the derived equivalence classes for different values of . □
Remark 4.8. The construction in Corollary 4.7 is entirely general. If is any derived tame one-cycle monomial algebra with vertices, the sequence of finite cyclic coverings yields an infinite family of pairwise non-derived equivalent derived tame algebras, distinguished by . Consequently, every derived tame one-cycle monomial algebra gives rise to an infinite family of this type.
References
Department of Mathematics and Applied Mathematics, Federal University of Lavras (UFLA) – Brazil
Email address: [email protected]
School of Mathematics and Statistics, Shaanxi Normal University, Xi’an 710062, China
Email address: [email protected]
References
- [1][BBD00] M. Barot, T. Brüstle and J. A. de la Peña, Derived-tame tree algebras of type E. Forum Math. 12 (2000), no. 6, 713–721. doi:10.1515/form.2000.024.DOI
- [2][BD03] V. Bekkert and Y. Drozd, Tame–wild dichotomy for derived categories, preprint (2003), arXiv:math/0310352.DOI
- [3][BGV21] V. Bekkert, H. Giraldo and J. A. Vélez-Marulanda, Derived tame Nakayama algebras. Proc. Amer. Math. Soc. 149 (2021), no. 11, 4555–4567. doi:10.1090/proc/15612.DOI
- [4][BM03] V. Bekkert and H. A. Merklen, Incomposables in derived categories of gentle algebras. Algebra. Represent. Theory 6 (2003), 285–302. doi:10.1023/A:1025142023594.DOI
- [5][BR87] M. C. R. Butler and C. M. Ringel, Auslander–Reiten sequences with few middle terms and applications to string algebras. Comm. Algebra 15 (1987), no. 1–2, 145–179. doi:10.1080/009278780823416.DOI
- [6][Bru01] T. Brüstle, Derived-tame tree algebras. Compositio Math. 129 (2001), no. 3, 301–323. doi:10.1023/A:1012591326777.DOI
- [8][Dro01] Y. A. Drozd, Reduction algorithm and representations of boxes and algebras. C. R. Math. Acad. Sci. Soc. R. Can. 23 (2001), no. 4, 97–125.
- [9][Fon22] M. P. Fonseca, Derived tame quadratic string algebras. Comm. Algebra 50 (2022), no. 4, 1662–1684. doi:10.1080/00927872.2021.1986832.DOI
- [10][GK02] C. Geiss and H. Krause, On the notion of derived tameness. J. Algebra Appl. 1 (2002), no. 2, 133–157. doi:10.1142/S0219498802000112.DOI
- [11][NdP01] C. Novoa and J. A. de la Peña, On the tameness of trivial extensions of monomial algebras. Ann. Sci. Math. Québec 25 (2001), no. 2, 199–209.
- [12][Gei02] C. Geiss, Derived tame algebras (with an appendix by the author and B. Keller). Mathematische Zeitschrift 239 (2002), no. 4, 829–862. doi:10.1007/s002090100349.