IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-031-81414-3_13.html
   My bibliography  Save this book chapter

Lifting Generic Maps to Embeddings. The Double Point Obstruction

In: Essays on Topology

Author

Listed:
  • Sergey A. Melikhov

    (Steklov Mathematical Institute of Russian Academy of Sciences)

Abstract

Given a generic PL map or a generic smooth fold map f : N n → M m $$f\colon N^n\to M^m$$ , where m ≥ n $$m\ge n$$ and 2 ( m + k ) ≥ 3 ( n + 1 ) $$2(m+k)\ge 3(n+1)$$ , we prove that f lifts to a PL or smooth embedding N → M × ℝ k $$N\to M\times \mathbb {R}^k$$ if and only if its double point locus { ( x , y ) ∈ N × N ∣ f ( x ) = f ( y ) , x ≠ y } $$\{(x,y)\in N\times N\mid f(x)=f(y),\,x\ne y\}$$ admits an equivariant map to S k −1 $$S^{k-1}$$ . As a corollary we answer a 1990 question of P. Petersen and obtain some other applications. We also discuss several criteria for lifting a non-degenerate PL map or a C 0 $$C^0$$ -stable smooth map f : N n → M m $$f\colon N^n\to M^m$$ , where m ≥ n $$m\ge n$$ , to an embedding in M × ℝ $$M\times \mathbb {R}$$ , elaborating on V. Poénaru’s observations. In particular, the existence of such a lift is determined by the equivariant homotopy type of the diagram consisting of the three projections from the triple point locus { ( x , y , z ) ∈ N × N × N ∣ f ( x ) = f ( y ) = f ( z ) , x ≠ y ≠ z ≠ x } $$\{(x,y,z)\in N\times N\times N\mid f(x)=f(y)=f(z),\,x\ne y\ne z\ne x\}$$ to the double point locus. The three Appendices, which can be read independently of the rest of this chapter, are devoted to stable and generic maps. Appendix B introduces an elementary theory of stable PL maps. Appendix C extends the 2-multi-0-jet transversality theorem over the usual compactification of M × M ∖ Δ M $$M\times M\setminus \Delta _M$$ .

Suggested Citation

  • Sergey A. Melikhov, 2025. "Lifting Generic Maps to Embeddings. The Double Point Obstruction," Springer Books, in: Louis Funar & Athanase Papadopoulos (ed.), Essays on Topology, chapter 0, pages 237-288, Springer.
  • Handle: RePEc:spr:sprchp:978-3-031-81414-3_13
    DOI: 10.1007/978-3-031-81414-3_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-031-81414-3_13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.