Fixed Point Theorems

Introduction

A fixed point of a function f f is a point x x such that f⁡(x)=x f of x equals x. Fixed point theory provides general conditions ensuring that such points exist, often without constructing them explicitly. These results are central in analysis, differential equations, game theory, economics, and numerical computation.

Two broad paradigms dominate: contraction-based theorems (metric structure, uniqueness, constructive convergence) and topological theorems (compactness and convexity, existence without construction).

The Banach Fixed Point Theorem

Contraction Mappings

Let (X,d) open paren X comma d close paren be a metric space. A function f:X→X f colon X right arrow X is a contraction if there exists 0≤L<1 0 is less than or equal to L is less than 1 such that d⁡(f⁡(x),f⁡(y))≤L⁢d⁡(x,y)⁢for all ⁢x,y∈X d of open paren f of x comma f of y close paren is less than or equal to L d of open paren x comma y close paren for all x comma y is a member of X.

Such a map strictly shrinks distances.

Theorem (Banach)

If (X,d) open paren X comma d close paren is complete and f f is a contraction, then:

  1. There exists a unique fixed point x∗∈X x raised to the asterisk power is a member of X.

  2. For any x0∈X x sub 0 is a member of X, the iteration xn+1=f⁡(xn) x sub n plus 1 equals f of open paren x sub n close paren converges to x∗ x raised to the asterisk power.

  3. The error satisfies d⁡(xn,x∗)≤Ln1−L⁢d⁡(x1,x0) d of open paren x sub n comma x raised to the asterisk power close paren is less than or equal to the fraction with numerator L to the n-th power and denominator 1 minus L d of open paren x sub 1 comma x sub 0 close paren.

Completeness ensures the iterative sequence converges; the contraction property guarantees both existence and uniqueness. This theorem is constructive and algorithmic.

The Brouwer Fixed Point Theorem

Statement

If K⊂Rn K subset of R to the n-th power is nonempty, compact, and convex, and f:K→K f colon K right arrow K is continuous, then f f has at least one fixed point.

No metric contraction is required. The theorem guarantees existence only.

One-Dimensional Case

For f:[0,1]→[0,1] f colon open bracket 0 comma 1 close bracket right arrow open bracket 0 comma 1 close bracket, define g⁡(x)=f⁡(x)−x g of x equals f of x minus x. Since
g⁡(0)≥0 g of 0 is greater than or equal to 0 and g⁡(1)≤0 g of 1 is less than or equal to 0, the intermediate value theorem yields g⁡(x∗)=0 g of open paren x raised to the asterisk power close paren equals 0.

In higher dimensions, the proof relies on topological arguments (nonexistence of a retraction from a ball to its boundary).

The Schauder Fixed Point Theorem

Brouwer does not extend directly to infinite dimensions because closed bounded sets are not compact in normed spaces.

Statement

Let C C be a closed convex subset of a Banach space. If f:C→C f colon C right arrow C is continuous and f⁡(C) f of C is relatively compact, then f f has a fixed point.

This theorem is essential for proving existence of solutions to integral and differential equations.

The Tarski Fixed Point Theorem

This result operates in order-theoretic rather than metric or topological settings.

Statement

If L L is a complete lattice and f:L→L f colon L right arrow L is order-preserving, then:

  • The set of fixed points is nonempty.

  • It forms a complete lattice.

  • There exist least and greatest fixed points.

Tarski’s theorem is foundational in logic and theoretical computer science.

The Kakutani Fixed Point Theorem

This generalizes Brouwer to set-valued maps.

Statement

Let K⊂Rn K subset of R to the n-th power be nonempty, compact, convex.
Let F:K→2K F colon K right arrow 2 to the K power be upper hemicontinuous with nonempty, convex values.
Then there exists x∗∈K x raised to the asterisk power is a member of K such that x∗∈F⁡(x∗) x raised to the asterisk power is a member of F of open paren x raised to the asterisk power close paren.

Kakutani’s theorem underpins Nash’s proof of equilibrium existence.

Applications

Differential Equations

The Picard–Lindelöf theorem uses Banach’s theorem. The initial value problem y′⁢(t)=f⁡(t,y),y⁡(t0)=y0 y prime times t equals f of open paren t comma y close paren comma y of open paren t sub 0 close paren equals y sub 0 is rewritten as y⁡(t)=y0+∫t0tf⁡(s,y⁡(s))⁢ds, y of t equals y sub 0 plus the integral from t sub 0 to t of f of open paren s comma y of s close paren d s comma and solutions are fixed points of the integral operator.

Game Theory

Nash equilibria arise as fixed points of best-response correspondences; existence follows from Kakutani’s theorem.

Numerical Methods

Iterative schemes xn+1=f⁡(xn) x sub n plus 1 equals f of open paren x sub n close paren converge if f f is a contraction. Error bounds follow directly from Banach’s theorem.

Economic Equilibrium

General equilibrium models rely on fixed point theorems (typically Kakutani or Brouwer) to prove existence of price equilibria.

Comparison

  • Banach: Metric structure + plus contraction. Existence, uniqueness, algorithm, rate.

  • Brouwer: Compact convex sets in finite dimensions. Existence only.

  • Schauder: Infinite-dimensional extension with compactness.

  • Tarski: Order-theoretic framework; lattice structure of fixed points.

  • Kakutani: Set-valued generalization; crucial in economics and game theory.

Summary

Fixed point theory provides general existence principles across analysis and applied mathematics. Contraction-based results give constructive solutions with quantitative convergence. Topological theorems provide nonconstructive existence guarantees under compactness and convexity. Together, they form a central structural tool in modern mathematics.