Lower bounds on mapping content and quantitative factorization through trees

From MaRDI portal
Publication:6134506

DOI10.1112/JLMS.12595arXiv2107.01108OpenAlexW3181219433WikidataQ114077839 ScholiaQ114077839MaRDI QIDQ6134506FDOQ6134506


Authors: Guy C. David, Raanan Schul Edit this on Wikidata


Publication date: 22 August 2023

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Abstract: We give a simple quantitative condition, involving the "mapping content" of Azzam--Schul, that implies that a Lipschitz map from a Euclidean space to a metric space must be close to factoring through a tree. Using results of Azzam--Schul and the present authors, this gives simple checkable conditions for a Lipschitz map to have a large piece of its domain on which it behaves like an orthogonal projection. The proof involves new lower bounds and continuity statements for mapping content, and relies on a "qualitative" version of the main theorem recently proven by Esmayli--Haj{l}asz.


Full work available at URL: https://arxiv.org/abs/2107.01108




Recommendations



Cites Work


Cited In (3)





This page was built for publication: Lower bounds on mapping content and quantitative factorization through trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134506)