General topology Compactness Theorem
Dieudonné's theorem on paracompact Hausdorff spaces
Builds on Paracompact spaceHausdorff spaceNormal spaceLocally finite family
Statement
Let be a paracompact Hausdorff space. Then is normal. That is, for any two disjoint closed sets , there are disjoint open sets and .
Remarks
The proof has two steps of the same shape. First, is regular: for a closed set and a point , cover by open sets whose closures miss , and add . Take a locally finite open refinement. The union of the closures of the members that meet is closed, by local finiteness, and it misses . The second step repeats this argument with a closed set in place of the point , using regularity.
Example at work: every compact Hausdorff space is paracompact, so it is normal.
The Hausdorff hypothesis cannot be dropped. Take with open sets , , , and . It is finite, so paracompact. The closed sets and are disjoint, but every open set containing either of them contains .
Going deeper
For a student
Normality is what makes Urysohn's lemma work. So on a paracompact Hausdorff space, there are many continuous real functions. This is the first step toward partitions of unity subordinate to an open cover. In fact, a Hausdorff space is paracompact if and only if every open cover has a subordinate partition of unity.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Hausdorff space concept
- Locally finite family concept
- Normal space concept
- Paracompact space concept
- Dieudonné's theorem on paracompact Hausdorff spaces statement
Further reading
About this page
| Tag | B6Y8PEY72W |
|---|---|
| URI | m2://B6Y8PEY72W |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 54D20, 54D15 |
| Status | This copy of the site has no build data. Run m2 status B6Y8PEY72W. |
| About | Paracompact space, Normal space |
| Uses | Paracompact space, Hausdorff space, Normal space, Locally finite family |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.