Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Presentable $(\infty, n)$-categories (2011.03035v1)

Published 5 Nov 2020 in math.AT and math.CT

Abstract: We define for each $n \geq 1$ a symmetric monoidal $(\infty, n+1)$-category $n\mathrm{Pr}L$ whose objects we call presentable $(\infty,n)$-categories, generalizing the usual theory of presentable $(\infty,1)$-categories. We show that each object $\mathcal{C}$ in $n\mathrm{Pr}L$ has an underlying $(\infty,n)$-category $\psi_n(\mathcal{C})$ which admits all conical colimits, and that conical colimits of right adjointable diagrams in $\psi_n(\mathcal{C})$ can be computed in terms of conical limits after passage to right adjoints.

Summary

We haven't generated a summary for this paper yet.