Support function

Last updated

In mathematics, the support functionhA of a non-empty closed convex set A in describes the (signed) distances of supporting hyperplanes of A from the origin. The support function is a convex function on . Any non-empty closed convex set A is uniquely determined by hA. Furthermore, the support function, as a function of the set A, is compatible with many natural geometric operations, like scaling, translation, rotation and Minkowski addition. Due to these properties, the support function is one of the most central basic concepts in convex geometry.

Contents

Definition

The support function of a non-empty closed convex set A in is given by

; see [1] [2] . [3] Its interpretation is most intuitive when x is a unit vector: by definition, A is contained in the closed half space

and there is at least one point of A in the boundary

of this half space. The hyperplane H(x) is therefore called a supporting hyperplane with exterior (or outer) unit normal vector x. The word exterior is important here, as the orientation of x plays a role, the set H(x) is in general different from H(-x). Now hA is the (signed) distance of H(x) from the origin.

Examples

The support function of a singleton A={a} is .

The support function of the Euclidean unit ball is where is the 2-norm.

If A is a line segment through the origin with endpoints -a and a then .

Properties

As a function of x

The support function of a compact nonempty convex set is real valued and continuous, but if the set is closed and unbounded, its support function is extended real valued (it takes the value ). As any nonempty closed convex set is the intersection of its supporting half spaces, the function hA determines A uniquely. This can be used to describe certain geometric properties of convex sets analytically. For instance, a set A is point symmetric with respect to the origin if and only if hA is an even function.

In general, the support function is not differentiable. However, directional derivatives exist and yield support functions of support sets. If A is compact and convex, and hA'(u;x) denotes the directional derivative of hA at u0 in direction x, we have

Here H(u) is the supporting hyperplane of A with exterior normal vector u, defined above. If AH(u) is a singleton {y}, say, it follows that the support function is differentiable at u and its gradient coincides with y. Conversely, if hA is differentiable at u, then AH(u) is a singleton. Hence hA is differentiable at all points u0 if and only if A is strictly convex (the boundary of A does not contain any line segments).

More generally, when is convex and closed then for any ,

where denotes the set of subgradients of at .

It follows directly from its definition that the support function is positive homogeneous:

and subadditive:

It follows that hA is a convex function. It is crucial in convex geometry that these properties characterize support functions: Any positive homogeneous, convex, real valued function on is the support function of a nonempty compact convex set. Several proofs are known, [3] one is using the fact that the Legendre transform of a positive homogeneous, convex, real valued function is the (convex) indicator function of a compact convex set.

Many authors restrict the support function to the Euclidean unit sphere and consider it as a function on Sn-1. The homogeneity property shows that this restriction determines the support function on , as defined above.

As a function of A

The support functions of a dilated or translated set are closely related to the original set A:

and

The latter generalises to

where A + B denotes the Minkowski sum:

The Hausdorff distance dH(A, B) of two nonempty compact convex sets A and B can be expressed in terms of support functions,

where, on the right hand side, the uniform norm on the unit sphere is used.

The properties of the support function as a function of the set A are sometimes summarized in saying that :AhA maps the family of non-empty compact convex sets to the cone of all real-valued continuous functions on the sphere whose positive homogeneous extension is convex. Abusing terminology slightly, is sometimes called linear, as it respects Minkowski addition, although it is not defined on a linear space, but rather on an (abstract) convex cone of nonempty compact convex sets. The mapping is an isometry between this cone, endowed with the Hausdorff metric, and a subcone of the family of continuous functions on Sn-1 with the uniform norm.

Variants

In contrast to the above, support functions are sometimes defined on the boundary of A rather than on Sn-1, under the assumption that there exists a unique exterior unit normal at each boundary point. Convexity is not needed for the definition. For an oriented regular surface, M, with a unit normal vector, N, defined everywhere on its surface, the support function is then defined by

.

In other words, for any , this support function gives the signed distance of the unique hyperplane that touches M in x.

See also

Related Research Articles

In mathematics, more specifically in functional analysis, a Banach space is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and is complete in the sense that a Cauchy sequence of vectors always converges to a well-defined limit that is within the space.

<span class="mw-page-title-main">Convex set</span> In geometry, set whose intersection with every line is a single line segment

In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset 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 . 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.

In mathematics, any vector space has a corresponding dual vector space consisting of all linear forms on together with the vector space structure of pointwise addition and scalar multiplication by constants.

<span class="mw-page-title-main">Normed vector space</span> Vector space on which a distance is defined

In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers on which a norm is defined. A norm is a generalization of the intuitive notion of "length" in the physical world. If is a vector space over , where is a field equal to or to , then a norm on is a map , typically denoted by , satisfying the following four axioms:

  1. Non-negativity: for every ,.
  2. Positive definiteness: for every , if and only if is the zero vector.
  3. Absolute homogeneity: for every and ,
  4. Triangle inequality: for every and ,

Distributions, also known as Schwartz distributions or generalized functions, are objects that generalize the classical notion of functions in mathematical analysis. Distributions make it possible to differentiate functions whose derivatives do not exist in the classical sense. In particular, any locally integrable function has a distributional derivative.

In the area of mathematics known as functional analysis, a reflexive space is a locally convex topological vector space (TVS) for which the canonical evaluation map from into its bidual is an isomorphism of TVSs. Since a normable TVS is reflexive if and only if it is semi-reflexive, every normed space is reflexive if and only if the canonical evaluation map from into its bidual is surjective; in this case the normed space is necessarily also a Banach space. In 1951, R. C. James discovered a Banach space, now known as James' space, that is not reflexive but is nevertheless isometrically isomorphic to its bidual.

<span class="mw-page-title-main">Projective variety</span>

