Search arXiv⌕ Search

arXiv · math/0110316

Homotopy theory of diagrams

Abstract

In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model approximation. Our key result says that if a category admits a model approximation then so does any diagram category with values in this category. From the homotopy theoretical point of view categories with model approximations have similar properties to those of model categories. They admit homotopy categories (localizations with respect to weak equivalences). They also can be used to construct derived functors by taking the analogs of fibrant and cofibrant replacements. A category with weak equivalences can have several useful model approximations. We take advantage of this possibility and in each situation choose one that suits our needs. In this way we prove all the fundamental properties of the homotopy colimit and limit: Fubini Theorem (the homotopy colimit -respectively limit- commutes with itself), Thomason's theorem about diagrams indexed by Grothendieck constructions, and cofinality statements. Since the model approximations we present here consist of certain functors "indexed by spaces", the key role in all our arguments is played by the geometric nature of the indexing categories.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wojciech Chacholski, Jerome Scherer. 2001-10-30. Homotopy theory of diagrams. https://arxiv.org/abs/math/0110316

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Galois Connections in Persistent Homology

We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings. Second, it provides access to Rota's Galois connection theorem -- a powerful tool with many potential applications in applied topology. To illustrate this, we use Rota's Galois connection theorem to give a substantially easier proof of the bottleneck stability theorem. Finally, we use this language to establish relationships between various notions of multiparameter persistence diagrams.

math.AT↗

The Dold-Kan theorem for paracyclic modules

We study the Karoubi operator on the unnormalized chain complex of a paracyclic module; its restriction to the normalized chain complex has previously been considered by Dwyer and Kan, and in the cyclic case by Cuntz and Quillen. We obtain a direct proof of the Dold-Kan theorem for paracyclic modules of Dwyer and Kan, by directly relating the Karoubi operator to projection to the normalized subcomplex.

math.AT↗

The relative join operad and polyhedral products

An inclusion of nonvoid simplicial complexes induces an arrow of polyhedral products. Applying Ayzenberg's polyhedral join to both complexes gives a symmetric relative join operad. Its endpoint suboperads recover Abramyan--Panov substitution and Ayzenberg composition. Neither endpoint operad nor either relative join operad is finitely generated. The suboperad with nonvoid lower complex arises as the nonempty power-set quotient of the subset-inclusion operad. When tensoring preserves colimits of nonempty finite diagrams, the suboperad acts on arrows by polyhedral colimits up to coherent natural isomorphism. The action induces a set-operad algebra on isomorphism classes of arrows. The dual construction produces Stanley--Reisner quotient arrows, and the colimit action refines Eldridge's loop-space decomposition to arrows. PL ball--boundary pairs form a suboperad of the relative join operad, and minimal interior faces give an operad morphism. Principal pairs have odd-dimensional spherical moment-angle homotopy fibers and yield a closure result for Eldridge's loop-space class.

math.AT↗