2000 character limit reached
Higher stacks as diagrams
Published 18 May 2021 in math.AT and math.CT | (2105.08479v2)
Abstract: Several possible presentations for the homotopy theory of (non-hypercomplete) $\infty$-stacks on a classical site S are discussed. In particular, it is shown that an elegant combinatorial description in terms of diagrams in S exists, similar to Cisinski's presentation, based on work of Quillen, Thomason and Grothendieck, of usual homotopy theory by small categories and their smallest (basic) localizer. As an application it is shown that any (local) fibered (a.k.a. algebraic) derivator over S with stable fibers extends to $\infty$-stacks in a well-defined way under mild assumptions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.