Brouwer Fixed-Point Theorem (Dimension 2)
The Brouwer fixed-point theorem states that every continuous map from the closed disk to itself has a fixed point. The two-dimensional case can be proved using the fundamental group, making it one of the first applications of algebraic topology to a concrete analytical question.
Statement
Every continuous map has a fixed point: there exists with .
Here is the closed unit disk.
Proof via the Fundamental Group
The proof proceeds by contradiction, using two key lemmas.
Lemma 1 (No Retraction): There is no retraction , i.e., no continuous map with for all .
Proof of Lemma 1: Suppose is a retraction. Let be the inclusion. Then , so .
Now must be injective (if is the identity, is injective). But and (since is contractible), so no injective homomorphism exists. Contradiction.
Lemma 2 (Fixed-point-free maps yield retractions): If has no fixed point, then there exists a retraction .
Proof of Lemma 2: For each , since , there is a unique ray starting at and passing through . This ray hits at a unique point; call it .
Explicitly: is the point on obtained by starting at , moving in the direction , and hitting the boundary. Analytically: where is chosen so that . This is the larger root of a quadratic in , which depends continuously on (since ensures the ray is well-defined).
For : since and , the ray from through exits at itself (with giving ). So .
Combining: If has no fixed point, Lemma 2 gives a retraction , contradicting Lemma 1. Therefore must have a fixed point.
Applications
-
Existence of equilibria: In game theory, Brouwer's theorem (and its generalization, Kakutani's theorem) is used to prove the existence of Nash equilibria.
-
Nonlinear equations: If is continuous, the equation always has a solution. This is used in PDE theory (via Schauder's fixed-point theorem, which generalizes Brouwer to infinite dimensions).
-
The Ham Sandwich Theorem and other results in combinatorial geometry ultimately rely on fixed-point or degree-theoretic arguments.
The Brouwer theorem guarantees existence of a fixed point but provides no algorithm for finding it. Consider defined by a complicated continuous formula. We know has a fixed point, but finding it may require iterative methods (not guaranteed to converge in general).
This non-constructive character led Brouwer himself to become an advocate of intuitionism, rejecting non-constructive existence proofs!
Generalizations
Every continuous map (the closed -ball in ) has a fixed point, for every .
The proof for uses . For general , one needs stronger tools:
- Homology theory: The proof generalizes by replacing with (the -th homology group). The no-retraction lemma becomes: does not inject into .
- Degree theory: The degree of is , but if a retraction existed, the degree would factor through .
- Smooth methods: In the smooth category, Sard's theorem and differential forms provide alternative proofs.
For every continuous map , there exists a point with . That is, some pair of antipodal points maps to the same value.
The Borsuk--Ulam theorem implies the Brouwer fixed-point theorem (in dimension 2) and is itself stronger. It has a memorable consequence: at any moment, there are two antipodal points on the Earth's surface with the same temperature and the same atmospheric pressure.