2000 character limit reached
On The Existence Of Category Bicompletions
Published 28 Sep 2009 in math.CT and math.AC | (0909.5010v1)
Abstract: A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the validity of the result would lead to the existence of an Isbell-Lambek bicompletion C(A) of such an A, without a "change-of-universe" procedure being necessary to describe or discuss the bicompletion.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.