Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A survey of graphical languages for monoidal categories (0908.3347v1)

Published 23 Aug 2009 in math.CT

Abstract: This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments in the literature. Where we include results that have only been proved in special cases, we indicate this in the form of caveats.

Citations (779)

Summary

  • The paper provides a comprehensive survey of graphical languages for monoidal categories, detailing extensions like braided, balanced, and traced variants.
  • The paper demonstrates that string diagrams transform abstract algebraic operations into intuitive visual representations for better categorical reasoning.
  • The paper highlights applications in physics and computer science by linking diagrammatic conventions with coherent, computationally relevant structures.

Overview of Graphical Languages for Monoidal Categories

The paper "A survey of graphical languages for monoidal categories" by Peter Selinger presents an extensive overview of monoidal categories and their associated graphical languages. Graphical representations offer a visual formalism that facilitates reasoning about morphisms and objects in monoidal categories. The paper serves as a comprehensive reference for understanding these languages across various extensions and generalizations of monoidal categories. It discusses numerous variants, such as autonomous, traced, and dagger categories, each having specific rules and graphical notations.

Graphical Representation in Monoidal Categories

Monoidal categories form the foundational structure for this paper. By associating objects with wires and morphisms with boxes, monoidal categories employ string diagrams to illustrate the relationships and compositions that occur within them. The graphical language simplifies the understanding of complex algebraic manipulations, allowing for a more intuitive interpretation of coherence and composition operations characteristic of these categories.

Extensions and Variants

The paper categorizes monoidal structures based on extensions that include braided, balanced, symmetric, and other specialized notions. Each such extension integrates additional features into the graphical language, necessitating distinctive diagrammatic conventions. For instance, braided monoidal categories incorporate the concept of braiding in diagrams, while symmetric monoidal categories enforce symmetries on the wire crossings.

  • Braided Monoidal Categories involve braidings represented by crossings in diagrams. Joyal and Street's work underpins the coherence theorem for braided categories, where coherence is expressed as 3-dimensional isotopy.
  • Balanced Monoidal Categories introduce twists, extending braided categories with isotopic ribbon diagrams. The coherence captures nuances in the additional twist operations.
  • Symmetric Monoidal Categories enforce the equivalence between crossings and self-inverse operations, embodied in planar isotopy.

Autonomous and Pivotal Categories

Autonomous categories, also known as rigid or compact closed categories, introduce dual objects, depicted through wire bends that represent the duality operations. In pivotal categories, canonical isomorphisms relate each object to its double dual, thus enlarging the graphical language through rotation invariance.

  • Pivotal Categories leverage isomorphisms (A ≅ A**) used to define pivotal structures, which directly influence diagrammatic calculations.
  • Spherical Categories, as a subcase, encode further symmetry by permitting loops in the diagrams that visually correspond to self-duality.

Traced Categories

Traced categories interleave autonomous properties with the constraints seen in cyclic structures, enabling the representation of fixed points and recursive morphisms. The graphical language of traced categories extends that of monoidal and autonomous categories by introducing loops that symbolize the trace operation's partial application.

  • Planar Traced Categories involve operations where loops represent cyclic morphisms, capturing the intuition behind trace operators in the computation of feedback systems.
  • Balanced and Symmetric Traced Categories expand the traced notion by incorporating braidings and symmetries into the feedback loops.

Dagger Categories

Dagger categories are endowed with an involution akin to the adjoint operation in Hilbert spaces. This involution is visually rendered as a mirror operation in diagrams. Dagger categories, pivotal in quantum mechanics, have extensions into dagger monoidal and dagger pivotal categories, where operations are self-consistent through these adjoint involutions.

Conclusion and Implications

Selinger's paper outlines not only the formal structure of monoidal categories but also their applicability across disciplines like physics and computer science. The graphical languages serve as bridges that connect algebraic formalisms with visual intuition, enhancing our understanding of complex interactions within categorical frameworks. For future research, these languages suggest potential expansions into higher-dimensional categories and can enrich the understanding of computational and logical systems through diagrammatic reasoning.