If f: X → X is a contraction (∃c < 1 with d(f(x), f(y)) ≤ c·d(x,y)) on a complete metric space, then f has a unique fixed point and iterates converge to it.
You know that a complete metric space is one where every Cauchy sequence converges — there are no "missing" limit points. The Banach Fixed Point Theorem, also called the Contraction Mapping Theorem, is the payoff for that completeness: it guarantees existence and uniqueness of a fixed point when a map contracts distances uniformly. A contraction is a function f: X → X satisfying d(f(x), f(y)) ≤ c · d(x, y) for some constant c < 1 and all x, y in X. The constant c < 1 is the key — the map must bring every pair of points strictly closer together, by at least the same multiplicative factor.
The proof is an elegant iteration argument. Pick any starting point x₀ ∈ X and define xₙ₊₁ = f(xₙ). The sequence (x₀, x₁, x₂, ...) is a Cauchy sequence: each step reduces the distance by a factor of at most c, so the total remaining travel after step n is bounded by cⁿ/(1−c) · d(x₁, x₀), which goes to zero. Since X is complete, this Cauchy sequence converges to some limit x*. Taking limits in xₙ₊₁ = f(xₙ) and using continuity of f (which follows from the Lipschitz condition) gives x* = f(x*) — so x* is a fixed point. Uniqueness follows because if both x* and y* are fixed, then d(x*, y*) = d(f(x*), f(y*)) ≤ c · d(x*, y*), which forces d(x*, y*) = 0.
The beauty of this theorem is that it is simultaneously an existence theorem, a uniqueness theorem, and a constructive algorithm. You don't just know a fixed point exists — you know how to find it by iterating, and you know how quickly you converge (the error after n iterations is at most cⁿ/(1−c) · d(x₀, x₁)). This makes the Banach theorem one of the most useful results in applied mathematics.
Applications abound. Many differential equations can be rewritten as fixed-point problems of integral operators, and the contraction mapping theorem gives existence and uniqueness of solutions (this is the idea behind Picard's theorem for ODEs). Iterative algorithms in numerical analysis — Newton's method, successive approximations, certain root-finding schemes — can be analyzed as contraction mappings to prove convergence. In economics and game theory, Nash equilibria arise as fixed points of best-response maps. Whenever you see a self-referential system — "the solution satisfies an equation involving itself" — the contraction mapping theorem is the tool that says the self-reference has a unique resolution.
No topics depend on this one yet.