We’re having a seminar on applied category theory at U. C. Riverside, organized by Joe Moeller and Christian Williams.
It will take place on Wednesdays at 5 pm UTC, which is 10 am in California or 1 pm on the east coast of the United States, or 6 pm in England. It will be held online via Zoom, here:
We’ll have discussions on the Category Theory Community Server.
All talks will be recorded and put on YouTube here:
Here are the talks:
• April 1st, John Baez: Structured cospans and double categories.
Abstract. One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce “structured cospans” as a way to study networks with inputs and outputs. Given a functor L: A → X, a structured cospan is a diagram in X of the form
If A and X have finite colimits and L is a left adjoint, we obtain a symmetric monoidal category whose objects are those of A and whose morphisms are certain equivalence classes of structured cospans. However, this arises from a more fundamental structure: a symmetric monoidal double category where the horizontal 1-cells are structured cospans, not equivalence classes thereof. We explain the mathematics and illustrate it with an example from epidemiology.
The talk was based on these papers:
• April 8th, Prakash Panangaden: A categorical view of conditional expectation.
Abstract. This talk is a fragment from a larger work on approximating Markov processes. I will focus on a functorial definition of conditional expectation without talking about how it was used. We define categories of cones—which are abstract versions of the familiar cones in vector spaces—of measures and related categories cones of Lp functions. We will state a number of dualities and isomorphisms between these categories. Then we will define conditional expectation by exploiting these dualities: it will turn out that we can define conditional expectation with respect to certain morphisms. These generalize the standard notion of conditioning with respect to a sub-sigma algebra. Why did I use the plural? Because it turns out that there are two kinds of conditional expectation, one of which looks like a left adjoint (in the matrix sense not the categorical sense) and the other looks like a right adjoint. I will review concepts like image measure, Radon-Nikodym derivatives and the traditional definition of conditional expectation. This is joint work with Philippe Chaput, Vincent Danos and Gordon Plotkin.
His talk was based on this paper:
- Philippe Chaput, Vincent Danos, Prakash Panangaden and Gordon Plotkin, Approximating Markov processes by averaging, in International Colloquium on Automata, Languages, and Programming, Springer, Berlin, 2009.
• April 15, Jules Hedges: Open games: the long road to practical applications.
Abstract. I will talk about open games, and the closely related concepts of lenses/optics and open learners. My goal is to report on the successes and failures of an ongoing effort to try to realise the often-claimed benefits of categories and compositionality in actual practice. I will introduce what little theory is needed along the way. Here are some things I plan to talk about:
— Lenses as an abstraction of the chain rule
— Comb diagrams
— Surprising applications of open games: Bayesian inference, value function iteration
— The state of tool support
— Open games in their natural habitat: microeconomics
— Sociological aspects of working with economics
• April 22, Michael Shulman, Star-autonomous envelopes.
Abstract. Symmetric monoidal categories with duals, a.k.a. compact monoidal categories, have a pleasing string diagram calculus. In particular, any compact monoidal category is closed with [A,B] = (A* ⊗ B), and the transpose of A ⊗ B → C to A → [B,C] is represented by simply bending a string. Unfortunately, a closed symmetric monoidal category cannot even be embedded fully-faithfully into a compact one unless it is traced; and while string diagram calculi for closed monoidal categories have been proposed, they are more complicated, e.g. with “clasps” and “bubbles”. In this talk we obtain a string diagram calculus for closed symmetric monoidal categories that looks almost like the compact case, by fully embedding any such category in a star-autonomous one (via a functor that preserves the closed structure) and using the known string diagram calculus for star-autonomous categories. No knowledge of star-autonomous categories will be assumed.
His talk is based on this paper:
- Michael Shulman, Star-autonomous envelopes.
• April 29, Gershom Bazerman, A localic approach to the semantics of dependency, conflict, and concurrency.
Abstract. Petri nets have been of interest to applied category theory for some time. Back in the 1980s, one approach to their semantics was given by algebraic gadgets called “event structures.” We use classical techniques from order theory to study event structures without conflict restrictions (which we term “dependency structures with choice”) by their associated “traces”, which let us establish a one-to-one correspondence between DSCs and a certain class of locales. These locales have an internal logic of reachability, which can be equipped with “versioning” modalities that let us abstract away certain unnecessary detail from an underlying DSC. With this in hand we can give a general notion of what it means to “solve a dependency problem” and combinatorial results bounding the complexity of this. Time permitting, I will sketch work-in-progress which hopes to equip these locales with a notion of conflict, letting us capture the full semantics of general event structures in the form of homological data, thus providing one avenue to the topological semantics of concurrent systems. This is joint work with Raymond Puzio.
• May 6, Sarah Rovner-Frydman: Separation logic through a new lens.
Abstract. Separation logic aims to reason compositionally about the behavior of programs that manipulate shared resources. When working with separation logic, it is often necessary to manipulate information about program state in patterns of deconstruction and reconstruction. This achieves a kind of “focusing” effect which is somewhat reminiscent of using optics in a functional programming language. We make this analogy precise by showing that several interrelated techniques in the literature for managing these patterns of manipulation can be derived as instances of the general definition of profunctor optics. In doing so, we specialize the machinery of profunctor optics from categories to posets and to sets. This simplification makes most of this machinery look more familiar, and it reveals that much of it was already hiding in separation logic in plain sight.
• May 13, Tai-Danae Bradley: Formal concepts vs. eigenvectors of density operators.
Abstract. In this talk, I’ll show how any probability distribution on a product of finite sets gives rise to a pair of linear maps called density operators, whose eigenvectors capture “concepts” inherent in the original probability distribution. In some cases, the eigenvectors coincide with a simple construction from lattice theory known as a formal concept. In general, the operators recover marginal probabilities on their diagonals, and the information stored in their eigenvectors is akin to conditional probability. This is useful in an applied setting, where the eigenvectors and eigenvalues can be glued together to reconstruct joint probabilities. This naturally leads to a tensor network model of the original distribution. I’ll explain these ideas from the ground up, starting with an introduction to formal concepts. Time permitting, I’ll also share how the same ideas lead to a simple framework for modeling hierarchy in natural language. As an aside, it’s known that formal concepts arise as an enriched version of a generalization of the Isbell completion of a category. Oftentimes, the construction is motivated by drawing an analogy with elementary linear algebra. I like to think of this talk as an application of the linear algebraic side of that analogy.
Her talk is based on her thesis:
- Tai-Danae Bradley, At the Interface of Algebra and Statistics.
• May 20, Gordon Plotkin: A complete axiomatisation of partial differentiation
Abstract. We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof makes use of Severi’s theorem that all multivariate Hermite problems are solvable. We also hope to present a number of related results, such as decidability and Hilbert-Post completeness.
• May 27, Simon Willerton: The Legendre–Fenchel transform from a category theoretic perspective.
Abstract. The Legendre-Fenchel transform is a classical piece of mathematics with many applications. In this talk I’ll show how it arises in the context of category theory using categories enriched over the extended real numbers . It turns out that it arises out of nothing more than the pairing between a vector space and its dual in the same way that the many classical dualities (e.g. in Galois theory or algebraic geometry) arise from a relation between sets.
I won’t assume knowledge of the Legendre-Fenchel transform.
• June 3, Nina Otter.