ScalingStacks

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 Nℝ≃ℝnN_{\mathbb{R}}\simeq\mathbb{R}^{n} be a real vector space of dimension nn and Mℝ=Nℝ∨M_{\mathbb{R}}=N_{\mathbb{R}}^{\vee} its dual space. The pairing between x∈Mℝx\in M_{\mathbb{R}} and u∈Nℝu\in N_{\mathbb{R}} will be alternatively denoted by ⟨x,u⟩\langle x,u\rangle, x⁡(u)x(u) or u⁡(x)u(x).

A non-empty subset CC of NℝN_{\mathbb{R}} is convex if, for each pair of points u1,u2∈Cu_{1},u_{2}\in C, the line segment

u1​u2¯={t​u1+(1−t)​u2∣0≤t≤1}{\overline{u_{1}u_{2}}}=\{tu_{1}+(1-t)u_{2}\mid 0\leq t\leq 1\}

is contained in CC. Throughout this text, convex sets are assumed to be non-empty. A non-empty subset σ⊂Nℝ\sigma\subset N_{\mathbb{R}} is a cone if λ​σ=σ\lambda\sigma=\sigma for all λ∈ℝ>0\lambda\in\mathbb{R}_{>0}.

The affine hull of a convex set CC, denoted aff⁡(C)\operatorname{aff}(C), is the minimal affine space which contains it. The dimension of CC is defined as the dimension of its affine hull. The relative interior of CC, denoted ri⁡(C)\operatorname{ri}(C), is defined as the interior of CC relative to its affine hull. The recession cone of CC, denoted by rec⁡(C)\operatorname{rec}(C), is the set

rec⁡(C)={u∈Nℝ∣C+u⊂C}.\operatorname{rec}(C)=\{u\in N_{\mathbb{R}}\mid C+u\subset C\}.

It is a cone of NℝN_{\mathbb{R}}. The cone of CC is defined as

c⁡(C)=ℝ>0​(C×{1})¯⊂Nℝ×ℝ≥0.\operatorname{c}(C)={\overline{\mathbb{R}_{>0}(C\times\{1\})}}\subset N_{\mathbb{R}}\times\mathbb{R}_{\geq 0}.

It is a closed cone. If CC is closed, then rec⁡(C)=c⁡(C)∩(Nℝ×{0})\operatorname{rec}(C)=\operatorname{c}(C)\cap(N_{\mathbb{R}}\times\{0\}).

Definition 3.1.

Let CC be a convex set. A convex subset F⊂CF\subset C is called a face of CC if, for every closed line segment u1​u2¯⊂C{\overline{u_{1}u_{2}}}\subset C such that ri⁡(u1​u2¯)∩F≠∅\operatorname{ri}({\overline{u_{1}u_{2}}})\cap F\not=\emptyset, the inclusion u1​u2¯⊂F{\overline{u_{1}u_{2}}}\subset F holds. A face of CC of codimension 1 is called a facet. A non-empty subset F⊂CF\subset C is called an exposed face of CC if there exists x∈Mℝx\in M_{\mathbb{R}} such that

F={u∈C∣⟨x,u⟩≤⟨x,v⟩,∀v∈C}.F=\{u\in C\mid\langle x,u\rangle\leq\langle x,v\rangle,\,\forall v\in C\}.

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 Π\Pi be a non-empty collection of convex subsets of NℝN_{\mathbb{R}}. The collection Π\Pi is called a convex subdivision if it satisfies the conditions:

  1. (1)

    every face of an element of Π\Pi is also in Π\Pi;

  2. (2)

    every two elements of Π\Pi are either disjoint or they intersect in a common face.

