Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Triangular Matrix Categories II: Recollements and functorially finite subcategories (1903.03926v1)

Published 10 Mar 2019 in math.CT

Abstract: In this paper we continue the study of triangular matrix categories $\mathbf{\Lambda}=\left[ \begin{smaLLMatrix} \mathcal{T} & 0 \ M & \mathcal{U} \end{smaLLMatrix}\right]$ initiated in [21]. First, given an additive category $\mathcal{C}$ and an ideal $\mathcal{I}{\mathcal{B}}$ in $\mathcal{C}$, we prove a well known result that there is a canonical recollement $\xymatrix{\mathrm{Mod}(\mathcal{C}/\mathcal{I}{\mathcal{B}})\ar[r]{} & \mathrm{Mod}(\mathcal{C})\ar[r]{}\ar@<-1ex>[l]{}\ar@<1ex>[l]{} & \mathrm{Mod}(\mathcal{B})\ar@<-1ex>[l]{}\ar@<1ex>[l]{}}$. We show that given a recollement between functor categories we can induce a new recollement between triangular matrix categories, this is a generalization of a result given by Chen and Zheng in [11, theorem 4.4]. In the case of dualizing $K$-varieties we can restrict the recollement we obtained to the categories of finitely presented functors. Given a dualizing variety $\mathcal{C}$, we describe the maps category of $\mathrm{mod}(\mathcal{C})$ as modules over a triangular matrix category and we study its Auslander-Reiten sequences and contravariantly finite subcategories, in particular we generalize several results from [24]. Finally, we prove a generalization of a result due to {Smal\o} ([35, Theorem 2.1]), which give us a way of construct functorially finite subcategories in the category $\mathrm{Mod}\Big(\left[ \begin{smaLLMatrix} \mathcal{T} & 0 \ M & \mathcal{U} \end{smaLLMatrix}\right]\Big)$ from those of $\mathrm{Mod}(\mathcal{T})$ and $\mathrm{Mod}(\mathcal{U})$.

Summary

We haven't generated a summary for this paper yet.