Continuous Maps Between Metric Spaces

⚡ Key Takeaways

Continuous maps between metric spaces are functions $f:(X,d_X)\to(Y,d_Y)$ that preserve "closeness": small changes in input produce small changes in output. Key result: $f$ is continuous iff the preimage of every open set is open — the topological characterization that frees continuity from the metric. Applies in: analysis, topology, geometry, numerical methods, dynamical systems. Origins: Cauchy and Weierstrass (rigorous $\varepsilon$ – $\delta$ , 1820s–1870s), Fréchet (abstract metric spaces, 1906).

💡 The Core Insight

Continuity is about preservation of proximity. Three faces of the same idea coexist:

Metric ( $\varepsilon$ – $\delta$ ): control the output error by controlling the input perturbation.
Sequential: $x_n\to a$ forces $f(x_n)\to f(a)$ .
Topological (open sets): $f^{-1}(\text{open})$ is open.

In metric spaces all three are equivalent. The topological version is the most powerful because it reveals continuity as the natural notion of a "structure-preserving map" for topology.

DefinitionMetric Space

A metric space is a pair $(X,d)$ where $X$ is a set and $d:X\times X\to[0,\infty)$ satisfies, for all $x,y,z\in X$ :

1

\quad d(x,y)=0 \iff x=y

Derivation hint: This is the identity of indiscernibles — distance zero means identical points.

2

\quad d(x,y)=d(y,x)

Derivation hint: Symmetry — distance does not depend on the direction of measurement.

3

\quad d(x,z)\le d(x,y)+d(y,z)

Derivation hint: The triangle inequality — going via a third point cannot be shorter. The open ball of radius $r>0$ centered at $a$ is $B_X(a,r)=\{x\in X: d_X(x,a)<r\}$ .

DefinitionContinuity at a Point —

\varepsilon

–

\delta

Let $f:(X,d_X)\to(Y,d_Y)$ . Then $f$ is continuous at $a\in X$ if

4

\quad \forall\,\varepsilon>0\ \ \exists\,\delta>0\ \ \forall x\in X:\ d_X(x,a)<\delta \implies d_Y\big(f(x),f(a)\big)<\varepsilon

Derivation hint: Read it as "for every output tolerance $\varepsilon$ there is an input tolerance $\delta$ that guarantees it." The $\delta$ may depend on both $\varepsilon$ and $a$ . Equivalently, in ball notation:

5

\quad \forall\,\varepsilon>0\ \ \exists\,\delta>0:\ f\big(B_X(a,\delta)\big)\subseteq B_Y\big(f(a),\varepsilon\big)

Derivation hint: Rewrite [4] by collecting the $x$ with $d_X(x,a)<\delta$ into a ball and noting the conclusion places their images in a ball about $f(a)$ . $f$ is continuous if it is continuous at every $a\in X$ .

TheoremEquivalent Characterizations of Continuity

For $f:(X,d_X)\to(Y,d_Y)$ , the following are equivalent: 1. ( $\varepsilon$ – $\delta$ ) $f$ is continuous at every point per [4]. 2. (Sequential) For every sequence $x_n\to a$ in $X$ , $f(x_n)\to f(a)$ in $Y$ . 3. (Open sets) $f^{-1}(U)$ is open in $X$ for every open $U\subseteq Y$ . 4. (Closed sets) $f^{-1}(C)$ is closed in $X$ for every closed $C\subseteq Y$ . 5. (Closure) $f(\overline{A})\subseteq \overline{f(A)}$ for every $A\subseteq X$ .

TheoremUniform Continuity (stronger notion)

$f$ is uniformly continuous if

6

\quad \forall\,\varepsilon>0\ \ \exists\,\delta>0\ \ \forall x,y\in X:\ d_X(x,y)<\delta \implies d_Y\big(f(x),f(y)\big)<\varepsilon

Derivation hint: The crucial change from [4] is that $\delta$ depends only on $\varepsilon$ , not on the point — the same $\delta$ works everywhere. A Lipschitz map (constant $L$ ) satisfies $d_Y(f(x),f(y))\le L\,d_X(x,y)$ and is automatically uniformly continuous. Implications: Lipschitz $\Rightarrow$ uniformly continuous $\Rightarrow$ continuous. None of the reverse implications hold in general.

Proof(

\varepsilon

–

\delta

)

\iff

(Open sets)

Step 1 — Continuity $\Rightarrow$ preimages of open sets are open. Assume $f$ continuous (per [4]) and let $U\subseteq Y$ be open. Take any $a\in f^{-1}(U)$ , so $f(a)\in U$ . Since $U$ is open, there is $\varepsilon>0$ with $B_Y(f(a),\varepsilon)\subseteq U$ .

Step 2. By continuity at $a$ , choose $\delta>0$ so that $f(B_X(a,\delta))\subseteq B_Y(f(a),\varepsilon)\subseteq U$ . Hence $B_X(a,\delta)\subseteq f^{-1}(U)$ .

