Pith. sign in

REVIEW 1 major objections 8 minor 11 references

Nerve-type and invariance theorems for asymptotic dimension

T0 review · 1 major / 8 minor · reviewed 2026-07-31 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Intersection graphs of space-filling families in spaces of Assouad-Nagata dimension n have asymptotic dimension at most n+1.

desk verdict Clean improvement of the Dvořák–Norin bound from 2n+1 to the optimal n+1 for space-filling families, plus a useful boundary-invariance theorem that pins spheres to n or n+1. read the letter →

arxiv 2607.24146 v1 pith:BVE3BC6K submitted 2026-07-27 math.CO cs.DMmath.GTmath.MG

Chun-Hung Liu , Sergey Norin This is my paper · ORCID
classification math.COcs.DMmath.GTmath.MG MSC 05C1205C6251F3054F45
keywords asymptoticdimensionAssouad-Nagataintersectiongraphsspace-fillingfamiliesnervetheoremsphereweakdiametercoloringtree-decomposition
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves a nerve-type theorem for asymptotic dimension: if a family of sets packs reasonably inside a metric space of Assouad-Nagata dimension n, then the graph that records pairwise intersections has asymptotic dimension at most n+1. The packing rule is simple—every ball of radius r meets at most f(r/s) pairwise-disjoint members of diameter at least s—and is both necessary and sufficient for the bound. The result is sharp: a discrete construction inside the Euclidean simplex forces asymptotic dimension at least n+1, and it immediately caps the asymptotic dimension of ball graphs and of intersection graphs of compact convex sets of bounded aspect ratio in R^n by n+1. A second invariance theorem shows that, under mild connectivity and non-covering hypotheses, replacing each set by its boundary (or by a closed connected augmentation) changes the intersection asymptotic dimension by at most one; consequently sphere graphs in R^n also sit between n and n+1. Together the theorems let one read the large-scale dimension of geometric intersection graphs directly from the ambient geometry.

What carries the argument

The f-space-filling packing condition, which limits how many large pairwise-disjoint members can meet any ball. Combined with Assouad-Nagata control functions it produces (k,R)-centered tree-decompositions of the metric space of sets; those decompositions yield controlled weak-diameter colorings of graph powers and therefore bound asymptotic dimension.

What would settle it

Produce an f-space-filling family inside a space of Assouad-Nagata dimension n whose finite intersection graphs have unbounded weak-diameter monochromatic components under every (n+2)-coloring of every power; the paper’s own discrete-simplex construction already realizes the matching lower bound of n+1.

Watch

Extended reading notes

Core claim

If F is an f-space-filling family of subsets of a metric space of Assouad-Nagata dimension at most n, then every intersection graph of a subfamily of F has asymptotic dimension at most n+1. The bound is quantitatively tight by an explicit space-filling construction in R^n that forces asymptotic dimension at least n+1. Under mild connectivity assumptions, the intersection asymptotic dimension of a family of closed connected sets equals that of their boundaries up to a possible additive 1.

Load-bearing premise

The family must obey a uniform packing bound: no ball may meet too many large pairwise-disjoint members; without it, thin long boxes already realize intersection graphs of infinite asymptotic dimension.

Editorial extensions

If this is right

  • Intersection graphs of closed balls in R^n have asymptotic dimension between n and n+1.
  • The same upper bound holds for any family of compact convex sets of bounded aspect ratio in R^n.
  • Intersection graphs of spheres (or of connected sets obtained by removing interior points from balls) in R^n have asymptotic dimension n or n+1 for n≥2.
  • Assouad-Nagata dimension, not ordinary asymptotic dimension, is the scale-invariant ambient invariant that controls the intersection graphs.
  • Replacing sets by closed connected augmentations or by their boundaries changes intersection asymptotic dimension by at most 1.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same packing-plus-Assouad-Nagata template should bound asymptotic dimension for other roundish families (bounded-eccentricity ellipsoids, geodesic balls in manifolds of bounded geometry).
  • The invariance theorem implies that many hollow geometric classes—sphere graphs, annulus graphs—inherit their large-scale dimension from the solid bodies they bound.
  • A natural sharpening left open is whether the upper bound drops from n+1 to n for balls or spheres, matching a conjecture mentioned for sphere graphs.
  • The tree-decomposition and weak-diameter-coloring machinery developed for the metric of sets can be reused for other nerve-type questions in coarse geometry.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 8 minor

