Convex set

Illustration of a convex set which looks somewhat like a deformed circle. The (black) line segment joining points x and y lies completely within the (green) set. Since this is true for any points x and y within the set that we might choose, the set is convex.

Illustration of a non-convex set which looks somewhat like a boomerang. Since the red part of the (black and red) line-segment joining the points x and y lies outside of the (green) set, the set is non-convex.

In Euclidean space, an object is convex if for every pair of points within the object, every point on the straight line segment that joins the pair of points is also within the object. For example, a solid cube is convex, but anything that is hollow or has a dent in it, for example, a crescent shape, is not convex. A convex curve forms the boundary of a convex set.

The notion of a convex set can be generalized to other spaces as described below.

In vector spaces

A function is convex if and only if its epigraph, the region (in green) above its graph (in blue), is a convex set.

Let Template:Mvar be a vector space over the real numbers, or, more generally, some ordered field. This includes Euclidean spaces. A set Template:Mvar in Template:Mvar is said to be convex if, for all Template:Mvar and Template:Mvar in Template:Mvar and all Template:Mvar in the interval [0, 1], the point (1 − t)x + ty also belongs to Template:Mvar. In other words, every point on the line segment connecting Template:Mvar and Template:Mvar is in Template:Mvar. This implies that a convex set in a real or complex topological vector space is path-connected, thus connected. Furthermore, Template:Mvar is strictly convex if every point on the line segment connecting Template:Mvar and Template:Mvar other than the endpoints is inside the interior of Template:Mvar.

A set Template:Mvar is called absolutely convex if it is convex and balanced.

The convex subsets of R (the set of real numbers) are simply the intervals 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.

Non-convex set

"Concave set" redirects here.

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, and some sources more generally use the term concave set to mean a non-convex set, but most authorities proscribe this usage.

Properties

If Template:Mvar is a convex set in Template:Mvar-dimensional space, then for any collection of Template:Mvar, r > 1, Template:Mvar-dimensional vectors u₁, ..., u_r in Template:Mvar, and for any nonnegative numbers λ₁, ..., λ_r such that λ₁ + ... + λ_r = 1, then one has:

$\sum _{k=1}^{r}\lambda _{k}u_{k}\in S.$

A vector of this type is known as a convex combination of u₁, ..., u_r.

Intersections and unions

The collection of convex subsets of a vector space has the following properties:

1. The empty set and the whole vector-space are convex.
2. The intersection of any collection of convex sets is convex.
3. The union of a non-decreasing sequence of convex subsets is a convex set. For the preceding property of unions of non-decreasing sequences of convex sets, the restriction to nested sets is important: The union of two convex sets need not be convex.

Closed convex sets

Closed convex sets 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 convex set may be represented as such intersection, one needs the supporting hyperplane theorem in the form that for a given closed convex set Template:Mvar and point Template:Mvar outside it, there is a closed half-space Template:Mvar that contains Template:Mvar and not Template:Mvar. The supporting hyperplane theorem is a special case of the Hahn–Banach theorem of functional analysis.

Convex sets and rectangles

Let C be a convex body in the plane. 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:

$0.5Area(R)\leq Area(C)\leq 2Area(r)$

Convex hulls and Minkowski sums

Convex hulls

{{#invoke:main|main}} Every subset Template:Mvar of the vector space is contained within a smallest convex set (called the convex hull of Template:Mvar), namely the intersection of all convex sets containing Template:Mvar. The convex-hull operator Conv() has the characteristic properties of a hull operator:

extensive	S ⊆ Conv(S),
non-decreasing	S ⊆ T implies that Conv(S) ⊆ Conv(T), and
idempotent	Conv(Conv(S)) = Conv(S).

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

Conv(S) ∨ Conv(T) = Conv(S ∪ T) = Conv(Conv(S) ∪ Conv(T)).

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.

Minkowski addition

{{#invoke:main|main}}

Minkowski addition of sets. The sum of the squares Q₁=[0,1]² and Q₂=[1,2]² is the square Q₁+Q₂=[1,3]².

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

S₁ + S₂ = {x₁ + x₂ : x₁ ∈ S₁, x₂ ∈ S₂} .

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

$\sum _{n}S_{n}=\left\{\sum _{n}x_{n}:x_{n}\in S_{n}\right\}.$

For Minkowski addition, the zero set {0} containing only the zero vector 0 has special importance: For every non-empty subset S of a vector space

S + {0} = S;

in algebraic terminology, {0} is the identity element of Minkowski addition (on the collection of non-empty sets).

Convex hulls of Minkowski sums

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

Let S₁, S₂ be subsets of a real vector-space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls

Conv(S₁ + S₂) = Conv(S₁) + Conv(S₂).

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

${\text{Conv}}\left(\sum _{n}S_{n}\right)=\sum _{n}{\text{Conv}}\left(S_{n}\right).$

In mathematical terminology, the operations of Minkowski summation and of forming convex hulls are commuting operations.

Minkowski sums of convex sets

The Minkowski sum of two compact convex sets is compact. the sum of a compact convex set and a closed convex set is closed.

Generalizations and extensions for convexity

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.

Star-convex sets

{{#invoke:main|main}} Let Template:Mvar be a set in a real or complex vector space. Template:Mvar is star convex if there exists an x₀ in Template:Mvar such that the line segment from x₀ to any point Template:Mvar in Template:Mvar is contained in Template:Mvar. Hence a non-empty convex set is always star-convex but a star-convex set is not always convex.

Orthogonal convexity

{{#invoke:main|main}} An example of generalized convexity is orthogonal convexity.

A set Template:Mvar 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 Template:Mvar lies totally within Template:Mvar. 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.

Non-Euclidean geometry

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.

Order topology

Convexity can be extended for a space Template:Mvar endowed with the order topology, using the total order < of the space.

Let Y ⊆ X. The subspace Template:Mvar is a convex set if for each pair of points a, b in Template:Mvar such that a < b, the interval (a, b) = {x ∈ X : a < x < b} is contained in Template:Mvar. That is, Template:Mvar is convex if and only if for all a, b in Template:Mvar, a < b implies (a, b) ⊆ Y.

Convexity spaces

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

Given a set Template:Mvar, a convexity over Template:Mvar is a collection 𝒞 of subsets of Template:Mvar satisfying the following axioms:

1. The empty set and Template:Mvar are in 𝒞
2. The intersection of any collection from 𝒞 is in 𝒞.
3. The union of a chain (with respect to the inclusion relation) of elements of 𝒞 is in 𝒞.

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.

See also

• Concave set
• Convex and concave polygons
• Convex curve
• Convex function
• Convex metric space
• Carathéodory's theorem (convex hull)
• Choquet theory
• Helly's theorem
• Holomorphically convex hull
• Pseudoconvexity
• Shapley–Folkman lemma

External links

• {{#invoke:citation/CS1|citation

|CitationClass=citation }}

• Lectures on Convex Sets, notes by Niels Lauritzen, at Aarhus University, March 2010.