Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hard Sard: Quantitative Implicit Function and Extension Theorems for Lipschitz Maps

Published 21 May 2011 in math.MG | (1105.4198v3)

Abstract: We prove a global implicit function theorem. In particular we show that any Lipschitz map $f:\bRn\times \bRm\to\bRn$ (with $n$-dim. image) can be precomposed with a bi-Lipschitz map $\bar{g}:\bRn\times \bRm\to \bRn\times \bRm$ such that $f\circ \bar{g}$ will satisfy, when we restrict to a large portion of the domain $E\subset \bRn\times \bRm$, that $f\circ \bar{g}$ is bi-Lipschitz in the first coordinate, and constant in the second coordinate. Geometrically speaking, the map $\bar{g}$ distorts $\bR{n+m}$ in a controlled manner, so that the fibers of $f$ are straightened out. Furthermore, our results stay valid when the target space is replaced by {\bf any metric space}. A main point is that our results are quantitative: the size of the set $E$ on which behavior is good is a significant part of the discussion. Our estimates are motivated by examples such as Kaufman's 1979 construction of a $C1$ map from $[0,1]3$ onto $[0,1]2$ with rank $\leq 1$ everywhere. On route we prove an extension theorem which is of independent interest. We show that for any $D\geq n$, any Lipschitz function $f:[0,1]n\to \bRD$ gives rise to a large (in an appropriate sense) subset $E\subset [0,1]n$ such that $f|_E$ is bi-Lipschitz and may be extended to a bi-Lipschitz function defined on {\bf all} of $\bRn$. The most interesting case is the case $D=n$. As a simple corollary, we show that $n$-dimensional Ahlfors-David regular spaces lying in $\bR{D}$ having big pieces of bi-Lipschitz images also have big pieces of big pieces of Lipschitz graphs in $\bR{D}$. This was previously known only for $D\geq 2n+1$ by a result of G. David and S. Semmes.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.