Lemma 87.11.2. Let $S$ be a scheme. If $X$ is a formal algebraic space over $S$, then the diagonal morphism $\Delta : X \to X \times _ S X$ is representable, a monomorphism, locally quasi-finite, locally of finite type, and separated.
Proof. Suppose given $U \to X$ and $V \to X$ with $U, V$ schemes over $S$. Then $U \times _ X V$ is a sheaf. Choose $\{ X_ i \to X\} $ as in Definition 87.11.1. For every $i$ the morphism
is representable and étale as a base change of $X_ i \to X$ and its source is a scheme (use Lemmas 87.9.2 and 87.9.11). These maps are jointly surjective hence $U \times _ X V$ is an algebraic space by Bootstrap, Theorem 80.10.1. The morphism $U \times _ X V \to U \times _ S V$ is a monomorphism. It is also locally quasi-finite, because on precomposing with the morphism displayed above we obtain the composition
which is locally quasi-finite as a composition of a closed immersion (Lemma 87.9.2) and an étale morphism, see Descent on Spaces, Lemma 74.19.2. Hence we conclude that $U \times _ X V$ is a scheme by Morphisms of Spaces, Proposition 67.50.2. Thus $\Delta $ is representable, see Spaces, Lemma 65.5.10.
In fact, since we've shown above that the morphisms of schemes $U \times _ X V \to U \times _ S V$ are always monomorphisms and locally quasi-finite we conclude that $\Delta : X \to X \times _ S X$ is a monomorphism and locally quasi-finite, see Spaces, Lemma 65.5.11. Then we can use the principle of Spaces, Lemma 65.5.8 to see that $\Delta $ is separated and locally of finite type. Namely, a monomorphism of schemes is separated (Schemes, Lemma 26.23.3) and a locally quasi-finite morphism of schemes is locally of finite type (follows from the definition in Morphisms, Section 29.20). $\square$
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).
All contributions are licensed under the GNU Free Documentation License.
Comments (3)
Comment #1944 by Brian Conrad on
Comment #1945 by Brian Conrad on
Comment #2001 by Johan on