The Stacks project

Lemma 13.13.8. Let $\mathcal{A}$ be an abelian category. Let $K^\bullet \in K(\text{Fil}^ f(\mathcal{A}))$.

  1. If $H^ n(\text{gr}(K^\bullet )) = 0$ for all $n < a$, then there exists a filtered quasi-isomorphism $K^\bullet \to L^\bullet $ with $L^ n = 0$ for all $n < a$.

  2. If $H^ n(\text{gr}(K^\bullet )) = 0$ for all $n > b$, then there exists a filtered quasi-isomorphism $M^\bullet \to K^\bullet $ with $M^ n = 0$ for all $n > b$.

  3. If $H^ n(\text{gr}(K^\bullet )) = 0$ for all $|n| \gg 0$, then there exists a commutative diagram of morphisms of complexes

    \[ \xymatrix{ K^\bullet \ar[r] & L^\bullet \\ M^\bullet \ar[u] \ar[r] & N^\bullet \ar[u] } \]

    where all the arrows are filtered quasi-isomorphisms, $L^\bullet $ bounded below, $M^\bullet $ bounded above, and $N^\bullet $ a bounded complex.

Proof. Suppose that $H^ n(\text{gr}(K^\bullet )) = 0$ for all $n < a$. By Homology, Lemma 12.19.15 the sequence

\[ K^{a - 1} \xrightarrow {d^{a - 2}} K^{a - 1} \xrightarrow {d^{a - 1}} K^ a \]

is an exact sequence of objects of $\mathcal{A}$ and the morphisms $d^{a - 2}$ and $d^{a - 1}$ are strict. Hence $\mathop{\mathrm{Coim}}(d^{a - 1}) = \mathop{\mathrm{Im}}(d^{a - 1})$ in $\text{Fil}^ f(\mathcal{A})$ and the map $\text{gr}(\mathop{\mathrm{Im}}(d^{a - 1})) \to \text{gr}(K^ a)$ is injective with image equal to the image of $\text{gr}(K^{a - 1}) \to \text{gr}(K^ a)$, see Homology, Lemma 12.19.13. This means that the map $K^\bullet \to \tau _{\geq a}K^\bullet $ into the truncation

\[ \tau _{\geq a}K^\bullet = (\ldots \to 0 \to K^ a/\mathop{\mathrm{Im}}(d^{a - 1}) \to K^{a + 1} \to \ldots ) \]

is a filtered quasi-isomorphism. This proves (1). The proof of (2) is dual to the proof of (1). Part (3) follows formally from (1) and (2). $\square$

Comments (1)

Comment #9777 by ZL on

Typo:

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 05S5. Beware of the difference between the letter 'O' and the digit '0'.



View Lemma 13.13.8 as pdf