# Helly's Theorem

Helly's theorem is a statement about intersections of convex sets. A general theorem is as follows:

*C*be a finite family of convex sets in

**R**

^{n}such that, for

*C*have a nonempty intersection. Then the intersection of all members of

*C*is nonempty.

It is a well publicized fact that Eduard Helly published a proof of the theorem that bears his name in 1923, two years after Johann Radon published his. Alexander Soifer in his recent book gave an explanation to an apparent injustice:

(the theorem) ... was discovered by the Austrian mathematician Eduard Helly (Vienna, 1884 - Chicago, 1943), in 1913. But it was not published at that time. During World War I, Helly was a soldier in the Austrian Army, and he was taken a Russian prisoner in 1914. He explained his theorem to another Austrian mathematician who was in Russian captivity as well.

The theorem lived in mathematical folklore from the time of these mysterious meeting of two mathematical prisoners until 1921 when the first proof of the Helly theorem was published by the Austrian mathematician Johann Karl August Radon (with a reference to Helly). In 1923 Helly published his own proof (different from Radon's!).

I shall give a simple proof of the theorem in **R**² as it appears in the classical book of V. Boltyanski and I. Yaglom. The proof has been reproduced in [Etudes] by A. Soifer.

The proof starts with a particular case

### Lemma

### Proof of Lemma

Denote the four sets F_{1}, F_{2}, F_{3}, F_{4}. For j = 1, 2, 3, 4, let a_{j} be a common point of the three sets, with F_{j} removed. Thus, for example, _{1} ∈ F_{2} ∩ F_{3} ∩ F_{4},

One of the points a

_{1}, a_{2}, a_{3}, a_{4}lies in the interior or the border of the triangle formed by the other three. Assume, for example, thata But each of the points a_{1}∈ Δa_{2}a_{3}a_{4}._{2}, a_{3}, a_{4}belongs to F_{1}. By the convexity of the latter, the wholeΔa and so_{2}a_{3}a_{4}⊂ F_{1}a Since, by our assumption,_{1}∈ F_{1}.a we also have_{1}∈ F_{2}∩ F_{3}∩ F_{4},a _{1}∈ F_{1}∩ F_{2}∩ F_{3}∩ F_{4}.Points a

_{1}, a_{2}, a_{3}, a_{4}form a convex quadrilateral, so that none of them lies in the triangle formed by the other three. The diagonal a_{1}a_{3}wholly belongs toF while the diagonal a_{2}∩ F_{4}_{2}a_{4}wholly belongs toF The intersection of the diagonals then belongs to_{1}∩ F_{3}.(F _{2}∩ F_{4}) ∩ (F_{1}∩ F_{3}).

### Proof of Helly's Theorem (in **R**²)

The proof is by induction on the number s of sets in *C*. The case of s = 4 is covered by Lemma. So let's assume that the theorem holds for some _{1}, ..., F_{s}, F_{s+1} with the property that the intersection of any three of them is nonempty.

Define G_{k} = F_{k} ∩ F_{s+1}, k = 1, ..., s. The intersection of any three G's is nonempty. For example,

_{1}∩ G

_{2}∩ G

_{3}= F

_{1}∩ F

_{2}∩ F

_{3}∩ F

_{s+1},

which is nonempty by Lemma. This means that the intersection of all G's is nonempty. But the intersection of all G's is exactly the intersection of all F's.

### References

- B. Bollobás,
*The Art of Mathematics*, Cambridge University Press, 2006, p. 90-91 - A. Soifer,
*Geometric Etudes in Combinatorial Mathematics*, Springer, 2010 (2nd, expanded edition) - Yaglom, I. M.and V. G. Boltyanski,
*Convex Figures*, Holt, Rinehart and Winstion, 1961

### Convex Sets

- Helly's Theorem
- First Applications of Helly's Theorem
- Crossed-Lines Construction of Shapes of Constant Width
- Shapes of constant width (An Interactive Gizmo)
- Star Construction of Shapes of Constant Width
- Convex Polygon Is the Intersection of Half Planes
- Minkowski's addition of convex shapes
- Perimeters of Convex Polygons, One within the Other
- The Theorem of Barbier
- A. Soifer's Book, P. Erdos' Conjecture, B. Grunbaum's Counterexample
- Reuleaux's Triangle, Extended

|Contact| |Front page| |Contents| |Geometry| |Store|

Copyright © 1996-2017 Alexander Bogomolny

62382125 |