Lower bounds on mapping content and quantitative factorization through trees
Lower bounds on mapping content and quantitative factorization through trees
复制标题
通过树映射内容和定量分解的下限
DOI:
10.1112/jlms.12595
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Schul, Raanan
中科院分区:
文献类型:
--
作者:
David, Guy C.;Schul, Raanan
We give a simple quantitative condition, involving the “mapping content” of Azzam–Schul, which 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łasz.
登录
查看更多内容
DOI:
--
发表时间:
2014
期刊:
影响因子:
--
作者:
K. Kinneberg
通讯作者:
K. Kinneberg
影响因子:
2.2
作者:
Jonas Azzam;Raanan Schul
通讯作者:
Raanan Schul
DOI:
--
发表时间:
2018
期刊:
影响因子:
--
作者:
P. Hajłasz;Scott Zimmerman
通讯作者:
Scott Zimmerman
DOI:
--
发表时间:
2012
期刊:
影响因子:
--
作者:
S. Wenger;Robert Young
通讯作者:
Robert Young
DOI:
10.1112/jlms.12644
发表时间:
2022
期刊:
Journal of the London Mathematical Society
影响因子:
--
作者:
Esmayli, Behnam;Hajłasz, Piotr
通讯作者:
Hajłasz, Piotr