nLab flat morphism

Redirected from "faithfully flat".
Contents

Contents

Definition

A homomorphism of (not necessarily commutative nor unital) rings u:RSu:R\to S is flat if the extension of scalars (= inverse image) functor u *: RMod SModu^*:{}_R Mod\to {}_S Mod, MS RMM\mapsto S\otimes_R M is an exact additive functor.

Recall that every extension of scalars functor for modules is cocontinuous and a fortiori admits a right adjoint. Hence this definition is in an agreement with the more general notion of a flat functor in category and topos theory.

If one pictures a morphism as a family over its codomain, then for many purposes good families are flat (e.g. in deformation theory).

Flat modules: A right RR-module M RM_R is flat if the functor RNM RN{}_R N\mapsto M \otimes_R N from the category of left RR-modules to the category Ab of abelian groups is exact.

A morphism f:XYf:X\to Y of schemes is flat if the induced map on stalks is a flat morphism of (commutative unital) rings.

A morphism of schemes is faithfully flat if it is flat and epi.

A morphism of affine schemes Spec(B)Spec(A)Spec(B) \to Spec(A), hence coming from a ring homomorphism f:ABf \colon A \to B is

Properties

Proposition

A flat morphism Spec(B)Spec(A)Spec(B) \to Spec(A) is faithfully flat if it is an epimorphism.

(e.g Milne, footnote 18)

Flat topologies

Given a base scheme SS, the slice category Sch/SSch/S of relative schemes over SS is equipped with several flat Grothendieck topologies.

These are the Grothendieck topologies in which covers consist of flat morphisms which set-theoretically cover the target scheme with some additional finiteness conditions. The usual choices are the fppf (fr. fidèlement plat de presentation finie, ‘faithfully flat and of finite presentation’) and fpqc (fr. fidèlement plat et quasicompact, ‘faithfully flat and quasicompact’) topologies. Cf. wikipedia:flat topology

References

The standard reference is EGA IV. See also flat morphism in derived geometry.

See also

Last revised on April 24, 2024 at 15:56:39. See the history of this page for a list of all contributions to it.