HOME

TheInfoList



OR:

In convex geometry and the geometry of
convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the wo ...
s, 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 Measure may refer to: * Measurement, the assignment of a number to a characteristic of an object or event Law * Ballot measure, proposed legislation in the United States * Church of England Measure, legislation of the Church of England * Mea ...
. 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. Blaschke sums exist and are unique up to translation, as can be proven using the theory of the
Minkowski problem for polytopes In the geometry of convex polytopes, the Minkowski problem for polytopes concerns the specification of the shape of a polytope by the directions and Measure (mathematics), measures of its Facet (geometry), facets. The theorem that every polytope is ...
. They can be used to decompose arbitrary polytopes into simplices, and centrally symmetric polytopes into parallelotopes. Although Blaschke sums of polytopes are used implicitly in the work of
Hermann Minkowski Hermann Minkowski (; ; 22 June 1864 – 12 January 1909) was a German mathematician and professor at Königsberg, Zürich and Göttingen. He created and developed the geometry of numbers and used geometrical methods to solve problems in number t ...
, 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.


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 Hermann Minkowski (; ; 22 June 1864 – 12 January 1909) was a German mathematician and professor at Königsberg, Zürich and Göttingen. He created and developed the geometry of numbers and used geometrical methods to solve problems in number t ...
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 Translation is the communication of the meaning of a source-language text by means of an equivalent target-language text. The English language draws a terminological distinction (which does not exist in every language) between ''transla ...
of each other. 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. For convex polygons and
line segment In geometry, a line segment is a part of a straight line that is bounded by two distinct end points, and contains every point on the line that is between its endpoints. The length of a line segment is given by the Euclidean distance between ...
s in the Euclidean plane, their Blaschke sum coincides with their Minkowski sum.


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.


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 Measure may refer to: * Measurement, the assignment of a number to a characteristic of an object or event Law * Ballot measure, proposed legislation in the United States * Church of England Measure, legislation of the Church of England * Mea ...
on the Gauss map of the set instead of using a finite set of vectors, and adding sets by adding their measures. If two bodies of constant brightness are combined in this way, the result is another body of constant brightness.


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 In mathematics, the Brunn–Minkowski theorem (or Brunn–Minkowski inequality) is an inequality relating the volumes (or more generally Lebesgue measures) of compact subsets of Euclidean space. The original version of the Brunn–Minkowski theore ...
on volumes of Minkowski sums of convex bodies: :V(X\# Y)^\ge V(X)^+V(Y)^.


References

{{reflist, refs= {{citation , last = Gronchi , first = Paolo , doi = 10.1007/s000130050224 , issue = 6 , journal = Archiv der Mathematik , mr = 1622002 , pages = 489–498 , title = Bodies of constant brightness , volume = 70 , year = 1998 {{citation , last = Grünbaum , first = Branko , authorlink = Branko Grünbaum , contribution = 15.3 Blaschke Addition , doi = 10.1007/978-1-4613-0019-9 , edition = 2nd , isbn = 0-387-00424-6 , mr = 1976856 , pages = 331–337 , publisher = Springer-Verlag , location = New York , series = Graduate Texts in Mathematics , title = Convex Polytopes , title-link = Convex Polytopes , volume = 221 , year = 2003 {{harvtxt, Grünbaum, 2003, p. 339 {{citation , last = Schneider , first = Rolf , contribution = 8.2.2 Blaschke addition , contribution-url = https://books.google.com/books?id=kUaqCQAAQBAJ&pg=PA459 , doi = 10.1017/CBO9780511526282 , isbn = 0-521-35220-7 , mr = 1216521 , pages = 459–461 , publisher = Cambridge University Press, Cambridge , series = Encyclopedia of Mathematics and its Applications , title = Convex bodies: the Brunn-Minkowski theory , volume = 44 , year = 1993 Convex geometry Polytopes Binary operations