Abstract 1 Introduction 2 On homological minors 3 Graded parameters of set systems References

Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions

Sergey Avvakumov ORCID School of Mathematical Sciences, Tel Aviv University, Israel    Marguerite Bin ORCID Université de Lorraine, CNRS, INRIA, LORIA, F-54000 Nancy, France    Xavier Goaoc ORCID Université de Lorraine, CNRS, INRIA, LORIA, F-54000 Nancy, France
Abstract

A theorem of Matoušek asserts that for any k2, any set system whose shatter function is o(nk) enjoys a fractional Helly theorem of order k: in the k-wise intersection hypergraph, positive density implies a linear-size clique. Kalai and Meshulam conjectured a generalization of that phenomenon to homological shatter functions. It was verified for set systems with bounded homological shatter functions and whose ground set has a forbidden homological minor (which includes d by a homological analogue of the van Kampen-Flores theorem). We present two contributions to this line of research:

  • We study homological minors in certain manifolds (possibly with boundary), for which we prove analogues of the van Kampen-Flores theorem and of the Hanani-Tutte theorem.

  • We introduce graded analogues of the Radon and Helly numbers of set systems and relate their growth rate to the original parameters. This allows to extend the verification of the Kalai-Meshulam conjecture to sufficiently slowly growing homological shatter functions.

Keywords and phrases:
Fractional Helly theorem, homological minor, combinatorial convexity
Copyright and License:
[Uncaptioned image] © Sergey Avvakumov, Marguerite Bin, and Xavier Goaoc; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation Computational geometry
Related Version:
Full Version: https://arxiv.org/abs/2601.02920 [2]
Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri

1 Introduction

A classical line of research in discrete geometry investigates generalizations of properties of convex sets beyond convexity, with a particular attention to topological conditions. At least three distinct lines of inquiry emerged:

(A)

Generalizing families of convex sets into acyclic/good covers, meaning set systems in topological spaces such that every subfamily has empty or homologically/homotopically trivial intersection; an early example is Helly’s topological theorem [15], see also the survey of Tancer [34] for an overview.

(B)

Reformulating properties of convex sets of d as properties of linear maps into d and investigating their generalizations to continuous maps into d, typically via theorems of Borsuk-Ulam type; an early example is the topological Radon theorem of Bajmóczy and Bárány [3] and more examples can be found e.g. in the survey of Bárány and Soberón [5].

(C)

Analyzing set systems whose nerve enjoy properties of nerves of convex sets, like d-collapsibility or d-Lerayness; an early example is the sharpening of the Fractional Helly theorem by Kalai [18] and the work of Alon et al. [1] establishes several landmark results.

Two decades ago, Kalai and Meshulam [19] proposed conjectures relating approaches (A) and (C), towards what they called a theory of homological VC dimension. First, in order to generalize the notion of good cover, let us measure the complexity of the intersection patterns of a set system in a topological space by its hth homological shatter function

