Blaschke sum

Last updated October 13, 2022

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.^[1]

Although Blaschke sums of polytopes are used implicitly in the work of Hermann Minkowski, Blaschke sums are named for Wilhelm Blaschke, who defined a corresponding operation for smooth convex sets. The Blaschke sum operation can be extended to arbitrary convex bodies, generalizing both the polytope and smooth cases, using measures on the Gauss map.^[2]

Definition

For any $d$ -dimensional polytope, one can specify its collection of facet directions and measures by a finite set of $d$ -dimensional nonzero vectors, one per facet, pointing perpendicularly outward from the facet, with length equal to the $(d-1)$ -dimensional measure of its facet. As Hermann Minkowski proved, a finite set of nonzero vectors describes a polytope in this way if and only if it spans the whole $d$ -dimensional space, no two are collinear with the same sign, and the sum of the set is the zero vector. The polytope described by this set has a unique shape, in the sense that any two polytopes described by the same set of vectors are translates of each other.^[1]

The Blaschke sum $X\#Y$ of two polytopes $X$ and $Y$ is defined by combining the vectors describing their facet directions and measures, in the obvious way: form the union of the two sets of vectors, except that when both sets contain vectors that are parallel and have the same sign, replace each such pair of parallel vectors by its sum. This operation preserves the necessary conditions for Minkowski's theorem on the existence of a polytope described by the resulting set of vectors, and this polytope is the Blaschke sum. The two polytopes need not have the same dimension as each other, as long as they are both defined in a common space of high enough dimension to contain both: lower-dimensional polytopes in a higher-dimensional space are defined in the same way by sets of vectors that span a lower-dimensional subspace of the higher-dimensional space, and these sets of vectors can be combined without regard to the dimensions of the spaces they span.^[1]

For convex polygons and line segments in the Euclidean plane, their Blaschke sum coincides with their Minkowski sum.^[3]

Decomposition

Blaschke sums can be used to decompose polytopes into simpler polytopes. In particular, every $d$ -dimensional convex polytope with $n$ facets can be represented as a Blaschke sum of at most $n-d$ simplices (not necessarily of the same dimension). Every $d$ -dimensional centrally symmetric convex polytope can be represented as a Blaschke sum of parallelotopes. And every $d$ -dimensional convex polytope can be represented as a Blaschke sum of $d$ -dimensional convex polytopes, each having at most $2d$ facets.^[1]

Generalizations

The Blaschke sum can be extended from polytopes to arbitrary bounded convex sets, by representing the amount of surface in each direction using a measure on the Gauss map of the set instead of using a finite set of vectors, and adding sets by adding their measures.^[2]^[4] If two bodies of constant brightness are combined in this way, the result is another body of constant brightness.^[5]

Kneser–Süss inequality

