Kakutani fixed-point theorem


In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point which is mapped to a set containing it. The Kakutani fixed point theorem is a generalization of the Brouwer fixed point theorem. The Brouwer fixed point theorem is a fundamental result in topology which proves the existence of fixed points for continuous functions defined on compact, convex subsets of Euclidean spaces. Kakutani's theorem extends this to set-valued functions.
The theorem was developed by Shizuo Kakutani in 1941, and was used by John Nash in his description of Nash equilibria. It has subsequently found widespread application in game theory and economics.

Statement

Kakutani's theorem states:

Definitions

;Set-valued function: A set-valued function φ from the set X to the set Y is some rule that associates one or more points in Y with each point in X. Formally it can be seen just as an ordinary function from X to the power set of Y, written as φ: X → 2Y, such that φ is non-empty for every. Some prefer the term correspondence, which is used to refer to a function that for each input may return many outputs. Thus, each element of the domain corresponds to a subset of one or more elements of the range.
;Closed graph: A set-valued function φ: X → 2Y is said to have a closed graph if the set is a closed subset of X × Y in the product topology i.e. for all sequences and such that, and for all, we have.
;Fixed point: Let φ: X → 2X be a set-valued function. Then a ∈ X is a fixed point of φ if a ∈ φ.

Examples

A function with infinitely many fixed points

The function:, shown on the figure at the right, satisfies all Kakutani's conditions, and indeed it has many fixed points: any point on the 45° line which intersects the graph of the function is a fixed point, so in fact there is an infinity of fixed points in this particular case. For example, x = 0.72 is a fixed point since 0.72 ∈ .

A function with a unique fixed point

The function:
satisfies all Kakutani's conditions, and indeed it has a fixed point: x = 0.5 is a fixed point, since x is contained in the interval .

A function that does not satisfy convexity

The requirement that φ be convex for all x is essential for the theorem to hold.
Consider the following function defined on :
The function has no fixed point. Though it satisfies all other requirements of Kakutani's theorem, its value fails to be convex at x = 0.5.

A function that does not satisfy closed graph

Consider the following function defined on :
The function has no fixed point. Though it satisfies all other requirements of Kakutani's theorem, its graph is not closed; for example, consider the sequences xn = 0.5 - 1/n, yn = 3/4.

Alternative statement

Some sources, including Kakutani's original paper, use the concept of upper hemicontinuity while stating the theorem:
This statement of Kakutani's theorem is completely equivalent to the statement given at the beginning of this article.
We can show this by using the closed graph theorem for set-valued functions, which says that for a compact Hausdorff range space Y, a set-valued function φ: X→2Y has a closed graph if and only if it is upper hemicontinuous and φ is a closed set for all x. Since all Euclidean spaces are Hausdorff and φ is required to be closed-valued in the alternative statement of the Kakutani theorem, the Closed Graph Theorem implies that the two statements are equivalent.

Applications

Game theory

The Kakutani fixed point theorem can be used to prove the minimax theorem in the theory of zero-sum games. This application was specifically discussed by Kakutani's original paper.
Mathematician John Nash used the Kakutani fixed point theorem to prove a major result in game theory. Stated informally, the theorem implies the existence of a Nash equilibrium in every finite game with mixed strategies for any finite number of players. This work later earned him a Nobel Prize in Economics. In this case:
  • The base set S is the set of tuples of mixed strategies chosen by each player in a game. If each player has k possible actions, then each player's strategy is a k-tuple of probabilities summing up to 1, so each player's strategy space is the standard simplex in Rk. Then, S is the cartesian product of all these simplices. It is indeed a nonempty, compact and convex subset of Rkn.
  • The function φ associates with each tuple a new tuple where each player's strategy is her best response to other players' strategies in x. Since there may be a number of responses which are equally good, φ is set-valued rather than single-valued. For each x, φ is nonempty since there is always at least one best response. It is convex, since a mixture of two best-responses for a player is still a best-response for the player. It can be proved that φ has a closed graph.
  • Then the Nash equilibrium of the game is defined as a fixed point of φ, i.e. a tuple of strategies where each player's strategy is a best response to the strategies of the other players. Kakutani's theorem ensures that this fixed point exists.

    General equilibrium

