path category



One can view the concept of a morphism or arrow in a category as an extreme abstraction of the concept of a spatial trajectory. It therefore comes with no surprise that (notions of) paths stemming from various conceptualizations of ‘space’ like e.g. quivers or topological spaces arrange themselves in appropriate categories thereby giving rise to several different notions of path category.

Free category on a directed graph

There is a forgetful functor from small strict categories to quivers. This forgetful functor has a left adjoint, giving the free category or path category of a quiver, whose objects are the vertices of the quiver. The morphisms from aa to bb in this free category are not merely the arrows from aa to bb in the quiver but instead are lists of the form (a n,f n,a n1,,a 1,f 1,a 0)(a_n,f_n,a_{n-1},\ldots,a_{1},f_1,a_0) where n0n \geq 0 is a natural number, a 0,a 1,,a na_0,a_1,\ldots,a_n are vertices of the graph, a=a 0a = a_0, b=a nb = a_n, and for all 0<in0 \lt i \leq n, f i:a i1a if_i\colon a_{i-1} \to a_i is an edge from a i1a_{i-1} to a ia_i. The composition is given by the concatenation

(a n,f n,a n1,,a 1,f 1,a 0)(b m,g m,a m1,,b 1,g 1,b 0):=(a n,f n,a n1,,a 1,f 1,a 0=b m,g m,a m1,,b 1,g 1,b 0)(a_n,f_n,a_{n-1},\ldots,a_{1},f_1,a_0)\circ (b_m,g_m,a_{m-1},\ldots,b_{1},g_1,b_0) := (a_n,f_n,a_{n-1},\ldots,a_{1},f_1,a_0= b_m,g_m,a_{m-1},\ldots,b_{1},g_1,b_0)

whenever a 0=b ma_0 = b_m, and the target and source maps are given by s(a n,f n,a n1,,a 1,f 1,a 0)=a 0s(a_n,f_n,a_{n-1},\ldots,a_{1},f_1,a_0)=a_0 and t(a n,f n,a n1,,a 1,f 1,a 0)=a nt(a_n,f_n,a_{n-1},\ldots,a_{1},f_1,a_0) = a_n. One informally writes ff for the morphism (b,f,a):ab(b,f,a)\colon a \to b in the free category and the identities of the free category are id a=(a,a)id_a = (a,a); thus

f nf n1f 1=(t(f n),f n,t(f n1),,t(f 1),f 1,s(f 1)). f_n \circ f_{n-1} \circ \ldots \circ f_1 = (t(f_n),f_n,t(f_{n-1}),\ldots,t(f_1),f_1,s(f_1))\quad .


With free objects, one is often primarily interested in taking quotients whence a free category over a graph is usually a somewhat auxiliary gadget its main interest lying in the role it plays in defining categories of fractions (cf. Gabriel-Zisman 1967 pp.1,6; probably the original source of the path category in this sense).

But similar techniques apply to various notions of graphs or more restricted classes of categories with forgetful functors to graphs permitting to syntactically generate various notions of free categories with extra structure and in some of these cases it occurs that the corresponding free category (of paths) is indeed interesting in itself e.g. the free topos arises this way and the syntactic derivations of context free grammars arrange themselves into such categories of paths as explored in Walters (1989a,1989b) or Latch (1991).

Path category of a space

Given a topological space XX (or some other kind of space with a notion of maps from intervals into it), there are various ways to obtain a small strict category whose objects are the points of XX and whose morphisms are paths in XX. This is also often called a path category.

  • In particular, for every topological space there is its fundamental groupoid whose morphisms are homotopy classes of paths in XX.

  • If XX is a directed space there is a notion of path category called the fundamental category of XX.

  • When XX is a smooth space, there is a notion of path category where less than homotopy of paths is divided out: just thin homotopy. This yields a notion of path groupoid.

  • If parameterized paths are used, there is a way to get a category of paths without dividing out any equivalence relation: this is the Moore path category.

Arrow category

Given a category XX, the functor category [I,X][I,X] for II the interval category might be called a “directed path category of XX” (similar to path space). However, this functor category is referred to instead as the arrow category of XX and sometimes even denoted Arr(X)Arr(X).


The free category on a graph has a section in

  • Francis Borceux, Handbook of categorical Algebra vol. 1 , Cambridge UP 1994.

or in

The following is another source for this, in fact, even an open source:

The path categories of context free grammars are explored in

  • Dana Latch, The connection between the fundamental groupoid and a unification algorithm for syntactil algebras (extended abstract) , Cah. Top. Géom. Diff. Cat. XXXII (1991). (link)

  • Bob Walters, The free category with products on a multigraph , JPAA 62 (1989). (link)

  • Bob Walters, A note on context-free languages , JPAA 62 (1989). (link)

Since the perspective on categories as ‘graphs with operations’ is closely related to their ‘logico-deductive’ side, it figures prominently in the work of Jim Lambek and Phil Scott (cf. the references at free topos).

Revised on June 2, 2016 08:15:10 by Thomas Holder (