Skip to content

Separation Axioms

Separation axioms formalise how well points and closed sets can be “separated” by open sets.

Definition. XX is T0T_0 if for any two distinct points x,y∈Xx, y \in X, at least one has an open neighbourhood not containing the other.

Example 8.1. The Sierpiński space {0,1}\{0, 1\} with topology {∅,{0},{0,1}}\{\emptyset, \{0\}, \{0, 1\}\} is T0T_0 but not T1T_1.

Definition. XX is T1T_1 if for any two distinct points x,y∈Xx, y \in X, there exist open sets U,VU, V with x∈Ux \in U, y∉Uy \notin U and y∈Vy \in V, x∉Vx \notin V.

Proposition 8.1. XX is T1T_1 if and only if every singleton {x}\{x\} is closed.

Proof. (⇒\Rightarrow) Fix xx and let y≠xy \neq x. T1T_1 gives an open set UyU_y with y∈Uyy \in U_y and x∉Uyx \notin U_y. Then X∖{x}=⋃y≠xUyX \setminus \{x\} = \bigcup_{y \neq x} U_y is a union of open sets, hence open; so {x}\{x\} is closed.

(⇐\Leftarrow) Suppose every singleton is closed and let x≠yx \neq y. Then X∖{x}X \setminus \{x\} is open, contains yy, excludes xx; and X∖{y}X \setminus \{y\} is open, contains xx, excludes yy. ■\blacksquare

Example 8.2. Any infinite set with the cofinite topology is T1T_1 but not T2T_2.

Definition. XX is Hausdorff (T2T_2) if for any two distinct points x,y∈Xx, y \in X, there exist disjoint open sets U,VU, V with x∈Ux \in U and y∈Vy \in V.

Proposition 8.2. Every metric space is Hausdorff.

Proof. Let x≠yx \neq y and set δ=d(x,y)>0\delta = d(x, y) > 0. The open balls B(x,δ/2)B(x, \delta/2) and B(y,δ/2)B(y, \delta/2) are disjoint: if zz lay in both, the triangle inequality would give δ=d(x,y)≤d(x,z)+d(z,y)<δ/2+δ/2=δ\delta = d(x, y) \leq d(x, z) + d(z, y) < \delta/2 + \delta/2 = \delta, a contradiction. ■\blacksquare

Proposition 8.3. In a Hausdorff space, every convergent sequence has a unique limit.

Proof. Suppose xn→xx_n \to x and xn→yx_n \to y with x≠yx \neq y, and choose disjoint open U∋xU \ni x, V∋yV \ni y. Convergence gives N1N_1 with xn∈Ux_n \in U for all n≥N1n \geq N_1 and N2N_2 with xn∈Vx_n \in V for all n≥N2n \geq N_2. For n≥max⁡(N1,N2)n \geq \max(N_1, N_2) the point xnx_n lies in U∩V=∅U \cap V = \emptyset, which is impossible. ■\blacksquare

Uniqueness of limits is the practical dividend of T2T_2. In a non-Hausdorff space it fails spectacularly: in the cofinite topology on an infinite set, a sequence of distinct points converges to every point of the space simultaneously, since each open neighbourhood misses only finitely many terms.

Proposition 8.4. T2  ⟹  T1  ⟹  T0T_2 \implies T_1 \implies T_0.

Proof. T2⇒T1T_2 \Rightarrow T_1: given disjoint open U∋xU \ni x, V∋yV \ni y, the set UU contains xx but not yy (as y∈Vy \in V and U∩V=∅U \cap V = \emptyset), and VV contains yy but not xx. T1⇒T0T_1 \Rightarrow T_0 is immediate: the T1T_1 witnesses are a fortiori T0T_0 witnesses. ■\blacksquare

8.5 T3T_3 (Regular) and T4T_4 (Normal)

Section titled “8.5 T3T_3T3​ (Regular) and T4T_4T4​ (Normal)”

Definition. XX is regular (T3T_3) if it is T1T_1 and for any point xx and closed set FF with x∉Fx \notin F, there exist disjoint open sets U,VU, V with x∈Ux \in U and F⊆VF \subseteq V.

Definition. XX is normal (T4T_4) if it is T1T_1 and for any two disjoint closed sets F1,F2F_1, F_2, there exist disjoint open sets U,VU, V with F1⊆UF_1 \subseteq U and F2⊆VF_2 \subseteq V.

