Brouwer fixed-point theorem

In 1886, Henri Poincaré (pictured) proved a result that is equivalent to Brouwer's fixed-point theorem. The three-dimensional case of the exact statement was proved in 1904 by Piers Bohl, and the general case in 1910 by Jacques Hadamard and Luitzen Egbertus Jan Brouwer.

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after Luitzen Brouwer. It states that for any continuous function f mapping a compact convex set into itself there is a point x₀ such that f(x₀) = x₀. The simplest forms of Brouwer's theorem are for continuous functions f from a closed interval I in the real numbers to itself or from a closed disk D to itself. A more general form than the latter is for continuous functions from a convex compact subset K of Euclidean space to itself.

Among hundreds of fixed-point theorems, Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics. In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem and the Borsuk–Ulam theorem. This gives it a place among the fundamental theorems of topology. The theorem is also used for proving deep results about differential equations and is covered in most introductory courses on differential geometry. It appears in unlikely fields such as game theory. In economics, Brouwer's fixed-point theorem and its extension, the Kakutani fixed-point theorem, play a central role in the proof of existence of general equilibrium in market economies as developed in the 1950s by economics Nobel prize winners Kenneth Arrow and Gérard Debreu.

The theorem was first studied in view of work on differential equations by the French mathematicians around Poincaré and Picard. Proving results such as the Poincaré–Bendixson theorem requires the use of topological methods. This work at the end of the 19th century opened into several successive versions of the theorem. The general case was first proved in 1910 by Jacques Hadamard and by Luitzen Egbertus Jan Brouwer.

Statement

The theorem has several formulations, depending on the context in which it is used and its degree of generalization. The simplest is sometimes given as follows:

In the plane

Every continuous function from a closed disk to itself has at least one fixed point.

This can be generalized to an arbitrary finite dimension:

In Euclidean space

Every continuous function from a closed ball of a Euclidean space into itself has a fixed point.

A slightly more general version is as follows:

Convex compact set

Every continuous function from a convex compact subset K of a Euclidean space to K itself has a fixed point.

An even more general form is better known under a different name:

Schauder fixed point theorem

Every continuous function from a convex compact subset K of a Banach space to K itself has a fixed point.

Importance of the pre-conditions

The theorem holds only for sets that are compact, i.e. bounded and closed, and convex. The following examples show why these three requirements are important.

Boundedness

Consider the function

$f(x) = x+1$

which is a continuous function from R to itself. As it shifts every point to the right, it cannot have a fixed point. Note that R is convex and closed, but not bounded.

Closedness

Consider the function

$f(x) = \frac{x+1}2$

which is a continuous function from the open interval (−1,1) to itself. In this interval, it shifts every point to the right, so it cannot have a fixed point. Note that (−1,1) is convex and bounded, but not closed. The function f does have a fixed point for the closed interval [−1,1], namely f(x) = x = 1.

Convexity

Note that convexity is not strictly necessary for BFPT. Because the properties involved (continuity, being a fixed point) are invariant under homeomorphisms, BFPT is equivalent to forms in which the domain is required to be a closed unit ball Dⁿ. For the same reason it holds for every set that is homeomorphic to a closed ball (and therefore also closed, bounded, connected, without holes, etc.).

The following example shows that BFPT doesn't work for domains with holes. Consider the following function, defined in polar coordinates:

$f(r,\theta)=(r,\theta+\pi/4)$

which is a continuous function from the unit circle to itself. It rotates every point on the unit circle 45 degrees counterclockwise, so it cannot have a fixed point. Note that the unit circle is closed and bounded, but it has a hole (and so it is not convex). The function f does have a fixed point for the unit disc, since it takes the origin to itself.

A formal generalization of BFPT for "hole-free" domains can be derived from the Lefschetz fixed-point theorem.

Notes

The continuous function in this theorem is not required to be bijective or even surjective.

Illustrations

The theorem has several "real world" illustrations. Here are some examples.

