Helly's theorem
Helly's theorem is a basic result in discrete geometry describing the ways that convex sets may intersect each other. It was discovered by Eduard Helly in 1913,[1] but not published by him until 1923, by which time alternative proofs by Radon (1921) and König (1922) had already appeared. Helly's theorem gave rise to the notion of a Helly family.
Contents |
[edit] Statement
Suppose that
is a finite collection of convex subsets of
, where
. If the intersection of every
of these sets is nonempty, then the whole collection has a nonempty intersection; that is,
For infinite collections one has to assume compactness: If
is a collection of compact convex subsets of
and every subcollection of cardinality at most
has nonempty intersection, then the whole collection has nonempty intersection.
[edit] Proof
We prove the finite version, using Radon's theorem as in the proof by Radon (1921). The infinite version then follows by the finite intersection property characterization of compactness: a collection of closed subsets of a compact space has a non-empty intersection if and only if every finite subcollection has a non-empty intersection (once you fix a single set, the intersection of all others with it are closed subsets of a fixed compact space).
Suppose first that
. By our assumptions, there is a point
that is in the common intersection of
Likewise, for every
there is a point
that is in the common intersection of all
with the possible exception of
. We now apply Radon's theorem to the set
Radon's theorem tells us that there are disjoint subsets
such that the convex hull of
intersects the convex hull of
. Suppose that
is a point in the intersection of these two convex hulls. We claim that
Indeed, consider any
. Note that the only element of
that is not in
is
. If
, then
, and therefore
. Since
is convex, it then also contains the convex hull of
and therefore also
. Likewise, if
, then
, and by the same reasoning
. Since
is in every
, it must also be in the intersection.
Above, we have assumed that the points
are all distinct. If this is not the case, say
for some
, then
is in every one of the sets
, and again we conclude that the intersection is nonempty. This completes the proof in the case
.
Now suppose that
and that the statement is true for
, by induction. The above argument shows that any subcollection of
sets will have nonempty intersection. We may then consider the collection where we replace the two sets
and
with the single set
In this new collection, every subcollection of
sets will have nonempty intersection. The inductive hypothesis therefore applies, and shows that this new collection has nonempty intersection. This implies the same for the original collection, and completes the proof.
[edit] See also
[edit] Notes
[edit] References
- Bollobás, B. (2006), "Problem 29, Intersecting Convex Sets: Helly's Theorem", The Art of Mathematics: Coffee Time in Memphis, Cambridge University Press, pp. 90–91, ISBN 0521693950.
- Danzer, L.; Grünbaum, B.; Klee, V. (1963), "Helly's theorem and its relatives", Convexity, Proc. Symp. Pure Math., 7, American Mathematical Society, pp. 101–179.
- Eckhoff, J. (1993), "Helly, Radon, and Carathéodory type theorems", Handbook of Convex Geometry, A, B, Amsterdam: North-Holland, pp. 389–448.
- Heinrich Guggenheimer (1977) Applicable Geometry, page 137, Krieger, Huntington ISBN 0882753681 .
- Helly, E. (1923), "Über Mengen konvexer Körper mit gemeinschaftlichen Punkten", Jahresbericht Deutsch. Math. Vereining. 32: 175–176.
- König, D. (1922), "Über konvexe Körper", Mathematische Zeitschrift 14 (1): 208–220, doi:10.1007/BF01215899.
- Radon, J. (1921), "Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten", Mathematische Annalen 83 (1–2): 113–115, doi:10.1007/BF01464231.






