This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Dimension Independent Helly Theorem for Lines and Flats

Sutanoya Chakraborty111Indian Statistical Institute, India    Arijit Ghosh11footnotemark: 1    Soumi Nandi11footnotemark: 1
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 \mathcal{F} of convex sets in d\mathbb{R}^{d}, if the sets in every subfamily of \mathcal{F} of size d+1d+1 have a point in common, then all the sets in the entire family \mathcal{F} have a point in common. Note that one can relax the finiteness of \mathcal{F} can be relaxed if we assume that the convex sets in \mathcal{F} 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 TdT\subseteq\mathbb{R}^{d} pierces a family \mathcal{F} of subsets of d\mathbb{R}^{d} if all sets in \mathcal{F}, has a non-empty intersection with the set TT. A natural generalization of Helly Theorem would be to consider the problem of piercing a family of convex sets with a kk-flats222By kk-flat we mean affine subspace of d\mathbb{R}^{d} of dimension kk. Note that by lines and hyperplanes, we will mean 11-flats and (d1)(d-1)-flats respectively.. Results of the above form are called Helly-type results. Generally, we want to show that there exists an integer h(k,d)h(k,d) such that if any h(k,d)h(k,d) convex sets from a collection \mathcal{F} can be pierced by a kk-flat then the whole collection \mathcal{F} can be pierced by a kk-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 \mathcal{F} of disjoint convex sets in d\mathbb{R}^{d} with non-empty interior and all congruent to a fixed compact convex set CC, if every d+1d+1 sets from \mathcal{F} 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 kk-flat for families of convex bodies that are unbounded in kk-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 C1,,CnC_{1},\dots,C_{n} be convex sets in d\mathbb{R}^{d} and r{1,,n}r\in\left\{1,\dots,n\right\}. For J{1,,n}J\subseteq\left\{1,\dots,n\right\}, let 𝒞(J)jJCj\mathcal{C}(J)\coloneqq\bigcap_{j\in J}C_{j}. If B(b,1)B(b,1) intersects 𝒞(J)\mathcal{C}(J) for every J{1,,n}J\subseteq\left\{1,\dots,n\right\} with |J|=r|J|=r, then there is a point qdq\in\mathbb{R}^{d} such that for all i{1,,n}i\in\left\{1,\dots,n\right\} we have

d(q,Ci)nrr(n1).d(q,C_{i})\leq\sqrt{\frac{n-r}{r(n-1)}}\;. (1)

Observe that for a fixed kk and nn\to\infty, the right-hand side of the above equation approaches 1r\frac{1}{\sqrt{r}}.

Note that for all qdq\in\mathbb{R}^{d} and SdS\subseteq\mathbb{R}^{d}, d(q,S)d(q,S) denotes the distance between the point qq and the set SS, that is, d(q,S):=infxSqxd(q,S):=\inf_{x\in S}\|q-x\|. Also, note that B(x,R)B(x,R) denotes a closed Euclidean ball centered at xdx\in\mathbb{R}^{d} with radius RR.

They also proved the following colorful variant of the above theorem.

Theorem 2 (Adiprasito, Bárány, Mustafa, and Terpai [ABMT20]).

Let 1,,r\mathcal{F}_{1},\dots,\mathcal{F}_{r} be families of convex sets in d\mathbb{R}^{d} with rdr\leq d, and bdb\in\mathbb{R}^{d}. Assume that for any rr-tuple (C1,,Cr)\left(C_{1},\dots,C_{r}\right) with CiiC_{i}\in\mathcal{F}_{i} for all i{1,,r}i\in\left\{1,\dots,r\right\}, we have (1irCi)B(b,1).\left(\bigcap_{1\leq i\leq r}C_{i}\right)\bigcap B(b,1)\neq\emptyset. Then there exists a point qdq\in\mathbb{R}^{d} and i{1,,r}\exists i\in\left\{1,\dots,r\right\} such that Ci\forall C\in\mathcal{F}_{i} we have d(q,C)1rd(q,C)\leq\dfrac{1}{\sqrt{r}}.

