Distances are useful only when they survive being passed through functions. Continuity says that nearby inputs have nearby outputs, but it does not say how fast errors can grow. A Lipschitz function is the version of continuity that comes with a linear error budget: if the input changes by at most $\delta$, the output changes by at most $L\delta$. That single constant is what makes estimates portable across fixed point arguments, differential equations, [approximation theory](/page/Approximation%20Theory), metric geometry, and [numerical analysis](/page/Numerical%20Analysis).

The need for such a linear budget appears as soon as continuity is used quantitatively. A [continuous function](/page/Continuous%20Function) may preserve closeness at every point while still allowing tiny input errors to be amplified at a rate that depends on where the error occurs. Lipschitz control rules out that moving target. It replaces many local choices of $\delta$ by one global slope bound, so the same estimate can be reused throughout a computation.

[example: A Continuous Function with No Linear Error Budget] Consider $f:[0,1]\to \mathbb{R}$ defined by $f(x)=\sqrt{x}$. This function is continuous on $[0,1]$, but it has no global linear error budget. To see this, suppose for contradiction that there is a real number $L\ge 0$ such that \begin{align*} |\sqrt{x}-\sqrt{y}|\le L|x-y| \end{align*} for every $x,y\in[0,1]$. For any $t$ with $0<t\le 1$, the points $t^2$ and $0$ both lie in $[0,1]$. Substituting $x=t^2$ and $y=0$ into the Lipschitz estimate gives \begin{align*} |\sqrt{t^2}-\sqrt{0}|\le L|t^2-0|. \end{align*} Since $t>0$, we have $\sqrt{t^2}=t$ and $\sqrt{0}=0$, so the left-hand side is $|t-0|=t$. The right-hand side is $L|t^2|=Lt^2$, because $t^2>0$. Hence \begin{align*} t\le Lt^2. \end{align*} Dividing by the positive number $t$ gives \begin{align*} 1\le Lt. \end{align*} Now choose $t$ with $0<t<1/L$ if $L>0$; then $Lt<1$, contradicting $1\le Lt$. If $L=0$, the inequality $1\le Lt$ reads $1\le 0$, also impossible. Therefore no such Lipschitz constant exists. The failure is concentrated at the origin: continuity still holds there, but the ratio $|\sqrt{x}-\sqrt{0}|/|x-0|=1/\sqrt{x}$ becomes unbounded as $x$ approaches $0$ from the right. [/example]

This example explains why the word "uniform" is still not strong enough for many estimates. The square-root function is uniformly continuous on $[0,1]$, so every desired output tolerance can be protected by some input tolerance. Lipschitz continuity demands more: the same proportional rule must work at every scale.

## Definition

The most common analytic setting is a function defined on a set sitting inside a [normed vector space](/page/Normed%20Vector%20Space). Here distance is measured by the ambient norm, and the Lipschitz condition says that the output displacement is bounded by a fixed multiple of the input displacement. This formulation includes functions on intervals, domains in Euclidean space, and subsets of Banach spaces, which is the form used most often in real analysis, functional analysis, and differential equations.

[definition: Lipschitz Function] Let $(V,\|\cdot\|_V)$ and $(W,\|\cdot\|_W)$ be normed vector spaces, let $E\subset V$, and let $f:E\to W$ be a function. For a real number $L\ge 0$, the function $f$ is $L$-Lipschitz if for every $x,y\in E$, \begin{align*} \|f(x)-f(y)\|_W\le L\,\|x-y\|_V. \end{align*} The function $f$ is Lipschitz if there exists a real number $L\ge 0$ such that $f$ is $L$-Lipschitz. [/definition]

The definition above still remembers the ambient vector spaces, even when no addition or scalar multiplication is being used. Distance functions, fixed point arguments, and geometric maps often live in spaces where distances exist but vectors do not. To use the same error budget in that setting, we isolate the purely metric form.

[definition: Lipschitz Function Between Metric Spaces] Let $(X,d_X)$ and $(Y,d_Y)$ be metric spaces, and let $f:X\to Y$ be a function. For a real number $L\ge 0$, the function $f$ is $L$-Lipschitz between metric spaces if for every $x,y\in X$, \begin{align*} d_Y(f(x),f(y))\le L\,d_X(x,y). \end{align*} The function $f$ is Lipschitz between metric spaces if there exists a real number $L\ge 0$ such that this estimate holds. [/definition]

The number $L$ is not part of the function; it is a certificate for the estimate. If one value works, every larger value works as well. To compare two Lipschitz estimates, or to put Lipschitz functions into a function space, we need a canonical way to record the smallest expansion rate rather than an arbitrary certificate.

[definition: Lipschitz Seminorm] Let $(X,d_X)$ be a [metric space](/page/Metric%20Space), and let $(Y,\|\cdot\|_Y)$ be a normed [vector space](/page/Vector%20Space). The Lipschitz seminorm is the extended-valued map \begin{align*} [\cdot]_{\mathrm{Lip}(X;Y)}: \{f:X\to Y\}\to [0,\infty]. \end{align*} It is defined by \begin{align*} [f]_{\mathrm{Lip}(X;Y)}=\sup_{x,y\in X,\ x\ne y}\frac{\|f(x)-f(y)\|_Y}{d_X(x,y)}. \end{align*} If there are no distinct points $x,y\in X$, this supremum is defined to be $0$. [/definition]

After this definition, the phrase "$f$ is Lipschitz" is exactly the assertion that $[f]_{\mathrm{Lip}(X;Y)}<\infty$. This quantity is also called the best Lipschitz constant of $f$ and is often denoted $\operatorname{Lip}(f)$ when the domain and codomain are understood. The word "seminorm" is deliberate: adding a constant vector to $f$ does not change differences, so the seminorm vanishes on constant functions.

The first structural consequence is that Lipschitz continuity automatically gives [uniform continuity](/page/Uniform%20Continuity). This is the theorem that turns a slope bound into the epsilon-delta language of elementary analysis.

[quotetheorem:1097]

The converse fails, and the square-root example above is the standard warning. Uniform continuity controls error by an arbitrary modulus; Lipschitz continuity asks that this modulus be bounded above by a straight line through the origin.

## Constants, Slopes, and Elementary Sources

### Derivative Bounds

On intervals in $\mathbb{R}$, Lipschitz estimates are often found by bounding derivatives. This is not just a computational trick: it is the bridge between a local infinitesimal slope and a global finite-distance estimate.

[quotetheorem:328]

The theorem gives a fast way to recognise good error budgets. It also makes the failure of $\sqrt{x}$ transparent: on $(0,1]$ its derivative is