Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I’ve decided to bite the bullet, intending to clean up the various messes which have been left for a few years at cycle category and cyclic order. On Mike’s advice in a discussion box in the remarks section at cyclic order, I had a look at the Berger-Moerdijk paper on generalized Reedy categories, and after a bit of work their description of Connes’s category became quite clear to me, but they stop short of giving an exposition in the style of “Australian category theory” – not their style, perhaps. I’ve been having a think about all this, and would like to run a few things past you good category theorists.
One observation is that the material on what they call a “crossed -group” ( a small category), and its total category, fits pretty neatly into the language of distributive laws. Recall that a category can be regarded as a monad in a bicategory of spans. This means that if I have two categories = monads and in , and a distributive law between them, say
then I can form a new category = monad in the bicategory of spans.
There are many, many examples of this sort of construction. In the context of their paper, their notion of -group is such an example of a distributive law (whose total category is exactly the monad composite). One of the categories is regarded as a span
with its monad structure. Another is a sum of groups indexed by , which forms a groupoid G, regarded as a span
again with a monad structure. What they call a crossed -group consists precisely (I believe) of two such monads equipped with a distributive law between them, where I write composition in Leibnizian order so that refers to a pullback of a diagram
More precisely, would be, in their notation, (lying in the fiber of the span composite ).
Then they describe the Connes cycle category as a total category which in our notation would be denoted , where the groupoid is the sum of all finite cyclic groups and is the simplex category. They describe the relevant distributive law, modulo the translations above, in terms of a restriction of another distributive law of the form , where is the groupoid of finite permutations.
It’s at this point where a more conceptual description of what is truly going on seems possible. The idea is that there is a forgetful functor from symmetric monoidal categories to monoidal categories, and another from monoidal categories with a monoid object to monoidal categories. Both of these are (2-)monadic, I believe, and can be described in terms of clubs.
As we know, distributive laws have to do with liftings of monads through monadic functors. In the present case, it seems that the distributive law has to do with a doctrinal lifting of a club (attached to the doctrine “monoidal categories with a monoid”) through the forgetful functor .
It seems to me that there ought to be very conceptual grounds on which to expect the existence of that particular lifting. In any case, I want to think of the category as just a “symmetrification” of the walking monoid , i.e., we’re just applying a change-of-doctrine map to the theory of monoids, from monoidal categories to symmetric monoidal categories.
Similarly, I guess there ought to be a doctrine intermediate between monoidal categories and symmetric monoidal categories, called “cyclic monoidal categories”. I can’t find mention of what I mean through a quick Google search, but whatever they are, I am assuming they can be described as algebras of a club governed by the groupoid (just as symmetric monoidal categories are algebras of a club ).
In other words, I am proposing that doctrinally, the Connes cyclic category is the “cyclification” of the walking monoid.
Do people discuss such things, somewhere, somehow?
The description of “crossed groups” as distributive laws in is really nice! I don’t quite follow what’s going on with the rest of it though; how do you get from a distributive law in to a distributive law of clubs/monads?
To answer your question, this doesn’t ring any bells for me. Although the notion of “cyclic monoidal category” might be related to the notion of “shadow” defined by Kate Ponto. A shadow on a monoidal category is a functor , for some other category , together with cyclicity isomorphisms satisfying appropriate axioms. Maybe a “cyclic monoidal category” is related to one equipped with a shadow where is the identity functor, or something?
Sorry if I wasn’t being clear. The basic hope was that if you have an algebraic theory (like the theory of monoids) that is expressible in the doctrine of monoidal categories, let’s say just a one-sorted theory to keep things simple for now, and you want to switch that theory over to a richer doctrine such as the doctrine of symmetric monoidal categories, then it should be given by some simple construction like . That is: the one-sorted theory is expressed by a monoidal category called a “pro” (prop minus the p), with underlying set of objects = arities . As a category, this category = span monad has the form . Then you have the free symmetric monoidal category generated by a single sort, which as a span also has the form , and you want to compose them in some way, in effect adjoining symmetries in a sensible way.
We can put the club stuff on hold, if this seems to be a clearer description of what I was aiming for.
And just to add an additional, hopefully clarifying comment: I meant it when I said (monoidal) algebraic theories , i.e., I mean for the generating operations of to have multiple inputs but just one output, in order for such a simple-minded construction like to do its job properly.
The underlying point here is that the relevant distributive law is to be guided purely by naturality considerations. A simple example should get the point across: if we have -operations and , and we want to think of the theory qua the doctrine of symmetric monoidal categories, then naturality of the symmetry would force the equation
which means the distributive law should take the element of the span to the element of .
That’s what’s really going on in the description of (as found in Berger-Moerdijk). But if you think about it a little, such a simple description of change-of-doctrine applied to a theory, from monoidal categories to symmetric monoidal categories or cyclic monoidal categories, as being just or , wouldn’t be so simple if we were considering more general pros . Here’s another way of putting approximately the same thought: if you have a purely coalgebraic pro , then you’d better use instead to switch doctrines (and again let naturality guide the form of the relevant distributive law ).
(By the way – thanks Mike not just for your response but for pointing me to the paper by you and Kate; I’ll have a look.)
Okay, I get a bit of the idea I think. Normally when I think of lifting a theory from one doctrine to a richer doctrine , I think of doing it “universally” so that a -model in a -category is the same as a -model in its underlying -category. That sort of lifting doesn’t require any extra structure on , it just exists universally. Are you saying we can instead choose some extra structure on (namely, a distributive law) to lift it to in a different (hence not universal) way?
This also reminds me of section 6.7 (page 169) of HOHC on “change of shape” morphisms between generalized multicategories, which are also constructed as certain composites in bicategories of spans.
No, I didn’t think I was saying that. I thought what I was doing just now was giving a simple direct construction of what you call in terms of , at least when is an algebraic theory in = doctrine of monoidal categories, and is something like the doctrine of symmetric monoidal categories, or braided monoidal categories, or cartesian categories… or indeed cyclic monoidal categories (modeled after your “shadows”).
The thread started off being about the cyclic category , and the description I’m putting forth, which I’ve never seen before, is that it is the “theory of monoids within the doctrine of cyclic monoidal categories”, i.e., it classifies monoids within this doctrine: if is a cyclic monoidal category, then the category of cyclic monoidal functors is equivalent to the category of monoids in . Parallel to the way that classifies monoids within the doctrine of monoidal categories. Moreover, I am suggesting in #3 and #4 that this abstract conceptual description leads directly to its explicit concrete description, as . If someone asks you how to write down the distributive law used in this description, you can answer that it’s just the obvious law you need in order to ensure that the cyclic monoidal structure constraints (which come from , the groupoid of finite cyclic permutations) do in fact behave as natural transformations when viewed in , which is what I was trying to explain in #4 via an example.
Thanks for your feedback, and please let me know if I’m not being clear.
Oh, are you suggesting that for any -theory there is a “canonically defined” distributive law that we can use to construct ?
Yes, that is what I’m hoping to be able to prove, restricting for now to = doctrine of monoidal categories, and a doctrine of somewhat more enriched monoidal type (symmetric, braided, cyclic, etc.), since I’m not quite sure what shape a more general theorem would have. And also with the proviso that a -theory means generated from operations each having a single output sort, and that equations declared in the theory are between terms of the same type , again with single output sort . (The last is probably already understood, but I’m playing it safe here; it would ruin the hoped-for theorem if we allowed -equations to occur between terms with output that don’t come about by tensoring together equations of the type I just described.)
Not to belabor the point, but in the case where is symmetric monoidal categories, the idea is to adjoin symmetry isomorphisms to the -theory, and be able to rewrite a map where is a symmetry isomorphism as where is another symmetry isomorphism. Seems simple enough, right? String-diagrammatically, push symmetry isomorphisms to the top, by a kind of “combing” procedure. That dictates the form of the distributive law: .
(I wonder if the language of (covariant) clubs would be useful in finding a nice general shape for the hoped-for theorem.)
I often use the word “theory” to imply the unary-output restriction (e.g. that’s what -multicategories and the relevant kind of type theory represent), so I’m totally on board with you there. Are you sure that you want to do this construction in rather than -? The latter being the bicategory in which monads coincide with -multicategories, i.e. exactly unary-output -theories, so it seems a more natural place to work to me.
Just spitballing a bit, let be the free-monoid monad on , which extends to , and let be the induced monad on . Let be another monad on with a monad morphism such that each functor is bijective on objects. Then an ordinary multicategory , i.e. a (co-unary) -theory, is a span with a monad structure in -. But we can also apply to the discrete category on regarded as an object of , to obtain a category that we can represent by a span . But since is bijective on objects, , so is also a span . So maybe this span has a distributive law over the span such that the composite is the free -multicategory generated by . The latter has another explicit description as the composite of the profunctor with (the representable profunctor determined by) the functor ; maybe we could show that this coincides with the above distributive-law composite.
(I’m using the language of UFGM, which unsurprisingly I am most comfortable with, but probably the language of clubs would also suffice.)
so it seems a more natural place to work to me.
Yes, that makes total sense. At the time I wrote #1, I was in the midst of understanding just as a category, but the conversation has moved on to a point where your suggestion makes more sense – thanks.
I’ll need more time to study your second paragraph.
1 to 12 of 12