The Stacks project

Lemma 70.4.3. Let $S$ be a scheme. Let $I$ be a directed set. Let $(X_ i, f_{i'i}) \to (Y_ i, g_{i'i})$ be a morphism of inverse systems over $I$ of algebraic spaces over $S$. Assume

  1. the morphisms $f_{i'i} : X_{i'} \to X_ i$ are affine,

  2. the morphisms $g_{i'i} : Y_{i'} \to Y_ i$ are affine,

  3. the morphisms $X_ i \to Y_ i$ are closed immersions.

Then $\mathop{\mathrm{lim}}\nolimits X_ i \to \mathop{\mathrm{lim}}\nolimits Y_ i$ is a closed immersion.

Proof. Observe that $\mathop{\mathrm{lim}}\nolimits X_ i$ and $\mathop{\mathrm{lim}}\nolimits Y_ i$ exist by Lemma 70.4.1. Pick $0 \in I$ and choose an affine scheme $V_0$ and an étale morphism $V_0 \to Y_0$. Then the morphisms $V_ i = Y_ i \times _{Y_0} V_0 \to U_ i = X_ i \times _{Y_0} V_0$ are closed immersions of affine schemes. Hence the morphism $V = Y \times _{Y_0} V_0 \to U = X \times _{Y_0} V_0$ is a closed immersion because $V = \mathop{\mathrm{lim}}\nolimits V_ i$, $U = \mathop{\mathrm{lim}}\nolimits U_ i$ and because a limit of closed immersions of affine schemes is a closed immersion: a filtered colimit of surjective ring maps is surjective. Since the étale morphisms $V \to Y$ form an étale covering of $Y$ as we vary our choice of $V_0 \to Y_0$ we see that the lemma is true. $\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 0CUH. Beware of the difference between the letter 'O' and the digit '0'.