PRESENTATIONS OF CLUSTERS AND STRICT FREE-COCOMPLETIONS

Abstract : The clusters considered in this paper are seen as morphisms between small arbitrary diagrams in a given locally small category C. They have initially been introduced to extend to all small diagrams the results for filtered diagrams, by exhibiting a very basic presentation of the formula used in the definition of the category Ind(C) of ind-objects in C. They constitute a category Clu (C) which contains Ind(C). We study these clusters, their construction and composition. Thus we provide any user with the means to generate clusters and perform calculations with them. So we can give a simple proof of the fact that Clu (C) is a strict free cocompletion of C for all small diagrams, determined up to isomorphism. We compare it to some other cocompletion problems.