Abstract
We prove the following sparse approximation result for polytopes. Assume that Q is a polytope in John’s position. Then there exist at most 2d vertices of Q whose convex hull \(Q'\) satisfies \(Q \subseteq - 2d^2\,Q'\). As a consequence, we retrieve the best bound for the quantitative Helly-type result for the volume, achieved by Brazitikos, and improve on the strongest bound for the quantitative Helly-type theorem for the diameter, shown by Ivanov and Naszódi: We prove that given a finite family \(\mathcal {F}\) of convex bodies in \(\mathbb {R}^d\) with intersection K, we may select at most 2d members of \(\mathcal {F}\) such that their intersection has volume at most \((c d)^{3d /2} {{\,\textrm{vol}\,}}K\), and it has diameter at most \(2d^2 {{\,\textrm{diam}\,}}K\), for some absolute constant \(c>0\).
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 History and Results
Helly’s theorem, dated from 1923 [13], is a cornerstone result in convex geometry. Its finitary version states that the intersection of a finite family of convex sets is empty if and only if there exists a subfamily of \(d+1\) sets such that its intersection is empty. In 1982, Bárány et al. [4] introduced the following quantitative versions of Helly’s theorem: there exist positive constants \(v(d),\delta (d)\) such that for a finite family \(\mathcal {F}\) of convex bodies (that is, compact convex sets with non-empty interior) in \(\mathbb {R}^d\), one may select 2d members such that their intersection has volume at most \(v(d){{\,\textrm{vol}\,}}(\bigcap \mathcal {F})\), or has diameter at most \(\delta (d){{\,\textrm{diam}\,}}(\bigcap \mathcal {F})\).
The problem of finding the optimal values of \(\delta (d)\) and v(d) has enjoyed special interest in recent years (see e.g. the excellent survey article [3]). In [4] (see also [5]) the authors proved that \(v(d) \le d^{2 d^2}\) and \(\delta (d) \le d^{2d}\), and they conjectured that \(v(d) \approx d^{c_1 d}\) and \(\delta (d) \approx c_2 d^{1/2}\) for some positive constants \(c_1, c_2 >0\).
For the volume problem, in a breakthrough paper, Naszódi [17] proved that \(v(d) \le e^{d+1} d^{2d+1/2}\), while \(v(d) \ge d^{d/2}\) must hold. Improving upon his ideas, Brazitikos [6] found the current best upper bound for volume: \(v(d) \le (c d)^{3d/2}\) for a constant \(c>0\).
For the diameter question, Brazitikos [8] proved the first polynomial bound on \(\delta (d)\) by showing that \(\delta (d) \le c d^{11/2}\) for some \(c>0\). In 2021, Ivanov and Naszódi [14] found the best known upper bound, \(\delta (d) \le (2d)^{3}\), and also proved that \(\delta (d) \ge c d^{1/2}\). Thus, the value conjectured in [4] for \(\delta (d)\) would be asymptotically sharp.
In the present note, we show that given a finite family \(\mathcal {F}\) of closed convex sets, one can select at most 2d members such that their intersection sits inside a scaled version of \(\bigcap \mathcal {F}\) for a suitable location of the origin. Clearly, it suffices to prove this statement for the special case when \(\mathcal {F}\) consists of closed halfspaces intersecting in a convex body. As an application, we obtain an improvement on the diameter bound, \(\delta (d) \le 2d^2\), and retrieve the best known bound for v(d). The crux of the argument is the following sparse approximation result for polytopes, which is a strengthening of [14, Thm. 2].
Theorem 1.1
Let \( \lambda > 0\) and \(Q \subset \mathbb {R}^d\) be a convex polytope such that \(Q \subseteq - \lambda Q\). Then there exist at most 2d vertices of Q whose convex hull \(Q'\) satisfies
We immediately obtain the following corollary.
Corollary 1.2
Assume that \(Q=-Q\) is a symmetric convex polytope in \(\mathbb {R}^d\). Then we may select a set of at most 2d vertices of Q with convex hull \(Q'\) such that
As usual, let \(B^d\) denote the unit ball of \(\mathbb {R}^d\) and let \(S^{d-1}\) be the unit sphere of \(\mathbb {R}^d\). A standard consequence of Fritz John’s theorem [16] states that if \(K\subset \mathbb {R}^d\) is a convex body in John’s position, that is, the largest volume ellipsoid inscribed in K is \(B^d\), then \(B^d \subseteq K \subseteq d B^d \subseteq - d K\) (see e.g. [2]). Thus, we derive
Corollary 1.3
Assume that \( Q \subset \mathbb {R}^d\) is a convex polytope in John’s position. Then there exists a subset of at most 2d vertices of Q whose convex hull \(Q'\) satisfies
For \(n \in \mathbb {N}^+\), we will use the notation \([n] = \{1, \ldots ,n\}\). For a family of sets \(\{ K_1, \ldots , K_n\} \subset \mathbb {R}^d\) and for a subset \(\sigma \subset [n]\), let
as in [14]. Also, let \(\left( {\begin{array}{c}[n]\\ \le k\end{array}}\right) \) stand for the set of all subsets of [n] with cardinality at most k. Using this terminology, we are ready to state our quantitative Helly-type result.
Theorem 1.4
Let \(\{K_1,\ldots ,K_n\}\) be a family of closed convex sets in \(\mathbb {R}^d\) with \(d \ge 2\) such that their intersection \(K = K_1 \cap \cdots \cap K_n\) is a convex body. Then there exists a \(\sigma \in \left( {\begin{array}{c}[n]\\ \le 2d\end{array}}\right) \) such that
for some constant \(c > 0\).
To conclude the section we formulate the following conjecture, which was essentially stated already in [4]. This would imply the asymptotically sharp bound for v(d), see the remark after the proof of Theorem 1.4.
Conjecture 1.5
Assume that \(\{u_1, \ldots , u_n \}\subset S^{d-1}\) is a set of unit vectors satisfying the conditions of Fritz John’s theorem. That is, there exist positive numbers \(\alpha _1, \ldots , \alpha _n\) for which \(\sum _{i=1}^n \alpha _i u_i =0\) and \(\sum _{i=1}^n \alpha _i u_i \otimes u_i = I_d\), the identity operator on \(\mathbb {R}^d\). Then there exists a subset \(\sigma \subset [n]\) with cardinality at most 2d so that
with an absolute constant \(c>0\).
That the above estimate would be asymptotically sharp is shown by taking \(n=d+1\) and letting \(\{u_1, \ldots , u_n \}\) to be the set of vertices of a regular simplex inscribed in \(S^{d-1}\).
Note that we study quantitative Helly-type questions that require selecting at most 2d sets, which is the smallest cardinality for which such estimates may hold. Versions obtained by relaxing this cardinality bound have been studied e.g. by Brazitikos [7], Dillon and Soberón [9], and Ivanov and Naszódi [14]. In particular, an estimate which matches Theorem 1.1 asymptotically was given in [14] when selecting \(2d+1\) vertices of the polytope, and an asymptotically sharp estimate for the quantitative Helly-type theorem for the diameter was proved in [9] for sufficiently large sub-families. Further quantitative Helly-type results have been studied in [15] (for log-concave functions) and [11] (continuous versions).
2 Proofs
Proof of Theorem 1.1
The condition \(Q \subseteq -\lambda Q\) ensures that \(0 \in {{\,\textrm{int}\,}}Q\). Among all simplices with d vertices from the set of vertices of Q and one vertex at the origin, consider a simplex \(S = {{\,\textrm{conv}\,}}{\{0,v_1,\ldots ,v_d\}}\) with maximal volume. We write S in the form
For every \(i \in [d]\), let \(H_i\) be the hyperplane spanned by \(\{0, v_1,\ldots ,v_d\} \setminus \{v_i\}\), and let \(L_i\) be the closed strip between the hyperplanes \(v_i + H_i\) and \( -v_i + H_i\). Define \(P = \bigcap _{i \in [d]} L_i\) (see Fig. 1). Note that
This follows from the volume formula
for arbitrary \(w_1,\ldots ,w_d \in \mathbb {R}^d\), which implies that for all \(x \in \mathbb {R}^{d}\) of the form \( x = c v_i + w\) with \(w \in H_i\), \(i \in [d]\),
Next, we show that
Indeed, since \(v_1,\ldots ,v_d\) are linearly independent, we may consider the linear transformation A with \(A(v_i) = e_i\) for \(i \in [d]\). Note that
Thus, (3) holds. Since S is chosen maximally, (2) shows that for any vertex w of Q, \(w \in P\). By convexity,
Let \(S' = -2dS + (v_1 + \cdots + v_d)\). By (1),
Let \(u =({1}/{d})(v_1 + \cdots + v_d)\) be the centroid of the facet\({{\,\textrm{conv}\,}}{\{v_1, \ldots , v_d\}}\) of S. Let y be the intersection of the ray from 0 through \(-u\) and the boundary of Q. By Carathéodory’s theorem, we can choose \(k \le d\) vertices \(\{v_1',\ldots ,v_k'\}\) of Q such that \(y \in {{\,\textrm{conv}\,}}{\{v_1',\ldots ,v_k'\}}\). Set \(Q'= {{\,\textrm{conv}\,}}{\{v_1,\ldots ,v_d,v_1',\ldots ,v_k'\}}\).
Note that \([y,u] \subseteq Q'\), which implies \(0 \in Q'\). Thus,
Since \(Q \subseteq - \lambda Q\), we have that \(-u \in \lambda Q\). Since \( \lambda y\) is on the boundary of \( \lambda Q\), we also have that \(-u \in [0, \lambda y]\). We know that \(0, \lambda y \in \lambda Q'\), so
Combining (4), (6), (7), and (8):
\(\square \)
Proof of Theorem 1.4
As shown in [4], we may assume that the family \(\{K_1,\ldots ,K_n\}\) consists of closed halfspaces such that \(K = \bigcap K_i\) is a d-dimensional polytope. Let T be the affine transformation sending K to John’s position. Let \({\widetilde{K}}_i = T{K}_i\) for \(i \in [n]\), \({\widetilde{K}} = TK\), and for some \(\sigma \subset [n]\), let \({\widetilde{K}}_{\sigma } = \bigcap _{i \in \sigma } {\widetilde{K}}_i\). We claim that there exists \(\sigma \in \left( {\begin{array}{c}[n]\\ \le 2d\end{array}}\right) \) such that the following two properties hold:
for some constant \(c > 0\). Estimates (10) and (11) are affine invariant, so this will suffice to prove Theorem 1.4.
Recall that since \({\widetilde{K}}\) is in John’s position, \(B^d \subseteq {\widetilde{K}} \subseteq d B^d\) (see [2] or [12, Thm. 5.1]). Setting \(Q = ({\widetilde{K}})^{\circ }\), this yields that \((1/d)B^d \subseteq Q \subseteq B^d\) (here and later on, \(K^\circ \) stands for the polar set: \(K^\circ = \{ x \in \mathbb {R}^d: \langle x, y \rangle \le 1 \text { for all } y \in K \}\).) In particular, \(Q \subseteq -d\,Q\). Hence, we may apply Theorem 1.1 to Q with \(\lambda = d\), we obtain a subset of at most 2d vertices of Q such that their convex hull \(Q'\) satisfies
The family of closed halfspaces supporting the facets of \((Q')^{\circ }\) is a subset of \(\{{\widetilde{K}}_1,\ldots , {\widetilde{K}}_n\}\) with at most 2d elements. Thus, we can choose \(\sigma \in \left( {\begin{array}{c}[n]\\ \le 2d\end{array}}\right) \) such that \({\widetilde{K}}_{\sigma } = (Q')^{\circ }\). Taking the polar of (12), we obtain
which shows (10).
Let P be the parallelotope enclosing Q from the proof of Theorem 1.1 and set \(P' = -({1}/({2d^2}))P\). Statement (9) implies
Since S is chosen maximally, the volume of S is at least the volume of the simplex obtained from the Dvoretzky–Rogers lemma [10] (see also [17, Lem. 1.4]):
Using (13),
Note that \(P'\) is centrally symmetric, so we can use the Blaschke–Santaló inequality (see [1, Thm. 1.5.10]) for \(P'\):
Using the inclusions \({\widetilde{K}} \supseteq B_2^d\) and \({\widetilde{K}}_{\sigma } = (Q')^{\circ } \subseteq (P')^{\circ }\), as well as (14) and (15):
for some absolute constant \(c > 0\). This shows (11) and concludes the proof. \(\square \)
Remark
We briefly explain how Conjecture 1.5 would imply the asymptotically optimal bound on v(d). First note that the estimate (12) would hold with the factor cd instead of \(2d^2\). Then, in the rest of the proof of Theorem 1.4, we could replace all instances of the factor \(2 d^2\) with cd. In particular, one would get the linear upper bound \(\delta (d) \le c d\) from the improvement of (10), while the rest of the calculations would show that the final quotient in (16) is at most \((c' d)^{d/2}\) for some absolute constant \(c' > 0\).
References
Artstein-Avidan, Sh., Giannopoulos, A., Milman, V.D.: Asymptotic Geometric Analysis. Part I. Mathematical Surveys and Monographs, vol. 202. American Mathematical Society, Providence (2015)
Ball, K.: An elementary introduction to modern convex geometry. In: Flavors of Geometry. Math. Sci. Res. Inst. Publ., vol. 31, pp. 1–58. Cambridge University Press, Cambridge (1997)
Bárány, I., Kalai, G.: Helly-type problems. Bull. Am. Math. Soc. 59(4), 471–502 (2022)
Bárány, I., Katchalski, M., Pach, J.: Quantitative Helly-type theorems. Proc. Am. Math. Soc. 86(1), 109–114 (1982)
Bárány, I., Katchalski, M., Pach, J.: Helly’s theorem with volumes. Am. Math. Monthly 91(6), 362–365 (1984)
Brazitikos, S.: Brascamp–Lieb inequality and quantitative versions of Helly’s theorem. Mathematika 63(1), 272–291 (2017)
Brazitikos, S.: Quantitative Helly-type theorem for the diameter of convex sets. Discrete Comput. Geom. 57(2), 494–505 (2017)
Brazitikos, S.: Polynomial estimates towards a sharp Helly-type theorem for the diameter of convex sets. Bull. Hellenic Math. Soc. 62, 19–25 (2018)
Dillon, T., Soberón, P.: A mélange of diameter Helly-type theorems. SIAM J. Discrete Math. 35(3), 1615–1627 (2021)
Dvoretzky, A., Rogers, C.A.: Absolute and unconditional convergence in normed linear spaces. Proc. Nat. Acad. Sci. USA 36, 192–197 (1950)
Fernandez Vidal, T., Galicer, D., Merzbacher, M.: Continuous quantitative Helly-type results. Proc. Am. Math. Soc. 150(5), 2181–2193 (2022)
Gordon, Y., Litvak, A.E., Meyer, M., Pajor, A.: John’s decomposition in the general case and applications. J. Differ. Geom. 68(1), 99–119 (2004)
Helly, E.: Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten. Monatsh. Math. Phys. 37(1), 281–302 (1930)
Ivanov, G., Naszódi, M.: A quantitative Helly-type theorem: containment in a homothet. SIAM J. Discrete Math. 36(2), 951–957 (2022)
Ivanov, G., Naszódi, M.: Functional John ellipsoids. J. Funct. Anal. 282(11), # 109441 (2022)
John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays Presented to R. Courant on his 60th Birthday, pp. 187–204. Interscience, New York (1948)
Naszódi, M.: Proof of a conjecture of Bárány, Katchalski and Pach. Discrete Comput. Geom. 55(1), 243–248 (2016)
Acknowledgements
This research was done under the auspices of the Budapest Semesters in Mathematics program. We are grateful to the anonymous referees for their valuable comments on the article.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research of Gergely Ambrus was supported by NKFIH grant KKP-133819; by the EFOP-3.6.1-16-2016-00008 Project, which in turn has been supported by the European Union, co-financed by the European Social Fund; and by the national project TKP2021-NVA-09. Project no. TKP2021-NVA-09 has been implemented with the support provided by the Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund, financed under the TKP2021-NVA funding scheme.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Almendra-Hernández, V.H., Ambrus, G. & Kendall, M. Quantitative Helly-Type Theorems via Sparse Approximation. Discrete Comput Geom 70, 1707–1714 (2023). https://doi.org/10.1007/s00454-022-00441-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-022-00441-5