{"id":"de010a7c-7714-4ee3-b6dd-34d5debe0143","arxiv_id":"2412.01445","paper_version":4,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Separable convexity spaces with Radon number r have fractional Helly number at most 2^r, a bound that is polynomial-tight for box convexity in R^d.","lead":"In any separable abstract convexity space, the paper proves that the fractional Helly number is at most 2^r when the Radon number is r, generalizing Bárány and Matoušek's result for convex lattice sets. It also shows the family of solutions of bounded-degree polynomial inequalities can encode arbitrary intersection patterns, disproving a conjecture of Bárány and Kalai.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Main theorem's proof is sound; the real defect is the unsupported claim that B_2^2 is a convexity space, which invalidates the advertised Bárány–Kalai disproof as written.","rationale":"Read the proof of Theorem 5 line by line. Lemma 10's separation argument is valid: the line 'γ∉F' should be interpreted as 'the finite set Z=γ∩S cannot have large f-measure', otherwise conv(Z) would be a member of F avoiding x0. Lemma 11's use of Erdős–Simonovits on a constant fraction of edges of K_{k−1}(t) is correct because that fraction is a constant fraction of the complete (k−1)-uniform hypergraph. The final VC-dimension contradiction for γ_1,...,γ_{d+1} is sound: edges of K_{d+1}(2) give all 2^{d+1} regions nonempty. I found no flaw in the main theorem. The reader's stated weakest assumption, separability (S3), is a hypothesis of Theorem 5, not a hidden step; dropping it would change the theorem, but that is not an internal inconsistency. The genuine correctness risk is the Bárány–Kalai disproof: B_d^k is asserted to be a convexity space without proof, and it is not, because (C3) fails already for d=k=2. This does not invalidate the fractional Helly result, but it does invalidate the advertised disproof as stated. The manuscript should be accepted only after this is repaired or explicitly reformulated, which matches the reader's CONDITIONAL verdict.","tokens_in":10327,"tokens_out":19813,"duration_ms":169524,"concrete_test":"Explicitly check axiom (C3) for B_2^2. Set S_n = {(1,0),(2,0),...,(n,0)}. For each n, the degree-2 system {1≤x≤n} ∪ {0≤y≤(x−i)(x−i−1): i=1,...,n−1} has S_n as its exact solution set, so S_n∈B_2^2. The family {S_n} is nested, but its union N×{0} has infinitely many connected components, whereas every set defined by finitely many degree-≤2 polynomial inequalities is semialgebraic and therefore has finitely many connected components. Hence the union is not in B_2^2, and (C3) fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 1.8 asserts that B_d^k is a separable convexity space, and Proposition 7 is then used to disprove Bárány–Kalai. This is the load-bearing gap. The family of solution sets of finitely many degree-≤k polynomial inequalities is not closed under nested unions, axiom (C3). For d=k=2, Proposition 7's own construction realizes every finite subset of the x-axis as an element of B_2^2: {a_1≤x≤a_n} together with {0≤y≤(x−a_i)(x−a_{i+1})} has exactly the points (a_i,0) as solutions. Therefore the sets S_n={(1,0),...,(n,0)} all lie in B_2^2 and form a chain under inclusion. Their union N×{0} is not a finite-degree basic semialgebraic set, since it has infinitely many connected components while every finite system of polynomial inequalities has finitely many components. Thus B_2^2 violates (C3), so it is not a convexity space, and the claimed disproof of Conjecture 2.9 does not follow from Proposition 7 as stated. The authors need either to prove a convexity-space analogue or to rephrase the disproof for the set system directly.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that in a separable convexity space with bounded Radon number, if the dual VC-dimension of the halfspace system is d, then the fractional Helly number of the convexity space is at most d+1. As a corollary, the fractional Helly number is at most 2^r when the Radon number is r. This generalizes the Bárány–Matoušek theorem for convex lattice sets. The paper also claims to disprove a conjecture of Bárány and Kalai by showing that the set system of solutions of bounded-degree polynomial inequalities is universal.","tokens_in":10592,"tokens_out":19283,"duration_ms":161724,"significance":"The main theorem is a significant and clean generalization of the Bárány–Matoušek result, with a self-contained proof of the key colorful Helly proposition. The 2^r bound is near-optimal, as illustrated by box convexity. The proof uses Holmsen–Lee only as an independent, weaker result, and it contains no circularity or fitted parameters. However, the supplementary disproof of the Bárány–Kalai conjecture is compromised by an error in the claim that B_d^k is a convexity space.","major_comments":[{"comment":"The claim that B_d^k is a separable convexity space is false because the family of solution sets of finitely many degree-≤k polynomial inequalities is not closed under nested unions, violating axiom (C3). For d=k=2, the construction inside Proposition 7 realizes every finite subset of the x-axis as an element of B_2^2: for any a_1 < ... < a_{n+1}, the system {a_1 ≤ x ≤ a_{n+1}} ∪ {0 ≤ y ≤ (x−a_i)(x−a_{i+1})}_{i=1}^n has exactly the points (a_i,0) as its solution set. Hence the sets S_n = {(1,0),...,(n,0)} all lie in B_2^2 and form a chain under inclusion. Their union N×{0} is not a solution set of a finite polynomial system, since every finite semialgebraic set has finitely many connected components while N×{0} has infinitely many. Thus B_2^2 violates (C3). Consequently, the Radon, Helly, and fractional Helly numbers of B_2^2 are not defined, and the claimed disproof of Conjecture 2.9 does not follow from Proposition 7 as stated. The authors should either construct a genuine convexity space that still has the universality property, or rephrase the disproof directly for the set system of polynomial solution sets, which does not require the convexity-space axioms.","section":"1.8, Proposition 7"}],"minor_comments":[{"comment":"The sentence 'this can be repeated another d times' is too terse. The authors should explain how the already-fixed 2-element vertex classes are used when Lemma 11 is applied to the remaining classes, and why the separability of a fixed pair is preserved when the other classes are later shrunk.","section":"4, proof of Proposition 8"},{"comment":"The notation '⋂s i=1' in the hypothesis should read '⋂_{i=1}^{d+1}'.","section":"Statement of Proposition 8"},{"comment":"There is a typo: 'there will exists s-element subsets' should be 'there will exist s-element subsets'.","section":"Proof of Lemma 11"},{"comment":"The phrase 'B_d^k is in a sense \"universal\"' could be clarified: Proposition 7 demonstrates universality for intersection patterns of set systems, not for all convexity-theoretic notions.","section":"1.8"},{"comment":"The definition of the fractional Helly property uses 'the fractional Helly number for C'; for consistency with the rest of the paper, consider using 'of C'.","section":"1.2"}],"recommendation":"major_revision","confidential_remarks":"The main theorem is solid and publishable. The flaw in the Bárány–Kalai disproof is significant but likely fixable: the authors could either work with the convexity closure of B_d^k or state the disproof for the set system directly. The 'repeated d times' step in Proposition 8 also deserves a fuller justification. I recommend major revision rather than rejection, since the central contribution of the paper is the fractional Helly bound for separable convexity spaces."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the main theorem is real. For a separable convexity space with Radon number r and halfspace dual VC-dimension d, the fractional Helly number is at most d+1, and the corollary bound 2^r is a sharp improvement over the huge Holmsen–Lee bound. It unifies the Euclidean, lattice, and box cases, and the proof is coherent: Lemma 10's separation argument is clean, Lemma 11 is a natural extension of Bárány–Matoušek, and the final VC-dimension step is standard. This deserves serious referee time.\n\nWhere it gets soft is the claimed disproof of Bárány–Kalai's Conjecture 2.9. Section 1.8 asserts that B_d^k, the family of solution sets of finitely many polynomial inequalities of degree at most k, is a separable convexity space. That is not right: the family is not closed under nested unions (C3). The stress-test example is correct: the construction in Proposition 7 realizes every finite subset of the x-axis as an element of B_2^2, but the union of the chain S_n = {(1,0),...,(n,0)} is N×{0}, which is not a basic semialgebraic set of bounded degree—infinite connected components vs. finitely many for any finite polynomial system. So B_2^2 violates C3, and the disproof as written does not go through. The authors could either prove a genuine convexity-space analogue or restate the disproof directly for the set system, which remains interesting. This is a real gap, but it is in a side claim; nothing in Theorem 5 or Corollary 6 depends on it.\n\nThe proof of Proposition 8 is terse at the “repeated d times” step—the induction on vertex classes deserves one more sentence—but that is minor. The citation pattern is fine: Theorem 3 (Holmsen–Lee) is an independently published weaker theorem, and using it to finish the counting is not circular.\n\nSo: trust the main theorem. The Bárány–Kalai disproof needs repair, but the rest is a solid contribution. I would send it to a good combinatorics referee; the authors should fix the B_2^2 claim before final publication, but the central result is worth engaging with now.","headline":"Main theorem is solid and worth citing; the Bárány–Kalai disproof has a gap (B_2^2 is not a convexity space), but that is a side result and the central argument holds up.","tokens_in":11138,"tokens_out":3782,"would_cite":true,"duration_ms":29643,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52A35","52A01"],"pacs":[],"model":"deepseek-v4-flash","headline":"The fractional Helly number of a separable convexity space is bounded by the dual VC-dimension of its halfspaces plus one.","keywords":["fractional Helly number","convexity spaces","Radon number","dual VC-dimension","halfspaces","separable convexity","convex lattice sets","box convexity"],"falsifier":"A single example would refute the main theorem: a separable convexity space with Radon number at most $r$ whose fractional Helly number exceeds $2^r$, or with halfspaces of dual VC-dimension $d$ whose fractional Helly number is $d+2$. A more accessible check is the box-convexity example itself, which the paper claims has fractional Helly number exactly $d+1$; constructing a family of axis-parallel boxes with an $\\alpha$-fraction of intersecting $d$-tuples but no large intersecting subfamily for $\\alpha$ arbitrarily close to $1$ would falsify that example's tightness.","tokens_in":10126,"feed_emoji":"📐","tokens_out":8986,"duration_ms":65810,"temperature":0.7,"pith_summary":"Separable convexity spaces are abstract set systems with a notion of convex set that satisfies closure axioms and a separation axiom: any convex set and an exterior point can be separated by a halfspace, where a halfspace is a convex set whose complement is also convex. This paper proves that if the halfspaces of such a space have dual VC-dimension $d$, then the fractional Helly number of the whole family of convex sets is at most $d+1$. Consequently, in any separable convexity space with Radon number at most $r$, the fractional Helly number is at most $2^r$. This recovers the Bárány–Matoušek theorem for convex lattice sets in $\\mathbb{Z}^d$, and the bound is asymptotically tight, as shown by box convexity in $\\mathbb{R}^d$. The same framework also disproves a conjecture of Bárány and Kalai about fractional Helly properties for solutions of bounded-degree polynomial inequalities.","feed_headline":"Fractional Helly number capped at 2^r for separable convexity","feed_subtitle":"Theorem 5 ties the bound to the dual VC-dimension of halfspaces, recovering the Bárány–Matoušek lattice theorem.","key_machinery":"The load-bearing object is Proposition 8, a weak colorful Helly theorem for separable convexity spaces with bounded Radon number. It says that if $d+1$ families of convex sets, each of size $p$, have the property that every transversal choice of one set from each family has nonempty intersection, then one of the families contains $m$ members with nonempty intersection. The proof of Proposition 8 relies on Lemma 10, which uses the separability axiom to produce a halfspace separating one convex set from an exterior point, and Lemma 11, which applies the Radon bound and the Erdős–Simonovits supersaturation theorem to find enough separable vertices. The argument concludes by forcing $d+1$ halfspaces to realize a complete Venn diagram, contradicting the assumption that the dual VC-dimension is at most $d$.","core_discovery":"The central claim is Theorem 5: for a separable convexity space $(X,\\mathcal{C})$ with bounded Radon number, if the system of halfspaces has dual VC-dimension $d$, then the fractional Helly number for $\\mathcal{C}$ is at most $d+1$. Corollary 6 then yields the exponential bound $2^r$ in terms of the Radon number $r$. The paper shows the exponential bound cannot be improved asymptotically: for box convexity on $\\mathbb{R}^d$, the Radon number is $\\Theta(\\log d)$ and the fractional Helly number equals $d+1$. It also proves that the convexity space $B^2_2$ of solutions of polynomial inequalities of degree at most two in $\\mathbb{R}^2$ is universal for intersection patterns, making its Helly, Radon, and fractional Helly numbers all unbounded, which disproves Conjecture 2.9 of Bárány and Kalai.","pith_inferences":["Since the dual VC-dimension is used only in the final step of the proof, one might expect the same bound $d+1$ to hold for any separable convexity space whose halfspaces cannot shatter $d+1$ sets in the dual sense, even if the halfspace system is not literally a set system of bounded dual VC-dimension.","The proof suggests that separability, rather than any metric or lattice structure, is the property that lets local Radon bounds become global fractional Helly bounds; testing weaker separation axioms (for example, separation only for finite convex sets) would delineate the exact boundary.","The universality of $B^2_2$ implies that any convexity space that contains $B^2_2$ as a subspace should also have unbounded Helly parameters; this may guide searches for other 'wild' convexity spaces.","A direct consequence one can test: in any separable convexity space with Radon number $r$, the fractional Helly number should be exactly $d+1$ for the minimal dual VC-dimension $d$ of its halfspaces; verifying this for concrete spaces like box convexity in higher dimensions would confirm the tightness beyond the asymptotic statement."],"forward_implications":["The fractional Helly number of convex lattice sets in $\\mathbb{Z}^d$ is $d+1$, recovering the Bárány–Matoušek theorem as a special case of Theorem 5.","In every separable convexity space with Radon number at most $r$, the fractional Helly number is at most $2^r$, and box convexity shows that this exponential dependence is asymptotically unavoidable.","The Bárány–Kalai conjecture on fractional Helly properties for bounded-degree polynomial inequalities is false: already in $B^2_2$ the Helly, Radon, and fractional Helly numbers are all unbounded.","If a separable convexity space has halfspaces with VC-dimension at most $d$, then the fractional Helly number is bounded by a function of $d$, giving an affirmative answer to a problem of Bárány and Kalai once the bounded-Radon assumption is added."],"supporting_citations":[{"why":"The Bárány–Matoušek theorem for convex lattice sets that this paper generalizes; supplies the colorful Helly method (their Proposition 3.1) and the lemmas extended here.","marker":"[6]"},{"why":"Holmsen–Lee provides the existence of the fractional Helly property for bounded Radon number, giving the value m used in the counting argument.","marker":"[12]"},{"why":"Matoušek proves that bounded dual VC-dimension implies fractional Helly for a set system; this is the benchmark Theorem 4.","marker":"[18]"},{"why":"Erdős–Simonovits supersaturation theorem is used in the proof of Theorem 5 and Lemma 11 to find many copies of a complete multipartite hypergraph.","marker":"[10]"},{"why":"Levi's theorem that bounded Radon number implies bounded Helly number is used in Lemma 10 to find a common point of a family of convex hulls.","marker":"[15]"},{"why":"Moran–Yehudayoff bounds the VC-dimension of halfspaces by the Radon number minus one, which is the key input for Corollary 6.","marker":"[19]"},{"why":"Onn's bound on the Radon number of convex lattice sets shows that Theorem 5 applies in that concrete setting.","marker":"[20]"},{"why":"Bárány–Kalai is the source of the conjecture and problem that the paper addresses; it defines the spaces B^d_k of polynomial-inequality solutions.","marker":"[5]"}],"fun_headline_variants":["2^r fractional Helly bound for separable convexity spaces","Dual VC dimension caps fractional Helly number","Separable convexity: fractional Helly ≤ 2^Radon","Bárány–Matousek generalized via dual VC dimension","Conjecture Bárány–Kalai false: universal patterns"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument assumes the separability axiom S3, which guarantees that any convex set and any point outside it can be separated by a halfspace; if this axiom fails, the proof has no way to produce the separating halfspace that the argument needs.","fun_headline_variants_meta":{"raw":{"variants":["2^r fractional Helly bound for separable convexity spaces","Dual VC dimension caps fractional Helly number","Separable convexity: fractional Helly ≤ 2^Radon","Bárány–Matousek generalized via dual VC dimension","Conjecture Bárány–Kalai false: universal patterns"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001324,"raw_usage":{"total_tokens":5401,"prompt_tokens":972,"completion_tokens":4429,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":588,"completion_tokens_details":{"reasoning_tokens":4343}},"tokens_in":588,"tokens_out":4429,"duration_ms":29918,"temperature":1.0,"reasoning_tokens":4343,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T04:24:04.108343+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A single example would refute the main theorem: a separable convexity space with Radon number at most $r$ whose fractional Helly number exceeds $2^r$, or with halfspaces of dual VC-dimension $d$ whose fractional Helly number is $d+2$. A more accessible check is the box-convexity example itself, which the paper claims has fractional Helly number exactly $d+1$; constructing a family of axis-parallel boxes with an $\\alpha$-fraction of intersecting $d$-tuples but no large intersecting subfamily for $\\alpha$ arbitrarily close to $1$ would falsify that example's tightness.","supporting_citations":[{"cited_title":"Bárány and J","cited_arxiv_id":null,"evidence_quote":"The Bárány–Matoušek theorem for convex lattice sets that this paper generalizes; supplies the colorful Helly method (their Proposition 3.1) and the lemmas extended here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Holmsen–Lee provides the existence of the fractional Helly property for bounded Radon number, giving the value m used in the counting argument."},{"cited_title":"Matoušek","cited_arxiv_id":null,"evidence_quote":"Matoušek proves that bounded dual VC-dimension implies fractional Helly for a set system; this is the benchmark Theorem 4."},{"cited_title":"Erd˝os and M","cited_arxiv_id":null,"evidence_quote":"Erdős–Simonovits supersaturation theorem is used in the proof of Theorem 5 and Lemma 11 to find many copies of a complete multipartite hypergraph."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Levi's theorem that bounded Radon number implies bounded Helly number is used in Lemma 10 to find a common point of a family of convex hulls."},{"cited_title":"Moran and A","cited_arxiv_id":null,"evidence_quote":"Moran–Yehudayoff bounds the VC-dimension of halfspaces by the Radon number minus one, which is the key input for Corollary 6."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Onn's bound on the Radon number of convex lattice sets shows that Theorem 5 applies in that concrete setting."},{"cited_title":"Bárány and G","cited_arxiv_id":null,"evidence_quote":"Bárány–Kalai is the source of the conjecture and problem that the paper addresses; it defines the spaces B^d_k of polynomial-inequality solutions."}],"review_version":1}