Functional analysis Hahn-Banach and convexity Theorem
Krein–Milman theorem
Builds on Locally convex spaceConvex setCompact setExtreme pointConvex hullClosure
Statement
Let be a Hausdorff locally convex space over or , and let be a nonempty compact convex set. Then has at least one extreme point. Moreover, is the closure of the convex hull of the set of its extreme points:
Remarks
Call a nonempty closed subset a face if every open segment of that meets has both endpoints in . By Zorn's lemma and compactness, every face contains a minimal face. A minimal face is a single point, since otherwise a continuous functional that separates two of its points would cut out a smaller face; that point is extreme. If were smaller than , the Hahn–Banach separation theorem would give a continuous functional whose real part has its maximum on only on a face disjoint from . But that face contains a minimal face, which is an extreme point of , a contradiction.
For the square in the theorem says that the square is the convex hull of its four corners. A standard application: the closed unit ball of a dual Banach space is weak*-compact by the Banach–Alaoglu theorem, so it has extreme points. The unit ball of has no extreme points, so is not isometrically isomorphic to the dual of any Banach space. Compactness is needed: the closed half-plane in is closed and convex but has no extreme points.
Going deeper
For a student
The theorem is used to prove that certain Banach spaces are not dual spaces, by showing that their unit balls lack extreme points. In measure theory and probability, the extreme points of compact convex sets of measures or states are often the "pure" or "ergodic" objects. The theorem shows that they generate everything. Choquet theory refines the closed convex hull into an integral representation over the extreme points. The proof combines Zorn's lemma with the Hahn–Banach separation theorem.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Closure concept
- Compact set concept
- Convex hull concept
- Convex set concept
- Extreme point concept
- Locally convex space concept
- Krein–Milman theorem statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | RSRAY0Q68S |
|---|---|
| URI | m2://RSRAY0Q68S |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 46A55, 52A07 |
| Status | This copy of the site has no build data. Run m2 status RSRAY0Q68S. |
| About | Extreme point, Convex hull |
| Uses | Locally convex space, Convex set, Compact set, Extreme point, Convex hull, Closure |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.