Pith. sign in

REVIEW 1 cited by

Descent via Tannaka duality

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1505.05681 v1 pith:BDMF6LLA submitted 2015-05-21 math.AG math.CT

classification math.AGmath.CT
keywords diagramstacksdescentschemesadamsbuiltcategorycertain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 can be built by gluing the open complement of an effective Cartier divisor with the infinitesimal neighbourhood of the divisor.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Moduli of truncated shtukas and displays

    math.AG 2025-06 conditional novelty 6.0 of 10

    Truncated shtukas and displays are classified by quotient stacks of loop groups by display groups, with explicit cutoff bounds N0 = 2C+1 beyond which truncation determines the full object.

Pith tools