AMS talk 10/24/15

About two months ago I gave a talk at the AMS Fall Western Sectional Meeting.  While I could have safely rehashed my QPL talk, I decided to push forward instead.  That may or may not have been the best idea – the results were certainly less polished.  On the other hand, I was able to describe controllability and observability of a control system in terms of string diagrams.  This is something that was painfully missing from my QPL talk’s results in July.  Seeing the nontrivial constants in the string diagrams the quantum folk were using provided the key insight, and I wanted to capitalize on it as soon as possible.

The punchline of the AMS talk is that the duality between controllability and observability noticed by Kalman in the late 50s and early 60s can be expressed in terms of a PROP, which is a kind of symmetric monoidal category.  In particular, this PROP includes a subPROP of finite-dimensional vector spaces and linear relations, which is basically what Paweł Sobociński deals with here under the name of Interacting Hopf monoids.  Okay, so the actual punchline is that the duality Kalman noticed six and a half decades ago between controllability and observability? it’s simply time-reversed bizarro duality.

Bizarro is Sobociński’s term (seen in episode 7 of his blog), but I’m kind of partial to it.

QPL 2015

On July 17 I gave a talk at Oxford in the Quantum Physics and Logic 2015 conference.  It was recently released on the Oxford Quantum Group youtube channel.  There were a bunch of other really cool talks that week.  In my talk I refer to Pawel Sobocinski’s Graphical Linear Algebra tutorial on Monday and Tuesday, as well as Sean Tull’s talk on Categories of relations as models of quantum theory.  There are benefits to speaking near the end of the conference.

CSUSB colloquium

I’m giving a talk tomorrow afternoon at the CSUSB Mathematics department.  I will explain some of the stuff I’ve been working on, then shift gears to show how the general machinery can be applied to another mathematical landscape: knots.  Sticking purely with knots is a bit restrictive, so I almost immediately skip ahead to the open version of knots, i.e. tangles.  Luckily John Armstrong posted an article on arXiv in 2005, where he showed (among other very nice things) that tangle groups really are tangle invariants.

While I probably will not mention it tomorrow, another landscape that is being opened up (in the same sense that tangles open up knots) is Markov processes.  Blake Pollard is doing exciting work on this front, and the same general machinery I’ll be talking about should have some interesting things to say about Markov processes as well.


After more delays that I would like to admit, I finally got around to making this. Perhaps some explanation of what’s going on in the picture is in order. We begin with a category with (all) pushouts, starting with some objects and morphisms arranged as chained spans. A pushout is used to compose the two spans on the left. This gives a new span, L \rightarrow \Gamma'' \Gamma' \leftarrow J, which in turn can be composed with the span to its right via pushout. This is just one way that we can compose the chain of three spans. If we had built up from right to left instead of left to right, we would have \Gamma'' (\Gamma' \Gamma) at the top instead of (\Gamma'' \Gamma') \Gamma.

The associative property is really nice, so it would be good to show those two ways of composing spans are “the same” in some appropriate sense. Spoiler: that sense is “up to isomorphism.” Instead of directly finding them isomorphic to each other, it is easier to show each is isomorphic to some other thing – the colimit of the entire diagram we started with. This colimit will here be called an associator; it is something that both compositions of all three spans will be isomorphic to. I’m just going to sweep under the rug the question of whether that colimit will exist and just assume it does in this post.

So we’ve got the groundwork set, now we need to take advantage of some universal properties to give unique maps that make sub-diagrams commute. The first universal property taken advantage of is that of the first pushout. The associator has arrows going to it from \Gamma'' and \Gamma', so there will exist a unique morphism, \Gamma'' \Gamma' \rightarrow \Gamma'' \Gamma' \Gamma. such that everything commutes. Going up a step and using the arrow we just made, we can play the same game to get a unique morphism (\Gamma'' \Gamma') \Gamma \rightarrow \Gamma'' \Gamma' \Gamma that still makes everything commute.

To go in the reverse direction, we need morphisms from each of the Gammas to (\Gamma'' \Gamma') \Gamma. We already have one from \Gamma, and the other two can be built by composing morphisms. We can join two arrows together, tail to tip, to get a single arrow regardless of what category we are in. Now the universal property of the associator kicks in, giving a unique morphism \Gamma'' \Gamma' \Gamma \rightarrow (\Gamma'' \Gamma') \Gamma, but there’s a catch. We only know it makes some of the diagram commute. We have to put in a bit more effort to show the arrows involved in the pushouts will commute, too. The first step of this isn’t too bad — the three arrows that don’t point directly at \Gamma'' \Gamma' \Gamma will commute because the morphisms from \Gamma'' and \Gamma' to (\Gamma'' \Gamma') \Gamma commute with them by construction.

The universal pushout maps are a bit trickier, but since both legs of the pushouts commute with everything else, the universal maps will commute as well. Without the picture, that sentence might be a bit hard to understand. Look at the picture. They say those things are worth a thousand words. As parts of the diagram are shown to commute with the blue arrow on top, those part turn dark green. The arrows that already commute with everything get highlighted when they are used to show other arrows commute with everything. That should clarify what the picture is doing. Once everything commutes, the arrows turn black again, and we are left with unique maps in both directions at the top of the diagram that commute with each other. Long story short, this gives an isomorphism between the composition of spans by pushouts and the composition of spans “all at once” by associator. Watching the animation in a mirror gives the other way of composing spans by pushouts as isomorphic to this as well.

So this picture together with its mirror image shows (\Gamma'' \Gamma') \Gamma \simeq \Gamma'' (\Gamma' \Gamma), which is really the best we could possibly hope for when pushouts themselves are only unique up to isomorphism.