The volume $V(X\#Y)$ of the Blaschke sum of two $d$ -dimensional polytopes or convex bodies $X$ and $Y$ obeys an inequality known as the Kneser–Süss inequality, an analogue of the Brunn–Minkowski theorem on volumes of Minkowski sums of convex bodies:^[4]

V(X\#Y)^{(d-1)/d}\geq V(X)^{(d-1)/d}+V(Y)^{(d-1)/d}.

Related Research Articles

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">Polyhedron</span> 3D shape with flat faces, straight edges and sharp corners

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

In elementary geometry, a polytope is a geometric object with flat sides (faces). It is a generalization in any number of dimensions of the three-dimensional polyhedron. Polytopes may exist in any general number of dimensions $n$ as an $n$ -dimensional polytope or $n$ -polytope. In this context, "flat sides" means that the sides of a $(k + 1)$ -polytope consist of $k$ -polytopes that may have $(k - 1)$ -polytopes in common. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope.

<span class="mw-page-title-main">Simplex</span> Multi-dimensional generalization of triangle

In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope made with line segments in any given dimension.

<span class="mw-page-title-main">Hypercube</span> Convex polytope, the n-dimensional analogue of a square and a cube

In geometry, a hypercube is an n-dimensional analogue of a square and a cube. It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in n dimensions is equal to $.$

In geometry, the convex hull or 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.

In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their n-dimensional counterparts. Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an abstract simplicial complex.

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, i.e., the set

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 the three-dimensional projection of a hypercube. Zonohedra were originally defined and studied by E. S. Fedorov, a Russian crystallographer. More generally, in any dimension, the Minkowski sum of line segments forms a polytope known as a zonotope.

In mathematics, the real coordinate space of dimension $n$ , denoted $R n$ or $,$ is the set of the $n$ -tuples of real numbers, that is the set of all sequences of $n$ real numbers. With component-wise addition and scalar multiplication, it is a real vector space, and its elements are called coordinate vectors.

In mathematics, Hilbert's fourth problem in the 1900 list of Hilbert's problems is a foundational question in geometry. In one statement derived from the original, it was to find — up to an isomorphism — all geometries that have an axiomatic system of the classical geometry, with those axioms of congruence that involve the concept of the angle dropped, and `triangle inequality', regarded as an axiom, added.

<span class="mw-page-title-main">Convex polytope</span> Convex hull of a finite set of points in a Euclidean space

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the $-dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.$

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 scalar multiplication; that is, $C$ is a cone if $implies for every scalar s .$

In mathematics, specifically in combinatorial commutative algebra, a convex lattice polytope P is called normal if it has the following property: given any positive integer n, every lattice point of the dilation nP, obtained from P by scaling its vertices by the factor n and taking the convex hull of the resulting points, can be written as the sum of exactly n lattice points in P. This property plays an important role in the theory of toric varieties, where it corresponds to projective normality of the toric variety determined by P. Normal polytopes have popularity in algebraic combinatorics. These polytopes also represent the homogeneous case of the Hilbert bases of finite positive rational cones and the connection to algebraic geometry is that they define projectively normal embeddings of toric varieties.

In geometry, a parallelohedron is a polyhedron that can be translated without rotations in 3-dimensional Euclidean space to fill space with a honeycomb in which all copies of the polyhedron meet face-to-face. There are five types of parallelohedron, first identified by Evgraf Fedorov in 1885 in his studies of crystallographic systems: the cube, hexagonal prism, rhombic dodecahedron, elongated dodecahedron, and truncated octahedron.

In geometry and polyhedral combinatorics, a $k$ -neighborly polytope is a convex polytope in which every set of $k$ or fewer vertices forms a face. For instance, a 2-neighborly polytope is a polytope in which every pair of vertices is connected by an edge, forming a complete graph. 2-neighborly polytopes with more than four vertices may exist only in spaces of four or more dimensions, and in general a $k$ -neighborly polytope requires a dimension of $2 k$ or more. A $d$ -simplex is $d$ -neighborly. A polytope is said to be neighborly, without specifying $k$ , if it is $k$ -neighborly for $k = ⌊ d ⁄ 2 ⌋$ . If we exclude simplices, this is the maximum possible $k$ : in fact, every polytope that is $k$ -neighborly for some $k \geq 1 + ⌊ d ⁄ 2 ⌋$ is a simplex.

In geometry, the simplectic honeycomb is a dimensional infinite series of honeycombs, based on the $affine Coxeter group symmetry. It is represented by a Coxeter-Dynkin diagram as a cyclic graph of n + 1 nodes with one node ringed. It is composed of n -simplex facets, along with all rectified n -simplices. It can be thought of as an n -dimensional hypercubic honeycomb that has been subdivided along all hyperplanes, then stretched along its main diagonal until the simplices on the ends of the hypercubes become regular. The vertex figure of an n - simplex honeycomb is an expanded n -simplex.$

In geometry, a Hanner polytope is a convex polytope constructed recursively by Cartesian product and polar dual operations. Hanner polytopes are named after Olof Hanner, who introduced them in 1956.

In mathematics, the order polytope of a finite partially ordered set is a convex polytope defined from the set. The points of the order polytope are the monotonic functions from the given set to the unit interval, its vertices correspond to the upper sets of the partial order, and its dimension is the number of elements in the partial order. The order polytope is a distributive polytope, meaning that coordinatewise minima and maxima of pairs of its points remain within the polytope.

In the geometry of convex polytopes, the Minkowski problem for polytopes concerns the specification of the shape of a polytope by the directions and measures of its facets. The theorem that every polytope is uniquely determined up to translation by this information was proven by Hermann Minkowski; it has been called "Minkowski's theorem", although the same name has also been given to several unrelated results of Minkowski. The Minkowski problem for polytopes should also be distinguished from the Minkowski problem, on specifying convex shapes by their curvature.

References

1 2 3 4 5 Grünbaum, Branko (2003), "15.3 Blaschke Addition", Convex Polytopes, Graduate Texts in Mathematics, vol. 221 (2nd ed.), New York: Springer-Verlag, pp. 331–337, doi:10.1007/978-1-4613-0019-9, ISBN 0-387-00424-6, MR 1976856
1 2 Grünbaum (2003), p. 339
↑ Grünbaum (2003), p. 337.
1 2 Schneider, Rolf (1993), "8.2.2 Blaschke addition", Convex bodies: the Brunn-Minkowski theory, Encyclopedia of Mathematics and its Applications, vol. 44, Cambridge University Press, Cambridge, pp. 459–461, doi:10.1017/CBO9780511526282, ISBN 0-521-35220-7, MR 1216521
↑ Gronchi, Paolo (1998), "Bodies of constant brightness", Archiv der Mathematik, 70 (6): 489–498, doi:10.1007/s000130050224, MR 1622002

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[grunbaum-1] 1 2 3 4 5 Grünbaum, Branko (2003), "15.3 Blaschke Addition", Convex Polytopes, Graduate Texts in Mathematics, vol. 221 (2nd ed.), New York: Springer-Verlag, pp. 331–337, doi:10.1007/978-1-4613-0019-9, ISBN 0-387-00424-6, MR 1976856

[grun2-2] 1 2 Grünbaum (2003), p. 339

[FOOTNOTEGrünbaum2003337-3] Grünbaum (2003), p. 337.

[schneider-4] 1 2 Schneider, Rolf (1993), "8.2.2 Blaschke addition", Convex bodies: the Brunn-Minkowski theory, Encyclopedia of Mathematics and its Applications, vol. 44, Cambridge University Press, Cambridge, pp. 459–461, doi:10.1017/CBO9780511526282, ISBN 0-521-35220-7, MR 1216521

[gronchi-5] Gronchi, Paolo (1998), "Bodies of constant brightness", Archiv der Mathematik, 70 (6): 489–498, doi:10.1007/s000130050224, MR 1622002

[1]

[2]

[3]

[4]

[5]