In topology, a branch of mathematics, a Dehn surgery, named after Max Dehn, is a construction used to modify 3-manifolds. The process takes as input a 3-manifold together with a link. It is often conceptualized as two steps: drilling then filling. Given a 3-manifold and a link , the manifold drilled along is obtained by removing an open tubular neighborhood of from . If , the drilled manifold has torus boundary components . The manifold drilled along is also known as the link complement, since if one removed the corresponding closed tubular neighborhood from , one obtains a manifold diffeomorphic to . Given a 3-manifold whose boundary is made of 2-tori , we may glue in one solid torus by a homeomorphism (resp. diffeomorphism) of its boundary to each of the torus boundary components of the original 3-manifold. There are many inequivalent ways of doing this, in general. This process is called Dehn filling. Dehn surgery on a 3-manifold containing a link consists of drilling out a tubular neighbourhood of the link together with Dehn filling on all the components of the boundary corresponding to the link. In order to describe a Dehn surgery (see ), one picks two oriented simple closed curves and on the corresponding boundary torus of the drilled 3-manifold, where is a meridian of (a curve staying in a small ball in and having linking number +1 with or, equivalently, a curve that bounds a disc that intersects once the component ) and is a longitude of (a curve travelling once along or, equivalently, a curve on such that the algebraic intersection is equal to +1). The curves and generate the fundamental group of the torus , and they form a basis of its first homology group. This gives any simple closed curve on the torus two coordinates and , so that . These coordinates only depend on the homotopy class of . We can specify a homeomorphism of the boundary of a solid torus to by having the meridian curve of the solid torus map to a curve homotopic to .

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.