The Stacks project

Lemma 5.8.14. Let $f : X \to Y$ be a continuous map of topological spaces. Assume that (a) $Y$ is irreducible, (b) $f$ is open, and (c) there exists a dense collection of points $y \in Y$ such that $f^{-1}(y)$ is irreducible. Then $X$ is irreducible.

Proof. Suppose $X = Z_1 \cup Z_2$ with $Z_ i$ closed. Consider the open sets $U_1 = Z_1 \setminus Z_2 = X \setminus Z_2$ and $U_2 = Z_2 \setminus Z_1 = X \setminus Z_1$. To get a contradiction assume that $U_1$ and $U_2$ are both nonempty. By (b) we see that $f(U_ i)$ is open. By (a) we have $Y$ irreducible and hence $f(U_1) \cap f(U_2) \not= \emptyset $. By (c) there is a point $y$ which corresponds to a point of this intersection such that the fibre $X_ y = f^{-1}(y)$ is irreducible. Then $X_ y \cap U_1$ and $X_ y \cap U_2$ are nonempty disjoint open subsets of $X_ y$ which is a contradiction. $\square$

Comments (5)

Comment #631 by Wei Xu on

Typo, in "Suppose with closed." should be .

Comment #1147 by sid on

Typo, Y in "U1=Z1∖Z2=Y∖Z" should be X.

Comment #5951 by Fabian Korthauer on

The assumption that is continuous seems to be superfluous. Furthermore one could maybe add a comment (resp. add an analogous lemma somewhere else) that the statement remains true with essentially the same prove if one exchanges the word "irreducible" everywhere by the word "connected".

Comment #6137 by on

@#5951. OK, yes, I agree. There are probably many variants of this lemma. For now I will leave it as is, unless you want a reference for a publication. The variants for connectedness are Lemmas 5.7.5 and 5.7.6.

There are also:

  • 8 comment(s) on Section 5.8: Irreducible components

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 004Z. Beware of the difference between the letter 'O' and the digit '0'.