Skip to main content

On Lipschitz Mappings Onto a Square

  • Chapter
  • First Online:
The Mathematics of Paul Erdős I
  • 2202 Accesses

Abstract

The following problem was posed by Laczkovich [5]: Let \(E \subseteq \mathbb{R}{\mathbb{R}}^{d}\) (d ≥ 2) be a set with positive Lebesgue measure λ d(E) > 0. Does there exist a Lipschitz mapping \(f : {\mathbb{R}}^{d} \rightarrow Q = {[0,1]}^{d}\), such that f(E) = Q? Preiss [6] answered this question affirmatively for d = 2:

This paper was originally published in 1997. The present version is a minor revision from 2012, which includes some references to newer developments.

It is my pleasure to thank University College of London for enabling my visit, during which this research was conducted. The visit was also supported by the Humboldt Foundation.

Preiss in fact proves a slightly stronger statement, namely that f can be taken such that \(f({\mathbb{R}}^{2} \setminus E)\) is countably rectifiable (i.e. it can be covered by a countable set of Lipschitz curves). In order to keep this note technically simple, we will not prove this strengthening here, although our method also provides it with some extra care.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. G. Alberti, M. Csörnyei, D. Preiss: Structure of null sets in the plane and applications, in European Congress of Mathematics: Stockholm, June 27–July 2, 2004 (A. Laptev ed.), Europ. Math. Soc., Zurich 2005, pages 3–22.

    Google Scholar 

  2. G. Alberti, M. Csörnyei, D. Preiss: Differentiability of Lipschitz functions, structure of null sets, and other problems, in Proc. ICM 2010, vol. III, World Scientific, Hackensack, NJ, pages 1379–1394.

    Google Scholar 

  3. N. Alon, J. Spencer, P. Erdös: The probabilistic method. Cambridge Univ. Press 1992.

    MATH  Google Scholar 

  4. P. Erdös, G. Szekerés: A combinatorial problem in geometry. Compositio Math. 2(1935) 463–470.

    MathSciNet  Google Scholar 

  5. M. Laczkovich: Paradoxical decompositions using Lipschitz functions, Real Analysis Exchange 17(1991–92), 439–443.

    Google Scholar 

  6. D. Preiss, manuscript, 1992.

    Google Scholar 

  7. T. Szabó, G. Tardos: A multidimensional generalization of the Erdős–Szekeres lemma on monotone subsequences, Combinatorics, Probability and Computing 10(2001) 557–565.

    Google Scholar 

  8. N. X. Uy, Removable sets of analytic functions satisfying a Lipschitz condition, Ark. Mat. 17(1979), 19–27.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. H. Wells, L. R. Williams: Embeddings and extensions in analysis, Springer-Verlag 1975.

    Google Scholar 

Download references

Acknowledgements

I would like to thank David Preiss for explaining me his proof, useful discussions and for his hospitality during my visit.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiří Matoušek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Matoušek, J. (2013). On Lipschitz Mappings Onto a Square. In: Graham, R., Nešetřil, J., Butler, S. (eds) The Mathematics of Paul Erdős I. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7258-2_33

Download citation

Publish with us

Policies and ethics