Fixed Point Theory

Description

When does an ordinary differential equation have a solution? When does a strategic game admit a stable strategy profile? When does a competitive market settle into an equilibrium of supply and demand? Despite their dramatic differences in subject matter, each of these questions can be recast as a single mathematical problem: the existence of a fixed point of some transformation \(T\), namely a point \(x^*\) satisfying

The study of when such points must exist, how to find them, and what they say about the systems they describe, is the subject of fixed-point theory, one of the most unifying ideas in modern mathematical analysis. Its results sit at the heart of analysis, topology, and the theory of differential equations, with applications reaching across geometry, game theory, economics, and optimisation.

This project introduces three foundational theorems of the subject, each capturing a fundamentally different style of argument. Banach's contraction-mapping theorem asserts that any map on a complete metric space that contracts distances has a unique fixed point, computable by simple iteration; this constructive result underlies the classical Picard–Lindelöf theorem for ODEs and the convergence theory of Newton's method. Brouwer's fixed-point theorem asserts that every continuous self-map of a closed ball in \(\mathbb{R}^n\) has at least one fixed point, an intuition extending from a stirred cup of coffee to John Nash's celebrated proof of the existence of equilibria in non-cooperative games. Schauder's theorem lifts Brouwer's result to maps on function spaces, unlocking existence theory for an enormous range of nonlinear problems, from classical integral equations to partial differential equations.

The aim of this project is to develop, from first principles, these three classical fixed-point theorems together with full proofs and canonical worked applications. Having built this foundational machinery, you will then be free to apply it in a follow-up direction tailored to your interests.

Possible follow-up directions

Possible directions include (but are not limited to):

• Existence theory for nonlinear PDEs. Build the analytical machinery of Sobolev spaces and weak formulations, then apply Schauder's theorem to prove existence for stationary quasi-linear elliptic equations. Optional extensions include time-dependent problems and the monotone operator framework, culminating in the Browder–Minty theorem as a compactness-free alternative.
• Beyond Banach, Brouwer, and Schauder. Begin with the Newton–Kantorovich method for rapid quantitative convergence in Banach spaces, then Kakutani's theorem for set-valued maps. Further extensions arise in algebraic topology (the Lefschetz fixed-point theorem, generalising Brouwer to compact manifolds) and in geometry (Hutchinson's theorem on iterated function systems, generating self-similar fractals).
• Game theory and economic equilibria. Begin with the application of Brouwer's theorem to Nash's existence proof for equilibria in finite non-cooperative games. Progress to Kakutani's theorem and its use in the Arrow–Debreu existence proof for general competitive equilibrium, a landmark result at the intersection of analysis, economics, and game theory.
• Numerical analysis. Apply Banach's theorem to study the convergence of iterative schemes, including Picard iteration and Newton's method. A natural extension is the analysis of finite element methods for nonlinear PDEs, where fixed-point arguments are used to prove the convergence of approximate solutions as the mesh is refined.

The tools used in this project come from across analysis, with particular emphasis on functional analysis and topology. A natural plan is for us to first develop the three classical fixed-point theorems and their canonical applications together, after which you are free to choose the direction in which to continue.

Mode of operation and evidence of learning

This project will revolve around learning through reading, with a focus on the underlying theory, mathematical rigour, and the development of deep conceptual understanding. You will demonstrate your understanding of the subject matter by solving relevant problems, exploring and constructing examples, investigating theoretical (and, if you wish, numerical) applications of the material, and clearly communicating it in both written and oral formats.

Prerequisites and companion modules

Prerequisites: Analysis III.

Optional prerequisite: Partial Differential Equations III.

Optional co-requisite: Functional Analysis and Applications IV.

Any further machinery we need, such as elements of functional analysis, basic topology, or the foundations of nonlinear PDE theory, will be developed together as we work through the foundational chapters of the project, at a pace tailored to your background.

Some resources

1. L. C. Evans. Partial Differential Equations. 2nd edition, Graduate Studies in Mathematics 19, American Mathematical Society, 2010.
2. E. Zeidler. Nonlinear Functional Analysis and its Applications, Volume I: Fixed-Point Theorems. Springer-Verlag, 1986.
3. K. C. Border. Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press, 1985.
4. D. Gilbarg and N. S. Trudinger. Elliptic Partial Differential Equations of Second Order. Reprint of the 1998 edition, Classics in Mathematics, Springer-Verlag, 2001.
5. S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods. 3rd edition, Texts in Applied Mathematics 15, Springer, 2008.