Category theory; homological algebra Definition
Free category
Definition
Let be a directed graph, allowed to have loops and several edges between two vertices. Each edge of has a source vertex and a target vertex . A path from to of length is a sequence of edges with , and for . Vertices and edges may repeat, as in a directed walk. For each vertex there is also an empty path of length from to . The free category on is the category whose objects are the vertices of . Its morphisms are the paths from to . Composition is concatenation of paths, and the identities are the empty paths.
Remarks
Concatenation is associative and the empty paths are units for it, so is a category. It has the universal property of a free object: for every category , each graph morphism from to the underlying graph of extends to exactly one functor .
Example: let have one vertex and one loop . The paths are with letters, and , so is the one-object category of the monoid , the free monoid on one generator.
Non-example: the category with one object and morphisms is generated by one loop , but it satisfies . In the free category on one loop, has length and the identity has length , so they differ. So the category of is not free on that graph.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Category concept
- Directed graph concept
- Free monoid concept
- Functor concept
- Walk concept
- Free category definition
Further reading
About this page
| Tag | FN6P3CTPTS |
|---|---|
| URI | m2://FN6P3CTPTS |
| Kind | definition |
| Writing | W0 stub |
| MSC | 18A10, 18A40 |
| Defines | Free category |
| Uses | Directed graph, Walk, Category, Functor, Free monoid |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.