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 can I expect a coend (over a large category) to exist? For simplicity, let's say we're only working in . Suppose I have a profunctor . How can I know if the coend exists; and if it exists, is there a good way to compute it?
In case this is tricky for all , is there a nice class of profunctors for which the question becomes easier (maybe compositions of products, coproducts, and exponentials or something)?
@Harrison Grodin I know of two explicit ways to compute a coend. One is by taking a coequalizer of a certain diagram. The other is by taking the colimit over its category of elements. You can get the first by dualizing this nlab and the second way is also on the same article. It's here. I think if you are only considering -valued profunctors then all such coends exist because has all colimits.
Thanks Jade! I guess I was a bit concerned about size issues - can I take -wide coproducts in ? Or, for the second link, it seems like has to be a small category?
(I would believe that all coends exist - this would be great! All the examples I've tested manually seem okay. But, my "guess and check" strategy doesn't constitute a proof, and it wasn't clear to me that I could take these large colimits in all cases.)
Yes you're right. Saying Set has all colimits needs qualification. I'm sort of ignorant of the size stuff, but I think it's something like: to get colimits which are as wide as small sets you need to be in a universe with large sets.
For , the coend exists and equals , even if is large; this is a version of what is sometimes called the "co-Yoneda lemma". That this holds for large categories is treated in Kelly's book.
If is a small colimit of representables, then also exists, even if is large.
Thanks! I was hoping to compute coends like , for example, where . (As a concrete example, let and .) It doesn't quite seem to fit the co-Yoneda pattern, since is replaced by a profunctor ; do you know if there's a similar result saying that this style of coend exists?
Harrison Grodin said:
Thanks! I was hoping to compute coends like , for example, where . (As a concrete example, let and .) It doesn't quite seem to fit the co-Yoneda pattern, since is replaced by a profunctor ; do you know if there's a similar result saying that this style of coend exists?
Where does the d come from in this coend? I'm not sure about this coend, but here's another coend formed from two polynomial functors that I find interesting. First take the profunctors and and then take the coend (which is actually the profunctor composition valued on the pair (a,c) )
In Todd/my messages, is just some fixed object in . [Typo - do you mean ?] The coend you described is quite nice!
This doesn't answer your specific question, but another class of large coends that exist is for any . This is because Set is a [[total category]]; see also [[large cocompleteness]].
Harrison Grodin said:
In Todd/my messages, is just some fixed object in . [Typo - do you mean ?] The coend you described is quite nice!
What Todd mentioned (a presheaf that results as a small colimi of representables) is usually called a "small" presheaf. Handling the category of small presheaves on is often quite difficult. But some results stay true. I think the clas of profunctors you want to compute the coend of will likely be small (as soon as they are polynomials, indexed on a set, for example, you'll be fine.)
:smile: Also, give me more coends to compute! I have fun with that.
Thanks, Fosco, for the response and for the excellent book!!
I think the clas of profunctors you want to compute the coend of will likely be small (as soon as they are polynomials, indexed on a set, for example, you'll be fine.)
I think I will probably want products of exponentials, where the domains and codomains are polynomials. For example, things like:
Does it seem plausible that this kind of thing would exist in ? Or even better, if is a (-enriched) category (like the category of algebras for a monad) and the profunctor is , might this exist?
All of my desired examples are inspired by impredicative encodings (/ types) in type theory. Some fun ones I've been thinking about accordingly:
I think the answers are:
Spoiler
(By the way, I would assume someone has thought about all of these. Is there a known reference for them?)
When the integration variable appears a certain number of times covariantly, and another number contravariantly, do you interpret it "diagonalizing completely" all the occurrences? Meaning: are you considering the coend of sending to ?
If yes, these are "coends of higher arity", which reduce to (1,1)-ary coends, cf. https://arxiv.org/abs/2011.13881 (I'm using a similar notation, is the product of copies of and copies of .
Their existence is now a matter of smallness, and I believe these exist. As far as computing them, it often is a mess :grinning:
Yes, I'm thinking about diagonalizing completely. (I was thinking of , but I suppose the type you gave works too?)
Regarding your examples, do you know about Neumann's "Paranatural co/ends"? See proposition 4.4 here https://arxiv.org/pdf/2307.09289.pdf, where the "structural end" for an endofunctor T of is the carrier of the initial T-algebra. Paranatural ends, i.e. terminal paranatural wedges, coincide with terminal wedges (because wedges and parawedges coincide, although this simple observation isn't made in Neumann's paper), so the carrier of the initial T-algebra of a functor is the end (provided the equalizer formula given in Neumann yields the terminal parawedge, which I haven't been able to see).
Oh, yes, of course this would be in there!! I'll look further, thanks!