Processing math: 100%

The Stacks project

Definition 34.7.1. Let T be a scheme. An fppf covering of T is a family of morphisms \{ f_ i : T_ i \to T\} _{i \in I} of schemes such that each f_ i is flat, locally of finite presentation and such that T = \bigcup f_ i(T_ i).


Comments (0)

There are also:

  • 2 comment(s) on Section 34.7: The fppf topology

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.