Asymptotic-Type Dimension Bounds through Combinatorial Approaches
Pith reviewed 2026-05-23 17:10 UTC · model grok-4.3
The pith
Volume-doubling metric measure spaces satisfy asdim_AN(X) ≤ dim_AN(X) ≤ floor(log₂ C_D).
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For any metric measure space with volume doubling constant C_D the authors prove asdim_AN(X) ≤ dim_AN(X) ≤ floor(log₂ C_D). When the space is a complete Riemannian n-manifold with Ric_g ≥ 0 this specializes to asdim(M) ≤ n. When the space is proper, volume-noncollapsed and has polynomial volume growth rate ρ^V(X), they obtain asdim(X) ≤ floor(ρ^V(X)) with a polynomially growing control function.
What carries the argument
Probabilistic framework of padded decompositions combined with randomized ball carving on net graphs and the Lovász Local Lemma, which extracts the dimension bound directly from the volume-doubling hypothesis.
If this is right
- Complete Riemannian n-manifolds with nonnegative Ricci curvature satisfy asdim(M) ≤ n.
- Proper volume-noncollapsed spaces with polynomial volume growth satisfy asdim(X) ≤ floor(ρ^V(X)) with polynomial control function.
- Equality cases in the polynomial-growth bound hold for universal covers of nilmanifolds.
- Under nonnegative Ricci curvature, equality in the volume-doubling bound implies Gromov largeness and yields a consequence for complete manifolds with positive scalar curvature.
Where Pith is reading between the lines
- The same probabilistic construction may produce dimension bounds under weaker or different measure-theoretic hypotheses than volume doubling.
- The polynomial control function obtained for spaces of polynomial growth could be used to study coarse embeddings into Hilbert space or other target spaces.
- The method supplies a uniform way to compare asymptotic dimension with other large-scale invariants that are already known to be controlled by volume growth.
Load-bearing premise
The volume-doubling condition alone is enough for the padded-decomposition and randomized-carving arguments to produce the stated dimension bounds.
What would settle it
A single metric measure space whose volume doubling constant is C_D yet whose asymptotic dimension exceeds floor(log₂ C_D) would falsify the main inequality.
read the original abstract
We develop a probabilistic framework for large-scale dimension bounds in metric geometry, based on padded decompositions, randomized ball carving on net graphs, and the Lov\'asz Local Lemma. For metric measure spaces with volume doubling constant $C_{\mathsf D}$, we prove the sharp bound $\mathrm{asdim}_{AN}(X)\le \mathrm{dim}_{AN}(X)\le \lfloor{\log_2 C_{\mathsf D}}\rfloor$. In particular, if $(M,g)$ is a complete Riemannian $n$-manifold with $\mathrm{Ric}_g\ge 0$, then $\mathrm{asdim}(M)\le n$, thereby settling a question of Papasoglu on manifolds with nonnegative Ricci curvature. We also show that if $(X,\mathsf{d},\mathfrak{m})$ is proper, volume noncollapsed, and has polynomial volume growth rate $\rho^V(X)$, then $\mathrm{asdim}(X)\le \lfloor{\rho^V(X)}\rfloor$. Moreover, the corresponding control function can be chosen to have polynomial growth. This extends Papasoglu's sharp asymptotic-dimension bound from graphs of polynomial growth to a metric-measure setting. As applications, we study equality in the polynomial-growth bound for universal covers of nilmanifolds, and under nonnegative Ricci curvature we relate the equality case in the volume-doubling bound to Gromov largeness, obtaining in particular a consequence for complete manifolds with positive scalar curvature.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a probabilistic framework using padded decompositions, randomized ball carving on net graphs, and the Lovász Local Lemma to obtain large-scale dimension bounds in metric geometry. For metric measure spaces with volume-doubling constant C_D it proves the sharp inequality asdim_AN(X) ≤ dim_AN(X) ≤ ⌊log₂ C_D⌋; as a corollary, complete Riemannian n-manifolds with Ric_g ≥ 0 satisfy asdim(M) ≤ n, answering Papasoglu’s question. Under the additional hypotheses of properness and volume non-collapsing, the same method yields asdim(X) ≤ ⌊ρ^V(X)⌋ with a polynomially growing control function for spaces of polynomial volume growth, extending Papasoglu’s graph result to the metric-measure setting. Applications to equality cases on nilmanifold covers and to Gromov largeness under nonnegative Ricci curvature are also derived.
Significance. If the central probabilistic argument holds, the work supplies the first sharp doubling-constant bound on asymptotic dimension for general metric measure spaces and resolves an open question on manifolds with nonnegative Ricci curvature. The extension of the polynomial-growth bound together with the explicit control-function statement strengthens the combinatorial approach to asymptotic dimension beyond the graph setting.
minor comments (3)
- [§2.2] §2.2 (definition of dim_AN): the comparison asdim_AN(X) ≤ dim_AN(X) is stated as immediate from the definitions; a one-line justification or reference to the standard inequality between the two variants would remove any ambiguity.
- [Theorem 1.3] Theorem 1.3 (polynomial-growth case): the statement that the control function may be chosen with polynomial growth is asserted after the main bound; an explicit remark on how the LLL parameters translate into the degree of the control function would make the claim self-contained.
- [Introduction] The citation to Papasoglu’s question appears only in the abstract and introduction; adding the precise reference in the statement of the manifold corollary would improve traceability.
Simulated Author's Rebuttal
We thank the referee for their positive summary, significance assessment, and recommendation to accept the manuscript.
Circularity Check
No significant circularity
full rationale
The derivation relies on an explicit probabilistic construction (padded decompositions of the mm-space, randomized carving on the net graph, and LLL application whose bad-event dependency degree is bounded by the doubling constant alone). The paper supplies the net-graph definition and the LLL bound directly from the volume-doubling hypothesis; the resulting inequality dim_AN(X) ≤ ⌊log₂ C_D⌋ is obtained by counting the number of colors needed to produce the required separation, without any fitted parameter or self-citation that is load-bearing. The auxiliary comparison asdim_AN ≤ dim_AN is a short definition-level observation, and the manifold application invokes the standard Bishop-Gromov comparison (external to the paper). No step reduces by construction to its own inputs.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Metric measure spaces admit padded decompositions and net graphs on which randomized ball carving can be performed.
- standard math The Lovasz Local Lemma applies to the bad events arising in the randomized carving process.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking (D=3 forcing) unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 1.2: asdim_AN(X) ≤ dim_AN(X) ≤ ⌊log₂ C_D⌋ for volume-doubling mm-spaces (via net-graph LLL)
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel (J-cost uniqueness) unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Lemma 2.13: |B_R(x) ∩ T| ≤ C_D^{O(log(R/r))} from volume doubling
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
[Bar96] Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications , Proceedings of 37th Conference on Foundations of Computer Science (FOCS), 1996, pp. 184–193. MR1450616 [Bas72] H. Bass, The degree of polynomial growth of finitely generated nilpotent groups , Proc. Lond. Math. Soc. (3) 25 (1972), 603–614. MR379672 [BD08] G....
work page 1996
-
[2]
MR4682996 [DH08] J. Dydak and J. Higes, Asymptotic cones and Assouad–Nagata dimension , Proc. Amer. Math. Soc. 136 (2008), no. 6, 2225–2233. MR2383529 [Dra03] A.N. Dranishnikov, On hypersphericity of manifolds with finite asymptotic dimension , Trans. Amer. Math. Soc. 355 (2003), no. 1, 155–167. MR1928082 [DS07] A.N. Dranishnikov and J. Smith, On asymptot...
work page 2008
-
[3]
Springer, Dordrecht, 1986, pp. 47–53. MR852569 [Fil19] A. Filtser, On strong diameter padded decompositions , Approximation, Randomization, and Combi- natorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), 2019, pp. 6:1–6:21. MR4012656 [Gro78] M. Gromov, Almost flat manifolds , J. Differential Geom. 13 (1978), no. 2, 231–241. MR540942 [Gro...
work page 1986
-
[4]
MR1253544 [HP13] J. Higes and I. Peng, Assouad–Nagata dimension of connected Lie groups, Math. Z. 273 (2013), no. 1-2, 283–302. MR3010160 [Kan85] M. Kanai, Rough isometries, and combinatorial approximations of geometries of noncompact Rie- mannian manifolds, J. Math. Soc. Japan 37 (1985), no. 3, 391–413. MR792983 [Kec95] A.S. Kechris, Classical Descriptiv...
work page 2013
-
[5]
MR1321597 24 [KL07] R. Krauthgamer and J.R. Lee, The intrinsic dimensionality of graphs, Combinatorica 27 (2007), no. 5, 551–585. MR2120459 [LDR15] E. Le Donne and T. Rajala, Assouad dimension, Nagata dimension, and uniformly close metric tan- gents, Indiana Univ. Math. J. 64 (2015), no. 1, 21–54. MR3320519 [LR84] K.B. Lee and F. Raymond, Geometric realiz...
work page 2007
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.