1. Take two sheets of graph paper of equal size with coordinate systems on them, lay one flat on the table and crumple up (without ripping or tearing) the other one and place it, in any fashion, on top of the first so that the crumpled paper does not reach outside the flat one. There will then be at least one point of the crumpled sheet that lies directly above its corresponding point (i.e. the point with the same coordinates) of the flat sheet. This is a consequence of the n = 2 case of Brouwer's theorem applied to the continuous map that assigns to the coordinates of every point of the crumpled sheet the coordinates of the point of the flat sheet immediately beneath it.

2. Take an ordinary map of a country, and suppose that that map is laid out on a table inside that country. There will always be a "You are Here" point on the map which represents that same point in the country.

3. In three dimensions the consequence of the Brouwer fixed-point theorem is that, no matter how much you stir a cocktail in a glass, when the liquid has come to rest some point in the liquid will end up in exactly the same place in the glass as before you took any action, assuming that the final position of each point is a continuous function of its original position, and that the liquid after stirring is contained within the space originally taken up by it.

Intuitive approach

Explanations attributed to Brouwer

The theorem is supposed to have originated from Brouwer's observation of a cup of coffee. If one stirs to dissolve a lump of sugar, it appears there is always a point without motion. He drew the conclusion that at any moment, there is a point on the surface that is not moving. The fixed point is not necessarily the point that seems to be motionless, since the centre of the turbulence moves a little bit. The result is not intuitive, since the original fixed point may become mobile when another fixed point appears.

Brouwer is said to have added: "I can formulate this splendid result different, I take a horizontal sheet, and another identical one which I crumple, flatten and place on the other. Then a point of the crumpled sheet is in the same place as on the other sheet." Brouwer "flattens" his sheet as with a flat iron, without removing the folds and wrinkles. This example is better than the coffee cup one as it shows that uniqueness of the fixed point may fail. This distinguishes Brouwer's result from other fixed-point theorems, such as Banach's, that guarantee uniqueness.

One-dimensional case

200px

In one dimension, the result is intuitive and easy to prove. The continuous function f is defined on a closed interval [a, b] and takes values in the same interval. Saying that this function has a fixed point amounts to saying that its graph (dark green in the figure on the right) intersects that of the function defined on the same interval [a, b] which maps x to x (light green).

Intuitively, any continuous line from the left edge of the square to the right edge must necessarily intersect the green diagonal. Proof: consider the function g which maps x to f(x) - x. It is ≥ 0 on a and ≤ 0 on b. By the intermediate value theorem, g has a zero in [a, b]; this zero is a fixed point.

Brouwer is said to have expressed this as follows: "Instead of examining a surface, we will prove the theorem about a piece of string. Let us begin with the string in an unfolded state, then refold it. Let us flatten the refolded string. Again a point of the string has not changed its position with respect to its original position on the unfolded string."

History

The Brouwer fixed point theorem was one of the early achievements of algebraic topology, and is the basis of more general fixed point theorems which are important in functional analysis. The case n = 3 first was proved by Piers Bohl in 1904 (published in Journal für die reine und angewandte Mathematik). It was later proved by L. E. J. Brouwer in 1909. Jacques Hadamard proved the general case in 1910, and Brouwer found a different proof in the same year. Since these early proofs were all non-constructive indirect proofs, they ran contrary to Brouwer's intuitionist ideals. Methods to construct (approximations to) fixed points guaranteed by Brouwer's theorem are now known.

Prehistory

File:Théorème-de-Brouwer-(cond-1).jpg

For flows in an unbounded area, or in an area with a "hole", the theorem is not applicable.

File:Théorème-de-Brouwer-(cond-2).jpg

The theorem applies to any disk-shaped area, where it guarantees the existence of a fixed point.

