The Stacks project

Lemma 13.14.3. Assumptions and notation as in Situation 13.14.1. Let $f : X \to Y$ be a morphism of $\mathcal{D}$.

  1. If $RF$ is defined at $X$ and $Y$ then there exists a unique morphism $RF(f) : RF(X) \to RF(Y)$ between the values such that for any commutative diagram

    \[ \xymatrix{ X \ar[d]_ f \ar[r]_ s & X' \ar[d]^{f'} \\ Y \ar[r]^{s'} & Y' } \]

    with $s, s' \in S$ the diagram

    \[ \xymatrix{ F(X) \ar[d] \ar[r] & F(X') \ar[d] \ar[r] & RF(X) \ar[d] \\ F(Y) \ar[r] & F(Y') \ar[r] & RF(Y) } \]

    commutes.

  2. If $LF$ is defined at $X$ and $Y$ then there exists a unique morphism $LF(f) : LF(X) \to LF(Y)$ between the values such that for any commutative diagram

    \[ \xymatrix{ X' \ar[d]_{f'} \ar[r]_ s & X \ar[d]^ f \\ Y' \ar[r]^{s'} & Y } \]

    with $s, s'$ in $S$ the diagram

    \[ \xymatrix{ LF(X) \ar[d] \ar[r] & F(X') \ar[d] \ar[r] & F(X) \ar[d] \\ LF(Y) \ar[r] & F(Y') \ar[r] & F(Y) } \]

    commutes.

Proof. Part (1) holds if we only assume that the colimits

\[ RF(X) = \mathop{\mathrm{colim}}\nolimits _{s : X \to X'} F(X') \quad \text{and}\quad RF(Y) = \mathop{\mathrm{colim}}\nolimits _{s' : Y \to Y'} F(Y') \]

exist. Namely, to give a morphism $RF(X) \to RF(Y)$ between the colimits is the same thing as giving for each $s : X \to X'$ in $\mathop{\mathrm{Ob}}\nolimits (X/S)$ a morphism $F(X') \to RF(Y)$ compatible with morphisms in the category $X/S$. To get the morphism we choose a commutative diagram

\[ \xymatrix{ X \ar[d]_ f \ar[r]_ s & X' \ar[d]^{f'} \\ Y \ar[r]^{s'} & Y' } \]

with $s, s'$ in $S$ as is possible by MS2 and we set $F(X') \to RF(Y)$ equal to the composition $F(X') \to F(Y') \to RF(Y)$. To see that this is independent of the choice of the diagram above use MS3. Details omitted. The proof of (2) is dual. $\square$

Comments (2)

Comment #8375 by on

To hive more hints at the reader, maybe one could expand "to see that this is independent of the choice of the diagram above use MS3 and the fact that is filtered. To see after that these well-defined morphisms are compatible with the morphisms in , use also MS3 plus filteredness of . Details ommited."

There are also:

  • 4 comment(s) on Section 13.14: Derived functors in general

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



View Lemma 13.14.3 as pdf