ϕ(h):{{}ksup{βi~(F𝒢F;2)|𝒢,|𝒢|k,0ih}. (1)

Here h is some fixed parameter, and β~i(;2) is the ith reduced Betti number with coefficients in 2. (The set systems with ϕ()0 are the acyclic covers and include good covers and convex sets.) The conjectures are about nerves of set systems whose intersection patterns have polynomially-growing topological complexity. In particular, their combination [19, Conjectures 6 and 7] (see also [13, Conjecture 1.9]) implies that polynomially-growing homological shatter functions give rise to a “positive density implies big clique” phenomenon:

Conjecture 1 (Kalai and Meshulam).

For any d and any function Ψ: such that Ψ(n)=O(nd), there exists β:(0,1)(0,1) such that the following holds. For any α>0 and any set system in d with ϕ(d)Ψ, if a proportion α of the (d+1)-element subsets of have nonempty intersection, then some β(α)|| members of have a point in common.

Such conditions that a positive density of d-faces in the nerve implies the existence of a linear-size face is called a fractional Helly theorem (see Section 1.1.1).

Conjecture 1 is a topological analogue of a theorem of Matoušek [25] which asserts that every set system with polynomial (combinatorial) shatter function enjoys a fractional Helly theorem.

Conjecture 1 was confirmed for functions Ψ that are bounded ([13, Corollary 1.3], building on [16, 17, 28]). The main contribution of the present paper is to extend that confirmation to some diverging homological shatter functions and to set systems on certain manifolds.

1.1 Context and motivation

Before we state our results precisely (in Section 1.2) let us provide some context and motivation, as well as introduce some necessary terminology.

1.1.1 Combinatorial background: convexity parameters of set systems

The classical theorems of Helly, Radon and Carathéodory have initiated a rich theory of the combinatorial properties of convexity, whose landmarks include the centerpoint theorem, Tverberg’s theorem, the colorful Helly and Carathéodory theorems, the fractional Helly theorem, the selection lemma, the weak ε-net theorem, the (p,q)-theorem, etc. We refer the interested reader to the monograph of Bárány [4] and the textbook of Matoušek [22]. These classical convexity theorems have algorithmic consequences for instance in optimization and geometric data analysis [8, § 67] or in property testing [7], and one motivation for their extension beyond the convex setting is that several of these benefits generalize as well [24, 11].

We can associate to any set system with ground set X some parameters inspired by convexity properties, for instance:

  • The Helly number h of is the smallest integer h with the following property: If in a finite subfamily 𝒢, every h members of 𝒢 intersect, then 𝒢 has nonempty intersection. If no such h exists, we set h=.

  • The Radon number r of is the smallest integer r such that every r-element subset SX can be partitioned into two nonempty parts S=P1P2 such that conv(P1)conv(P2). (The set conv(P), the -convex hull of a subset PX, is the intersection of all the members of that contain P.) If no such r exists, we set r=.

Hence, letting 𝒞d denote the set of all halfspaces in d, Radon’s lemma asserts that r𝒞d=d+2 and Helly theorem that h𝒞d=d+1. A classical result by Levi [21] asserts that for every set system we have hr1. (This is often stated for convexity spaces but it holds for set systems, see [2, App. C].) Similar relations between such parameters have been investigated over the years, like for instance the partition conjecture of Eckhoff [10] refuted by Bukh [6].

Conjecture 1 pertains to a parameter inspired by the fractional Helly theorem [20, 18], which asserts that in (d+1)-wise intersection hypergraphs of convex sets of d, positive density implies a linear-size clique. Here is the associated parameter:

  • The fractional Helly number fh of is the smallest integer s such that there exists a function β:(0,1)(0,1) with the following property: For every finite subfamily , whenever a fraction α of the s-tuples of have nonempty intersection, a subset 𝒢 of of size β(α)|| has nonempty intersection.

Again, the fractional Helly theorem states that fh𝒞d=d+1. The significance of the fractional Helly number was highlighted by Alon et al. [1], who proved that intersection-closed set systems with bounded fractional Helly number enjoy a weak ε-net theorem, a Tverberg-type theorem, a selection lemma, etc. It is tempting to reformulate Conjecture 1 as

For any function Ψ: such that Ψ(n)=O(nd), every set set system in d such that ϕ(d)Ψ has fractional Helly number at most d+1.

We note, however, that this statement is weaker than Conjecture 1 in that it does not assert that the function β() underpinning the fractional Helly number depends only on Ψ and d.

1.1.2 Homological background: homological minors

A classical way to extend the theory of planar graphs is to consider embeddings of graphs into surfaces and of simplicial complexes into d or other topological spaces.

There is a rich theory of embedding of graphs on surfaces, both structural (a classic being the Heawood inequality [31]) and computational (e.g. the use of graph genus for parameterized complexity). Let us mention, in particular, the strong Hanani-Tutte theorem which asserts that a graph is planar if it can be drawn so that every pair of independent edges cross an even number of times. This statement generalizes to the projective plane [29, 9] but was found to fail in genus 4 [12].

Going to dimension higher than 2 changes the nature of the problems drastically, already because Fáry’s theorem no longer holds. (For every d3 there are simplicial complexes that embed in d piecewise linearly but not linearly.) It is thus sometimes convenient to relax the notion of embedding and work with chain maps, and this was done in particular to analyze intersection patterns [14, 28, 13] using a notion of homological minors [35].

Formally, the support of a singular chain is the union of (the images of) the singular simplices with nonzero coefficient in that chain, and the support of a simplicial chain is the subcomplex induced by the simplices with nonzero coefficient in that chain. We write supp(σ) for the support of a (singular or simplicial) chain σ. A chain map a:C(K)Csing(X) (resp. a:C(K)𝒞(T)) is nontrivial if, for every vertex v of K, the support of a(v) has odd size. Two faces in a simplicial complex K are adjacent if they have at least one vertex in common. A homological almost-embedding of a simplicial complex K into a topological space X (resp. into another simplicial complex L) is a nontrivial chain map a:C(K)Csing(X) (resp. a:C(K)C(L)) such that any two non-adjacent faces σ,τK have images with disjoint support, that is supp(a(σ))supp(a(τ))=. In particular, for every embedding f the associated chain map f# is a homological (almost) embedding.

Let ΔN denote the N-dimensional simplex and for K a simplicial complex let K(t) denote its t-dimensional skeleton. It turns out that there is a homological version of the van Kampen-Flores theorem (see for instance [14, Corollary 14]):

Theorem 2.

For any d1, Δd+2(d/2) does not homologically almost embed into d.

A simplicial complex K is a homological minor of a topological space or simplicial complex X if there is a homological almost-embedding of K into X. Theorem 2 thus asserts that Δd+2(d/2) is not a homological minor of d, i.e., that d has Δd+2(d/2) as forbidden homological minor.

1.1.3 Parameters of set systems with a forbidden homological minor

Matoušek [23] bounded the Helly number of topological set systems in d in which every subfamily intersects in a bounded number of connected components, all contractible. His approach starts from a set systems in d, uses Ramsey theory to build a map from Δd+2(d/2) into d that is “constrained” by the known intersection patterns of so that the intersection forced by the van Kampen-Flores theorem reveals a new intersection in .

This approach was generalized by Goaoc et al. [14] to set systems in d of bounded d/2-level topological complexity, where the h-level topological complexity of is the maximum over of the homological shatter function ϕ(h), that is

hc(h):=max{max0i<hβi~(A𝒢A;2)|𝒢}. (2)

That generalization relied on homological minors and replaced the construction of the “constrained map” by the (simpler) construction of a “constrained chain map”. The only aspect of the method that is specific to d is the use of the forbidden homological minor given by Theorem 2, so the approach readily generalizes to set systems whose ground set is a topological space with a forbidden homological minor, see the discussions in [28, §5.2] and [13, §2.2]. This method was refined and extended to analyze other parameters of set systems whose ground set has a forbidden homological minor [28, 26, 13].

1.1.4 Proof of Conjecture 1 for bounded homological shatter functions

Conjecture 1 was proven for bounded homological shatter functions in three steps:

  • First, Holmsen and Lee [17, Theorem 1.1] proved that the fractional Helly number of any set system can be bounded by a function of its Radon number. Specifically, letting Ψrfh(x) denote the supremum of the fractional Helly number of a set system with Radon number x, they proved that for every r3 we have Ψrfh(r)rrlog2r+rlog2r.

  • Second, Patáková [28, Theorem 2.1] proved that the Radon number of any set system whose ground set has K as forbidden homological minor can be bounded by a function of its (dimK)-level topological complexity.

  • Third, Goaoc, Holmsen and Patáková [13, Theorem 1.2] proved that for every set systems whose ground set has K as forbidden homological minor, if the fractional Helly number fh is bounded then it is at most μ(K)+1, where μ(K) denotes the maximum sum of dimensions of two disjoint simplices in K.

1.2 Statement of the results

Our main contribution is to confirm Conjecture 1 for some diverging homological shatter functions and on some manifolds. This decomposes into five independent results.

Throughout the paper, we work with compact piecewise-linear (PL) manifolds (possibly with boundary); see [32, §1] for an introduction. We first generalize Theorem 2:

Theorem 3.

For every integers d3 and b there exists N=N(d,b) such that ΔN(d/2) does not homologically almost embed in any compact, (d/21)-connected, d-dimensional PL manifold (possibly with boundary) with βd/2(;2)b.

This partially answers [28, Problem 3], [13, Conjecture 1.7] and [26, Conjecture 2] and extends the previous confirmation of Conjecture 1 from set systems in d to set systems on manifolds. This also extends several results on set systems with bounded topological complexity (Helly’s theorem, Radon’s theorem, (p,q)-theorem, …) from d to sufficiently connected manifolds (see [28, 13]). We can relax the connectivity assumption (see [2, App. B]) but not remove it.

One ingredient in the proof of Theorem 3 is the following analogue of the Hanani-Tutte theorem for homological almost-embeddings, which is of independent interest.

Theorem 4.

Let K be a simplicial complex of dimension k>1 and let be a compact 2k-dimensional PL manifold (possibly with boundary). If there exists a triangulation T of and a non-trivial chain map f:C(K;2)C(T;2) in general position such that the images of any two non-adjacent k-faces σ,τK intersect in an even number of points, then K is a homological minor of .

We formalize what we mean by general position in Section 2.

The homological shatter function Φ(h) defined in Equation (1) can be reformulated as a graded version of the topological complexity hc(h) defined in Equation (2), where the value for parameter t considers only intersections of subfamilies of size at most t: ϕ(h)(t)=sup||thc(h). We systematize this viewpoint and define graded analogues of other parameters of set systems. For instance here are the graded Radon and graded Helly numbers:

r(t)sup||trandh(t)sup||th. (3)

It is straightforward to see that if the graded Helly numbers of a set system do not grow fast enough, then they are ultimately stationary and the set system has bounded Helly number (Lemma 10). We prove a similar condition for (graded) Radon numbers:

Theorem 5.

Let be a set system. If limtr(t)log2t=, then r<.

As a application, we extend Patáková’s theorem from bounded to sufficiently slowly diverging homological shatter function (Corollary 12). This, in turns yields fractional Helly theorems for sufficiently slowly diverging homological shatter functions.

Corollary 6.

For every simplicial complex K there exists a function ΨK: with limtΨK(t)=+ such that the following holds. If is a set system whose ground set has K as forbidden homological minor and such that ϕ(dimK)(t)ΨK(t) for t large enough, then has fractional Helly number at most (μ(K)+1).

We then investigate more graded numbers and establish more relations between graded and ungraded numbers. As an application, we extend the Holmsen-Lee bound on Ψrfh(). Let Ξ: be the function defined by Ξ(r):=rrlog2r+rlog2r.

Theorem 7.

Let Ψ: and t0 such that Ψ(t)<t+1 for every tt0. If there exists an integer t1t02 such that Ξ(Ψ(t1))<t1t0, then every set system whose graded Radon number function is bounded from above by Ψ has bounded fractional Helly number.

With Theorem 7 we can strengthen Corollary 6, as a close inspection of the proof reveals that the function β associated to the fractional Helly number depends only on Ψ and t0. (It also allows a slightly faster growth than Corollary 12.) We postpone this to the full version of the paper.

2 On homological minors

In this section we prove Theorems 3 and 4. For completeness, we start with a consequence of the simplicial approximation theorem that allows us to work purely in simplicial homology:

Lemma 8 ([2, App. A]).

A simplicial complex K is a homological minor of a compact PL manifold (possibly with boundary) if and only if K is a homological minor of some triangulation of .

When counting intersection points between chains, we focus on intersections that are stable under small perturbation. We therefore consider generic intersections, meaning intuitively that the chains intersect transversally. We formalize this in terms of linking numbers.111Intuitively, this generalizes the idea that in the plane, two curves cross at a point x if the branches of the curves alternate around x.

Let X be a triangulation of 𝕊2k1. Let S1 and S2 be two subcomplexes of X with |S1| and |S2| homeomorphic to 𝕊k1. Suppose that the simplicial complex XS2 induced by X on the vertices not in S2 has a geometric realization homotopy equivalent to 𝕊2k1𝕊k1 (this can always be ensured up to taking a subdivision of X). The linking number of S1 and S2 in X is 1 if the homology class [S1] generates Hk1(XS2;2)2, and 0 if [S1] is trivial in Hk1(XS2;2). (Exchanging S1 and S2 in this definition yields the same result.)

Let T be a triangulation of a compact PL manifold (possibly with boundary) . Two k-chains z1,z2Ck(T;2) intersect generically in vertex v if the closed star B of v in T satisfies: Bz1z2={v}, D1:=z1B and D2:=z2B are k-dimensional balls, and the spheres D1 and D2 have linking number 1 in B. Two k-chains z1,z2Ck(T;2) are in general position if z1z2 consists of finitely many vertices, and z1 and z2 intersect generically in each of these vertices. Two k-chains z1,z2Ck(T;2) intersect evenly if they are in general position and im(z1)im(z2) has even size.

For K a k-dimensional complex, a simplicial chain map f:C(K;2)C(T;2) is in general position if for every non-adjacent k-faces σ,τK, the chains f(σ) and f(τ) are in general position and for each vertex vf(σ)f(τ), σ and τ are the only faces of K whose images under f intersect the closed star of v in T. We say that a simplicial map f:KT is in general position if the associated chain map f# is.

For any compact PL manifold (possibly with boundary) of dimension 2k, there exists a map :Hk(;2)×Hk(;2)2, called the intersection form of , such that ([z1],[z2])2 counts the intersection points of z1 and z2 modulo 2. We use no property of intersection forms besides their existence, and refer the interested reader to Prasolov [30, Chapter 2, §2.7] for a precise definition and to Paták and Tancer [27] for an brief account.

The next result is due to Paták and Tancer [27, Proposition 21] and formulated following the presentation of Skopenkov [33], which is better suited for our purpose. (More precisely, we reformulated [33, Theorem 1.1.5] using [33, Lemma 2.1.1].) Note that the proofs by Paták-Tancer [27] and by Skopenkov [33] use only PL maps.

Theorem 9.

Let L be a simplicial complex of dimension k>1 and let be a compact, (k1)-connected, 2k-dimensional PL manifold (possibly with boundary). The following statements are equivalent:

  1. (i)

    There exists a triangulation T of and a simplicial map f:LT in general position such that the images of any two non-adjacent faces intersect evenly.

  2. (ii)

    There exists a triangulation R of 2k and a simplicial map g:LR in general position and a map α that sends each k-face of L to an element of Hk(;2) such that any two non-adjacent k-faces σ,τL have images that intersect in an even number of points if and only if (α(σ),α(τ))=0.

2.1 A homological Hanani-Tutte theorem

Let us now prove Theorem 4. Let K be a simplicial complex of dimension k>1 and let T be a triangulation of a compact PL manifold (possibly with boundary) of dimension 2k. Let f:C(K;2)C(T;2) be a non-trivial chain map in general position such that the images of any two non-adjacent k-faces σ,τK intersect evenly.

Our goal is to prove that K is a homological minor of . This requires repeatedly subdividing the triangulation T. In what follows, every time we subdivide a triangulation Ti into Ti+1, all chain maps to Ti and subcomplexes of Ti are also subdivided to Ti+1. Also, throughout the proof we identify every pure -dimensional simplicial complex with the unique -chain with coefficients in 2 it supports; we abuse the terminology and say that we add (pure) simplicial complexes over 2 to mean that we add the corresponding chains.

If f is a homological almost-embedding we are done. Otherwise, there exist some non-adjacent k-faces σ,τK such that f(σ)f(τ) is non-empty. By assumption, this intersection is a set of vertices of even size, so let x,yf(σ)f(τ) be two distinct such vertices. Recall that f is in general position, f(σ) and f(τ) intersect generically in x and in y. We set out to construct a refinement T of T and a new map f:C(K;2)C(T;2) that is also in general position, differs from f only on σ and τ, and satisfies f(σ)f(τ)=(f(σ)f(τ)){x,y} as well as f(α)f(β)=f(α)f(β) for any α{σ,τ} and any k-face βK{σ,τ}. Iterating this procedure produces the announced homological almost-embedding of K into a triangulation of .

Figure 1: The setup for the construction of T and f.

Let Bx and By denote the closed stars of x and y in T. For z{x,y} and α{σ,τ} let Dα,z:=supp(f(α))Bz. Since f(σ) and f(τ) intersect generically in x and y, the complexes Dσ,x,Dσ,y,Dτ,x and Dτ,y are k-dimensional balls, the (k1)-spheres Dσ,x and Dτ,x have linking number 1 in Bx, and similarly Dσ,y and Dτ,y have linking number 1 in By.

We subdivide T into T1 so that the closed star Bx of x and By of y in T1 are disjoint from Bx and By, respectively. In particular, for z{x,y} and α{σ,τ}, letting Dα,z:=supp(f(α))Bz, the pair (Dα,z,Bz) is homeomorphic to (𝕊k1,𝕊2k1). The genericity of x and y in f(σ)f(τ) is preserved through the subdivision TT1 so the four complexes D, are k-dimensional balls and their bounding spheres have the same linking numbers in Bx and By as their counterparts on Bx and By.

Figure 2: The construction of B.

Up to subdividing T1 into T2, there exist vertices vx and vy in Bx and By, respectively, and a path P in the 1-skeleton of T2 from vx to vy such that, letting N(P) denote the closed star of P in T2, the closed star of N(P) is disjoint from the image of f. The union B:=BxN(P)By is a ball. Observe that in B, the (k1)-spheres Dσ,x and Dτ,x retain the linking number 1 that they have on Bx. Similarly, in B, the (k1)-spheres Dσ,y and Dτ,y retain the linking number 1 that they have on By.

Figure 3: The path Pσ.

Thus, up to further subdividing T2 into T3, there exist a path Pσ in the 1-skeleton of B that connects Dσ,x to Dσ,y and with relative interiors disjoint from the image of f. (Here we use that Dα,z is of codimension k2 in B.) Up to subdividing the triangulation further, we can pipe Dσ,x and Dσ,y together by a tube Fσ found in a neighborhood of the path Pσ [32, §5.10]. The tube (Fσ,FσDσ,x,FσDσ,y) is homeomorphic to (𝔻k×[0,1],𝔻k×{0},𝔻k×{1}). Moreover, by the (PL) general position theorem for embeddings [32, §5.3], we can take Fσ such that B and Fσ intersect in a generic way. By taking Fσ in a sufficiently small neighborhood U of Pσ so that (U,BU) is homeomorphic to (2k,2k1×{0}), and the triple (FσB,FσDσ,xB,FσDσ,yB) is homeomorphic to (𝔻k1×[0,1],𝔻k1×{0},𝔻k1×{1}).

Figure 4: The piping Fσ between Dσ,x and Dσ,y in a neighborhood of Pσ.

Now, let Cσ be the sum Dσ,x+Fσ+Dσ,y (over 2). Note that Cσ is contained in the union of BxBy and the closed star of N(P), and therefore intersects the image of f only inside BxBy. We note that FσB also pipes the (k1)-spheres Dσ,xB and Dσ,yB. Indeed, (FσB,FσDσ,xB,FσDσ,yB)=(FσB,Fσ(Dσ,xB), Fσ(Dσ,yB)) is homeomorphic to (𝔻k1×[0,1],𝔻k1×{0},𝔻k1×{1}). It follows that CσB is homeomorphic to the connected sum of two (k1)-spheres, and is therefore homeomorphic to a (k1)-sphere.

Figure 5: The chain Cσ=Dσ,x+Fσ+Dσ,y over 2.

We claim that, in B, the linking number between CσB and Dτ,xB equals the linking number between Dσ,xB and Dτ,xB, that is 1. This follows from the fact that the chain Cσ differs from Dσ,x by Fσ+Dσ,y, and that each of FσB and Dσ,yB is a boundary in BDτ,x. The same claim holds if we exchange x for y.

Figure 6: The chain ηCk(BCσ;2) such that η=Dτ,xB+Dτ,yB over 2.

Altogether, we get that Dτ,xB and Dτ,yB are in the same homology class in BCσ. Hence, their sum is a boundary, and there exists a chain ηCk(BCσ;2) such that the support of η is the sum over 2 of Dτ,xB and Dτ,yB. We finally set

f(σ)=f(σ)+Dσ,x+Dσ,yf(σ) with its restriction to BxBy removed+Cσandf(τ)=f(τ)+Dτ,x+Dτ,yf(τ) with its restriction to B removed+η
Figure 7: The chains Cσ and η reroute f(σ) and f(τ) so as to remove intersections in Bx and By.

We set f(ω)=f(ω) for every other face ωK. Extending f linearly yields a chain map, since both f(σ)f(σ) and f(τ)f(τ) are cycles 222They are even boundaries, ensuring that f is chain homotopic to f. The chain map f is as announced: f(σ)f(τ)=f(σ)f(τ){x,y} and every other intersection remains unchanged. This concludes the proof of Theorem 4.

2.2 Forbidden homological minors for manifolds

We now prove Theorem 3. First, note that the odd-dimensional case reduces to the even-dimensional one. Indeed, for every k2, if is a compact, (k1)-connected, (2k1)-dimensional PL manifold (possibly with boundary), then ×[0,1] is a compact, (k1)-connected, 2k-dimensional PL manifold (possibly with boundary). Moreover, βk(×[0,1];2)=βk(;2) and any homological minor of is a homological minor of ×[0,1]. If the statement holds for d even and b with some N(b,d), then it holds with d1 and b by putting N(d1,b):=N(d,b). So let us now consider the even-dimensional case.

Let k2 and b, and let be a compact, (k1)-connected, 2k-dimensional PL manifold (possibly with boundary). Let us fix N and suppose that K=ΔN(k) is a homological minor of . By Lemma 8, there exist a triangulation T of and a (simplicial) homological almost-embedding C(K)C(T). Actually, letting S:=T(k), we have that there exists a homological almost-embedding a:C(K;2)C(S;2).

We apply Theorem 9 with L=S. Condition (i) holds with T=S and f the identity, so Condition (ii) also holds. Hence, there exists a triangulation R of 2k, a simplicial map g:SR in general position, and a map α that sends each k-face of S to an element of Hk(;2) such that any two non-adjacent k-faces σ,τS intersect evenly if and only if (α(σ),α(τ))=0. We let α~:Ck(S)Hk(;2) denote the linear extension of α.

Consider the chain map b:C(K;2)C(R;2) defined by b=g#a. Note that b is nontrivial since a is nontrivial and g is a simplicial map. Moreover, the fact that b is a chain map in general position follows from three observations:

  • since g is a simplicial map in general position, g# is a chain map in general position,

  • since a is a homological almost-embedding, it is also a chain map in general position, and

  • the composition of a homological almost-embedding and a chain map in general position is a chain map in general position.

Notice that for N2k+3, not every independent k-faces of K can have images under b that intersect evenly. Indeed Theorem 4 would then imply that K is a homological minor of 2k, which would contradict the homological van Kampen-Flores theorem (Theorem 2). We use Ramsey’s theorem to show that this contradiction can be reached for some subcomplex of K.

So consider two non-adjacent k-faces σ,τK and put a(σ)=σ1+σ2++σs and a(τ)=τ1+τ2++τt. Since a is a homological almost-embedding, supp(a(σ)) and supp(a(τ)) are disjoint, and σi and τj are thus non-adjacent for every (i,j)[s]×[t]. Hence, given (i,j)[s]×[t], g(σi) and g(τj) intersect evenly if and only if (α(σi),α(τj))=0. We can thus count the intersections of b(σ) and b(τ) (the following equalities are modulo 2 and Card() denotes the cardinal):

Card(b(σ)b(τ))= i[s],j[t]Card(g(σi)g(τj))
= i[s],j[t](α(σi),α(τj))
= i[s](α(σi),α~(a(τ)))=(α~(a(σ)),α~(a(τ))).

Let r=βk(;2). The map β:Ck(K)Hk(;2) defined by β=α~a induces a coloring of the k-simplices of K by the (at most 2r) elements of Hk(M;2). Let N denote the number of vertices of sdΔ2k+2(k). By the hypergraph Ramsey theorem, for N large enough (as a function of r and k) there exists a subset W of N vertices in K such that β is constant over all k-simplices of K[W]; let us denote by this constant value. In particular, for every k-faces σ,τ of K[W] such that σ and τ are not adjacent, we have, modulo 2, Card(b(σ)b(τ))=(β(σ1),β(τ1))=(,). Let us fix a bijection from the vertices of sdΔ2k+2(k) to W and extend it to a chain map j:C(sdΔ2k+2(k))C(K[W]). Also, let h:C(Δ2k+2(k))C(sdΔ2k+2(k)) denote the subdivision chain map, where each i-face of Δ2k+2(k) is mapped to the sum of the i-faces of sdΔ2k+2(k) that it contains. In particular, for every k-face σ of Δ2k+2(k), the chain h(σ) is supported on k! k-faces of sdΔ2k+2(k).

Let us examine the properties of bjh. First, it is a nontrivial chain map (because b, j and h are). Moreover, jh is a homological almost-embedding (since j and h are), and its composition with the chain map in general position b yields a chain map in general position. Furthermore, any two non-adjacent k-faces σ,τΔ2k+2(k) have images under bjh that intersect evenly. To see this, let us put jh(σ)=σ1+σ2++σs and jh(τ)=τ1+τ2++τs. Since jh is a homological almost-embedding, supp(jh(σ)) and supp(jh(τ)) are disjoint. It follows that for every i,j[s] the k-simplices σi and τj are non-adjacent. We therefore have, modulo 2,

Card(bjh(σ)bjh(τ)) =i,j[s]Card(b(σi)b(τj))
=i,j[s](β(σi),β(τj))=i,j[s](,).

To sum up, the cardinal of bjh(σ)bjh(τ) has the same parity as (,)s2. Since s=k! is even, σ and τ have images under bjh that intersect evenly.

To conclude, bjh is a nontrivial chain map in general position from Δ2k+2(k) to R such that independent faces have images that intersect evenly. By Theorem 4 this means that Δ2k+2(k) is a homological minor of 2k, a contradiction with Theorem 2. Thus, for N large enough, the initial hypothesis that ΔN(k) is a homological minor of cannot be true.

3 Graded parameters of set systems

In this section we present our contributions on set systems of parameters.

3.1 Graded Radon and Helly numbers

Each relation between parameters of a set system yields a relation between their graded analogues. From Levi’s inequality we get the following inequality between the graded Helly and Radon numbers (defined in Section 1.1.1):

t,h(t)=sup||thsup||t(r1)=r(t)1. (4)

It follows from the definitions of graded parameters that each one is a non-decreasing function that converges to the ungraded parameter (possibly ). We notice that if a graded Helly number is asymptotically sublinear then it is bounded:

Lemma 10.

Let be a set system and t0. If h(t)<t for all t>t0, then ht0.

Proof.

By definition, we have h(t)t for every t. Moreover, h(t)h(t1) if and only if h(t)=t. The assumption and a straightforward induction therefore implies that for every t>t0 we have h(t)=h(t0)t0. The growth of graded Radon numbers is at most linear [2, App. D] and rather constrained:

Lemma 11.

Let be a set system and t2 an integer. If r(t)>r(t1), then r(t1)1+log2(1+th(t)).

Proof.

Let X denote the ground set of and let n=r(t1). Suppose that r(t)>n, so that there exist a subset 𝒢={G1,G2,,Gt} and a subset SX of size n such that

  1. (i)

    there is no partition of S into two parts whose 𝒢-convex hulls intersect,

  2. (ii)

    for every i[t], there exists a partition 𝒫i of S into two parts whose (𝒢{Gi})-convex hulls intersect.

Recall that given , the -convex hull conv(P) of a subset PX is the intersection of all the members of that contain P. In particular, for any PX such that PGi we have conv𝒢(P)=conv𝒢{Gi}(P). Conditions (i) and (ii) therefore imply that every Gi𝒢 contains one or the other part of 𝒫i.

There are at most 2n11 partitions of S in two nonempty parts. Let us assume that t>(2n11)h for some integer h, so that by the pigeonhole principle there exist h+1 indices i1,i2,,ih+1 such that the partitions 𝒫i1,𝒫i2, …, 𝒫ih+1 coincide. Let {P1,P2} be that partition of S. Let us put 𝒢={A𝒢:P1A or P2A}. We make two observations:

  • A𝒢A coincides with conv𝒢(P1)conv𝒢(P2) and is therefore empty.

  • every choice of h elements in 𝒢 has nonempty intersection. Indeed, 𝒢 contains Gi1, Gi2, …, Gih+1, so that any choice of h elements from 𝒢 is bound to miss Gij for at least one j[h+1] and their intersection must then contain conv𝒢{Gij}(P1)conv𝒢{Gij}(P2).

For hh(t) these conditions are incompatible. We therefore have t(2n11)h(t), and the statement follows.

We can now prove that any set system with sufficiently slowly growing graded Radon numbers has finite Radon number.

Proof of Theorem 5.

Let be a set system with infinite Radon number. If the Helly number h is also infinite, then by Lemma 10 there exists an increasing sequence {ti}i such that h(ti)=ti, and therefore r(ti)ti+1 by Inequality (4); this prevents r(t)log2t from going to as t. So suppose that the Helly number h is finite. The assumption that r= ensures that there exists an increasing sequence {ti}i such that r(ti)>r(ti1). Lemma 11 implies that r(ti)>r(ti1)log2tilog2h. Again, this prevents r(t)log2t from going to as t. The statement follows by contraposition.

3.2 Consequences for topological set systems

Let us finally consider topological set systems with slowly growing homological shatter function and ground set with a forbidden homological minor.

Corollary 12.

For every simplicial complex K there exists a function SK: with limtSK(t)=+ such that the following holds. Any set system whose ground set has K as forbidden homological minor and satisfies ϕ(dimK)(t)SK(t) for t large enough has finite Radon number.

Proof.

Recall that Ψhcr(K)(x) denotes the supremum of the Radon number of a set system with (dimK)-level topological complexity at most x and whose ground set has K as forbidden homological minor. Patáková [28] proved that Ψhcr(K)(x) is finite for every K and x.

For t, we define SK(t)=max{xΨhcr(K)(x)12log2t}. This ensures that Ψhcr(K)(SK(t))12log2t for every t. Observe that limtSK(t)= since Ψhcr(K)(x) is finite for every x.

Now consider a set system with function ϕ(dimK)SK and whose ground set has K as forbidden homological minor. Let t and consider a subset of size t. The ground set of also has K as forbidden homological minor. Moreover, has (dimK)-level topological complexity at most ϕ(dimK)(t)SK(t). It follows that rΨhcr(K)(SK(t))12log2t. This holds for every of size t, so r(t)12log2t. This inequality holds for every t so Theorem 5 implies that has bounded Radon number. We can finally prove a fractional Helly theorem for diverging homological shatter functions.

Proof of Corollary 6.

Recall that Ψrfh(y) denotes the supremum of the fractional Helly number of a set system with Radon number y. Holmsen and Lee [17, Theorem 1.1] proved that Ψrfh(y) is finite for every y. Let SK denote the function from Corollary 12. Now consider a set system whose ground set has K as forbidden homological minor and satisfies ϕ(dimK)SK. Corollary 12 ensures that r, the Radon number of , is finite. It follows that the fractional Helly number of is at most Ψrfh(r), and is therefore finite. From there, [13, Theorem 1.2] ensures that this fractional Helly number is at most μ(K)+1.

3.3 Other graded parameters and relations

With the intersection hypergraph of in mind, we say that a set 𝒢 in a set system is a clique if the intersection of all members of 𝒢 is non-empty. The colorful Helly theorem suggests the following parameter:

  • The colorful Helly number ch of is the smallest number of colors m such that for every coloring of a subfamily with m colors, if every subfamily that contains exactly one element of each color is a clique, then at least one color class is a clique.

We say that a set 𝒢 in a set system is a c-wise clique if every c-element subset of 𝒢 is a clique. Clearly a clique is a c-wise clique, and when ch the converse is true. To analyze set systems with large, infinite or unknown Helly numbers, it is useful to consider variants of the colorful and fractional Helly numbers where cliques are replaced by c-wise cliques:

  • The cth colorful Helly number ch(c) of is the smallest number of colors mc such that for every coloring of a subfamily with m colors, if every subfamily of that contains exactly one element of each color forms a c-wise clique, then at least one color class is a c-wise clique.

  • The cth fractional Helly number fh(c) of is the smallest integer s such that there exists a function β:(0,1)(0,1) with the following property: For every finite subfamily , whenever a fraction α of the s-tuples of forms a c-wise clique, a subset 𝒢 of of size β(α)|| forms a c-wise clique.

Obviously for every set system , if ch, then fh(c)=fh and ch(c)=ch. Holmsen [16, Theorem 1.2] proved that fh(c)ch(c) for every set system and every c. A close inspection of that proof provides another bridge between the graded and ungraded parameters:

Lemma 13.

Let >c be integers. Every set system such that ch(c)(c) satisfies fh(c)ch(c)(c).

Proof.

Let c<, let be a set system and let :=ch(c)(c). By definition of ch(c)(), the c-uniform hypergraph recording which c-element subsets of form cliques cannot contain a certain pattern on c vertices, namely the complete -tuples of missing edges [17, §3]. This is the only property needed to ensure that fh(c) [16, Theorem 1.2].

Let Ψrch(c)(x) denote the supremum of the cth colorful Helly number of a set system with Radon number x. Holmsen and Lee [17, Theorem 2.2] proved that Ψrch(c)(x)max(Ξ(x),c) for every cx1, where Ξ: is the function defined by Ξ(r):=rrlog2r+rlog2r. Applying this inequality to subsets of size t we get:

ch(c)(t)max(Ξ(r(t)),c) for every ,c,t such that ch(t). (5)
Proof of Theorem 7.

Let Ψ: and t0 such that Ψ(t)<t+1 for every tt0. Also suppose that there exists an integer t1t02 such that Ξ(Ψ(t1))<t1t0. We now consider a set system such that r(t)Ψ(t) for every t and argue that fh, the fractional Helly number of , is bounded.

By Levi’s inequality (4) we have h(t)r(t)1Ψ(t)1. It follows that h(t)<t for every tt0, so by Lemma 10 we have ht0. Hence, the graded version (5) of the Holmsen-Lee inequality applies with c=t0 and every t, that is ch(t0)(t)max(Ξ(Ψ(t)),t0).

Let us apply Lemma 13 with c=t0 and =t1t0. Observe that >c holds because t1>t02, and that ch(c)(c) follows from the assumption that Ξ(Ψ(t1))t1t0, as

ch(c)(c)=ch(t0)(t1)max(Ξ(Ψ(t1)),t0)t1t0=.

Hence, fh(t0)ch(t0)(t1). Since ht0 we have fh(t0)=fh and the statement follows.

References

  • [1] Noga Alon, Gil Kalai, Jirí Matoušek, and Roy Meshulam. Transversal numbers for hypergraphs arising in geometry. Advances in Applied Mathematics, 29:79–101, 2002. doi:10.1016/S0196-8858(02)00003-9.
  • [2] Sergey Avvakumov, Marguerite Bin, and Xavier Goaoc. Intersection patterns of set systems on manifolds with slowly growing homological shatter functions, 2026. arXiv:2601.02920.
  • [3] Ervin G. Bajmóczy and Imre Bárány. On a common generalization of borsuk’s and radon’s theorem. Acta Mathematica Hungarica, 34(3-4):347–350, 1979.
  • [4] Imre Bárány. Combinatorial convexity, volume 77. American Mathematical Soc., 2021.
  • [5] Imre Bárány and Pablo Soberón. Tverberg’s theorem is 50 years old: a survey. Bulletin of the American Mathematical Society, 55(4):459–492, 2018.
  • [6] Boris Bukh. Radon partitions in convexity spaces, 2010. arXiv:1009.2384.
  • [7] Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, and Shubhangi Saraf. Helly-type theorems in property testing. International Journal of Computational Geometry & Applications, 28(04):365–379, 2018. doi:10.1142/S0218195918500115.
  • [8] Jesús De Loera, Xavier Goaoc, Frédéric Meunier, and Nabil 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.
  • [9] Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková, and Martin Tancer. A direct proof of the strong hanani-tutte theorem on the projective plane. Journal of Graph Algorithms and Applications, 21(5):939–981, 2017. doi:10.7155/JGAA.00445.
  • [10] Jürgen Eckhoff. The partition conjecture. Discrete Mathematics, 221(1):61–78, 2000. doi:10.1016/S0012-365X(99)00386-6.
  • [11] Rogers Epstein and Sandeep Silwal. Property Testing of LP-Type Problems. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 98:1–98:18, 2020. doi:10.4230/LIPIcs.ICALP.2020.98.
  • [12] Radoslav Fulek and Jan Kynčl. Counterexample to an extension of the hanani-tutte theorem on the surface of genus 4. Combinatorica, 39(6):1267–1279, 2019. doi:10.1007/S00493-019-3905-7.
  • [13] Xavier Goaoc, Andreas F. Holmsen, and Zuzana Patáková. Intersection patterns in spaces with a forbidden homological minor, 2024. arXiv:2103.09286.
  • [14] Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner. Bounding Helly numbers via Betti numbers. In A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, pages 407–447. Springer, 2017.
  • [15] Eduard Helly. Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten. Monatshefte für Mathematik und Physik, 37:281–302, 1930.
  • [16] Andreas F. Holmsen. Large cliques in hypergraphs with forbidden substructures. Combinatorica, 40(4):527–537, August 2020. doi:10.1007/S00493-019-4169-Y.
  • [17] Andreas F. Holmsen and Donggyu Lee. Radon numbers and the fractional Helly theorem. Israel Journal of Mathematics, 241(1):433–447, March 2021.
  • [18] Gil Kalai. Intersection patterns of convex sets. Israel Journal of Mathematics, 48(2):161–174, 1984.
  • [19] Gil Kalai. Combinatorial expectations from commutative algebra. In I. Peeva anv V. Welker, editor, Combinatorial Commutative Algebra, volume 1(3), pages 1729–1734. Oberwolfach Reports, 2004.
  • [20] Meir Katchalski and Andy Liu. A problem of geometry in n. Proceedings of the American Mathematical Society, 75(2):284–288, 1979.
  • [21] Friedrich W. Levi. On Helly’s theorem and the axioms of convexity. Journal of the Indian Mathematical Society, 15:65–76, 1951.
  • [22] Jiři Matoušek. Lectures on discrete geometry, volume 212. Springer Science & Business Media, 2013.
  • [23] Jirí Matoušek. A Helly-type theorem for unions of convex sets. Discrete & Computational Geometry, 18:1–12, 1997. doi:10.1007/PL00009305.
  • [24] Jirí Matoušek, Micha Sharir, and Emo Welzl. A subexponential bound for linear programming. Algorithmica, 16(4-5):498–516, 1996. doi:10.1007/BF01940877.
  • [25] Jirí Matoušek. Bounded VC-dimension implies a fractional Helly theorem. Discrete & Computational Geometry, 31:251–255, 2004. doi:10.1007/S00454-003-2859-Z.
  • [26] Pavel Paták. A sharper ramsey theorem for constrained drawings. Journal of Graph Theory, 109(4):401–411, 2025.
  • [27] Pavel Paták and Martin Tancer. Embeddings of k-complexes into 2 k-manifolds. Discrete & Computational Geometry, 71(3):960–991, 2024. doi:10.1007/S00454-023-00595-W.
  • [28] Zuzana Patáková. Bounding Radon number via Betti numbers. International Mathematics Research Notices, 2024(11):9482–9500, 2024.
  • [29] Michael J Pelsmajer, Marcus Schaefer, and Despina Stasi. Strong hanani–tutte on the projective plane. SIAM Journal on Discrete Mathematics, 23(3):1317–1323, 2009. doi:10.1137/08072485X.
  • [30] Victor V. Prasolov. Elements of homology theory, volume 81. American Mathematical Society, 2007.
  • [31] Gerhard Ringel. Map color theorem, volume 209. Springer Science & Business Media, 2012.
  • [32] Colin Rourke and Brian Sanderson. Introduction to Piecewise-Linear Topology. Springer Study Edition. Springer Berlin, Heidelberg, 1972.
  • [33] Arkadiy Skopenkov. Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices, 2024. arXiv:2112.06636.
  • [34] Martin Tancer. Intersection patterns of convex sets via simplicial complexes: a survey. In Thirty essays on geometric graph theory, pages 521–540. Springer, 2012.
  • [35] Uli Wagner. Minors, embeddability, and extremal problems for hypergraphs. In Thirty Essays on Geometric Graph Theory, pages 569–607. Springer, 2012.