In this short note, we will be generalizing the above results for kk-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 d\mathbb{R}^{d} will be denoted by 𝒪\mathcal{O}.

  • For all nn\in\mathbb{N}, [n][n] denotes the set {1,,n}\left\{1,\dots,n\right\}.

  • For any two points pp and qq in d\mathbb{R}^{d}, the Euclidean distance between pp and qq will be denoted by pq\|p-q\|.

  • |X||X| will denote the size of a set XX.

  • The diameter of the set CdC\subseteq\mathbb{R}^{d} will be denoted by diam(C)\text{diam}(C).

  • For all bdb\in\mathbb{R}^{d} and r>0r>0, closed and open balls centered at the point bb and radius rr will be denoted by B(b,r):={pd:pbr}B(b,r):=\left\{p\in\mathbb{R}^{d}\,:\,\|p-b\|\leq r\right\} and Bo(b,r):={pd:pb<r}B^{o}(b,r):=\left\{p\in\mathbb{R}^{d}\,:\,\|p-b\|<r\right\} respectively.

  • By 𝕊d1\mathbb{S}^{d-1} we will denote the (d1)(d-1)-dimensional unit sphere centered at the origin.

  • The distance d(S1,S2)d(S_{1},S_{2}) between two subsets S1S_{1} and S2S_{2} of d\mathbb{R}^{d} is defined as d(S1,S2):=inf(p1,p2)S1×S2p1p2d(S_{1},S_{2}):=\inf_{(p_{1},p_{2})\in S_{1}\times S_{2}}\|p_{1}-p_{2}\|.

  • Given points pp and qq in d\mathbb{R}^{d}, pq¯\overline{pq} denotes the closed line segment connecting pp and qq.

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 f:d𝕊d1f:\mathbb{R}^{d}\to\mathbb{S}^{d-1}, where 𝕊d1\mathbb{S}^{d-1} is the unit sphere centered at OO, in the following way: for all xdx\in\mathbb{R}^{d}

f(x):=xx.f(x):=\frac{x}{\|x\|}.

We say y𝕊d1y\in\mathbb{S}^{d-1} is a limiting direction of the collection \mathcal{F} if there exists a infinite sequence of points {sn}n\left\{s_{n}\right\}_{n\in\mathbb{N}} and infinite sequence of sets {Sn}n\left\{S_{n}\right\}_{n\in\mathbb{N}} satisfying the following properties:

  • for all nn\in\mathbb{N}, SnS_{n}\in\mathcal{F}

  • for all nmn\neq m in \mathbb{N}, SnSmS_{n}\neq S_{m} -

  • for all nn\in\mathbb{N}, snSns_{n}\in S_{n}

  • limnsn=\lim\limits_{n\to\infty}\|s_{n}\|=\infty and limnf(sn)=y\lim\limits_{n\to\infty}f(s_{n})=y

For a collection \mathcal{F} of subsets of d\mathbb{R}^{d}, limiting direction set LDS()LDS(\mathcal{F}) of \mathcal{F} is defined as

LDS():={y𝕊d1:yis a limiting direction of}.LDS(\mathcal{F}):=\left\{y\in\mathbb{S}^{d-1}\,:\,y\;\mbox{is a limiting direction of}\;\mathcal{F}\right\}.

We will call the collection \mathcal{F} kk-unbounded if the vector space spanned by set LDS()LDS(\mathcal{F}) has dimension at least kk. To give an idea of how kk-unbounded framework will be used in a proof we will first give a colorful generalization of Helly Theorem for kk-flats by Aronov, Goodman and Pollack [AGP02].

Theorem 3 (Colorful Helly Theorem for kk-flats).

Suppose for each i[d+1],𝒮ii\in[d+1],\mathcal{S}_{i} is a kk-unbounded collection of compact convex sets in d\mathbb{R}^{d}, and there exists R>0R>0 such that C𝒮1𝒮d+1\forall C\in\mathcal{S}_{1}\cup\dots\cup\mathcal{S}_{d+1} we have diam(C)<R\mathrm{diam}(C)<R. Also, assume that for every (d+1)(d+1)-tuple (C1,,Cd+1)𝒮1××𝒮d+1(C_{1},\dots,C_{d+1})\in\mathcal{S}_{1}\times\dots\times\mathcal{S}_{d+1} there exists a kk-flat HH such that HH intersects CiC_{i} for all i[d+1]i\in[d+1]. Then j[d+1]\exists j\in[d+1] and a kk-flat H~\widetilde{H} that intersects every sets in 𝒮j\mathcal{S}_{j}.

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 kk-flats).

Let 1,,r\mathcal{F}_{1},\dots,\mathcal{F}_{r} be families of convex sets in d\mathbb{R}^{d}, k<rdk<r\leq d, and the family :=1r\mathcal{F}:=\mathcal{F}_{1}\cup\dots\cup\mathcal{F}_{r} of convex sets satisfy the following properties:

(i)

R>0\exists R>0 such that for all CC\in\mathcal{F} we have diam(C)<R\mathrm{diam}(C)<R

(ii)

Jk={j1,,jk}[r]\exists J_{k}=\{j_{1},\dots,j_{k}\}\subset[r] and {yj1,,yjk}𝕊d1\left\{y_{j_{1}},\dots,y_{j_{k}}\right\}\subset\mathbb{S}^{d-1} such that

  • for all iJki\in J_{k} we have yiLDS(i)y_{i}\in LDS\left(\mathcal{F}_{i}\right), and

  • the collection of vectors {yj1,,yjk}\left\{y_{j_{1}},\dots,y_{j_{k}}\right\} are linearly independent

