For , write . Maximizing a linear functional on the price simplex gives
Thus is a nonempty closed convex face of the compact price simplex. Its graph of a set-valued mapping is closed: if , and , then, for every fixed , the inequalities pass to .
Each value is closed in by the closed-graph hypothesis, hence compact; it is nonempty and convex by assumption. Therefore has nonempty closed convex values in the nonempty compact convex set .
Its graph of a set-valued mapping is also closed. If and with and , the two closed-graph properties give and . Finally, this closed graph implies upper hemicontinuity because the whole output space is compact. If an open set containing failed to contain the nearby values, select outputs outside it along a convergent input sequence. A subsequence of those outputs converges in ; closedness puts its limit in , whereas closedness of the open set's complement puts it outside. This contradiction proves upper hemicontinuity.
Consequently all the hypotheses of the Kakutani fixed-point theorem hold: the domain is nonempty, compact and convex, and the set-valued mapping maps it into itself with nonempty closed convex values and upper hemicontinuity.

Articles by others on the same topic (0)

There are currently no matching articles.