Summary. The paper proves two main results about asymptotic dimension of intersection graphs. First (Theorem 1.3/6.4): for any f-space-filling family F of subsets of a metric space of Assouad–Nagata dimension at most n, the class of intersection graphs of subfamilies of F has asymptotic dimension at most n+1, improving the 2n+1 bound of Dvořák–Norin [7]; the bound is shown quantitatively tight (Theorem 1.4) by an explicit construction of space-filling families in the n-simplex whose intersection graphs force monochromatic components of arbitrarily large weak diameter under any (n+1)-coloring, via a discrete application of the KKM theorem. Qualitative optimality (necessity of the space-filling and Assouad–Nagata hypotheses, and that n+1 cannot be replaced by bounded Assouad–Nagata dimension) is also argued. Corollaries include asdim of ball intersection graphs in R^n lying in {n, n+1} (Theorem 1.2) and a bound for compact convex sets of bounded aspect ratio (Corollary 1.6). Second (Theorem 1.7/1.9): under mild non-covering and connectivity hypotheses, passing from a family of closed connected sets to the family of their boundaries does not change the intersection asymptotic dimension (up to the max{·,1} correction), yielding n ≤ asdim(sphere intersection graphs in R^n) ≤ n+1 for n ≥ 2 (Corollary 1.8). The proofs proceed through a reduction to finite graphs (Theorem 2.2), weak-diameter coloring characterizations (Lemma 2.4), an inductive extension argument for augmentation families (§3–

Significance. If correct, this is a strong and definitive contribution: it determines the optimal asymptotic-dimension bound (n+1) for intersection graphs of space-filling families, settling quantitatively a line of work initiated by Dvořák–Norin [7] and improving their 2n+1 to the exact n+1 with a matching lower bound. Theorem 1.4 is genuinely parameter-free in the relevant sense — no fitted constants, an explicit self-contained construction in the simplex, and a classical topological fixed-point ingredient — and the qualitative optimality discussion (thin long boxes realizing expanders; ambient asdim 0 in the lower-bound construction; infinite Assouad–Nagata dimension of ball intersection graphs) demonstrates the hypotheses are necessary, not an artifact of the proof. Corollary 1.8 improves the concurrent 2n+2 bound of Davies–Georgakopoulos–Hatzel–McCarty [5] on Georgakopoulos's sphere question, and the invariance theorem (1.7/1.9) is a clean, natural statement of independent interest with a sharp max{·,1} correction term illustrated by an explicit example. The technical development in §5 (controlled colorings pulled back along (α,β,r)-constrained maps, extension lemmas 5.8–5.10, and the induc

major comments (1)
  1. [§7, Theorem 7.1] Theorem 7.1 is the sole external ingredient in the proof of the tightness theorem (Theorem 1.4, via Lemma 7.4), but it is stated in a 'dual' form that does not match the classical KKM theorem proved in the cited reference [9] (Knaster–Kuratowski–Mazurkiewicz 1929). The classical statement asserts non-empty total intersection for covers respecting the face structure; the statement used here — a closed cover of the (n+1)-simplex with no (n+2)-fold point has some member meeting every facet — is a known equivalent (essentially the Lebesgue covering dimension of the simplex, or the KKM theorem applied to a suitable barycentric refinement / nerve map), but the implication is not immediate and is load-bearing for the optimality claim of the whole paper. Please supply a short derivation of Theorem 7.1 from the standard KKM theorem (or Sperner's lemma), or a precise citation where this exact form
minor comments (8)
  1. [References] Reference [6] (Dranishnikov–Smith, On asymptotic Assouad–Nagata dimension) appears in the bibliography but is never cited in the text; either cite it where relevant (e.g., the discussion of Assouad–Nagata vs asymptotic dimension in §1) or remove it.
  2. [§1, footnote 2] Footnote 2 states 'All graphs are finite and simple in this paper unless otherwise specified', but infinite intersection graphs are central to the paper (int-asdim is defined via possibly infinite subfamilies, and Theorem 2.2/Lemma 2.3 exist precisely to handle them). Consider rewording to avoid confusion on first reading.
  3. [§1, §6] Hyphenation of 'f-space-filling' is inconsistent: 'f-space filling' (without the second hyphen) appears in the statements of Theorem 1.4, Lemma 6.3, and Theorem 6.4.
  4. [§2, Lemma 2.4; §6, proof of Theorem 6.4] Lemma 2.4 is quoted with weak diameter measured 'in G^ℓ', while the cited [3, Proposition 1.17] and the applications later in the paper (e.g., the proof of Theorem 6.4, 'weak diameter in I(S) (and hence in (I(S))^r)') move between weak diameter in G and in G^ℓ. A sentence stating the convention and the inequality dist_{G^ℓ} ≤ dist_G that justifies the parenthetical 'and hence' would make §2 and §6 easier to audit.
  5. [§7, Lemmas 7.2–7.3] In Lemma 7.2(1), the n=1 case is dismissed as 'easy to verify'; since the inductive midpoint argument given for n>1 is the only hint, one line for n=1 (or a uniform argument) would be helpful. Similarly, in Lemma 7.3 the implication 'maximality of i0 gives 2^{i0+1} ≤ 8√n/s' is the key arithmetic step and could be made explicit.
  6. [§6, Lemma 6.2] Lemma 6.2's statement promises a (k,2)-centered tree-decomposition while the proof establishes the stronger (k,1)-centered property via [7, Lemma 8]. Since Claim 1 of Lemma 6.3 only uses the (k,2) version (inflated to (k,4b+2) after pullback), this is harmless, but stating the stronger conclusion would slightly simplify the audit of the constants in §6.
  7. [§1.2] In the discussion after Theorem 1.7, the example showing max{int-asdim(F),1} ≠ int-asdim(F) uses the family of tangent circles C_i; a one-line verification that the corresponding disks pairwise intersect (e.g., they are nested/concentric in pairs) would save the reader a computation.
  8. [§1.1, §7] It may be worth one remark in §7 or the introduction on whether the present framework offers any route toward closing the residual gap between n and n+1 for balls (Question 1.1) and toward the conjecture asdim = n of [5] for spheres — e.g., whether the obstruction is in the n+2-coloring step of Lemma 5.11 or is intrinsic. This is purely a suggestion for context, not a requirement.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: pure existence proofs with independent lower-bound construction; self-citations supply standard tools only.

full rationale

This is a self-contained pure-mathematics paper in asymptotic dimension theory. The central upper bound (Theorem 1.3/6.4) is derived by reducing space-filling families to controlled colorings via tree-decompositions and weak-diameter arguments (Sections 5–6), using external or prior lemmas (Dvořák–Norin webs, Liu coloring results) only as black-box tools whose hypotheses match the paper’s assumptions; none of those lemmas assumes the target asdim ≤ n+1 bound. The matching lower bound (Theorem 1.4) is an independent geometric construction on a discrete simplex, verified via the classical KKM theorem, not by fitting or by re-using the upper-bound machinery. The invariance theorem (1.7/1.9) likewise proceeds by direct combinatorial arguments on augmentations and monochromatic components. There is no parameter fitting, no self-definitional loop, and no load-bearing uniqueness claim imported solely from the authors’ prior work. Self-citations appear only for reusable technical lemmas and do not force the main conclusions. Score 0 is therefore appropriate.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

Pure existence/upper-bound mathematics. No empirical fits. Background rests on standard definitions of asymptotic and Assouad-Nagata dimension, ordinary graph-theoretic tree-width/tree-decomposition, and classical topological facts (connectedness, KKM). The paper introduces the space-filling packing condition and the notion of closed augmentation families as working hypotheses; both are definitional rather than ontological inventions.

assumptions (4)
  • domain assumption Assouad-Nagata dimension of the ambient metric space is at most n (equivalently, a dilation is an n-dimensional control function).
    Hypothesis of Theorem 1.3; without it the packing-to-asdim transfer fails, as the paper notes that asymptotic dimension alone is insufficient.
  • domain assumption Space-filling: every ball of radius r meets at most f(r/s) pairwise-disjoint members of diameter ≥ s.
    Central packing hypothesis of Theorem 1.3; shown necessary by the thin-box expander example.
  • domain assumption Ambient topological space T is connected; members and their boundaries (or augmentations) are non-empty and connected; no finite subfamily of closed augmentations covers T.
    Hypotheses of Theorems 1.7/1.9 needed for the boundary-invariance statements and for Lemma 2.1 on augmentations.
  • standard math Standard facts: Gromov asymptotic dimension, control-function characterizations, weak-diameter coloring equivalence (Bonamy et al.), KKM theorem, tree-width coloring lemmas from prior work of the authors and others.
    Cited background used as black boxes; none encodes the target n+1 bound.
invented entities (2)
  • f-space-filling family independent evidence
    purpose: Packing condition that makes the nerve-type bound hold and excludes thin expanders.
    Definitional hypothesis introduced to state Theorem 1.3 cleanly; equivalent formulations already implicit in earlier volume arguments for balls.
  • Closed augmentation family / augmentation of a set independent evidence
    purpose: Technical device relating a family to a family of closed supersets with controlled boundaries, enabling the invariance theorem.
    Definitional; used only inside the proofs of Theorems 1.7–1.9.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Nerve-type and invariance theorems for asymptotic dimension." pith.science (2026). https://pith.science/paper/BVE3BC6K

@misc{pith2026260724146,
  author       = {Pith},
  title        = {Pith review of: Nerve-type and invariance theorems for asymptotic dimension},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BVE3BC6K}},
  note         = {Machine review of arXiv:2607.24146}
}
abstract