Proposition 8.5. T4  ⟹  T3  ⟹  T2T_4 \implies T_3 \implies T_2 (assuming T1T_1).

Proof. T4⇒T3T_4 \Rightarrow T_3: let x∉Fx \notin F with FF closed. By T1T_1 and Proposition 8.1, {x}\{x\} is closed. Normality applied to the disjoint closed sets {x}\{x\} and FF produces exactly the separating open sets that regularity demands.

T3⇒T2T_3 \Rightarrow T_2: let x≠yx \neq y. By T1T_1, {y}\{y\} is closed and x∉{y}x \notin \{y\}; regularity separates the point xx from the closed set {y}\{y\}. ■\blacksquare

The T1T_1 hypothesis is doing real work in both steps; it converts a point into a closed set, which is the currency the higher axioms trade in.

Proposition 8.6. Every compact Hausdorff space is normal.

Lemma (points versus compact sets). In a Hausdorff space XX: (a) if K⊆XK \subseteq X is compact and x∉Kx \notin K, there are disjoint open sets U∋xU \ni x and V⊇KV \supseteq K; (b) every compact K⊆XK \subseteq X is closed.

Proof. (a) For each y∈Ky \in K, Hausdorffness gives disjoint open Uy∋xU_y \ni x and Vy∋yV_y \ni y. The family {Vy}y∈K\{V_y\}_{y \in K} is an open cover of KK, so compactness extracts a finite subcover K⊆Vy1∪⋯∪VynK \subseteq V_{y_1} \cup \cdots \cup V_{y_n}. Set U=Uy1∩⋯∩UynU = U_{y_1} \cap \cdots \cap U_{y_n} and V=Vy1∪⋯∪VynV = V_{y_1} \cup \cdots \cup V_{y_n}: these are open, x∈Ux \in U, K⊆VK \subseteq V, and they are disjoint because UU misses each UyiU_{y_i}; hence misses VyiV_{y_i}, hence misses VV.

(b) Let x∉Kx \notin K. By (a) there is an open U∋xU \ni x with U∩K=∅U \cap K = \emptyset. Every point of X∖KX \setminus K therefore has an open neighbourhood contained in X∖KX \setminus K, so X∖KX \setminus K is open and KK is closed. ■\blacksquare

Proof of Proposition 8.6. Let F1,F2F_1, F_2 be disjoint closed sets in the compact Hausdorff XX. By part (b) of the lemma, F2F_2 is compact. For each x∈F1x \in F_1, part (a) gives disjoint open Ux∋xU_x \ni x and Vx⊇F2V_x \supseteq F_2. The family {Ux}x∈F1\{U_x\}_{x \in F_1} covers the compact F1F_1, so F1⊆Ux1∪⋯∪UxnF_1 \subseteq U_{x_1} \cup \cdots \cup U_{x_n} for some x1,…,xn∈F1x_1, \dots, x_n \in F_1. Set U=Ux1∪⋯∪UxnU = U_{x_1} \cup \cdots \cup U_{x_n} and V=Vx1∩⋯∩VxnV = V_{x_1} \cap \cdots \cap V_{x_n}. Then UU and VV are open, F1⊆UF_1 \subseteq U, F2⊆VF_2 \subseteq V, and U∩V=∅U \cap V = \emptyset because Uxi∩V=∅U_{x_i} \cap V = \emptyset for each ii (each UxiU_{x_i} misses its own VxiV_{x_i}, and V⊆VxiV \subseteq V_{x_i}). ■\blacksquare

Theorem 8.1 (Urysohn’s Lemma). If XX is normal and F1,F2F_1, F_2 are disjoint closed subsets, then there exists a continuous function f:X→[0,1]f : X \to [0, 1] with f∣F1=0f|_{F_1} = 0 and f∣F2=1f|_{F_2} = 1.

This is a fundamental tool in topology, used to construct partitions of unity and to prove extension theorems. It deserves a complete proof.

Lemma (shrinking). XX is normal if and only if for every closed CC and open UU with C⊆UC \subseteq U, there is an open VV with

C⊆V⊆V‾⊆U.C \subseteq V \subseteq \overline{V} \subseteq U.

