Dimension Independent Helly Theorem for Lines and Flats
Abstract
We give a generalization of dimension independent Helly Theorem of Adiprasito, Bárány, Mustafa, and Terpai (Discrete & Computational Geometry 2022) to higher dimensional transversal. We also prove some impossibility results that establish the tightness of our extension.
1 Introduction
Helly Theorem is a fundamental result in discrete and convex geometry. The theorem states that given any finite collection of convex sets in , if the sets in every subfamily of of size have a point in common, then all the sets in the entire family have a point in common. Note that one can relax the finiteness of can be relaxed if we assume that the convex sets in are compact, therefore unless otherwise stated explicitly, we will not assume anything about the cardinality of a collection. Since its discovery [Hel23], Helly Theorem has found multiple applications and generalizations [Eck93, ADLS17, DLGMM19, BK22].
We say a set pierces a family of subsets of if all sets in , has a non-empty intersection with the set . A natural generalization of Helly Theorem would be to consider the problem of piercing a family of convex sets with a -flats222By -flat we mean affine subspace of of dimension . Note that by lines and hyperplanes, we will mean -flats and -flats respectively.. Results of the above form are called Helly-type results. Generally, we want to show that there exists an integer such that if any convex sets from a collection can be pierced by a -flat then the whole collection can be pierced by a -flat. Unfortunately, Santaló [San40] showed the impossibility of getting such a result for even piercing a collection of convex sets by a line. Hadwiger [Had56] showed that for a countable collection of disjoint convex sets in with non-empty interior and all congruent to a fixed compact convex set , if every sets from can be pierced by a line then the whole family can be pierced by a line. Later, Danzer, Grünbaum and Klee [DGK63] showed that the ”congruent” assumption in Hadwiger’s result [Had56] can be weakened if the convex sets have bounded diameters. Aronov, Goodman, Pollack, and Wenger [AGPW00] proved the first Helly-type result for hyperplanes about families of well-separated compact convex sets of arbitrary shapes in higher dimensions. Later, Aronov, Goodman, and Pollack [AGP02] showed a Helly-type result for -flat for families of convex bodies that are unbounded in -independent directions.
Adiprasito, Bárány, Mustafa, and Terpai [ABMT20] in a breakthrough paper proved the first dimension independent variant of the classical Helly Theorem:
Theorem 1 (Adiprasito, Bárány, Mustafa, and Terpai [ABMT20]).
Let be convex sets in and . For , let . If intersects for every with , then there is a point such that for all we have
(1) |
Observe that for a fixed and , the right-hand side of the above equation approaches .
Note that for all and , denotes the distance between the point and the set , that is, . Also, note that denotes a closed Euclidean ball centered at with radius .
They also proved the following colorful variant of the above theorem.
Theorem 2 (Adiprasito, Bárány, Mustafa, and Terpai [ABMT20]).
Let be families of convex sets in with , and . Assume that for any -tuple with for all , we have Then there exists a point and such that we have .
In this short note, we will be generalizing the above results for -flats, and also prove some impossibility results which will establish the optimality of our generalization.
Notations.
Throughout the rest of the paper we will be using the following notations:
-
•
Origin of will be denoted by .
-
•
For all , denotes the set .
-
•
For any two points and in , the Euclidean distance between and will be denoted by .
-
•
will denote the size of a set .
-
•
The diameter of the set will be denoted by .
-
•
For all and , closed and open balls centered at the point and radius will be denoted by and respectively.
-
•
By we will denote the -dimensional unit sphere centered at the origin.
-
•
The distance between two subsets and of is defined as .
-
•
Given points and in , denotes the closed line segment connecting and .
2 Our results
Before we can give the statements of our results we need to first introduce some definitions which will be required to state our results. We define the central projection map , where is the unit sphere centered at , in the following way: for all
We say is a limiting direction of the collection if there exists a infinite sequence of points and infinite sequence of sets satisfying the following properties:
-
•
for all ,
-
•
for all in , -
-
•
for all ,
-
•
and
For a collection of subsets of , limiting direction set of is defined as
We will call the collection -unbounded if the vector space spanned by set has dimension at least . To give an idea of how -unbounded framework will be used in a proof we will first give a colorful generalization of Helly Theorem for -flats by Aronov, Goodman and Pollack [AGP02].
Theorem 3 (Colorful Helly Theorem for -flats).
Suppose for each is a -unbounded collection of compact convex sets in , and there exists such that we have . Also, assume that for every -tuple there exists a -flat such that intersects for all . Then and a -flat that intersects every sets in .
The following theorem is the main technical result in this paper, and we will show that the rest of the results will be a direct consequence of this result.
Theorem 4 (Dimension independent colorful Helly Theorem for -flats).
Let be families of convex sets in , , and the family of convex sets satisfy the following properties:
- (i)
-
such that for all we have
- (ii)
-
and such that
-
•
for all we have , and
-
•
the collection of vectors are linearly independent
-
•
If for any -tuple there exists a -flat that intersects the closed unit ball and every convex set for all , then there exists a -flat and such that, for all , we have
(2) |
Observe that by substituting in Theorem 4 we get the following dimension independent Helly Theorem for -flats.
Theorem 5 (Dimension independent Helly Theorem for -flats).
Let be a -unbounded family of convex sets in and there exists an such that we have have . For with and , if for every in there exists a -flat that intersects and every for all , then there exists a -flat such that, for all , we have
If each in Theorem 4 is -unbounded then we get the following colorful generalization of the above Theorem 5.
Theorem 6 (Colorful generalization of Theorem 5).
Let be -unbounded families of convex sets in where , and there exists such that we have . If for any -tuple there exists a -flat that intersects the closed unit ball and every convex set for all , then there exists a -flat and such that, for all , we have
In the above theorems we require the convex sets to have bounded diameter. Note that this condition cannot be relaxed. Consider hyperplanes in and observe that any finite collection of hyperplanes can be pierced by a line passing through the origin in . But, for any -flat , with , and there exists a hyperplane such that . The following two results will complement our results on dimension independent Helly Theorem by showing the tightness of the bound guaranteed by our results and also show that the -unboundedness condition is unavoidable.
Theorem 7 (On families not being -unbounded).
There exists a family of convex sets in such that
-
•
there exists such that for all ,
-
•
is -unbounded,
-
•
any three convex sets in can be pierced by a plane (-dimensional affine space) passing through the origin , and
-
•
for any plane in there exists a such that .
Theorem 8 (Tightness of the bound in Theorem 4).
There exist families of convex sets in satisfying the following properties:
-
•
, ,
-
•
both and are -unbounded,
-
•
there exists a line that pierces , and , and
-
•
for every line in there exists such that
3 Proofs of the claimed results
In this section we will give the proofs of the results claimed in Section 2. We will first begin by proving the following colorful generalization of the Helly Theorem for -flats proved by Aronov, Goodman and Pollack [AGP02].
Theorem 9 (Restatement of Theorem 3).
Suppose for each is a -unbounded collection of compact convex sets in , and there exists such that we have . Also, assume that for every -tuple there exists a -flat such that intersects for all . Then and a -flat that intersects every sets in .
Proof.
Suppose for each is a set of linearly independent vectors in the limiting directions set of . Then there exists a linearly independent set of vectors, say , such that for each . Suppose is the -flat generated by the linear span of . Now for each , since , so a sequence in and for each , such that the sequence converges to , as .
Now if such that has a -transversal then there is nothing to prove. Otherwise for each , we take any and take any . Then together with , as a colorful tuple, is pierceable by a -flat. This follows that can be pierced by a -flat arbitrarily close to the direction of . So by compactness of ’s we can say that, can be pierced by a -flat in the direction of , i.e, parallel to .
Now for each , suppose is the projected family of on the dimensional space , orthogonal to . Then every colorful tuple from is pierceable by a point in the space . So by Colorful Helly’s Theorem, such that is pierceable by a point in . Hence there exists a -flat parallel to that hits all the members of the family . ∎
Theorem 10 (Restatement of 4).
Let families of convex sets in , , and the family of convex sets satisfy the following properties:
-
(i)
such that for all we have
-
(ii)
and such that
-
•
for all we have , and
-
•
the collection of vectors are linearly independent
-
•
If for any -tuple there exists a -flat that intersects the closed unit ball and every convex set for all , then there exists a -flat and such that, for all , we have
Proof.
Suppose for any set , is the closure of . Since for any point , , it is enough to show that such that there exists a -flat satisfying ,
Now without loss of generality, we assume that . Then for each , implies that in and for each such that the sequence converges to .
Now if such that there exists a -flat satisfying , , then there is nothing to prove. Otherwise, suppose is the -flat generated by the linear span of . Now for each take any . Then for each , there exists a -flat intersecting and piercing . This implies that can be pierced by a -flat arbitrarily close to the direction of . Now by compactness of ’s, we conclude that such that the -flat pierces . Since intersects , we must have .
Now let for any set in , denote the orthogonal projection of onto the -dimensional space . Then for any , we have
Then, by Theorem 2, and such that we have
Suppose and consider the -flat . Then we have ,
∎
Theorem 11 (On families not being -unbounded: Restatement of Theorem 7).
There exists a family of convex sets in such that
-
•
there exists such that for all ,
-
•
is -unbounded,
-
•
any three convex sets in can be pierced by a plane (-dimensional affine space) passing through the origin , and
-
•
for any plane in there exists a such that .


