All Posts
Mathematics

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 f:D2D2f: D^2 \to D^2 has at least one fixed point x0x_0 such that: f(x0)=x0\\f(x_0) = x_0

Here D2={(x,y)R2:x2+y21}D^2 = \{(x,y) \in \mathbb{R}^2 : x^2 + y^2 \leq 1\} is the closed unit disk and S1=D2S^1 = \partial D^2 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 π1(X)\pi_1(X) classifies loops in a space XX up to continuous deformation. A loop based at x0x_0 is a continuous map

γ:[0,1]Xwithγ(0)=γ(1)=x0\gamma: [0,1] \to X \quad \text{with} \quad \gamma(0) = \gamma(1) = x_0

Two loops γ0\gamma_0 and γ1\gamma_1 are homotopic (written γ0γ1\gamma_0 \simeq \gamma_1) if one can be continuously deformed into the other while keeping the basepoint fixed.

The Two Groups We Need

Disk D2D^2

π1(D2)=0\pi_1(D^2) = 0

Every loop shrinks to a point via the straight-line homotopy

H(t,s)=(1s)γ(t)+sx0H(t,s) = (1-s)\,\gamma(t) + s \cdot x_0

Circle S1S^1

π1(S1)=Z\pi_1(S^1) = \mathbb{Z}

Loops are classified by their winding number: how many times they wrap around the circle.


Key Lemma

Lemma. Let f1,f2:XYf_1, f_2 : X \to Y and g1,g2:YZg_1, g_2 : Y \to Z be continuous maps. If f1f2f_1 \simeq f_2 and g1g2g_1 \simeq g_2, then g1f1g2f2\\g_1 \circ f_1 \simeq g_2 \circ f_2

Homotopy is preserved under composition.

Proof. Let HfH_f be the homotopy from f1f_1 to f2f_2 and HgH_g from g1g_1 to g2g_2. Define

H(t,s)=Hg(Hf(t,s),s)H(t,s) = H_g(H_f(t,s),\, s)

This is a valid homotopy from g1f1g_1 \circ f_1 to g2f2g_2 \circ f_2. \square


Proof

Proof (by contradiction)

Step 1 — Assume no fixed point.

Suppose f:D2D2f: D^2 \to D^2 is continuous and satisfies f(x)xf(x) \neq x for all xD2x \in D^2.


Step 2 — Construct a retraction r:D2S1r: D^2 \to S^1.

Since f(x)xf(x) \neq x everywhere, we can draw a ray from f(x)f(x) through xx and extend it until it hits the boundary S1S^1. Define r(x)r(x) to be that intersection point.

The map rr satisfies:

  • rr is continuous.
  • r(x)=xr(x) = x for all xS1x \in S^1.

This makes rr a retraction of D2D^2 onto S1S^1.


Step 3 — Apply the Key Lemma.

Let h0,h1:[0,1]D2h_0, h_1 : [0,1] \to D^2 be any two paths inside D2D^2. Since π1(D2)=0\pi_1(D^2) = 0, any two paths with the same endpoints are homotopic:

h0h1in D2h_0 \simeq h_1 \quad \text{in } D^2

Composing with rr and applying the Key Lemma:

rh0rh1in S1r \circ h_0 \simeq r \circ h_1 \quad \text{in } S^1


Step 4 — Reach a contradiction.

Choose paths carefully:

  • h0(t)=x0h_0(t) = x_0 constant \Rightarrow rh0r \circ h_0 is a single point, winding number =0= 0
  • h1(t)=(cos2πt,sin2πt)h_1(t) = (\cos 2\pi t,\, \sin 2\pi t) loops around S1S^1 once, winding number =1= 1

But rh0rh1r \circ h_0 \simeq r \circ h_1 forces equal winding numbers:

0=1in π1(S1)=Z0 = 1 \quad \text{in } \pi_1(S^1) = \mathbb{Z}

This is impossible. \square


The Algebraic Picture

The contradiction has a clean algebraic form. The retraction rr gives the chain:

S1  i  D2  r  S1S^1 \xrightarrow{\;i\;} D^2 \xrightarrow{\;r\;} S^1

where ii is the inclusion and ri=idS1r \circ i = \mathrm{id}_{S^1}. Applying π1\pi_1:

Z  i  0  r  Z\mathbb{Z} \xrightarrow{\;i_*\;} 0 \xrightarrow{\;r_*\;} \mathbb{Z}

The composition rir_* \circ i_* must equal idZ\mathrm{id}_\mathbb{Z}, but any map factoring through 00 is the zero map:

1    0    0    11 \;\longmapsto\; 0 \;\longmapsto\; 0 \;\neq\; 1


Why Every Condition Is Necessary

Without continuity. The map f:[0,1][0,1]f: [0,1] \to [0,1] with f(x)=1f(x) = 1 for x<12x < \tfrac{1}{2} and f(x)=0f(x) = 0 for x12x \geq \tfrac{1}{2} has no fixed point.

Without compactness. The map f:(0,1)(0,1)f: (0,1) \to (0,1) with f(x)=x/2f(x) = x/2 has no fixed point since x=0(0,1)x = 0 \notin (0,1).

Without convexity. The map f:S1S1f: S^1 \to S^1 with f(z)=zf(z) = -z has no fixed point since zz-z \neq z for all zS1z \in S^1.


The General Theorem

General Brouwer Fixed-Point Theorem.

Let KRnK \subset \mathbb{R}^n be a nonempty compact convex set. Every continuous function f:KKf: K \to K has at least one fixed point.

The proof is identical in every dimension: build a retraction r:BnSn1r: B^n \to S^{n-1} and derive

πn1(Sn1)=Zπn1(Bn)=0Z\pi_{n-1}(S^{n-1}) = \mathbb{Z} \xrightarrow{} \pi_{n-1}(B^n) = 0 \xrightarrow{} \mathbb{Z}

which forces 1=01 = 0 in Z\mathbb{Z}.


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

Assume f:D2D2 has no fixed pointBuild retraction r:D2S1,rS1=idπ1(D2)=0    all paths in D2 are homotopic Key Lemmarh0rh1 in S10=1 in ZContradiction! f must have a fixed point.\begin{aligned} &\textbf{Assume } f: D^2 \to D^2 \text{ has no fixed point} \\[6pt] &\Downarrow \\[6pt] &\textbf{Build retraction } r: D^2 \to S^1,\quad r|_{S^1} = \mathrm{id} \\[6pt] &\Downarrow \\[6pt] &\pi_1(D^2) = 0 \implies \text{all paths in } D^2 \text{ are homotopic} \\[6pt] &\Downarrow \text{ Key Lemma} \\[6pt] &r \circ h_0 \simeq r \circ h_1 \text{ in } S^1 \\[6pt] &\Downarrow \\[6pt] &0 = 1 \text{ in } \mathbb{Z} \quad \textbf{Contradiction!} \\[6pt] &\Downarrow \\[6pt] &\therefore\ f \text{ must have a fixed point.} \quad \square \end{aligned}

References