In algebraic geometry, a projective variety over an algebraically closed field k is a subset of some projective n-space over k that is the zero-locus of some finite family of homogeneous polynomials of n + 1 variables with coefficients in k, that generate a prime ideal, the defining ideal of the variety. Equivalently, an algebraic variety is projective if it can be embedded as a Zariski closed subvariety of .

<span class="mw-page-title-main">Foliation</span> In mathematics, a type of equivalence relation on an n-manifold

In mathematics, a foliation is an equivalence relation on an n-manifold, the equivalence classes being connected, injectively immersed submanifolds, all of the same dimension p, modeled on the decomposition of the real coordinate space Rn into the cosets x + Rp of the standardly embedded subspace Rp. The equivalence classes are called the leaves of the foliation. If the manifold and/or the submanifolds are required to have a piecewise-linear, differentiable, or analytic structure then one defines piecewise-linear, differentiable, or analytic foliations, respectively. In the most important case of differentiable foliation of class Cr it is usually understood that r ≥ 1. The number p is called the dimension of the foliation and q = np is called its codimension.

<span class="mw-page-title-main">Minkowski addition</span> Sums vector sets A and B by adding each vector in A to each vector in B

In geometry, the Minkowski sum of two sets of position vectors A and B in Euclidean space is formed by adding each vector in A to each vector in B:

In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vector spaces whose topology is generated by translations of balanced, absorbent, convex sets. Alternatively they can be defined as a vector space with a family of seminorms, and a topology can be defined in terms of that family. Although in general such spaces are not necessarily normable, the existence of a convex local base for the zero vector is strong enough for the Hahn–Banach theorem to hold, yielding a sufficiently rich theory of continuous linear functionals.

<span class="mw-page-title-main">Arrangement of hyperplanes</span> Partition of space by a hyperplanes

In geometry and combinatorics, an arrangement of hyperplanes is an arrangement of a finite set A of hyperplanes in a linear, affine, or projective space S. Questions about a hyperplane arrangement A generally concern geometrical, topological, or other properties of the complement, M(A), which is the set that remains when the hyperplanes are removed from the whole space. One may ask how these properties are related to the arrangement and its intersection semilattice. The intersection semilattice of A, written L(A), is the set of all subspaces that are obtained by intersecting some of the hyperplanes; among these subspaces are S itself, all the individual hyperplanes, all intersections of pairs of hyperplanes, etc. (excluding, in the affine case, the empty set). These intersection subspaces of A are also called the flats ofA. The intersection semilattice L(A) is partially ordered by reverse inclusion.

In mathematics and mathematical optimization, the convex conjugate of a function is a generalization of the Legendre transformation which applies to non-convex functions. It is also known as Legendre–Fenchel transformation, Fenchel transformation, or Fenchel conjugate. It allows in particular for a far reaching generalization of Lagrangian duality.

<span class="mw-page-title-main">Convex cone</span> Mathematical set closed under positive linear combinations

In linear algebra, a cone—sometimes called a linear cone for distinguishing it from other sorts of cones—is a subset of a vector space that is closed under positive scalar multiplication; that is, C is a cone if implies for every positive scalar s.

In mathematics, a real or complex-valued function f on d-dimensional Euclidean space satisfies a Hölder condition, or is Hölder continuous, when there are real constants C ≥ 0, α > 0, such that

<span class="mw-page-title-main">Supporting hyperplane</span>

In geometry, a supporting hyperplane of a set in Euclidean space is a hyperplane that has both of the following two properties:

<span class="mw-page-title-main">Hyperplane separation theorem</span> On the existence of hyperplanes separating disjoint convex sets

In geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in n-dimensional Euclidean space. There are several rather similar versions. In one version of the theorem, if both these sets are closed and at least one of them is compact, then there is a hyperplane in between them and even two parallel hyperplanes in between them separated by a gap. In another version, if both disjoint convex sets are open, then there is a hyperplane in between them, but not necessarily any gap. An axis which is orthogonal to a separating hyperplane is a separating axis, because the orthogonal projections of the convex bodies onto the axis are disjoint.

Affine geometry, broadly speaking, is the study of the geometrical properties of lines, planes, and their higher dimensional analogs, in which a notion of "parallel" is retained, but no metrical notions of distance or angle are. Affine spaces differ from linear spaces in that they do not have a distinguished choice of origin. So, in the words of Marcel Berger, "An affine space is nothing more than a vector space whose origin we try to forget about, by adding translations to the linear maps." Accordingly, a complex affine space, that is an affine space over the complex numbers, is like a complex vector space, but without a distinguished point to serve as the origin.

<span class="mw-page-title-main">Ordered vector space</span> Vector space with a partial order

In mathematics, an ordered vector space or partially ordered vector space is a vector space equipped with a partial order that is compatible with the vector space operations.

A self-concordant function is a function satisfying a certain differential inequality, which makes it particularly easy for optimization using Newton's method A self-concordant barrier is a particular self-concordant function, that is also a barrier function for a particular convex set. Self-concordant barriers are important ingredients in interior point methods for optimization.

In mathematics, especially convex analysis, the recession cone of a set is a cone containing all vectors such that recedes in that direction. That is, the set extends outward in all the directions given by the recession cone.

References

  1. T. Bonnesen, W. Fenchel, Theorie der konvexen Körper, Julius Springer, Berlin, 1934. English translation: Theory of convex bodies, BCS Associates, Moscow, ID, 1987.
  2. R. J. Gardner, Geometric tomography, Cambridge University Press, New York, 1995. Second edition: 2006.
  3. 1 2 R. Schneider, Convex bodies: the Brunn-Minkowski theory, Cambridge University Press, Cambridge, 1993.