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.
I guess I should be answering this question rather than asking it, but here goes: are there "natural" examples of monads with arities in Weber's sense (or Berger-Melliès-Weber), which are not pointwise analytic? Concretely, in natural examples, for any , does the category of factorisations through some arity have a weak initial object?
Just to be a bit more explicit, morphisms to any are morphisms such that
and .
I don't know how to draw a diagonal arrow, but here's a diagram to aid intuition.
Let's ping @Simon Henry, who might have some clues...
So "pointwise analytic" is a generalization of "parametric right adjoint" where (1) the factorizations only have to exist through the specified arities and (2) the liftings for the generic factorization don't have to be unique?
If so, I think this starts to look (through the equivalence of p.r.a.s and functors with a left multi-adjoint) a lot like the [[solution set condition]] where a universal solution set is given by the arities. I could definitely believe that in natural cases of functors with arities (never mind monads with arities) that the arities form a solution set.
Yes, I think your interpretation is right, up to one subtlety: generic factorisations are only considered from representable presheaves.
The point is that, because of non-uniqueness, they do not build up to all presheaves in general.
Regarding your second point, I'm not sure what you conclude. If I understand correctly, the thing is that the considered functors may not be continuous. Crucially, most monads do not preserve the terminal object. Typically, the free monoid monad maps it to . Familial (=pra) functors preserve wide pullbacks, analytic functors would, I think, preserve pointwise weak pullbacks when this makes sense.
Yes, I definitely hope there are a lot of them that are not continuous as that is most of the interesting examples. The point is that the solution set condition is usually considered as a mild smallness condition and is implied by a lot of other mild conditions on the categories and functor involved, so it feels like the arity-bounded version would be about an equally mild condition on functors with arities.
Right, thanks. Indeed, I guess when you throw in non-linear equations you probably lose analyticity. Idempotence probably suffices. E.g., the finite powerset functor on sets has arities in finite sets, but is not analytic. Mmmh... I should definitely prove this latter claim, but don't have time right now. Will come back to it if no one else does.
Ok, a proof would be a bit tedious to write here, so I'll content with some intuition. It is relatively easy to prove that a map can only be generic if it picks the full subset . To get the point, let's consider the map picking . If it was generic, then the lifting we'd find for the square
would be a section of the map picking , which cannot exist.
Now, even the map picking the full isn't generic, since we cannot find a lifting for the following square.
Indeed, for any map , will pick a one-element subset of , hence not .