A universal construction for (co)relations
From MaRDI portal
Publication:4580207
Abstract: 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, including the cases of linear corelations (relevant for the semantics of electrical circuits), of partial equivalence relations and of linear subspaces (semantics of signal flow graphs and of the phase-free ZX calculus).
Recommendations
- Universal constructions for (co)relations: categories, monoidal categories, and props
- A structural and nominal syntax for diagrams
- The calculus of signal flow diagrams. I: Linear relations on streams.
- A categorical semantics of signal flow graphs
- Corelations are the prop for extraspecial commutative Frobenius monoids
Cited in
(7)- A domain theoretic characterisation of the universal relation
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Calculations for plus constructions
- String diagrammatic electrical circuit theory
- On the spectra of universal relational sentences
- scientific article; zbMATH DE number 549856 (Why is no real title available?)
- Universal constructions for (co)relations: categories, monoidal categories, and props
This page was built for publication: A universal construction for (co)relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580207)
