The Stacks project

Proof. For $n = 1$ this is Limits, Lemma 32.21.1. For $n > 1$ the lemma can be proved in exactly the same way or it can be deduced from it. For example, suppose that $g_ i : Y_ i \to S_ i$ are objects of $FP_{S_ i, s_ i}$. Then by the case $n = 1$ we can find $f'_ i : X'_ i \to S$ of finite presentation which are isomorphisms over $S \setminus \{ s_ i\} $ and whose base change to $S_ i$ is $g_ i$. Then we can set

\[ f : X = X'_1 \times _ S \ldots \times _ S X'_ n \to S \]

This is an object of $FP_{S, \{ s_1, \ldots , s_ n\} }$ whose base change by $S_ i \to S$ recovers $g_ i$. Thus the functor is essentially surjective. We omit the proof of fully faithfulness. $\square$

Comments (0)

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