English

Umbel convexity and the geometry of trees

Metric Geometry 2025-02-11 v2 Functional Analysis

Abstract

For every p(0,)p\in(0,\infty), a new metric invariant called umbel pp-convexity is introduced. The asymptotic notion of umbel convexity captures the geometry of countably branching trees, much in the same way as Markov convexity, the local invariant which inspired it, captures the geometry of bounded degree trees. Umbel convexity is used to provide a ``Poincar\'e-type" metric characterization of the class of Banach spaces that admit an equivalent norm with Rolewicz's property (β)(\beta). We explain how a relaxation of umbel pp-convexity, called infrasup-umbel pp-convexity, plays a role in obtaining compression rate bounds for coarse embeddings of countably branching trees. Local analogues of these invariants - fork pp-convexity and infrasup-fork pp-convexity - are introduced, and their relationship to Markov pp-convexity and relaxations of the pp-fork inequality is discussed. The metric invariants are estimated for a large class of Heisenberg groups, and in particular a parallelogram pp-convexity inequality is proved for Heisenberg groups over pp-uniformly convex Banach spaces. Finally, a new characterization of non-negative curvature is given.

Keywords

Cite

@article{arxiv.2103.16011,
  title  = {Umbel convexity and the geometry of trees},
  author = {Florent P. Baudier and Chris Gartland},
  journal= {arXiv preprint arXiv:2103.16011},
  year   = {2025}
}

Comments

48 pages, 2 figures. Updated to include refereed revisions. Some terminology has been renamed