Fixed-point theorem: Difference between revisions

Revision as of 10:37, 27 February 2022

Latest revision as of 00:51, 3 February 2024

(19 intermediate revisions by 16 users not shown)

Line 7:

| isbn = 0-8218-5080-6

}}

}}</ref>

</ref> Some authors claim that results of this kind are amongst the most generally useful in mathematics.<ref>{{cite book

| author1 = Dugundji, James

| author2 = Granas, Andrzej

| title = Fixed Point Theory

| year = 2003

| publisher = Springer-Verlag

| isbn = 0-387-00173-5

}}</ref>

== In mathematical analysis ==

The [[Banach fixed-point theorem]] (1922) gives a general criterion guaranteeing that, if it is satisfied, the procedure of [[iteration|iterating]] a function yields a fixed point.<ref>{{cite book

| author = Giles, John R.

| title = Introduction to the Analysis of Metric Spaces

Line 25 ⟶ 18:

}}</ref>

By contrast, the [[Brouwer fixed-point theorem]] (1911) is a non-[[Constructivism (mathematics)|constructive result]]: it says that any [[continuous function]] from the closed [[unit ball]] in ''n''-dimensional [[Euclidean space]] to itself must have a fixed point,<ref>Eberhard Zeidler, ''Applied Functional Analysis: main principles and their applications'', Springer, 1995.</ref> but it doesn't describe how to find the fixed point (Seesee also [[Sperner's lemma]]).

For example, the [[cosine]] function is continuous in [−1,&nbsp;1] and maps it into [−1, &nbsp;1], and thus must have a fixed point. This is clear when examining a sketched graph of the cosine function; the fixed point occurs where the cosine curve ''y'' = cos(''x'') intersects the line ''y'' = ''x''. Numerically, the fixed point (known as the [[Dottie number]]) is approximately ''x'' = 0.73908513321516 (thus ''x'' = cos(''x'') for this value of ''x'').

The [[Lefschetz fixed-point theorem]]<ref>{{cite journal |author=Solomon Lefschetz |title=On the fixed point formula |journal=[[Annals of Mathematics|Ann. of Math.]] |year=1937 |volume=38 |pages=819–822 |doi=10.2307/1968838 |issue=4}}</ref> (and the [[Nielsen theory|Nielsen fixed-point theorem]])<ref>{{cite book

Line 85 ⟶ 78:

*[[Atiyah–Bott fixed-point theorem]]

*[[Banach fixed-point theorem]]

*[[Bekić's theorem]]

*[[Borel fixed-point theorem]]

*[[Bourbaki&ndash;Witt theorem]]

*[[Browder fixed-point theorem]]

*[[Brouwer fixed-point theorem]]

*[[Rothe's fixed-point theorem]]

*[[Caristi fixed-point theorem]]

*[[Diagonal lemma]], also known as the fixed-point lemma, for producing self-referential sentences of [[first-order logic]]

*[[Lawvere's fixed-point theorem]]

*[[Discrete fixed-point theorem]]s

*[[Earle-Hamilton fixed-point theorem]]

*[[Fixed-point combinator]], which shows that every term in untyped [[lambda calculus]] has a fixed point

*[[Fixed-point lemma for normal functions]]

Line 108 ⟶ 105:

*[[Tychonoff fixed-point theorem]]

{{div col end}}

== See also ==

* [[Trace formula (disambiguation)|Trace formula]]

== Footnotes ==

{{Reflist}}

<references/>

== References ==

Line 158 ⟶ 159:

| isbn = 978-0-471-41825-2

}}

*{{cite book |author1=Kirk, |first=William A. |author2=Sims, |first2=Brailey | title = Handbook of Metric Fixed Point Theory |year=2001 |publisher=Springer-Verlag |isbn=0-7923-7073-2 |author-link2=Brailey Sims}}

*{{cite book

|author1=Kirk, William A. |author2=Sims, Brailey | title = Handbook of Metric Fixed Point Theory

| year = 2001

| publisher = Springer-Verlag

| isbn = 0-7923-7073-2

}}

*{{cite book |author1=Šaškin, Jurij A |author2=Minachin, Viktor |author3=Mackey, George W. |title=Fixed Points |year=1991 |publisher=American Mathematical Society |isbn=0-8218-9000-X |url-access=registration |url=https://archive.org/details/fixedpoints0002shas }}

==External links==

*[http://www.math-linux.com/spip.php?article60 Fixed Point Method]

{{Authority control}}

[[Category:Closure operators]]