Category Theory
Zulip Server
Archive

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.


Stream: learning: questions

Topic: Weighted (co)limits without (co)ends


view this post on Zulip Fawzi Hreiki (Dec 12 2020 at 13:04):

I'm trying to learn some enriched category theory, but it's a little difficult to wrap my head around ends and coends. I've seen the various definitions in the unenriched case (universal extranatural transformation, weighted (co)limit, etc..) and the weighted (co)limit approach is most intuitive to me. The problem, as I understand it, is that in the V-enriched case, we can only define weighted (co)limits once we have enriched functor categories, which themselves depend on V-valued ends.

Basically, my question is this: what is the proper hierarchy of concepts here? When developing enriched category theory, are (co)ends necessary from the get go or is is possible to define enriched functor categories and weighted (co)limits without them? If (co)ends are in fact necessary, is there some sort of intuition as to why that is?

view this post on Zulip John Baez (Dec 12 2020 at 17:29):

You can use weighted colimits to define coends or you can use coends to define weighted colimits. When James Dolan taught me this stuff he argued that it's more intuitive to start with weighted colimits.

view this post on Zulip John Baez (Dec 12 2020 at 17:32):

If you like analysis (as I do), weighted colimits are a natural concept, since they are analogous to integrals

f(x)dμ(x) \int f(x) d\mu(x)

where you need a function and a measure. The diagram you're taking the weighted colimit of is analogous to the function, while the weight is analogous to the measure.

view this post on Zulip Fawzi Hreiki (Dec 12 2020 at 17:46):

How are weighted (co)limits defined in the enriched setting without first defining (co)ends though?

view this post on Zulip Fawzi Hreiki (Dec 12 2020 at 17:47):

To define weighted (co)limits, we need representability and therefore enriched presheaf categories.

view this post on Zulip John Baez (Dec 12 2020 at 17:50):

This doesn't exactly answer your question but it should help you understand what's going on:

https://golem.ph.utexas.edu/category/2007/02/day_on_rcfts.html#c007688

view this post on Zulip Fawzi Hreiki (Dec 12 2020 at 18:19):

So the colimit of f:XLf: X \rightarrow L weighted over w:XopVw: X^{op} \rightarrow V is defined to be the (usual, conical) colimit of the composite Xop×Xw×fV×LLX^{op} \times X \xrightarrow{w \times f} V \times L \xrightarrow{\otimes} L? (here XX and LL are VV-enriched categories with LL tensored over VV)

view this post on Zulip Fawzi Hreiki (Dec 12 2020 at 19:24):

Ok no that's false - it's the coend of that composite.

view this post on Zulip Matteo Capucci (he/him) (Dec 14 2020 at 12:11):

I consider the 'Motivation...' paragraph here https://ncatlab.org/nlab/show/weighted+limit to be quite englightening (disclaimer: I wrote that paragraph)

view this post on Zulip John Baez (Dec 15 2020 at 21:31):

Okay, thanks! The page "weighted limit" also satisfies @Fawzi Hreiki's request for a definition of weighted limits in the enriched setting that does not mention ends.

view this post on Zulip John Baez (Dec 15 2020 at 21:34):

Here it is:

Let VV be a closed symmetric monoidal category, and let KK and CC be VV-enriched categories.

A weighted limit of the VV-functor called the diagram

F:KC F : K \to C

with respect to the VV-functor called the weight

W:KV W : K \to V

is an object that represents the VV-functor from CopC^{\mathrm{op}} to VV given on objects cCc \in C by

c[K,V](W,C(c,F())) c \mapsto K,V

and doing the obvious thing on homs.

view this post on Zulip John Baez (Dec 15 2020 at 21:35):

So that's pretty nice and quick!

view this post on Zulip John Baez (Dec 15 2020 at 21:45):

Expanding a bit: given cCc \in C we have two VV-functors from KK to VV, the weight

W:KVW : K \to V

and the VV-functor involving our diagram FF:

C(c,F()):KV C(c, F(-)) : K \to V

view this post on Zulip John Baez (Dec 15 2020 at 21:49):

Both these give functors from CopC^{\mathrm{op}} to the VV-category [K,V][K,V]. (The first depends trivially on cCc \in C, i.e. not all, while the second depends contravariantly on cCc \in C.)

view this post on Zulip John Baez (Dec 15 2020 at 21:50):

So, we get a VV-functor from CopC^{\mathrm{op}} to VV given on objects by

