A metric space X is said to be absolutely Lipschitz extendable if every Lipschitz function f from X into any Banach space Z can be extended to any containing space Y⊇X, where the loss in the Lipschitz constant in the extension is independent of , and f. We show that various classes of natural metric spaces are absolutely Lipschitz extendable.
On dit qu'un espace métrique X a la propriété d'extension lipschitzienne absolue si pour tout espace de Banach Z, toute fonction lipschitzienne f de X dans Z peut être étendue à tout espace métrique Y contenant X, avec une perte dans la constante de Lipschitz de l'extension qui ne dépend pas du choix de Y,Z et f. Nous montrons que plusieurs classes naturelles d'espaces métriques ont la propriété d'extension lipschitzienne absolue.
Accepted:
Published online:
James R. Lee 1; Assar Naor 2
@article{CRMATH_2004__338_11_859_0, author = {James R. Lee and Assar Naor}, title = {Absolute {Lipschitz} extendability}, journal = {Comptes Rendus. Math\'ematique}, pages = {859--862}, publisher = {Elsevier}, volume = {338}, number = {11}, year = {2004}, doi = {10.1016/j.crma.2004.03.005}, language = {en}, }
James R. Lee; Assar Naor. Absolute Lipschitz extendability. Comptes Rendus. Mathématique, Volume 338 (2004) no. 11, pp. 859-862. doi : 10.1016/j.crma.2004.03.005. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2004.03.005/
[1] Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of the 37th Annual Symposium Foundations of Computer Science, 1998
[2] Geometric Nonlinear Functional Analysis. vol. 1, Amer. Math. Soc. Colloq. Publ., vol. 48, American Mathematical Society, Providence, RI, 2000
[3] Approximation algorithms for the 0-extension problem, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2001
[4] An improved approximation algorithm for the 0-extension problem, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2003
[5] J. Fakcharoenphol, S. Rao, K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, in: 35th Annual ACM Symposium on Theory of Computing, ACM, 2003, in press
[6] A. Gutpa, R. Krauthgamer, J.R. Lee, Bounded geometries, fractals, and low-distortion embeddings, in: Proceedings of the 44th Annual Symposium on Foundations of Computer Science, 2003, in press
[7] Extensions of Lipschitz maps into Banach spaces, Israel J. Math., Volume 54 (1986) no. 2, pp. 129-138
[8] Über die zusammenziehenden und Lipschitzchen Transformationen, Fund. Math. (1934) no. 22, pp. 77-108
[9] Excluded minors, network decomposition, and multicommodity flow, 25th Annual ACM Symposium on Theory of Computing, May 1993, pp. 682-690
[10] J.R. Lee, A. Naor, Extending Lipschitz functions via random metric partitions, Preprint
[11] Low diameter graph decompositions, Combinatorica, Volume 13 (1993) no. 4, pp. 441-454
[12] Extension of Lipschitz mappings on metric trees, Comment. Math. Univ. Carolin., Volume 31 (1990) no. 1, pp. 99-104
[13] Graphs on Surfaces, Johns Hopkins Stud. Math. Sci., Johns Hopkins University Press, Baltimore, MD, 2001
[14] Small distortion and volume preserving embeddings for planar and Euclidean metrics, Proceedings of the 15th Annual Symposium on Computational Geometry, ACM, 1999, pp. 300-306
[15] Graph minors. VIII. A Kuratowski theorem for general surfaces, J. Combin. Theory Ser. B, Volume 48 (1990) no. 2, pp. 255-288
[16] Embeddings and Extensions in Analysis, Ergeb. Math. Grenzgeb., vol. 84, Springer-Verlag, New York, 1975
Cited by Sources:
Comments - Policy