fbpx
Wikipedia

Blaschke sum

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]

Blaschke sums exist and are unique up to translation, as can be proven using the theory of the Minkowski problem for polytopes. They can be used to decompose arbitrary polytopes into simplices, and centrally symmetric polytopes into parallelotopes.[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 edit

For any  -dimensional polytope, one can specify its collection of facet directions and measures by a finite set of  -dimensional nonzero vectors, one per facet, pointing perpendicularly outward from the facet, with length equal to the  -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  -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   of two polytopes   and   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 edit

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

Generalizations edit

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 edit

The volume   of the Blaschke sum of two  -dimensional polytopes or convex bodies   and   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]

 

References edit

  1. ^ a b c d e 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
  2. ^ a b Grünbaum (2003), p. 339
  3. ^ Grünbaum (2003), p. 337.
  4. ^ a b 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
  5. ^ Gronchi, Paolo (1998), "Bodies of constant brightness", Archiv der Mathematik, 70 (6): 489–498, doi:10.1007/s000130050224, MR 1622002

blaschke, convex, geometry, geometry, convex, polytopes, polytopes, polytope, that, facet, parallel, each, facet, given, polytopes, with, same, measure, when, both, polytopes, have, parallel, facets, measure, corresponding, facet, measures, from, given, polyto. 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 Blaschke sums exist and are unique up to translation as can be proven using the theory of the Minkowski problem for polytopes They can be used to decompose arbitrary polytopes into simplices and centrally symmetric polytopes into parallelotopes 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 Contents 1 Definition 2 Decomposition 3 Generalizations 4 Kneser Suss inequality 5 ReferencesDefinition editFor any d displaystyle d nbsp dimensional polytope one can specify its collection of facet directions and measures by a finite set of d displaystyle d nbsp dimensional nonzero vectors one per facet pointing perpendicularly outward from the facet with length equal to the d 1 displaystyle d 1 nbsp 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 displaystyle d nbsp 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 displaystyle X Y nbsp of two polytopes X displaystyle X nbsp and Y displaystyle Y nbsp 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 editBlaschke sums can be used to decompose polytopes into simpler polytopes In particular every d displaystyle d nbsp dimensional convex polytope with n displaystyle n nbsp facets can be represented as a Blaschke sum of at most n d displaystyle n d nbsp simplices not necessarily of the same dimension Every d displaystyle d nbsp dimensional centrally symmetric convex polytope can be represented as a Blaschke sum of parallelotopes And every d displaystyle d nbsp dimensional convex polytope can be represented as a Blaschke sum of d displaystyle d nbsp dimensional convex polytopes each having at most 2 d displaystyle 2d nbsp facets 1 Generalizations editThe 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 Suss inequality editThe volume V X Y displaystyle V X Y nbsp of the Blaschke sum of two d displaystyle d nbsp dimensional polytopes or convex bodies X displaystyle X nbsp and Y displaystyle Y nbsp obeys an inequality known as the Kneser Suss inequality an analogue of the Brunn Minkowski theorem on volumes of Minkowski sums of convex bodies 4 V X Y d 1 d V X d 1 d V Y d 1 d displaystyle V X Y d 1 d geq V X d 1 d V Y d 1 d nbsp References edit a b c d e Grunbaum 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 a b Grunbaum 2003 p 339 Grunbaum 2003 p 337 a b 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 Retrieved from https en wikipedia org w index php title Blaschke sum amp oldid 1115654586, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.