Metric Spaces
So far the theory of analysis are developed with points and functions base on Euclidean space or complex plane. Metric spaces provide a more general setup for analysis, in which the fundamental property is that there is a distance between any two points.
Definition. Suppose that $X$ is a (non-empty) set and that $\rho: X \times X \to \mathbf{R}$ is a real valued function with the following properties:
$\rho(x, y) \ge 0$ for all $x, y \in X$ with equality iff $x = y$;
$\rho(x, y) = \rho(y, x)$ for all $x, y \in X$;
$\rho(x, z) \le \rho(x, y) + \rho(y, z)$ for all $x, y, z \in X$ (triangle inequality).
Then the function $\rho$ is called a metric/distance on $X$ and $(X, \rho)$ is called a metric space.
-
Any set can be equipped with the discrete metric:
\[\rho(x, y) = \begin{cases} 0 & \text{if}\; x = y \\ 1 & \text{if}\; x \not= y \\ \end{cases}\] -
For $\mathbf{R}$, the usual metric is given by $\rho(x, y) = \vert x - y \vert$.
-
For $\mathbf{R}^n$, the usual metric is the norm, i.e. $\rho(x, y) = \sqrt{(x_1 - y_1)^2 + … + (x_n - y_n)^2}$.
-
For $\mathbf{C}$, the usual metric is the same as $\mathbf{R}^2$, i.e. $\rho(z, z’) = \vert z - z’ \vert = \sqrt{(x - x’)^2 + (y - y’)^2}$.
-
For $B[a, b]$ being the set of bounded real functions on the interval $[a, b]$, we can have $\rho(f, g) = \sup \vert f(x) - g(x) \vert$, i.e. the maximum vertical distance between the two functions.
Definition. Let $(X, \rho)$ be a metric space and $Y \subset X$ and $\sigma: Y \times Y \to \mathbf{R}$ be the restriction of $\rho$ to $Y \times Y$, i.e. $\sigma(y, y’) = \rho(y, y’)$ for $y, y’ \in Y$. Then $\sigma$ is a metric induced by $(X, \rho)$ on $Y$ and $(Y, \sigma)$ is a metric subspace of $(X, \rho)$.
We can now then extend the definition of convergence of sequences of real numbers to sequences of points in a metric space.
Definition. The sequence $(x_n)$ of points in the metric space $(X, \rho)$ is convergent to the point $x \in X$ if
\[\rho(x_n, x) \to 0 \quad\text{as}\quad n \to \infty\]We write $x_n \to x$ as $n \to \infty$ or $\lim_{n \to \infty} x_n = x$ as in classical analysis. Alternatively, we can also define it as
\[(\forall \varepsilon > 0)(\exists N)(\forall n > N)\;\rho(x_n, x) < \varepsilon\]
Proposition. A sequence cannot converge to two distinct limits.
Proof.
Suppose that the sequence $(x_n)$ converges to two different limits $L_1$ and $L_2$ so $\rho(L_1, L_2)$ is non-zero. By triangle inequality, we have
\[\rho(L_1, L_2) \le \rho(L_1, x_n) + \rho(x_n, L_2)\]By definition, we have both $\rho(L_1, x_n) \to 0$ and $\rho(x_n, L_2) \to 0$ so $\rho(L_1, L_2) \to 0$ which implies $L_1 = L_2$.
Definition. Suppose that $\rho$ and $\sigma$ are both metrics on the set $X$ such that a sequence converges in $(X, \rho)$ iff it converges in $(X, \sigma)$ (to the same limit). Then $\rho$ and $\sigma$ are said to be equivalent metrics.
A sufficient but not necessary condition for metrics to be equivalent is stated below.
Definition. Suppose that $\rho$ and $\sigma$ are both metrics on the set $X$. Then $\rho$ and $\sigma$ are Lipschitz equivalent if there exists positive real constants $\lambda$ and $\mu$ such that
\[\lambda \rho(x, y) \le \sigma(x, y) \le \mu \rho(x, y)\]for all $x, y \in X$.
If two metrics are equivalent, the topological properties are preserved between them.
Open and Closed Sets
Definition. Let $(X, \rho)$ be a metric space and $a \in X$ and $r \in \mathbf{R}_{> 0}$. The open ball with centre $a$ and radius $r$ is defined by
\[B_r(a) = \Set{x \in X : \rho(a, x) < r}\]
Definition. Given $E \subseteq X$, $a \in X$ is said to be a limit point of $E$ if
\[(\forall \varepsilon > 0)(\exists e \in E)\; 0 < \rho(a, e) < \varepsilon\]i.e. $(B_\varepsilon(a) - \Set{a}) \cap E \not= \emptyset$ for all $\varepsilon > 0$.
Proposition. Given $E \subseteq X$, $a \in X$ is a limit point of $E \subseteq X$ iff either
every open ball $B_\varepsilon(a)$ contains infinitely many points of $E$; or
there is a sequence of points $\Set{e_n \in E}$ such that $e_n \not= a$ and $e_n \to a$ as $n \to \infty$.
Proof.
($\Rightarrow$) If $a$ is a limit point, then for every $n$, there exists a point $e_n \in E$ such that
\[0 < \rho(a, e_n) < 1/n\]The sequence $\Set{x_n}$ satisfies the second condition, in which implies the first.
($\Leftarrow$) First condition obviously implies $a$ is a limit point. By definition, the second condition implies that
\[(\forall \varepsilon > 0)(\exists N)(\forall n > N)\; \rho(a, e_n) < \varepsilon\]so there must be $e = e_n \not= a$ satisfying $0 < \rho(a, e) < \varepsilon$.
These conditions show that a finite set cannot have a limit point. Also, a limit point of $E$ may or may not belong to $E$.
Definition. Given $E \subseteq X$, $e \in E$ is an isolated point of $E$ if it is not a limit point, i.e.
\[(\exists \delta > 0)\; B_\delta(e) \cap E = \emptyset\]
Definition. Given $E \subseteq X$, $e \in E$ is an interior point of $E$ if
\[(\exists \delta > 0)\; B_\delta(e) \subset E\]
The property of being a limit point or interior point is not intrinsic to the subset but it is relative to the parent set $X$ and the choice of metric $\rho$. For example, a subset of rational numbers has no interior points in $\mathbf{R}$ but all the points of the same subset are interior points in $\mathbf{Q}$.
Definition. A subset $F \subseteq X$ is closed if $F$ contains all its limit points. A subset $G \subseteq X$ is open if every point of $F$ is an interior point of $G$.
From the above, since finite sets have no limit points, they are closed. It is possible for a subset to be both open and closed or neither open nor closed. For example, the empty set and the whole space is both open and closed and the interval $[0, 1)$ of $\mathbf{R}$ is neither open nor closed.
Proposition. A set $F$ is closed iff whenever $(x_n)$ is a convergent sequence of points in $F$, $\lim_{n \to \infty} x_n \in F$.
Proof.
($\Rightarrow$) Suppose that $F$ is closed and let $x_n \in F \to x$ as $n \to \infty$. If $x_n = x$ for some $n$ then for sure $x \in F$. Otherwise, $x$ is a limit point of $F$ and again $x \in F$.
($\Rightarrow$) Suppose that $F$ has the described property. If $F$ has no limit points, then for sure $F$ is closed. Otherwise, let $x$ be a limit point of $F$ then there is a sequence $x_n \to x$ such that $x \in F$, so $F$ contains all its limit points.
Proposition. A set $G$ is open iff $G’$ is closed. A set $F$ is closed iff $F’$ is open.
Proof.
Let $G$ be open. If $G’$ has no limit points, then $G’$ is closed. Let $x$ be a limit point of $G’$. Then every open ball $B_\varepsilon(x)$ contains a point in $G’$ so $x$ cannot be an interior point of $G$ and $x \in G’$.
Let $F$ be closed. If $F’$ is empty, then $F’$ is open. For any point $x \in F’$, $x$ is not a limit point of $F$ and there exists $\delta$ such that $B_\delta(x)$ contains no point in $F$. Thus, $B_\delta(x) \subset F’$ and $x$ is an interior point of $F’$.
Since convergence of sequences to the same limit is preserved between equivalent metrics, together with the above two propositions, we can see that metric spaces with equivalent metrics have the same set of open and closed sets, and therefore preserve the topological properties.
Proposition. The union of any collection of open sets is open. The intersection of any collection of closed sets is closed.
Proof.
Let $x \in \bigcup G$, then $x$ is an interior point of at least one of the open set, say $G^\ast$. Thus, $B_\delta(x) \subset G^\ast$ which implies $B_\delta(x) \subset \bigcup G$ and every point is an interior point.
If $F$ is closed, $F’$ is open. Therefore, the complement of the intersection of closed sets, i.e.
\[\left( \bigcap F \right)' = \bigcup F'\]is a collection of open sets which is open. Hence the intersection itself is closed.
Proposition. The intersection of finite collection of open sets is open. The union of finite collection of closed sets is closed.
Proposition. Let $(Y, \sigma)$ be a metric subspace of $(X, \rho)$. Then a set is open in $(Y, \sigma)$ iff there exists an open set $G$ in $(X, \rho)$ such that $E = Y \cap G$. A similar result holds for closed sets.
Proof.
($\Rightarrow$) Let $E$ be a open set in $Y$. For every $x \in E$, there exists $\delta_x$ such that $B_{\delta_x}(x) \subset E$. It means that these open balls only contain elements in $E$, and therefore the set
\[G = \bigcup_{x \in E} B_{\delta_x}(x)\]is open in $X$ and $E = Y \cap G$.
($\Leftarrow$) Let $G$ be open in $X$. For every $x \in Y \cap G$, there exists $\delta_x$ such that $B_{\delta_x}(x) \subset G$. Therefore $B_{\delta_x}(x) \cap Y \subset Y \cap G$ and $x$ is an interior point of $Y \cap G$.
Corollary. If $Y$ is open/closed in $X$, then $Z$ is open/closed in $Y$ iff it is open/closed in $X$.
Definition. The interior of $E \subseteq X$, denoted by $E^\circ$, is the set of interior points of $E$.
Definition. The closure of $E \subseteq X$, denoted by $\bar{E}$, is the union of $E$ and the set of limit points of $E$. Thus, $\bar{E}$ is the set of $x$ such that every $B_\varepsilon(x)$ contains at least one point of $E$ or $x \in \bar{E}$ iff $x$ is the limit of a sequence of points of $E$.
Alternatively, $E^\circ$ is the union of all open sets contained in $E$ and so is the largest open set contained in $E$ and $\bar{E}$ is the intersection of all closed sets containing $E$ and so is the smallest closed set containing $E$.
Proposition. $(\bar{E})’ = (E’)^\circ$.
Proof.
By definition, $x \in \bar{E}$ iff for all $\varepsilon > 0$, $B_\varepsilon(x) \cap E \not= \emptyset$, so if $y \in (\bar{E})’$ then $B_\varepsilon(y) \cap E = \emptyset$. Therefore, $y \in E’$ and there exists $\delta$ such that $B_\delta(y) \subset E’$ so $y \in (E’)^\circ$.
Proposition. For any $E \subseteq X$, $E^\circ$ is open and $\bar{E}$ is closed.
Proof.
If $E^\circ$ is empty, it is open. For any $x \in E^\circ$, there exists $\delta$ such that $B_\delta(x) \subset E$. Since every $y \in B_\delta(x)$ is an interior point of $B_\delta(x)$ so of $E$, $B_\delta(x) \subset E^\circ$ and $x$ is an interior point of $E^\circ$. By $(\bar{E})’ = (E’)^\circ$, $\bar{E}$ is closed.
We can also define open and closed sets by interiors and closures, $G$ is open iff $G^\circ = G$ and $F$ is closed iff $\bar{F} = F$.
Definition. A frontier of $E \subseteq X$, denoted by $\text{fr}\, E$, is the set of points such that every open ball $B_\varepsilon(x)$ contains at least one point of $E$ and at least one point of $E’$.
In other words, since a point $x$ cannot be in both $E$ and $E’$, $x$ is either a point in $E$ and a limit point in $E’$ or vice versa, so
\[\text{fr}\, E = \bar{E} - E^\circ\]We also have $X = E^\circ \cup \text{fr}\, E \cup (E’)^\circ$, where $(E’)^\circ$ is called the exterior of $E$.
References
- J C Burkill A Second Cource in Mathematical Analysis, 1970 - Chapter 2.1, 2.3