skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: On the construction of limits and colimits in ∞-categories
In previous work, we introduce an axiomatic framework within which to prove theorems about many varieties of infinite-dimensional categories simultaneously. In this paper, we establish criteria implying that an ∞-category --- for instance, a quasi-category, a complete Segal space, or a Segal category --- is complete and cocomplete, admitting limits and colimits indexed by any small simplicial set. Our strategy is to build (co)limits of diagrams indexed by a simplicial set inductively from (co)limits of restricted diagrams indexed by the pieces of its skeletal filtration. We show directly that the modules that express the universal properties of (co)limits of diagrams of these shapes are reconstructible as limits of the modules that express the universal properties of (co)limits of the restricted diagrams. We also prove that the Yoneda embedding preserves and reflects limits in a suitable sense, and deduce our main theorems as a consequence.  more » « less
Award ID(s):
1652600
PAR ID:
10288977
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Theory and applications of categories
Volume:
35
Issue:
30
ISSN:
1201-561X
Page Range / eLocation ID:
1101-1158
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract We study the simplicial coalgebra of chains on a simplicial set with respect to three notions of weak equivalence. To this end, we construct three model structures on the category of reduced simplicial sets for any commutative ring $$R$$. The weak equivalences are given by: (1) an $$R$$-linearized version of categorical equivalences, (2) maps inducing an isomorphism on fundamental groups and an $$R$$-homology equivalence between universal covers, and (3) $$R$$-homology equivalences. Analogously, for any field $${\mathbb{F}}$$, we construct three model structures on the category of connected simplicial cocommutative $${\mathbb{F}}$$-coalgebras. The weak equivalences in this context are (1′) maps inducing a quasi-isomorphism of dg algebras after applying the cobar functor, (2′) maps inducing a quasi-isomorphism of dg algebras after applying a localized version of the cobar functor, and (3′) quasi-isomorphisms. Building on a previous work of Goerss in the context of (3)–(3′), we prove that, when $${\mathbb{F}}$$ is algebraically closed, the simplicial $${\mathbb{F}}$$-coalgebra of chains defines a homotopically full and faithful left Quillen functor for each one of these pairs of model categories. More generally, when $${\mathbb{F}}$$ is a perfect field, we compare the three pairs of model categories in terms of suitable notions of homotopy fixed points with respect to the absolute Galois group of $${\mathbb{F}}$$. 
    more » « less
  2. Mulzer, Wolfgang; Phillips, Jeff M (Ed.)
    We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and develop an efficient algorithm to compute the homology of a complex of presentations. To deal with inputs that are not given in terms of presentations, we give an efficient algorithm to compute a presentation of a morphism of persistence modules. This allows us to compute persistent (co)homology of instances giving rise to complexes of non-free modules. Our methods lead to a new efficient algorithm for computing the persistent homology of simplicial towers and they enable efficient algorithms to compute the persistent homology of cosheaves over simplicial towers and cohomology of persistent sheaves on simplicial complexes. We also show that we can compute the cohomology of persistent sheaves over arbitrary finite posets by reducing the computation to a computation over simplicial complexes. 
    more » « less
  3. Duality properties are studied for a Gorenstein algebra that is finite and projective over its center. Using the homotopy category of injective modules, it is proved that there is a local duality theorem for the subcategory of acyclic complexes of such an algebra, akin to the local duality theorems of Grothendieck and Serre in the context of commutative algebra and algebraic geometry. A key ingredient is the Nakayama functor on the bounded derived category of a Gorenstein algebra and its extension to the full homotopy category of injective modules. 
    more » « less
  4. Nadler introduced certain Lagrangian singularities indexed by trees, and determined their microlocal sheaves to be the category of modules over the corresponding tree quiver. Another family of spaces indexed by trees: the tree plumbings of spheres. The Fukaya-Seidel category of the Lefschetz fibration with this plumbing as fiber and all spheres as vanishing cycles is well known to also be modules over the tree quiver. Here we upgrade this matching of categories to a matching of geometry. 
    more » « less
  5. We give an explicit point-set construction of the Dennis trace map from the K-theory of endomorphisms K End(C) to topological Hochschild homology THH(C) for any spectral Waldhausen category C. We describe the necessary technical foundations, most notably a well-behaved model for the spectral category of diagrams in C indexed by an ordinary category via the Moore end. This is applied to define a version of Waldhausen’s S•-construction for spectral Waldhausen categories, which is central to this account of the Dennis trace map. Our goals are both convenience and transparency—we provide all details except for a proof of the additivity theorem for THH, which is taken for granted—and the exposition is concerned not with originality of ideas, but rather aims to provide a useful resource for learning about the Dennis trace and its underlying machinery. 
    more » « less