Processing math: 100%

The Stacks project

Lemma 32.22.6. Notation and assumptions as in Lemma 32.22.4. If f is flat and of finite presentation, then there exists an i_3 \geq i_0 such that for i \geq i_3 we have f_ i is flat, X_ i = Y_ i \times _{Y_{i_3}} X_{i_3}, and X = Y \times _{Y_{i_3}} X_{i_3}.

Proof. By Lemma 32.10.1 we can choose an i \geq i_2 and a morphism U \to Y_ i of finite presentation such that X = Y \times _{Y_ i} U (this is where we use that f is of finite presentation). After increasing i we may assume that U \to Y_ i is flat, see Lemma 32.8.7. As discussed in Remark 32.22.5 we may and do replace the initial diagram used to define the system (X_ i)_{i \geq i_1} by the system corresponding to X \to U \to S_ i. Thus X_{i'} for i' \geq i is defined as the scheme theoretic image of X \to S_{i'} \times _{S_ i} U.

Because U \to Y_ i is flat (this is where we use that f is flat), because X = Y \times _{Y_ i} U, and because the scheme theoretic image of Y \to Y_ i is Y_ i, we see that the scheme theoretic image of X \to U is U (Morphisms, Lemma 29.25.16). Observe that Y_{i'} \to S_{i'} \times _{S_ i} Y_ i is a closed immersion for i' \geq i by construction of the system of Y_ j. Then the same argument as above shows that the scheme theoretic image of X \to S_{i'} \times _{S_ i} U is equal to the closed subscheme Y_{i'} \times _{Y_ i} U. Thus we see that X_{i'} = Y_{i'} \times _{Y_ i} U for all i' \geq i and hence the lemma holds with i_3 = i. \square


Comments (0)


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.