Английская Википедия:Banach fixed-point theorem

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach-Caccioppoli theorem) 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. It can be understood as an abstract formulation of Picard's method of successive approximations. The theorem is named after Stefan Banach (1892–1945) who first stated it in 1922.

Statement

Definition. Let <math>(X, d)</math> be a metric space. Then a map <math>T : X \to X</math> is called a contraction mapping on X if there exists <math>q \in [0, 1)</math> such that

<math>d(T(x),T(y)) \le q d(x,y)</math>

for all <math>x, y \in X.</math>

Banach fixed-point theorem. Let <math>(X, d)</math> be a non-empty complete metric space with a contraction mapping <math>T : X \to X.</math> Then T admits a unique fixed-point <math>x^*</math> in X (i.e. <math>T(x^*) = x^*</math>). Furthermore, <math>x^*</math> can be found as follows: start with an arbitrary element <math>x_0 \in X</math> and define a sequence <math>(x_n)_{n\in\mathbb N}</math> by <math>x_n = T(x_{n-1})</math> for <math>n \geq 1.</math> Then <math>\lim_{n \to \infty} x_n = x^*</math>.

Remark 1. The following inequalities are equivalent and describe the speed of convergence:

<math>

\begin{align} d(x^*, x_n) & \leq \frac{q^n}{1-q} d(x_1,x_0), \\ d(x^*, x_{n+1}) & \leq \frac{q}{1-q} d(x_{n+1},x_n), \\ d(x^*, x_{n+1}) & \leq q d(x^*,x_n). \end{align} </math>

Any such value of q is called a Lipschitz constant for <math>T</math>, and the smallest one is sometimes called "the best Lipschitz constant" of <math>T</math>.

Remark 2. <math>d(T(x),T(y))<d(x,y)</math> for all <math>x \neq y</math> is in general not enough to ensure the existence of a fixed point, as is shown by the map

<math>T : [1,\infty) \to [1,\infty), \,\, T(x)=x+\tfrac{1}{x}\,,</math>

which lacks a fixed point. However, if <math>X</math> 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 <math>d(x,T(x))</math>, indeed, a minimizer exists by compactness, and has to be a fixed point of <math>T.</math> It then easily follows that the fixed point is the limit of any sequence of iterations of <math>T.</math>

Remark 3. When using the theorem in practice, the most difficult part is typically to define <math>X</math> properly so that <math>T(X) \subseteq X.</math>

Proof

Let <math>x_0 \in X</math> be arbitrary and define a sequence <math>(x_n)_{n\in\mathbb N}</math> by setting <math>x_n = T(x_{n-1})</math>. We first note that for all <math>n \in \N,</math> we have the inequality

<math>d(x_{n+1}, x_n) \le q^n d(x_1, x_0).</math>

This follows by induction on n, using the fact that T is a contraction mapping. Then we can show that <math>(x_n)_{n\in\mathbb N}</math> is a Cauchy sequence. In particular, let <math>m, n \in \N</math> such that <math>m > n </math>:

<math>\begin{align}

d(x_m, x_n) & \leq d(x_m, x_{m-1}) + d(x_{m-1}, x_{m-2}) + \cdots + d(x_{n+1}, x_n) \\ & \leq q^{m-1}d(x_1, x_0) + q^{m-2}d(x_1, x_0) + \cdots + q^nd(x_1, x_0) \\ & = q^n d(x_1, x_0) \sum_{k=0}^{m-n-1} q^k \\ & \leq q^n d(x_1, x_0) \sum_{k=0}^\infty q^k \\ & = q^n d(x_1, x_0) \left ( \frac{1}{1-q} \right ). \end{align}</math>

Let ε > 0 be arbitrary. Since <math>q \in [0,1)</math>, we can find a large <math>N \in \N</math> so that

<math>q^N < \frac{\varepsilon(1-q)}{d(x_1, x_0)}.</math>

Therefore, by choosing <math>m</math> and <math>n</math> greater than <math>N</math> we may write:

<math>d(x_m, x_n) \leq q^n d(x_1, x_0) \left ( \frac{1}{1-q} \right ) < \left (\frac{\varepsilon(1-q)}{d(x_1, x_0)} \right ) d(x_1, x_0) \left ( \frac{1}{1-q} \right ) = \varepsilon.</math>

