Article · Wikipedia archive · Last revised Aug 1, 2026

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.

Last revised
Aug 1, 2026
Read time
≈ 1 min
Length
301 w
Citations
4
Source

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.

Alternate statements

Application

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:

  • 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

Notes

  1. 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

References