Banach fixed-point theorem: Difference between revisions

Content deleted Content added
No edit summary
links, wikified, corrected statement
Line 1:
The '''Banach fixed point theorem''' is an important tool in the theory of [[metric space]]s; 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.
Let F be a non-empty closed subset of a complete metric space (X, d). Let T : X -> X be a contraction operator on F, , i.e: There is a constant q ε (0, 1) such that
 
Let F(''X'', d) be a non-empty closed subset of a [[completeness|complete]] metric space (X, d). Let ''T'' : ''X'' <tt>-></tt> ''X'' be a ''contraction operator'' on F, ''X'', i.e: Therethere is a constant[[real number]] ''q'' &epsilon; (0,< 1) such that
<center>d(Tx, Ty) <u>&lt;</u> q &bull; d(x, y)</center>
: d(''Tx'', ''Ty'') &le; ''q'' &middot; d(''x'', ''y'')
 
for all ''x'', ''y'' in ''X''. Then the map ''T'' admits one and only one fixed point ''x''<sup>*</sup> in ''X'' (this means ''Tx''<sup>*</sup> = ''x''<sup>*</sup>). Furthermore, this fixed point can be found as follows: start with an arbitrary element ''x''<sub>0</sub> in ''X'' and define a sequence by ''x''<sub>''n''</sub> = ''Tx''<sub>''n''-1</sub> for ''n'' = 1, 2, 3, ... This sequence [[mathematical limit|converges]], and its limit is ''x''<sup>*</sup>. The following inequality describes the speed of convergence:
for all x, y &epsilon; X. Then:
 
1. For any x<sub>0</sub> &epsilon; F rhe sequence defined by x<sub>n+1</sub> = Tx<sub>n</sub>, n &epsilon; {1, 2, 3, ...} remains within F
 
2. There exists an x* &epsilon; F such that:
 
lim<sub>n -> INFTY</sub> x<sub>n</sub> = x*
 
3. x* is a fixed point of T i.e. Tx* = x*
 
4. x* is the only fixed point of T in F
 
5.
 
q<sup>n</sup>
d(x*, x<sub>n</sub>) <u>&ltle;</u> ----- d(x<sub>1</sub>,x<sub>0</sub>)
1-q
 
----
An earlier version of this article was posted on [http://planetmath.org/encyclopedia/BanachFixedPointTheorem.html Planet Math]. This article is [[open content]]