View source for Kakutani fixed-point theorem

In [[mathematical analysis]], the '''Kakutani fixed-point theorem''' is a [[fixed-point theorem]] for [[set-valued function]]s. It provides [[sufficient condition]]s for a set-valued function defined on a [[convex set|convex]], [[compact set|compact]] subset of a [[Euclidean space]] to have a [[fixed point (mathematics)|fixed point]], i.e. a point which is [[map (mathematics)|map]]ped to a set containing it. The Kakutani fixed point theorem is a generalization of [[Brouwer fixed point theorem]]. The Brouwer fixed point theorem is a fundamental result in [[topology]] which proves the existence of fixed points for [[continuous function (topology)|continuous function]]s 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,<ref name="kakutani">
{{cite journal
  | last = Kakutani
  | first = Shizuo
  | authorlink = Shizuo Kakutani
  | title = A generalization of Brouwer’s fixed point theorem
  | journal = Duke Mathematical Journal
  | volume = 8
  | pages = 457–459
  | issue = 3
  | year = 1941
  | doi = 10.1215/S0012-7094-41-00838-4}}</ref> and was used by [[John Forbes Nash, Jr.|John Nash]] in his description of [[Nash equilibrium|Nash equilibria]].<ref name="nash"/> It has subsequently found widespread application in [[game theory]] and [[economics]].<ref>{{cite book
    | last = Border
    | first = Kim C.
    | title = Fixed Point Theorems with Applications to Economics and Game Theory
    | year = 1989
    | publisher = Cambridge University Press
    | isbn = 0-521-38808-2
  }}</ref>

==Statement==
Kakutani's theorem states:<ref name=Osborne>{{cite book |last=Osborne |first=Martin J. |author2link=Ariel Rubinstein |first2=Ariel |last2=Rubinstein |title=A Course in Game Theory |location=Cambridge, MA |publisher=MIT |year=1994 |pages= |isbn= }}</ref>
: ''Let'' ''S'' ''be a [[empty set|non-empty]], [[compact set|compact]] and [[convex set|convex]] [[subset]] of some [[Euclidean space]]'' '''R'''<sup>''n''</sup>. 
:''Let'' ''φ'':&nbsp;''S''&nbsp;→&nbsp;2<sup>''S''</sup> ''be a [[set-valued function]] on'' ''S'' ''with the following properties:''
:* ''φ has a'' ''a [[closed graph]];''
:* ''φ''(''x'') ''is non-empty and convex for all'' ''x''&nbsp;∈&nbsp;''S''.
:''Then'' ''φ'' ''has a [[fixed point (mathematics)|fixed point]].''

==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 (mathematics)|function]] from ''X'' to the [[power set]] of ''Y'', written as ''φ'':&nbsp;''X''&nbsp;→&nbsp;2<sup>''Y''</sup>, such that ''φ''(''x'') is non-empty for every <math>x \in X</math>.  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 φ:&nbsp;''X''&nbsp;→&nbsp;2<sup>''Y''</sup> is said to have a '''closed graph''' if the set {(''x'',''y'')&nbsp;|&nbsp;''y''&nbsp;∈&nbsp;''φ''(''x'')} is a [[closed set|closed]] subset of ''X''&nbsp;×&nbsp;''Y'' in the [[product topology]] i.e. for all sequences <math>\{x_n\}_{n\in \mathbb{N}}</math> and <math>\{y_n\}_{n\in \mathbb{N}}</math> such that <math>x_n\to x</math>, <math>y_{n}\to y</math> and <math>y_{n}\in \varphi(x_n)</math> for all <math>n</math>, we have <math>y\in \varphi(x)</math>.
;Fixed point: Let φ:&nbsp;''X''&nbsp;→&nbsp;2<sup>''X''</sup> be a set-valued function. Then ''a''&nbsp;∈&nbsp;''X'' is a '''fixed point''' of ''φ'' if ''a''&nbsp;∈&nbsp;''φ''(''a'').