If for any rr-tuple (C1,,Cr)1××r\left(C_{1},\dots,C_{r}\right)\in\mathcal{F}_{1}\times\dots\times\mathcal{F}_{r} there exists a kk-flat that intersects the closed unit ball B(0,1)B\left(0,1\right) and every convex set CiC_{i} for all i[r]i\in[r], then there exists a kk-flat KK and j[r]j\in[r] such that, for all CjC\in\mathcal{F}_{j}, we have

d(C,K)1rk.d(C,K)\leq\sqrt{\frac{1}{r-k}}. (2)

Observe that by substituting 1=2==r=\mathcal{F}_{1}=\mathcal{F}_{2}=\dots=\mathcal{F}_{r}=\mathcal{F} in Theorem 4 we get the following dimension independent Helly Theorem for kk-flats.

Theorem 5 (Dimension independent Helly Theorem for kk-flats).

Let \mathcal{F} be a kk-unbounded family of convex sets in d\mathbb{R}^{d} and there exists an R>0R>0 such that C\forall C\in\mathcal{F} we have have diam(C)<R\mathrm{diam}(C)<R. For rr\in\mathbb{N} with k<rdk<r\leq d and bdb\in\mathbb{R}^{d}, if for every C1,C2,,CrC_{1},C_{2},\dots,C_{r} in \mathcal{F} there exists a kk-flat HH that intersects B(0,1)B(0,1) and every CiC_{i} for all i{1,2,,r}i\in\{1,2,\dots,r\}, then there exists a kk-flat KK such that, for all CC\in\mathcal{F}, we have

d(C,K)1rk.d(C,K)\leq\sqrt{\frac{1}{r-k}}\;.

If each i\mathcal{F}_{i} in Theorem 4 is kk-unbounded then we get the following colorful generalization of the above Theorem 5.

Theorem 6 (Colorful generalization of Theorem 5).

Let 1,,r\mathcal{F}_{1},\dots,\mathcal{F}_{r} be kk-unbounded families of convex sets in d\mathbb{R}^{d} where k<rdk<r\leq d, and there exists R>0R>0 such that C1r\forall C\in\mathcal{F}_{1}\cup\dots\cup\mathcal{F}_{r} we have diam(C)<R\mathrm{diam}(C)<R. If for any rr-tuple (C1,,Cr)1××r\left(C_{1},\dots,C_{r}\right)\in\mathcal{F}_{1}\times\dots\times\mathcal{F}_{r} there exists a kk-flat that intersects the closed unit ball B(0,1)B\left(0,1\right) and every convex set CiC_{i} for all i{1,,r}i\in\{1,\dots,r\}, then there exists a kk-flat KK and j{1,,r}j\in\{1,\dots,r\} such that, for all CjC\in\mathcal{F}_{j}, we have

d(C,K)1rk.d(C,K)\leq\sqrt{\frac{1}{r-k}}\;.

In the above theorems we require the convex sets to have bounded diameter. Note that this condition cannot be relaxed. Consider hyperplanes in d\mathbb{R}^{d} and observe that any finite collection of hyperplanes can be pierced by a line passing through the origin 𝒪\mathcal{O} in d\mathbb{R}^{d}. But, for any kk-flat KK, with kd1k\leq d-1, and Δ>0\forall\Delta>0 there exists a hyperplane HH such that d(K,H)>Δd\left(K,H\right)>\Delta. 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 kk-unboundedness condition is unavoidable.

Theorem 7 (On families not being kk-unbounded).

There exists a family \mathcal{F} of convex sets in 3\mathbb{R}^{3} such that

  • there exists R>0R>0 such that diam(C)<R\mathrm{diam}(C)<R for all CC\in\mathcal{F},

  • \mathcal{F} is 11-unbounded,

  • any three convex sets in \mathcal{F} can be pierced by a plane (22-dimensional affine space) passing through the origin 𝒪\mathcal{O}, and

  • for any plane KK in 3\mathbb{R}^{3} there exists a CKC_{K}\in\mathcal{F} such that d(K,CK)>1d\left(K,C_{K}\right)>1.

Theorem 8 (Tightness of the bound in Theorem 4).

There exist families 1,2,3\mathcal{F}_{1},\mathcal{F}_{2},\mathcal{F}_{3} of convex sets in 3\mathbb{R}^{3} satisfying the following properties:

  • C123\forall C\in\mathcal{F}_{1}\cup\mathcal{F}_{2}\cup\mathcal{F}_{3}, diam(C)=2\mathrm{diam}(C)=\sqrt{2},

  • both 1\mathcal{F}_{1} and 2\mathcal{F}_{2} are 11-unbounded,

  • (C1,C2,C3)1×2×2\forall(C_{1},C_{2},C_{3})\in\mathcal{F}_{1}\times\mathcal{F}_{2}\times\mathcal{F}_{2} there exists a line LL that pierces C1,C2,C3C_{1},C_{2},C_{3}, and d(L,𝒪)1d(L,\mathcal{O})\leq 1, and

  • for every line KK in 3\mathbb{R}^{3} there exists j[3]j\in[3] such that

    maxCjd(C,K)12.\max\limits_{C\in\mathcal{F}_{j}}d(C,K)\geq\frac{1}{\sqrt{2}}.

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 kk-flats proved by Aronov, Goodman and Pollack [AGP02].

