Template:Wiktionary In Euclidean space, an object is convex if for any pair of points within the object, any point on the straight line segment that joins them is also within the object. For example, a solid cube is convex, but anything that is hollow or has a dent in it is not convex.
The concepts of convexity and concavity are important in various fields, and in various fields the adjective "convex" has their own specific meanings.
- (1 − t) x + t y
A set C 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 Euclidean 2-space are regular polygons and bodies of constant width. Some examples of convex subsets of Euclidean 3-space are the Archimedean solids and the Platonic solids. The Kepler-Poinsot solids are examples of non-convex sets.
Properties of convex sets
If is a convex set, for any in , and any non negative numbers such that , then the vector is in .
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. This also means that any 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.
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 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.
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.
An example of generalized convexity is orthogonal convexity.
A set S in the Euclidean space is called orthogonally convex or orthoconvex, 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.
Abstract (axiomatic) convexity
Given a set X, the convexity over X is a subset of powerset of X that satisfies the following axioms.
- The empty set and X are in
- The intersection of any collection from is in .
- 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 the convexity space. For the ordinary convexity, the first two axioms hold, and the third one is trivial.
- Rawlins G.J.E. and Wood D, "Ortho-convexity and its generalizations", in: Computational Morphology, 137-152. Elsevier, 1988.
- Soltan, Valeriu Introduction to the Axiomatic Theory of Convexity, Stiintsa, Chisinau, 1984 (in Russian)