The Stacks project

Lemma 59.96.2. Let $K$ be a field.

  1. If $f : X \to Y$ is a morphism of finite type schemes over $K$, then $\text{cd}(f) < \infty $.

  2. If $\text{cd}(K) < \infty $, then $\text{cd}(X) < \infty $ for any finite type scheme $X$ over $K$.

Proof. Proof of (1). We may assume $Y$ is affine. We will use the induction principle of Cohomology of Schemes, Lemma 30.4.1 to prove this. If $X$ is affine too, then the result holds by Lemma 59.95.8. Thus it suffices to show that if $X = U \cup V$ and the result is true for $U \to Y$, $V \to Y$, and $U \cap V \to Y$, then it is true for $f$. This follows from the relative Mayer-Vietoris sequence, see Lemma 59.50.2.

Proof of (2). We will use the induction principle of Cohomology of Schemes, Lemma 30.4.1 to prove this. If $X$ is affine, then the result holds by Proposition 59.95.6. Thus it suffices to show that if $X = U \cup V$ and the result is true for $U$, $V$, and $U \cap V $, then it is true for $X$. This follows from the Mayer-Vietoris sequence, see Lemma 59.50.1. $\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 0F10. Beware of the difference between the letter 'O' and the digit '0'.