String diagram explained

String diagrams are a formal graphical language for representing morphisms in monoidal categories, or more generally 2-cells in 2-categories. They are a prominent tool in applied category theory. When interpreted in the monoidal category of vector spaces and linear maps with the tensor product, string diagrams are called tensor networks or Penrose graphical notation. This has led to the development of categorical quantum mechanics where the axioms of quantum theory are expressed in the language of monoidal categories.

History

Günter Hotz gave the first mathematical definition of string diagrams in order to formalise electronic circuits.^[1] However, the invention of string diagrams is usually credited to Roger Penrose,^[2] with Feynman diagrams also described as a precursor. They were later characterised as the arrows of free monoidal categories in a seminal article by André Joyal and Ross Street.^[3] While the diagrams in these first articles were hand-drawn, the advent of typesetting software such as LaTeX and PGF/TikZ made the publication of string diagrams more wide-spread.^[4]

The existential graphs and diagrammatic reasoning of Charles Sanders Peirce are arguably the oldest form of string diagrams, they are interpreted in the monoidal category of finite sets and relations with the Cartesian product.^[5] The lines of identity of Peirce's existential graphs can be axiomatised as a Frobenius algebra, the cuts are unary operators on homsets that axiomatise logical negation. This makes string diagrams a sound and complete two-dimensional deduction system for first-order logic,^[6] invented independently from the one-dimensional syntax of Gottlob Frege's Begriffsschrift.

Intuition

String diagrams are made of boxes

f : x \to y , which represent processes, with a list of wires x coming in at the top and y at the bottom, which represent the input and output systems being processed by the box f . Starting from a collection of wires and boxes, called a signature, one may generate the set of all string diagrams by induction:

• each box

f : x \to y is a string diagram,

• for each list of wires

x , the identity id (x) : x \to x is a string diagram representing the process which does nothing to its input system, it is drawn as a bunch of parallel wires,

• for each pair of string diagrams

f : x \to y and f' : x' \to y' , their tensor f ⊗ f' : x x' \to y y' is a string diagram representing the parallel composition of processes, it is drawn as the horizontal concatenation of the two diagrams,

• for each pair of string diagrams

f : x \to y and g : y \to z , their composition g \circ f : x \to z is a string diagram representing the sequential composition of processes, it is drawn as the vertical concatenation of the two diagrams.

Definition

Algebraic

X ^{\star} denote the free monoid, i.e. the set of lists with elements in a set X .

A monoidal signature

\Sigma is given by:

• a set

\Sigma _{0} of generating objects, the lists of generating objects in $\backslash Sigma\_0^\backslash star$ are also called types,

• a set

\Sigma _{1} of generating arrows, also called boxes,

• a pair of functions

dom , cod : \Sigma _{1} \to \Sigma ^{\star} _{0} which assign a domain and codomain to each box, i.e. the input and output types.

A morphism of monoidal signature

F : \Sigma \to \Sigma' is a pair of functions F _{0} : \Sigma _{0} \to \Sigma' _{0} and F _{1} : \Sigma _{1} \to \Sigma' _{1} which is compatible with the domain and codomain, i.e. such that dom \circ F _{1} = F _{0} \circ dom and cod \circ F _{1} = F _{0} \circ cod . Thus we get the category MonSig of monoidal signatures and their morphisms.U : MonCat \to MonSig which sends a monoidal category to its underlying signature and a monoidal functor to its underlying morphism of signatures, i.e. it forgets the identity, composition and tensor. The free functor C _{-} : MonSig \to MonCat , i.e. the left adjoint to the forgetful functor, sends a monoidal signature \Sigma to the free monoidal category C _{\Sigma} it generates.

String diagrams (with generators from

\Sigma ) are arrows in the free monoidal category C _{\Sigma} .^[7] The interpretation in a monoidal category D is a defined by a monoidal functor F : C _{\Sigma} \to D , which by freeness is uniquely determined by a morphism of monoidal signatures F : \Sigma \to U(D) . Intuitively, once the image of generating objects and arrows are given, the image of every diagram they generate is fixed.

Geometric

A topological graph, also called a one-dimensional cell complex, is a tuple

(\Gamma, \Gamma _{0,} \Gamma _{1)} of a Hausdorff space \Gamma , a closed discrete subset \Gamma _{0} \subseteq \Gamma of nodes and a set of connected components \Gamma _{1} called edges, each homeomorphic to an open interval with boundary in \Gamma _{0} and such that $\backslash Gamma\; -\; \backslash Gamma\_0\; =\; \backslash coprod\; \backslash Gamma\_1$

.

A plane graph between two real numbers

