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

Regularity and T₃ Spaces

Graduate Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
373prerequisites beneath it
See this on the map →
Separation Axioms: T₀, T₁, and T₂ (Hausdorff)Regular Spaces (T3 Spaces)→→Normality and T₄ Spaces
regularity t3-axiom

Core Idea

A space is regular if for every closed set F and x ∉ F, there exist disjoint open sets separating them. T₃ = regular + T₀. Regular spaces separate points from closed sets; metric spaces are regular. Products of regular spaces are regular; regularity is preserved under continuous images (unlike T₂).

Explainer

A topological space X is regular if, given any closed set F and any point x not in F, there exist disjoint open sets U and V with x ∈ U and F ⊆ V. In other words, a point and a closed set that does not contain it can always be "separated" by open neighborhoods that do not overlap. The T₃ axiom combines regularity with the T₀ condition (topological distinguishability of points), yielding a space where both point-from-point and point-from-closed-set separation are guaranteed. Some authors define T₃ as regular + T₁ instead; in either convention, the substantive content is the regularity condition itself.

Regularity sits one level above the Hausdorff condition in the separation hierarchy. The Hausdorff axiom (T₂) requires separating two points by disjoint open sets; regularity requires separating a single point from an entire closed set. This is a strictly stronger demand: a closed set can be infinite and its points can cluster near x, making the construction of disjoint open neighborhoods harder. Every regular T₁ space is Hausdorff — since singletons are closed in a T₁ space, regularity applied to x and the closed set {y} gives the T₂ separation. But T₂ does not imply regularity: there exist Hausdorff spaces where a point and a disjoint closed set cannot be separated by open sets, though such spaces are somewhat pathological.

Metric spaces are always regular, and the proof is constructive. If F is closed and x ∉ F, then d(x, F) = inf{d(x, y) : y ∈ F} > 0 (since F is closed and x is outside it). Setting r = d(x, F)/2, the open ball B(x, r) and the open set ∪{B(y, r) : y ∈ F} separate x from F: any point in both would be within r of x and within r of some point of F, giving d(x, y) < 2r = d(x, F), a contradiction. This argument illustrates a recurring theme: in metric spaces, the distance function provides explicit constructions for topological separation, which is why metric spaces satisfy all the standard separation axioms.

Regularity is preserved under several important constructions. Products of regular spaces are regular (in the product topology), and subspaces of regular spaces are regular. This makes regularity a robust property that persists as you build new spaces from existing ones. Regularity is the gateway to the stronger separation axiom of normality (T₄), which requires separating two disjoint closed sets from each other — a strictly harder task. The hierarchy T₂ ⊂ T₃ ⊂ T₄ represents progressively stronger geometric richness, with each level unlocking new theorems about the existence of continuous functions and extensions.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties → Limit Points and Convergence → Separation Axioms: T₀, T₁, and T₂ (Hausdorff) → Regularity and T₃ Spaces

Longest path: 80 steps · 373 total prerequisite topics

Prerequisites (2)

Leads To (1)