fbpx
Wikipedia

Blaschke selection theorem

The Blaschke selection theorem is a result in topology and convex geometry about sequences of convex sets. Specifically, given a sequence of convex sets contained in a bounded set, the theorem guarantees the existence of a subsequence and a convex set such that converges to in the Hausdorff metric. The theorem is named for Wilhelm Blaschke.

Alternate statements edit

Application edit

As an example of its use, the isoperimetric problem can be shown to have a solution.[1] That is, there exists a curve of fixed length that encloses the maximum area possible. Other problems likewise can be shown to have a solution:

Notes edit

  1. ^ a b c Paul J. Kelly; Max L. Weiss (1979). Geometry and Convexity: A Study in Mathematical Methods. Wiley. pp. Section 6.4.
  2. ^ Wetzel, John E. (July 2005). "The Classical Worm Problem --- A Status Report". Geombinatorics. 15 (1): 34–42.

References edit

blaschke, selection, theorem, result, topology, convex, geometry, about, sequences, convex, sets, specifically, given, sequence, displaystyle, convex, sets, contained, bounded, theorem, guarantees, existence, subsequence, displaystyle, convex, displaystyle, su. The Blaschke selection theorem is a result in topology and convex geometry about sequences of convex sets Specifically given a sequence K n displaystyle K n of convex sets contained in a bounded set the theorem guarantees the existence of a subsequence K n m displaystyle K n m and a convex set K displaystyle K such that K n m displaystyle K n m converges to K displaystyle K in the Hausdorff metric The theorem is named for Wilhelm Blaschke Contents 1 Alternate statements 2 Application 3 Notes 4 ReferencesAlternate statements editA succinct statement of the theorem is that the metric space of convex bodies is locally compact Using the Hausdorff metric on sets every infinite collection of compact subsets of the unit ball has a limit point and that limit point is itself a compact set Application editAs an example of its use the isoperimetric problem can be shown to have a solution 1 That is there exists a curve of fixed length that encloses the maximum area possible Other problems likewise can be shown to have a solution Lebesgue s universal covering problem for a convex universal cover of minimal size for the collection of all sets in the plane of unit diameter 1 the maximum inclusion problem 1 and the Moser s worm problem for a convex universal cover of minimal size for the collection of planar curves of unit length 2 Notes edit a b c Paul J Kelly Max L Weiss 1979 Geometry and Convexity A Study in Mathematical Methods Wiley pp Section 6 4 Wetzel John E July 2005 The Classical Worm Problem A Status Report Geombinatorics 15 1 34 42 References editA B Ivanov 2001 1994 Blaschke selection theorem Encyclopedia of Mathematics EMS Press V A Zalgaller 2001 1994 Metric space of convex sets Encyclopedia of Mathematics EMS Press Kai Seng Chou Xi Ping Zhu 2001 The Curve Shortening Problem CRC Press p 45 ISBN 1 58488 213 1 Retrieved from https en wikipedia org w index php title Blaschke selection theorem amp oldid 1115679096, 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.