\documentclass[12pt,titlepage]{article} \usepackage{amsmath} \usepackage{mathrsfs} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{graphicx} \usepackage{color} \usepackage{ucs} \usepackage[utf8x]{inputenc} \usepackage{xparse} \usepackage{hyperref} %----Macros---------- % % Unresolved issues: % % \righttoleftarrow % \lefttorightarrow % % \color{} with HTML colorspec % \bgcolor % \array with options (without options, it's equivalent to the matrix environment) % Of the standard HTML named colors, white, black, red, green, blue and yellow % are predefined in the color package. Here are the rest. \definecolor{aqua}{rgb}{0, 1.0, 1.0} \definecolor{fuschia}{rgb}{1.0, 0, 1.0} \definecolor{gray}{rgb}{0.502, 0.502, 0.502} \definecolor{lime}{rgb}{0, 1.0, 0} \definecolor{maroon}{rgb}{0.502, 0, 0} \definecolor{navy}{rgb}{0, 0, 0.502} \definecolor{olive}{rgb}{0.502, 0.502, 0} \definecolor{purple}{rgb}{0.502, 0, 0.502} \definecolor{silver}{rgb}{0.753, 0.753, 0.753} \definecolor{teal}{rgb}{0, 0.502, 0.502} % Because of conflicts, \space and \mathop are converted to % \itexspace and \operatorname during preprocessing. % itex: \space{ht}{dp}{wd} % % Height and baseline depth measurements are in units of tenths of an ex while % the width is measured in tenths of an em. \makeatletter \newdimen\itex@wd% \newdimen\itex@dp% \newdimen\itex@thd% \def\itexspace#1#2#3{\itex@wd=#3em% \itex@wd=0.1\itex@wd% \itex@dp=#2ex% \itex@dp=0.1\itex@dp% \itex@thd=#1ex% \itex@thd=0.1\itex@thd% \advance\itex@thd\the\itex@dp% \makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}} \makeatother % \tensor and \multiscript \makeatletter \newif\if@sup \newtoks\@sups \def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}% \def\reset@sup{\@supfalse\@sups={}}% \def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else% \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}% \else \append@sup#2 \@suptrue \fi% \expandafter\mk@scripts\fi} \def\tensor#1#2{\reset@sup#1\mk@scripts#2_/} \def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2% \reset@sup\mk@scripts#3_/} \makeatother % \slash \makeatletter \newbox\slashbox \setbox\slashbox=\hbox{$/$} \def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$} \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa \copy\slashbox \kern-\@tempdima \box\@tempboxa} \def\slash{\protect\itex@pslash} \makeatother % math-mode versions of \rlap, etc % from Alexander Perlis, "A complement to \smash, \llap, and lap" % http://math.arizona.edu/~aprl/publications/mathclap/ \def\clap#1{\hbox to 0pt{\hss#1\hss}} \def\mathllap{\mathpalette\mathllapinternal} \def\mathrlap{\mathpalette\mathrlapinternal} \def\mathclap{\mathpalette\mathclapinternal} \def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}} \def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}} \def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}} % Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2} \let\oldroot\root \def\root#1#2{\oldroot #1 \of{#2}} \renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}} % Manually declare the txfonts symbolsC font \DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n} \SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n} \DeclareFontSubstitution{U}{txsyc}{m}{n} % Manually declare the stmaryrd font \DeclareSymbolFont{stmry}{U}{stmry}{m}{n} \SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n} % Manually declare the MnSymbolE font \DeclareFontFamily{OMX}{MnSymbolE}{} \DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n} \SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n} \DeclareFontShape{OMX}{MnSymbolE}{m}{n}{ <-6> MnSymbolE5 <6-7> MnSymbolE6 <7-8> MnSymbolE7 <8-9> MnSymbolE8 <9-10> MnSymbolE9 <10-12> MnSymbolE10 <12-> MnSymbolE12}{} % Declare specific arrows from txfonts without loading the full package \makeatletter \def\re@DeclareMathSymbol#1#2#3#4{% \let#1=\undefined \DeclareMathSymbol{#1}{#2}{#3}{#4}} \re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46} \re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12} \re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64} \re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6} \re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77} \re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77} \makeatother % \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE \makeatletter \def\Decl@Mn@Delim#1#2#3#4{% \if\relax\noexpand#1% \let#1\undefined \fi \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}} \def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}} \def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}} \Decl@Mn@Open{\llangle}{mnomx}{'164} \Decl@Mn@Close{\rrangle}{mnomx}{'171} \Decl@Mn@Open{\lmoustache}{mnomx}{'245} \Decl@Mn@Close{\rmoustache}{mnomx}{'244} \makeatother % Widecheck \makeatletter \DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}} \def\@widecheck#1#2{% \setbox\z@\hbox{\m@th$#1#2$}% \setbox\tw@\hbox{\m@th$#1% \widehat{% \vrule\@width\z@\@height\ht\z@ \vrule\@height\z@\@width\wd\z@}$}% \dp\tw@-\ht\z@ \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@ \setbox\tw@\hbox{% \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box \tw@}}}% {\ooalign{\box\tw@ \cr \box\z@}}} \makeatother % \mathraisebox{voffset}[height][depth]{something} \makeatletter \NewDocumentCommand\mathraisebox{moom}{% \IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{% \IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}% }{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}% \mathpalette\@temp{#4}} \makeatletter % udots (taken from yhmath) \makeatletter \def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.} \mkern2mu\raise4\p@\hbox{.}\mkern1mu \raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}} \makeatother %% Fix array \newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}} %% \itexnum is a noop \newcommand{\itexnum}[1]{#1} %% Renaming existing commands \newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}} \newcommand{\widevec}{\overrightarrow} \newcommand{\darr}{\downarrow} \newcommand{\nearr}{\nearrow} \newcommand{\nwarr}{\nwarrow} \newcommand{\searr}{\searrow} \newcommand{\swarr}{\swarrow} \newcommand{\curvearrowbotright}{\curvearrowright} \newcommand{\uparr}{\uparrow} \newcommand{\downuparrow}{\updownarrow} \newcommand{\duparr}{\updownarrow} \newcommand{\updarr}{\updownarrow} \newcommand{\gt}{>} \newcommand{\lt}{<} \newcommand{\map}{\mapsto} \newcommand{\embedsin}{\hookrightarrow} \newcommand{\Alpha}{A} \newcommand{\Beta}{B} \newcommand{\Zeta}{Z} \newcommand{\Eta}{H} \newcommand{\Iota}{I} \newcommand{\Kappa}{K} \newcommand{\Mu}{M} \newcommand{\Nu}{N} \newcommand{\Rho}{P} \newcommand{\Tau}{T} \newcommand{\Upsi}{\Upsilon} \newcommand{\omicron}{o} \newcommand{\lang}{\langle} \newcommand{\rang}{\rangle} \newcommand{\Union}{\bigcup} \newcommand{\Intersection}{\bigcap} \newcommand{\Oplus}{\bigoplus} \newcommand{\Otimes}{\bigotimes} \newcommand{\Wedge}{\bigwedge} \newcommand{\Vee}{\bigvee} \newcommand{\coproduct}{\coprod} \newcommand{\product}{\prod} \newcommand{\closure}{\overline} \newcommand{\integral}{\int} \newcommand{\doubleintegral}{\iint} \newcommand{\tripleintegral}{\iiint} \newcommand{\quadrupleintegral}{\iiiint} \newcommand{\conint}{\oint} \newcommand{\contourintegral}{\oint} \newcommand{\infinity}{\infty} \newcommand{\bottom}{\bot} \newcommand{\minusb}{\boxminus} \newcommand{\plusb}{\boxplus} \newcommand{\timesb}{\boxtimes} \newcommand{\intersection}{\cap} \newcommand{\union}{\cup} \newcommand{\Del}{\nabla} \newcommand{\odash}{\circleddash} \newcommand{\negspace}{\!} \newcommand{\widebar}{\overline} \newcommand{\textsize}{\normalsize} \renewcommand{\scriptsize}{\scriptstyle} \newcommand{\scriptscriptsize}{\scriptscriptstyle} \newcommand{\mathfr}{\mathfrak} \newcommand{\statusline}[2]{#2} \newcommand{\tooltip}[2]{#2} \newcommand{\toggle}[2]{#2} % Theorem Environments \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{lemma}{Lemma} \newtheorem{prop}{Proposition} \newtheorem{cor}{Corollary} \newtheorem*{utheorem}{Theorem} \newtheorem*{ulemma}{Lemma} \newtheorem*{uprop}{Proposition} \newtheorem*{ucor}{Corollary} \theoremstyle{definition} \newtheorem{defn}{Definition} \newtheorem{example}{Example} \newtheorem*{udefn}{Definition} \newtheorem*{uexample}{Example} \theoremstyle{remark} \newtheorem{remark}{Remark} \newtheorem{note}{Note} \newtheorem*{uremark}{Remark} \newtheorem*{unote}{Note} %------------------------------------------------------------------- \begin{document} %------------------------------------------------------------------- \section*{exact square} \hypertarget{context}{}\subsubsection*{{Context}}\label{context} \hypertarget{category_theory}{}\paragraph*{{Category theory}}\label{category_theory} [[!include category theory - contents]] \hypertarget{exact_squares}{}\section*{{Exact squares}}\label{exact_squares} \noindent\hyperlink{definition}{Definition}\dotfill \pageref*{definition} \linebreak \noindent\hyperlink{generalizations}{Generalizations}\dotfill \pageref*{generalizations} \linebreak \noindent\hyperlink{examples}{Examples}\dotfill \pageref*{examples} \linebreak \noindent\hyperlink{comma_squares}{Comma squares}\dotfill \pageref*{comma_squares} \linebreak \noindent\hyperlink{fully_faithful_functors}{Fully faithful functors}\dotfill \pageref*{fully_faithful_functors} \linebreak \noindent\hyperlink{final_functors}{Final functors}\dotfill \pageref*{final_functors} \linebreak \noindent\hyperlink{adjunctions}{Adjunctions}\dotfill \pageref*{adjunctions} \linebreak \noindent\hyperlink{characterization}{Characterization}\dotfill \pageref*{characterization} \linebreak \noindent\hyperlink{using_profunctors}{Using profunctors}\dotfill \pageref*{using_profunctors} \linebreak \noindent\hyperlink{examples_2}{Examples}\dotfill \pageref*{examples_2} \linebreak \noindent\hyperlink{CommaObj}{Using comma objects}\dotfill \pageref*{CommaObj} \linebreak \hypertarget{definition}{}\subsection*{{Definition}}\label{definition} Let $A$, $B$, $C$, and $D$ be (usually small) [[categories]], and consider a square of [[functors]] \begin{displaymath} \itexarray{A & \overset{f}{\to} & B\\ ^u\downarrow & \swArrow & \downarrow^v\\ C& \underset{g}{\to} & D} \end{displaymath} which is inhabited by a [[natural transformation]] (which might be an [[identity]]). This is said to be an \textbf{exact square} if the canonical [[Beck-Chevalley transformation]] \begin{displaymath} u_! f^* \to g^* v_!, \end{displaymath} relating functors with values in some other category $M$, is always an isomorphism. Here $f^*\colon M^B\to M^A$ and $g^*\colon M^D\to M^C$ denote precomposition with $f$ and $g$ respectively, and $u_!\colon M^A\to M^C$ and $v_!\colon M^B\to M^D$ denote pointwise left [[Kan extensions]] along $u$ and $v$. The Beck-Chevalley transformation is defined to be the composite \begin{displaymath} u_! f^* \to u_! f^* v^* v_! \to u_! u^* g^* v_! \to g^* v_!. \end{displaymath} By the general calculus of [[mates]], this definition is equivalent to requiring that the dual transformation \begin{displaymath} v^* g_* \to f_* u^* \end{displaymath} is an isomorphism, where $f_*$ and $g_*$ denote pointwise \emph{right} Kan extensions. This definition refers to Kan extensions of diagrams with values in any category $M$ (whenever such Kan extensions exist). If a square is exact only relative to diagrams defined in a \emph{particular} category $M$, we may call it \textbf{$M$-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. \hypertarget{generalizations}{}\subsection*{{Generalizations}}\label{generalizations} 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: \begin{itemize}% \item Internal [[pointwise Kan extension]]s in any [[2-category]] with finite [[2-limits]]. \item Enriched pointwise Kan extensions in a 2-category $V Cat$ of [[enriched categories]]. Note that this notion of ``pointwiseness'' is not the ``internal'' one in $V Cat$; see \href{Kan+extension#In2cat}{here} for a counterexample. \item Pointwise Kan extensions can also be defined in any [[Yoneda structure]], and more or less equivalently in any [[2-category equipped with proarrows]]. This specializes both to the classical case, to internal pointwise extensions in a 2-category, and to the enriched case. \item In the world of [[(infinity,1)-categories]] we have a notion of [[homotopy exact square]], which can also be defined and characterized in the easier context of [[derivators]]. In fact, one can argue that derivators are basically designed as a context for the study of homotopy exact squares. \end{itemize} 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. \hypertarget{examples}{}\subsection*{{Examples}}\label{examples} \hypertarget{comma_squares}{}\subsubsection*{{Comma squares}}\label{comma_squares} In ordinary category theory, any [[comma square]] is always exact. In other words, if $A$ is the [[comma category]] $(v/g)$, with $f$ and $u$ the canonical projections, then the square is exact. If additionally $C=*$ is the [[terminal category]], then $g$ simply picks out an object $d\in D$, and $A=v/d$ is the comma category of $v$ over $d$. Exactness of this square then says that the value of $v_! F$ at $d\in D$ is the colimit of $F$ pulled back to $v/d$, i.e. \begin{displaymath} (Lan_v F)(d) = colim_{v(b) \to d} F(b) \end{displaymath} 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. \hypertarget{fully_faithful_functors}{}\subsubsection*{{Fully faithful functors}}\label{fully_faithful_functors} A functor $u\colon A\to B$ is a [[fully faithful functor]] if and only if the square \begin{displaymath} \itexarray{A & \overset{id}{\to} & A\\ ^{id}\downarrow && \downarrow^u\\ A & \underset{u}{\to} & B} \end{displaymath} is exact. This just says that the unit $Id_A \to u^* u_!$ is an isomorphism, i.e. that left (and equivalently right) Kan extensions along $u$ are ``honest'' extensions. \hypertarget{final_functors}{}\subsubsection*{{Final functors}}\label{final_functors} A functor $u\colon A\to B$ is a [[final functor]] if and only if the square \begin{displaymath} \itexarray{A & \overset{u}{\to} & B\\ \downarrow && \downarrow\\ *& \underset{}{\to} & *} \end{displaymath} is exact. Exactness of this square says that for $F\colon B\to M$, the canonical map $colim_A u^*F \to colim_B F$ is an isomorphism, which is one equivalent definition of when $u$ is final. \hypertarget{adjunctions}{}\subsubsection*{{Adjunctions}}\label{adjunctions} A functor $f: A \to B$ is left adjoint to $u: B \to A$ with unit $\eta: 1_A \implies uf$ if and only if the square \begin{displaymath} \itexarray{A & \overset{id}{\to} & A \\ ^f\downarrow & ^\eta\swArrow & \downarrow^{id}\\ B& \underset{u}{\to} & D} \end{displaymath} is exact. Dually, $f \dashv u$ with counit $\varepsilon: fu \implies 1_B$ if and only if the square \begin{displaymath} \itexarray{B & \overset{u}{\to} & A\\ ^{id}\downarrow & ^\varepsilon \swArrow & \downarrow^f\\ B& \underset{id}{\to} & B} \end{displaymath} is exact. \hypertarget{characterization}{}\subsection*{{Characterization}}\label{characterization} Exact squares can be characterized in several ways, which generalize in different directions. \hypertarget{using_profunctors}{}\subsubsection*{{Using profunctors}}\label{using_profunctors} Recall that for any functor $u\colon A\to C$, the left Kan extension $u_!$ can be computed as the colimit weighted by the corepresentable profunctor $C(u,1)$, while restriction $u^*$ along $u$ is the colimit weighted by the representable profunctor $C(1,u)$. Moreover, given composable profunctors $H$ and $K$, an $H K$-weighted colimit is the same as a $K$-weighted colimit of an $H$-weighted colimit. Therefore, $u_! f^*$ can be computed as a $C(u,1) \circ B(1,f)$-weighted colimit, while $g^* v_!$ can be computed as a $D(1,g) \circ D(v,1)$-weighted colimit. Note that $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 \begin{displaymath} C(u,1) \circ B(1,f) \to D(v,g) \end{displaymath} is an isomorphism. Moreover, by considering colimits of the Yoneda embedding $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 $b\in B$ and $c\in C$, the function \begin{displaymath} \int^{a\in A} C(u(a),c) \times B(b,f(a)) \to D(v(b), g(c)) \end{displaymath} 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 $\psi \colon g u \to v f$ the given 2-cell, we have \begin{enumerate}% \item For any morphism $\varphi\colon v(b) \to g(c)$ in $D$, there exists an $a\in A$ and morphisms $\alpha\colon u(a) \to c$ and $\beta\colon b\to f(a)$ such that $g(\alpha) \circ \psi_a \circ v(\beta) = \varphi$, and \item For any $(a,\alpha,\beta)$ and $(a',\alpha',\beta')$ as above with $g(\alpha) \circ \psi_a \circ v(\beta) = g(\alpha') \circ \psi_{a'} \circ v(\beta')$, there is a [[zigzag]] of arrows connecting $a$ to $a'$ and rendering the evident induced diagram commutative. \end{enumerate} We can state this equivalently as follows. Given $b\in B$ and $c\in C$, define $(b/A/c)$ to be the category whose objects are triples $(a,\alpha,\beta)$ with $\alpha\colon u(a) \to c$ and $\beta\colon b\to f(a)$, and whose morphisms are morphisms $a\to a'$ making two triangles commute. There is a functor \begin{displaymath} (b/A/c) \to D(v(b),g(c)) \end{displaymath} (considering the latter [[homset]] as a [[discrete category]]) which sends $(a,\alpha,\beta)$ to the composite $g(\alpha) \circ \psi_a \circ v(\beta)$, and the square is exact just when this functor is a bijection on [[connected component]]s. \hypertarget{examples_2}{}\paragraph*{{Examples}}\label{examples_2} \begin{uexample} Note that in the case of a square \begin{displaymath} \itexarray{A & \overset{u}{\to} & B\\ \downarrow && \downarrow\\ *& \underset{}{\to} & *} \end{displaymath} this characterization reduces to saying that for any $b\in B$, the category $b/u$ is connected. This is the standard combinatorial characterization of a [[final functor]]. \end{uexample} \begin{uexample} This characterization implies directly that any [[cocomma square]] is exact, since the cocomma object of a cospan $C \overset{u}{\leftarrow} A \overset{f}{\to} B$ is precisely the [[cograph of a profunctor|cograph]] of the profunctor $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''). \end{uexample} \hypertarget{CommaObj}{}\subsubsection*{{Using comma objects}}\label{CommaObj} Another approach is to argue as follows. First note that any comma square of the form \begin{displaymath} \itexarray{v/d & \overset{}{\to} & C\\ \downarrow &\swArrow& \downarrow^v\\ * & \underset{d}{\to} & D} \end{displaymath} 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, \begin{displaymath} \itexarray{d/g & \overset{}{\to} & *\\ \downarrow &\swArrow & \downarrow^d\\ B & \underset{g}{\to} & D} \end{displaymath} must also be exact, by definition of pointwise right Kan extensions. Now suppose that a square \begin{displaymath} \itexarray{A & \overset{f}{\to} & B\\ ^u\downarrow & \swArrow & \downarrow^v\\ C& \underset{g}{\to} & D} \end{displaymath} is given. The Beck-Chevalley transformation $u_! f^* \to g^* v_!$ between functors $C\to M$ will be an isomorphism as soon as it is an isomorphism componentwise, i.e. when evaluated at every object of $c$. In other words, we want the transformation $c^* u_! f^* \to c^* g^* v_!$ to be an isomorphism. Now consider the composite square \begin{displaymath} \itexarray{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.} \end{displaymath} Since the left-hand square is of the form considered above, it is exact, so $p_! q^* \to c^* u_!$ is an isomorphism. Thus $c^* u_! f^* \to c^* g^* v_!$ is an isomorphism if and only if the composite \begin{displaymath} p_! q^* f^* \to c^* u_! f^* \to c^* g^* v_! \end{displaymath} is an isomorphism, but this is just the Beck-Chevalley transformation for the composite square \begin{displaymath} \itexarray{u/c & \overset{}{\to} & B\\ \downarrow &\swArrow & \downarrow^v\\ * & \underset{g(c)}{\to} & D.} \end{displaymath} 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 $c\in C$ and $b\in B$, the square \begin{displaymath} \itexarray{(b/A/c) & \overset{x}{\to} & *\\ ^y\downarrow &\swArrow & \downarrow^{v(b)}\\ * & \underset{g(c)}{\to} & D.} \end{displaymath} is exact. However, the comma square \begin{displaymath} \itexarray{D(v(b),g(c)) & \overset{z}{\to} & *\\ ^w\downarrow &\swArrow & \downarrow^{v(b)}\\ * & \underset{g(c)}{\to} & D.} \end{displaymath} 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\colon (b/A/c) \to D(v(b),g(c))$. Hence we have $y = w r$ and $x = z r$, and the Beck-Chevalley transformation for the $(b/A/c)$ square factors as \begin{displaymath} y_! x^* \cong w_! r_! r^* z^* \to w_! z^* \overset{\cong}{\to} g(c)^* v(b)_!. \end{displaymath} Hence it is an isomorphism if and only if $y_! x^* \to w_! z^*$ is an isomorphism, which is to say that colimits of constant diagrams on $(b/A/c)$ and on $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 $\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) \to D(v(b),g(c))$ induces a weak equivalence of nerves. [[!redirects exact squares]] \end{document}