Math 2.0

Operator theory Nonlinear operators and fixed points Theorem

Kakutani fixed-point theorem

Builds on Convex setCompact setClosed set

Statement

Let n≥1n \ge 1 and let S⊆ℝnS \subseteq \R^n be a nonempty compact convex set. Let φ\varphi be a set-valued map that assigns to each x∈Sx \in S a subset φ(x)⊆S\varphi(x) \subseteq S, such that:

  1. φ(x)\varphi(x) is nonempty and convex for every x∈Sx \in S;
  2. the graph {(x,y)∈S×S:y∈φ(x)}\set{(x, y) \in S \times S : y \in \varphi(x)} is a closed set.

Then φ\varphi has a fixed point: there is x∈Sx \in S with x∈φ(x)x \in \varphi(x).

Remarks

When each φ(x)\varphi(x) is a single point f(x)f(x), the graph is closed exactly when ff is continuous, and the theorem becomes the Brouwer fixed-point theorem. The usual proof approximates φ\varphi by continuous maps on finer and finer triangulations of a simplex containing SS. 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 S=[0,1]S = [0, 1], let φ(x)={1}\varphi(x) = \set{1} for x<1/2x < 1/2, φ(1/2)={0,1}\varphi(1/2) = \set{0, 1} and φ(x)={0}\varphi(x) = \set{0} for x>1/2x > 1/2. The graph is [0,1/2]×{1}∪[1/2,1]×{0}[0, 1/2] \times \set{1} \cup [1/2, 1] \times \set{0}, which is closed, but no xx lies in φ(x)\varphi(x); the value φ(1/2)\varphi(1/2) is not convex.

Example: consider a two-player game with mixed strategy sets S1S_1 and S2S_2, which are simplices. Let B1(x2)⊆S1B_1(x_2) \subseteq S_1 be the set of best replies of player 1 to the strategy x2x_2 of player 2, and define B2(x1)⊆S2B_2(x_1) \subseteq S_2 in the same way. On S=S1×S2S = S_1 \times S_2, let φ(x1,x2)=B1(x2)×B2(x1)\varphi(x_1, x_2) = B_1(x_2) \times B_2(x_1). 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 SS. 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Closed set concept
  2. Compact set concept
  3. Convex set concept
  4. Kakutani fixed-point theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Kakutani_fixed-point_theorem
About this page
Tag7V3HWGR32Z
URIm2://7V3HWGR32Z
Kindstatement, theorem
WritingW0 stub
MSC47H10, 47H04, 54H25
StatusThis copy of the site has no build data. Run m2 status 7V3HWGR32Z.
AboutConvex set
UsesConvex set, Compact set, Closed set
Same as
Changed2 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.