Concept

Prestack

In algebraic geometry, a prestack F over a category C equipped with some Grothendieck topology is a category together with a functor p: F → C satisfying a and such that (when the fibers are groupoids) locally isomorphic objects are isomorphic. A stack is a prestack with effective descents, meaning local objects may be patched together to become a global object. Prestacks that appear in nature are typically stacks but some naively constructed prestacks (e.g., groupoid scheme or the prestack of projectivized vector bundles) may not be stacks. Prestacks may be studied on their own or passed to stacks. Since a stack is a prestack, all the results on prestacks are valid for stacks as well. Throughout the article, we work with a fixed base category C; for example, C can be the category of all schemes over some fixed scheme equipped with some Grothendieck topology. Let F be a category and suppose it is through the functor ; this means that one can construct pullbacks along morphisms in C, up to canonical isomorphisms. Given an object U in C and objects x, y in , for each morphism in C, after fixing pullbacks , we let be the set of all morphisms from to ; here, the bracket means we canonically identify different Hom sets resulting from different choices of pullbacks. For each over U, define the restriction map from f to g: to be the composition where a canonical isomorphism is used to get the = on the right. Then is a on the , the category of all morphisms in C with target U. By definition, F is a prestack if, for each pair x, y, is a sheaf of sets with respect to the induced Grothendieck topology on . This definition can be equivalently phrased as follows. First, for each covering family , we "define" the category as a category where: writing , etc., an object is a set of pairs consisting of objects in and isomorphisms that satisfy the cocycle condition: a morphism consists of in such that An object of this category is called a descent datum.

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