Theorem 9 (Restatement of Theorem 3).

Suppose for each i[d+1],𝒮ii\in[d+1],\mathcal{S}_{i} is a kk-unbounded collection of compact convex sets in d\mathbb{R}^{d}, and there exists R>0R>0 such that C𝒮i\forall C\in\mathcal{S}_{i} we have diam(C)<R\mathrm{diam}(C)<R. Also, assume that for every (d+1)(d+1)-tuple (C1,,Cd+1)𝒮1××𝒮d+1(C_{1},\dots,C_{d+1})\in\mathcal{S}_{1}\times\dots\times\mathcal{S}_{d+1} there exists a kk-flat HH such that HH intersects CiC_{i} for all i[d+1]i\in[d+1]. Then j[d+1]\exists j\in[d+1] and a kk-flat H~\widetilde{H} that intersects every sets in 𝒮j\mathcal{S}_{j}.

Proof.

Suppose for each i[d+1],ii\in[d+1],\;\mathcal{L}_{i} is a set of kk linearly independent vectors in the limiting directions set LDS(𝒮i)LDS(\mathcal{S}_{i}) of 𝒮i\mathcal{S}_{i}. Then there exists a linearly independent set of kk vectors, say ={z1,,zk}\mathcal{L}=\{z_{1},\dots,z_{k}\}, such that for each i[k],ziii\in[k],\;z_{i}\in\mathcal{L}_{i}. Suppose 𝒦\mathcal{K} is the kk-flat generated by the linear span of \mathcal{L}. Now for each i[k]i\in[k], since ziiz_{i}\in\mathcal{L}_{i}, so \exists a sequence {Si,n}n\{S_{i,n}\}_{n\in\mathbb{N}} in 𝒮i\mathcal{S}_{i} and for each nn\in\mathbb{N}, xi,nSi,n\exists x_{i,n}\in S_{i,n} such that the sequence {f(xi,n)}n\{f(x_{i,n})\}_{n\in\mathbb{N}} converges to ziz_{i}, as nn\rightarrow\infty.

Now if i[k]\exists i\in[k] such that 𝒮i\mathcal{S}_{i} has a kk-transversal then there is nothing to prove. Otherwise for each i[d+1],i>ki\in[d+1],i>k, we take any Bi𝒮iB_{i}\in\mathcal{S}_{i} and take any nn\in\mathbb{N}. Then Bk+1,,Bd+1B_{k+1},\dots,B_{d+1} together with S1,n,,Sk,nS_{1,n},\dots,S_{k,n}, as a colorful tuple, is pierceable by a kk-flat. This follows that Bk+1,,Bd+1B_{k+1},\dots,B_{d+1} can be pierced by a kk-flat arbitrarily close to the direction of 𝒦\mathcal{K}. So by compactness of BiB_{i}’s we can say that, Bk+1,,Bd+1B_{k+1},\dots,B_{d+1} can be pierced by a kk-flat in the direction of 𝒦\mathcal{K}, i.e, parallel to 𝒦\mathcal{K}.

Now for each i[d+1],i>ki\in[d+1],\;i>k, suppose 𝒮i\mathcal{S}^{\prime}_{i} is the projected family of 𝒮i\mathcal{S}_{i} on the (dk)(d-k) dimensional space 𝒦\mathcal{K}^{\perp}, orthogonal to 𝒦\mathcal{K}. Then every colorful (dk+1)(d-k+1) tuple from 𝒮k+1,,𝒮d+1\mathcal{S}^{\prime}_{k+1},\dots,\mathcal{S}^{\prime}_{d+1} is pierceable by a point in the space 𝒦\mathcal{K}^{\perp}. So by Colorful Helly’s Theorem, i[d+1],i>k\exists i\in[d+1],\;i>k such that 𝒮i\mathcal{S}^{\prime}_{i} is pierceable by a point in 𝒦\mathcal{K}^{\perp}. Hence there exists a kk-flat parallel to 𝒦\mathcal{K} that hits all the members of the family 𝒮i\mathcal{S}_{i}. ∎

Theorem 10 (Restatement of 4).

