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.
When is a finitely complete and cocomplete category, then the list object of an object is the initial -algebra where is the endofunctor on . This means I can choose a list object of by choosing an initial object in .
I need a version of the universal property where I can choose all list objects simultaneously. That is I am looking for a category and some functor such that choosing list objects in is the same thing as choosing a left adjoint of . I'd also be satisfied with any other way which allows me to choose the list objects of a category all at once.
Is it possible to do that?
Sounds like (a category equivalent to) the Kleisli category?
Well, is usually also the free monoid generated by , so a natural thought is to take the category of monoid objects in and the forgetful functor. But I don't remember offhand what hypotheses on are necessary to ensure that every list object is a free monoid and every free monoid is a list object. It certainly suffices for to be a topos, but that's probably not necessary.
Mike Shulman said:
Well, is usually also the free monoid generated by , so a natural thought is to take the category of monoid objects in and the forgetful functor. But I don't remember offhand what hypotheses on are necessary to ensure that every list object is a free monoid and every free monoid is a list object. It certainly suffices for to be a topos, but that's probably not necessary.
Yes, I was also thinking about that. But I wasn't able to show that free monoids = list objects in my category. My category C is finitely complete, infinitary extensive and constructively well pointed (also I am only allowed to use intuitionistic arguments due to the situation I am currently in :/).
I spend the afternoon on it and came up with the endofunctor with . When I let be the functor which sends an algebra to then sending to the algebra should be left adjoint to if I am not crazy.
My understanding is that if you work with parameterised list objects, then they are always free monoids (e.g. see Lemma 3.4 of Saville–Fiore's List Objects with Algebraic Structure). Therefore, so long as your category has parameterised list objects, the two notions will coincide. I believe that the parameterised universal property often holds in examples, so it could be worth checking in your setting. @Philip Saville would be able to say more.
Nico Beck said:
I spend the afternoon on it and came up with the endofunctor with . When I let be the functor which sends an algebra to then sending to the algebra should be left adjoint to if I am not crazy.
Yes, I think that's true if you have list objects. But is it true that any left adjoint to that is of that form? In particular, if then is the first component of necessarily equal to ?
Nathanael Arkor said:
My understanding is that if you work with parameterised list objects, then they are always free monoids (e.g. see Lemma 3.4 of Saville–Fiore's List Objects with Algebraic Structure). Therefore, so long as your category has parameterised list objects, the two notions will coincide. I believe that the parameterised universal property often holds in examples, so it could be worth checking in your setting. Philip Saville would be able to say more.
This sounds promising, I will look at it later. :) My situation is that I only need a way to lift list objects from their mere existence to their actual existence (in the sigma type sense). I have a rule in my type theory which allows me to construct an actual adjoint of a functor when it satisfies the property that $$\forall d:D.\ulcorner \text{there merely exists $$\eta: d\to Uc$$initial among such pairs}\urcorner$$, but that left-adjoint functor constructor can only be applied in the empty context, hence my desire to get rid of the in the context. But I believe that when the free monoids actually exists, then I can use the mere existence of the list types and your result to show that the actual existing free monoids are also list types.
Anyway, thank you for the reference, I will check it out! :):)
Mike Shulman said:
Nico Beck said:
I spend the afternoon on it and came up with the endofunctor with . When I let be the functor which sends an algebra to then sending to the algebra should be left adjoint to if I am not crazy.
Yes, I think that's true if you have list objects. But is it true that any left adjoint to that is of that form? In particular, if then is the first component of necessarily equal to ?
Oh no, I should have done the other half of the proof too.
Nathanael Arkor said:
My understanding is that if you work with parameterised list objects, then they are always free monoids (e.g. see Lemma 3.4 of Saville–Fiore's List Objects with Algebraic Structure). Therefore, so long as your category has parameterised list objects, the two notions will coincide. I believe that the parameterised universal property often holds in examples, so it could be worth checking in your setting. Philip Saville would be able to say more.
I don't have much to add off the top of my head but I can say this:
List objects do not generally coincide with free monoids, eg if you look at the cocartesian monoidal structure on Set every object is the free monoid on itself but certainly not every object is a list object
Another way to look at list objects, beyond being parameterised initial list algebras, is that they are essentially algebraically-free monoids in the sense of Kelly's epic "A unified treatment of transfinite constructions" paper (somewhere around Sec 23 I think) - see the screenshot below, which states things a bit more precisely than in the conference paper. We give some conditions for list objects to exist but Kelly may give others that are more useful to you
3a7bab9d-4d14-43c9-9d04-d4c6879e34e5.jpg
I think a full answer would mean developing some of the theory of parameterised initiality /parameterised algebras etc. Marcelo and I did a little in the paper Nathanael linked, and there's also some results in Marcelo's thesis, but as far as I know the full story hasn't been spelled out anywhere - if you're interested on collaborating to do this, let me know! One thing to note is that if you're base category is closed the whole parametrised business goes away - there's no need to carry a parameter because you can curry it into the hom-object.
(having just double checked, Marcelo does develop a decent chunk of theory of paramaterised algebras in Chapter 6 of his book "Axiomatic domain theory in categories of partial maps", so that may also be worth a look for the general case)
Philip Saville said:
How does (3) in this list get along with list types in categories like ? There it seems like list objects exist, but they are not the free monoids. Is there something wrong with the list objects there that makes them not "real" list objects?
Philip Saville said:
- List objects do not generally coincide with free monoids, eg if you look at the cocartesian monoidal structure on Set every object is the free monoid on itself but certainly not every object is a list object
I meant the case originally mentioned of a category with finite limits and colimits, where the monoids are implicitly w.r.t. the cartesian monoidal structure.
James Deikun said:
Philip Saville said:
How does (3) in this list get along with list types in categories like $\mathrm{CPO}^{\bot}$? There it seems like list objects exist, but they are not the free monoids. Is there something wrong with the list objects there that makes them not "real" list objects?
I wasn't aware of this! Tbh I'm not sure, because as far as I know Cpo is generally quite nice. It's possible you have to take some care which monoidal structure you're using - as Mike points out, the classic notion of list object is for cartesian structure but if I remember right pointed Cpos will have a couple of choices (the generalisation to monoidal takes almost no effort, but has been considered less because the motivation comes from a type theory / programming perspective I guess)
Alternatively, I know people have considered various kinds of lazy list structures in Cpo to model eg lists in call by name PCF. One of the things Marcelo noticed for our paper was that these aren't list objects but are list objects with algebraic structure. So maybe that's what's going on?