CatDat

Construction of Generators

Lemma.

In a category let SS be a generating set which is strongly connected, i.e. between any two objects G,GSG,G' \in S there is a morphism GGG \to G'. If the coproduct UGSGU \coloneqq \coprod_{G \in S} G exists, then it is a generator. Moreover, if SS is an extremal generating set, then UU is an extremal generator.

Proof. We remark that the assumption on SS implies that each coprojection iG:GUi_G : G \to U has a left inverse. Now let f,g:ABf,g : A \rightrightarrows B be two morphisms with faˉ=gaˉf \circ \bar a = g \circ \bar a for all aˉ:UA\bar a : U \to A. If GSG \in S, any morphism GAG \to A extends to UU by our preliminary remark. Thus, fa=gaf \circ a = g \circ a holds for all morphisms a:GAa : G \to A with GSG \in S. Since SS is a generating set, this implies f=gf = g.

Similarly, for the case where SS is an extremal generating set, suppose we have a morphism f:ABf : A \to B such that f:Hom(U,A)Hom(U,B)f \circ {-} : \Hom(U, A) \to \Hom(U, B) is a bijection. In particular, because it is injective and UU is a generator, we can conclude that ff is a monomorphism, so f:Hom(G,A)Hom(G,B)f \circ {-} : \Hom(G, A) \to \Hom(G, B) is injective for each GSG \in S. Now suppose bHom(G,B)b \in \Hom(G, B) for GSG \in S. Then bb extends to a morphism bˉ:UB\bar b : U \to B. By assumption, there exists aˉ:UA\bar a : U \to A such that faˉ=bˉf \circ \bar a = \bar b. Composing with the coprojection iG:GUi_G : G \to U, we see faˉiG=bˉiG=b.f \circ \bar a \circ i_G = \bar b \circ i_G = b. This shows that f:Hom(G,A)Hom(G,B)f \circ {-} : \Hom(G, A) \to \Hom(G, B) is also surjective for each GSG \in S. Since SS is an extremal generating set, this implies ff is an isomorphism. \square

Authors: Martin Brandenburg, Daniel Schepler

Context

This page is referenced by the following categories.

This page is referenced by the following implications.