Proof. (⇐\Leftarrow) Given disjoint closed F1,F2F_1, F_2, apply the property to C=F1C = F_1 and U=X∖F2U = X \setminus F_2 (open, since F2F_2 is closed): get open VV with F1⊆VF_1 \subseteq V and V‾⊆X∖F2\overline{V} \subseteq X \setminus F_2. Then VV and X∖V‾X \setminus \overline{V} are disjoint open sets containing F1F_1 and F2F_2 respectively.

(⇒\Rightarrow) The sets CC and X∖UX \setminus U are disjoint and closed. Normality gives disjoint open V⊇CV \supseteq C and W⊇X∖UW \supseteq X \setminus U. Then V⊆X∖WV \subseteq X \setminus W; as X∖WX \setminus W is closed, V‾⊆X∖W⊆U\overline{V} \subseteq X \setminus W \subseteq U. ■\blacksquare

Proof of Urysohn’s Lemma. Let D=Q∩[0,1]D = \mathbb{Q} \cap [0, 1], enumerated as r0=0,r1=1,r2,r3,…r_0 = 0, r_1 = 1, r_2, r_3, \dots We build open sets UrU_r for r∈Dr \in D satisfying

F1⊆U0,U1=X∖F2,r<s  ⟹  Ur‾⊆Us.(∗)F_1 \subseteq U_0, \qquad U_1 = X \setminus F_2, \qquad r < s \implies \overline{U_r} \subseteq U_s. \tag{$*$}

Initialisation. Set U1=X∖F2U_1 = X \setminus F_2, which is open. Applying the shrinking lemma to C=F1C = F_1 and U=U1U = U_1 yields an open U0U_0 with F1⊆U0⊆U0‾⊆U1F_1 \subseteq U_0 \subseteq \overline{U_0} \subseteq U_1. Property (∗*) holds on the chain {r0,r1}\{r_0, r_1\}.

Inductive step. Suppose Ur0,…,UrnU_{r_0}, \dots, U_{r_n} satisfy (∗*) pairwise, and consider rn+1r_{n+1}. Let p=max⁡{ri:ri<rn+1}p = \max\{r_i : r_i < r_{n+1}\} and q=min⁡{ri:ri>rn+1}q = \min\{r_i : r_i > r_{n+1}\}; these exist since the finite chain contains 0<rn+10 < r_{n+1}‘s neighbours, and p<rn+1<qp < r_{n+1} < q. Apply the shrinking lemma to C=Up‾C = \overline{U_p} (closed) and U=UqU = U_q (open, with C⊆UC \subseteq U by the inductive hypothesis): it returns an open Urn+1U_{r_{n+1}} with

Up‾⊆Urn+1⊆Urn+1‾⊆Uq.\overline{U_p} \subseteq U_{r_{n+1}} \subseteq \overline{U_{r_{n+1}}} \subseteq U_q.

Old pairs are untouched. New pairs satisfy (∗*): if r<rn+1r < r_{n+1} then r≤pr \leq p, so Ur‾⊆Up‾⊆Urn+1\overline{U_r} \subseteq \overline{U_p} \subseteq U_{r_{n+1}} (where for r=pr = p the inclusion Up‾⊆Urn+1\overline{U_p} \subseteq U_{r_{n+1}} is the one just established); if r>rn+1r > r_{n+1} then r≥qr \geq q, so Urn+1‾⊆Uq⊆Ur\overline{U_{r_{n+1}}} \subseteq U_q \subseteq U_r.

The function. Define

f(x)=inf⁡{r∈D:x∈Ur}.f(x) = \inf \{ r \in D : x \in U_r \}.

The set is nonempty since x∈U1x \in U_1 always, so ff is well defined with 0≤f(x)≤10 \leq f(x) \leq 1. If x∈F1x \in F_1 then x∈U0x \in U_0, so f(x)=0f(x) = 0. If x∈F2=X∖U1x \in F_2 = X \setminus U_1 then x∉Urx \notin U_r for every r<1r < 1, so f(x)≥1f(x) \geq 1, i.e. f(x)=1f(x) = 1.

Continuity. It suffices to show {f<a}\{f < a\} and {f>a}\{f > a\} are open for every real aa, since these intervals generate the topology of [0,1][0, 1].