If Π\Pi satisfies only (2), then it is called a convex decomposition. The support of Π\Pi is defined as the set |Π|=⋃C∈ΠC|\Pi|=\bigcup_{C\in\Pi}C. We say that Π\Pi is complete if its support is the whole of NℝN_{\mathbb{R}}. For a given set E⊂NℝE\subset N_{\mathbb{R}}, we say that Π\Pi is a convex subdivision (or decomposition) in EE whenever |Π|⊂E|\Pi|\subset E. A convex subdivision in EE is called complete if |Π|=E|\Pi|=E.

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 NℝN_{\mathbb{R}} 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 σ\sigma such that λ​σ=σ\lambda\sigma=\sigma for all λ>0\lambda>0. 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 Λ\Lambda in NℝN_{\mathbb{R}} is a finite set of affine equations {(aj,αj)}1≤j≤k⊂Mℝ×ℝ\{(a_{j},\alpha_{j})\}_{1\leq j\leq k}\subset M_{\mathbb{R}}\times\mathbb{R} so that

(3.4) Λ=⋂1≤j≤k{u∈Nℝ∣⟨aj,u⟩+αj≥0}.\Lambda=\bigcap_{1\leq j\leq k}\{u\in N_{\mathbb{R}}\mid\langle a_{j},u\rangle+\alpha_{j}\geq 0\}.

With this representation, the recession cone can be written as

rec⁡(Λ)=⋂1≤j≤k{u∈Nℝ∣⟨aj,u⟩≥0}.\operatorname{rec}(\Lambda)=\bigcap_{1\leq j\leq k}\{u\in N_{\mathbb{R}}\mid\langle a_{j},u\rangle\geq 0\}.

A V-representation of a polyhedron Λ′\Lambda^{\prime} in NℝN_{\mathbb{R}} consists in a set of vectors {bj}1≤j≤k\{b_{j}\}_{1\leq j\leq k} in the tangent space T0​Nℝ(≃Nℝ)T_{0}N_{\mathbb{R}}(\simeq N_{\mathbb{R}}) and a non-empty set of points {bj}k+1≤j≤l⊂Nℝ\{b_{j}\}_{k+1\leq j\leq l}\subset N_{\mathbb{R}} such that

(3.5) Λ′=cone⁡(b1,…,bk)+conv⁡(bk+1,…,bl)\Lambda^{\prime}=\operatorname{cone}(b_{1},\dots,b_{k})+\operatorname{conv}(b_{k+1},\dots,b_{l})

where

cone⁡(b1,…,bk):={∑j=1kλj​bj|λj≥0}\operatorname{cone}(b_{1},\dots,b_{k}):=\bigg\{\sum_{j=1}^{k}\lambda_{j}b_{j}\bigg|\ \lambda_{j}\geq 0\bigg\}

is the cone generated by the given vectors (with the convention that cone⁡(∅)={0}\operatorname{cone}(\emptyset)=\{0\}) and

conv(bk+1,…,bl):={∑j=k+1lλjbj|λj≥0,∑j=k+1lλj=1}\operatorname{conv}(b_{k+1},\dots,b_{l}):=\bigg\{\sum_{j=k+1}^{l}\lambda_{j}b_{j}\bigg|\ \lambda_{j}\geq 0,\ \sum_{j=k+1}^{l}\lambda_{j}=1\bigg\}

is the convex hull of the given set of points. With this second representation, the recession cone can be obtained as

rec⁡(Λ′)=cone⁡(b1,…,bk).\operatorname{rec}(\Lambda^{\prime})=\operatorname{cone}(b_{1},\dots,b_{k}).
Definition 3.6.

A polyhedral complex in NℝN_{\mathbb{R}} 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 Π\Pi is a polyhedral complex, we will denote by Πi\Pi^{i} the subset of ii-dimensional polyhedra of Ψ\Psi. In particular, if Σ\Sigma is a fan, Σi\Sigma^{i} is its subset of ii-dimensional cones.

There are two natural processes for linearizing a polyhedral complex.

Definition 3.7.

The recession of Π\Pi is defined as the collection of polyhedral cones of NℝN_{\mathbb{R}} given by

rec⁡(Π)={rec⁡(Λ)∣Λ∈Π}.\operatorname{rec}(\Pi)=\{\operatorname{rec}(\Lambda)\mid\Lambda\in\Pi\}.

The cone of Π\Pi is defined as the collection of cones in Nℝ×ℝN_{\mathbb{R}}\times\mathbb{R} given by