==Examples==
[[File:Kakutani.svg|thumb|150px|Fixed points for ''φ''(x)=[1−''x''/2,&nbsp;1−''x''<nowiki>/4]</nowiki>]]

=== A function with infinitely many fixed points ===

The function: <math>
\varphi(x)=
[1-x/2, ~1-x/4]
</math>, 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 (dotted line in red) which intersects the graph of the function (shaded in grey) is a fixed point, so in fact there is an infinity of fixed points in this particular case. For example, ''x''&nbsp;=&nbsp;0.72 (dashed line in blue) is a fixed point since 0.72&nbsp;∈&nbsp;[1&nbsp;−&nbsp;0.72/2,&nbsp;1&nbsp;−&nbsp;0.72/4].{{clear}}<!--Stops image from floating past-->

=== A function with a unique fixed point ===
The function:

<math>
\varphi(x)=
\begin{cases}
3/4           & 0 \le x < 0.5 \\
(0,1)         & x = 0.5 \\
1/4           & 0.5 < x \le 1
\end{cases}
</math>

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 (0,1).

===A function that does not satisfy convexity===
[[File:Kakutani non.svg|thumb|150px|A function without fixed points]]The requirement that ''φ''(''x'') be convex for all ''x'' is essential for the theorem to hold.

Consider the following function defined on [0,1]:
:<math>
\varphi(x)=
\begin{cases}
3/4           & 0 \le x < 0.5 \\
\{ 3/4, 1/4 \}  & x = 0.5 \\
1/4           & 0.5 < x \le 1
\end{cases}
</math>
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.
{{clear}}<!--Stops image from floating past-->

=== A function that does not satisfy close graph ===
Consider the following function defined on [0,1]:

