(mathematics) A theorem stating that if a mapping ƒ of a metric space E into itself is a contraction, then there exists a unique element x of E such that ƒx = x. Also known as Caccioppoli-Banach principle.
In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contraction mapping principle) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces, and provides a constructive method to find those fixed points. The theorem is named after Stefan Banach (1892–1945), and was first stated by him in 1922.[1]
|
Contents
|
Let (X, d) be a non-empty complete metric space. Let T : X → X be a contraction mapping on X, i.e.: there is a nonnegative real number q < 1 such that

for all x, y in X. Then the map T admits one and only one fixed-point x* in X (this means T(x*) = x*). Furthermore, this fixed point can be found as follows: start with an arbitrary element x0 in X and define an iterative sequence by xn = T(xn−1) for n = 1, 2, 3, ... This sequence converges, and its limit is x*. The following inequality describes the speed of convergence:

Equivalently,

and

Any such value of q is called a Lipschitz constant for T, and the smallest one is sometimes called "the best Lipschitz constant" of T.
Note that the requirement d(T(x), T(y)) < d(x, y) for all unequal x and y is in general not enough to ensure the existence of a fixed point, as is shown by the map T : [1,∞) → [1,∞) with T(x) = x + 1/x, which lacks a fixed point. However, if the metric space X is compact, then this weaker assumption does imply the existence and uniqueness of a fixed point, that can be easily found as a minimizer of d(x, T(x)) : indeed, a minimizer exists by compactness, and has to be a fixed point of T. It then easily follows that the fixed point is the limit of any sequence of iterations of T.
When using the theorem in practice, the most difficult part is typically to define X properly so that T actually maps elements from X to X, i.e. that T(x) is always an element of X.
Choose any
. For each
, define
. We claim that for all
, the following is true:

To show this, we will proceed using induction. The above statement is true for the case
, for

Suppose the above statement holds for some
. Then we have
![\begin{align}
d(x_{(k + 1) + 1}, x_{k + 1}) & = d(x_{k + 2}, x_{k + 1}) \\[6pt]
& = d(T(x_{k + 1}), T(x_k)) \\[6pt]
& \leq q d(x_{k + 1}, x_k) \\[6pt]
& \leq q \cdot q^kd(x_1, x_0) \\[6pt]
& = q^{k + 1}d(x_1, x_0).
\end{align}](http://wpcontent.answcdn.com/wikipedia/en/math/1/e/6/1e6dfe561e57b1e3e577b39731579421.png)
The inductive assumption is used going from line three to line four. By the principle of mathematical induction, for all
, the above claim is true.
Let
. Since
, we can find a large
so that

Using the claim above, we have that for any
,
with
,
![\begin{align}
d\left(x_m, x_n\right) & \leq d(x_m, x_{m-1}) + d(x_{m-1}, x_{m-2}) + \cdots + d(x_{n+1}, x_n) \\[6pt]
& \leq q^{m-1}d(x_1, x_0) + q^{m-2}d(x_1, x_0) + \cdots + q^nd(x_1, x_0) \\[6pt]
& = d(x_1, x_0)q^n \cdot \sum_{k=0}^{m-n-1} q^k \\[6pt]
& < d(x_1, x_0)q^n \cdot \sum_{k=0}^\infty q^k \\[6pt]
& = d(x_1, x_0)q^n \frac{1}{1-q} \\[6pt]
& = q^n \frac{d(x_1, x_0)}{1-q} \\[6pt]
& < \frac{\epsilon(1-q)}{d(x_1, x_0)}\cdot\frac{d(x_1, x_0)}{1-q} \\[6pt]
& = \epsilon.
\end{align}](http://wpcontent.answcdn.com/wikipedia/en/math/1/f/e/1fec2545a7ee9b9013371419d1fbe574.png)
The inequality in line one follows from repeated applications of the triangle inequality; the series in line four is a geometric series with
and hence it converges. The above shows that
is a Cauchy sequence in
and hence convergent by completeness. So let
. We make two claims: (1)
is a fixed point of
. That is,
; (2)
is the only fixed point of
in
.
To see (1), we take the limit of both sides of the recurrence
,

Since T is a contraction mapping, it is continuous, so we may take the limit inside:
. Thus,
.
To show (2), we suppose that
also satisfies
. Then

Remembering that
, the above implies that
, which shows that
, whence by positive definiteness,
and the proof is complete.
The above is essentially Banach's original proof. What follows is a considerably simpler proof that appeared recently in the Journal of Fixed Point Theory and its Application (see reference).
By the triangle inequality, for any x and y , in X,

so subtracting the middle term on the right from both sides and dividing by the positive quantity (1-q) we get the ``Fundamental Contraction Inequality":

and we note that if x and y are both fixed points then this implies that d(x,y) = 0, so x =y, proving that
has at most one fixed point. Now define the mapping
by composing
with itself n times and note by induction that it satisfies a Lipschitz condition with constant
. It remains to show that for any
, the sequence
is Cauchy and so converges to a point
of X, which as noted above is clearly a fixed point of
. If in the Fundamental Inequality we replace x and y by
and
, we find that

or

and since q<1 , the right hand side of this latter inequality converges to zero as n and m tend to infinity, proving that
is Cauchy. Note also that letting m tend to infinity in the latter inequality gives the inequality
derived in the first proof that gives the rate at which
converges to
.
be an open set of a Banach space
; let
denote the identity (inclusion) map and let
be a Lipschitz map of constant k<1. Then (i)
is an open subset of
:precisely, for any
such that
one has
; (ii) 
is a bi-lipschitz homeomorphism; precisely,
is still of the form
,with
a Lipschitz map of constant 
A direct consequence of this result yields the proof of the inverse function theorem.
Several converses of the Banach contraction principle exist. The following is due to Czesław Bessaga, from 1959:
Let
be a map of an abstract set such that each iterate ƒn has a unique fixed point. Let q be a real number, 0 < q < 1. Then there exists a complete metric on X such that ƒ is contractive, and q is the contraction constant.
Indeed, very weak assumptions suffice to obtain such a kind of converse. E.g.[2] if
is a map on a T1 topological space (i.e., a T1 space) with a unique fixed point a, such that for each
we have that ƒn(x) converges to a, then there already exists a metric on X with respect to which f satisfies the conditions of the Banach contraction principle with contraction constant
. In this case the metric is in fact an ultrametric.
There are a number of generalizations as immediate corollaries, which are of some interest for the sake of applications. Let
be a map on a complete non-empty metric space.
of T is a contraction. Then T has a unique fixed point.
and
in
,
Then T has a unique fixed point.However, in most applications the existence and unicity of a fixed point can be shown directly with the standard Banach fixed point theorem, by a suitable choice of the metric that makes the map T a contraction. Indeed, the above result by Bessaga strongly suggests to look for such a metric. See also the article on fixed point theorems in infinite-dimensional spaces for generalizations.
A different class of generalizations arise from suitable generalizations of the notion of metric space, e.g. by weakening the defining axioms for the notion of metric.[3] Some of these have applications, e.g., in the theory of programming semantics in theoretical computer science.[4]
An earlier version of this article was posted on Planet Math. This article is open content.
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)