The Stacks project

Definition 63.8.1. Let $T: \mathcal{A} \to \mathcal{B}$ be a left exact functor and assume that $\mathcal{A}$ has enough injectives. Define $RT: DF^+(\mathcal{A}) \to D F^+(\mathcal{B})$ to fit in the diagram

\[ \xymatrix{ DF^+(\mathcal{A}) \ar[r]^{RT} & DF^+(\mathcal{B}) \\ K^+(\mathcal{I}) \ar[u] \ar[r]^{T \quad } & K^+(\text{Fil}^ f(\mathcal{B})). \ar[u]} \]

This is well-defined by the previous lemma. Let $G: \mathcal{A} \to \mathcal{B}$ be a right exact functor and assume that $\mathcal{A}$ has enough projectives. Define $LG: DF^+(\mathcal{A}) \to DF^+(\mathcal{B})$ to fit in the diagram

\[ \xymatrix{ DF^-(\mathcal{A}) \ar[r]^{LG} & DF^-(\mathcal{B}) \\ K^-(\mathcal{P}) \ar[u] \ar[r]^{G \quad } & K^-(\text{Fil}^ f(\mathcal{B})). \ar[u]} \]

Again, this is well-defined by the previous lemma. The functors $RT$, resp. $LG$, are called the filtered derived functor of $T$, resp. $G$.


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 03TD. Beware of the difference between the letter 'O' and the digit '0'.