Brouwer's Fixed-Point Theorem: A Proof via the Fundamental Group
We prove Brouwer's Fixed-Point Theorem for the closed disk using the fundamental group and the non-existence of a retraction, deriving an algebraic contradiction.
The Theorem
Theorem (Brouwer, 1911)
Every continuous function has at least one fixed point such that:
Here is the closed unit disk and is its boundary circle.
Intuition
Before the formal proof, here are two everyday examples that capture the idea.
The coffee cup. Stir a cup of coffee, then let it settle. No matter how you stirred, at least one point of the liquid ends up exactly where it started.
The map. Place a map of a city on a table inside that same city. There is always one point on the map that lies directly above the real location it represents.
Both examples reflect the same fact: you cannot continuously move every point of a compact convex region — something always stays fixed.
Background
The Fundamental Group
The fundamental group classifies loops in a space up to continuous deformation. A loop based at is a continuous map
Two loops and are homotopic (written ) if one can be continuously deformed into the other while keeping the basepoint fixed.
The Two Groups We Need
Disk
Every loop shrinks to a point via the straight-line homotopy
Circle
Loops are classified by their winding number: how many times they wrap around the circle.
Key Lemma
Lemma. Let and be continuous maps. If and , then
Homotopy is preserved under composition.
Proof. Let be the homotopy from to and from to . Define
This is a valid homotopy from to .
Proof
Proof (by contradiction)
Step 1 — Assume no fixed point.
Suppose is continuous and satisfies for all .
Step 2 — Construct a retraction .
Since everywhere, we can draw a ray from through and extend it until it hits the boundary . Define to be that intersection point.
The map satisfies:
- is continuous.
- for all .
This makes a retraction of onto .
Step 3 — Apply the Key Lemma.
Let be any two paths inside . Since , any two paths with the same endpoints are homotopic:
Composing with and applying the Key Lemma:
Step 4 — Reach a contradiction.
Choose paths carefully:
- constant is a single point, winding number
- loops around once, winding number
But forces equal winding numbers:
This is impossible.
The Algebraic Picture
The contradiction has a clean algebraic form. The retraction gives the chain:
where is the inclusion and . Applying :
The composition must equal , but any map factoring through is the zero map:
Why Every Condition Is Necessary
Without continuity. The map with for and for has no fixed point.
Without compactness. The map with has no fixed point since .
Without convexity. The map with has no fixed point since for all .
The General Theorem
General Brouwer Fixed-Point Theorem.
Let be a nonempty compact convex set. Every continuous function has at least one fixed point.
The proof is identical in every dimension: build a retraction and derive
which forces in .
Applications
Economics. Arrow and Debreu used Brouwer's theorem to prove that competitive markets always have a price equilibrium — work that earned them the Nobel Prize in Economics.
Game Theory. Nash used a fixed-point theorem to prove every finite game has at least one Nash equilibrium, the foundation of modern game theory.
Differential Equations. The theorem guarantees existence of solutions to certain ODEs via the Peano existence theorem.
Proof at a Glance
References
- Hatcher, A., Algebraic Topology, Cambridge University Press, 2002. Free PDF
- Munkres, J., Topology, 2nd edition, Prentice Hall, 2000.
- Wikipedia — Brouwer Fixed-Point Theorem
- 3Blue1Brown — YouTube
- MIT OpenCourseWare — Algebraic Topology
- MIT OpenCourseWare — Algebraic Topology