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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.