c⁡(Π)={c⁡(Λ)∣Λ∈Π}∪{σ×{0}∣σ∈rec⁡(Π)}.\operatorname{c}(\Pi)=\big\{\operatorname{c}(\Lambda)\mid\Lambda\in\Pi\big\}\cup\big\{\sigma\times\{0\}\mid\sigma\in\operatorname{rec}(\Pi)\big\}.

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 Π\Pi be the polyhedral complex in ℝ3\mathbb{R}^{3} containing the faces of the polyhedra

Λ1={(x1,x2,0)|x1,x2≥0},Λ2={(x1,x2,1)|x1+x2,x1−x2≥0}.\Lambda_{1}=\{(x_{1},x_{2},0)|\,x_{1},x_{2}\geq 0\},\quad\Lambda_{2}=\{(x_{1},x_{2},1)|\,x_{1}+x_{2},x_{1}-x_{2}\geq 0\}.

Then rec⁡(Λ1)\operatorname{rec}(\Lambda_{1}) and rec⁡(Λ2)\operatorname{rec}(\Lambda_{2}) are two cones in ℝ2×{0}\mathbb{R}^{2}\times\{0\} whose intersection is the cone {(x1,x2,0)|x2,x1−x2≥0}\{(x_{1},x_{2},0)|x_{2},x_{1}-x_{2}\geq 0\}. This cone is neither a face of rec⁡(Λ1)\operatorname{rec}(\Lambda_{1}) nor of rec⁡(Λ2)\operatorname{rec}(\Lambda_{2}). Hence rec⁡(Π)\operatorname{rec}(\Pi) is not a complex and, consequently, neither is c⁡(Π)\operatorname{c}(\Pi). In Figure 1 we see the polyhedron Λ1\Lambda_{1} in light grey, the polyhedron Λ2\Lambda_{2} in darker grey and rec⁡(Λ2)\operatorname{rec}(\Lambda_{2}) as dashed lines.

x 3 x 1 x 2
Figure 1.

Therefore, to assure that rec⁡(Π)\operatorname{rec}(\Pi) or c⁡(Π)\operatorname{c}(\Pi) are complexes, we need to impose some condition on Π\Pi. This question has been addressed in [BS10]. Because our applications, we are mostly interested in the case when Π\Pi is complete. It turns out that this assumption is enough to avoid the problem raised in Example 3.8.

Proposition 3.9.

Let Π\Pi be a complete polyhedral complex in NℝN_{\mathbb{R}}. Then rec⁡(Π)\operatorname{rec}(\Pi) and c⁡(Π)\operatorname{c}(\Pi) are complete conic polyhedral complexes in NℝN_{\mathbb{R}} and Nℝ×ℝ≥0N_{\mathbb{R}}\times\mathbb{R}_{\geq 0}, respectively. If, in addition, Π\Pi is strongly convex, then both rec⁡(Π)\operatorname{rec}(\Pi) and c⁡(Π)\operatorname{c}(\Pi) are fans.

Proof.

This is a particular case of [BS10, Theorem 3.4]. ∎

Definition 3.10.

Let Π1\Pi_{1} and Π2\Pi_{2} be two polyhedral complexes in NℝN_{\mathbb{R}}. The complex of intersections of Π1\Pi_{1} and Π2\Pi_{2} is defined as the collection of polyhedra

Π1⋅Π2={Λ1∩Λ2|Λ1∈Π1,Λ2∈Π2}.\Pi_{1}\cdot\Pi_{2}=\{\Lambda_{1}\cap\Lambda_{2}|\Lambda_{1}\in\Pi_{1},\Lambda_{2}\in\Pi_{2}\}.
Lemma 3.11.

The collection Π1⋅Π2\Pi_{1}\cdot\Pi_{2} is a polyhedral complex. If Π1\Pi_{1} and Π2\Pi_{2} are complete, then

