Template:Short description In mathematics, a contraction mapping, or contraction or contractor, on a metric space (M, d) is a function f from M to itself, with the property that there is some real number <math>0 \leq k < 1</math> such that for all x and y in M,
- <math>d(f(x),f(y)) \leq k\,d(x,y).</math>
The smallest such value of k is called the Lipschitz constant of f. Contractive maps are sometimes called Lipschitzian maps. If the above condition is instead satisfied for k ≤ 1, then the mapping is said to be a non-expansive map.
More generally, the idea of a contractive mapping can be defined for maps between metric spaces. Thus, if (M, d) and (N, d') are two metric spaces, then <math>f:M \rightarrow N</math> is a contractive mapping if there is a constant <math>0 \leq k < 1</math> such that
- <math>d'(f(x),f(y)) \leq k\,d(x,y)</math>
for all x and y in M.
Every contraction mapping is Lipschitz continuous and hence uniformly continuous (for a Lipschitz continuous function, the constant k is no longer necessarily less than 1).
A contraction mapping has at most one fixed point. Moreover, the Banach fixed-point theorem states that every contraction mapping on a non-empty complete metric space has a unique fixed point, and that for any x in M the iterated function sequence x, f (x), f (f (x)), f (f (f (x))), ... converges to the fixed point. This concept is very useful for iterated function systems where contraction mappings are often used. Banach's fixed-point theorem is also applied in proving the existence of solutions of ordinary differential equations, and is used in one proof of the inverse function theorem.<ref name="shifrin">Template:Cite book</ref>
Contraction mappings play an important role in dynamic programming problems.<ref>Template:Cite journal</ref><ref>Template:Cite book</ref>
Firmly non-expansive mappingEdit
A non-expansive mapping with <math>k=1</math> can be generalized to a firmly non-expansive mapping in a Hilbert space <math>\mathcal{H}</math> if the following holds for all x and y in <math>\mathcal{H}</math>:
- <math>\|f(x)-f(y) \|^2 \leq \, \langle x-y, f(x) - f(y) \rangle.</math>
where
- <math>d(x,y) = \|x-y\|</math>.
This is a special case of <math>\alpha</math> averaged nonexpansive operators with <math>\alpha = 1/2</math>.<ref>Template:Cite journal</ref> A firmly non-expansive mapping is always non-expansive, via the Cauchy–Schwarz inequality.
The class of firmly non-expansive maps is closed under convex combinations, but not compositions.<ref name=":0">Template:Cite book</ref> This class includes proximal mappings of proper, convex, lower-semicontinuous functions, hence it also includes orthogonal projections onto non-empty closed convex sets. The class of firmly nonexpansive operators is equal to the set of resolvents of maximally monotone operators.<ref>Template:Cite journal</ref> Surprisingly, while iterating non-expansive maps has no guarantee to find a fixed point (e.g. multiplication by -1), firm non-expansiveness is sufficient to guarantee global convergence to a fixed point, provided a fixed point exists. More precisely, if <math>\operatorname{Fix}f := \{x \in \mathcal{H} \ | \ f(x) = x\} \neq \varnothing</math>, then for any initial point <math>x_0 \in \mathcal{H}</math>, iterating
<math> (\forall n \in \mathbb{N})\quad x_{n+1} = f(x_n) </math>
yields convergence to a fixed point <math> x_n \to z \in \operatorname{Fix} f</math>. This convergence might be weak in an infinite-dimensional setting.<ref name=":0" />
Subcontraction mapEdit
A subcontraction map or subcontractor is a map f on a metric space (M, d) such that
- <math> d(f(x), f(y)) \leq d(x,y);</math>
- <math> d(f(f(x)),f(x)) < d(f(x),x) \quad \text{unless} \quad x = f(x).</math>
If the image of a subcontractor f is compact, then f has a fixed point.<ref name=Gold17>Template:Cite book</ref>
Locally convex spacesEdit
In a locally convex space (E, P) with topology given by a set P of seminorms, one can define for any p ∈ P a p-contraction as a map f such that there is some kp < 1 such that Template:Nowrap ≤ Template:Nowrap. If f is a p-contraction for all p ∈ P and (E, P) is sequentially complete, then f has a fixed point, given as limit of any sequence xn+1 = f(xn), and if (E, P) is Hausdorff, then the fixed point is unique.<ref>Template:Cite journal</ref>
See alsoEdit
- Short map
- Contraction (operator theory)
- Transformation
- Comparametric equation
- Blackwell's contraction mapping theorem
- CLRg property
ReferencesEdit
Further readingEdit
- Template:Cite book provides an undergraduate level introduction.
- Template:Cite book
- Template:Cite book
- Template:Cite book