The Stacks project

Lemma 29.50.5. Let $f : X \to Y$ be a birational morphism of schemes having finitely many irreducible components over a base scheme $S$. Assume one of the following conditions is satisfied

  1. $f$ is locally of finite type and $Y$ reduced,

  2. $f$ is locally of finite presentation.

Then there exist dense opens $U \subset X$ and $V \subset Y$ such that $f(U) \subset V$ and $f|_ U : U \to V$ is an isomorphism. In particular if $X$ and $Y$ are irreducible, then $X$ and $Y$ are $S$-birational.

Proof. There is an immediate reduction to the case where $X$ and $Y$ are irreducible which we omit. Moreover, after shrinking further and we may assume $X$ and $Y$ are affine, say $X = \mathop{\mathrm{Spec}}(A)$ and $Y = \mathop{\mathrm{Spec}}(B)$. By assumption $A$, resp. $B$ has a unique minimal prime $\mathfrak p$, resp. $\mathfrak q$, the prime $\mathfrak p$ lies over $\mathfrak q$, and $B_\mathfrak q = A_\mathfrak p$. By Lemma 29.50.3 we have $B_\mathfrak q = A_\mathfrak q = A_\mathfrak p$.

Suppose $B \to A$ is of finite type, say $A = B[x_1, \ldots , x_ n]$. There exist a $b_ i \in B$ and $g_ i \in B \setminus \mathfrak q$ such that $b_ i/g_ i$ maps to the image of $x_ i$ in $A_\mathfrak q$. Hence $b_ i - g_ ix_ i$ maps to zero in $A_{g_ i'}$ for some $g_ i' \in B \setminus \mathfrak q$. Setting $g = \prod g_ i g'_ i$ we see that $B_ g \to A_ g$ is surjective. If moreover $Y$ is reduced, then the map $B_ g \to B_\mathfrak q$ is injective and hence $B_ g \to A_ g$ is injective as well. This proves case (1).

Proof of (2). By the argument given in the previous paragraph we may assume that $B \to A$ is surjective. As $f$ is locally of finite presentation the kernel $J \subset B$ is a finitely generated ideal. Say $J = (b_1, \ldots , b_ r)$. Since $B_\mathfrak q = A_\mathfrak q$ there exist $g_ i \in B \setminus \mathfrak q$ such that $g_ i b_ i = 0$. Setting $g = \prod g_ i$ we see that $B_ g \to A_ g$ is an isomorphism. $\square$


Comments (2)

Comment #5383 by Bjorn Poonen on

In the statement, "may" should be "many".


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