DeepAI AI Chat
Log In Sign Up

Universal Constructions for (Co)Relations: categories, monoidal categories, and props

by   Brendan Fong, et al.

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory.


page 1

page 2

page 3

page 4


Deconstructing the Calculus of Relations with Tape Diagrams

Rig categories with finite biproducts are categories with two monoidal p...

Comb Diagrams for Discrete-Time Feedback

The data for many useful bidirectional constructions in applied category...

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure

String diagrams are a powerful and intuitive graphical syntax, originate...

Completeness and expressiveness for gs-monoidal categories

Formalised in the study of symmetric monoidal categories, string diagram...

Spectral Presheaves, Kochen-Specker Contextuality, and Quantale-Valued Relations

In the topos approach to quantum theory of Doering and Isham the Kochen-...

String Diagram Rewriting Modulo Commutative Monoid Structure

We characterise freely generated props with a chosen commutative monoid ...

Interacting Hopf Algebras: the theory of linear systems

As first main contribution, this thesis characterises the PROP SVk of li...