In general equilibrium theory in economics, Kakutani's theorem has been used to prove the existence of set of prices which simultaneously equate supply with demand in all markets of an economy. The existence of such prices had been an open question in economics going back to at least Walras. The first proof of this result was constructed by Lionel McKenzie.
In this case:
  • The base set S is the set of tuples of commodity prices.
  • The function φ is chosen so that its result differs from its arguments as long as the price-tuple x does not equate supply and demand everywhere. The challenge here is to construct φ so that it has this property while at the same time satisfying the conditions in Kakutani's theorem. If this can be done then φ has a fixed point according to the theorem. Given the way it was constructed, this fixed point must correspond to a price-tuple which equates supply with demand everywhere.

    Fair division

Kakutani's fixed-point theorem is used in proving the existence of cake allocations that are both envy-free and Pareto efficient. This result is known as Weller's theorem.

Relation to Brouwer's fixed-point theorem

Brouwer's fixed-point theorem is a special case of Kakutani fixed-point theorem. Conversely, Kakutani fixed-point theorem is an immediate generalization via the approximate selection theorem:

Proof outline

''S'' = 0,1

The proof of Kakutani's theorem is simplest for set-valued functions defined over closed intervals of the real line. Moreover, the proof of this case is instructive since its general strategy can be carried over to the higher-dimensional case as well.
Let φ: →2 be a set-valued function on the closed interval which satisfies the conditions of Kakutani's fixed-point theorem.
  • Create a sequence of subdivisions of with adjacent points moving in opposite directions.
Let for i = 0, 1,... be a sequence with the following properties:
Thus, the closed intervals form a sequence of subintervals of . Condition tells us that these subintervals continue to become smaller while condition – tell us that the function φ shifts the left end of each subinterval to its right and shifts the right end of each subinterval to its left.
Such a sequence can be constructed as follows. Let a0 = 0 and b0 = 1. Let p0 be any point in φ and q0 be any point in φ. Then, conditions – are immediately fulfilled. Moreover, since p0 ∈ φ ⊂ , it must be the case that p0 ≥ 0 and hence condition is fulfilled. Similarly condition is fulfilled by q0.
Now suppose we have chosen ak, bk, pk and qk satisfying –. Let,
Then m ∈ because is convex.
If there is a r ∈ φ such that r ≥ m, then we take,
Otherwise, since φ is non-empty, there must be a s ∈ φ such that s ≤ m. In this case let,
It can be verified that ak+1, bk+1, pk+1 and qk+1 satisfy conditions –.
We have a pair of sequences of intervals, and we would like to show them to converge to a limiting point with the Bolzano-Weierstrass theorem. To do so, we construe these two interval sequences as a single sequence of points,. This lies in the cartesian product ×××, which is a compact set by Tychonoff's theorem. Since our sequence lies in a compact set, it must have a convergent subsequence by Bolzano-Weierstrass. Let's fix attention on such a subsequence and let its limit be. Since the graph of φ is closed it must be the case that p* ∈ φ and q* ∈ φ. Moreover, by condition, p* ≥ a* and by condition, q* ≤ b*.
But since ≤ 2−i by condition,
So, b* equals a*. Let x = b* = a*.
Then we have the situation that
  • Show that the limiting point is a fixed point.
If p* = q* then p* = x = q*. Since p* ∈ φ, x is a fixed point of φ.
Otherwise, we can write the following. Recall that we can parameterize a line between two points a and b by a + tb. Using our finding above that qfunction of x. By a convenient writing of x, and since φ is convex and
it once again follows that x must belong to φ since p* and q* do and hence x is a fixed point of φ.