2025/09/30 by C. B. Aberlé, Aberlé, C. B., Elena Caviglia +11
Computer Science · Engineering · #18A32 #18B10 #18C15 (Secondary) #18N10 (Primary) #Category Theory (math.CT) #FOS: Mathematics #Matrix Theory and Algorithms #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2509.26343
openalex publication_date 2025/09/30 · openalex created_date 2025/10/19 · openalex updated_date 2026/07/28
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by several explicit examples, including factorization systems on double categories of spans, relations and bimodules. We then prove monadicity results for orthogonal factorization systems on double categories in order to justify our definitions. For fibrant double categories we discuss the structure of the double orthogonal factorization systems that have a given orthogonal factorization system on the arrows in common. Finally, we study the interaction of orthogonal factorization systems on double categories with double fibrations.