This proves that the sequence <math>(x_n)_{n\in\mathbb N}</math> is Cauchy. By completeness of (X,d), the sequence has a limit <math>x^* \in X.</math> Furthermore, <math>x^*</math> must be a fixed point of T:

<math>x^*=\lim_{n\to\infty} x_n = \lim_{n\to\infty} T(x_{n-1}) = T\left(\lim_{n\to\infty} x_{n-1} \right) = T(x^*). </math>

As a contraction mapping, T is continuous, so bringing the limit inside T was justified. Lastly, T cannot have more than one fixed point in (X,d), since any pair of distinct fixed points p₁ and p₂ would contradict the contraction of T:

<math> d(T(p_1),T(p_2)) = d(p_1,p_2) > q d(p_1, p_2).</math>

Applications

• A standard application is the proof of the Picard–Lindelöf theorem about the existence and uniqueness of solutions to certain ordinary differential equations. The sought solution of the differential equation is expressed as a fixed point of a suitable integral operator on the space of continuous functions under the uniform norm. The Banach fixed-point theorem is then used to show that this integral operator has a unique fixed point.
• One consequence of the Banach fixed-point theorem is that small Lipschitz perturbations of the identity are bi-lipschitz homeomorphisms. Let Ω be an open set of a Banach space E; let I : Ω → E denote the identity (inclusion) map and let g : Ω → E be a Lipschitz map of constant k < 1. Then

1. Ω′ := (I + g)(Ω) is an open subset of E: precisely, for any x in Ω such that B(x, r) ⊂ Ω one has B((I + g)(x), r(1 − k)) ⊂ Ω′;
2. I + g : Ω → Ω′ is a bi-lipschitz homeomorphism;

precisely, (I + g)⁻¹ is still of the form I + h : Ω → Ω′ with h a Lipschitz map of constant k/(1 − k). A direct consequence of this result yields the proof of the inverse function theorem.

• It can be used to give sufficient conditions under which Newton's method of successive approximations is guaranteed to work, and similarly for Chebyshev's third-order method.
• It can be used to prove existence and uniqueness of solutions to integral equations.
• It can be used to give a proof to the Nash embedding theorem.
• It can be used to prove existence and uniqueness of solutions to value iteration, policy iteration, and policy evaluation of reinforcement learning.
• It can be used to prove existence and uniqueness of an equilibrium in Cournot competition, and other dynamic economic models.

Converses

Several converses of the Banach contraction principle exist. The following is due to Czesław Bessaga, from 1959:

Let f : X → X be a map of an abstract set such that each iterate fⁿ has a unique fixed point. Let <math>q \in (0, 1),</math> then there exists a complete metric on X such that f is contractive, and q is the contraction constant.

Indeed, very weak assumptions suffice to obtain such a kind of converse. For example if <math>f : X \to X</math> is a map on a T₁ topological space with a unique fixed point a, such that for each <math>x \in X</math> we have fⁿ(x) → 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 1/2. In this case the metric is in fact an ultrametric.

Generalizations

There are a number of generalizations (some of which are immediate corollaries).

Let T : X → X be a map on a complete non-empty metric space. Then, for example, some generalizations of the Banach fixed-point theorem are:

• Assume that some iterate Tⁿ of T is a contraction. Then T has a unique fixed point.
• Assume that for each n, there exist c_n such that d(Tⁿ(x), Tⁿ(y)) ≤ c_nd(x, y) for all x and y, and that

<math>\sum\nolimits_n c_n <\infty.</math>

Then T has a unique fixed point.

In applications, the existence and uniqueness of a fixed point often 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. Some of these have applications, e.g., in the theory of programming semantics in theoretical computer science.

See also

• Brouwer fixed-point theorem
• Caristi fixed-point theorem
• Contraction mapping
• Fichera's existence principle
• Fixed-point iteration
• Fixed-point theorems
• Infinite compositions of analytic functions
• Kantorovich theorem

References

• Шаблон:Cite book
• Шаблон:Cite book
• Шаблон:Cite book
• Шаблон:Cite book See chapter 7.
• Шаблон:Cite book