External Traced Monoidal Categories

External traced monoidal categories Nick Hu St. Catherine’s College University of Oxford Supervised by Dr Jamie Vicary A dissertation submitted for the degree of MSc Mathematics and Foundations of Computer Science Trinity 2019 Abstract String diagrams provide a novel technique for modern developments in category theory, and in particular, higher category theory. Many results about category theory can only be properly stated in the setting of 2-categories. We analyse the approach of using profunctors, which are a categorification of relations, to study category theory itself. Specifically, we examine the structure of ∗-autonomous categories and various other categories with duals, and develop a new characterisation of traced monoidal categories with respect to Prof: the 2-category of categories, profunctors, and natural transformations. We discuss at length the topic of diagrammatic methods, and advocate for a fancy kind of string diagram called an internal string diagram. i Contents 1 Introduction 1 1.1 The philosophy of category theory . 1 1.1.1 Picturing mathematics . 1 1.1.2 Peeking inside . 1 1.1.3 Externalising mathematics . 2 1.2 The context of our work . 2 1.3 Contributionandoutline........................................... 2 2 Preliminary material 4 2.1 Coends..................................................... 4 2.1.1 Yoneda reductions . 6 2.2 Profunctors .................................................. 7 2.2.1 Relationship to functors . 9 2.3 2-categories . 11 2.3.1 Prof, the compact closed monoidal weak 2-category of categories, profunctors and natural transformations . 15 3 Characterising traced monoidal categories internal to Prof 18 3.1 Traced monoidal categories . 18 3.2 A 2-morphism for tracing . 19 3.2.1 Sliding and naturality hold automatically . 21 3.3 Presentations of higher algebraic structure and the diagrammatic calculus . 23 3.4 The internal string diagram construction . 27 3.4.1 Actions of generating 2-morphisms . 29 3.5 Presentation of a traced monoidal category . 31 3.5.1 Action of Tr ............................................ 33 4 Sketches of internal traced ∗-autonomous categories 39 4.1 ∗-autonomous categories internal to Prof ................................. 39 4.1.1 Recovering ⊗ ........................................... 41 4.1.2 The exponential bifunctor − ⊸= ................................ 44 4.2 Tracing and other extensions . 45 4.2.1 Compact closedness as a presentation . 45 4.2.2 Relationship to linear distributivity . 46 4.2.3 Results on tracing . 47 5 Conclusion 55 5.1 Futurework.................................................. 55 References 56 ii 1. Introduction Category theory has become a universal language for the mathematical sciences. Beginning as an offshoot of traditional pure mathematics, in the school of algebraic topology, it has since come a long way, and is now the object of study for physicists, logicians, computer scientists, linguists, economists, and even philosophers. An argument can be put forward that no working mathematician’s toolbox is complete without a dab of category theory. The progression of this subfield of mathematics, and the proliferation of it in the mathematical sciences, has warranted that category theory becomes an end for study itself, rather than merely a means to describe different parts of algebra. Indeed, the situation has turned on its head — the discovery of the Yoneda lemma, which is arguably the first ‘real theorem’ of category theory, has had large impacts on modern developments in algebraic geometry and representation theory. Although we do not make it explicit, this whole dissertation is built out of Yoneda, as we make extensive use of profunctors. 1.1. The philosophy of category theory Perhaps the most important use of Yoneda is its philosophy; while a formal statement is perfectly fine for a mathematician, there is an important lesson to learn from asking ‘what does Yoneda really mean?’ One answer is the following: You work at a particle accelerator. You want to understand some particle. All you can do are throw other particles at it and see what happens. If you understand how your mystery particle responds to all possible test particles at all possible test energies, then you know everything there is to know about your mystery particle. Ravi Vakil (2009) on the Yoneda lemma Another is summarised by the common saying you can tell a lot about a person by the company they keep. That is, the big picture of how things relate to each other is more important than the details inside, and this fits into the general theme of category theory: we do not look at what an object is, but instead how it interacts. Category theory is most often used with objects which are inherently set-like, but we can never ‘peek inside’ — instead, our attention is diverted to the connections between objects: the morphisms. The tenet of this approach is that things should be compositional, and crucial to any definition of a category is a definition of how its morphisms compose. Computer scientists have secretly been doing this for decades, under a different name: abstraction. To build large and complicated software, the more-or-less only viable approach is to piece it together from smaller pieces. But if one is too focused on the implementation details, then interfacing becomes impossible; hence, an abstraction barrier is necessary. Fundamentally, we don’t care how a data structure is implemented, so long as it provides a suitable abstract interface. This is precisely what we do when we prove general theorems about categories with structure: by abstracting vector spaces, Hilbert spaces, and relations down to compact closed categories, we can prove things for them all in one go by proving theorems about compact closed categories. 1.1.1. Picturing mathematics. In our preferred flavour of category theory, the development is particularly radical, thanks to the technique of string diagrams. No longer is algebra confined to one-dimensional lines of equations; instead, we represent algebraic expressions with diagrams of strings which fully exploit the two-dimensional geometry of the page, and our innate natural intuitions of homotopy. In our work, we shall make full use of the diagrammatic calculus (Joyal and Street 1991) to perform abstract mathematics in a novel fashion. Our philosophy is that this is the most effective method of working with higher categories, and in an anti-traditional fashion we deliberately give only a relatively informal definition of our diagrammatic methods. This is done in good faith — formal foundations exist1 and are absolutely necessary, but we are of the opinion that they are not particularly helpful from a pedagogical perspective, especially for those who are seeing the diagrammatic calculus for the first time. 1.1.2. Peeking inside. As we have described it, category theory provides an arena for formal mathematics with which one can study traditional mathematical structures. The natural question arises: what is the arena for formal category theory? One answer leads to Cat, the category of small categories and functors. Given that the objects of this category are categories, and that we are familiar with the internals of a category, it seems that if we wish to make statements about these categories we need to violate our previous principle of not ‘peeking inside’ the objects by breaking the abstraction barrier. To do this in a principled way, we transition from ordinary (1-)category theory to the theory of 2-categories2, which was born from generalising Cat. In this setting, we can formally study naturally category-theoretic phenomena, like adjunctions (also called dualities in the general 2-category theory world). However, new challenges also present themselves. Just as when moving from traditional mathematics to category theory, the notion of isomorphism between structures becomes formalised and important, when moving to 2-category theory, we also have the notion of isomorphism between morphisms. This motivates coherence, which we discuss later. Furthermore, traditional algebraic methods become unwieldy; intuitively simple 2-categorical generalisations of well-understood 1-categorical concepts require several pages of coherence equations to properly define. The case is even worse for 3-category theory, as the number of equations required explodes combinatorially. Even though important formalisations are missing, through sheer mathematical effort3 we fortunately have plenty of machinery to work with 1. This is a big topic in itself, unsuitable for exposition here. We refer the reader to Selinger (2009) for a lengthy discussion. 2. These are frequently referred to as bicategories in the literature. 3. To see what we mean, compare Michael Stay (2013, Definition 4.11) with the 1-categorical counterpart. 1 in the 2-categorical case. As we touched upon earlier, we will rely heavily on diagrammatic methods to provide human-digestible results. 1.1.3. Externalising mathematics. Our guiding principle is that of (vertical) categorification: the procedure of lifting structures from 푛-category theory to 푛 + 1-category theory4. By this, we mean the externalisation/internalisation of mathematics. This terminology is confusing, because often the reference frame is not made explicit. The most basic example of this is the correspondence between an element of aset 푥 ∈ 푋 and a function {∗} → 푋 given by ∗ ↦ 푥5; in the category Set, the former describes the property of ‘having 푥’ internally to 푋 — the membership relation ∈ ‘peeks inside’ the Set object

Load more