A note on faces of convex sets
Abstract.
The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative interiors may be empty. Shirokov and the present author answered this issue by proving that every point in a convex set lies in the relative algebraic interior of the face it generates. This theorem is proved here in a simpler way, connecting ideas scattered throughout the literature. This article summarizes and develops methods for faces and their relative algebraic interiors and applies them to spaces of probability measures.
Key words and phrases:
Convex set, extreme set, face, face generated by a point, relative interior, relative algebraic interior, Radon-Nikodym derivative, convex core2020 Mathematics Subject Classification:
52A05, 46E27Dedicated to R. Tyrrell Rockafellar on His Ninetieth Birthday
1. Introduction
A face of a convex set in a real vector space is a convex subset of including every pair of points in that are the endpoints of some open segment intersected by this convex subset. One-point faces are in a one-to-one correspondence with extreme points and are useful in functional analysis [1, 5, 8, 15, 21]. Larger faces play a minor role beyond finite dimensions. A notable exception is Alfsen and Shultz’ work on operator algebras [2].
Faces of finite-dimensional convex sets owe their success to an interplay of convexity and topology that appears in Grünbaum’s work [13, Sec. 2.4] and is systematically studied by Rockafellar [17]. A central notion is the relative interior of , the interior of in the induced topology on the affine hull of . Lacking monotonicity, the operator is not the interior operator of a topology. Imagine a side of a triangle in the Euclidean plane ; although holds, and are disjoint and nonempty. Rockafellar and Wets [18, p. 75] stress that the closure of includes in a Euclidean space . Notably, implies .
The last assertion is false in a Hausdorff topological vector space, as the interior of can be empty and the affine hull of can still be equal to .
-
1)
A first example is the convex set defined by a discontinuous linear functional , because is dense in .
-
2)
The closed convex set in the Banach space of -integrable real functions, , has no interior points. Every function is the limit of as , where denotes the indicator function on a measurable set .
Avoiding empty interiors, Borwein and Goebel [7, Thm. 2.8] study modified interiors of convex sets in Banach spaces. This article, instead, focuses on those faces of a convex set that happen to have nonempty relative interiors.
Among all vector topologies on , the greatest interior (with respect to inclusion) of a convex set is achieved by the finest locally convex topology . We deduce this from the continuity of the map , , for every , bearing in mind that a point lies in the interior of for , if and only if for every line in containing , the intersection includes an open segment containing [8, II.26]. The set of all such points is called the algebraic interior [5, 9] or “core” [9, 15] of .
Example 1) above ceases to exist in the topology , which renders every linear functional continuous [8, II.26]. The empty interior of Example 2) persists in the topology , as the interior of every closed convex subset of a Banach space is the algebraic interior of that set [9, p. 46]. Another example with empty algebraic interior is the set of univariate polynomials with real coefficients and positive leading coefficients, which Barvinok examines in several revealing exercises [5, III.1.6]. By contrast, if then is the Euclidean topology and, again, implies .
The relative interior for the topology can be described in terms of the Euclidean topology on a line. Shirokov and the present author [20] define the relative algebraic interior of as the set of points such that for every line in containing , the intersection includes an open segment containing . This definition differs from that of the algebraic interior just in the affine space confining the lines. Holmes [15] calls the “intrinsic core”. We prove for in Sec. 3. Topological vector spaces and relative interiors are ignored subsequently; instead, relative algebraic interiors are used consistently.
In their studies of constrained density operators [20], Shirokov and this author employ the face of generated by a point . This is the smallest face of containing , which we denote by . A basic property is that holds for all .
This key result is deduced in Sec. 4 from two elementary assertions, whereas our prior proof unnecessarily employs the Kuratowski-Zorn lemma. The first elementary assertion (Prop. 4.1) is Alfsen’s formula [1, p. 121]
(1) |
The second one (Prop. 4.4) is Borwein and Goebel’s observation [7] that a point lies in if and only if for all there is such that . A point satisfying the latter proposition is called an internal point [11] or a “relatively absorbing point” [7] of .
Consequences of , , are organized roughly as follows. A review in Sec. 5 and new findings in Sec. 6 extend selected results from Secs. 6 and 18 of Rockafellar’s monograph [17]. Secs. 7 and 8 refer to Secs. 2–4 of Dubins’ paper [11] on infinite-dimensional convexity.
The methods of this paper are suitable to study the space of probability measures on a measurable space. The face generated by a probability measure is described in Sec. 9. The face generated by a Borel probability measure on is related to Csiszár and Matúš’ notion [10] of the convex core of in Sec. 10. Sec. 11 studies measures on the set of natural numbers.
2. Main definitions
Throughout this paper, denotes a real vector space and a convex subset of , unless stated otherwise. If are distinct points of , then
is called the open segment resp. closed segment with endpoints . Each of the symbols denotes the singleton containing .
An extreme set [3] of is a subset of including the closed segment for all points in for which the open segment intersects . A point is an extreme point of if is an extreme set of . A face of is a convex extreme set of . Clearly, any union or intersection of extreme sets of is an extreme set of . Since any intersection of convex sets is convex, any intersection of faces of is a face of . In particular, the intersection of all faces containing a point is a face of , which is called the face of generated by , and which is denoted by .
The algebraic interior of is the set of all points in such that for every line in containing , the intersection includes an open segment containing [5]. The convex set is algebraically open if it is equal to its algebraic interior. The relative algebraic interior of is the set of all points in such that for every line in containing , the intersection includes an open segment containing [20]. The convex set is relative algebraically open if . A point is an internal point [11] of if for all in there is such that .
3. The finest locally convex topology
One of the innovations of this paper is that Thm. 4.5 is a theorem of Zermelo-Fraenkel set theory. However, the use of the relative interior in a topological vector space creates a new dependence on the axiom of choice by Rem. 3.2. Coro. 3.3 allows us to avoid this problem simply by dismissing topological vector spaces altogether, and relying on relative algebraic interiors of convex sets instead. This comes at the modest price that some theorems of topological vector spaces require a proof in this paper. For example, the theorem that the interior of a convex set is convex [8, II.14] would make Lemma 5.2 superfluous. The assertion that the interior of a set is open would essentially supersede Thm. 6.6 (up to questions regarding affine hulls).
A fundamental system of neighborhoods of a point in a topological space is any set of neighborhoods of such that for each neighborhood of there is a neighborhood such that . A topological real vector space is locally convex if there exists a fundamental system of neighborhoods of that are convex sets [8, II.23].
It is known that a convex subset is open for the finest locally convex topology on if and only if is algebraically open; a subset is open for if and only if is a union of convex open subsets of [8, II.26]. Every nonempty affine subspace is isomorphic to the vector space of translations by means of the affine isomorphism defined by some point . A topology is defined on for which a subset is open if and only if is open for . This topology does not depend on and is denoted by . The topology induced on by is denoted by . By definition, a subset is open for if and only if there exists an open set for such that . Let be linear subspaces. Then is a complementary subspace of in if and if for all there is and such that .
Proposition 3.1.
If is an affine subspace of , then .
Proof.
Using the isomorphism , we assume that lies in . Clearly, the induced topology is locally convex, which shows that is finer than . Conversely, let be a convex open subset of for the topology . Let be a complementary subspace of in . It is easy to see that the convex set is open for and that holds. This shows that is finer than and completes the proof. ∎
Remark 3.2.
The complementary subspace used in Prop. 3.1 exist by the axiom of choice. Conversely, the existence of a complementary subspace for all subspaces of all vector spaces over the reals (or over any other field) implies a weak version of the axiom of choice [6, Lemma 2] that is equivalent to the full axiom of choice in Zermelo-Fraenkel set theory [16, Thm. 9.1].
Corollary 3.3.
We have for the topology .
Proof.
This follows immediately from Prop. 3.1. ∎
4. Every point lies in the relative algebraic interior of the face it generates
This section provides proofs for Alfsen’s formula (1) describing the face generated by a point, and Borwein and Goebel’s observation [7] that a point is an internal point of if and only if it lies in . An immediate corollary is Shirokov and the present author’s theorem [20] that every point lies in the relative algebraic interior of the face it generates. Let and define
a)b)
Proposition 4.1 (Alfsen).
For all we have .
Proof.
Let be a point in and . Then there is such that lies in the open segment with endpoints and . As is an extreme set containing , it follows , which proves .
We finish the proof by showing that is a face of . Thus, we consider distinct points in and a point in the open segment , see Fig. 1. Let such that . The coefficients for the following constructions are obtained from Menelaus’ theorem [4, 12].
We show that is an extreme set, see Fig. 1 a). Assuming , there is such that lies in . Let and . Then
lies in , and hence . Similarly, .
We show that is convex, see Fig. 1 b). We assume . Let such that and lie in ; and let
Then
lies in , and hence . ∎
The union in Coro. 4.2 extends over all closed segments in , whose respective open segments contain , and the singleton .
Corollary 4.2.
Every point is an internal point of and we have .
Proof.
The first assertion follows from the definition of and from Prop. 4.1, which proves . Regarding the second assertion, the inclusion “” holds because is an extreme set of containing . The inclusion “” is implied by a proof of . Let . Then there is such that . Hence, and complete the proof. ∎
Note that holds for all , where denotes the set for every convex set containing the origin. Borwein and Goebel [7, p. 2544] suggest that a preliminary step to Prop. 4.4 should be a proof that is an internal point of if and only if holds. Instead, we use the following Lemma 4.3.
Lemma 4.3.
Let be an internal point of . Then holds.
Proof.
Let be a point in . It suffices to find such that the two points are both contained in .
Since and since , there exist and , , not all numbers being zero, such that
By the assumption that is an internal point of , there is such that
is contained in , . Let and let be the minimum of and . Then is strictly positive. We have
If , then holds because of . If , then . If , then because . This shows that the points are convex combinations of points in , and therefore are themselves points in . ∎
Proposition 4.4 (Borwein-Goebel).
For all , the following assertions are equivalent.
-
1)
The point is an internal point of .
-
2)
We have .
-
3)
We have .
-
4)
We have .
Proof.
If is an internal point of , then Lemma 4.3 shows . This implies 2) by the definition of the relative algebraic interior. It also implies 3) and 4), because the inclusions are trivial. As 2) 1) is clear, it suffices to prove n) 1) for .
Assume 3) is true and let be a point of . Since , the point lies in . This provides such that lies in . Hence, is an internal point of .
Assume 4) is true and let be a point of . Then lies in and hence in . This provides such that
and shows that is an internal point of . ∎
This section’s main result is a novel proof for Thm. 2.3 in [20], which states the following.
Theorem 4.5 (W.-Shirokov).
For all we have .
Proof.
Corollary 4.6.
For all we have .
5. Review on the face generated by a point
Here we review some of our prior work from [20, Sec. 2]. Lemma 5.1.1 matches [17, Thm. 18.1]. See Lemma 2.1 in [20] for a proof.
Lemma 5.1.
Let be a convex subset of , let be an extreme set of , let be a face of , and let be a point in . Then
-
1)
,
-
2)
,
-
3)
.
Lemma 5.2.
The complement of the relative algebraic interior is an extreme set of and is a convex set.
Whereas Lemma 5.1 and Lemma 5.2 are rather easy to prove, the remainder of this section relies on Thm. 4.5.
Corollary 5.3.
Let . The following assertions are equivalent.
-
1)
is an extreme set of .
-
2)
includes the face of generated by any point in .
-
3)
is the union of the faces of generated by the points in .
Proof.
Coro. 5.4, and Thm. 6.8 below, match [17, Thm. 18.2]. Let
We recall that a partition of is a family of nonempty subsets of whose elements are mutually disjoint and whose union is .
Corollary 5.4.
We have , the family is a partition of , and
is a bijection.
Proof.
See Coro. 2.6 in [20]; a proof is provided for easy reference. The union of the family covers as by Thm. 4.5. Since is clear, proving that the elements of are mutually disjoint implies that and that is a partition of . Let be faces of and let . Then Lemma 5.1.3 shows . This also shows that the map in question is injective. Its surjectivity is clear. ∎
Remark 5.5 (Partitions of extreme sets).
- 1)
-
2)
There exist subfamilies of the partition in Coro. 5.4, whose union is not an extreme set of . An example is the subfamily having as its only element the open unit interval when .
- 3)
Corollary 5.6.
Let be a face of and let . The following statements are equivalent.
-
1)
We have .
-
2)
We have .
-
3)
We have .
Corollary 5.7.
Let . The following statements are equivalent.
-
1)
We have .
-
2)
We have .
-
3)
We have .
-
4)
We have and .
Proof.
Prop. 5.8 complements [11, Thm. 4.3] but is not equivalent to it, as different concepts of a “face” are in use (see Sec. 8 below).
Proposition 5.8.
Let be convex sets and let . Then
-
1)
,
-
2)
,
-
3)
.
Proof.
See [20, Prop. 2.13]. ∎
Corollary 5.9.
Let be convex sets and let be a nonempty face of with . Then is the intersection of a face of and a face of . A sufficient condition for is that have finite dimension.
Proof.
Is the assumption of in Coro. 5.9 necessary?
Open Problem 5.10.
Are there convex sets and and a face of that can not be written as the intersection of a face of and a face of ?
The analogue of Prop. 5.8 for infinitely many convex sets is wrong.
Example 5.11.
We consider the open segment for every . The intersection is the closed unit interval . The only face of containing the extreme point of is itself. Therefore, is not an intersection of faces of , as such an intersection includes . More examples are obtained by replacing some or all of the open segments with closed segments .
6. Novel results on faces and relative algebraic interiors
This section is inspired by properties of relative interiors of convex sets in finite dimensions [17]. Various insights into relative algebraic interiors are facilitated by Prop. 6.1 and Coro. 6.2. The unions in these statements extend over all open segments in containing , and the singleton . Prop. 6.1 matches part of [17, Thm. 6.1].
Proposition 6.1.
For all we have .
Proof.
The point lies in the left-hand side of the equation by Thm. 4.5 and in the right-hand side by definition. Let and . Then
proves the claim. ∎
Corollary 6.2.
Let . Then holds if and only if .
Corollary 6.3.
If , then holds.
Proof.
Let and . By the definition of the relative algebraic interior, there is such that . Coro. 6.2 shows , which implies
The opposite inclusion is obvious. ∎
Corollary 6.4.
Let be convex sets and . Then
The intersection of two relative algebraically open convex sets is relative algebraically open.
Proof.
Theorem 6.5.
Let and let be an affine map to a real vector space . Then .
Proof.
Let . First, we show . Let be a point in and choose any . Since is an internal point of , there exists such that lies in . Applying shows that lies in , hence is an internal point of . The implication 1) 2) of Prop. 4.4 implies . Second, Coro. 6.2 proves
As , the last expression of this equation equals , again by Coro. 6.2. ∎
Theorem 6.6.
The set is a relative algebraically open convex set.
Proof.
The convexity of is provided by Lemma 5.2. That is relative algebraically open can be proved by showing for all that , or equivalently that is an internal point of , as per the implication 1) 2) of Prop. 4.4. Let lie in . Coro. 6.2 provides such that and are in the open segment . Relabel and , if necessary, such that and for scalars . Then lies in , again by Coro. 6.2, and
shows that is an internal point of . ∎
Corollary 6.7.
For every , the set is the greatest relative algebraically open convex subset (with respect to inclusion) of that contains .
Proof.
Theorem 6.8.
Let . The family of maximal relative algebraically open convex subsets (with respect to inclusion) of is
The family is a partition of . Each nonempty relative algebraically open convex subset of is included in a unique element of .
Proof.
Let be a nonempty relative algebraically open convex subset of and let be a point in . Then holds by Coro. 6.7. The set can not be included in any other element of because is a partition by Coro. 5.4, which also proves the equality between the two descriptions of .
Let be a relative algebraically open convex subset of . We show that the elements of are maximal. Assume that includes for some . Then contains by Thm. 4.5 and follows from Coro. 6.7. We show that has no other maximal relative algebraically open convex subsets. Assume that is maximal. As , the set contains some point . This implies by Coro. 6.7. ∎
7. Novel results on generators of faces
This section is motivated by theorems in [11], but differs from them due to the nonequivalent concepts of a “face” (see Sec. 8).
Lemma 7.1.
Let be a convex subset of , let , and let , , such that . Then the point lies in the relative algebraic interior of the convex hull of .
Proof.
Let , let , , and let denote the convex hull of . Below, we construct for every a number such that lies in . This shows that is an internal point of , and the implication 1) 2) of Prop. 4.4 proves .
As , there is and there are and such that . Since is an internal point of , there exists such that lies in , . We distinguish two cases. If , then and are positive and
If , then and are positive and
Induction extends the claim from to all . ∎
Theorem 7.2.
Let be convex. Then is a face of .
Proof.
The set is a union of extreme sets, and hence an extreme set itself. We show that is convex. Let and let such that , . By Coro. 4.2, there is a point such that lies in the relative algebraic interior of , . Lemma 7.1 shows that the point lies in the relative algebraic interior of the convex hull of . Since is convex, it contains . Hence lies in , and Lemma 5.1.1 proves . It follows that . ∎
We define the face generated by a subset as the smallest face of containing . We denote this face by . Coro. 7.3 matches [11, (3.3)].
Corollary 7.3.
Let . Then , where is the convex hull of .
Proof.
Corollary 7.4.
Let , . Let . Let , , such that , and put . Then
Proof.
Corollary 7.5.
Let be convex sets and let be relative algebraically open. Then every extreme set resp. face of is the intersection of and an extreme set resp. face of .
8. Dubins’ terminology
A d-extreme set of is a subset of including the open segment for all points in for which intersects . A point is a d-extreme point of if is a d-extreme set of . A d-face of is a convex d-extreme set of . Clearly, any union or intersection of d-extreme sets of is a d-extreme set of . Hence, the intersection of all d-faces containing a point is a d-face of , which we call the d-face of generated by . This is the smallest d-face of containing .
Theorem 8.1.
A subset of is a d-extreme set of if and only if it is equal to the union for some subset . The d-face generated by is . A point in is a d-extreme point of if and only if it is an extreme point of .
Proof.
Let be a d-extreme set of and let . As holds by Prop. 6.1, we have . Conversely, let be any subset and assume that a point lies in the open segment with endpoints in and in the set for some . The open segment is included in by Coro. 6.7 and hence in , as holds by Coro. 5.7.
The set contains by Thm. 4.5 and is convex by Lemma 5.2. Hence, it is the smallest d-face containing by the first part of this theorem.
That “d-extreme point” and “extreme point” are equivalent terms is implied by the fact that a singleton cannot contain a segment no matter whether it is an open segment or a closed segment. ∎
Corollary 8.2.
For all , the d-face of generated by is equal to and equal to the greatest relative algebraically open convex subset of containing .
Proof.
By definition [11], an elementary d-face of is a nonempty relative algebraically open d-face of .
Corollary 8.3.
Let . A subset of is an elementary d-face of if and only if it equals for some .
Proof.
Corollary 8.4.
Let . The following statements are equivalent.
-
1)
is relative algebraically open.
-
2)
has exactly two d-faces (which are and ).
-
3)
has exactly two faces (which are and ).
Proof.
Assuming 1), is nonempty. Hence, the partition of
contains as one of its elements by Coro. 5.4. Hence, and are the only d-faces of by Thm. 8.1.
The statement 2) implies that has at most two faces, as every face of is a d-face of . Since , the convex set has exactly two faces.
Assuming 3), the convex set has only one nonempty face. Then is a partition of by Coro. 5.4, which implies . ∎
9. Examples 1: Spaces of probability measures
Let denote the convex set of probability measures on a measurable space . A probability measure is absolutely continuous with respect to , symbolically , if every -null set is a -null set. The measures are equivalent, , if and . If , then we denote by the Radon-Nikodym derivative of with respect to , which is a measurable function satisfying for all , see for example Halmos [14, Sec. 31].
Lemma 9.1.
For every , the set is a face of .
Proof.
Let . The set is an extreme set of . Let , , and be contained in . If is a -null set, then is a -null set and hence a -null set for .
The set is convex, as has the Radon-Nikodym derivative with respect to for all and . ∎
If , then we say a proposition , , is true -almost surely, which we abbreviate as -a.s., if .
Theorem 9.2.
Let . The following assertions are equivalent.
-
1)
The measure lies in the face of generated by .
-
2)
There is such that holds for all .
-
3)
We have and there is such that holds -a.s..
Proof.
Prop. 4.1 shows that a probability measure lies in if and only if there is such that . The latter condition is equivalent to the nonnegativity of the set function , and hence to part 2) of the theorem. It remains to prove the equivalence 2) 3).
If and if there is such that holds -a.s., then part 2) follows (with the same constant ),
Conversely, if is false, then there is such that , making part 2) impossible. If is true but is not bounded -a.s., then for every there is such that and holds for all . Then
proves that part 2) fails. ∎
Dubins in [11] asserts that a probability measure is contained in the smallest d-face of generated by if and only if and there exists , such that for all we have . Coro. 8.2 translates this assertion into Coro. 9.3.
Corollary 9.3 (Dubins).
Let . The following statements are equivalent.
-
1)
The measure lies in .
-
2)
There is such that for all .
-
3)
We have and there are such that holds -a.s. and holds -a.s..
-
4)
We have and there is such that holds -a.s..
Proof.
Coro. 5.7 shows that is equivalent to and , so the equivalences 1) 2) 3) follow from those of Thm. 9.2.
Note that -a.s. is the same as -a.s. if . Hence, 3) implies that and hence holds -a.s., see for example [14, Thm. A, p. 133]. Conversely, if and if there is such that holds -a.s., then
implies that and that holds -a.s.. ∎
10. Examples 2: Convex cores
In a second example, we consider the Borel -algebra of . The convex core of is the intersection of all convex sets of full measure . The convex core was introduced in [10] to extend exponential families in a natural way, such that information projections become properly defined. The mean of is the integral , provided that each coordinate function is -integrable; otherwise, does not have a mean.
Theorem 10.1 (Csiszár and Matúš).
Let have a mean. Then the convex core of equals . Moreover, to each there exists with and mean such that is bounded -a.s..
Thm. 10.1 is proved in Thm. 3 of [10]. We derive from it a description of the relative algebraic interior of the convex core.
Corollary 10.2.
Let have a mean. Then . The relative algebraic interior of is , which equals
Proof.
11. Examples 3: Discrete probability measures
In a third example, we consider the discrete -algebra of all subsets of . Consider the Banach space of absolutely summable sequences endowed with the -norm . We study in terms of the set of probability mass functions
The map that maps a probability measure to its Radon-Nikodym derivative with respect to the counting measure , is an affine isomorphism. We endow with the distance in variation
Then is an isometry, as holds [19, Sec. 3.9]. The support of is . Lemma 11.1 is proved in [20, Lemma 2.12], and follows also from Thm. 9.2 and Coro. 9.3.
Lemma 11.1.
For every we have
Example 11.2 (Faces with empty relative algebraic interiors).
For all subsets we define
The sets and are faces of , see [20, Example 2.10]. If is an infinite set, then holds by Lemma 5.1.3, as each of the faces and is strictly larger than the face generated by any of its points . This is clear if is finite. Otherwise, if is infinite, let for , where . Then but holds by Lemma 11.1.
In [20, Sec. 2], we raise the question as to whether has other faces with empty relative algebraic interiors, aside from those described in Example 11.2. Example 11.3 shows the answer is yes.
Example 11.3 (Another face with empty relative algebraic interior).
For every , let , , where is the Euler-Riemann zeta function. For all , Lemma 11.1 shows that the probability mass function is included in if and only if . Hence, Lemma 5.1.2 proves
By Lemma 11.4 below, for every , the union
is a face of and . Let . Then is included in , which is properly included in by Ex. 11.2. We also have and for all , because contains the point of support .
Lemma 11.4.
Let be a set of points in a convex set indexed by a totally ordered set that has no greatest element, such that if and only if holds for all . Then is a face of and .
Proof.
The set is convex. If , then and for some . Both points and lie in , hence the closed segment with endpoints lies in . The set is an extreme set. If the open segment with endpoints in intersects , then it intersects for some . It follows that .
Assume there is . Since , there is with . Lemma 5.1.1 implies , which shows that is the greatest element of . This is excluded from the assumptions. ∎
Whereas is closed in the -norm [21], the face is not closed for any of infinite support. Indeed, Lemma 11.5 shows that the closure of is whereas is strictly included in by Ex. 11.2. Let the function be defined by if and otherwise, .
Lemma 11.5.
The closure of any face of in the -norm is , where . For every we have .
Proof.
First, the face of functions with finite support is dense in for all . To see this, let (without loss of generality) and let . Then , defined by
converges to , as for all .
Second, if is a face of then holds. The right inclusion is obvious. To see the left inclusion, let , and let such that . By Lemma 11.1, we have . Then follows from Lemma 5.1.2. This implies as is convex.
The preceding two arguments prove the first assertion. The second assertion is a special case of the first one and follows from Lemma 11.1. ∎
Lemma 11.5 shows that the norm closed faces of are in a one-to-one correspondence with the subsets of . This assertion is a special case of a more general property of von Neumann algebras [2]. The space is the predual of the von Neumann algebra
The set is the normal state space of , and the subsets of are in a one-to-one correspondence with the projections in , that is to say, functions . In a general von Neumann algebra, there is an order preserving isomorphism between the norm closed faces of the normal state space and the projections in the algebra [2, Thm. 3.35].
Acknowledgements
I thank Didier Henrion, Martin Kružík, Milan Korda, Milan Studený, and Tobias Fritz for inspiring discussions. This work was co-funded by the European Union under the project ROBOPROX (reg. no. CZ.02.01.01/00/22_008/0004590).
References
- [1] E. M. Alfsen, Compact Convex Sets and Boundary Integrals, Berlin: Springer, 1971.
- [2] E. M. Alfsen and F. W. Shultz, State Spaces of Operator Algebras, Boston: Birkhäuser, 2001.
- [3] C. D. Aliprantis and K. C. Border, Infinite Dimensional Analysis, Berlin: Springer, 2006.
- [4] W. P. Barth, Geometrie, Lecture Notes, University of Erlangen, Summer Term 2004 (version: 2004-08-10). [Retrieved 2024-07-03]
- [5] A. Barvinok, A Course in Convexity, Providence: AMS, 2002.
- [6] M. Bleicher, Some theorems on vector spaces and the axiom of choice, Fundamenta Mathematicae 54:1, 95–107 (1964).
- [7] J. Borwein and R. Goebel, Notions of relative interior in Banach spaces, Journal of Mathematical Sciences 115:4, 2542–2553 (2003).
- [8] N. Bourbaki, Topological Vector Spaces, Berlin: Springer, 1987.
- [9] C. Clason, Introduction to Functional Analysis, Cham: Springer, 2020.
- [10] I. Csiszár and F. Matúš, Convex cores of measures on , Studia Scientiarum Mathematicarum Hungarica 38:1–4, 177–190 (2001).
- [11] L. E. Dubins, On extreme points of convex sets, Journal of Mathematical Analysis and Applications 5:2, 237–244 (1962).
- [12] B. Grünbaum and G. C. Shephard, Ceva, Menelaus, and the area principle, Mathematics Magazine 68:4, 254–268 (1995).
- [13] B. Grünbaum, Convex Polytopes, 2nd ed., New York: Springer, 2003.
- [14] P. R. Halmos, Measure Theory, New York: Springer, 1950.
- [15] R. B. Holmes, Geometric Functional Analysis and its Applications, New York: Springer, 1975.
- [16] T. J. Jech, The Axiom of Choice, Mineola: Dover Publications, 2008.
- [17] R. T. Rockafellar, Convex Analysis, Princeton: Princeton University Press, 1970.
- [18] R. T. Rockafellar and R. J.-B. Wets, Variational Analysis, Berlin: Springer, 2009.
- [19] A. N. Shiryaev, Probability-1, New York: Springer, 2016.
- [20] S. Weis and M. Shirokov, The face generated by a point, generalized affine constraints, and quantum theory, Journal of Convex Analysis 28:3, 847–870 (2021).
- [21] D. Werner, Funktionalanalysis, Berlin: Springer, 2018.
Stephan Weis
Czech Technical University in Prague
Faculty of Electrical Engineering
Karlovo náměstí 13
12000, Prague 2
Czech Republic
e-mail [email protected]