Preresolving categories and derived equivalences

From MaRDI portal
Publication:6352199




Abstract: It is well known that a resolving subcategory mathcalA of an abelian subcategory mathcalE induces several derived equivalences: a triangle equivalence mathbfD(mathcalA)omathbfD(mathcalE) exists in general and furthermore restricts to a triangle equivalence mathbfDmathsfb(mathcalA)omathbfDmathsfb(mathcalE) if operatornameres.dimmathcalA(E)<infty for any object EinmathcalE. If the category mathcalE is uniformly bounded, i.e. operatornameres.dimmathcalA(mathcalE)<infty, one obtains a triangle equivalence mathbfD(mathcalA)omathbfD(mathcalE). In this paper, we show that all of the above statements hold for preresolving subcategories of (one-sided) exact categories. By passing to a one-sided language, one can remove the assumption that mathcalAsubseteqmathcalE is extension-closed completely from the classical setting, yielding easier criteria and more examples. To illustrate this point, we consider the Isbell category mathcalI and show that mathcalIsubseteqmathsfAb is preresolving but mathcalI cannot be realized as an extension-closed subcategory of an exact category. We also consider a criterion given by Keller to produce derived equivalences of fully exact subcategories. We show that this criterion fits into the framework of preresolving subcategories by considering the relative weak idempotent completion of said subcategory.











This page was built for publication: Preresolving categories and derived equivalences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6352199)