String Diagram Rewrite Theory I: Rewriting with Frobenius Structure

by   Filippo Bonchi, et al.

String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as diverse as Computer Science, Physics, Control Theory, Linguistics, and Biology. In many such proposals, the transformations of the described systems are modelled as rewrite rules of diagrams. These developments demand a mathematical foundation for string diagram rewriting: whereas rewrite theory for terms is well-understood, the two-dimensional nature of string diagrams poses additional challenges. This work systematises and expands a series of recent conference papers laying down such foundation. As first step, we focus on the case of rewrite systems for string diagrammatic theories which feature a Frobenius algebra. This situation ubiquitously appear in various approaches: for instance, in the algebraic semantics of linear dynamical systems, Frobenius structures model the wiring of circuits; in categorical quantum mechanics, they model interacting quantum observables. Our work introduces a combinatorial interpretation of string diagram rewriting modulo Frobenius structures, in terms of double-pushout hypergraph rewriting. Furthermore, we prove this interpretation to be sound and complete. In the last part, we also see that the approach can be generalised to model rewriting modulo multiple Frobenius structures. As a proof of concept, we show how to derive from these results a termination strategy for Interacting Bialgebras, an important rewrite theory in the study of quantum circuits and signal flow graphs.



There are no comments yet.


page 1

page 2

page 3

page 4


String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure

Symmetric monoidal theories (SMTs) generalise algebraic theories in a wa...

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

Calculi of string diagrams are increasingly used to present the syntax a...

String Diagram Rewriting Modulo Commutative Monoid Structure

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

The algebra of entanglement and the geometry of composition

String diagrams turn algebraic equations into topological moves that hav...

Interacting Hopf Algebras: the theory of linear systems

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

A Foundation for Ledger Structures

This paper introduces an approach to constructing ledger structures for ...

String Diagram Rewrite Theory III: Confluence with and without Frobenius

In this paper we address the problem of proving confluence for string di...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.