Krein–Milman theorem

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. 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 X {displaystyle X} be a locally convex topological vector space (assumed to be Hausdorff), and let K {displaystyle K} be a compact convex subset of X {displaystyle X} . Then, the theorem states that K {displaystyle K} 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 X {displaystyle X} that contain K . {displaystyle K.} 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 X {displaystyle X} is 3-dimensional then K {displaystyle K} 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 X {displaystyle X} , with a caveat: the closure may be needed. 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. Under the previous assumptions on K , {displaystyle K,} if T {displaystyle T} is a subset of K {displaystyle K} and the closed convex hull of T {displaystyle T} is all of K {displaystyle K} , then every extreme point of K {displaystyle K} belongs to the closure of T . {displaystyle T.} 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 K {displaystyle K} is the barycenter of a probability measure supported on the set of extreme points of K . {displaystyle K.} The assumption of local convexity for the ambient space is necessary, because James Roberts constructed a counter-example in 1977 for more general spaces.