nLab
rigged limit

Rigged limits

Idea

A rigged limit is a 2-limit which is created in 2-categories of algebras and lax, colax, or pseudo morphisms for a 2-monad.

In order to characterize these most precisely, however, it turns out to be convenient to generalize from 2-categories to F-categories, using the corresponding notions of -monad, -limit, and so on.

Definition

Let D be a small strict -category. Then we have the functor -category [D,] (where denotes the -category ). An object of [D,] is an -functor Φ:D, which can be identified with a pair of 2-functors Φ τ:D τCat and Φ λ:D λCat together with a 2-natural transformation

D τ J D D λ Φ τ Φ λ Cat\array{D_\tau & & \overset{J_D}{\to} & & D_\lambda\\ & {}_{\Phi_\tau}\searrow & \neArrow & \swarrow_{\Phi_\lambda} \\ & & Cat }

whose components are full embeddings (objects of ).

The tight morphisms in [D,] are -natural transformations in the usual sense of enriched category theory, whereas its loose morphisms are 2-natural transformations between loose parts.

We also have an -category Oplax(D,) with the same objects, whose loose morphisms are oplax natural transformations between loose parts which are strictly 2-natural on tight morphisms, and whose tight morphisms are those whose components are all tight. The inclusion

[D,]Oplax(D,)[D,\mathcal{F}] \to Oplax(D,\mathcal{F})

has a left adjoint, which induces an -comonad 𝒬 c D on [D,].

Definition

A weight Φ:D is l-rigged if

  1. It is a 𝒬 c D-coalgebra, and
  2. The canonical functor Lan J DΦ τΦ λ is surjective on objects.

We obtain definitions of c-rigged and p-rigged weights if we replace Oplax(D,) by Lax(D,) and Pseudo(D,), respectively.

Characterization

Let w denote one of l, c, or p.

Theorem

For an -weight Φ, the following are equivalent.

  1. Φ is w-rigged.
  2. For any -monad T on an -category K, the -functor U w:TAlg wK creates Φ-weighted limits.
  3. For any 2-monad T on a 2-category K, the functor U w:TAlg wK (where K denotes the chordate -category on K) creates Φ-weighted limits.

See (LS) for the proof.

Examples

The following limits are l-rigged.

  • The 2-limit of any diagram of tight morphisms which is also a limit as a diagram of loose morphisms. This includes any product and any power.

  • The oplax limit of any diagram of loose morphisms.

  • The inserter of a parallel pair f,g:AB such that f (the domain of the 2-cell to be inserted) is tight. Here the projection to A is tight and tightness-detecting.

  • The equifier of a parallel pair of 2-cells between a parallel pair of 1-morphisms f,g:AB such that f (the domain of the 2-cells) is tight. Again, the projection to A is tight and tightness-detecting.

  • The Eilenberg-Moore object of a loose monad. Here the canonical forgetful morphism is tight and tightness-detecting.

Each has a fairly obvious dual version which is c-rigged. There are p-rigged versions as well, but p-rigged weights are almost equivalent to PIE-limits; see (LS) for details.

References

Revised on February 22, 2012 03:25:07 by Mike Shulman (128.54.32.45)