7.3. Convex Subsets of \(\RR^n\)#

This section focuses on important convex subsets of \(\RR^n\).

Definition 7.14 (Nonnegative orthant)

The nonnegative orthant denoted by \(\RR_+^n\) is defined as:

\[ \RR_+^n \triangleq \{ \bx \in \RR^n \ST x_i \geq 0 , i = 1, \dots , n\} = \{\bx \in \RR^n \| x \succeq \bzero \}. \]

Definition 7.15 (Positive orthant)

The positive orthant denoted by \(\RR_{++}^n\) is defined as:

\[ \RR_{++}^N \triangleq \{ \bx \in \RR^n \ST x_i > 0 , i = 1, \dots , n\} = \{\bx \in \RR^n \| x \succ \bzero \}. \]

7.3.1. Simplex#

Recall from Definition 7.11 that a simplex is the convex hull of a finite collection of affine independent points. Points, line segments, triangles and tetrahedrons are common examples of simplices in \(\RR^n\). Here, we describe simplices in \(\RR^n\) further.

A simplex has vertices, edges and faces. The faces of a simplex don’t have any curvature.

Definition 7.16 (Regular simplex)

A regular simplex is the set of nonnegative vectors with elements summing up to \(a\).

\[ \Delta^a_n \triangleq \{\bx \in \RR^n \ST \langle \bx, \bone \rangle = a, \bx \succeq \bzero \}. \]

Definition 7.17 (Unit simplex)

A unit simplex is the set of nonnegative vectors with elements summing up to \(1\).

\[ \Delta_n \triangleq \{\bx \in \RR^n \ST \langle \bx, \bone \rangle = 1, \bx \succeq \bzero \}. \]

7.3.2. Polyhedra#

Definition 7.18 (Polyhedron)

A polyhedron is defined as the solution set of a finite number of linear inequalities and linear equations.

\[ P = \{ \bx | \langle \ba_j, \bx \rangle \leq b_j, j = 1, \dots, m, \langle \bc_k, \bx \rangle = d_k, k = 1, \dots, p\} \]

A polyhedron thus is the intersection of a finite number of halfspaces (\(m\)) and hyperplanes (\(p\)).

Example 7.8 (Polyhedra)

  • Affine sets ( subspaces, hyperplanes, lines)

  • Rays

  • Line segments

  • Halfspaces

Theorem 7.43

A polyhedron is a convex set.

Proof. Intersection of convex sets is convex.

Polyhedra are considerably better behaved convex sets than others (like norm balls or ellipsoids) because of their lack of curvature.

We can combine the set of inequalities and equalities in the form of linear matrix inequalities and equalities.

\[ P = \{ \bx \ST \bA \bx \preceq \bb, \bC \bx = \bd\} \]


\[\begin{split} &\bA = \begin{bmatrix} \ba_1^T \\ \vdots \\ \ba_m^T \end{bmatrix} , \bb = \begin{bmatrix} b_1 \\ \vdots \\ b_m \end{bmatrix}\\ &\bC = \begin{bmatrix} \bc_1^T \\ \vdots\\ \bc_p^T \end{bmatrix} , \bd = \begin{bmatrix} d_1 \\ \vdots \\ d_p \end{bmatrix} \end{split}\]

and the symbol \(\preceq\) means vector inequality or component wise inequality in \(\RR^m\) i.e. \(\bu \preceq \bv\) means \(u_i \leq v_i\) for \(i = 1, \dots, m\).

Note that \(\bb \in \RR^m\), \(\bA \in \RR^{m \times n}\), \(\bA \bx \in \RR^m\), \(\bd \in \RR^p\), \(\bC \in \RR^{p \times n}\) and \(\bC \bx \in \RR^p\).

Example 7.9 (Set of nonnegative numbers)

Let \(\RR_+ = \{ x \in \RR | x \geq 0\}\). \(\RR_+\) is a polyhedron (a solution set of a single linear inequality). Hence, it is a convex set. Moreover, it is a ray and a convex cone.

Example 7.10 (Nonnegative orthant)

The nonnegative orthant \(\RR_+^n\) is a polyhedron (solution set of \(n\) linear inequalities). It is also a convex cone.

7.3.3. Polytopes#

Definition 7.19 (Polytope)

A bounded polyhedron is known as a polytope.

Theorem 7.44

A nonempty set \(C\) of \(\RR^n\) is a (convex) polytope if and only if it is a convex hull of a finite set of points.

Some authors define a polytope as a convex hull of a finite set of points and then show that it must be a bounded polyhedron.

7.3.4. Euclidean Balls#

Definition 7.20 (Euclidean ball)

A Euclidean closed ball (or just ball) in \(\RR^n\) has the form

\[ B[\bx_c, r] \triangleq \{ \bx \ST \| \bx - \bx_c\|_2 \leq r \} = \{\bx \ST (\bx - \bx_c)^T (\bx - \bx_c) \leq r^2 \} \]

where \(r > 0\) and \( \| \cdot \|_2\) denotes the Euclidean norm. \(\bx_c\) is the center of the ball. \(r\) is the radius of the ball.

An equivalent expression is given by

\[ B = \{\bx_c + r \bu \, | \, \| \bu \|_2 \leq 1 \}. \]

A Euclidean ball is a convex set.

7.3.5. Ellipsoids#

Definition 7.21

An ellipsoid is a set of the form

\[ \xi = \{\bx \ST (\bx - \bx_c)^T \bP^{-1} (\bx - \bx_c) \leq 1\} \]

where \(\bP = \bP^T \succ 0\); i.e., \(\bP\) is symmetric and positive definite.

The vector \(\bx_c \in \RR^n\) is the centroid of the ellipse.

Eigen values of the matrix \(\bP\) (which are all positive) determine how far the ellipsoid extends in every direction from \(\bx_c\).

The lengths of semi-axes of \(\xi\) are given by \(\sqrt{\lambda_i}\) where \(\lambda_i\) are the eigen values of \(\bP\).

Remark 7.3

A Euclidean ball is an ellipsoid with \(\bP = r^2 I\).

An alternative representation of an ellipsoid is given by

\[ \xi = \{\bx_c + \bA \bu | \| \bu\|_2 \leq 1 \} \]

where \(\bA\) is a square and nonsingular matrix.

To show the equivalence of the two definitions, we proceed as follows.

Let \(\bP = \bA \bA^T\). Let \(\bx\) be any arbitrary element in \(\xi\).

Then \(\bx - \bx_c = \bA \bu\) for some \(\bu\) such that \(\| \bu \|_2 \leq 1\).


\[\begin{split} &(\bx - \bx_c)^T \bP^{-1} (\bx - \bx_c) = (\bA \bu)^T (\bA \bA^T)^{-1} (\bA \bu)\\ &= \bu^T \bA^T (\bA^T)^{-1} \bA^{-1} \bA \bu = \bu^T \bu\\ &= \| \bu \|_2^2 \leq 1. \end{split}\]

The two representations of an ellipsoid are therefore equivalent.

Remark 7.4

An ellipsoid is a convex set.