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.
Polynomial comonads (on Set) are categories, but what about non-polynomial comonads?
I'm trying to understand what these look like, but I don't know any good examples. My go-to non-polynomial functor is an exponential , but this doesn't seem to support a comonad structure. Is there a canonical class of non-polynomial comonads, or good examples that arise naturally?
I guess you mean the covariant powerset functor?
I don't know of any on Set, but for any cohesive topos the flat modality functor is comonadic but not necessarily a polynomial functor.
(Set is trivially a cohesive topos where the flat modality functor is the identity functor on Set.)
There are lots of comonads that preserve only finite connected limits (equivalently, pullbacks). The easiest example is the topos of continuous -sets for a topological group. The cofree functor takes a set to the cofree not-necessarily-continuous -set on , then to the subset of this on points with open stabilizers, which is the coreflection into continuous -sets. Another example: for any topological space , send a set to the product of all the skyscraper sheaves on with stalk , with the product taken over all the points of . This has a left adjoint given by summing a sheaf over all its stalks, and the resulting comonad’s category of coalgebras is exactly the sheaf category. If the sheaf category isn’t of presheaf type then this comonad can’t be polynomial; roughly speaking this happens whenever there are infinitely many points so the stalks don’t preserve the big product taken in the right adjoint.
In fact a pullback-preserving comonad on Set is exactly the same thing as a Grothendieck topos with a chosen separating set of points, generalizing Ahman-Uustalu’s theorem on poly nomial comonads. There isn’t exactly a reference for this but it’s also not exactly a new result; Garner wrote his ionads paper about such toposes as comonads on slices of Set, and it’s not hard to compose such comonads with the sum-over-fibers comonad to get comonads on Set itself; relatedly, Johnstone has the theorem that the coalgebras for any pullback-preserving comonad on any topos are a topos, generalizing the better-known theorem for left exact comonads.
Kevin Carlson said:
There are lots of comonads that preserve only finite connected limits (equivalently, pullbacks). The easiest example is the topos of continuous -sets for a topological group. The cofree functor takes a set to the cofree not-necessarily-continuous -set on , then to the subset of this on points with open stabilizers, which is the coreflection into continuous -sets.
That preserves all finite limits, not just the connected ones (but it is only the finite ones, assuming the topology on is not closed under infinite intersections).
Yes, but my next example didn’t :big_smile: the point is that it’s not polynomial.
You can think of pullback preserving endofunctors of Set, which live in the coproduct completion of the Ind-completion of Set^op, as like polynomials where the directions at each position form a pro-set instead of just a set.
Kevin Carlson said:
Johnstone has the theorem that the coalgebras for any pullback-preserving comonad on any topos are a topos, generalizing the better-known theorem for left exact comonads.
This is definitely the result to know when looking for examples :space_invader:
I should mention I learned the topological group example from Simon Henry when David Spivak asked the same question last year on MO.
And I can’t remember for sure, but I think I might still not know any comonads on Set that don’t preserve pullbacks!
Presumably cofree comonads for non-pullback-preserving endofunctors on Set will give examples of non-pullback-preserving comonads? For example, start from , where is the finite powerset functor, for which the cofree comonad gives non-well-founded "synchronization trees" modulo bisimilarity.
That seems plausible! Does the cofree comonad even always exist? The construction I know for the cofree comonad on a polynomial critically uses preservation of connected limits to get convergence in countably many steps. It seems like you know what this particular cofree comonad is, at least, but I’d have trouble figuring it out from the phrase “non well founded synchronization tree”.
No! For finitary endofunctors on Set it does, for example On the final sequence of a finitary set functor shows that convergence takes steps (see also the references in there). That paper goes through the sequence for in Section 5.