### Applied Category Theory 2021 Adjoint School

#### Posted by John Baez

Do you want to get involved in applied category theory? Are you willing to do a lot of work and learn a lot? Then this is for you:

- Applied Category Theory 2021 – Adjoint School. Applications due Friday 29 January 2021. Organized by David Jaz Myers, Sophie Libkind, and Brendan Fong.

There are four projects to choose from, with great mentors. You can see descriptions of them below!

By the way, it’s not yet clear if there will be an in-person component to this school — but if there is, it’ll happen at the University of Cambridge. ACT2021 is being organized by Jamie Vicary, who teaches in the computer science department there.

## Who should apply?

Anyone, from anywhere in the world, who is interested in applying category-theoretic methods to problems outside of pure mathematics. This is emphatically not restricted to math students, but one should be comfortable working with mathematics. Knowledge of basic category-theoretic language — the definition of monoidal category for example — is encouraged.

We will consider advanced undergraduates, PhD students, post-docs, as well as people working outside of academia. Members of groups which are underrepresented in the mathematics and computer science communities are especially encouraged to apply.

## School overview

Participants are divided into four-person project teams. Each project is guided by a mentor and a TA. The Adjoint School has two main components: an Online Seminar that meets regularly between February and June, and an in-person Research Week in Cambridge, UK on July 5–9.

During the online seminar, we will read, discuss, and respond to papers chosen by the project mentors. Every other week, a pair of participants will present a paper which will be followed by a group discussion. Leading up to this presentation, study groups will meet to digest the reading in progress, and students will submit reading responses. After the presentation, the presenters will summarize the paper into a blog post for The $n$-Category Cafe.

The in-person research week will be held the week prior to the International Conference on Applied Category Theory and in the same location. During the week, participants work intensively with their research group under the guidance of their mentor. Projects from the Adjoint School will be presented during this conference. Both components of the school aim to develop a sense of belonging and camaraderie in students so that they can fully participate in the conference, for example by attending talks and chatting with other conference goers.

## Projects to choose from

Here are the four projects.

### Topic: Categorical and computational aspects of C-sets

**Mentors:** James Fairbanks and Evan Patterson

**Description:** Applied category theory includes major threads of inquiry into monoidal categories and hypergraph categories for describing systems in terms of processes or networks of interacting components. Structured cospans are an important class of hypergraph categories. For example, Petri net-structured cospans are models of concurrent processes in chemistry, epidemiology, and computer science. When the structured cospans are given by C-sets (also known as co-presheaves), generic software can be implemented using the mathematics of functor categories. We will study mathematical and computational aspects of these categorical constructions, as well as applications to scientific computing.

**Readings:**

Structured cospans, Baez and Courser.

An algebra of open dynamical systems on the operad of wiring diagrams, Vagner, Spivak, and Lerman.

### Topic: The ubiquity of enriched profunctor nuclei

**Mentor:** Simon Willerton

**Description:** In 1964, Isbell developed a nice universal embedding for metric spaces: the tight span. In 1966, Isbell developed a duality for presheaves. These are both closely related to enriched profunctor nuclei, but the connection wasn’t spotted for 40 years. Since then, many constructions in mathematics have been observed to be enriched profunctor nuclei too, such as the fuzzy/formal concept lattice, tropical convex hull, and the Legendre–Fenchel transform. We’ll explore the world of enriched profunctor nuclei, perhaps seeking out further useful examples.

**Readings:**

The Legendre–Fenchel transform from a category theoretic perspective, Willerton.

On the fuzzy concept complex (chapters 2-3), Elliott.

### Topic: Double categories in applied category theory

**Mentor:** Simona Paoli

**Description:** Bicategories and double categories (and their symmetric monoidal versions) have recently featured in applied category theory: for instance, structured cospans and decorated cospans have been used to model several examples, such as electric circuits, Petri nets and chemical reaction networks.

An approach to bicategories and double categories is available in higher category theory through models that do not require a direct checking of the coherence axioms, such as the Segal-type models. We aim to revisit the structures used in applications in the light of these approaches, in the hope to facilitate the construction of new examples of interest in applications.

**Readings:**

Structured cospans, Baez and Courser.

A double categorical model of weak 2-categories, Paoli and Pronk.

and introductory chapters of:

### Topic: Extensions of coalgebraic dynamic logic

**Mentors:** Helle Hvid Hansen and Clemens Kupke

**Description:** Coalgebra is a branch of category theory in which different types of state-based systems are studied in a uniform framework, parametric in an endofunctor $F\colon C \to C$ that specifies the system type. Many of the systems that arise in computer science, including deterministic/nondeterministic/weighted/probabilistic automata, labelled transition systems, Markov chains, Kripke models and neighbourhood structures, can be modeled as F-coalgebras. Once we recognise that a class of systems are coalgebras, we obtain general coalgebraic notions of morphism, bisimulation, coinduction and observable behaviour.

Modal logics are well-known formalisms for specifying properties of state-based systems, and one of the central contributions of coalgebra has been to show that modal logics for coalgebras can be developed in the general parametric setting, and many results can be proved at the abstract level of coalgebras. This area is called coalgebraic modal logic.

In this project, we will focus on coalgebraic dynamic logic, a coalgebraic framework that encompasses Propositional Dynamic Logic (PDL) and Parikh’s Game Logic. The aim is to extend coalgebraic dynamic logic to system types with probabilities. As a concrete starting point, we aim to give a coalgebraic account of stochastic game logic, and apply the coalgebraic framework to prove new expressiveness and completeness results.

Participants in this project would ideally have some prior knowledge of modal logic and PDL, as well as some familiarity with monads.

**Readings:**

Parts of these:

Coalgebraic semantics of modal logics: an overview, Kupke and Pattinson.

Strong completeness of iteration-free coalgebraic dynamic logics, Hansen, Kupke, and Leale.