The Stacks project

Lemma 37.14.2. Let $\mathcal{I} \to (\mathit{Sch}/S)_{fppf}$, $i \mapsto X_ i$ be a diagram of schemes. Let $(W, X_ i \to W)$ be a cocone for the diagram in the category of schemes (Categories, Remark 4.14.5). If there exists a fpqc covering $\{ W_ a \to W\} _{a \in A}$ of schemes such that

  1. for all $a \in A$ we have $W_ a = \mathop{\mathrm{colim}}\nolimits X_ i \times _ W W_ a$ in the category of schemes, and

  2. for all $a, b \in A$ we have $W_ a \times _ W W_ b = \mathop{\mathrm{colim}}\nolimits X_ i \times _ W W_ a \times _ W W_ b$ in the category of schemes,

then $W = \mathop{\mathrm{colim}}\nolimits X_ i$ in the category of schemes.

Proof. Namely, for a scheme $T$ a morphism $W \to T$ is the same thing as collection of morphism $W_ a \to T$, $a \in A$ which agree on the overlaps $W_ a \times _ W W_ b$, see Descent, Lemma 35.12.7. $\square$

Comments (0)

There are also:

  • 2 comment(s) on Section 37.14: Pushouts in the category of schemes, I

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