You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I read that every accessible category is sketchable. So, I'm looking to construct the sketch for simple categories, based on the presentation given in Sketches of an Elephant.
If we consider the category with two objects and no nontrivial morphisms (discrete category), what should its sketch be? More generally, for a free category on a given graph, is there an algorithm to get the corresponding sketch?
The proof of the general result in prop. 2.3.8 does seem too abstract to be usable in practice as a construction mechanism
Here's a sketch for the two-object discrete category. It has objects , arrows , is required to be a limit (terminal object), a colimit cone. Then a model of this sketch must send to a terminal object, while are sent to sets whose coproduct is (there are two options). That gives a category of models equivalent to the two-object discrete category, and you can see how to generalize it to an -object category. I think it generalizes a little further to accessible posets, but I'll let you figure out the extent to which that's true.