The Stacks project

35.36 Descent data in terms of sheaves

Here is another way to think about descent data in case of a covering on a site.

Lemma 35.36.1. Let $\tau \in \{ Zariski, fppf, {\acute{e}tale}, smooth, syntomic\} $1. Let $\mathit{Sch}_\tau $ be a big $\tau $-site. Let $S \in \mathop{\mathrm{Ob}}\nolimits (\mathit{Sch}_\tau )$. Let $\{ S_ i \to S\} _{i \in I}$ be a covering in the site $(\mathit{Sch}/S)_\tau $. There is an equivalence of categories

\[ \left\{ \begin{matrix} \text{descent data }(X_ i, \varphi _{ii'})\text{ such that} \\ \text{each }X_ i \in \mathop{\mathrm{Ob}}\nolimits ((\mathit{Sch}/S)_\tau ) \end{matrix} \right\} \leftrightarrow \left\{ \begin{matrix} \text{sheaves }F\text{ on }(\mathit{Sch}/S)_\tau \text{ such that} \\ \text{each }h_{S_ i} \times F\text{ is representable} \end{matrix} \right\} . \]

Moreover,

  1. the objects representing $h_{S_ i} \times F$ on the right hand side correspond to the schemes $X_ i$ on the left hand side, and

  2. the sheaf $F$ is representable if and only if the corresponding descent datum $(X_ i, \varphi _{ii'})$ is effective.

Proof. We have seen in Section 35.10 that representable presheaves are sheaves on the site $(\mathit{Sch}/S)_\tau $. Moreover, the Yoneda lemma (Categories, Lemma 4.3.5) guarantees that maps between representable sheaves correspond one to one with maps between the representing objects. We will use these remarks without further mention during the proof.

Let us construct the functor from right to left. Let $F$ be a sheaf on $(\mathit{Sch}/S)_\tau $ such that each $h_{S_ i} \times F$ is representable. In this case let $X_ i$ be a representing object in $(\mathit{Sch}/S)_\tau $. It comes equipped with a morphism $X_ i \to S_ i$. Then both $X_ i \times _ S S_{i'}$ and $S_ i \times _ S X_{i'}$ represent the sheaf $h_{S_ i} \times F \times h_{S_{i'}}$ and hence we obtain an isomorphism

\[ \varphi _{ii'} : X_ i \times _ S S_{i'} \to S_ i \times _ S X_{i'} \]

It is straightforward to see that the maps $\varphi _{ii'}$ are morphisms over $S_ i \times _ S S_{i'}$ and satisfy the cocycle condition. The functor from right to left is given by this construction $F \mapsto (X_ i, \varphi _{ii'})$.

Let us construct a functor from left to right. For each $i$ denote $F_ i$ the sheaf $h_{X_ i}$. The isomorphisms $\varphi _{ii'}$ give isomorphisms

\[ \varphi _{ii'} : F_ i \times h_{S_{i'}} \longrightarrow h_{S_ i} \times F_{i'} \]

over $h_{S_ i} \times h_{S_{i'}}$. Set $F$ equal to the coequalizer in the following diagram

\[ \xymatrix{ \coprod _{i, i'} F_ i \times h_{S_{i'}} \ar@<1ex>[rr]^-{\text{pr}_0} \ar@<-1ex>[rr]_-{\text{pr}_1 \circ \varphi _{ii'}} & & \coprod _ i F_ i \ar[r] & F } \]

The cocycle condition guarantees that $h_{S_ i} \times F$ is isomorphic to $F_ i$ and hence representable. The functor from left to right is given by this construction $(X_ i, \varphi _{ii'}) \mapsto F$.

We omit the verification that these constructions are mutually quasi-inverse functors. The final statements (1) and (2) follow from the constructions. $\square$

Remark 35.36.2. In the statement of Lemma 35.36.1 the condition that $h_{S_ i} \times F$ is representable is equivalent to the condition that the restriction of $F$ to $(\mathit{Sch}/S_ i)_\tau $ is representable.

[1] The fact that fpqc is missing is not a typo. See discussion in Topologies, Section 34.9.

Comments (7)

Comment #493 by Mark on

This lemma isn't displaying properly for me; it looks okay in the PDF version. Maybe it has to do with the footnote; or maybe it's just me?

Comment #494 by on

Thanks for pointing this out. I think you are right that it is the footnote. Let me try to fix it.

Comment #574 by Keenan Kidwell on

This is perhaps a dumb question, but it seems to me that the statement (2) in 02W5 hinges on the fact that, if yields a descent to of , then the universal families (suppressing the morphisms which are part of the isomorphism ) have to glue to (then we get a morphism which pulls back to an isomorphism on the covering by the , and hence is an isomorphism of sheaves). More precisely, we have the -covering by base change of along , and since is a -sheaf, we get , and we need to prove that is sent to the same thing by the two arrows to . Is this clear from the compatibility between the descent data on the with the canonical descent datum on the ?

Comment #575 by Keenan Kidwell on

The in my comment above should go from to , and the messed up LaTeX should be the sequence . I just realized the eye icon allows me to check my LaTeX. Sorry about that.

Comment #591 by on

Hi! I agree with what you wrote. Another way to make your point might be that is the coequalizer of the diagram since after all that is the way we go from the left hand side to the right hand side and this just follows from the fact that and that is a covering.

But maybe you are talking about the converse, i.e., we assume that represents and now we want to show that is effective?

Anyway, I will gladly take any edits you suggest for cleaning up the proof.

Comment #6324 by fpqcquestions on

Can I ask what specifically we are afraid of about letting \tau = fpqc? Is it simply that due to set theoretic issues we can't define the fpqc site? Is it because we are uncertain if the right hand side would be a "big" category? There are still interesting applications of (2) in that context which would be worth having here (checking representability of an fpqc sheaf by quasi-affines fpqc locally, etc.) unless something goes deeply wrong in the proof.

Comment #6326 by on

@#6324. We're not afraid! The statement as given does not make sense for with notation and definitions as in the Stacks project. The other questions are too wide ranging to answer in a comment. If you have a precise and specific alternative statement of this lemma for you would like to see added here, then please let us know.


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