Model categories of quiver representations
Henrik Holm, Peter Jorgensen

TL;DR
This paper extends Gillespie's theorem to construct model category structures on categories of quiver representations, including generalized chain complexes and periodic complexes, broadening the scope of homological algebra tools.
Contribution
It generalizes Gillespie's theorem to a wider class of self-injective quivers with relations, enabling systematic construction of model structures on various representation categories.
Findings
Constructs model category structures on categories of quiver representations.
Includes categories of N-periodic and N-complexes as special cases.
Provides a unified framework for generalized chain complexes.
Abstract
Gillespie's Theorem gives a systematic way to construct model category structures on , the category of chain complexes over an abelian category . We can view as the category of representations of the quiver with the relations that two consecutive arrows compose to . This is a self-injective quiver with relations, and we generalise Gillespie's Theorem to other such quivers with relations. There is a large family of these, and following Iyama and Minamoto, their representations can be viewed as generalised chain complexes. Our result gives a systematic way to construct model category structures on many categories. This includes the category of -periodic chain complexes, the category of -complexes where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Model categories of quiver representations
Henrik Holm
Department of Mathematical Sciences, Universitetsparken 5, University of Copenhagen, 2100 Copenhagen Ø, Denmark
[email protected] http://www.math.ku.dk/~holm/ and
Peter Jørgensen
School of Mathematics and Statistics, Newcastle University, Newcastle upon Tyne NE1 7RU, United Kingdom
[email protected] http://www.staff.ncl.ac.uk/peter.jorgensen
Abstract.
Gillespie’s Theorem gives a systematic way to construct model category structures on , the category of chain complexes over an abelian category .
We can view as the category of representations of the quiver with the relations that two consecutive arrows compose to [math]. This is a self-injective quiver with relations, and we generalise Gillespie’s Theorem to other such quivers with relations. There is a large family of these, and following Iyama and Minamoto, their representations can be viewed as generalised chain complexes.
Our result gives a systematic way to construct model category structures on many categories. This includes the category of -periodic chain complexes, the category of -complexes where , and the category of representations of the repetitive quiver with mesh relations.
Key words and phrases:
Abelian model categories, chain complexes, cotorsion pairs, Gillespie’s Theorem, Hovey’s Theorem, -complexes, periodic chain complexes
2010 Mathematics Subject Classification:
18E30, 18E35, 18G55
0. Introduction
Gillespie’s Theorem permits the construction of model category structures on categories of chain complexes. We will generalise it to representations of self-injective quivers with relations, which can be viewed as generalised chain complexes by the work of Iyama and Minamoto, see [17] and [18, sec. 2].
0.i. Outline
Let be an abelian category. An abelian model category structure on , the category of chain complexes over , consists of three classes of morphisms, , known as fibrations, cofibrations, and weak equivalences, subject to several axioms, see [15, def. 2.1] and [26, sec. I.1]. It provides an extensive framework for the construction and manipulation of the localisation , where the morphisms in have been inverted formally. Some of the localisations thus obtained are of considerable interest, not least the derived category .
Hovey’s Theorem says that each abelian model category structure can be constructed from two so-called complete, compatible cotorsion pairs, see Theorem 0.2. This motivates Gillespie’s Theorem, which takes a hereditary cotorsion pair in and produces two compatible cotorsion pairs in , see Theorem 0.3.
Gillespie’s Theorem can be viewed as a result on quiver representations since is the category of representations of with values in , where is the following self-injective quiver with relations.
[TABLE]
The notion of self-injectivity is made precise in Paragraph 2.4. This paper will generalise Gillespie’s Theorem to other self-injective quivers with relations. They form a large family, see for example Equations (0.3) and (0.4) and Section 0.viii.
Let be a field, a -algebra, a self-injective quiver with relations over , and let be the category of representations of with values in , the category of -left-modules. Our main theorem, Theorem A, takes a hereditary cotorsion pair in and produces two compatible cotorsion pairs in . It specialises to Gillespie’s Theorem for if is the quiver with relations from (0.1).
0.ii. Cotorsion pairs
Let be an abelian category. If and are classes of objects of , then we write
[TABLE]
Definition 0.1**.**
Recall the following from the literature.
- (i)
A cotorsion pair in is a pair of classes of objects of such that and , see [28, p. 12]. A cotorsion pair is determined by each of the classes and , because it is equal to and to . 2. (ii)
The cotorsion pair in is complete if each permits short exact sequences and with and , see [12, lem. 5.20]. 3. (iii)
The cotorsion pair is hereditary if is closed under kernels of epimorphisms and is closed under cokernels of monomorphisms, see [12, lem. 5.24]. 4. (iv)
The cotorsion pairs and in are compatible if they satisfy the following conditions, see [10, sec. 1].
- (Comp1)
.
- (Comp2)
.
Condition (Comp1) is equivalent to and to . It is not symmetric in the two cotorsion pairs; their order matters.
Note that our definition of compatibility is weaker than Gillespie’s from [11, def. 3.7], and that his cortorsion pairs and in from [11, prop. 3.6] are always compatible in our sense. Indeed, and are both equal to the class of split exact complexes with terms in . 5. (v)
Let be a cotorsion pair in , and let be a class of objects in . If , then we say that is generated by . If , then we say that is cogenerated by . See [12, def. 5.15].
For example, if has enough projective objects, then is called the projective cotorsion pair. If has enough injective objects, then is called the injective cotorsion pair. These cotorsion pairs are complete and hereditary. Note that the triangulated version of compatible cotorsion pairs was investigated by Nakaoka under the name concentric twin cotorsion pair, see [24, def. 3.3].
0.iii. Hovey’s Theorem: Abelian model category structures
We will not reproduce Hovey’s Theorem in full, but rather state the following result, which motivates the interest in compatible cotorsion pairs and dovetails with Gillespie’s Theorem.
Theorem 0.2** ([9, prop. 2.3 and sec. 4.2], [10, thm. 1.1], [15, thm. 2.2]).**
Let and be complete, hereditary, compatible cotorsion pairs in the abelian category .
There is a class of objects, often referred to as trivial, characterised by
[TABLE]
Moreover, there is a model category structure on with
[TABLE]
and the localisation is triangulated.
We will give an example after recalling Gillespie’s Theorem.
0.iv. Gillespie’s Theorem: Chain complexes
Gillespie’s Theorem gives a systematic way to construct compatible cotorsion pairs in the category of chain complexes. It requires the following setup.
- •
is an abelian category with enough projective and enough injective objects.
- •
is the category of chain complexes over .
- •
For , consider the functors
[TABLE]
where sends to the chain complex with in degree and zero everywhere else, and and are given by
[TABLE]
Here is the th differential of the chain complex . There are adjoint pairs and .
The following is Gillespie’s Theorem.
Theorem 0.3** ([11, thm. 3.12 and cor. 3.13]).**
If is a hereditary cotorsion pair in , then there are hereditary, compatible cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in , where
[TABLE]
For instance, the projective cotorsion pair gives
[TABLE]
where is the class of projective objects in and is the class of exact chain complexes. Note that . The cotorsion pairs (0.2) are hereditary and compatible by Gillespie’s Theorem. If is a complete and cocomplete category, then the cotorsion pairs (0.2) are complete, and then Theorem 0.2 says that they determine an abelian model category structure on . The associated localisation is the derived category , see [9, thm. 5.3].
0.v. The Main Theorem: Quiver representations
Our main theorem is a generalisation of Gillespie’s Theorem to quiver representations. It requires the following setup, which we keep in the rest of the introduction.
- •
is a field, is a -algebra, is the category of -left-modules.
- •
is a self-injective quiver with relations over , see Paragraph 2.4.
- •
is the category of representations of with values in . If is an arrow in , then the corresponding homomorphism in is .
- •
For an element of , the set of vertices of , consider the functors
[TABLE]
defined by:
[TABLE]
Here is the simple representation of supported at . Its dual is the simple representation of the opposite quiver supported at . The symbols and denote the tensor product and homomorphism functors of representations of . Note that sends to the representation with at vertex and zero everywhere else. There are adjoint pairs and .
Our main theorem is the following.
Theorem A**.**
If is a hereditary cotorsion pair in , then there are hereditary, compatible cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in , the category of representations of with values in , where
[TABLE]
In the body of the paper, we prove the more general Theorem 3.2 where is a small -preadditive category, and is the functor category of -linear functors . Paragraph 2.4 explains how a quiver can be viewed as a category, whence Theorem 3.2 specialises to Theorem A.
Theorem A specialises to Gillespie’s Theorem for if is the quiver with relations from (0.1). Then is the category of chain complexes over . A computation shows that the functors , , specialise to those of Section 0.iv, and that
[TABLE]
whence the formulae in Theorem A specialise to those in Gillespie’s Theorem. However, Theorem A applies to many other quivers with relations. Following Iyama and Minamoto [18, def. 8], we then think of and as generalised homology functors.
To serve as the input for Theorem 0.2, the cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} must be complete. In the setup of Theorem 0.3, this is indeed true under the conditions that is a complete and cocomplete category and is a complete cotorsion pair, see [7, thm. 2.4]. In the more complicated setup of Theorem A, we do not have an equally neat result, but we do prove completeness in certain cases, see Theorem 3.3.
0.vi. Application: -periodic chain complexes
Let be an integer.
- •
In Section 0.vi only, is the following quiver with relations.
[TABLE]
This is a self-injective quiver with relations, see Paragraph 2.4.
An object has the form
[TABLE]
where two consecutive morphisms compose to [math]. Hence is the category of -periodic chain complexes over . This even makes sense for , in which case is a so-called module with differentiation in the sense of [6, sec. IV.1], consisting of an object and a morphism squaring to [math].
For there is a homology functor defined in an obvious fashion. We will use our theory to prove the following.
Theorem B**.**
Let be a hereditary cotorsion pair in .
- (i)
There are hereditary, compatible cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in , the category of -periodic chain complexes over , where
[TABLE] 2. (ii)
If is closed under pure quotients and is generated by a set, then the cotorsion pairs in part (i) are complete.
This applies to the so-called flat cotorsion pair : Heredity holds by [12, thm. 8.1(a)], the class of flat modules is easily seen to be closed under pure quotients, and generation by a set holds by [5, prop. 2] (in which “cogenerated” means the same as our “generated”). Hence Theorem B provides an -periodic version of Gillespie’s result for chain complexes from [11] (see theorem 3.12 and corollaries 3.13, 4.10, 4.18 in that paper). Theorem B also applies to the injective cotorsion pair .
0.vii. Application: with mesh relations
The following is a slightly more complicated example.
- •
In Section 0.vii only, is the repetitive quiver modulo the mesh relations. That is, is
[TABLE]
modulo the relations that each composition of the form
\textstyle{\circ}$$\textstyle{\circ}$$\textstyle{\circ}
or
[TABLE] \textstyle{\circ}$$\textstyle{\circ}$$\textstyle{\circ}
, which starts and ends on the edge of the quiver, is zero, and that each square of the form
[TABLE] \textstyle{\circ}$$\textstyle{\circ}$$\textstyle{\circ}$$\textstyle{\circ}
is anticommutative. This is a self-injective quiver with relations, see Paragraph 2.4.
For , the mesh relations imply that there are short chain complexes
[TABLE]
We will use our theory to prove the following.
Theorem C**.**
If is a hereditary cotorsion pair in , then there are hereditary, compatible cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in , the category of representations of with values in , where
[TABLE]
0.viii. Other self-injective quivers with relations
There are many other self-injective quivers with relations to which Theorem A can be applied, for instance with the relations that consecutive arrows compose to [math]. Then is the category of -complexes over in the sense of [20, def. 0.1]. Other possibilities are with mesh relations, the quiver with relations of a finite dimensional self-injective -algebra, and quivers with relations of repetitive algebras, see [22, sec. 3.1] and [29, sec. 2].
0.ix. An observation on the model category literature
Observe that Theorem A does not assume the existence of a model category structure on . This is in contrast to several results from the literature, where a model category structure on a functor category is induced by a model category structure on . If is a small category, then such results exist when has a cofibrantly generated or combinatorial model category structure, see [13, thm. 11.6.1] and [23, prop. A.2.8.2], and when has an arbitrary model category structure and is a direct, an inverse, or a Reedy category, see [16, thms. 5.1.3 and 5.2.5].
0.x. Contents of the paper
Section 1 defines the cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in an abstract setup, and shows that they are hereditary and compatible under certain assumptions. Section 2 introduces functor categories. Section 3 proves Theorem 3.2, which has Theorem A as a special case. Sections 4, 5, and 6 provide several results used in the proof of Theorem 3.2. Section 7 proves Theorem B. Section 8 proves Theorem C. Appendix A provides additional background on functor categories.
1. The cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in an abstract setup
This section defines the cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in an abstract setup, and shows that they are hereditary and compatible under certain assumptions.
Setup 1.1**.**
Section 1 uses the following setup.
- •
and are abelian categories with enough projective and enough injective objects.
- •
is a cotorsion pair in .
- •
is an index set.
- •
For each there are adjoint pairs of functors and as follows.
[TABLE]
Note that this implies that is exact.
The following lemma provides a so-called “five term exact sequence”. It is classic, but we show the proof because we do not have a reference for the precise statement.
Lemma 1.2**.**
*Let be an adjoint pair of functors as follows:
\textstyle{\mathscr{M}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{S}$$\textstyle{\mathscr{X}.\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{C}
Assume that is exact. For and there is an exact sequence*
[TABLE]
Proof.
Consider the functors where is the category of abelian groups and .
The contravariant functor is left exact. If is projective, then is projective because \operatorname{Hom}_{\mathscr{M}}(CP,-)\simeq\operatorname{Hom}_{\mathscr{X}}\big{(}P,S(-)\big{)} is an exact functor since is exact. In particular, the functor maps projective objects to right -acyclic objects, that is, objects on which the derived functors vanish.
By [27, thm. 10.49] there is a Grothendieck third quadrant spectral sequence
[TABLE]
If is a projective resolution of , then
[TABLE]
Hence the spectral sequence is
[TABLE]
By [27, thm. 10.33] there is an associated exact sequence, which gives the sequence in the lemma. ∎
We record the dual without a proof:
Lemma 1.3**.**
*Let be an adjoint pair of functors as follows:
\textstyle{\mathscr{M}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{S}$$\textstyle{\mathscr{X}.\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{K}
Assume that is exact. For and there is an exact sequence*
[TABLE]
The following is well known.
Lemma 1.4**.**
A cotorsion pair in is hereditary if and only if is resolving, that is, contains the projective objects and is closed under kernels of epimorphisms.
Proof.
See [12, lem. 5.24], the proof of which works in the present generality. ∎
Definition 1.5**.**
Let
[TABLE]
If is a class of objects in , then let
[TABLE]
Note that and .
If is a class of objects in , then we use the shorthand .
Lemma 1.6**.**
Let be a class of objects in .
- (i)
Assume that for each non-zero there is an injective object which is in and satisfies . Then . 2. (ii)
Assume that for each non-zero there is a projective object which is in and satisfies . Then .
Proof.
First note that for , , , there is an exact sequence
[TABLE]
by Lemma 1.2.
Part (i), the inclusion : Let and be given. Then and by the definition of . It follows that for , the terms in (1.1) which involve and are [math], so (1.1) implies . Hence .
Part (i), the inclusion : Let and be given.
For , the term in (1.1) which involves is [math], so (1.1) implies . Hence .
Assume that . Pick an injective object which is in and satisfies . By the previous paragraph, the term in (1.1) which involves is [math]. However, the term involving is also [math] since is injective, so (1.1) implies . This is a contradiction, so we conclude . Combining with the previous paragraph shows .
Part (ii): Proved dually to part (i). ∎
Theorem 1.7**.**
There are cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in .
Proof.
The class contains the projective objects of , and the class contains the injective objects of . Since we also have and , Lemma 1.6 implies
[TABLE]
Hence there are the following cotorsion pairs, see [12, def. 5.15]:
[TABLE]
Theorem 1.8**.**
Assume that is a hereditary cotorsion pair in .
- (i)
If for , then there is a hereditary cotorsion pair \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} in . 2. (ii)
If for , then there is a hereditary cotorsion pair \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in .
Proof.
The cotorsion pairs exist by Theorem 1.7, and we must prove heredity under the given assumptions.
(i): Lemma 1.4 implies that is resolving, and that it is enough to prove that so is . Let be a short exact sequence in with , and let be given. By definition we have and . In particular, , so the assumption in part (i) says . Hence the long exact sequence
[TABLE]
reads
[TABLE]
This implies . It also implies because is resolving and . Hence as desired.
(ii): Proved dually to (i). ∎
Definition 1.9**.**
Consider the following conditions on the classes , , , from Definition 1.5.
- (Ex)
.
- (Seq)
If is given, then:
- (i)
Each permits a short exact sequence in ,
[TABLE]
with and . 2. (ii)
Each permits a short exact sequence in ,
[TABLE]
with and .
Remark 1.10**.**
It is not obvious that the sequences in condition (Seq) of the definition exist. Their construction in the category of representations of a self-injective quiver is a key technical part of the paper, see Section 6.
Theorem 1.11**.**
Assume that conditions (Comp1), (Ex), and (Seq) hold (see Definitions 0.1 and 1.9). Then there are compatible cotorsion pairs and in .
Proof.
The cotorsion pairs exist by Theorem 1.7, and we must prove that they are compatible under the given assumptions, which amounts to proving that condition (Comp2) holds. We have assumed condition (Ex), so write . It is enough to prove
[TABLE]
since then
[TABLE]
and this shows (Comp2) since can be removed from the displayed formula because .
We prove Equation (1.2) by establishing the two inclusions.
The inclusion : Let be given. Given and , condition (Seq)(ii) provides a short exact sequence in ,
[TABLE]
with and . There is a long exact sequence containing
[TABLE]
The first term is zero since and . The last term is zero since and . Hence the middle term is zero: . By Lemma 1.2 this implies whence . We also know , so . It follows that .
The inclusion : This follows because , while condition (Comp1) implies .
Equation (1.3) is proved dually to Equation (1.2). ∎
We end by recording a lemma which has almost the same proof as Theorem 1.7.
Lemma 1.12**.**
Let be a class of objects in .
- (i)
Assume that for each non-zero there is an injective object which is in and satisfies .
If is the cotorsion pair in cogenerated by , then \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} is the cotorsion pair in cogenerated by . 2. (ii)
Assume that for each non-zero there is a projective object which is in and satisfies .
If is the cotorsion pair in generated by , then \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} is the cotorsion pair in generated by .
Proof.
(i): If is cogenerated by , then , so Lemma 1.6 implies . Hence
[TABLE]
is the cotorsion pair cogenerated by .
(ii) is proved dually to (i). ∎
2. Functor categories
This section introduces functor categories. In particular, Paragraph 2.4 explains how a category of quiver representations can be viewed as a functor category, whence Theorem 3.2 has Theorem A as a special case.
Setup 2.1**.**
Section 2 uses the following setup.
- •
is a field.
- •
is a -algebra.
2.2****Functor categories.
Let be a small -preadditive category; that is, each -space is a -vector space and composition of morphisms is -bilinear. The homomorphism functor and the radical of will be denoted and , see [1, sec. A.3], [8, sec. 3.2], and [21, p. 303].
Let denote the opposite category, and let and denote, respectively, the categories of -vector spaces and -left-modules. There are the following functor categories.
[TABLE]
Their homomorphism functors are denoted , , , and .
We think of them as the categories of -left-modules, -right-modules, -left--left-modules, and -bi-modules. They are abelian categories with enough projective and injective objects, which are in fact Grothendieck categories. In each of the categories , , and , a sequence of functors is short exact if is a short exact sequence in or for each . An object of can be viewed as an object of by forgetting the -structure on each for . We refer to Appendix A for additional information.
Definition 2.3**.**
The following are conditions we can impose on a small -preadditive category .
- (Fin)
Each -space of is finite dimensional over . If is fixed then except for finitely many . There is an integer such that .
- (Rad)
If then is a local -algebra, and the canonical map is an isomorphism of -algebras. If are in then .
- (SelfInj)
The category has a Serre functor, that is, a -linear autoequivalence such that there are natural isomorphisms where .
Note that the last part of condition (Rad) implies that different objects of are non-isomorphic. Conditions (Fin) and (Rad) imply that is a locally bounded spectroid in the terminology of [8, secs. 3.5 and 8.3], whence the functor categories over share many properties of module categories over a finite dimensional algebra, see Appendix A. If condition (SelfInj) also holds, then projective, injective, and flat objects coincide in each of and , see Paragraph A.6.
2.4****Special case: Quivers with relations.
Let be a quiver with relations over in the sense of [1, def. II.2.3]. Then can be viewed as a small -preadditive category: The objects are the vertices, and the morphism spaces are the -linear combinations of paths modulo relations. Composition of morphisms is induced by concatenation of paths.
Viewed as a quiver with relations, has a category of representations with values in . Viewed as a small -preadditive category, has the functor category . The categories and can be identified.
We say that is a self-injective quiver with relations if , viewed as a small -preadditive category, satisfies conditions (Fin), (Rad), and (SelfInj) of Definition 2.3.
The quivers with relations from the introduction are self-injective. In particular, the Serre functors are given as follows: For (0.1) by the shift , for (0.3) by the shift where is taken modulo , and for (0.4) by reflecting in a horizontal line through the vertices , then shifting one vertex to the right.
2.5****Special case: Finite quivers with relations.
Let be a self-injective quiver with relations over . Assume that is finite and connected, and that its relations are given by an admissible ideal in the path algebra over , see [1, def. II.2.1].
On the one hand, can be viewed as a small -preadditive category, which has the functor category . On the other hand, there is a finite dimensional algebra , which has the category of -left--left-modules. The categories and can be identified.
A more extensive list of identifications is given in Figure 1, where the entries in the first column are explained in Paragraph 2.2 and Appendix A. The list can be extended with - and -functors.
Note that since is a self-injective quiver with relations, is a self-injective algebra.
3. Proof of Theorem A
This section proves Theorem 3.2, which has Theorem A as a special case, see Paragraph 2.4.
Sections 3 through 6 are phrased in the language of functor categories over a small -preadditive category . A reader who prefers modules instead of functors can use Figure 1 to specialise everything to the case of modules over a finite dimensional self-injective algebra .
Setup 3.1**.**
Sections 3 through 6 use the following setup, which dovetails with Setups 1.1 and 2.1 so the results of Sections 1 and 2 can be used verbatim. We refer to Appendix A for additional information, in particular on several functors which will be used extensively: , , , , , , , .
- •
is a field.
- •
is a -algebra.
- •
is a small -preadditive category satisfying conditions (Fin), (Rad), and (SelfInj) of Definition 2.3.
- •
is the category of -left-modules.
- •
is the category of -linear functors .
The categories and have enough projective and enough injective objects by Paragraph A.4.
- •
is a cotorsion pair in .
- •
. The statement will be abbreviated .
- •
For each , there is a simple object and a simple object , see Paragraph A.4(i). The functors
[TABLE]
are defined by:
[TABLE]
There is an adjoint pair by Paragraph A.2(ii) and the observation that we have by Paragraph A.2(vi). There is an adjoint pair by Paragraph A.2(i).
- •
denotes either or ; these classes are equal because condition (Ex) of Definition 1.9 holds by Proposition 4.2.
Theorem 3.2**.**
If is a hereditary cotorsion pair in , then there are hereditary, compatible cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} in , where
[TABLE]
Proof.
The formulae for and are those of Definition 1.5 adapted to the present setup, so the results of Section 1 apply. In particular, the cotorsion pairs exist by Theorem 1.7. They are hereditary by Theorem 1.8 combined with Proposition 4.2 below. They are compatible by Theorem 1.11 combined with Propositions 4.2, 5.2, and 6.18 below. ∎
Theorem 3.3**.**
We have:
- (i)
If the cotorsion pair is generated by a set, then the cotorsion pair \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} is complete. 2. (ii)
Assume that arises from the special case described in Paragraph 2.5, so corresponds to a finite dimensional self-injective -algebra . If is closed under pure quotients, then the cotorsion pair \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} is complete.
Proof.
(i) Suppose that is a set of objects of which generates . This is still the case after adding the projective -left-module to . Then Lemma 1.12(ii) says that is a set of objects of which generates \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)}. This cotorsion pair is hence complete by [12, lem. 5.20] and [30, def. 3.11, prop. 3.13, and prop. 5.8]. Note that the proof of [12, lem. 5.20] goes through for because it has enough projective objects and enough injective objects by Paragraph A.4.
(ii) As explained in Paragraph 2.5, we can view \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} as a cotorsion pair in , hence as a cotorsion pair in , the category of left-modules over the -algebra , which will be denoted simply by . By [12, lem. 5.13(b) and lem. 5.20] and [14, thm. 2.5] it is enough to show that is closed under pure quotients.
Let
[TABLE]
be pure short exact in with . We will show , that is, and for each .
Given and we have that
[TABLE]
is exact, because is pure short exact in . The isomorphism is by [6, prop. IX.2.1]. Hence
[TABLE]
is pure short exact in . But implies whence since is closed under pure quotients.
Given we have that
[TABLE]
is exact, because is pure short exact in . Hence , viewed as a sequence of -left-modules, is pure short exact. But implies , so , viewed as a -left-module, is flat by Proposition 4.2. It follows that , viewed as a -left-module, is flat, so . ∎
We end this section with a description of the trivial objects in the model category structure on provided by Theorems 0.2 and 3.2. We thank an anonymous referee for drawing attention to this question.
Theorem 3.4**.**
If is a hereditary cotorsion pair in , and either of the cotorsion pairs \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} and \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} of Theorem 3.2 is complete (see Theorem 3.3), then the class of trivial objects (defined in Theorem 0.2) satisfies .
Proof.
The inclusion : By the first part of the first formula of Theorem 0.2, each sits in a short exact sequence in with , . We have by Definition 1.5. By Proposition 4.2 this means that and are injective when viewed as objects of . The same is hence true for , so by Proposition 4.2 again.
The inclusion : First, suppose \big{(}\Phi(\mathscr{A}),\Phi(\mathscr{A})^{\perp}\big{)} is complete. Given there is a short exact sequence in with , . By the first part of the first formula of Theorem 0.2 it is enough to show . We have by Definition 1.5. Proposition 4.2 says that and are projective when viewed as objects of . The same is hence true for , so by Proposition 4.2 again. Hence . It follows that, as desired, , see Equation (1.3) in the proof of Theorem 1.11. The theorem applies because conditions (Comp1), (Ex), and (Seq) (see Definitions 0.1(iv) and 1.9) hold by Propositions 4.2, 5.2, and 6.18 below.
Secondly, suppose \big{(}{}^{\perp}\Psi(\mathscr{B}),\Psi(\mathscr{B})\big{)} is complete. Then is proved similarly using the second part of the first formula of Theorem 0.2 and Equation (1.2). ∎
4. Condition (Ex)
Section 4 continues to use Setup 3.1. The aim is to prove Proposition 4.2, by which condition (Ex) of Definition 1.9 holds. This is used in the proof of Theorem 3.2. We also establish some other properties of the class .
Lemma 4.1**.**
If and then
- (i)
, 2. (ii)
,
and there are isomorphisms in ,
- (iii)
, 2. (iv)
,
natural in and .
Proof.
Parts (i) and (ii) follow from Equation (3.1) and Paragraph A.5. Parts (iii) and (iv) follow from parts (i) and (ii) combined with Paragraph A.5, parts (iii) and (ii). ∎
Proposition 4.2**.**
In the situation of Setup 3.1, condition (Ex) of Definition 1.9 holds, that is . We write and have
[TABLE]
Proof.
Combining Definition 1.5 and Lemma 4.1(i) shows
[TABLE]
Combining this with Equation (A.3) proves
[TABLE]
Similarly, combining Definition 1.5, Lemma 4.1(ii), and Equation (A.2) proves
[TABLE]
The proposition now follows from Equation (A.4). ∎
Lemma 4.3**.**
If has finite length and is injective, then .
Proof.
Let have the projective resolution in . Then
[TABLE]
Here (a) is by Paragraph A.2(ii) and (b) is because is injective. The isomorphism (c) is because consists of projective objects in , which are also projective when viewed as objects of by Paragraph A.4(iv). Finally, (d) is by Proposition 4.2.
Hence , and Paragraph A.2(vi) gives . However, by Paragraph A.4(i) the object has a finite filtration with quotients of the form for , so by Paragraph A.1(iv) the object has a finite filtration with quotients of the form for , and it follows that as claimed. ∎
Lemma 4.4**.**
We have as subcategories of where .
Proof.
The proof of [12, cor. 5.25] goes through for , so it is enough to see that is closed under syzygies. Let be a short exact sequence in with projective and . Then and are projective when viewed in , see Proposition 4.2 and Paragraph A.4(iv). Hence is projective when viewed in , so by Proposition 4.2. ∎
5. Condition (Comp1)
Section 5 continues to use Setup 3.1. The aim is to prove Proposition 5.2, by which condition (Comp1) of Definition 0.1(iv) holds. This is used in the proof of Theorem 3.2.
Lemma 5.1**.**
If and , then .
Proof.
The categories and have enough projective and injective objects by Paragraph A.4, and the functor is exact by Paragraph A.1(iv). Given we have by definition of , so Lemma 1.3 gives an isomorphism . The first is zero since by definition of , so the lemma follows. ∎
Proposition 5.2**.**
In the situation of Setup 3.1, condition (Comp1) of Definition 0.1 holds.
Proof.
If is given, then by definition of , so Proposition 4.2 says that is flat when viewed as an object of . This means that is exact, so the filtration (A.6) induces a filtration in :
[TABLE]
The final equality is by Equation (A.1). The quotients are
[TABLE]
where (a) is by Equation (A.7), while (b) uses that preserves coproducts, followed by Paragraph A.2(iv). However, by definition of , so Lemma 5.1 implies , whence also as desired. ∎
6. Condition (Seq)
Section 6 continues to use Setup 3.1. The aim is to prove Proposition 6.18 by which condition (Seq) of Definition 1.9 holds. This is used in the proof of Theorem 3.2.
Setup 6.1**.**
In addition to Setup 3.1, Section 6 uses the following setup.
- •
is an object of finite length. By Paragraph A.4(ii) it has an augmented minimal projective resolution, which we break into short exact sequences as follows.
[TABLE]
Each and each has finite length, and for each , the functors and vanish on the .
- •
is a module with an augmented injective resolution, which we break into short exact sequences as follows.
[TABLE]
Construction 6.2**.**
This construction consists of two parts labelled (i) and (ii).
(i) For each we define a short exact sequence
[TABLE]
in as follows:
If then (6.1) is defined to be
[TABLE]
If (6.1) has already been defined for a given value , then we use it as the last non-trivial column of the following diagram. The lower right square is a pullback, and the rows and columns are exact, see Paragraph A.1(iv).
[TABLE]
The row which contains is used as the first non-trivial row of the following diagram. The upper left square is a pushout, and the rows and columns are exact.
[TABLE]
The column which contains defines (6.1) for . Note that Diagrams (6.2) and (6.3) define a number of morphisms in addition to those in (6.1). The first steps of the construction give
[TABLE]
(ii) Part (i) permits us to construct a short exact sequence of inverse systems as follows: Set
[TABLE]
and
[TABLE]
Each is an epimorphism because each is an epimorphism by Diagram (6.3). Hence there is a short exact sequence of inverse systems, where it is easy to check that the induced morphisms are also epimorphisms:
[TABLE]
The inverse limits of the two first systems will be denoted
[TABLE]
The inverse limit of the third system is
[TABLE]
by Equation (6.4).
Remark 6.3**.**
If and are given, then we can set and in Setup 6.1. We will prove that if is hereditary, then the inverse limit of (6.5) is a short exact sequence
[TABLE]
which can be used as the sequence in condition (Seq)(ii) of Definition 1.9. This will be accomplished in Proposition 6.18.
As an example, suppose that is the quiver with relations (0.1), viewed as a -preadditive category. Then is the category of chain complexes over . If and we write , then
[TABLE]
with in degree , and
[TABLE]
The inverse limits become the augmented injective resolution
[TABLE]
with in degree , and the injective resolution
[TABLE]
With these and , the short exact sequence (6.8) is dual to a sequence with projective objects, which was used indirectly by Gillespie in his proof of compatibility, see the proof of [11, thm. 3.12].
Lemma 6.4**.**
If then .
Proof.
It follows from Definition 1.5 that contains and is closed under extensions. Diagram (6.2) contains the short exact sequence , so it is enough to show for each . However, for we have by Lemma 4.1(iii). Since is projective, this is . This shows . ∎
Lemma 6.5**.**
If and then there is a short exact sequence
[TABLE]
Proof.
By Paragraph A.1(iv) the functor is exact. Applying it to the short exact sequence gives the sequence in the lemma by Lemma 4.1(iv). ∎
Lemma 6.6**.**
If and then:
- (i)
There is a short exact sequence
[TABLE] 2. (ii)
There is an isomorphism
[TABLE]
Proof.
The functor is left exact, so applying it to the short exact sequence (6.1) gives a long exact sequence
[TABLE]
This implies both parts of the lemma because by Proposition 4.2 and Lemma 6.4. ∎
Lemma 6.7**.**
If and then there is an exact sequence
[TABLE]
Proof.
Since is left-exact and a monomorphism, is injective. But Setup 6.1 implies
[TABLE]
so we conclude . By Lemma 4.1(iv) this implies
[TABLE]
Now observe that the left exact functor preserves the pullback in Diagram (6.2), so there is the following pullback square.
[TABLE]
Combining with Equation (6.9) proves the lemma. ∎
Lemma 6.8**.**
If and then .
Proof.
If , then can be applied to Diagram (6.3). Replacing the third non-trivial column by the images of the relevant morphisms gives the following commutative diagram.
[TABLE]
It is enough to show that the third non-trivial column is a short exact sequence. We use the Nine Lemma, so have to show that the rows and the first two non-trivial columns are short exact. The row which contains an identity morphism is trivially short exact. Since is left-exact, the other rows are short exact by construction. The first non-trivial column is short exact by Lemma 6.5 and the second by Lemma 6.6(i). ∎
Lemma 6.9**.**
If and then .
Proof.
Using Lemmas 6.6(i), 6.7, and 6.8 gives the equalities
[TABLE]
Lemma 6.10**.**
If and then there are short exact sequences:
- (i)
, 2. (ii)
,
where is the canonical inclusion and is induced by .
Proof.
Applying the left exact functor to the short exact sequence (6.1) gives a long exact sequence containing
[TABLE]
The last term is zero by Proposition 4.2 and Lemma 6.4, and by Lemma 6.9, so we get the sequence (i).
Diagram (6.3) contains the short exact sequence . Applying the left exact functor gives the sequence (ii). ∎
Definition 6.11**.**
If and , then is the unique morphism which makes the following square commutative, where the vertical morphisms are the canonical inclusions.
[TABLE]
Lemma 6.12**.**
If and then there is a short exact sequence
[TABLE]
Proof.
In view of Lemma 4.1(iv), it is enough to show that there is a commutative diagram as follows, in which the first non-trivial row is a short exact sequence.
[TABLE]
To construct the diagram, observe that it has three non-trivial columns, each of which is short exact. The first comes from Lemma 6.5, the second from Lemma 6.10(i), and the third is trivial. As for the morphisms between the columns, is obtained from Diagram (6.3), which also shows that the lower left square is commutative. There is a unique induced morphism making the upper left square commutative. The morphism is induced by , and the upper right square is commutative by Definition 6.11. The lower right square is trivially commutative.
We use the Nine Lemma, so it remains to show that the last two non-trivial rows are short exact. The row which contains an identity morphism is trivially short exact, and the row above it is short exact by Lemma 6.10(ii). ∎
Lemma 6.13**.**
If and then .
Proof.
If then Diagram (6.3) contains a short exact sequence . It induces a long exact sequence containing
[TABLE]
so it is enough to see that is an epimorphism.
Setup 6.1 gives an epimorphism , and
[TABLE]
is an epimorphism because Lemma 4.1(iv) says it can be identified with the morphism obtained by applying the exact functor to . Combining this with Lemma 6.6(ii) shows that applying to the lower square in Diagram (6.3) gives the following commutative square with an epimorphism on the left and an isomorphism on the right.
[TABLE]
Hence is an epimorphism as desired. ∎
Lemma 6.14**.**
For each we have:
- (i)
, 2. (ii)
There is a short exact sequence
[TABLE]
Proof.
Recall from Construction 6.2(ii) that is the inverse limit of . Each is an epimorphism by Diagram (6.3), so this system satisfies the Mittag-Leffler condition and there is a short exact sequence
[TABLE]
see Paragraph A.7. It gives a long exact sequence containing
[TABLE]
Combining Equation (3.1) and Paragraph A.5(i) shows that there are natural isomorphisms
[TABLE]
so (6.10) can be identified with
[TABLE]
which implies both parts of the lemma. ∎
Lemma 6.15**.**
Assume that is hereditary, that , and that has finite length. If and then .
Proof.
Since is hereditary, for each by [12, lem. 5.24]. Since has finite length, by Paragraph A.4(v). Hence is in because it is a finite coproduct of copies of . ∎
Lemma 6.16**.**
Assume that is hereditary and that . Then
[TABLE]
is in .
Proof.
Since , the Lukas Lemma implies that it is enough to show the following, see Paragraph A.7.
- (i)
is an epimorphism for . 2. (ii)
. 3. (iii)
for .
Lemma 6.12 gives (i). It also gives for , and this is in by Lemma 6.15 since has finite length by Setup 6.1. This shows (iii).
To show (ii), we compute:
[TABLE]
Here (a) is by Lemma 6.9. For (b), apply the left exact functor to the short exact sequence (6.1) for . Equation (6.4) implies (c), and Lemma 4.1(iv) implies (d). But by Lemma 6.15 since has finite length by Setup 6.1. ∎
Lemma 6.17**.**
Assume that is hereditary and that . Then .
Proof.
Let be given. By Definition 1.5 we must show and .
: Lemma 6.10(i) gives the vertical short exact sequences in the following diagram.
[TABLE]
The upper squares are commutative by Definition 6.11, and the lower squares are obviously commutative, so the diagram constitutes a short exact sequence of inverse systems. The long exact sequence contains
[TABLE]
where the last term is zero because all morphisms in the third inverse system are zero. This gives the first of the following isomorphisms,
[TABLE]
and the second isomorphism is by Lemma 6.14(i). However, the left hand side is in by Lemma 6.16.
: We show this without using the assumption . If and then the epimorphism in the short exact sequence of Lemma 6.12 shows
[TABLE]
Hence the system
[TABLE]
satisfies the Mittag-Leffler condition, so the first term of the exact sequence in Lemma 6.14(ii) is zero, see Paragraph A.7. The last term is zero because Lemma 6.13 says that the morphisms vanish in the inverse system
[TABLE]
Hence as desired. ∎
Proposition 6.18**.**
In the situation of Setup 3.1, if is hereditary then condition (Seq) of Definition 1.9 holds.
Proof.
We show condition (Seq)(ii). Condition (Seq)(i) follows by a dual argument, parts of which are simplified by exactness of direct limits.
Let and be given. Set and in Setup 6.1. Consider the short exact sequence of inverse systems (6.5). The morphisms in the inverse systems are epimorphisms, so Paragraph A.7 says there is an induced short exact sequence
[TABLE]
which by Equations (6.6) and (6.7) reads
[TABLE]
where we have used by Equation (3.1). We claim this sequence can be used as the sequence in condition (Seq)(ii).
We have by Lemma 6.17, so it remains to show . By Lemma 4.4 it is enough to show . The Lukas Lemma can be applied to the first inverse system in (6.5) because is an epimorphism for . Hence it is sufficient to show the following, see Paragraph A.7.
- (i)
. 2. (ii)
for .
But (i) is trivially true because . For (ii), let be given. From Diagram (6.5) it is easy to prove the first of the isomorphisms
[TABLE]
and the second isomorphism is by Diagram (6.3). But has finite length and is injective by Setup 6.1, so by Lemma 4.3. ∎
7. Proof of Theorem B
Section 7 continues to use Setup 3.1, except that:
- •
is the quiver with relations (0.3), viewed as a -preadditive category; see Section 0.vi.
We think of objects of and as quiver representations. In particular, the value of at is denoted , instead of which would be used if we thought of as a functor. Recall from Section 0.vi that each has the form
[TABLE]
where two consecutive morphisms compose to [math]. For there is a homology functor defined in an obvious fashion.
Lemma 7.1**.**
For and we have
[TABLE]
with subscripts taken modulo .
Proof.
The functor sends an object to an object which has at vertex and [math] at all other vertices. The two first formulae in the lemma are easily verified to define left and right adjoint functors to , hence define and .
The simple object has at vertex and [math] at every other vertex. There is an indecomposable projective object , see Paragraph A.4(i). It has copies of at vertices and and [math] at every other vertex. The homomorphism between the copies of is the identity map, and vertices are taken modulo . This permits to determine the minimal augmented projective resolution of in . The first terms are the following, with indices taken modulo .
[TABLE]
Each morphism of projective objects is induced by an arrow in . We can now compute by using the projective resolution and Paragraph A.4(iii). This gives the third formula in the lemma, and the fourth formula is proved similarly. ∎
Proof of Theorem B.
Paragraph 2.4 means that Theorems 3.2 and 3.3 apply to the setup of Theorem B. The formulae for and in Theorem 3.2 can be converted into the formulae in Theorem B, part (i) by using Lemma 7.1, and Theorem 3.3 implies Theorem B, part (ii). ∎
8. Proof of Theorem C
Section 8 continues to use Setup 3.1, except that:
- •
is the repetitive quiver modulo the mesh relations, viewed as a -preadditive category; see Section 0.vii.
As in Section 7 we think of objects of and as quiver representations. For there is an arrow in , so a corresponding homomorphism for each . This and similar homomorphisms are used in the following two lemmas.
Lemma 8.1**.**
For and we have:
- (i)
The functors are given by
[TABLE] 2. (ii)
The functors are given by
[TABLE]
Proof.
The functor sends an object to an object which has at vertex and [math] at all the other vertices. The formulae in the lemma are easily verified to define left and right adjoint functors to , hence define and . ∎
Lemma 8.2**.**
For and we have:
[TABLE]
Here denotes the homology of a three term chain complex, taken at the middle term. The mesh relations imply that the arguments of are indeed chain complexes.
Proof.
For readability, the simple object of is denoted . It has at vertex and [math] at every other vertex. The indecomposable projective object of is denoted . It is one of the following, where in each case, one of the vertices is identified by a superscript.
[TABLE]
This permits to determine the minimal augmented projective resolutions of the simple objects in . In each case, the first terms are the following.
[TABLE]
Each morphism of projective objects is induced by arrows in . We can now compute by using the projective resolutions and Paragraph A.4(iii), and this gives the formulae in the lemma. ∎
Proof of Theorem C.
Paragraph 2.4 means that Theorem 3.2 applies to the setup of Theorem C. The formulae for and in Theorem 3.2 can be converted into the formulae in Theorem C by combining Definition 1.5, Proposition 4.2, and Lemmas 8.1 and 8.2. ∎
Appendix A Compendium on functor categories
In this appendix, , , and are as in Setup 3.1: is a field, a -algebra, a small -preadditive category satisfying conditions (Fin), (Rad), and (SelfInj) of Definition 2.3. The homomorphism functor and the radical of will be denoted and , see [1, sec. A.3], [8, sec. 3.2], and [21, p. 303].
The appendix explains some properties of the functor categories , , , and from Paragraph 2.2, which are used extensively in Sections 3 through 6. They share many properties of the module categories , , , and , where is a finite dimensional -algebra. This follows from conditions (Fin) and (Rad), which imply that is a locally bounded spectroid in the terminology of [8, secs. 3.5 and 8.3]. We can even think of as self-injective because condition (SelfInj) implies that projective, injective, and flat objects coincide in each of and , see Paragraph A.6.
Note that each statement in the appendix for has an analogue for .
The appendix has been included because we do not have references for all the results we need on functor categories. Some hold by [8] as we shall point out along the way. The rest follow by amending the proofs in the following references: [2, chp. 1], [3, secs. 1-4], [4, secs. 1 and 2], [19, app. B], [25].
A.1****Hom and tensor functors.
The following functors are used extensively in this paper.
- (i)
The homomorphism functor of is
[TABLE]
It is defined by being the set of -linear natural transformations for .
If , then is a -linear functor , so acts on . Hence can also be viewed as a functor
[TABLE] 2. (ii)
There are functors
[TABLE]
see [25, p. 93]. They are right exact in each variable, and the last of them satisfies
[TABLE]
naturally in . This makes sense because is an object of . 3. (iii)
There is a functor
[TABLE]
defined by
[TABLE]
where on the right hand side is of -vector spaces. It is exact in both variables. 4. (iv)
There is a functor
[TABLE]
defined by
[TABLE]
where on the right hand side is tensor of -vector spaces. It is exact in both variables. 5. (v)
There is a functor
[TABLE]
defined by
[TABLE]
where on the right hand side is tensor of -vector spaces. It is exact in both variables. 6. (vi)
We can view as a functor .
A.2****Standard isomorphisms.
The functors from Paragraph A.1 permit the following standard isomorphisms, among others.
- (i)
There is an adjunction isomorphism in ,
[TABLE]
natural in , , . 2. (ii)
There is an adjunction isomorphism in ,
[TABLE]
natural in , , . 3. (iii)
There is an associativity isomorphism in ,
[TABLE]
natural in , , , where on the left hand side is tensor of -vector spaces. 4. (iv)
There is an associativity isomorphism in ,
[TABLE]
natural in , , . 5. (v)
There is a morphism in ,
[TABLE]
natural in , . It is an isomorphism if has finite length. Note that on the left hand side is tensor of -vector spaces. 6. (vi)
There is a morphism in ,
[TABLE]
natural in , . It is an isomorphism if has finite length.
A.3****Products and coproducts.
We will explain products and coproducts in . What we say applies equally to and .
Let be a family of objects of . The product of the in is given by
[TABLE]
where the second is in . There is a similar formula for . This implies that inherits the following properties from : It is complete and cocomplete, and products, coproducts, and filtered colimits preserve exact sequences.
Each of the tensor product functors from Paragraph A.1 preserves coproducts in each variable.
A.4****Projective, injective, and simple objects.
Each of the categories , , , and has enough projective objects and enough injective objects. We list some additional properties.
- (i)
By [8, sec. 3.7] we have the following: For each there is an indecomposable projective object
[TABLE]
in . By conditions (Fin) and (Rad) of Definition 2.3, it has finite length and there is a unique maximal subobject given by . The quotient
[TABLE]
is a simple object in , which satisfies
[TABLE]
The simple objects of are precisely the for . The simple objects of are precisely the duals for . 2. (ii)
By [8, p. 85, exa. 2] we have the following: Each has an augmented projective resolution
[TABLE]
which can be constructed by choosing an epimorphism with projective, then, when has been defined, choosing an epimorphism and defining to be the composition .
If has finite length, then condition (Fin) of Definition 2.3 implies that each can be chosen as a coproduct of finitely many objects of the form , and then each and each has finite length. Moreover, by choosing each of the epimorphisms and as a projective cover, we can even make the resolution minimal, that is, if then is in the radical of . This implies that the functors and vanish on . 3. (iii)
A morphism in induces a natural transformation , that is, a morphism . By Yoneda’s Lemma, this in turn induces a commutative square
[TABLE]
natural in , where the vertical arrows are isomorphisms. 4. (iv)
If is a projective object of , then is projective when viewed as an object of . 5. (v)
have finite length .
A.5** and functors.**
The functors and of Paragraph A.1 have right and left derived functors,
[TABLE]
for . Like and they can also be viewed as functors
[TABLE]
We list some additional properties.
- (i)
Since products preserve exact sequences, there are isomorphisms in ,
[TABLE]
natural in and . 2. (ii)
The morphism in Paragraph A.2(v) induces standard morphisms in ,
[TABLE]
natural in , . They are isomorphisms if has finite length. 3. (iii)
The isomorphism in Paragraph A.2(iii) induces standard isomorphisms in ,
[TABLE]
natural in , , .
A.6****Criteria for injectivity and flatness.
Condition (Fin) of Definition 2.3 implies that satisfies
[TABLE]
Similarly, is flat if the functor is exact, and
[TABLE]
Conditions (Fin) and (SelfInj) of Definition 2.3 imply that satisfies
[TABLE]
A.7****Inverse limits.
We will explain inverse limits in . What we say applies equally to and .
Since products exist and preserve exact sequences, the results on (derived) inverse limits in [31, sec. 3.5] apply. In particular, if there is an inverse system
[TABLE]
then there is an exact sequence
[TABLE]
where is the difference between the identity morphism and the shift morphism induced by the .
The inverse system is said to satisfy the Mittag-Leffler condition if, for each , the images of the maps for satisfy the descending chain condition. In this case we have . This holds in particular if each morphism in (A.5) is an epimorphism.
If there is a short exact sequence
[TABLE]
of inverse systems, then there is an induced long exact sequence
[TABLE]
If each morphism in the -system is an epimorphism, then and there is a short exact sequence
[TABLE]
Some of the results on inverse limits in [12, sec. 6] also apply. In particular, the Lukas Lemma says that if is fixed, then in order to conclude , it is enough to verify the following for the inverse system (A.5), see [12, lem. 6.37].
- (i)
is an epimorphism for . 2. (ii)
. 3. (iii)
for .
A.8****The radical filtration.
If then the ’th power of the radical, , is an object of . Because of condition (Rad) of Definition 2.3, there is a finite filtration in ,
[TABLE]
where is chosen minimal such that . Each quotient is annihilated on both sides by , and this implies
[TABLE]
for certain integers .
Acknowledgement. We thank an anonymous referee for reading the paper carefully and making a number of useful suggestions.
We thank Jim Gillespie, Osamu Iyama, Berhard Keller, Sondre Kvamme, and Hiroyuki Minamoto for a number of illuminating comments, and Bernhard Keller for pointing out references [8] and [22].
This work was supported by EPSRC grant EP/P016014/1 “Higher Dimensional Homological Algebra” and LMS Scheme 4 Grant 41664.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Assem, D. Simson, and A. Skowroński, “Elements of the representation theory of associative algebras”, Vol. 1, London Math. Soc. Stud. Texts, Vol. 65, Cambridge University Press, Cambridge, 2006.
- 2[2] M. Auslander, “Representation dimension of Artin algebras”, Queen Mary College Mathematics Notes, Queen Mary College, London, 1971. Reprinted pp. 505–574 in: “Selected works of Maurice Auslander”, Vol. 1 (edited by Reiten, Smalø, and Solberg), American Mathematical Society, Providence, 1999.
- 3[3] M. Auslander, Representation theory of Artin algebras I , Comm. Algebra 1 (1974), 177–268.
- 4[4] M. Auslander, Representation theory of Artin algebras II , Comm. Algebra 1 (1974), 269–310.
- 5[5] L. Bican, R. El Bashir, and E. E. Enochs, All modules have flat covers , Bull. London Math. Soc. 33 (2001), 385–390.
- 6[6] H. Cartan and S. Eilenberg, “Homological algebra”, Princeton University Press, Princeton, 1956. Reprinted in: Princeton Landmarks Math., Princeton University Press, Princeton, 1999.
- 7[7] N. Ding and X. Yang, On a question of Gillespie , Forum Math. 27 (2015), 3205–3231.
- 8[8] P. Gabriel and A. V. Roiter, “Algebra VIII: Representations of finite-dimensional algebras”, with a chapter by B. Keller, Encyclopaedia Math. Sci., Vol. 73, Springer-Verlag, Berlin, 1992.