Let 1,,r\mathcal{F}_{1},\dots,\mathcal{F}_{r} families of convex sets in d\mathbb{R}^{d}, k<rdk<r\leq d, and the family :=1r\mathcal{F}:=\mathcal{F}_{1}\cup\dots\cup\mathcal{F}_{r} of convex sets satisfy the following properties:

  1. (i)

    R>0\exists R>0 such that for all CC\in\mathcal{F} we have diam(C)<R\mathrm{diam}(C)<R

  2. (ii)

    Jk={j1,,jk}[r]\exists J_{k}=\{j_{1},\dots,j_{k}\}\subset[r] and {yj1,,yjk}𝕊d1\left\{y_{j_{1}},\dots,y_{j_{k}}\right\}\subset\mathbb{S}^{d-1} such that

    • for all iJki\in J_{k} we have yiLDS(i)y_{i}\in LDS\left(\mathcal{F}_{i}\right), and

    • the collection of vectors {yj1,,yjk}\left\{y_{j_{1}},\dots,y_{j_{k}}\right\} are linearly independent

If for any rr-tuple (C1,,Cr)1××r\left(C_{1},\dots,C_{r}\right)\in\mathcal{F}_{1}\times\dots\times\mathcal{F}_{r} there exists a kk-flat that intersects the closed unit ball B(0,1)B\left(0,1\right) and every convex set CiC_{i} for all i{1,,r}i\in\{1,\dots,r\}, then there exists a kk-flat KK and j{1,,r}j\in\{1,\dots,r\} such that, for all CjC\in\mathcal{F}_{j}, we have

d(C,K)1rk.d(C,K)\leq\sqrt{\frac{1}{r-k}}.
Proof.

Suppose for any set FdF\subset\mathbb{R}^{d}, F¯\bar{F} is the closure of FF. Since for any point pdp\in\mathbb{R}^{d}, d(p,F)=d(p,F¯)d(p,F)=d(p,\bar{F}), it is enough to show that j[r]\exists j\in[r] such that there exists a kk-flat KK satisfying Cj\forall C\in\mathcal{F}_{j},

d(C¯,K)1rk.d(\bar{C},K)\leq\sqrt{\frac{1}{r-k}}.

Now without loss of generality, we assume that Jk=[k]J_{k}=[k]. Then for each jJj\in J, yjLDS(j)y_{j}\in\mathrm{LDS}(\mathcal{F}_{j}) implies that  a sequence {Fj,n}n\exists\text{ a sequence }\{F_{j,n}\}_{n\in\mathbb{N}} in j\mathcal{F}_{j} and for each n,xj,nj,nn\in\mathbb{N},\;\exists x_{j,n}\in\mathcal{F}_{j,n} such that the sequence {f(xj,n)}n\{f(x_{j,n})\}_{n\in\mathbb{N}} converges to yjy_{j}.

Now if j[r]\exists j\in[r] such that there exists a kk-flat KK satisfying Cj\forall C\in\mathcal{F}_{j}, d(C,K)1rkd(C,K)\leq\sqrt{\frac{1}{r-k}}, then there is nothing to prove. Otherwise, suppose KK is the kk-flat generated by the linear span of {y1,,yk}\{y_{1},\dots,y_{k}\}. Now for each i[r],i>k,i\in[r],\;i>k, take any FiiF_{i}\in\mathcal{F}_{i}. Then for each nn\in\mathbb{N}, there exists a kk-flat KnK_{n} intersecting B(0,1)B(0,1) and piercing F1,n,F2,n,,Fk,n,Fk+1,,FrF_{1,n},F_{2,n},\dots,F_{k,n},F_{k+1},\dots,F_{r}. This implies that Fk+1,,FrF_{k+1},\dots,F_{r} can be pierced by a kk-flat arbitrarily close to the direction of KK. Now by compactness of Fi¯\bar{F_{i}}’s, we conclude that aK\exists a\in K^{\perp} such that the kk-flat a+Ka+K pierces F¯k+1,,F¯r\bar{F}_{k+1},\dots,\bar{F}_{r}. Since a+Ka+K intersects B(O,1)B(O,1), we must have a1\|a\|\leq 1.

Now let for any set AA in d\mathbb{R}^{d}, π(A)\pi(A) denote the orthogonal projection of AA onto the (dk)(d-k)-dimensional space KK^{\perp}. Then for any (Ck+1,Cr)k+1××r(C_{k+1},\dots C_{r})\in\mathcal{F}_{k+1}\times\dots\times\mathcal{F}_{r}, we have

(i=k+1rπ(Ci¯))B(0,1).\left(\bigcap_{i=k+1}^{r}\pi\left(\bar{C_{i}}\right)\right)\bigcap B(0,1)\neq\emptyset.

Then, by Theorem 2, qK\exists q\in K^{\perp} and i{k+1,,r}\exists i\in\{k+1,\dots,r\} such that Ci\forall C\in\mathcal{F}_{i} we have

d(q,π(C¯))<1rk.d\left(q,\pi\left(\overline{C}\right)\right)<\sqrt{\frac{1}{r-k}}\;.

