Blaschke Sum
   HOME

TheInfoList



OR:

In
convex geometry 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 num ...
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 Facets () are flat faces on geometric shapes. The organization of naturally occurring facets was key to early developments in crystallography, since they reflect the underlying symmetry of the crystal structure. Gemstones commonly have facets cu ...
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. Blaschke sums exist and are unique up to
translation Translation is the communication of the semantics, meaning of a #Source and target languages, source-language text by means of an Dynamic and formal equivalence, equivalent #Source and target languages, target-language text. The English la ...
, as can be proven using the theory of the Minkowski problem for polytopes. They can be used to decompose arbitrary polytopes into
simplices In geometry, a simplex (plural: simplexes or simplices) 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 in any given dimension. ...
, and
centrally symmetric In geometry, a point reflection (also called a point inversion or central inversion) is a geometric transformation of affine space in which every point is reflected across a designated inversion center, which remains fixed. In Euclidean or ...
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 mathematician and professor at the University of Königsberg, the University of Zürich, and the University of Göttingen, described variously as German, Polish, Lithuanian-German, o ...
, Blaschke sums are named for
Wilhelm Blaschke Wilhelm Johann Eugen Blaschke (13 September 1885 – 17 March 1962) was an Austrian mathematician working in the fields of differential and integral geometry. Education and career Blaschke was the son of mathematician Josef Blaschke, who taugh ...
, 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 In differential geometry, the Gauss map of a surface is a function that maps each point in the surface to its normal direction, a unit vector that is orthogonal to the surface at that point. Namely, given a surface ''X'' in Euclidean space R3 ...
.


Definition

For any d-dimensional polytope, one can specify its collection of facet directions and measures by a
finite set In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, is a finite set with five elements. Th ...
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 mathematician and professor at the University of Königsberg, the University of Zürich, and the University of Göttingen, described variously as German, Polish, Lithuanian-German, o ...
proved, a finite set of nonzero vectors describes a polytope in this way
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
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 semantics, meaning of a #Source and target languages, source-language text by means of an Dynamic and formal equivalence, equivalent #Source and target languages, target-language text. The English la ...
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 polygon In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is ...
s and
line segment In geometry, a line segment is a part of a line (mathematics), straight line that is bounded by two distinct endpoints (its extreme points), and contains every Point (geometry), point on the line that is between its endpoints. It is a special c ...
s in the
Euclidean plane In mathematics, a Euclidean plane is a Euclidean space of Two-dimensional space, dimension two, denoted \textbf^2 or \mathbb^2. It is a geometric space in which two real numbers are required to determine the position (geometry), position of eac ...
, their Blaschke sum coincides with their
Minkowski sum 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'': A + B = \ The Minkowski difference (also ''Minkowski subtraction'', ''Minkowsk ...
.


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 In geometry, a simplex (plural: simplexes or simplices) 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 in any given dimension. ...
(not necessarily of the same dimension). Every d-dimensional
centrally symmetric In geometry, a point reflection (also called a point inversion or central inversion) is a geometric transformation of affine space in which every point is reflected across a designated inversion center, which remains fixed. In Euclidean or ...
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 on the
Gauss map In differential geometry, the Gauss map of a surface is a function that maps each point in the surface to its normal direction, a unit vector that is orthogonal to the surface at that point. Namely, given a surface ''X'' in Euclidean space R3 ...
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 theorem ...
on volumes of
Minkowski sum 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'': A + B = \ The Minkowski difference (also ''Minkowski subtraction'', ''Minkowsk ...
s 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 Graduate Texts in Mathematics (GTM) () is a series of graduate-level textbooks in mathematics published by Springer-Verlag. The books in this series, like the other Springer-Verlag mathematics series, are yellow books of a standard size (with va ...
, 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