The Shapley–Folkman theorem places an upper bound on the size of the non-convexities (loosely speaking, openings or holes) in a sum of non-convex sets in Euclidean N-dimensional space, RN. The bound is based on the size of nonconvexities in the sets summed and the dimension of the space. When the number of sets in the sum is large, the bound is independent of the number of sets summed, depending rather on N, the dimension of the space. Hence the size of the non-convexity in the sum becomes small as a proportion of the number of sets summed; the non-convexity per summand goes to zero as the number of summands becomes large. The Shapley–Folkman theorem can be viewed as a discrete counterpart to the Lyapunov theorem on non-atomic measures (Grodal 2002).
KeywordsLarge economies Lyapunov th Non-convexity Shapley–Folkman th
- Arrow, K.J., and F.H. Hahn. 1972. General competitive analysis. San Francisco: Holden-Day.Google Scholar
- Ekeland, I., and R. Temam. 1976. Convex analysis and variational problems. Amsterdam: North-Holland.Google Scholar
- Green, J., and W.P. Heller. 1981. Mathematical analysis and convexity with applications to economics. In Handbook of mathematical economics, ed. K.J. Arrow and M. Intriligator, vol. 1. Amsterdam: North-Holland.Google Scholar
- Grodal, B. 2002. The equivalence principle. In Optimization and Operation Research, Encyclopedia of Life Support Systems (EOLSS), ed. U. Derigs. Cologne. Online. Available at http://www.econ.ku.dk/grodal/EOLSS-final.pdf. Accessed 5 Apr 2007.
- Howe, R. 1979. On the tendency toward convexity of the vector sum of sets. Discussion Paper No. 538, Cowles Foundation, Yale University.Google Scholar
- Tardella, F. 1990. A new proof of the Lyapunov Convexity Theorem. Applied Mathematics 28: 478–481.Google Scholar
- Weil, W. 1982. An application of the central limit theorem for Banach space valued random variables to the theory of random sets. Probability Theory and Related Fields 60: 203–208.Google Scholar