c[K,V](W,C(c,F())]c \mapsto [K,V](W, C(c,F(-))]

view this post on Zulip John Baez (Dec 15 2020 at 21:53):

And we can ask if this is representable: is there an object vVv \in V such that there's a natural isomorphism

C(c,v)[K,V](W,C(c,F())]  ? C(c,v) \cong [K,V](W,C(c,F(-))] \; ?

If there is, we say vv is the weighted limit of the diagram FF with the weight WW.

view this post on Zulip John Baez (Dec 15 2020 at 21:55):

If this seems confusing, it's probably good to start with some examples where V=SetV = \mathsf{Set}!

view this post on Zulip Fawzi Hreiki (Dec 15 2020 at 22:15):

Thanks a lot for this - I'm slowly starting to get to grips.

view this post on Zulip Dan Doel (Dec 15 2020 at 22:28):

Wasn't the original complaint with this that [K,V](W,C(c,F()))K,V is actually defined to be an end?

view this post on Zulip Dan Doel (Dec 15 2020 at 22:29):

At least, sometimes you see that.

view this post on Zulip Dan Doel (Dec 15 2020 at 22:31):

In fact, if you click through, that is how the nlab defines it.

view this post on Zulip Dan Doel (Dec 15 2020 at 22:36):

So you need to bootstrap yourself with ends in VV, or unpack those into the definition of the VV-enriched functor category.

view this post on Zulip Fawzi Hreiki (Dec 15 2020 at 23:09):

Thats true, although once worked out, the definition of the enriched functor category 'in components' is actually fairly understandable. Pedagogically, it should be possible to develop enriched category theory that way, only defining (co)ends once you get to weighted limits - and that's what Borceux does in his chapter on enriched categories.

Nonetheless, reading around, it seems that (co)ends are an extremely useful computational tool. Comparing proofs in Borceux and in Kelly's book, Borceux, in some places, has pages and pages of equalisers and coequalisers that could be reexpressed as (co)ends I think.

view this post on Zulip Dan Doel (Dec 15 2020 at 23:18):

Yeah, (co)ends are nice. I think I've never used weighted (co)limits.

view this post on Zulip Dan Doel (Dec 15 2020 at 23:18):

Not that I do anything fancy, of course.

view this post on Zulip John Baez (Dec 15 2020 at 23:28):

Okay, so you're saying the V-category of V-functors between two V-categories is defined using V-enriched ends.

So then you need to understand at least that one case of ends to understand weighted V-limits.

Luckily this particular case of ends is pretty approachable.

But in the end, I guess you need to understand ends.

view this post on Zulip Eric Forgy (Dec 15 2020 at 23:31):

image.png

view this post on Zulip Dan Doel (Dec 15 2020 at 23:31):

I assume you can define the functor category directly, talking about the covariant actions stuff in the nlab section on ends in VV to define V-natural transformations. Then define weighted (co)limits in terms of just that.

view this post on Zulip Dan Doel (Dec 15 2020 at 23:33):

But nlab does the opposite, and basically defines a V-natural transformation to be an end.

view this post on Zulip Fawzi Hreiki (Dec 15 2020 at 23:41):

No, a V-natural transformation is just a V-natural transformation - no ends or equalisers or whatever required. Where things get complicated is with V-enriched functor categories. You can define the unenriched functor category but the trick is to define an enriched functor category such that its underlying category is the unenriched functor category.

view this post on Zulip Fawzi Hreiki (Dec 15 2020 at 23:42):

You can do that directly by using limits in the enriching category, or taking a detour via (co)ends.

view this post on Zulip Dan Doel (Dec 15 2020 at 23:45):

Oh right. Defining VV-natural transformations doesn't do you good directly, because you need to collect them into an object of VV.

view this post on Zulip Dan Doel (Dec 15 2020 at 23:47):

And the end is how they're defining that object.

view this post on Zulip Fawzi Hreiki (Dec 15 2020 at 23:49):

Yeah, although its a proposition-definition, because you still have to show that this gives the object of natural transformations, but that's not too hard.

view this post on Zulip Matteo Capucci (he/him) (Dec 16 2020 at 09:54):

Something I've never seen (not that I've tried too hard to look for it, actually) is a definition of composition for the V-enriched functor categories defined as ends
Let C,D\mathbf C, \mathbf D be V-enriched categories. Then [C,D][\mathbf C, \mathbf D] is V-enriched with hom-objects

