nLab
string diagram

String diagrams

Context

Monoidal categories

monoidal categories

With symmetry

With duals for objects

With duals for morphisms

With traces

Closed structure

Special sorts of products

Semisimplicity

Morphisms

Internal monoids

Examples

Theorems

In higher category theory

Category theory

Higher category theory Sur

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

String diagrams

Idea

String diagrams (also Penrose notation or tensor networks) constitute a graphical calculus for expressing operations in monoidal categories. The idea is roughly to think of objects in a monoidal category as “strings” and of morphisms from one tensor product to another as a node which the source strings enter and the target strings exit. Further structure on the monoidal category is encoded in geometrical properties on these strings. For instance

  • putting strings next to each other denotes the monoidal product, and having no string at all denotes the unit;

  • braiding strings over each other corresponds to – yes, the braiding (if any);

  • bending strings around corresponds to dualities on dualizable objects (if any).

Many operations in monoidal categories that look rather unenlightening in symbols become very obvious in string diagram calculus, such as the trace: an output wire gets bent around and connects to an input.

String diagrams may be seen as dual (in the sense of Poincaré duality) to commutative diagrams. For instance, in a 2-category, an example of a string diagram for a 2-morphism (shown on the left) is shown on the right here:

String diagrams for monoidal categories can be obtained in the same way, by considering a monoidal category as a 2-category with a single object.

Variants

There are many additional structures on monoidal categories, or similar structures, which can usually be represented by encoding further geometric properties. For instance:

  • in monoidal categories which are ribbon categories the strings from above behave as if they have a small transversal extension which makes them behave as ribbons. Accordingly, there is a twist operation in the axioms of a ribbon category and graphically it corresponds to twisting the ribbons by 360 degrees.

  • in a traced monoidal category, the trace can be represented by bending an output string around to connect to an input, even though if the objects are not dualizable the individual “bends” do not represent anything.

  • in monoidal categories which are spherical all strings behave as if drawn on a sphere.

  • in a hypergraph category, the string diagrams are labeled hypergraphs.

  • string diagrams can be extended to represent monoidal functors in several ways. One nice way is described in these slides, and can also be done with “3D regions” as drawn here.

  • there is also a string diagram calculus for bicategories, which extends that for monoidal categories regarded as one-object bicategories. Thus, the strings now represent 1-cells and the nodes 2-cells, leaving the two-dimensional planar regions cut out by the strings to represent the 0-cells. This makes it manifest that in general, string diagram notation is Poincaré dual to the globular notation: where one uses dd-dimensional symbols, the other uses (2d)(2-d)-dimensional symbols.

  • string diagrams for bicategories can be generalized to string diagrams for double categories and proarrow equipments by distinguishing between “vertical” and “horizontal” strings.

  • Similarly, one can categorify this to “surface diagrams” for 3-categories (including monoidal bicategories) and so on; see for instance here.

  • As explained here, in the presence of certain levels of duality it may be better to work with diagrams on cylinders or spheres rather than in boxes. This relates to planar algebras and canopolises?.

  • A string diagram calculus for monoidal fibrations can be obtained as a generalization of C.S. Peirce’s “existential graphs.” The ideas are essentially contained in (Brady-Trimble 98) and developed in (Ponto-Shulman 12), and was discussed here.

  • String diagrams for closed monoidal categories (see also at Kelly-Mac Lane graph) are similar to those for autonomous categories, but a bit subtler, involving “boxes” to separate parts of the diagram. They were used informally by Baez and Stay here and here, but can also be done in essentially the same way as the proof nets used in intuitionistic linear logic; see Lamarche.

  • Proof nets for classical linear logic similarly give string diagrams for *-autonomous categories, or more generally linearly distributive categories; see Blute-Cockett-Seely-Trimble.

See also Selinger 09.

Examples

In Lie theory

For applications of string diagram calculus in Lie theory, see at

In perturbative quantum field theory

For applications of string diagram calculus in perturbative quantum field theory, see at

(…)

References

Introduction and survey

Introductions to and surveys of string diagram calculus:

From the point of view of finite quantum mechanics in terms of dagger-compact categories:

From the point of view of tensor networks in solid state physics:

Some philosophical discussion is given in

  • David Corfield, Section 10.4 of: Towards a Philosophy of Real Mathematics, CUP, 2003.

Original articles

The development and use of string diagram calculus pre-dates its graphical appearance in print, due to the difficulty of printing non-text elements at the time.

Many calculations in earlier works were quite clearly worked out with string diagrams, then painstakingly copied into equations. Sometimes, clearly graphical structures were described in some detail without actually being drawn: e.g. the construction of free compact closed categories in Kelly and Laplazas 1980 “Coherence for compact closed categories”.

(Pawel Sobocinski, 2 May 2017)

This idea that string diagrams are, due to technical issues, only useful for private calculation, is said explicitly by Penrose. Penrose and Rindler’s book “Spinors and Spacetime” (CUP 1984) has an 11-page appendix full of all sorts of beautiful, carefully hand-drawn graphical notation for tensors and various operations on them (e.g. anti-symmetrization and covariant derivative). On the second page, he says the following:

