[Paper Review] Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories

Samson Abramsky|ArXiv.org|Oct 15, 2009

Computability, Logic, AI Algorithms13 references4 citations

TL;DR

This paper presents explicit, combinatorial constructions for free traced symmetric monoidal and strongly compact closed categories, refining earlier categorical frameworks for quantum mechanics. It introduces a geometric and algebraic method to generate these structures from base categories, with a key contribution being the ability to 'glue in' a prescribed monoid of scalars via loop evaluation, enabling precise control over quantitative aspects like amplitudes in quantum theory.

ABSTRACT

We study structures which have arisen in recent work by the present author and Bob Coecke on a categorical axiomatics for Quantum Mechanics; in particular, the notion of strongly compact closed category. We explain how these structures support a notion of scalar which allows quantitative aspects of physical theory to be expressed, and how the notion of strong compact closure emerges as a significant refinement of the more classical notion of compact closed category. We then proceed to an extended discussion of free constructions for a sequence of progressively more complex kinds of structured category, culminating in the strongly compact closed case. The simple geometric and combinatorial ideas underlying these constructions are emphasized. We also discuss variations where a prescribed monoid of scalars can be "glued in" to the free construction.

Motivation & Objective

• To provide explicit, synthetic constructions of free categories with increasing structure: from monoidal to traced, compact closed, and finally strongly compact closed categories.
• To refine the categorical framework for quantum mechanics by introducing a notion of scalar that supports quantitative physical reasoning.
• To extend free constructions to include a prescribed monoid of scalars, allowing external specification of amplitudes (e.g., complex numbers) in quantum models.
• To show how the dagger (involution) structure lifts through these constructions, yielding the 'dagger version' of each free category, compatible with Selinger’s framework.
• To unify and clarify the relationship between the Kelly-Laplaza and $Γ$-construction (Int) approaches to free compact closed categories via traced symmetric monoidal categories.

Proposed method

• Constructs free traced symmetric monoidal categories using equivalence classes of string diagrams with loops, where morphisms are represented as tuples $(S, π, \lambda)$ encoding sets of strings, permutations, and labels.
• Defines composition and monoidal structure via multiset union and relabeling, with trace implemented via a Yanking axiom that allows feedback loops.
• Introduces a dagger structure on the free category by reversing the direction of strings and arrows, and dualizing labels using the involution on the generating category.
• For scalar parameterization, replaces the free monoid of loops with a user-specified commutative monoid $M$, with loop evaluations mapped via a function $\varphi$ to $M$.
• Uses comma categories $(\mathcal{L} \downarrow U_{\mathbf{InvCMon}})$ to formalize the construction of free strongly compact closed categories with prescribed scalars.
• Lifts the dagger structure through all constructions, ensuring compatibility with the notion of a dagger compact closed category as in Selinger’s work.

Experimental results

Research questions

• RQ1 How can free traced symmetric monoidal categories be constructed explicitly and combinatorially from a base category?
• RQ2 What is the precise relationship between the Kelly-Laplaza construction and the $\mathrm{Int}$-construction in the context of free compact closed categories?
• RQ3 How can a prescribed monoid of scalars be incorporated into free strongly compact closed categories while preserving the categorical structure?
• RQ4 In what way does the dagger (involution) structure lift through the free constructions, and how does it relate to the notion of strong compact closure?
• RQ5 Can the geometric and combinatorial intuition behind string diagrams be used to give a synthetic, accessible account of free constructions in higher-order categorical structures?

Key findings

• The paper provides the first explicit, combinatorial construction of the free traced symmetric monoidal category over a base category, filling a gap in the literature.
• It establishes that the free compact closed category can be constructed as a quotient of the free traced symmetric monoidal category, clarifying the link between the Kelly-Laplaza and $\mathrm{Int}$-construction approaches.
• The construction of the free strongly compact closed category is shown to be equivalent to the free compact closed category with an added dagger structure, lifting the involution from the base category.
• A novel construction is introduced for free strongly compact closed categories with a prescribed monoid of scalars, where loop evaluations are mapped via a function $\varphi$ to a user-defined monoid $M$, with the monoid operation replacing multiset union.
• The dagger structure on the free category is defined by reversing string directions and dualizing labels, ensuring compatibility with the compact closed structure and yielding a dagger compact closed category.
• The monoid of scalars in the final free category is exactly the prescribed monoid $M$, demonstrating that the construction is both flexible and precise for modeling quantitative aspects of quantum theory.