Book contents
- Frontmatter
- Contents
- Preface
- 1 Introduction: models and mathematics
- 2 Convexity
- 3 Simplexes
- 4 Sperner's lemma
- 5 The Knaster-Kuratowski-Mazurkiewicz lemma
- 6 Brouwer's fixed point theorem
- 7 Maximization of binary relations
- 8 Variational inequalities, price equilibrium, and complementarity
- 9 Some interconnections
- 10 What good is a completely labeled subsimplex
- 11 Continuity of correspondences
- 12 The maximum theorem
- 13 Approximation of correspondences
- 14 Selection theorems for correspondences
- 15 Fixed point theorems for correspondences
- 16 Sets with convex sections and a minimax theorem
- 17 The Fan-Browder theorem
- 18 Equilibrium of excess demand correspondences
- 19 Nash equilibrium of games and abstract economies
- 20 Walrasian equilibrium of an economy
- 21 More interconnections
- 22 The Knaster-Kuratowski-Mazurkiewicz-Shapley lemma
- 23 Cooperative equilibria of games
- References
- Index
21 - More interconnections
Published online by Cambridge University Press: 16 January 2010
- Frontmatter
- Contents
- Preface
- 1 Introduction: models and mathematics
- 2 Convexity
- 3 Simplexes
- 4 Sperner's lemma
- 5 The Knaster-Kuratowski-Mazurkiewicz lemma
- 6 Brouwer's fixed point theorem
- 7 Maximization of binary relations
- 8 Variational inequalities, price equilibrium, and complementarity
- 9 Some interconnections
- 10 What good is a completely labeled subsimplex
- 11 Continuity of correspondences
- 12 The maximum theorem
- 13 Approximation of correspondences
- 14 Selection theorems for correspondences
- 15 Fixed point theorems for correspondences
- 16 Sets with convex sections and a minimax theorem
- 17 The Fan-Browder theorem
- 18 Equilibrium of excess demand correspondences
- 19 Nash equilibrium of games and abstract economies
- 20 Walrasian equilibrium of an economy
- 21 More interconnections
- 22 The Knaster-Kuratowski-Mazurkiewicz-Shapley lemma
- 23 Cooperative equilibria of games
- References
- Index
Summary
Von Neumann's Intersection Lemma (16.4) Implies Kakutani's Theorem (15.3) (Nikaido [1968, p. 70])
Let γ : K →→ K satisfy the hypotheses of 15.3 and set X = Y = K, E = Gr γ and set F equal to the diagonal of X × X. The hypotheses of 16.4 are then satisfied, and E ∩ F is equal to the set of fixed points of γ.
The Fan-Browder Theorem (17.1) Implies Kakutani's Theorem (15.3)
Let γ : K →→ K be convex-valued and closed and let μ(x) = {x} for each x. Then x ∈ γ(x) if and only if γ(x) ∩ μ(x) ≠ ø. Setting λ = 1, v = x and y = u ∈ γ(x), the hypotheses of 17.1 are satisfied. Thus the set of fixed points of γ is compact and nonempty.
Remark
In the hypotheses of Theorem 17.1 if γ(x) ∩ μ(x) ≠ ø, then we can take u = v and y = x. Thus if we associate to each x the set of y's given by the hypothesis, we are looking for a fixed point of the correspondence. This correspondence cannot be closed-valued however, since λ is required to be strictly positive. Thus we cannot use the Kakutani theorem to prove Theorem 17.1 in this fashion. Note that the proof of Theorem 17.1 depends only on Fan's lemma (7.4), which depends only on the K-K-M lemma (5.4), which can be proved from Sperner's lemma (4.1).
- Type
- Chapter
- Information
- Publisher: Cambridge University PressPrint publication year: 1985