The Stacks project

Lemma 5.10.2. Let $X$ be a topological space. Then $\dim (X) = \sup \dim _ x(X)$ where the supremum runs over the points $x$ of $X$.

Proof. It is clear that $\dim (X) \geq \dim _ x(X)$ for all $x \in X$ (see discussion following Definition 5.10.1). Thus an inequality in one direction. For the converse, let $n \geq 0$ and suppose that $\dim (X) \geq n$. Then we can find a chain of irreducible closed subsets $Z_0 \subset Z_1 \subset \ldots \subset Z_ n \subset X$. Pick $x \in Z_0$. For every open neighbourhood $U$ of $x$ we get a chain of irreducible closed subsets

\[ Z_0 \cap U \subset Z_1 \cap U \subset \ldots \subset Z_ n \cap U \]

in $U$. Namely, the sets $U \cap Z_ i$ are irreducible closed in $U$ and the inclusions are strict (details omitted; hint: the closure of $U \cap Z_ i$ is $Z_ i$). In this way we see that $\dim _ x(X) \geq n$ which proves the other inequality. $\square$


Comments (2)

Comment #6799 by Xun on

In the proof of the lemma, to conclude , do we need to prove that 's are all distinct? The proof seems forget to prove this.

Comment #6944 by on

Here is an exercise: let be an open subset of a topological space . Then the map is an inclusion preserving bijection between the set of irreducible closed subsets of which meet to the set of irreducible closed subsets of . Should we make this a lemma? What do you guys think?

Anyway, I tried to improve the wording of the proof. See changes here.

There are also:

  • 3 comment(s) on Section 5.10: Krull dimension

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