Papers
Topics
Authors
Recent
Search
2000 character limit reached

Derived Smooth and Banach Higher Groupoids: Representability and Descent

Published 23 Sep 2026 in math.DG, math.AG, and math.AT | (2609.28220v1)

Abstract: We study homotopy theories of higher groupoids in specified geometries, distinguishing geometric representability from realization and descent. Ordinary smooth and Banach-open sheaves admit full Brown categories of fibrant objects. For ordinary geometric groupoids, a crossing-axes obstruction motivates an empty-compatible incomplete Brown structure. Its split-Banach version requires a fixed chart-compatible plot site with local kernel-product closure. These results include all finite unique-horn bounds and their union. For represented derived models, finite matching and an outer-prism filtration give the structural Brown calculus. Nuiten's finite-geometric realization theorem yields the finite derived-smooth structure and its localization. Enriched realization base change on the original small Kan-enriched site gives the outer-unbounded hypercomplete structure, with positive-degree geometric horn conditions and Reedy fibrancy in every degree. For Banach domains, structured spectra, strict-open gluing and split-open hyperdescent establish geometric finite limits and hypersheaf representability. They give the represented Brown structure, using the same hypercompleted weak-equivalence class at every outer bound. A square-zero test detects nonordinary self-intersections of the chosen Banach charts, including infinite-dimensional charts. For connective associative affines, homotopy split horns, Pridham's finite effectivity theorem and a pointwise diagonal-fibration argument give categories of fibrant objects for his Artin and Deligne--Mumford classes. The associative theory uses quasi-isomorphisms of algebras and realization in presheaves.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.