a, b \in R with a < b is a finite topological graph embedded in R x [a, b] such that every point x \in \Gamma \cap R x \{ a, b \} is also a node x \in \Gamma _{0} and belongs to the closure of exactly one edge in \Gamma _{1} . Such points are called outer nodes, they define the domain and codomain dom (\Gamma), cod (\Gamma) \in \Gamma ^{\star} _{1} of the string diagram, i.e. the list of edges that are connected to the top and bottom boundary. The other nodes f \in \Gamma _{0} - \{ a, b \} x R are called inner nodes.

A plane graph is progressive, also called recumbent, when the vertical projection

e \to [a, b] is injective for every edge e \in \Gamma _{1} . Intuitively, the edges in a progressive plane graph go from top to bottom without bending backward. In that case, each edge can be given a top-to-bottom orientation with designated nodes as source and target. One can then define the domain and codomain dom (f), cod (f) \in \Gamma ^{\star} _{1} of each inner node f , given by the list of edges that have source and target.

A plane graph is generic when the vertical projection

\Gamma _{0} - \{ a, b \} x R \to [a, b] is injective, i.e. no two inner nodes are at the same height. In that case, one can define a list boxes (\Gamma) \in \Gamma ^{\star} _{0} of the inner nodes ordered from top to bottom.

A progressive plane graph is labeled by a monoidal signature

\Sigma if it comes equipped with a pair of functions v _{0} : \Gamma _{1} \to \Sigma _{0} from edges to generating objects and v _{1} : \Gamma _{0} - \{ a, b \} x R \to \Sigma _{1} from inner nodes to generating arrows, in a way compatible with domain and codomain.h : \Gamma x [ 0 , 1 ] \to [a, b] x R such that

• the image of

h( - , t) defines a plane graph for all t \in [ 0 , 1 ] ,

• for all

x \in \Gamma _{0} , if h(x, t) is an inner node for some t it is inner for all t \in [ 0 , 1 ] .

A deformation is progressive (generic, labeled) if

h( - , t) is progressive (generic, labeled) for all t \in [ 0 , 1 ] . Deformations induce an equivalence relation with \Gamma \sim \Gamma' if and only if there is some h with h( - , 0 ) = \Gamma and h( - , 1 ) = \Gamma' . String diagrams are equivalence classes of labeled progressive plane graphs. Indeed, one can define:

• the identity diagram

id (x) as a set of parallel edges labeled by some type x \in \Sigma ^{\star} _{0} ,

• the composition of two diagrams as their vertical concatenation with the codomain of the first identified with the domain of the second,
• the tensor of two diagrams as their horizontal concatenation.

Combinatorial

While the geometric definition makes explicit the link between category theory and low-dimensional topology, a combinatorial definition is necessary to formalise string diagrams in computer algebra systems and use them to define computational problems. One such definition is to define string diagrams as equivalence classes of well-typed formulae generated by the signature, identity, composition and tensor. In practice, it is more convenient to encode string diagrams as formulae in generic form, which are in bijection with the labeled generic progressive plane graphs defined above.

Fix a monoidal signature

\Sigma . A layer is defined as a triple (x, f, y) \in \Sigma ^{\star} _{0} x \Sigma _{1} x \Sigma ^{\star} _{0} = : L(\Sigma) of a type x on the left, a box f in the middle and a type y on the right. Layers have a domain and codomain dom , cod : L(\Sigma) \to \Sigma ^{\star} _{0} defined in the obvious way. This forms a directed multigraph, also known as a quiver, with the types as vertices and the layers as edges. A string diagram d is encoded as a path in this multigraph, i.e. it is given by:

• a domain

dom (d) \in \Sigma ^{\star} _{0} as starting point

• a length

len (d) = n \geq 0 ,

• a list of

layers (d) = d _{1} ... d _{n} \in L(\Sigma)

such that

dom (d _{1)} = dom (d) and cod (d _{i)} = dom (d _{i+1} ) for all i < n . In fact, the explicit list of layers is redundant, it is enough to specify the length of the type to the left of each layer, known as the offset. The whiskering d ⊗ z of a diagram d = (x _{1,} f _{1,} y _{1)} ... (x _{n,} f _{n,} y _{n)} by a type z is defined as the concatenation to the right of each layer d ⊗ z = (x _{1,} f _{1,} y _{1} z) ... (x _{n,} f _{n,} y _{n} z) and symmetrically for the whiskering z ⊗ d on the left. One can then define:

• the identity diagram

id (x) with len ( id (x)) = 0 and dom ( id (x)) = x ,

• the composition of two diagrams as the concatenation of their list of layers,
• the tensor of two diagrams as the composition of whiskerings

