Year: 2026
Type: preprint
Abstract: Toward modeling computational concurrency using the language of central idempotents in monoidal categories, we give an explicit construction of the pushout of strict symmetric monoidal categories with strong monoidal functors between them. We show that any braided strong monoidal functor strongly preserves central idempotents, and as a corollary, that the lattice of central idempotents of a symmetric monoidal category is isomorphic as a meet-semilattice to that of its strictification.
Source: arXiv (Cornell University)
Institutions: Oregon State University, University of Maryland, College Park
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7212085414