“The notation has been found very useful in practice as it grealy simplifies the appearance of complicated tensor or spinor equations, the various interrelations expressed being discernable at a glance. Unfortunately the notation seems to be of value mainly for private calculations because it cannot be printed in the normal way.”

(Alex Kissinger, 2 May 2017)

The first formal definition of string diagrams in the literature appears to be in

  • Günter Hotz, Eine Algebraisierung des Syntheseproblems von Schaltkreisen, EIK, Bd. 1, (185-205), Bd, 2, (209-231) 1965 (part I, part II)

Application of string diagrams to tensor-calculus in mathematical physics (hence for the case that the ambient monoidal category is that of finite dimensional vector spaces equipped with the tensor product of vector spaces) was propagated by Roger Penrose, whence physicists know string diagrams as Penrose notation for tensor calculus:

  • Roger Penrose, Applications of negative dimensional tensors, Combinatorial Mathematics and its Applications, Academic Press (1971) (pdf)

  • Roger Penrose, Angular momentum: An approach to combinatorial spacetime, in Ted Bastin (ed.) Quantum Theory and Beyond, Cambridge University Press (1971), pp.151-180 (pdf)

  • Roger Penrose, On the nature of quantum geometry, in: J. Klauder (ed.) Magic Without Magic, Freeman, San Francisco, 1972, pp. 333–354 (spire:74082, pdf)

  • Roger Penrose, Wolfgang Rindler, appendix (p. 424-434) of: Spinors and space-time – Volume 1: Two-spinor calculus and relativistic fields, Cambridge University Press 1984 (doi:10.1017/CBO9780511564048)

See also

From the point of view of monoidal category theory, an early description of string diagram calculus (without actually depicting any string diagrams, see the above comments) in

following

and in

String diagram calculus was apparently popularized by its use in

Probably David Yetter was the first (at least in public) to write string diagrams with “coupons” (a term used by Nicolai Reshitikhin and Turaev a few months later) to represent maps which are not inherent in the (braided or symmetric compact closed) monoidal structure.

See also these:

  • Peter Freyd, David Yetter, Braided compact closed categories with applications to low dimensional topology Advances in Mathematics, 77:156–182, 1989.

  • Peter Freyd and David Yetter, Coherence theorems via knot theory. Journal of Pure and Applied Algebra, 78:49–76, 1992.

  • David Yetter, Framed tangles and a theorem of Deligne on braided deformations of tannakian categories In M. Gerstenhaber and Jim Stasheff (eds.) Deformation Theory and Quantum Groups with Applications to Mathematical Physics, Contemporary Mathematics 134, pages 325–349. Americal Mathematical Society,

    1992.

For more on the history of the notion see the bibliography in (Selinger 09).

Details

String diagrams for monoidal categories are discussed in

For 1-categories in

  • Dan Marsden, Category Theory Using String Diagrams, (arXiv:1401.7220).

    (therein: many explicit calculations, colored illustrations, avoiding the common practice of indicating 0-cells by non-filled circles)

For traced monoidal categories in

  • Andre Joyal, Ross Street and Verity, Traced monoidal categories.

  • David I. Spivak, Patrick Schultz, Dylan Rupel, String diagrams for traced and compact categories are oriented 1-cobordisms, arxiv

For closed monoidal categories in

  • John Baez, Quantum Gravity Seminar - Fall 2006. <http://math.ucr.edu/home/baez/qg-fall2006/index.html#computation>
  • John Baez and Mike Stay, Physics, Topology, Logic and Computation: A Rosetta Stone, arxiv

  • Francois Lamarche, Proof Nets for Intuitionistic Linear Logic: Essential nets, 2008 pdf

  • Ralf Hinze, Kan Extensions for Program Optimisation, Or: Art and Dan Explain an Old Trick, pdf

For biclosed monoidal categories in

For linearly distributive categories in

For indexed monoidal categories in

The generalization of string diagrams to one dimension higher is discussed in

The generalization to arbitrary dimension in terms of opetopic “zoom complexes” is due to

Discussion for double categories and pro-arrow equipments is in

  • David Jaz Myers, String Diagrams For Double Categories and (Virtual) Equipments (arXiv:1612.02762)

See also at opetopic type theory.

Software

The higher dimensional string diagrams (“zoom complexes” (Kock-Joyal-Batanin-Mascari 07)) used for presenting opetopes in the context of opetopic type theory are introduced in

  • Eric Finster, Opetopic Diagrams 1 - Basics (video)

  • Eric Finster, Opetopic Diagrams 2 - Geometry (video)

  • Globular is a web-based proof assistant for finitely-presented semistrict globular higher categories. It allows one to formalize higher-categorical proofs in finitely-presented n-categories and visualize them as string diagrams.

Last revised on February 10, 2020 at 01:12:24. See the history of this page for a list of all contributions to it.