3.1. Convex sets and convex decompositions [02KB]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
3.1. Convex sets and convex decompositions
Let be a real vector space of dimension and its dual space. The pairing between and will be alternatively denoted by , or .
A non-empty subset of is convex if, for each pair of points , the line segment
is contained in . Throughout this text, convex sets are assumed to be non-empty. A non-empty subset is a cone if for all .
The affine hull of a convex set , denoted , is the minimal affine space which contains it. The dimension of is defined as the dimension of its affine hull. The relative interior of , denoted , is defined as the interior of relative to its affine hull. The recession cone of , denoted by , is the set
It is a cone of . The cone of is defined as
It is a closed cone. If is closed, then .
Definition 3.1.
Let be a convex set. A convex subset is called a face of if, for every closed line segment such that , the inclusion holds. A face of of codimension 1 is called a facet. A non-empty subset is called an exposed face of if there exists such that
Any exposed face of a convex set is a face, and the facets of a convex set are always exposed. However, a convex set may have faces which are not exposed. For instance, think about the four points of junction of the straight lines and bends of the boundary of the inner area of a racing track in a stadium.
Definition 3.2.
Let be a non-empty collection of convex subsets of . The collection is called a convex subdivision if it satisfies the conditions:
- (1)
every face of an element of is also in ;
- (2)
every two elements of are either disjoint or they intersect in a common face.
If satisfies only (2), then it is called a convex decomposition. The support of is defined as the set . We say that is complete if its support is the whole of . For a given set , we say that is a convex subdivision (or decomposition) in whenever . A convex subdivision in is called complete if .
For instance, the collection of all faces of a convex set defines a convex subdivision of this set. The collection of all exposed faces of a convex set is a convex decomposition, but it is not necessarily a convex subdivision.
In this text, we will be mainly concerned with the polyhedral case.
Definition 3.3.
A convex polyhedron of is a convex set defined as the intersection of a finite number of closed halfspaces. It is called strongly convex if it does not contain any line. A convex polyhedral cone is a convex polyhedron such that for all . A polytope is a bounded convex polyhedron.
For a convex polyhedron, there is no difference between faces and exposed faces.
By the Minkowski-Weyl theorem, polyhedra can be explicitly described in two dual ways, either by the H-representation, as an intersection of half-spaces, or by the V-representation, as the Minkowski sum of a cone and a polytope [Roc70, Theorem 19.1]. An H-representation of a polyhedron in is a finite set of affine equations so that
| (3.4) |
With this representation, the recession cone can be written as
A V-representation of a polyhedron in consists in a set of vectors in the tangent space and a non-empty set of points such that
| (3.5) |
where
is the cone generated by the given vectors (with the convention that ) and
is the convex hull of the given set of points. With this second representation, the recession cone can be obtained as
Definition 3.6.
A polyhedral complex in is a finite convex subdivision whose elements are convex polyhedra. A polyhedral complex is called strongly convex if all of its polyhedra are strongly convex. It is called conic if all of its elements are cones. A strongly convex conic polyhedral complex is called a fan. If is a polyhedral complex, we will denote by the subset of -dimensional polyhedra of . In particular, if is a fan, is its subset of -dimensional cones.
There are two natural processes for linearizing a polyhedral complex.
Definition 3.7.
The recession of is defined as the collection of polyhedral cones of given by
The cone of is defined as the collection of cones in given by
It is natural to ask whether the recession or the cone of a given polyhedral complex is a complex too. The following example shows that this is not always the case.
Example 3.8.
Let be the polyhedral complex in containing the faces of the polyhedra
Then and are two cones in whose intersection is the cone . This cone is neither a face of nor of . Hence is not a complex and, consequently, neither is . In Figure 1 we see the polyhedron in light grey, the polyhedron in darker grey and as dashed lines.
Therefore, to assure that or are complexes, we need to impose some condition on . This question has been addressed in [BS10]. Because our applications, we are mostly interested in the case when is complete. It turns out that this assumption is enough to avoid the problem raised in Example 3.8.
Proposition 3.9.
Let be a complete polyhedral complex in . Then and are complete conic polyhedral complexes in and , respectively. If, in addition, is strongly convex, then both and are fans.
Proof.
This is a particular case of [BS10, Theorem 3.4]. ∎
Definition 3.10.
Let and be two polyhedral complexes in . The complex of intersections of and is defined as the collection of polyhedra
Lemma 3.11.
The collection is a polyhedral complex. If and are complete, then
Proof.
Using the H-representation of polyhedra, one verifies that, if and are polyhedra with non-empty intersection, then any face of is the intersection of a face of with a face of . This implies that is a polyhedral complex.
Now suppose that and are complete. Let . This means that and with . It is easy to verify that implies . Therefore . This shows
Since both complexes are complete, they agree. ∎
We consider now an integral structure in . Let be a lattice of rank such that . Set for its dual lattice so . We also set and .
Definition 3.12.
Let be a polyhedron in . We say that is a lattice polyhedron if it admits a V-representation with integral vectors and points. We say that it is rational if it admits a V-representation with rational coefficients.
Observe that any rational polyhedron admits an H-representation with integral coefficients.
Definition 3.13.
Let be a strongly convex polyhedral complex in . We say that is lattice (respectively rational) if all of its elements are lattice (respectively rational) polyhedra. For short, a strongly convex rational polyhedral complex is called an SCR polyhedral complex. A conic SCR polyhedral complex is called a rational fan.
Remark 3.14.
The statement of Proposition 3.9 is compatible with rational structures. Namely, if is rational, the same is true for and .
Corollary 3.15.
The correspondence is a bijection between the set of complete polyhedral complexes in and the set of complete conical polyhedral complexes in . Its inverse is the correspondence that, to each conic polyhedral complex in corresponds the complex in obtained by intersecting with the hyperplane . These bijections preserve rationality and strong convexity.
Proof.
This is [BS10, Corollary 3.12]. ∎