LLMpediaThe first transparent, open encyclopedia generated by LLMs

Banach fixed-point theorem

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Expansion Funnel Raw 41 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted41
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Banach fixed-point theorem
NameBanach fixed-point theorem
FieldFunctional analysis, Metric space
ApplicationsDifferential equation, Numerical analysis, Computer science
StatementExistence and uniqueness of a fixed point for a contraction mapping
Proven1922
AuthorStefan Banach

Banach fixed-point theorem The Banach fixed-point theorem gives conditions ensuring a unique fixed point for self-maps on complete metric spaces and provides an explicit iterative method to approximate it, influencing Functional analysis, Differential equation, Approximation theory and algorithms in Computer science. The result underpins convergence proofs used by researchers in Topology, Measure theory, Operator theory and engineers working on Control theory, and it motivated later developments by figures associated with Hilbert space theory and institutions like the Polish Academy of Sciences.

Statement

Let (X, d) be a complete metric space and let T: X → X be a mapping satisfying a contraction condition: there exists 0 ≤ c < 1 such that d(T(x), T(y)) ≤ c d(x, y) for all x, y in X. Then T has a unique fixed point x* in X (T(x*) = x*), and for any x0 in X the sequence x_{n+1} = T(x_n) converges to x* with geometric rate bounded by c^n d(x1, x0). The theorem is a foundational result in Metric space analysis and is used in theories developed by contemporaries and successors associated with Lviv School of Mathematics, Stefan Banach, and institutions like the Jagiellonian University.

Proof

The standard proof constructs the Picard iterates x_{n+1} = T(x_n) and shows the sequence is Cauchy using the contraction constant c: d(x_n, x_m) ≤ c^n/(1−c) d(x1, x0) for m > n, hence convergence in the complete space (X, d) to some x*. Continuity of T (implicit from the contraction condition) yields T(x*) = x*, and uniqueness follows because if y* were another fixed point then d(x*, y*) = d(T(x*), T(y*)) ≤ c d(x*, y*) implies x* = y*. This elementary argument was honed in the milieu of early 20th-century analysts associated with Stefan Banach and colleagues at the University of Lviv and influenced methods in Ernst Zermelo-related fixed-point discussions.

Examples and applications

Classical examples include solving linear equations via contractions induced by matrices with spectral radius < 1, iterative methods for ordinary differential equations where the Picard–Lindelöf operator is a contraction on a Banach space, and root-finding schemes such as fixed-point iterations in numerical analysis practiced in École Polytechnique-influenced curricula. Applications extend to proving existence and uniqueness of solutions for initial value problems employed by analysts who published in journals tied to the Polish Mathematical Society and to constructing invariant manifolds in dynamical systems work connected to researchers from Princeton University and University of Göttingen. In computer science the contraction mapping principle supports correctness and convergence proofs for semantics of recursive definitions studied by scholars at Bell Labs and in monograph series from Springer Science+Business Media.

The Banach fixed-point theorem inspired a spectrum of generalizations and related results, including the Brouwer fixed-point theorem developed in contexts linked to Luitzen Brouwer and the Lefschetz fixed-point theorem associated with Solomon Lefschetz; extensions to complete metric-like structures led to results by researchers in Nonlinear functional analysis and to variants such as the Krasnoselskii, Caristi and Nadler fixed-point theorems, with contributions traceable to authors affiliated with institutions like Moscow State University and University of California, Berkeley. Further developments connect to contraction principles in ordered Banach spaces used by mathematicians at the Institute of Mathematics of the Polish Academy of Sciences and to iterative approximation schemes in the lineage of David Hilbert and John von Neumann.

Historical context and attribution

The theorem was formulated and proved by Stefan Banach in the early 1920s during his work in the Polish mathematical community centered in Lwów (Lviv), with dissemination through publications and lectures associated with the emerging Polish School of Mathematics. Its reception intersected with contemporaneous fixed-point investigations by Luitzen Brouwer and algebraic topologists such as Henri Poincaré who influenced the broader fixed-point dialogue in Europe and North America. Subsequent pedagogical and research adoption spread through institutions like Cambridge University, University of Chicago and professional societies including the American Mathematical Society.

Category:Fixed-point theorems Category:Functional analysis Category:Theorems in topology