Continuity is a local condition: it asks that $f(x)$ be close to $f(a)$ whenever $x$ is close to $a$, but the meaning of "close" --- the size of $\delta$ --- is permitted to depend on the point $a$. For many purposes in analysis, this freedom is harmless. But for others --- extending a function from a dense subset, controlling the oscillation of a function over a partition, or preserving the Cauchy property of sequences --- the dependence of $\delta$ on the point is a fatal obstruction.

The difficulty is best seen through a concrete computation.

[example: The Failure of a Uniform Bound] Consider the function $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = x^2$. This function is [continuous](/page/Continuity) at every point $a \in \mathbb{R}$: given $\varepsilon > 0$, the estimate \begin{align*} |f(x) - f(a)| = |x^2 - a^2| = |x - a| \cdot |x + a| \leq |x - a| \cdot (2|a| + 1) \end{align*} (valid whenever $|x - a| \leq 1$) shows that $\delta = \min\{1, \varepsilon/(2|a| + 1)\}$ works at the point $a$. But this $\delta$ depends on $a$ and shrinks to $0$ as $|a| \to \infty$. No single $\delta$ can work simultaneously at all points. To see this rigorously, define sequences $x_n = n + \frac{1}{2n}$ and $y_n = n$ for $n \in \mathbb{N}$. Then \begin{align*} |x_n - y_n| = \frac{1}{2n} \to 0, \quad \text{yet} \quad |f(x_n) - f(y_n)| = \left|n + \frac{1}{2n}\right|^2 - n^2 = 1 + \frac{1}{4n^2} > 1. \end{align*} For any candidate "uniform" $\delta > 0$ and any $\varepsilon \leq 1$, the pair $(x_n, y_n)$ with $n > 1/(2\delta)$ satisfies $|x_n - y_n| < \delta$ but $|f(x_n) - f(y_n)| > 1 \geq \varepsilon$. The function $f$ is continuous everywhere, yet no uniform modulus of closeness can be specified. [/example]

The issue in this example is not a defect of $f$ at any particular point --- continuity holds at every $a \in \mathbb{R}$. The issue is *global*: the rate at which $f$ distorts distances varies without bound across the domain. **Uniform continuity** is the condition that eliminates this phenomenon. It asks for a single $\delta$ that works at all points simultaneously, turning the local guarantee of continuity into a global one.

This upgrade from local to global is not merely cosmetic. Uniform continuity is the precise condition under which:

- A [continuous function](/page/Continuity%20(Real%20Analysis)) on a closed bounded interval is [Riemann integrable](/page/Integral) (because uniform continuity controls the oscillation over partition subintervals). - A continuous function defined on a [dense subset](/page/Dense%20Subset) extends uniquely to the ambient [complete metric space](/page/Complete%20Metric%20Space) (because uniform continuity ensures that Cauchy sequences in the domain map to Cauchy sequences in the codomain). - The [completion](/page/Complete%20Metric%20Space) construction works: algebraic operations like addition and scalar multiplication extend from a normed space to its completion precisely because they are uniformly continuous.

The [Heine-Cantor theorem](/page/Compact%20Space) reveals that this distinction between continuity and uniform continuity is invisible on [compact](/page/Compact%20Space) domains --- there, every continuous function is automatically uniformly continuous. It is on non-compact domains that the two notions diverge, and where the analyst must pay careful attention.

## Definition

The definition of uniform continuity differs from ordinary continuity by a single quantifier swap, but the consequences of that swap are far-reaching.

[definition: Uniform Continuity] Let $(X, d_X)$ and $(Y, d_Y)$ be [metric spaces](/page/Metric%20Space). A function $f: X \to Y$ is **uniformly continuous** if for every $\varepsilon > 0$ there exists $\delta > 0$ such that \begin{align*} d_X(x, y) < \delta \implies d_Y(f(x), f(y)) < \varepsilon \quad \text{for all } x, y \in X. \end{align*} [/definition]

The critical distinction from [pointwise continuity](/page/Continuity%20(Metric%20Spaces)) lies in the quantifier order. Continuity at a point $a$ reads:

\begin{align*} \forall \varepsilon > 0 \;\; \exists \delta > 0 \;\; \forall x \in X: \quad d_X(x, a) < \delta \implies d_Y(f(x), f(a)) < \varepsilon. \end{align*}

Continuity on $X$ universally quantifies over $a$, placing $\forall a \in X$ at the front but *before* the $\exists \delta$:

\begin{align*} \forall a \in X \;\; \forall \varepsilon > 0 \;\; \exists \delta > 0 \;\; \forall x \in X: \quad d_X(x, a) < \delta \implies d_Y(f(x), f(a)) < \varepsilon. \end{align*}

Uniform continuity moves the universal quantifier $\forall x, y$ to the *outside* of the existential $\exists \delta$:

\begin{align*} \forall \varepsilon > 0 \;\; \exists \delta > 0 \;\; \forall x, y \in X: \quad d_X(x, y) < \delta \implies d_Y(f(x), f(y)) < \varepsilon. \end{align*}

In the first formulation, $\delta$ may depend on both $\varepsilon$ and the point $a$. In the second, $\delta$ depends on $\varepsilon$ alone. This is a strictly stronger condition: every uniformly continuous function is continuous, but the opening example shows that the converse fails.

[remark: Negation of Uniform Continuity] A function $f: (X, d_X) \to (Y, d_Y)$ is **not** uniformly continuous if and only if there exist $\varepsilon_0 > 0$ and sequences $(x_n)_{n=1}^\infty$, $(y_n)_{n=1}^\infty$ in $X$ with $d_X(x_n, y_n) \to 0$ but $d_Y(f(x_n), f(y_n)) \geq \varepsilon_0$ for all $n \in \mathbb{N}$. This sequential characterisation of the failure of uniform continuity is often the most efficient way to prove that a given function is not uniformly continuous: produce a pair of sequences that get closer together while their images stay apart. [/remark]

## The Modulus of Continuity

To study uniform continuity quantitatively --- not just as a yes-or-no property, but as a matter of *degree* --- we need a tool that measures the worst-case oscillation of $f$ over pairs of points at a given distance. This leads to the modulus of continuity, which encodes the "rate" at which uniform continuity holds.