Loading [MathJax]/extensions/tex2jax.js

The Stacks project

64.8 Filtered derived functors

And then there are the filtered derived functors.

Definition 64.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$.

Proposition 64.8.2. In the situation above, we have

\[ \text{gr}^ p \circ RT = RT \circ \text{gr}^ p \]

where the $RT$ on the left is the filtered derived functor while the one on the right is the total derived functor. That is, there is a commuting diagram

\[ \xymatrix{ DF^+(\mathcal{A}) \ar[r]^{RT} \ar[d]_{\text{gr}^ p} & DF^+(\mathcal{B}) \ar[d]^{\text{gr}^ p}\\ D^+(\mathcal{A}) \ar[r]^{RT} & D^+(\mathcal{B}).} \]

Proof. Omitted. $\square$

Given $K^\bullet \in DF^+(\mathcal{B})$, we get a spectral sequence

\[ E_1^{p, q} = H^{p+q}(\text{gr}^ p K^\bullet ) \Rightarrow H^{p+q}(\text{forget filt}(K^\bullet )). \]

Comments (0)


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.