skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Award ID contains: 1763973

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. We study the quantitative properties of Lipschitz mappings from Euclidean spaces into metric spaces. We prove that it is always possible to decompose the domain of such a mapping into pieces on which the mapping “behaves like a projection mapping” along with a “garbage set” that isarbitrarily smallin an appropriate sense. Moreover, our control is quantitative, i.e., independent of both the particular mapping and the metric space it maps into. This improves a theorem of Azzam-Schul from the paper “Hard Sard”, and answers a question left open in that paper. The proof uses ideas of quantitative differentiation, as well as a detailed study of how to supplement Lipschitz mappings by additional coordinates to form bi-Lipschitz mappings. 
    more » « less
  2. 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. 
    more » « less
  3. null (Ed.)