nLab exact square

Exact squares

Exact squares


Let AA, BB, CC, and DD be (usually small strict) categories, and consider a square of functors

A f B u v C g D \array{ A & \overset{f}{\longrightarrow} & B \\ \mathllap{^u} \Big\downarrow & \swArrow & \Big\downarrow \mathrlap{^v} \\ C &\underset{g}{\longrightarrow}& D }

that is filled by a natural transformation (which might be an identity).

This is said to be an exact square if the canonical Beck-Chevalley transformation

u !f *g *v !, u_! f^* \to g^* v_!,

relating functors with values in some other category MM, is an isomorphism.

Here f *:M BM Af^*\colon M^B\to M^A and g *:M DM Cg^*\colon M^D\to M^C denote precomposition with ff and gg respectively, and u !:M AM Cu_!\colon M^A\to M^C and v !:M BM Dv_!\colon M^B\to M^D denote pointwise left Kan extensions along uu and vv. The Beck-Chevalley transformation is defined to be the composite

u !f *u !f *v *v !u !u *g *v !g *v ! u_! f^* \longrightarrow u_! f^* v^* v_! \longrightarrow u_! u^* g^* v_! \longrightarrow g^* v_!

of (co)unit maps.

By the general calculus of mates, this definition is equivalent to requiring that the dual transformation

v *g *f *u * v^* g_* \to f_* u^*

is an isomorphism, where f *f_* and g *g_* denote pointwise right Kan extensions.

This definition refers to Kan extensions of diagrams with values in any category MM (whenever such Kan extensions exist). If a square is exact only relative to diagrams defined in a particular category MM, we may call it MM-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.


Comma squares

In ordinary category theory, any comma square is always exact. In other words, if AA is the comma category (v/g)(v/g), with ff and uu the canonical projections, then the square is exact. If additionally C=*C=* is the terminal category, then gg simply picks out an object dDd\in D, and A=v/dA=v/d is the comma category of vv over dd. Exactness of this square then says that the value of v !Fv_! F at dDd\in D is the colimit of FF pulled back to v/dv/d, i.e.

(Lan vF)(d)=colim v(b)dF(b) (Lan_v F)(d) = colim_{v(b) \to d} F(b)

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.

Fully faithful functors

A functor u:ABu\colon A\to B is a fully faithful functor if and only if the square

A id A id u A u B\array{A & \overset{id}{\to} & A\\ ^{id}\downarrow && \downarrow^u\\ A & \underset{u}{\to} & B}

is exact. This just says that the unit Id Au *u !Id_A \to u^* u_! is an isomorphism, i.e. that left (and equivalently right) Kan extensions along uu are “honest” extensions.

Final functors

A functor u:ABu\colon A\to B is a final functor if and only if the square

A u B * *\array{A & \overset{u}{\to} & B\\ \downarrow && \downarrow\\ *& \underset{}{\to} & *}

is exact. Exactness of this square says that for F:BMF\colon B\to M, the canonical map colim Au *Fcolim BFcolim_A u^*F \to colim_B F is an isomorphism, which is one equivalent definition of when uu is final.


A functor f:ABf: A \to B is left adjoint to u:BAu: B \to A with unit η:1 Auf\eta: 1_A \implies uf if and only if the square

A id A f η id B u A\array{A & \overset{id}{\to} & A \\ ^f\downarrow & ^\eta\swArrow & \downarrow^{id}\\ B& \underset{u}{\to} & A}

is exact. Dually, fuf \dashv u with counit ε:fu1 B\varepsilon: fu \implies 1_B if and only if the square

B u A id ε f B id B\array{B & \overset{u}{\to} & A\\ ^{id}\downarrow & ^\varepsilon \swArrow & \downarrow^f\\ B& \underset{id}{\to} & B}

is exact.


Exact squares can be characterized in several ways, which generalize in different directions.

Using profunctors

Recall that for any functor u:ACu\colon A\to C, the left Kan extension u !u_! can be computed as the colimit weighted by the corepresentable profunctor C(u,1)C(u,1), while restriction u *u^* along uu is the colimit weighted by the representable profunctor C(1,u)C(1,u). Moreover, given composable profunctors HH and KK, an HKH K-weighted colimit is the same as a KK-weighted colimit of an HH-weighted colimit. Therefore, u !f *u_! f^* can be computed as a C(u,1)B(1,f)C(u,1) \circ B(1,f)-weighted colimit, while g *v !g^* v_! can be computed as a D(1,g)D(v,1)D(1,g) \circ D(v,1)-weighted colimit. Note that D(1,g)D(v,1)D(v,g)D(1,g) \circ D(v,1) \cong D(v,g) by Yoneda reduction. Thus sufficient condition for a square as above to be exact is that the canonical induced transformation of profunctors

C(u,1)B(1,f)D(v,g) C(u,1) \circ B(1,f) \to D(v,g)

is an isomorphism. If the categories are large, C(u,1)B(1,f)C(u,1)\circ B(1,f) may not exist a priori, but there is still a 2-cell in the virtual equipment of functors and profunctors, and we ask that this cell C(u,1),B(1,f)D(v,g)C(u,1), B(1,f)\to D(v,g) realizes the composition of C(u,1)B(1,f)C(u,1)\circ B(1,f) as D(v,g)D(v,g). Moreover, by considering colimits of the Yoneda embedding B[B op,Set]B\to [B^{op},Set] it is easy to see that this condition is necessary as well. Unraveling it, we see that it says that for all objects bBb\in B and cCc\in C, the function