Proof.
To establish the necessity of -unboundedness we will be using a construction that is closely related to the one given by Aronov et al. [AGP02].
Consider the eight shaded convex regions in Figure 1 created by four circles and four squares centered at a point . Let be the plane that contains the Figure 1, and without loss of generality assume that be the origin in . We will call these eight shaded convex regions , , , , respectively. Observe that any of these convex sets can be intersected by a straight line passing .
We will now create additional convex sets in the following way: we choose the eight convex sets in a fixed order, and in each step elevate the sets in increasing heights in that order along the -axis such that for any there are infinitely many sets of this collection that lie outside . This gives us a countably infinite sequence of sets, where is -unbounded, but not -unbounded. Clearly, for any three sets in , there exists a plane that passes through and intersects these sets.
Let denote the length of the side of the smallest square in Figure 1. We show that it is not possible to find a plane that is at most a distance 1 unit away from all the sets in when is large enough. Let be a plane for which the maximum distance from the sets in is minimized, and be the intersection of with the plane . Clearly, must be perpendicular to the plane that contains the first sets, because otherwise for any we would find a set in for which . Consider the straight line that is the intersection of and the plane given by the equation . If is moved on the plane closer to along the line perpendicular to from , the quantity does not increase for . Since , we can take to be passing through . Let the side-lengths of the squares in Figure 1 be , where the side of side-length is shared by the set . Let the diagonals of the largest square in Figure 1 lie on the -axis and the -axis respectively. Then, if makes an angle with the -axis, then we have the following: for we have
(3) |
and
(4) | ||||
(5) | ||||
(6) | ||||
(7) |
Now, observe that
Thus, for , there are no planes that are at most distance away from each set in . ∎
Theorem 12 (Tightness of the bound in Theorem 4: Restatement of Theorem 8).
There exist families of convex sets in satisfying the following properties:
-
•
, ,
-
•
both and are -unbounded,
-
•
there exists a line that pierces , and and
-
•
for every line in there exists such that .
Proof.
We provide an example where the bound given in Theorem 6 is tight.