Suppose qπ1(q)q^{\prime}\in\pi^{-1}(q) and consider the kk-flat K=q+KK^{\prime}=q^{\prime}+K. Then we have Ci\forall C\in\mathcal{F}_{i},

d(K,C¯)<1rk.d\left(K^{\prime},\overline{C}\right)<\sqrt{\frac{1}{r-k}}\;.

Theorem 11 (On families not being kk-unbounded: Restatement of Theorem 7).

There exists a family \mathcal{F} of convex sets in 3\mathbb{R}^{3} such that

  • there exists R>0R>0 such that diam(C)<R\mathrm{diam}(C)<R for all CC\in\mathcal{F},

  • \mathcal{F} is 11-unbounded,

  • any three convex sets in \mathcal{F} can be pierced by a plane (22-dimensional affine space) passing through the origin 𝒪\mathcal{O}, and

  • for any plane KK in 3\mathbb{R}^{3} there exists a CKC_{K}\in\mathcal{F} such that d(K,CK)>1d\left(K,C_{K}\right)>1.

Refer to caption
Refer to caption
Figure 1: An example demonstrating the necessity of kk-unboundedness condition. This figure has been taken from [AGP02].
Proof.

To establish the necessity of kk-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 𝒪\mathcal{O}. Let x3=0x_{3}=0 be the plane that contains the Figure 1, and without loss of generality assume that 𝒪\mathcal{O} be the origin in 3\mathbb{R}^{3}. We will call these eight shaded convex regions a1a_{1}, a2a_{2}, \dots, a8a_{8}, respectively. Observe that any 33 of these convex sets can be intersected by a straight line passing 𝒪\mathcal{O}.

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 x3x_{3}-axis such that for any nn\in\mathbb{N} there are infinitely many sets of this collection that lie outside B(𝒪,n)B\left(\mathcal{O},n\right). This gives us a countably infinite sequence \mathcal{F} of sets, where \mathcal{F} is 11-unbounded, but not 22-unbounded. Clearly, for any three sets in \mathcal{F}, there exists a plane that passes through 𝒪\mathcal{O} and intersects these sets.

Let \ell 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 \mathcal{F} when \ell is large enough. Let KK be a plane for which the maximum distance from the sets in \mathcal{F} is minimized, and lKl_{K} be the intersection of KK with the plane x3=0x_{3}=0. Clearly, KK must be perpendicular to the plane that contains the first 88 sets, because otherwise for any R>0R>0 we would find a set CC in \mathcal{F} for which d(K,C)>Rd(K,C)>R. Consider the straight line lKl_{K} that is the intersection of KK and the plane given by the equation x3=0x_{3}=0. If lKl_{K} is moved on the x3=0x_{3}=0 plane closer to 𝒪\mathcal{O} along the line perpendicular to lKl_{K} from 𝒪\mathcal{O}, the quantity max{d(a2n,lK),d(a2n1,lK)}\max\left\{d\left(a_{2n},l_{K}\right),d\left(a_{2n-1},l_{K}\right)\right\} does not increase for n{1,2,3,4}n\in\left\{1,2,3,4\right\}. Since d(K,ai)=d(lK,ai)d(K,a_{i})=d(l_{K},a_{i}) i[8]\forall i\in[8], we can take KK to be passing through 𝒪\mathcal{O}. Let the side-lengths of the 44 squares in Figure 1 be 1(=),3,5,7\ell_{1}\,(=\ell),\ell_{3},\ell_{5},\ell_{7}, where the side of side-length i\ell_{i} is shared by the set aia_{i}. Let the diagonals of the largest square in Figure 1 lie on the x1x_{1}-axis and the x2x_{2}-axis respectively. Then, if lKl_{K} makes an angle θ[0,π)\theta\in[0,\pi) with the x1x_{1}-axis, then we have the following: for i{1,3,5,7}i\in\left\{1,3,5,7\right\} we have

d(ai,lK)=d(ai+1,lk),\displaystyle d\left(a_{i},l_{K}\right)=d\left(a_{i+1},l_{k}\right), (3)

and