First, {f<a}=⋃r<aUr\{f < a\} = \bigcup_{r < a} U_r: if x∈Urx \in U_r for some r<ar < a then f(x)≤r<af(x) \leq r < a; conversely if f(x)<af(x) < a then, by definition of the infimum over the dense set DD, some r<ar < a has x∈Urx \in U_r. So {f<a}\{f < a\} is open.

Second, {f>a}=⋃r>a(X∖Ur‾)\{f > a\} = \bigcup_{r > a} (X \setminus \overline{U_r}), which is open as a union of open sets. For the inclusion (⊇\supseteq): if x∉Ur‾x \notin \overline{U_r} for some r>ar > a, then x∉Usx \notin U_s for every s≤rs \leq r (for s<rs < r, Us⊆Us‾⊆UrU_s \subseteq \overline{U_s} \subseteq U_r; for s=rs = r, Ur⊆Ur‾U_r \subseteq \overline{U_r}), so the indexing set has infimum ≥r>a\geq r > a. For (⊆\subseteq): if f(x)>af(x) > a, choose t∈Dt \in D with a<t<f(x)a < t < f(x), so x∉Utx \notin U_t; then choose s∈Ds \in D with a<s<ta < s < t, so Us‾⊆Ut\overline{U_s} \subseteq U_t by (∗*), whence x∉Us‾x \notin \overline{U_s}; placing xx in the right-hand side.

Both preimage types are open, so ff is continuous. ■\blacksquare

The construction is worth pausing over: normality is used exactly once per rational, through the shrinking lemma, to interpolate open sets between Up‾\overline{U_p} and UqU_q. The density of Q\mathbb{Q} in [0,1][0, 1] is what lets countably many interpolations determine a continuous function. The lemma also proves the first half of the next proposition.

Definition. A space XX is completely regular (Tychonoff, T3.5T_{3.5}) if it is T1T_1 and for every point xx and closed set FF with x∉Fx \notin F, there exists a continuous function f:X→[0,1]f : X \to [0, 1] with f(x)=0f(x) = 0 and f(F)=1f(F) = 1.

Proposition 8.7. Every normal space is completely regular. Every completely regular space is regular: T4  ⟹  T3.5  ⟹  T3T_4 \implies T_{3.5} \implies T_3.

Proof. T4⇒T3.5T_4 \Rightarrow T_{3.5}: given a point xx and a closed set FF with x∉Fx \notin F, T1T_1 makes {x}\{x\} closed, and {x}∩F=∅\{x\} \cap F = \emptyset. Urysohn’s lemma provides a continuous f:X→[0,1]f : X \to [0, 1] with f=0f = 0 on {x}\{x\} and f=1f = 1 on FF.

T3.5⇒T3T_{3.5} \Rightarrow T_3: given x∉Fx \notin F closed, complete regularity gives ff with f(x)=0f(x) = 0 and f(F)=1f(F) = 1. Then U=f−1([0,1/2))U = f^{-1}([0, 1/2)) and V=f−1((1/2,1])V = f^{-1}((1/2, 1]) are disjoint open sets (preimages of open subsets of [0,1][0,1]) with x∈Ux \in U and F⊆VF \subseteq V. ■\blacksquare

Example 8.3. The Sorgenfrey line (lower limit topology on R\mathbb{R}) is Tychonoff but not normal.

Theorem 8.2 (Tietze Extension Theorem). If XX is normal, F⊆XF \subseteq X is closed, and f:F→[a,b]f : F \to [a, b] is continuous, then ff extends to a continuous function f~:X→[a,b]\tilde{f} : X \to [a, b] with f~∣F=f\tilde{f}|_F = f.

Proof. Rescale so that f:F→[−1,1]f : F \to [-1, 1].

The elementary step. Let A=f−1([−1,−1/3])A = f^{-1}([-1, -1/3]) and B=f−1([1/3,1])B = f^{-1}([1/3, 1]). These are closed in XX: preimages of closed sets under a continuous map are closed in FF, and FF is closed in XX. They are disjoint since ff cannot take values in both ranges. By Urysohn’s lemma (with F1=AF_1 = A, F2=BF_2 = B) there is a continuous g1:X→[−1/3,1/3]g_1 : X \to [-1/3, 1/3]; strictly, Urysohn gives values in [0,1][0,1]; compose with the affine map t↦(2t−1)/3t \mapsto (2t - 1)/3 and use that g1=−1/3g_1 = -1/3 on AA and g1=1/3g_1 = 1/3 on BB; such that

