Concept

Theorem on formal functions

In algebraic geometry, the theorem on formal functions states the following: Let be a proper morphism of noetherian schemes with a coherent sheaf on X. Let be a closed subscheme of S defined by and formal completions with respect to and . Then for each the canonical (continuous) map: is an isomorphism of (topological) -modules, where The left term is . The canonical map is one obtained by passage to limit. The theorem is used to deduce some other important theorems: Stein factorization and a version of Zariski's main theorem that says that a proper birational morphism into a normal variety is an isomorphism. Some other corollaries (with the notations as above) are: Corollary: For any , topologically, where the completion on the left is with respect to . Corollary: Let r be such that for all . Then Corollay: For each , there exists an open neighborhood U of s such that Corollary: If , then is connected for all . The theorem also leads to the Grothendieck existence theorem, which gives an equivalence between the category of coherent sheaves on a scheme and the category of coherent sheaves on its formal completion (in particular, it yields algebralizability.) Finally, it is possible to weaken the hypothesis in the theorem; cf. Illusie. According to Illusie (pg. 204), the proof given in EGA III is due to Serre. The original proof (due to Grothendieck) was never published. Let the setting be as in the lede. In the proof one uses the following alternative definition of the canonical map. Let be the canonical maps. Then we have the base change map of -modules where is induced by . Since is coherent, we can identify with . Since is also coherent (as f is proper), doing the same identification, the above reads: Using where and , one also obtains (after passing to limit): where are as before. One can verify that the composition of the two maps is the same map in the lede. (cf.

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