:<math>
\varphi(x)=
\begin{cases}
3/4           & 0 \le x < 0.5 \\
1/4           & 0.5 \le x \le 1
\end{cases}
</math>

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 ''x<sub>n</sub>'' = 0.5 - 1/''n'',  ''y<sub>n</sub>'' = 3/4.
==Alternative statement==
Some sources, including Kakutani's original paper, use the concept of [[Hemicontinuity#Upper hemicontinuity|upper hemicontinuity]] while stating the theorem:
:''Let'' ''S'' ''be a [[empty set|non-empty]], [[compact set|compact]] and [[convex set|convex]] [[subset]] of some [[Euclidean space]]'' '''R'''<sup>''n''</sup>. ''Let'' ''φ'':&nbsp;''S''→2<sup>''S''</sup> ''be an [[Hemicontinuity#Upper hemicontinuity|upper hemicontinuous]] [[set-valued function]] on'' ''S'' ''with the property that'' ''φ''(''x'') ''is non-empty, closed, and convex for all'' ''x''&nbsp;∈&nbsp;''S''. ''Then'' ''φ'' ''has a [[fixed point (mathematics)|fixed point]].''

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,<ref name="aliprantis"/> which says that for a compact [[Hausdorff space|Hausdorff]] range space ''Y'', a set-valued function ''φ'':&nbsp;''X''→2<sup>''Y''</sup> has a closed graph if and only if it is upper hemicontinuous and ''φ''(''x'') is a closed set for all ''x''. Since all [[Euclidean space]]s are Hausdorff (being [[metric space]]s) 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==
{{See also|Mathematical economics}}

===Game theory===
{{See also|Game theory}}
The Kakutani fixed point theorem can be used to prove the [[Minimax#Minimax theorem|minimax theorem]] in the theory of [[zero-sum game]]s. This application was specifically discussed by Kakutani's original paper.<ref name="kakutani"/>

Mathematician [[John Forbes Nash|John Nash]] used the Kakutani fixed point theorem to prove a major result in [[game theory]].<ref name="nash">
{{cite journal
  | last = Nash
  | first = J.F., Jr.
  | authorlink = John Forbes Nash
  | title = Equilibrium Points in N-Person Games
  | journal = Proc. Natl. Acad. Sci. U.S.A.
  | volume = 36
  | pages = 48–49
  | year = 1950
  | doi = 10.1073/pnas.36.1.48
  | pmid = 16588946
  | issue = 1
  | pmc = 1063129 }}</ref> Stated informally, the theorem implies the existence of a [[Nash equilibrium]] in every finite game with mixed strategies for any number of players. This work later earned him a [[Nobel Prize in Economics]]. In this case:

* The base set ''S'' is the set of [[tuple]]s of [[mixed strategy|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 '''''R'''''<sup>''k''</sup>''.''  Then, ''S'' is the cartesian product of all these simplices. It is indeed a nonempty, compact and convex subset of '''''R'''''<sup>''kn''</sup>''.''
* The function φ(''x'') 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'', φ(''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===
{{See also|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.<ref>
{{cite book
    | last = Starr
    | first = Ross M.
    | authorlink = Ross Starr
    | title = General Equilibrium Theory
    | year = 1997
    | publisher = Cambridge University Press
    | url = https://books.google.com/?id=Lv3VtS9CcAoC&pg
    | isbn = 978-0-521-56473-1
  }}</ref> The existence of such prices had been an open question in economics going back to at least [[Léon Walras|Walras]]. The first proof of this result was constructed by [[Lionel McKenzie]].<ref>{{cite journal |first=Lionel |last=McKenzie |title=On Equilibrium in Graham's Model of World Trade and Other Competitive Systems |journal=[[Econometrica]] |volume=22 |issue=2 |year=1954 |pages=147–161 |doi=10.2307/1907539 }}</ref>

In this case:

* The base set ''S'' is the set of [[tuple]]s of commodity prices.
* The function φ(''x'') 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===
{{See also|Fair cake-cutting}}
Kakutani's fixed-point theorem is used in proving the existence of cake allocations that are both [[envy-free cake-cutting|envy-free]] and [[Pareto efficient]]. This result is known as [[Weller's theorem]].

==Proof outline==

===''S'' = <nowiki>[0,1]</nowiki>===
The proof of Kakutani's theorem is simplest for set-valued functions defined over [[interval (mathematics)|closed intervals]] of the real line. However, the proof of this case is instructive since its general strategy can be carried over to the higher-dimensional case as well.

Let φ: <nowiki>[0,1]</nowiki>→2<sup><nowiki>[0,1]</nowiki></sup> be a [[set-valued function]] on the closed interval <nowiki>[0,1]</nowiki> which satisfies the conditions of Kakutani's fixed-point theorem.

* '''Create a sequence of subdivisions of <nowiki>[0,1]</nowiki> with adjacent points moving in opposite directions.'''
Let (''a''<sub>''i''</sub>, ''b''<sub>''i''</sub>, ''p''<sub>''i''</sub>, ''q''<sub>''i''</sub>) for ''i'' = 0, 1, … be a [[sequence]] with the following properties:
:{|class="wikitable"
|-
|'''1.'''||width="50%"|1 ≥ ''b''<sub>i</sub> &gt; ''a''<sub>''i''</sub> ≥ 0
|'''2.'''||width="40%"|(''b''<sub>''i''</sub> − ''a''<sub>''i''</sub>) ≤ 2<sup>−''i''</sup>
|-
|'''3.'''||''p''<sub>''i''</sub> ∈ φ(''a''<sub>''i''</sub>)
|'''4.'''||''q''<sub>''i''</sub> ∈ φ(''b''<sub>''i''</sub>)
|-
|'''5.'''||''p''<sub>''i''</sub> ≥ ''a''<sub>''i''</sub>
|'''6.'''||''q''<sub>''i''</sub> ≤ ''b''<sub>''i''</sub>
|}

Thus, the closed intervals <nowiki>[</nowiki>''a''<sub>''i''</sub>, ''b''<sub>''i''</sub><nowiki>]</nowiki> form a sequence of subintervals of <nowiki>[0,1]</nowiki>. Condition (2) tells us that these subintervals continue to become smaller while condition (3)–(6) 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 ''a''<sub>0</sub> = 0 and ''b''<sub>0</sub> = 1. Let ''p''<sub>0</sub> be any point in φ(0) and ''q''<sub>0</sub> be any point in φ(1). Then, conditions (1)–(4) are immediately fulfilled. Moreover, since ''p''<sub>0</sub> ∈ φ(0) ⊂ <nowiki>[0,1]</nowiki>, it must be the case that ''p''<sub>0</sub> ≥ 0 and hence condition (5) is fulfilled. Similarly condition (6) is fulfilled by ''q''<sub>0</sub>.

Now suppose we have chosen ''a''<sub>''k''</sub>, ''b''<sub>''k''</sub>, ''p''<sub>''k''</sub> and ''q''<sub>''k''</sub> satisfying (1)–(6). Let,
:''m'' = (''a''<sub>''k''</sub>+''b''<sub>''k''</sub>)/2.
Then ''m'' ∈ <nowiki>[0,1]</nowiki> because <nowiki>[0,1]</nowiki> is [[convex set|convex]].

If there is a ''r'' ∈ φ(''m'') such that ''r'' ≥ ''m'', then we take,
:''a''<sub>''k''+1</sub> = ''m''
:''b''<sub>''k''+1</sub> = ''b''<sub>''k''</sub>
:''p''<sub>''k''+1</sub> = ''r''
:''q''<sub>''k''+1</sub> = ''q''<sub>''k''</sub>
Otherwise, since φ(''m'') is non-empty, there must be a ''s'' ∈ φ(''m'')  such that ''s'' ≤ ''m''. In this case let,
:''a''<sub>''k''+1</sub> = ''a''<sub>''k''</sub>
:''b''<sub>''k''+1</sub> = ''m''
:''p''<sub>''k''+1</sub> = ''p''<sub>''k''</sub>
:''q''<sub>''k''+1</sub> = ''s''.
It can be verified that ''a''<sub>''k''+1</sub>, ''b''<sub>''k''+1</sub>, ''p''<sub>''k''+1</sub> and ''q''<sub>''k''+1</sub> satisfy conditions (1)–(6).

* '''Find a limiting point of the subdivisions.'''
The [[cartesian product]] <nowiki>[0,1]</nowiki>×<nowiki>[0,1]</nowiki>×<nowiki>[0,1]</nowiki>×<nowiki>[0,1]</nowiki> is a [[compact set]] by [[Tychonoff's theorem]]. Since the sequence (''a''<sub>''n''</sub>, ''p''<sub>''n''</sub>, ''b''<sub>''n''</sub>, ''q''<sub>''n''</sub>) lies in this compact set, it must have a [[limit of a sequence|convergent]] [[subsequence]] by the [[Bolzano-Weierstrass theorem]]. Let's fix attention on such a subsequence and let its limit be (''a''*, ''p''*,''b''*,''q''*). Since the graph of φ is closed it must be the case that ''p''* ∈ φ(''a''*) and ''q''* ∈ φ(''b''*). Moreover, by condition (5), ''p''* ≥ ''a''* and by condition (6), ''q''* ≤ ''b''*.

But since (''b''<sub>''i''</sub> − ''a''<sub>''i''</sub>) ≤ 2<sup>−''i''</sup> by condition (2),
:''b''* − ''a''* = (lim ''b''<sub>''n''</sub>) − (lim ''a''<sub>''n''</sub>) = lim (''b''<sub>''n''</sub> − ''a''<sub>''n''</sub>) = 0.
So, ''b''* equals ''a''*. Let ''x'' = ''b''* = ''a''*.

Then we have the situation that

:φ(''x'') ∋ ''q''* ≤ ''x'' ≤ ''p''* ∈ φ(''x'').

* '''Show that the limiting point is a fixed point.'''
If ''p''* = ''q''* then ''p''* = ''x'' = ''q''*. Since ''p''* ∈ φ(''x''), ''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 (1-t)a + tb.  Using our finding above that q<x<p, we can create such a line between p and q as a function of x (notice the fractions below are on the unit interval).  By a convenient writing of x, and since φ(''x'') is [[convex set|convex]] and
:<math>x=\left(\frac{x-q^*}{p^*-q^*}\right)p^*+\left(1-\frac{x-q^*}{p^*-q^*}\right)q^*</math>
it once again follows that ''x'' must belong to φ(''x'') since ''p''* and ''q''* do and hence ''x'' is a fixed point of φ.

===''S'' is a ''n''-simplex===
In dimensions greater one, [[simplex|''n''-simplices]] are the simplest objects on which Kakutani's theorem can be proved. Informally, a ''n''-simplex is the higher-dimensional version of a triangle. Proving Kakutani's theorem for set-valued function defined on a simplex is not essentially different from proving it for intervals. The additional complexity in the higher-dimensional case exists in the first step of chopping up the domain into finer subpieces:
* Where we split intervals into two at the middle in the one-dimensional case, [[barycentric subdivision]] is used to break up a simplex into smaller sub-simplices.
* While in the one-dimensional case we could use elementary arguments to pick one of the half-intervals in a way that its end-points were moved in opposite directions, in the case of simplices the [[combinatorics|combinatorial]] result known as [[Sperner's lemma]] is used to guarantee the existence of an appropriate subsimplex.

Once these changes have been made to the first step, the second and third steps of finding a limiting point and proving that it is a fixed point are almost unchanged from the one-dimensional case.

===Arbitrary ''S''===
Kakutani's theorem for n-simplices can be used to prove the theorem for an arbitrary compact, convex ''S''. Once again we employ the same technique of creating increasingly finer subdivisions. But instead of triangles with straight edges as in the case of n-simplices, we now use triangles with curved edges. In formal terms, we find a simplex which covers ''S'' and then move the problem from ''S'' to the simplex by using a [[deformation retract]]. Then we can apply the already established result for n-simplices.

==Infinite-dimensional generalizations==
Kakutani's fixed-point theorem was extended to infinite-dimensional [[locally convex topological vector space]]s by [[Irving Glicksberg]]<ref>
{{cite journal
  | last = Glicksberg
  | first = I.L.
  | title = A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium
  | journal = Proceedings of the American Mathematical Society
  | volume = 3
  | issue = 1
  | pages = 170–174
  | year = 1952
  | doi = 10.2307/2032478
  | jstor = 2032478| url = http://www.dtic.mil/get-tr-doc/pdf?AD=AD0603907
  }}</ref>
and [[Ky Fan]].<ref>
{{cite journal
  | last = Fan
  | first = Ky
  | title = Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
  | journal = Proc Natl Acad Sci U S A
  | volume = 38
  | issue = 2
  | pages = 121–126
  | year = 1952
  | doi = 10.1073/pnas.38.2.121
  | pmid = 16589065
  | pmc = 1063516}}</ref>
To state the theorem in this case, we need a few more definitions:
;Upper hemicontinuity: A set-valued function φ:&nbsp;''X''→2<sup>''Y''</sup> is '''[[upper hemicontinuous]]''' if for every [[open set]] ''W''&nbsp;⊂&nbsp;''Y'', the set {''x''|&nbsp;φ(''x'')&nbsp;⊂&nbsp;''W''} is open in ''X''.<ref name="dugundji">
{{cite book
    | last = Dugundji
    | first = James
    | authorlink = James Dugundji
    |author2=Andrzej Granas
    | title = Fixed Point Theory
    | year = 2003
    | publisher = Springer
    | chapter = Chapter II, Section 5.8
    | url = https://books.google.com/?id=4_iJAoLSq3cC
    | format = limited preview
    | isbn = 978-0-387-00173-9
  }}</ref>
;Kakutani map: Let ''X'' and ''Y'' be [[topological vector space]]s and φ:&nbsp;''X''→2<sup>''Y''</sup> be a set-valued function. If ''Y'' is convex, then φ is termed a '''Kakutani map''' if it is upper hemicontinuous and φ(''x'') is non-empty, compact and convex for all ''x''&nbsp;∈&nbsp;''X''.<ref name="dugundji"/>

Then the Kakutani–Glicksberg–Fan theorem can be stated as:<ref name="dugundji"/>
:''Let S be a [[empty set|non-empty]], [[compact set|compact]] and [[convex set|convex]] [[subset]] of a [[Hausdorff space|Hausdorff]] [[locally convex topological vector space]]. Let φ:&nbsp;S→2<sup>S</sup> be a Kakutani map. Then φ has a fixed point.''

The corresponding result for single-valued functions is the [[Tychonoff fixed-point theorem]].

There is another version that the statement of the theorem becomes the same as that in the [[Euclidean space|Euclidean]] case:<ref name="aliprantis">
{{cite book
    | last = Aliprantis
    | first = Charlambos
    |author2=Kim C. Border
    | title = Infinite Dimensional Analysis: A Hitchhiker's Guide
    | year = 1999
    | publisher = Springer
    | edition = 3rd
    | chapter = Chapter 17
    | url = 
    }}</ref>

:''Let S be a [[empty set|non-empty]], [[compact set|compact]] and [[convex set|convex]] [[subset]] of a  [[Locally convex topological vector space|locally convex]] [[Hausdorff space]]. Let φ:&nbsp;S→2<sup>S</sup> be a [[set-valued function]] on S which has a closed graph and the property that φ(x) is non-empty and convex for all x&nbsp;∈&nbsp;S. Then the set of [[fixed point (mathematics)|fixed points]] of φ is non-empty and compact.''

==Anecdote==
In his game theory textbook,<ref>{{cite book |last=Binmore |first=Ken |title=Playing for Real: A Text on Game Theory |year=2007 |publisher=Oxford University Press |edition=1st |chapter=When Do Nash Equilibria Exist? |page=256 |chapterurl=https://books.google.com/books?id=NycDSDcmSM4C&pg=PA256 }}</ref> [[Ken Binmore]] recalls that Kakutani once asked him at a conference why so many economists had attended his talk. When Binmore told him that it was probably because of the Kakutani fixed point theorem, Kakutani was puzzled and replied, "What is the Kakutani fixed point theorem?"

==References==
{{Reflist|30em}}

==Further reading==
* {{cite book
    | last = Border
    | first = Kim C.
    | title = Fixed Point Theorems with Applications to Economics and Game Theory
    | year = 1989
    | publisher = Cambridge University Press
  }} <small>(Standard reference on fixed-point theory for economists. Includes a proof of Kakutani's theorem.)</small>
* {{cite book
    | last = Dugundji
    | first = James
    | authorlink = James Dugundji
    |author2=Andrzej Granas
    | title = Fixed Point Theory
    | year = 2003
    | publisher = Springer
  }} <small>(Comprehensive high-level mathematical treatment of fixed point theory, including the infinite dimensional analogues of Kakutani's theorem.)</small>
* {{cite book
    | last = Arrow
    | first = Kenneth J.
    | authorlink = Kenneth Arrow
    |author2=F. H. Hahn
    | title = General Competitive Analysis
    | url = https://archive.org/details/generalcompetiti0000arro
    | url-access = registration
    | year = 1971
    | publisher = Holden-Day
  }} <small>(Standard reference on [[general equilibrium]] theory. Chapter 5 uses Kakutani's theorem to prove the existence of equilibrium prices. Appendix C includes a proof of Kakutani's theorem and discusses its relationship with other mathematical results used in economics.)</small>

==External links==

* {{springer|title=Kakutani theorem|id=p/k055090}}

{{Functional Analysis}}

[[Category:Fixed-point theorems]]
[[Category:Theorems in convex geometry]]
[[Category:Theorems in topology]]
[[Category:General equilibrium theory]]