Helly's theorem is a classical result of combinatorial geometry and convex analysis . The theorem gives a condition on a family of convex sets, guaranteeing that this family has a nonempty intersection.
Content
Wording
End families
Let's pretend that
there is a finite family of convex subsets of Euclidean space such that the intersection of any of which is nonempty.
Then the intersection of all subsets of this family is nonempty, i.e.
- .
Endless Families
For infinite families, it is necessary to additionally require compactness:
Let be there is an arbitrary family of convex compact subsets such that the intersection of any of which is nonempty. Then the intersection of all subsets of this family is nonempty.
Consequences
- Jung's Theorem: Let there are a finite set of points in -dimensional Euclidean space such that any points from can be covered with a single ball. Then everything is a lot can be covered with a single ball.
- Kirshbraun's theorem
Variations and generalizations
- Let be - Hilbert space (not necessarily separable ) and - a family of closed bounded convex subsets . If the intersection of an arbitrary finite subfamily not empty then also not empty.
History
The theorem was proved by Edward Helly in 1913, about which he told Radon , he published it only in 1923 [1] , after the publications of Radon [2] and Koenig [3] .
See also
- Nerve cover
- Carathéodory convex hull theorem
Notes
- ↑ E. Helly Über Mengen konvexer Körper mit gemeinschaftlichen Punkten , - Jber. Deutsch. Math. Vereinig. 32 (1923), 175-176.
- ↑ J. Radon Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten , - Math. Ann. 83 (1921), 113-115.
- ↑ D. König Über konvexe Körper, - Math. Z. 14 (1922), 208-220.
Literature
- Danzer L., Grunbaum B. , Helly's theorem and its applications. - M: Mir, 1968 .-- 159 p.