- Krein–Milman theorem
In
mathematics , more precisely infunctional analysis , the Krein–Milman theorem is a statement aboutconvex set s. A particular case of thistheorem , which can be easily visualized, states that given a convexpolygon , 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 , and let be a compact convexsubset of . Then, the theorem states that is the closedconvex hull of itsextreme point s.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 andDavid Milman was somewhat less general than this.Relation to the axiom of choice
The
axiom of choice , or some weaker version of it, is needed to prove this theorem inZermelo–Fraenkel set theory . This theorem together with theBoolean prime ideal theorem , though, can prove the axiom of choice.Related results
Under the previous assumptions on if is a
subset of and the closed convex hull of is all of , then everyextreme 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 point s ofReferences
*M. Krein, D. Milman (
1940 ) "On extreme points of regular convex sets", Studia Mathematica 9 133–138.
* D. Milman (1947) "Characteristics of extremal points of regularly convex sets" (in Russian), Doklady Akad. Nauk SSSR (N.S.) 57 119–122
* H. L. Royden. "Real Analysis". Prentice-Hall, Englewood Cliffs, New Jersey, 1988.----
Wikimedia Foundation. 2010.