You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
It's the first time I post here. I am happy to get some feedback for a paper that I have been working for quite a bit, together with @Greta Coraglia , @Ülo Reimaa , (or @Ülo Reimaa ?) and Davide Castelnovo.
The paper is "The fibration of algebras", it's temporarily hosted on my page, here, and for some time we felt its subtitle might have been something like "feels like a bunch of things that should have been observed somewhere, but weren't, so here we are with an 80-ish pages long note"
The paper in a nutshell: often one is led to study functors that "depend on one or more parameters". For example: there is a polynomial endofunctor sending a set to , one functor for every set . This is a nice polynomial, that people studied a lot (especially its algebras: the initial object in its category of algebras is ). But now, instead of the functor , in order to classify "the polynomial", it would be very convenient to study its shape, i.e. the "anonymous" functor sending a given parameter to the functor taken at that particular parameter. This association is itself a functor, and now one can say: to understand the polynomial, let's study its category of algebras, but with respect to all parameters at the same time, or rather, coherently taking into account the various parameters.
This begs various questions: 1) how does one collect all the various categories Alg(F_A) together? 2) What is a similar construction for a more general polynomial, or a more general parametric functor? 3) Are there other examples? 4) Does this theory scale easily (for example: what if is a co/monad, are there other examples in this sense)?
The paper gives various answers: 1) You build a fibration, the "fibration of algebras" of the title, over a category of parameters, for a family of endofunctors. 2)-3) There are enough examples to work on this for a couple of years, which I plan to do. 4) The theory scales extremely well: for example, a parametric monad is just a monad in a certain coKleisli category; and its fibration collecting all the Eilenberg-Moore (resp. Kleisli) is its EM-category (resp., is a Kleisli category).
It turns out, and this was totally unexpected when we started studying this stuff, that a fruitful way to think of all the EM(T_A) stitched together is as a semidirect product (hence all my questions on the matter, here, lately) , where abstracts a way the monoidoid acts via homomorphisms on another monoidoid . (Currying the parametric monad into a functor is an action of on , after all!)
This is exciting for a variety of reasons:
1) sending (A,X,T) to is a functor from a domain of the form , shoutout to the [[microcosm principle]]!
2) the operations of semidirect product of groups is a left adjoint to a canonical functor
3) the categories fit into a short exact seq. , which is universal in a 2-category of "extensions of A by X" (yes, we have an analogue of Baer sum: Ext¹(A,X) is symmetric monoidal as soon as are pointed categories).
4) Examples of this construction are: the simple fibration in categorical logic, the category of cocommutative Hopf algebras on a field of characteristic zero, thanks to the celebrated Cartier-Gabriel-Kostant "reconstruction" theorem, Beck modules, and many, many, many, many, others.
The paper is very quirky in many ways: it's very long. It strives for the maximal level of generality in some respects, as much as we could provide, but some of its ideas feel like a hack (we don't know why some results are trivially trivial, so to speak). Proofs are omitted. It ends abruptly, just before we have some leverage to really apply this language somewhere; but most importantly, it ends by acknowledging how uncommon it is that we acknowledge how difficult it was to write down something that in hindsight is "totally obvious".
I really care about this stuff, I have been thinking about it on-and-off since March 2022; yet, I still feel these many pages have just scratched the surface of a longer, deeper story, that probably can be told better than I did, with immense help from my coauthors.
I will happily listen to your feedback.
Very interesting fosco. My attention was captured by an example I missed before, the simple fibration. Recently I realized I need to talk about it in general complete 2-categories, but I couldn't come up with an abstract definition.
It seems like you did!
Correct me if I'm wrong, but you show that, in , the simple fibration associated to a cartesian category is the co-Kleisli fibration of the monad in . Am I wrong? And do you expect this result to generalize to suitable 2-categories?
I will use a slightly different notation than in the paper, but yes, this is somehing we cover there.
What we call the "regular representation" of a Cartesian category is the parametric functor arising from the product: for each fixed in you then get a comonad . The regular representation exists, of course, for every monoidal category, but is a comonad only for the Cartesian structure.
If your category is in fact a 2-category, now, you can consider all the following objects:
and in each of these two cases you can consider strict algebras, pseudoalgebras, lax algebras, oplax algebras... and each case gives rise to a fibration or opfibration.
Now an endofunctor algebra for is a functor for some , i.e. an endo-1-cell in the coKleisli category of , so a parametric endofunctor is an endo-1-cell in , and a parametric monad is a monad in , and a comonad is a monad in in , all over the object .
In a generic 2-category I would say that you can define some flavour or the fibration of coKleisli categories of (according to whether you need strict algebras, pseudo, lax, oplax...) and "the simple fibration" is the fibration that you get from a "Cartesian object" as... ah, I have to write more than I can now. But yes, I think I can obtain what you want, although it will be somewhat tautological.
The non-tautological step is that some universal construction made of inserters and equifiers gives a fibration (in general, is not a fibration for two parallel ).
A Cartesian object of (ambient Cartesian 2-category) is a 0-cell such that is a left adjoint. The right adjoint is "product structure".
Every Cartesian object of induces a regular representation through its product structure, and thus a parametric endo-1-cell starting the machinery of §4.7.1.
It seems the answer is yes. But I'm lost in the details.
Here's my guess:
You start with a parametric comonad , arising from the 'regular representation' of a cartesian object in a 2-category . Now this is a comonad over in . Take coKleisli object. This is the simple fibration associated to the cartesian object .
Yes, I think if K=Cat and the comonad is "product by an object" this is exactly what you get. Fix a category , "product by an object" is a parametric comonad in , i.e. each is a comonad and naturally so.
The coKleisli object of this comonad in the sense of the formal theory of comonads in a certain 2-category is the simple fibration that Jacobs defines.
Should I write this more explicitly? Probably it deserves to be remarked.
Also: I think in a generic 2-category there's nothing more, nothing less than this, you only lose the possibility to "evaluate" on points of
Indeed!
Maybe you wrote this explicitly enough for the general case, I was just too lazy to do my homework :grinning_face_with_smiling_eyes: there doesn't seem to be a specific example for the simple fibration, no
I added a few lines that clarify this point.
image.png
Crossrefs might have changed, but at the same link there is an updated pdf! As of today, Remark 4.2.8 covers what I told you yesterday. It was implicitly stated, but it's better this way.
Lovely! I now realize @Jules Hedges told me something like this a long time ago.
in what context? This exact statement? :grinning:
More or less. I'm having a hard time recalling... I just remember it was an observation about lenses: the simple fibration is the opposite fibration of 'simple' lenses, while the arrow fibration is the opposite of dependent lenses. Jules told me something like, the first is a coKleisli construction and the second a coEM, but this doesn't check out so I must misremember something
Let's see if he chips in
In general, I guess you are aware that in optics & related topics we do have a fair share of parametric endofunctors, like actegories
ah, I remember something like that on twitter (lol), where I was telling him "hmm, this looks like the simple fibration"
Matteo Capucci (he/him) said:
In general, I guess you are aware that in optics & related topics we do have a fair share of parametric endofunctors, like actegories
yep, part of this was also motivated by actegories
Here's the full thing:
If your category has finite products:
If your category has finite limits:
Using the neat fact that
All of these are written in different places (only the one for lenses came from me)
Nice. Do you have it written down somewhere, so I can cite it?
Also, can you clarify your notation when you say , what do you mean exactly? The opposite fibration, the opposite of the total category, the fiberwise opposite...?
fosco said:
Nice. Do you have it written down somewhere, so I can cite it?
Afraid not. I ought to record it in a blog post, but the best I can do is trying to remember where they're all individually recorded. The simple fibration is in Bart's book, lenses is in my paper "Morphisms of open games", for the arrow category I think I found it in Handbook of Categorical Algebra, and for containers it's probably in the original Containers paper ("Categories of Containers" by Abbott et al) or in Abbott's PhD thesis
fosco said:
Also, can you clarify your notation when you say , what do you mean exactly? The opposite fibration, the opposite of the total category, the fiberwise opposite...?
By this I mean the fibrewise opposite of the total category, ie. apply the Grothendieck construction to , etc
Nice, I was waiting for this paper since I saw your talk (at ItaCa iirc). Now I need to find some time to read it :) So I'm not sure how much of this comment will be relevant to your work.
What you presented made me think of some work I did during my PhD and that ended up in my thesis. I've been meaning to write a paper about it but haven't had the time. Some context: like you mentioned in the paper, the Grothendieck construction can be understood as a strict 2-pullback of categories and pseudofunctors. But this picture cannot directly be extended to, for example, the Bénabou-Grothendieck correspondence between functors and lax normal functors into Dist, the bicategory of distributors (or profunctors). Basically it is because of the laxity of the functors: you cannot define the composition in the pullback pairwise, since two images along the lax functors won't agree. The idea to get around this is to take composition not as a data but defined it universally with virtual double categories and then to use op-fibrations of vdcs to lift the composition from the domain of the lax functor to the Grothendieck construction. It's also interesting conceptually since it gets a fibrational perspective on the Grothendieck construction.
Going a bit more into the details: in a vdc, there are "universal cells" whose codomain is the composition of horizontal maps. Then given a functor of vdcs, one can define a notion of "opcartesian cell" which is a cell in the domain vdc that has a similar universal property than a universal cell but parametrised by a cell in the codomain. This is really a categorification of opcartesian multimaps for opfibrations of multicategories. Now, it is not hard to prove that an opcartesian cell over a universal cell is universal. That means that given a functor of vdc that has enough opcartesian cells, if is representable (i.e. a double category) then is too. In the following, I will talk about opfibrations of vdcs for functors with all opcartesian cells.
Before going into the main point some remarks: the category of vdcs and their functors has all pullbacks where everything is defined pairwise (since the functors are strict). A functor of representable vdcs correspond to a lax functor of double categories. And opfibrations of vdcs are closed under pullback.
To the main point: one can consider the forgetful functor from the vdc of pointed distributors to the vdc of distributors, it is an opfibration. There the distributors are the horizontal maps and the vertical maps are functors. Now, given a functor of vdc one can take the pullback with to get a vdc . Since is an opfibration and these are closed under pullback, is opfibred over . Furthermore, if is representable, so is . This gives the composition in the Grothendieck construction as a universal property. One can show that some other fibrational properties of ensures that when is a bicategory or a category so is . All of this can of course be done also with replacing (which I do in the following).
I think you get graded functors by considering a monoidal category to be a one-object-one-vertical-map representable vdc (i.e. a one-object bicategory). I think what you do is similar, but you don't ask for the category to be monoidal so you get a one-object-one-vertical-map vdc that only has square cells (the codomain is a single horizontal map. It is not representable (but the property of having only square cells will be lifted to the Grothendieck construction).
Instead of considering this embedding of categories into vdcs (where you send objects to horizontal maps and morphisms to cells) one might when to send objects to objects and morphisms to horizontal maps. I think the link there could be done by considering the construction (generalising the construction). It should take a vdc to its vdc of horizontal endomorphisms. This can be refined to pointed ones by asking for unit cells and to monoids (in the sense of vdcs, so monads) by asking for unit and multiplication cells.
Anyhow, there are probably more thing to say but I think this message is already long enough... The main point is that going to vdcs can make the concepts neater, and let one replace "laxity" by "universality". I am curious to know if some of what you all did can be adapted in this language (I will definitely look into it when I have more time). Also it could be interested to look if moving from to can give a similar theory for promonads.
Now that you appeared in the discussion I remember our short email exchange. At the time, most of your story flew over my head but now it not only makes sense, but feels like you are unraveling some formal content that might be a great help in polishing the theory.
am curious to know if some of what you all did can be adapted in this language
I am also curious. It might be a matter of adapting it, but at the moment I can't see a real obstruction...
Yes, I should definitely read the paper carefully to see if anything cries "opfibrations" to me ;)
I have been busybusybusy for the last few months.
solving, as a byproduct, this old question of mine
Please, give me/us feedback!
fosco said:
- Andrea Laretto, my student, is about to pull a fantastic trick with coends
I'd love to give feedback on this one but we only have the abstract :)
Yeah, we're polishing the last bits in this very moment ;-)
I'm also SUPER interested in this directed type theory paper :eyes:. Congrats on all the stuff!
In 48 hours this will be on arXiv.
dinat_directed_pre_arxiv.pdf
Enjoy!
fosco said:
In 48 hours this will be on arXiv.
dinat_directed_pre_arxiv.pdfEnjoy!
Congrats!
This is interesting! I'm a little unclear on what you're saying about semantics in e.g. Warning 2.1. Are you saying that you have a syntax without a semantics that is just inspired by the behavior of dinatural transformations? Or that your syntax does have semantics in a "para-hyperdoctrine" whose fibers are the paracategories of dinatural transformations? Or that you don't actually have a syntax at all, but are just describing the behavior of this para-hyperdoctrine using a notation that looks syntactic?
Mike Shulman said:
This is interesting! I'm a little unclear on what you're saying about semantics in e.g. Warning 2.1. Are you saying that you have a syntax without a semantics that is just inspired by the behavior of dinatural transformations? Or that your syntax does have semantics in a "para-hyperdoctrine" whose fibers are the paracategories of dinatural transformations? Or that you don't actually have a syntax at all, but are just describing the behavior of this para-hyperdoctrine using a notation that looks syntactic?
Hi, thank you for the comment! We meant the third option: we don't have a formal syntax, and our notation should be interpreted semantically, but we tried to make the notation suggestive of the fact that one can make all of it precise and actually have a formal system. We remark in the end that such a syntax would have a truly compositional model, e.g., in the category of posets where dinaturals compose trivially. The second option you mentioned seemed a bit too imprecise/unsatisfying to us (but it can be done), and the first a bit too ambitious for a directed type theory with just a single model in posets, which is indeed compositional but a bit degenerate; so we decided to instead just present a series of "semantic" results and leave a precise presentation of the syntax (and "directed doctrines") for our next paper, since it can definitely be done and might be something of interest (I have some stuff in Agda ready for this!).
Amazing work! Small question, in the example 5.16 (Yoneda) only naturality on was shown, right? Does naturality on follow by putting it on the brackets or does this not typecheck?
Fernando Chu said:
Amazing work! Small question, in the example 5.16 (Yoneda) only naturality on was shown, right? Does naturality on follow by putting it on the brackets or does this not typecheck?
Thank you! Semantically, what you describe can indeed be made to work, and dinaturality in for the whole map is the naturality in you're talking about. There is a caveat about size, however: the categories in context we consider in the paper are always small categories (they are all elements of , the large category of small categories), whereas is a large category, since it is a functor category into a large category , the large category of small sets. In particular, in such a situation you wouldn't even be able in general to compute the large (co)end: a way to avoid this is to make it so that the dinatural transformation itself is taken to be between functors into , the larger category of large sets (which is large complete). A type theoretical intuition in Agda for this is that, given some type A : Set 0
, the type A → Set 0
has itself type Set 1
, and if you want to quantify over elements of that type your quantification as a whole becomes a type of Set 2
. In a sense you're now quantifying over predicates (presheaves), so you need a way to talk about second-order logic. I hope this helps!
fosco said:
In 48 hours this will be on arXiv. [...]
(By the way, the arXiv version of the paper is out! Some typos fixed, so thanks to everyone who helped!)