Asymptotic dimension of metric spaces is a large-scale analog of covering dimension of topological spaces. An intersection graph of a family of sets is the graph whose vertices are the members of the family and whose edges correspond to pairs of members with non-empty intersection. Our first main result connects the asymptotic dimension of the intersection graph of a family ${\mathcal F}$ and the Assouad-Nagata dimension of the ambient metric space containing members of ${\mathcal F}$ under some mild and necessary assumptions. We prove that if ${\mathcal F}$ is a family of subsets of a metric space of Assouad-Nagata dimension $n$ such that every ball of radius $r$ intersects at most $f(r/s)$ pairwise disjoint members of ${\mathcal F}$ of diameter at least $s$ for some function $f$, then the asymptotic dimension of the intersection graph of ${\mathcal F}$ is at most $n+1$. This result is optimal both quantitatively and qualitatively in several senses. As a corollary of this result, the asymptotic dimension of the intersection graph of any family of compact convex sets of bounded aspect ratio in ${\mathbb R}^n$, such as a family of balls in ${\mathbb R}^n$, is at most $n+1$. Our second main result states that the asymptotic dimension of the intersection graph of a family ${\mathcal F}$ of connected closed sets of a connected topological space with connected boundary equals the asymptotic dimension of the intersection graph of the family of the boundary of the sets in ${\mathcal F}$, under a mild condition. In particular, the asymptotic dimension of the intersection graphs of families of spheres in ${\mathbb R}^n$ equals $n$ or $n+1$ when $n \geq 2$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references

  1. [7]

    Dvoˇ r´ ak and S

    Z. Dvoˇ r´ ak and S. Norin,Asymptotic dimension of intersection graphs , European J. Combin. 123 (2025), 103631

    2025

  2. [5]

    Davies, A

    J. Davies, A. Georgakopoulos, M. Hatzel, and R. McCarty, Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs , in: 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceed- ings in Informatics (LIPIcs), Vol. 332, pp. 36:1-36:16, Schloss Dagstuhl–Leibniz-Zentrum f¨ ur Inform...

    2025

  3. [9]

    Knaster, K

    B. Knaster, K. Kuratowski and S. Mazurkiewicz, Ein beweis des fixpunktsatzes f¨ ur n- dimensionale simplexe , Fundamenta Mathematicae 14 (1929), 132–137

    1929

  4. [1]

    Adiga, D

    A. Adiga, D. Bhowmick and L. S. Chandran, Boxicity and poset dimension , SIAM J. Discrete Math. 25 (2011), 1687–1698

    2011

  5. [2]

    Bell and A

    G. Bell and A. Dranishnikov, Asymptotic dimension, Topology Appl. 155 (2008), 1265– 1296

    2008

  6. [3]

    Bonamy, N

    M. Bonamy, N. Bousquet, L. Esperet, C. Groenland, C.-H. Liu, F. Pirot and A. Scott, Asymptotic dimension of minor-closed families and Assouad–Nagata dimension of sur- faces, J. Eur. Math. Soc. 26 (2024), 3739–3791. 25

    2024

  7. [4]

    Crouch and C.-H

    J. Crouch and C.-H. Liu, Weak diameter choosability of graphs with an excluded minor , J. Combin. Theory Ser. B 174 (2025), 28–70

    2025

  8. [6]

    Dranishnikov and J

    A.N. Dranishnikov and J. Smith, On asymptotic Assouad–Nagata dimension , Topology Appl. 154 (2007), 934–952

    2007

Show all 11 references
  1. [8]

    Gromov, Asymptotic invariants of infinite groups , in: Geometric group theory, Vol

    M. Gromov, Asymptotic invariants of infinite groups , in: Geometric group theory, Vol. 2 (Sussex, 1991), London Math. Soc. Lecture Note Ser. 182, Cambridge Univ. Press, Cambridge, 1–295 (1993)

    1991

  2. [10]

    Lang and T

    U. Lang and T. Schlichenmaier, Nagata dimension, quasisymmetric embeddings, and Lipschitz extensions , Int. Math. Res. Not. 2005 (2005), 3625–3655

    2005

  3. [11]

    Liu, Assouad-Nagata dimension of minor-closed metrics , Proc

    C.-H. Liu, Assouad-Nagata dimension of minor-closed metrics , Proc. London Math. Soc. 130 (2025), e70032. 26

    2025

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.