Step 3. Every point of $f^{-1}(U)$ is interior, so $f^{-1}(U)$ is open.

Step 4 — Preimages of open sets open $\Rightarrow$ continuity. Fix $a\in X$ and $\varepsilon>0$ . The ball $U=B_Y(f(a),\varepsilon)$ is open, so by hypothesis $f^{-1}(U)$ is open and contains $a$ .

Step 5. Openness gives $\delta>0$ with $B_X(a,\delta)\subseteq f^{-1}(U)$ , i.e. $d_X(x,a)<\delta\Rightarrow f(x)\in B_Y(f(a),\varepsilon)\Rightarrow d_Y(f(x),f(a))<\varepsilon$ . This is exactly [4]. $\blacksquare$

∎

Proof(

\varepsilon

–

\delta

)

\iff

(Sequential)

Step 1 — $(\Rightarrow)$ . Assume $f$ continuous at $a$ and $x_n\to a$ . Given $\varepsilon>0$ , pick $\delta$ from [4]. Since $x_n\to a$ , there is $N$ with $d_X(x_n,a)<\delta$ for $n\ge N$ , whence $d_Y(f(x_n),f(a))<\varepsilon$ . Thus $f(x_n)\to f(a)$ .

Step 2 — $(\Leftarrow)$ , contrapositive. Suppose $f$ is not continuous at $a$ . Then there is $\varepsilon_0>0$ such that for every $\delta>0$ some $x$ with $d_X(x,a)<\delta$ has $d_Y(f(x),f(a))\ge\varepsilon_0$ .

Step 3. Take $\delta=1/n$ and choose $x_n$ with $d_X(x_n,a)<1/n$ but $d_Y(f(x_n),f(a))\ge\varepsilon_0$ .

Step 4. Then $x_n\to a$ yet $f(x_n)\not\to f(a)$ , contradicting the sequential hypothesis. Hence sequential continuity implies $\varepsilon$ – $\delta$ continuity. $\blacksquare$ (Note: this equivalence uses that metric spaces are first-countable; in general topological spaces sequential continuity is weaker.)

∎

🧠 Intuition

Picture an $\varepsilon$ -target circle around $f(a)$ in $Y$ . Continuity is a game: an adversary picks any $\varepsilon$ (how close you must land), and you must respond with a $\delta$ (a circle around $a$ ) so small that everything inside it lands inside the target. If you can always win, $f$ is continuous at $a$ .

Uniform continuity raises the stakes: you must produce a single $\delta$ that works at every point at once. Where the graph steepens without bound (like $1/x$ near $0$ ), you lose — no uniform $\delta$ survives.

Figure

The

\varepsilon

–

\delta

game: a

\delta

-ball maps into an

\varepsilon

-ball

mathematician · Maurice Fréchet | 1878–1973

Fréchet introduced abstract metric spaces in his 1906 doctoral thesis Sur quelques points du calcul fonctionnel, coining the term écart (deviation) for the distance and recognizing that continuity, completeness, and compactness could be studied axiomatically without reference to the real line. His framework unified the $\varepsilon$ – $\delta$ analysis of Cauchy and Weierstrass with the emerging functional analysis of spaces of functions, paving the way for Hausdorff's general topology (1914). Fréchet also pioneered the notion of compactness via sequential limits and the study of function spaces as metric spaces — directly enabling the modern theory of continuous maps.

ExampleVerifying continuity of

f(x)=x^2

at

a=3

Given: $f:\mathbb{R}\to\mathbb{R}$ , $f(x)=x^2$ , with $d(x,y)=|x-y|$ . Target tolerance $\varepsilon=0.01$ . Find a valid $\delta$ at $a=3$ .

Steps: 1. $|f(x)-f(3)| = |x^2-9| = |x-3|\,|x+3|$ . 2. Restrict $|x-3|<1$ so $2<x<4$ , giving $|x+3|<7$ . 3. Then $|x^2-9|<7|x-3|$ . To force this below $0.01$ , require $|x-3|<0.01/7\approx 0.001428$ . 4. Combine both: $\delta=\min\{1,\,0.01/7\}=0.001428\ldots$

7

\quad |x-3|<\delta \implies |x^2-9|<7|x-3|<7\delta=\varepsilon

Derivation hint: Bound the variable factor $|x+3|$ by a constant via a preliminary restriction, then choose $\delta$ as the minimum of the restriction radius and $\varepsilon/(\text{bound})$ .

Answer: $\boxed{\delta = 0.001428}$ (dimensionless) guarantees $|x^2-9|<0.01$ .

⚠️ Common mistake

"Continuous = uniformly continuous." False on non-compact domains. $1/x$ on $(0,1]$ and $x^2$ on $\mathbb{R}$ are continuous but not uniformly so. However, by the Heine–Cantor theorem, a continuous map on a compact metric space is automatically uniformly continuous.

" $\delta$ can always be chosen independent of the point." No — in [4] the $\delta$ legitimately depends on both $\varepsilon$ and $a$ . Independence from $a$ is precisely the extra demand of uniform continuity [6].

