Krein–Milman theorem

Given a convex shape K (light blue) and its set of extreme points B (red), the convex hull of B is K.

In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about convex sets in topological vector spaces. A particular case of this theorem, which can be easily visualized, states that given a convex polygon, one only needs the corners of the polygon to recover the polygon shape. The statement of the theorem is false if the polygon is not convex, as then there can be many ways of drawing a polygon having given points as corners.

Formally, let be a locally convex topological vector space (assumed to be Hausdorff), and let be a compact convex subset of . Then, the theorem states that is the closed convex hull of its extreme points.

The closed convex hull above is defined as the intersection of all closed convex subsets of that contain This turns out to be the same as the closure of the convex hull in the topological vector space. One direction in the theorem is easy; the main burden is to show that there are 'enough' extreme points.

The original statement proved by Mark Krein and David Milman was somewhat less general than this.

Hermann Minkowski had already proved that if is 3-dimensional then equals the convex hull of the set of its extreme points. This assertion was expanded to the case of any finite dimension by Ernst Steinitz. The Krein–Milman theorem generalizes this to arbitrary locally convex , with a caveat: the closure may be needed.

Relation to the axiom of choice

The axiom of choice, or some weaker version of it, is needed to prove this theorem in Zermelo–Fraenkel set theory. Conversely, this theorem together with the Boolean prime ideal theorem can prove the axiom of choice.[1]

Under the previous assumptions on if is a subset of and the closed convex hull of is all of , then every extreme point of belongs to the closure of This result is known as Milman's (partial) converse to the Krein–Milman theorem.

The Choquet–Bishop–de Leeuw theorem states that every point in is the barycenter of a probability measure supported on the set of extreme points of

More general settings

The assumption of local convexity for the ambient space is necessary, because James Roberts constructed a counter-example in 1977 for more general spaces.

The linearity is also needed, because the statement fails for weakly compact convex sets in CAT(0) spaces, as proved in 2016 by Nicolas Monod. However, Theo Buehler proved in 2006 that the Krein–Milman theorem does hold for metrically compact CAT(0) spaces.[2]

See also

References

  1. ↑ Bell, J.; Fremlin, David (1972). "A geometric form of the axiom of choice" (PDF). Fundamenta Mathematicae. 77 (2): 167–170. Retrieved 11 June 2018. Theorem 1.2. BPI [the Boolean Prime Ideal Theorem] & KM [Krein-Milman] ⇒ (*) [the unit ball of the dual of a normed vector space has an extreme point]…. Theorem 2.1. (*) ⇒ AC [the Axiom of Choice].
  2. ↑ Buehler, Theo (2006). "The Krein-Mil'man Theorem for Metric Spaces with a Convex Bicombing". arXiv:math/0604187.
  • M. Krein, D. Milman, On extreme points of regular convex sets, Studia Mathematica 9 (1940), 133–138.
  • Milman, D. (1947). Характеристика экстремальных точек регулярно-выпуклого множества [Characteristics of extremal points of regularly convex sets]. Doklady Akademii Nauk SSSR (in Russian). 57: 119–122.
  • H. Minkowski, Gesammelte Abhandlungen. Bd 2. Teubner, Leipzig, 1911 (see pp. 157–161).
  • N. Monod, Extreme points in non-positive curvature, Studia Mathematica 234 (2016), 265–270.
  • N. K. Nikol'skij (Ed.). Functional Analysis I. Springer-Verlag, 1992.
  • J. Roberts, A compact convex set with no extreme points, Studia Mathematica 60 (1977), 255–266.
  • H. L. Royden, Real Analysis. Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
  • E. Steinitz, Bedingt konvergente Reihen und konvexe Systeme. VI, VII, J. Reine Angew. Math. 146 (1916), 1-52 (see p. 16).

This article incorporates material from Krein–Milman theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.