This is the second blog post in a collaborative project between me and Ben Bumpus, whose blog can be found here. The first post is here. We devoted a week to messing around with the categorical machinery and now have a little collection of lemmas and a clearer direction. Lots of stuff didn’t work like we thought it might and there are a couple of things that seem like nice results but might not fit into the larger project anymore. This post is devoted to recording some of those things. It will be a little disjointed but I hope you’re able to get something out of these ideas. Ben has written a parallel post about one of our findings here. Watch out for more intallments (both here and on Ben’s blog) – we’ll be documenting our new ideas sometime soon.
In the previous post, we saw how we can express nestedness of separations in the language of category theory. In the following section, we generalise this.
First though, let’s recap the setting. We can think of a separation of a graph as a really simple tree decomposition, one with two bags and one adhesion. We can think of a tree decomposition of a graph as a diagram in the category of graphs; we have objects corresponding to bags, objects corresponding to adhesions and monic spans from these adhesions to their bags:
The diagram’s colimit (when we glue it all together) must be .
We write (fracturings of ) for the category of diagrams whose colimits are some object . Morphisms in this category are natural transformations that commute with the colimit cocones:
Interlacing
Recall that, in the category of fracturings of an object , two separations and are nested if there is a span where has shape . The intuition of this can be thought of as follows:
The span tells us that the -shape decompositions are actually just coarser versions of a -shape decomposition and they are somehow ‘lined-up’.
This definition seem to be a bit restrictive though. Shouldn’t we be able to say that can have any path shape? This doesn’t quite work. Indeed, given crossed separations and , it might be that a path of length three () factors through as follows:
Since it factors through the product, it spans and .
So what’s going wrong in this example? Well, the map from into somehow ‘folds in on itself’. In fact, this is precisely the problem. Let’s make the following definition.
Definition We say that a map between fracturings is a contraction map if the map on the shapes of the decompositions is a contraction map. That is, if it just consists of contracting edges and identifying the end bags.
Now we can make the following generalisation:
Definition We say that two separations and are nested if there is a span of contraction maps where has path shape.
But why stop there? Why settle for boring-shaped decompositions?
Definition We say that a class of graphs is closed under subdivision. If for any and a subdivision of , we have .
Definition Let be a graph class closed under subdivision. We say that two fracturings and with shapes in are –interlaced if there is a span of contraction maps where .
In particular, nestedness of separators is interlacedness of fracturings with respect to the class of paths.
This machinery possibly has some nice applications to the mechanics of refining decompositions of a particular class of shapes. But we’re going to leave it here for now.
We found out more stuff about corners
Given a pair and of crossed (non-nested) separations, we can obtain four new separations, the “corner separations” from the intersections and unions of pairs of sides of the separations.
These corners are used in the theory of separations to refine systems of separations and have all sorts of nice properties.
Oberve that we can get corner separations via the following means:
Observation Let be a separation such that . Then either or is a corner separation.
That is, there are six unique ways to contract the product to a fracturing of shape .
One of the nice properties of corners is that any separation , that is nested with both of and , is nested with all four corner separations. This follows immediately from our above obersvation.
Let’s play around with limits some more. Suppose we are given crossing separations and a separation nested with both. Let and be nestedness-witnessing paths of length two for the pairs and respectively. Let’s take the pullback over .
Observe that factors uniquely into the product since it maps into both and . To figure out the shape of , we split into two cases based on exactly how these witnessing spans are:
We can ommit the second case; indeed, this is telling us that and were nested in the first place. The first case is the interesting one. We obtain this “tadpole”-shaped diagram that contains both the information about the product and the separation . In fact, the shape of the diagram gives us a canonical choice for which corner is “closest” to the separation . This normally requires a lot of poset machinery. That’s pretty neat!
That’s all for now. Keep an eye open for more installments soon!
Leave a comment