rec⁡(Π1⋅Π2)=rec⁡(Π1)⋅rec⁡(Π2).\operatorname{rec}(\Pi_{1}\cdot\Pi_{2})=\operatorname{rec}(\Pi_{1})\cdot\operatorname{rec}(\Pi_{2}).
Proof.

Using the H-representation of polyhedra, one verifies that, if Λ1\Lambda_{1} and Λ2\Lambda_{2} are polyhedra with non-empty intersection, then any face of Λ1∩Λ2\Lambda_{1}\cap\Lambda_{2} is the intersection of a face of Λ1\Lambda_{1} with a face of Λ2\Lambda_{2}. This implies that Π1⋅Π2\Pi_{1}\cdot\Pi_{2} is a polyhedral complex.

Now suppose that Π1\Pi_{1} and Π2\Pi_{2} are complete. Let σ∈rec⁡(Π1⋅Π2)\sigma\in\operatorname{rec}(\Pi_{1}\cdot\Pi_{2}). This means that σ=rec⁡(Λ)\sigma=\operatorname{rec}(\Lambda) and Λ=Λ1∩Λ2\Lambda=\Lambda_{1}\cap\Lambda_{2} with Λi∈Πi\Lambda_{i}\in\Pi_{i}. It is easy to verify that Λ≠∅\Lambda\not=\emptyset implies rec⁡(Λ)=rec⁡(Λ1)∩rec⁡(Λ2)\operatorname{rec}(\Lambda)=\operatorname{rec}(\Lambda_{1})\cap\operatorname{rec}(\Lambda_{2}). Therefore σ∈rec⁡(Π1)⋅rec⁡(Π2)\sigma\in\operatorname{rec}(\Pi_{1})\cdot\operatorname{rec}(\Pi_{2}). This shows

rec⁡(Π1⋅Π2)⊂rec⁡(Π1)⋅rec⁡(Π2).\operatorname{rec}(\Pi_{1}\cdot\Pi_{2})\subset\operatorname{rec}(\Pi_{1})\cdot\operatorname{rec}(\Pi_{2}).

Since both complexes are complete, they agree. ∎

We consider now an integral structure in NℝN_{\mathbb{R}}. Let N≃ℤnN\simeq\mathbb{Z}^{n} be a lattice of rank nn such that Nℝ=N⊗ℝN_{\mathbb{R}}=N\otimes\mathbb{R}. Set M=N∨=Hom⁡(N,ℤ)M=N^{\vee}=\operatorname{Hom}(N,\mathbb{Z}) for its dual lattice so Mℝ=M⊗ℝM_{\mathbb{R}}=M\otimes\mathbb{R}. We also set Nℚ=N⊗ℚN_{\mathbb{Q}}=N\otimes\mathbb{Q} and Mℚ=M⊗ℚM_{\mathbb{Q}}=M\otimes\mathbb{Q}.

Definition 3.12.

Let Λ\Lambda be a polyhedron in NℝN_{\mathbb{R}}. We say that Λ\Lambda 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 Π\Pi be a strongly convex polyhedral complex in NℝN_{\mathbb{R}}. We say that Π\Pi 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 Π\Pi is rational, the same is true for rec⁡(Π)\operatorname{rec}(\Pi) and c⁡(Π)\operatorname{c}(\Pi).

Corollary 3.15.

The correspondence Π↦c⁡(Π)\Pi\mapsto\operatorname{c}(\Pi) is a bijection between the set of complete polyhedral complexes in NℝN_{\mathbb{R}} and the set of complete conical polyhedral complexes in Nℝ×ℝ≥0N_{\mathbb{R}}\times\mathbb{R}_{\geq 0}. Its inverse is the correspondence that, to each conic polyhedral complex Σ\Sigma in Nℝ×ℝ≥0N_{\mathbb{R}}\times\mathbb{R}_{\geq 0} corresponds the complex in NℝN_{\mathbb{R}} obtained by intersecting Σ\Sigma with the hyperplane Nℝ×{1}N_{\mathbb{R}}\times\{1\}. These bijections preserve rationality and strong convexity.

Proof.

This is [BS10, Corollary 3.12]. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.