Let $f:X\rightarrow Y$ be a flat morphism of schemes of finite type over a field $k$, and assume $Y$ is irreducible. Let $X_1, \dots, X_n$ be the scheme-theoretic irreducible components of $X$ (i.e., including embedded components).

  • Is it true that each $X_i$ is flat over $Y$?
  • If there are counterexamples to flatness of the $X_i$, is it true at least that each of them has equidimensional fibers?
  • $\begingroup$ If you take a plane and a line intersecting at the origin, isn't that a flat map of finite type over your ground field with components of different dimensions? $\endgroup$
    – Jacob Bell
    Nov 22, 2012 at 23:22
  • $\begingroup$ By each component having equidimensional fibers I mean that $dim (X_i)_y$ is independent of $y$. Of course these dimensions will depend on $i$. $\endgroup$
    – quim
    Nov 23, 2012 at 9:27

1 Answer 1


No to the first question. Let $Y$ be a nodal cubic curve and let $X$ be its connected two-sheeted covering space. Each of the two components of $X$ is the normalization of $Y$.

  • $\begingroup$ Sometimes the nomenclature is weird... That a connected covering of something have two components! $\endgroup$ Nov 22, 2012 at 14:25
  • 1
    $\begingroup$ @Mariano: if the two components intersect, what is the problem in calling the covering "connected"? $\endgroup$ Nov 22, 2012 at 14:46
  • 3
    $\begingroup$ The weirdness is the conflict between topology language and algebraic geometry language. In topology the connected components of a space are sometimes referred to as simply "components". In alg geo the irreducible components of a scheme are sometimes referred to as simply "components". But connectedness plays a role in alg geo, too. $\endgroup$ Nov 22, 2012 at 15:33
  • 1
    $\begingroup$ @Tom Goodwillie: Thank you! I have been able to track down this example to EGA IV, Remarques 6.5.5(ii) and 12.1.2(i). On the other hand, the immediately preceding proposition shows that my second question has positive answer $\endgroup$
    – quim
    Nov 29, 2012 at 21:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.