The Stacks project

Lemma 13.18.3. Let $\mathcal{A}$ be an abelian category. Assume $\mathcal{A}$ has enough injectives.

  1. Any object of $\mathcal{A}$ has an injective resolution.

  2. If $H^ n(K^\bullet ) = 0$ for all $n \ll 0$ then $K^\bullet $ has an injective resolution.

  3. If $K^\bullet $ is a complex with $K^ n = 0$ for $n < a$, then there exists an injective resolution $\alpha : K^\bullet \to I^\bullet $ with $I^ n = 0$ for $n < a$ such that each $\alpha ^ n : K^ n \to I^ n$ is injective.

Proof. Proof of (1). First choose an injection $A \to I^0$ of $A$ into an injective object of $\mathcal{A}$. Next, choose an injection $I_0/A \to I^1$ into an injective object of $\mathcal{A}$. Denote $d^0$ the induced map $I^0 \to I^1$. Next, choose an injection $I^1/\mathop{\mathrm{Im}}(d^0) \to I^2$ into an injective object of $\mathcal{A}$. Denote $d^1$ the induced map $I^1 \to I^2$. And so on. By Lemma 13.18.2 part (2) follows from part (3). Part (3) is a special case of Lemma 13.15.5. $\square$

Comments (1)

Comment #8413 by on

I think one can refer the whole proof to 13.15.5. For part (1), one uses the fact that an injective resolution of is the same as a quasi-isomorphism into a complex with injective terms such that for . Part (2) is 13.15.5, (2).

There are also:

  • 1 comment(s) on Section 13.18: Injective resolutions

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