Processing math: 100%

The Stacks project

Proof. For any object W of \mathcal{C} the functor \mathcal{F} \mapsto \mathcal{F}(W) is an additive exact functor from \textit{PAb}(\mathcal{C}) to \textit{Ab}. The terms \check{\mathcal{C}}^ p(\mathcal{U}, \mathcal{F}) of the complex are products of these exact functors and hence exact. Moreover a sequence of complexes is exact if and only if the sequence of terms in a given degree is exact. Hence the lemma follows. \square


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.