Concept

Surgery exact sequence

In the mathematical surgery theory the surgery exact sequence is the main technical tool to calculate the surgery structure set of a compact manifold in dimension . The surgery structure set of a compact -dimensional manifold is a pointed set which classifies -dimensional manifolds within the homotopy type of . The basic idea is that in order to calculate it is enough to understand the other terms in the sequence, which are usually easier to determine. These are on one hand the normal invariants which form generalized cohomology groups, and hence one can use standard tools of algebraic topology to calculate them at least in principle. On the other hand, there are the L-groups which are defined algebraically in terms of quadratic forms or in terms of chain complexes with quadratic structure. A great deal is known about these groups. Another part of the sequence are the surgery obstruction maps from normal invariants to the L-groups. For these maps there are certain characteristic classes formulas, which enable to calculate them in some cases. Knowledge of these three components, that means: the normal maps, the L-groups and the surgery obstruction maps is enough to determine the structure set (at least up to extension problems). In practice one has to proceed case by case, for each manifold it is a unique task to determine the surgery exact sequence, see some examples below. Also note that there are versions of the surgery exact sequence depending on the of manifolds we work with: smooth (DIFF), PL, or topological manifolds and whether we take Whitehead torsion into account or not (decorations or ). The original 1962 work of Browder and Novikov on the existence and uniqueness of manifolds within a simply-connected homotopy type was reformulated by Sullivan in 1966 as a surgery exact sequence. In 1970 Wall developed non-simply-connected surgery theory and the surgery exact sequence for manifolds with arbitrary fundamental group.

À 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.