# Convex set

In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is **convex** if, given any two points, it contains the whole line segment that joins them. Equivalently, a **convex set** or a **convex region** is a subset that intersects every line into a single line segment (possibly empty).^{[1]}^{[2]}
For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex.

The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset A of Euclidean space is called the convex hull of A. It is the smallest convex set containing A.

A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex functions is called convex analysis.

Let S be a vector space or an affine space over the real numbers, or, more generally, over some ordered field. This includes Euclidean spaces, which are affine spaces. A subset C of S is **convex** if, for all x and y in C, the line segment connecting x and y is included in C. This means that the affine combination (1 − *t*)*x* + *ty* belongs to C, for all x and y in C, and t in the interval [0, 1]. This implies that convexity (the property of being convex) is invariant under affine transformations. This implies also that a convex set in a real or complex topological vector space is path-connected, thus connected.

A set C is *strictly convex* if every point on the line segment connecting x and y other than the endpoints is inside the interior of C.

The convex subsets of **R** (the set of real numbers) are the intervals and the points of **R**. Some examples of convex subsets of the Euclidean plane are solid regular polygons, solid triangles, and intersections of solid triangles. Some examples of convex subsets of a Euclidean 3-dimensional space are the Archimedean solids and the Platonic solids. The Kepler-Poinsot polyhedra are examples of non-convex sets.

A set that is not convex is called a *non-convex set*. A polygon that is not a convex polygon is sometimes called a concave polygon,^{[3]} and some sources more generally use the term *concave set* to mean a non-convex set,^{[4]} but most authorities prohibit this usage.^{[5]}^{[6]}

The complement of a convex set, such as the epigraph of a concave function, is sometimes called a *reverse convex set*, especially in the context of mathematical optimization.^{[7]}

Given r points *u*_{1}, ..., *u _{r}* in a convex set S, and r
nonnegative numbers

*λ*

_{1}, ...,

*λ*such that

_{r}*λ*

_{1}+ ... +

*λ*= 1, the affine combination

_{r}belongs to S. As the definition of a convex set is the case *r* = 2, this property characterizes convex sets.

Such an affine combination is called a convex combination of *u*_{1}, ..., *u _{r}*.

The collection of convex subsets of a vector space, an affine space, or a Euclidean space has the following properties:^{[8]}^{[9]}

Closed convex sets are convex sets that contain all their limit points. They can be characterised as the intersections of *closed half-spaces* (sets of point in space that lie on and to one side of a hyperplane).

From what has just been said, it is clear that such intersections are convex, and they will also be closed sets. To prove the converse, i.e., every closed convex set may be represented as such intersection, one needs the supporting hyperplane theorem in the form that for a given closed convex set C and point P outside it, there is a closed half-space H that contains C and not P. The supporting hyperplane theorem is a special case of the Hahn–Banach theorem of functional analysis.

Let C be a convex body in the plane (a convex set whose interior is non-empty). We can inscribe a rectangle *r* in C such that a homothetic copy *R* of *r* is circumscribed about C. The positive homothety ratio is at most 2 and:^{[10]}

and can be visualized as the image of the function *g* that maps a convex body to the **R**^{2} point given by (*r*/*R*, *D*/2*R*). The image of this function is known a (*r*, *D*, *R*) Blachke-Santaló diagram.^{[12]}

Every subset A of the vector space is contained within a smallest convex set (called the convex hull of A), namely the intersection of all convex sets containing A. The convex-hull operator Conv() has the characteristic properties of a hull operator:

The convex-hull operation is needed for the set of convex sets to form a lattice, in which the "*join*" operation is the convex hull of the union of two convex sets

The intersection of any collection of convex sets is itself convex, so the convex subsets of a (real or complex) vector space form a complete lattice.

In a real vector-space, the *Minkowski sum* of two (non-empty) sets, *S*_{1} and *S*_{2}, is defined to be the set *S*_{1} + *S*_{2} formed by the addition of vectors element-wise from the summand-sets

More generally, the *Minkowski sum* of a finite family of (non-empty) sets *S _{n}* is the set formed by element-wise addition of vectors

Minkowski addition behaves well with respect to the operation of taking convex hulls, as shown by the following proposition:

Let *S*_{1}, *S*_{2} be subsets of a real vector-space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls

This result holds more generally for each finite collection of non-empty sets:

In mathematical terminology, the operations of Minkowski summation and of forming convex hulls are commuting operations.^{[14]}^{[15]}

The Minkowski sum of two compact convex sets is compact. The sum of a compact convex set and a closed convex set is closed.^{[16]}

The following famous theorem, proved by Dieudonné in 1966, gives a sufficient condition for the difference of two closed convex subsets to be closed.^{[17]} It uses the concept of a **recession cone** of a non-empty convex subset *S*, defined as:

The notion of convexity in the Euclidean space may be generalized by modifying the definition in some or other aspects. The common name "generalized convexity" is used, because the resulting objects retain certain properties of convex sets.

Let C be a set in a real or complex vector space. C is **star convex (star-shaped)** if there exists an *x*_{0} in C such that the line segment from *x*_{0} to any point y in C is contained in C. Hence a non-empty convex set is always star-convex but a star-convex set is not always convex.

A set S in the Euclidean space is called **orthogonally convex** or **ortho-convex**, if any segment parallel to any of the coordinate axes connecting two points of S lies totally within S. It is easy to prove that an intersection of any collection of orthoconvex sets is orthoconvex. Some other properties of convex sets are valid as well.

The definition of a convex set and a convex hull extends naturally to geometries which are not Euclidean by defining a geodesically convex set to be one that contains the geodesics joining any two points in the set.

Convexity can be extended for a totally ordered set X endowed with the order topology.^{[19]}

The notion of convexity may be generalised to other objects, if certain properties of convexity are selected as axioms.

Given a set X, a **convexity** over X is a collection *𝒞* of subsets of X satisfying the following axioms:^{[8]}^{[9]}^{[20]}

The elements of *𝒞* are called convex sets and the pair (*X*, *𝒞*) is called a **convexity space**. For the ordinary convexity, the first two axioms hold, and the third one is trivial.

For an alternative definition of abstract convexity, more suited to discrete geometry, see the *convex geometries* associated with antimatroids.