The Stacks project

Lemma 35.35.11. Let $S$ be a scheme. Let $\mathcal{U} = \{ U_ i \to S\} _{i \in I}$, and $\mathcal{V} = \{ V_ j \to S\} _{j \in J}$, be fpqc-coverings of $S$. If $\mathcal{U}$ is a refinement of $\mathcal{V}$, then the pullback functor

\[ \text{descent data relative to } \mathcal{V} \longrightarrow \text{descent data relative to } \mathcal{U} \]

is fully faithful. In particular, the category of schemes over $S$ is identified with a full subcategory of the category of descent data relative to any fpqc-covering of $S$.

Proof. Consider the fpqc-covering $\mathcal{W} = \{ U_ i \times _ S V_ j \to S\} _{(i, j) \in I \times J}$ of $S$. It is a refinement of both $\mathcal{U}$ and $\mathcal{V}$. Hence we have a $2$-commutative diagram of functors and categories

\[ \xymatrix{ DD(\mathcal{V}) \ar[rd] \ar[rr] & & DD(\mathcal{U}) \ar[ld] \\ & DD(\mathcal{W}) & } \]

Notation as in the proof of Lemma 35.35.9 and commutativity by Lemma 35.34.8 part (3). Hence clearly it suffices to prove the functors $DD(\mathcal{V}) \to DD(\mathcal{W})$ and $DD(\mathcal{U}) \to DD(\mathcal{W})$ are fully faithful. This follows from Lemma 35.35.9 as desired. $\square$

Comments (1)

Comment #503 by Kestutis Cesnavicius on

'Faithfull' ---> 'faithful'.

There are also:

  • 2 comment(s) on Section 35.35: Fully faithfulness of the pullback functors

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