Operator theory Nonlinear operators and fixed points Theorem
Kakutani fixed-point theorem
Builds on Convex setCompact setClosed set
Statement
Let and let be a nonempty compact convex set. Let be a set-valued map that assigns to each a subset , such that:
- is nonempty and convex for every ;
- the graph is a closed set.
Then has a fixed point: there is with .
Remarks
When each is a single point , the graph is closed exactly when is continuous, and the theorem becomes the Brouwer fixed-point theorem. The usual proof approximates by continuous maps on finer and finer triangulations of a simplex containing . It applies Brouwer's theorem to these maps and passes to a limit using the closed graph and the convex values.
Convex values are needed. On , let for , and for . The graph is , which is closed, but no lies in ; the value is not convex.
Example: consider a two-player game with mixed strategy sets and , which are simplices. Let be the set of best replies of player 1 to the strategy of player 2, and define in the same way. On , let . Its values are nonempty and convex and its graph is closed, so it has a fixed point, which is a Nash equilibrium.
Going deeper
For a student
Nash used the theorem in his proof of the existence of equilibria in finite games, and it is basic in general equilibrium theory in economics. The closed graph condition is a form of upper hemicontinuity, which is equivalent to it when the values are closed in a compact . The Kakutani–Glicksberg–Fan theorem extends the result to compact convex subsets of locally convex spaces, just as Schauder and Tychonoff extend Brouwer's theorem.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Closed set concept
- Compact set concept
- Convex set concept
- Kakutani fixed-point theorem statement
Further reading
About this page
| Tag | 7V3HWGR32Z |
|---|---|
| URI | m2://7V3HWGR32Z |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 47H10, 47H04, 54H25 |
| Status | This copy of the site has no build data. Run m2 status 7V3HWGR32Z. |
| About | Convex set |
| Uses | Convex set, Compact set, Closed set |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.