Computing left Kan extensions. (Q1426132): Difference between revisions

The paper by \textit{S.~Carmody} and \textit{R.~F.~C.~Walters} [in: Category theory, Proc. Int. Conf., Como/Italy 1990, Lect. Notes Math. 1488, 63--78 (1991; Zbl 0737.18001)] generalized the Todd-Coxeter algorithm for enumerating cosets of finite groups to a computation of left Kan extensions. This paper simplifies this version of algorithm and the proof of its correctness. This algorithm for finitely presented functors \(X:{\mathcal A}\to {\mathcal S}et\) and \(F:{\mathcal A}\to{\mathcal B}\) computes a finitely presented functor \(P:{\mathcal B}\to{\mathcal S}et\) and a natural transformation from \( X\) into \(P\circ F\).