Here, at this time, we just want to give a small diagram that shows some of the relations between the categories of categories, monoids, (directed) graphs, and sets.
Mon⊂Cat↓↓Set⊂Graph Here the vertical arrows take, respectively, a monoid to its underlying set and a category to its underlying graph (i.e., they forget the composition and the specification of the identities).
The top inclusion takes a monoid into a category with just one object and that monoid as its set of arrows.
The bottom inclusion takes a set into the graph with only one vertex and that set as its set of edges.
Both vertical (downward) arrows have left adjoints going up, taking respectively a set to the free monoid on that set and a graph to the free category on that graph.
Following is work in progress!
Here are two diagrams, one for ordinals and the other for internal categories:
{1}↙↘{0,1}{1,2}↗↘↙↖{0,1,2}↑{0}→{0,2}←{2} | C0↗↖C1C1↙↖↗↘C2↓C0←C1→C0 |
No comments:
Post a Comment