Minkowski's theorem for arbitrary convex sets (Q2519788)

For a convex subset \(C\) of a finite-dimensional real linear space, let \(\text{ext} C\) denote the set of extreme points of \(C\), and \(\text{extr} C\) denote the union of all extremal rays of \(C\). Denote the convex hull of a set \(S\) by \(\text{conv} S\). The finite-dimensional case of the Krein-Milman theorem, first shown by Minkowski, asserts that for every compact convex set \(C\) in a finite-dimensional real linear space, \(C=\text{conv}(\text{ext} C)\). Here the following generalization is shown: For any finite-dimensional convex bounded set \(C\), \(C=\text{conv}(\text{ext} C)\) if and only if \(\text{ext} F\) is dense in \(\text{ext}\overline{F}\) for each face \(F\) of \(C\). The theorem of Minkowski was generalized by \textit{V. L. Klee jun.} [Arch. Math. 8, 234--240 (1957; Zbl 0079.12501)] as follows: For every finite-dimensional convex line-free \(C\), \(C=\text{conv}(\text{ext} C\cup\text{extr} C)\). Here the following generalization is shown: Let \(C\) be finite-dimensional, convex and line-free such that for each face \(F\) of \(C\), \(\text{ext} F\cup\text{extr} F\) is dense in \(\text{ext}\overline{F}\cup\text{extr}\overline{F}\). Then \(C=\text{conv}(\text{ext} C\cup\text{extr} C)\). In fact a slightly stronger statement is proved.