Metric Spaces Fundamentals

Why should you care about metric spaces? In mathematics, we often discuss distance, convergence, and continuity. While calculus grounds these ideas in the familiar setting of the real number line, metric spaces provide the abstract, unifying framework. They allow us to rigorously study these concepts in wildly different contexts—from finite graphs to infinite-dimensional function spaces—with a single, powerful set of definitions and theorems. Mastering this framework is essential for advanced study in analysis, topology, and many applied fields.

Core Definitions: What is a Metric?

At its heart, a metric space is a pair $(X,d)$, where $X$ is a set and $d$ is a function, called a metric or distance function. This function assigns a non-negative real number to every pair of elements $x,y$ in $X$, which we interpret as the distance between them. For $d$ to be a legitimate metric, it must satisfy three axioms for all $x,y,z\in X$:

1. Positivity: $d(x,y)\ge 0$, and $d(x,y)=0$ if and only if $x=y$. Distance is never negative, and the only way points can be zero distance apart is if they are the same point.
2. Symmetry: $d(x,y)=d(y,x)$. The distance from $x$ to $y$ is the same as the distance from $y$ to $x$.
3. Triangle Inequality: $d(x,z)\le d(x,y)+d(y,z)$. The direct route between two points is never longer than a route that makes a detour through a third point.

These rules formalize our intuitive geometric understanding of distance. The triangle inequality is particularly powerful, forming the backbone of countless proofs in analysis. A metric space, therefore, is any set where we can define a sensible notion of "distance" that obeys these three rules.

Key Examples of Metric Spaces

Understanding metric spaces requires moving beyond the abstract definition to concrete, and sometimes surprising, examples.

• Euclidean Space (${\mathbb{R}}^n$): The most familiar example. For points $x=(x_1,...,x_n)$ and $y=(y_1,...,y_n)$, the standard Euclidean metric is defined by:

$$d_2(x,y)=\sqrt{(x_1-y_1{)}^2+...+(x_n-y_n{)}^2}.$$ Verifying the three axioms, especially the triangle inequality, relies on the Cauchy-Schwarz inequality.

• Discrete Metric: On any set $X$, you can define the discrete metric:

$$d(x,y)=\{\begin{array}{ll}0& \text{if }x=y,\\ 1& \text{if }x\ne y.\end{array}$$ This simple metric is extremely useful for constructing counterexamples. It shows that every set can be made into a metric space, but the resulting geometry is chunky—every distinct point is exactly 1 unit away from every other.

• Function Spaces: Consider the set $C([a,b])$ of all continuous real-valued functions on a closed interval $[a,b]$. Two important metrics are:
• The supremum metric (or uniform metric): $d_{\infty }(f,g)={\sup }_{x\in [a,b]}|f(x)-g(x)|$. This measures the maximum vertical separation between the graphs of $f$ and $g$.
• The $L^1$ metric: $d_1(f,g)={\int }_a^b|f(x)-g(x)|dx$. This measures the total area between the graphs of $f$ and $g$.

These are fundamentally different ways to measure the "distance" between functions, and convergence under each metric has distinct mathematical meaning.

Topology in Metric Spaces: Open and Closed Sets

Once we have a notion of distance, we can describe the "shape" or topology of the space. The fundamental building block is the open ball. Given a point $p\in X$ and a radius $r>0$, the open ball centered at $p$ is the set $B_r(p)=\{x\in X:d(x,p)<r\}$—all points within distance $r$ of $p$.

A subset $U$ of $X$ is called an open set if, for every point $p\in U$, there exists some radius $r>0$ such that the entire open ball $B_r(p)$ is contained within $U$. Intuitively, every point in an open set has some "elbow room" around it that is also in the set. The collection of all open sets in a metric space is called its topology.

A subset $F$ is closed if its complement $X\setminus F$ is open. A more intuitive, equivalent characterization is that a set is closed if it contains all its limit points (a concept tied to convergence, discussed next). Crucially, "closed" is not the opposite of "open"; a set can be both (like the entire space $X$ or the empty set $\varnothing$), or neither (like the half-open interval $[0,1)$ in $\mathbb{R}$).

Sequences and Convergence

The concept of a sequence converging to a limit is central to analysis. In a metric space $(X,d)$, we say a sequence $(x_n)$ converges to a limit $L\in X$ if the distances $d(x_n,L)$ approach zero as $n$ increases. Formally: for every $ϵ>0$, there exists an integer $N$ such that for all $n\ge N$, we have $d(x_n,L)<ϵ$.

This generalizes the familiar $ϵ$-$N$ definition from real analysis. Convergence depends entirely on the metric. For instance, in a space with the discrete metric, a sequence $(x_n)$ converges to $L$ if and only if it is eventually constant equal to $L$—because the distance must eventually be less than 1.

Completeness: Spaces with No "Missing" Limits

In the real numbers, every Cauchy sequence converges. A Cauchy sequence is one where the terms get arbitrarily close to each other: for every $ϵ>0$, there exists an $N$ such that for all $m,n\ge N$, $d(x_m,x_n)<ϵ$. In a general metric space, every convergent sequence is Cauchy, but the converse is not always true. There might be Cauchy sequences that "should" converge, but their intended limit point is not present in the space.

A metric space is called complete if every Cauchy sequence in it converges to a limit that is also in the space. ${\mathbb{R}}^n$ with the Euclidean metric is complete. The set of rational numbers $\mathbb{Q}$ with the standard metric is not complete, as you can have Cauchy sequences of rationals that converge to an irrational number like $\sqrt{2}$, which is not in $\mathbb{Q}$. Completeness is a crucial property for many fundamental results in analysis, like the Banach Fixed Point Theorem.

Common Pitfalls

1. Confusing "Cauchy" with "Convergent": Always remember: Convergent $⟹$ Cauchy, but Cauchy $⟹$ Convergent only in a complete space. In an incomplete space like $\mathbb{Q}$, you can have sequences that are Cauchy but do not converge within the space.
2. Misunderstanding Closed Sets: A set is not closed simply because it is not open. The key test is whether it contains all its limit points. The interval $[0,1)$ in $\mathbb{R}$ is not closed because the limit point $1$ is not in the set, and it is not open because the point $0$ has no open ball around it fully contained in the set.
3. Assuming Properties from ${\mathbb{R}}^n$: It is tempting to visualize all metric spaces as variations of ${\mathbb{R}}^2$. This can be misleading. In the discrete metric, for example, every subset is both open and closed, and the only convergent sequences are eventually constant. Always reason from the definitions of $d$, not from a specific geometric picture.
4. Overlooking Metric Dependence: Statements about convergence, openness, and completeness are meaningless without specifying the metric. A sequence of functions may converge in the $L^1$ metric but not in the supremum metric. Always ask: "Convergent with respect to which metric?"

Summary

• A metric space $(X,d)$ is a set equipped with a distance function satisfying positivity, symmetry, and the triangle inequality. This abstract framework generalizes the concept of distance.
• Open sets are defined via open balls and form the topology of the space; closed sets are their complements and can be characterized as sets containing all their limit points.
• A sequence converges to a limit $L$ if the distance from the sequence terms to $L$ tends to zero. This depends critically on the choice of metric.
• A Cauchy sequence is one where terms get arbitrarily close to each other. A space is complete if every Cauchy sequence has a limit within the space, a property not held by all metric spaces (e.g., $\mathbb{Q}$).
• Essential examples include Euclidean spaces (${\mathbb{R}}^n$), the discrete metric on any set, and function spaces like $C([a,b])$ with the supremum or $L^1$ metrics, each illustrating different geometric and analytical behaviors.