The Stacks project

Lemma 85.24.2. In Situation 85.24.1. Assume negative self-exts of $E_ U$ in $D(\mathcal{O}_{u(U)})$ are zero. Let $L$ be a simplicial object of $\text{SR}(\mathcal{B})$. Consider the simplicial object $K = u(L)$ of $\text{SR}(\mathcal{C})$ and let $((\mathcal{C}/K)_{total}, \mathcal{O})$ be as in Remark 85.16.5. There exists a cartesian object $E$ of $D(\mathcal{O})$ such that writing $L_ n = \{ U_{n, i}\} _{i \in I_ n}$ the restriction of $E$ to $D(\mathcal{O}_{\mathcal{C}/u(U_{n, i})})$ is $E_{U_{n, i}}$ compatibly (see proof for details). Moreover, $E$ is unique up to unique isomorphism.

Proof. Recall that $\mathop{\mathit{Sh}}\nolimits (\mathcal{C}/K_ n) = \prod _{i \in I_ n} \mathop{\mathit{Sh}}\nolimits (\mathcal{C}/u(U_{n, i}))$ and similarly for the categories of modules. This product decomposition is also inherited by the derived categories of sheaves of modules. Moreover, this product decomposition is compatible with the morphisms in the simplicial semi-representable object $K$. See Section 85.15. Hence we can set $E_ n = \prod _{i \in I_ n} E_{U_{n, i}}$ (“formal” product) in $D(\mathcal{O}_ n)$. Taking (formal) products of the maps $\rho _ a$ of Situation 85.24.1 we obtain isomorphisms $E_\varphi : f_\varphi ^*E_ n \to E_ m$. The assumption about compostions of the maps $\rho _ a$ immediately implies that $(E_ n, E_\varphi )$ defines a simplicial system of the derived category of modules as in Definition 85.14.1. The vanishing of negative exts assumed in the lemma implies that $\mathop{\mathrm{Hom}}\nolimits (E_ n[t], E_ n) = 0$ for $n \geq 0$ and $t > 0$. Thus by Lemma 85.14.7 we obtain $E$. Uniqueness up to unique isomorphism follows from Lemmas 85.14.5 and 85.14.6. $\square$

Comments (0)

There are also:

  • 2 comment(s) on Section 85.24: Glueing complexes

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