SearcharxivSearch

arXiv subjects

Callum Reader

Publications and source records attributed to Callum Reader.

2 recordsLinked to original sources

String Diagrams for Closed Symmetric Monoidal Categories

We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor explicit, allowing standard morphism wires to interact with them through a well-defined set of graphical rules. We establish the soundness and completeness of the diagrammatic calculus, and illustrate its expressiveness through examples drawn from category theory, logic and programming language semantics.

cs.LO

Scalar enrichment and cotraces in bicategories

It is known that every monoidal bicategory has an associated braided monoidal category of scalars. In this thesis we show that every monoidal bicategory, which is closed both monoidally and compositionally, can be enriched over the monoidal 2-category of scalar-enriched categories. This enrichment provides a number of key insights into the relationship between linear algebra and category theory. The enrichment replaces every set of 2-cells with a scalar, and we show that this replacement can be given in terms of the cotrace, first defined by Day and Street in the context of profunctors. This is analogous to the construction of the Frobenius inner product between linear maps, which is constructed in terms of the trace of linear maps. In linear algebra it is also possible to define the trace in terms of the Frobenius inner product. We show that the cotrace can be defined in terms of the enrichment, and in doing so we prove that the cotrace is an enriched version of the `categorical trace' studied by Ganter and Kapranov, and Bartlett. Thus, we unify the concept of a categorical trace with the concept of a cotrace. Finally, we study the relationship between the trace and the cotrace for compact closed bicategories. We show that the trace and cotrace have a structured relationship and share many of the properties of the linear trace including -- but not limited to -- dual invariance and linearity. Motivating examples are given throughout. We also introduce a decorated string diagram language to simplify some of the proofs.

math.CT