Math 2.0

Category theory; homological algebra Definition

Free category

Builds on Directed graphWalkCategoryFunctorFree monoid

Definition

Let GG be a directed graph, allowed to have loops and several edges between two vertices. Each edge ee of GG has a source vertex s(e)s(e) and a target vertex t(e)t(e). A path from xx to yy of length n≥1n \ge 1 is a sequence (e1,…,en)(e_1, \dots, e_n) of edges with s(e1)=xs(e_1) = x, t(en)=yt(e_n) = y and t(ei)=s(ei+1)t(e_i) = s(e_{i+1}) for 1≤i<n1 \le i < n. Vertices and edges may repeat, as in a directed walk. For each vertex xx there is also an empty path of length 00 from xx to xx. The free category F(G)F(G) on GG is the category whose objects are the vertices of GG. Its morphisms x→yx \to y are the paths from xx to yy. 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 F(G)F(G) is a category. It has the universal property of a free object: for every category 𝒞\mathcal{C}, each graph morphism from GG to the underlying graph of 𝒞\mathcal{C} extends to exactly one functor F(G)→𝒞F(G) \to \mathcal{C}.

Example: let GG have one vertex and one loop aa. The paths are an=(a,…,a)a^n = (a, \dots, a) with n≥0n \ge 0 letters, and am∘an=am+na^m \circ a^n = a^{m + n}, so F(G)F(G) is the one-object category of the monoid (ℕ,+)(\N, +), the free monoid on one generator.

Non-example: the category with one object and morphisms ℤ/2ℤ\Z/2\Z is generated by one loop aa, but it satisfies a∘a=id⁡a \circ a = \id. In the free category on one loop, a∘aa \circ a has length 22 and the identity has length 00, so they differ. So the category of ℤ/2ℤ\Z/2\Z 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Category concept
  2. Directed graph concept
  3. Free monoid concept
  4. Functor concept
  5. Walk concept
  6. Free category definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Free_category
About this page
TagFN6P3CTPTS
URIm2://FN6P3CTPTS
Kinddefinition
WritingW0 stub
MSC18A10, 18A40
DefinesFree category
UsesDirected 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.