"Continuity preserves Cauchy sequences." Only uniform continuity guarantees that. $f(x)=1/x$ maps the Cauchy sequence $1/n$ to $n$ , which is not Cauchy.

"A continuous bijection is a homeomorphism." No — the inverse may fail to be continuous (see below). It is a homeomorphism only if both $f$ and $f^{-1}$ are continuous.

CounterexampleContinuous bijection whose inverse is discontinuous

Let $X=[0,2\pi)$ with the usual metric and $Y=S^1\subset\mathbb{R}^2$ the unit circle. Define

9

\quad f(t)=(\cos t,\ \sin t)

Derivation hint: This wraps the half-open interval once around the circle; it is a continuous bijection because each angle appears exactly once. $f$ is a continuous bijection. But $f^{-1}$ is discontinuous at $(1,0)=f(0)$ : points just below $2\pi$ map near $(1,0)$ from below, yet their preimages ( $\approx 2\pi$ ) are far from $0$ . Formally, the sequence $p_n=f(2\pi-\tfrac1n)\to (1,0)=f(0)$ , but $f^{-1}(p_n)=2\pi-\tfrac1n\to 2\pi\neq 0$ . So continuity of $f$ does not imply continuity of $f^{-1}$ .

CounterexampleContinuous image of a closed/bounded set need not be closed/bounded

Closedness fails: $f(x)=\arctan x$ maps the closed set $\mathbb{R}$ onto $(-\pi/2,\pi/2)$ , which is not closed.
Boundedness fails: $f(x)=1/x$ maps the bounded set $(0,1]$ onto the unbounded $[1,\infty)$ .

The remedy is compactness: continuous images of compact sets are compact (hence closed and bounded in $\mathbb{R}^n$ ) — this is the Extreme Value Theorem's engine.

connection

Continuity sits at the crossroads of analysis and topology.

Topological Spaces: The open-set characterization (item 3 of the theorem) defines continuity in general topology, with metrics dispensed entirely.
Compactness in Metric Spaces: Continuous images of compact sets are compact; continuity on a compact domain upgrades to uniform continuity (Heine–Cantor).
Connectedness: Continuous images of connected sets are connected — the abstract Intermediate Value Theorem.
Complete Metric Spaces: Lipschitz/contraction maps (special continuous maps) drive the Banach Fixed-Point Theorem.
<a class="wiki-link" href="/wiki/math-topgeo-homeomorphisms">Homeomorphisms</a>: A bicontinuous bijection; the equivalence relation of topology.
<a class="wiki-link" href="/wiki/math-analysis-uniform-convergence">Uniform Convergence</a>: A uniform limit of continuous functions is continuous, but a pointwise limit may not be.

🔬 Where this appears

⏳ History

- 1817 — Bolzano gives an early correct definition of continuity and proves the Intermediate Value Theorem, ahead of his time and largely unnoticed.

- 1821 — Cauchy publishes Cours d'analyse, defining continuity via infinitesimal increments — a major step toward rigor, though still verbally framed.

- 1854 — Riemann uses continuity carefully in the foundations of integration and function theory.

- 1861–1872 — Weierstrass formalizes the modern

\varepsilon

–

\delta

definition in his Berlin lectures and exhibits a continuous but nowhere-differentiable function, shattering naive intuition.

- 1872 — Heine introduces uniform continuity and proves (with Cantor's compactness ideas) that continuous functions on closed intervals are uniformly continuous (Heine–Cantor theorem).

- 1906 — Fréchet defines abstract metric spaces, recasting continuity, completeness, and compactness axiomatically.

- 1914 — Hausdorff develops general topology in Grundzüge der Mengenlehre, giving the open-set definition of continuity its definitive home.

- 1922 — Banach establishes the fixed-point theorem for contraction maps in complete metric spaces, a cornerstone of applied continuity.

open-problem

Beyond metric spaces. In general topological spaces, sequential continuity is strictly weaker than continuity (the equivalence relies on first-countability, which metric spaces always have). Characterizing which spaces are sequential (where sequences suffice) leads to the theory of Fréchet–Urysohn and sequential spaces.

Extension problems. Given $f$ uniformly continuous on a dense subset $D\subseteq X$ into a complete space $Y$ , it extends uniquely to all of $X$ — but mere continuity on $D$ does not. The precise interplay of density, completeness, and continuity is delicate.

Regularity of inverses. Determining when a continuous bijection is a homeomorphism is nontrivial in general; Invariance of Domain (Brouwer, 1912) shows a continuous injection $\mathbb{R}^n\to\mathbb{R}^n$ is open, but analogous statements fail across dimensions and in infinite dimensions, where compactness is scarce.

Modulus of continuity. Quantifying how continuous a map is (Hölder, Lipschitz, log-Lipschitz exponents) connects to active research in PDE regularity and geometric measure theory.

Formal Statement

Why It Holds / Derivation

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also