d ⊗ d' = d ⊗ dom (d') \circ cod (d) ⊗ d' .

Note that because the diagram is in generic form (i.e. each layer contains exactly one box) the definition of tensor is necessarily biased: the diagram on the left hand-side comes above the one on the right-hand side. One could have chosen the opposite definition $d\; \backslash otimes\; d\text{'}\; =\; \backslash text(d)\; \backslash otimes\; d\text{'}\; \backslash \; \backslash circ\; \backslash \; d\; \backslash otimes\; \backslash text(d\text{'})$.

Two diagrams are equal (up to the axioms of monoidal categories) whenever they are in the same equivalence class of the congruence relation generated by the interchanger:$$d\; \backslash otimes\; \backslash text(d\text{'})\; \backslash \; \backslash circ\; \backslash \; \backslash text(d)\; \backslash otimes\; d\text{'}\; \backslash quad\; =\; \backslash quad\; \backslash text(d)\; \backslash otimes\; d\text{'}\; \backslash \; \backslash circ\; \backslash \; d\; \backslash otimes\; \backslash text(d\text{'})$$That is, if the boxes in two consecutive layers are not connected then their order can be swapped. Intuitively, if there is no communication between two parallel processes then the order in which they happen is irrelevant.

The word problem for free monoidal categories, i.e. deciding whether two given diagrams are equal, can be solved in polynomial time. The interchanger is a confluent rewriting system on the subset of boundary connected diagrams, i.e. whenever the plane graphs have no more than one connected component which is not connected to the domain or codomain and the Eckmann–Hilton argument does not apply.^[8]

Extension to 2-categories

The idea is to represent structures of dimension d by structures of dimension 2-d, using Poincaré duality. Thus,

• an object is represented by a portion of plane,
• a 1-cell

f:A\to B is represented by a vertical segment—called a string—separating the plane in two (the right part corresponding to A and the left one to B),

• a 2-cell

\alpha:f ⇒ g:A\to B is represented by an intersection of strings (the strings corresponding to f above the link, the strings corresponding to g below the link).

The parallel composition of 2-cells corresponds to the horizontal juxtaposition of diagrams and the sequential composition to the vertical juxtaposition of diagrams.

A monoidal category is equivalent to a 2-category with a single 0-cell. Intuitively, going from monoidal categories to 2-categories amounts to adding colours to the background of string diagrams.

Examples

The snake equation

(F,G, η ,\varepsilon) between two categories l{C} and l{D} where F: l{C} \leftarrow l{D} is left adjoint of G : l{C} → l{D} and the natural transformations η : I → GF and \varepsilon:FG → I are respectively the unit and the counit. The string diagrams corresponding to these natural transformations are:

The string corresponding to the identity functor is drawn as a dotted line and can be omitted.The definition of an adjunction requires the following equalities:

\begin{align} (\varepsilon F) \circ F( η ) & = 1 _{F\\ G(\varepsilon)\circ} ( η G) & = 1 _{G \end{align}} The first one is depicted asA monoidal category where every object has a left and right adjoint is called a rigid category. String diagrams for rigid categories can be defined as non-progressive plane graphs, i.e. the edges can bend backward.

In the context of categorical quantum mechanics, this is known as the snake equation.

The category of Hilbert spaces is rigid, this fact underlies the proof of correctness for the quantum teleportation protocol. The unit and counit of the adjunction are an abstraction of the Bell state and the Bell measurement respectively. If Alice and Bob share two qubits Y and Z in an entangled state and Alice performs a (post-selected) entangled measurement between Y and another qubit X, then this qubit X will be teleported from Alice to Bob: quantum teleportation is an identity morphism.The same equation appears in the definition of pregroup grammars where it captures the notion of information flow in natural language semantics. This observation has led to the development of the DisCoCat framework and quantum natural language processing.

Hierarchy of graphical languages

Many extensions of string diagrams have been introduced to represent arrows in monoidal categories with extra structure, forming a hierarchy of graphical languages which is classified in Selinger's Survey of graphical languages for monoidal categories.

• Braided monoidal categories with 3-dimensional diagrams, a generalisation of braid groups.
• Symmetric monoidal categories with 4-dimensional diagrams where edges can cross, a generalisation of the symmetric group.
• Ribbon categories with 3-dimensional diagrams where the edges are undirected, a generalisation of knot diagrams.
• Compact closed categories with 4-dimensional diagrams where the edges are undirected, a generalisation of Penrose graphical notation.
• Dagger categories where every diagram has a horizontal reflection.

List of applications

String diagrams have been used to formalise the following objects of study.

• Concurrency theory^[9]
• Artificial neural networks^[10]
• Game theory^[11]
• Bayesian probability^[12]
• Consciousness^[13]
• Markov kernels^[14]
• Signal-flow graphs^[15]
• Conjunctive queries^[16]
• Bidirectional transformations^[17]
• Categorical quantum mechanics
• Quantum circuits, measurement-based quantum computing and quantum error correction, see ZX-calculus
• Natural language processing, see DisCoCat
• Quantum natural language processing

See also

• Proof nets, a generalisation of string diagrams used to denote proofs in linear logic
• Existential graphs, a precursor of string diagrams used to denote formulae in first-order logic
• Penrose graphical notation and Feynman diagrams, two precursors of string diagrams in physics
• Tensor networks, the interpretation of string diagrams in vector spaces, linear maps and tensor product

External links

• TheCatsters . String diagrams 1 . 2007 . streamed video . Youtube . https://ghostarchive.org/varchive/youtube/20211219/USYRDDZ9yEc . 2021-12-19 . live.
  • DisCoPy, a Python toolkit for computing with string diagrams

Notes and References

1. Hotz . Günter . 1965 . Eine Algebraisierung des Syntheseproblems von Schaltkreisen I. . Elektronische Informationsverarbeitung und Kybernetik . 1 . 3 . 185–205.
2. Penrose . Roger . 1971 . Applications of negative dimensional tensors . Combinatorial Mathematics and Its Applications . 1 . 221–244.
3. Joyal . André . Street . Ross . 1991 . The geometry of tensor calculus, I . . 88 . 1 . 55–112. 10.1016/0001-8708(91)90003-P .
4. Web site: Categories: History of string diagrams (thread, 2017may02-...) . 2022-11-11 . angg.twu.net.
5. Brady . Geraldine . Trimble . Todd H . 2000 . A categorical interpretation of CS Peirce's propositional logic Alpha . Journal of Pure and Applied Algebra . 149 . 3 . 213–239. 10.1016/S0022-4049(98)00179-0 .
6. Haydon . Nathan . Sobociński . Pawe\l . 2020 . Compositional diagrammatic first-order logic . International Conference on Theory and Application of Diagrams . Springer . 402–418.
7. Joyal . André . Street . Ross . 1988 . Planar diagrams and tensor algebra . Unpublished Manuscript, Available from Ross Street's Website.
8. Vicary . Jamie . Delpeuch . Antonin . 2022 . Normalization for planar string diagrams and a quadratic equivalence algorithm . Logical Methods in Computer Science . 18.
9. Abramsky . Samson . 1996 . Retracing some paths in process algebra . International Conference on Concurrency Theory . Springer . 1–17.
10. Fong . Brendan . Spivak . David I. . Tuyéras . Rémy . 2019-05-01 . Backprop as Functor: A compositional perspective on supervised learning . math.CT . 1711.10455 .
11. Book: Ghani . Neil . Hedges . Jules . Winschel . Viktor . Zahn . Philipp . Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science . Compositional Game Theory . 2018 . 472–481. 10.1145/3209108.3209165 . 9781450355834 . 17887510 .
12. Coecke . Bob . Spekkens . Robert W . 2012 . Picturing classical and quantum Bayesian inference . Synthese . 186 . 3 . 651–696. 10.1007/s11229-011-9917-5 . 1102.2368 . 3736082 .
13. Signorelli . Camilo Miguel . Wang . Quanlong . Coecke . Bob . 2021-10-01 . Reasoning about conscious experience with axiomatic and graphical mathematics . Consciousness and Cognition . en . 95 . 103168 . 10.1016/j.concog.2021.103168 . 34627099 . 235683270 . 1053-8100. free . 10230/53097 . free .
14. Fritz . Tobias . August 2020 . A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics . 1908.07021 . . 370 . 107239 . 10.1016/j.aim.2020.107239. 201103837 .
15. Book: Bonchi . Filippo . Sobociński . Pawel . Zanasi . Fabio . CONCUR 2014 – Concurrency Theory . A Categorical Semantics of Signal Flow Graphs . September 2014 . https://hal.archives-ouvertes.fr/hal-02134182 . Lecture Notes in Computer Science . Rome, Italy . CONCUR 2014 - Concurrency Theory - 25th International Conference. 435–450 . 10.1007/978-3-662-44584-6_30 . 978-3-662-44583-9 . 18492893 .
16. Bonchi . Filippo . Seeber . Jens . Sobocinski . Pawel . 2018-04-20 . Graphical Conjunctive Queries . cs.LO . 1804.07626 .
17. 1809.00738 . Mitchell . Riley . Categories of optics . 2018. math.CT .