Convex body

Last updated
A dodecahedron is a convex body. POV-Ray-Dodecahedron.svg
A dodecahedron is a convex body.

In mathematics, a convex body in -dimensional Euclidean space is a compact convex set with non-empty interior. Some authors do not require a non-empty interior, merely that the set is non-empty.

Contents

A convex body is called symmetric if it is centrally symmetric with respect to the origin; that is to say, a point lies in if and only if its antipode, also lies in Symmetric convex bodies are in a one-to-one correspondence with the unit balls of norms on

Important examples of convex bodies are the Euclidean ball, the hypercube and the cross-polytope.

Metric space structure

Write for the set of convex bodies in . Then is a complete metric space with metric

. [1]

Further, the Blaschke Selection Theorem says that every d-bounded sequence in has a convergent subsequence. [1]

Polar body

If is a bounded convex body containing the origin in its interior, the polar body is . The polar body has several nice properties including , is bounded, and if then . The polar body is a type of duality relation.

See also

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.

In mathematics, a topological vector space is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is also a topological space with the property that the vector space operations are also continuous functions. Such a topology is called a vector topology and every topological vector space has a uniform topological structure, allowing a notion of uniform convergence and completeness. Some authors also require that the space is a Hausdorff space. One of the most widely studied categories of TVSs are locally convex topological vector spaces. This article focuses on TVSs that are not necessarily locally convex. Other well-known examples of TVSs include Banach spaces, Hilbert spaces and Sobolev spaces.

<span class="mw-page-title-main">Minkowski's theorem</span> Every symmetric convex set in R^n with volume > 2^n contains a non-zero integer point

In mathematics, Minkowski's theorem is the statement that every convex set in which is symmetric with respect to the origin and which has volume greater than contains a non-zero integer point. The theorem was proved by Hermann Minkowski in 1889 and became the foundation of the branch of number theory called the geometry of numbers. It can be extended from the integers to any lattice and to any symmetric convex set with volume greater than , where denotes the covolume of the lattice.

In the area of mathematics known as functional analysis, a reflexive space is a locally convex topological vector space for which the canonical evaluation map from into its bidual is a homeomorphism. A normed space is reflexive if and only if this canonical evaluation map is surjective, in which case this evaluation map is an isometric isomorphism and the normed space is a Banach space. Those spaces for which the canonical evaluation map is surjective are called semi-reflexive spaces.

In mathematics, the uniform boundedness principle or Banach–Steinhaus theorem is one of the fundamental results in functional analysis. Together with the Hahn–Banach theorem and the open mapping theorem, it is considered one of the cornerstones of the field. In its basic form, it asserts that for a family of continuous linear operators whose domain is a Banach space, pointwise boundedness is equivalent to uniform boundedness in operator norm.

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

In geometry, a zonohedron is a convex polyhedron that is centrally symmetric, every face of which is a polygon that is centrally symmetric. Any zonohedron may equivalently be described as the Minkowski sum of a set of line segments in three-dimensional space, or as a three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorove, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope.

In linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space is a set such that for all scalars satisfying

In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates a sequence of ellipsoids whose volume uniformly decreases at every step, thus enclosing a minimizer of a convex function.

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 Prékopa–Leindler inequality is an integral inequality closely related to the reverse Young's inequality, the Brunn–Minkowski inequality and a number of other important and classical inequalities in analysis. The result is named after the Hungarian mathematicians András Prékopa and László Leindler.

In mathematics, Anderson's theorem is a result in real analysis and geometry which says that the integral of an integrable, symmetric, unimodal, non-negative function f over an n-dimensional convex body K does not decrease if K is translated inwards towards the origin. This is a natural statement, since the graph of f can be thought of as a hill with a single peak over the origin; however, for n ≥ 2, the proof is not entirely obvious, as there may be points x of the body K where the value f(x) is larger than at the corresponding translate of x.

<span class="mw-page-title-main">Shapley–Folkman lemma</span> Sums of sets of vectors are nearly convex

The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. It is named after mathematicians Lloyd Shapley and Jon Folkman, but was first published by the economist Ross M. Starr.

In mathematics, Minkowski's second theorem is a result in the geometry of numbers about the values taken by a norm on a lattice and the volume of its fundamental cell.

In mathematics, a matroid polytope, also called a matroid basis polytope to distinguish it from other polytopes derived from a matroid, is a polytope constructed via the bases of a matroid. Given a matroid , the matroid polytope is the convex hull of the indicator vectors of the bases of .

In mathematics, particularly functional analysis, spaces of linear maps between two vector spaces can be endowed with a variety of topologies. Studying space of linear maps and these topologies can give insight into the spaces themselves.

In geometry, a valuation is a finitely additive function from a collection of subsets of a set to an abelian semigroup. For example, Lebesgue measure is a valuation on finite unions of convex bodies of Other examples of valuations on finite unions of convex bodies of are surface area, mean width, and Euler characteristic.

<span class="mw-page-title-main">Macbeath region</span> Brief description on Macbeath Regions

In mathematics, a Macbeath region is an explicitly defined region in convex analysis on a bounded convex subset of d-dimensional Euclidean space . The idea was introduced by Alexander Macbeath and dubbed by G. Ewald, D. G. Larman and C. A. Rogers in 1970. Macbeath regions have been used to solve certain complex problems in the study of the boundaries of convex bodies. Recently they have been used in the study of convex approximations and other aspects of computational geometry.

References

  1. 1 2 Hug, Daniel; Weil, Wolfgang (2020). "Lectures on Convex Geometry". Graduate Texts in Mathematics. 286. doi:10.1007/978-3-030-50180-8. ISBN   978-3-030-50179-2. ISSN   0072-5285.