∣f−g1∣≤23on F.|f - g_1| \leq \tfrac{2}{3} \quad \text{on } F.

Indeed: where f≥1/3f \geq 1/3 we have g1=1/3g_1 = 1/3, so ∣f−g1∣≤2/3|f - g_1| \leq 2/3; where f≤−1/3f \leq -1/3 symmetrically; and where ∣f∣<1/3|f| < 1/3 both ff and g1g_1 lie in (−1/3,1/3)(-1/3, 1/3) up to the bounds.

Iteration. Apply the same construction to f−g1:F→[−2/3,2/3]f - g_1 : F \to [-2/3, 2/3], rescaled by 3/23/2: the result is g2:X→[−2/9,2/9]g_2 : X \to [-2/9, 2/9] with ∣f−g1−g2∣≤(2/3)2|f - g_1 - g_2| \leq (2/3)^2 on FF. Inductively, gn:X→[−13(23)n−1,13(23)n−1]g_n : X \to \bigl[-\tfrac{1}{3}\bigl(\tfrac{2}{3}\bigr)^{n-1}, \tfrac{1}{3}\bigl(\tfrac{2}{3}\bigr)^{n-1}\bigr] with

∣f−∑k=1ngk∣≤(23)non F.\Bigl| f - \sum_{k=1}^{n} g_k \Bigr| \leq \Bigl(\tfrac{2}{3}\Bigr)^{n} \quad \text{on } F.

Convergence. The bounds satisfy ∑n=1∞13(23)n−1=1\sum_{n=1}^{\infty} \tfrac{1}{3}\bigl(\tfrac{2}{3}\bigr)^{n-1} = 1, so the Weierstrass M-test makes g=∑n=1∞gng = \sum_{n=1}^{\infty} g_n uniformly convergent, hence continuous, mapping XX into [−1,1][-1, 1]. On FF the remainders (23)n→0\bigl(\tfrac{2}{3}\bigr)^n \to 0, so g∣F=fg|_F = f. A linear rescaling between [a,b][a, b] and [−1,1][-1, 1], applied to ff before and to gg after, gives the theorem for every bounded interval. ■\blacksquare

Theorem 8.3 (Urysohn Metrization Theorem). Every second-countable regular T1T_1 space is metrizable (its topology is induced by some metric).

Proof sketch. Embed XX into the Hilbert cube [0,1]ω[0, 1]^\omega using a countable collection of Urysohn functions constructed from a countable basis. The Hilbert cube is metrizable, so the subspace topology on XX is metrizable. ■\blacksquare

Corollary 8.8. A space is a separable metric space if and only if it is second-countable and regular T1T_1.

The hierarchy of separation axioms:

T4  ⟹  T3.5  ⟹  T3  ⟹  T2  ⟹  T1  ⟹  T0T_4 \implies T_{3.5} \implies T_3 \implies T_2 \implies T_1 \implies T_0

Each implication is strict: there exist spaces satisfying each level but not the next.

Problem 1. Show that the Zariski topology on Rn\mathbb{R}^n is T1T_1 but not T2T_2.

Problem 2. Prove that a closed subspace of a normal space is normal.

Solution. Let XX be normal and F⊆XF \subseteq X closed. Let A,BA, B be disjoint closed sets in FF. Then A,BA, B are also closed in XX (since FF is closed). By normality of XX, there exist disjoint open U,V⊆XU, V \subseteq X with A⊆UA \subseteq U, B⊆VB \subseteq V. Then U∩FU \cap F and V∩FV \cap F are disjoint open in FF separating AA and BB. ■\blacksquare

Problem 3. In the proof of Proposition 8.9, the separating sets U1∪U2U_1 \cup U_2 need not cover XX even when F1∩F2=∅F_1 \cap F_2 = \emptyset. Exhibit a point of R\mathbb{R} lying in neither, for F1={0}F_1 = \{0\} and F2={2}F_2 = \{2\}, and explain why this does not affect the proof.

Problem 4. Prove that a product of two T2T_2 spaces is T2T_2. Is the same true for T3T_3 or T4T_4?

