Applicant Application
Uploaded by
ScribdTranslationsApplicant Application
Uploaded by
ScribdTranslationsContracting application
1,2 3
Inmathematicsand more particularly inanalyze, a contracting application a contraction, is aapplicationwho "brings closer theimagesor,
more precisely, aapplicationkLipschitzianaveck< 1. Thefixed point theoremthe simplest and most commonly used concerns contracting applications.
Definition and examples
Oneapplicationsomemetric space(E,d) in itself is a metric contraction if 0 ≤ k < 1 and if, for every pair of points x and y in E, d(f(x),f(y)) ≤ k d(x,y).
It is said to be contracting if it is k-contracting for a certain constant k.
Aendomorphismnormed vector spacefrom thenormis strictly less than 1 (or aaffine applicationassociated with such an endomorphism) is a
contracting application. The simplest example is that of ahomothetythe report λ with |λ| < 1.
More generally, theinequality of finite incrementsallows to show that a differentiable function with bounded derivative in norm less than 1 is contracting; it is by
example the case on the application , aveck= 2/3.
Fixed point theorem for a contracting application
Theorem— Let E bemetric spacecomplete(non vide) applicationk-contractante deEdansE. There is afixed pointuniquex*de
f(that is to say unx* in Etel such that f(x*) = x*). Moreover, anysequence of elements ofEchecking the recurrence
check the increase
soconverge towardsx* .
1,3,4
The classical proof essentially consists of showing that for any sequence satisfying , on a .
5
Variant
Fundamental inequality of contractions
For everything and everyone in E,
Indeed, by the triangle inequality,
Uniqueness
Immediate according to the fundamental inequality.
Existence
The fundamental inequality also leads to
We deduce, as in the 'classic proof', the convergence of the sequence and the upper bound of the error, and the end of the proof of existence is
identical.
6
This theorem is often referred to as the fixed point theorem ofBanach— who stated it in 1920 as part of the resolution ofintegral equations
1
or the fixed point theorem ofPicard.
Corollary for an application where an iteration is contractive
7 8
Thecorollarynext is used in some proofs of theCauchy-Lipschitz theorem which dispenses fromprecautions of usual evidence intended to
to place in a situation where the contracting application occurs.
9,10,11,12,13
Corollary Let E be a complete (non-empty) metric space and let f be a (not necessarily continuous) mapping from E to E.
q
oneiteratedcontracting party (it is said that fest to the power of q-th contracting). Then f has a unique fixed point x* and any sequence of elements of
Verifying the recurrence x = f(x) converges towards x*.
n+1
Remark
As in the theorem, the convergence of the sequence is at leastgeometric(of reasons)f 1/q q
Successive approximations
14
These results provide an algorithm for calculating the fixed point (this is the 'method of successive approximations'). ) unlike other point theorems
We only have fixes that guarantee the existence of fixed points without indicating how to determine them. Moreover, the statement provides an upper bound on the error.
We note that in the main theorem, if we denote the Lipschitz constant def, we have a majorization. n This majorization is often n very...
n
[reference needed]
which explains why the previous increase ded(x,x*) is often
bad n pessimistic. By making a slightly stronger hypothesis than
that of the above corollary, but not as much as that of the theorem, we can arrive at better upper bounds (for example in the case of solving the
n
differential equations): if, for every integer n, the application is f-Lipschitzian and if theseriesof the general termconvergentwhichnallows to apply
translatedText
the corollary since k < 1qfor large enough — then, noting as previously x* the fixed point indeed x = f(x) (for an arbitrary point
n x in E),
0 0
Demonstration
4
By the same arguments as at the beginning of the 'classic proof',
hence the announced increase, as it approaches the limit when tending towards infinity.
Classic applications
Resolution of numerical equations, see in particularNewton's method
Approximate resolution oflinear systemsper iteration
Resolution ofdifferential equations: Cauchy-Lipschitz theorem
Implicit Function Theorem
Application to the definition of the attractor of aiterated function system
Notes and references
1.Jean-Pierre BourguignonVariational Calculus, Palaiseau, Editions 7.Philippe G. CiarletLinear and Nonlinear Functional Analysis
from the École Polytechnique, 2008, 328 p.ISBN978-2-7302-1415-5, with Applications,SIAM2013 (read online (https://books.google.co
BNF41120749 (https://catalogue.bnf.fr/ark:/12148/cb41120749g.public) m/books?id=AUlWAQAAQBAJ&pg=PA157)), p. 157.
, online presentation (https://books.google.com/books?id=NOJEb 8.A. N. KolmogorovandS. V. FominElements
BvTAYcC&pg=PA7)), p. 7 and 27-28. of the Theory of Functions and Functional Analysis, vol. 1, Dover
2.Jean-Pierre DemaillyNumerical analysis and equations Publications, 1999 (1reed. 1957) (read online (https://books.google.
differentialsdetails of the editions], p. 93, overview(https://books.googl com/books?id=OyWeDwfQmeQC&pg=PA46)), p. 46-49 (translated from
e.com/books?id=KwRJ5Vc5O-8C&pg=PA93) onGoogle Books. the Russian edition of 1954.
3. Alain Yger and Jacques-Arthur Weil, Applied Mathematics L3: 9. For a demonstration, see for examplethis corrected exerciseon
Complete course with 500 tests and corrected exercises, Paris, Pearson. Wikiversity.
2009, 890 p.ISBN978-2-7440-7352-6, 10. E. Ramis, C. Deschamps and J. Odoux, Course in Mathematics
BNF42034458 special, vol. 3 : Topology and elements of analysisMasson, 1976
online presentation (https://books.google.com/books?id=fqOu6xK) p. 64, Theorem.
dmhcC&pg=PA141)), p. 141. 11. Ciarlet 2013, p. 154, Problem 3.7-2.
4. A detailed demonstration is included in the properties of a space.
12.D. R. Smart, Fixed Point TheoremsCUP, coll. "Cambridge
complete on Wikiversity.
Tracts in Mathematics » (no66), 1980 (1reed. 1974), 100 p.
Richard S. PalaisA simple proof of the Banach contraction (ISBN978-0-521-29833-9online presentation (https://books.goog
principle », Journal of Fixed Point Theory and Applications, vol. 2, le.com/books?id=y5g4AAAAIAAJ&pg=PA38)), p. 38, Theorem
2007, p. 221-223 (read online (http://vmm.math.uci.edu/PalaisPaper 5.2.1.
s/BanachContractionPrinciple.pdf)). 13. Kolmogorov and Fomin 1999, p. 50-51, present this theorem and
6. S. Banach, "On operations in abstract sets and their applies to theintegral equationofVolterraSee also the version
application to integral equationsFundamentals of Mathematics., vol. 3, 1922, very freely revised from their work :R. A. Silverman
p. 133-181 (read online (https://eudml.org/doc/213289)), reproduces Introductory Real Analysis, Dover, 2012 (1reed. 1970) (read online
in the works of Stefan Banach, p. 305-348 (http://matwbn.icm.edu. (https://books.google.com/books?id=U_FIAwAAQBAJ&pg=PA70))
pl/books/or/or2/or215.pdf) (thesis presented in June 1920 to p. 70 and 75-76.
theLviv University), chap. II, § 2, Theorem 6. 14. Kolmogorov and Fomin 1999, p. 43.
Related Articles
Non-expansive application
Caristi's Fixed Point Theorem
This document comes fromInvalid input. Please provide a text to translate.r.Invalid request. Please provide a text for translation.».
