Concept

Nagata's compactification theorem

In algebraic geometry, Nagata's compactification theorem, introduced by , implies that every abstract variety can be embedded in a complete variety, and more generally shows that a separated and finite type morphism to a Noetherian scheme S can be factored into an open immersion followed by a proper morphism. Nagata's original proof used the older terminology of Zariski–Riemann spaces and valuation theory, which sometimes made it hard to follow. Deligne showed, in unpublished notes expounded by Conrad, that Nagata's proof can be translated into scheme theory and that the condition that S is Noetherian can be replaced by the much weaker condition that S is quasi-compact and quasi-separated. gave another scheme-theoretic proof of Nagata's theorem. An important application of Nagata's theorem is in defining the analogue in algebraic geometry of cohomology with compact support, or more generally higher . The idea is that given a compactifiable morphism one defines by choosing a factorization by an open immersion j and proper morphism p, and then setting where is the extension by zero functor. One then shows the independence of the definition from the choice of compactification. In the context of étale sheaves, this idea was carried out by Deligne in SGA 4, Exposé XVII. In the context of coherent sheaves, the statements are more delicate since for an open immersion j, the functor does not usually admit a left adjoint. Nonetheless, exists as a pro-left adjoint, and Deligne was able to define the functor as valued in the pro-derived category of coherent sheaves.

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