Problem 5. Show that the Sorgenfrey plane Rℓ×Rℓ\mathbb{R}_\ell \times \mathbb{R}_\ell is not normal, even though the Sorgenfrey line Rℓ\mathbb{R}_\ell is normal. (Hint: the antidiagonal {(x,−x):x∈R}\{(x, -x) : x \in \mathbb{R}\} is closed and discrete.)

8.12 T5T_5 (Completely Normal) and T6T_6 (Perfectly Normal)

Section titled “8.12 T5T_5T5​ (Completely Normal) and T6T_6T6​ (Perfectly Normal)”

Definition. A space XX is completely normal (T5T_5) if every subspace of XX is normal. Equivalently, for any two separated sets A,BA, B (i.e., Aˉ∩B=A∩Bˉ=∅\bar{A} \cap B = A \cap \bar{B} = \emptyset), there exist disjoint open sets separating them.

Definition. A space XX is perfectly normal (T6T_6) if XX is normal and every closed set is a GδG_\delta set (a countable intersection of open sets).

Proposition 8.9. Every metric space is T6T_6 (perfectly normal).

Proof. Normality. For a nonempty closed FF define d(x,F)=inf⁡{d(x,y):y∈F}d(x, F) = \inf\{d(x, y) : y \in F\}. The map x↦d(x,F)x \mapsto d(x, F) is continuous; in fact ∣d(x,F)−d(y,F)∣≤d(x,y)|d(x, F) - d(y, F)| \leq d(x, y), since for every z∈Fz \in F, d(x,F)≤d(x,z)≤d(x,y)+d(y,z)d(x, F) \leq d(x, z) \leq d(x, y) + d(y, z), and taking the infimum over zz preserves the inequality. Given disjoint closed F1,F2F_1, F_2, set

U1={x:d(x,F1)<d(x,F2)},U2={x:d(x,F2)<d(x,F1)}.U_1 = \{x : d(x, F_1) < d(x, F_2)\}, \qquad U_2 = \{x : d(x, F_2) < d(x, F_1)\}.

These are open; preimages of (−∞,0)(-\infty, 0) under the continuous functions x↦d(x,F1)−d(x,F2)x \mapsto d(x, F_1) - d(x, F_2) and its negation; and they are disjoint by construction. If x∈F1x \in F_1 then d(x,F1)=0d(x, F_1) = 0, while d(x,F2)>0d(x, F_2) > 0: otherwise every ball around xx would meet the closed set F2F_2, forcing x∈F2‾=F2x \in \overline{F_2} = F_2, contradicting disjointness. Hence F1⊆U1F_1 \subseteq U_1, and symmetrically F2⊆U2F_2 \subseteq U_2.

Closed sets are GδG_\delta. Let FF be closed. Then

F=⋂n=1∞{x:d(x,F)<1/n}.F = \bigcap_{n=1}^{\infty} \{x : d(x, F) < 1/n\}.

Each set on the right is open, and FF is contained in each since d(x,F)=0d(x, F) = 0 for x∈Fx \in F. Conversely, if xx lies in the intersection then d(x,F)=0d(x, F) = 0, so every ball around xx meets FF, i.e. x∈F‾=Fx \in \overline{F} = F. ■\blacksquare

Proposition 8.10. T6  ⟹  T5  ⟹  T4T_6 \implies T_5 \implies T_4 (assuming T1T_1).

Proof. T5⇒T4T_5 \Rightarrow T_4: XX is a subspace of itself, so “every subspace is normal” specialises to normality.

T6⇒T5T_6 \Rightarrow T_5: let Y⊆XY \subseteq X be any subspace; we show YY is normal. Let A,BA, B be disjoint closed subsets of YY. Write A=Y∩CAA = Y \cap C_A and B=Y∩CBB = Y \cap C_B with CA,CBC_A, C_B closed in XX, and let fA,fB:X→[0,1]f_A, f_B : X \to [0, 1] be continuous functions with CA=fA−1(0)C_A = f_A^{-1}(0) and CB=fB−1(0)C_B = f_B^{-1}(0), which perfect normality of XX provides. Define

h:Y→[0,1],h(y)=fA(y)fA(y)+fB(y).h : Y \to [0, 1], \qquad h(y) = \frac{f_A(y)}{f_A(y) + f_B(y)}.

