Factorization systems and double categories
Abstract: We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category of small categories and cofunctors admit orthogonal factorization systems. The theory also gives an explicit description of various lax morphism classifiers and explains why they admit strict factorization systems.
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.