Thin Category with an Extremal Generator
Suppose is an object of a thin category. Then is an extremal generator if and only if for every object , either or every morphism with codomain is an isomorphism.
Proof. () Since the category is thin, is either a singleton or empty. In the first case, let . Then is automatically a bijection since is also a singleton, implying that is an isomorphism.
In the second case, suppose we have a morphism . Then is a function with empty codomain, so it is automatically a bijection, implying that is an isomorphism.
() Since the category is thin, any object is automatically a generator. Now suppose we have a morphism such that is a bijection. Then by assumption, either or every morphism with codomain is an isomorphism. In the first case, is non-empty, so is also non-empty. We also have is non-empty. Therefore, is non-empty, and the (necessarily unique) morphism is automatically an inverse to . In the second case, is already a morphism with codomain so it is an isomorphism.
For a poset , the corresponding thin category has an extremal generator if and only if is non-empty and it has at most one non-minimal element. In particular, if this is the case, then either the poset is discrete, in which case any element gives an extremal generator; or otherwise, there is exactly one non-minimal element which is the unique extremal generator.
Proof. In a thin category coming from a poset, the condition in the previous lemma that every morphism with codomain is an isomorphism is equivalent to the corresponding element of the poset being minimal.
Author: Daniel Schepler
Context
This page is referenced by the following categories.