To understand the prehistory of Brouwer's fixed point theorem one needs to pass through differential equations. At the end of the 19th century, the old problem of the stability of the solar system returned into the focus of the mathematical community. Its solution required new methods. As noted by Henri Poincaré, who worked on the three-body problem, there is no hope to find an exact solution: "Nothing is more proper to give us an idea of the hardness of the three-body problem, and generally of all problems of Dynamics where there is no uniform integral and the Bohlin series diverge." He also noted that the search for an approximate solution is no more efficient: "the more we seek to obtain precise approximations, the more the result will diverge towards an increasing imprecision".

He studied a question analogous to that of the surface movement in a cup of coffee. What can we say, in general, about the trajectories on a surface animated by a constant flow? Poincaré discovered that the answer can be found in what we now call the topological properties in the area containing the trajectory. If this area is compact, i.e. both closed and bounded, then the trajectory either becomes stationary, or it approaches a limit cycle. Poincaré went further; if the area is of the same kind as a disk, as is the case for the cup of coffee, there must necessarily be a fixed point. This fixed point is invariant under all functions which associate to each point of the original surface its position after a short time interval t. If the area is a circular band, or if it is not closed, then this is not necessarily the case.

To understand differential equations better, a new branch of mathematics was born. Poincaré called it analysis situs. The French Encyclopædia Universalis defines it as the branch which "treats the properties of an object that are invariant if it is deformed in any continuous way, without tearing". In 1886, Poincaré proved a result that is equivalent to Brouwer's fixed-point theorem, although the connection with the subject of this article was not yet apparent. A little later, he developed one of the fundamental tools for better understanding the analysis situs, now known as the fundamental group or sometimes the Poincaré group. This method can be used for a very compact proof of the theorem under discussion.

Poincaré's method was analogous to that of Émile Picard, a contemporary mathematician who generalized the Cauchy–Lipschitz theorem. Picard's approach is based on a result that would later be formalised by another fixed-point theorem, named after Banach. Instead of the topological properties of the domain, this theorem uses the fact that the function in question is a contraction.

First proofs

Hadamard helped Brouwer to formalize his ideas.

At the dawn of the 20th century, the interest in analysis situs did not stay unnoticed. However, the necessity of a theorem equivalent to the one discussed in this article was not yet evident. Piers Bohl, a Latvian mathematician, applied topological methods to the study of differential equations. In 1904 he proved the three-dimensional case of our theorem, but his publication was not noticed.

It was Brouwer, finally, who gave the theorem its first patent of nobility. His goals were different from those of Poincaré. This mathematician was inspired by the foundations of mathematics, especially mathematical logic and topology. His initial interest lay in an attempt to solve Hilbert's fifth problem. In 1909, during a voyage to Paris, he met Poincaré, Hadamard, and Borel. The ensuing discussions convinced Brouwer of the importance of a better understanding of Euclidean spaces, and were the origin of a fruitful exchange of letters with Hadamard. For the next four years, he concentrated on the proof of certain great theorems on this question. In 1912 he proved the hairy ball theorem for the two-dimensional sphere, as well as the fact that every continuous map from the two-dimensional ball to itself has a fixed point. These two results in themselves were not really new. As Hadamard observed, Poincaré had shown a theorem equivalent to the hairy ball theorem. The revolutionary aspect of Brouwer's approach was his systematic use of recently developed tools such as homotopy, the underlying concept of the Poincaré group. In the following year, Hadamard generalised the theorem under discussion to an arbitrary finite dimension, but he employed different methods. Hans Freudenthal comments on the respective roles as follows: "Compared to Brouwer's revolutionary methods, those of Hadamard were very traditional, but Hadamard's participation in the birth of Brouwer's ideas resembles that of a midwife more than that of a mere spectator."

Brouwer's approach yielded its fruits, and in 1910 he also found a proof that was valid for any finite dimension, as well as other key theorems such as the invariance of dimension. In the context of this work, Brouwer also generalized the Jordan curve theorem to arbitrary dimension and established the properties connected with the degree of a continuous mapping. This branch of mathematics, originally envisioned by Poincaré and developed by Brouwer, changed its name. In the 1930s, analysis situs became algebraic topology.