Let be the vertices cube in whose centroid is the origin and side length is and is parallel to the plane (see Figure 2). Define for in the following way: Set , and for , is the line segment raised to the height . Similarly, set , and for , is the line segment lowered to the height . Now set , and let be the set , for all (see Figure 2). Clearly, any colorful -tuple , , , can be hit by a straight line that is at most at a distance away from the centroid. Let denote the set of all straight line transversals of colorful -tuples such that is as close to as possible. Let denote the straight line transversal in that passes through . Clearly, as . Then
Now note that for the straight line that is perpendicular to the plane on which lies and passes through , we have
for any straight line in . This we can show in the following way: let be a straight line such that
Then must be perpendicular to the plane on which lies, otherwise, the supremum of its distances from sets in would be infinity. Then, must be equidistant from both and , and therefore, we can take to be . Similar arguments show that
We have
To see that
project , , , onto the plane that contains . If there is a straight line such that
then let the projection of onto be . If is not the straight line that minimizes
then the perpendicular distance from to and must be smaller than . Let, without loss of generality, be the point from which is the farthest. Then, we must have another point among and from which has the same distance as . This point then must be , because otherwise, we could have taken to be . This means that passes through the centroid of the square and two points from and lie on each side of . But this implies that must be parallel to since has the minimum distance from both and and is at least as close to and , which is a contradiction. We have
which is what we get by plugging in the values of and in the inequality given in Theorem 6. ∎
References
- [ABMT20] K. A. Adiprasito, I. Bárány, N. H. Mustafa, and T. Terpai. Theorems of Carathéodory, Helly, and Tverberg Without Dimension. Discrete & Computational Geometry, 64(2):233 – 258, 2020.
- [ADLS17] N. Amenta, J. A. De Loera, and P. Soberón. Helly’s Theorem: New Variations and Applications. Algebraic and Geometric Methods in Discrete Mathematics, 685:55–95, 2017.
- [AGP02] B. Aronov, J. E. Goodman, and R. Pollack. A Helly-type Theorem for Higher-dimensional Transversals. Computational Geometry: Theory and Applications, 21(3):177–183, 2002.
- [AGPW00] B. Aronov, J. E. Goodman, R. Pollack, and R. Wenger. A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. In Proceedings of the 16th Annual Symposium on Computational Geometry, SoCG, page 57–63, 2000.
- [BK22] I. Bárány and G. Kalai. Helly-type Problems. Bulletin of the American Mathematical Society, 59(4):471–502, 2022.
- [DGK63] L. Danzer, B. Grünbaum, and V. Klee. Helly’s Theorem and Its Relatives. Proceedings of Symposia in Pure Mathematics: Convexity. American Mathematical Society, 1963.
- [DLGMM19] J. De Loera, X. Goaoc, F. Meunier, and N. Mustafa. The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. Bulletin of the American Mathematical Society, 56(3):415–511, 2019.
- [Eck93] J. Eckhoff. Helly, Radon, and Carathéodory Type Theorems. In Handbook of Convex Geometry, pages 389 – 448. Elsevier, 1993.
- [Had56] H. Hadwiger. Über einen Satz Hellyscher Art. Arch. Math., 7:377–379, 1956.
- [Hel23] E. Helly. Über Mengen konvexer Körper mit gemeinschaftlichen Punkten. Jahresbericht der Deutschen Mathematiker-Vereinigung, 32:175 – 176, 1923.
- [San40] L Santaló. Un teorema sobre conjuntos de paralelepipedos de aristas paralelas. Publ. Inst. Mat. Univ. Nac. Litoral, 2:49–60, 1940.