Between Markov and restriction: Two more monads on categories for relations
By: Cipriano Junior Cioffo, Fabio Gadducci, Davide Trotta
Potential Business Impact:
Organizes math ideas about how things connect.
The study of categories abstracting the structural properties of relations has been extensively developed over the years, resulting in a rich and diverse body of work. A previous paper offered a survey providing a modern and comprehensive presentation of these ``categories for relations'' as instances of gs-monoidal categories, showing how they arise as Kleisli categories of suitable symmetric monoidal monads. The end result was a taxonomy that organised numerous related concepts in the literature, including in particular Markov and restriction categories. This paper further enriches the taxonomy: it proposes two categories that are once more instances of gs-monoidal categories, yet more abstract than Markov and restriction categories. They are characterised by an axiomatic notion of mass and domain of an arrow, the latter one of the key ingredient of restriction categories, which generalises the domain of partial functions. The paper then introduces mass and domain preserving monads, proving that the associated Kleisli categories in fact preserve the corresponding equations and that these monads arise naturally for the categories of semiring-weighted relations.
Similar Papers
Order in Partial Markov Categories
Logic in Computer Science
Organizes uncertain computer steps to improve predictions.
Partializations of Markov categories
Category Theory
Makes computers better at handling uncertain information.
A Foundational Theory of Quantitative Abstraction: Adjunctions, Duality, and Logic for Probabilistic Systems
Logic in Computer Science
Makes complex computer predictions more accurate.