A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Normal Spaces (T4 Spaces)

College Depth 74 in the knowledge graph I know this Set as goal
7topics build on this
344prerequisites beneath it
See this on the map →
Separation Axioms (T0 through T4)Urysohn's Lemma
normal t4

Core Idea

A space is normal if disjoint closed sets F, G have disjoint open neighborhoods. Every compact Hausdorff space and every metric space is normal.

Explainer

You've studied the separation axioms — a hierarchy of conditions that capture how well a topological space can separate points and sets using open sets. Recall the key levels: T₁ (points are closed), T₂ or Hausdorff (disjoint points have disjoint open neighborhoods), and T₃ or regular (a point and a disjoint closed set have disjoint open neighborhoods). Normal spaces (T₄) push this one step further: *two disjoint closed sets* can always be separated by disjoint open neighborhoods.

To feel why this is a meaningful strengthening, compare T₃ and T₄. In a regular space, you can separate a *point* from a closed set it doesn't belong to. But a single point is a very special kind of closed set. Normality demands the same separation for *arbitrary* disjoint closed sets — even large, complicated ones. In some pathological spaces (certain infinite products, the long line), disjoint closed sets cannot always be separated this way, showing that normality is a genuine restriction.

The two major classes of normal spaces are metric spaces and compact Hausdorff spaces. For metric spaces, the proof is constructive: given disjoint closed sets F and G in a metric space, let U = {x : d(x,F) < d(x,G)} and V = {x : d(x,G) < d(x,F)}. These are open (they're defined by strict inequalities of continuous functions), disjoint, and contain F and G respectively. The metric provides enough structure to build the separating neighborhoods explicitly. For compact Hausdorff spaces, the argument is topological: compactness lets you build finite open covers, and Hausdorff-ness provides local separability that can be pieced together globally.

Why does normality matter? It is the exact condition needed for Urysohn's Lemma, which you'll study next: in a normal space, any two disjoint closed sets can be separated not just by open sets, but by a *continuous real-valued function* — one that equals 0 on one closed set and 1 on the other. This is a striking upgrade from separation by open sets alone, and it's the key to constructing continuous functions in topology. Urysohn's Lemma is then the engine behind the Tietze Extension Theorem, which says that every continuous real-valued function defined on a closed subset of a normal space extends to the whole space. Together, these results make normality the foundation of the theory of continuous functions on topological spaces.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesSeparation Axioms (T0 through T4)Normal Spaces (T4 Spaces)

Longest path: 75 steps · 344 total prerequisite topics

Prerequisites (1)

Leads To (1)