The Stacks project

Lemma 34.7.2. Any syntomic covering is an fppf covering, and a fortiori, any smooth, ├ętale, or Zariski covering is an fppf covering.

Proof. This is clear from the definitions, the fact that a syntomic morphism is flat and locally of finite presentation, see Morphisms, Lemmas 29.30.6 and 29.30.7, and Lemma 34.6.2. $\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 021N. Beware of the difference between the letter 'O' and the digit '0'.