The denominator never vanishes: fA(y)+fB(y)=0f_A(y) + f_B(y) = 0 would force both to vanish, i.e. y∈CA∩CBy \in C_A \cap C_B, hence y∈(CA∩Y)∩(CB∩Y)=A∩B=∅y \in (C_A \cap Y) \cap (C_B \cap Y) = A \cap B = \emptyset. So hh is continuous, with h=0h = 0 on AA (fA=0f_A = 0 there, and fB>0f_B > 0 since y∈Ay \in A implies y∉By \notin B) and h=1h = 1 on BB by symmetry. Then h−1([0,1/2))h^{-1}([0, 1/2)) and h−1((1/2,1])h^{-1}((1/2, 1]) are disjoint open subsets of YY containing AA and BB. So YY is normal, and XX is completely normal. ■\blacksquare

Note the mechanism: perfect normality converts closed sets into zero sets of functions, and zero sets can be averaged; quotients like fA/(fA+fB)f_A / (f_A + f_B) are what mere normality, which only provides open sets, cannot produce.

Theorem 8.4 (Tychonoff Product Theorem). The product of any collection of compact topological spaces is compact (in the product topology).

This is one of the most important theorems in topology, equivalent to the axiom of choice. The proof uses the finite intersection property and Zorn’s lemma.

For a Tychonoff space XX, the Stone-Cech compactification βX\beta X is the unique compact Hausdorff space containing XX as a dense subspace such that every continuous map from XX to a compact Hausdorff space extends continuously to βX\beta X.

Example. βN\beta \mathbb{N} is the set of ultrafilters on N\mathbb{N} with the topology generated by {A∗:A⊆N}\{A^* : A \subseteq \mathbb{N}\} where A∗={U∈βN:A∈U}A^* = \{U \in \beta\mathbb{N} : A \in U\}.

Problem 6. Prove that every compact subset of a Hausdorff space is closed.

Problem 7. Show that Q\mathbb{Q} with the subspace topology from R\mathbb{R} is not a T4T_4 space.

Problem 8. Prove that a space is Hausdorff if and only if the diagonal Δ={(x,x):x∈X}\Delta = \{(x, x) : x \in X\} is closed in X×XX \times X.

Separation axioms measure how well a topological space distinguishes points and sets. T0T_0 means any two points can be separated by an open set containing one but not the other. T1T_1 means each point is closed (singletons are closed sets). T2T_2 (Hausdorff) means any two distinct points have disjoint neighbourhoods, you can draw a wall between them. Higher axioms (T3T_3, T4T_4) separate points from closed sets and closed sets from each other with open neighbourhoods. The hierarchy matters because compactness, convergence, and uniqueness of limits all depend on having enough separation. Without Hausdorff, limits are not unique and compact sets need not be closed.

Mistake 1: Assuming that all separation axioms are independent. The separation axioms form a hierarchy: T4  ⟹  T3  ⟹  T2  ⟹  T1  ⟹  T0T_4 \implies T_3 \implies T_2 \implies T_1 \implies T_0. A space that is T3T_3 is automatically T2T_2, T1T_1, and T0T_0. Do not assume that a space can be T3T_3 without being T2T_2.

Mistake 2: Confusing regularity with normality. Regularity (T3T_3) separates points from closed sets, while normality (T4T_4) separates disjoint closed sets from each other. A space can be regular without being normal. For example, the Sorgenfrey line is regular but not normal.

Mistake 3: Assuming that subspaces of Hausdorff spaces are Hausdorff. The subspace of a Hausdorff space is Hausdorff. However, the product of Hausdorff spaces is Hausdorff, but the quotient of a Hausdorff space need not be Hausdorff. Do not assume that Hausdorffness is preserved under all constructions.

Mistake 4: Forgetting that compact subsets of Hausdorff spaces are closed. In a Hausdorff space, every compact subset is closed. This is a key property that is often used to prove that certain sets are closed. However, the converse is not true: a closed subset of a Hausdorff space need not be compact (e.g., R\mathbb{R} is closed in itself but not compact).

Mistake 5: Assuming that T1T_1 implies T2T_2. A T1T_1 space need not be T2T_2. The cofinite topology on an infinite set is T1T_1 (every singleton is closed) but not T2T_2 (any two nonempty open sets intersect). Do not assume that T1T_1 implies Hausdorff.