Contraction mappings sit at the point where [metric spaces](/page/Metric%20Space), [continuity](/page/Continuity), and iteration meet. A map may be continuous without making distances more predictable, and it may send a space into itself without moving points toward any stable location. A contraction mapping imposes a uniform shrinking rule: every pair of points becomes closer by a fixed factor strictly below $1$. That single inequality powers fixed point theorems, existence and uniqueness arguments for [ordinary differential equations](/page/Ordinary%20Differential%20Equation), iterative numerical schemes, and parts of [Banach space](/page/Banach%20Space) theory.

The guiding question is not just whether repeated application of a map converges. It is whether convergence is forced by geometry rather than by a special formula. If $f:X \to X$ is a contraction, then the orbit

\begin{align*} x_0,\ f(x_0),\ f(f(x_0)),\ \ldots \end{align*}

shrinks its successive errors at a geometric rate. The [Banach fixed point theorem](/theorems/270), often called the [contraction mapping principle](/page/Contraction%20Mapping%20Principle), turns this geometric control into an existence and uniqueness result once the ambient metric space is complete.

## Definition

A contraction is a strengthening of Lipschitz continuity. A Lipschitz map controls how much distances can expand; a contraction requires that all distances shrink by the same factor strictly less than $1$. The strict inequality is the feature that makes iteration effective.

[definition: Contraction Mapping] Let $(X,d)$ be a metric space. A function \begin{align*} f:X &\to X \end{align*} is a contraction mapping on $X$ if there exists a constant $c \in [0,1)$ such that \begin{align*} d(f(x),f(y)) \le c\,d(x,y) \end{align*} for all $x,y \in X$. [/definition]

The definition allows many possible constants, and in applications the choice of constant affects quantitative convergence estimates. To compare two contraction arguments, or to decide whether an estimate is strong enough for a fixed point theorem, it is useful to record the best global distance-expansion bound attached to the map.

[definition: Lipschitz Constant of a Self-Map] Let $(X,d)$ be a metric space and let $f:X \to X$ be a function. The Lipschitz constant of $f$ is \begin{align*} \operatorname{Lip}(f) := \inf\{L \ge 0 : d(f(x),f(y)) \le L\,d(x,y) \text{ for all } x,y \in X\}. \end{align*} [/definition]

With this notation, a self-map is a contraction precisely when its Lipschitz constant is strictly less than $1$. Once a map has this shrinking property, the next natural operation is to apply it repeatedly and watch whether the resulting sequence settles.

[definition: Iterates of a Self-Map] Let $X$ be a set and let $f:X \to X$ be a function. Define $f^{0}:X \to X$ by $f^0=\operatorname{id}_X$, and for each $n \in \mathbb{N}$ define \begin{align*} f^n := f \circ f^{n-1}. \end{align*} [/definition]

Here the superscript denotes repeated composition, not exponentiation of function values. Iteration raises the central question of what it would mean for the process to stop changing: a limiting endpoint should be a point left unchanged by one more application of the map.

[definition: Fixed Point] Let $X$ be a set and let $f:X \to X$ be a function. A point $x^* \in X$ is a fixed point of $f$ if \begin{align*} f(x^*)=x^*. \end{align*} [/definition]

The notation $x^*$ is common in fixed point theory and dynamical systems. It is not a dual-space symbol here; it labels a distinguished point stabilized by the map.

## Equivalent Characterisations

The contraction condition can be read as a geometric statement about diameters. Instead of testing pairs point by point, one can ask how the map changes the size of every subset.

[quotetheorem:8339]

The diameter formulation is useful when an argument tracks whole sets rather than individual pairs of points. For example, it says at once that the image of a ball, interval, or candidate set of iterates has controlled size. It is not a new fixed point principle, and it does not by itself give convergence; it is a repackaging of the same pairwise contraction estimate in language suited to set estimates. The quantification over every nonempty subset is what makes the formulation equivalent to the original definition rather than merely a one-directional consequence.

Limit arguments for iterates require more than diameter language; they require the map to respect convergence. Without continuity, even a convergent sequence of iterates might have an image sequence whose limit cannot be identified by applying the map to the limit. A global distance estimate removes this obstruction by forcing convergence to be preserved.

[quotetheorem:8340]