Fixed Point Theorems

Introduction

A fixed point of a function f is a point x such that f(x)=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) be a metric space. A function f:X→X is a contraction if there exists 0≤L<1 such that d(f(x),f(y))≤L*d(x,y)*for all *x,y∈X.

Such a map strictly shrinks distances.

Theorem (Banach)

If (X,d) is complete and f is a contraction, then:

1. There exists a unique fixed point (x^∗)∈X.

2. For any (x_0)∈X, the iteration (x_n+1)=f((x_n)) converges to (x^∗).

3. The error satisfies d((x_n),(x^∗))≤(Ln)/(1−L)*d((x_1),(x_0)).

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 is nonempty, compact, and convex, and f:K→K is continuous, then 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], define g(x)=f(x)−x. Since
g(0)≥0 and g(1)≤0, the intermediate value theorem yields g((x^∗))=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 be a closed convex subset of a Banach space. If f:C→C is continuous and f(C) is relatively compact, then 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 is a complete lattice and f:L→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 be nonempty, compact, convex.
Let F:K→2K be upper hemicontinuous with nonempty, convex values.
Then there exists (x^∗)∈K such that (x^∗)∈F((x^∗)).

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((t_0))=(y_0) is rewritten as y(t)=(y_0)+(∫_(t_0)^t)(f(s,y(s))*d(s)), 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 (x_n+1)=f((x_n)) converge if 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 + 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.