Reception

File:John f nash 20061102 2.jpg

John Nash used the theorem in game theory to prove the existence of an equilibrium strategy profile.

The theorem proved its worth in more than one way. During the 20th century numerous fixed-point theorems were developed, and even a branch of mathematics called fixed-point theory. Brouwer's theorem is probably the most important. It is also among the foundational theorems on the topology of topological manifolds and is often used to prove other important results such as the Jordan curve theorem.

Besides the fixed-point theorems for more or less contracting functions, there are many that have emerged directly or indirectly from the result under discussion. A continuous map from a closed ball of Euclidean space to its boundary cannot be the identity on the boundary. Similarly, the Borsuk–Ulam theorem says that a continuous map from the n-dimensional sphere to Rⁿ has a pair of antipodal points that are mapped to the same point. In the finite-dimensional case, the Lefschetz fixed-point theorem provided from 1926 a method for counting fixed points. In 1930, Brouwer's fixed-point theorem was generalized to Banach spaces. This generalization is known as Schauder's fixed-point theorem, a result generalized further by S. Kakutani to multivalued functions. One also meets the theorem and its variants outside topology. It can be used to prove the Hartman-Grobman theorem, which describes the qualitative behaviour of certain differential equations near certain equilibria. Similarly, Brouwer's theorem is used for the proof of the Central Limit Theorem. The theorem can also be found in existence proofs for the solutions of certain partial differential equations.

