Descent via Tannaka duality
Daniel Sch\"appi

TL;DR
This paper employs generalized Tannaka duality to compute colimits in the 2-category of Adams stacks, extending descent results to broader contexts and providing a global gluing theorem for schemes and stacks.
Contribution
It explicitly computes colimits in Adams stacks using Tannaka duality, extending descent results to non-noetherian rings and broadening the scope of gluing theorems.
Findings
Extended descent results to Adams stacks and non-noetherian rings.
Explicit computation of colimits in the 2-category of Adams stacks.
Established a global gluing theorem for schemes and stacks.
Abstract
Given a diagram of schemes, we can ask if a geometric object over one of them can be built from descent data (usually objects of the same type over the various other schemes in the diagram, together with compatibility isomorphisms). Using the language of moduli stacks, we can rephrase this as follows: saying that descent problems for a given diagram have essentially unique solutions amounts to saying that the diagram in question is a (bicategorical) colimit diagram in a certain 2-category of stacks. In this paper we use generalized Tannaka duality to explicitly compute certain colimits in the 2-category of Adams stacks. Using this we extend recent results of Bhatt from algebraic spaces to Adams stacks and a result of Hall-Rydh to non-noetherian rings. We conclude the paper with a global version of the Beauville-Laszlo theorem, which states that a large class of schemes and stacks…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Homotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models