aAC(u(a),c)×B(b,f(a))D(v(b),g(c)) \int^{a\in A} C(u(a),c) \times B(b,f(a)) \to D(v(b), g(c))

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 ψ:guvf\psi \colon g u \to v f the given 2-cell, we have

  1. For any morphism φ:v(b)g(c)\varphi\colon v(b) \to g(c) in DD, there exists an aAa\in A and morphisms α:u(a)c\alpha\colon u(a) \to c and β:bf(a)\beta\colon b\to f(a) such that g(α)ψ av(β)=φg(\alpha) \circ \psi_a \circ v(\beta) = \varphi, and

  2. For any (a,α,β)(a,\alpha,\beta) and (a,α,β)(a',\alpha',\beta') as above with g(α)ψ av(β)=g(α)ψ av(β)g(\alpha) \circ \psi_a \circ v(\beta) = g(\alpha') \circ \psi_{a'} \circ v(\beta'), there is a zigzag of arrows connecting aa to aa' and rendering the evident induced diagram commutative.

We can state this equivalently as follows. Given bBb\in B and cCc\in C, define (b/A/c)(b/A/c) to be the category whose objects are triples (a,α,β)(a,\alpha,\beta) with α:u(a)c\alpha\colon u(a) \to c and β:bf(a)\beta\colon b\to f(a), and whose morphisms are morphisms aaa\to a' making two triangles commute. There is a functor

(b/A/c)D(v(b),g(c))(b/A/c) \to D(v(b),g(c))

(considering the latter homset as a discrete category) which sends (a,α,β)(a,\alpha,\beta) to the composite g(α)ψ av(β)g(\alpha) \circ \psi_a \circ v(\beta), and the square is exact just when this functor is a bijection on connected components.



Note that in the case of a square

A u B * *\array{A & \overset{u}{\to} & B\\ \downarrow && \downarrow\\ *& \underset{}{\to} & *}

this characterization reduces to saying that for any bBb\in B, the category b/ub/u 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 CuAfBC \overset{u}{\leftarrow} A \overset{f}{\to} B is precisely the cograph of the profunctor C(u,1)B(1,f)C(u,1) \circ B(1,f). 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”).

Using comma objects

Another approach is to argue as follows. First note that any comma square of the form

v/d C v * d D\array{v/d & \overset{}{\to} & C\\ \downarrow &\swArrow& \downarrow^v\\ * & \underset{d}{\to} & D}

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,

d/g * d B g D\array{d/g & \overset{}{\to} & *\\ \downarrow &\swArrow & \downarrow^d\\ B & \underset{g}{\to} & D}

must also be exact, by definition of pointwise right Kan extensions. Now suppose that a square

A f B u v C g D\array{A & \overset{f}{\to} & B\\ ^u\downarrow & \swArrow & \downarrow^v\\ C& \underset{g}{\to} & D}

is given. The Beck-Chevalley transformation u !f *g *v !u_! f^* \to g^* v_! between functors CMC\to M will be an isomorphism as soon as it is an isomorphism componentwise, i.e. when evaluated at every object of cc. In other words, we want the transformation c *u !f *c *g *v !c^* u_! f^* \to c^* g^* v_! to be an isomorphism. Now consider the composite square

u/c q A f B p u v * c C g D.\array{u/c & \overset{q}{\to} & A & \overset{f}{\to} & B\\ ^p\downarrow & \swArrow & \downarrow^u & \swArrow & \downarrow^v\\ * & \underset{c}{\to}& C & \underset{g}{\to} & D.}

Since the left-hand square is of the form considered above, it is exact, so p !q *c *u !p_! q^* \to c^* u_! is an isomorphism. Thus c *u !f *c *g *v !c^* u_! f^* \to c^* g^* v_! is an isomorphism if and only if the composite

p !q *f *c *u !f *c *g *v ! p_! q^* f^* \to c^* u_! f^* \to c^* g^* v_!

is an isomorphism, but this is just the Beck-Chevalley transformation for the composite square

u/c B v * g(c) D.\array{u/c & \overset{}{\to} & B\\ \downarrow &\swArrow & \downarrow^v\\ * & \underset{g(c)}{\to} & D.}

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 cCc\in C and bBb\in B, the square

(b/A/c) x * y v(b) * g(c) D.\array{(b/A/c) & \overset{x}{\to} & *\\ ^y\downarrow &\swArrow & \downarrow^{v(b)}\\ * & \underset{g(c)}{\to} & D.}

is exact. However, the comma square

D(v(b),g(c)) z * w v(b) * g(c) D.\array{D(v(b),g(c)) & \overset{z}{\to} & *\\ ^w\downarrow &\swArrow & \downarrow^{v(b)}\\ * & \underset{g(c)}{\to} & D.}

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 r:(b/A/c)D(v(b),g(c))r\colon (b/A/c) \to D(v(b),g(c)). Hence we have y=wry = w r and x=zrx = z r, and the Beck-Chevalley transformation for the (b/A/c)(b/A/c) square factors as

y !x *w !r !r *z *w !z *g(c) *v(b) !.y_! x^* \cong w_! r_! r^* z^* \to w_! z^* \overset{\cong}{\to} g(c)^* v(b)_!.

Hence it is an isomorphism if and only if y !x *w !z *y_! x^* \to w_! z^* is an isomorphism, which is to say that colimits of constant diagrams on (b/A/c)(b/A/c) and on D(v(b),g(c))D(v(b),g(c)) 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 π 0\pi_0. 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 (b/A/c)D(v(b),g(c))(b/A/c) \to D(v(b),g(c)) induces a weak equivalence of nerves.


Some of the early theory is in

  • René Guitart, Relations et carrés exacts, Ann. Sc. Math. Qué., juillet 1980, vol. IV, N° 2, p. 103-125.

Last revised on August 23, 2023 at 11:05:26. See the history of this page for a list of all contributions to it.