relating functors with values in some other category , is always an isomorphism. Here and denote precomposition with and respectively, and and denote pointwise left Kan extensions along and . The Beck-Chevalley transformation is defined to be the composite
By the general calculus of mates, this definition is equivalent to requiring that the dual transformation
is an isomorphism, where and denote pointwise right Kan extensions.
This definition refers to Kan extensions of diagrams with values in any category (whenever such Kan extensions exist). If a square is exact only relative to diagrams defined in a particular category , we may call it -exact.
This is a “functional” definition, which generalizes correctly to other contexts (see below). However, in the case of ordinary categories and Kan extensions, there is a precise combinatorial characterization of which squares are exact. Thus, when using exactness to compute with Kan extensions in practice, we can use the combinatorial characterization to verify that a square is exact, then apply the definition above to compute one Kan extension in terms of another.
The definition given above generalizes directly to squares inhabited by a 2-cell in any 2-category, and any suitable notion of “(pointwise) Kan extension” which may exist along morphisms in that 2-category. This includes:
The combinatorial characterization of exact squares has a corresponding version for any of these generalizations, although in different cases it will be more or less explicit.
In ordinary category theory, any comma square is always exact. In other words, if is the comma category , with and the canonical projections, then the square is exact. If additionally is the terminal category, then simply picks out an object , and is the comma category of over . Exactness of this square then says that the value of at is the colimit of pulled back to , i.e.
which is (for ordinary categories) one of the equivalent definitions of when a Kan extension is pointwise.
This example also makes clear why we define exactness only relative to pointwise Kan extensions. If we allowed non-pointwise ones, then we would have hardly any exact squares. Exactness is essentially a generalized version of pointwiseness, telling us how Kan extensions along one functor can be computed by transferring them to another functor, but for non-pointwise Kan extensions (which “exist by accident”) we have basically no hope of doing this.
If is a fully faithful functor, then the square
is exact. This just says that the unit is an isomorphism, i.e. that left (and equivalently right) Kan extensions along are “honest” extensions.
A functor is a final functor if and only if the square
is exact. Exactness of this square says that for , the canonical map is an isomorphism, which is one equivalent definition of when is final.
Exact squares can be characterized in several ways, which generalize in different directions.
Recall that for any functor , the left Kan extension can be computed as the colimit weighted by the corepresentable profunctor , while restriction along is the colimit weighted by the representable profunctor . Moreover, given composable profunctors and , an -weighted colimit is the same as a -weighted colimit of an -weighted colimit. Therefore, can be computed as a -weighted colimit, while can be computed as a -weighted colimit. Note that by Yoneda reduction. Thus sufficient condition for a square as above to be exact is that the canonical induced transformation of profunctors
is an isomorphism. Moreover, by considering colimits of the Yoneda embedding it is easy to see that this condition is necessary as well. Unraveling it, we see that it says that for all objects and , the function
is an isomorphism.
So far, this argument works to describe the exact squares in arbitrary enriched categories, or more generally in any 2-category equipped with proarrows where we have a sensible notion of profunctor that describes to the notion of pointwise Kan extension under consideration. However, in the Set-based case, we can go further. Given the construction of coequalizers in Set, the above condition means that, calling the given 2-cell, we have
For any morphism in , there exists an and morphisms and such that , and
For any and as above with , there is a zigzag of arrows connecting to and rendering the evident induced diagram commutative.
We can state this equivalently as follows. Given and , define to be the category whose objects are triples with and , and whose morphisms are morphisms making two triangles commute. There is a functor
Note that in the case of a square
this characterization reduces to saying that for any , the category is connected. This is the standard combinatorial characterization of a final functor.
This characterization implies directly that any cocomma square? is exact, since the cocomma object of a cospan is precisely the cograph of the profunctor . This generalizes to any proarrow equipment (but unlike the case of comma squares, it does not generalize to homotopy exact squares unless we take a “homotopy cocomma object”).
Another approach is to argue as follows. First note that any comma square of the form
must be exact. As observed above, this is one of the equivalent definitions of what it means to be a pointwise left Kan extension. (Note that this ejects us from the world of enriched categories already.) Dually,
must also be exact, by definition of pointwise right Kan extensions. Now suppose that a square
is given. The Beck-Chevalley transformation between functors will be an isomorphism as soon as it is an isomorphism componentwise, i.e. when evaluated at every object of . In other words, we want the transformation to be an isomorphism. Now consider the composite square
Since the left-hand square is of the form considered above, it is exact, so is an isomorphism. Thus is an isomorphism if and only if the composite
is an isomorphism, but this is just the Beck-Chevalley transformation for the composite square
So the given square is exact just when all of these squares are exact. But we can also play the same game dually, so the given square is exact just when for any and , the square
is exact. However, the comma square
is always exact, as observed previously, and by the universal property of a comma square, the previous one factors through this one via a functor . Hence we have and , and the Beck-Chevalley transformation for the square factors as
Hence it is an isomorphism if and only if is an isomorphism, which is to say that colimits of constant diagrams on and on agree. But the colimit of a constant diagram is just a copower with the set of connected components of the domain category, so we recover the same characterization as before.
While this argument does not generalize to general enriched categories and proarrow equipments, it does generalize in a different direction. The notion of derivator is essentially designed exactly so that this argument works, up until the last step: in a general derivator, colimits of constant diagrams may depend on more (or less) than the set of connected components of the domain. For instance, in the derivator of ∞-groupoids, the colimit of a constant diagram is a copower with the nerve of the domain category, a finer invariant than its . It is a theorem of Cisinski that this is the finest possible: colimits of constant diagrams in a derivator never depend on anything more than the nerve of the domain. Therefore, this yields a characterization of the homotopy exact squares for computing homotopy Kan extensions in derivators: the squares where the functor induces a weak equivalence of nerves.