d(a1,lK)\displaystyle d(a_{1},l_{K}) ={12sin(π/4θ)if 0θπ/412sin(πθ)if 3π/4θπ0otherwise\displaystyle=\begin{cases}\frac{\ell_{1}}{\sqrt{2}}\sin\left({\pi}/{4}-\theta\right)&\text{if }0\leq\theta\leq{\pi}/{4}\\ \frac{\ell_{1}}{\sqrt{2}}\sin\left(\pi-\theta\right)&\text{if }{3\pi}/{4}\leq\theta\leq\pi\\ 0&\text{otherwise}\end{cases} (4)
d(a3,lK)\displaystyle d(a_{3},l_{K}) ={32sinθif 0θπ/432sin(π/2θ)if π/4θπ/20otherwise\displaystyle=\begin{cases}\frac{\ell_{3}}{\sqrt{2}}\sin\theta&\text{if }0\leq\theta\leq{\pi}/{4}\\ \frac{\ell_{3}}{\sqrt{2}}\sin\left({\pi}/{2}-\theta\right)&\text{if }{\pi}/{4}\leq\theta\leq{\pi}/{2}\\ 0&\text{otherwise}\end{cases} (5)
d(a5,lK)\displaystyle d(a_{5},l_{K}) ={52sin(θπ/4)if π/4θπ/252sin(3π/4θ)if π/2θ3π/40otherwise\displaystyle=\begin{cases}\frac{\ell_{5}}{\sqrt{2}}\sin\left(\theta-{\pi}/{4}\right)&\text{if }{\pi}/{4}\leq\theta\leq{\pi}/{2}\\ \frac{\ell_{5}}{\sqrt{2}}\sin\left({3\pi}/{4}-\theta\right)&\text{if }{\pi}/{2}\leq\theta\leq{3\pi}/{4}\\ 0&\text{otherwise}\end{cases} (6)
d(a7,lK)\displaystyle d(a_{7},l_{K}) ={72sin(θπ/2)if π/2θ3π/472sin(πθ)if 3π/4θπ0otherwise\displaystyle=\begin{cases}\frac{\ell_{7}}{\sqrt{2}}\sin\left(\theta-{\pi}/{2}\right)&\text{if }{\pi}/{2}\leq\theta\leq{3\pi}/{4}\\ \frac{\ell_{7}}{\sqrt{2}}\sin\left(\pi-\theta\right)&\text{if }{3\pi}/{4}\leq\theta\leq\pi\\ 0&\text{otherwise}\end{cases} (7)

Now, observe that

i=18d(ai,lK)\displaystyle\sum_{i=1}^{8}d\left(a_{i},l_{K}\right) 2×minθ[0,π/4](sinθ+sin(π/4θ))\displaystyle\geq\frac{\ell}{\sqrt{2}}\times\min_{\theta\in\left[0,{\pi}/{4}\right]}\left(\sin\theta+\sin\left({\pi}/{4}-\theta\right)\right)
2sin(π/8)\displaystyle\geq\ell\sqrt{2}\sin\left({\pi}/{8}\right)

Thus, for >2/sin(π/8)\ell>\sqrt{2}/\sin\left({\pi}/{8}\right), there are no planes that are at most 11 distance away from each set in \mathcal{F}. ∎

Theorem 12 (Tightness of the bound in Theorem 4: Restatement of Theorem 8).

There exist families 1,2,3\mathcal{F}_{1},\mathcal{F}_{2},\mathcal{F}_{3} of convex sets in 3\mathbb{R}^{3} satisfying the following properties:

  • C123\forall C\in\mathcal{F}_{1}\cup\mathcal{F}_{2}\cup\mathcal{F}_{3}, diam(C)=2\mathrm{diam}(C)=\sqrt{2},

  • both 1\mathcal{F}_{1} and 2\mathcal{F}_{2} are 11-unbounded,

  • (C1,C2,C3)1×2×2\forall(C_{1},C_{2},C_{3})\in\mathcal{F}_{1}\times\mathcal{F}_{2}\times\mathcal{F}_{2} there exists a line LL that pierces C1,C2,C3C_{1},C_{2},C_{3}, and d(L,𝒪)1d(L,\mathcal{O})\leq 1 and

  • for every line KK in 3\mathbb{R}^{3} there exists j[3]j\in[3] such that maxCjd(C,K)12\max\limits_{C\in\mathcal{F}_{j}}d(C,K)\geq\frac{1}{\sqrt{2}}.

Proof.

We provide an example where the bound given in Theorem 6 is tight.

Refer to caption
Figure 2: An example demonstrating the tightness of the bound given in Theorem 8.

Let {A,B,C,D,E,F,G,H}\{A,B,C,D,E,F,G,H\} be the 88 vertices cube in 3\mathbb{R}^{3} whose centroid is the origin 𝒪\mathcal{O} and side length is 2\sqrt{2} and EFGHEFGH is parallel to the plane x3=0x_{3}=0 (see Figure 2). Define i{Si,1,Si,2,Si,3,}\mathcal{F}_{i}\coloneqq\{S_{i,1},S_{i,2},S_{i,3},\dots\} for i=1,2,3i=1,2,3 in the following way: Set S1,1=AB¯S_{1,1}=\overline{AB}, S1,2=CD¯S_{1,2}=\overline{CD} and for n>2n>2, S1,nS_{1,n} is the line segment CD¯\overline{CD} raised to the height x3=nx_{3}=n. Similarly, set S2,1=GH¯S_{2,1}=\overline{GH}, S1,2=EF¯S_{1,2}=\overline{EF} and for n>2n>2, S2,nS_{2,n} is the line segment EF¯\overline{EF} lowered to the height x3=nx_{3}=-n. Now set S3,1=BC¯,S3,2=DA¯,S3,3=FG¯,S3,4=HE¯S_{3,1}=\overline{BC},S_{3,2}=\overline{DA},S_{3,3}=\overline{FG},S_{3,4}=\overline{HE}, and let S3,4n+jS_{3,4n+j} be the set S3,jS_{3,j}, for all j{0,1,2,3}j\in\{0,1,2,3\} (see Figure 2). Clearly, any colorful 33-tuple (C1,C2,C3)(C_{1},C_{2},C_{3}), CiiC_{i}\in\mathcal{F}_{i}, i[3]i\in[3], can be hit by a straight line that is at most at a distance 11 away from the centroid. Let \mathcal{L} denote the set of all straight line transversals ll of colorful 33-tuples such that ll is as close to 𝒪\mathcal{O} as possible. Let lnl_{n} denote the straight line transversal in \mathcal{L} that passes through S1,n,S2,1,S3,1S_{1,n},S_{2,1},S_{3,1}. Clearly, d(ln,𝒪)1d(l_{n},\mathcal{O})\to 1 as nn\to\infty. Then

supld(𝒪,l)=1.\sup_{l\in\mathcal{L}}d(\mathcal{O},l)=1.

Now note that for the straight line LL that is perpendicular to the plane on which ABCDABCD lies and passes through 𝒪\mathcal{O}, we have

infi[3]supCid(l,C)infi[3]supCid(L,C),\inf_{i\in[3]}\sup_{C\in\mathcal{F}_{i}}d(l,C)\geq\inf_{i\in[3]}\sup_{C\in\mathcal{F}_{i}}d(L,C),

for any straight line ll in 3\mathbb{R}^{3}. This we can show in the following way: let l1l_{1} be a straight line such that

supC1d(l1,C)=inflsupC1d(C,l).\sup_{C\in\mathcal{F}_{1}}d(l_{1},C)=\inf_{l\in\mathcal{L}}\sup_{C\in\mathcal{F}_{1}}d(C,l).

Then l1l_{1} must be perpendicular to the plane on which ABCDABCD lies, otherwise, the supremum of its distances from sets in 1\mathcal{F}_{1} would be infinity. Then, l1l_{1} must be equidistant from both S1,1S_{1,1} and S1,2S_{1,2}, and therefore, we can take l1l_{1} to be LL. Similar arguments show that

supC2d(L,C)=inflsupC1d(C,l).\sup_{C\in\mathcal{F}_{2}}d(L,C)=\inf_{l\in\mathcal{L}}\sup_{C\in\mathcal{F}_{1}}d(C,l).

We have

infi[3]supCid(L,C)=12.\inf_{i\in[3]}\sup_{C\in\mathcal{F}_{i}}d(L,C)=\frac{1}{\sqrt{2}}.

To see that

inflsupC3d(C,l)=12,\inf_{l\in\mathcal{L}}\sup_{C\in\mathcal{F}_{3}}d(C,l)=\frac{1}{\sqrt{2}},

project BC¯\overline{BC}, AD¯\overline{AD}, FG¯\overline{FG}, EH¯\overline{EH} onto the plane PP that contains ABEFABEF. If there is a straight line l3l_{3} such that

supC3d(l3,C)=inflsupC3d(C,l),\sup_{C\in\mathcal{F}_{3}}d(l_{3},C)=\inf_{l\in\mathcal{L}}\sup_{C\in\mathcal{F}_{3}}d(C,l),

then let the projection of l3l_{3} onto PP be l3l^{\prime}_{3}. If LL is not the straight line that minimizes

inflsupC6d(C,l),\inf_{l\in\mathcal{L}}\sup_{C\in\mathcal{F}_{6}}d(C,l),

then the perpendicular distance from l3l^{\prime}_{3} to A,B,EA,B,E and FF must be smaller than 12\frac{1}{\sqrt{2}}. Let, without loss of generality, AA be the point from which l3l^{\prime}_{3} is the farthest. Then, we must have another point among B,E,B,E, and FF from which l3l^{\prime}_{3} has the same distance as AA. This point then must be EE, because otherwise, we could have taken LL to be l3l_{3}. This means that l3l^{\prime}_{3} passes through the centroid of the square ABEFABEF and two points from A,B,E,A,B,E, and FF lie on each side of l3l^{\prime}_{3}. But this implies that l3l^{\prime}_{3} must be parallel to ABAB since l3l^{\prime}_{3} has the minimum distance from both AA and BB and is at least as close to EE and FF, which is a contradiction. We have

infi[3]supCid(L,C)=12,\inf_{i\in[3]}\sup_{C\in\mathcal{F}_{i}}d(L,C)=\frac{1}{\sqrt{2}},

which is what we get by plugging in the values of rr and kk 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.