Year: 2026
Type: article
Abstract: We study the composite free completion $$ \textsf{Dist}(\mathcal {C}):=\textsf{Fam}\!\bigl (\textsf{Fam}(\mathcal {C}^{op})^{op}\bigr ), $$ Dist ( C ) : = Fam ( Fam ( C op ) op ) , obtained by first freely adjoining small products and then freely adjoining small coproducts. A natural pseudodistributive law equips this endo-pseudofunctor with a composite pseudomonad structure. Its pseudoalgebras are precisely the categories with small products and small coproducts in which small products distribute over small coproducts. We call such categories doubly-infinitary distributive . This condition is natural, but does not seem to have been systematically isolated in the literature. Thus $$\textsf{Dist}(\mathcal {C})$$ Dist ( C ) is the free doubly-infinitary distributive category on $$\mathcal {C}$$ C . Our main result is that $$\textsf{Dist}(\mathcal {C})$$ Dist ( C ) is cartesian closed . Finally, we compare doubly-infinitary distributivity with extensivity, ordinary infinitary distributivity, and cartesian closedness by means of separating examples.
Source: Applied Categorical Structures
Authors: Fernando Lucatelli Nunes, Matthijs Vákár
Institutions: University of Coimbra, Utrecht University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,290
Funders: Fields Institute for Research in Mathematical Sciences, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Universidade de Coimbra, Ministério da Ciência, Tecnologia e Ensino Superior, Mathematisches Forschungsinstitut Oberwolfach, European Research Council, Leibniz-Gemeinschaft, Fundação para a Ciência e a Tecnologia, Centro de Matemática, Universidade de Coimbra, Division of Mathematical Sciences
Awards: Centro de Matemática da Universidade de Coimbra, G3204329492, Centro de Matemática da Universidade de Coimbra, G4941397794, G5712257541, G6265307419, G6997658380, Centro de Matemática da Universidade de Coimbra, G7186092646, Correct Expressive Differential Programming: Laying the Mathematical Foundations for Tomorrow’s Machine Learning, G8985288032, G917502735
OpenAlex ID: W4392933331