[C,D](F,G)=c[Fc,Gc][\mathbf C, \mathbf D](F,G) = \int_c [Fc, Gc]

where [,][-,-] is V's internal hom (secondary question here: the nlab uses V(,)V(-,-) in this end, but does it even typecheck?).
Now to define composition [C,D](F,G)[C,D](G,H)[C,D](F,H)\mathbf C, \mathbf D \otimes \mathbf C, \mathbf D \to \mathbf C, \mathbf D one should define a map

(c[Fc,Gc])(c[Gc,Hc])c[Fc,Hc]\left(\int_c [Fc, Gc] \right)\otimes \left( \int_{c'} [Gc', Hc'] \right) \longrightarrow \int_{c''} [Fc'', Hc'']

Any ideas on how to do it?

view this post on Zulip Fawzi Hreiki (Dec 16 2020 at 11:09):

Your square bracket notation [F,G][F, G] for the object of natural transformations [C,D](F,G)\mathscr{C}, \mathscr{D} is kind of confusing since it looks like some sort of internal hom, which it isn't (since [C,D](F,G)\mathscr{C}, \mathscr{D} lives in V\mathscr{V}, not in the enriched functor category [C,D][\mathscr{C}, \mathscr{D}] itself).

view this post on Zulip Matteo Capucci (he/him) (Dec 16 2020 at 11:25):

You're right, let me fix it

view this post on Zulip Fawzi Hreiki (Dec 16 2020 at 12:45):

Regarding composition, you can check out chapter 2 of http://www.tac.mta.ca/tac/reprints/articles/10/tr10.pdf

view this post on Zulip fosco (Dec 21 2020 at 09:20):

Matteo Capucci said:

Now to define composition [C,D](F,G)[C,D](G,H)[C,D](F,H)\mathbf C, \mathbf D \otimes \mathbf C, \mathbf D \to \mathbf C, \mathbf D one should define a map

(c[Fc,Gc])(c[Gc,Hc])c[Fc,Hc]\left(\int_c [Fc, Gc] \right)\otimes \left( \int_{c'} [Gc', Hc'] \right) \longrightarrow \int_{c''} [Fc'', Hc'']

Any ideas on how to do it?

It's easy if you think about it: at any given object xx you can fall from (c[Fc,Gc])(c[Gc,Hc])\left(\int_c [Fc, Gc] \right)\otimes \left( \int_{c'} [Gc', Hc'] \right) into [Fx,Gx][Gx,Hx][Fx, Gx]\otimes [Gx, Hx], and this family of maps αx\alpha_x evidently is a wedge for [F,H][F,H]. Now, by the universal property of the end...

view this post on Zulip Matteo Capucci (he/him) (Dec 21 2020 at 18:15):

Indeed, that's what I realized when I followed @Fawzi Hreiki's reference, which is also something I should have looked up before posting my question :joy:

view this post on Zulip Matteo Capucci (he/him) (Dec 21 2020 at 18:16):

@fosco I got so used to think about ends 'synthetically' (i.e. Use only their computational properties) that sometimes I forgot/I refuse to use their universal property!

view this post on Zulip fosco (Dec 21 2020 at 19:37):

@Matteo Capucci All is forgiven, don't worry :grinning:

view this post on Zulip Fawzi Hreiki (Dec 21 2020 at 22:39):

@Matteo Capucci wouldn’t ‘synthetically’ mean with their universal property and ‘analytically’ mean computationally?

view this post on Zulip Dan Doel (Dec 21 2020 at 22:46):

Synthetically should almost certainly include the universal property. Presumably what was meant was various equivalences that probably ultimately can stem from the universal property.

view this post on Zulip Matteo Capucci (he/him) (Dec 22 2020 at 07:38):

The meaning of 'synthetic' and 'analytic' is debatable to a certain extent, though they usually mean 'axiomatically construed' vs 'assembled from pre-existing things'.
The universal property is a construction from pre-existing things, imo. Compare this with 'cartesian products' vs 'monoidal products'.
I do agree that universal properties themselves can be seen as synthetic version of products, but here we are working a level higher than that.

view this post on Zulip Nathanael Arkor (Dec 22 2020 at 12:12):

The universal property is the axiomatic definition (essentially by definition). You should be able to derive all the properties of a construction from the universal property, not the other way around.

view this post on Zulip Matteo Capucci (he/him) (Dec 22 2020 at 12:14):

Yeah, I'm talking one level higher than that. I think I use 'synthetic' as 'formal' in 'formal category theory'