Other areas are also touched. In game theory, John Nash used the theorem to prove that in the game of Hex there is a winning strategy for white. In economics, P. Bich explains that certain generalizations of the theorem show that its use is helpful for certain classical problems in game theory and generally for equilibria (Hotelling's law), financial equilibria and incomplete markets.

Brouwer's celebrity is not exclusively due to his topological work. The proofs of his great topological theorems are not constructive, and Brouwer's dissatisfaction with this is partly what led him to articulate the idea of constructivity. He became the originator and zealous defender of a way of formalising mathematics that is known as intuitionism, which at the time made a stand against set theory. The fixed-point theorem is, as he originally stated it, false in intuitionism, and Brouwer disavowed it, proposing instead alternative versions to be constructively proven.

Proof outlines

A proof using degree

Brouwer's original 1911 proof relied on the notion of the degree of a continuous mapping. Modern accounts of the proof can also be found in the literature.

Let $K=\overline{B(0)}$ denote the closed unit ball in $\mathbb R^n$ centered at the origin. Suppose for simplicitly that $f:K\to K$ is continuously differentiable. A regular value of $f$ is a point $p\in B(0)$ such that the Jacobian of $f$ is non-singular at every point of the preimage of $p$. In particular, by the inverse function theorem, every point of the preimage of $f$ lies in $B(0)$ (the interior of $K$). The degree of $f$ at a regular value $p\in B(0)$ is defined as the sum of the signs of the Jacobian determinant of $f$ over the preimages of $p$ under $f$:

$\operatorname{deg}_p(f) = \sum_{x\in f^{-1}(p)} \operatorname{sign}\left(\det(Df(x))\right).$

The degree is, roughly speaking, the number of "sheets" of the preimage f lying over a small open set around p, with sheets counted oppositely if they are oppositely oriented. This is thus a generalization of winding number to higher dimensions.

The degree satisfies the property of homotopy invariance: let $f$ and $g$ be two continuously differentiable functions, and $H_t(x)=tf+(1-t)g$ for $0\le t\le 1$. Suppose that the point $p$ is a regular value of $H_t$ for all t. Then $\deg_p f = \deg_p g$.

If there is no fixed point of the boundary of $K$, then the function

$H(t,x) = x-tf(x)$

is a homotopy from $g(x)=x-f(x)$ to the identity function. The identity function has degree one at every point. In particular, the identity function has degree one at the origin, so $g$ also has degree one at the origin. As a consequence, the preimage $g^{-1}(0)$ is not empty. The elements of $g^{-1}(0)$ are precisely the fixed points of the original function f.

This requires some work to make fully general. The definition of degree must be extended to singular values of f, and then to continuous functions. The more modern advent of homology theory simplifies the construction of the degree, and so has become a standard proof in the literature.

A proof using homology

The proof uses the observation that the boundary of Dⁿ is S^n − 1, the (n − 1)-sphere.

File:Brouwer fixed point theorem retraction.svg

Illustration of the retraction F

The argument proceeds by contradiction, supposing that a continuous function f : Dⁿ → Dⁿ has no fixed point, and then attempting to derive an inconsistency, which proves that the function must in fact have a fixed point. For each x in Dⁿ, there is only one straight line that passes through f(x) and x, because it must be the case that f(x) and x are distinct by hypothesis (recall that f having no fixed points means that f(x) ≠ x). Following this line from f(x) through x leads to a point on S^n − 1, denoted by F(x). This defines a continuous function F : Dⁿ → S^n − 1, which is a special type of continuous function known as a retraction: every point of the codomain (in this case S^n − 1) is a fixed point of the function.

Intuitively it seems unlikely that there could be a retraction of Dⁿ onto S^n − 1, and in the case n = 1 it is obviously impossible because S⁰ (i.e., the endpoints of the closed interval D¹) is not even connected. The case n = 2 is less obvious, but can be proven by using basic arguments involving the fundamental groups of the respective spaces: the retraction would induce an injective group homomorphism from the fundamental group of S¹ to that of D², but the first group is isomorphic to Z while the latter group is trivial, so this is impossible. The case n = 2 can also be proven by contradiction based on a theorem about non-vanishing vector fields.

For n > 2, however, proving the impossibility of the retraction is more difficult. One way is to make use of homology groups: the homology H_n − 1(Dⁿ) is trivial, while H_n − 1(S ^n − 1) is infinite cyclic. This shows that the retraction is impossible, because again the retraction would induce an injective group homomorphism from the latter to the former group.

A proof using Stokes's theorem

To prove that a map has fixed points, one can assume that it is smooth, because if a map has no fixed points then convolving it with a smooth function of sufficiently small support produces a smooth function with no fixed points. As in the proof using homology, one is reduced to proving that there is no smooth retraction f from the ball B onto its boundary ∂B. If ω is a volume form on the boundary then by Stokes Theorem,

$0<\int_{\partial B}\omega = \int_{\partial B}f^*(\omega) = \int_Bdf^*(\omega)= \int_Bf^*(d\omega)=\int_Bf^*(0) = 0$

giving a contradiction.

More generally, this shows that there is no smooth retraction from any non-empty smooth orientable compact manifold onto its boundary. The proof using Stokes's theorem is closely related to the proof using homology (or rather cohomology), because the form ω generates the de Rham cohomology group Hⁿ⁻¹(∂B) used in the cohomology proof.

A combinatorial proof

The BFPT can be proved based on Sperner's lemma. We now give an outline of the proof for the special case in which f is a function from the unit n-simplex to itself, i.e.:

$f: \Delta^n \to \Delta^n$

Where:

$\Delta^n = \left\{P\in\mathbb{R}^{n+1}\mid\sum_{i = 0}^{n}{P_i} = 1 \mbox{ and } P_i \ge 0 \mbox{ for all } i\right\}$

For every point $P\in \Delta^n$, also $f(P)\in \Delta^n$. Hence the sum of their coordinates is equal:

$\sum_{i = 0}^{n}{P_i} = 1 = \sum_{i = 0}^{n}{f(P)_i}$

Hence, by the pigeonhole principle, for every $P\in \Delta^n$ there must be an index $j \in \{0, \cdots, n\}$ such that the $j$-th coordinate of $P$ is weakly larger than the $j$-th coordinate of its image undef f:

$f(P)_j \leq P_j$

Moreover, if $P$ lies on a k-dimensional sub-face of $\Delta^n$, then by the same argument, the index $j$ can be selected from among the (k+1) coordinates which are not zero on this sub-face.

We now use this fact to construct a Sperner coloring. For every triangulation of $\Delta^n$, the color of every vertex $P$ is an index $j$ such that $f(P)_j \leq P_j$.

By construction, this is a Sperner coloring. Hence, by Sperner's lemma, there is an n-dimensional simplex whose vertices are colored with the entire set of (n+1) available colors.

Because f is continuous, this simplex can be made arbitrarily small by choosing an arbitrarily fine triangulation. Hence, there must be a point $P$ which satisfies the labeling condition in all coordinates, i.e.:

$\forall j: f(P)_j \leq P_j$

Because the sum of the coordinates of $P$ and $f(P)$ must be equal, all these inequalities must actually be equalities. But this means that:

$f(P) = P$

I.e, $P$ is a fixed point of $f$.

The proof can be extended to every object which is homeomorphic to $\Delta^n$.

A proof by Hirsch

There is also a quick proof, by Morris Hirsch, based on the impossibility of a differentiable retraction. The indirect proof starts by noting that the map f can be approximated by a smooth map retaining the property of not fixing a point; this can be done by using the Weierstrass approximation theorem, for example. One then defines a retraction as above which must now be differentiable. Such a retraction must have a non-singular value, by Sard's theorem, which is also non-singular for the restriction to the boundary (which is just the identity). Thus the inverse image would be a 1-manifold with boundary. The boundary would have to contain at least two end points, both of which would have to lie on the boundary of the original ball—which is impossible in a retraction.

Kellogg, Li, and Yorke turned Hirsch's proof into a constructive proof by observing that the retract is in fact defined everywhere except at the fixed points. For almost any point, q, on the boundary, (assuming it is not a fixed point) the one manifold with boundary mentioned above does exist and the only possibility is that it leads from q to a fixed point. It is an easy numerical task to follow such a path from q to the fixed point so the method is essentially constructive. Chow, Mallet-Paret, and Yorke gave a conceptually similar path-following version of the homotopy proof which extends to a wide variety of related problems.

A proof using the oriented area

A variation of the preceding proof does not employ the Sard's theorem, and goes as follows. If r : B→∂B   is a smooth retraction, one considers the smooth deformation g^t(x) := t r(x) + (1-t)x, and the smooth function

$\varphi(t):=\int_B \operatorname{det} D g^t(x) dx$

Differentiating under the sign of integral it is not difficult to check that φ′(t)=0 for all t, so φ is a constant function, which is a contradiction because φ(0) is the n-dimensional volume of the ball, while φ(1) is zero. The geometric idea is that φ(t) is the oriented area of g^t(B) (that is, the Lebesgue measure of the image of the ball via g^t, taking into account multiplicity and orientation), and should remain constant (as it is very clear in the one-dimensional case). On the other hand, as the parameter t passes form 0 to 1 the map g^t transforms continuously from the identity map of the ball, to the retraction r, which is a contradiction since the oriented area of the identity coincides with the volume of the ball, while the oriented area of r is necessarily 0, as its image is the boundary of the ball, a set of null measure.

A proof using the game hex

A quite different proof given by David Gale is based on the game of Hex. The basic theorem about Hex is that no game can end in a draw. This is equivalent to the Brouwer fixed-point theorem for dimension 2. By considering n-dimensional versions of Hex, one can prove in general that Brouwer's theorem is equivalent to the determinacy theorem for Hex.

A proof using the Lefschetz fixed-point theorem

The Lefschetz fixed-point theorem says that if a continuous map f from a finite simplicial complex B to itself has only isolated fixed points, then the number of fixed points counted with multiplicities (which may be negative) is equal to the Lefschetz number

$\displaystyle \sum_n(-1)^n\operatorname{Tr}(f|H_n(B))$

and in particular if the Lefschetz number is nonzero then f must have a fixed point. If B is a ball (or more generally is contractible) then the Lefschetz number is one because the only non-zero homology group is :$H_0(B)$, so f has a fixed point.

A proof in a weak logical system

In reverse mathematics, Brouwer's theorem can be proved in the system WKL₀, and conversely over the base system RCA₀ Brouwer's theorem for a square implies the weak König's lemma, so this gives a precise description of the strength of Brouwer's theorem.

Generalizations

The Brouwer fixed-point theorem forms the starting point of a number of more general fixed-point theorems.

The straightforward generalization to infinite dimensions, i.e. using the unit ball of an arbitrary Hilbert space instead of Euclidean space, is not true. The main problem here is that the unit balls of infinite-dimensional Hilbert spaces are not compact. For example, in the Hilbert space ℓ² of square-summable real (or complex) sequences, consider the map f : ℓ² → ℓ² which sends a sequence (x_n) from the closed unit ball of ℓ² to the sequence (y_n) defined by

$y_0=\sqrt{1-\|x\|_2^2}\qquad\text{ and }\qquad y_n=x_{n-1}\quad\text{ for }\quad n\geq 1.$

It is not difficult to check that this map is continuous, has its image in the unit sphere of ℓ², but does not have a fixed point.

The generalizations of the Brouwer fixed-point theorem to infinite dimensional spaces therefore all include a compactness assumption of some sort, and in addition also often an assumption of convexity. See fixed-point theorems in infinite-dimensional spaces for a discussion of these theorems.

There is also finite-dimensional generalization to a larger class of spaces: If $X$ is a product of finitely many chainable continua, then every continuous function $f:X\rightarrow X$ has a fixed point, where a chainable continuum is a (usually but in this case not necessarily metric) compact Hausdorff space of which every open cover has a finite open refinement $\{U_1,\ldots,U_m\}$, such that $U_i \cap U_j \neq \emptyset$ if and only if $|i-j| \leq 1$. Examples of chainable continua include compact connected linearly ordered spaces and in particular closed intervals of real numbers.

The Kakutani fixed point theorem generalizes the Brouwer fixed-point theorem in a different direction: it stays in Rⁿ, but considers upper hemi-continuous correspondences (functions that assign to each point of the set a subset of the set). It also requires compactness and convexity of the set.

The Lefschetz fixed-point theorem applies to (almost) arbitrary compact topological spaces, and gives a condition in terms of singular homology that guarantees the existence of fixed points; this condition is trivially satisfied for any map in the case of Dⁿ.

Equivalent results

There are several fixed-point theorems which come in three equivalent variants: an algebraic topology variant, a combinatorial variant and a set-covering variant. Each variant can be proved separately using totally different arguments, but each variant can also be reduced to the other variants in its row. Additionally, each result can be reduced to the other result in its column.

Algebraic topology	Combinatorics	Set covering
Brouwer fixed-point theorem	Sperner's lemma	KKM lemma
Borsuk–Ulam theorem	Tucker's lemma	Lusternik–Schnirelmann theorem

See also

• Fixed-point theorems
• Banach fixed-point theorem
• Schauder fixed-point theorem
• Lefschetz fixed-point theorem
• Tucker's lemma
• Kakutani fixed-point theorem
• Topological combinatorics
• Nash equilibrium
• Poincaré–Miranda theorem – equivalent to the Brouwer fixed-point theorem.

References

• (see p. 72–73 for Hirsch's proof utilizing non-existence of a differentiable retraction)

External links

• Brouwer's Fixed Point Theorem for Triangles at cut-the-knot
• Brouwer theorem, from PlanetMath with attached proof.
• Reconstructing Brouwer at MathPages
• Brouwer Fixed Point Theorem at Math Images.