nLab commutativity of homotopy limits and colimits

Contents

Context

Homotopy theory

homotopy theory, (∞,1)-category theory, homotopy type theory

flavors: stable, equivariant, rational, p-adic, proper, geometric, cohesive, directed

models: topological, simplicial, localic, …

see also algebraic topology

Introductions

Definitions

Paths and cylinders

Homotopy groups

Basic facts

Theorems

Limits and colimits

Contents

Idea

Definition

Universal commutativity

In a locally λ\lambda-presentable (∞,1)-category, λ\lambda-filtered (∞,1)-colimits commute with λ\lambda-small (∞,1)-limits.

In particular, in a locally finitely presentable (∞,1)-category, filtered (∞,1)-colimits commute with finite (∞,1)-limits.

In an algebraic (∞,1)-category, i.e., one that is equivalent to the category of finite product-preserving functors from a small (∞,1)-category with finite products to the (∞,1)-category of spaces, sifted (∞,1)-colimits commute with finite (∞,1)-products.

Special commutativity: model ∞-categories

From a MathOverflow answer:

Model categories provide a powerful framework for commuting (homotopy) limits and colimits, and, more generally, for commuting left adjoint functors and (homotopy) limits, as well as right adjoint functors and (homotopy) colimits. (In what follows, I omit the adjective “homotopy” before limits and colimits.)

In finitely presentable ∞-categories filtered colimits commute with finite limits and in finitely presentable ∞-categories with a set of compact projective generators sifted colimits commute with finite products. However, many other situations of interest are not covered by such statements. For instance, one might want to commute a sifted colimit past an infinite product, a pullback, or a cosifted limit (e.g., a cosimplicial totalization). One might also want to commute sifted colimits past finite products in ∞-categories that do not have a set of compact projective generators, e.g., the ∞-category of small ∞-categories.

In all such situations the relevant statement is false at least for some diagrams, so whatever criterion we devise must analyze the specific diagrams at question. This is precisely what model categories achieve.

For example, one might want to commute KK-indexed colimits (for some small diagram KK) past some right adjoint functor F:CBF: C\to B. (For instance, one can take FF to be

lim L:Fun(L,B)B,lim_L: Fun(L,B)\to B,

the limit functor for LL-indexed diagrams, which will allows us to commute KK-indexed colimits past LL-indexed limits.)

We would like to devise a condition on a diagram D:KCD: K\to C that would guarantee that the canonical comparison map

colim KF(D)F(colim KD)colim_K F(D) \to F(colim_K D)

is an equivalence in the ∞-category BB. This is achieved by the following creative procedure. First, consider the relative ∞-category (i.e., ∞-category equipped with a class of maps (weak equivalences) closed under composition) Fun(K,C)Fun(K,C) whose weak equivalences are created by the functor colim Kcolim_K (i.e., a natural transformation of functors KCK\to C is a weak equivalence if its KK-colimit is an equivalence in the ∞-category CC). The ∞-category Fun(K,B)Fun(K,B) is turned into a relative ∞-category in the same way. The functor

Fun(K,F):Fun(K,C)Fun(K,B)Fun(K,F): Fun(K,C)\to Fun(K,B)

is a functor between ∞-categories that need not preserve weak equivalences.

Now comes the (potentially) creative part: equip the relative ∞-categories Fun(K,C)Fun(K,C) and Fun(K,B)Fun(K,B) with model structures such that Fun(K,F)Fun(K,F) is a right Quillen functor. In many situations of interest this can be done immediately using existing tools.

Our criterion now says that if D:KCD: K\to C is a fibrant diagram, then the comparison map

colim KF(D)F(colim KD)colim_K F(D) \to F(colim_K D)

is an equivalence in the ∞-category B, i.e., the colimit of DD over KK commutes with FF. Different choices of model structures give us different criteria.

For instance, one can take K=Δ opK=\Delta^{op}, B=spacesB=spaces (alias ∞-groupoids), C=Fun(L,B)C=Fun(L,B) (i.e., LL-indexed diagrams of spaces) and

F=lim L:Fun(L,B)B,F=lim_L: Fun(L,B)\to B,

the LL-indexed limit functor, where LL can be taken to be the pullback diagram or the infinite discrete category and the model structure can be taken to be the projective model structure. In this case we obtain a criterion for commuting Δ op\Delta^{op}-indexed colimits past LL-indexed limits. This recovers, for example, the traditional methods for computing homotopy pullbacks of simplicial sets (replace one of the legs by a fibration), infinite homotopy products of simplicial sets (fibrantly replace all terms), etc.

There are many variations on the above theme, for instance, one can consider weighted limits (in the sense of enriched category theory) and then derive the limit functor with respect to both the functor and the weight, which yields even more powerful computational tools etc.

Many classical results on model categories fit in the above framework. For instance, if MM is a simplicial model category, XX is a cofibrant object, and YY is a fibrant object, then the simplicial mapping space Map(X,Y)Map(X,Y) from XX to YY computes the mapping space in the ∞-localization of MM with respect to its weak equivalences. We can fit this in the above framework by taking

F=Map(,Y):Fun(Δ op,M)Fun(Δ op,Spaces),F=Map(-,Y): Fun(\Delta^op,M)\to Fun(\Delta^op,Spaces),

and observing that a cofibrant object XX has a cofibrant cosimplicial resolution XΔ nX\otimes\Delta^n.

Textbook accounts include Chapter 7 of Cisinski.

References

Universal commutativity

Special commutativity

On conditions that base change via homotopy pullback commutes with realization (cf. π-Kan condition and this Prop.):

For a treatment without ∞-categories, see also BEBP19, Def. 3.2, Ex. 3.10, Thm. 3.17 below.

An even larger class of maps of so-called weak Kan fibrations is studied in Section 3 of

The general theory of model (∞,1)-categories that allows one to commute homotopy colimits past homotopy limits is developed in a series of papers by Aaaron Mazel-Gee:

and in

In particular, see Propositions 7.5.5, 7.7.4, 7.7.5.

Last revised on November 28, 2024 at 09:32:17. See the history of this page for a list of all contributions to it.