The Timpson Lyceum seal

The Timpson Lyceum · General Topology (Point Set Topology)

Metric Spaces – Lecture 16 (Topology)

Metric Spaces – Lecture 16

Overview

This lecture closes out our work on homeomorphisms and then pivots to a major new structure: the metric. We first nail down embeddings (and the special cases of arcs/paths and simple closed curves), then prove that the Hausdorff property is preserved by homeomorphism. From there we reset and introduce metric spaces — sets equipped with a genuine notion of distance, not just proximity. We define a metric by its three defining properties, prove that absolute value is a metric on R\mathbb{R}, survey several metrics on R2\mathbb{R}^2 (Euclidean, taxicab, max), and show how every metric induces a topology — the metric topology — so that every metric space is automatically a topological space.

Key Concepts

Embedding. A function f:X→Yf : X \to Y between topological spaces is an embedding if it maps XX homeomorphically onto its image f(X)f(X), where f(X)f(X) carries the subspace topology from YY. The image looks "topologically identical" to XX, sitting inside YY.

Hausdorff property. A topological space is Hausdorff if any two distinct points can be "housed off" from one another: for points x≠yx \neq y there exist disjoint open sets U,VU, V with x∈Ux \in U, y∈Vy \in V, U∩V=∅U \cap V = \varnothing. This is the first genuine topological property — one a space either has or lacks. Nice/intuitive spaces (anything from a metric) are Hausdorff; pathological ones (e.g. the finite-complement topology on R\mathbb{R}, where any two nonempty open sets intersect) are not.

Hausdorff is a topological invariant. If X≅YX \cong Y (homeomorphic) and XX is Hausdorff, then so is YY — a homeomorphism preserves all topological structure, just as congruence preserves "being a right triangle."

Metric. A metric on a set XX is a function d:X×X→Rd : X \times X \to \mathbb{R} satisfying, for all x,y,z∈Xx, y, z \in X:

The pair (X,d)(X, d) is a metric space. Where a topology only answers "are these points close?" yes/no, a metric reports exactly how far apart any two points are — strictly more structure.

Metrics on R2\mathbb{R}^2. For p=(p1,p2)p = (p_1, p_2) and q=(q1,q2)q = (q_1, q_2):

(The min of the two displacements is not a metric: two distinct points differing only in one coordinate would get distance 00, violating the identity property.)

Open and closed balls. In a metric space (X,d)(X, d), for x∈Xx \in X and ε>0\varepsilon > 0:

B(x,ε)={ y∈X:d(x,y)<ε },B‾(x,ε)={ y∈X:d(x,y)≤ε }.B(x, \varepsilon) = \{\, y \in X : d(x,y) < \varepsilon \,\}, \qquad \overline{B}(x, \varepsilon) = \{\, y \in X : d(x,y) \leq \varepsilon \,\}.

The same balls look different under different metrics: the Euclidean ball is a disk, the taxicab ball is a diamond (rhombus), and the max ball is a square. For the same xx and ε\varepsilon, the taxicab diamond sits inside the Euclidean disk, which sits inside the max square.

Metric topology. Let (X,d)(X, d) be a metric space and let β\beta be the collection of all open balls. Then β\beta is a basis, and the topology it generates is the topology induced by dd (the metric topology). A set UU is open in this topology iff for every y∈Uy \in U there is some ε>0\varepsilon > 0 with B(y,ε)⊆UB(y, \varepsilon) \subseteq U. Consequence: every metric space is automatically a topological space (the converse fails). On Rn\mathbb{R}^n the Euclidean metric induces exactly the standard topology; on R\mathbb{R} the open ball B(x,ε)B(x,\varepsilon) is just the open interval (x−ε, x+ε)(x - \varepsilon,\ x + \varepsilon).

Function-space metric. On C[a,b]C[a,b], the set of continuous functions f:[a,b]→Rf : [a,b] \to \mathbb{R}, one natural metric is the area between the graphs:

d(f,g)=∫ab∣f(x)−g(x)∣ dx.d(f, g) = \int_a^b |f(x) - g(x)|\, dx.

Two functions are distance 00 apart exactly when they are the same function. This treats functions themselves as the "points" of a metric space.

Worked Example

Claim. Absolute value defines a metric on R\mathbb{R} via d(x,y)=∣x−y∣d(x,y) = |x - y|.

We use two lemmas: x≤∣x∣x \leq |x| for all xx, and ∣−x∣=∣x∣|-x| = |x|.

Positivity / identity. ∣x−y∣≥0|x - y| \geq 0 always, and ∣x−y∣=0  ⟺  x−y=0  ⟺  x=y|x - y| = 0 \iff x - y = 0 \iff x = y.

Symmetry. Apply ∣−x∣=∣x∣|-x| = |x| to the difference:

d(x,y)=∣x−y∣=∣−(x−y)∣=∣y−x∣=d(y,x).\begin{aligned} d(x,y) &= |x - y| \\ &= |-(x - y)| = |y - x| = d(y,x). \end{aligned}

Triangle inequality. First establish the general fact ∣a+b∣≤∣a∣+∣b∣|a + b| \leq |a| + |b| by cases on the sign of a+ba + b:

if a+b≥0:∣a+b∣=a+b≤∣a∣+∣b∣,if a+b<0:∣a+b∣=−(a+b)=(−a)+(−b)≤∣−a∣+∣−b∣=∣a∣+∣b∣.\begin{aligned} \text{if } a + b \geq 0:\quad |a+b| &= a + b \leq |a| + |b|, \\ \text{if } a + b < 0:\quad |a+b| &= -(a+b) = (-a) + (-b) \leq |{-a}| + |{-b}| = |a| + |b|. \end{aligned}

Now take any x,y,zx, y, z and split the difference x−zx - z through yy — letting a=x−ya = x - y and b=y−zb = y - z:

d(x,z)=∣x−z∣=∣(x−y)+(y−z)∣≤∣x−y∣+∣y−z∣=d(x,y)+d(y,z).\begin{aligned} d(x,z) = |x - z| &= |(x - y) + (y - z)| \\ &\leq |x - y| + |y - z| = d(x,y) + d(y,z). \end{aligned}

All three properties hold, so d(x,y)=∣x−y∣d(x,y) = |x - y| is a metric on R\mathbb{R}. (This is just the Euclidean metric on R1\mathbb{R}^1, since (x−y)2=∣x−y∣\sqrt{(x - y)^2} = |x - y|.)

Summary