Convex geometry

Last updated

In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc.

Contents

Classification

According to the Mathematics Subject Classification MSC2010, [1] the mathematical discipline Convex and Discrete Geometry includes three major branches: [2]

(though only portions of the latter two are included in convex geometry).

General convexity is further subdivided as follows: [3]

Historical note

Convex geometry is a relatively young mathematical discipline. Although the first known contributions to convex geometry date back to antiquity and can be traced in the works of Euclid and Archimedes, it became an independent branch of mathematics at the turn of the 20th century, mainly due to the works of Hermann Brunn and Hermann Minkowski in dimensions two and three. A big part of their results was soon generalized to spaces of higher dimensions, and in 1934 T. Bonnesen and W. Fenchel gave a comprehensive survey of convex geometry in Euclidean space Rn. Further development of convex geometry in the 20th century and its relations to numerous mathematical disciplines are summarized in the Handbook of convex geometry edited by P. M. Gruber and J. M. Wills.

See also

Notes

Related Research Articles

<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.

<span class="mw-page-title-main">Convex hull</span> Smallest convex set containing a given set

In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.

<span class="mw-page-title-main">Geometry of numbers</span>

Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in and the study of these lattices provides fundamental information on algebraic numbers. The geometry of numbers was initiated by Hermann Minkowski.

In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In -dimensional space the inequality lower bounds the surface area or perimeter of a set by its volume ,

<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:

<span class="mw-page-title-main">Werner Fenchel</span>

Moritz Werner Fenchel was a German-born Danish mathematician known for his contributions to geometry and to optimization theory. Fenchel established the basic results of convex analysis and nonlinear optimization theory which would, in time, serve as the foundation for nonlinear programming. A German-born Jew and early refugee from Nazi suppression of intellectuals, Fenchel lived most of his life in Denmark. Fenchel's monographs and lecture notes are considered influential.

In mathematics, the Brunn–Minkowski theorem is an inequality relating the volumes of compact subsets of Euclidean space. The original version of the Brunn–Minkowski theorem applied to convex sets; the generalization to compact nonconvex sets stated here is due to Lazar Lyusternik (1935).

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.

In mathematics, particularly, in asymptotic convex geometry, Milman's reverse Brunn–Minkowski inequality is a result due to Vitali Milman that provides a reverse inequality to the famous Brunn–Minkowski inequality for convex bodies in n-dimensional Euclidean space Rn. Namely, it bounds the volume of the Minkowski sum of two bodies from above in terms of the volumes of the bodies.

In mathematics, geometric measure theory (GMT) is the study of geometric properties of sets through measure theory. It allows mathematicians to extend tools from differential geometry to a much larger class of surfaces that are not necessarily smooth.

In mathematics, the modulus of convexity and the characteristic of convexity are measures of "how convex" the unit ball in a Banach space is. In some sense, the modulus of convexity has the same relationship to the ε-δ definition of uniform convexity as the modulus of continuity does to the ε-δ definition of continuity.

In differential geometry, the Minkowski problem, named after Hermann Minkowski, asks for the construction of a strictly convex compact surface S whose Gaussian curvature is specified. More precisely, the input to the problem is a strictly positive real function ƒ defined on a sphere, and the surface that is to be constructed should have Gaussian curvature ƒ(n(x)) at the point x, where n(x) denotes the normal to S at x. Eugenio Calabi stated: "From the geometric view point it [the Minkowski problem] is the Rosetta Stone, from which several related problems can be solved."

<span class="mw-page-title-main">Convex curve</span> Type of plane curve

In geometry, a convex curve is a plane curve that has a supporting line through each of its points. There are many other equivalent definitions of these curves, going back to Archimedes. Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves include the closed convex curves, the smooth curves that are convex, and the strictly convex curves, which have the additional property that each supporting line passes through a unique point of the curve.

Convexity is an important topic in economics. In the Arrow–Debreu model of general economic equilibrium, agents have convex budget sets and convex preferences: At equilibrium prices, the budget hyperplane supports the best attainable indifference curve. The profit function is the convex conjugate of the cost function. Convex analysis is the standard tool for analyzing textbook economics. Non‑convex phenomena in economics have been studied with nonsmooth analysis, which generalizes convex analysis.

Hans Vilhem Rådström (1919–1970) was a Swedish mathematician who worked on complex analysis, continuous groups, convex sets, set-valued analysis, and game theory. From 1952, he was lektor at Stockholm University, and from 1969, he was Professor of Applied Mathematics at Linköping University.

<span class="mw-page-title-main">Blaschke–Lebesgue theorem</span> Plane geometry theorem on least area of all curves of given constant width

In plane geometry the Blaschke–Lebesgue theorem states that the Reuleaux triangle has the least area of all curves of given constant width. In the form that every curve of a given width has area at least as large as the Reuleaux triangle, it is also known as the Blaschke–Lebesgue inequality. It is named after Wilhelm Blaschke and Henri Lebesgue, who published it separately in the early 20th century.

<span class="mw-page-title-main">Tommy Bonnesen</span> Danish mathematician

Tommy Bonnesen was a Danish mathematician, known for Bonnesen's inequality.

In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure. When both polytopes have parallel facets, the measure of the corresponding facet in the Blaschke sum is the sum of the measures from the two given polytopes.

<span class="mw-page-title-main">Hedgehog (geometry)</span> Type of mathematical plane curve

In differential geometry, a hedgehog or plane hedgehog is a type of plane curve, the envelope of a family of lines determined by a support function. More intuitively, sufficiently well-behaved hedgehogs are plane curves with one tangent line in each oriented direction. A projective hedgehog is a restricted type of hedgehog, defined from an anti-symmetric support function, and forms a curve with one tangent line in each direction, regardless of orientation.

References

Expository articles on convex geometry

Books on convex geometry

Articles on history of convex geometry