CatDat

Construction of Generators

Lemma.

In a category let SS be a generating set which is strongly connected (between any two objects in SS there is a morphism). If the coproduct UGSGU \coloneqq \coprod_{G \in S} G exists, then it is a generator.

Proof. This is a straight forward generalization of this result. We remark that the assumption about SS implies that each inclusion GUG \to U has a left inverse. Now let f,g:ABf,g : A \rightrightarrows B be two morphisms with fh=ghf h = g h for all h:UAh : U \to A. If GSG \in S, any morphism GAG \to A extends to UU by our preliminary remark. Thus, fh=ghfh = gh holds for all h:GAh : G \to A and GSG \in S. Since SS is a generating set, this implies f=gf = g. \square

Author: Martin Brandenburg

Context

This page is referenced by the following categories.